Re: eliminating array bounds checking overhead

IBM has published some material their Java implementation - how
they eliminate the checks in many cases. Often you can break a
loop up into subranges where only some subranges require explicit
checking. I can't remember where it was - maybe in IEEE Software.


The GCC compiler is having smart pointers added to it, and they
are working on optimising the boudns checks aways when possible.


Tim Josling
[Midkiff, Moreira, and Snir, "Optimizing array reference checking in
Java Programs", IBM Systems Journal 37:3, 1998, pp. 409-453. Nothing
exotic, hoisting bounds checks out of do loops, breaking the loops
into subranges to get invariants they can optimize, but the results
show that it's very effective. The entire issus 39:1 is on Java
Performance, they have an article in there too but it doesn't say
anything more about bounds checking. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.