On Saturday 09 November 2013 20:57:24 Sieghard wrote: > > There's no performance gain, there's just no performance _difference_ > between 0-based and arbitrary-based arrays - and there's no need of a "base > register" of any kind. Just have the compiler shift the (imaginary) base > address of the array where the (imaginary) element 0 was, and have it check > the bounds correctly, then you can do index calculations totally without > regard of the starting index. This clever implementation detail was stated > in some book about compiler design I happened to read some time, at about > the eighties of the last cenury of the last millennium, IIRC. > Thanks, I get back to you when the code generator needs to be implemented.
Martin ------------------------------------------------------------------------------ November Webinars for C, C++, Fortran Developers Accelerate application performance with scalable programming models. Explore techniques for threading, error checking, porting, and tuning. Get the most from the latest Intel processors and coprocessors. See abstracts and register http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk _______________________________________________ mseide-msegui-talk mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/mseide-msegui-talk
