191 int64_t AffineExpr::getLargestKnownDivisor() const {  in getLargestKnownDivisor()  function in AffineExpr
202     return binExpr.getLHS().getLargestKnownDivisor() *  in getLargestKnownDivisor()
203            binExpr.getRHS().getLargestKnownDivisor();  in getLargestKnownDivisor()
212         binExpr.getLHS().getLargestKnownDivisor(),  in getLargestKnownDivisor()
213         binExpr.getRHS().getLargestKnownDivisor());  in getLargestKnownDivisor()
234     return (l = binExpr.getLHS().getLargestKnownDivisor()) % factor == 0 ||  in isMultipleOf()
235            (u = binExpr.getRHS().getLargestKnownDivisor()) % factor == 0 ||  in isMultipleOf()
244                binExpr.getLHS().getLargestKnownDivisor(),  in isMultipleOf()
245                binExpr.getRHS().getLargestKnownDivisor()) %  in isMultipleOf()
697     int64_t llhsDiv = lBin.getLHS().getLargestKnownDivisor();  in simplifyFloorDiv()
698     int64_t lrhsDiv = lBin.getRHS().getLargestKnownDivisor();  in simplifyFloorDiv()
780   if (lhs.getLargestKnownDivisor() % rhsConst.getValue() == 0)  in simplifyMod()
787     int64_t llhsDiv = lBin.getLHS().getLargestKnownDivisor();  in simplifyMod()
788     int64_t lrhsDiv = lBin.getRHS().getLargestKnownDivisor();  in simplifyMod()