| /external/chromium_org/v8/src/ |
| D | hydrogen-dce.cc | 35 HValue* instr, ZoneList<HValue*>* worklist) { in MarkLive() argument
41 worklist->Add(instr, zone()); in MarkLive()
42 while (!worklist->is_empty()) { in MarkLive()
43 HValue* instr = worklist->RemoveLast(); in MarkLive()
49 worklist->Add(input, zone()); in MarkLive()
72 ZoneList<HValue*> worklist(10, zone()); in MarkLiveInstructions() local
79 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist); in MarkLiveInstructions()
83 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist); in MarkLiveInstructions()
87 ASSERT(worklist.is_empty()); // Should have processed everything. in MarkLiveInstructions()
92 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone()); in RemoveDeadInstructions() local
[all …]
|
| D | hydrogen-uint32-analysis.cc | 143 void HUint32AnalysisPhase::UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) { in UnmarkPhi() argument
150 worklist->Add(HPhi::cast(operand), zone()); in UnmarkPhi()
163 ZoneList<HPhi*> worklist(phis_.length(), zone()); in UnmarkUnsafePhis() local
181 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
189 while (!worklist.is_empty()) { in UnmarkUnsafePhis()
190 while (!worklist.is_empty()) { in UnmarkUnsafePhis()
191 HPhi* phi = worklist.RemoveLast(); in UnmarkUnsafePhis()
192 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
205 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
|
| D | hydrogen-environment-liveness.cc | 189 BitVector worklist(block_count_, zone()); in Run() local
191 worklist.Add(i); in Run()
193 while (!worklist.IsEmpty()) { in Run()
195 if (!worklist.Contains(block_id)) { in Run()
198 worklist.Remove(block_id); in Run()
217 worklist.Add(block->predecessors()->at(i)->block_id()); in Run()
220 worklist.Add(block->inlined_entry_block()->block_id()); in Run()
|
| D | hydrogen-dce.h | 48 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
|
| D | hydrogen-uint32-analysis.h | 50 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | ADCE.cpp | 54 SmallVector<Instruction*, 128> worklist; in runOnFunction() local
63 worklist.push_back(I.getInstructionIterator()); in runOnFunction()
67 while (!worklist.empty()) { in runOnFunction()
68 Instruction* curr = worklist.pop_back_val(); in runOnFunction()
73 worklist.push_back(Inst); in runOnFunction()
82 worklist.push_back(I.getInstructionIterator()); in runOnFunction()
86 for (SmallVectorImpl<Instruction *>::iterator I = worklist.begin(), in runOnFunction()
87 E = worklist.end(); I != E; ++I) { in runOnFunction()
92 return !worklist.empty(); in runOnFunction()
|
| D | CodeGenPrepare.cpp | 1470 SmallVector<Value*, 8> worklist; in OptimizeMemoryInst() local
1472 worklist.push_back(Addr); in OptimizeMemoryInst()
1482 while (!worklist.empty()) { in OptimizeMemoryInst()
1483 Value *V = worklist.back(); in OptimizeMemoryInst()
1484 worklist.pop_back(); in OptimizeMemoryInst()
1495 worklist.push_back(P->getIncomingValue(i)); in OptimizeMemoryInst()
|
| /external/clang/lib/Analysis/ |
| D | CFGReachabilityAnalysis.cpp | 43 SmallVector<const CFGBlock *, 11> worklist; in mapReachability() local
51 worklist.push_back(Dst); in mapReachability()
54 while (!worklist.empty()) { in mapReachability()
55 const CFGBlock *block = worklist.back(); in mapReachability()
56 worklist.pop_back(); in mapReachability()
73 worklist.push_back(*i); in mapReachability()
|
| D | LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist; member in __anoned1a0ba20111::DataflowWorklist
53 worklist.push_back(block); in enqueueBlock()
58 const unsigned OldWorklistSize = worklist.size(); in enqueueSuccessors()
64 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) in enqueueSuccessors()
71 const unsigned OldWorklistSize = worklist.size(); in enqueuePredecessors()
77 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) in enqueuePredecessors()
84 std::sort(worklist.begin(), worklist.end(), POV->getComparator()); in sortWorklist()
88 if (worklist.empty()) in dequeue()
90 const CFGBlock *b = worklist.back(); in dequeue()
91 worklist.pop_back(); in dequeue()
[all …]
|
| D | UninitializedValues.cpp | 208 SmallVector<const CFGBlock *, 20> worklist; member in __anon8d067d620311::DataflowWorklist
233 worklist.push_back(Successor); in enqueueSuccessors()
243 if (!worklist.empty()) { in dequeue()
244 B = worklist.back(); in dequeue()
245 worklist.pop_back(); in dequeue()
818 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); in runUninitializedVariablesAnalysis() local
820 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
825 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis()
833 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | PartialInlining.cpp | 151 std::vector<Function*> worklist; in runOnModule() local
152 worklist.reserve(M.size()); in runOnModule()
155 worklist.push_back(&*FI); in runOnModule()
158 while (!worklist.empty()) { in runOnModule()
159 Function* currFunc = worklist.back(); in runOnModule()
160 worklist.pop_back(); in runOnModule()
176 worklist.push_back(newFunc); in runOnModule()
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| D | PhiTypeResolver.java | 48 private final BitSet worklist; field in PhiTypeResolver
60 worklist = new BitSet(ssaMeth.getRegCount()); in PhiTypeResolver()
75 worklist.set(reg); in run()
80 while ( 0 <= (reg = worklist.nextSetBit(0))) { in run()
81 worklist.clear(reg); in run()
102 worklist.set(resultReg.getReg()); in run()
|
| D | Dominators.java | 120 ArrayList<SsaBasicBlock> worklist = new ArrayList<SsaBasicBlock>(); in compress() local
122 worklist.add(in); in compress()
124 while (!worklist.isEmpty()) { in compress()
125 int wsize = worklist.size(); in compress()
126 SsaBasicBlock v = worklist.get(wsize - 1); in compress()
133 worklist.add(vAncestor); in compress()
136 worklist.remove(wsize - 1); in compress()
|
| D | DeadCodeRemover.java | 49 private final BitSet worklist; field in DeadCodeRemover
73 worklist = new BitSet(regCount); in DeadCodeRemover()
85 ssaMeth.forEachInsn(new NoSideEffectVisitor(worklist)); in run()
89 while ( 0 <= (regV = worklist.nextSetBit(0)) ) { in run()
90 worklist.clear(regV); in run()
117 worklist.set(source.getReg()); in run()
|
| D | SsaConverter.java | 338 BitSet worklist; in placePhiFunctions() local
349 worklist = (BitSet) (defsites[reg].clone()); in placePhiFunctions()
351 while (0 <= (workBlockIndex = worklist.nextSetBit(0))) { in placePhiFunctions()
352 worklist.clear(workBlockIndex); in placePhiFunctions()
373 worklist.set(dfBlockIndex); in placePhiFunctions()
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | DeadStoresChecker.cpp | 86 SmallVector<const CFGBlock*, 10> worklist; in computeReachableBlocks() local
87 worklist.push_back(&cfg.getEntry()); in computeReachableBlocks()
89 while (!worklist.empty()) { in computeReachableBlocks()
90 const CFGBlock *block = worklist.back(); in computeReachableBlocks()
91 worklist.pop_back(); in computeReachableBlocks()
99 worklist.push_back(succ); in computeReachableBlocks()
|
| /external/llvm/lib/Analysis/ |
| D | LazyValueInfo.cpp | 953 std::vector<BasicBlock*> worklist; in threadEdge() local
954 worklist.push_back(OldSucc); in threadEdge()
967 while (!worklist.empty()) { in threadEdge()
968 BasicBlock *ToUpdate = worklist.back(); in threadEdge()
969 worklist.pop_back(); in threadEdge()
997 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate)); in threadEdge()
|
| /external/llvm/test/Transforms/GlobalDCE/ |
| D | 2002-08-17-WorkListTest.ll | 1 ; This testcase tests that a worklist is being used, and that globals can be
|
| /external/v8/src/ |
| D | hydrogen.cc | 845 ZoneList<HPhi*> worklist(blocks_.length()); in EliminateRedundantPhis() local
847 worklist.AddAll(*blocks_[i]->phis()); in EliminateRedundantPhis()
850 while (!worklist.is_empty()) { in EliminateRedundantPhis()
851 HPhi* phi = worklist.RemoveLast(); in EliminateRedundantPhis()
865 if (value->IsPhi()) worklist.Add(HPhi::cast(value)); in EliminateRedundantPhis()
878 ZoneList<HPhi*> worklist(blocks_.length()); in EliminateUnreachablePhis() local
888 worklist.Add(phi); in EliminateUnreachablePhis()
894 while (!worklist.is_empty()) { in EliminateUnreachablePhis()
895 HPhi* phi = worklist.RemoveLast(); in EliminateUnreachablePhis()
900 worklist.Add(HPhi::cast(operand)); in EliminateUnreachablePhis()
[all …]
|
| D | hydrogen.h | 357 void InferTypes(ZoneList<HValue*>* worklist);
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | avoid-infinite-recursion-1.ll | 204 %struct.workhead = type <{ %struct.worklist* }>
205 %struct.worklist = type opaque
|
| /external/llvm/docs/ |
| D | Passes.rst | 675 This is a simple worklist driven algorithm.
705 worklist. This pass makes arguments dead, but does not remove them. The
|
| D | ProgrammersManual.rst | 1582 std::set<Instruction*> worklist;
1583 // or better yet, SmallPtrSet<Instruction*, 64> worklist;
1586 worklist.insert(&*I);
1588 The STL set ``worklist`` would now contain all instructions in the ``Function``
|
| /external/valgrind/main/coregrind/m_debuginfo/ |
| D | UNUSED_STABS.txt | 799 Variable *list; /* worklist */
|