[LLVMdev] llvm-java

Nicolas Geoffray nicolas.geoffray at lip6.fr
Mon May 18 10:15:09 PDT 2009

Andrew Haley wrote:
> Right, so that part should be trivial.  So, does the array bounds check
> elimination already work?    If it does, that will considerably reduce
> the work that Andre needs to do.  To say the least...

Trivial bounds check elimination already work, such as tab[2] = 1; 
tab[1] = 2 (the second affectation won't have a bounds checks). Although 
I don't know the details,  I believe Andre also targets less trivial 


> Andrew.
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev

More information about the llvm-dev mailing list