/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/InstCombine/ |
H A D | InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===// 26 SmallVector<Instruction*, 256> Worklist; member in class:llvm::InstCombineWorklist 34 bool isEmpty() const { return Worklist.empty(); } 39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) { 41 Worklist.push_back(I); 54 assert(Worklist.empty() && "Worklist must be empty to add initial group"); 55 Worklist.reserve(NumEntries+16); 61 Worklist.push_back(I); 71 Worklist[I [all...] |
H A D | InstCombine.h | 59 InstCombineWorklist &Worklist; member in class:llvm::InstCombineIRInserter 61 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {} 66 Worklist.Add(I); 78 /// Worklist - All of the instructions that need to be simplified. 79 InstCombineWorklist Worklist; member in class:llvm::InstCombiner 240 Worklist.Add(New); 259 Worklist.AddUsersToWorkList(I); // Add all modified instrs to worklist. 286 Worklist.Add(Op); 288 Worklist.Remove(&I);
|
H A D | InstructionCombining.cpp | 1112 SmallVector<Instruction*, 4> Worklist; local 1113 Worklist.push_back(AI); 1116 Instruction *PI = Worklist.pop_back_val(); 1128 Worklist.push_back(I); 1183 } while (!Worklist.empty()); 1273 Worklist.Add(Cond); 1289 Worklist.Add(Cond); 1313 Worklist.Add(I); 1860 SmallVector<BasicBlock*, 256> Worklist; local 1861 Worklist [all...] |
H A D | InstCombineMulDivRem.cpp | 339 Worklist.Add(BBI); 343 Worklist.Add(BBI); 685 Worklist.AddValue(I.getOperand(1)); 731 Worklist.AddValue(I.getOperand(1));
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
H A D | CaptureTracking.cpp | 79 SmallVector<Use*, Threshold> Worklist; local 93 Worklist.push_back(U); 96 while (!Worklist.empty()) { 97 Use *U = Worklist.pop_back_val(); 149 Worklist.push_back(U);
|
H A D | BasicAliasAnalysis.cpp | 550 SmallVector<const Value *, 16> Worklist; local 551 Worklist.push_back(Loc.Ptr); 553 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD); 577 Worklist.push_back(SI->getTrueValue()); 578 Worklist.push_back(SI->getFalseValue()); 591 Worklist.push_back(PN->getIncomingValue(i)); 599 } while (!Worklist.empty() && --MaxLookup); 602 return Worklist.empty();
|
H A D | ScalarEvolution.cpp | 2928 /// onto the given Worklist. 2931 SmallVectorImpl<Instruction *> &Worklist) { 2932 // Push the def-use children onto the Worklist stack. 2935 Worklist.push_back(cast<Instruction>(*UI)); 2944 SmallVector<Instruction *, 16> Worklist; 2945 PushDefUseChildren(PN, Worklist); 2949 while (!Worklist.empty()) { 2950 Instruction *I = Worklist.pop_back_val(); 2978 PushDefUseChildren(I, Worklist); 4020 /// onto the given Worklist [all...] |
H A D | ValueTracking.cpp | 1805 SmallVector<Value *, 4> Worklist; local 1806 Worklist.push_back(V); 1808 Value *P = Worklist.pop_back_val(); 1815 Worklist.push_back(SI->getTrueValue()); 1816 Worklist.push_back(SI->getFalseValue()); 1822 Worklist.push_back(PN->getIncomingValue(i)); 1827 } while (!Worklist.empty());
|
H A D | MemoryDependenceAnalysis.cpp | 1002 SmallVector<BasicBlock*, 32> Worklist; local 1003 Worklist.push_back(StartBB); 1016 while (!Worklist.empty()) { 1017 BasicBlock *BB = Worklist.pop_back_val(); 1066 Worklist.append(NewBlocks.begin(), NewBlocks.end());
|
H A D | InstructionSimplify.cpp | 2888 SmallSetVector<Instruction *, 8> Worklist; local 2896 Worklist.insert(cast<Instruction>(*UI)); 2906 Worklist.insert(I); 2910 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) { 2911 I = Worklist[Idx]; 2925 Worklist.insert(cast<Instruction>(*UI));
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
H A D | LoopUnswitch.cpp | 212 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L); 214 std::vector<Instruction*> &Worklist, Loop *l); 908 std::vector<Instruction*> &Worklist) { 909 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(), 910 Worklist.end(), I); 911 while (WI != Worklist.end()) { 912 unsigned Offset = WI-Worklist.begin(); 913 Worklist.erase(WI); 914 WI = std::find(Worklist.begin()+Offset, Worklist 907 RemoveFromWorklist(Instruction *I, std::vector<Instruction*> &Worklist) argument 920 ReplaceUsesOfWith(Instruction *I, Value *V, std::vector<Instruction*> &Worklist, Loop *L, LPPassManager *LPM) argument 944 RemoveBlockIfDead(BasicBlock *BB, std::vector<Instruction*> &Worklist, Loop *L) argument 1080 std::vector<Instruction*> Worklist; local 1195 SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L) argument [all...] |
H A D | SimplifyCFGPass.cpp | 111 SmallVector<BasicBlock*, 128> Worklist; local 112 Worklist.push_back(BB); 115 BB = Worklist.pop_back_val(); 178 Worklist.push_back(*SI); 179 } while (!Worklist.empty());
|
H A D | ObjCARC.cpp | 612 SmallVector<const Value *, 4> Worklist; local 613 Worklist.push_back(BlockPtr); 615 const Value *V = Worklist.pop_back_val(); 635 Worklist.push_back(UUser); 653 } while (!Worklist.empty()); 1184 SmallVector<const Value *, 8> Worklist; local 1185 Worklist.push_back(P); 1188 P = Worklist.pop_back_val(); 1206 Worklist.push_back(Ur); 1208 } while (!Worklist 2100 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist; local 2391 SmallVector<std::pair<Instruction *, const Value *>, 4> Worklist; local [all...] |
H A D | Reassociate.cpp | 469 // Worklist of non-leaf nodes (their operands are in the expression too) along 473 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight) local 474 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1))); 499 while (!Worklist.empty()) { 500 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val(); 521 Worklist.push_back(std::make_pair(BO, Weight)); 559 Worklist.push_back(std::make_pair(BO, It->second)); 591 Worklist.push_back(std::make_pair(BO, Weight));
|
H A D | LoopStrengthReduce.cpp | 2223 SmallVector<const SCEV *, 4> Worklist; local 2231 Worklist.push_back(Expr); 2233 const SCEV *S = Worklist.pop_back_val(); 2237 Worklist.push_back(AR->getStart()); 2239 Worklist.append(Add->op_begin(), Add->op_end()); 2241 } while (!Worklist.empty()); 2938 SmallVector<const SCEV *, 8> Worklist(RegUses.begin(), RegUses.end()); 2941 while (!Worklist.empty()) { 2942 const SCEV *S = Worklist.pop_back_val(); 2945 Worklist 3219 SmallVector<int64_t, 2> Worklist; local [all...] |
H A D | GVN.cpp | 2045 SmallVector<std::pair<Value*, Value*>, 4> Worklist; local 2046 Worklist.push_back(std::make_pair(LHS, RHS)); 2052 while (!Worklist.empty()) { 2053 std::pair<Value*, Value*> Item = Worklist.pop_back_val(); 2124 Worklist.push_back(std::make_pair(A, RHS)); 2125 Worklist.push_back(std::make_pair(B, RHS)); 2139 Worklist.push_back(std::make_pair(Op0, Op1));
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
H A D | DominatorInternals.h | 57 typename GraphT::ChildIteratorType>, 32> Worklist; local 58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); 59 while (!Worklist.empty()) { 60 typename GraphT::NodeType* BB = Worklist.back().first; 61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; 85 Worklist.pop_back(); 90 ++Worklist.back().second; 99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
H A D | ScalarEvolutionExpressions.h | 508 SmallVector<const SCEV *, 8> Worklist; member in class:llvm::SCEVTraversal 513 Worklist.push_back(S); 520 while (!Worklist.empty() && !Visitor.isDone()) { 521 const SCEV *S = Worklist.pop_back_val();
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 290 std::vector<RenamePassData> &Worklist); 492 SmallVector<DomTreeNode*, 32> Worklist; local 496 Worklist.push_back(Root); 498 while (!Worklist.empty()) { 499 DomTreeNode *Node = Worklist.pop_back_val(); 504 Worklist.push_back(*CI); 771 SmallVector<DomTreeNode*, 32> Worklist; local 783 Worklist.clear(); 784 Worklist.push_back(Root); 786 while (!Worklist 1018 RenamePass(BasicBlock *BB, BasicBlock *Pred, RenamePassData::ValVector &IncomingVals, std::vector<RenamePassData> &Worklist) argument [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/IPO/ |
H A D | MergeFunctions.cpp | 621 std::vector<WeakVH> Worklist; local 622 Deferred.swap(Worklist); 625 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n'); 629 for (std::vector<WeakVH>::iterator I = Worklist.begin(), 630 E = Worklist.end(); I != E; ++I) { 644 for (std::vector<WeakVH>::iterator I = Worklist.begin(), 645 E = Worklist.end(); I != E; ++I) { 852 std::vector<Value *> Worklist; local 853 Worklist.push_back(V); 854 while (!Worklist [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/ |
H A D | DAGDeltaAlgorithm.cpp | 208 std::vector<change_ty> Worklist(Roots.begin(), Roots.end()); 209 while (!Worklist.empty()) { 210 change_ty Change = Worklist.back(); 211 Worklist.pop_back(); 218 Worklist.push_back(*it);
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 199 Worklist.push_back(I); 206 while (!Worklist.empty()) { 212 SDNode *N = Worklist.back(); 213 Worklist.pop_back(); 363 Worklist.push_back(User); 381 Worklist.push_back(User); 514 Worklist.push_back(N);
|
H A D | ScheduleDAGSDNodes.cpp | 325 SmallVector<SDNode*, 64> Worklist; 327 Worklist.push_back(DAG->getRoot().getNode()); 331 while (!Worklist.empty()) { 332 SDNode *NI = Worklist.pop_back_val(); 337 Worklist.push_back(NI->getOperand(i).getNode());
|
H A D | SelectionDAGISel.cpp | 509 SmallVector<SDNode*, 128> Worklist; local 511 Worklist.push_back(CurDAG->getRoot().getNode()); 517 SDNode *N = Worklist.pop_back_val(); 526 Worklist.push_back(N->getOperand(i).getNode()); 545 } while (!Worklist.empty());
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
H A D | MachineLICM.cpp | 355 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end()); 356 while (!Worklist.empty()) { 357 CurLoop = Worklist.pop_back_val(); 364 Worklist.append(CurLoop->begin(), CurLoop->end());
|