RFR: 8367341: C2: apply KnownBits and unsigned bounds to And / Or operations [v3]

[Quan Anh Mai]

> Hi,
> 
> This PR improves the implementation of `AndNode/OrNode/XorNode::Value` by taking advantages of the additional information in `TypeInt`. The implementation is pretty straightforward. A clever trick is that by analyzing the negative and positive ranges of a `TypeInt` separately, we have better info for the leading bits. I also implement gtest unit tests to verify the correctness and monotonicity of the inference functions.
> 
> Please take a look and leave your reviews, thanks a lot.

Quan Anh Mai has updated the pull request incrementally with two additional commits since the last revision:

 - remove std::hash
 - remove unordered_map, add some comments for all_instances_size

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

Changes:
  - all: https://git.openjdk.org/jdk/pull/27618/files
  - new: https://git.openjdk.org/jdk/pull/27618/files/b73850d1..513e3e9e

Webrevs:
 - full: https://webrevs.openjdk.org/?repo=jdk&pr=27618&range=02
 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=27618&range=01-02

  Stats: 56 lines in 2 files changed: 37 ins; 11 del; 8 mod
  Patch: https://git.openjdk.org/jdk/pull/27618.diff
  Fetch: git fetch https://git.openjdk.org/jdk.git pull/27618/head:pull/27618

PR: https://git.openjdk.org/jdk/pull/27618