Lines Matching refs:isPHI
762 assert(Phi.isPHI() && "Expecting a Phi."); in getPhiRegs()
958 if (SU != nullptr && UseMI->isPHI()) { in updatePhiDependences()
959 if (!MI->isPHI()) { in updatePhiDependences()
978 if (SU != nullptr && DefMI->isPHI()) { in updatePhiDependences()
979 if (!MI->isPHI()) { in updatePhiDependences()
1000 if (PMI->isPHI() && PI.getKind() == SDep::Order) { in updatePhiDependences()
1001 if (I.getInstr()->isPHI()) { in updatePhiDependences()
1315 if (MI.isPHI() && Reg != getLoopPhiReg(MI, OrigMBB)) in computeLiveIn()
1394 if (MI->isPHI()) { in computeLastUses()
1404 return Stages[MI] + MI->isPHI(); in computeLastUses()
1506 if (MI->isPHI()) { in computeMaxSetPressure()
1675 (SI.getKind() == SDep::Anti && !SI.getSUnit()->getInstr()->isPHI())) in createAdjacencyStructure()
1813 if (DepKind == SDep::Anti && TmpMI->isPHI()) in apply()
1817 else if (DepKind == SDep::Data && !TmpMI->isPHI() && TmpSU->NumPreds > 0) in apply()
1835 if (TmpMI->isPHI() || TmpMI->isRegSequence()) { in apply()
2041 if (MI->isPHI()) in computeLiveOuts()
2500 if (SU->getInstr()->isPHI() || in schedulePipeline()
2588 if (BaseDef && BaseDef->isPHI()) { in computeDelta()
2626 if (!Phi || !Phi->isPHI()) in canUseLastOffsetValue()
2706 while (Def->isPHI()) { in findDefInLoop()
2770 if (!DefS || !DefD || !DefS->isPHI() || !DefD->isPHI()) in isLoopCarriedDep()
2908 if (DAG->isBackedge(SU, P) && P.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2910 if (S.getKind() == SDep::Data && S.getSUnit()->getInstr()->isPHI()) in multipleIterations()
2948 if (BE && Dep.getSUnit() == BE && !SU->getInstr()->isPHI() && in computeStart()
3107 if (!Phi.isPHI()) in isLoopCarried()
3109 assert(Phi.isPHI() && "Expecting a Phi."); in isLoopCarried()
3120 if (UseSU->getInstr()->isPHI()) in isLoopCarried()
3139 if (Def->isPHI()) in isLoopCarriedDefOfUse()
3142 if (!Phi || !Phi->isPHI() || Phi->getParent() != Def->getParent()) in isLoopCarriedDefOfUse()
3185 if (SU->getInstr()->isPHI()) in computeUnpipelineableNodes()
3305 if (!PredSU->getInstr()->isPHI() && PredIndex < Index) { in checkValidNodeOrder()
3321 if (!SuccSU->getInstr()->isPHI() && SuccIndex < Index) { in checkValidNodeOrder()
3328 if (PredBefore && SuccBefore && !SU->getInstr()->isPHI()) { in checkValidNodeOrder()
3409 if (SU->getInstr()->isPHI()) in reorderInstructions()
3414 if (!SU->getInstr()->isPHI()) in reorderInstructions()