411     bool optimizeSelectInst(SelectInst *SI);
1680     if (isa<SelectInst>(U) && cast<SelectInst>(U)->getCondition() == Cmp)  in foldICmpWithDominatingICmp()
1722     if (auto *SI = dyn_cast<SelectInst>(U)) {  in foldICmpWithDominatingICmp()
3374   SmallPtrSet<SelectInst *, 32> AllSelectNodes;
3405           if (auto *Select = dyn_cast<SelectInst>(PI))  in Simplify()
3435   void insertNewSelect(SelectInst *SI) { AllSelectNodes.insert(SI); }  in insertNewSelect()
3778       if (SelectInst *Select = dyn_cast<SelectInst>(V)) {  in FillPlaceholders()
3780         auto *CurrentSelect = cast<SelectInst>(Current);  in FillPlaceholders()
3810     assert((isa<PHINode>(Original) || isa<SelectInst>(Original)) &&  in InsertPlaceholders()
3823       if (SelectInst *CurrentSelect = dyn_cast<SelectInst>(Current)) {  in InsertPlaceholders()
3826         SelectInst *Select = SelectInst::Create(  in InsertPlaceholders()
4095     return !(isa<SelectInst>(Inst) && OpIdx == 0);  in shouldExtOperand()
5153     if (SelectInst *SI = dyn_cast<SelectInst>(V)) {  in optimizeMemoryInst()
6612                                                 SelectInst *SI) {  in isFormingBranchFromSelectProfitable()
6655     SelectInst *SI, bool isTrue,  in getTrueOrFalseValue()
6659   for (SelectInst *DefSI = SI; DefSI != nullptr && Selects.count(DefSI);  in getTrueOrFalseValue()
6660        DefSI = dyn_cast<SelectInst>(V)) {  in getTrueOrFalseValue()
6740 bool CodeGenPrepare::optimizeSelectInst(SelectInst *SI) {  in optimizeSelectInst()
6745   SmallVector<SelectInst *, 2> ASI;  in optimizeSelectInst()
6749     SelectInst *I = dyn_cast<SelectInst>(&*It);  in optimizeSelectInst()
6757   SelectInst *LastSI = ASI.back();  in optimizeSelectInst()
6830   for (SelectInst *SI : ASI) {  in optimizeSelectInst()
6892   for (SelectInst *SI : llvm::reverse(ASI)) {  in optimizeSelectInst()
8046     return optimizeSelectInst(cast<SelectInst>(I));  in optimizeInst()