| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| IntegerDivision.h | 25 /// Generate code to calculate the remainder of two integers, replacing Rem
31 /// Replace Rem with generated code.
32 bool expandRemainder(BinaryOperator *Rem);
43 /// Generate code to calculate the remainder of two integers, replacing Rem
44 /// with the generated code. Uses ExpandReminder with a 32bit Rem which
48 /// Replace Rem with generated code.
49 bool expandRemainderUpTo32Bits(BinaryOperator *Rem);
51 /// Generate code to calculate the remainder of two integers, replacing Rem
52 /// with the generated code. Uses ExpandReminder with a 64bit Rem.
54 /// Replace Rem with generated code
[all...] |
| /src/external/gpl3/gdb.old/dist/ |
| djunpack.bat | 2 Rem
3 Rem WARNING WARNING WARNING: This file needs to have DOS CRLF end-of-line
4 Rem format, or else stock DOS/Windows shells will refuse to run it.
5 Rem
6 Rem This batch file unpacks the GDB distribution while simultaneously
7 Rem renaming some of the files whose names are invalid on DOS or conflict
8 Rem with other file names after truncation to DOS 8+3 namespace.
9 Rem
10 Rem Invoke like this:
11 Rem
[all...] |
| /src/external/gpl3/gdb/dist/ |
| djunpack.bat | 2 Rem
3 Rem WARNING WARNING WARNING: This file needs to have DOS CRLF end-of-line
4 Rem format, or else stock DOS/Windows shells will refuse to run it.
5 Rem
6 Rem This batch file unpacks the GDB distribution while simultaneously
7 Rem renaming some of the files whose names are invalid on DOS or conflict
8 Rem with other file names after truncation to DOS 8+3 namespace.
9 Rem
10 Rem Invoke like this:
11 Rem
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| IntegerDivision.cpp | 368 /// Generate code to calculate the remainder of two integers, replacing Rem with
374 /// Replace Rem with generated code.
375 bool llvm::expandRemainder(BinaryOperator *Rem) {
376 assert((Rem->getOpcode() == Instruction::SRem ||
377 Rem->getOpcode() == Instruction::URem) &&
380 IRBuilder<> Builder(Rem);
382 assert(!Rem->getType()->isVectorTy() && "Div over vectors not supported");
383 assert((Rem->getType()->getIntegerBitWidth() == 32 ||
384 Rem->getType()->getIntegerBitWidth() == 64) &&
388 if (Rem->getOpcode() == Instruction::SRem)
[all...] |
| SimplifyIndVar.cpp | 91 void simplifyIVRemainder(BinaryOperator *Rem, Value *IVOperand,
93 void replaceRemWithNumerator(BinaryOperator *Rem);
94 void replaceRemWithNumeratorOrZero(BinaryOperator *Rem);
95 void replaceSRemWithURem(BinaryOperator *Rem);
340 void SimplifyIndvar::replaceSRemWithURem(BinaryOperator *Rem) {
341 auto *N = Rem->getOperand(0), *D = Rem->getOperand(1);
343 Rem->getName() + ".urem", Rem);
344 Rem->replaceAllUsesWith(URem)
[all...] |
| /src/external/gpl2/groff/dist/arch/djgpp/ |
| config.bat | 4 Rem The SmallEnv tests protect against fixed and too small size
5 Rem of the environment in stock DOS shell.
7 Rem Find out where the sources are
17 Rem Update configuration files
23 Rem Make sure they have a config.site file
27 Rem This is required because DOS/Windows are case-insensitive
28 Rem to file names, and "make install" will do nothing if Make
29 Rem finds a file called `install'.
32 Rem Set HOSTNAME so it shows in config.status
62 Rem install-sh is required by the configure script but clashes with the
[all...] |
| t-groff.bat | 2 Rem This script runs groff without requiring that it be installed.
3 Rem The current directory must be the build directory.
15 Rem chdir to src, to avoid overflowing the DOS limits with a long PATH.
21 Rem
25 Rem Make the following command pipe to Less if you have Less installed:
27 Rem
32 Rem Uncomment the following command if you have a PostScript printer:
33 REM roff\groff\groff -e -s -t -p -R -me -Tps ../doc/meintro.me >>prn
34 Rem
39 Rem Uncomment the following command if you have a LaserJet4 printer:
[all...] |
| /src/external/gpl2/gettext/dist/djgpp/ |
| config.bat | 4 Rem The SmallEnv tests protect against fixed and too small size
5 Rem of the environment in stock DOS shell.
7 Rem Find out if NLS is wanted or not,
8 Rem if dependency-tracking is wanted or not,
9 Rem if caching is wanted or not
10 Rem if static or shared libraries are wanted
11 Rem and where the sources are.
12 Rem We always default to NLS support,
13 Rem no dependency tracking, static library
14 Rem and to in place configuration.
[all...] |
| /src/sys/external/bsd/gnu-efi/dist/lib/ia32/ |
| math.c | 150 UINT32 Rem;
160 Rem = 0;
175 : "m"(Dividend), "m"(Divisor), "m"(Rem)
180 shl dword ptr Dividend[0], 1 ; shift rem:dividend left one
182 rcl dword ptr Rem, 1
184 mov eax, Rem
185 cmp eax, Divisor ; Is Rem >= Divisor?
190 sub Rem, eax ; subtract divisor
196 *Remainder = Rem;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| BranchProbability.cpp | 91 uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32;
92 uint64_t UpperQ = Rem / D;
98 Rem = ((Rem % D) << 32) | Lower32;
99 uint64_t LowerQ = Rem / D;
|
| APFixedPoint.cpp | 305 APInt Rem;
306 APInt::sdivrem(ThisVal, OtherVal, Result, Rem);
309 if (ThisVal.isNegative() != OtherVal.isNegative() && !Rem.isNullValue())
|
| APInt.cpp | 1175 /// advantage of div+rem calculations. We also use some tricks to avoid copying
1237 r1 = signedMin - q1*anc; // initialize r1 = rem(2p,abs(nc))
1239 r2 = signedMin - q2*ad; // initialize r2 = rem(2p,abs(d))
1243 r1 = r1<<1; // update r1 = rem(2p/abs(nc))
1249 r2 = r2<<1; // update r2 = rem(2p/abs(d))
1282 r1 = signedMin - q1*nc; // initialize r1 = rem(2p,nc)
1284 r2 = signedMax - q2*d; // initialize r2 = rem((2p-1),d)
2824 APInt Quo, Rem;
2825 APInt::udivrem(A, B, Quo, Rem);
2826 if (Rem == 0
[all...] |
| /src/sys/external/bsd/gnu-efi/dist/lib/x86_64/ |
| math.c | 150 UINT32 Rem;
160 Rem = 0;
163 shl dword ptr Dividend[0], 1 ; shift rem:dividend left one
165 rcl dword ptr Rem, 1
167 mov eax, Rem
168 cmp eax, Divisor ; Is Rem >= Divisor?
173 sub Rem, eax ; subtract divisor
178 *Remainder = Rem;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineScheduler.cpp | 2040 init(ScheduleDAGMI *dag, const TargetSchedModel *smodel, SchedRemainder *rem) {
2044 Rem = rem;
2238 unsigned OtherCritCount = Rem->RemIssueCount
2244 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx];
2353 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted");
2354 Rem->RemainingCounts[PIdx] -= Count;
2426 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted");
2427 Rem->RemIssueCount -= DecRemIssue;
2672 if (CurrZone.getCurrCycle() > Rem.CriticalPath
[all...] |
| TargetSchedule.cpp | 50 unsigned Rem = Dividend % Divisor;
52 Divisor = Rem;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUPrintfRuntimeBinding.cpp | 258 size_t Rem = SizeStr % DWORD_ALIGN;
262 if (Rem) {
263 NSizeStr = SizeStr + (DWORD_ALIGN - Rem);
439 size_t Rem = SizeStr % DWORD_ALIGN;
441 if (Rem) {
442 NSizeStr = SizeStr + (DWORD_ALIGN - Rem);
|
| AMDGPULowerModuleLDSPass.cpp | 184 if (uint64_t Rem = CurrentOffset % DataAlignV) {
185 uint64_t Padding = DataAlignV - Rem;
|
| AMDGPUISelLowering.cpp | 1748 // Rem needs compensation, it's easier to recompute it
1749 SDValue Rem = DAG.getNode(ISD::MUL, DL, VT, Div, RHS);
1750 Rem = DAG.getNode(ISD::SUB, DL, VT, LHS, Rem);
1757 Rem = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, VT, Rem, InRegSize);
1761 Rem = DAG.getNode(ISD::AND, DL, VT, Rem, TruncMask);
1764 return DAG.getMergeValues({ Div, Rem }, DL);
1796 SDValue REM = DAG.getBuildVector(MVT::v2i32, DL, {Res.getValue(1), Zero})
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCMachineScheduler.cpp | 87 if (Rem.IsAcyclicLatencyLimited && !Zone->getCurrMOps() &&
138 !Rem.IsAcyclicLatencyLimited && tryLatency(TryCand, Cand, *Zone))
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| StmtVisitor.h | 127 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineScheduler.h | 619 SchedRemainder *Rem = nullptr;
700 SchedRemainder *rem);
911 SchedRemainder Rem;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LowerMatrixIntrinsics.cpp | 1999 OptimizationRemark Rem(DEBUG_TYPE, "matrix-lowered", Loc,
2002 Rem << "Lowered with ";
2003 Rem << ore::NV("NumStores", Counts.NumStores) << " stores, "
2010 Rem << ",\nadditionally "
2018 Rem << ("\n" + linearize(L, Shared, ExprsInSubprogram, DL));
2019 ORE.emit(Rem);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/ |
| InstCombineSimplifyDemanded.cpp | 699 ConstantInt *Rem;
700 if (match(I->getOperand(1), m_ConstantInt(Rem))) {
703 if (Rem->isMinusOne())
705 APInt RA = Rem->getValue().abs();
1551 // TODO: We bail completely on integer div/rem and shifts because they have
|
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGStmt.cpp | 1337 uint64_t Weight = Total / NCases, Rem = Total % NCases;
1340 SwitchWeights->push_back(Weight + (Rem ? 1 : 0));
1344 if (Rem)
1345 Rem--;
|
| /src/external/apache2/llvm/dist/llvm/lib/MC/ |
| WinCOFFObjectWriter.cpp | 450 unsigned Rem = Value % 64;
452 *(Ptr--) = Alphabet[Rem];
|
