Re: Any examples of Byte Ordering Functions

["Martin Dowie" <martin.dowie@btopenworld.com>]

"chris" <spamoff.danx@ntlworld.com> wrote in message
news:muwkb.3583$KA5.30712@newsfep4-glfd.server.ntli.net...
> architectures into account at compile time!  Can I expect the compiler
> (gnat say) to optimise multiplication of modular types by *powers of
> two* to shift lefts (and divisions by powers of two to shift rights)?

You don't need to look up the RM (Annex B.2) wrt the
predefined modular types in package "Interfaces" and there
you will find Shift_Left/Shift_Right/etc routines. These are
defined as "Intrinsic", which means they are "built in" to the
compiler - i.e. it should have a blinking good idea of a good
representation of this on the target h/w.

If you want "shifts" and "adds", just be explicit to the compiler.

Cheers,
Martin