软件工程ssd6练习3答案

//This is the solution, but has been modied to ask you to ll

//the missing components instead of asking you to start from scratch

// The missing part is indicated by ______ with a yellow square

#include <stdlib.h>

#include <string.h>

#include "debugmalloc.h"

#include "dmhelper.h"

#include <stdio.h>

size_t size; /* 4 bytes

size does not include header and footer */

int fence;

};

#dene FOOTERSIZE sizeof(struct footer)

/* currently 4 bytes */

struct footer {

int fence;

};

/* Global indicating # bytes allocated */

char *lename;

int linenum;

block_list *next;

};

/* global list */

block_list *allocatedList;//the header of the list

/* helper functions */

int add_block_to_list(void *ptr, int size, char *lename, int linenum) {

block_list *newblock;

char *name;

free(newblock);

return -1;

}

strcpy(name, lename);

newblock->ptr = ptr;

newblock->size = size;

newblock->lename = name;

newblock->linenum = linenum;

newblock->next = allocatedList;

allocatedList = newblock;

return 0;

if (!prevblock) {

allocatedList = ______->____; //the next block of currblock

}

else {

_____->___ = currblock->next; //the next block of prevblock

}

free(____->______); //free the lename of currblock

free( ); //free the currblock

return 0;

}

prevblock = _______; //equal to the currblock

currblock = ______->____; //equal to the next of currblock

}

while (currblock) {

if (currblock->ptr == ptr) {

return ________; //return currblock

}

currblock = currblock->next;

}

return _____; //return the null pointer

}

/* Taken from 15-213 Lab 1 */

int bitCount(int x) {

/* Sum 8 groups of 4 bits each */

s += x>>3 & mask;

/* Now combine high and low order sums */

s = s + (s >> 16);