⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 tests.c

📁 ICS 课程的Lab1
💻 C
字号:
/* Testing Code */#include <limits.h>int test_bitNor(int x, int y){  return ~(x|y);}int test_bitXor(int x, int y){  return x^y;}int test_isNotEqual(int x, int y){  return x != y;}int test_getByte(int x, int n){  union {    int word;    unsigned char bytes[4];  } u;  int test = 1;  int littleEndian = (int) *(char *) &test;  u.word = x;  return littleEndian ? (unsigned) u.bytes[n] : (unsigned) u.bytes[3-n];}int test_bang(int x){  return !x;}int test_bitCount(int x) {  int result = 0;  int i;  for (i = 0; i < 32; i++)    result += (x >> i) & 0x1;  return result;}int test_tmin(void) {  return LONG_MIN;}int test_isNegative(int x) {  return x < 0;}int test_divpwr2(int x, int n){    int p2n = 1<<n;    return x/p2n;}int test_fitsBits(int x, int n){  int TMin_n = -(1 << (n-1));  int TMax_n = (1 << (n-1)) - 1;  return x >= TMin_n && x <= TMax_n;}int test_isLessOrEqual(int x, int y){  return x <= y;}int test_sum3(int x, int y, int z){  return x+y+z;}int test_tc2sm(int x) {  int sign = x < 0;  int mag = x < 0 ? -x : x;  return (sign << 31) | mag;}int test_satAdd(int x, int y){  if (x > 0 && y > 0 && x+y < 0)    return LONG_MAX;  if (x < 0 && y < 0 && x+y >= 0)    return LONG_MIN;  return x + y;}int test_isPower2(int x) {  int i;  for (i = 0; i < 31; i++) {    if (x == 1<<i)      return 1;  }  return 0;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -