位运算符在C语言中的妙用

实验环境

deepin + sublime

实验要求

利用数目限定的位运算符号完成函数所要求的功能（详见代码）

代码及详解（解析看注释）

/* 
 * CS:APP Data Lab 
 * 
 * <Please put your name and userid here>
 * name : 王文龙
 × userid：2017302580176
 * 
 * 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
/* Copyright (C) 1991-2019 Free Software Foundation, Inc.
   This file is part of the GNU C Library.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Lesser General Public
   License as published by the Free Software Foundation; either
   version 2.1 of the License, or (at your option) any later version.

   The GNU C Library is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public
   License along with the GNU C Library; if not, see
   <http://www.gnu.org/licenses/>.  */
/* This header is separate from features.h so that the compiler can
   include it implicitly at the start of every compilation.  It must
   not itself include <features.h> or any other header that includes
   <features.h> because the implicit include comes before any feature
   test macros that may be defined in a source file before it first
   explicitly includes a system header.  GCC knows the name of this
   header in order to preinclude it.  */
/* glibc's intent is to support the IEC 559 math functionality, real
   and complex.  If the GCC (4.9 and later) predefined macros
   specifying compiler intent are available, use them to determine
   whether the overall intent is to support these features; otherwise,
   presume an older compiler has intent to support these features and
   define these macros by default.  */
/* wchar_t uses Unicode 10.0.0.  Version 10.0 of the Unicode Standard is
   synchronized with ISO/IEC 10646:2017, fifth edition, plus
   the following additions from Amendment 1 to the fifth edition:
   - 56 emoji characters
   - 285 hentaigana
   - 3 additional Zanabazar Square characters */
/* 
 * bitNor - ~(x|y) using only ~ and & 
 *   Example: bitNor(0x6, 0x5) = 0xFFFFFFF8
 *   Legal ops: ~ &
 *   Max ops: 8
 *   Rating: 1
 */
int bitNor(int x, int y) {
	int result=(~x)&(~y);
 	return result;
}
/* 
 * 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;;
}
/* 
 * 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) {
  return !(x^y);
}
/* 
 * bitMask - Generate a mask consisting of all 1's 
 *   lowbit and highbit
 *   Examples: bitMask(5,3) = 0x38
 *   Assume 0 <= lowbit <=s 31, and 0 <= highbit <= 31
 *   If lowbit > highbit, then mask should be all 0's
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 16
 *   Rating: 3
 */
//bitMask(5,3) 
int bitMask(int highbit, int lowbit) {
	int i = ~0;
  return (((i << highbit) << 1) ^ (i << lowbit)) & (i << lowbit);//考虑lowbit>highbit的情况
}
/*
 * bitCount - returns count of number of 1's in word
 *   Examples: bitCount(5) = 2, bitCount(7) = 3
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 40
 *   Rating: 4
 */
//输出1的个数
/*采用二分法，先计算x每两位中1的个数，并用对应的两队来存储
 *   这个个数。然后计算每4位1的个数，在用对应的4位进行存储。依次类推。
 *   最后整合得到16位中1的个数，即x中的1的个数。
 */
int bitCount(int x) {
	  int count; 
    int tmpMask1 = (0x55)|(0x55<<8); //10 10 10 10 10 10 10 1
    int mask1 = (tmpMask1)|(tmpMask1<<16); //01 01 01 01 01 01 01 01 01 01 01 01 01 01 01 01
    int tmpMask2 = (0x33)|(0x33<<8); //0011 0011 0011 0011
    int mask2 = (tmpMask2)|(tmpMask2<<16); //0011 0011 0011 0011 0011 0011 0011 0011
    int tmpMask3 = (0x0f)|(0x0f<<8); //00001111 00001111
    int mask3 = (tmpMask3)|(tmpMask3<<16);// 00001111 00001111 00001111 00001111
    int mask4 = (0xff)|(0xff<<16); //0000000011111111 0000000011111111
    int mask5 = (0xff)|(0xff<<8); // 0000 0000 0000 0000 1111 1111 1111 1111
    count = (x&mask1)+((x>>1)&mask1); 
    count = (count&mask2)+((count>>2)&mask2); 
    count = (count + (count >> 4)) & mask3; 
    count = (count + (count >> 8)) & mask4; 
    count = (count + (count >> 16)) & mask5; 
    return count; 
}
/* 
 * TMax - return maximum two's complement integer 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 4
 *   Rating: 1
 */
int tmax(void) {
  return ~(1<<31);
}
/* 
 * isNonNegative - return 1 if x >= 0, return 0 otherwise 
 *   Example: isNonNegative(-1) = 0.  isNonNegative(0) = 1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 6
 *   Rating: 3
 */
int isNonNegative(int x) {
  return  !(x>>31);
}
/* 
 * addOK - Determine if can compute x+y without overflow
 *   Example: addOK(0x80000000,0x80000000) = 0,
 *            addOK(0x80000000,0x70000000) = 1, 
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 20
 *   Rating: 3
 */
int addOK(int x, int y) {
    /*int res = x+y;
    int flag1=!(x>>31);
    int flag2=!(y>>31);
    int flag3=!(res>>31);
    return !((flag1^flag2)|(!(flag3^flag1^flag2)));
    */
  int ans = x + y;
  return  !( ( ( x ^ ans ) & ( y ^ ans ) )  >> 0x1F );
}
/* 
 * rempwr2 - Compute x%(2^n), for 0 <= n <= 30
 *   Negative arguments should yield negative remainders
 *   Examples: rempwr2(15,2) = 3, rempwr2(-35,3) = -3
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 20
 *   Rating: 3
 */
//对于正数的取余，取低几位即可
//对于负数的取余，负数在计算机里用补码表示，取低n位后进行取反加一
/*举例：-35 的二进制补码为：11011101 低三位为101 而-3 的二进制表示为11111 101
×所以对于负数只需要取低三位，前面全补1即可
*/
int rempwr2(int x, int n) {
    int tmp = (~0) << n;
	int ans = x & (~tmp);//ans保留低n位值
	return ans +   ( ( ( x & (~ans + 1) ) >> 0x1F ) & tmp );//( x & (~ans + 1) ) >> 0x1F )用于判断正负，若正则为0，若负则前面补1
}
/* 
 * isLess - if x < y  then return 1, else return 0 
 *   Example: isLess(4,5) = 1.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 24
 *   Rating: 3
 */
int isLess(int x, int y) {
  int xsign = (x >> 31) & 0x1;  
  int ysign = (y >> 31) & 0x1;  
    
  /* 分为三种情况： 
  1，x > 0 ,y < 0 return 0
  2, x > 0 ,y > 0;或x < 0,y < 0;(利用y-x是否为0求）  
  3, x < 0 ,y > 0 return 1
  */  
  return ((xsign & ~ysign))|((!((~x+y)>>31) ) & (!(~xsign & ysign)));  
}
/* 
 * absVal - absolute value of x
 *   Example: absVal(-1) = 1.
 *   You may assume -TMax <= x <= TMax
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 10
 *   Rating: 4
 */
int absVal(int x) {
  int negate = !!(x & (1 << 31));//负数为1，正数为0
  return (x^(~0 + !negate))+negate; //负数求反加一，正数不变
}
/*
 * isPower2 - returns 1 if x is a power of 2, and 0 otherwise
 *   Examples: isPower2(5) = 0, isPower2(8) = 1, isPower2(0) = 0
 *   Note that no negative number is a power of 2.
 *   Legal ops: ! ~ & ^ | + << >>
 *   Max ops: 20
 *   Rating: 4
 */
//只存在一个1 attention:isPower(0)=0 && no negative number is a power of 2
int isPower2(int x) {
    return (!(x>>31))&(!!(x^0))&(!((x&(~x+1))^x));
}
/* 
 * 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) {
  unsigned result= uf ^ 0x80000000;
  unsigned tmp=uf & 0x7fffffff;/
  if( tmp > 0x7f800000 ) //When argument is NaN(exponent bits are all 1 and mantissa bits arenot all 0), return argument.
                         //IEEE754 standard:1 bit signed bit,8 bits exponent,23 bits mantissa.
      result=uf;
  return result;
}
/* 
 * float_half - Return bit-level equivalent of expression 0.5*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
 */
//1 bit signed bit,8 bits exponent,23 bits mantissa
unsigned float_half(unsigned uf) {
  unsigned s = uf & 0x80000000;
  unsigned exp = uf & 0x7f800000;
  unsigned frac = uf & 0x7FFFFF;
  // 按照向偶数舍入的方式，只有最低2位为全1时，才需要舍入
  int round = ((uf & 3) == 3);
  if (exp == 0x7f800000)//When argument is NaN, return argument
    return uf;
  else if (exp > 0x800000)//阶数大于一，减一即可，否则需要进行舍入
    return uf - 0x800000;
  else
    return s | (((exp|frac) >> 1) + round); 

}
/* 
 * 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 sign=0,shiftleft=0,flag=0,tmp;
  unsigned absx=x;
  if( x==0 ) return 0;
  if( x<0 ){
     sign=0x80000000;
     absx=-x;
  }
  while(1){//移位到最高位等于1，以便规范化浮点数移位到最高位等于1，以便规范化浮点数
     tmp=absx;
     absx<<=1;
     shiftleft++;
     if( tmp&0x80000000 ) break;
  }
  if( (absx & 0x01ff) > 0x0100 ) flag=1;//***Rounding 低八位有值
  if( (absx & 0x03ff) == 0x0300 ) flag=1;//***Rounding 2
  
  return sign+(absx>>9)+((159-shiftleft)<<23)+flag;//此处的159=127+32，之所以要加32，是因为在leftshift的时候，shiftleft的值并不是真正的阶数，而是32-阶数
}

有问题请留言^ _ ^