harmony-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Naveen Neelakantam <neela...@uiuc.edu>
Subject Re: [drvm][jit] ABCD does not eliminate upper bound check
Date Thu, 19 Apr 2007 04:33:29 GMT

On Apr 17, 2007, at 12:34 AM, Mikhail Fursov wrote:

> On 4/17/07, Naveen Neelakantam <neelakan@uiuc.edu> wrote:
>> But in general, other optimization passes can perform transformations
>> that break important dataflow relationships between variables.  This
>> sometimes makes it impossible for ABCD to prove that a particular
>> bounds check is redundant (ABCD uses "constraints", which are derived
>> from dataflow).
> Naveen, if any of optimizations we have can break ABCD with Maxim's  
> example,
> it worth to be analyzed. I hope there are no such optimizations in JIT
> today. If you know one we can proceed and check it: it may lead to
> additional improvements in ABCD algorithm.

I think that this is indeed the case.  I'll look into it and get back  
to you.


> -- 
> Mikhail Fursov

View raw message