/external/libcxx/test/containers/sequences/deque/deque.special/ |
H A D | copy.pass.cpp | 53 typedef input_iterator<CI> ICI; typedef 66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());
|
/external/llvm/lib/Transforms/Utils/ |
H A D | CmpInstAnalysis.cpp | 44 unsigned llvm::getICmpCode(const ICmpInst *ICI, bool InvertPred) { argument 45 ICmpInst::Predicate Pred = InvertPred ? ICI->getInversePredicate() 46 : ICI->getPredicate();
|
H A D | SimplifyCFG.cpp | 355 if (ICmpInst *ICI = dyn_cast<ICmpInst>(I)) { 360 if (ICI->getPredicate() == (isEQ ? ICmpInst::ICMP_EQ:ICmpInst::ICMP_NE)) { 363 if (match(ICI->getOperand(0), 383 ConstantRange::makeICmpRegion(ICI->getPredicate(), C->getValue()); 481 if (ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition())) 482 if (ICI->isEquality() && GetConstantInt(ICI->getOperand(1), DL)) 483 CV = ICI->getOperand(0); 511 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); local 512 BasicBlock *Succ = BI->getSuccessor(ICI 751 ICmpInst *ICI = cast<ICmpInst>(BI->getCondition()); local 2650 TryToSimplifyUncondBranchWithICmpInIt( ICmpInst *ICI, IRBuilder<> &Builder, const TargetTransformInfo &TTI, const DataLayout *DL) argument [all...] |
/external/libcxx/test/containers/sequences/deque/deque.cons/ |
H A D | assign_iter_iter.pass.cpp | 69 typedef input_iterator<CI> ICI; typedef 71 c1.assign(ICI(c2.begin()), ICI(c2.end()));
|
/external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | insert_iter_iter.pass.cpp | 134 typedef input_iterator<CI> ICI; typedef 136 CI i = c1.insert(c1.begin() + P, ICI(c2.begin()), ICI(c2.end()));
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineSelect.cpp | 31 ICmpInst *ICI = dyn_cast<ICmpInst>(SI->getCondition()); 32 if (!ICI) return SPF_UNKNOWN; 34 ICmpInst::Predicate Pred = ICI->getPredicate(); 35 Value *CmpLHS = ICI->getOperand(0); 36 Value *CmpRHS = ICI->getOperand(1); 470 ICmpInst *ICI) { 472 ICmpInst::Predicate Pred = ICI->getPredicate(); 473 Value *CmpLHS = ICI->getOperand(0); 474 Value *CmpRHS = ICI->getOperand(1); 479 // can be adjusted to fit the min/max idiom. We may move or edit ICI 469 visitSelectInstWithICmp(SelectInst &SI, ICmpInst *ICI) argument [all...] |
H A D | InstCombineMulDivRem.cpp | 838 Value *ICI = IC.Builder->CreateICmpULT(Op0, cast<ConstantInt>(Op1)); local 840 return SelectInst::Create(ICI, Constant::getNullValue(I.getType()),
|
H A D | InstCombineCasts.cpp | 513 Instruction *InstCombiner::transformZExtICmp(ICmpInst *ICI, Instruction &CI, argument 518 if (ConstantInt *Op1C = dyn_cast<ConstantInt>(ICI->getOperand(1))) { 523 if ((ICI->getPredicate() == ICmpInst::ICMP_SLT && Op1CV == 0) || 524 (ICI->getPredicate() == ICmpInst::ICMP_SGT &&Op1CV.isAllOnesValue())) { 525 if (!DoXform) return ICI; 527 Value *In = ICI->getOperand(0); 534 if (ICI->getPredicate() == ICmpInst::ICMP_SGT) { 552 ICI->isEquality()) { 556 computeKnownBits(ICI->getOperand(0), KnownZero, KnownOne); 560 if (!DoXform) return ICI; 894 transformSExtICmp(ICmpInst *ICI, Instruction &CI) argument [all...] |
H A D | InstCombineCompares.cpp | 221 CmpInst &ICI, ConstantInt *AndCst) { 298 Constant *CompareRHS = cast<Constant>(ICI.getOperand(1)); 311 Constant *C = ConstantFoldCompareInstOperands(ICI.getPredicate(), Elt, 402 return ReplaceInstUsesWith(ICI, Builder->getFalse()); 422 return ReplaceInstUsesWith(ICI, Builder->getTrue()); 740 Instruction *InstCombiner::FoldICmpAddOpCst(Instruction &ICI, argument 747 return ReplaceInstUsesWith(ICI, ConstantInt::get(ICI.getType(), isTrue)); 752 return ReplaceInstUsesWith(ICI, Builder->getFalse()); 756 return ReplaceInstUsesWith(ICI, Builde 220 FoldCmpLoadFromIndexedGlobal(GetElementPtrInst *GEP, GlobalVariable *GV, CmpInst &ICI, ConstantInt *AndCst) argument 804 FoldICmpDivCst(ICmpInst &ICI, BinaryOperator *DivI, ConstantInt *DivRHS) argument 961 FoldICmpShrCst(ICmpInst &ICI, BinaryOperator *Shr, ConstantInt *ShAmt) argument 1050 visitICmpInstWithInstAndIntCst(ICmpInst &ICI, Instruction *LHSI, ConstantInt *RHS) argument 1790 visitICmpInstWithCastAndCast(ICmpInst &ICI) argument [all...] |
H A D | InstructionCombining.cpp | 1748 ICmpInst *ICI = cast<ICmpInst>(I); local 1750 if (!ICI->isEquality() || !isa<ConstantPointerNull>(ICI->getOperand(1)))
|
/external/llvm/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 803 ICmpInst *ICI = dyn_cast<ICmpInst>(BI->getCondition()); local 804 if (ICI && isa<Constant>(ICI->getOperand(1))) { 805 if (ICI->isEquality() && ICI->getOperand(0) == Val) { 808 if (isTrueDest == (ICI->getPredicate() == ICmpInst::ICMP_EQ)) 809 Result = LVILatticeVal::get(cast<Constant>(ICI->getOperand(1))); 811 Result = LVILatticeVal::getNot(cast<Constant>(ICI->getOperand(1))); 818 if (ICI->getPredicate() == ICmpInst::ICMP_ULT) 819 match(ICI [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | Scalarizer.cpp | 81 // ICmpSpliiter(ICI)(Builder, X, Y, Name) uses Builder to create an ICmp 82 // called Name that compares X and Y in the same way as ICI. 84 ICmpSplitter(ICmpInst &ici) : ICI(ici) {} 87 return Builder.CreateICmp(ICI.getPredicate(), Op0, Op1, Name); 89 ICmpInst &ICI; member in struct:__anon25499::ICmpSplitter 413 bool Scalarizer::visitICmpInst(ICmpInst &ICI) { argument 414 return splitBinary(ICI, ICmpSplitter(ICI));
|
/external/llvm/lib/Transforms/IPO/ |
H A D | GlobalOpt.cpp | 896 ICmpInst *ICI = dyn_cast<ICmpInst>(LoadUse.getUser()); local 897 if (!ICI) { 906 LI->isUnordered() ? (Instruction*)ICI : LI); 908 switch (ICI->getPredicate()) { 917 LV = BinaryOperator::CreateNot(LV, "notinit", ICI); 926 ICI->replaceAllUsesWith(LV); 927 ICI->eraseFromParent(); 1058 if (const ICmpInst *ICI = dyn_cast<ICmpInst>(UI)) { 1059 if (!isa<ConstantPointerNull>(ICI->getOperand(1)))
|