Lines Matching refs:Header
4425 // Here we check that BinOp is in the header of the innermost loop
4427 // header. The actual loop we need to check later will come from an add
4819 /// number times that the loop header executes because the loop may exit
4903 /// object. The backedge-taken count is the number of times the loop header
4906 /// when the header is branched to from outside the loop.
4923 /// PushLoopPHIs - Push PHI nodes in the header
4927 BasicBlock *Header = L->getHeader();
4929 // Push all Loop-header PHIs onto the Worklist stack.
4930 for (BasicBlock::iterator I = Header->begin();
5022 // Drop information about expressions based on loop-header PHIs.
5057 // Drop information about expressions based on loop-header PHIs.
5248 // lead to the loop header.
5267 // the loop header. If so, we know it will always execute the same number of
5269 // loop header. This is common for un-rotated loops.
5272 // header, stopping if there is an edge that doesn't exit the loop. If the
5273 // header is reached, the execution count of the branch will be equal to the
5280 // up to the header.
5814 /// recursing through each instruction operand until reaching a loop header phi.
5942 /// in the header of its containing loop, we know the loop executes a
5959 BasicBlock *Header = L->getHeader();
5960 assert(PN->getParent() == Header && "Can't evaluate PHI not in loop header!");
5966 for (auto &I : *Header) {
6006 if (!PHI || PHI == PN || PHI->getParent() != Header) continue;
6042 BasicBlock *Header = L->getHeader();
6043 assert(PN->getParent() == Header && "Can't evaluate PHI not in loop header!");
6048 for (auto &I : *Header) {
6085 if (!PHI || PHI->getParent() != Header) continue;
6756 // A loop's header is defined to be a block that dominates the loop.
6757 // If the header has a unique predecessor outside the loop, it must be
7447 // We know that Latch branches back to the loop header exactly
7480 assert(DTN && "should reach the loop header before reaching the root!");
7528 // leading to the original header.
