CSAPP 实验一 Data Lab

从寒假到现在,终于看完了前两章.于是,马不停蹄的开始了第一个实验Data Lab,但是我感觉真的好难…(是我太菜),但是还是学习到很多东西,理解了很多位操作和一些技巧.
bits.c代码 其中添加了很多注释,也劝大家一定要写注释标明自己的思路,要不然,写完后根本看不懂自己的代码:(

/* 
 * CS:APP Data Lab 
 * 
 * <Please put your name and userid here>
 * 
 * bits.c - Source file with your solutions to the Lab.
 *          This is the file you will hand in to your instructor.
 *
 * WARNING: Do not include the <stdio.h> header; it confuses the dlc
 * compiler. You can still use printf for debugging without including
 * <stdio.h>, although you might get a compiler warning. In general,
 * it's not good practice to ignore compiler warnings, but in this
 * case it's OK.  
 */

#if 0
/*
 * Instructions to Students:
 *
 * STEP 1: Read the following instructions carefully.
 */

You will provide your solution to the Data Lab by editing the collection of functions in this source file.

INTEGER CODING RULES:
 
  Replace the "return" statement in each function with one
  or more lines of C code that implements the function. Your code 
  must conform to the following style:
 
  int Funct(arg1, arg2, ...) {
      /* brief description of how your implementation works */
      int var1 = Expr1;
      ...
      int varM = ExprM;

      varJ = ExprJ;
      ...
      varN = ExprN;
      return ExprR;
  }

  Each "Expr" is an expression using ONLY the following:
  1. Integer constants 0 through 255 (0xFF), inclusive. You are
      not allowed to use big constants such as 0xffffffff.
  2. Function arguments and local variables (no global variables).
  3. Unary integer operations ! ~
  4. Binary integer operations & ^ | + << >>
    
  Some of the problems restrict the set of allowed operators even further.
  Each "Expr" may consist of multiple operators. You are not restricted to
  one operator per line.

  You are expressly forbidden to:
  1. Use any control constructs such as if, do, while, for, switch, etc.
  2. Define or use any macros.
  3. Define any additional functions in this file.
  4. Call any functions.
  5. Use any other operations, such as &&, ||, -, or ?:
  6. Use any form of casting.
  7. Use any data type other than int.  This implies that you
     cannot use arrays, structs, or unions.

 
  You may assume that your machine:
  1. Uses 2s complement, 32-bit representations of integers.
  2. Performs right shifts arithmetically.
  3. Has unpredictable behavior when shifting if the shift amount
     is less than 0 or greater than 31.


EXAMPLES OF ACCEPTABLE CODING STYLE:
  /*
   * pow2plus1 - returns 2^x + 1, where 0 <= x <= 31
   */
  int pow2plus1(int x) {
     /* exploit ability of shifts to compute powers of 2 */
     return (1 << x) + 1;
  }

  /*
   * pow2plus4 - returns 2^x + 4, where 0 <= x <= 31
   */
  int pow2plus4(int x) {
     /* exploit ability of shifts to compute powers of 2 */
     int result = (1 << x);
     result += 4;
     return result;
  }

FLOATING POINT CODING RULES

For the problems that require you to implement floating-point operations,
the coding rules are less strict.  You are allowed to use looping and
conditional control.  You are allowed to use both ints and unsigneds.
You can use arbitrary integer and unsigned constants. You can use any arithmetic,
logical, or comparison operations on int or unsigned data.

You are expressly forbidden to:
  1. Define or use any macros.
  2. Define any additional functions in this file.
  3. Call any functions.
  4. Use any form of casting.
  5. Use any data type other than int or unsigned.  This means that you
     cannot use arrays, structs, or unions.
  6. Use any floating point data types, operations, or constants.


NOTES:
  1. Use the dlc (data lab checker) compiler (described in the handout) to 
     check the legality of your solutions.
  2. Each function has a maximum number of operations (integer, logical,
     or comparison) that you are allowed to use for your implementation
     of the function.  The max operator count is checked by dlc.
     Note that assignment ('=') is not counted; you may use as many of
     these as you want without penalty.
  3. Use the btest test harness to check your functions for correctness.
  4. Use the BDD checker to formally verify your functions
  5. The maximum number of ops for each function is given in the
     header comment for each function. If there are any inconsistencies 
     between the maximum ops in the writeup and in this file, consider
     this file the authoritative source.

/*
 * STEP 2: Modify the following functions according the coding rules.
 * 
 *   IMPORTANT. TO AVOID GRADING SURPRISES:
 *   1. Use the dlc compiler to check that your solutions conform
 *      to the coding rules.
 *   2. Use the BDD checker to formally verify that your solutions produce 
 *      the correct answers.
 */


#endif
//1
/* 
 * bitXor - x^y using only ~ and & 
 *   Example: bitXor(4, 5) = 1
 *   Legal ops: ~ &
 *   Max Ops.: 14
 *   Rating: 1
 */
/*
 * 根据异或表达式 a^b=(!a&b)|(a&!b)=!(!(!a&b)&!(a&!b))
 */
int bitXor(int x, int y) {
  int a=~x&y;
  int b=x&~y;
  int res=~(~a & ~b);
  return res;
}
/* 
 * tmin - return minimum two's complement integer 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
/*
 *因为int为32位二进制补码表示,所以TMIN=1<<31
 */
int tmin(void) {
  return 1<<31;
}
//2
/*
 * isTmax - returns 1 if x is the maximum, two's complement number,
 *     and 0 otherwise 
 *   Legal ops: ! ~ & ^ | +
 *   Max ops: 10
 *   Rating: 1
 */
/*
 * ~取反  &与  |或  ^异或  位运算
 * !非 逻辑运算s
 * Tmin=Tmax+1
 * Tmin=~Tmax
 * ~x^(x+1)==0代表x为Tmax
 * (-1为特例) 当x=-1时,~(x)=0 当x!=-1时,~(x)!=0 
 *因此 总得表达式为 !!(~x)&!(~x^(x+1))
 */
int isTmax(int x) {
  return !!(~x)&!(~x^(x+1));
}
/* 
 * allOddBits - return 1 if all odd-numbered bits in word set to 1
 *   where bits are numbered from 0 (least significant) to 31 (most significant)
 *   Examples allOddBits(0xFFFFFFFD) = 0, allOddBits(0xAAAAAAAA) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 2
 */
/*
 *题意:如果x的二进制编码中所有奇数位都设置为1,则返回1
 *构造出temp=0x55555555
 *如果temp|x 全为1则满足条件
 */
 //0xfffffffe
int allOddBits(int x) {
  int temp=0xAA;
  temp=temp+(temp<<8);//temp=0xAAAA
  temp=temp+(temp<<16);//temp=0xAAAAAAAA
  temp=~temp;//temp=0x55555555 是~不是!
  return !((temp|x)+1);
}
/* 
 * negate - return -x 
 *   Example: negate(1) = -1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
/*
 * 求相反数 -x=~x+1
 */
int negate(int x) {
  return ~x+1;
}
//3
/* 
 * isAsciiDigit - return 1 if 0x30 <= x <= 0x39 (ASCII codes for characters '0' to '9')
 *   Example: isAsciiDigit(0x35) = 1.
 *            isAsciiDigit(0x3a) = 0.
 *            isAsciiDigit(0x05) = 0.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 15
 *   Rating: 3
 */
 /* 判断是否为Ascii码
  * x-0x30>=0 最高位为0
  * x-0x3A<0 最高位为1
  * int a=(x+(~0x30+1))&Tmin 取出最高位 
  * int b=(x+(~0x3A+1))&Tmin 取出最高位 
  * a=0 b=Tmin 符合情况 return 1
  * else return 0
  */
int isAsciiDigit(int x) {
  int Tmin=(1<<31);
  int a=(x+(~0x30+1))&Tmin;
  int b=(x+(~0x3A+1))&Tmin;
  return !a&!!b;
}
/* 
 * conditional - same as x ? y : z 
 *   Example: conditional(2,4,5) = 4
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 16
 *   Rating: 3
 */
 /* 三目运算符 a?b:c
  * a为真 返回b 否则返回c 
  * x为0时 返回z x!=0时 返回y
  * -1为0xFFFFFFFF -1+1=0 
  */
int conditional(int x, int y, int z) {
  int temp=~1+1;//temp=-1;
  return ((!x+temp)&y)+((!!x+temp)&z);
}
/* 
 * isLessOrEqual - if x <= y  then return 1, else return 0 
 *   Example: isLessOrEqual(4,5) = 1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 24
 *   Rating: 3
 */
 /* 比较大小 
  *  int temp=y-x
  * temp=temp&Tmin 取最高位
  * if(x<=y) temp=0 return 1
  * x>y temp=Tmin return 0
  * 此前想法 溢出时会无法处理
  * 还是基于y-x
  * 分为两种情况:同号和异号
  * 如果同号&(y-x的符号位==0) 则返回1
  * 如果异号&(x符号位为1) 则返回1
  */
int isLessOrEqual(int x, int y) {
  int xsign=(x>>31)&0x01;//获得x符号位 0 1
  int ysign=(y>>31)&0x01;//获得y符号位 0 1
  int temp=y+(~x+1);//temp=y-x
  temp=(temp>>31)&0x01;//得到y-x的符号位 temp为0或1
  int samesign=!(xsign^ysign);//如果x y同号 返回1 x y异号 返回0
  return (samesign&!temp)|((!samesign)&xsign);
}
//4
/* 
 * logicalNeg - implement the ! operator, using all of 
 *              the legal operators except !
 *   Examples: logicalNeg(3) = 0, logicalNeg(0) = 1
 *   Legal ops: ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 4 
 */
 /* 实现逻辑非的功能
  * 当x为0时return 1 x非0时return 0
  * 当x为0时,-x也是0,两个符号位都是0 但是当x不为0时,x和-x两个符号位必有一个是1
  * 
  */
int logicalNeg(int x) {
   return ((x|(~x+1))>>31)+1;//这里的右移是算术右移
}
/* howManyBits - return the minimum number of bits required to represent x in
 *             two's complement
 *  Examples: howManyBits(12) = 5
 *            howManyBits(298) = 10
 *            howManyBits(-5) = 4
 *            howManyBits(0)  = 1
 *            howManyBits(-1) = 1
 *            howManyBits(0x80000000) = 32
 *  Legal ops: ! ~ & ^ | + << >>
 *  Max ops: 90
 *  Rating: 4
 */
 /* 
   计算在二进制补码中,表示x需要的最少位数 注意符号位
   很好的二分思路 值得学习
  */
int howManyBits(int x) {
  int sign=x>>31;//符号位算术右移 如果符号位为0 则sign=0 如果符号位为1,则sign=-1(0xFFFF)
  x = (sign&~x)|(~sign&x);//如果x为正则不变，否则按位取反（这样好找最高位为1的，原来是最高位为0的，这样也将符号位去掉了）
  int cnt16=!!(x>>16)<<4;//如果高16位存在1,则cnt16=16,否则cnt16=0
  x=(x>>cnt16);//如果高16位存在1 则将x右移16位,否则不移动
  int cnt8=!!(x>>8)<<3; //剩余位的高8位是否是否存在1 如果存在 cnt8=8 否则cnt8=0;
  x=(x>>cnt8);
  int cnt4=!!(x>>4)<<2;//剩余位的高4位
  x=(x>>cnt4);
  int cnt2=!!(x>>2)<<1;//剩余位的高2位
  x=(x>>cnt2);
  int cnt1=!!(x>>1);//剩余位的高一位
  x=(x>>cnt1);
  int cnt0=x;//最后一位
  return cnt16+cnt8+cnt4+cnt2+cnt1+cnt0+1;//+1表示符号位
}
//float
/* 
 * floatScale2 - Return bit-level equivalent of expression 2*f for
 *   floating point argument f.
 *   Both the argument and result are passed as unsigned int's, but
 *   they are to be interpreted as the bit-level representation of
 *   single-precision floating point values.
 *   When argument is NaN, return argument
 *   Legal ops: Any integer/unsigned operations incl. ||, &&. also if, while
 *   Max ops: 30
 *   Rating: 4
 */
unsigned floatScale2(unsigned uf) {
  int bias=127;
  unsigned exp = uf & 0x7f800000;//阶码
  unsigned sign = uf & 0x80000000;//符号位
  unsigned frac = uf & 0x007fffff;//小数
  if(exp==0) return uf<<1|sign;//非规格化
  if(exp==0x7f800000) return uf;//NAN和无穷大
  //*2相当于阶码+1
  exp+=(1<<23);
  if(exp==0x7f800000) frac=0;
  return sign|exp|frac;
}
/* 
 * floatFloat2Int - Return bit-level equivalent of expression (int) f
 *   for floating point argument f.
 *   Argument is passed as unsigned int, but
 *   it is to be interpreted as the bit-level representation of a
 *   single-precision floating point value.
 *   Anything out of range (including NaN and infinity) should return
 *   0x80000000u.
 *   Legal ops: Any integer/unsigned operations incl. ||, &&. also if, while
 *   Max ops: 30
 *   Rating: 4
 */
int floatFloat2Int(unsigned uf) {
    int sign = uf >> 31, exp = ((uf >> 23) & 0xff) - 127, frac = (uf & 0x007fffff) | 0x00800000, value = 0;
    if (exp < 0)
        return 0;
    if (exp > 30)
        return 0x80000000;
    if (exp < 23)
        value = frac >> (23 - exp);
    else if (exp > 23)
        value = frac << (exp - 23);
    return sign ? -value : value;
}
/* 
 * floatPower2 - Return bit-level equivalent of the expression 2.0^x
 *   (2.0 raised to the power x) for any 32-bit integer x.
 *
 *   The unsigned value that is returned should have the identical bit
 *   representation as the single-precision floating-point number 2.0^x.
 *   If the result is too small to be represented as a denorm, return
 *   0. If too large, return +INF.
 * 
 *   Legal ops: Any integer/unsigned operations incl. ||, &&. Also if, while 
 *   Max ops: 30 
 *   Rating: 4
 */
unsigned floatPower2(int x) {
    if (x < -149)
        return 0;
    // denorm
    if (x < -126)
        return 1 << (149 + x);
    // norm
    if (x < 128)
        return (x + 127) << 23;
    // inf
    return 0x7f800000;
}