#include #include #include #include using namespace std; // Get access to internal bytes of larger datatypes union int_bytes { int val; unsigned char bytes[sizeof(int)]; // exact overlay of int } iData; // ------------------------------------------------------ int soi = sizeof(int); void iShowHex(int* intp) { cout << "0x"; iData.val = *intp; for (int i=0; i < soi; i++) { printf("%02X ", iData.bytes[soi-i-1]); /* ...largest byte (left) * is highest byte of * memory in little- * endian systems. * Values are stored UP * the heap; you have to * address in REVERSE. */ } } int main() { // Show internal INT structure // -------------------------------------- int* intp = (int *)malloc(soi); if(intp) { *intp=1025; iShowHex(intp); printf("<- Int: %d\n", *intp); free(intp); } else { cout << "Problem allocating int."< way%c.\n", iData.val, char(166)); cout << "\nThe memory heap is said to grow 'up' (low->high). It's copy-efficient (forward through vars is always increasing), ex:" << endl; printf("\n char(1025)==?...%d // first byte\n\n", char(1025)); cout << char(166)<<" Historically, NETWORK protocol byte order is BIG-endian."; return 0; }

Hardware byte order (integers)