| /external/llvm/lib/Transforms/Scalar/ |
| H A D | ADCE.cpp | 54 SmallVector<Instruction*, 128> worklist; local
63 worklist.push_back(I.getInstructionIterator());
67 while (!worklist.empty()) {
68 Instruction* curr = worklist.pop_back_val();
73 worklist.push_back(Inst);
79 // NOTE: We reuse the worklist vector here for memory efficiency.
82 worklist.push_back(I.getInstructionIterator());
86 for (SmallVector<Instruction*, 1024>::iterator I = worklist.begin(),
87 E = worklist.end(); I != E; ++I) {
92 return !worklist
[all...] |
| H A D | CodeGenPrepare.cpp | 756 SmallVector<Value*, 8> worklist; local
758 worklist.push_back(Addr);
760 // Use a worklist to iteratively look through PHI nodes, and ensure that
768 while (!worklist.empty()) {
769 Value *V = worklist.back();
770 worklist.pop_back();
781 worklist.push_back(P->getIncomingValue(i));
|
| /external/clang/lib/Analysis/ |
| H A D | CFGReachabilityAnalysis.cpp | 43 SmallVector<const CFGBlock *, 11> worklist; local
51 worklist.push_back(Dst);
54 while (!worklist.empty()) {
55 const CFGBlock *block = worklist.back();
56 worklist.pop_back();
70 // Add the predecessors to the worklist.
73 worklist.push_back(*i);
|
| H A D | LiveVariables.cpp | 21 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon3099::DataflowWorklist
43 worklist.push_back(block);
48 const unsigned OldWorklistSize = worklist.size();
54 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
61 const unsigned OldWorklistSize = worklist.size();
67 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
74 std::sort(worklist.begin(), worklist.end(), POV->getComparator());
78 if (worklist.empty())
80 const CFGBlock *b = worklist
[all...] |
| H A D | UninitializedValues.cpp | 279 // Worklist: worklist for dataflow analysis.
284 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon3107::DataflowWorklist
295 unsigned OldWorklistSize = worklist.size();
301 worklist.push_back(Successor);
304 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
307 // Rotate the newly added blocks to the start of the worklist so that it forms
308 // a proper queue when we pop off the end of the worklist.
309 std::rotate(worklist.begin(), worklist.begin() + OldWorklistSize,
310 worklist
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 150 std::vector<Function*> worklist; local
151 worklist.reserve(M.size());
154 worklist.push_back(&*FI);
157 while (!worklist.empty()) {
158 Function* currFunc = worklist.back();
159 worklist.pop_back();
175 worklist.push_back(newFunc);
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| H A D | DeadCodeRemover.java | 49 private final BitSet worklist; field in class:DeadCodeRemover
73 worklist = new BitSet(regCount);
85 ssaMeth.forEachInsn(new NoSideEffectVisitor(worklist));
89 while ( 0 <= (regV = worklist.nextSetBit(0)) ) {
90 worklist.clear(regV);
115 * should be added back to the worklist.
117 worklist.set(source.getReg());
222 * prevents us from adding this back to a worklist unnecessarally.
231 * A callback class used to build up the initial worklist of
|
| H A D | PhiTypeResolver.java | 48 private final BitSet worklist; field in class:PhiTypeResolver
60 worklist = new BitSet(ssaMeth.getRegCount());
75 worklist.set(reg);
80 while ( 0 <= (reg = worklist.nextSetBit(0))) {
81 worklist.clear(reg);
84 * definitions on the worklist have a type of BT_VOID, which
102 worklist.set(resultReg.getReg());
|
| H A D | Dominators.java | 120 ArrayList<SsaBasicBlock> worklist = new ArrayList<SsaBasicBlock>();
122 worklist.add(in);
124 while (!worklist.isEmpty()) {
125 int wsize = worklist.size();
126 SsaBasicBlock v = worklist.get(wsize - 1);
133 worklist.add(vAncestor);
136 worklist.remove(wsize - 1);
|
| H A D | SsaConverter.java | 338 BitSet worklist;
349 worklist = (BitSet) (defsites[reg].clone());
351 while (0 <= (workBlockIndex = worklist.nextSetBit(0))) {
352 worklist.clear(workBlockIndex);
373 worklist.set(dfBlockIndex);
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | DeadStoresChecker.cpp | 54 SmallVector<const CFGBlock*, 10> worklist;
55 worklist.push_back(&cfg.getEntry());
57 while (!worklist.empty()) {
58 const CFGBlock *block = worklist.back();
59 worklist.pop_back();
67 worklist.push_back(succ);
|
| /external/llvm/lib/Analysis/ |
| H A D | LazyValueInfo.cpp | 933 std::vector<BasicBlock*> worklist; local
934 worklist.push_back(OldSucc);
943 // Use a worklist to perform a depth-first search of OldSucc's successors.
947 while (!worklist.empty()) {
948 BasicBlock *ToUpdate = worklist.back();
949 worklist.pop_back();
977 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
|
| /external/v8/src/ |
| H A D | hydrogen.cc | 844 // the modified phi node is added to the worklist.
845 ZoneList<HPhi*> worklist(blocks_.length());
847 worklist.AddAll(*blocks_[i]->phis());
850 while (!worklist.is_empty()) {
851 HPhi* phi = worklist.RemoveLast();
865 if (value->IsPhi()) worklist.Add(HPhi::cast(value));
876 // Initialize worklist.
878 ZoneList<HPhi*> worklist(blocks_.length());
888 worklist.Add(phi);
894 while (!worklist
957 InferTypes(ZoneList<HValue*>* worklist) argument
[all...] |
| H A D | hydrogen.h | 357 void InferTypes(ZoneList<HValue*>* worklist);
|