| /external/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 264 std::vector<BasicBlock *> &Worklist) {
281 Worklist.push_back(Succ);
292 std::vector<BasicBlock *> Worklist;
294 scanOneBB(Start, End, Calls, Seen, Worklist);
295 while (!Worklist.empty()) {
296 BasicBlock *BB = Worklist.back();
297 Worklist.pop_back();
298 scanOneBB(&*BB->begin(), End, Calls, Seen, Worklist);
|
| LoopInterchange.cpp | 288 // Discard all loops above it added into Worklist.
458 // Build up a worklist of loop pairs to analyze.
459 SmallVector<LoopVector, 8> Worklist;
462 populateWorklist(*L, Worklist);
464 DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n");
466 while (!Worklist.empty()) {
467 LoopVector LoopList = Worklist.pop_back_val();
[all...] |
| LoopLoadElimination.cpp | 552 // Build up a worklist of inner-loops to vectorize. This is necessary as the
555 SmallVector<Loop *, 8> Worklist;
561 Worklist.push_back(L);
565 for (Loop *L : Worklist) {
|
| TailRecursionElimination.cpp | 111 SmallVector<Use *, 32> Worklist;
118 Worklist.push_back(&U);
124 while (!Worklist.empty()) {
125 Use *U = Worklist.pop_back_val();
[all...] |
| LoopDistribute.cpp | 123 SmallVector<Instruction *, 8> Worklist(Set.begin(), Set.end());
124 while (!Worklist.empty()) {
125 Instruction *I = Worklist.pop_back_val();
130 Worklist.push_back(I);
[all...] |
| Reassociate.cpp | 447 // Worklist of non-leaf nodes (their operands are in the expression too) along
449 // If an operator occurs in the worklist multiple times then we found multiple
451 SmallVector<std::pair<BinaryOperator*, APInt>, 8> Worklist; // (Op, Weight)
452 Worklist.push_back(std::make_pair(I, APInt(Bitwidth, 1)));
477 while (!Worklist.empty()) {
478 std::pair<BinaryOperator*, APInt> P = Worklist.pop_back_val();
492 Worklist.push_back(std::make_pair(BO, Weight));
530 Worklist.push_back(std::make_pair(BO, It->second));
565 Worklist.push_back(std::make_pair(BO, Weight));
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopVersioning.cpp | 266 // Build up a worklist of inner-loops to version. This is necessary as the
269 SmallVector<Loop *, 8> Worklist;
275 Worklist.push_back(L);
279 for (Loop *L : Worklist) {
|
| LoopSimplify.cpp | 191 SmallVector<BasicBlock *, 8> Worklist;
192 Worklist.push_back(InputBB);
194 BasicBlock *BB = Worklist.pop_back_val();
200 Worklist.push_back(WBB);
202 } while (!Worklist.empty());
464 static bool simplifyOneLoop(Loop *L, SmallVectorImpl<Loop *> &Worklist,
570 Worklist.push_back(OuterL);
703 // Worklist maintains our depth-first queue of loops in this nest to process.
704 SmallVector<Loop *, 4> Worklist;
705 Worklist.push_back(L)
[all...] |
| LoopUtils.cpp | 106 SmallVector<Instruction *, 8> Worklist;
109 Worklist.push_back(Exit);
113 while (!Worklist.empty()) {
114 Instruction *I = Worklist.pop_back_val();
125 Worklist.push_back(J);
203 SmallVector<Instruction *, 8> Worklist;
220 Worklist.push_back(Start);
237 while (!Worklist.empty()) {
238 Instruction *Cur = Worklist.back();
239 Worklist.pop_back()
[all...] |
| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 551 SmallVector<const MDNode *, 64> Worklist;
552 auto push = [this, &Worklist](MetadataMapType::value_type &MD) {
566 Worklist.push_back(N);
569 while (!Worklist.empty())
570 for (const Metadata *Op : Worklist.pop_back_val()->operands()) {
588 SmallVector<std::pair<const MDNode *, MDNode::op_iterator>, 32> Worklist;
590 Worklist.push_back(std::make_pair(N, N->op_begin()));
592 while (!Worklist.empty()) {
593 const MDNode *N = Worklist.back().first;
598 Worklist.back().second, N->op_end()
[all...] |
| /external/llvm/lib/CodeGen/ |
| Analysis.cpp | 644 SmallVector<const MachineBasicBlock *, 16> Worklist = {MBB};
645 while (!Worklist.empty()) {
646 const MachineBasicBlock *Visiting = Worklist.pop_back_val();
666 Worklist.push_back(Succ);
|
| DetectDeadLanes.cpp | 76 /// the worklist if any new bits were added.
86 /// mask to the def and put the instruction into the worklist.
118 Worklist.push_back(RegIdx);
122 /// Worklist containing virtreg indexes.
123 std::deque<unsigned> Worklist;
502 // Determine used/defined lanes and add copy instructions to worklist.
509 while (!Worklist.empty()) {
510 unsigned RegIdx = Worklist.front();
511 Worklist.pop_front();
|
| LiveDebugValues.cpp | 441 Worklist;
459 Worklist.push(RPONumber);
463 // To solve it, we perform join() and transfer() using the two worklist method
466 while (!Worklist.empty() || !Pending.empty()) {
467 // We track what is on the pending worklist to avoid inserting the same
471 while (!Worklist.empty()) {
472 MachineBasicBlock *MBB = OrderToBB[Worklist.top()];
473 Worklist.pop();
496 Worklist.swap(Pending);
498 // worklist
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| FunctionImport.cpp | 268 SmallVectorImpl<EdgeInfo> &Worklist,
303 /// the worklist with the new threshold.
328 // Insert the newly imported function to the worklist.
329 Worklist.push_back(std::make_pair(ResolvedCalleeSummary, Threshold));
340 // Worklist contains the list of function imported in this module, for which
342 SmallVector<EdgeInfo, 128> Worklist;
344 // Populate the worklist with the import for the functions in the current
356 DefinedGVSummaries, Worklist, ImportsForModule,
360 while (!Worklist.empty()) {
361 auto FuncInfo = Worklist.pop_back_val()
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 155 llvm::SmallVector<ModuleMacro *, 16> Worklist;
159 Worklist.push_back(LeafMM);
161 while (!Worklist.empty()) {
162 auto *MM = Worklist.pop_back_val();
171 Worklist.push_back(O);
243 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end());
244 while (!Worklist.empty()) {
245 auto *MM = Worklist.pop_back_val();
264 Worklist.push_back(O);
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 476 /// Visit all nodes in the expression tree using worklist traversal.
486 SmallVector<const SCEV *, 8> Worklist;
491 Worklist.push_back(S);
498 while (!Worklist.empty() && !Visitor.isDone()) {
499 const SCEV *S = Worklist.pop_back_val();
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyRegStackify.cpp | 588 SmallVector<RangeTy, 4> Worklist;
594 Worklist.push_back(reverse(Range));
597 bool Done() const { return Worklist.empty(); }
600 RangeTy &Range = Worklist.back();
604 Worklist.pop_back();
605 assert((Worklist.empty() ||
606 Worklist.back().begin() != Worklist.back().end()) &&
607 "Empty ranges shouldn't remain in the worklist");
615 Worklist.push_back(reverse(Range))
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86WinEHState.cpp | 665 // Worklist used to revisit BasicBlocks with indeterminate
667 std::deque<BasicBlock *> Worklist;
687 Worklist.push_back(BB);
699 while (!Worklist.empty()) {
700 BasicBlock *BB = Worklist.front();
701 Worklist.pop_front();
715 Worklist.push_back(SuccBB);
|
| /external/llvm/tools/llvm-rtdyld/ |
| llvm-rtdyld.cpp | 549 WorklistT Worklist;
552 Worklist.push_back(std::make_pair(CodeSection.base(), CodeSection.size()));
554 Worklist.push_back(std::make_pair(DataSection.base(), DataSection.size()));
568 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end();
576 Worklist.erase(Tmp);
591 // Process any elements remaining in the worklist.
592 while (!Worklist.empty()) {
593 std::pair<void*, uint64_t> CurEntry = Worklist.front();
594 Worklist.pop_front()
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| BasicAliasAnalysis.cpp | 576 SmallVector<const Value *, 16> Worklist;
577 Worklist.push_back(Loc.Ptr);
579 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), TD);
603 Worklist.push_back(SI->getTrueValue());
604 Worklist.push_back(SI->getFalseValue());
617 Worklist.push_back(PN->getIncomingValue(i));
625 } while (!Worklist.empty() && --MaxLookup);
628 return Worklist.empty();
[all...] |
| MemoryDependenceAnalysis.cpp | 611 // determine what is dirty, seeding our initial DirtyBlocks worklist.
711 // the predecessors of this block. Add them to our worklist.
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 285 SmallVector<SDNode*, 64> Worklist;
287 Worklist.push_back(DAG->getRoot().getNode());
291 while (!Worklist.empty()) {
292 SDNode *NI = Worklist.pop_back_val();
294 // Add all operands to the worklist unless they've already been added.
297 Worklist.push_back(NI->getOperand(i).getNode());
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 621 std::vector<WeakVH> Worklist;
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;
853 Worklist.push_back(V)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | 123 /// RemoveLoopFromWorklist - If the specified loop is on the loop worklist,
154 void SimplifyCode(std::vector<Instruction*> &Worklist, Loop *L);
156 std::vector<Instruction*> &Worklist, Loop *l);
715 /// RemoveFromWorklist - Remove all instances of I from the worklist vector
718 std::vector<Instruction*> &Worklist) {
719 std::vector<Instruction*>::iterator WI = std::find(Worklist.begin(),
720 Worklist.end(), I);
721 while (WI != Worklist.end()) {
722 unsigned Offset = WI-Worklist.begin();
723 Worklist.erase(WI)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| ScalarEvolutionExpressions.h | 476 /// Visit all nodes in the expression tree using worklist traversal.
486 SmallVector<const SCEV *, 8> Worklist;
491 Worklist.push_back(S);
498 while (!Worklist.empty() && !Visitor.isDone()) {
499 const SCEV *S = Worklist.pop_back_val();
|
