| /external/llvm/lib/Transforms/ObjCARC/ |
| ProvenanceAnalysis.cpp | 77 SmallVector<const Value *, 8> Worklist;
78 Worklist.push_back(P);
81 P = Worklist.pop_back_val();
99 Worklist.push_back(Ur);
101 } while (!Worklist.empty());
|
| DependencyAnalysis.cpp | 212 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist;
213 Worklist.push_back(std::make_pair(StartBB, StartPos));
216 Worklist.pop_back_val();
227 // Add the predecessors to the worklist.
231 Worklist.push_back(std::make_pair(PredBB, PredBB->end()));
242 } while (!Worklist.empty());
|
| ObjCARCOpts.cpp | 179 SmallVector<const Value *, 4> Worklist;
180 Worklist.push_back(Ptr);
184 Worklist.push_back(*I);
191 const Value *V = Worklist.pop_back_val();
224 Worklist.push_back(UUser);
247 } while (!Worklist.empty());
[all...] |
| /external/llvm/lib/Analysis/ |
| CaptureTracking.cpp | 84 SmallVector<Use*, Threshold> Worklist;
98 Worklist.push_back(U);
101 while (!Worklist.empty()) {
102 Use *U = Worklist.pop_back_val();
154 Worklist.push_back(U);
|
| BasicAliasAnalysis.cpp | 550 SmallVector<const Value *, 16> Worklist;
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();
[all...] |
| MemoryDependenceAnalysis.cpp | 649 // determine what is dirty, seeding our initial DirtyBlocks worklist.
749 // the predecessors of this block. Add them to our worklist.
[all...] |
| InstructionSimplify.cpp | [all...] |
| ValueTracking.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineWorklist.h | 1 //===- InstCombineWorklist.h - Worklist for the InstCombine pass ----------===//
23 /// InstCombineWorklist - This is the worklist management logic for
26 SmallVector<Instruction*, 256> Worklist;
34 bool isEmpty() const { return Worklist.empty(); }
36 /// Add - Add the specified instruction to the worklist if it isn't already
39 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
41 Worklist.push_back(I);
51 /// which should only be done when the worklist is empty and when the group
54 assert(Worklist.empty() && "Worklist must be empty to add initial group")
[all...] |
| InstCombine.h | 57 /// to the instcombine worklist.
60 InstCombineWorklist &Worklist;
62 InstCombineIRInserter(InstCombineWorklist &WL) : Worklist(WL) {}
67 Worklist.Add(I);
81 /// Worklist - All of the instructions that need to be simplified.
82 InstCombineWorklist Worklist;
85 /// instructions into the worklist when they are created.
239 // in the program. Add the new instruction to the worklist.
246 Worklist.Add(New);
260 // we add all uses of I to the worklist, replace all uses of I with the ne
[all...] |
| InstructionCombining.cpp | 20 // This is a simple worklist driven algorithm.
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| DominatorInternals.h | 57 typename GraphT::ChildIteratorType>, 32> Worklist;
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;
83 // If we are done with this block, remove it from the worklist.
85 Worklist.pop_back();
90 ++Worklist.back().second;
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
| PtrUseVisitor.h | 115 /// This is used to maintain a worklist fo to-visit uses. This is used to
123 /// \brief The worklist of to-visit uses.
124 SmallVector<UseToVisit, 8> Worklist;
153 /// \brief Enqueue the users of this instruction in the visit worklist.
178 /// The recursive visit of uses is accomplished with a worklist, so the only
216 // Visit all the uses off the worklist until it is empty.
217 while (!Worklist.empty()) {
218 UseToVisit ToVisit = Worklist.pop_back_val();
|
| ScalarEvolutionExpressions.h | 484 /// Visit all nodes in the expression tree using worklist traversal.
494 SmallVector<const SCEV *, 8> Worklist;
499 Worklist.push_back(S);
506 while (!Worklist.empty() && !Visitor.isDone()) {
507 const SCEV *S = Worklist.pop_back_val();
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.h | 113 /// Worklist - This defines a worklist of nodes to process. In order to be
114 /// pushed onto this worklist, all operands of a node must have already been
116 SmallVector<SDNode*, 128> Worklist;
[all...] |
| SelectionDAGISel.cpp | 526 SmallVector<SDNode*, 128> Worklist;
528 Worklist.push_back(CurDAG->getRoot().getNode());
534 SDNode *N = Worklist.pop_back_val();
540 // Otherwise, add all chain operands to the worklist.
543 Worklist.push_back(N->getOperand(i).getNode());
562 } while (!Worklist.empty());
[all...] |
| SelectionDAG.cpp | 557 // Add all obviously-dead nodes to the DeadNodes worklist.
572 // Process the worklist, deleting the nodes and adding their uses to the
573 // worklist.
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 119 SmallVector<BasicBlock*, 128> Worklist;
120 Worklist.push_back(BB);
124 BB = Worklist.pop_back_val();
185 Worklist.push_back(*SI);
186 } while (!Worklist.empty());
|
| Reassociate.cpp | 433 // Worklist of non-leaf nodes (their operands are in the expression too) along
435 // If an operator occurs in the worklist multiple times then we found multiple
437 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight)
438 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1)));
463 while (!Worklist.empty()) {
464 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val();
478 Worklist.push_back(std::make_pair(BO, Weight));
516 Worklist.push_back(std::make_pair(BO, It->second));
548 Worklist.push_back(std::make_pair(BO, Weight));
[all...] |
| LoopUnswitch.cpp | 183 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
214 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
216 std::vector<Instruction*> &Worklist, Loop *l);
[all...] |
| GVN.cpp | [all...] |
| LoopStrengthReduce.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | [all...] |
| PromoteMemoryToRegister.cpp | 294 std::vector<RenamePassData> &Worklist);
496 SmallVector<DomTreeNode*, 32> Worklist;
500 Worklist.push_back(Root);
502 while (!Worklist.empty()) {
503 DomTreeNode *Node = Worklist.pop_back_val();
508 Worklist.push_back(*CI);
562 // RenamePass may add new worklist entries.
688 // where the def is live. Blocks are added to the worklist if we need to
735 // live into it to. Add the preds to the worklist unless they are a
744 // Otherwise it is, add to the worklist
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 619 std::vector<WeakVH> Worklist;
620 Deferred.swap(Worklist);
623 DEBUG(dbgs() << "size of worklist: " << Worklist.size() << '\n');
627 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
628 E = Worklist.end(); I != E; ++I) {
642 for (std::vector<WeakVH>::iterator I = Worklist.begin(),
643 E = Worklist.end(); I != E; ++I) {
850 std::vector<Value *> Worklist;
851 Worklist.push_back(V)
[all...] |
