HomeSort by relevance Sort by last modified time
    Searched refs:AvailOut (Results 1 - 2 of 2) sorted by null

  /external/llvm/lib/CodeGen/
ShrinkWrapping.cpp 135 AvailOut.clear();
241 // AvailIn[MBB] = INTERSECT(AvailOut[P] for P in PREDECESSORS(MBB))
255 AvailIn[MBB] = AvailOut[PRED];
258 AvailIn[MBB] &= AvailOut[PRED];
264 // AvailOut[MBB] = UNION(CSRUsed[MBB], AvailIn[MBB]);
265 CSRegSet prevAvailOut = AvailOut[MBB];
266 AvailOut[MBB] = CSRUsed[MBB] | AvailIn[MBB];
267 if (prevAvailOut != AvailOut[MBB])
733 /// in MBB using AvailOut sets of MBB's succcessors, keeping track
742 // Intersect (CSRegs - AvailOut[S]) for S in Successors(MBB
    [all...]
PrologEpilogInserter.h 79 CSRegBlockMap AvailIn, AvailOut;

Completed in 411 milliseconds