/external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
D | ir3_legalize.c | 69 struct list_head instr_list; in legalize_block() local 81 list_replace(&block->instr_list, &instr_list); in legalize_block() 82 list_inithead(&block->instr_list); in legalize_block() 84 list_for_each_entry_safe (struct ir3_instruction, n, &instr_list, node) { in legalize_block() 157 if (list_empty(&block->instr_list) && (opc_cat(n->opc) >= 5)) in legalize_block() 160 if (is_nop(n) && !list_empty(&block->instr_list)) { in legalize_block() 161 struct ir3_instruction *last = list_last_entry(&block->instr_list, in legalize_block() 170 list_addtail(&n->node, &block->instr_list); in legalize_block() 236 list_first_entry(&block->instr_list, struct ir3_instruction, node) in legalize_block() 290 if (list_empty(&block->instr_list)) { in resolve_dest_block() [all …]
|
D | ir3_sched.c | 107 list_addtail(&instr->node, &instr->block->instr_list); in schedule() 143 struct list_head *instr_list = &ctx->block->instr_list; in distance() local 146 list_for_each_entry_rev (struct ir3_instruction, n, instr_list, node) { in distance() 505 list_replace(&block->instr_list, &unscheduled_list); in sched_block() 506 list_inithead(&block->instr_list); in sched_block() 628 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in sched_insert_parallel_copies()
|
D | ir3_depth.c | 132 ir3_insert_by_depth(instr, &instr->block->instr_list); in ir3_instr_depth() 138 list_for_each_entry_safe (struct ir3_instruction, instr, &block->instr_list, node) { in remove_unused_by_block()
|
D | ir3.c | 573 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ir3_assemble() 591 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ir3_assemble() 626 list_addtail(&instr->node, &block->instr_list); in insert_instr() 641 list_inithead(&block->instr_list); in ir3_block_create() 739 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) in ir3_block_clear_mark() 757 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ir3_count_instructions() 760 block->start_ip = list_first_entry(&block->instr_list, struct ir3_instruction, node)->ip; in ir3_count_instructions() 761 block->end_ip = list_last_entry(&block->instr_list, struct ir3_instruction, node)->ip; in ir3_count_instructions()
|
D | ir3_nir_lower_if_else.c | 204 exec_list_push_tail(&prev_block->instr_list, &instr->node); in flatten_block() 216 if (exec_list_is_empty(&block->instr_list)) in lower_if_else_block()
|
D | ir3_ra.c | 488 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ra_block_find_definers() 511 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ra_block_name_instructions() 636 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ra_block_compute_live_ranges() 732 list_last_entry(&src->block->instr_list, in ra_block_compute_live_ranges() 995 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in ra_block_alloc()
|
D | ir3_print.c | 211 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in print_block()
|
D | ir3.h | 427 struct list_head instr_list; /* list of ir3_instruction */ member
|
D | ir3_compiler_nir.c | 1698 list_for_each_entry (struct ir3_instruction, instr, &block->instr_list, node) { in resolve_phis() 1994 compile_assert(ctx, list_empty(&ctx->block->instr_list)); in emit_function()
|
/external/mesa3d/src/compiler/nir/ |
D | nir_opt_conditional_discard.c | 49 if (!exec_list_is_empty(&else_block->instr_list)) in nir_opt_conditional_discard_block() 55 if (exec_list_is_empty(&then_block->instr_list)) in nir_opt_conditional_discard_block() 57 if (exec_list_length(&then_block->instr_list) > 1) in nir_opt_conditional_discard_block()
|
D | nir_opt_dead_cf.c | 119 if (!exec_list_is_empty(&last_block->instr_list)) { in opt_constant_if() 196 if (!exec_list_is_empty(&after->instr_list) && in loop_is_dead() 247 if (exec_list_is_empty(&block->instr_list)) in ends_in_jump() 306 if (!exec_list_is_empty(&next->instr_list) || in dead_cf_list()
|
D | nir_control_flow.c | 51 return !exec_list_is_empty(&block->instr_list) && in block_ends_in_jump() 215 exec_list_push_head(&new_block->instr_list, &instr->node); in split_block_beginning() 366 exec_list_push_tail(&new_block->instr_list, &cur_instr->node); in split_block_before_instr() 557 assert(exec_list_is_empty(&after->instr_list)); in stitch_blocks() 567 foreach_list_typed(nir_instr, instr, node, &after->instr_list) { in stitch_blocks() 571 exec_list_append(&before->instr_list, &after->instr_list); in stitch_blocks()
|
D | nir_opt_peephole_select.c | 193 exec_list_push_tail(&prev_block->instr_list, &instr->node); in nir_opt_peephole_select_block() 199 exec_list_push_tail(&prev_block->instr_list, &instr->node); in nir_opt_peephole_select_block()
|
D | nir.h | 1468 struct exec_list instr_list; /** < list of nir_instr */ member 1511 struct exec_node *head = exec_list_get_head(&block->instr_list); in nir_block_first_instr() 1518 struct exec_node *tail = exec_list_get_tail(&block->instr_list); in nir_block_last_instr() 1523 foreach_list_typed(nir_instr, instr, node, &(block)->instr_list) 1525 foreach_list_typed_reverse(nir_instr, instr, node, &(block)->instr_list) 1527 foreach_list_typed_safe(nir_instr, instr, node, &(block)->instr_list) 1529 foreach_list_typed_reverse_safe(nir_instr, instr, node, &(block)->instr_list)
|
D | nir_opt_move_comparisons.c | 94 exec_list_push_tail(&block->instr_list, &src_instr->node); in move_comparison_source()
|
D | nir.c | 358 exec_list_make_empty(&block->instr_list); in nir_block_create() 879 if (exec_list_is_empty(&cursor.block->instr_list)) { in reduce_cursor() 980 assert(exec_list_is_empty(&cursor.block->instr_list)); in nir_instr_insert() 984 exec_list_push_head(&cursor.block->instr_list, &instr->node); in nir_instr_insert() 994 exec_list_push_tail(&cursor.block->instr_list, &instr->node); in nir_instr_insert()
|
D | nir_opt_gcm.c | 448 exec_list_push_tail(&instr->block->instr_list, &instr->node); in gcm_place_instr()
|
D | nir_validate.c | 661 exec_list_validate(&block->instr_list); in validate_block() 695 if (!exec_list_is_empty(&block->instr_list) && in validate_block() 1036 validate_assert(state, exec_list_is_empty(&impl->end_block->instr_list)); in validate_function_impl()
|
D | nir_opt_loop_unroll.c | 404 exec_list_is_empty(&nir_cf_node_as_block(unroll_loc)->instr_list)); in complex_unroll()
|
D | nir_loop_analyze.c | 296 if (exec_list_is_empty(&block->instr_list)) in ends_in_break()
|
D | nir_clone.c | 537 assert(exec_list_is_empty(&nblk->instr_list)); in clone_block()
|
/external/mesa3d/src/gallium/drivers/vc4/ |
D | vc4_program.c | 1893 exec_list_is_empty(&nir_else_block->instr_list)); in ntq_emit_if()
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
D | brw_fs.cpp | 6339 exec_list_push_head(&top->instr_list, &move[i]->node); in move_interpolation_to_top()
|