Lines Matching full:depth
136 unsigned Depth);
139 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBits() argument
146 ::computeKnownBits(V, DemandedElts, Known, Q, Depth); in computeKnownBits()
152 bool UseInstrInfo, unsigned Depth) { in computeKnownBits() argument
155 Depth); in computeKnownBits()
161 unsigned Depth) { in computeKnownBits() argument
163 V, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo), Depth); in computeKnownBits()
170 unsigned Depth) { in computeKnownBits() argument
173 SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo), Depth); in computeKnownBits()
270 unsigned Depth) { in isKnownToBeAPowerOfTwo() argument
273 Depth); in isKnownToBeAPowerOfTwo()
277 const SimplifyQuery &Q, unsigned Depth);
280 unsigned Depth) { in isKnownNonNegative() argument
281 return computeKnownBits(V, SQ, Depth).isNonNegative(); in isKnownNonNegative()
285 unsigned Depth) { in isKnownPositive() argument
291 KnownBits Known = computeKnownBits(V, SQ, Depth); in isKnownPositive()
293 (Known.isNonZero() || isKnownNonZero(V, SQ, Depth)); in isKnownPositive()
297 unsigned Depth) { in isKnownNegative() argument
298 return computeKnownBits(V, SQ, Depth).isNegative(); in isKnownNegative()
303 unsigned Depth);
306 const SimplifyQuery &Q, unsigned Depth) { in isKnownNonEqual() argument
313 return ::isKnownNonEqual(V1, V2, DemandedElts, Q, Depth); in isKnownNonEqual()
317 const SimplifyQuery &SQ, unsigned Depth) { in MaskedValueIsZero() argument
319 computeKnownBits(V, Known, SQ, Depth); in MaskedValueIsZero()
324 const SimplifyQuery &Q, unsigned Depth);
327 unsigned Depth = 0) { in ComputeNumSignBits() argument
331 return ComputeNumSignBits(V, DemandedElts, Q, Depth); in ComputeNumSignBits()
337 unsigned Depth) { in ComputeNumSignBits() argument
339 V, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo), Depth); in ComputeNumSignBits()
346 unsigned Depth) { in ComputeMaxSignificantBits() argument
347 unsigned SignBits = ComputeNumSignBits(V, DL, AC, CxtI, DT, Depth); in ComputeMaxSignificantBits()
355 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBitsAddSub() argument
356 computeKnownBits(Op1, DemandedElts, KnownOut, Q, Depth + 1); in computeKnownBitsAddSub()
363 computeKnownBits(Op0, DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsAddSub()
375 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBitsMul() argument
376 computeKnownBits(Op1, DemandedElts, Known, Q, Depth + 1); in computeKnownBitsMul()
377 computeKnownBits(Op0, DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsMul()
414 isGuaranteedNotToBeUndef(Op0, Q.AC, Q.CxtI, Q.DT, Depth + 1); in computeKnownBitsMul()
804 bool Invert, unsigned Depth) { in computeKnownBitsFromCond() argument
806 if (Depth < MaxAnalysisRecursionDepth && in computeKnownBitsFromCond()
810 computeKnownBitsFromCond(V, A, Known2, SQ, Invert, Depth + 1); in computeKnownBitsFromCond()
811 computeKnownBitsFromCond(V, B, Known3, SQ, Invert, Depth + 1); in computeKnownBitsFromCond()
841 if (Depth < MaxAnalysisRecursionDepth && match(Cond, m_Not(m_Value(A)))) in computeKnownBitsFromCond()
842 computeKnownBitsFromCond(V, A, Known, SQ, !Invert, Depth + 1); in computeKnownBitsFromCond()
846 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBitsFromContext() argument
849 computeKnownBitsFromCond(V, Q.CC->Cond, Known, Q, Q.CC->Invert, Depth); in computeKnownBitsFromContext()
860 /*Invert*/ false, Depth); in computeKnownBitsFromContext()
865 /*Invert*/ true, Depth); in computeKnownBitsFromContext()
935 if (Depth == MaxAnalysisRecursionDepth) in computeKnownBitsFromContext()
964 KnownBits &Known2, const SimplifyQuery &Q, unsigned Depth, in computeKnownBitsFromShiftOperator() argument
966 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromShiftOperator()
967 computeKnownBits(I->getOperand(1), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromShiftOperator()
973 isKnownNonZero(I->getOperand(1), DemandedElts, Q, Depth + 1)); in computeKnownBitsFromShiftOperator()
980 const SimplifyQuery &Q, unsigned Depth) { in getKnownBitsFromAndXorOr() argument
1037 computeKnownBits(Y, DemandedElts, KnownY, Q, Depth + 1); in getKnownBitsFromAndXorOr()
1050 unsigned Depth, in computeKnownBitsForHorizontalOperation() argument
1059 [Depth, &Q, KnownBitsFunc](const Value *Op, APInt &DemandedEltsOp) { in computeKnownBitsForHorizontalOperation()
1061 computeKnownBits(Op, DemandedEltsOp, Q, Depth + 1), in computeKnownBitsForHorizontalOperation()
1062 computeKnownBits(Op, DemandedEltsOp << 1, Q, Depth + 1)); in computeKnownBitsForHorizontalOperation()
1079 unsigned Depth) { in analyzeKnownBitsFromAndXorOr() argument
1085 Depth); in analyzeKnownBitsFromAndXorOr()
1109 const SimplifyQuery &Q, unsigned Depth) { in adjustKnownBitsForSelectArm() argument
1116 computeKnownBitsFromCond(Arm, Cond, CondRes, Q, Invert, Depth + 1); in adjustKnownBitsForSelectArm()
1133 if (!isGuaranteedNotToBeUndef(Arm, Q.AC, Q.CxtI, Q.DT, Depth + 1)) in adjustKnownBitsForSelectArm()
1203 unsigned Depth) { in computeKnownBitsFromOperator() argument
1215 computeKnownBits(I->getOperand(1), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1216 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1218 Known = getKnownBitsFromAndXorOr(I, DemandedElts, Known2, Known, Q, Depth); in computeKnownBitsFromOperator()
1221 computeKnownBits(I->getOperand(1), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1222 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1224 Known = getKnownBitsFromAndXorOr(I, DemandedElts, Known2, Known, Q, Depth); in computeKnownBitsFromOperator()
1227 computeKnownBits(I->getOperand(1), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1228 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1230 Known = getKnownBitsFromAndXorOr(I, DemandedElts, Known2, Known, Q, Depth); in computeKnownBitsFromOperator()
1236 DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
1240 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1241 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1247 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1248 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1256 computeKnownBits(Arm, DemandedElts, Res, Q, Depth + 1); in computeKnownBitsFromOperator()
1257 adjustKnownBitsForSelectArm(Res, I->getOperand(0), Arm, Invert, Q, Depth); in computeKnownBitsFromOperator()
1291 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1304 computeKnownBits(I->getOperand(0), Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1314 computeKnownFPClass(V, DemandedElts, fcAllFlags, Q, Depth + 1); in computeKnownBitsFromOperator()
1383 Depth + 1); in computeKnownBitsFromOperator()
1395 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1408 computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Q, Depth, in computeKnownBitsFromOperator()
1422 computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Q, Depth, in computeKnownBitsFromOperator()
1436 computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Q, Depth, in computeKnownBitsFromOperator()
1444 DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
1451 DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
1455 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1456 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1461 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1462 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1471 computeKnownBits(I->getOperand(0), Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1539 computeKnownBits(Index, Q, Depth + 1).sextOrTrunc(IndexWidth); in computeKnownBitsFromOperator()
1594 computeKnownBits(R, DemandedElts, Known2, RecQ, Depth + 1); in computeKnownBitsFromOperator()
1637 computeKnownBits(R, DemandedElts, Known2, RecQ, Depth + 1); in computeKnownBitsFromOperator()
1642 computeKnownBits(L, DemandedElts, Known3, RecQ, Depth + 1); in computeKnownBitsFromOperator()
1704 if (Depth < MaxAnalysisRecursionDepth - 1 && Known.isUnknown()) { in computeKnownBitsFromOperator()
1793 computeKnownBits(RV, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1808 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1814 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1819 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1824 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1835 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1846 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1868 computeKnownBits(I->getOperand(0), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1869 computeKnownBits(I->getOperand(1), DemandedElts, Known3, Q, Depth + 1); in computeKnownBitsFromOperator()
1878 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1879 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1883 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1884 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1888 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1889 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1893 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1894 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1900 Depth + 1); in computeKnownBitsFromOperator()
1910 computeKnownBits(I->getOperand(0), Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1913 computeKnownBits(I->getOperand(0), Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1928 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1929 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1933 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1934 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1938 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1939 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1944 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1945 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1950 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1954 computeKnownBits(Mask, DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1962 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1963 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1969 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
1970 computeKnownBits(I->getOperand(1), DemandedElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
1981 I, DemandedElts, Q, Depth, in computeKnownBitsFromOperator()
1990 I, DemandedElts, Q, Depth, KnownBits::sadd_sat); in computeKnownBitsFromOperator()
1998 I, DemandedElts, Q, Depth, in computeKnownBitsFromOperator()
2007 I, DemandedElts, Q, Depth, KnownBits::ssub_sat); in computeKnownBitsFromOperator()
2061 computeKnownBits(LHS, DemandedLHS, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
2068 computeKnownBits(RHS, DemandedRHS, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
2093 computeKnownBits(Elt, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
2100 computeKnownBits(Vec, DemandedVecElts, Known2, Q, Depth + 1); in computeKnownBitsFromOperator()
2120 computeKnownBits(Vec, DemandedVecElts, Known, Q, Depth + 1); in computeKnownBitsFromOperator()
2134 /* NUW=*/false, DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
2140 /* NUW=*/false, DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
2145 false, DemandedElts, Known, Known2, Q, Depth); in computeKnownBitsFromOperator()
2153 Depth + 1)) in computeKnownBitsFromOperator()
2154 computeKnownBits(I->getOperand(0), Known, Q, Depth + 1); in computeKnownBitsFromOperator()
2162 const SimplifyQuery &Q, unsigned Depth) { in computeKnownBits() argument
2164 ::computeKnownBits(V, DemandedElts, Known, Q, Depth); in computeKnownBits()
2171 unsigned Depth) { in computeKnownBits() argument
2173 computeKnownBits(V, Known, Q, Depth); in computeKnownBits()
2194 unsigned Depth) { in computeKnownBits() argument
2202 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in computeKnownBits()
2300 // All recursive calls that increase depth must come after this. in computeKnownBits()
2301 if (Depth == MaxAnalysisRecursionDepth) in computeKnownBits()
2308 computeKnownBits(GA->getAliasee(), Known, Q, Depth + 1); in computeKnownBits()
2313 computeKnownBitsFromOperator(I, DemandedElts, Known, Q, Depth); in computeKnownBits()
2329 computeKnownBitsFromContext(V, Known, Q, Depth); in computeKnownBits()
2335 SimplifyQuery &Q, unsigned Depth) { in isPowerOfTwoRecurrence() argument
2347 if (!isKnownToBeAPowerOfTwo(Start, OrZero, Q, Depth)) in isPowerOfTwoRecurrence()
2363 isKnownToBeAPowerOfTwo(Step, OrZero, Q, Depth); in isPowerOfTwoRecurrence()
2375 isKnownToBeAPowerOfTwo(Step, false, Q, Depth); in isPowerOfTwoRecurrence()
2413 const SimplifyQuery &Q, unsigned Depth) { in isKnownToBeAPowerOfTwo() argument
2414 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in isKnownToBeAPowerOfTwo()
2476 if (Depth++ == MaxAnalysisRecursionDepth) in isKnownToBeAPowerOfTwo()
2481 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2483 return OrZero && isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2486 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2490 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2494 return isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2497 return isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Q, Depth) && in isKnownToBeAPowerOfTwo()
2498 isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth) && in isKnownToBeAPowerOfTwo()
2499 (OrZero || isKnownNonZero(I, Q, Depth)); in isKnownToBeAPowerOfTwo()
2503 (isKnownToBeAPowerOfTwo(I->getOperand(1), /*OrZero*/ true, Q, Depth) || in isKnownToBeAPowerOfTwo()
2504 isKnownToBeAPowerOfTwo(I->getOperand(0), /*OrZero*/ true, Q, Depth))) in isKnownToBeAPowerOfTwo()
2509 return OrZero || isKnownNonZero(I->getOperand(0), Q, Depth); in isKnownToBeAPowerOfTwo()
2519 isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Q, Depth)) in isKnownToBeAPowerOfTwo()
2523 isKnownToBeAPowerOfTwo(I->getOperand(0), OrZero, Q, Depth)) in isKnownToBeAPowerOfTwo()
2528 computeKnownBits(I->getOperand(0), LHSBits, Q, Depth); in isKnownToBeAPowerOfTwo()
2531 computeKnownBits(I->getOperand(1), RHSBits, Q, Depth); in isKnownToBeAPowerOfTwo()
2549 return isKnownToBeAPowerOfTwo(I->getOperand(1), OrZero, Q, Depth) && in isKnownToBeAPowerOfTwo()
2550 isKnownToBeAPowerOfTwo(I->getOperand(2), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2559 if (isPowerOfTwoRecurrence(PN, OrZero, RecQ, Depth)) in isKnownToBeAPowerOfTwo()
2564 unsigned NewDepth = std::max(Depth, MaxAnalysisRecursionDepth - 1); in isKnownToBeAPowerOfTwo()
2584 return isKnownToBeAPowerOfTwo(II->getArgOperand(1), OrZero, Q, Depth) && in isKnownToBeAPowerOfTwo()
2585 isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2590 return isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2595 return isKnownToBeAPowerOfTwo(II->getArgOperand(0), OrZero, Q, Depth); in isKnownToBeAPowerOfTwo()
2615 unsigned Depth) { in isGEPKnownNonNull() argument
2632 if (isKnownNonZero(GEP->getPointerOperand(), Q, Depth)) in isGEPKnownNonNull()
2656 // increment Depth when just zipping down an all-constant GEP. in isGEPKnownNonNull()
2663 // We post-increment Depth here because while isKnownNonZero increments it in isGEPKnownNonNull()
2667 // of depth. in isGEPKnownNonNull()
2668 if (Depth++ >= MaxAnalysisRecursionDepth) in isGEPKnownNonNull()
2671 if (isKnownNonZero(GTI.getOperand(), Q, Depth)) in isGEPKnownNonNull()
2831 bool NUW, unsigned Depth) { in isNonZeroAdd() argument
2837 return isKnownNonZero(Y, DemandedElts, Q, Depth) || in isNonZeroAdd()
2838 isKnownNonZero(X, DemandedElts, Q, Depth); in isNonZeroAdd()
2840 KnownBits XKnown = computeKnownBits(X, DemandedElts, Q, Depth); in isNonZeroAdd()
2841 KnownBits YKnown = computeKnownBits(Y, DemandedElts, Q, Depth); in isNonZeroAdd()
2846 if (isKnownNonZero(Y, DemandedElts, Q, Depth) || in isNonZeroAdd()
2847 isKnownNonZero(X, DemandedElts, Q, Depth)) in isNonZeroAdd()
2866 isKnownToBeAPowerOfTwo(Y, /*OrZero*/ false, Q, Depth)) in isNonZeroAdd()
2869 isKnownToBeAPowerOfTwo(X, /*OrZero*/ false, Q, Depth)) in isNonZeroAdd()
2877 unsigned Depth) { in isNonZeroSub() argument
2885 if (C->isNullValue() && isKnownNonZero(Y, DemandedElts, Q, Depth)) in isNonZeroSub()
2888 return ::isKnownNonEqual(X, Y, DemandedElts, Q, Depth); in isNonZeroSub()
2893 bool NUW, unsigned Depth) { in isNonZeroMul() argument
2897 return isKnownNonZero(X, DemandedElts, Q, Depth) && in isNonZeroMul()
2898 isKnownNonZero(Y, DemandedElts, Q, Depth); in isNonZeroMul()
2902 KnownBits XKnown = computeKnownBits(X, DemandedElts, Q, Depth); in isNonZeroMul()
2904 return isKnownNonZero(Y, DemandedElts, Q, Depth); in isNonZeroMul()
2906 KnownBits YKnown = computeKnownBits(Y, DemandedElts, Q, Depth); in isNonZeroMul()
2908 return XKnown.isNonZero() || isKnownNonZero(X, DemandedElts, Q, Depth); in isNonZeroMul()
2921 unsigned Depth) { in isNonZeroShift() argument
2951 computeKnownBits(I->getOperand(1), DemandedElts, Q, Depth); in isNonZeroShift()
2964 isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth)) in isNonZeroShift()
2972 const SimplifyQuery &Q, unsigned Depth) { in isKnownNonZeroFromOperator() argument
2980 return isGEPKnownNonNull(cast<GEPOperator>(I), Q, Depth); in isKnownNonZeroFromOperator()
3013 return isKnownNonZero(I->getOperand(0), Q, Depth); in isKnownNonZeroFromOperator()
3022 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3030 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3036 return isKnownNonZero(TI->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3044 I->getOperand(1), Depth); in isKnownNonZeroFromOperator()
3051 Depth)) in isKnownNonZeroFromOperator()
3054 return isKnownNonZero(I->getOperand(1), DemandedElts, Q, Depth) || in isKnownNonZeroFromOperator()
3055 isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3059 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3065 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3070 computeKnownBits(I->getOperand(0), DemandedElts, Known, Q, Depth); in isKnownNonZeroFromOperator()
3074 return isNonZeroShift(I, DemandedElts, Q, Known, Depth); in isKnownNonZeroFromOperator()
3081 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3086 computeKnownBits(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3090 return isNonZeroShift(I, DemandedElts, Q, Known, Depth); in isKnownNonZeroFromOperator()
3097 return isKnownNonZero(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3100 computeKnownBits(I->getOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3107 computeKnownBits(I->getOperand(1), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3127 Q.IIQ.hasNoUnsignedWrap(BO), Depth); in isKnownNonZeroFromOperator()
3133 Q.IIQ.hasNoUnsignedWrap(BO), Depth); in isKnownNonZeroFromOperator()
3146 if (isKnownNonZero(Op, DemandedElts, Q, Depth)) in isKnownNonZeroFromOperator()
3174 unsigned NewDepth = std::max(Depth, MaxAnalysisRecursionDepth - 1); in isKnownNonZeroFromOperator()
3218 return (SkipElt || isKnownNonZero(Elt, Q, Depth)) && in isKnownNonZeroFromOperator()
3220 isKnownNonZero(Vec, DemandedVecElts, Q, Depth)); in isKnownNonZeroFromOperator()
3232 return isKnownNonZero(Vec, DemandedVecElts, Q, Depth); in isKnownNonZeroFromOperator()
3247 isKnownNonZero(Shuf->getOperand(1), DemandedRHS, Q, Depth)) && in isKnownNonZeroFromOperator()
3249 isKnownNonZero(Shuf->getOperand(0), DemandedLHS, Q, Depth)); in isKnownNonZeroFromOperator()
3252 return isKnownNonZero(I->getOperand(0), Q, Depth) && in isKnownNonZeroFromOperator()
3254 Depth); in isKnownNonZeroFromOperator()
3282 /*NUW=*/false, Depth); in isKnownNonZeroFromOperator()
3285 WO->getArgOperand(1), Depth); in isKnownNonZeroFromOperator()
3289 /*NSW=*/false, /*NUW=*/false, Depth); in isKnownNonZeroFromOperator()
3302 return isKnownNonZero(RP, Q, Depth); in isKnownNonZeroFromOperator()
3312 if (RV->getType() == I->getType() && isKnownNonZero(RV, Q, Depth)) in isKnownNonZeroFromOperator()
3324 return isKnownNonZero(II->getArgOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3329 II->getArgOperand(1), Depth); in isKnownNonZeroFromOperator()
3333 /*NSW=*/true, /* NUW=*/false, Depth); in isKnownNonZeroFromOperator()
3337 Q, Depth); in isKnownNonZeroFromOperator()
3344 return isKnownNonZero(II->getArgOperand(0), Q, Depth); in isKnownNonZeroFromOperator()
3352 return isKnownNonZero(II->getArgOperand(1), DemandedElts, Q, Depth) || in isKnownNonZeroFromOperator()
3353 isKnownNonZero(II->getArgOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3361 isKnownNonZero(Op, DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3367 computeKnownBits(II->getArgOperand(1), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3372 computeKnownBits(II->getArgOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3383 computeKnownBits(II->getArgOperand(1), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3387 computeKnownBits(II->getArgOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3396 return isKnownNonZero(II->getArgOperand(0), DemandedElts, Q, Depth) && in isKnownNonZeroFromOperator()
3397 isKnownNonZero(II->getArgOperand(1), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3399 return computeKnownBits(II->getArgOperand(0), DemandedElts, Q, Depth) in isKnownNonZeroFromOperator()
3402 return computeKnownBits(II->getArgOperand(0), DemandedElts, Q, Depth) in isKnownNonZeroFromOperator()
3408 return isKnownNonZero(II->getArgOperand(0), DemandedElts, Q, Depth); in isKnownNonZeroFromOperator()
3413 return isKnownNonZero(I->getOperand(0), Q, Depth); in isKnownNonZeroFromOperator()
3425 computeKnownBits(I, DemandedElts, Known, Q, Depth); in isKnownNonZeroFromOperator()
3436 const SimplifyQuery &Q, unsigned Depth) { in isKnownNonZero() argument
3440 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in isKnownNonZero()
3476 return isKnownNonZero(CPA->getPointer(), DemandedElts, Q, Depth); in isKnownNonZero()
3503 if (Depth++ >= MaxAnalysisRecursionDepth) in isKnownNonZero()
3520 if (isKnownNonZeroFromOperator(I, DemandedElts, Q, Depth)) in isKnownNonZero()
3528 return isKnownNonZero(Stripped, DemandedElts, Q, Depth); in isKnownNonZero()
3534 unsigned Depth) { in isKnownNonZero() argument
3538 return ::isKnownNonZero(V, DemandedElts, Q, Depth); in isKnownNonZero()
3666 const SimplifyQuery &Q, unsigned Depth) { in isModifyingBinopOfNonZero() argument
3686 return isKnownNonZero(Op, DemandedElts, Q, Depth + 1); in isModifyingBinopOfNonZero()
3695 unsigned Depth) { in isNonEqualMul() argument
3701 isKnownNonZero(V1, DemandedElts, Q, Depth + 1); in isNonEqualMul()
3710 unsigned Depth) { in isNonEqualShl() argument
3715 !C->isZero() && isKnownNonZero(V1, DemandedElts, Q, Depth + 1); in isNonEqualShl()
3722 unsigned Depth) { in isNonEqualPHIs() argument
3744 if (!isKnownNonEqual(IV1, IV2, DemandedElts, RecQ, Depth + 1)) in isNonEqualPHIs()
3753 unsigned Depth) { in isNonEqualSelect() argument
3763 DemandedElts, Q, Depth + 1) && in isNonEqualSelect()
3765 DemandedElts, Q, Depth + 1); in isNonEqualSelect()
3767 return isKnownNonEqual(SI1->getTrueValue(), V2, DemandedElts, Q, Depth + 1) && in isNonEqualSelect()
3768 isKnownNonEqual(SI1->getFalseValue(), V2, DemandedElts, Q, Depth + 1); in isNonEqualSelect()
3824 const SimplifyQuery &Q, unsigned Depth) { in isKnownNonEqualFromContext() argument
3836 /*LHSIsTrue=*/true, Depth) in isKnownNonEqualFromContext()
3843 /*LHSIsTrue=*/false, Depth) in isKnownNonEqualFromContext()
3871 /*LHSIsTrue=*/true, Depth) in isKnownNonEqualFromContext()
3883 unsigned Depth) { in isKnownNonEqual() argument
3890 if (Depth >= MaxAnalysisRecursionDepth) in isKnownNonEqual()
3901 Depth + 1); in isKnownNonEqual()
3907 if (isNonEqualPHIs(PN1, PN2, DemandedElts, Q, Depth)) in isKnownNonEqual()
3912 if (isModifyingBinopOfNonZero(V1, V2, DemandedElts, Q, Depth) || in isKnownNonEqual()
3913 isModifyingBinopOfNonZero(V2, V1, DemandedElts, Q, Depth)) in isKnownNonEqual()
3916 if (isNonEqualMul(V1, V2, DemandedElts, Q, Depth) || in isKnownNonEqual()
3917 isNonEqualMul(V2, V1, DemandedElts, Q, Depth)) in isKnownNonEqual()
3920 if (isNonEqualShl(V1, V2, DemandedElts, Q, Depth) || in isKnownNonEqual()
3921 isNonEqualShl(V2, V1, DemandedElts, Q, Depth)) in isKnownNonEqual()
3927 KnownBits Known1 = computeKnownBits(V1, DemandedElts, Q, Depth); in isKnownNonEqual()
3929 KnownBits Known2 = computeKnownBits(V2, DemandedElts, Q, Depth); in isKnownNonEqual()
3936 if (isNonEqualSelect(V1, V2, DemandedElts, Q, Depth) || in isKnownNonEqual()
3937 isNonEqualSelect(V2, V1, DemandedElts, Q, Depth)) in isKnownNonEqual()
3949 return isKnownNonEqual(A, B, DemandedElts, Q, Depth + 1); in isKnownNonEqual()
3951 if (isKnownNonEqualFromContext(V1, V2, Q, Depth)) in isKnownNonEqual()
3986 const SimplifyQuery &Q, unsigned Depth);
3989 const SimplifyQuery &Q, unsigned Depth) { in ComputeNumSignBits() argument
3990 unsigned Result = ComputeNumSignBitsImpl(V, DemandedElts, Q, Depth); in ComputeNumSignBits()
4004 const SimplifyQuery &Q, unsigned Depth) { in ComputeNumSignBitsImpl() argument
4007 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in ComputeNumSignBitsImpl()
4034 if (Depth == MaxAnalysisRecursionDepth) in ComputeNumSignBitsImpl()
4059 Tmp = ComputeNumSignBits(Src, Q, Depth + 1); in ComputeNumSignBitsImpl()
4067 return ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1) + in ComputeNumSignBitsImpl()
4081 ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4090 Tmp = ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4121 Tmp = ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4144 Tmp = ComputeNumSignBits(X, DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4148 ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4160 Tmp = ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4162 Tmp2 = ComputeNumSignBits(U->getOperand(1), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4178 Tmp = ComputeNumSignBits(U->getOperand(1), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4181 Tmp2 = ComputeNumSignBits(U->getOperand(2), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4188 Tmp = ComputeNumSignBits(U->getOperand(0), Q, Depth + 1); in ComputeNumSignBitsImpl()
4195 computeKnownBits(U->getOperand(0), DemandedElts, Known, Q, Depth + 1); in ComputeNumSignBitsImpl()
4208 Tmp2 = ComputeNumSignBits(U->getOperand(1), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4214 Tmp2 = ComputeNumSignBits(U->getOperand(1), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4222 computeKnownBits(U->getOperand(1), DemandedElts, Known, Q, Depth + 1); in ComputeNumSignBitsImpl()
4239 Tmp = ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4248 ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4252 ComputeNumSignBits(U->getOperand(1), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4269 // because of our depth threshold. in ComputeNumSignBitsImpl()
4276 DemandedElts, RecQ, Depth + 1)); in ComputeNumSignBitsImpl()
4285 Tmp = ComputeNumSignBits(U->getOperand(0), Q, Depth + 1); in ComputeNumSignBitsImpl()
4298 return ComputeNumSignBits(U->getOperand(0), Q, Depth + 1); in ComputeNumSignBitsImpl()
4316 Tmp = ComputeNumSignBits(LHS, DemandedLHS, Q, Depth + 1); in ComputeNumSignBitsImpl()
4324 Tmp2 = ComputeNumSignBits(RHS, DemandedRHS, Q, Depth + 1); in ComputeNumSignBitsImpl()
4341 ComputeNumSignBits(U->getOperand(0), DemandedElts, Q, Depth + 1); in ComputeNumSignBitsImpl()
4369 computeKnownBits(V, DemandedElts, Known, Q, Depth); in ComputeNumSignBitsImpl()
4566 unsigned Depth = 0) { in computeKnownFPClassFromCond() argument
4568 if (Depth < MaxAnalysisRecursionDepth && in computeKnownFPClassFromCond()
4572 Depth + 1); in computeKnownFPClassFromCond()
4574 Depth + 1); in computeKnownFPClassFromCond()
4577 if (Depth < MaxAnalysisRecursionDepth && match(Cond, m_Not(m_Value(A)))) { in computeKnownFPClassFromCond()
4579 Depth + 1); in computeKnownFPClassFromCond()
4663 const SimplifyQuery &Q, unsigned Depth);
4667 const SimplifyQuery &Q, unsigned Depth) { in computeKnownFPClass() argument
4671 computeKnownFPClass(V, DemandedElts, InterestedClasses, Known, Q, Depth); in computeKnownFPClass()
4679 unsigned Depth) { in computeKnownFPClassForFPTrunc() argument
4686 KnownSrc, Q, Depth + 1); in computeKnownFPClassForFPTrunc()
4700 const SimplifyQuery &Q, unsigned Depth) { in computeKnownFPClass() argument
4709 assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth"); in computeKnownFPClass()
4802 // All recursive calls that increase depth must come after this. in computeKnownFPClass()
4803 if (Depth == MaxAnalysisRecursionDepth) in computeKnownFPClass()
4810 Known, Q, Depth + 1); in computeKnownFPClass()
4856 Q, Depth + 1); in computeKnownFPClass()
4860 Known2, Q, Depth + 1); in computeKnownFPClass()
4875 InterestedClasses, Known, Q, Depth + 1); in computeKnownFPClass()
4885 Known, Q, Depth + 1); in computeKnownFPClass()
4887 KnownSign, Q, Depth + 1); in computeKnownFPClass()
4905 KnownAddend, Q, Depth + 1); in computeKnownFPClass()
4919 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
4951 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
4965 KnownLHS, Q, Depth + 1); in computeKnownFPClass()
4967 KnownRHS, Q, Depth + 1); in computeKnownFPClass()
5058 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5109 InterestedClasses, Q, Depth + 1); in computeKnownFPClass()
5119 II->getFastMathFlags(), InterestedClasses, Q, Depth + 1); in computeKnownFPClass()
5135 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5168 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5178 Q, Depth); in computeKnownFPClass()
5202 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5233 ExponentKnownBits, Q, Depth + 1); in computeKnownFPClass()
5250 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5258 KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5284 ExpArg, true, Q.IIQ.UseInstrInfo, Q.AC, Q.CxtI, Q.DT, Depth + 1); in computeKnownFPClass()
5321 Known, Q, Depth + 1); in computeKnownFPClass()
5364 KnownRHS, Q, Depth + 1); in computeKnownFPClass()
5373 KnownLHS, Q, Depth + 1); in computeKnownFPClass()
5432 Q, Depth + 1); in computeKnownFPClass()
5437 Q, Depth + 1); in computeKnownFPClass()
5496 Depth + 1); in computeKnownFPClass()
5508 Depth + 1); in computeKnownFPClass()
5557 Known, Q, Depth + 1); in computeKnownFPClass()
5580 Depth); in computeKnownFPClass()
5630 Q, Depth + 1); in computeKnownFPClass()
5650 computeKnownFPClass(Elt, Known, InterestedClasses, Q, Depth + 1); in computeKnownFPClass()
5662 Depth + 1); in computeKnownFPClass()
5679 Depth + 1); in computeKnownFPClass()
5692 Depth + 1); in computeKnownFPClass()
5711 InterestedClasses, KnownSrc, Q, Depth + 1); in computeKnownFPClass()
5747 Depth + 1); in computeKnownFPClass()
5760 if (Depth < PhiRecursionLimit) { in computeKnownFPClass()
5777 // to waste time spinning around in loops. We need at least depth 2 to in computeKnownFPClass()
5805 computeKnownBits(Src, DemandedElts, Bits, Q, Depth + 1); in computeKnownFPClass()
5862 unsigned Depth) { in computeKnownFPClass() argument
5865 Depth); in computeKnownFPClass()
5872 unsigned Depth) { in computeKnownFPClass() argument
5874 ::computeKnownFPClass(V, Known, InterestedClasses, SQ, Depth); in computeKnownFPClass()
5881 const DominatorTree *DT, bool UseInstrInfo, unsigned Depth) { in computeKnownFPClass() argument
5884 Depth); in computeKnownFPClass()
5890 const SimplifyQuery &SQ, unsigned Depth) { in computeKnownFPClass() argument
5897 computeKnownFPClass(V, DemandedElts, InterestedClasses, SQ, Depth); in computeKnownFPClass()
5909 unsigned Depth) { in computeKnownFPClass() argument
5914 Depth); in computeKnownFPClass()
5918 unsigned Depth) { in cannotBeNegativeZero() argument
5919 KnownFPClass Known = computeKnownFPClass(V, fcNegZero, SQ, Depth); in cannotBeNegativeZero()
5924 unsigned Depth) { in cannotBeOrderedLessThanZero() argument
5926 computeKnownFPClass(V, KnownFPClass::OrderedLessThanZeroMask, SQ, Depth); in cannotBeOrderedLessThanZero()
5931 unsigned Depth) { in isKnownNeverInfinity() argument
5932 KnownFPClass Known = computeKnownFPClass(V, fcInf, SQ, Depth); in isKnownNeverInfinity()
5938 unsigned Depth) { in isKnownNeverInfOrNaN() argument
5939 KnownFPClass Known = computeKnownFPClass(V, fcInf | fcNan, SQ, Depth); in isKnownNeverInfOrNaN()
5947 unsigned Depth) { in isKnownNeverNaN() argument
5948 KnownFPClass Known = computeKnownFPClass(V, fcNan, SQ, Depth); in isKnownNeverNaN()
5957 unsigned Depth) { in computeKnownFPSignBit() argument
5958 KnownFPClass Known = computeKnownFPClass(V, fcAllFlags, SQ, Depth); in computeKnownFPSignBit()
7518 unsigned Depth) { in directlyImpliesPoison() argument
7523 if (Depth >= MaxDepth) in directlyImpliesPoison()
7529 directlyImpliesPoison(ValAssumedPoison, Op, Depth + 1); in directlyImpliesPoison()
7546 unsigned Depth) { in impliesPoison() argument
7550 if (directlyImpliesPoison(ValAssumedPoison, V, /* Depth */ 0)) in impliesPoison()
7554 if (Depth >= MaxDepth) in impliesPoison()
7560 return impliesPoison(Op, V, Depth + 1); in impliesPoison()
7567 return ::impliesPoison(ValAssumedPoison, V, /* Depth */ 0); in impliesPoison()
7574 const DominatorTree *DT, unsigned Depth, UndefPoisonKind Kind) { in isGuaranteedNotToBeUndefOrPoison() argument
7575 if (Depth >= MaxAnalysisRecursionDepth) in isGuaranteedNotToBeUndefOrPoison()
7629 return isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth + 1, Kind); in isGuaranteedNotToBeUndefOrPoison()
7653 DT, Depth + 1, Kind)) { in isGuaranteedNotToBeUndefOrPoison()
7729 unsigned Depth) { in isGuaranteedNotToBeUndefOrPoison() argument
7730 return ::isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth, in isGuaranteedNotToBeUndefOrPoison()
7736 const DominatorTree *DT, unsigned Depth) { in isGuaranteedNotToBePoison() argument
7737 return ::isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth, in isGuaranteedNotToBePoison()
7743 const DominatorTree *DT, unsigned Depth) { in isGuaranteedNotToBeUndef() argument
7744 return ::isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth, in isGuaranteedNotToBeUndef()
8274 unsigned Depth) { in matchMinMaxOfMinMax() argument
8279 SelectPatternResult L = matchSelectPattern(TVal, A, B, nullptr, Depth + 1); in matchMinMaxOfMinMax()
8284 SelectPatternResult R = matchSelectPattern(FVal, C, D, nullptr, Depth + 1); in matchMinMaxOfMinMax()
8384 unsigned Depth) { in matchMinMax() argument
8393 SPR = matchMinMaxOfMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, Depth); in matchMinMax()
8620 unsigned Depth) { in matchSelectPattern() argument
8776 return matchMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, LHS, RHS, Depth); in matchSelectPattern()
8927 unsigned Depth) { in matchSelectPattern() argument
8928 if (Depth >= MaxAnalysisRecursionDepth) in matchSelectPattern()
8943 CastOp, Depth); in matchSelectPattern()
8948 FastMathFlags FMF, Instruction::CastOps *CastOp, unsigned Depth) { in matchDecomposedSelectPattern() argument
8968 LHS, RHS, Depth); in matchDecomposedSelectPattern()
8977 LHS, RHS, Depth); in matchDecomposedSelectPattern()
8981 LHS, RHS, Depth); in matchDecomposedSelectPattern()
9402 const DataLayout &DL, bool LHSIsTrue, unsigned Depth) { in isImpliedCondAndOr() argument
9409 assert(Depth <= MaxAnalysisRecursionDepth && "Hit recursion limit"); in isImpliedCondAndOr()
9419 ALHS, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue, Depth + 1)) in isImpliedCondAndOr()
9422 ARHS, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue, Depth + 1)) in isImpliedCondAndOr()
9432 const DataLayout &DL, bool LHSIsTrue, unsigned Depth) { in isImpliedCondition() argument
9434 if (Depth == MaxAnalysisRecursionDepth) in isImpliedCondition()
9468 Depth); in isImpliedCondition()
9475 bool LHSIsTrue, unsigned Depth) { in isImpliedCondition() argument
9491 RHSCmp->getOperand(1), DL, LHSIsTrue, Depth)) in isImpliedCondition()
9500 LHSIsTrue, Depth)) in isImpliedCondition()
9505 if (Depth == MaxAnalysisRecursionDepth) in isImpliedCondition()
9513 isImpliedCondition(LHS, RHS1, DL, LHSIsTrue, Depth + 1)) in isImpliedCondition()
9517 isImpliedCondition(LHS, RHS2, DL, LHSIsTrue, Depth + 1)) in isImpliedCondition()
9523 isImpliedCondition(LHS, RHS1, DL, LHSIsTrue, Depth + 1)) in isImpliedCondition()
9527 isImpliedCondition(LHS, RHS2, DL, LHSIsTrue, Depth + 1)) in isImpliedCondition()
9994 unsigned Depth) { in computeConstantRange() argument
9997 if (Depth == MaxAnalysisRecursionDepth) in computeConstantRange()
10016 SI->getTrueValue(), ForSigned, UseInstrInfo, AC, CtxI, DT, Depth + 1); in computeConstantRange()
10018 SI->getFalseValue(), ForSigned, UseInstrInfo, AC, CtxI, DT, Depth + 1); in computeConstantRange()
10061 UseInstrInfo, AC, I, DT, Depth + 1); in computeConstantRange()