/haiku-buildtools/gcc/libgcc/config/sh/ |
H A D | lib1funcs-4-300.S | 35 div1 with case distinction for larger divisors in three more ranges. 60 div1 r5,r1 64 div1 r5,r1 68 div1 r5,r1 72 div1 r5,r1 76 div1 r5,r1 80 div1 r5,r1 84 div1 r5,r1 88 div1 r5,r1 109 div1 r [all...] |
H A D | lib1funcs-Os-4-200.S | 139 div1 r5,r1 173 div1 r5,r4 175 div1 r5,r4 176 div1 r5,r4 178 div1 r5,r4 183 div1 r5,r4 185 div1 r5,r4 193 div1 r5,r4 195 div1 r5,r4; div1 r [all...] |
H A D | lib1funcs.S | 1327 div1 r0,r3 1329 div1 r0,r3 1331 div1 r0,r3 1333 div1 r0,r3 1335 div1 r0,r3 1337 div1 r0,r3 1339 div1 r0,r3 1341 div1 r0,r3 1343 div1 r0,r3 1345 div1 r [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | divmod-1.c | 0 div1 (signed char x) 55 if (div1 (-(1 << 7)) != 1 << 7) 1 div1 (signed char x) function
|
/haiku-buildtools/legacy/gcc/gcc/config/sh/ |
H A D | lib1funcs.asm | 931 div1 r0,r3 933 div1 r0,r3 935 div1 r0,r3 937 div1 r0,r3 939 div1 r0,r3 941 div1 r0,r3 943 div1 r0,r3 945 div1 r0,r3 947 div1 r0,r3 949 div1 r [all...] |
/haiku-buildtools/gcc/gmp/mpn/generic/ |
H A D | hgcd2.c | 36 div1 (mp_ptr rp, function 357 mp_limb_t q = div1 (&r, ah, bh); 388 mp_limb_t q = div1 (&r, bh, ah);
|
/haiku-buildtools/isl/ |
H A D | isl_local_space_private.h | 26 __isl_give isl_mat *isl_merge_divs(__isl_keep isl_mat *div1,
|
H A D | isl_local_space.c | 493 * For each row i in div1, exp1[i] is set to the position of the corresponding 500 __isl_give isl_mat *isl_merge_divs(__isl_keep isl_mat *div1, argument 507 if (!div1 || !div2) 510 d = div1->n_col - div1->n_row; 511 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row, 512 d + div1->n_row + div2->n_row); 516 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) { 519 expand_row(div, k, div1, [all...] |
H A D | isl_polynomial.c | 1189 static int compatible_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2) argument 1194 isl_assert(div1->ctx, div1->n_row >= div2->n_row && 1195 div1->n_col >= div2->n_col, return -1); 1197 if (div1->n_row == div2->n_row) 1198 return isl_mat_is_equal(div1, div2); 1200 n_row = div1->n_row; 1201 n_col = div1->n_col; 1202 div1->n_row = div2->n_row; 1203 div1 [all...] |
H A D | isl_map_simplify.c | 2825 /* Given a pair of divs div1 and div2 such that, expect for the lower bound l 2826 * and the upper bound u, div1 always occurs together with div2 in the form 2827 * (div1 + m div2), where m is the constant range on the variable div1 2828 * allowed by l and u, replace the pair div1 and div2 by a single 2829 * div that is equal to div1 + m div2. 2833 * div2 = (div - div1) / m 2834 * (If a constraint does not contain div2, it will also not contain div1.) 2835 * If the constraint also contains div1, then we know they appear 2836 * as f (div1 2871 coalesce_divs(struct isl_basic_map *bmap, unsigned div1, unsigned div2, unsigned l, unsigned u) argument [all...] |
/haiku-buildtools/gcc/libgcc/config/fr30/ |
H A D | lib1funcs.S | 39 div1 \reg
|
/haiku-buildtools/binutils/gas/testsuite/gas/fr30/ |
H A D | allinsn.s | 110 .global div1 111 div1: label 112 div1 r5
|
H A D | allinsn.d | 114 0+004e <div1>: 115 4e: 97 65 div1 r5
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/fr30/ |
H A D | allinsn.s | 110 .global div1 111 div1: label 112 div1 r5
|
H A D | allinsn.d | 114 0+004e <div1>: 115 4e: 97 65 div1 r5
|
/haiku-buildtools/binutils/gas/testsuite/gas/mips/ |
H A D | r5900-full.d | 38 [0-9a-f]+ <[^>]*> 703f001a div1 \$0,\$1,\$31 39 [0-9a-f]+ <[^>]*> 73e1001a div1 \$0,\$31,\$1
|
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/sh/arch/ |
H A D | sh.s | 40 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh2.s | 53 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh2a-nofpu-or-sh3-nommu.s | 48 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh2a-nofpu-or-sh4-nommu-nofpu.s | 47 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh2a-or-sh3e.s | 47 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh2e.s | 82 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh3-nommu.s | 58 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh3.s | 47 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|
H A D | sh3e.s | 46 div1 r5,r4 ;!/* 0011nnnnmmmm0100 div1 <REG_M>,<REG_N>*/{"div1",{ A_REG_M,A_REG_N},{HEX_3,REG_N,REG_M,HEX_4}, arch_sh_up}
|