Lines Matching refs:set
38 * merge set. This prevents us from having to insert memory-to-memory copies
41 * set, and they overlap each other in the merge set, they always occupy
49 * try to allocate all the definitions in the same merge set to the
54 * registers in the same merge set to the same register, but with SSA-based
83 /* Definitions within a merge set are ordered by instr->ip as set above: */
142 /* This represents an entry in the merge set, and consists of a register +
143 * offset from the merge set base.
165 * given merge set will form a tree. If they didn't, then one live value
198 struct ir3_merge_set *set = ralloc(def, struct ir3_merge_set);
199 set->preferred_reg = ~0;
200 set->interval_start = ~0;
201 set->spill_slot = ~0;
202 set->size = reg_size(def);
203 set->alignment = (def->flags & IR3_REG_HALF) ? 1 : 2;
204 set->regs_count = 1;
205 set->regs = ralloc(set, struct ir3_register *);
206 set->regs[0] = def;
208 return set;
518 struct set *merge_sets = _mesa_pointer_set_create(NULL);
528 d("merge set, size %u, align %u:", merge_set->size,