苗火 Nicholas

[C] datalab_handout: Bit operation

2022-3-17 萧 写技术

/* 
 * 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&0xffffffff)>>n;
}
/*
 * 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) {
  return (x & 0x01) + (x>>1 & 0x01) +  ( x>>2 &0x01) + ( x>>3 &0x01) + ( x>>4 &0x01) + ( x>>5 &0x01) + ( x>>6 &0x01) + ( x>>7 &0x01) + ( x>>8 &0x01) + ( x>>9 &0x01) + ( x>>10 &0x01) + ( x>>11 &0x01) + ( x>>12 &0x01) + ( x>>13 &0x01) + ( x>>14 &0x01) + ( x>>15 &0x01) + ( x>>16 &0x01) + ( x>>17 &0x01) + ( x>>18 &0x01) + ( x>>19 &0x01) + ( x>>20 &0x01) + ( x>>21 &0x01) + ( x>>22 &0x01) + ( x>>23 &0x01) + ( x>>24 &0x01) + ( x>>25 &0x01) + ( x>>26 &0x01) + ( x>>27 &0x01) + ( x>>28 &0x01) + ( x>>29 &0x01) + ( x>>30 &0x01) + ( x>>31 &0x01) ;
}
/* 
 * bang - Compute !x without using !
 *   Examples: bang(3) = 0, bang(0) = 1
 *   Legal ops: ~ & ^ | + << >>
 *   Max ops: 12
 *   Rating: 4 
 */
int bang(int x) {
	x = x & 0xffffffff;
  return (~( (x & 0x01) | (x>>1 & 0x01) |  ( x>>2 &0x01) | ( x>>3 &0x01) | ( x>>4 &0x01) | ( x>>5 &0x01) | ( x>>6 &0x01) | ( x>>7 &0x01) | ( x>>8 &0x01) | ( x>>9 &0x01) | ( x>>10 &0x01) | ( x>>11 &0x01) | ( x>>12 &0x01) | ( x>>13 &0x01) | ( x>>14 &0x01) | ( x>>15 &0x01) | ( x>>16 &0x01) | ( x>>17 &0x01) | ( x>>18 &0x01) | ( x>>19 &0x01) | ( x>>20 &0x01) | ( x>>21 &0x01) | ( x>>22 &0x01) | ( x>>23 &0x01) | ( x>>24 &0x01) | ( x>>25 &0x01) | ( x>>26 &0x01) | ( x>>27 &0x01) | ( x>>28 &0x01) | ( x>>29 &0x01) | ( x>>30 &0x01)  | ( x>>31 &0x01) ) & 0x01) ;
}
/* 
 * tmin - return minimum two's complement integer 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
int tmin(void) {
  return 0x01<<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 neg1 = 0xffffffff;
	int max = (1<<(n+neg1))+neg1;
	int min = ~(1<<(n+neg1)) + 1;
	return  !(  ( (x + (~min + 1) )>>31)  |  (( max + (~x + 1))>>31)       );
}
/* 
 * 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) {
	int neg_v_ = (~(x&0xffffffff)+1)>>n;
	int neg_v = ~neg_v_ + 1;
	int pos_v = (x)>>n;
	int s = (x & 0x80000000);
	int neg_mask = ( s >> 1 ) |( s >> 2 ) |( s >> 3 ) |( s >> 4 ) |( s >> 5 ) |( s >> 6 ) |( s >> 7 ) |( s >> 8 ) |( s >> 9 ) |( s >> 10 ) |
		( s >> 11 ) |( s >> 12 ) |( s >> 13 ) |( s >> 14 ) |( s >> 15 ) |( s >> 16 ) |( s >> 17) |( s >> 18) |( s >> 19) |( s >> 20) |
		( s >> 21 ) |( s >> 22 ) |( s >> 23 ) |( s >> 24 ) |( s >> 25 ) |( s >> 26 ) |( s >> 27) |( s >> 28) |( s >> 29) |( s >> 30) |
		( x >> 31 ) | s;
	return (neg_v & neg_mask) | (pos_v & ~neg_mask);
}
/* 
 * 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&0x80000000) >> 31)&0x01 ) |  (    !( ((x>>0)&0x01)|((x>>1)&0x01)| ((x>>2)&0x01)| ((x>>3)&0x01)| ((x>>4)&0x01)| ((x>>5)&0x01)| ((x>>6)&0x01)| ((x>>7)&0x01)| ((x>>8)&0x01)| ((x>>9)&0x01)| ((x>>10)&0x01)| ((x>>11)&0x01)| ((x>>12)&0x01)| ((x>>13)&0x01)| ((x>>14)&0x01)| ((x>>15)&0x01)| ((x>>16)&0x01)| ((x>>17)&0x01)| ((x>>18)&0x01)| ((x>>19)&0x01)| ((x>>20)&0x01)| ((x>>21)&0x01)|((x>>22)&0x01)|((x>>23)&0x01)|((x>>24)&0x01)|((x>>25)&0x01)|((x>>26)&0x01)|((x>>27)&0x01)|((x>>28)&0x01)|((x>>29)&0x01)|((x>>30)&0x01)|((x>>31)&0x01) )   )   ) ;
}
/* 
 * 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 y_neg = (y >> 31) & 0x01;
	int xy_same = (( (~(x ^ y))>>31 ) & 0x01 );
	int x_tail_big = ( ( (y & 0x7fffffff) - (x & 0x7fffffff) ) >> 31 ) & 0x01;
	return !(   (xy_same & x_tail_big) | (  (!xy_same) & y_neg )   );
}
/*
 * 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 z1 = !((0x80000000 & x) ^ 0);
	int z2 = !((0xc0000000 & x) ^ 0);
	int z3 = !((0xe0000000 & x) ^ 0);
	int z4 = !((0xf0000000 & x) ^ 0);
	int z5 = !((0xf8000000 & x) ^ 0);
	int z6 = !((0xfc000000 & x) ^ 0);
	int z7 = !((0xfe000000 & x) ^ 0);
	int z8 = !((0xff000000 & x) ^ 0);
	int z9 = !((0xff800000 & x) ^ 0);
	int z10 = !((0xffc00000 & x) ^ 0);
	int z11 = !((0xffe00000 & x) ^ 0);
	int z12 = !((0xfff00000 & x) ^ 0);
	int z13 = !((0xfff80000 & x) ^ 0);
	int z14 = !((0xfffc0000 & x) ^ 0);
	int z15 = !((0xfffe0000 & x) ^ 0);
	int z16 = !((0xffff0000 & x) ^ 0);
	int z17 = !((0xffff8000 & x) ^ 0);
	int z18 = !((0xffffc000 & x) ^ 0);
	int z19 = !((0xffffe000 & x) ^ 0);
	int z20 = !((0xfffff000 & x) ^ 0);
	int z21 = !((0xfffff800 & x) ^ 0);
	int z22 = !((0xfffffc00 & x) ^ 0);
	int z23 = !((0xfffffe00 & x) ^ 0);
	int z24 = !((0xffffff00 & x) ^ 0);
	int z25 = !((0xffffff80 & x) ^ 0);
	int z26 = !((0xffffffc0 & x) ^ 0);
	int z27 = !((0xffffffe0 & x) ^ 0);
	int z28 = !((0xfffffff0 & x) ^ 0);
	int z29 = !((0xfffffff8 & x) ^ 0);
	int z30 = !((0xfffffffc & x) ^ 0);
	int z31 = !((0xfffffffe & x) ^ 0);
	int z32 = !((0xffffffff & x) ^ 0);

	int zeros = z1 + z2 + z3 + z4 + z5 + z6 + z7 + z8 + z9 + z10 + z11 + z12 + z13 + z14 + z15 + z16 + z17 + z18 + z19 + z20 + z21 + z22 + z23 + z24 + z25 + z26 + z27 + z28 + z29 + z30 + z31 + z32;
	return 31 + (~ zeros + 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) {
	if ( !( ( ( (( uf>>23 )&0xFF) + 0xffffff01 ) >> 31 ) & 0x01) ){
		if (( uf & 0x7fffff )){
 			return uf;
		}
	}
 	return (~uf & 0x80000000) | (uf & 0x7fffffff);
}
/* 
 * 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 sign = x & 0x80000000;
	int abs = x;
	int abs_raw = abs;
	if ( (sign >> 31)&0x01 ){
		abs = ~x + 1;
		abs_raw = abs;
	}

	int bits = 0;
	int t = abs;
	while(t){
		t = (t&0xffffffff) >> 1;
		bits = bits + 1;
	}
	int e = bits + 127 - 1;
	e = ( e << 23 ) & 0x7f800000 ;
	if (!( x ^ 0) ){
		e = 0;
	}

	if ( ( ( 24 - bits) >> 31 ) & 0x01 ) {
		abs = (abs&0xffffffff) >> ( bits - 24);
	}else{
		abs = (abs&0xffffffff) << ( 24 - bits);
	}
	abs = abs & 0x007fffff;

	int flag = 0;
	abs_raw = abs_raw << (32 - bits + 1 );
	if ( (abs_raw & 0x1ff) > 0x100 ){
		flag = 1;
	}else if ( (abs_raw & 0x3ff) == 0x300 ){
		flag = 1;
	}

	int ret = sign | e |  abs ;
	ret = ret + flag;

	return ret;
}
/* 
 * 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) {
  	if ( !uf ){
		return uf;
	}
	if (!( uf ^ 0x80000000) ){
		return uf;
	}
	if (! (uf & 0x7f800000) ){
		return (uf & 0x80000000) | ( uf << 1);
	}
	if (! ((uf & 0x7fffffff) ^ 0x7f800000) ){
		return uf;
	}
	if (! ((uf & 0x7f800000) ^ 0x7f800000) ){
		return uf;
	}
  	return ( (((uf & 0x7f800000) >> 23) + 1) << 23 ) | (uf & 0x807fffff) ;
}

标签: C