HomeSort by: relevance | last modified time | path
    Searched defs:Quotient (Results 1 - 8 of 8) sorted by relevancy

  /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/
utstrsuppt.c 473 UINT64 Quotient;
492 AcpiUtShortDivide (ACPI_UINT64_MAX, Base, &Quotient, NULL);
493 if (Multiplicand > Quotient)
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...]
  /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...]
  /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;

Completed in 26 milliseconds