| /src/sys/external/bsd/gnu-efi/dist/lib/aarch64/ |
| math.c | 57 OUT UINTN *Remainder OPTIONAL
62 if (Remainder)
63 *Remainder = Dividend % Divisor;
|
| /src/sys/external/bsd/gnu-efi/dist/lib/arm/ |
| math.c | 57 OUT UINTN *Remainder OPTIONAL
66 if (Remainder)
67 *Remainder = Dividend % Divisor;
|
| /src/sys/external/bsd/gnu-efi/dist/lib/mips64el/ |
| math.c | 57 OUT UINTN *Remainder OPTIONAL
62 if (Remainder)
63 *Remainder = Dividend % Divisor;
|
| /src/sys/external/bsd/gnu-efi/dist/lib/riscv64/ |
| math.c | 54 OUT UINTN *Remainder OPTIONAL
59 if (Remainder) {
60 *Remainder = Dividend % Divisor;
|
| /src/sys/external/bsd/gnu-efi/dist/lib/ia64/ |
| math.c | 78 OUT UINTN *Remainder OPTIONAL
85 if (Remainder) {
86 *Remainder = Dividend % Divisor;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ScalarEvolutionDivision.cpp | 55 // Computes the Quotient and Remainder of the division of Numerator by
59 const SCEV **Remainder) {
68 *Remainder = D.Zero;
74 *Remainder = D.Zero;
81 *Remainder = D.Zero;
97 *Remainder = Numerator;
101 *Remainder = D.Zero;
107 *Remainder = D.Remainder;
126 Remainder = SE.getConstant(RemainderVal)
[all...] |
| 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/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/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/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/sys/external/bsd/gnu-efi/dist/lib/ia32/ |
| math.c | 140 OUT UINTN *Remainder OPTIONAL
146 if (Remainder)
147 *Remainder = Dividend % Divisor;
195 if (Remainder) {
196 *Remainder = Rem;
|
| /src/sys/external/bsd/gnu-efi/dist/lib/x86_64/ |
| math.c | 140 OUT UINTN *Remainder OPTIONAL
146 if (Remainder)
147 *Remainder = Dividend % Divisor;
177 if (Remainder) {
178 *Remainder = Rem;
|
| /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...] |
| /src/sys/external/bsd/acpica/dist/executer/ |
| 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);
|
| exregion.c | 87 UINT32 Remainder;
130 (void) AcpiUtShortDivide ((UINT64) Address, Length, NULL, &Remainder);
131 if (Remainder != 0)
|
| /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/Support/ |
| APInt.cpp | 1025 // Fill in the remainder based on the original sign.
1206 // remainder, which is the gcd(*this,modulo) as calculated by the Euclidean
1421 // D5. [Test remainder.] Set q[j] = qp. If the result of step D4 was
1452 // remainder may be obtained by dividing u[...] by d. If r is non-null we
1453 // compute the remainder (urem uses this).
1460 DEBUG_KNUTH(dbgs() << "KnuthDiv: remainder:");
1478 unsigned rhsWords, WordType *Quotient, WordType *Remainder) {
1498 if ((Remainder?4:3)*n+2*m+1 <= 128) {
1502 if (Remainder)
1508 if (Remainder)
[all...] |
| 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.
|
| /src/external/gpl3/gcc/dist/libgcc/config/avr/ |
| lib1funcs.S | 1342 Division 8 / 8 => (result + remainder)
1344 #define r_rem r25 /* remainder */
1351 clr r_rem ; clear remainder
1355 rol r_rem ; shift dividend into remainder
1356 cp r_rem,r_arg2 ; compare remainder & divisor
1357 brcs __udivmodqi4_ep ; remainder <= divisor
1358 sub r_rem,r_arg2 ; restore remainder
1380 neg r_rem ; correct remainder sign
1396 Division 16 / 16 => (result + remainder)
1398 #define r_remL r26 /* remainder Low *
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/ |
| lib1funcs.S | 1337 Division 8 / 8 => (result + remainder)
1339 #define r_rem r25 /* remainder */
1346 sub r_rem,r_rem ; clear remainder and carry
1350 rol r_rem ; shift dividend into remainder
1351 cp r_rem,r_arg2 ; compare remainder & divisor
1352 brcs __udivmodqi4_ep ; remainder <= divisor
1353 sub r_rem,r_arg2 ; restore remainder
1375 neg r_rem ; correct remainder sign
1391 Division 16 / 16 => (result + remainder)
1393 #define r_remL r26 /* remainder Low *
[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/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...] |
