Searched refs:worklist (Results 1 - 25 of 43) sorted by relevance

12

/external/mesa3d/src/compiler/nir/
H A Dnir_opt_dce.c38 worklist_push(struct exec_list *worklist, nir_instr *instr) argument
40 worklist_elem *elem = ralloc(worklist, worklist_elem);
43 exec_list_push_tail(worklist, &elem->node);
47 worklist_pop(struct exec_list *worklist) argument
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) argument
82 worklist_push(worklist, instr);
88 worklist_push(worklist, inst
116 init_block(nir_block *block, struct exec_list *worklist) argument
134 struct exec_list *worklist = rzalloc(NULL, struct exec_list); local
[all...]
H A Dnir_liveness.c49 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...]
/external/v8/src/crankshaft/
H A Dhydrogen-dce.cc12 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(grap
11 MarkLive( HValue* instr, ZoneList<HValue*>* worklist) argument
[all...]
H A Dhydrogen-uint32-analysis.cc142 // was a phi marked with kUint32 place it into a worklist for
144 void HUint32AnalysisPhase::UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist) { argument
151 worklist->Add(HPhi::cast(operand), zone());
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();
193 UnmarkPhi(phi, &worklist);
[all...]
H A Dhydrogen-dce.h25 void MarkLive(HValue* instr, ZoneList<HValue*>* worklist);
H A Dhydrogen-uint32-analysis.h27 INLINE(void UnmarkPhi(HPhi* phi, ZoneList<HPhi*>* worklist));
H A Dhydrogen-environment-liveness.cc166 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/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
H A DADCE.cpp54 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
[all...]
/external/clang/lib/Analysis/
H A DCFGReachabilityAnalysis.cpp43 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 DLiveVariables.cpp31 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon1514::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();
500 // Construct the dataflow worklist. Enqueue the exit block as the
502 DataflowWorklist worklist(*cf
[all...]
H A DUninitializedValues.cpp203 // Worklist: worklist for dataflow analysis.
209 SmallVector<const CFGBlock *, 20> worklist; member in class:__anon1523::DataflowWorklist
234 worklist.push_back(Successor);
242 // First dequeue from the worklist. This can represent
244 if (!worklist.empty())
245 B = worklist.pop_back_val();
893 DataflowWorklist worklist(cfg, *ac.getAnalysis<PostOrderCFGView>());
895 worklist.enqueueSuccessors(&cfg.getEntry());
900 while (const CFGBlock *block = worklist.dequeue()) {
908 worklist
[all...]
/external/tensorflow/tensorflow/compiler/xla/service/
H A Dflatten_call_graph.cc90 std::vector<HloComputation*> worklist; local
91 worklist.push_back(clone);
92 while (!worklist.empty()) {
93 auto current = worklist.back();
94 worklist.pop_back();
104 worklist.push_back(callee_clone);
H A Dtuple_simplifier.cc34 // Initially add all GTE and Tuple instructions to the worklist.
35 std::queue<HloInstruction*> worklist; local
40 worklist.push(instruction);
46 while (!worklist.empty()) {
47 HloInstruction* instruction = worklist.front();
48 worklist.pop();
97 // No need to add anything to the worklist.
119 worklist.push(user);
H A Dcall_graph.cc189 std::queue<CallGraphNode*> worklist; local
191 // Initialize worklist with all roots of the call graph (computations without
197 worklist.push(&node);
201 while (!worklist.empty()) {
202 CallGraphNode* node = worklist.front();
203 worklist.pop();
222 // Context of computation has been changed so add node to worklist.
224 worklist.push(&callee_node);
H A Dhlo_computation.cc199 std::queue<HloInstruction*> worklist; local
200 worklist.push(instruction);
201 while (!worklist.empty()) {
202 HloInstruction* item = worklist.front();
203 worklist.pop();
211 worklist.push(item->mutable_operand(i));
604 std::queue<const HloInstruction*> worklist; local
605 worklist.push(instruction);
609 while (!worklist.empty()) {
610 const HloInstruction* item = worklist
[all...]
/external/python/cpython2/Lib/compiler/
H A Dmisc.py69 worklist = [tree]
70 while worklist:
71 node = worklist.pop(0)
73 worklist.extend(node.getChildNodes())
/external/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp156 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/
H A DPartialInlining.cpp150 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);
/external/tensorflow/tensorflow/compiler/xla/service/llvm_ir/
H A Dalias_analysis.cc143 std::vector<const LogicalBuffer*> worklist; local
145 [&worklist, &assignment](const HloInstruction* instruction) {
148 worklist.push_back(buffer);
167 for (const LogicalBuffer* buffer : worklist) {
/external/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_qir_schedule.c68 struct list_head worklist; member in struct:schedule_state
467 list_for_each_entry(struct schedule_node, n, &state->worklist, link) {
542 list_for_each_entry(struct schedule_node, n, &state->worklist, link) {
634 &state->worklist, link) {
640 while (!list_empty(&state->worklist)) {
673 list_add(&child->link, &state->worklist);
701 list_inithead(&state.worklist);
709 list_addtail(&n->link, &state.worklist);
716 calculate_forward_deps(c, mem_ctx, &state.worklist);
718 calculate_reverse_deps(c, mem_ctx, &state.worklist);
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp86 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/v8/tools/turbolizer/
H A Dgraph-layout.js288 var worklist = startNodes.slice();
289 while (worklist.length != 0) {
290 var n = worklist.pop();
315 worklist.unshift(n.outputs[l].target);
317 worklist.push(n.outputs[l].target);
/external/tensorflow/tensorflow/compiler/jit/
H A Dmark_for_compilation_pass.cc464 std::deque<UnionFind<Cluster>*> worklist; local
468 worklist.push_back(&clusters[node->id()]);
476 while (!worklist.empty()) {
477 int from = worklist.front()->Get().representative;
478 worklist.pop_front();
485 "Found control flow node in clustering worklist: ",
542 worklist.push_back(&clusters[from]);
/external/v8/src/compiler/
H A Dregister-allocator-verifier.cc379 ZoneQueue<std::pair<const PendingAssessment*, int>> worklist(&local_zone);
381 worklist.push(std::make_pair(assessment, virtual_register));
384 while (!worklist.empty()) {
385 auto work = worklist.front();
389 worklist.pop();
444 worklist.push({next, expected});
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DLazyValueInfo.cpp948 std::vector<BasicBlock*> worklist; local
949 worklist.push_back(OldSucc);
958 // Use a worklist to perform a depth-first search of OldSucc's successors.
962 while (!worklist.empty()) {
963 BasicBlock *ToUpdate = worklist.back();
964 worklist.pop_back();
992 worklist.insert(worklist.end(), succ_begin(ToUpdate), succ_end(ToUpdate));

Completed in 863 milliseconds

12