CS:APP2e Data Lab

/*
 * 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 an integer by more
     than the word size.
 
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 implent 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 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 operators (! ~ & ^ | + << >>)
     that you are allowed to use for your implementation of the function.
     The max operator count is checked by dlc. Note that '=' 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
/*
 * bitAnd - x&y using only ~ and |
 *   Example: bitAnd(6, 5) = 4
 *   Legal ops: ~ |
 *   Max ops: 8
 *   Rating: 1
 */
int bitAnd(int x, int y) {
  return ~(~x | ~y);
}
 
 
/*
 * getByte - Extract byte n from word x
 *   Bytes numbered from 0 (LSB) to 3 (MSB)
 *   Examples: getByte(0x12345678,1) = 0x56
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 6
 *   Rating: 2
 */
int getByte(int x, int n) { // 右移相应位数后取出
  return (x >> (n << 3)) & 0xFF;
}
/*
 * logicalShift - shift x to the right by n, using a logical shift
 *   Can assume that 0 <= n <= 31
 *   Examples: logicalShift(0x87654321,4) = 0x08765432
 *   Legal ops: ~ & ^ | + << >>
 *   Max ops: 20
 *   Rating: 3
 */
int logicalShift(int x, int n) { // 把符号位分离出来移位
  return ((x & ((1 << 31) + (~1) + 1)) >> n) + ((((x & (1 << 31)) >> 31) & 1) << (31 + ((~n) + 1)));
}
/*
 * bitCount - returns count of number of 1's in word
 *   Examples: bitCount(5) = 2, bitCount(7) = 3
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 40
 *   Rating: 4
 */
int bitCount(int x) { // 答案为每一位的和，每次让相邻两数相加，只需相加5次
  int _n1 = (0x55 << 8) + 0x55;
  int n1 = (_n1 << 16) + _n1;
  int _n2 = (0x33 << 8) + 0x33;
  int n2 = (_n2 << 16) + _n2;
  int _n3 = (0x0F << 8) + 0x0F;
  int n3 = (_n3 << 16) + _n3;
  int n4 = (0xFF << 16) + 0xFF;
  int x1 = ((x >> 1) & n1) + (x & n1); // 一位一位相加
  int x2 = ((x1 >> 2) & n2) + (x1 & n2); // 两位两位相加
  int x3 = ((x2 >> 4) & n3) + (x2 & n3); // 四位四位相加
  int x4 = ((x3 >> 8) & n4) + (x3 & n4);
  int x5 = (x4 >> 16) + x4;
  return x5 & 0xFF;
}
/*
 * bang - Compute !x without using !
 *   Examples: bang(3) = 0, bang(0) = 1
 *   Legal ops: ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 4
 */
int bang(int x) { // 答案为每一位的与，每次让前半部分与后半部分作与，只需5次与运算
  int a1 = ~x;
  int a2 = a1 & (a1 >> 16); // 前十六位与后十六位作与
  int a3 = a2 & (a2 >> 8); // 有效部分的前八位与后八位作与
  int a4 = a3 & (a3 >> 4);
  int a5 = a4 & (a4 >> 2);
  int a6 = a5 & (a5 >> 1);
  return a6 & 1;
}
/*
 * tmin - return minimum two's complement integer
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
int tmin(void) {
  return 1 << 31;
}
/*
 * fitsBits - return 1 if x can be represented as an
 *  n-bit, two's complement integer.
 *   1 <= n <= 32
 *   Examples: fitsBits(5,3) = 0, fitsBits(-4,3) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 15
 *   Rating: 2
 */
int fitsBits(int x, int n) { // 通过加法把补码x映射到n位无符号整型，判断是否在n位以内
  int minus1 = (~1) + 1;
  int y = x + (1 << (n + minus1));
  return !((y & ((((1 << (n + minus1)) + minus1) << 1) + 1)) + (~y) + 1); // 实现(y&(2^n-1))-y
}
/*
 * divpwr2 - Compute x/(2^n), for 0 <= n <= 30
 *  Round toward zero
 *   Examples: divpwr2(15,1) = 7, divpwr2(-33,4) = -2
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 15
 *   Rating: 2
 */
int divpwr2(int x, int n) { // 要求正数向下取证、负数向上取整，x为负数时加上除数减一，即2^n-1后作除法
    int a = ((x & (1 << 31)) >> 31) & 1;
    return (x + (a << n) + (~a) + 1) >> n;
}
/*
 * negate - return -x
 *   Example: negate(1) = -1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
int negate(int x) { // x+(~x)=-1 => -x=(~x)+1
  return (~x) + 1;
}
/*
 * isPositive - return 1 if x > 0, return 0 otherwise
 *   Example: isPositive(-1) = 0.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 8
 *   Rating: 3
 */
int isPositive(int x) { // x满足x>=0和x-1>=0即为正数
  return !(((x >> 31) | ((x + (~1) + 1) >> 31)) & 1);
}
/*
 * isLessOrEqual - if x <= y  then return 1, else return 0
 *   Example: isLessOrEqual(4,5) = 1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 24
 *   Rating: 3
 */
int isLessOrEqual(int x, int y) { // x和y同号时，y-x不会超出32位正数范围，判断y-x>=0；x和y异号时，符号位为0的数较大
  int a = ((x ^ y) >> 31) & 1;
  int b = y + (~x) + 1;
  return (a & ((x >> 31) & 1)) | (!a & !(b >> 31));
}
/*
 * ilog2 - return floor(log base 2 of x), where x > 0
 *   Example: ilog2(16) = 4
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 90
 *   Rating: 4
 */
int ilog2(int x) { // 答案为最高位1的位置，用倍增的思想，依次右移16、8、4、2、1位（如果移位后不为0）
  int g4 = !!(x >> 16);
  int x1 = x >> (g4 << 4);
  int g3 = !!(x1 >> 8);
  int x2 = x1 >> (g3 << 3);
  int g2 = !!(x2 >> 4);
  int x3 = x2 >> (g2 << 2);
  int g1 = !!(x3 >> 2);
  int x4 = x3 >> (g1 << 1);
  int g0 = !!(x4 >> 1);
  return (g4 << 4) + (g3 << 3) + (g2 << 2) + (g1 << 1) + g0;
}
/*
 * float_neg - Return bit-level equivalent of expression -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 representations of
 *   single-precision floating point values.
 *   When argument is NaN, return argument.
 *   Legal ops: Any integer/unsigned operations incl. ||, &&. also if, while
 *   Max ops: 10
 *   Rating: 2
 */
unsigned float_neg(unsigned uf) { // 浮点数不为NaN时改变最高位
  if (!((((uf >> 23) + 1) & 0xFF)) && (uf & ((1 << 23) - 1))) return uf; // 判断浮点数是否为NaN
  return uf ^ (1 << 31);
}
/*
 * float_i2f - Return bit-level equivalent of expression (float) x
 *   Result is returned as unsigned int, but
 *   it is to be interpreted as the bit-level representation of a
 *   single-precision floating point values.
 *   Legal ops: Any integer/unsigned operations incl. ||, &&. also if, while
 *   Max ops: 30
 *   Rating: 4
 */
unsigned float_i2f(int x) {
  int s = x & (1 << 31); // 符号位
  int absx = s ? (~x) + 1 : x; // 把x转化为正数
  int e = 0;
  int m = 0;
  int a = absx;
  int gap;
  int cout = 0;
  int mid;
  int tail;
  if (!x) return 0; // 特殊处理0
  while (a) { // 求位数
    a = (a >> 1) & (~s);
    ++e;
  }
  gap = e - 24;
  if (gap > 0) { // 保留前24位
    mid = 1 << (gap - 1);
    tail = absx & ((1 << gap) - 1);
    if (tail > mid) cout = 1; // 进位
    m = absx >> gap;
    if (tail == mid) cout = m & 1; // 进位
  }
  else
    m = absx << -gap;
  e = (e + 126) << 23;
  m &= (1 << 23) - 1;
  return (s | e | m) + cout;
}
/*
 * float_twice - 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 float_twice(unsigned uf) { //浮点数为规范时令阶码加1
  int e = (uf >> 23) & 0xFF;
  int M = (1 << 23) - 1;
  int m = uf & M;
  if (!((e - 0xFF) && (uf << 1))) return uf; // 判断NaN/INF/0
  if (!e && m) return (uf & ~M) | ((m << 1) & M) | (((uf >> 22) & 1) << 23); // 判断非规范数
  return (uf & (1 << 31)) | ((e + 1) << 23) | m;
}