| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 190 SmallVector<BasicBlock *, 8> Worklist;
191 Worklist.push_back(InputBB);
193 BasicBlock *BB = Worklist.pop_back_val();
199 Worklist.push_back(WBB);
201 } while (!Worklist.empty());
463 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist,
577 Worklist.push_back(OuterL);
708 // Worklist maintains our depth-first queue of loops in this nest to process.
709 SmallVector<Loop *, 4> Worklist;
710 Worklist.push_back(L)
[all...] |
| /external/llvm/tools/llvm-rtdyld/ |
| llvm-rtdyld.cpp | 520 WorklistT Worklist;
523 Worklist.push_back(std::make_pair(CodeSection.base(), CodeSection.size()));
525 Worklist.push_back(std::make_pair(DataSection.base(), DataSection.size()));
539 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end();
547 Worklist.erase(Tmp);
562 // Process any elements remaining in the worklist.
563 while (!Worklist.empty()) {
564 std::pair<void*, uint64_t> CurEntry = Worklist.front();
565 Worklist.pop_front()
[all...] |
| /external/llvm/lib/Analysis/ |
| CFLAliasAnalysis.cpp | 785 SmallVector<ConstantExpr *, 4> Worklist;
786 Worklist.push_back(&CExprToCollapse);
790 while (!Worklist.empty()) {
791 auto *CExpr = Worklist.pop_back_val();
801 Worklist.push_back(Nested);
805 Worklist.push_back(Nested);
[all...] |
| VectorUtils.cpp | 450 SmallVector<Value *, 16> Worklist;
472 // don't add it to the worklist.
476 Worklist.push_back(&I);
481 if (Worklist.empty() || (TTI && !SeenExtFromIllegalType))
485 while (!Worklist.empty()) {
486 Value *Val = Worklist.pop_back_val();
533 Worklist.push_back(O);
|
| BasicAliasAnalysis.cpp | 478 SmallVector<const Value *, 16> Worklist;
479 Worklist.push_back(Loc.Ptr);
481 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), DL);
505 Worklist.push_back(SI->getTrueValue());
506 Worklist.push_back(SI->getFalseValue());
519 Worklist.push_back(IncValue);
527 } while (!Worklist.empty() && --MaxLookup);
530 return Worklist.empty();
[all...] |
| MemoryDependenceAnalysis.cpp | [all...] |
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 202 std::vector<change_ty> Worklist(Roots.begin(), Roots.end());
203 while (!Worklist.empty()) {
204 change_ty Change = Worklist.back();
205 Worklist.pop_back();
212 Worklist.push_back(*it);
|
| /external/llvm/lib/Transforms/Scalar/ |
| Float2Int.cpp | 189 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
190 while (!Worklist.empty()) {
191 Instruction *I = Worklist.back();
192 Worklist.pop_back();
238 Worklist.push_back(OI);
|
| LoopDistribute.cpp | 109 SmallVector<Instruction *, 8> Worklist(Set.begin(), Set.end());
110 while (!Worklist.empty()) {
111 Instruction *I = Worklist.pop_back_val();
116 Worklist.push_back(I);
587 // Build up a worklist of inner-loops to vectorize. This is necessary as the
590 SmallVector<Loop *, 8> Worklist;
596 Worklist.push_back(L);
600 for (Loop *L : Worklist)
|
| LoopLoadElimination.cpp | 515 // Build up a worklist of inner-loops to vectorize. This is necessary as the
518 SmallVector<Loop *, 8> Worklist;
524 Worklist.push_back(L);
528 for (Loop *L : Worklist) {
|
| TailRecursionElimination.cpp | 179 SmallVector<Use *, 32> Worklist;
186 Worklist.push_back(&U);
192 while (!Worklist.empty()) {
193 Use *U = Worklist.pop_back_val();
[all...] |
| RewriteStatepointsForGC.cpp | 764 SmallVector<Value*, 16> Worklist;
765 Worklist.push_back(def);
767 while (!Worklist.empty()) {
768 Value *Current = Worklist.pop_back_val();
780 Worklist.push_back(Base);
826 // effect the result. TODO: We could use a worklist here and make this run
[all...] |
| LoopStrengthReduce.cpp | [all...] |
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | [all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineLoadStoreAlloca.cpp | 588 SmallVector<Value *, 4> Worklist(1, V);
591 Value *P = Worklist.pop_back_val();
598 Worklist.push_back(SI->getTrueValue());
599 Worklist.push_back(SI->getFalseValue());
605 Worklist.push_back(IncValue);
612 Worklist.push_back(GA->getAliasee());
645 } while (!Worklist.empty());
777 Worklist.Add(NewGEPI);
[all...] |
| InstructionCombining.cpp | 20 // This is a simple worklist driven algorithm.
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIInstrInfo.cpp | [all...] |
| SIFixSGPRCopies.cpp | 246 SmallVector<MachineInstr *, 16> Worklist;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 89 SmallVector<const Value *, 4> Worklist;
90 Worklist.push_back(V);
92 const Value *P = Worklist.pop_back_val();
102 Worklist.push_back(SI->getTrueValue());
103 Worklist.push_back(SI->getFalseValue());
109 Worklist.push_back(IncValue);
112 } while (!Worklist.empty());
842 SmallVector<std::pair<Instruction *, const Value *>, 4> Worklist;
843 Worklist.push_back(std::make_pair(Inst, Arg));
845 std::pair<Instruction *, const Value *> Pair = Worklist.pop_back_val()
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 489 /// Visit all nodes in the expression tree using worklist traversal.
499 SmallVector<const SCEV *, 8> Worklist;
504 Worklist.push_back(S);
511 while (!Worklist.empty() && !Visitor.isDone()) {
512 const SCEV *S = Worklist.pop_back_val();
|
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 563 std::vector<unsigned> Worklist(VRegsToAlloc.begin(), VRegsToAlloc.end());
565 while (!Worklist.empty()) {
566 unsigned VReg = Worklist.back();
567 Worklist.pop_back();
604 // pre-spilled and the new vregs added to the worklist.
608 Worklist.insert(Worklist.end(), NewVRegs.begin(), NewVRegs.end());
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.cpp | 199 Worklist.push_back(&Node);
206 while (!Worklist.empty()) {
212 SDNode *N = Worklist.back();
213 Worklist.pop_back();
215 "Node should be ready if on worklist!");
327 // to the worklist etc.
332 // the worklist if ready.
359 // Mark it as processed and add its users to the worklist as appropriate.
375 Worklist.push_back(User);
393 Worklist.push_back(User)
[all...] |
| ScheduleDAGSDNodes.cpp | 323 SmallVector<SDNode*, 64> Worklist;
325 Worklist.push_back(DAG->getRoot().getNode());
329 while (!Worklist.empty()) {
330 SDNode *NI = Worklist.pop_back_val();
332 // Add all operands to the worklist unless they've already been added.
335 Worklist.push_back(Op.getNode());
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 148 llvm::SmallVector<ModuleMacro *, 16> Worklist;
152 Worklist.push_back(LeafMM);
154 while (!Worklist.empty()) {
155 auto *MM = Worklist.pop_back_val();
164 Worklist.push_back(O);
236 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end());
237 while (!Worklist.empty()) {
238 auto *MM = Worklist.pop_back_val();
257 Worklist.push_back(O);
[all...] |
| /external/llvm/lib/Linker/ |
| IRMover.cpp | 393 std::vector<GlobalValue *> Worklist;
397 Worklist.push_back(GV);
[all...] |
