| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| Hash.cpp | 30 const uint8_t *Remainder = reinterpret_cast<const uint8_t *>(Longs.end());
36 uint16_t Value = *reinterpret_cast<const ulittle16_t *>(Remainder);
38 Remainder += 2;
44 Result ^= *(Remainder++);
|
| /src/sys/external/bsd/acpica/dist/executer/ |
| exregion.c | 87 UINT32 Remainder;
130 (void) AcpiUtShortDivide ((UINT64) Address, Length, NULL, &Remainder);
131 if (Remainder != 0)
|
| exutils.c | 427 UINT32 Remainder;
438 (void) AcpiUtShortDivide (Value, 10, &Value, &Remainder);
439 OutString[Count-1] = (char) ('0' + Remainder);\
|
| exconvrt.c | 330 UINT32 Remainder;
363 Remainder = 0;
372 (void) AcpiUtShortDivide (Digit, 10, &Digit, &Remainder);
377 if (Remainder != 0)
384 String[k] = (UINT8) (ACPI_ASCII_ZERO + Remainder);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| ScalarEvolutionDivision.h | 28 // Computes the Quotient and Remainder of the division of Numerator by
32 const SCEV **Remainder);
61 // be equal to zero and the remainder to be equal to the numerator.
65 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| ScaledNumber.cpp | 70 uint64_t Remainder = Dividend64 % Divisor;
77 return getRounded<uint32_t>(Quotient, Shift, Remainder >= getHalf(Divisor));
|
| SHA1.cpp | 218 const size_t Remainder = std::min<size_t>(
220 for (size_t I = 0; I < Remainder; ++I)
222 Data = Data.drop_front(Remainder);
236 // Finish the remainder.
|
| SHA256.cpp | 197 const size_t Remainder = std::min<size_t>(
199 for (size_t I = 0; I < Remainder; ++I)
201 Data = Data.drop_front(Remainder);
215 // Finish the remainder.
|
| /src/sys/external/bsd/acpica/dist/utilities/ |
| utmath.c | 326 * OutRemainder - Pointer to where the remainder is returned
332 * 32-bit remainder.
362 * The quotient is 64 bits, the remainder is always 32 bits,
393 * OutRemainder - Pointer to where the remainder is returned
411 UINT64_OVERLAY Remainder;
438 Remainder.Part.Hi = 0;
441 * The quotient is 64 bits, the remainder is always 32 bits,
448 Quotient.Part.Lo, Remainder.Part.Lo);
480 * adjustment. The 64-bit remainder must be generated.
486 Remainder.Part.Hi = Partial3.Part.Lo
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/MCTargetDesc/ |
| MipsELFObjectWriter.cpp | 447 std::list<ELFRelocationEntry> Remainder;
454 copy_if_else(Relocs.begin(), Relocs.end(), std::back_inserter(Remainder),
459 for (auto &R : Remainder) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 48 Value *Remainder;
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
60 Value *Remainder = nullptr;
147 /// Reuses previously-computed dividend or remainder from the current BB if
149 /// perform the optimization and caches the resulting dividend and remainder.
172 return isDivisionOp() ? Value.Quotient : Value.Remainder;
273 DivRemPair.Remainder = Builder.CreateSRem(Dividend, Divisor);
276 DivRemPair.Remainder = Builder.CreateURem(Dividend, Divisor)
[all...] |
| IntegerDivision.cpp | 27 /// Generate code to compute the remainder of two signed integers. Returns the
28 /// remainder, which will have the sign of the dividend. Builder's insert point
74 /// Generate code to compute the remainder of two unsigned integers. Returns the
75 /// remainder. Builder's insert point should be pointing where the caller wants
81 // Remainder = Dividend - Quotient*Divisor
87 // ; %remainder = sub i32 %dividend, %product
90 Value *Remainder = Builder.CreateSub(Dividend, Product);
95 return Remainder;
368 /// Generate code to calculate the remainder of two integers, replacing Rem with
378 "Trying to expand remainder from a non-remainder function")
[all...] |
| ScalarEvolutionExpander.cpp | 284 /// S need not be evenly divisible if a reasonable remainder can be
286 static bool FactorOutConstant(const SCEV *&S, const SCEV *&Remainder,
308 // If the quotient is zero and the remainder is non-zero, reject
314 Remainder = SE.getAddExpr(
315 Remainder, SE.getConstant(C->getAPInt().srem(FC->getAPInt())));
345 if (!FactorOutConstant(Start, Remainder, Factor, SE, DL))
476 const SCEV *Remainder = SE.getConstant(Ty, 0);
477 if (FactorOutConstant(Op, Remainder, ElSize, SE, DL)) {
480 if (!Remainder->isZero())
481 NewOps.push_back(Remainder);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| Mips16InstrInfo.cpp | 230 int64_t Remainder = FrameSize - Base;
232 if (isInt<16>(-Remainder))
233 BuildAddiuSpImm(MBB, I, -Remainder);
235 adjustStackPtrBig(SP, -Remainder, MBB, I, Mips::V0, Mips::V1);
254 int64_t Remainder = FrameSize - Base;
258 if (isInt<16>(Remainder))
259 BuildAddiuSpImm(MBB, I, Remainder);
261 adjustStackPtrBig(SP, Remainder, MBB, I, Mips::A0, Mips::A1);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCLoopInstrFormPrep.cpp | 382 // first of pair: the index of first BucketElement whose remainder is equal
384 // second of pair: number of load/stores with the same remainder.
391 unsigned Remainder =
393 if (RemainderOffsetInfo.find(Remainder) == RemainderOffsetInfo.end())
394 RemainderOffsetInfo[Remainder] = std::make_pair(j, 1);
396 RemainderOffsetInfo[Remainder].second++;
400 // number of load/store with same remainder.
405 // 1: 10 load/store whose remainder is 1;
406 // 2: 9 load/store whose remainder is 2;
407 // 3: 1 for remainder 3 and 0 for remainder 0;
[all...] |
| PPCFastISel.cpp | 2154 unsigned Remainder = 0;
2166 Remainder = Imm;
2189 if ((Hi = (Remainder >> 16) & 0xFFFF)) {
2196 if ((Lo = Remainder & 0xFFFF)) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 1186 APInt Remainder = ConstDelta;
1187 APInt::sdivrem(ConstDelta, ConstCoeff, Distance, Remainder);
1189 LLVM_DEBUG(dbgs() << "\t Remainder = " << Remainder << "\n");
1191 if (Remainder != 0) {
1374 APInt Remainder = APDelta;
1375 APInt::sdivrem(APDelta, APCoeff, Distance, Remainder);
1376 LLVM_DEBUG(dbgs() << "\t Remainder = " << Remainder << "\n");
1377 if (Remainder != 0)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/VE/ |
| VEISelLowering.cpp | 1106 // Remainder = AND Ptr, 3
1107 // Flag = 1 << Remainder ; If Byte is true (1 byte swap flag)
1108 // Flag = 3 << Remainder ; If Byte is false (2 bytes swap flag)
1109 // Bits = Remainder << 3
1112 SDValue Remainder = DAG.getNode(ISD::AND, DL, PtrVT, {Ptr, Const3});
1115 Flag = DAG.getNode(ISD::SHL, DL, MVT::i32, {Mask, Remainder});
1116 Bits = DAG.getNode(ISD::SHL, DL, PtrVT, {Remainder, Const3});
1145 // Remainder = AND Ptr, 3
1146 // Flag = 1 << Remainder ; 1 byte swap flag for TS1AM inst.
1147 // Bits = Remainder <<
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 667 /// remainder is known to be zero, or null otherwise. If IgnoreSignificantBits
3500 /// Return remainder expression after factoring the subexpressions captured by
3514 const SCEV *Remainder = CollectSubexprs(S, C, Ops, L, SE, Depth+1);
3515 if (Remainder)
3516 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder);
3524 const SCEV *Remainder = CollectSubexprs(AR->getStart(),
3528 if (Remainder && (AR->getLoop() == L || !isa<SCEVAddRecExpr>(Remainder))) {
3529 Ops.push_back(C ? SE.getMulExpr(C, Remainder) : Remainder)
[all...] |
