/external/chromium_org/v8/src/ |
H A D | hydrogen-dce.cc | 12 HValue* instr, ZoneList<HValue*>* worklist) { 18 worklist->Add(instr, zone()); 19 while (!worklist->is_empty()) { 20 HValue* instr = worklist->RemoveLast(); 26 worklist->Add(input, zone()); 47 ZoneList<HValue*> worklist(10, zone()); 54 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist); 58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist); 62 DCHECK(worklist.is_empty()); // Should have processed everything. 67 ZoneList<HPhi*> worklist(grap 11 MarkLive( HValue* instr, ZoneList<HValue*>* worklist) argument [all...] |
H A D | hydrogen-uint32-analysis.cc | 145 // was a phi marked with kUint32 place it into a worklist for 147 void HUint32AnalysisPhase::UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) { argument 154 worklist->Add(HPhi::cast(operand), zone()); 167 ZoneList<HPhi*> worklist(phis_.length(), zone()); 175 // and add it to the worklist if it is a phi as well. 185 UnmarkPhi(phi, &worklist); 193 while (!worklist.is_empty()) { 194 while (!worklist.is_empty()) { 195 HPhi* phi = worklist.RemoveLast(); 196 UnmarkPhi(phi, &worklist); [all...] |
H A D | hydrogen-dce.h | 25 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
|
H A D | hydrogen-uint32-analysis.h | 27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
H A D | hydrogen-environment-liveness.cc | 166 BitVector worklist(block_count_, zone()); 168 worklist.Add(i); 170 while (!worklist.IsEmpty()) { 172 if (!worklist.Contains(block_id)) { 175 worklist.Remove(block_id); 194 worklist.Add(block->predecessors()->at(i)->block_id()); 197 worklist.Add(block->inlined_entry_block()->block_id());
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | ADCE.cpp | 58 SmallVector<Instruction*, 128> worklist; local 67 worklist.push_back(I.getInstructionIterator()); 71 while (!worklist.empty()) { 72 Instruction* curr = worklist.pop_back_val(); 77 worklist.push_back(Inst); 83 // NOTE: We reuse the worklist vector here for memory efficiency. 86 worklist.push_back(I.getInstructionIterator()); 90 for (SmallVectorImpl<Instruction *>::iterator I = worklist.begin(), 91 E = worklist.end(); I != E; ++I) { 96 return !worklist [all...] |
/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.pop_back_val(); 69 // Add the predecessors to the worklist. 73 worklist.push_back(*i);
|
H A D | LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon17777::DataflowWorklist 52 worklist.push_back(block); 57 const unsigned OldWorklistSize = worklist.size(); 63 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) 70 std::sort(worklist.begin(), worklist.end(), POV->getComparator()); 74 if (worklist.empty()) 76 const CFGBlock *b = worklist.pop_back_val(); 505 // Construct the dataflow worklist. Enqueue the exit block as the 507 DataflowWorklist worklist(*cf [all...] |
H A D | UninitializedValues.cpp | 202 // Worklist: worklist for dataflow analysis. 208 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon17786::DataflowWorklist 233 worklist.push_back(Successor); 241 // First dequeue from the worklist. This can represent 243 if (!worklist.empty()) 244 B = worklist.pop_back_val(); 834 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); 836 worklist.enqueueSuccessors(&cfg.getEntry()); 841 while (const CFGBlock *block = worklist.dequeue()) { 849 worklist [all...] |
/external/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 152 std::vector<Function*> worklist; local 153 worklist.reserve(M.size()); 156 worklist.push_back(&*FI); 159 while (!worklist.empty()) { 160 Function* currFunc = worklist.back(); 161 worklist.pop_back(); 176 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 | 86 SmallVector<const CFGBlock*, 10> worklist; 87 worklist.push_back(&cfg.getEntry()); 89 while (!worklist.empty()) { 90 const CFGBlock *block = worklist.pop_back_val(); 98 worklist.push_back(succ);
|
/external/llvm/lib/Analysis/ |
H A D | LazyValueInfo.cpp | 954 std::vector<BasicBlock*> worklist; local 955 worklist.push_back(OldSucc); 964 // Use a worklist to perform a depth-first search of OldSucc's successors. 968 while (!worklist.empty()) { 969 BasicBlock *ToUpdate = worklist.back(); 970 worklist.pop_back(); 998 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));
|
/external/llvm/lib/CodeGen/ |
H A D | CodeGenPrepare.cpp | 2489 SmallVector<Value*, 8> worklist; local 2491 worklist.push_back(Addr); 2493 // Use a worklist to iteratively look through PHI nodes, and ensure that 2504 while (!worklist.empty()) { 2505 Value *V = worklist.back(); 2506 worklist.pop_back(); 2517 worklist.push_back(P->getIncomingValue(i));
|
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | findbugs.jar | META-INF/ META-INF/MANIFEST.MF default.xsl edu/ edu/umd/ edu/umd/cs/ edu/ ... |
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/closure_compiler/compiler/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |