**2.62编写一个函数int_shifts_are_logical(),在对int类型的数使用算术右移的机器上运行时,这个函数生成1,而其他情况下生成0。你的代码应该可以运行在任何字长的机器上。在几种机器上测试你的代码。
答:
int int_shifts_are_logical(void){
//求bit位
int i=sizeof(int)-1;
int res=-1>>i;
return res!=1;
}
答:
int sra(int x, int k){
/*Perform shift logically */
int xsrl = (unsigned) x >>k;
//用逻辑右移实现算术右移
if(x>0){
return xsrl;
}else{
int size = (sizeof(int)<<3)-k;
return (int)(xsrl|(-1<<size));
}
}
unsigned sr1(unsigned x,int k){
/* Perform shift arithmetically */
unsigned xsra = (int) x >>k;
//算术右移实现逻辑右移
if((int)x>0){
return xsra;
}else{
int size = (sizeof(int)<<3)-k;
return (unsigned)(xsra&(~(-1<<size)));
}
}
答:
/* Return 1 when any even bit of x equals 1; 0 otherwise.
Assune w=32*/
int any_even_one(unsigned x){
return (x&0xaaaaaaaa)!=0;
}
答:
/* Return 1 when x contains an even number of 1s; 0 otherwise.
Assume w=32*/
int even_ones(unsigned x) {
x^=x>>16;
x^=x>>8;
x^=x>>4;
x^=x>>2;
x^=x>>1;
return (x&0x1)!=1;
}
答:
/*
* Generate mask indicating' leftmost 1 in x. Assume w=32.* For example OxFFO0 ->0x8000,and ox6600 -->0x4000.tIf x=0, then return 0.
*/
int leftmost_one(unsigned x){
x|=x>>1;
x|=x>>2;
x|=x>>4;
x|=x>>8;
x|=x>>16;
unsigned mask=x;
return ~(mask>>1)&x;
}