Home | History | Annotate | Download | only in Analysis

Lines Matching refs:Depth

49                                     const TargetData *TD, unsigned Depth) {
60 llvm::ComputeMaskedBits(Op1, KnownZero2, KnownOne2, TD, Depth+1);
81 llvm::ComputeMaskedBits(Op0, LHSKnownZero, LHSKnownOne, TD, Depth+1);
86 llvm::ComputeMaskedBits(Op1, KnownZero2, KnownOne2, TD, Depth+1);
135 const TargetData *TD, unsigned Depth) {
137 ComputeMaskedBits(Op1, KnownZero, KnownOne, TD, Depth+1);
138 ComputeMaskedBits(Op0, KnownZero2, KnownOne2, TD, Depth+1);
161 isKnownNonZero(Op0, TD, Depth)) ||
163 isKnownNonZero(Op1, TD, Depth));
229 const TargetData *TD, unsigned Depth) {
231 assert(Depth <= MaxDepth && "Limit Search Depth");
305 ComputeMaskedBits(GA->getAliasee(), KnownZero, KnownOne, TD, Depth+1);
322 if (Depth == MaxDepth)
323 return; // Limit search depth.
337 ComputeMaskedBits(I->getOperand(1), KnownZero, KnownOne, TD, Depth+1);
338 ComputeMaskedBits(I->getOperand(0), KnownZero2, KnownOne2, TD, Depth+1);
349 ComputeMaskedBits(I->getOperand(1), KnownZero, KnownOne, TD, Depth+1);
350 ComputeMaskedBits(I->getOperand(0), KnownZero2, KnownOne2, TD, Depth+1);
361 ComputeMaskedBits(I->getOperand(1), KnownZero, KnownOne, TD, Depth+1);
362 ComputeMaskedBits(I->getOperand(0), KnownZero2, KnownOne2, TD, Depth+1);
376 Depth);
383 ComputeMaskedBits(I->getOperand(0), KnownZero2, KnownOne2, TD, Depth+1);
388 ComputeMaskedBits(I->getOperand(1), KnownZero2, KnownOne2, TD, Depth+1);
398 ComputeMaskedBits(I->getOperand(2), KnownZero, KnownOne, TD, Depth+1);
400 Depth+1);
434 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
448 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
459 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
476 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
491 ComputeMaskedBits(I->getOperand(0), KnownZero,KnownOne, TD, Depth+1);
507 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
524 Depth);
531 Depth);
539 ComputeMaskedBits(I->getOperand(0), KnownZero2, KnownOne2, TD, Depth+1);
564 Depth+1);
577 Depth+1);
587 ComputeMaskedBits(I->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
588 ComputeMaskedBits(I->getOperand(1), KnownZero2, KnownOne2, TD, Depth+1);
612 Depth+1);
633 ComputeMaskedBits(Index, LocalKnownZero, LocalKnownOne, TD, Depth+1);
675 ComputeMaskedBits(R, KnownZero2, KnownOne2, TD, Depth+1);
679 ComputeMaskedBits(L, KnownZero3, KnownOne3, TD, Depth+1);
695 if (Depth < MaxDepth - 1 && !KnownZero && !KnownOne) {
758 KnownOne, KnownZero2, KnownOne2, TD, Depth);
764 KnownOne, KnownZero2, KnownOne2, TD, Depth);
770 KnownZero2, KnownOne2, TD, Depth);
781 Depth) {
790 ComputeMaskedBits(V, ZeroBits, OneBits, TD, Depth);
800 unsigned Depth) {
820 if (Depth++ == MaxDepth)
827 return isPowerOfTwo(X, TD, /*OrZero*/true, Depth);
830 return isPowerOfTwo(ZI->getOperand(0), TD, OrZero, Depth);
833 return isPowerOfTwo(SI->getTrueValue(), TD, OrZero, Depth) &&
834 isPowerOfTwo(SI->getFalseValue(), TD, OrZero, Depth);
838 if (isPowerOfTwo(X, TD, /*OrZero*/true, Depth) ||
839 isPowerOfTwo(Y, TD, /*OrZero*/true, Depth))
852 return isPowerOfTwo(cast<Operator>(V)->getOperand(0), TD, OrZero, Depth);
862 bool llvm::isKnownNonZero(Value *V, const TargetData *TD, unsigned Depth) {
874 if (Depth++ >= MaxDepth)
882 return isKnownNonZero(X, TD, Depth) || isKnownNonZero(Y, TD, Depth);
886 return isKnownNonZero(cast<Instruction>(V)->getOperand(0), TD, Depth);
894 return isKnownNonZero(X, TD, Depth);
898 ComputeMaskedBits(X, KnownZero, KnownOne, TD, Depth);
908 return isKnownNonZero(X, TD, Depth);
911 ComputeSignBit(X, XKnownNonNegative, XKnownNegative, TD, Depth);
917 return isKnownNonZero(X, TD, Depth);
923 ComputeSignBit(X, XKnownNonNegative, XKnownNegative, TD, Depth);
924 ComputeSignBit(Y, YKnownNonNegative, YKnownNegative, TD, Depth);
929 if (isKnownNonZero(X, TD, Depth) || isKnownNonZero(Y, TD, Depth))
940 ComputeMaskedBits(X, KnownZero, KnownOne, TD, Depth);
945 ComputeMaskedBits(Y, KnownZero, KnownOne, TD, Depth);
951 if (XKnownNonNegative && isPowerOfTwo(Y, TD, /*OrZero*/false, Depth))
953 if (YKnownNonNegative && isPowerOfTwo(X, TD, /*OrZero*/false, Depth))
962 isKnownNonZero(X, TD, Depth) && isKnownNonZero(Y, TD, Depth))
967 if (isKnownNonZero(SI->getTrueValue(), TD, Depth) &&
968 isKnownNonZero(SI->getFalseValue(), TD, Depth))
975 ComputeMaskedBits(V, KnownZero, KnownOne, TD, Depth);
989 const TargetData *TD, unsigned Depth) {
991 ComputeMaskedBits(V, KnownZero, KnownOne, TD, Depth);
1007 unsigned Depth) {
1020 if (Depth == 6)
1021 return 1; // Limit search depth.
1028 return ComputeNumSignBits(U->getOperand(0), TD, Depth+1) + Tmp;
1031 Tmp = ComputeNumSignBits(U->getOperand(0), TD, Depth+1);
1044 Tmp = ComputeNumSignBits(U->getOperand(0), TD, Depth+1);
1056 Tmp = ComputeNumSignBits(U->getOperand(0), TD, Depth+1);
1058 Tmp2 = ComputeNumSignBits(U->getOperand(1), TD, Depth+1);
1067 Tmp = ComputeNumSignBits(U->getOperand(1), TD, Depth+1);
1069 Tmp2 = ComputeNumSignBits(U->getOperand(2), TD, Depth+1);
1075 Tmp = ComputeNumSignBits(U->getOperand(0), TD, Depth+1);
1082 ComputeMaskedBits(U->getOperand(0), KnownZero, KnownOne, TD, Depth+1);
1095 Tmp2 = ComputeNumSignBits(U->getOperand(1), TD, Depth+1);
1100 Tmp2 = ComputeNumSignBits(U->getOperand(1), TD, Depth+1);
1107 ComputeMaskedBits(U->getOperand(1), KnownZero, KnownOne, TD, Depth+1);
1123 Tmp = ComputeNumSignBits(U->getOperand(0), TD, Depth+1);
1133 // because of our depth threshold.
1134 Tmp = ComputeNumSignBits(PN->getIncomingValue(0), TD, Depth+1);
1138 ComputeNumSignBits(PN->getIncomingValue(i), TD, Depth+1));
1153 ComputeMaskedBits(V, KnownZero, KnownOne, TD, Depth);
1178 bool LookThroughSExt, unsigned Depth) {
1182 assert(Depth <= MaxDepth && "Limit Search Depth");
1210 if (Depth == MaxDepth) return false; // Limit search depth.
1222 LookThroughSExt, Depth+1);
1240 if (ComputeMultiple(Op0, Base, Mul0, LookThroughSExt, Depth+1)) {
1264 if (ComputeMultiple(Op1, Base, Mul1, LookThroughSExt, Depth+1)) {
1299 bool llvm::CannotBeNegativeZero(const Value *V, unsigned Depth) {
1303 if (Depth == 6)
1304 return 1; // Limit search depth.
1322 return CannotBeNegativeZero(II->getArgOperand(0), Depth+1);
1335 return CannotBeNegativeZero(CI->getArgOperand(0), Depth+1);