Hi Wes, The point I was trying to argue from an earlier thread is that the most common cases for relocation are: 1. Little endian machine to little endian machine (most likely same machine) 2. big endian machine to big endian machine (most likely same machine) 3. big endian machine to little endian machine or vice versa
The purpose of the metadata would be to make use-cases 1 and 2 possible without byte-swapping. Use case 3 would obviously require byte swapping but for an initial implementation the code could simply indicate that it is not supported. This seems less complex to me than actually implementing any sort of byte-swapping logic while still supporting the widest variety of hardware with the same code for the most common use-cases. Thanks, Micah P.S. If anybody can provide pointers I'd be interested to understand which pieces of the java code make assumptions about little-endianness.
