| /src/external/gpl3/gcc/dist/libgcc/config/libbid/ |
| bid64_rem.c | 31 * scale coefficient_y so exponents are aligned
33 * coefficient_y is longer than 64 bits (clearly larger
37 * coefficient_y (64-bit integer divide), calculate remainder
65 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, res; local
76 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
110 coefficient_y) {
136 res = coefficient_y & QUIET_MASK64;;
164 // set exponent of y to exponent_x, scale coefficient_y
166 __mul_64x64_to_128 (CY, coefficient_y, T);
208 Q = coefficient_x / coefficient_y;
[all...] |
| bid64_quantize.c | 46 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, remainder_h, C64, local
64 if (!unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y)) {
73 && ((coefficient_y << 1) == 0xf000000000000000ull)) {
86 coefficient_y = 0;
88 res = 0x7c00000000000000ull | (coefficient_y & QUIET_MASK64);
|
| bid64_mul.c | 30 * if(number_digits(coefficient_x)+number_digits(coefficient_y) guaranteed
33 * coefficient_x*coefficient_y)
35 * get long product: coefficient_x*coefficient_y
61 UINT64 sign_x, sign_y, coefficient_x, coefficient_y; local
79 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
102 && !coefficient_y) {
112 BID_RETURN (coefficient_y & QUIET_MASK64);
141 BID_RETURN (coefficient_y & QUIET_MASK64);
166 tempy.d = (double) coefficient_y;
169 // magnitude estimate for coefficient_x*coefficient_y is
[all...] |
| bid64_add.c | 123 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, C64_new; local
143 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
178 res = coefficient_y & QUIET_MASK64;
193 if (((y & INFINITY_MASK64) != INFINITY_MASK64) && coefficient_y) {
209 res = coefficient_y & QUIET_MASK64;
236 coefficient_a = coefficient_y;
246 coefficient_b = coefficient_y;
|
| bid64_fma.c | 33 * get full coefficient_x*coefficient_y product
70 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, sign_z, local
90 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
166 if (!coefficient_y) {
257 if ((!coefficient_x) || (!coefficient_y)) {
288 tempy.d = (double) coefficient_y;
291 // magnitude estimate for coefficient_x*coefficient_y is
295 // check if coefficient_x*coefficient_y<2^(10*k+3)
299 C64 = coefficient_x * coefficient_y;
325 // get 128-bit product: coefficient_x*coefficient_y
[all...] |
| bid64_div.c | 30 * if(coefficient_x<coefficient_y)
31 * p = number_digits(coefficient_y) - number_digits(coefficient_x)
33 * B = coefficient_y
37 * get Q=(int)(coefficient_x/coefficient_y)
40 * Let R = coefficient_x - Q*coefficient_y
43 * B = coefficient_y
85 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, A, B, QX, PD; local
110 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
147 && !(coefficient_y)) {
179 BID_RETURN (coefficient_y & QUIET_MASK64)
[all...] |
| bid_inline_add.h | 30 * UINT64 sign_y, int exponent_y, UINT64 coefficient_y,
76 UINT64 sign_y, int exponent_y, UINT64 coefficient_y,
92 coefficient_a = coefficient_y;
102 coefficient_b = coefficient_y;
809 UINT64 CYh, CY0L, T, S, coefficient_y, remainder_y; local
1029 coefficient_y = CY.w[0] - CY0L;
1040 coefficient_y += round_const_table[rmode][extra_digits];
1042 // align coefficient_y, coefficient_x
1044 __mul_64x64_to_128 (F, coefficient_y, S);
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/ |
| bid64_rem.c | 31 * scale coefficient_y so exponents are aligned
33 * coefficient_y is longer than 64 bits (clearly larger
37 * coefficient_y (64-bit integer divide), calculate remainder
65 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, res; local
76 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
110 coefficient_y) {
136 res = coefficient_y & QUIET_MASK64;;
164 // set exponent of y to exponent_x, scale coefficient_y
166 __mul_64x64_to_128 (CY, coefficient_y, T);
208 Q = coefficient_x / coefficient_y;
[all...] |
| bid64_quantize.c | 46 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, remainder_h, C64, local
64 if (!unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y)) {
73 && ((coefficient_y << 1) == 0xf000000000000000ull)) {
86 coefficient_y = 0;
88 res = 0x7c00000000000000ull | (coefficient_y & QUIET_MASK64);
|
| bid64_mul.c | 30 * if(number_digits(coefficient_x)+number_digits(coefficient_y) guaranteed
33 * coefficient_x*coefficient_y)
35 * get long product: coefficient_x*coefficient_y
61 UINT64 sign_x, sign_y, coefficient_x, coefficient_y; local
79 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
102 && !coefficient_y) {
112 BID_RETURN (coefficient_y & QUIET_MASK64);
141 BID_RETURN (coefficient_y & QUIET_MASK64);
166 tempy.d = (double) coefficient_y;
169 // magnitude estimate for coefficient_x*coefficient_y is
[all...] |
| bid64_add.c | 123 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, C64_new; local
143 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
178 res = coefficient_y & QUIET_MASK64;
193 if (((y & INFINITY_MASK64) != INFINITY_MASK64) && coefficient_y) {
209 res = coefficient_y & QUIET_MASK64;
236 coefficient_a = coefficient_y;
246 coefficient_b = coefficient_y;
|
| bid64_fma.c | 33 * get full coefficient_x*coefficient_y product
70 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, sign_z, local
90 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
166 if (!coefficient_y) {
257 if ((!coefficient_x) || (!coefficient_y)) {
288 tempy.d = (double) coefficient_y;
291 // magnitude estimate for coefficient_x*coefficient_y is
295 // check if coefficient_x*coefficient_y<2^(10*k+3)
299 C64 = coefficient_x * coefficient_y;
325 // get 128-bit product: coefficient_x*coefficient_y
[all...] |
| bid64_div.c | 30 * if(coefficient_x<coefficient_y)
31 * p = number_digits(coefficient_y) - number_digits(coefficient_x)
33 * B = coefficient_y
37 * get Q=(int)(coefficient_x/coefficient_y)
40 * Let R = coefficient_x - Q*coefficient_y
43 * B = coefficient_y
85 UINT64 sign_x, sign_y, coefficient_x, coefficient_y, A, B, QX, PD; local
110 valid_y = unpack_BID64 (&sign_y, &exponent_y, &coefficient_y, y);
147 && !(coefficient_y)) {
179 BID_RETURN (coefficient_y & QUIET_MASK64)
[all...] |
| bid_inline_add.h | 30 * UINT64 sign_y, int exponent_y, UINT64 coefficient_y,
76 UINT64 sign_y, int exponent_y, UINT64 coefficient_y,
92 coefficient_a = coefficient_y;
102 coefficient_b = coefficient_y;
809 UINT64 CYh, CY0L, T, S, coefficient_y, remainder_y; local
1029 coefficient_y = CY.w[0] - CY0L;
1040 coefficient_y += round_const_table[rmode][extra_digits];
1042 // align coefficient_y, coefficient_x
1044 __mul_64x64_to_128 (F, coefficient_y, S);
|
