| /external/bison/djgpp/ |
| D | 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 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 …]
|
| D | config.bat | 2 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 This program is distributed in the hope that it will be useful,
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | IntegerDivision.cpp | 376 bool llvm::expandRemainder(BinaryOperator *Rem) { in expandRemainder() argument
377 assert((Rem->getOpcode() == Instruction::SRem || in expandRemainder()
378 Rem->getOpcode() == Instruction::URem) && in expandRemainder()
381 IRBuilder<> Builder(Rem); in expandRemainder()
383 Type *RemTy = Rem->getType(); in expandRemainder()
393 if (Rem->getOpcode() == Instruction::SRem) { in expandRemainder()
394 Value *Remainder = generateSignedRemainderCode(Rem->getOperand(0), in expandRemainder()
395 Rem->getOperand(1), Builder); in expandRemainder()
397 Rem->replaceAllUsesWith(Remainder); in expandRemainder()
398 Rem->dropAllReferences(); in expandRemainder()
[all …]
|
| D | SimplifyIndVar.cpp | 74 void eliminateIVRemainder(BinaryOperator *Rem, Value *IVOperand,
187 void SimplifyIndvar::eliminateIVRemainder(BinaryOperator *Rem, in eliminateIVRemainder() argument
192 if (IVOperand != Rem->getOperand(0)) in eliminateIVRemainder()
196 const SCEV *S = SE->getSCEV(Rem->getOperand(0)); in eliminateIVRemainder()
197 const SCEV *X = SE->getSCEV(Rem->getOperand(1)); in eliminateIVRemainder()
200 const Loop *ICmpLoop = LI->getLoopFor(Rem->getParent()); in eliminateIVRemainder()
208 Rem->replaceAllUsesWith(Rem->getOperand(0)); in eliminateIVRemainder()
221 ICmpInst *ICmp = new ICmpInst(Rem, ICmpInst::ICMP_EQ, in eliminateIVRemainder()
222 Rem->getOperand(0), Rem->getOperand(1)); in eliminateIVRemainder()
225 ConstantInt::get(Rem->getType(), 0), in eliminateIVRemainder()
[all …]
|
| /external/llvm/lib/Support/ |
| D | BranchProbability.cpp | 52 uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32; in scale() local
53 uint64_t UpperQ = Rem / D; in scale()
59 Rem = ((Rem % D) << 32) | Lower32; in scale()
60 uint64_t LowerQ = Rem / D; in scale()
|
| /external/llvm/unittests/Transforms/Utils/ |
| D | IntegerDivision.cpp | 101 Value *Rem = Builder.CreateSRem(A, B); in TEST() local
104 Value *Ret = Builder.CreateRet(Rem); in TEST()
106 expandRemainder(cast<BinaryOperator>(Rem)); in TEST()
131 Value *Rem = Builder.CreateURem(A, B); in TEST() local
134 Value *Ret = Builder.CreateRet(Rem); in TEST()
136 expandRemainder(cast<BinaryOperator>(Rem)); in TEST()
222 Value *Rem = Builder.CreateSRem(A, B); in TEST() local
225 Value *Ret = Builder.CreateRet(Rem); in TEST()
227 expandRemainder(cast<BinaryOperator>(Rem)); in TEST()
252 Value *Rem = Builder.CreateURem(A, B); in TEST() local
[all …]
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | IntegerDivision.h | 33 bool expandRemainder(BinaryOperator *Rem);
50 bool expandRemainderUpTo32Bits(BinaryOperator *Rem);
56 bool expandRemainderUpTo64Bits(BinaryOperator *Rem);
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 1644 Rem = rem; in init()
1755 unsigned OtherCritCount = Rem->RemIssueCount in getOtherResourceCount()
1761 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx]; in getOtherResourceCount()
1876 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted"); in countResource()
1877 Rem->RemainingCounts[PIdx] -= Count; in countResource()
1944 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted"); in bumpNode()
1945 Rem->RemIssueCount -= DecRemIssue; in bumpNode()
2189 if (IsPostRA || (RemLatency + CurrZone.getCurrCycle() > Rem.CriticalPath)) { in setPolicy()
2194 << Rem.CriticalPath << "\n"); in setPolicy()
2371 Rem.init(DAG, SchedModel); in initialize()
[all …]
|
| D | TargetSchedule.cpp | 41 unsigned Rem = Dividend % Divisor; in gcd() local
43 Divisor = Rem; in gcd()
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| D | AMDGPUISelLowering.cpp | 274 SDValue Rem = DAG.getSelectCC(DL, Tmp1, DAG.getConstant(0, VT), in LowerUDIVREM() local
278 Rem = DAG.getSelectCC(DL, Remainder_GE_Zero, DAG.getConstant(0, VT), in LowerUDIVREM()
279 Remainder_A_Den, Rem, ISD::SETEQ); in LowerUDIVREM()
282 DAG.ReplaceAllUsesWith(Op.getValue(1).getNode(), &Rem); in LowerUDIVREM()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 564 SchedRemainder *Rem; variable
633 DAG(nullptr), SchedModel(nullptr), Rem(nullptr), Available(ID, Name+".A"), in SchedBoundary()
829 SchedRemainder Rem; variable
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineMulDivRem.cpp | 319 Value *Rem; in visitMul() local
321 Rem = Builder->CreateURem(Op0BO, Op1BO); in visitMul()
323 Rem = Builder->CreateSRem(Op0BO, Op1BO); in visitMul()
324 Rem->takeName(BO); in visitMul()
327 return BinaryOperator::CreateSub(Op0BO, Rem); in visitMul()
328 return BinaryOperator::CreateSub(Rem, Op0BO); in visitMul()
|
| D | InstCombineSimplifyDemanded.cpp | 759 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { in SimplifyDemandedUseBits() local
762 if (Rem->isAllOnesValue()) in SimplifyDemandedUseBits()
764 APInt RA = Rem->getValue().abs(); in SimplifyDemandedUseBits()
|
| D | InstCombineShifts.cpp | 49 Value *Rem = Builder->CreateAnd(A, ConstantInt::get(I.getType(), *B-1), in commonShiftTransforms() local
51 I.setOperand(1, Rem); in commonShiftTransforms()
|
| /external/llvm/lib/Target/R600/ |
| D | AMDGPUISelLowering.cpp | 1629 SDValue Rem = DAG.getNode(ISD::MUL, DL, VT, Div, RHS); in LowerDIVREM24() local
1630 Rem = DAG.getNode(ISD::SUB, DL, VT, LHS, Rem); in LowerDIVREM24()
1634 Rem in LowerDIVREM24()
1821 SDValue Rem = DAG.getSelectCC(DL, Tmp1, DAG.getConstant(0, VT), in LowerUDIVREM() local
1825 Rem = DAG.getSelectCC(DL, Remainder_GE_Zero, DAG.getConstant(0, VT), in LowerUDIVREM()
1826 Remainder_A_Den, Rem, ISD::SETEQ); in LowerUDIVREM()
1829 Rem in LowerUDIVREM()
1879 SDValue Rem = Div.getValue(1); in LowerSDIVREM() local
1882 Rem = DAG.getNode(ISD::XOR, DL, VT, Rem, RSign); in LowerSDIVREM()
1885 Rem = DAG.getNode(ISD::SUB, DL, VT, Rem, RSign); in LowerSDIVREM()
[all …]
|
| /external/clang/include/clang/AST/ |
| D | StmtVisitor.h | 122 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem) in BINOP_FALLBACK()
|
| D | DataRecursiveASTVisitor.h | 50 OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) OPERATOR(Shl) OPERATOR(Shr) \
57 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \
|
| D | RecursiveASTVisitor.h | 50 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/ |
| D | CoverageMappingGen.cpp | 967 if (size_t Rem = OS.str().size() % 8) { in emit() local
968 CoverageMappingSize += 8 - Rem; in emit()
969 for (size_t I = 0, S = 8 - Rem; I < S; ++I) in emit()
|
| D | CGStmt.cpp | 1164 uint64_t Weight = Total / NCases, Rem = Total % NCases; in EmitCaseStmtRange() local
1167 SwitchWeights->push_back(Weight + (Rem ? 1 : 0)); in EmitCaseStmtRange()
1168 if (Rem) in EmitCaseStmtRange()
1169 Rem--; in EmitCaseStmtRange()
|
| D | CGExprScalar.cpp | 516 HANDLEBINOP(Rem)
3527 COMPOUND_OP(Rem); in EmitCompoundAssignmentLValue()
|
| /external/llvm/lib/MC/ |
| D | WinCOFFObjectWriter.cpp | 463 unsigned Rem = Value % 64; in encodeBase64StringEntry() local
465 *(Ptr--) = Alphabet[Rem]; in encodeBase64StringEntry()
|
| /external/llvm/lib/Analysis/ |
| D | LoopAccessAnalysis.cpp | 569 int64_t Rem = StepVal % Size; in isStridedPtr() local
570 if (Rem) in isStridedPtr()
|
| D | ValueTracking.cpp | 1251 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { in computeKnownBits() local
1252 APInt RA = Rem->getValue().abs(); in computeKnownBits()
1289 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { in computeKnownBits() local
1290 APInt RA = Rem->getValue(); in computeKnownBits()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | SelectionDAG.cpp | 2323 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { in computeKnownBits() local
2324 const APInt &RA = Rem->getAPIntValue().abs(); in computeKnownBits()
2347 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) { in computeKnownBits() local
2348 const APInt &RA = Rem->getAPIntValue(); in computeKnownBits()
|