125       : SplitB(B), TrueB(TB), FalseB(FB), JoinB(JB), PredR(PR) {}  in FlowPattern()
129     MachineBasicBlock *FalseB = nullptr;  member
148        << ", FalseB:" << PrintMB(P.FP.FalseB)  in operator <<()
422   if (FP.FalseB && !isValidCandidate(FP.FalseB))  in isValid()
465       if (BB == FP.SplitB || BB == FP.TrueB || BB == FP.FalseB)  in computePhiCost()
508   if (MBPI && FP.TrueB && !FP.FalseB &&  in isProfitable()
513   if (MBPI && !FP.TrueB && FP.FalseB &&  in isProfitable()
514       (MBPI->getEdgeProbability(FP.SplitB, FP.FalseB) < JumpProb ||  in isProfitable()
515        MBPI->getEdgeProbability(FP.SplitB, FP.FalseB) > Prob))  in isProfitable()
518   if (FP.TrueB && FP.FalseB) {  in isProfitable()
523       if (MBPI->getEdgeProbability(FP.SplitB, FP.FalseB) > Prob)  in isProfitable()
530     MachineBasicBlock *FSB = *FP.FalseB->succ_begin();  in isProfitable()
554   unsigned TotalIn = TotalCount(FP.TrueB, Spare) + TotalCount(FP.FalseB, Spare);  in isProfitable()
578     if (FP.FalseB && !FP.FalseB->succ_empty()) {  in isProfitable()
579       MachineBasicBlock *SB = *FP.FalseB->succ_begin();  in isProfitable()
825       else if (BO.getMBB() == FP.FalseB)  in updatePhiNodes()
869   if (FP.FalseB) {  in convert()
870     FSB = *FP.FalseB->succ_begin();  in convert()
872     predicateBlockNB(FP.SplitB, At, FP.FalseB, FP.PredR, false);  in convert()
896     if (T != FP.TrueB && T != FP.FalseB) {  in convert()
1030   if (FP.FalseB)  in simplifyFlowGraph()
1031     removeBlock(FP.FalseB);  in simplifyFlowGraph()