| /freebsd/crypto/openssl/test/recipes/10-test_bn_data/ |
| H A D | bnmul.txt | 925 Quotient = 0
930 Quotient = 1
935 Quotient = -2
940 Quotient = -4
945 Quotient = 8
950 Quotient = 10
955 Quotient = -20
960 Quotient = -40
965 Quotient = 80
970 Quotient = 100
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolutionDivision.cpp | 56 const SCEV *Denominator, const SCEV **Quotient, in divide() argument
65 *Quotient = D.One; in divide()
71 *Quotient = D.Zero; in divide()
78 *Quotient = Numerator; in divide()
86 *Quotient = Numerator; in divide()
88 divide(SE, *Quotient, Op, &Q, &R); in divide()
89 *Quotient = Q; in divide()
94 *Quotient = D.Zero; in divide()
104 *Quotient = D.Quotient; in divide()
123 Quotient = SE.getConstant(QuotientVal); in visitConstant()
[all …]
|
| /freebsd/sys/contrib/dev/acpica/components/utilities/ |
| H A D | utmath.c | 452 UINT64_OVERLAY Quotient; in AcpiUtShortDivide() local
474 Quotient.Part.Hi, Remainder32); in AcpiUtShortDivide()
477 Quotient.Part.Lo, Remainder32); in AcpiUtShortDivide()
483 *OutQuotient = Quotient.Full; in AcpiUtShortDivide()
518 UINT64_OVERLAY Quotient; in AcpiUtDivide() local
553 Quotient.Part.Hi, Partial1); in AcpiUtDivide()
556 Quotient.Part.Lo, Remainder.Part.Lo); in AcpiUtDivide()
565 Quotient.Part.Hi = 0; in AcpiUtDivide()
584 NormalizedDivisor.Part.Lo, Quotient.Part.Lo, Partial1); in AcpiUtDivide()
590 Partial1 = Quotient.Part.Lo * Divisor.Part.Hi; in AcpiUtDivide()
[all …]
|
| H A D | utstrsuppt.c | 581 UINT64 Quotient; in AcpiUtStrtoulMultiply64() local
600 AcpiUtShortDivide (ACPI_UINT64_MAX, Base, &Quotient, NULL); in AcpiUtStrtoulMultiply64()
601 if (Multiplicand > Quotient) in AcpiUtStrtoulMultiply64()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | ScaledNumber.cpp | 69 uint64_t Quotient = Dividend64 / Divisor; in divide32() local
73 if (Quotient > UINT32_MAX) in divide32()
74 return getAdjusted<uint32_t>(Quotient, Shift); in divide32()
77 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor)); in divide32()
103 uint64_t Quotient = Dividend / Divisor; in divide64() local
107 while (!(Quotient >> 63) && Dividend) { in divide64()
114 Quotient <<= 1; in divide64()
116 Quotient |= 1; in divide64()
121 return getRounded(Quotient, Shift, Dividend >= getHalf(Divisor)); in divide64()
|
| H A D | APInt.cpp | 1451 unsigned rhsWords, WordType *Quotient, WordType *Remainder) { in divide() argument
1553 if (Quotient) { in divide()
1555 Quotient[i] = Make_64(Q[i*2+1], Q[i*2]); in divide()
1606 APInt Quotient(BitWidth, 0); // to hold result. in udiv() local
1607 divide(U.pVal, lhsWords, RHS.U.pVal, rhsWords, Quotient.U.pVal, nullptr); in udiv()
1608 return Quotient; in udiv()
1639 APInt Quotient(BitWidth, 0); // to hold result. in udiv() local
1640 divide(U.pVal, lhsWords, &RHS, 1, Quotient.U.pVal, nullptr); in udiv()
1641 return Quotient; in udiv()
1759 APInt &Quotient, APInt &Remainder) { in udivrem() argument
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | BypassSlowDivision.cpp | 44 Value *Quotient; member
48 : Quotient(InQuotient), Remainder(InRemainder) {} in QuotRemPair()
56 Value *Quotient = nullptr; member
169 return isDivisionOp() ? Value.Quotient : Value.Remainder; in getReplacement()
269 DivRemPair.Quotient = Builder.CreateSDiv(Dividend, Divisor); in createSlowBB()
272 DivRemPair.Quotient = Builder.CreateUDiv(Dividend, Divisor); in createSlowBB()
299 DivRemPair.Quotient = in createFastBB()
315 QuoPhi->addIncoming(LHS.Quotient, LHS.BB); in createDivRemPhiNodes()
316 QuoPhi->addIncoming(RHS.Quotient, RHS.BB); in createDivRemPhiNodes()
420 Long.Quotient = ConstantInt::get(getSlowType(), 0); in insertFastDivAndRem()
[all …]
|
| H A D | IntegerDivision.cpp | 84 Value *Quotient = Builder.CreateUDiv(Dividend, Divisor); in generateUnsignedRemainderCode() local
85 Value *Product = Builder.CreateMul(Divisor, Quotient); in generateUnsignedRemainderCode()
88 if (Instruction *UDiv = dyn_cast<Instruction>(Quotient)) in generateUnsignedRemainderCode()
418 Value *Quotient = generateSignedDivisionCode(Div->getOperand(0), in expandDivision() local
423 Div->replaceAllUsesWith(Quotient); in expandDivision()
438 Value *Quotient = generateUnsignedDivisionCode(Div->getOperand(0), in expandDivision() local
441 Div->replaceAllUsesWith(Quotient); in expandDivision()
|
| /freebsd/sys/contrib/dev/acpica/components/hardware/ |
| H A D | hwtimer.c | 287 UINT64 Quotient; in ACPI_EXPORT_SYMBOL() local
340 ACPI_PM_TIMER_FREQUENCY, &Quotient, NULL); in ACPI_EXPORT_SYMBOL()
342 *TimeElapsed = (UINT32) Quotient; in ACPI_EXPORT_SYMBOL()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionDivision.h | 31 const SCEV *Denominator, const SCEV **Quotient,
68 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One; member
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineMulDivRem.cpp | 1168 static bool isMultiple(const APInt &C1, const APInt &C2, APInt &Quotient, in isMultiple() argument
1182 APInt::sdivrem(C1, C2, Quotient, Remainder); in isMultiple()
1184 APInt::udivrem(C1, C2, Quotient, Remainder); in isMultiple()
1339 APInt Quotient(C2->getBitWidth(), /*val=*/0ULL, IsSigned); in commonIDivTransforms() local
1344 if (isMultiple(*C2, *C1, Quotient, IsSigned)) { in commonIDivTransforms()
1346 ConstantInt::get(Ty, Quotient)); in commonIDivTransforms()
1352 if (isMultiple(*C1, *C2, Quotient, IsSigned)) { in commonIDivTransforms()
1354 ConstantInt::get(Ty, Quotient)); in commonIDivTransforms()
1370 if (isMultiple(*C2, C1Shifted, Quotient, IsSigned)) { in commonIDivTransforms()
1372 ConstantInt::get(Ty, Quotient)); in commonIDivTransforms()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | APInt.h | 1000 APInt &Quotient, APInt &Remainder);
1001 LLVM_ABI static void udivrem(const APInt &LHS, uint64_t RHS, APInt &Quotient,
1005 APInt &Quotient, APInt &Remainder);
1006 LLVM_ABI static void sdivrem(const APInt &LHS, int64_t RHS, APInt &Quotient,
2031 const WordType *RHS, unsigned rhsWords, WordType *Quotient,
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUInstrInfo.td | 253 // Special case divide FMA with scale and flags (src0 = Quotient,
259 // Special case divide fixup and flags(src0 = Quotient, src1 =
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 4344 if (const SCEV *Quotient = getExactSDiv(AR, FactorS, SE, true)) in GenerateScales() local
4345 if (!Quotient->isZero()) { in GenerateScales()
4348 F.ScaledReg = Quotient; in GenerateScales()
|
| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | funstack.ok | 133 James R. Bell The Quadratic Quotient Method: A Hash
382 J. R. Bell Comment on Bell's Quadratic Quotient
425 Charles H. Kaman The Linear Quotient Hash Code . . . . . 675--677
|
| H A D | funstack.in | 800 title = "The Quadratic Quotient Method: {A} Hash Code Eliminating Secondary Clustering",
2678 title = "Comment on {Bell}'s Quadratic Quotient Method for Hash Code Searching",
2972 title = "The Linear Quotient Hash Code",
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | TargetLowering.cpp | 8101 SDValue Quotient = DAG.getNode(ISD::MUL, dl, VT, Dividend, in expandDIVREMByConstant() local
8106 std::tie(QuotL, QuotH) = DAG.SplitScalar(Quotient, dl, HiLoVT, HiLoVT); in expandDIVREMByConstant()
|
| /freebsd/share/misc/ |
| H A D | usb_vendors | 15217 0dd2 Power Quotient International Co., Ltd
23161 3538 Power Quotient International Co., Ltd
|