/haiku-buildtools/gcc/libgcc/config/arm/ |
H A D | bpabi.c | 34 long long *remainder) 39 *remainder = a - b * quotient; 32 __gnu_ldivmod_helper(long long a, long long b, long long *remainder) argument
|
/haiku-buildtools/gcc/libgcc/config/tilepro/ |
H A D | softdivide.c | 1 /* Division and remainder routines for Tile. 76 in the inner loop and just right shift by clz(remainder). */ 82 uint32_t remainder = dividend; local 84 while (remainder >= divisor) 86 int shift = __insn_clz (remainder); 90 int too_big = (scaled_divisor > remainder); 93 remainder -= scaled_divisor; 138 uint64_t remainder = dividend; local 140 while (remainder >= divisor) 142 int shift = __builtin_clzll (remainder); 191 uint32_t remainder = dividend; local 232 uint64_t remainder = dividend; local 324 uint32_t remainder = __umodsi3_inline (ABS (dividend), ABS (divisor)); local 350 uint64_t remainder = __umoddi3_inline (ABS (dividend), ABS (divisor)); local [all...] |
/haiku-buildtools/gcc/gmp/tests/mpz/ |
H A D | t-fdiv.c | 35 mpz_t quotient, remainder; local 56 mpz_init (remainder); 87 mpz_fdiv_qr (quotient, remainder, dividend, divisor); 95 if (mpz_cmp (remainder, remainder2) != 0) 104 /* Check if the remainder has the same sign as the divisor 106 if (mpz_cmp_ui (remainder, 0) != 0) 107 if ((mpz_cmp_ui (remainder, 0) < 0) != (mpz_cmp_ui (divisor, 0) < 0)) 111 mpz_add (temp, temp, remainder); 116 mpz_abs (remainder, remainder); [all...] |
H A D | t-tdiv.c | 35 mpz_t quotient, remainder; local 55 mpz_init (remainder); 86 mpz_tdiv_qr (quotient, remainder, dividend, divisor); 94 if (mpz_cmp (remainder, remainder2) != 0) 103 /* Check if the remainder has the same sign as the dividend 105 if (mpz_cmp_ui (remainder, 0) != 0) 106 if ((mpz_cmp_ui (remainder, 0) < 0) != (mpz_cmp_ui (dividend, 0) < 0)) 110 mpz_add (temp, temp, remainder); 115 mpz_abs (remainder, remainder); [all...] |
H A D | t-cdiv_ui.c | 35 mpz_t quotient, remainder; local 57 mpz_init (remainder); 85 r_rq = mpz_cdiv_qr_ui (quotient, remainder, dividend, divisor); 95 if (mpz_cmp (remainder, remainder2) != 0) 105 /* Check if the remainder has the opposite sign as the (positive) divisor 107 if (mpz_cmp_ui (remainder, 0) != 0) 108 if (mpz_cmp_ui (remainder, 0) > 0) 109 dump_abort ("remainder sign wrong", dividend, divisor); 112 mpz_add (temp, temp, remainder); 116 mpz_abs (remainder, remainde [all...] |
H A D | t-fdiv_ui.c | 35 mpz_t quotient, remainder; local 57 mpz_init (remainder); 85 r_rq = mpz_fdiv_qr_ui (quotient, remainder, dividend, divisor); 95 if (mpz_cmp (remainder, remainder2) != 0) 105 /* Check if the remainder has the same sign as the (positive) divisor 107 if (mpz_cmp_ui (remainder, 0) != 0) 108 if (mpz_cmp_ui (remainder, 0) < 0) 109 dump_abort ("remainder sign wrong", dividend, divisor); 112 mpz_add (temp, temp, remainder); 116 mpz_abs (remainder, remainde [all...] |
H A D | t-tdiv_ui.c | 35 mpz_t quotient, remainder; local 57 mpz_init (remainder); 85 r_rq = mpz_tdiv_qr_ui (quotient, remainder, dividend, divisor); 95 if (mpz_cmp (remainder, remainder2) != 0) 105 /* Check if the remainder has the same sign as the dividend 107 if (mpz_cmp_ui (remainder, 0) != 0) 108 if ((mpz_cmp_ui (remainder, 0) < 0) != (mpz_cmp_ui (dividend, 0) < 0)) 109 dump_abort ("remainder sign wrong", dividend, divisor); 112 mpz_add (temp, temp, remainder); 116 mpz_abs (remainder, remainde [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | builtins-40.c | 4 remainder, remainderf and remainderl 16 extern double remainder(double, double); 42 return remainder(x, y);
|
H A D | c99-tgmath-1.c | 199 #ifndef remainder 200 #error remainder undefined
|
/haiku-buildtools/legacy/gcc/gcc/config/sparc/ |
H A D | lb1spc.asm | 84 * Division and remainder, from Appendix E of the Sparc Version 8 105 * R the remainder so far, initially the dividend 254 ! remainder is positive 259 ! remainder is positive 264 ! remainder is positive 269 ! remainder is positive 275 ! remainder is negative 282 ! remainder is negative 287 ! remainder is positive 293 ! remainder i [all...] |
/haiku-buildtools/gcc/libgcc/config/sparc/ |
H A D | lb1spc.S | 84 * Division and remainder, from Appendix E of the SPARC Version 8 105 * R the remainder so far, initially the dividend 254 ! remainder is positive 259 ! remainder is positive 264 ! remainder is positive 269 ! remainder is positive 275 ! remainder is negative 282 ! remainder is negative 287 ! remainder is positive 293 ! remainder i [all...] |
/haiku-buildtools/gcc/gmp/mpn/arm/ |
H A D | udiv.asm | 2 dnl Return quotient and store remainder through a supplied pointer. 51 str n1, [ rem_ptr ] C store remainder 82 adds n1, n1, n0 C fix remainder for omitted divisor lsb 84 subcs n1, n1, d C adjust remainder accordingly 85 cmp n1, d C remainder >= divisor? 86 subcs n1, n1, d C adjust remainder 90 str n1, [ rem_ptr ] C store remainder
|
/haiku-buildtools/gcc/gmp/mpn/pa64/ |
H A D | udiv.asm | 76 std n1,0(remptr) C store remainder 99 add,*nuv n1,q,n1 C fix remainder for omitted divisor lsb 100 add,l n1,dn,n1 C adjust remainder if rem. fix carried 103 sub,*<< n1,d,%r0 C remainder >= divisor? 104 add,l n1,dn,n1 C adjust remainder 113 std n1,0(remptr) C store remainder
|
/haiku-buildtools/gcc/libcilkrts/runtime/ |
H A D | cilk_fiber-unix.cpp | 265 size_t remainder = rounded_stack_size % s_page_size; 266 if (remainder) { 267 rounded_stack_size += s_page_size - remainder;
|
/haiku-buildtools/gcc/libgcc/config/fr30/ |
H A D | lib1funcs.S | 72 ;; Perform an unsiged division of r4 / r5 and places the remainder in r4. 84 ;; Perform a siged division of r4 / r5 and place the remainder in r4.
|
/haiku-buildtools/jam/ |
H A D | expand.c | 125 * stuff-in-outbuf $(variable) remainder 166 * stuff-in-outbuf $(variable) remainder 177 * so may each value for '$(variable element)', and so may 'remainder'. 183 LIST *remainder = 0; local 191 remainder = var_expand( L0, in, end, lol, 0 ); 314 /* If no remainder, append result to output chain. */ 322 /* For each remainder, append the complete string */ 325 /* we can just tack on each instance of 'remainder' */ 329 for( rem = remainder; rem; rem = list_next( rem ) ) 342 /* variables & remainder wer [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | expmed.c | 2856 You may request either the quotient or the remainder as the result; 2857 specify REM_FLAG nonzero to get the remainder. 2863 /* ??? For CEIL_MOD_EXPR, can compute incorrect remainder with ANDI 2873 E.g. to calculate the remainder of a division by 3 with a 32 bit 2879 amount, the remainder stays the same: 2904 rtx quotient = 0, remainder = 0; 2927 QUOTIENT. The case for trunc division/remainder might leave quotient = 0, 2931 REM_FLAG is set, the remainder is computed as OP0 - QUOTIENT * OP1. If 2934 We try to generate special code for division and remainder when OP1 is a 2944 If what we actually want is the remainder, w 2891 rtx quotient = 0, remainder = 0; local [all...] |
/haiku-buildtools/gcc/libgcc/config/avr/ |
H A D | lib1funcs.S | 1342 Division 8 / 8 => (result + remainder) 1344 #define r_rem r25 /* remainder */ 1351 sub r_rem,r_rem ; clear remainder and carry 1355 rol r_rem ; shift dividend into remainder 1356 cp r_rem,r_arg2 ; compare remainder & divisor 1357 brcs __udivmodqi4_ep ; remainder <= divisor 1358 sub r_rem,r_arg2 ; restore remainder 1380 neg r_rem ; correct remainder sign 1396 Division 16 / 16 => (result + remainder) 1398 #define r_remL r26 /* remainder Lo [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | expmed.c | 3872 You may request either the quotient or the remainder as the result; 3873 specify REM_FLAG nonzero to get the remainder. 3879 /* ??? For CEIL_MOD_EXPR, can compute incorrect remainder with ANDI 3889 E.g. to calculate the remainder of a division by 3 with a 32 bit 3895 amount, the remainder stays the same: 3914 rtx quotient = 0, remainder = 0; 3943 QUOTIENT. The case for trunc division/remainder might leave quotient = 0, 3947 REM_FLAG is set, the remainder is computed as OP0 - QUOTIENT * OP1. If 3950 We try to generate special code for division and remainder when OP1 is a 3960 If what we actually want is the remainder, w 3901 rtx quotient = 0, remainder = 0; local [all...] |
H A D | wide-int.h | 2525 WI_BINARY_RESULT_VAR (remainder, remainder_val, T1, x, T2, y); 2536 remainder.set_len (remainder_len); 2537 if (wi::neg_p (x, sgn) != wi::neg_p (y, sgn) && remainder != 0) 2567 WI_BINARY_RESULT_VAR (remainder, remainder_val, T1, x, T2, y); 2578 remainder.set_len (remainder_len); 2579 if (wi::neg_p (x, sgn) == wi::neg_p (y, sgn) && remainder != 0) 2592 WI_BINARY_RESULT_VAR (remainder, remainder_val, T1, x, T2, y); 2603 remainder.set_len (remainder_len); 2605 if (remainder != 0) 2609 WI_BINARY_RESULT (T1, T2) abs_remainder = wi::abs (remainder); [all...] |
H A D | wide-int.cc | 1601 unsigned HOST_WIDE_INT rhat; /* A remainder. */ 1695 of the remainder there and store the number of blocks in 1700 HOST_WIDE_INT *remainder, 1744 if (remainder) 1747 remainder[0] = 0; 1776 if (remainder) 1778 remainder[0] = 0; 1787 if (remainder) 1789 remainder[0] = o0 % o1; 1815 if (remainder) [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/8_c_compatibility/cmath/ |
H A D | overloads.cc | 210 check_ret_type<double>(std::tr1::remainder(d0, d0)); 211 check_ret_type<double>(std::tr1::remainder(d0, f0)); 212 check_ret_type<float>(std::tr1::remainder(f0, f0)); 213 check_ret_type<long double>(std::tr1::remainder(ld0, ld0)); 214 check_ret_type<long double>(std::tr1::remainder(ld0, d0)); 215 check_ret_type<double>(std::tr1::remainder(i0, i0)); 216 check_ret_type<double>(std::tr1::remainder(d0, i0));
|
/haiku-buildtools/gcc/gmp/mpn/x86/k6/ |
H A D | pre_mod_1.asm | 1 dnl AMD K6 mpn_preinv_mod_1 -- mpn by 1 remainder, with pre-inverted divisor. 125 C of q*d is simply -d and the remainder n-q*d = n10+d. This is rarely
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/26_numerics/headers/cmath/ |
H A D | overloads_c++0x_neg.cc | 55 template Foo std::remainder<Foo, Foo>(Foo, Foo); // { dg-error "not match" }
|
/haiku-buildtools/gcc/gmp/mpn/sparc32/v9/ |
H A D | udiv.asm | 38 st %g2, [%o0] C store remainder
|