Lines Matching refs:getParent
513 const BasicBlock *LParent = LInst->getParent(),
514 *RParent = RInst->getParent();
3684 const Loop *L = LI.getLoopFor(PN->getParent());
3685 if (!L || L->getHeader() != PN->getParent())
3905 BasicBlockEdge LeftEdge(BI->getParent(), BI->getSuccessor(0));
3906 BasicBlockEdge RightEdge(BI->getParent(), BI->getSuccessor(1));
3933 const Loop *L = LI.getLoopFor(PN->getParent());
3952 BasicBlock *IDom = DT[PN->getParent()]->getIDom()->getBlock();
3960 IsAvailableOnEntry(L, DT, getSCEV(LHS), PN->getParent()) &&
3961 IsAvailableOnEntry(L, DT, getSCEV(RHS), PN->getParent()))
4431 Loop *innermostContainingLoop = LI.getLoopFor(BinOp->getParent());
4433 innermostContainingLoop->getHeader() != BinOp->getParent())
4482 if (!DT.isReachableFromEntry(I->getParent()))
5712 if (!PNOut || PNOut->getParent() != L->getHeader())
5813 return L->getHeader() == I->getParent();
5968 assert(PN->getParent() == Header && "Can't evaluate PHI not in loop header!");
6014 if (!PHI || PHI == PN || PHI->getParent() != Header) continue;
6051 assert(PN->getParent() == Header && "Can't evaluate PHI not in loop header!");
6093 if (!PHI || PHI->getParent() != Header) continue;
6246 const Loop *LI = this->LI[I->getParent()];
6249 if (PN->getParent() == LI->getHeader()) {
9170 const Loop *L = LI.getLoopFor(I.getParent());
9375 if (I->getParent() == BB)
9377 if (DT.properlyDominates(I->getParent(), BB))