Searched refs:Rem (Results 1 - 25 of 26) sorted by relevance

12

/external/llvm/include/llvm/Transforms/Utils/
H A DIntegerDivision.h26 /// Generate code to calculate the remainder of two integers, replacing Rem
32 /// @brief Replace Rem with generated code.
33 bool expandRemainder(BinaryOperator *Rem);
44 /// Generate code to calculate the remainder of two integers, replacing Rem
45 /// with the generated code. Uses ExpandReminder with a 32bit Rem which
49 /// @brief Replace Rem with generated code.
50 bool expandRemainderUpTo32Bits(BinaryOperator *Rem);
52 /// Generate code to calculate the remainder of two integers, replacing Rem
53 /// with the generated code. Uses ExpandReminder with a 64bit Rem.
55 /// @brief Replace Rem wit
[all...]
/external/bison/djgpp/
H A Ddjunpack.bat2 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 Bison 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 Copyright (C) 2005-2012 Free Software Foundation, Inc.
11 Rem
[all...]
H A Dconfig.bat2 Rem Configure Bison for DJGPP.
4 Rem WARNING WARNING WARNING: This file needs to have DOS CRLF end-of-line
5 Rem format, or else stock DOS/Windows shells will refuse to run it.
7 Rem Copyright (C) 2005-2012 Free Software Foundation, Inc.
9 Rem This program is free software: you can redistribute it and/or modify
10 Rem it under the terms of the GNU General Public License as published by
11 Rem the Free Software Foundation, either version 3 of the License, or
12 Rem (at your option) any later version.
13 Rem
14 Rem Thi
[all...]
/external/llvm/lib/Support/
H A DBranchProbability.cpp52 uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32; local
53 uint64_t UpperQ = Rem / D;
59 Rem = ((Rem % D) << 32) | Lower32;
60 uint64_t LowerQ = Rem / D;
/external/llvm/lib/Transforms/Utils/
H A DIntegerDivision.cpp369 /// Generate code to calculate the remainder of two integers, replacing Rem with
375 /// @brief Replace Rem with generated code.
376 bool llvm::expandRemainder(BinaryOperator *Rem) { argument
377 assert((Rem->getOpcode() == Instruction::SRem ||
378 Rem->getOpcode() == Instruction::URem) &&
381 IRBuilder<> Builder(Rem);
383 Type *RemTy = Rem->getType();
393 if (Rem->getOpcode() == Instruction::SRem) {
394 Value *Remainder = generateSignedRemainderCode(Rem->getOperand(0),
395 Rem
489 expandRemainderUpTo32Bits(BinaryOperator *Rem) argument
539 expandRemainderUpTo64Bits(BinaryOperator *Rem) argument
[all...]
H A DSimplifyIndVar.cpp74 void eliminateIVRemainder(BinaryOperator *Rem, Value *IVOperand,
187 void SimplifyIndvar::eliminateIVRemainder(BinaryOperator *Rem, argument
192 if (IVOperand != Rem->getOperand(0))
196 const SCEV *S = SE->getSCEV(Rem->getOperand(0));
197 const SCEV *X = SE->getSCEV(Rem->getOperand(1));
200 const Loop *ICmpLoop = LI->getLoopFor(Rem->getParent());
208 Rem->replaceAllUsesWith(Rem->getOperand(0));
221 ICmpInst *ICmp = new ICmpInst(Rem, ICmpInst::ICMP_EQ,
222 Rem
[all...]
/external/llvm/unittests/Transforms/Utils/
H A DIntegerDivision.cpp101 Value *Rem = Builder.CreateSRem(A, B); local
104 Value *Ret = Builder.CreateRet(Rem);
106 expandRemainder(cast<BinaryOperator>(Rem));
131 Value *Rem = Builder.CreateURem(A, B); local
134 Value *Ret = Builder.CreateRet(Rem);
136 expandRemainder(cast<BinaryOperator>(Rem));
222 Value *Rem = Builder.CreateSRem(A, B); local
225 Value *Ret = Builder.CreateRet(Rem);
227 expandRemainder(cast<BinaryOperator>(Rem));
252 Value *Rem local
[all...]
/external/llvm/lib/CodeGen/
H A DMachineScheduler.cpp1644 Rem = rem;
1755 unsigned OtherCritCount = Rem->RemIssueCount
1761 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx];
1876 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted");
1877 Rem->RemainingCounts[PIdx] -= Count;
1944 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted");
1945 Rem->RemIssueCount -= DecRemIssue;
2189 if (IsPostRA || (RemLatency + CurrZone.getCurrCycle() > Rem.CriticalPath)) {
2194 << Rem.CriticalPath << "\n");
2371 Rem
[all...]
H A DTargetSchedule.cpp41 unsigned Rem = Dividend % Divisor; local
43 Divisor = Rem;
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDGPUISelLowering.cpp265 // Calculate Rem result:
273 // Rem = (Tmp1 == 0 ? Remainder : Remainder_S_Den)
274 SDValue Rem = DAG.getSelectCC(DL, Tmp1, DAG.getConstant(0, VT), local
277 // Rem = (Remainder_GE_Zero == 0 ? Remainder_A_Den : Rem)
278 Rem = DAG.getSelectCC(DL, Remainder_GE_Zero, DAG.getConstant(0, VT),
279 Remainder_A_Den, Rem, ISD::SETEQ);
282 DAG.ReplaceAllUsesWith(Op.getValue(1).getNode(), &Rem);
/external/llvm/include/llvm/CodeGen/
H A DMachineScheduler.h564 SchedRemainder *Rem; member in class:llvm::SchedBoundary
633 DAG(nullptr), SchedModel(nullptr), Rem(nullptr), Available(ID, Name+".A"),
829 SchedRemainder Rem; member in class:llvm::GenericSchedulerBase
/external/llvm/lib/Target/R600/
H A DAMDGPUISelLowering.cpp1628 // Rem needs compensation, it's easier to recompute it
1629 SDValue Rem = DAG.getNode(ISD::MUL, DL, VT, Div, RHS); local
1630 Rem = DAG.getNode(ISD::SUB, DL, VT, LHS, Rem);
1634 Rem
1812 // Calculate Rem result:
1820 // Rem = (Tmp1 == 0 ? Remainder : Remainder_S_Den)
1821 SDValue Rem = DAG.getSelectCC(DL, Tmp1, DAG.getConstant(0, VT), local
1824 // Rem = (Remainder_GE_Zero == 0 ? Remainder_A_Den : Rem)
1879 SDValue Rem = Div.getValue(1); local
[all...]
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp319 Value *Rem; local
321 Rem = Builder->CreateURem(Op0BO, Op1BO);
323 Rem = Builder->CreateSRem(Op0BO, Op1BO);
324 Rem->takeName(BO);
327 return BinaryOperator::CreateSub(Op0BO, Rem);
328 return BinaryOperator::CreateSub(Rem, Op0BO);
H A DInstCombineSimplifyDemanded.cpp759 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
762 if (Rem->isAllOnesValue())
764 APInt RA = Rem->getValue().abs();
H A DInstCombineShifts.cpp49 Value *Rem = Builder->CreateAnd(A, ConstantInt::get(I.getType(), *B-1), local
51 I.setOperand(1, Rem);
/external/clang/include/clang/AST/
H A DStmtVisitor.h122 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
H A DDataRecursiveASTVisitor.h50 OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \
57 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \
H A DRecursiveASTVisitor.h50 OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \
57 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \
/external/clang/lib/CodeGen/
H A DCoverageMappingGen.cpp967 if (size_t Rem = OS.str().size() % 8) {
968 CoverageMappingSize += 8 - Rem;
969 for (size_t I = 0, S = 8 - Rem; I < S; ++I)
H A DCGStmt.cpp1164 uint64_t Weight = Total / NCases, Rem = Total % NCases; local
1167 SwitchWeights->push_back(Weight + (Rem ? 1 : 0));
1168 if (Rem)
1169 Rem--;
H A DCGExprScalar.cpp516 HANDLEBINOP(Rem)
2298 // Rem in C can't be a floating point type: C99 6.5.5p2.
3527 COMPOUND_OP(Rem);
/external/llvm/lib/MC/
H A DWinCOFFObjectWriter.cpp463 unsigned Rem = Value % 64; local
465 *(Ptr--) = Alphabet[Rem];
/external/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp569 int64_t Rem = StepVal % Size; local
570 if (Rem)
H A DValueTracking.cpp1251 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1252 APInt RA = Rem->getValue().abs();
1289 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) {
1290 APInt RA = Rem->getValue();
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp2323 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
2324 const APInt &RA = Rem->getAPIntValue().abs();
2347 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
2348 const APInt &RA = Rem->getAPIntValue();

Completed in 3928 milliseconds

12