440   if (L.isLoopInvariant(BI.getCondition())) {  in unswitchTrivialBranch()
441     Invariants.push_back(BI.getCondition());  in unswitchTrivialBranch()
444     if (auto *CondInst = dyn_cast<Instruction>(BI.getCondition()))  in unswitchTrivialBranch()
478     if (ExitDirection ? !match(BI.getCondition(), m_LogicalOr())  in unswitchTrivialBranch()
479                       : !match(BI.getCondition(), m_LogicalAnd())) {  in unswitchTrivialBranch()
559       assert(match(BI.getCondition(), m_LogicalOr()) &&  in unswitchTrivialBranch()
563       assert(match(BI.getCondition(), m_LogicalAnd()) &&  in unswitchTrivialBranch()
659   Value *LoopCond = SI.getCondition();  in unswitchTrivialSwitch()
987       if (isa<Constant>(SI->getCondition()))  in unswitchAllTrivialConditions()
1017     if (!BI->isConditional() || isa<Constant>(BI->getCondition()))  in unswitchAllTrivialConditions()
1205     ClonedConditionToErase = BI->getCondition();  in buildClonedLoopBlocks()
1207     ClonedConditionToErase = SI->getCondition();  in buildClonedLoopBlocks()
2040       SI || (BI->getCondition() == Invariants[0] && !PartiallyInvariant);  in unswitchNontrivialInvariants()
2045     assert(isa<Instruction>(BI->getCondition()) &&  in unswitchNontrivialInvariants()
2060     Value *Cond = BI->getCondition();  in unswitchNontrivialInvariants()
2066     if (!match(BI->getCondition(), m_LogicalOr())) {  in unswitchNontrivialInvariants()
2067       if (match(BI->getCondition(), m_LogicalAnd()) ||  in unswitchNontrivialInvariants()
2712       if (!isa<Constant>(SI->getCondition()) &&  in unswitchBestCondition()
2713           L.isLoopInvariant(SI->getCondition()) && !BB->getUniqueSuccessor())  in unswitchBestCondition()
2714         UnswitchCandidates.push_back({SI, {SI->getCondition()}});  in unswitchBestCondition()
2719     if (!BI || !BI->isConditional() || isa<Constant>(BI->getCondition()) ||  in unswitchBestCondition()
2725     Value *Cond = BI->getCondition(), *CondNext;  in unswitchBestCondition()
2730     if (L.isLoopInvariant(BI->getCondition())) {  in unswitchBestCondition()
2731       UnswitchCandidates.push_back({BI, {BI->getCondition()}});  in unswitchBestCondition()
2735     Instruction &CondI = *cast<Instruction>(BI->getCondition());  in unswitchBestCondition()
2877         if (match(BI.getCondition(), m_LogicalAnd())) {  in unswitchBestCondition()
2880         } else if (match(BI.getCondition(), m_LogicalOr())) {  in unswitchBestCondition()
2923                                      Invariants[0] == BI->getCondition()));  in unswitchBestCondition()