资源简介
csapp的第7个lab，也是花了我最长时间的lab，用的是分离链表的首次适配，得了94分，具体函数功能都有注释，希望对大家有帮助
代码片段和文件信息
/*
* mm.c
*
* Main Idea:
* data structure : seglist
* I applied 20 lists here with same length from [2^i2^（i+1）]
*
* for each block if it is allocated store its head and foot;
* if it is freed aside its head and foot also store *prev and *next
* （will explain more about this later）
*
* fit method : traverse every list and find the first fit free block
* and search each list by its address since they are in address increasing
* order when they are inserted
*
* coalesce method : use bounday tag to help coalesce and coalesce immediately
*
*
*
*/
#include
#include
#include
#include
#include
#include “mm.h“
#include “memlib.h“
/* If you want debugging output use the following macro.- 上一篇：基于VHDL_的数字密码锁设计
- 下一篇：虚拟仪器的发展前景
评论
共有 条评论