Lines Matching defs:value
63 * value-comparison optimization they explain, as without it we wouldn't be
115 chase_copies(struct def_value value)
118 struct ir3_instruction *instr = value.reg->instr;
120 value.offset += instr->split.off * reg_elem_size(value.reg);
121 value.reg = instr->srcs[0]->def;
123 if (value.offset % reg_elem_size(value.reg) != 0 ||
124 value.size > reg_elem_size(value.reg) ||
125 value.offset + value.size > reg_size(value.reg))
128 instr->srcs[value.offset / reg_elem_size(value.reg)];
131 value.offset = 0;
132 value.reg = src->def;
139 return value;
165 * given merge set will form a tree. If they didn't, then one live value
291 * checked for interference. We implement the value-chasing extension
299 * value-chasing extension, but we'd have to come up with something