Optimization question

[Krystal Mok]

Resending to the list...

On Wed, Dec 23, 2015 at 6:17 PM, Vitaly Davidovich <vitalyd at gmail.com>
 wrote:

> Ok so Vladimir mentioned the same thing about any access that EA doesn't
> know about.  I guess I'm still unclear on why unrolling needs to happen
> given array length can be deduced, loop stride is constant, and loop body
> shows which arrays and indices are accessed and in what manner (read,
> write, both).  It seems like all the info is there even without unrolling.
> Is this just an implementation detail or am I missing something fundamental?
>
>
It's an implementation detail of HotSpot C2.

The loop structure information that you're talking about are actually not
available until when loop optimization kicks in:
- Counted loops are discovered (which computes the loop stride and bounds)
- Loops are then unrolled (and only then the indices become constants)

Unfortunately that happens after EA.

Now, suppose EA tries to handle the "array" in your example, and scalar
replaces its elements into local variable e0, e1, e2 and e3.
Then what does "array[i]" translate to? If the index "i" is known as a
constant, e.g. 2, then array[2] would be translated to e2.
Otherwise there no straightforward way to translate it, since the 4 new
local variable are "unrelated" (not guaranteed to be packed together
anymore), you can't even try to efficiently make an interior pointer to
dynamically point to them.

- Kris
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.openjdk.java.net/pipermail/hotspot-compiler-dev/attachments/20151223/921df2ba/attachment.html>