Home | History | Annotate | Download | only in nir

Lines Matching full:blocks

64     * we pull non-pinned instructions out of their blocks and place them in
66 * to put instructions back in their blocks.
70 struct gcm_block_info *blocks;
82 state->blocks[block->index].loop_depth = loop_depth;
177 * efficient because we can avoid walking over basic blocks and
290 * any that are usingg this SSA def, and using those blocks instead
330 if (state->blocks[block->index].loop_depth <
331 state->blocks[best->index].loop_depth)
387 * The earlier passes of GCM simply choose blocks for each instruction and
389 * into their chosen blocks.
394 * working on multiple blocks at a time, we keep track of the last inserted
409 * only doing scheduling within blocks, we don't need to worry about
435 struct gcm_block_info *block_info = &state->blocks[instr->block->index];
467 state.blocks = rzalloc_array(NULL, struct gcm_block_info, impl->num_blocks);
499 ralloc_free(state.blocks);