| /src/sys/external/bsd/compiler_rt/dist/lib/builtins/ |
| divsf3.c | 119 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; local in function:__divsf3
121 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
132 // We also take this time to right shift quotient if it falls in the [1,2)
135 if (quotient < (implicitBit << 1)) {
136 residual = (aSignificand << 24) - quotient * bSignificand;
139 quotient >>= 1;
140 residual = (aSignificand << 23) - quotient * bSignificand;
159 rep_t absResult = quotient & significandMask;
|
| divdf3.c | 133 rep_t quotient, quotientLo; local in function:__divdf3
134 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
136 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
147 // We also take this time to right shift quotient if it falls in the [1,2)
150 if (quotient < (implicitBit << 1)) {
151 residual = (aSignificand << 53) - quotient * bSignificand;
154 quotient >>= 1;
155 residual = (aSignificand << 52) - quotient * bSignificand;
174 rep_t absResult = quotient & significandMask
[all...] |
| divtf3.c | 149 rep_t quotient, quotientLo; local in function:__divtf3
150 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
152 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
163 // We also take this time to right shift quotient if it falls in the [1,2)
168 if (quotient < (implicitBit << 1)) {
169 wideMultiply(quotient, bSignificand, &dummy, &qb);
173 quotient >>= 1;
174 wideMultiply(quotient, bSignificand, &dummy, &qb);
192 rep_t absResult = quotient & significandMask
[all...] |
| /src/sys/lib/libkern/arch/m68k/ |
| udivsi3.S | 83 addl %d1, %d0 | %d0 = quotient guess
85 | the quotient we have so far is only a guess. the divide we
92 | so our guess quotient cannot be less than our real desired
93 | quotient. however, it might be one too big.
95 | to adjust this quotient, we multiply it by the original
97 | if the result is nonnegative, our guessed quotient was
99 | if the result is negative, our guessed quotient was one
125 subql #1, %d0 | adjust quotient
|
| divsi3.S | 68 .Lret: negl %d0 | negate quotient
|
| /src/sys/external/bsd/compiler_rt/dist/lib/builtins/arm/ |
| divmodsi4.S | 30 @ Calculate the quotient and remainder of the (signed) division. The return
31 @ value is the quotient, the remainder is placed in the variable.
52 // Set aside the sign of the quotient and modulus, and the address for the
64 // Apply the sign of quotient and modulus
|
| divsi3.S | 33 @ Calculate and return the quotient of the (signed) division.
50 // Set aside the sign of the quotient.
59 // Apply sign of quotient to result and return.
|
| udivmodsi4.S | 26 @ Calculate the quotient and remainder of the (unsigned) division. The return
27 @ value is the quotient, the remainder is placed in the variable.
60 * block(shift) implements the test-and-update-quotient core.
62 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
|
| udivsi3.S | 28 @ Calculate and return the quotient of the (unsigned) division.
60 * block(shift) implements the test-and-update-quotient core.
62 * that (r0 << shift) < 2 * r1. The quotient is stored in r3.
|
| /src/sys/arch/hppa/stand/common/ |
| milli_tiny.S | 31 ; $$divU unsigned division, return quotient
38 ; %r29 quotient
51 addc %r26,%r26,%r29 ; fix quotient
54 ldi 1,%r29 ; quotient is 1
|
| /src/sys/arch/m68k/060sp/dist/ |
| ilsp.s | 87 # 0x10(sp) = pointer to location to place quotient/remainder #
90 # 0x10(sp) = points to location of remainder/quotient. #
91 # remainder is in first longword, quotient is in 2nd. #
214 eor.b %d0, NDIVIDEND(%a6) # chk if quotient is negative
231 # if the register numbers are the same, only the quotient gets saved.
232 # so, if we always save the quotient second, we save ourselves a cmp&beq
288 # The quotient is returned in %d6, remainder in %d5, unless the #
301 # In the general case, four quotient words would be created by
303 # the first two quotient words must be zero, or overflow would occur.
306 # the last two divisions to get a quotient longword and word remainder
[all...] |
| isp.s | 2080 # quotient and remainder in the appropriate data registers on the stack.#
2184 eor.b %d0, NDIVIDEND(%a6) # chk if quotient is negative
2209 # if the register numbers are the same, only the quotient gets saved.
2210 # so, if we always save the quotient second, we save ourselves a cmp&beq
2212 mov.l %d6, (EXC_DREGS,%a6,%d1.w*4) # save quotient
2238 # The quotient is returned in %d6, remainder in %d5, unless the #
2251 # In the general case, four quotient words would be created by
2253 # the first two quotient words must be zero, or overflow would occur.
2256 # the last two divisions to get a quotient longword and word remainder:
2265 mov.w %d5, %d1 # first quotient wor
[all...] |
| fplsp.s | 431 set q_sn_bit, 0x7 # sign bit of quotient byte
5509 #--integer quotient will be stored in N
5940 #--integer quotient will be stored in N
9726 #..R = 2^(-j)X - Q Y = Y, thus R = 0 and quotient = 2^j (Q+1)
|
| fpsp.s | 451 set q_sn_bit, 0x7 # sign bit of quotient byte
5615 #--integer quotient will be stored in N
6046 #--integer quotient will be stored in N
10085 #..R = 2^(-j)X - Q Y = Y, thus R = 0 and quotient = 2^j (Q+1)
|
| /src/sys/dev/i2c/ |
| sensirion_voc_algorithm.c | 138 uint32_t quotient = 0; local in function:fix16_div
156 quotient |= bit;
166 quotient |= bit;
176 quotient++;
180 fix16_t result = (fix16_t)quotient;
|
| /src/sys/arch/hppa/spmath/ |
| divu.S | 47 * Implement an integer divide routine for 32-bit operands and 32-bit quotient
56 quo: .reg %r4 /* quotient and lower part of dividend */
78 ; out, msb of quotient = 0
151 stws quo,4(%arg3) ; save quotient in low part
|
| /src/sys/arch/m68k/fpsp/ |
| l_fpsp.h | 134 FPSR_QBYTE equ USER_FPSR+1 ; FPSR quotient
185 q_sn_bit equ 7 sign bit of quotient byte
|
| fpsp.h | 122 FPSR_QBYTE equ USER_FPSR+1 ; FPSR quotient
253 q_sn_bit equ 7 sign bit of quotient byte
|
| /src/sys/lib/libkern/arch/hppa/ |
| milli.S | 590 ; Compute: if( dividend>=divisor) quotient=1; else quotient=0;
1767 xor,>= arg0,arg1,0 ; get correct sign of quotient
|
