On 4/17/07, Maksim Ananjev <[EMAIL PROTECTED]> wrote:
Hi!
I tried to apply new ABCD optimization path to the following code:
int[] array = new int[10];
int l = array.length;
for(int i =0; i<l; i++)
{
array[i] = i;
}
However the bounds check on the assignment inside the loop was not
eliminated.
I used the patches from here:
https://issues.apache.org/jira/browse/HARMONY-1788
I unzipped files in vm.zip and added them in
jitrino/src/optimizer/abcd/ folder. Then I applied
abcd_update_1_full.patch. Then I added "classic_abcd" to opt.emconf
But according to log file upper bound check cannot be proved
redundant. That's strange because this case looks rather obvious.
May be I did something wrong in applying the patch? Or ABCD really
cannot deal with such case?
IMHO it must. I'm going to check it tomorrow. I know that new ABCD
implementation does give performance improvement in comparison with old one
so it should deal with cases like this.
--
Mikhail Fursov
