HomeSort by relevance Sort by last modified time
    Searched defs:worklist (Results 1 - 20 of 20) sorted by null

  /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:__anon17555::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:__anon17563::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/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 (SmallVectorImpl<Instruction *>::iterator I = worklist.begin(),
87 E = worklist.end(); I != E; ++I) {
92 return !worklist.empty()
    [all...]
CodeGenPrepare.cpp 190 SmallPtrSet<BasicBlock*, 8> WorkList;
199 WorkList.insert(*II);
203 MadeChange |= !WorkList.empty();
204 while (!WorkList.empty()) {
205 BasicBlock *BB = *WorkList.begin();
206 WorkList.erase(BB);
214 WorkList.insert(*II);
1470 SmallVector<Value*, 8> worklist; local
    [all...]
  /art/compiler/sea_ir/types/
type_inference.cc 145 std::list<InstructionNode*> worklist; local
150 std::copy(phi_instructions->begin(), phi_instructions->end(), std::back_inserter(worklist));
152 std::copy(instructions->begin(), instructions->end(), std::back_inserter(worklist));
170 for (std::list<InstructionNode*>::const_iterator instruction_it = worklist.begin();
171 instruction_it != worklist.end(); instruction_it++) {
182 worklist.push_back(*consumer);
  /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/
PhiTypeResolver.java 47 private final BitSet worklist; field in class:PhiTypeResolver
59 worklist = new BitSet(ssaMeth.getRegCount());
74 worklist.set(reg);
79 while ( 0 <= (reg = worklist.nextSetBit(0))) {
80 worklist.clear(reg);
83 * definitions on the worklist have a type of BT_VOID, which
101 worklist.set(resultReg.getReg());
DeadCodeRemover.java 42 private final BitSet worklist; field in class:DeadCodeRemover
66 worklist = new BitSet(regCount);
78 ssaMeth.forEachInsn(new NoSideEffectVisitor(worklist));
82 while ( 0 <= (regV = worklist.nextSetBit(0)) ) {
83 worklist.clear(regV);
108 * should be added back to the worklist.
110 worklist.set(source.getReg());
215 * prevents us from adding this back to a worklist unnecessarally.
224 * A callback class used to build up the initial worklist of
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 337 BitSet worklist; local
346 /* Worklist set starts out with each node where reg is assigned. */
348 worklist = (BitSet) (defsites[reg].clone());
350 while (0 <= (workBlockIndex = worklist.nextSetBit(0))) {
351 worklist.clear(workBlockIndex);
372 worklist.set(dfBlockIndex);
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
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());
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
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/llvm/lib/Analysis/
LazyValueInfo.cpp 953 std::vector<BasicBlock*> worklist; local
    [all...]
  /prebuilts/tools/common/asm-tools/
asm-debug-all-4.0.jar 
  /prebuilts/sdk/tools/lib/
dx.jar 
  /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/
compiler.jar 
  /prebuilts/tools/common/m2/internal/com/google/code/findbugs/findbugs/2.0.1/
findbugs-2.0.1.jar 

Completed in 862 milliseconds