/*  * bits-solve.c - Solutions to the data lab */#include "btest.h"#include <limits.h>/* * Instructions to Students: * * STEP 1: Fill in the following struct with your identifying info. */info_struct info ={   /* Replace with your full name */   "foo",   /* Replace with your login ID */   "bar",};#if 0/* * STEP 2: Read the following instructions carefully. */You will provide your solution to the Data Lab byediting the collection of functions in this source file.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.   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;  }NOTES AND HINTS:  1. Each function has a maximum number of operators (! ~ & ^ | + << >>)     that you are allowed to use for your implementation of the function.      The max operator count will be checked by your instructor.      Note that '=' is not counted; you may use as many of these as you      want without penalty.  2. Use the btest test harness to check your functions for correctness.#endif/* * STEP 3: Modify the following functions according the coding rules. *//*  * 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);}/*  * 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);}/* * 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;}/*  * TMax - return maximum two's complement integer  *   Legal ops: ! ~ & ^ | + << >> *   Max ops: 4 *   Rating: 1 */int tmax(void) {  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) {  long int x_and_y = x&y;  long int x_or_y = ~(~x & ~y);  return x_or_y & ~x_and_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) {  /* Shift x n*8 positions right */  int shift = n << 3;  int xs = x >> shift;  /* Mask byte */  return xs & 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) {  return !(x ^ y);}/*  * 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 | x >> 31);}