Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
C++
BITWISE SHIFT question
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="noone, post: 2554437"] In the embedded world we are frequently concerned with endian issues. On a big endian machine numbers are stored as god intended, highest order bits in lowest ordered memory. Then Intel goes and pucks up everything by making the 80x86 platform little endian so that the least significant bits come first. On some architectures it is even more archaic: 32 bit integer representation on a 16 bit micro-controller. Some of them split the number into 16 bit words and swap the bytes within those words...so, it's not as cut and dry and I would ask anyone looking for information about bits to give me the bit numbers on a scale 2^n n=[0..z]. My headache with this issue currently is that some morons designed a robotics messaging protocol based on a little endian format and we must design code that works on both big and little endian machines. I cannot even use bitfields in my structs to pull the data because the protocol violates network byte ordering of ethernet. I have to code friggin accessor functions for every stinking field in every stinking type of message I want to support...talk about archaic! [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
C++
BITWISE SHIFT question
Top