CSAPP Data Lab

ICS作业第一个Lab（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
/*
 * copyLSB - set all bits of result to least significant bit of x
 *   Example: copyLSB(5) = 0xFFFFFFFF, copyLSB(6) = 0x00000000
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 5
 *   Rating: 2
 */
int copyLSB(int x) {

  return (x<<31)>>31;
}
/*
 * 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) {
     int a=!x+(~0);//x!=0,a=-1;x==0,a=0
     return (y&a)+ (z&(~a));

}
/*
 * allEvenBits - return 1 if all even-numbered bits in word set to 1
 *   Examples allEvenBits(0xFFFFFFFE) = 0, allEvenBits(0x55555555) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 2
 */
int allEvenBits(int x) {
     int q=(0xaa<<8)+0xaa;
     int r=(q<<16)+q;//r的所有奇数位都是1
     x=(x|r)+1;
     return !x;
}
/*
 * implication - return x -> y in propositional logic - 0 for false, 1
 * for true
 *   Example: implication(1,1) = 1
 *            implication(1,0) = 0
 *   Legal ops: ! ~ ^ |
 *   Max ops: 5
 *   Rating: 2
 */
int implication(int x, int y) {
    return (!x)|y;
}
/*
 * replaceByte(x,n,c) - Replace byte n in x with c
 *   Bytes numbered from 0 (LSB) to 3 (MSB)
 *   Examples: replaceByte(0x12345678,1,0xab) = 0x1234ab78
 *   You can assume 0 <= n <= 3 and 0 <= c <= 255
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 10
 *   Rating: 3
 *///5 ops
int replaceByte(int x, int n, int c) {
     int m=n<<3;
     x=~(0xff<<m)&x;
     x=x|(c<<m);
     return x;
}
/*
 * tmin - return minimum two's complement integer
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
int tmin(void) {
  return 1<<31;
}
/*
 * minusOne - return a value of -1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 2
 *   Rating: 1
 */
int minusOne(void) {
  return ~0;
}
/*
 * isGreater - if x > y  then return 1, else return 0
 *   Example: isGreater(4,5) = 0, isGreater(5,4) = 1
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 24
 *   Rating: 3
 */
int isGreater(int x, int y) {
     int x1=x>>31;
     int y1=y>>31;
     int w=x1^y1;//xy符号相同，w=0，符号不同，w=-1
     int z=x+(~y);//符号相同的情况，可以直接相减

     //printf("%x %x %x %x\n",x,y,((z>>31)+1),w);
     //x=(x>>31)+1;
     return (w&(x1+1))+((~w)&((z>>31)+1));
}
/*
 * 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) {
     x=~x;
     //0x3a+x，符号位为0；0x30+x，符号位为1
     //return !(((0x3a+x)+~(0x30+x))>>31);
     return !(((0x3a+x)>>31)+~((0x30+x)>>31));
}
/* 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);//多0，少1
     int d1=8+(c1<<4);//多8，少24
     int c2=!!(y>>d1);//多0，少1
     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;

  return 0;
}
/*
 * greatestBitPos - return a mask that marks the position of the
 *               most significant 1 bit. If x == 0, return 0
 *   Example: greatestBitPos(96) = 0x40
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 70
 *   Rating: 4
 */
int greatestBitPos(int x) {
     //分别左移1,2,4,8,16位取或，使最高位及以下全部置1
     int p=!x+(~0);
     int q=x>>31;
     x=x|(x>>1);
     x=x|(x>>2);
     x=x|(x>>4);
     x=x|(x>>8);
     x=x|(x>>16);
     x=(x>>1)+1;
     return (x&p)+((1<<31)&q);//考虑首位是1的溢出情况
     //printf("%d %d %d %d %d %d %d %d %d %d\n",t1,p1,t2,p2,t3,p3,t4,p4,t5,p5);
     //printf("%x\n",p5);
     //return (1<<(p5+m))&(!x+m);

}
/*
 * satMul3 - multiplies by 3, saturating to Tmin or Tmax if overflow
 *  Examples: satMul3(0x10000000) = 0x30000000
 *            satMul3(0x30000000) = 0x7FFFFFFF (Saturate to TMax)
 *            satMul3(0x70000000) = 0x7FFFFFFF (Saturate to TMax)
 *            satMul3(0xD0000000) = 0x80000000 (Saturate to TMin)
 *            satMul3(0xA0000000) = 0x80000000 (Saturate to TMin)
 *  Legal ops: ! ~ & ^ | + << >>
 *  Max ops: 25
 *  Rating: 3
 */
int satMul3(int x) {
    int x2=x+x;
    int x3=x+x2;
    int f1=x>>31;
    int tmin=1<<31;
    int g=((x^x2)|(x^x3))>>31;//要求x,x2,x3的符号位全部相同则是0，否则是-1说明溢出
    return ((~g)&x3)+(g&(tmin+(~f1)));
}
/*
 * subOK - Determine if can compute x-y without overflow
 *   Example: subOK(0x80000000,0x80000000) = 1,
 *            subOK(0x80000000,0x70000000) = 0,
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 20
 *   Rating: 3
 */
int subOK(int x, int y) {
  int z=x+(~y)+1;//z=x-y
  //两种溢出的情况:x负y正z正，x正y负z负，即：x符号位和yz均不同
  return !(((x^z)&(x^y))>>31);
}
/*
 * 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 flag=1;
    if ((uf|0x7f800000)==uf)
    {
        if (uf<<9)
            flag=0;
    }
    if (flag)
        uf=uf^0x80000000;
    return uf;
}
/*
 * 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 mi=0;
     unsigned p;
     unsigned int w=0xffffffff;
     int exp;
     int frac;
     unsigned int w1;
     int ne=0;
     if (x<0)
     {
        mi=0x80000000;//mi is the first bit
        x=-x; //use positive integers to operate
     }
     p=x;
     while (p)
     {
          p=p>>1;
          w++;
     }//get the highest bit of x
     exp=(127+w)<<23;
     w1=x-(1<<w);//the original form of frac
     frac=w1<<(23-w);
     if (w>23)//need to round
     {
          int z=w-24;
          ne=w1&((1<<z)-1);//ne is used to test whether the number contains 1 in the least significant w-25 bits.
          frac=w1>>(w-23);
          if (w1>>z&1)//if round up,(w-24)bit should be 1
          {
               frac=frac+(ne||(frac&1));//solve the problem of rounding to even
          }
     }
     if (x)
        mi=mi+exp+frac;
     return mi;
}