操作系统课程设计——动态异长分区的存储分配与回收算法.doc

/该文件所含代码是课设需要学生自己写的代码和补充的代码，包含部分需要修改的课程设计指导书中的代码，不包含不需修改的代码/1.显示空闲区表void display_freearea_list() FREEAREA *p;char buffer20; p=p_free_area_list;printf(|-|-|n);printf(| start_address(kB) | size(KB) |n);printf(|-|-|n);while(p!=NULL)printf(| %d,p-start_address);itoa( p-start_address, buffer, 10 );print_space(19-strlen(buffer);printf(| %d,p-size);itoa(p-size, buffer, 10 );print_space(17-strlen(buffer);printf(|n);p=p-next; printf(|-|-|nn);/2.最先适应分配法：内存释放函数void FF_release_memory(int start_address,int size)EnterCriticalSection(&CS_FREEAREA_LIST);_int64 t1, t2;/记录该算法起止时间t1 = GetCycleCount();/记录起始时间FREEAREA *temp,*p,*pp;/将空闲区按start_address由小到大排序，以便整合相邻空闲区while(1)int change = 0;p = p_free_area_list;if(p-next != NULL)if(p-start_address p-next-start_address)pp = p-next;p-next = pp-next;pp-next = p;p_free_area_list = pp;change = 1;if(p-next != NULL)while(p-next-next != NULL)if(p-next-start_address p-next-next-start_address )pp = p-next-next;p-next-next = pp-next;pp-next = p-next;p-next = pp;change = 1;p = p-next ;if(change = 0)break;/插入空闲区temp = new FREEAREA;p = new FREEAREA;temp-start_address = start_address;temp-size = size;temp-next = NULL;p-next = p_free_area_list;while(p-next != NULL)if(p-next-start_address temp-start_address)temp-next = p-next ;p-next = temp;break;elsep = p-next ;if(p-next = NULL)p-next = temp;else if(temp-next = p_free_area_list)p_free_area_list = temp;/整合碎片while(1)int change = 0;p = p_free_area_list;if(p = NULL)break;while(p-next != NULL)if(p-start_address + p-size) = (p-next-start_address)p-size = p-next-size + p-size;change = 1; if(p-next-next = NULL)free(p-next);p-next = NULL;elsep-next = p-next-next;if(p-next = NULL)break;elsep = p-next ;if(change = 0)break;/整理线程结束后的驻留链表THREAD_RESIDENCE_MEMORY *q;q = p_thread_residence_memory_list;if(q-start_address = start_address)p_thread_residence_memory_list = p_thread_residence_memory_list-next ;elsewhile(q-next != NULL)if(q-next-start_address = start_address)if(q-next = tail_thread_residence_memory_list)tail_thread_residence_memory_list = q;q-next = q-next-next ;break;q = q-next;/记录结束时间，并将运行时间存入对应数组t2 = GetCycleCount();if(time00 t2 - t1)time00 = t2 - t1;if(time01 next != NULL)if(p-start_address p-next-start_address)pp = p-next;p-next = pp-next;pp-next = p;p_free_area_list = pp;change = 1;if(p-next != NULL)while(p-next-next != NULL)if(p-next-start_address p-next-next-start_address )pp = p-next-next;p-next-next = pp-next;pp-next = p-next;p-next = pp;change = 1;p = p-next ;if(change = 0)break;/插入空闲区temp = new FREEAREA;p = new FREEAREA;temp-start_address = start_address;temp-size = size;temp-next = NULL;p-next = p_free_area_list;while(p-next != NULL)if(p-next-start_address temp-start_address)temp-next = p-next ;p-next = temp;break;elsep = p-next ;if(p-next = NULL)p-next = temp;else if(temp-next = p_free_area_list)p_free_area_list = temp;/整合碎片while(1)int change = 0;p = p_free_area_list;if(p = NULL)break;while(p-next != NULL)if(p-start_address + p-size) = (p-next-start_address)p-size = p-next-size + p-size;change = 1; if(p-next-next = NULL)free(p-next);p-next = NULL;elsep-next = p-next-next;if(p-next = NULL)break;elsep = p-next ;if(change = 0)break;/将空闲区按SIZE由小到大排序，以便符合BF算法while(1)int change = 0;p = p_free_area_list;if(p-size p-next-size)pp = p-next;p-next = pp-next;pp-next = p;p_free_area_list = pp;change = 1;while(p-next-next != NULL)if(p-next-size p-next-next-size )pp = p-next-next;p-next-next = pp-next;pp-next = p-next;p-next = pp;change = 1;p = p-next ;if(change = 0)break;/整理线程结束后的驻留链表THREAD_RESIDENCE_MEMORY *q;q = p_thread_residence_memory_list;if(q-start_address = start_address)p_thread_residence_memory_list = p_thread_residence_memory_list-next ;elsewhile(q-next != NULL)if(q-next-start_address = start_address)if(q-next = tail_thread_residence_memory_list)tail_thread_residence_memory_list = q;q-next = q-next-next ;break;q = q-next;/记录结束时间，并将运行时间存入对应数组t2 = GetCycleCount();if(time10 t2 - t1)time10 = t2 - t1;if(time11 next != NULL)if(p-start_address p-next-start_address)pp = p-next;p-next = pp-next;pp-next = p;p_free_area_list = pp;change = 1;if(p-next != NULL)while(p-next-next != NULL)if(p-next-start_address p-next-next-start_address )pp = p-next-next;p-next-next = pp-next;pp-next = p-next;p-next = pp;change = 1;p = p-next ;if(change = 0)break;/插入空闲区temp = new FREEAREA;temp-start_address = start_address;temp-size = size;temp-next = NULL;p = new FREEAREA;p-next = p_free_area_list;while(p-next != NULL)if(p-next-start_address temp-start_address)temp-next = p-next ;p-next = temp;break;elsep = p-next ;if(p-next = NULL)p-next = temp;else if(temp-next = p_free_area_list)p_free_area_list = temp;/整合碎片while(1)int change = 0;p = p_free_area_list;if(p = NULL)break;while(p-next != NULL)if(p-start_address + p-size) = (p-next-start_address)p-size = p-next-size + p-size;change = 1; if(p-next-next = NULL)free(p-next);p-next = NULL;elsep-next = p-next-next;if(p-next = NULL)break;elsep = p-next ;if(change = 0)break;/将空闲区按SIZE由大到小排序，以便符合WF算法while(1)int change = 0;p = p_free_area_list;if(p-size next-size)pp = p-next;p-next = pp-next;pp-next = p;p_free_area_list = pp;change = 1;while(p-next-next != NULL)if(p-next-size next-next-size )pp = p-next-next;p-next-next = pp-next;pp-next = p-next;p-next = pp;change = 1;p = p-next ;if(change = 0)break;/整理线程结束后的驻留链表THREAD_RESIDENCE_MEMORY *q;q = p_thread_residence_memory_list;if(q-start_address = start_address)p_thread_residence_memory_list = p_thread_residence_memory_list-next ;elsewhile(q-next != NULL)if(q-next-start_address = start_address)if(q-next = tail_thread_residence_memory_list)tail_thread_residence_memory_list = q;q-next = q-next-next ;break;q = q-next;/记录结束时间，并将运行时间存入对应数组t2 = GetCycleCount();if(time20 t2 - t1)time20 = t2 - t1;if(time21 t2 - t1)time21 = t2 - t1; LeaveCriticalSection(&CS_FREEAREA_LIST);/5.二维数组，用于存放各种算法所需的最长时间和最短时间_int64 time32 = 99999999,0,99999999,0,99999999,0;/6.显示程序运行时间void display_time(int n)EnterCriticalSection(&CS_SCREEN);printf(最短时间:%ld纳秒n,timen0);printf(最长时间:%ld纳秒n,timen1);LeaveCriticalSecti