CSAPP实验一datalab
来源:互联网 发布:电商网站模板源码 编辑:程序博客网 时间:2024/06/02 09:34
其实这个实验比较难的是bitcount操作,我参考了这个链接http://stackoverflow.com/questions/3815165/how-to-implement-bitcount-using-only-bitwise-operators
* CS:APP Data Lab * * 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. */#include "btest.h"#include <limits.h>/* * Instructions to Students: * * STEP 1: Fill in the following struct with your identifying info. */team_struct team ={ /* Team name: Replace with either: Your login ID if working as a one person team or, ID1+ID2 where ID1 is the login ID of the first team member and ID2 is the login ID of the second team member */ "1", /* Student name 1: Replace with the full name of first team member */ "", /* Login ID 1: Replace with the login ID of first team member */ "", /* The following should only be changed if there are two team members */ /* Student name 2: Full name of the second team member */ "", /* Login ID 2: Login ID of the second team member */ ""};#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: 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. 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.#endif/* * STEP 3: 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 btest test harness to check that your solutions produce * the correct answers. Watch out for corner cases around Tmin and Tmax. *//* * bitNor - ~(x|y) using only ~ and & * Example: bitNor(0x6, 0x5) = 0xFFFFFFF8 * Legal ops: ~ & * Max ops: 8 * Rating: 1 */int bitNor(int x, int y) { // ~(x|y) = ~x & ~y return (~x)&(~y);}/* * bitXor - x^y using only ~ and & * Example: bitXor(4, 5) = 1 * Legal ops: ~ & * Max ops: 14 * Rating: 2 */int bitXor(int x, int y) { //主要使用狄摩根定律 return (~(~x & ~y)) & (~(x & y));}/* * isNotEqual - return 0 if x == y, and 1 otherwise * Examples: isNotEqual(5,5) = 0, isNotEqual(4,5) = 1 * Legal ops: ! ~ & ^ | + << >> * Max ops: 6 * Rating: 2 */int isNotEqual(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) { //get the mask 0x000000FF int mask = ~((1<<31)>>23); return (x>>(n<<3)) &mask;}/* * 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;}/* * logicalShift - shift x to the right by n, using a logical shift * Can assume that 1 <= n <= 31 * Examples: logicalShift(0x87654321,4) = 0x08765432 * Legal ops: ~ & ^ | + << >> * Max ops: 16 * Rating: 3 */int logicalShift(int x, int n) { //int mask = ~((1<<31)>>(n+(~1)+1)); //get the high n bit 0 mask int mask = ~((1<<31)>>n<<1); return (x>>n) & mask;}/* * 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) { int result; //to get mask1 0x55555555 int tmp_mask1=(0x55)|(0x55<<8); int mask1=(tmp_mask1)|(tmp_mask1<<16); //to get mask2 0x33333333 int tmp_mask2=(0x33)|(0x33<<8); int mask2=(tmp_mask2)|(tmp_mask2<<16); //to get mask3 0x0f0f0f0f int tmp_mask3=(0x0f)|(0x0f<<8); int mask3=(tmp_mask3)|(tmp_mask3<<16); //to get mask4 0x00ff00ff int mask4=(0xff)|(0xff<<16); //to get mask5 0x0000ffff int mask5=(0xff)|(0xff<<8); //add every two bits result=(x&mask1)+((x>>1)&mask1); //add every four bits result=(result&mask2)+((result>>2)&mask2); //add every eight bits result=(result+(result>>4))&mask3; //add every sixteen bits result=(result+(result>>8))&mask4; //add every thirty two bits result=(result+(result>>16))&mask5; return result; }/* * bang - Compute !x without using ! * Examples: bang(3) = 0, bang(0) = 1 * Legal ops: ~ & ^ | + << >> * Max ops: 12 * Rating: 4 */int bang(int x) { //x or -x when x =0 is 0 while others is 0XFFFFFFF return ~(x |(~x+1))>>31&0x01;}/* * leastBitPos - return a mask that marks the position of the * least significant 1 bit. If x == 0, return 0 * Example: leastBitPos(96) = 0x20 * Legal ops: ! ~ & ^ | + << >> * Max ops: 6 * Rating: 4 */int leastBitPos(int x) { //x的2complement :the leastbit is invariable. return (~x +1) & x;}/* * 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) { //get the ~x>>31 to get the result return (~x>>31) & 0x01;}/* * 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 signx = x>>31 & 0x01; int signy = y>>31 & 0x01; int sxmy = (x+(~y)+1)>>31 & 0x01; return (((signx ^ 0x01) & (signy ^ 0x01) & (sxmy ) )| (signx & signy & (sxmy )) | ((signx ) &(signy ^ 0x01)) | !(x ^y))^ 0x01 ;}/* * 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 signx = x>>31; //mask = 1<<n -1 int mask = (1<<n) + (~0); int bias = signx & mask; return (x+bias)>>n;}/* * abs - absolute value of x (except returns TMin for TMin) * Example: abs(-1) = 1. * Legal ops: ! ~ & ^ | + << >> * Max ops: 10 * Rating: 4 */int abs(int x) { //judge the sign ,x>0 =x,x<0: ~x+1 int signx = x>>31; int a = signx ^ x; return a + (~signx + 1);}/* * 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) { // ~(x&y& ~r) & ~(~x&~y& r)// int signx = x>>31 & 0x01; // int signy = y>>31 & 0x01; // int signxy = (x+y)>>31 & 0x01; // return ((signx & signy &(signxy ^ 0x1)) ^ 0x01) & (0x01 ^ ((signx ^ 0x1) & (signy ^ 0x01) & signxy)) ; // // to see the sign of x and y is not both equal to ans int ans = x+ y; return !(( (x ^ans) & (y ^ ans ))>>31);}
- CSAPP实验一datalab
- CSAPP lab1 datalab-handout(深入了解计算机系统 实验一)
- CSAPP深入理解计算机系统实验datalab解析
- 计算机系统实验一-datalab
- CSAPP LAB1 DataLab
- CSAPP 实验一lab1 fitsBits
- DataLab实验解析
- datalab实验 说明文档
- datalab 数据表示实验
- datalab-handout实验
- CSAPP——实验一 位运算
- datalab 深入理解计算机系统实验
- Datalab-handout数据表示实验
- CSAPP——实验三 内存攻击(一)
- CSAPP:数据实验
- CSAPP课程与实验
- CSAPP LAB---MALLOC实验
- [CSAPP]Bufbomb实验报告
- Oracle 触发器练习
- Windows API串口编程参考
- 【Intel DPDK】Makefile编写在应用中添加新的程序代码
- oracle 游标变量ref cursor详解
- Java多线程编程学习笔记之一:线程中断(含代码)
- CSAPP实验一datalab
- Lambda表达式的初识(二)
- ios4 NAND layout
- 解析JavaScript中delete操作符不能删除的对象
- CDocument类的DeleteContents方法究竟删除了什么东西
- 把一个非延缓评估的元函数转换为一个延缓评估的元函数(Lazy evaluation)
- android camera添加 时间戳
- eclipse下svn的分支与合并操作
- 子查询解嵌套not in 无法展开改写