Lines Matching defs:AftBlocks

70                                 BasicBlockSet &AftBlocks, DominatorTree &DT) {
77         AftBlocks.insert(BB);
122                                      BasicBlockSet &AftBlocks,
125   return partitionLoopBlocks(*L, ForeBlocks, AftBlocks, *DT);
130 // all the operands in AftBlocks. Returns false if Visit returns false,
138                                      BasicBlockSet &AftBlocks, T Visit) {
147     if (AftBlocks.count(I->getParent()))
166 // Move the phi operands of Header from Latch out of AftBlocks to InsertLoc.
170                                               BasicBlockSet &AftBlocks) {
173   processHeaderPhiOperands(Header, Latch, AftBlocks,
174                            [&AftBlocks, &InsertLoc](Instruction *I) {
175                              if (AftBlocks.count(I->getParent()))
308   BasicBlockSet AftBlocks;
309   partitionOuterLoopBlocks(L, SubLoop, ForeBlocks, SubLoopBlocks, AftBlocks,
330   // Move any instructions from fore phi operands from AftBlocks into Fore.
332       Header, LatchBlock, ForeBlocksLast[0]->getTerminator(), AftBlocks);
387       } else if (AftBlocks.count(*BB)) {
883      Blocks           | |   } AftBlocks of a inner loop of L
889      Blocks             |   } AftBlocks of L
894     and AftBlocks, providing that there is one edge from Fores to SubLoops,
957   //  ForeBlocks before Subloop and AftBlocks.
958   //  Subloop before AftBlocks.
964   BasicBlockSet AftBlocks = AftBlocksMap[L];
967           Header, Latch, AftBlocks, [&AftBlocks, &SubLoop](Instruction *I) {
970             if (AftBlocks.count(I->getParent())) {