| /external/chromium_org/v8/src/ |
| 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(graph()->blocks()->length(), zone())
[all...] |
| hydrogen-dce.h | 25 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
|
| 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) {
154 worklist->Add(HPhi::cast(operand), zone());
165 // Worklist used to transitively clear kUint32 from phis that
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()
[all...] |
| hydrogen-uint32-analysis.h | 27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
|
| 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/ |
| 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.empty()
[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.pop_back_val();
69 // Add the predecessors to the worklist.
73 worklist.push_back(*i);
|
| LiveVariables.cpp | 31 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon1482::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(*cfg, AC)
[all...] |
| UninitializedValues.cpp | 202 // Worklist: worklist for dataflow analysis.
208 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon1491::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())
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| 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);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| 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
|
| 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());
|
| 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/ |
| 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);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| misc.py | 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
|
| /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/clang/lib/StaticAnalyzer/Checkers/ |
| 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);
|
| /art/compiler/sea_ir/ir/ |
| sea.cc | 324 // Copy the set, because we will modify the worklist as we go.
325 std::set<Region*> worklist((*(blocks.find(global))).second);
326 for (std::set<Region*>::const_iterator b_it = worklist.begin();
327 b_it != worklist.end(); b_it++) {
331 // Check that the dominance frontier element is in the worklist already
333 if (worklist.find(*df_it) == worklist.end()) {
334 worklist.insert(*df_it);
335 b_it = worklist.begin();
|
| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 954 std::vector<BasicBlock*> worklist; local
[all...] |
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| 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
|
