183   BCEAtom Lhs;  member
189       : Lhs(std::move(L)), Rhs(std::move(R)), SizeBits(SizeBits), CmpI(CmpI) {  in BCECmp()
190     if (Rhs < Lhs) std::swap(Rhs, Lhs);  in BCECmp()
206   const BCEAtom &Lhs() const { return Cmp.Lhs; }  in Lhs()  function in __anon2691366f0111::BCECmpBlock
252     if (MayClobber(Cmp.Lhs.LoadI) || MayClobber(Cmp.Rhs.LoadI))  in canSinkBCECmpInst()
320   auto Lhs = visitICmpLoadOperand(CmpI->getOperand(0), BaseId);  in visitICmp()  local
321   if (!Lhs.BaseId)  in visitICmp()
327   return BCECmp(std::move(Lhs), std::move(Rhs),  in visitICmp()
372       {Result->Lhs.LoadI, Result->Rhs.LoadI, Result->CmpI, BranchI});  in visitCmpBlock()
373   if (Result->Lhs.GEP)  in visitCmpBlock()
374     BlockInsts.insert(Result->Lhs.GEP);  in visitCmpBlock()
384                     << " bits between " << Comparison.Lhs().BaseId << " + "  in enqueueBlock()
385                     << Comparison.Lhs().Offset << " and "  in enqueueBlock()
418   return First.Lhs().BaseId == Second.Lhs().BaseId &&  in areContiguous()
420          First.Lhs().Offset + First.SizeBits() / 8 == Second.Lhs().Offset &&  in areContiguous()
440                return std::tie(LhsBlock.Lhs(), LhsBlock.Rhs()) <  in mergeBlocks()
441                       std::tie(RhsBlock.Lhs(), RhsBlock.Rhs());  in mergeBlocks()
611   Value *Lhs, *Rhs;  in mergeComparisons()  local
612   if (FirstCmp.Lhs().GEP)  in mergeComparisons()
613     Lhs = Builder.Insert(FirstCmp.Lhs().GEP->clone());  in mergeComparisons()
615     Lhs = FirstCmp.Lhs().LoadI->getPointerOperand();  in mergeComparisons()
638         Builder.CreateLoad(FirstCmp.Lhs().LoadI->getType(), Lhs);  in mergeComparisons()
651         Lhs, Rhs,  in mergeComparisons()