操作系統(tǒng)課程設計——動態(tài)異長分區(qū)的存儲分配與回收算法

1、/該文件所含代碼是課設需要學生自己寫的代碼和補充的代碼，包含部分需要修改的課程設計指導書中的代碼，不包含不需修改的代碼/1.顯示空閑區(qū)表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

2、_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.最先適應分配法：內(nèi)存釋放函數(shù)void FF_release_memory(int start_address,i

3、nt size)EnterCriticalSection(&CS_FREEAREA_LIST);_int64 t1, t2;/記錄該算法起止時間t1 = GetCycleCount();/記錄起始時間FREEAREA *temp,*p,*pp;/將空閑區(qū)按start_address由小到大排序，以便整合相鄰空閑區(qū)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;

4、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

5、 = pp;change = 1;p = p->next ;if(change = 0)break;/插入空閑區(qū)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->

6、;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) = (

7、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 =

8、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_

9、list = q;q->next = q->next->next ;break;q = q->next;/記錄結束時間，并將運行時間存入對應數(shù)組t2 = GetCycleCount();if(time00 > t2 - t1)time00 = t2 - t1;if(time01 < t2 - t1)time01 = t2 - t1; LeaveCriticalSection(&CS_FREEAREA_LIST);/3.最佳適應分配算法的內(nèi)存釋放函數(shù)void BF_release_memory(int start_address,int size)En

10、terCriticalSection(&CS_FREEAREA_LIST);_int64 t1, t2;/記錄該算法起止時間t1 = GetCycleCount();/記錄起始時間FREEAREA *temp,*p,*pp;/將空閑區(qū)按start_address由小到大排序，以便整合相鄰空閑區(qū)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

11、 = 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;chan

12、ge = 1;p = p->next ;if(change = 0)break;/插入空閑區(qū)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-

13、>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

14、->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;/將空閑區(qū)按SIZE由小到大排序，以便符合BF算法while(1)int change = 0;p = p_

15、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-&g

16、t;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)

17、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;/記錄結束時間，并將運行時間存入對應數(shù)組t2 = GetCycleCount();if(time10 > t2 - t1)time10 = t2 - t1;if(time11 < t2 - t1)time1

18、1 = t2 - t1; LeaveCriticalSection(&CS_FREEAREA_LIST);/4.最壞適應分配算法：內(nèi)存釋放函數(shù)void WF_release_memory(int start_address,int size)EnterCriticalSection(&CS_FREEAREA_LIST);_int64 t1, t2;/記錄該算法起止時間t1 = GetCycleCount();/記錄起始時間FREEAREA *temp,*p,*pp;/將空閑區(qū)按start_address由小到大排序，以便整合相鄰空閑區(qū)while(1)int change = 0

19、;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->n

20、ext->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;/插入空閑區(qū)temp = new FREEAREA;temp->start_address = start_address;temp->size = size;temp->next = NULL;p = new FREEAREA;p->

21、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)in

22、t 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->

23、;next;if(p->next = NULL)break;elsep = p->next ;if(change = 0)break;/將空閑區(qū)按SIZE由大到小排序，以便符合WF算法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 !=

24、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_

25、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;/記錄結束時間，并將運行時間存入對應數(shù)組t2 = GetCycleCount();if(time20 > t2 - t1)time20 = t2 - t1;if(time21 < t2 - t1)time21 = t2 - t1; LeaveCriticalSection(&CS_FREEAREA_LIST);/5.二維數(shù)組，用于存放各種算法所需的最長時間和最短時間_int64 time32 = 99999999,0,99999999,0,99999999,0;/6.顯示程序運行時間void display_time(int