HomeSort by relevance Sort by last modified time
    Searched refs:worklist (Results 1 - 25 of 148) sorted by null

1 2 3 4 5 6

  /external/mesa3d/src/compiler/nir/
nir_opt_dce.c 38 worklist_push(struct exec_list *worklist, nir_instr *instr)
40 worklist_elem *elem = ralloc(worklist, worklist_elem);
43 exec_list_push_tail(worklist, &elem->node);
47 worklist_pop(struct exec_list *worklist)
49 struct exec_node *node = exec_list_pop_head(worklist);
57 struct exec_list *worklist = (struct exec_list *) _state; local
60 worklist_push(worklist, src->ssa->parent_instr);
67 init_instr(nir_instr *instr, struct exec_list *worklist)
82 worklist_push(worklist, instr);
88 worklist_push(worklist, instr)
134 struct exec_list *worklist = rzalloc(NULL, struct exec_list); local
    [all...]
nir_liveness.c 49 nir_block_worklist worklist; member in struct:live_ssa_defs_state
66 * worklist.
80 nir_block_worklist_push_head(&state->worklist, block);
172 nir_block_worklist_init(&state.worklist, impl->num_blocks, NULL);
176 * blocks to the worklist.
184 /* We're now ready to work through the worklist and update the liveness
187 * worklist in reverse order. As long as we keep the worklist
190 while (!nir_block_worklist_is_empty(&state.worklist)) {
195 nir_block *block = nir_block_worklist_pop_head(&state.worklist);
    [all...]
  /toolchain/binutils/binutils-2.25/gold/
gc.cc 32 // Garbage collection uses a worklist style algorithm to determine the
37 while (!this->worklist().empty())
41 Section_id entry = this->worklist().front();
42 this->worklist().pop();
66 this->worklist().push(*it_v);
  /external/v8/src/crankshaft/
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());
48 ZoneList<HValue*> worklist(10, zone());
55 if (instr->CannotBeEliminated()) MarkLive(instr, &worklist);
59 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist);
63 DCHECK(worklist.is_empty()); // Should have processed everything.
68 ZoneList<HPhi*> worklist(graph()->blocks()->length(), zone())
    [all...]
hydrogen-dce.h 25 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
hydrogen-uint32-analysis.cc 142 // was a phi marked with kUint32 place it into a worklist for
144 void HUint32AnalysisPhase::UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) {
151 worklist->Add(HPhi::cast(operand), zone());
162 // Worklist used to transitively clear kUint32 from phis that
164 ZoneList<HPhi*> worklist(phis_.length(), zone());
172 // and add it to the worklist if it is a phi as well.
182 UnmarkPhi(phi, &worklist);
190 while (!worklist.is_empty()) {
191 while (!worklist.is_empty()) {
192 HPhi* phi = worklist.RemoveLast()
    [all...]
hydrogen-uint32-analysis.h 27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
  /external/swiftshader/third_party/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...]
  /art/compiler/optimizing/
linear_order.cc 37 static void AddToListForLinearization(ArenaVector<HBasicBlock*>* worklist, HBasicBlock* block) {
39 auto insert_pos = worklist->rbegin(); // insert_pos.base() will be the actual position.
40 for (auto end = worklist->rend(); insert_pos != end; ++insert_pos) {
50 worklist->insert(insert_pos.base(), block);
104 // (2): Following a worklist approach, first start with the entry block, and
106 // successor block are visited, the successor block is added in the worklist
109 ArenaVector<HBasicBlock*> worklist(allocator->Adapter(kArenaAllocLinearOrder));
110 worklist.push_back(graph->GetEntryBlock());
112 HBasicBlock* current = worklist.back();
113 worklist.pop_back()
    [all...]
code_sinking.cc 113 ArenaVector<HInstruction*>* worklist) {
119 worklist->push_back(instruction);
126 ArenaVector<HInstruction*>* worklist) {
128 AddInstruction(input, processed_instructions, discard_blocks, worklist);
135 ArenaVector<HInstruction*>* worklist) {
137 AddInputs(it.Current(), processed_instructions, discard_blocks, worklist);
140 AddInputs(it.Current(), processed_instructions, discard_blocks, worklist);
245 ArenaVector<HInstruction*> worklist(allocator.Adapter(kArenaAllocMisc));
281 // Now that we have found a subset of post-dominated blocks, add to the worklist all inputs
289 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist);
    [all...]
ssa_builder.h 108 bool TypeInputsOfPhi(HPhi* phi, ArenaVector<HPhi*>* worklist);
109 bool UpdatePrimitiveType(HPhi* phi, ArenaVector<HPhi*>* worklist);
110 void ProcessPrimitiveTypePropagationWorklist(ArenaVector<HPhi*>* worklist);
ssa_builder.cc 106 ArenaVector<HPhi*>* worklist) {
109 // marked dead/conflicting too, so we add them to the worklist. Otherwise we
116 worklist->push_back(user->AsPhi());
165 bool SsaBuilder::TypeInputsOfPhi(HPhi* phi, ArenaVector<HPhi*>* worklist) {
198 worklist->push_back(equivalent->AsPhi());
210 bool SsaBuilder::UpdatePrimitiveType(HPhi* phi, ArenaVector<HPhi*>* worklist) {
219 if (!TypePhiFromInputs(phi) || !TypeInputsOfPhi(phi, worklist)) {
230 ArenaVector<HPhi*> worklist(graph_->GetArena()->Adapter(kArenaAllocGraphBuilder));
237 worklist.push_back(phi);
243 // that we don't need to add users to the worklist because we ar
    [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);
  /external/r8/src/main/java/com/android/tools/r8/ir/optimize/
DeadCodeRemover.java 25 Queue<BasicBlock> worklist = new LinkedList<>(); local
28 worklist.addAll(code.blocks);
29 for (BasicBlock block = worklist.poll(); block != null; block = worklist.poll()) {
34 removeDeadInstructions(worklist, code, block, options);
35 removeDeadPhis(worklist, block, options);
36 removeUnneededCatchHandlers(worklist, block, dominator);
43 // Add the block from where the value originates to the worklist.
44 private static void updateWorklist(Queue<BasicBlock> worklist, Value value) {
52 worklist.add(block)
    [all...]
  /external/llvm/lib/Transforms/IPO/
PartialInlining.cpp 156 std::vector<Function*> worklist; local
157 worklist.reserve(M.size());
160 worklist.push_back(&F);
163 while (!worklist.empty()) {
164 Function* currFunc = worklist.back();
165 worklist.pop_back();
180 worklist.push_back(newFunc);
  /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/
PartialInlining.cpp 150 std::vector<Function*> worklist; local
151 worklist.reserve(M.size());
154 worklist.push_back(&*FI);
157 while (!worklist.empty()) {
158 Function* currFunc = worklist.back();
159 worklist.pop_back();
175 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);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/
misc.py 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
  /external/python/cpython2/Lib/compiler/
misc.py 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
  /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
misc.py 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
  /prebuilts/gdb/linux-x86/lib/python2.7/compiler/
misc.py 69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
  /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())

Completed in 447 milliseconds

1 2 3 4 5 6