/external/llvm/include/llvm/Transforms/Utils/ |
IntegerDivision.h | 26 /// Generate code to calculate the remainder of two integers, replacing Rem 33 /// @brief Replace Rem with generated code. 34 bool expandRemainder(BinaryOperator *Rem); 46 /// Generate code to calculate the remainder of two integers, replacing Rem 50 /// @brief Replace Rem with generated code. 51 bool expandRemainderUpTo32Bits(BinaryOperator *Rem); 57 /// @brief Replace Rem with generated code.
|
/external/bison/djgpp/ |
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...] |
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/ |
SimplifyIndVar.cpp | 76 void eliminateIVRemainder(BinaryOperator *Rem, Value *IVOperand, 185 void SimplifyIndvar::eliminateIVRemainder(BinaryOperator *Rem, 190 if (IVOperand != Rem->getOperand(0)) 194 const SCEV *S = SE->getSCEV(Rem->getOperand(0)); 195 const SCEV *X = SE->getSCEV(Rem->getOperand(1)); 198 const Loop *ICmpLoop = LI->getLoopFor(Rem->getParent()); 206 Rem->replaceAllUsesWith(Rem->getOperand(0)); 219 ICmpInst *ICmp = new ICmpInst(Rem, ICmpInst::ICMP_EQ, 220 Rem->getOperand(0), Rem->getOperand(1)) [all...] |
IntegerDivision.cpp | 326 /// Generate code to calculate the remainder of two integers, replacing Rem with 333 /// @brief Replace Rem with generated code. 334 bool llvm::expandRemainder(BinaryOperator *Rem) { 335 assert((Rem->getOpcode() == Instruction::SRem || 336 Rem->getOpcode() == Instruction::URem) && 339 IRBuilder<> Builder(Rem); 342 if (Rem->getOpcode() == Instruction::SRem) { 343 Value *Remainder = generateSignedRemainderCode(Rem->getOperand(0), 344 Rem->getOperand(1), Builder); 346 Rem->replaceAllUsesWith(Remainder) [all...] |
/external/llvm/unittests/Transforms/Utils/ |
IntegerDivision.cpp | 100 Value *Rem = Builder.CreateSRem(A, B); 103 Value *Ret = Builder.CreateRet(Rem); 105 expandRemainder(cast<BinaryOperator>(Rem)); 130 Value *Rem = Builder.CreateURem(A, B); 133 Value *Ret = Builder.CreateRet(Rem); 135 expandRemainder(cast<BinaryOperator>(Rem));
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
omxVCM4P2_PredictReconCoefIntra_s.s | 110 Rem RN 14 164 MLA Rem,negdcScaler,tempPred,absCoeffDC ;// Rem = pPredBufRow(Col)[0]-tempPred*dcScaler 168 CMP Rem,temp3 169 ADDGE tempPred,#1 ;// If Rem>=round(dcScaler/2);tempPred=tempPred+1 217 MLA Rem,negCurQP,tempPred,absCoeffAC ;// Rem=abs(pPredBufRow[i])-tempPred*curQP 220 CMP Rem,curQP 221 ADDGE tempPred,#1 ;// if Rem>=round(curQP/2); tempPred=tempPred+1 255 MLA Rem,negCurQP,tempPred,absCoeffA [all...] |
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | [all...] |
TargetSchedule.cpp | 42 unsigned Rem = Dividend % Divisor; 44 Divisor = Rem;
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
omxVCM4P2_PredictReconCoefIntra_s.s | 103 Rem RN 11 187 MLA Rem,negdcScaler,tempPred,absCoeffDC ;// Remainder Rem=abs(pPredBufRow(Col)[0])-tempPred*dcScaler 191 CMP Rem,temp3 ;// compare Rem with (dcScaler/2) 192 ADDGE tempPred,#1 ;// tempPred=tempPred+1 if Rem>=(dcScaler/2)
|
/external/llvm/lib/Target/R600/ |
AMDGPUISelLowering.cpp | 325 // Calculate Rem result: 333 // Rem = (Tmp1 == 0 ? Remainder : Remainder_S_Den) 334 SDValue Rem = DAG.getSelectCC(DL, Tmp1, DAG.getConstant(0, VT), 337 // Rem = (Remainder_GE_Zero == 0 ? Remainder_A_Den : Rem) 338 Rem = DAG.getSelectCC(DL, Remainder_GE_Zero, DAG.getConstant(0, VT), 339 Remainder_A_Den, Rem, ISD::SETEQ); 342 Ops[1] = Rem;
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineMulDivRem.cpp | 204 Value *Rem; 206 Rem = Builder->CreateURem(Op0BO, Op1BO); 208 Rem = Builder->CreateSRem(Op0BO, Op1BO); 209 Rem->takeName(BO); 212 return BinaryOperator::CreateSub(Op0BO, Rem); 213 return BinaryOperator::CreateSub(Rem, Op0BO); 541 // div/rem X, (Cond ? 0 : Y) -> div/rem X, Y 546 // div/rem X, (Cond ? Y : 0) -> div/rem X, [all...] |
InstCombineSimplifyDemanded.cpp | 716 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { 719 if (Rem->isAllOnesValue()) 721 APInt RA = Rem->getValue().abs(); [all...] |
InstCombineShifts.cpp | 47 Value *Rem = Builder->CreateAnd(A, ConstantInt::get(I.getType(), *B-1), 49 I.setOperand(1, Rem);
|
/external/clang/include/clang/AST/ |
StmtVisitor.h | 121 BINOP_FALLBACK(Mul) BINOP_FALLBACK(Div) BINOP_FALLBACK(Rem)
|
RecursiveASTVisitor.h | 50 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) \ 64 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \ [all...] |
/external/llvm/lib/Analysis/ |
ValueTracking.cpp | 547 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { 548 APInt RA = Rem->getValue().abs(); 584 if (ConstantInt *Rem = dyn_cast<ConstantInt>(I->getOperand(1))) { 585 APInt RA = Rem->getValue(); [all...] |
/external/clang/tools/libclang/ |
RecursiveASTVisitor.h | 50 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) \ 64 OPERATOR(Mul) OPERATOR(Div) OPERATOR(Rem) OPERATOR(Add) OPERATOR(Sub) \ [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAG.cpp | [all...] |
LegalizeDAG.cpp | [all...] |
/external/clang/lib/CodeGen/ |
CGExprScalar.cpp | 467 HANDLEBINOP(Rem) [all...] |