Lines Matching full:blocks
180 // Sort the blocks vector so that we can use binary search to do quick
196 // block they are defined in. Also, blocks not reachable from the
220 // Return false if any loop blocks contain indirectbrs, or there are any calls
340 // Sort the blocks vector so that we can use binary search to do quick
356 /// getUniqueExitBlocks - Return all unique successor blocks of this loop.
357 /// These are the blocks _outside of the current loop_ which are branched to.
365 // Sort the blocks vector so that we can use binary search to do quick
433 /// Find the new parent loop for all blocks within the "unloop" whose last
466 /// updateBlockParents - Update the parent loop for all blocks that are directly
470 // Perform a post order CFG traversal of all blocks within this loop,
498 // Iterate over the postorder list of blocks, propagating the nearest loop
516 /// removeBlocksFromAncestors - Remove unloop's blocks from all ancestors below
519 // Remove all unloop's blocks (including those in nested subloops) from
529 // Remove blocks from former Ancestors except Unloop itself which will be
558 /// For subloop blocks, simply update SubloopParents and return NULL.
561 // Initially for blocks directly contained by Unloop, NearLoop == Unloop and
580 assert(!Subloop && "subloop blocks must have a successor");
581 NearLoop = 0; // unloop blocks may now exit the function.
634 /// "unloop". Find a new parent for the blocks contained within unloop and
644 // Since BBLoop had no parent, Unloop blocks are no longer in a loop.
648 // Don't reparent blocks in subloops.
652 // Blocks no longer have a parent but are still referenced by Unloop until
673 // Update the parent loop for all blocks within the loop. Blocks within
678 // Remove blocks from former ancestor loops.
710 // Verify that blocks are mapped to valid loops.
731 /// Traverse the loop blocks and store the DFS result.
733 /// visit blocks during the initial traversal.