CS:APP 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) {
  int result=~(~x|~y);
  return result;
}
//思路：利用表达式运算规则将&转化为~和|
/* 
 * 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) {
	int result;
	n=n<<3;
	result=(x>>n)&0xFF;
	return result;
}
//思路：输入的n相当于让x左移8*n位并取最低八位（十六进制情况下是最低2位）。
/* 
 * 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) {
	int y=~((1<<31)>>n);
	y=y+y+1;
	return (x>>n)&y;
}
/*思路：由于x为有符号整型，所以我们在将其右移时候高位会补符号位。
故我们仅需将x算术右移的结果的补位全变为0即可。*/
/*
 * 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) {
//
  int _mask1 = (0x55)|(0x55<<8);
  int _mask2 = (0x33)|(0x33<<8);
  int _mask3 = (0x0f)|(0x0f<<8);
  int mask1 = _mask1|(_mask1<<16);
  int mask2 = _mask2|(_mask2<<16);
  int mask3 = _mask3|(_mask3<<16);
  int mask4 = (0xff)|(0xff<<16);
  int mask5 = (0xff)|(0xff<<8);

  int ans = (x & mask1) + ((x>>1) & mask1);
  ans = (ans & mask2) + ((ans>>2) & mask2);
  ans = (ans & mask3) + ((ans>>4) & mask3);
  ans = (ans & mask4) + ((ans>>8) & mask4);
  ans = (ans & mask5) + ((ans>>16) & mask5);

  return ans;
}
/*思路：分治思想，我们利用mark1、mark2、mark3、mark4、mark5
将x中的1集中起来进行累加。*/
/* 
 * bang - Compute !x without using !
 *   Examples: bang(3) = 0, bang(0) = 1
 *   Legal ops: ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 4 
 */
int bang(int x) {
	return ((x|(~x+1))>>31)+1;
}
/*思路：只有0的标志位在取负前为0，取负后也为0，
所以将x与-x按位或的结果右移31位，此时除了x=0的情况下该结果为0，其余情况均为全1，将该结果加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) {
	int y=(x<<(33+(~n)))>>(33+(~n));
	return !(x^y);
}
/*思路：若x可以被n位的二进制补码数表示，
则正常情况下的x（32位补码）中标志位与最低的n-1位之间一定全为标志位。
故x（32位）左移32-n位再右移32-n后，此时
x的值不应发生改变。*/
/* 
 * 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) {
//
  return (x+(((x>>31)&1)<<n)+(~0)+(!((x>>31)&1)))>>n;
}
/*思路：直接右移的n位的结果为向下取整，而题目中要求的是向0取整。
当x为正数时，自然不会有什么问题；
当x为负数时，按照老师说讲的，我们将x加上一个2^n-1即可达到右移后结果为向0取整。*/
/* 
 * negate - return -x 
 *   Example: negate(1) = -1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
int negate(int x) {
  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) {
	return !((!(x&(~x+1)))|(x>>31));
}
/*思路：利用x&（~x+1）来区分出0，因为只有当x不为0时，
x&（~x+1）的结果才不为0；利用x>>31来区分出小于0的数。
自由大于0的数同时不满足|两边的等式，使得！（……）=！0=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) {
	int recordx=(x>>31)&1;
	int recordy=(y>>31)&1;
	int z=((y+(~x)+1)>>31)&1;
	return ((!(recordx^recordy))&(!z))| (((recordx^recordy))&recordx);
}
/*思路：当y、x同号时判断y-x符号位；
当y、x异号时可能会发生溢出，此时需看y、x的符号位。*/
/*
 * 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) {
//
	int sign,shift1,shift2,shift3,shift4,shift5;
  	sign=!!(x>>16); 
  	shift1=sign<<4;
	x=x>>shift1; 
	
	sign=!!(x>>8);
	shift2=sign<<3;
	x=x>>shift2; 
	
	sign=!!(x>>4);
	shift3=sign<<2;
	x=x>>shift3; 
	
	sign=!!(x>>2);
	shift4=sign<<1;
	x=x>>shift4;
	
	sign=!!(x>>1);
	shift5=sign; 
	
	return shift1+shift2+shift3+shift4+shift5;
}
//思路：返回最高位1的位
/* 
 * 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) {
	int fu=uf;
	unsigned E=~((fu<<1)>>24);
	unsigned M=!(fu<<9);
	unsigned int result=(!(E|M)^1);
	uf=uf^(result<<31);
        return uf;
}
/*思路：判断NaN即可，NaN直接返回，其余情况最高位与！异或返回。*/
/* 
 * 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) {
    unsigned ans;
    int tmpx = x;
    int f = 0;
    int delta = 0;
    int tail = 0;
    int E = 0;
    if (x == 0)
        return x;
    if (x == 0x80000000)
        return 0xcf000000;
    ans = x & 0x80000000;
    if (ans)
        tmpx = -x;
    while ((tmpx >> E))
        E++;
    E = E - 1;
    tmpx = tmpx << (31 - E);
    tail = (tmpx >> 8) & 0x007FFFFF;
    f = tmpx & 0xff;
    delta = (f > 128) || ((f == 128) && (tail & 1));
    tail += delta;
    E = E + 127;
    if (tail >> 23) {
        tail = tail & 0x007FFFFF;
        E += 1;
    }
    ans = ans | E << 23 | tail;
    return ans;
}

/* 
 * 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) {
	unsigned s,exp,frac;
	s=(uf>>31)<<31;
	exp=(uf<<1)>>24;
	frac=(uf<<9)>>9;
	if(exp==0&&(!!frac))
	uf=s+(frac<<1);
	else if((exp!=0xff)&&exp)
	uf=uf+(1<<23);
	return uf;
}
//思路：分清规划数与非规划数，还有正负无穷、正负0、NaN。

部分代码参考自：https://blog.csdn.net/qq_40889820/article/details/88831962