diff --git a/llvm/lib/CodeGen/CodeGenPrepare.cpp b/llvm/lib/CodeGen/CodeGenPrepare.cpp
--- a/llvm/lib/CodeGen/CodeGenPrepare.cpp
+++ b/llvm/lib/CodeGen/CodeGenPrepare.cpp
@@ -143,6 +143,11 @@
   "disable-cgp-select2branch", cl::Hidden, cl::init(false),
   cl::desc("Disable select to branch conversion."));
 
+static cl::opt<bool>
+    SinkCheapSelectOperand("enable-cgp-sink-cheap-select-operand", cl::Hidden,
+                           cl::init(false),
+                           cl::desc("Sink select's cheap operand"));
+
 static cl::opt<bool> AddrSinkUsingGEPs(
   "addr-sink-using-gep", cl::Hidden, cl::init(true),
   cl::desc("Address sinking in CGP using GEPs."));
@@ -6564,19 +6569,27 @@
 
 /// Check if V (an operand of a select instruction) is an expensive instruction
 /// that is only used once.
-static bool sinkSelectOperand(const TargetTransformInfo *TTI, Value *V) {
+static bool sinkSelectOperand(const TargetTransformInfo *TTI,
+                              ArrayRef<SelectInst *> ASI, Value *V) {
   auto *I = dyn_cast<Instruction>(V);
   // If it's safe to speculatively execute, then it should not have side
   // effects; therefore, it's safe to sink and possibly *not* execute.
-  return I && I->hasOneUse() && isSafeToSpeculativelyExecute(I) &&
-         TTI->getUserCost(I, TargetTransformInfo::TCK_SizeAndLatency) >=
-         TargetTransformInfo::TCC_Expensive;
+  return I &&
+         all_of(I->users(),
+                [&](User *user) {
+                  return std::find(ASI.begin(), ASI.end(),
+                                   dyn_cast<SelectInst>(user)) != ASI.end();
+                }) &&
+         isSafeToSpeculativelyExecute(I) &&
+         (SinkCheapSelectOperand ||
+          TTI->getUserCost(I, TargetTransformInfo::TCK_SizeAndLatency) >=
+              TargetTransformInfo::TCC_Expensive);
 }
 
 /// Returns true if a SelectInst should be turned into an explicit branch.
 static bool isFormingBranchFromSelectProfitable(const TargetTransformInfo *TTI,
                                                 const TargetLowering *TLI,
-                                                SelectInst *SI) {
+                                                ArrayRef<SelectInst *> ASI) {
   // If even a predictable select is cheap, then a branch can't be cheaper.
   if (!TLI->isPredictableSelectExpensive())
     return false;
@@ -6586,32 +6599,43 @@
 
   // If metadata tells us that the select condition is obviously predictable,
   // then we want to replace the select with a branch.
-  uint64_t TrueWeight, FalseWeight;
-  if (SI->extractProfMetadata(TrueWeight, FalseWeight)) {
-    uint64_t Max = std::max(TrueWeight, FalseWeight);
-    uint64_t Sum = TrueWeight + FalseWeight;
-    if (Sum != 0) {
-      auto Probability = BranchProbability::getBranchProbability(Max, Sum);
-      if (Probability > TTI->getPredictableBranchThreshold())
-        return true;
-    }
-  }
+  if (any_of(ASI, [&](SelectInst *SI) {
+        uint64_t TrueWeight, FalseWeight;
+        if (SI->extractProfMetadata(TrueWeight, FalseWeight)) {
+          uint64_t Max = std::max(TrueWeight, FalseWeight);
+          uint64_t Sum = TrueWeight + FalseWeight;
+          if (Sum != 0) {
+            auto Probability =
+                BranchProbability::getBranchProbability(Max, Sum);
+            if (Probability > TTI->getPredictableBranchThreshold())
+              return true;
+          }
+        }
+        return false;
+      }))
+    return true;
 
-  CmpInst *Cmp = dyn_cast<CmpInst>(SI->getCondition());
+  CmpInst *Cmp = dyn_cast<CmpInst>(ASI.back()->getCondition());
 
   // If a branch is predictable, an out-of-order CPU can avoid blocking on its
   // comparison condition. If the compare has more than one use, there's
   // probably another cmov or setcc around, so it's not worth emitting a branch.
-  if (!Cmp || !Cmp->hasOneUse())
-    return false;
-
-  // If either operand of the select is expensive and only needed on one side
-  // of the select, we should form a branch.
-  if (sinkSelectOperand(TTI, SI->getTrueValue()) ||
-      sinkSelectOperand(TTI, SI->getFalseValue()))
-    return true;
-
-  return false;
+   if (!Cmp || !all_of(Cmp->uses(), [&](const Use &use) {
+         SelectInst *SI = dyn_cast<SelectInst>(use.getUser());
+         return SI && std::find(ASI.begin(), ASI.end(), SI) != ASI.end();
+       })) {
+     return false;
+   }
+
+   // If either operand of the select is expensive and only needed on one side
+   // of the select, we should form a branch.
+   for (SelectInst *SI : ASI) {
+     if (sinkSelectOperand(TTI, ASI, SI->getTrueValue()) ||
+         sinkSelectOperand(TTI, ASI, SI->getFalseValue()))
+     return true;
+   }
+
+   return false;
 }
 
 /// If \p isTrue is true, return the true value of \p SI, otherwise return
@@ -6741,7 +6765,7 @@
     SelectKind = TargetLowering::ScalarValSelect;
 
   if (TLI->isSelectSupported(SelectKind) &&
-      (!isFormingBranchFromSelectProfitable(TTI, TLI, SI) || OptSize ||
+      (!isFormingBranchFromSelectProfitable(TTI, TLI, ASI) || OptSize ||
        llvm::shouldOptimizeForSize(SI->getParent(), PSI, BFI.get())))
     return false;
 
@@ -6795,7 +6819,7 @@
   // Sink expensive instructions into the conditional blocks to avoid executing
   // them speculatively.
   for (SelectInst *SI : ASI) {
-    if (sinkSelectOperand(TTI, SI->getTrueValue())) {
+    if (sinkSelectOperand(TTI, ASI, SI->getTrueValue())) {
       if (TrueBlock == nullptr) {
         TrueBlock = BasicBlock::Create(SI->getContext(), "select.true.sink",
                                        EndBlock->getParent(), EndBlock);
@@ -6805,7 +6829,7 @@
       auto *TrueInst = cast<Instruction>(SI->getTrueValue());
       TrueInst->moveBefore(TrueBranch);
     }
-    if (sinkSelectOperand(TTI, SI->getFalseValue())) {
+    if (sinkSelectOperand(TTI, ASI, SI->getFalseValue())) {
       if (FalseBlock == nullptr) {
         FalseBlock = BasicBlock::Create(SI->getContext(), "select.false.sink",
                                         EndBlock->getParent(), EndBlock);