实验四-动态分区分配算法.docxVIP

实验内容：存储器管理实验一、?实验目的采用首次适应算法（FF），最佳适应算法（BF），最坏适应算法（WF）三种不同的算法，实现对系统空闲区的动态分区分配。二、实验题目给予顺序搜索的动态分区算法的程序。?三、实验要求 读懂给出的核心代码，进行适当的修改，编译通过后，完成实验报告。四、核心代码#include stdio.h#include stdlib.h#include malloc.h//常量定义#define PROCESS_NAME_LEN 32 #define MIN_SLICE 10#define DEFAULT_MEM_SIZE 1024#define DEFAULT_MEM_START 0#define MA_FF 1#define MA_BF 2#define MA_WF 3int mem_size=DEFAULT_MEM_SIZE;int ma_algorithm = MA_FF;static int pid = 0;int flag = 0;struct free_block_type{ int size; int start_addr; struct free_block_type *next;}; struct free_block_type *free_block;//描述已分配的内存块struct allocated_block{ int pid;int size; int start_addr; char process_name[PROCESS_NAME_LEN]; struct allocated_block *next;};struct allocated_block *allocated_block_head = NULL;//函数声明struct free_block_type* init_free_block(int mem_size);void display_menu();int set_mem_size();void set_algorithm();void rearrange(int algorithm);int rearrange_FF();int rearrange_BF();int rearrange_WF();int new_process();int allocate_mem(struct allocated_block *ab);void kill_process();int free_mem(struct allocated_block *ab);int dispose(struct allocated_block *free_ab);int display_mem_usage();void do_exit();struct allocated_block *find_process(int pid);int main(){ char choice;pid=0; free_block= init_free_block(mem_size); //初始化空闲区 while(1) { display_menu(); //显示菜单 fflush(stdin); choice=getchar(); //获取用户输入 switch(choice){ case 1: set_mem_size(); break; //设置内存大小 case 2: set_algorithm();flag=1; break;//设置算法 case 3: new_process(); flag=1; break;//创建新进程 case 4: kill_process(); flag=1; break;//删除进程 case 5: display_mem_usage(); flag=1; break; //显示内存使用 case 0: do_exit(); exit(0); //释放链表并退出 default: break; } } return 1;}struct free_block_type* init_free_block(int mem_size){ struct free_block_type *fb; fb=(struct free_block_type *)malloc(sizeof(struct free_block_type)); if(fb==NULL){ printf(No mem\n); return NULL; } fb-size = mem_size; fb-start_addr = DEFAULT_MEM_START; fb-next = NULL; return fb;}void display_menu(){ printf(\n); printf(