Lines Matching refs:Blocks
11 // algorithm. The idea is to put frequently executed blocks together at the
14 // function, this pass basically orders blocks in depth-first order
22 // placing the most frequently executed successor until we run out of blocks. I
39 STATISTIC(NumMoved, "Number of basic blocks moved");
72 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
93 // Recursively place all blocks.
102 /// PlaceBlocks - Recursively place the specified blocks and any unplaced
113 Function::BasicBlockListType &Blocks = BB->getParent()->getBasicBlockList();
114 Blocks.splice(InsertPos, Blocks, BB);
123 // loop is very inefficient (N^2) for blocks with many successors, like switch
