Lines Matching defs:intervals
110 struct ra_spill_interval **intervals;
113 /* rb tree of live intervals that we can spill, ordered by next-use distance.
114 * full_live_intervals contains the full+shared intervals in the merged_regs
415 /* Prioritize intervals that we can rematerialize. */
508 ctx->intervals = ralloc_array(ctx, struct ra_spill_interval *,
510 struct ra_spill_interval *intervals =
514 ctx->intervals[i] = &intervals[i];
520 rb_tree_init(&ctx->reg_ctx.intervals);
543 struct ra_spill_interval *interval = ctx->intervals[dst->name];
560 struct ra_spill_interval *interval = ctx->intervals[dst->name];
589 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
605 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
618 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
629 struct ra_spill_interval *interval = ctx->intervals[dst->name];
636 struct ra_spill_interval *interval = ctx->intervals[dst->name];
647 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
827 * reloaded. Because RA only expects overlapping source/dest intervals for meta
973 struct ra_spill_interval *interval = ctx->intervals[def->name];
1002 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
1015 struct ra_spill_interval *interval = ctx->intervals[src->def->name];
1129 ctx->intervals = reralloc(ctx, ctx->intervals, struct ra_spill_interval *,
1133 ctx->intervals[name] = interval;
1197 struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1212 struct ra_spill_interval *src_interval = ctx->intervals[src->def->name];
1213 struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1237 ctx->intervals[src->def->name];
1260 struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1277 struct ra_spill_interval *temp_interval = ctx->intervals[src->def->name];
1315 struct ra_spill_interval *interval = ctx->intervals[def->name];
1492 struct ra_spill_interval *interval = ctx->intervals[def->name];
1519 rb_tree_foreach (struct ra_spill_interval, interval, &ctx->reg_ctx.intervals,
1529 struct ra_spill_interval *interval = ctx->intervals[def->name];
1601 * anything. Just make the inserted intervals exactly match the predecessor. If
1613 struct ra_spill_interval *interval = ctx->intervals[reg->name];
1626 if (!ctx->intervals[phi->dsts[0]->name]->interval.inserted) {
1667 &ctx->reg_ctx.intervals, interval.node) {
1678 struct ra_spill_interval *interval = ctx->intervals[def->name];
1691 struct ra_spill_interval *interval = ctx->intervals[name];
1712 struct ra_spill_interval *interval = ctx->intervals[def->name];
1753 &ctx->reg_ctx.intervals, interval.node) {
1782 rb_tree_foreach (struct ra_spill_interval, interval, &ctx->reg_ctx.intervals,
1792 rb_tree_init(&ctx->reg_ctx.intervals);
2025 * intervals.