Lines Matching full:known
62 // If all of the MaskV bits are known to be zero, then we know the
67 // Top bits known zero.
79 // this only works if the known zeros are in the right operand.
83 "Bits known to be one AND zero?");
87 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
98 // If the known zeros are in the left operand for a subtract,
99 // fall back to the minimum known zeros in both operands.
139 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
140 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
144 // If the multiplication is known not to overflow, compute the sign bit.
167 // If low bits are zero in either operand, output low known-0 bits.
168 // Also compute a conserative estimate for high known-0 bits.
213 /// ComputeMaskedBits - Determine which of the bits are known to be either zero
225 /// where V is a vector, known zero, and known one values are the
258 // Handle a constant vector by taking the intersection of the known bits of
348 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
349 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
351 // Output known-1 bits are only known if set in both the LHS & RHS.
353 // Output known-0 are known to be clear if zero in either the LHS | RHS.
360 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
361 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
363 // Output known-0 bits are only known if clear in both the LHS & RHS.
365 // Output known-1 are known to be set if set in either the LHS | RHS.
372 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
373 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
375 // Output known-0 bits are known if clear or set in both the LHS & RHS.
377 // Output known-1 are known to be set if set in only one of the LHS, RHS.
390 // treat a udiv as a logical right shift by the power of 2 known to
410 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
411 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
413 // Only known if known in both the LHS and RHS.
449 // Any top bits are known to be zero.
472 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
476 // If the sign bit of the input is known set or clear, then we know the
478 if (KnownZero[SrcBitWidth-1]) // Input sign bit known zero
480 else if (KnownOne[SrcBitWidth-1]) // Input sign bit known set
489 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
492 KnownZero |= APInt::getLowBitsSet(BitWidth, ShiftAmt); // low bits known 0
504 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
507 // high bits known zero.
520 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
525 if (KnownZero[BitWidth-ShiftAmt-1]) // New bits are known zero.
527 else if (KnownOne[BitWidth-ShiftAmt-1]) // New bits are known one.
567 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
577 // If it's known zero, our sign bit is also zero.
590 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
621 // to determine if we can prove known low zero bits.
689 // We need to take the minimum number of known bits
705 // Otherwise take the unions of the known bit sets of the operands,
790 /// ComputeSignBit - Determine whether the sign bit is known to be zero or
807 /// isKnownToBeAPowerOfTwo - Return true if the given value is known to have exactly one
808 /// bit set when defined. For vectors return true if every element is known to
900 /// \brief Test whether a GEP's result is known to be non-null.
902 /// Uses properties inherent in a GEP to try to determine whether it is known
966 /// isKnownNonZero - Return true if the given value is known to be non-zero
967 /// when defined. For vectors return true if every element is known to be
1096 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1097 /// this predicate to simplify operations downstream. Mask is known to be zero
1102 /// where V is a vector, the mask, known zero, and known one values are the
1109 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1201 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1225 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1230 // If the input is known to be positive (the sign bit is known clear),
1277 // Nothing known.
1597 // each of the elements of the substruct are known (ie, inserted into From by an
