/external/llvm/lib/Transforms/Scalar/ |
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.empty() [all...] |
CodeGenPrepare.cpp | 187 SmallPtrSet<BasicBlock*, 8> WorkList; 196 WorkList.insert(*II); 200 MadeChange |= !WorkList.empty(); 201 while (!WorkList.empty()) { 202 BasicBlock *BB = *WorkList.begin(); 203 WorkList.erase(BB); 211 WorkList.insert(*II); 1468 SmallVector<Value*, 8> worklist; local [all...] |
/external/clang/lib/Analysis/ |
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);
|
LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon5645::DataflowWorklist 53 worklist.push_back(block); 58 const unsigned OldWorklistSize = worklist.size(); 64 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) 71 const unsigned OldWorklistSize = worklist.size(); 77 if (OldWorklistSize == 0 || OldWorklistSize == worklist.size()) 84 std::sort(worklist.begin(), worklist.end(), POV->getComparator()); 88 if (worklist.empty()) 90 const CFGBlock *b = worklist.back() [all...] |
UninitializedValues.cpp | 202 // Worklist: worklist for dataflow analysis. 208 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon5653::DataflowWorklist 233 worklist.push_back(Successor); 241 // First dequeue from the worklist. This can represent 243 if (!worklist.empty()) { 244 B = worklist.back(); 245 worklist.pop_back(); 818 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>()); 820 worklist.enqueueSuccessors(&cfg.getEntry()) [all...] |
/external/llvm/lib/Transforms/IPO/ |
PartialInlining.cpp | 151 std::vector<Function*> worklist; local 152 worklist.reserve(M.size()); 155 worklist.push_back(&*FI); 158 while (!worklist.empty()) { 159 Function* currFunc = worklist.back(); 160 worklist.pop_back(); 176 worklist.push_back(newFunc);
|
/dalvik/dx/src/com/android/dx/ssa/ |
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
|
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());
|
Dominators.java | 120 ArrayList<SsaBasicBlock> worklist = new ArrayList<SsaBasicBlock>(); local 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);
|
SsaConverter.java | 338 BitSet worklist; local 347 /* Worklist set starts out with each node where reg is assigned. */ 349 worklist = (BitSet) (defsites[reg].clone()); 351 while (0 <= (workBlockIndex = worklist.nextSetBit(0))) { 352 worklist.clear(workBlockIndex); 373 worklist.set(dfBlockIndex);
|
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
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
|
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());
|
Dominators.java | 120 ArrayList<SsaBasicBlock> worklist = new ArrayList<SsaBasicBlock>(); local 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);
|
SsaConverter.java | 338 BitSet worklist; local 347 /* Worklist set starts out with each node where reg is assigned. */ 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/ |
DeadStoresChecker.cpp | 87 SmallVector<const CFGBlock*, 10> worklist; 88 worklist.push_back(&cfg.getEntry()); 90 while (!worklist.empty()) { 91 const CFGBlock *block = worklist.back(); 92 worklist.pop_back(); 100 worklist.push_back(succ);
|
/external/llvm/lib/Analysis/ |
LazyValueInfo.cpp | 953 std::vector<BasicBlock*> worklist; local [all...] |
/external/v8/benchmarks/ |
richards.js | 236 * Add the specified packet to the end of the worklist used by the task 341 * Adds a packet to the worklist of this block's task, marks this as runnable if 524 * Add this packet to the end of a worklist, and return the worklist. 525 * @param {Packet} queue the worklist to add this packet to
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
v8-richards.js | 231 * Add the specified packet to the end of the worklist used by the task 336 * Adds a packet to the worklist of this block's task, marks this as runnable if 519 * Add this packet to the end of a worklist, and return the worklist. 520 * @param {Packet} queue the worklist to add this packet to
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
v8-richards.js | 231 * Add the specified packet to the end of the worklist used by the task 336 * Adds a packet to the worklist of this block's task, marks this as runnable if 519 * Add this packet to the end of a worklist, and return the worklist. 520 * @param {Packet} queue the worklist to add this packet to
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
v8-richards.js | 231 * Add the specified packet to the end of the worklist used by the task 336 * Adds a packet to the worklist of this block's task, marks this as runnable if 519 * Add this packet to the end of a worklist, and return the worklist. 520 * @param {Packet} queue the worklist to add this packet to
|
/external/v8/src/ |
hydrogen.cc | 842 // Worklist of phis that can potentially be eliminated. Initialized with 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) [all...] |
hydrogen.h | 357 void InferTypes(ZoneList<HValue*>* worklist); [all...] |
/prebuilts/tools/common/asm-tools/ |
asm-debug-all-4.0.jar | |
/prebuilts/sdk/tools/lib/ |
dx.jar | |
/prebuilts/tools/common/m2/internal/com/google/code/findbugs/findbugs/2.0.1/ |
findbugs-2.0.1.jar | |