datalab-handout/bits.h /* Copyright (C XXXXXXXXXXFree 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...

76_cpp_92464/bits.h
/* Copyright (C) 1991-2018 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
. */
/* 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 or any other header that includes
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 */
/* We do not support C11 . */
/***************************************************
* BOOLEAN operations (8 puzzles, 18 points total) *
***************************************************/
int bitOr(int, int);
int test_bitOr(int, int);
int bitAnd(int, int);
int test_bitAnd(int, int);
int bitXor(int, int);
int test_bitXor(int, int);
int isNotEqual(int, int);
int test_isNotEqual(int, int);
int copyLSB(int);
int test_copyLSB(int);
int specialBits();
int test_specialBits();
int conditional(int, int, int);
int test_conditional(int, int, int);
int bitParity(int);
int test_bitParity(int);
/*******************************************
* INTEGERS (8 puzzles, 22 points total) *
*******************************************/
int minusOne();
int test_minusOne();
int tmax();
int test_tmax();
int negate(int);
int test_negate(int);
int isNegative(int);
int test_isNegative(int);
int isPositive(int);
int test_isPositive(int);
int bang(int);
int test_bang(int);
int addOK(int, int);
int test_addOK(int, int);
int absVal(int);
int test_absVal(int);
/*************************************************************
* BONUS puzzles BELOW! be advised, some are quite difficult *
************************************************************/
/***************************************************
INTEGERS and BOOLEAN (3 puzzles, up to 10 points) *
***************************************************/
int byteSwap(int, int, int);
int test_byteSwap(int, int, int);
int bitCount(int);
int test_bitCount(int);
int logicalShift(int, int);
int test_logicalShift(int, int);
76_cpp_92464/Driverhdrs.pm
#
# This file contains configuration variables for drivers.
# It was generated by genhdrs.pl. Do not modify it.
#
package Driverhdrs;
$LAB = "datalab";
$SERVER_NAME = "2467.cs.uno.edu";
$SERVER_PORT = 8081;
$COURSE_NAME = "csapp";
$AUTOGRADE_TIMEOUT = 0;
1;
76_cpp_92464/README
***********************
The CS:APP Data Lab
Directions to Students
***********************
Your goal is to modify your copy of bits.c so that it passes all the
tests in btest without violating any of the coding guidelines.
*********
0. Files:
*********
Makefile    - Makes btest, fshow, and ishow
README        - This file
bits.c        - The file you will be modifying and handing in
bits.h        - Header file
btest.c        - The main btest program
btest.h    - Used to build btest
decl.c    - Used to build btest
tests.c - Used to build btest
tests-header.c- Used to build btest
dlc*        - Rule checking compiler binary (data lab compiler)    
driver.pl*    - Driver program that uses btest and dlc to autograde bits.c
Driverhdrs.pm - Header file for optional "Beat the Prof" contest
fshow.c        - Utility for examining floating-point representations
ishow.c        - Utility for examining integer representations
***********************************************************
1. Modifying bits.c and checking it for compliance with dlc
***********************************************************
IMPORTANT: Carefully read the instructions in the bits.c file before
you start. These give the coding rules that you will need to follow if
you want credit for your work.
Use the dlc compiler (./dlc) to automatically check your version of
bits.c for compliance with the coding guidelines:
unix> ./dlc bits.c
dlc returns silently if there are no problems with your code.
Otherwise it prints messages that flag any problems. Running dlc with
the -e switch:
    unix> ./dlc -e bits.c
causes dlc to print counts of the number of operators used by each function.
Once you have a legal solution, you can test it for correctness using
the ./btest program.
*********************
2. Testing with btest
*********************
The Makefile in this directory compiles your version of bits.c with
additional code to create a program (or test harness) named btest.
To compile and run the btest program, type:
unix> make btest
unix> ./btest [optional cmd line args]
You will need to recompile btest each time you change your bits.c
program. When moving from one platform to another, you will want to
get rid of the old version of btest and generate a new one. Use the
commands:
unix> make clean
unix> make btest
Btest tests your code for correctness by running millions of test
cases on each function. It tests wide swaths around well known corner
cases such as Tmin and zero for integer puzzles, and zero, inf, and
the boundary between denormalized and normalized numbers for floating
point puzzles. When btest detects an error in one of your functions,
it prints out the test that failed, the incorrect result, and the
expected result, and then terminates the testing for that function.
Here are the command line options for btest:
unix> ./btest -h
Usage: ./btest [-hg] [-r ] [-f [-1|-2|-3 ]*] [-T ]
-1 Specify first function argument
-2 Specify second function argument
-3 Specify third function argument
-f Test only the named function
-g Format output for autograding with no error messages
-h Print this message
-r Give uniform weight of n for all problems
-T Set timeout limit to lim
Examples:
Test all functions for correctness and print out error messages:
unix> ./btest
Test all functions in a compact form with no error messages:
unix> ./btest -g
Test function foo for correctness:
unix> ./btest -f foo
Test function foo for correctness with specific arguments:
unix> ./btest -f foo -1 27 -2 0xf
Btest does not check your code for compliance with the coding
guidelines. Use dlc to do that.
*******************
3. Helper Programs
*******************
We have included the ishow and fshow programs to help you decipher
integer and floating point representations respectively. Each takes a
single decimal or hex number as an argument. To build them type:
unix> make
Example usages:
unix> ./ishow 0x27
Hex = 0x00000027,    Signed = 39,    Unsigned = 39
unix> ./ishow 27
Hex = 0x0000001b,    Signed = 27,    Unsigned = 27
unix> ./fshow 0x15213243
Floating point value 3.255334057e-26
Bit Representation 0x15213243, sign = 0, exponent = 0x2a, fraction = 0x213243
Normalized. +1.2593463659 X 2^(-85)
linux> ./fshow 15213243
Floating point value 2.131829405e-38
Bit Representation 0x00e822bb, sign = 0, exponent = 0x01, fraction = 0x6822bb
Normalized. +1.8135598898 X 2^(-126)
76_cpp_92464/Makefile
#
# Makefile that builds btest and other helper programs for the CS:APP data lab
#
CC = gcc
CFLAGS = -O -g -Wall -m32 -Wno-bool-operation
LIBS = -lm
all: btest fshow ishow
btest: btest.c bits.c decl.c tests.c btest.h bits.h
    $(CC) $(CFLAGS) $(LIBS) -o btest bits.c btest.c decl.c tests.c
fshow: fshow.c
    $(CC) $(CFLAGS) -o fshow fshow.c
ishow: ishow.c
    $(CC) $(CFLAGS) -o ishow ishow.c
# Forces a recompile. Used by the driver program.
btestexplicit:
    $(CC) $(CFLAGS) $(LIBS) -o btest bits.c btest.c decl.c tests.c
clean:
    rm -f *.o btest fshow ishow *~
76_cpp_92464/tests.c
/* Testing Code */
#include
#include
/* Routines used by floation point test code */
/* Convert from bit level representation to floating point number */
float u2f(unsigned u) {
union {
unsigned u;
float f;
} a;
a.u = u;
return a.f;
}
/* Convert from floating point number to bit-level representation */
unsigned f2u(float f) {
union {
unsigned u;
float f;
} a;
a.f = f;
return a.u;
}
/* Copyright (C) 1991-2018 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
. */
/* 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 or any other header that includes
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 */
/* We do not support C11 . */
/***************************************************
* BOOLEAN operations (8 puzzles, 18 points total) *
***************************************************/
int test_bitOr(int x, int y)
{
return x|y;
}
int test_bitAnd(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_copyLSB(int x)
{
return (x & 0x1) ? -1 : 0;
}
int test_specialBits(void) {
return 0xffca3fff;
}
int test_conditional(int x, int y, int z)
{
return x?y:z;
}
int test_bitParity(int x) {
int result = 0;
int i;
for (i = 0; i < 32; i++)
result ^= (x >> i) & 0x1;
return result;
}
/*******************************************
* INTEGERS (8 puzzles, 22 points total) *
*******************************************/
int test_minusOne(void) {
return -1;
}
int test_tmax(void) {
return 0x7FFFFFFF;
}
int test_negate(int x) {
return -x;
}
int test_isNegative(int x) {
return x < 0;
}
int test_isPositive(int x) {
return x > 0;
}
int test_bang(int x)
{
return !x;
}
int test_addOK(int x, int y)
{
long long lsum = (long long) x + y;
return lsum == (int) lsum;
}
int test_absVal(int x) {
return (x < 0) ? -x : x;
}
/*************************************************************
* BONUS puzzles BELOW! be advised, some are quite difficult *
************************************************************/
/***************************************************
INTEGERS and BOOLEAN (3 puzzles, up to 10 points) *
***************************************************/
int test_byteSwap(int x, int n, int m)
{
/* little endiamachine */
/* least significant byte stored first */
unsigned int nmask, mmask;
switch(n) {
case 0:
nmask = x & 0xFF;
x &= 0xFFFFFF00;
break;
case 1:
nmask = (x & 0xFF00) >> 8;
x &= 0xFFFF00FF;
break;
case 2:
nmask = (x & 0xFF0000) >> 16;
x &= 0xFF00FFFF;
break;
default:
nmask = ((unsigned int)(x & 0xFF000000)) >> 24;
x &= 0x00FFFFFF;
break;
}
switch(m) {
case 0:
mmask = x & 0xFF;
x &= 0xFFFFFF00;
break;
case 1:
mmask = (x & 0xFF00) >> 8;
x &= 0xFFFF00FF;
break;
case 2:
mmask = (x & 0xFF0000) >> 16;
x &= 0xFF00FFFF;
break;
default:
mmask = ((unsigned int)(x & 0xFF000000)) >> 24;
x &= 0x00FFFFFF;
break;
}
nmask <<= 8*m;
mmask <<= 8*n;
return x | nmask | mmask;
}
int test_bitCount(int x) {
int result = 0;
int i;
for (i = 0; i < 32; i++)
result += (x >> i) & 0x1;
return result;
}
int test_logicalShift(int x, int n) {
unsigned u = (unsigned) x;
unsigned shifted = u >> n;
return (int) shifted;
}
76_cpp_92464/Driverlib.pm
###############################################################
# Driverlib.pm - A package of helper functions for Perl drivers
#
# Copyright (c) 2005 David R. O'Hallaron, All rights reserved.
###############################################################
package Driverlib;
use Socket;
# Autogenerated header file with lab-specific constants
use lib ".";
use Driverhdrs;
require Exporter;
@ISA = qw(Exporter);
@EXPORT = qw(
     driver_post
     );
use strict;
#####
# Public functions
#
#
# driver_post - This is the routine that a driver calls when
# it needs to transmit an autoresult string to the result server.
#
sub driver_post ($$) {
my $userid = shift; # User id for this submission
my $result = shift; # Autoresult string
my $autograded = shift; # Set if called by an autograder
# Echo the autoresult string to stdout if the driver was called
# by an autograder
if ($autograded) {
print "\n";
print "AUTORESULT_STRING=$result\n";
return;
}    
# If the driver was called with a specific userid, then submit
# the autoresult string to the result server over the Internet.
if ($userid) {
my $status = submitr($Driverhdrs::SERVER_NAME,
$Driverhdrs::SERVER_PORT,
$Driverhdrs::COURSE_NAME,
$userid,
$Driverhdrs::LAB,
$result);

# Print the status of the transfer
if (!($status =~ /OK/)) {
print "$status\n";
print "Did not send autoresult string to the result server.\n";
exit(1);
}
print "Success: Sent autoresult string for $userid to the result server.\n";
}    
}
#####
# Private functions
#
#
# submitr - Sends an autoresult string to the result server
#
sub submitr ($$$$$$) {
my $hostname = shift;
my $port = shift;
my $course = shift;
my $userid = shift;
my $lab = shift;
my $result = shift;
my $internet_addr;
my $enc_result;
my $paddr;
my $line;
my $http_version;
my $errcode;
my $errmsg;
# Establish the connection to the server
socket(SERVER, PF_INET, SOCK_STREAM, getprotobyname('tcp'));
$internet_addr = inet_aton($hostname)
or die "Could not convert $hostname to an internet address: $!\n";
$paddr = sockaddr_in($port, $internet_addr);
connect(SERVER, $paddr)
or die "Could not connect to $hostname:$port:$!\n";
select((select(SERVER), $| = 1)[0]); # enable command buffering
# Send HTTP request to server
$enc_result = url_encode($result);
print SERVER "GET /$course/submitr.pl/?userid=$userid&lab=$lab&result=$enc_result&submit=submit HTTP/1.0\r\n\r\n";
# Get first HTTP response line
$line = ;
chomp($line);
($http_version, $errcode, $errmsg) = split(/\s+/, $line);
if ($errcode != 200) {
return "Error: HTTP request failed with error $errcode: $errmsg";
}
# Read the remaining HTTP response header lines
while ($line = ) {
if ($line =~ /^\r\n/) {
last;
}
}
# Read and return the response from the result server
$line = ;
chomp($line);
close SERVER;
return $line;

}
#
# url_encode - Encode text string so it can be included in URI of GET request
#
sub url_encode ($) {
my $value = shift;
$value =~s/([^a-zA-Z0-9_\-.])/uc sprintf("%%%02x",ord($1))/eg;
return $value;
}
# Always end a module with a 1 so that it returns TRUE
1;
76_cpp_92464/btest.h
/*
* CS:APP Data Lab
*/
/* Colors -- m. toups */
#define KNRM "\x1B[0m"
#define KRED "\x1B[31m"
#define KGRN "\x1B[32m"
#define KYEL "\x1B[33m"
#define KBLU "\x1B[34m"
#define KMAG "\x1B[35m"
#define KCYN "\x1B[36m"
#define KWHT "\x1B[1;37m"
/* Declare different function types */
typedef int (*funct_t) (void);
typedef int (*funct1_t)(int);
typedef int (*funct2_t)(int, int);
typedef int (*funct3_t)(int, int, int);
/* Combine all the information about a function and its tests as structure */
typedef struct {
char *name; /* String name */
funct_t solution_funct; /* Function */
funct_t test_funct; /* Test function */
int args; /* Number of function arguments */
char *ops; /* List of legal operators. Special case: "$" for floating point */
int op_limit; /* Max number of ops allowed in solution */
int rating; /* Problem rating (1 -- 4) */
int arg_ranges[3][2]; /* Argument ranges. Always defined for 3 args, even if */
/* the function takes fewer. Special case: First arg */
             /* must be set to {1,1} for f.p. puzzles */
} test_rec, *test_ptr;
extern test_rec test_set[];
76_cpp_92464/btest.c
/*
* CS:APP Data Lab
*
* btest.c - A test harness that checks a student's solution in bits.c
* for correctness.
*
* Copyright (c) 2001-2011, R. Bryant and D. O'Hallaron, All rights
* reserved. May not be used, modified, or copied without permission.
*
* This is an improved version of btest that tests large windows
* around zero and tmin and tmax for integer puzzles, and zero, norm,
* and denorm boundaries for floating point puzzles.
*
* Note: not 64-bit safe. Always compile with gcc -m32 option.
*/
#include
#include
#include
#include
#include
#include
#include
#include
#include "btest.h"
/* Not declared in some stdlib.h files, so define here */
float strtof(const char *nptr, char **endptr);
/* add pragma below to silence gcc warning about set but not used variable
* on line 528 (prior to me adding these lines) -- m. toups */
/*************************
* Configuration Constants
*************************/
/* Handle infinite loops by setting upper limit on execution time, in
seconds */
#define TIMEOUT_LIMIT 10
/* For functions with a single argument, generate TEST_RANGE values
above and below the min and max test values, and above and below
zero. Functions with two or three args will use square and cube
roots of this value, respectively, to avoid combinatorial
explosion */
#define TEST_RANGE 500000
/* This defines the maximum size of any test value array. The
gen_vals() routine creates k test values for each value of
TEST_RANGE, thus MAX_TEST_VALS must be at least k*TEST_RANGE */
#define MAX_TEST_VALS 13*TEST_RANGE
/**********************************
* Globals defined in other modules
**********************************/
/* This characterizes the set of puzzles to test.
Defined in decl.c and generated from templates in ./puzzles dir */
extern test_rec test_set[];
/************************************************
* Write-once globals defined by command line args
************************************************/
/* Emit results in a format for autograding, without showing
and counter-examples */
static int grade = 0;
/* Time out after this number of seconds */
static int timeout_limit = TIMEOUT_LIMIT; /* -T */
/* If non-NULL, test only one function (-f) */
static char* test_fname = NULL;
/* Special case when only use fixed argument(s) (-1, -2, or -3) */
static int has_arg[3] = {0,0,0};
static unsigned argval[3] = {0,0,0};
/* Use fixed weight for rating, and if so, what should it be? (-r) */
static int global_rating = 0;
/******************
* Helper functions
******************/
/*
* Signal - installs a signal handler
*/
typedef void handler_t(int);
handler_t *Signal(int signum, handler_t *handler)
{
struct sigaction action, old_action;
action.sa_handler = handler;
sigemptyset(&action.sa_mask); /* block sigs of type being handled */
action.sa_flags = SA_RESTART; /* restart syscalls if possible */
if (sigaction(signum, &action, &old_action) < 0)
    perror("Signal error");
return (old_action.sa_handler);
}
/*
* timeout_handler - SIGALARM hander
*/
sigjmp_buf envbuf;
void timeout_handler(int sig) {
siglongjmp(envbuf, 1);
}
/*
* random_val - Return random integer value between min and max
*/
static int random_val(int min, int max)
{
double weight = rand()/(double) RAND_MAX;
int result = min * (1-weight) + max * weight;
return result;
}
/*
* gen_vals - Generate the integer values we'll use to test a function
*/
static int gen_vals(int test_vals[], int min, int max, int test_range, int arg)
{
int i;
int test_count = 0;
/* Special case: If the user has specified a specific function
argument using the -1, -2, or -3 flags, then simply use this
argument and return */
if (has_arg[arg]) {
    test_vals[0] = argval[arg];
    return 1;
}
/*
* Special case: Generate test vals for floating point functions
* where the input argument is an unsigned bit-level
* representation of a float. For this case we want to test the
* regions around zero, the smallest normalized and largest
* denormalized numbers, one, and the largest normalized number,
* as well as inf and nan.
*/
if ((min == 1 && max == 1)) {
    unsigned smallest_norm = 0x00800000;
    unsigned one = 0x3f800000;
    unsigned largest_norm = 0x7f000000;
    
    unsigned inf = 0x7f800000;
    unsigned nan = 0x7fc00000;
    unsigned sign = 0x80000000;
    /* Test range should be at most 1/2 the range of one exponent
     value */
    if (test_range > (1 << 23)) {
     test_range = 1 << 23;
    }
    
    /* Functions where the input argument is an unsigned bit-level
     representation of a float. The number of tests generated
     inside this loop body is the value k referenced in the
     comment for the global variable MAX_TEST_VALS. */
    for (i = 0; i < test_range; i++) {
     /* Denorms around zero */
     test_vals[test_count++] = i;
     test_vals[test_count++] = sign | i;
    
     /* Region around norm to denorm transition */
     test_vals[test_count++] = smallest_norm + i;
     test_vals[test_count++] = smallest_norm - i;
     test_vals[test_count++] = sign | (smallest_norm + i);
     test_vals[test_count++] = sign | (smallest_norm - i);
    
     /* Region around one */
     test_vals[test_count++] = one + i;
     test_vals[test_count++] = one - i;
     test_vals[test_count++] = sign | (one + i);
     test_vals[test_count++] = sign | (one - i);
    
     /* Region below largest norm */
     test_vals[test_count++] = largest_norm - i;
     test_vals[test_count++] = sign | (largest_norm - i);
    }
    
    /* special vals */
    test_vals[test_count++] = inf; /* inf */
    test_vals[test_count++] = sign | inf; /* -inf */
    test_vals[test_count++] = nan; /* nan */
    test_vals[test_count++] = sign | nan; /* -nan */
    return test_count;
}
/*
* Normal case: Generate test vals for integer functions
*/
/* If the range is small enough, then do exhaustively */
if (max - MAX_TEST_VALS <= min) {
    for (i = min; i <= max; i++)
     test_vals[test_count++] = i;
    return test_count;
}
/* Otherwise, need to sample. Do so near the boundaries, around
zero, and for some random cases. */
for (i = 0; i < test_range; i++) {
    /* Test around the boundaries */
    test_vals[test_count++] = min + i;
    test_vals[test_count++] = max - i;
    /* If zero falls between min and max, then also test around zero */
    if (i >= min && i <= max)
     test_vals[test_count++] = i;
    if (-i >= min && -i <= max)
     test_vals[test_count++] = -i;
    /* Random case between min and max */
    test_vals[test_count++] = random_val(min, max);
}
return test_count;
}
/*
* test_0_arg - Test a function with zero arguments
*/
static int test_0_arg(funct_t f, funct_t ft, char *name)
{
int r = f();
int rt = ft();
int error = (r != rt);
if (error && !grade)
    printf(KRED "ERROR:" KNRM " Test " KYEL "%s()" KNRM " failed...\n...Gives %d[0x%x]. Should be %d[0x%x]\n", name, r, r, rt, rt);
return error;
}
/*
* test_1_arg - Test a function with one argument
*/
static int test_1_arg(funct_t f, funct_t ft, int arg1, char *name)
{
funct1_t f1 = (funct1_t) f;
funct1_t f1t = (funct1_t) ft;
int r, rt, error;
r = f1(arg1);
rt = f1t(arg1);
error = (r != rt);
if (error && !grade)
    printf(KRED "ERROR:" KNRM " Test " KYEL "%s(%d[0x%x])" KNRM " failed...\n...Gives %d[0x%x]. Should be %d[0x%x]\n", name, arg1, arg1, r, r, rt, rt);
return error;
}
/*
* test_2_arg - Test a function with two arguments
*/
static int test_2_arg(funct_t f, funct_t ft, int arg1, int arg2, char *name)
{
funct2_t f2 = (funct2_t) f;
funct2_t f2t = (funct2_t) ft;
int r = f2(arg1, arg2);
int rt = f2t(arg1, arg2);
int error = (r != rt);
if (error && !grade)
    printf(KRED "ERROR:" KNRM " Test " KYEL "%s(%d[0x%x],%d[0x%x])" KNRM " failed...\n...Gives %d[0x%x]. Should be %d[0x%x]\n", name, arg1, arg1, arg2, arg2, r, r, rt, rt);
return error;
}
/*
* test_3_arg - Test a function with three arguments
*/
static int test_3_arg(funct_t f, funct_t ft,
         int arg1, int arg2, int arg3, char *name)
{
funct3_t f3 = (funct3_t) f;
funct3_t f3t = (funct3_t) ft;
int r = f3(arg1, arg2, arg3);
int rt = f3t(arg1, arg2, arg3);
int error = (r != rt);
if (error && !grade)
    printf(KRED "ERROR:" KNRM " Test " KYEL "%s(%d[0x%x],%d[0x%x],%d[0x%x])" KNRM " failed...\n...Gives %d[0x%x]. Should be %d[0x%x]\n", name, arg1, arg1, arg2, arg2, arg3, arg3, r, r, rt, rt);
return error;
}
/*
* test_function - Test a function. Return number of errors
*/
static int test_function(test_ptr t) {
int test_counts[3]; /* number of test values for each arg */
int args = t->args; /* number of function arguments */
int arg_test_range[3]; /* test range for each argument */
int i, a1, a2, a3;
int errors = 0;
/* These are the test values for each arg. Declared with the
static attribute so that the array will be allocated in bss
rather than the stack */
static int arg_test_vals[3][MAX_TEST_VALS];
/* Sanity check on the number of args */
if (args < 0 || args > 3) {
    printf("Configuration error: invalid number of args (%d) for function %s\n", args, t->name);
    exit(1);
}
/* Assign range of argument test vals so as to conserve the total
number of tests, independent of the number of arguments */
if (args == 1) {
    arg_test_range[0] = TEST_RANGE;
}
else if (args == 2) {
    arg_test_range[0] = pow((double)TEST_RANGE, 0.5); /* sqrt */
    arg_test_range[1] = arg_test_range[0];
}
else {
    arg_test_range[0] = pow((double)TEST_RANGE, 0.333); /* cbrt */
    arg_test_range[1] = arg_test_range[0];
    arg_test_range[2] = arg_test_range[0];
}
/* Sanity check on the ranges */
if (arg_test_range[0] < 1)
    arg_test_range[0] = 1;
#pragma GCC diagnostic ignored "-Wmaybe-uninitialized"
if (arg_test_range[1] < 1)
    arg_test_range[1] = 1;
if (arg_test_range[2] < 1)
    arg_test_range[2] = 1;
/* Create a test set for each argument */
for (i = 0; i < args; i++) {
    test_counts[i] = gen_vals(arg_test_vals[i],
                 t->arg_ranges[i][0], /* min */
                 t->arg_ranges[i][1], /* max */
                 arg_test_range[i],
                 i);
}
/* Handle timeouts in the test code */
if (timeout_limit > 0) {
    int rc;
    rc = sigsetjmp(envbuf, 1);
    if (rc) {
     /* control will reach here if there is a timeout */
     errors = 1;
     printf(KRED "ERROR:" KNRM " Test " KYEL "%s" KNRM " failed.\n Timed out after %d secs (probably infinite loop)\n", t->name, timeout_limit);
     return errors;
    }
    alarm(timeout_limit);
}
/* Test function has no arguments */
if (args == 0) {
    errors += test_0_arg(t->solution_funct, t->test_funct, t->name);
    return errors;
}
/*
* Test function has at least one argument
*/

/* Iterate over the values for first argument */
for (a1 = 0; a1 < test_counts[0]; a1++) {
    if (args == 1) {
     errors += test_1_arg(t->solution_funct,
                 t->test_funct,
                 arg_test_vals[0][a1],
                 t->name);
     /* Stop testing if there is an error */
     if (errors)
        return errors;
    }
    else {
     /* if necessary, iterate over values for second argument */
     for (a2 = 0; a2 < test_counts[1]; a2++) {
        if (args == 2) {
         errors += test_2_arg(t->solution_funct,
                     t->test_funct,
                     arg_test_vals[0][a1],
                     arg_test_vals[1][a2],
                     t->name);
         /* Stop testing if there is an error */
         if (errors)
            return errors;
        }
        else {
         /* if necessary, iterate over vals for third arg */
         for (a3 = 0; a3 < test_counts[2]; a3++) {
            errors += test_3_arg(t->solution_funct,
                     t->test_funct,
                     arg_test_vals[0][a1],
                     arg_test_vals[1][a2],
                     arg_test_vals[2][a3],
                     t->name);
            
            /* Stop testing if there is an error */
            if (errors)
             return errors;
         } /* a3 */
        }
     } /* a2 */
    }
} /* a1 */

return errors;
}
/*
* run_tests - Run series of tests. Return number of errors
*/
static int run_tests()
{
int i;
int errors = 0;
double points = 0.0;
double max_points = 0.0;
printf(KWHT "Score\tRating\tErrors\tFunction\n" KNRM);
for (i = 0; test_set[i].solution_funct; i++) {
    int terrors;
    double tscore;
    double tpoints;
    if (!test_fname || strcmp(test_set[i].name,test_fname) == 0) {
     int rating = global_rating ? global_rating : test_set[i].rating;
     terrors = test_function(&test_set[i]);
     errors += terrors;
     tscore = terrors == 0 ? 1.0 : 0.0;
     tpoints = rating * tscore;
     points += tpoints;
     max_points += rating;
     if (grade || terrors < 1)
        printf(" %.0f\t%d\t%d\t%s\n",
         tpoints, rating, terrors, test_set[i].name);
    }
}
printf("Total points: %.0f/%.0f\n", points, max_points);
return errors;
}
/*
* get_num_val - Extract hex/decimal/or float value from string
*/
static int get_num_val(char *sval, unsigned *valp) {
char *endp;
/* See if it's an integer or floating point */
int ishex = 0;
int isfloat = 0;
int i;
for (i = 0; sval[i]; i++) {
    switch (sval[i]) {
    case 'x':
    case 'X':
     ishex = 1;
     break;
    case 'e':
    case 'E':
     if (!ishex)
        isfloat = 1;
     break;
    case '.':
     isfloat = 1;
     break;
    default:
     break;
    }
}
if (isfloat) {
    float fval = strtof(sval, &endp);
    if (!*endp) {
     *valp = *(unsigned *) &fval;
     return 1;
    }
    return 0;
} else {
    long long int llval = strtoll(sval, &endp, 0);
    long long int upperbits = llval >> 31;
    /* will give -1 for negative, 0 or 1 for positive */
    if (!*valp && (upperbits == 0 || upperbits == -1 || upperbits == 1)) {
     *valp = (unsigned) llval;
     return 1;
    }
    return 0;
}
}
/*
* usage - Display usage info
*/
static void usage(char *cmd) {
printf("Usage: %s [-hg] [-r ] [-f [-1|-2|-3 ]*] [-T ]\n", cmd);
printf(" -1 Specify first function argument\n");
printf(" -2 Specify second function argument\n");
printf(" -3 Specify third function argument\n");
printf(" -f Test only the named function\n");
printf(" -g Compact output for grading (with no error msgs)\n");
printf(" -h Print this message\n");
printf(" -r Give uniform weight of n for all problems\n");
printf(" -T Set timeout limit to lim\n");
exit(1);
}
/**************
* Main routine
**************/
int main(int argc, char *argv[])
{
char c;
/* parse command line args */
while ((c = getopt(argc, argv, "hgf:r:T:1:2:3:")) != -1)
switch (c) {
case 'h': /* help */
     usage(argv[0]);
     break;
    case 'g': /* grading option for autograder */
     grade = 1;
     break;
    case 'f': /* test only one function */
     test_fname = strdup(optarg);
     break;
    case 'r': /* set global rating for each problem */
     global_rating = atoi(optarg);
     if (global_rating < 0)
        usage(argv[0]);
     break;
    case '1': /* Get first argument */
     has_arg[0] = get_num_val(optarg, &argval[0]);
     if (!has_arg[0]) {
        printf("Bad argument '%s'\n", optarg);
        exit(0);
     }
     break;
    case '2': /* Get first argument */
     has_arg[1] = get_num_val(optarg, &argval[1]);
     if (!has_arg[1]) {
        printf("Bad argument '%s'\n", optarg);
        exit(0);
     }
     break;
    case '3': /* Get first argument */
     has_arg[2] = get_num_val(optarg, &argval[2]);
     if (!has_arg[2]) {
        printf("Bad argument '%s'\n", optarg);
        exit(0);
     }
     break;
    case 'T': /* Set timeout limit */
     timeout_limit = atoi(optarg);
     break;
    default:
     usage(argv[0]);
    }
if (timeout_limit > 0) {
    Signal(SIGALRM, timeout_handler);
}
/* test each function */
run_tests();
return 0;
}
76_cpp_92464/fshow.c
/* Display structure of floating-point numbers */
#include
#include
float strtof(const char *nptr, char **endptr);
#define FLOAT_SIZE 32
#define FRAC_SIZE 23
#define EXP_SIZE 8
#define BIAS ((1<<(EXP_SIZE-1))-1)
#define FRAC_MASK ((1<#define EXP_MASK ((1</* Floating point helpers */
unsigned f2u(float f)
{
union {
unsigned u;
float f;
} v;
v.u = 0;
v.f = f;
return v.u;
}
static float u2f(unsigned u)
{
union {
unsigned u;
float f;
} v;
v.u = u;
return v.f;
}
/* Get exponent */
unsigned get_exp(unsigned uf)
{
return (uf>>FRAC_SIZE) & EXP_MASK;
}
/* Get fraction */
unsigned get_frac(unsigned uf)
{
return uf & FRAC_MASK;
}
/* Get sign */
unsigned get_sign(unsigned uf)
{
return (uf>>(FLOAT_SIZE-1)) & 0x1;
}
void show_float(unsigned uf)
{
float f = u2f(uf);
unsigned exp = get_exp(uf);
unsigned frac = get_frac(uf);
unsigned sign = get_sign(uf);
printf("\nFloating point value %.10g\n", f);
printf("Bit Representation 0x%.8x, sign = %x, exponent = 0x%.2x, fraction = 0x%.6x\n",
     uf, sign, exp, frac);
if (exp == EXP_MASK) {
if (frac == 0) {
printf("%cInfinity\n", sign ? '-' : '+');
} else
printf("Not-A-Number\n");
} else {
int denorm = (exp == 0);
int uexp = denorm ? 1-BIAS : exp - BIAS;
int mantissa = denorm ? frac : frac + (1< float fman = (float) mantissa / (float) (1< printf("%s. %c%.10f X 2^(%d)\n",
     denorm ? "Denormalized" : "Normalized",
     sign ? '-' : '+',
     fman, uexp);
}
}
/* Extract hex/decimal/or float value from string */
static int get_num_val(char *sval, unsigned *valp) {
char *endp;
/* See if it's an integer or floating point */
int ishex = 0;
int isfloat = 0;
int i;
for (i = 0; sval[i]; i++) {
switch (sval[i]) {
case 'x':
case 'X':
ishex = 1;
break;
case 'e':
case 'E':
if (!ishex)
    isfloat = 1;
break;
case '.':
isfloat = 1;
break;
default:
break;
}
}
if (isfloat) {
float fval = strtof(sval, &endp);
if (!*endp) {
*valp = *(unsigned *) &fval;
return 1;
}
return 0;
} else {
long long int llval = strtoll(sval, &endp, 0);
long long int upperbits = llval >> 31;
/* will give -1 for negative, 0 or 1 for positive */
if (valp && (upperbits == 0 || upperbits == -1 || upperbits == 1)) {
*valp = (unsigned) llval;
return 1;
}
return 0;
}
}
void usage(char *fname) {
printf("Usage: %s val1 val2 ...\n", fname);
printf("Values may be given as hex patterns or as floating point numbers\n");
exit(0);
}
int main(int argc, char *argv[])
{
int i;
unsigned uf;
if (argc < 2)
usage(argv[0]);
for (i = 1; i < argc; i++) {
char *sval = argv[i];
if (get_num_val(sval, &uf)) {
show_float(uf);
} else {
printf("Invalid 32-bit number: '%s'\n", sval);
usage(argv[0]);
}
}
return 0;
}
76_cpp_92464/ishow.c
/* Display value of fixed point numbers */
#include
#include
/* Extract hex/decimal/or float value from string */
static int get_num_val(char *sval, unsigned *valp) {
char *endp;
/* See if it's an integer or floating point */
int ishex = 0;
int isfloat = 0;
int i;
for (i = 0; sval[i]; i++) {
switch (sval[i]) {
case 'x':
case 'X':
ishex = 1;
break;
case 'e':
case 'E':
if (!ishex)
    isfloat = 1;
break;
case '.':
isfloat = 1;
break;
default:
break;
}
}
if (isfloat) {
return 0; /* Not supposed to have a float here */
} else {
long long int llval = strtoll(sval, &endp, 0);
long long int upperbits = llval >> 31;
/* will give -1 for negative, 0 or 1 for positive */
if (valp && (upperbits == 0 || upperbits == -1 || upperbits == 1)) {
*valp = (unsigned) llval;
return 1;
}
return 0;
}
}
void show_int(unsigned uf)
{
printf("Hex = 0x%.8x,\tSigned = %d,\tUnsigned = %u\n",
     uf, (int) uf, uf);
}
void usage(char *fname) {
printf("Usage: %s val1 val2 ...\n", fname);
printf("Values may be given in hex or decimal\n");
exit(0);
}
int main(int argc, char *argv[])
{
int i;
unsigned uf;
if (argc < 2)
usage(argv[0]);
for (i = 1; i < argc; i++) {
char *sval = argv[i];
if (get_num_val(sval, &uf)) {
show_int(uf);
} else {
printf("Cannot convert '%s' to 32-bit number\n", sval);
}
}
return 0;
}
76_cpp_92464/driver.pl
#!/usr/bin/perl
#######################################################################
# driver.pl - CS:APP Data Lab driver
#
# Copyright (c) 2004-2011, R. Bryant and D. O'Hallaron, All rights
# reserved. May not be used, modified, or copied without permission.
#
# Note: The driver can use either btest or the BDD checker to check
# puzzles for correctness. This version of the lab uses btest, which
# has been extended to do better testing of both integer and
# floating-point puzzles.
#
#######################################################################
use strict 'vars';
use Getopt::Std;
use lib ".";
use Driverlib;
use Term::ANSIColor qw(colorstrip);
# Set to 1 to use btest, 0 to use the BDD checker.
my $USE_BTEST = 1;
# Generic settings
$| = 1; # Flush stdout each time
umask(0077); # Files created by the user in tmp readable only by that user
$ENV{PATH} = "/usr/local/bin:/usr/bin:/bin";
#
# usage - print help message and terminate
#
sub usage {
printf STDERR "$_[0]\n";
printf STDERR "Usage: $0 [-h] [-u \"nickname\"]\n";
printf STDERR "Options:\n";
printf STDERR " -h Print this message.\n";
printf STDERR " -u \"nickname\" Send autoresult to server, using nickname on scoreboard)\n";
die "\n";
}
##############
# Main routine
##############
my $login = getlogin() || (getpwuid($<))[0] || "unknown";
my $tmpdir = "/var/tmp/datalab.$login.$$";
my $diemsg = "The files are in $tmpdir.";
my $driverfiles;
my $infile;
my $autograded;
my $status;
my $inpuzzles;
my $puzzlecnt;
my $line;
my $blank;
my $name;
my $c_points;
my $c_rating;
my $c_errors;
my $p_points;
my $p_rating;
my $p_errors;
my $total_c_points;
my $total_c_rating;
my $total_p_points;
my $total_p_rating;
my $tops;
my $tpoints;
my $trating;
my $foo;
my $name;
my $msg;
my $nickname;
my $autoresult;
my %puzzle_c_points;
my %puzzle_c_rating;
my %puzzle_c_errors;
my %puzzle_p_points;
my %puzzle_p_ops;
my %puzzle_p_maxops;
my %puzzle_number;
# Parse the command line arguments
no strict;
getopts('hu:f:A');
if ($opt_h) {
usage();
}
# The default input file is bits.c (change with -f)
$infile = "bits.c";
$nickname = "";
#####
# These are command line args that every driver must support
#
# Causes the driver to send an autoresult to the server on behalf of user
if ($opt_u) {
$nickname = $opt_u;
    check_nickname($nickname);
}
# Hidden flag that indicates that the driver was invoked by an autograder
if ($opt_A) {
$autograded = $opt_A;
}
#####
# Drivers can also define an arbitary number of other command line args
#
# Optional hidden flag used by the autograder
if ($opt_f) {
$infile = $opt_f;
}
use strict 'vars';
################################################
# Compute the correctness and performance scores
################################################
# Make sure that an executable dlc (data lab compiler) exists
(-e "./dlc" and -x "./dlc")
or die "$0: ERROR: No executable dlc binary.\n";
# If using the bdd checker, then make sure it exists
if (!$USE_BTEST) {
(-e "./bddcheck/cbit/cbit" and -x "./bddcheck/cbit/cbit")
    or die "$0: ERROR: No executable cbit binary.\n";
}
#
# Set up the contents of the scratch directory
#
system("mkdir $tmpdir") == 0
or die "$0: Could not make scratch directory $tmpdir.\n";
# Copy the student's work to the scratch directory
unless (system("cp $infile $tmpdir/bits.c") == 0) {
clean($tmpdir);
die "$0: Could not copy file $infile to scratch directory $tmpdir.\n";
}
# Copy the various autograding files to the scratch directory
if ($USE_BTEST) {
$driverfiles = "Makefile dlc btest.c decl.c tests.c btest.h bits.h";
unless (system("cp -r $driverfiles $tmpdir") == 0) {
    clean($tmpdir);
    die "$0: Could not copy autogradingfiles to $tmpdir.\n";
}
}
else {
$driverfiles = "dlc tests.c bddcheck";
unless (system("cp -r $driverfiles $tmpdir") == 0) {
    clean($tmpdir);
    die "$0: Could not copy support files to $tmpdir.\n";
}
}
# Change the current working directory to the scratch directory
unless (chdir($tmpdir)) {
clean($tmpdir);
die "$0: Could not change directory to $tmpdir.\n";
}
#
# Generate a zapped (for coding rules) version of bits.c. In this
# zapped version of bits.c, any functions with illegal operators are
# transformed to have empty function bodies.
#
print "1. Running './dlc -z' to identify coding rules violations.\n";
system("cp bits.c save-bits.c") == 0
or die "$0: ERROR: Could not create backup copy of bits.c. $diemsg\n";
system("./dlc -z -o zap-bits.c bits.c") == 0
or die "$0: ERROR: zapped bits.c did not compile. $diemsg\n";
#
# Run btest or BDD checker to determine correctness score
#
if ($USE_BTEST) {
print "\n2. Compiling and running './btest -g' to determine correctness score.\n";
system("cp zap-bits.c bits.c");
# Compile btest
system("make btestexplicit") == 0
    or die "$0: Could not make btest in $tmpdir. $diemsg\n";
# Run btest
$status = system("./btest -g > btest-zapped.out 2>&1");
if ($status != 0) {
    die "$0: ERROR: btest check failed. $diemsg\n";
}
}
else {
print "\n2. Running './bddcheck/check.pl -g' to determine correctness score.\n";
system("cp zap-bits.c bits.c");
$status = system("./bddcheck/check.pl -g > btest-zapped.out 2>&1");
if ($status != 0) {
    die "$0: ERROR: BDD check failed. $diemsg\n";
}
}
#
# Run dlc to identify operator count violations.
#
print "\n3. Running './dlc -Z' to identify operator count violations.\n";
system("./dlc -Z -o Zap-bits.c save-bits.c") == 0
or die "$0: ERROR: dlc unable to generated Zapped bits.c file.\n";
#
# Run btest or the bdd checker to compute performance score
#
if ($USE_BTEST) {
print "\n4. Compiling and running './btest -g -r 2' to determine performance score.\n";
system("cp Zap-bits.c bits.c");
# Compile btest
system("make btestexplicit") == 0
    or die "$0: Could not make btest in $tmpdir. $diemsg\n";
print "\n";
# Run btest
$status = system("./btest -g -r 2 > btest-Zapped.out 2>&1");
if ($status != 0) {
    die "$0: ERROR: Zapped btest failed. $diemsg\n";
}
}
else {
print "\n4. Running './bddcheck/check.pl -g -r 2' to determine performance score.\n";
system("cp Zap-bits.c bits.c");
$status = system("./bddcheck/check.pl -g -r 2 > btest-Zapped.out 2>&1");
if ($status != 0) {
    die "$0: ERROR: Zapped bdd checker failed. $diemsg\n";
}
}
#
# Run dlc to get the operator counts on the...