Lines Matching defs:blocks
87 * we pull non-pinned instructions out of their blocks and place them in
89 * to put instructions back in their blocks.
93 struct gcm_block_info *blocks;
141 state->blocks[block->index].if_depth = if_depth;
142 state->blocks[block->index].loop_depth = loop_depth;
143 state->blocks[block->index].loop_instr_count = loop_instr_count;
144 state->blocks[block->index].loop = loop;
402 * efficient because we can avoid walking over basic blocks.
502 nir_loop *loop = state->blocks[instr->block->index].loop;
531 if (state->blocks[instr->block->index].loop_instr_count < MAX_LOOP_INSTRUCTIONS)
566 if (state->blocks[block->index].loop_depth >
567 state->blocks[instr->block->index].loop_depth)
570 if (state->blocks[block->index].if_depth >=
571 state->blocks[best->index].if_depth &&
597 if (state->blocks[block->index].loop_depth <
598 state->blocks[best->index].loop_depth) {
641 * any that are usingg this SSA def, and using those blocks instead
752 * The earlier passes of GCM simply choose blocks for each instruction and
754 * into their chosen blocks.
775 struct gcm_block_info *block_info = &state->blocks[instr->block->index];
814 state.blocks = rzalloc_array(NULL, struct gcm_block_info, impl->num_blocks);
847 ralloc_free(state.blocks);