185   BCEAtom Lhs;  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()
208   const BCEAtom &Lhs() const { return Cmp.Lhs; }  in Lhs()  function in __anonde3b773f0111::BCECmpBlock
254     if (MayClobber(Cmp.Lhs.LoadI) || MayClobber(Cmp.Rhs.LoadI))  in canSinkBCECmpInst()
322   auto Lhs = visitICmpLoadOperand(CmpI->getOperand(0), BaseId);  in visitICmp()  local
323   if (!Lhs.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()
380   if (Result->Lhs.GEP)  in visitCmpBlock()
381     BlockInsts.insert(Result->Lhs.GEP);  in visitCmpBlock()
391                     << " bits between " << Comparison.Lhs().BaseId << " + "  in enqueueBlock()
392                     << Comparison.Lhs().Offset << " and "  in enqueueBlock()
425   return First.Lhs().BaseId == Second.Lhs().BaseId &&  in areContiguous()
427          First.Lhs().Offset + First.SizeBits() / 8 == Second.Lhs().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
619   if (FirstCmp.Lhs().GEP)  in mergeComparisons()
620     Lhs = Builder.Insert(FirstCmp.Lhs().GEP->clone());  in mergeComparisons()
622     Lhs = FirstCmp.Lhs().LoadI->getPointerOperand();  in mergeComparisons()
645     Instruction *const LhsLoad = Builder.Insert(FirstCmp.Lhs().LoadI->clone());  in mergeComparisons()
647     LhsLoad->replaceUsesOfWith(LhsLoad->getOperand(0), Lhs);  in mergeComparisons()
663         Lhs, Rhs,  in mergeComparisons()