https://bugs.kde.org/show_bug.cgi?id=381326
--- Comment #8 from John Reiser <jrei...@bitwagon.com> --- (In reply to Julian Seward from comment #5) > What's the underlying insight > here? In particular, why is it the case that knowing the two operands are > equal allows us to mark the operands as more defined than they were > originally? > > Is this specific to == and !=, or is it more general? The underlying principle is that it can be useful to view "a bit is initialized" as equivalent to "the cardinality of the set of possible values is 1, not 2." It also applies to <, <=, >=, > when there are enough Valid bits that are contiguous with the MostSignificantBit, and the operands satisfy the relation when restricted to those contiguous bits. -- You are receiving this mail because: You are watching all bug changes.
