Lines Matching refs:live_after

63       Short live_after;
81 Short live_after;
236 /* Sort an array of RRegLR entries by either the .live_after or
263 while (arr[j-h].live_after > v.live_after) {
362 by .live_after and the other by .dead_before. First the
498 vreg_lrs[j].live_after = INVALID_INSTRNO;
575 if (vreg_lrs[k].live_after == INVALID_INSTRNO) {
583 if (vreg_lrs[k].live_after == INVALID_INSTRNO)
584 vreg_lrs[k].live_after = toShort(ii);
588 if (vreg_lrs[k].live_after == INVALID_INSTRNO) {
676 rreg_lrs_la[rreg_lrs_used].live_after = toShort(flush_la);
713 rreg_lrs_la[rreg_lrs_used].live_after = toShort(rreg_live_after[j]);
752 sortRRLRarray( rreg_lrs_la, rreg_lrs_used, True /* by .live_after*/ );
760 vassert(rreg_lrs_la[j-1].live_after <= rreg_lrs_la[j].live_after);
769 j, vreg_lrs[j].live_after, vreg_lrs[j].dead_before );
779 rreg_lrs_la[j].live_after, rreg_lrs_la[j].dead_before );
786 rreg_lrs_db[j].live_after, rreg_lrs_db[j].dead_before );
825 if (vreg_lrs[j].live_after == INVALID_INSTRNO) {
845 if (ss_busy_until_before[k+0] <= vreg_lrs[j].live_after
846 && ss_busy_until_before[k+1] <= vreg_lrs[j].live_after)
864 if (ss_busy_until_before[k] <= vreg_lrs[j].live_after)
945 if (rreg_lrs_la[j].live_after < ii
953 rreg_lrs[j].live_after,
981 && rreg_lrs_la[k].live_after < ii
1045 if (vreg_lrs[m].live_after != ii) goto cannot_coalesce;
1120 (their .live_after field).
1127 if (ii < rreg_lrs_la[rreg_lrs_la_next].live_after)
1129 vassert(ii == rreg_lrs_la[rreg_lrs_la_next].live_after);
1132 /* Note, re ii == rreg_lrs_la[rreg_lrs_la_next].live_after.
1137 rreg_lrs_la[rreg_lrs_la_next].live_after == ii, that is,