| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| WorkList.h | 1 //==- WorkList.h - Worklist class used by CoreEngine ---------------*- C++ -*-//
9 // This file defines WorkList, a pure virtual class that represents an opaque
10 // worklist used by CoreEngine to explore the reachability state space.
47 /// Returns the node associated with the worklist unit.
50 /// Returns the block counter map associated with the worklist unit.
53 /// Returns the CFGblock associated with the worklist unit.
56 /// Return the index within the CFGBlock for the worklist unit.
60 class WorkList {
63 virtual ~WorkList();
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| Combiner.cpp | 53 WorkListTy &WorkList;
59 WorkListMaintainer(WorkListTy &WorkList)
60 : GISelChangeObserver(), WorkList(WorkList) {}
66 WorkList.remove(&MI);
70 WorkList.insert(&MI);
75 WorkList.insert(&MI);
79 WorkList.insert(&MI);
126 GISelWorkList<512> WorkList;
127 WorkListMaintainer Observer(WorkList);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| DCE.cpp | 89 SmallSetVector<Instruction *, 16> &WorkList,
112 WorkList.insert(OpI);
124 SmallSetVector<Instruction *, 16> WorkList;
125 // Iterate over the original function, only adding insts to the worklist
127 // the worklist with the entire function's worth of instructions.
130 // worklist from an earlier visit.
131 if (!WorkList.count(&I))
132 MadeChange |= DCEInstruction(&I, WorkList, TLI);
135 while (!WorkList.empty()) {
136 Instruction *I = WorkList.pop_back_val()
[all...] |
| BDCE.cpp | 48 // Initialize the worklist with eligible direct users.
50 SmallVector<Instruction *, 16> WorkList;
58 WorkList.push_back(J);
72 while (!WorkList.empty()) {
73 Instruction *J = WorkList.pop_back_val();
88 WorkList.push_back(K);
94 SmallVector<Instruction*, 128> Worklist;
110 Worklist.push_back(&I);
127 Worklist.push_back(SE);
158 for (Instruction *&I : Worklist) {
[all...] |
| Reg2Mem.cpp | 72 std::list<Instruction*> WorkList;
75 WorkList.push_front(&I);
78 NumRegsDemoted += WorkList.size();
79 for (Instruction *I : WorkList)
82 WorkList.clear();
87 WorkList.push_front(&Phi);
90 NumPhisDemoted += WorkList.size();
91 for (Instruction *I : WorkList)
|
| AlignmentFromAssumptions.cpp | 245 SmallVector<Instruction*, 16> WorkList;
251 WorkList.push_back(K);
254 while (!WorkList.empty()) {
255 Instruction *J = WorkList.pop_back_val();
309 WorkList.push_back(K);
|
| ConstraintElimination.cpp | 262 SmallVector<ConstraintOrBlock, 64> WorkList;
269 WorkList.emplace_back(DT.getNode(&BB));
292 WorkList.emplace_back(DT.getNode(FalseSuccessor), cast<CmpInst>(Op0),
294 WorkList.emplace_back(DT.getNode(FalseSuccessor), cast<CmpInst>(Op1),
307 WorkList.emplace_back(DT.getNode(TrueSuccessor), cast<CmpInst>(Op0),
309 WorkList.emplace_back(DT.getNode(TrueSuccessor), cast<CmpInst>(Op1),
319 WorkList.emplace_back(DT.getNode(Br->getSuccessor(0)), CmpI, false);
321 WorkList.emplace_back(DT.getNode(Br->getSuccessor(1)), CmpI, true);
324 // Next, sort worklist by dominance, so that dominating blocks and conditions
328 sort(WorkList, [](const ConstraintOrBlock &A, const ConstraintOrBlock &B)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowWorklist.h | 9 // A simple and reusable worklist for flow-sensitive analyses.
20 /// A worklist implementation where the enqueued blocks will be dequeued based
27 WorkList;
31 : EnqueuedBlocks(Cfg.getNumBlockIDs()), POV(POV), WorkList(C) {}
38 WorkList.push(Block);
43 if (WorkList.empty())
45 const CFGBlock *B = WorkList.top();
46 WorkList.pop();
59 /// A worklist implementation for forward dataflow analysis. The enqueued
60 /// blocks will be dequeued in reverse post order. The worklist cannot contai
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ProcessImplicitDefs.cpp | 33 SmallSetVector<MachineInstr*, 16> WorkList;
89 WorkList.insert(UserMI);
144 assert(WorkList.empty() && "Inconsistent worklist state");
150 WorkList.insert(&MI);
152 if (WorkList.empty())
155 LLVM_DEBUG(dbgs() << printMBBReference(MBB) << " has " << WorkList.size()
159 // Drain the WorkList to recursively process any new implicit defs.
160 do processImplicitDef(WorkList.pop_back_val());
161 while (!WorkList.empty())
[all...] |
| LiveRangeCalc.cpp | 140 SetVector<unsigned> WorkList;
144 WorkList.insert(P->getNumber());
146 for (unsigned i = 0; i != WorkList.size(); ++i) {
148 unsigned N = WorkList[i];
186 WorkList.insert(P->getNumber());
199 SmallVector<unsigned, 16> WorkList(1, UseMBBNum);
208 for (unsigned i = 0; i != WorkList.size(); ++i) {
209 MachineBasicBlock *MBB = MF->getBlockNumbered(WorkList[i]);
263 WorkList.push_back(Pred->getNumber());
277 if (WorkList.size() > 4
[all...] |
| LiveVariables.cpp | 92 SmallVectorImpl<MachineBasicBlock *> &WorkList) {
112 WorkList.insert(WorkList.end(), MBB->pred_rbegin(), MBB->pred_rend());
118 SmallVector<MachineBasicBlock *, 16> WorkList;
119 MarkVirtRegAliveInBlock(VRInfo, DefBlock, MBB, WorkList);
121 while (!WorkList.empty()) {
122 MachineBasicBlock *Pred = WorkList.back();
123 WorkList.pop_back();
124 MarkVirtRegAliveInBlock(VRInfo, DefBlock, Pred, WorkList);
|
| MachineCSE.cpp | 757 SmallVector<MachineDomTreeNode*, 8> WorkList;
763 WorkList.push_back(Node);
765 Node = WorkList.pop_back_val();
768 append_range(WorkList, Node->children());
769 } while (!WorkList.empty());
|
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| DeclCXX.cpp | 177 SmallVector<const CXXRecordDecl*, 8> WorkList = {StartRD};
178 while (!WorkList.empty()) {
179 const CXXRecordDecl *RD = WorkList.pop_back_val();
184 WorkList.push_back(B);
598 SmallVector<const CXXRecordDecl*, 8> WorkList;
630 WorkList.push_back(RD);
637 while (!WorkList.empty()) {
638 const CXXRecordDecl *X = WorkList.pop_back_val();
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| LLVMContextImpl.cpp | 130 SmallSetVector<ConstantArray *, 4> WorkList;
133 // dead, starting WorkList with all elements of ArrayConstants can be
134 // wasteful. Instead, starting WorkList with only elements that have empty
138 WorkList.insert(C);
140 while (!WorkList.empty()) {
141 ConstantArray *C = WorkList.pop_back_val();
145 WorkList.insert(COp);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| FixIrreducible.cpp | 312 SmallVector<Loop *, 8> WorkList;
318 // add them all to the worklist.
319 append_range(WorkList, LI);
321 while (!WorkList.empty()) {
322 auto L = WorkList.pop_back_val();
327 // add them all to the worklist.
328 WorkList.append(L->begin(), L->end());
|
| LibCallsShrinkWrap.cpp | 81 for (auto &CI : WorkList) {
131 SmallVector<CallInst *, 16> WorkList;
315 WorkList.push_back(&CI);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DebugHandlerBase.cpp | 114 SmallVector<LexicalScope *, 4> WorkList;
115 WorkList.push_back(LScopes.getCurrentFunctionScope());
116 while (!WorkList.empty()) {
117 LexicalScope *S = WorkList.pop_back_val();
121 WorkList.append(Children.begin(), Children.end());
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCBoolRetToInt.cpp | 74 SmallVector<Value *, 8> WorkList;
75 WorkList.push_back(V);
77 while (!WorkList.empty()) {
78 Value *Curr = WorkList.pop_back_val();
85 WorkList.push_back(Op);
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| PlistDiagnostics.cpp | 634 SmallVector<const PathPieces *, 5> WorkList;
635 WorkList.push_back(&D->path);
637 while (!WorkList.empty()) {
638 const PathPieces &Path = *WorkList.pop_back_val();
652 WorkList.push_back(&Call->path);
655 WorkList.push_back(&Macro->subPieces);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 117 SmallVector<BBInfo *, 64> WorkList;
121 WorkList.push_back(Info);
127 while (!WorkList.empty()) {
128 Info = WorkList.pop_back_val();
158 WorkList.push_back(PredInfo);
168 // Initialize the worklist with the roots from the backward traversal.
173 WorkList.push_back(Info);
176 while (!WorkList.empty()) {
177 Info = WorkList.back();
185 WorkList.pop_back()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64StackTaggingPreRA.cpp | 276 SmallVector<Register, 8> WorkList;
277 WorkList.push_back(RetagReg);
279 while (!WorkList.empty()) {
280 Register UseReg = WorkList.back();
281 WorkList.pop_back();
293 WorkList.push_back(DstReg);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFixIrreducibleControlFlow.cpp | 139 SmallVector<BlockPair, 4> WorkList;
146 WorkList.emplace_back(MBB, Succ);
151 while (!WorkList.empty()) {
153 std::tie(MBB, Succ) = WorkList.pop_back_val();
160 WorkList.emplace_back(Pred, Succ);
209 BlockVector WorkList;
214 WorkList.push_back(Pred);
219 while (!WorkList.empty()) {
220 auto *MBB = WorkList.pop_back_val();
225 WorkList.push_back(Pred)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ReachableCode.cpp | 389 SmallVector<const CFGBlock *, 10> WorkList;
423 WorkList.push_back(block);
440 WorkList.push_back(PredBlock);
490 while (!WorkList.empty()) {
491 const CFGBlock *Block = WorkList.pop_back_val();
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| PGOMemOPSizeOpt.cpp | 232 WorkList.clear();
235 for (auto &MO : WorkList) {
251 WorkList.push_back(MemOp(&MI));
259 WorkList.push_back(MemOp(&CI));
270 std::vector<MemOp> WorkList;
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| StackSafetyAnalysis.cpp | 333 SmallVector<const Value *, 8> WorkList;
334 WorkList.push_back(Ptr);
338 while (!WorkList.empty()) {
339 const Value *V = WorkList.pop_back_val();
432 WorkList.push_back(cast<const Instruction>(I));
481 SetVector<const CalleeTy *> WorkList;
563 WorkList.insert(CallerID);
588 while (!WorkList.empty()) {
589 const CalleeTy *Callee = WorkList.back();
590 WorkList.pop_back()
[all...] |
