Cross Reference: /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ir3

Lines Matching defs:intervals
107    struct ra_spill_interval **intervals;
110    /* rb tree of live intervals that we can spill, ordered by next-use distance.
111     * full_live_intervals contains the full+shared intervals in the merged_regs
448    ctx->intervals = ralloc_array(ctx, struct ra_spill_interval *,
450    struct ra_spill_interval *intervals =
454       ctx->intervals[i] = &intervals[i];
460    rb_tree_init(&ctx->reg_ctx.intervals);
483    struct ra_spill_interval *interval = ctx->intervals[dst->name];
492    struct ra_spill_interval *interval = ctx->intervals[dst->name];
521    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
537    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
550    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
561    struct ra_spill_interval *interval = ctx->intervals[dst->name];
568    struct ra_spill_interval *interval = ctx->intervals[dst->name];
579    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
754  * reloaded. Because RA only expects overlapping source/dest intervals for meta
888    struct ra_spill_interval *interval = ctx->intervals[def->name];
913    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
926    struct ra_spill_interval *interval = ctx->intervals[src->def->name];
1038    ctx->intervals = reralloc(ctx, ctx->intervals, struct ra_spill_interval *,
1042    ctx->intervals[name] = interval;
1106       struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1121          struct ra_spill_interval *src_interval = ctx->intervals[src->def->name];
1122          struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1146             ctx->intervals[src->def->name];
1169       struct ra_spill_interval *dst_interval = ctx->intervals[dst->name];
1186          struct ra_spill_interval *temp_interval = ctx->intervals[src->def->name];
1224    struct ra_spill_interval *interval = ctx->intervals[def->name];
1399    struct ra_spill_interval *interval = ctx->intervals[def->name];
1423    rb_tree_foreach (struct ra_spill_interval, interval, &ctx->reg_ctx.intervals,
1433    struct ra_spill_interval *interval = ctx->intervals[def->name];
1505  * anything. Just make the inserted intervals exactly match the predecessor. If
1517       struct ra_spill_interval *interval = ctx->intervals[reg->name];
1530    if (!ctx->intervals[phi->dsts[0]->name]->interval.inserted) {
1569                          &ctx->reg_ctx.intervals, interval.node) {
1580    struct ra_spill_interval *interval = ctx->intervals[def->name];
1593       struct ra_spill_interval *interval = ctx->intervals[name];
1614       struct ra_spill_interval *interval = ctx->intervals[def->name];
1655                        &ctx->reg_ctx.intervals, interval.node) {
1684    rb_tree_foreach (struct ra_spill_interval, interval, &ctx->reg_ctx.intervals,
1694    rb_tree_init(&ctx->reg_ctx.intervals);
1927  *    intervals.