Lines Matching full:blocks
13 /// This pass reorders the blocks in a function to put them into topological
77 for (MachineBasicBlock *MBB : Loop->blocks())
101 /// Sort blocks by their number.
108 /// Sort blocks by their number in the opposite order..
115 /// Bookkeeping for a loop to help ensure that we don't mix blocks not dominated
116 /// by the loop header among the loop's blocks.
121 /// List of blocks not dominated by Loop's header that are deferred until
122 /// after all of Loop's blocks have been seen.
130 /// Sort the blocks, taking special care to make sure that loops are not
131 /// interrupted by blocks not dominated by their header.
152 // no blocks not dominated by the loop header.
156 // order. Ready has the remaining ready blocks.
168 // any blocks that it doesn't dominate until we see the end of the loop.
173 // blocks deferred because the header didn't dominate them.
219 // If there are no more blocks to process, we're done.
254 assert(MBB.getNumber() >= 0 && "Renumbered blocks should be non-negative.");
271 "Blocks must be nested in their loops");
334 assert(&MBB != &MF.front() && "Header blocks shouldn't have predecessors");
370 // beginning of the local expression tree and any nested BLOCKs.
459 // over scoped regions when walking blocks. We allocate one more than the
460 // number of blocks in the function to accommodate for the possible fake block
475 // Now rewrite references to basic blocks to be depth immediates.
528 // Sort the blocks, with contiguous loops.
