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

Johan Sjölen jsjolen at openjdk.org
Wed Oct 15 16:29:16 UTC 2025


On Wed, 15 Oct 2025 16:10:56 GMT, Quan Anh Mai <qamai at openjdk.org> wrote:

>> Use `RBTreeCHeap`, if going the RBTree route. It's just the easiest way of using it.
>
> Thanks for your inputs, I have removed the usage of `std::unordered_map` and replaced it with `RBTreeCHeap`. Is using `std::array` here fine?

Hi @merykitty,

I think that we don't use the STL because we run without exceptions and because we want our production data structures to have custom allocators, and history :-). As `std::array` (AFAIU) is 'just' a typed and sized `T*`, I think it should be fine, as long as you avoid things that might throw!

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

PR Review Comment: https://git.openjdk.org/jdk/pull/27618#discussion_r2433256750


More information about the hotspot-compiler-dev mailing list