Lines Matching full:zero
88 /// to be zero in the expression. These are provided to potentially allow the
159 // If either the LHS or the RHS are Zero, the result is zero.
173 // If all of the demanded bits in the inputs are known zeros, return zero.
185 // If all of the demanded bits are known zero on one side, return the
210 // If all of the demanded bits are known zero on one side, return the
235 // If either the LHS or the RHS are Zero, the result is zero.
241 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
242 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
253 // If all of the demanded bits in the inputs are known zeros, return zero.
263 // Output known-0 are known to be clear if zero in either the LHS | RHS.
273 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
274 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
276 // If all of the demanded bits are known zero on one side, return the other.
309 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
310 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
312 // If all of the demanded bits are known zero on one side, return the other.
319 // If all of the demanded bits are known to be zero on one side or the
350 // bits to zero. We can just knock out bits from the 'and' and the 'xor',
384 assert(!(RHSKnownZero & RHSKnownOne) && "Bits known to be one AND zero?");
385 assert(!(LHSKnownZero & LHSKnownOne) && "Bits known to be one AND zero?");
407 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
430 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
445 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
446 // The top bits are known to be zero.
472 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
477 // If the input sign bit is known zero, or if the NewBits are not demanded
478 // convert this into a zero extension.
498 // won't work if the RHS is zero.
506 // Find information about known zero/one bits in the input.
520 // Turn it into OR if input bits are zero.
528 // We can say something about the output known-zero and known-one bits,
532 // one mask of 0x00001 and a known zero mask of 0xE0F0E.
542 // Bits are known one if they are known zero in one operand and one in the
547 // Bits are known zero if they are known zero in both operands and there
586 // zero.
621 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
624 // low bits known zero.
638 // they are zero).
645 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
651 KnownZero |= HighBits; // high bits known zero.
683 // they are zero).
690 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
701 // If the input sign bit is known to be zero, or if none of the top bits
736 // If LHS is non-negative or has all low bits zero
737 // are all zero.
741 // If LHS is negative and not all low bits are zero, then the upper bits
746 assert(!(KnownZero & KnownOne) && "Bits known to be one AND zero?");
751 // remainder is zero.
755 // If it's known zero, our sign bit is also zero.
808 // TODO: Could compute known zero/one bits based on the input.
1153 // div/rem demand all inputs, because they don't want divide by zero.
1188 // div/rem demand all inputs, because they don't want divide by zero.
1197 // like undef&0. The result is known zero, not undef.
1273 // like undef&0. The result is known zero, not undef.
