实验二 —— 位运算

本次实验是通过限制的操作符来实现位运算，有助于进一步理解数据位级的表示和运算。

10个小函数的具体实现如下：

/* 
 * 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); //由命题逻辑得：~(~x | ~y) = x & y

}



/* 
 * bitOr - x|y using only ~ and & 
 *   Example: bitOr(6, 5) = 7
 *   Legal ops: ~ &
 *   Max ops: 8
 *   Rating: 1
 */
int bitOr(int x, int y) {

    return ~(~x & ~y);   //由命题逻辑得：~(~x & ~y) = x | y

}


/*
 * isZero - returns 1 if x == 0, and 0 otherwise 
 *   Examples: isZero(5) = 0, isZero(0) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 2
 *   Rating: 1
 */
int isZero(int x) {

    return !x;      //!是逻辑反

}


/* 
 * minusOne - return a value of -1 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 2
 *   Rating: 1
 */
int minusOne(void) {

    return ~0; //-1的补码表示是0xFFFFFFFF,按位取反就是0x00000000

}


/* 
 * TMax - return maximum two's complement integer 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
int tmax(void) {
    //32位补码最大是0x7FFFFFFF,取反就是0x80000000
    return ~(1<<31);

}


/* 
 * bitXor - x^y using only ~ and & 
 *   Example: bitXor(4, 5) = 1
 *   Legal ops: ~ &
 *   Max ops: 14
 *   Rating: 2
 */
int bitXor(int x, int y) {
    //x^y = ((x & ~y) | (~x & y)) = ~~((x & ~y) | (~x & y)) = ~((~(x & ~y)) & (~(~x & y)))
    return ~((~(x & ~y)) & (~(~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) {
    //将数据x右移，再通过0xFF截取出所求的byte
    return (x>>(n<<3)) & 0xFF;

}


/* 
 * isEqual - return 1 if x == y, and 0 otherwise 
 *   Examples: isEqual(5,5) = 1, isEqual(4,5) = 0
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
int isEqual(int x, int y) {
//异或操作，若两个数一样，则会得到结果0.
    return !(x^y);

}


/* 
 * negate - return -x 
 *   Example: negate(1) = -1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
int negate(int 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) {
    //取最高位，是1则代表是负数
    return !((x>>31)&1 | !x);
}

最后的评测结果如下：