RFR: 8318446: C2: optimize stores into primitive arrays by combining values into larger store

Emanuel Peter epeter at openjdk.org
Mon Jan 22 10:05:31 UTC 2024


On Fri, 19 Jan 2024 21:53:28 GMT, Dean Long <dlong at openjdk.org> wrote:

> I took a quick look and I don't see where the code checks that all the candidate stores are using MemNode::unordered and that there aren't memory barriers in between.

@dean-long How would the graph look like if there were memory barriers? Would there not be something on the memory graph or control graph which is neither a Store nor a RangeCheck? Any what exactly is your concern about `MemNode::unordered`? Would you mind explaining or giving some examples?

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

PR Comment: https://git.openjdk.org/jdk/pull/16245#issuecomment-1903644388


More information about the hotspot-compiler-dev mailing list