402     bool optimizeSelectInst(SelectInst *SI);
1666     if (isa<SelectInst>(U) && cast<SelectInst>(U)->getCondition() == Cmp)  in foldICmpWithDominatingICmp()
1708     if (auto *SI = dyn_cast<SelectInst>(U)) {  in foldICmpWithDominatingICmp()
3355   SmallPtrSet<SelectInst *, 32> AllSelectNodes;
3386           if (auto *Select = dyn_cast<SelectInst>(PI))  in Simplify()
3416   void insertNewSelect(SelectInst *SI) { AllSelectNodes.insert(SI); }  in insertNewSelect()
3758       if (SelectInst *Select = dyn_cast<SelectInst>(V)) {  in FillPlaceholders()
3760         auto *CurrentSelect = cast<SelectInst>(Current);  in FillPlaceholders()
3790     assert((isa<PHINode>(Original) || isa<SelectInst>(Original)) &&  in InsertPlaceholders()
3803       if (SelectInst *CurrentSelect = dyn_cast<SelectInst>(Current)) {  in InsertPlaceholders()
3806         SelectInst *Select = SelectInst::Create(  in InsertPlaceholders()
4075     return !(isa<SelectInst>(Inst) && OpIdx == 0);  in shouldExtOperand()
5149     if (SelectInst *SI = dyn_cast<SelectInst>(V)) {  in optimizeMemoryInst()
6597                                                 SelectInst *SI) {  in isFormingBranchFromSelectProfitable()
6640     SelectInst *SI, bool isTrue,  in getTrueOrFalseValue()
6644   for (SelectInst *DefSI = SI; DefSI != nullptr && Selects.count(DefSI);  in getTrueOrFalseValue()
6645        DefSI = dyn_cast<SelectInst>(V)) {  in getTrueOrFalseValue()
6725 bool CodeGenPrepare::optimizeSelectInst(SelectInst *SI) {  in optimizeSelectInst()
6730   SmallVector<SelectInst *, 2> ASI;  in optimizeSelectInst()
6734     SelectInst *I = dyn_cast<SelectInst>(&*It);  in optimizeSelectInst()
6742   SelectInst *LastSI = ASI.back();  in optimizeSelectInst()
6815   for (SelectInst *SI : ASI) {  in optimizeSelectInst()
6878     SelectInst *SI = *It;  in optimizeSelectInst()
7936     return optimizeSelectInst(cast<SelectInst>(I));  in optimizeInst()