| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ScalarEvolutionDivision.cpp | 55 // Computes the Quotient and Remainder of the division of Numerator by
58 const SCEV *Denominator, const SCEV **Quotient,
67 *Quotient = D.One;
73 *Quotient = D.Zero;
78 // A simple case when N/1. The quotient is N.
80 *Quotient = Numerator;
88 *Quotient = Numerator;
90 divide(SE, *Quotient, Op, &Q, &R);
91 *Quotient = Q;
96 *Quotient = D.Zero
[all...] |
| /src/sys/external/bsd/acpica/dist/hardware/ |
| hwtimer.c | 179 UINT64 Quotient;
232 ACPI_PM_TIMER_FREQUENCY, &Quotient, NULL);
234 *TimeElapsed = (UINT32) Quotient;
|
| /src/sys/external/bsd/acpica/dist/utilities/ |
| utmath.c | 325 * OutQuotient - Pointer to where the quotient is returned
331 * divide and modulo. The result is a 64-bit quotient and a
344 UINT64_OVERLAY Quotient;
362 * The quotient is 64 bits, the remainder is always 32 bits,
366 Quotient.Part.Hi, Remainder32);
369 Quotient.Part.Lo, Remainder32);
375 *OutQuotient = Quotient.Full;
392 * OutQuotient - Pointer to where the quotient is returned
410 UINT64_OVERLAY Quotient;
441 * The quotient is 64 bits, the remainder is always 32 bits
[all...] |
| utstrsuppt.c | 473 UINT64 Quotient;
492 AcpiUtShortDivide (ACPI_UINT64_MAX, Base, &Quotient, NULL);
493 if (Multiplicand > Quotient)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| ScalarEvolutionDivision.h | 28 // Computes the Quotient and Remainder of the division of Numerator by
31 const SCEV *Denominator, const SCEV **Quotient,
60 // Convenience function for giving up on the division. We set the quotient to
65 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| ScaledNumber.cpp | 69 uint64_t Quotient = Dividend64 / Divisor;
72 // If Quotient needs to be shifted, leave the rounding to getAdjusted().
73 if (Quotient > UINT32_MAX)
74 return getAdjusted<uint32_t>(Quotient, Shift);
77 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor));
103 uint64_t Quotient = Dividend / Divisor;
106 // Continue building the quotient with long division.
107 while (!(Quotient >> 63) && Dividend) {
113 // Get the next bit of Quotient.
114 Quotient <<= 1
[all...] |
| APInt.cpp | 1321 assert(q && "Must provide quotient");
1376 DEBUG_KNUTH(dbgs() << "KnuthDiv: quotient digit #" << j << '\n');
1447 DEBUG_KNUTH(dbgs() << "KnuthDiv: quotient:");
1451 // D8. [Unnormalize]. Now q[...] is the desired quotient, and the desired
1478 unsigned rhsWords, WordType *Quotient, WordType *Remainder) {
1529 // initialize the quotient and remainder
1579 // If the caller wants the quotient
1580 if (Quotient) {
1582 Quotient[i] = Make_64(Q[i*2+1], Q[i*2]);
1633 APInt Quotient(BitWidth, 0); // to hold result
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 47 Value *Quotient;
51 : Quotient(InQuotient), Remainder(InRemainder) {}
54 /// A quotient and remainder, plus a BB from which they logically "originate".
55 /// If you use Quotient or Remainder in a Phi node, you should use BB as its
59 Value *Quotient = nullptr;
172 return isDivisionOp() ? Value.Quotient : Value.Remainder;
272 DivRemPair.Quotient = Builder.CreateSDiv(Dividend, Divisor);
275 DivRemPair.Quotient = Builder.CreateUDiv(Dividend, Divisor);
302 DivRemPair.Quotient =
318 QuoPhi->addIncoming(LHS.Quotient, LHS.BB)
[all...] |
| IntegerDivision.cpp | 81 // Remainder = Dividend - Quotient*Divisor
85 // ; %quotient = udiv i32 %dividend, %divisor
86 // ; %product = mul i32 %divisor, %quotient
88 Value *Quotient = Builder.CreateUDiv(Dividend, Divisor);
89 Value *Product = Builder.CreateMul(Divisor, Quotient);
92 if (Instruction *UDiv = dyn_cast<Instruction>(Quotient))
98 /// Generate code to divide two signed integers. Returns the quotient, rounded
148 /// Returns the quotient, rounded towards 0. Builder's insert point should
448 Value *Quotient = generateSignedDivisionCode(Div->getOperand(0),
453 Div->replaceAllUsesWith(Quotient);
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/hwmgr/ |
| ppevvmath.h | 501 fInt A, B, Quotient;
506 Quotient = fDivide(A, B);
508 return Quotient;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineMulDivRem.cpp | 697 /// True if C1 is a multiple of C2. Quotient contains C1/C2.
698 static bool isMultiple(const APInt &C1, const APInt &C2, APInt &Quotient,
712 APInt::sdivrem(C1, C2, Quotient, Remainder);
714 APInt::udivrem(C1, C2, Quotient, Remainder);
753 APInt Quotient(C1->getBitWidth(), /*val=*/0ULL, IsSigned);
756 if (isMultiple(*C2, *C1, Quotient, IsSigned)) {
758 ConstantInt::get(Ty, Quotient));
764 if (isMultiple(*C1, *C2, Quotient, IsSigned)) {
766 ConstantInt::get(Ty, Quotient));
777 APInt Quotient(C1->getBitWidth(), /*val=*/0ULL, IsSigned)
[all...] |
| InstructionCombining.cpp | 1350 // If Op is a constant divisible by Scale then descale to the quotient.
1351 APInt Quotient(Scale), Remainder(Scale); // Init ensures right bitwidth.
1352 APInt::sdivrem(CI->getValue(), Scale, Quotient, Remainder);
1356 // Replace with the quotient in the parent.
1357 Op = ConstantInt::get(CI->getType(), Quotient);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| APInt.h | 193 const WordType *RHS, unsigned rhsWords, WordType *Quotient,
1099 /// quotient and remainder. This function does both operations in the same
1103 static void udivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
1105 static void udivrem(const APInt &LHS, uint64_t RHS, APInt &Quotient,
1108 static void sdivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
1110 static void sdivrem(const APInt &LHS, int64_t RHS, APInt &Quotient,
|
| /src/external/lgpl3/gmp/dist/mpn/arm/ |
| udiv.asm | 2 dnl Return quotient and store remainder through a supplied pointer.
40 C divstep -- develop one quotient bit. Dividend in $1$2, divisor in $3.
41 C Quotient bit is shifted into $2.
63 adc r0, n0, n0 C quotient: add last carry from divstep
94 addcs n0, n0, #1 C adjust quotient if rem. fix carried
98 addcs n0, n0, #1 C adjust quotient
102 mov r0, n0 C quotient
|
| /src/external/gpl3/gcc/dist/libgcc/config/avr/ |
| lib1funcs.S | 1345 #define r_arg1 r24 /* dividend, quotient */
1405 /* return: quotient */
1433 mov_l r_arg2L, r_arg1L ; quotient
1488 ;; A[0..2]: In: Dividend; Out: Quotient
1576 ; Adjust quotient's sign
1592 ; Correct dividend/quotient sign
1633 /* return: quotient */
1677 mov_l r_arg2L, r_arg1L ; quotient
1700 sbrc __tmp_reg__, 7 ; correct quotient sign
1705 ;; correct divisor/quotient sig
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/ |
| lib1funcs.S | 1340 #define r_arg1 r24 /* dividend, quotient */
1400 /* return: quotient */
1428 mov_l r_arg2L, r_arg1L ; quotient
1483 ;; A[0..2]: In: Dividend; Out: Quotient
1571 ; Adjust quotient's sign
1587 ; Correct dividend/quotient sign
1628 /* return: quotient */
1672 mov_l r_arg2L, r_arg1L ; quotient
1695 sbrc __tmp_reg__, 7 ; correct quotient sign
1700 ;; correct divisor/quotient sig
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 2431 // Conservatively assume there may be reuse if the quotient of their
4017 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) {
4020 F.ScaledReg = Quotient;
|
