/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineTraceMetrics.cpp | 499 SmallVector<const MachineBasicBlock*, 16> WorkList; 505 WorkList.push_back(BadMBB); 507 const MachineBasicBlock *MBB = WorkList.pop_back_val(); 518 WorkList.push_back(Pred); 524 } while (!WorkList.empty()); 530 WorkList.push_back(BadMBB); 532 const MachineBasicBlock *MBB = WorkList.pop_back_val(); 543 WorkList.push_back(Succ); 549 } while (!WorkList.empty());
|
H A D | RegisterCoalescer.cpp | 110 SmallVector<MachineInstr*, 8> WorkList; member in class:__anon2517::RegisterCoalescer 114 /// that may be present in WorkList. 136 /// copies that cannot yet be coalesced into WorkList. 457 // MI may be in WorkList. Make sure we don't visit it. 2810 const unsigned PrevSize = WorkList.size(); 2832 WorkList.push_back(&(*MII)); 2837 WorkList.append(GlobalTerminals.begin(), GlobalTerminals.end()); 2847 WorkList.push_back(MII); 2850 WorkList.append(Terminals.begin(), Terminals.end()); 2853 // This prevents the WorkList fro [all...] |
H A D | PrologEpilogInserter.cpp | 381 SmallVector<MachineBasicBlock *, 8> WorkList; local 389 WorkList.push_back(Entry); 399 WorkList.push_back(Restore); 401 while (!WorkList.empty()) { 402 const MachineBasicBlock *CurBB = WorkList.pop_back_val(); 411 WorkList.push_back(SuccBB);
|
H A D | MachineBlockPlacement.cpp | 264 SmallVectorImpl<MachineBasicBlock *> &WorkList, 520 BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, 526 WorkList.erase(std::remove_if(WorkList.begin(), WorkList.end(), 530 WorkList.end()); 534 for (MachineBasicBlock *MBB : WorkList) { 519 selectBestCandidateBlock( BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList, const BlockFilterSet *BlockFilter) argument
|
H A D | MachineLICM.cpp | 628 SmallVector<MachineDomTreeNode*, 8> WorkList; local 633 WorkList.push_back(HeaderN); 634 while (!WorkList.empty()) { 635 MachineDomTreeNode *Node = WorkList.pop_back_val(); 666 WorkList.push_back(Child);
|
H A D | CodeGenPrepare.cpp | 275 SmallPtrSet<BasicBlock*, 8> WorkList; local 284 WorkList.insert(*II); 288 MadeChange |= !WorkList.empty(); 289 while (!WorkList.empty()) { 290 BasicBlock *BB = *WorkList.begin(); 291 WorkList.erase(BB); 299 WorkList.insert(*II); 4338 SmallVector<Instruction *, 8> WorkList; local 4342 WorkList.push_back(cast<Instruction>(U)); 4349 while (!WorkList [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | LiveVariables.h | 280 std::vector<MachineBasicBlock*> &WorkList);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyPEI.cpp | 397 SmallVector<MachineBasicBlock *, 8> WorkList; local 405 WorkList.push_back(Entry); 415 WorkList.push_back(Restore); 417 while (!WorkList.empty()) { 418 const MachineBasicBlock *CurBB = WorkList.pop_back_val(); 427 WorkList.push_back(SuccBB);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | Local.cpp | 426 SmallSetVector<Instruction *, 16> &WorkList, 444 WorkList.insert(OpI); 457 WorkList.insert(cast<Instruction>(U)); 485 SmallSetVector<Instruction *, 16> WorkList; local 496 if (!WorkList.count(I)) 497 MadeChange |= simplifyAndDCEInstruction(I, WorkList, DL, TLI); 500 while (!WorkList.empty()) { 501 Instruction *I = WorkList.pop_back_val(); 502 MadeChange |= simplifyAndDCEInstruction(I, WorkList, DL, TLI); 425 simplifyAndDCEInstruction(Instruction *I, SmallSetVector<Instruction *, 16> &WorkList, const DataLayout &DL, const TargetLibraryInfo *TLI) argument
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Sema/ |
H A D | SemaStmtAsm.cpp | 86 SmallVector<Expr*, 4> WorkList; 87 WorkList.push_back(E); 88 while (WorkList.size()) { 89 Expr *E = WorkList.pop_back_val(); 104 WorkList.push_back(E);
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | SafeStack.cpp | 257 SmallVector<const Value *, 8> WorkList; local 258 WorkList.push_back(AllocaPtr); 261 while (!WorkList.empty()) { 262 const Value *V = WorkList.pop_back_val(); 336 WorkList.push_back(cast<const Instruction>(I));
|
H A D | PGOInstrumentation.cpp | 464 std::vector<PGOUseEdge *> WorkList; local 466 WorkList.push_back(E.get()); 469 for (auto &E : WorkList) {
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | DeadStoreElimination.cpp | 667 SmallVector<BasicBlock *, 16> WorkList; local 677 WorkList.push_back(SecondBB); 681 while (!WorkList.empty()) { 682 BasicBlock *B = WorkList.pop_back_val(); 712 WorkList.push_back(*PredI);
|
H A D | ScalarReplAggregates.cpp | 168 std::vector<AllocaInst*> &WorkList); 1478 std::vector<AllocaInst*> WorkList; local 1485 WorkList.push_back(A); 1489 while (!WorkList.empty()) { 1490 AllocaInst *AI = WorkList.back(); 1491 WorkList.pop_back(); 1521 DoScalarReplacement(AI, WorkList); 1551 std::vector<AllocaInst*> &WorkList) { 1561 WorkList.push_back(NA); // Add to worklist for recursive processing 1571 WorkList 1550 DoScalarReplacement(AllocaInst *AI, std::vector<AllocaInst*> &WorkList) argument [all...] |
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | CoreEngine.h | 23 #include "clang/StaticAnalyzer/Core/PathSensitive/WorkList.h" 68 std::unique_ptr<WorkList> WList; 114 : SubEng(subengine), WList(WorkList::makeDFS()), 148 WorkList *getWorkList() const { return WList.get(); }
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
H A D | PathDiagnostic.cpp | 214 SmallVector<const PathPieces *, 5> WorkList; local 215 WorkList.push_back(&D->path); 217 while (!WorkList.empty()) { 218 const PathPieces &path = *WorkList.pop_back_val(); 244 WorkList.push_back(&call->path); 248 WorkList.push_back(¯o->subPieces);
|
H A D | BugReporterVisitors.cpp | 1107 std::deque<const Stmt *> WorkList; local 1108 WorkList.push_back(S); 1110 while (!WorkList.empty()) { 1111 const Stmt *Head = WorkList.front(); 1112 WorkList.pop_front(); 1134 WorkList.push_back(SubStmt);
|
H A D | RegionStore.cpp | 641 typedef SmallVector<WorkListElement, 10> WorkList; typedef in class:__anon4263::ClusterAnalysis 645 WorkList WL;
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfDebug.cpp | 1123 SmallVector<LexicalScope *, 4> WorkList; local 1124 WorkList.push_back(LScopes.getCurrentFunctionScope()); 1125 while (!WorkList.empty()) { 1126 LexicalScope *S = WorkList.pop_back_val(); 1130 WorkList.append(Children.begin(), Children.end());
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 2955 SmallVector<ScheduleData *, 10> WorkList; local 2956 WorkList.push_back(SD); 2958 while (!WorkList.empty()) { 2959 ScheduleData *SD = WorkList.back(); 2960 WorkList.pop_back(); 2982 WorkList.push_back(DestBundle); 3030 WorkList.push_back(DestBundle);
|
/freebsd-11.0-release/contrib/llvm/lib/IR/ |
H A D | Constants.cpp | 384 SmallVector<const Constant *, 8> WorkList; local 385 WorkList.push_back(C); 388 while (!WorkList.empty()) { 389 const Constant *WorkItem = WorkList.pop_back_val(); 398 WorkList.push_back(ConstOp);
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGBuilder.h | 355 void splitWorkItem(SwitchWorkList &WorkList, const SwitchWorkListItem &W,
|
H A D | SelectionDAGBuilder.cpp | 8382 void SelectionDAGBuilder::splitWorkItem(SwitchWorkList &WorkList, 8483 WorkList.push_back( 8499 WorkList.push_back( 8599 SwitchWorkList WorkList; 8603 WorkList.push_back({SwitchMBB, First, Last, nullptr, nullptr, DefaultProb}); 8605 while (!WorkList.empty()) { 8606 SwitchWorkListItem W = WorkList.back(); 8607 WorkList.pop_back(); 8612 splitWorkItem(WorkList, W, SI.getCondition(), SwitchMBB);
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUISelLowering.cpp | 842 SmallVector<SDNode*, 8> WorkList; local 848 WorkList.push_back(*I); 851 for (SmallVector<SDNode*, 8>::iterator I = WorkList.begin(), 852 E = WorkList.end(); I != E; ++I) {
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | GlobalOpt.cpp | 281 SmallVector<WeakVH, 8> WorkList(V->user_begin(), V->user_end()); 282 while (!WorkList.empty()) { 283 Value *UV = WorkList.pop_back_val();
|