/prebuilts/clang/host/linux-x86/clang-3977809/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();
|
/prebuilts/clang/host/linux-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();
|
/external/llvm/lib/Analysis/ |
BasicAliasAnalysis.cpp | 505 SmallVector<const Value *, 16> Worklist; 506 Worklist.push_back(Loc.Ptr); 508 const Value *V = GetUnderlyingObject(Worklist.pop_back_val(), DL); 532 Worklist.push_back(SI->getTrueValue()); 533 Worklist.push_back(SI->getFalseValue()); 546 Worklist.push_back(IncValue); 554 } while (!Worklist.empty() && --MaxLookup); 557 return Worklist.empty(); [all...] |
MemoryDependenceAnalysis.cpp | 768 // determine what is dirty, seeding our initial DirtyBlocks worklist. [all...] |
/external/llvm/lib/CodeGen/ |
RegAllocPBQP.cpp | 570 std::vector<unsigned> Worklist(VRegsToAlloc.begin(), VRegsToAlloc.end()); 572 while (!Worklist.empty()) { 573 unsigned VReg = Worklist.back(); 574 Worklist.pop_back(); 611 // pre-spilled and the new vregs added to the worklist. 615 Worklist.insert(Worklist.end(), NewVRegs.begin(), NewVRegs.end());
|
MachineLICM.cpp | 298 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end()); 299 while (!Worklist.empty()) { 300 CurLoop = Worklist.pop_back_val(); 307 Worklist.append(CurLoop->begin(), CurLoop->end()); 628 SmallVector<MachineDomTreeNode*, 8> WorkList; 633 WorkList.push_back(HeaderN); 634 while (!WorkList.empty()) { 635 MachineDomTreeNode *Node = WorkList.pop_back_val(); 660 // Add children in reverse order as then the next popped worklist node is 666 WorkList.push_back(Child) [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/lib/Transforms/Utils/ |
InlineFunction.cpp | 195 SmallVector<Instruction *, 8> Worklist(1, EHPad); 197 while (!Worklist.empty()) { 198 Instruction *CurrentPad = Worklist.pop_back_val(); 199 // We only put pads on the worklist that aren't in the MemoMap. When 202 // so they should never get updated while queued on the worklist. 232 Worklist.push_back(ChildPad); 270 Worklist.push_back(ChildPad); 293 // children, so move on to the next in the worklist. 391 SmallVector<Instruction *, 8> Worklist(1, LastUselessPad); 392 while (!Worklist.empty()) [all...] |
/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/llvm/lib/Linker/ |
IRMover.cpp | 393 std::vector<GlobalValue *> Worklist; 397 Worklist.push_back(GV); [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
LegalizeTypes.cpp | 199 Worklist.push_back(I); 206 while (!Worklist.empty()) { 212 SDNode *N = Worklist.back(); 213 Worklist.pop_back(); 215 "Node should be ready if on worklist!"); 319 // to the worklist etc. 324 // the worklist if ready. 351 // Mark it as processed and add its users to the worklist as appropriate. 367 Worklist.push_back(User); 385 Worklist.push_back(User) [all...] |
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/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/lib/Transforms/Scalar/ |
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...] |
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...] |
LoopStrengthReduce.cpp | [all...] |
RewriteStatepointsForGC.cpp | 693 SmallVector<Value*, 16> Worklist; 694 Worklist.push_back(Def); 696 while (!Worklist.empty()) { 697 Value *Current = Worklist.pop_back_val(); 709 Worklist.push_back(Base); 755 // effect the result. TODO: We could use a worklist here and make this run [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
LoadStoreVectorizer.cpp | 342 SmallVector<Instruction *, 16> Worklist; 344 Worklist.push_back(I); 345 while (!Worklist.empty()) { 346 Instruction *IW = Worklist.pop_back_val(); 355 Worklist.push_back(IM); [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
LoopStrengthReduce.cpp | [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
ScalarEvolution.cpp | [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/llvm/lib/Target/AMDGPU/ |
SIFixSGPRCopies.cpp | 245 SmallVector<MachineInstr *, 16> Worklist;
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
MachineLICM.cpp | 340 SmallVector<MachineLoop *, 8> Worklist(MLI->begin(), MLI->end()); 341 while (!Worklist.empty()) { 342 CurLoop = Worklist.pop_back_val(); 348 Worklist.append(CurLoop->begin(), CurLoop->end()); [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
InstCombineMulDivRem.cpp | 343 Worklist.Add(BBI); 347 Worklist.Add(BBI); 671 Worklist.AddValue(I.getOperand(1)); 709 Worklist.AddValue(I.getOperand(1));
|