RFR: 8315066: Add unsigned bounds and known bits to TypeInt/Long [v12]

[Dean Long]

On Mon, 30 Sep 2024 15:03:51 GMT, Quan Anh Mai <qamai at openjdk.org> wrote:

>> If you want to understand full details of how a (symmetrical) type lattice with duals supports a unified model for many different type flow analysis algorithms you can read up on it in Nielsen, Nielsen and Hankin's book Principles of Program Analysis. If it is new to you then a more simplified account of the use of (unqualified) TOP and BOTTOM types in type flow analysis can be found in Muchnick's book Advanced Compiler Design and Implementation. Note that Cliff Click goes against conventional mathematical terminology in making BOTTOM a universal type and TOP an empty (unrealizable) type.
>> 
>> One detail that may not be obvious is that the sub-lattice for int and long sorts includes the hierarchy of single, continuous intervals. Individual integral values (on the lattice centre line) are modelled as singleton ranges i.e. [a,a]. Given the large cardinality of the set of continuous intervals this makes it necessary to place a bound on any fixed point iterations that widen interval ranges. The iteration is killed by widening to the maximum range (this is what Cliff refers to in the code as a 'death march').
>
> @adinn Thanks a lot for your direction, it is really interesting and took me a while to read through. Although, I think that in practice, currently C2 only uses `dual` to compute the join of 2 types, which is rather confusing.

I'm OK with this clever "lazy dual" optimization using _is_dual that get reversed instead of doing an actual computation, but how can we make sure it is only used with join() and not accidentally used with other operations?

-------------

PR Review Comment: https://git.openjdk.org/jdk/pull/17508#discussion_r1809592664