From mboxrd@z Thu Jan  1 00:00:00 1970
From: Ingo Krabbe <ikrabbe@earthling.net>
To: Ben Kohlen <bckohlen@yahoo.com>
Cc: <gcc-help@gcc.gnu.org>
Subject: Re: bug?
Date: Sun, 17 Jun 2001 02:55:00 -0000
Message-id: <Pine.LNX.4.33.0106171126410.15550-100000@flathead.burg.de>
References: <20010615225730.76865.qmail@web11001.mail.yahoo.com>
X-SW-Source: 2001-06/msg00121.html

On Fri, 15 Jun 2001, Ben Kohlen wrote:

> I am expecting that when I shift right, I will always
> get zeroes in from the left, but when I use data types
> less than 32 bits, this is not always the case.
>
> Example:
> ...
> unsigned short s = 0xcc55;
> printf("%x\n", (s<<8)>>8);
> ...
> yeilds the output "cc55" where as I was expecting
> "55".
>

I don't think thats a bug, it is more a question of flavour, of course
it would be very nice to fill 0 into the upper bits. It may be better to
mask them out:
#define CLEAR_UPPER_BITS(n,x) \
	((n<sizeof(x)*8) ? x&(~((~(x^x))<<(8*sizeof(x)-n))):0)

This is machine and (numeric) type independent masking out of n upper
bits. For smaller types we can use a 0 instead of x^x. There may be a more
optimized solution ? We can also give a 0 in the right length to the
algorithm:
#define CLEAR_UPPER_BITS(n,x,null) \
	((n<sizeof(x)*8) ? x&(~((~(null))<<(8*sizeof(x)-n))):0)

Has anyone a better solution ?

CU INGO