csapp1结果

int bitXor(int x, int y) {
  return ~(~(x&~y)&~(~x&y));
}

int tmin(void) {

  return 1<<31;

}
int isTmax(int x) {
  int min=0x1<<31;
  int sum=min+(~0x1+1);
  int flag=sum-x;
  return !flag;
}
int negate(int x) {
  return ~x+1;
}
int isAsciiDigit(int x) {
 int a=x&0xf;
  return ((x>>4==3)&&((a<=9)&&(a>=0)));
}
int conditional(int x, int y, int z) {
x=~(!x)+1;
  
return ((y&(~x))|(z&x));
}
int isLessOrEqual(int x, int y) {
  int flagx = (x >> 31 & 1);
	int flagy = (y >> 31 & 1);
	int notZero = !!(flagx ^ flagy);
	int flag = ~notZero + 1;
	int less = ((x + (~y + 1)) >> 31 & 1);
	return (!(x ^ y)) | ((flag & flagx) | (~flag & less));

}
int logicalNeg(int x) {
 return ((x | (~x + 1)) >> 31) + 1;
}
int howManyBits(int x) {
 int b16,b8,b4,b2,b1,b0;
int sign=x>>31;
x=(sign&(~x)|(~sign&x));
b16=!!(x>>16)<<4;
x=x>>b16;
b8=!!(x>>8)<<3;
x=x>>b8;
b4=!!(x>>4)<<2;
x=x>>b4;
b2=!!(x>>2)<<1;
x=x>>b2;
b1=!!(x>>1);
x=x>>b1;
b0=x;
return b16+b8+b4+b2+b1+b0+1;
}
unsigned floatScale2(unsigned uf) {
  unsigned s = uf & (1 << 31);
	unsigned exp = (uf & 0x7f800000) >> 23;
	unsigned frac = uf & (~0xff800000);

	if(exp == 0) return frac << 1 | s;
	if(exp == 255) return uf;
	exp ++;
	if(exp == 255) return 0x7f800000 | s;
	return s | (exp << 23) | frac;

}
int floatFloat2Int(unsigned uf) {
  int s_=uf>>31;
  int exp_=((uf&0x7f800000)>>23)-127;
int frac_=(uf&0x007fffff)|0x800000;
  if(!(uf&0x7ffffff)) return 0;
  
  if(exp_>31) return 0x80000000;
  if(exp_<0) return 0;

  if(exp_>23) frac_<<=(exp_-23);
  else frac_>>=(23-exp_);
  if(!((frac_>>31)^s_)) return frac_;
else if(frac_>>31) return 0x80000000;
else return ~frac_+1;
  
 
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值