计算机系统

#include<iostream>

using namespace std;
/*
/* 
 * 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


*/

//1
/* 
 * bitXor - x^y using only ~ and & 
 *   Example: bitXor(4, 5) = 1
 *   Legal ops: ~ &
 *   Max ops: 14
 *   Rating: 1
 */
int bitXor(int x, int y) {
    return ~(~((~x)&y)&(~(x&(~y))));
}
/* 
 * tmin - return minimum two's complement integer 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
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: 2
 */
int isTmax(int x) {
    return !(x^0x7fffffff);
}
/* 
 * allOddBits - return 1 if all odd-numbered bits in word set to 1
 *   Examples allOddBits(0xFFFFFFFD) = 0, allOddBits(0xAAAAAAAA) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 2
 */
int allOddBits(int x) {//与1010....1010  如果奇数位都是一那么 异或1010....1010 为0
    int y = x &( (0xA << 28)| (0xA << 24) | (0xA << 20) | (0xA << 16) | (0xA << 12)| (0xA << 8) | (0xA << 4) | (0xA) )^ (0xA << 28) ^ (0xA << 24) ^ (0xA << 20) ^ (0xA << 16) ^ (0xA << 12) ^ (0xA << 8) ^ (0xA << 4) ^ (0xA);
    return !y;//因为他是平移对称的，所以要平移所以要判断他每一段是不是对称的，所以每段进行与操作，得出的最后8位于10101010进行与然后异或求两次反反
}
/* 
 * negate - return -x 
 *   Example: negate(1) = -1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
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
 */
int isAsciiDigit(int x) {
    /*cout << "//第六位是否为1   -1（32个1）///" << ((x << 26) >> 31) << endl;
    cout << "//第五位是否为1    -1" << ((x << 27) >> 31) << endl;
    cout << "//7-32是否为0      1///" << ((!((x >> 6) ^ 0))) << endl;
    cout << "//取前4位  与 0xA相同则为1"<<!( (x & 15)^10) << endl;
    */


    return !!(((x<<26)>>31)&((x << 27) >> 31)&((!((x>>6)^0)))&(!((!((x & (15))^(10)))+ !((x & (15)) ^ (11)) + !((x & (15)) ^ (12)) + !((x & (15)) ^ (13)) + !((x & (15)) ^ (14)) + !((x & (15)) ^ (15)))));
}
/* 
 * conditional - same as x ? y : z 
 *   Example: conditional(2,4,5) = 4
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 16
 *   Rating: 3
 */

int conditional(int x, int y, int z) {
    return ((((!!(x^0))<<31)>>31)&y) + ((((!(x ^ 0)) << 31) >> 31)&z);
}
/* 
 * 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 a = (!!(x >> 31));
    int b = !!(y >> 31);
    int c = y + (~x + 1);
    return (((!(a^b))&(!(c>>31))))+!!(((a^b))&(a));//符号位相同输出，差值c为1代表x<y成立输出1,符号位不同时候，根据x的符号位输出
}
//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 
 */
int logicalNeg(int x) {//与11.....11异或为0 返回1
    int a = (~x);
    int a1 = a^((7 << 3) | (7 << 6) | (7 << 9) | (7 << 12) | (7 << 15) | (7 << 18) | (7 << 21) | (7 << 24) | (7 << 27) | (7 << 30) | (7));

    return !a1;
}
/* 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
 */
int howManyBits(int x) {
  //二分查找
    int p = x >> 31;
    int y = ((~x)&p) + (x&(~p));
    //若x的符号位是1，则用补码操作
    //printf("%d %d\n",x,y);
    int c1 = !!(y >> 16);//判断是否大于16位，小于的为0，大于的为1
    int d1 = 8 + (c1 << 4);//大于16位的为1100=12，小于16位的100=4
    int c2 = !!(y >> d1);//大于16位的平移24位，小于16位的平移8位，大于24位或8<  <16 为1 ; 16<  <24和   <8为0
    int d2 = d1 + (~3) + (c2 << 3);//多-4，少+4
    int c3 = !!(y >> d2);
    int d3 = d2 + (~1) + (c3 << 2);
    int c4 = !!(y >> d3);
    int d4 = d3 + (~0) + (c4 << 1);
    int c5 = !!(y >> d4);
    int d5 = d4 + c5 + !!y;
    //printf("%d %d %d %d %d %d %d %d %d %d\n",c1,d1,c2,d2,c3,d3,c4,d4,c5,d5);
    return d5;

}
//float
/* 
 * 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 = uf&(1 << 31);//取符号位
        int exp=(uf>>23)&0xff;//取阶码
        int frac=uf&((1<<23)-1);//取尾数
        if((exp^0xff)){//如果阶码部分不为255，表示还没满，就可以右移一位尾数实现*2
            if(!exp){//阶码部分不为0
                frac<<=1;//将尾数左移一位即可
            }else{//如果阶码为0
                exp++;//将阶码加1
                if(exp==255)//所得阶码为255，如果还保留着后面尾数，则表示非数值NaN
                    frac=0;//将尾数设置为0，表示无穷大
            }
        }//省略else情况，即uf为NaN，不需要表示
        return s|(exp<<23)|frac;//整合结果并返回
}
/* 
 * 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 s = x&(1 << 31);//取符号位
    int i=30;//*初始化i为30*
    int exp=(x>>31)?158:0;//初始化exp，如果第32位有数值，则是负数，exp从0开始
    int frac=0;//用来保存尾数
        int delta;//保存精度
        int frac_mask=(1<<23)-1;//frac_mask低23位全1，高9位全0，用来 截尾数
        if(x<<1){//如果x不为0也不为-2^31
            if(x<0)
                x=-x;//x=|x|
            while(!((x>>i)&1))//因为i是30，找到x的开头第一个不为0的位置
                i--;
            exp=i+127;//偏置指数e=E+Bias，Bias=127
            x=x<<(31-i);//舍弃x前面的0
            frac=frac_mask&(x>>8);//frac取尾数（取x的高23位）
            x=x&0xff;//保留x的末8位，将处理的精度
            delta=x>128||((x==128)&&(frac&1));//处理精度，四舍五入，后八位的大于一半128，或者包括前一位，9位大于一半516，则进位
            frac+=delta;//加上精度
            if(frac>>23)
            {//如果尾数溢出，大于23为了
            frac&=frac_mask;//取尾数的后23位
            exp+=1;//产生进位
            }
        }
    return s | (exp << 23) | frac;//返回最后结果

}
/* 
 * float_f2i - 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 float_f2i(unsigned uf) {
    if (!(uf ^ 0))
        return 0;
    int s = uf&(1 << 31);//去符号位
    int frac = (uf&(1 << 23 - 1)) | (1 << 23);//取尾数位，前面补1
    int exp = ((uf >> 23) & 0xff) - 127;//取指数位
    int exp1 = ((uf >> 23) & 0xff);//取指数位
    int x;
    if (exp > 0)
        x = (frac << (exp));
    else
        x = (frac >> -exp);
    if (!(exp1 ^ 0))//阶码全为0，表示无穷小的数字，或者0
        return 0;


    if ((exp1<127))//阶码小于127位，表示int向下取整0
        return 0;
    if (!(exp1 ^ 127))//阶码为127，表示不移位，但是大于0
    {
        if (!(uf >> 31) ^ 0)
            return 1;
        else
            return (-1);
    }
    if ((exp1>159))//阶码大于127+32，表示不移位，但是大于0
        return 0x80000000;

/*

    if ((exp1<( 127-22)))//阶码为127，表示不移位，但是大于0
        return 0;
    if (!(uf ^ (1 << 31)))//100000...0000  为0
        return 0;

    if ((!((uf&(1 << 23 - 1)) ^ 0)))//尾数全为0，而且指数位0或者1
    {
        if (exp == 22 || exp == 23)
            return 0;
        else
            if ((!!s) == 1)
                return -1;
            else
                return 1;
    }
    if (x & (1 << 31))
        return -x;
    else
        return x;

    if ((!exp ^ 0))//阶码全为0，表示无穷小的数字，或者0
        return 0;
    if ((!((uf&(1 << 23 - 1)) ^ 0)))//尾数全为0，而且指数位0或者1
    {
        if (exp == 1 || exp == 0)
            return 0;
        else
            if ((!!s) == 1)
                return -1;
            else
                return 1;
    }
    if (!(exp ^ 0xff))//解码全为1，NaN 或者 无穷大
                return 0x80000000;
    int i = 1;
    while ((!((frac >> i) & 1)) && i < 23)
        i++;
    if (exp + 23 - i >31)//大于32位的数，溢出，
        return 0x0;

    return s|((frac>>i)<<exp);*/
}