Searched refs:divisor (Results 1 - 25 of 106) sorted by relevance

12345

/haiku-buildtools/gcc/gmp/mpz/
H A Dcdiv_r.c25 mpz_cdiv_r (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) argument
27 mp_size_t divisor_size = divisor->_mp_size;
33 /* We need the original value of the divisor after the remainder has been
36 if (rem == divisor)
40 mpz_set (temp_divisor, divisor);
41 divisor = temp_divisor;
44 mpz_tdiv_r (rem, dividend, divisor);
47 mpz_sub (rem, rem, divisor);
H A Dfdiv_r.c25 mpz_fdiv_r (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) argument
27 mp_size_t divisor_size = divisor->_mp_size;
33 /* We need the original value of the divisor after the remainder has been
36 if (rem == divisor)
39 mpz_set (temp_divisor, divisor);
40 divisor = temp_divisor;
43 mpz_tdiv_r (rem, dividend, divisor);
46 mpz_add (rem, rem, divisor);
H A Dmod.c25 mpz_mod (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) argument
27 mp_size_t divisor_size = divisor->_mp_size;
33 /* We need the original value of the divisor after the remainder has been
36 if (rem == divisor)
39 mpz_set (temp_divisor, divisor);
40 divisor = temp_divisor;
43 mpz_tdiv_r (rem, dividend, divisor);
49 if (divisor->_mp_size < 0)
50 mpz_sub (rem, rem, divisor);
52 mpz_add (rem, rem, divisor);
[all...]
H A Dcdiv_qr.c25 mpz_cdiv_qr (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) argument
27 mp_size_t divisor_size = divisor->_mp_size;
34 /* We need the original value of the divisor after the quotient and
37 if (quot == divisor || rem == divisor)
40 mpz_set (temp_divisor, divisor);
41 divisor = temp_divisor;
45 mpz_tdiv_qr (quot, rem, dividend, divisor);
50 mpz_sub (rem, rem, divisor);
H A Dfdiv_qr.c25 mpz_fdiv_qr (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) argument
27 mp_size_t divisor_size = divisor->_mp_size;
34 /* We need the original value of the divisor after the quotient and
37 if (quot == divisor || rem == divisor)
40 mpz_set (temp_divisor, divisor);
41 divisor = temp_divisor;
45 mpz_tdiv_qr (quot, rem, dividend, divisor);
50 mpz_add (rem, rem, divisor);
H A Dtdiv_ui.c26 mpz_tdiv_ui (mpz_srcptr dividend, unsigned long int divisor) argument
32 if (divisor == 0)
45 if (divisor > GMP_NUMB_MAX)
59 dp[0] = divisor & GMP_NUMB_MASK;
60 dp[1] = divisor >> GMP_NUMB_BITS;
70 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
H A Dcdiv_q.c25 mpz_cdiv_q (mpz_ptr quot, mpz_srcptr dividend, mpz_srcptr divisor) argument
28 mp_size_t divisor_size = divisor->_mp_size;
36 mpz_tdiv_qr (quot, rem, dividend, divisor);
H A Dfdiv_q.c25 mpz_fdiv_q (mpz_ptr quot, mpz_srcptr dividend, mpz_srcptr divisor) argument
28 mp_size_t divisor_size = divisor->_mp_size;
36 mpz_tdiv_qr (quot, rem, dividend, divisor);
H A Dcdiv_q_ui.c27 mpz_cdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor) argument
33 if (divisor == 0)
49 if (divisor > GMP_NUMB_MAX)
61 dp[0] = divisor & GMP_NUMB_MASK;
62 dp[1] = divisor >> GMP_NUMB_BITS;
71 rl = divisor - rl;
79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
84 rl = divisor - rl;
H A Dcdiv_r_ui.c28 mpz_cdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) argument
34 if (divisor == 0)
47 if (divisor > GMP_NUMB_MAX)
65 dp[0] = divisor & GMP_NUMB_MASK;
66 dp[1] = divisor >> GMP_NUMB_BITS;
75 rl = divisor - rl;
86 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
92 rl = divisor - rl;
H A Dcdiv_ui.c28 mpz_cdiv_ui (mpz_srcptr dividend, unsigned long int divisor) argument
34 if (divisor == 0)
46 if (divisor > GMP_NUMB_MAX)
61 dp[0] = divisor & GMP_NUMB_MASK;
62 dp[1] = divisor >> GMP_NUMB_BITS;
71 rl = divisor - rl;
81 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
87 rl = divisor - rl;
H A Dfdiv_q_ui.c26 mpz_fdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor) argument
32 if (divisor == 0)
48 if (divisor > GMP_NUMB_MAX)
60 dp[0] = divisor & GMP_NUMB_MASK;
61 dp[1] = divisor >> GMP_NUMB_BITS;
70 rl = divisor - rl;
78 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
83 rl = divisor - rl;
H A Dfdiv_r_ui.c26 mpz_fdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) argument
32 if (divisor == 0)
45 if (divisor > GMP_NUMB_MAX)
63 dp[0] = divisor & GMP_NUMB_MASK;
64 dp[1] = divisor >> GMP_NUMB_BITS;
73 rl = divisor - rl;
84 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
90 rl = divisor - rl;
H A Dfdiv_ui.c26 mpz_fdiv_ui (mpz_srcptr dividend, unsigned long int divisor) argument
32 if (divisor == 0)
44 if (divisor > GMP_NUMB_MAX)
59 dp[0] = divisor & GMP_NUMB_MASK;
60 dp[1] = divisor >> GMP_NUMB_BITS;
69 rl = divisor - rl;
79 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
85 rl = divisor - rl;
H A Ddive_ui.c24 mpz_divexact_ui (mpz_ptr dst, mpz_srcptr src, unsigned long divisor) argument
29 if (divisor == 0)
34 if (divisor > GMP_NUMB_MAX)
40 mpz_set_ui (dz, divisor);
56 MPN_DIVREM_OR_DIVEXACT_1 (dst_ptr, PTR(src), abs_size, (mp_limb_t) divisor);
/haiku-buildtools/gcc/libgcc/config/tilepro/
H A Dsoftdivide.c40 __udivsi3_inline (uint32_t dividend, uint32_t divisor) argument
42 /* Divide out any power of two factor from dividend and divisor.
43 Note that when dividing by zero the divisor will remain zero,
45 const int power_of_two_factor = __insn_ctz (divisor);
46 divisor >>= power_of_two_factor;
50 if (divisor <= 1)
52 if (divisor == 0)
77 const int divisor_clz = __insn_clz (divisor);
78 const uint32_t max_divisor = divisor << divisor_clz;
84 while (remainder >= divisor)
103 __udivdi3_inline(uint64_t dividend, uint64_t divisor) argument
159 __umodsi3_inline(uint32_t dividend, uint32_t divisor) argument
207 __umoddi3_inline(uint64_t dividend, uint64_t divisor) argument
248 __udivsi3(uint32_t dividend, uint32_t divisor) argument
265 __divsi3(int32_t dividend, int32_t divisor) argument
283 __udivdi3(uint64_t dividend, uint64_t divisor) argument
293 __divdi3(int64_t dividend, int64_t divisor) argument
306 __umodsi3(uint32_t dividend, uint32_t divisor) argument
321 __modsi3(int32_t dividend, int32_t divisor) argument
337 __umoddi3(uint64_t dividend, uint64_t divisor) argument
348 __moddi3(int64_t dividend, int64_t divisor) argument
[all...]
/haiku-buildtools/gcc/gmp/tests/mpz/
H A Dt-fdiv.c34 mpz_t dividend, divisor; local
54 mpz_init (divisor);
70 mpz_rrandomb (divisor, rands, divisor_size);
72 while (mpz_sgn (divisor) == 0);
83 mpz_neg (divisor, divisor);
85 /* printf ("%ld %ld\n", SIZ (dividend), SIZ (divisor)); */
87 mpz_fdiv_qr (quotient, remainder, dividend, divisor);
88 mpz_fdiv_q (quotient2, dividend, divisor);
89 mpz_fdiv_r (remainder2, dividend, divisor);
135 dump_abort(mpz_t dividend, mpz_t divisor) argument
[all...]
H A Dt-tdiv.c34 mpz_t dividend, divisor; local
53 mpz_init (divisor);
69 mpz_rrandomb (divisor, rands, divisor_size);
71 while (mpz_sgn (divisor) == 0);
82 mpz_neg (divisor, divisor);
84 /* printf ("%ld %ld\n", SIZ (dividend), SIZ (divisor)); */
86 mpz_tdiv_qr (quotient, remainder, dividend, divisor);
87 mpz_tdiv_q (quotient2, dividend, divisor);
88 mpz_tdiv_r (remainder2, dividend, divisor);
134 dump_abort(mpz_t dividend, mpz_t divisor) argument
[all...]
H A Dt-cdiv_ui.c39 unsigned long divisor; local
70 divisor = mpz_get_ui (bs);
72 while (divisor == 0);
85 r_rq = mpz_cdiv_qr_ui (quotient, remainder, dividend, divisor);
86 r_q = mpz_cdiv_q_ui (quotient2, dividend, divisor);
87 r_r = mpz_cdiv_r_ui (remainder2, dividend, divisor);
88 r = mpz_cdiv_ui (dividend, divisor);
94 dividend, divisor);
97 dividend, divisor);
103 dump_abort ("quotient sign wrong", dividend, divisor);
147 dump_abort(char *str, mpz_t dividend, unsigned long divisor) argument
[all...]
H A Dt-fdiv_ui.c39 unsigned long divisor; local
70 divisor = mpz_get_ui (bs);
72 while (divisor == 0);
85 r_rq = mpz_fdiv_qr_ui (quotient, remainder, dividend, divisor);
86 r_q = mpz_fdiv_q_ui (quotient2, dividend, divisor);
87 r_r = mpz_fdiv_r_ui (remainder2, dividend, divisor);
88 r = mpz_fdiv_ui (dividend, divisor);
94 dividend, divisor);
97 dividend, divisor);
103 dump_abort ("quotient sign wrong", dividend, divisor);
147 dump_abort(char *str, mpz_t dividend, unsigned long divisor) argument
[all...]
H A Dt-tdiv_ui.c39 unsigned long divisor; local
70 divisor = mpz_get_ui (bs);
72 while (divisor == 0);
85 r_rq = mpz_tdiv_qr_ui (quotient, remainder, dividend, divisor);
86 r_q = mpz_tdiv_q_ui (quotient2, dividend, divisor);
87 r_r = mpz_tdiv_r_ui (remainder2, dividend, divisor);
88 r = mpz_tdiv_ui (dividend, divisor);
94 dividend, divisor);
97 dividend, divisor);
103 dump_abort ("quotient sign wrong", dividend, divisor);
147 dump_abort(char *str, mpz_t dividend, unsigned long divisor) argument
[all...]
/haiku-buildtools/gcc/gmp/mpn/sparc64/
H A Ddive_1.c31 /* 64-bit divisor 32-bit divisor
38 /* There are two key ideas here to reduce mulx's. Firstly when the divisor
40 cross-products involving the high 32-bits of the divisor, that being zero
47 For a 32-bit divisor and small sizes, an attempt was made at a simple
55 mpn_divexact_1 (mp_ptr dst, mp_srcptr src, mp_size_t size, mp_limb_t divisor) argument
63 ASSERT (divisor != 0);
66 ASSERT_LIMB (divisor);
72 *dst = s / divisor;
76 if ((divisor
[all...]
/haiku-buildtools/gcc/gmp/mpn/generic/
H A Ddive_1.c30 /* Divide a={src,size} by d=divisor and store the quotient in q={dst,size}.
48 When the divisor is even, the factors of two could be handled with a
61 If src[size-1] < divisor then dst[size-1] will be zero, and one divide
62 step could be skipped. A test at last step for s<divisor (or ls in the
67 mpn_divexact_1 (mp_ptr dst, mp_srcptr src, mp_size_t size, mp_limb_t divisor) argument
74 ASSERT (divisor != 0);
77 ASSERT_LIMB (divisor);
83 dst[0] = s / divisor;
87 if ((divisor & 1) == 0)
89 count_trailing_zeros (shift, divisor);
[all...]
/haiku-buildtools/gcc/gmp/mpn/alpha/
H A Ddive_1.c49 mpn_divexact_1 (mp_ptr dst, mp_srcptr src, mp_size_t size, mp_limb_t divisor) argument
55 ASSERT (divisor != 0);
58 ASSERT_LIMB (divisor);
64 if ((divisor & 1) == 0)
66 count_trailing_zeros (rshift, divisor);
68 divisor >>= rshift;
71 binvert_limb (inverse, divisor);
93 umul_ppmm (h, dummy, q, divisor);
/haiku-buildtools/gcc/gmp/
H A Dcompat.c37 __MPN (divmod_1) (mp_ptr dst, mp_srcptr src, mp_size_t size, mp_limb_t divisor) argument
39 return mpn_divmod_1 (dst, src, size, divisor);

Completed in 63 milliseconds

12345