Home
last modified time | relevance | path

Searched refs:ready_list (Results 1 - 6 of 6) sorted by relevance

/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dscheduler.c94 static void ppir_insert_ready_list(struct list_head *ready_list, in ppir_insert_ready_list() argument
97 struct list_head *insert_pos = ready_list; in ppir_insert_ready_list()
99 list_for_each_entry(ppir_instr, instr, ready_list, list) { in ppir_insert_ready_list()
115 struct list_head *ready_list) in ppir_schedule_ready_list()
117 if (list_is_empty(ready_list)) in ppir_schedule_ready_list()
120 ppir_instr *instr = list_first_entry(ready_list, ppir_instr, list); in ppir_schedule_ready_list()
143 ppir_insert_ready_list(ready_list, pred); in ppir_schedule_ready_list()
146 ppir_schedule_ready_list(block, ready_list); in ppir_schedule_ready_list()
171 struct list_head ready_list; in ppir_schedule_block() local
172 list_inithead(&ready_list); in ppir_schedule_block()
114 ppir_schedule_ready_list(ppir_block *block, struct list_head *ready_list) ppir_schedule_ready_list() argument
[all...]
H A Dnode_to_instr.c259 struct list_head *ready_list) in ppir_ready_list_pick_best()
264 list_for_each_entry(ppir_node, node, ready_list, sched_list) { in ppir_ready_list_pick_best()
278 struct list_head ready_list; in ppir_do_node_to_instr() local
279 list_inithead(&ready_list); in ppir_do_node_to_instr()
280 list_addtail(&root->sched_list, &ready_list); in ppir_do_node_to_instr()
282 while (!list_is_empty(&ready_list)) { in ppir_do_node_to_instr()
283 ppir_node *node = ppir_ready_list_pick_best(block, &ready_list); in ppir_do_node_to_instr()
317 list_addtail(&pred->sched_list, &ready_list); in ppir_do_node_to_instr()
258 ppir_ready_list_pick_best(ppir_block *block, struct list_head *ready_list) ppir_ready_list_pick_best() argument
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dreduce_scheduler.c103 static void schedule_insert_ready_list(struct list_head *ready_list, in schedule_insert_ready_list() argument
106 struct list_head *insert_pos = ready_list; in schedule_insert_ready_list()
108 list_for_each_entry(gpir_node, node, ready_list, list) { in schedule_insert_ready_list()
130 static void schedule_ready_list(gpir_block *block, struct list_head *ready_list) in schedule_ready_list() argument
132 if (list_is_empty(ready_list)) in schedule_ready_list()
135 gpir_node *node = list_first_entry(ready_list, gpir_node, list); in schedule_ready_list()
157 schedule_insert_ready_list(ready_list, pred); in schedule_ready_list()
160 schedule_ready_list(block, ready_list); in schedule_ready_list()
179 struct list_head ready_list; in schedule_block() local
180 list_inithead(&ready_list); in schedule_block()
[all...]
H A Dscheduler.c187 struct list_head ready_list; member
399 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in verify_ready_list()
450 struct list_head *insert_pos = &ctx->ready_list; in schedule_insert_ready_list()
451 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in schedule_insert_ready_list()
1077 list_for_each_entry_safe_rev(gpir_node, node, &ctx->ready_list, list) { in try_spill_nodes()
1105 list_for_each_entry_safe_rev(gpir_node, node, &ctx->ready_list, list) { in try_spill_nodes()
1129 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in gpir_get_curr_ready_list_slots()
1231 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in sched_find_max_nodes()
1259 list_for_each_entry(gpir_node, node, &ctx->ready_list, list) { in verify_max_nodes()
1300 for (gpir_node *node = list_entry(ctx->ready_list in try_node()
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_scheduler.cpp171 bool schedule_gds(Shader::ShaderBlocks& out_blocks, std::list<I *>& ready_list);
174 bool schedule_cf(Shader::ShaderBlocks& out_blocks, std::list<I *>& ready_list);
182 bool schedule_exports(Shader::ShaderBlocks& out_blocks, std::list<ExportInstr *>& ready_list);
185 bool schedule(std::list<I *>& ready_list);
188 bool schedule_block(std::list<I *>& ready_list);
619 bool BlockSheduler::schedule_gds(Shader::ShaderBlocks& out_blocks, std::list<I *>& ready_list) in schedule_gds() argument
627 return schedule_block(ready_list); in schedule_gds()
643 bool BlockSheduler::schedule_cf(Shader::ShaderBlocks& out_blocks, std::list<I *>& ready_list) in schedule_cf() argument
645 if (ready_list.empty()) in schedule_cf()
649 return schedule(ready_list); in schedule_cf()
719 schedule(std::list<I *>& ready_list) schedule() argument
733 schedule_block(std::list<I *>& ready_list) schedule_block() argument
749 schedule_exports(Shader::ShaderBlocks& out_blocks, std::list<ExportInstr *>& ready_list) schedule_exports() argument
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-scheduler.cc213 QueueType ready_list(this); in Schedule()
221 ready_list.AddNode(node); in Schedule()
227 while (!ready_list.IsEmpty()) { in Schedule()
228 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); in Schedule()
239 ready_list.AddNode(successor); in Schedule()

Completed in 6 milliseconds