[PATCH] fixing SSE detection in solid

[Friedrich W. H. Kossebau]

Am Freitag, 8. Februar 2008, um 18:06 Uhr, schrieb Thiago Macieira:
> On Friday 08 February 2008 17:20:08 Friedrich W. H. Kossebau wrote:
> > Am Freitag, 8. Februar 2008, um 15:10 Uhr, schrieb Thiago Macieira:
> > > On Friday 08 February 2008 07:27:52 Tobias Koenig wrote:
> > > > Hmm isn't msb the bit that represents 2^0? You see I'm not good at
> > > > binary level ;)
> > >
> > > MSB = Most significant bit.
> >
> > As in: the bit which makes the greatest change in the value if swapped.
> >
> > > 2^0 is always LSB (Least significant bit).
> >
> > As in: the bit which makes the smallest change.
> >
> > > Little-endian == LSB-first or LSB left or left-to-right
> > > Big-endian == MSB-first or MSB left or right-to-left (like our normal
> > > numbers)
> >
> > You mixed up bytes and bits ;)
>
> No, I didn't. The only thing is that you only get access to the bits by the
> byteful. So you never know how the memory arranges them. :-)

Too true :) Seems I didn't, or was taught wrongly.

But then, while you teach me better:
What about bitshifts? Does the compiler also adapt the direction of the 
command? I suppose it is already defined in terms of MSB and LSB, with MSB 
being left to the LSB by definition? (I guess it works this way as I am on a 
Little-Endian machine and it works :)
So no IF ELSE ENDIF needed?

Thanks for some education :)
Friedrich