Searched refs:div2 (Results 1 - 12 of 12) sorted by relevance
| /haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
| H A D | divmod-1.c | 6 div2 (signed short x) function
57 if (div2 (-(1 << 15)) != 1 << 15)
|
| /haiku-buildtools/gcc/libgcc/config/fr30/ |
| H A D | lib1funcs.S | 62 div2 r5
89 div2 r5
|
| /haiku-buildtools/gcc/gmp/mpn/generic/ |
| H A D | hgcd2.c | 90 div2 (mp_ptr rp, function
148 /* This div2 uses less branches, but it seems to nevertheless be
151 div2 (mp_ptr rp,
206 The div2 function starts with checking the most significant bit of
277 mp_limb_t q = div2 (r, ah, al, bh, bl);
319 mp_limb_t q = div2 (r, bh, bl, ah, al);
|
| /haiku-buildtools/isl/ |
| H A D | isl_local_space_private.h | 27 __isl_keep isl_mat *div2, int *exp1, int *exp2);
|
| H A D | isl_local_space.c | 494 * row in the result. Similarly for div2 and exp2.
501 __isl_keep isl_mat *div2, int *exp1, int *exp2)
507 if (!div1 || !div2)
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) {
520 expand_row(div, k + 1, div2, j, exp2);
537 for (; j < div2->n_row; ++j, ++k) {
538 expand_row(div, k, div2, j, exp2);
500 isl_merge_divs(__isl_keep isl_mat *div1, __isl_keep isl_mat *div2, int *exp1, int *exp2) argument
|
| 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);
1202 div1->n_row = div2->n_row;
1203 div1->n_col = div2->n_col;
1205 equal = isl_mat_is_equal(div1, div2);
|
| 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.
2831 * The new div will appear in the location that contains div2.
2833 * div2 = (div - div1) / m
2834 * (If a constraint does not contain div2, it will also not contain div1.)
2836 * as f (div1 + m div2) and we can simply replace (div1 + m div2) b
2871 coalesce_divs(struct isl_basic_map *bmap, unsigned div1, unsigned div2, unsigned l, unsigned u) argument
[all...] |
| /haiku-buildtools/binutils/gas/testsuite/gas/fr30/ |
| H A D | allinsn.s | 113 .global div2
114 div2: label
115 div2 r6
|
| H A D | allinsn.d | 117 0+0050 <div2>:
118 50: 97 76 div2 r6
|
| /haiku-buildtools/legacy/binutils/gas/testsuite/gas/fr30/ |
| H A D | allinsn.s | 113 .global div2
114 div2: label
115 div2 r6
|
| H A D | allinsn.d | 117 0+0050 <div2>:
118 50: 97 76 div2 r6
|
| /haiku-buildtools/legacy/gcc/gcc/config/c4x/ |
| H A D | libgcc.S | 969 bge div2
973 div2: label
|
Completed in 75 milliseconds