93   Value *Op1;  member
96       : Pred(CmpInst::BAD_ICMP_PREDICATE), Op0(nullptr), Op1(nullptr) {}  in ConditionTy()
97   ConditionTy(CmpInst::Predicate Pred, Value *Op0, Value *Op1)  in ConditionTy()
98       : Pred(Pred), Op0(Op0), Op1(Op1) {}  in ConditionTy()
139   FactOrCheck(DomTreeNode *DTN, CmpInst::Predicate Pred, Value *Op0, Value *Op1,  in FactOrCheck()
141       : Cond(Pred, Op0, Op1), DoesHold(Precond), NumIn(DTN->getDFSNumIn()),  in FactOrCheck()
145                                       Value *Op0, Value *Op1,  in getConditionFact()
147     return FactOrCheck(DTN, Pred, Op0, Op1, Precond);  in getConditionFact()
316   ConstraintTy getConstraint(CmpInst::Predicate Pred, Value *Op0, Value *Op1,
327                                        Value *Op1) const;
512     Value *Op1;  in decompose()  local
521     if (match(V, m_NSWAdd(m_Value(Op0), m_Value(Op1))))  in decompose()
522       return MergeResults(Op0, Op1, IsSigned);  in decompose()
564   Value *Op1;  in decompose()  local
566   if (match(V, m_NUWAdd(m_Value(Op0), m_Value(Op1)))) {  in decompose()
567     return MergeResults(Op0, Op1, IsSigned);  in decompose()
569   if (match(V, m_NSWAdd(m_Value(Op0), m_Value(Op1)))) {  in decompose()
573     if (!isKnownNonNegative(Op1, DL))  in decompose()
574       Preconditions.emplace_back(CmpInst::ICMP_SGE, Op1,  in decompose()
575                                  ConstantInt::get(Op1->getType(), 0));  in decompose()
577     return MergeResults(Op0, Op1, IsSigned);  in decompose()
592   if (match(V, m_NUWShl(m_Value(Op1), m_ConstantInt(CI))) && canUseSExt(CI)) {  in decompose()
595     auto Result = decompose(Op1, Preconditions, IsSigned, DL);  in decompose()
600   if (match(V, m_NUWMul(m_Value(Op1), m_ConstantInt(CI))) && canUseSExt(CI) &&  in decompose()
602     auto Result = decompose(Op1, Preconditions, IsSigned, DL);  in decompose()
607   if (match(V, m_NUWSub(m_Value(Op0), m_Value(Op1)))) {  in decompose()
609     auto ResB = decompose(Op1, Preconditions, IsSigned, DL);  in decompose()
618 ConstraintInfo::getConstraint(CmpInst::Predicate Pred, Value *Op0, Value *Op1,  in getConstraint()  argument
631     std::swap(Op0, Op1);  in getConstraint()
635     if (match(Op1, m_Zero())) {  in getConstraint()
643     if (match(Op1, m_Zero())) {  in getConstraint()
645       std::swap(Op0, Op1);  in getConstraint()
664   auto BDec = decompose(Op1->stripPointerCastsSameRepresentation(),  in getConstraint()
751                                                      Value *Op1) const {  in getConstraintForSolving()
756       (Pred == CmpInst::ICMP_UGE && Op1 == NullC)) {  in getConstraintForSolving()
768       isKnownNonNegative(Op1, DL, /*Depth=*/MaxAnalysisRecursionDepth - 1))  in getConstraintForSolving()
772   ConstraintTy R = getConstraint(Pred, Op0, Op1, NewVariables);  in getConstraintForSolving()
781            return Info.doesHold(C.Pred, C.Op0, C.Op1);  in isValid()
1139   Value *Op0, *Op1;  in addInfoFor()  local
1140   if (match(Cond, m_LogicalOr(m_Value(Op0), m_Value(Op1))) ||  in addInfoFor()
1141       match(Cond, m_LogicalAnd(m_Value(Op0), m_Value(Op1)))) {  in addInfoFor()
1157       QueueValue(Op1);  in addInfoFor()
1169         if (IsOr && match(Cur, m_LogicalOr(m_Value(Op0), m_Value(Op1)))) {  in addInfoFor()
1170           QueueValue(Op1);  in addInfoFor()
1174         if (IsAnd && match(Cur, m_LogicalAnd(m_Value(Op0), m_Value(Op1)))) {  in addInfoFor()
1175           QueueValue(Op1);  in addInfoFor()
1709       Value *V1 = B.isConditionFact() ? B.Cond.Op1 : B.Inst->getOperand(1);  in eliminateConstraints()
1837       B = CB.Cond.Op1;  in eliminateConstraints()
1839           !Info.doesHold(CB.DoesHold.Pred, CB.DoesHold.Op0, CB.DoesHold.Op1)) {  in eliminateConstraints()
1845                            CB.DoesHold.Op1);  in eliminateConstraints()