harmony-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Evgueni Brevnov (JIRA)" <j...@apache.org>
Subject [jira] Updated: (HARMONY-2170) [drlvm][jit] Suggestion of new Range Check elimination optimization.
Date Mon, 26 Nov 2007 15:21:43 GMT

     [ https://issues.apache.org/jira/browse/HARMONY-2170?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]

Evgueni Brevnov updated HARMONY-2170:
-------------------------------------

    Attachment: dabce.patch

I found the reason of failures on x86_64 platform. It turned out that not all hi level optimizations
are enabled on x86_64. Namely 'lazy exceptions' & 'loop unrolling' are off. Accidentally,
I turned it on in my first patch and that was the reason. Now all tests passed for me.

BTW, I noted you discared changes for MSVC project. Did you do that intentionally or by mistake?

Thanks
Evgueni

> [drlvm][jit] Suggestion of new Range Check elimination optimization.
> --------------------------------------------------------------------
>
>                 Key: HARMONY-2170
>                 URL: https://issues.apache.org/jira/browse/HARMONY-2170
>             Project: Harmony
>          Issue Type: Improvement
>          Components: DRLVM
>         Environment: All.
>            Reporter: Sergey Kuksenko
>            Assignee: Mikhail Fursov
>         Attachments: abcde2.patch, dabce.patch, dabce.patch
>
>
> Currently [drlvm][jit] contains ABCD (range check elimination) algorithm.
> ABCD algorithm works pretty well if iterations over an array is perfomed with array.length
access.
> However, there are a set of code patterns where ABCD algorithm won't work.
> For example, java.util classes ArrayList, Vector, HashMap, etc... very often contains
a field where a real upper bound is stored (and usually this upped bound is less then array.legth).
So, iteration over such arrays usually is performed by the following way:
>  for (int i = 0; i < real_length; i++) {
>     array[i]....
> }
> Where "real_length" is a field which contains real upper bound.
> Very often it is too expensive or impossible for JIT to determine value range for this
field and in such ways (when cycle limit is value obtained outside method) ABCD range check
elimination can't work.
> Suggestion:
> In case of cycle like:
> int i=0;
> while(i < real_length) {
>    checkRange(array, i);  // introduce explicit range check operation
>    ...array[i]...
>    i++;
> }
> Split this cycle to:
> int i=0;
> while(i < min(real_length, array.length) ) {
>    ...array[i]...         // NO range check here
>    i++;
> }
> while(i<real_length) {
>    checkRange(array, i);
>    ...array[i]...
>    i++;
> }
> After such splitting range check is useless at the first cycle and may be removed.

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.


Mime
View raw message