Lines Matching defs:block
89 loop_contains_block(nir_loop *loop, nir_block *block)
94 return block->index > before->index && block->index < after->index;
97 /* Given the LCA of all uses and the definition, find a block on the path
132 /* iterate a ssa def's use's and try to find a more optimal block to
134 * are contained in a single block, the load will be moved there,
135 * otherwise it will be move to the least common ancestor block of all
145 nir_block *use_block = instr->block;
149 * need to appear first in the block, so by definition
150 * we can't move an instruction into a block where it is
152 * move it into a dominator block.
182 lca = adjust_block_for_loops(lca, def->parent_instr->block,
184 assert(nir_block_dominates(def->parent_instr->block, lca));
212 nir_foreach_block_reverse(block, function->impl) {
213 nir_foreach_instr_reverse_safe(instr, block) {
225 if (!use_block || use_block == instr->block)