186   BCEAtom Rhs;  member
191       : Lhs(std::move(L)), Rhs(std::move(R)), SizeBits(SizeBits), CmpI(CmpI) {  in BCECmp()
192     if (Rhs < Lhs) std::swap(Rhs, Lhs);  in BCECmp()
209   const BCEAtom &Rhs() const { return Cmp.Rhs; }  in Rhs()  function in __anon9202c2f50111::BCECmpBlock
254     if (MayClobber(Cmp.Lhs.LoadI) || MayClobber(Cmp.Rhs.LoadI))  in canSinkBCECmpInst()
325   auto Rhs = visitICmpLoadOperand(CmpI->getOperand(1), BaseId);  in visitICmp()  local
326   if (!Rhs.BaseId)  in visitICmp()
329   return BCECmp(std::move(Lhs), std::move(Rhs),  in visitICmp()
379       {Result->Lhs.LoadI, Result->Rhs.LoadI, Result->CmpI, BranchI});  in visitCmpBlock()
382   if (Result->Rhs.GEP)  in visitCmpBlock()
383     BlockInsts.insert(Result->Rhs.GEP);  in visitCmpBlock()
393                     << Comparison.Rhs().BaseId << " + "  in enqueueBlock()
394                     << Comparison.Rhs().Offset << "\n");  in enqueueBlock()
426          First.Rhs().BaseId == Second.Rhs().BaseId &&  in areContiguous()
428          First.Rhs().Offset + First.SizeBits() / 8 == Second.Rhs().Offset;  in areContiguous()
447                return std::tie(LhsBlock.Lhs(), LhsBlock.Rhs()) <  in mergeBlocks()
448                       std::tie(RhsBlock.Lhs(), RhsBlock.Rhs());  in mergeBlocks()
618   Value *Lhs, *Rhs;  in mergeComparisons()  local
623   if (FirstCmp.Rhs().GEP)  in mergeComparisons()
624     Rhs = Builder.Insert(FirstCmp.Rhs().GEP->clone());  in mergeComparisons()
626     Rhs = FirstCmp.Rhs().LoadI->getPointerOperand();  in mergeComparisons()
646     Instruction *const RhsLoad = Builder.Insert(FirstCmp.Rhs().LoadI->clone());  in mergeComparisons()
648     RhsLoad->replaceUsesOfWith(RhsLoad->getOperand(0), Rhs);  in mergeComparisons()
663         Lhs, Rhs,  in mergeComparisons()