Lines Matching defs:right
80 /* Get the interval covering the reg, or the closest to the right if it
95 * right should be the closest to the right.
113 struct ir3_reg_interval *right =
115 if (right && right->reg->interval_start < interval->reg->interval_end) {
133 (right->reg->flags & IR3_REG_HALF));
135 if (right->reg->interval_end <= interval->reg->interval_end &&
136 right->reg->interval_start >= interval->reg->interval_start) {
138 assert(interval != right);
140 /* "right" is contained in "interval" and must become a child of
143 for (struct ir3_reg_interval *next = ir3_reg_interval_next(right);
144 right && right->reg->interval_start < interval->reg->interval_end;
145 right = next, next = ir3_reg_interval_next_or_null(next)) {
146 /* "right" must be contained in "interval." */
147 assert(right->reg->interval_end <= interval->reg->interval_end);
149 (right->reg->flags & IR3_REG_HALF));
150 if (!right->parent)
151 ctx->interval_delete(ctx, right);
152 right->parent = interval;
153 rb_tree_remove(tree, &right->node);
154 rb_tree_insert(&interval->children, &right->node,
158 /* "right" must contain "interval," since intervals must form a
161 assert(right->reg->interval_start <= interval->reg->interval_start);
162 interval->parent = right;
163 interval_insert(ctx, &right->children, interval);
438 /* Get the interval covering the reg, or the closest to the right if it
452 * right should be the closest to the right.
1209 /* mid-right of diagram. */
1212 /* far right of diagram. */
2633 * right size.