Searched refs:block (Results 1 - 25 of 1316) sorted by relevance

1234567891011>>

/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_control_flow_private.h38 void nir_handle_add_jump(nir_block *block);
39 void nir_handle_remove_jump(nir_block *block, nir_jump_type type);
H A Dnir_dominance.c37 init_block(nir_block *block, nir_function_impl *impl) argument
39 if (block == nir_start_block(impl))
40 block->imm_dom = block;
42 block->imm_dom = NULL;
43 block->num_dom_children = 0;
46 block->dom_pre_index = UINT32_MAX;
47 block->dom_post_index = 0;
49 _mesa_set_clear(block->dom_frontier, NULL);
73 calc_dominance(nir_block *block) argument
96 calc_dom_frontier(nir_block * block) argument
152 calc_dfs_indicies(nir_block * block,uint32_t * index) argument
267 nir_block_is_unreachable(nir_block * block) argument
[all...]
H A Dnir_control_flow.c37 * 2. Each if-statement and loop must have one basic block before it and one
40 * 4. If a basic block has a jump instruction, there must be only one and it
41 * must be at the end of the block.
49 block_add_pred(nir_block *block, nir_block *pred) argument
51 _mesa_set_add(block->predecessors, pred);
55 block_remove_pred(nir_block *block, nir_block *pred) argument
57 struct set_entry *entry = _mesa_set_search(block->predecessors, pred);
61 _mesa_set_remove(block->predecessors, entry);
91 unlink_block_successors(nir_block *block) argument
93 if (block
100 link_non_block_to_block(nir_cf_node * node,nir_block * block) argument
128 link_block_to_non_block(nir_block * block,nir_cf_node * node) argument
164 replace_successor(nir_block * block,nir_block * old_succ,nir_block * new_succ) argument
186 split_block_beginning(nir_block * block) argument
213 rewrite_phi_preds(nir_block * block,nir_block * old_pred,nir_block * new_pred) argument
230 nir_insert_phi_undef(nir_block * block,nir_block * pred) argument
279 block_add_normal_succs(nir_block * block) argument
320 split_block_end(nir_block * block) argument
432 remove_phi_src(nir_block * block,nir_block * pred) argument
454 nir_handle_add_jump(nir_block * block) argument
507 unlink_jump(nir_block * block,nir_jump_type type,bool add_normal_successors) argument
520 nir_handle_remove_jump(nir_block * block,nir_jump_type type) argument
589 nir_block *block = nir_cf_node_as_block(node); local in function:nir_cf_node_insert
626 nir_block *block = nir_cf_node_as_block(node); local in function:cleanup_cf_node
737 nir_block *block = nir_cf_node_as_block(node); local in function:relink_jump_halt_cf_node
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_control_flow_private.h38 void nir_handle_add_jump(nir_block *block);
39 void nir_handle_remove_jump(nir_block *block, nir_jump_type type);
H A Dnir_dominance.c37 init_block(nir_block *block, nir_function_impl *impl) argument
39 if (block == nir_start_block(impl))
40 block->imm_dom = block;
42 block->imm_dom = NULL;
43 block->num_dom_children = 0;
45 set_foreach(block->dom_frontier, entry) {
46 _mesa_set_remove(block->dom_frontier, entry);
71 calc_dominance(nir_block *block) argument
74 set_foreach(block
94 calc_dom_frontier(nir_block * block) argument
150 calc_dfs_indicies(nir_block * block,unsigned * index) argument
243 nir_block_is_unreachable(nir_block * block) argument
[all...]
H A Dnir_opt_move_comparisons.c31 * It only moves instructions within a single basic block; cross-block
54 move_comparison_source(nir_src *src, nir_block *block, nir_instr *before) argument
61 if (src_instr->block == block &&
70 exec_list_push_tail(&block->instr_list, &src_instr->node);
84 if (move_comparison_source(src, instr->block, instr))
91 move_comparisons(nir_block *block) argument
97 * If the instruction's source is a comparison from the same block,
99 * the block a
[all...]
H A Dnir_opt_move_load_ubo.c31 * the same basic block.
34 move_load_ubo_source(nir_src *src, nir_block *block, nir_instr *before) argument
41 if (src_instr->block == block &&
50 exec_list_push_tail(&block->instr_list, &src_instr->node);
63 if (move_load_ubo_source(src, instr->block, instr))
70 move_load_ubo(nir_block *block) argument
74 nir_if *iff = nir_block_get_following_if(block);
76 progress |= move_load_ubo_source(&iff->condition, block, NULL);
79 nir_foreach_instr_reverse(instr, block) {
[all...]
H A Dnir_control_flow.c37 * 2. Each if-statement and loop must have one basic block before it and one
40 * 4. If a basic block has a jump instruction, there must be only one and it
41 * must be at the end of the block.
49 block_add_pred(nir_block *block, nir_block *pred) argument
51 _mesa_set_add(block->predecessors, pred);
55 block_remove_pred(nir_block *block, nir_block *pred) argument
57 struct set_entry *entry = _mesa_set_search(block->predecessors, pred);
61 _mesa_set_remove(block->predecessors, entry);
91 unlink_block_successors(nir_block *block) argument
93 if (block
100 link_non_block_to_block(nir_cf_node * node,nir_block * block) argument
128 link_block_to_non_block(nir_block * block,nir_cf_node * node) argument
164 replace_successor(nir_block * block,nir_block * old_succ,nir_block * new_succ) argument
186 split_block_beginning(nir_block * block) argument
213 rewrite_phi_preds(nir_block * block,nir_block * old_pred,nir_block * new_pred) argument
230 insert_phi_undef(nir_block * block,nir_block * pred) argument
286 block_add_normal_succs(nir_block * block) argument
327 split_block_end(nir_block * block) argument
439 remove_phi_src(nir_block * block,nir_block * pred) argument
460 nir_handle_add_jump(nir_block * block) argument
497 unlink_jump(nir_block * block,nir_jump_type type,bool add_normal_successors) argument
510 nir_handle_remove_jump(nir_block * block,nir_jump_type type) argument
579 nir_block *block = nir_cf_node_as_block(node); local in function:nir_cf_node_insert
616 nir_block *block = nir_cf_node_as_block(node); local in function:cleanup_cf_node
[all...]
/xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
H A Dir3_dominance.c54 calc_dominance(struct ir3_block *block) argument
57 for (unsigned i = 0; i < block->predecessors_count; i++) {
58 struct ir3_block *pred = block->predecessors[i];
68 if (block->imm_dom != new_idom) {
69 block->imm_dom = new_idom;
77 calc_dfs_indices(struct ir3_block *block, unsigned index) argument
79 block->dom_pre_index = index++;
80 for (unsigned i = 0; i < block->dom_children_count; i++)
81 index = calc_dfs_indices(block->dom_children[i], index);
82 block
[all...]
H A Dir3_remove_unreachable.c33 delete_block(struct ir3 *ir, struct ir3_block *block) argument
36 foreach_instr (instr, &block->instr_list) {
43 /* The end block can be legitimately unreachable if the shader only exits via
45 * block around but delete all the other instructions and make the end not
50 foreach_instr_safe (instr, &block->instr_list) {
59 struct ir3_block *succ = block->successors[i];
63 unsigned pred_idx = ir3_block_get_pred_index(succ, block);
86 struct ir3_block *succ = block->physical_successors[i];
90 ir3_block_remove_physical_predecessor(succ, block);
93 if (block
[all...]
H A Dir3_legalize.c67 /* We want to evaluate each block from the position of any other
68 * predecessor block, in order that the flags set are the union of
73 * that we can't simply recursively process each predecessor block
74 * before legalizing the current block.
77 * results converge. If the output state of a given block changes
83 legalize_block(struct ir3_legalize_ctx *ctx, struct ir3_block *block) argument
85 struct ir3_legalize_block_data *bd = block->data;
100 for (unsigned i = 0; i < block->predecessors_count; i++) {
101 struct ir3_block *predecessor = block->predecessors[i];
116 foreach_instr (n, &block
388 apply_fine_deriv_macro(struct ir3_legalize_ctx * ctx,struct ir3_block * block) argument
450 resolve_dest_block(struct ir3_block * block) argument
616 mark_jp(struct ir3_block * block) argument
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/
H A Dvc4_qir_emit_uniform_stream_resets.c27 * Adds updates to the uniform stream address at the start of each basic block
31 * have performed optimization know how many uniforms are used in each block.
39 block_reads_any_uniform(struct qblock *block) argument
41 qir_for_each_inst(inst, block) {
54 qir_for_each_block(block, c) {
55 if (block != qir_entry_block(c) &&
56 (block_reads_any_uniform(block) ||
57 block == qir_exit_block(c))) {
75 /* Pushes to the top of the block, so in reverse
78 list_add(&add->link, &block
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/
H A Dvc4_qir_emit_uniform_stream_resets.c27 * Adds updates to the uniform stream address at the start of each basic block
31 * have performed optimization know how many uniforms are used in each block.
39 block_reads_any_uniform(struct qblock *block) argument
41 qir_for_each_inst(inst, block) {
54 qir_for_each_block(block, c) {
55 if (block != qir_entry_block(c) &&
56 (block_reads_any_uniform(block) ||
57 block == qir_exit_block(c))) {
75 /* Pushes to the top of the block, so in reverse
78 list_add(&add->link, &block
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/
H A Dr600_perfcounter.c33 /* Max counters per HW block */
40 struct r600_perfcounter_block *block = pc->blocks; local in function:lookup_counter
44 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
45 unsigned total = block->num_groups * block->num_selectors;
49 return block;
53 *base_gid += block->num_groups;
63 struct r600_perfcounter_block *block = pc->blocks; local in function:lookup_group
65 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
66 if (*index < block
76 struct r600_perfcounter_block *block; member in struct:r600_pc_group
140 struct r600_perfcounter_block *block = group->block; local in function:r600_pc_query_emit_start
168 struct r600_perfcounter_block *block = group->block; local in function:r600_pc_query_emit_stop
233 get_group_state(struct r600_common_screen * screen,struct r600_query_pc * query,struct r600_perfcounter_block * block,unsigned sub_gid) argument
307 struct r600_perfcounter_block *block; local in function:r600_create_batch_query
363 struct r600_perfcounter_block *block = group->block; local in function:r600_create_batch_query
394 struct r600_perfcounter_block *block; local in function:r600_create_batch_query
430 r600_init_block_names(struct r600_common_screen * screen,struct r600_perfcounter_block * block) argument
519 struct r600_perfcounter_block *block; local in function:r600_get_perfcounter_info
561 struct r600_perfcounter_block *block; local in function:r600_get_perfcounter_group_info
608 struct r600_perfcounter_block *block = &pc->blocks[pc->num_blocks]; local in function:r600_perfcounters_add_block
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/
H A Dr600_perfcounter.c33 /* Max counters per HW block */
40 struct r600_perfcounter_block *block = pc->blocks; local in function:lookup_counter
44 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
45 unsigned total = block->num_groups * block->num_selectors;
49 return block;
53 *base_gid += block->num_groups;
63 struct r600_perfcounter_block *block = pc->blocks; local in function:lookup_group
65 for (bid = 0; bid < pc->num_blocks; ++bid, ++block) {
66 if (*index < block
76 struct r600_perfcounter_block *block; member in struct:r600_pc_group
140 struct r600_perfcounter_block *block = group->block; local in function:r600_pc_query_emit_start
168 struct r600_perfcounter_block *block = group->block; local in function:r600_pc_query_emit_stop
233 get_group_state(struct r600_common_screen * screen,struct r600_query_pc * query,struct r600_perfcounter_block * block,unsigned sub_gid) argument
307 struct r600_perfcounter_block *block; local in function:r600_create_batch_query
363 struct r600_perfcounter_block *block = group->block; local in function:r600_create_batch_query
394 struct r600_perfcounter_block *block; local in function:r600_create_batch_query
430 r600_init_block_names(struct r600_common_screen * screen,struct r600_perfcounter_block * block) argument
519 struct r600_perfcounter_block *block; local in function:r600_get_perfcounter_info
561 struct r600_perfcounter_block *block; local in function:r600_get_perfcounter_group_info
608 struct r600_perfcounter_block *block = &pc->blocks[pc->num_blocks]; local in function:r600_perfcounters_add_block
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/mesa/main/
H A Dtexcompress_etc_tmp.h84 TAG(etc1_parse_block)(struct TAG(etc1_block) *block, const UINT8_TYPE *src)
88 block->base_colors[0][0] = (int) TAG(etc1_base_color_diff_hi)(src[0]);
89 block->base_colors[1][0] = (int) TAG(etc1_base_color_diff_lo)(src[0]);
90 block->base_colors[0][1] = (int) TAG(etc1_base_color_diff_hi)(src[1]);
91 block->base_colors[1][1] = (int) TAG(etc1_base_color_diff_lo)(src[1]);
92 block->base_colors[0][2] = (int) TAG(etc1_base_color_diff_hi)(src[2]);
93 block->base_colors[1][2] = (int) TAG(etc1_base_color_diff_lo)(src[2]);
97 block->base_colors[0][0] = (int) TAG(etc1_base_color_ind_hi)(src[0]);
98 block->base_colors[1][0] = (int) TAG(etc1_base_color_ind_lo)(src[0]);
99 block
147 struct etc1_block block; local in function:etc1_unpack_rgba8888
[all...]
H A Dtexcompress_etc.c122 * The size of the source data must be a multiple of the ETC1 block size,
128 * found in the upper left part of the block(s), and the rest of the
130 * placed in the upper half of a 4x4 block, and the lower half of the
131 * pixels in the block will not be accessed.
308 etc2_get_pixel_index(const struct etc2_block *block, int x, int y) argument
311 int idx = (block->pixel_indices[1] >> bit) & 0x7;
337 etc2_rgb8_parse_block(struct etc2_block *block, argument
350 block->is_ind_mode = false;
351 block->is_diff_mode = false;
352 block
477 etc2_rgb8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst,GLboolean punchthrough_alpha) argument
554 etc2_alpha8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
566 etc2_r11_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
592 etc2_signed_r11_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
630 etc2_alpha8_parse_block(struct etc2_block * block,const uint8_t * src) argument
644 etc2_r11_parse_block(struct etc2_block * block,const uint8_t * src) argument
651 etc2_rgba8_parse_block(struct etc2_block * block,const uint8_t * src) argument
661 etc2_rgba8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
678 struct etc2_block block; local in function:etc2_unpack_rgb8
726 struct etc2_block block; local in function:etc2_unpack_srgb8
777 struct etc2_block block; local in function:etc2_unpack_rgba8
816 struct etc2_block block; local in function:etc2_unpack_srgb8_alpha8
863 struct etc2_block block; local in function:etc2_unpack_r11
900 struct etc2_block block; local in function:etc2_unpack_rg11
950 struct etc2_block block; local in function:etc2_unpack_signed_r11
988 struct etc2_block block; local in function:etc2_unpack_signed_rg11
1035 struct etc2_block block; local in function:etc2_unpack_rgb8_punchthrough_alpha1
1072 struct etc2_block block; local in function:etc2_unpack_srgb8_punchthrough_alpha1
1272 struct etc1_block block; local in function:fetch_etc1_rgb8
1292 struct etc2_block block; local in function:fetch_etc2_rgb8
1313 struct etc2_block block; local in function:fetch_etc2_srgb8
1334 struct etc2_block block; local in function:fetch_etc2_rgba8_eac
1353 struct etc2_block block; local in function:fetch_etc2_srgb8_alpha8_eac
1372 struct etc2_block block; local in function:fetch_etc2_r11_eac
1391 struct etc2_block block; local in function:fetch_etc2_rg11_eac
1415 struct etc2_block block; local in function:fetch_etc2_signed_r11_eac
1434 struct etc2_block block; local in function:fetch_etc2_signed_rg11_eac
1459 struct etc2_block block; local in function:fetch_etc2_rgb8_punchthrough_alpha1
1480 struct etc2_block block; local in function:fetch_etc2_srgb8_punchthrough_alpha1
[all...]
/xsrc/external/mit/MesaLib/dist/src/mesa/main/
H A Dtexcompress_etc_tmp.h84 TAG(etc1_parse_block)(struct TAG(etc1_block) *block, const UINT8_TYPE *src)
88 block->base_colors[0][0] = (int) TAG(etc1_base_color_diff_hi)(src[0]);
89 block->base_colors[1][0] = (int) TAG(etc1_base_color_diff_lo)(src[0]);
90 block->base_colors[0][1] = (int) TAG(etc1_base_color_diff_hi)(src[1]);
91 block->base_colors[1][1] = (int) TAG(etc1_base_color_diff_lo)(src[1]);
92 block->base_colors[0][2] = (int) TAG(etc1_base_color_diff_hi)(src[2]);
93 block->base_colors[1][2] = (int) TAG(etc1_base_color_diff_lo)(src[2]);
97 block->base_colors[0][0] = (int) TAG(etc1_base_color_ind_hi)(src[0]);
98 block->base_colors[1][0] = (int) TAG(etc1_base_color_ind_lo)(src[0]);
99 block
147 struct etc1_block block; local in function:etc1_unpack_rgba8888
[all...]
H A Dtexcompress_etc.c122 * The size of the source data must be a multiple of the ETC1 block size,
128 * found in the upper left part of the block(s), and the rest of the
130 * placed in the upper half of a 4x4 block, and the lower half of the
131 * pixels in the block will not be accessed.
308 etc2_get_pixel_index(const struct etc2_block *block, int x, int y) argument
311 int idx = (block->pixel_indices[1] >> bit) & 0x7;
337 etc2_rgb8_parse_block(struct etc2_block *block, argument
350 block->is_ind_mode = false;
351 block->is_diff_mode = false;
352 block
477 etc2_rgb8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst,GLboolean punchthrough_alpha) argument
556 etc2_alpha8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
568 etc2_r11_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
594 etc2_signed_r11_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
632 etc2_alpha8_parse_block(struct etc2_block * block,const uint8_t * src) argument
646 etc2_r11_parse_block(struct etc2_block * block,const uint8_t * src) argument
653 etc2_rgba8_parse_block(struct etc2_block * block,const uint8_t * src) argument
663 etc2_rgba8_fetch_texel(const struct etc2_block * block,int x,int y,uint8_t * dst) argument
680 struct etc2_block block; local in function:etc2_unpack_rgb8
728 struct etc2_block block; local in function:etc2_unpack_srgb8
779 struct etc2_block block; local in function:etc2_unpack_rgba8
818 struct etc2_block block; local in function:etc2_unpack_srgb8_alpha8
865 struct etc2_block block; local in function:etc2_unpack_r11
902 struct etc2_block block; local in function:etc2_unpack_rg11
952 struct etc2_block block; local in function:etc2_unpack_signed_r11
990 struct etc2_block block; local in function:etc2_unpack_signed_rg11
1037 struct etc2_block block; local in function:etc2_unpack_rgb8_punchthrough_alpha1
1074 struct etc2_block block; local in function:etc2_unpack_srgb8_punchthrough_alpha1
1274 struct etc1_block block; local in function:fetch_etc1_rgb8
1294 struct etc2_block block; local in function:fetch_etc2_rgb8
1315 struct etc2_block block; local in function:fetch_etc2_srgb8
1336 struct etc2_block block; local in function:fetch_etc2_rgba8_eac
1355 struct etc2_block block; local in function:fetch_etc2_srgb8_alpha8_eac
1374 struct etc2_block block; local in function:fetch_etc2_r11_eac
1393 struct etc2_block block; local in function:fetch_etc2_rg11_eac
1417 struct etc2_block block; local in function:fetch_etc2_signed_r11_eac
1436 struct etc2_block block; local in function:fetch_etc2_signed_rg11_eac
1461 struct etc2_block block; local in function:fetch_etc2_rgb8_punchthrough_alpha1
1482 struct etc2_block block; local in function:fetch_etc2_srgb8_punchthrough_alpha1
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/clover/util/
H A Dfactor.hpp65 std::pair<T, std::vector<T>> block,
74 std::move(block), d + 1, 0);
80 block.first *= f;
81 block.second[d] *= f;
83 if (block.first <= limits.first &&
84 block.second[d] <= limits.second[d] &&
85 grid[d] % block.second[d] == 0) {
87 return block;
91 while (block.second[d] % f == 0) {
92 block
62 next_grid_factor(const std::pair<T,std::vector<T>> & limits,const std::vector<T> & grid,const std::vector<std::vector<T>> & factors,std::pair<T,std::vector<T>> block,unsigned d=0,unsigned i=0) argument
119 for (auto block = best; local in function:clover::factor::find_grid_optimal_factor
[all...]
/xsrc/external/mit/MesaLib/dist/src/amd/compiler/
H A Daco_ssa_elimination.cpp40 /* The outer vectors should be indexed by block index. The inner vectors store phi information
41 * for each block. */
58 for (Block& block : ctx.program->blocks) {
59 for (aco_ptr<Instruction>& phi : block.instructions) {
72 phi->opcode == aco_opcode::p_phi ? block.logical_preds : block.linear_preds;
92 Block& block = ctx.program->blocks[block_idx]; local in function:aco::__anonf94d4d690110::insert_parallelcopies
93 unsigned idx = block.instructions.size() - 1;
94 while (block.instructions[idx]->opcode != aco_opcode::p_logical_end) {
99 std::vector<aco_ptr<Instruction>>::iterator it = std::next(block
120 Block& block = ctx.program->blocks[block_idx]; local in function:aco::__anonf94d4d690110::insert_parallelcopies
140 is_empty_block(Block * block,bool ignore_exec_writes) argument
170 try_remove_merge_block(ssa_elimination_ctx & ctx,Block * block) argument
189 try_remove_invert_block(ssa_elimination_ctx & ctx,Block * block) argument
219 try_remove_simple_block(ssa_elimination_ctx & ctx,Block * block) argument
299 eliminate_useless_exec_writes_in_block(ssa_elimination_ctx & ctx,Block & block) argument
367 Block* block = &ctx.program->blocks[i]; local in function:aco::__anonf94d4d690110::jump_threading
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/util/
H A Dfactor.hpp65 std::pair<T, std::vector<T>> block,
74 std::move(block), d + 1, 0);
80 block.first *= f;
81 block.second[d] *= f;
83 if (block.first <= limits.first &&
84 block.second[d] <= limits.second[d] &&
85 grid[d] % block.second[d] == 0) {
87 return block;
91 while (block.second[d] % f == 0) {
92 block
62 next_grid_factor(const std::pair<T,std::vector<T>> & limits,const std::vector<T> & grid,const std::vector<std::vector<T>> & factors,std::pair<T,std::vector<T>> block,unsigned d=0,unsigned i=0) argument
119 for (auto block = best; local in function:clover::factor::find_grid_optimal_factor
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/
H A Dbrw_cfg.cpp40 bblock_t *block = link->block; local in function:pop_stack
43 return block;
47 link(void *mem_ctx, bblock_t *block) argument
49 bblock_link *l = new(mem_ctx) bblock_link(block);
69 bblock_t::is_predecessor_of(const bblock_t *block) const
71 foreach_list_typed_safe (bblock_link, parent, link, &block->parents) {
72 if (parent->block == this) {
81 bblock_t::is_successor_of(const bblock_t *block) const
83 foreach_list_typed_safe (bblock_link, child, link, &block
392 remove_block(bblock_t * block) argument
447 bblock_t *block = new(mem_ctx) bblock_t(this); local in function:cfg_t::new_block
453 set_next_block(bblock_t ** cur,bblock_t * block,int ip) argument
572 bblock_t *block = this->blocks[b]; local in function:cfg_t::dump_cfg
[all...]
H A Dbrw_cfg.h39 bblock_link(bblock_t *block) argument
40 : block(block)
46 struct bblock_t *block; member in struct:bblock_link
58 bool is_predecessor_of(const bblock_t *block) const;
59 bool is_successor_of(const bblock_t *block) const;
97 bblock_start(struct bblock_t *block) argument
99 return (struct backend_instruction *)exec_list_get_head(&block->instructions);
103 bblock_start_const(const struct bblock_t *block) argument
105 return (const struct backend_instruction *)exec_list_get_head_const(&block
109 bblock_end(struct bblock_t * block) argument
115 bblock_end_const(const struct bblock_t * block) argument
121 bblock_next(struct bblock_t * block) argument
130 bblock_next_const(const struct bblock_t * block) argument
139 bblock_prev(struct bblock_t * block) argument
148 bblock_prev_const(const struct bblock_t * block) argument
157 bblock_starts_with_control_flow(const struct bblock_t * block) argument
164 bblock_ends_with_control_flow(const struct bblock_t * block) argument
175 bblock_first_non_control_flow_inst(struct bblock_t * block) argument
188 bblock_last_non_control_flow_inst(struct bblock_t * block) argument
[all...]
/xsrc/external/mit/MesaLib/dist/src/intel/compiler/
H A Dbrw_cfg.cpp43 bblock_t *block = link->block; local in function:pop_stack
46 return block;
50 link(void *mem_ctx, bblock_t *block, enum bblock_link_kind kind) argument
52 bblock_link *l = new(mem_ctx) bblock_link(block, kind);
57 push_stack(exec_list *list, void *mem_ctx, bblock_t *block) argument
62 list->push_tail(link(mem_ctx, block, bblock_link_logical));
82 bblock_t::is_predecessor_of(const bblock_t *block, argument
85 foreach_list_typed_safe (bblock_link, parent, link, &block->parents) {
86 if (parent->block
95 is_successor_of(const bblock_t * block,enum bblock_link_kind kind) const argument
417 remove_block(bblock_t * block) argument
475 bblock_t *block = new(mem_ctx) bblock_t(this); local in function:cfg_t::new_block
481 set_next_block(bblock_t ** cur,bblock_t * block,int ip) argument
610 bblock_t *block = this->blocks[b]; local in function:cfg_t::dump_cfg
[all...]

Completed in 15 milliseconds

1234567891011>>