| /external/v8/src/ |
| D | hydrogen-dce.cc | 12 HValue* instr, ZoneList<HValue*>* worklist) { in MarkLive() argument
18 worklist->Add(instr, zone()); in MarkLive()
19 while (!worklist->is_empty()) { in MarkLive()
20 HValue* instr = worklist->RemoveLast(); in MarkLive()
26 worklist->Add(input, zone()); in MarkLive()
47 ZoneList<HValue*> worklist(10, zone()); in MarkLiveInstructions() local
54 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist); in MarkLiveInstructions()
58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist); in MarkLiveInstructions()
62 DCHECK(worklist.is_empty()); // Should have processed everything. in MarkLiveInstructions()
67 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone()); in RemoveDeadInstructions() local
[all …]
|
| D | hydrogen-uint32-analysis.cc | 147 void HUint32AnalysisPhase::UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) { in UnmarkPhi() argument
154 worklist->Add(HPhi::cast(operand), zone()); in UnmarkPhi()
167 ZoneList<HPhi*> worklist(phis_.length(), zone()); in UnmarkUnsafePhis() local
185 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
193 while (!worklist.is_empty()) { in UnmarkUnsafePhis()
194 while (!worklist.is_empty()) { in UnmarkUnsafePhis()
195 HPhi* phi = worklist.RemoveLast(); in UnmarkUnsafePhis()
196 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
209 UnmarkPhi(phi, &worklist); in UnmarkUnsafePhis()
|
| D | hydrogen-environment-liveness.cc | 166 BitVector worklist(block_count_, zone()); in Run() local
168 worklist.Add(i); in Run()
170 while (!worklist.IsEmpty()) { in Run()
172 if (!worklist.Contains(block_id)) { in Run()
175 worklist.Remove(block_id); in Run()
194 worklist.Add(block->predecessors()->at(i)->block_id()); in Run()
197 worklist.Add(block->inlined_entry_block()->block_id()); in Run()
|
| D | hydrogen-dce.h | 25 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
|
| D | hydrogen-uint32-analysis.h | 27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| /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.pop_back_val(); in mapReachability()
73 worklist.push_back(*i); in mapReachability()
|
| D | LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist; member in __anon2ed49e180111::DataflowWorklist
52 worklist.push_back(block); in enqueueBlock()
57 const unsigned OldWorklistSize = worklist.size(); in enqueuePredecessors()
63 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) in enqueuePredecessors()
70 std::sort(worklist.begin(), worklist.end(), POV->getComparator()); in sortWorklist()
74 if (worklist.empty()) in dequeue()
76 const CFGBlock *b = worklist.pop_back_val(); in dequeue()
503 DataflowWorklist worklist(*cfg, AC); in computeLiveness() local
509 worklist.enqueueBlock(block); in computeLiveness()
532 worklist.sortWorklist(); in computeLiveness()
[all …]
|
| D | UninitializedValues.cpp | 209 SmallVector<const CFGBlock *, 20> worklist; member in __anone43e90580311::DataflowWorklist
234 worklist.push_back(Successor); in enqueueSuccessors()
244 if (!worklist.empty()) in dequeue()
245 B = worklist.pop_back_val(); in dequeue()
893 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); in runUninitializedVariablesAnalysis() local
895 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis()
900 while (const CFGBlock *block = worklist.dequeue()) { in runUninitializedVariablesAnalysis()
908 worklist.enqueueSuccessors(block); in runUninitializedVariablesAnalysis()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | PartialInlining.cpp | 152 std::vector<Function*> worklist; in runOnModule() local
153 worklist.reserve(M.size()); in runOnModule()
156 worklist.push_back(&*FI); in runOnModule()
159 while (!worklist.empty()) { in runOnModule()
160 Function* currFunc = worklist.back(); in runOnModule()
161 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/llvm/lib/Transforms/Scalar/ |
| D | PlaceSafepoints.cpp | 280 std::vector<BasicBlock *> &worklist) { in scanOneBB() argument
296 worklist.push_back(Succ); in scanOneBB()
307 std::vector<BasicBlock *> worklist; in scanInlinedCode() local
309 scanOneBB(start, end, calls, seen, worklist); in scanInlinedCode()
310 while (!worklist.empty()) { in scanInlinedCode()
311 BasicBlock *BB = worklist.back(); in scanInlinedCode()
312 worklist.pop_back(); in scanInlinedCode()
313 scanOneBB(&*BB->begin(), end, calls, seen, worklist); in scanInlinedCode()
|
| /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.pop_back_val(); in computeReachableBlocks()
98 worklist.push_back(succ); in computeReachableBlocks()
|
| /external/llvm/lib/Analysis/ |
| D | LazyValueInfo.cpp | 1053 std::vector<BasicBlock*> worklist; in threadEdge() local
1054 worklist.push_back(OldSucc); in threadEdge()
1065 while (!worklist.empty()) { in threadEdge()
1066 BasicBlock *ToUpdate = worklist.back(); in threadEdge()
1067 worklist.pop_back(); in threadEdge()
1094 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/llvm/docs/ |
| D | MergeFunctions.rst | 203 1. Put all module's functions into the *worklist*.
205 2. Scan *worklist*'s functions twice: first enumerate only strong functions and
208 2.1. Loop body: take function from *worklist* (call it *FCur*) and try to
211 merge function *FCur* with *FExists*. Otherwise add function from *worklist*
214 3. Once *worklist* scanning and merging operations is complete, check *Deferred*
215 list. If it is not empty: refill *worklist* contents with *Deferred* list and
|
| D | Passes.rst | 627 This is a simple worklist driven algorithm.
664 worklist. This pass makes arguments dead, but does not remove them. The
|
| D | ProgrammersManual.rst | 1660 std::set<Instruction*> worklist;
1661 // or better yet, SmallPtrSet<Instruction*, 64> worklist;
1664 worklist.insert(&*I);
1666 The STL set ``worklist`` would now contain all instructions in the ``Function``
|
| /external/llvm/lib/CodeGen/ |
| D | CodeGenPrepare.cpp | 3145 SmallVector<Value*, 8> worklist; in OptimizeMemoryInst() local
3147 worklist.push_back(Addr); in OptimizeMemoryInst()
3160 while (!worklist.empty()) { in OptimizeMemoryInst()
3161 Value *V = worklist.back(); in OptimizeMemoryInst()
3162 worklist.pop_back(); in OptimizeMemoryInst()
3173 worklist.push_back(P->getIncomingValue(i)); in OptimizeMemoryInst()
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | avoid-infinite-recursion-1.ll | 204 %struct.workhead = type <{ %struct.worklist* }>
205 %struct.worklist = type opaque
|
| /external/v8/ |
| D | ChangeLog | 1505 worklist (issue 3204).
|
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| D | findbugs.jar | META-INF/
META-INF/MANIFEST.MF
default.xsl
edu/
edu/umd ... |