[prev in list] [next in list] [prev in thread] [next in thread] 

List:       openjdk-hotspot-compiler-dev
Subject:    Re: RFR: 8318446: C2: optimize stores into primitive arrays by combining values into larger store [v
From:       Emanuel Peter <epeter () openjdk ! org>
Date:       2024-01-30 16:17:46
Message-ID: irt4FQMUsqxjsEENOVdo-bmPbf7k7P20gvWhIAYbvvY=.652988c8-bb6d-417a-b974-407567aad786 () github ! com
[Download RAW message or body]

On Tue, 30 Jan 2024 14:43:41 GMT, Roland Westrelin <roland@openjdk.org> wrote:

> > Ok. Well in that case I might have to make a more intelligent pointer-analysis, \
> > and parse past ConvI2L and CastII nodes.
> 
> Do you still need a traversal of the graph to find the Stores or can you enqueue \
> them for post loop opts then?

Maybe I can do it with the post-loops enqueue. But of course at that point the \
pointers are just about to be transformed, at least the way it works today. They may \
be in any state that has the ConvI2L and CastII etc nodes, or it may have some or \
none of them. But maybe all of that can be done.

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

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


[prev in list] [next in list] [prev in thread] [next in thread]