计算机操作系统 内存动态分配和回收模拟实现

1、/COPYRIGHT 2010 tragedy ring finger. ALL RIGHTS RESERVED.#include <iomanip>#include <iostream>using namespace std;/¿ÕÏзÖÇø20¸ö£¬ÒÑ·ÖÅä·ÖÇø20¸östruct empty/¿Õ

2、ÏзÖÇø±íint address_of_start; /ÆðʼµØÖ· int size_of_empty; /¿ÕÏдóС int next;int yesorno; /ÊÇ·ñ¿ÕÏÐ,1 ¿ÕÏУ¬&

3、#211;ÐЧ Empty20;struct not_empty/ÒÑ·ÖÅä·ÖÇø±íint pid;int address_of_start;int size_of_notempty; int next;int yesorno; /ÊÇ·ñ·ÖÅ䣬1 ·ÖÅä ÓÐÐ

4、§ Not_Empty20;int CountOfEmpty=1,CountOfNotEmpty=0; /´Ó 0 ¿ªÊ¼¼ÆÊýint Min_Size = 2; /²»¿É·Ö¸îµÄ×îС·ÖÇøint Max_Size = 300; /×î´ó¿&

5、#213;¼ä300 X 300 = 90000int Num_Of_Row = 30; /ÏÔʾʱ£¬ºáÅŸöÊýint Num_Of_Area = 20; /¿ÕÏзÖÇø ºÍ ·ÖÅä·ÖÇø µÄ&#

6、215;î´ó·ÖÇøÊýint enough(int Size_Of_NotEmpty) /ÊÇ·ñÓÐ×ã¹»µÄ¿ÕÏпռäint i;for (i=0;i<CountOfEmpty;i+) /Ê×´ÎÊÊÓ¦ i

7、f (Emptyi.size_of_empty >= Size_Of_NotEmpty + Min_Size) return i;return -1;int where(int num ,int a) /ÕÒµ½ÆðʼµØַΪnumµÄÇøÓòµÄϱ꣬a0 = -1£¬Ô

8、;òÔÚNot_EmptyÖУ¬Ï±êΪa1£»a1 = -1 ÔÚEmptyÖУ¬Ï±êΪa0int i=0;while (i < Num_Of_Area) if (Emptyi.address_of_start = num && Emptyi.yesorno = 1) a0 = i; if

9、a0 = -1; a1 = i; return 0; a1 = -1; return 0; (Not_Emptyi.address_of_start = num && Not_Emptyi.yesorno = 1) i += 1;return -1;int fenpei()int temp,i;CountOfNotEmpty += 1;Not_EmptyCountOfNotEmpty.yesorno = 0;for (i=0;i<CountOfNotEmpty;i+) if (Not_Emptyi.yesorno = 0)(0 99),Õ¼Ó

10、ÿռä´óС(0 cout<<"ÊäÈë½ø³ÌID"<<Max_Size<<")n"cin>>Not_Emptyi.pid>>Not_Emptyi.size_of_notempty; if (Not_Emptyi.pid <0 | Not_Emptyi.pid > 99) CountOfNotEmpty -=

11、 1; for (int ii=0;ii<CountOfNotEmpty;ii+) if (Not_Emptyi.pid = Not_Emptyii.pid && i!= ii) CountOfNotEmpty -= 1; cout<<"½ø³ÌºÅ±ØÐëΨһn" return -1; cout<<"½ø³ÌºÅ 0

12、 99n" return -1; temp = enough(Not_Emptyi.size_of_notempty); if (temp >= 0) /ÕÒµ½ÄÜÂú×ãÇëÇóµÄ¿ÕÏзÖÇø = Not_Emptyi.address_of_startEmptytemp.address_of_start;Not_Emptyi.yes

13、orno = 1; Emptytemp.address_of_start Emptytemp.size_of_empty += -= Not_Emptyi.size_of_notempty; Not_Emptyi.size_of_notempty; else CountOfNotEmpty -= 1; cout<<"δÕÒµ½×ã¹»´óµÄ¿ÕÏзÖÇ

14、8;n" return -1; return 0;int front(int i,int&ÖеÄϱꡣa´æ¶ÔӦϱêfor (int a) /i Ϊ´ý»ØÊÕÇøÔÚ Not_Empty ii=0;ii<CountOfEmpty;ii+

15、) /È·¶¨´ý»ØÊÕÇøÇ°Ò»¸ö·ÖÇøÊÇ·ñÊÇ¿ÕÏзÖÇø£¬¼°·µ»Ø¿ÕÏз

16、14;ÇøµÄϱê if (Not_Emptyi.address_of_startEmptyii.address_of_start + Emptyii.size_of_empty&& Emptyii.yesorno = 1) = a = ii; return 0; = a i; /Èç¹ûÇ°Ò»·ÖÇø²»ÊÇ¿Õ&

17、#207;У¬ÔòÇ°Ò»·ÖÇøÊÇÒÑ·ÖÅ䣬»ò´ý»ØÊÕÇøÊǵÚÒ»¸ö·ÖÇø¡£return -1;int

18、 back(int i,int& a) /i Ϊ´ý»ØÊÕÇøÔÚ Not_Empty ÖеÄϱꡣa´æ¶ÔӦϱêfor (int ii= 0;ii<CountOfEmpty;ii+)if (Emptyii.address_of_startNot

19、_Emptyi.address_of_start + Not_Emptyi.size_of_notempty&& Emptyii.yesorno = 1) a = ii; return 0; = a = i;return -1;void swap(int i ,int j,int sign)if (sign = 0) empty temp; temp = Emptyi; Emptyi = Emptyj; Emptyj = temp; else not_empty temp; temp = Not_Emptyi; Not_Emptyi =Not_Emptyj; Not_Empty

20、j = temp;void decrease_CountOfEmpty()int i; for (i=0;i<CountOfEmpty;i+) if (Emptyi.yesorno = 0) swap(i,CountOfEmpty-1,0); CountOfEmpty -= 1;break;void decrease_CountOfNotEmpty()int i;for (i=0;i<CountOfNotEmpty;i+)if (Not_Emptyi.yesorno = 0)swap(i,CountOfNotEmpty-1,1);CountOfNotEmpty -= 1;break

21、;int huishou()int pid,i,a,b;cout<<"ÊäÈëÒª»ØÊյĽø³ÌºÅ"<<endl;cin>>pid;for (i=0;i<CountOfNotEmpty;i+)if (Not_Emptyi.pid = pid)if (front(i,a) = 0) /´ý»ØÊ

22、13;·ÖÇøÇ°ÃæÊÇ¿ÕÏзÖÇø Emptya.size_of_emptyNot_Emptyi.size_of_notempty;Not_Emptyi.yesorno = 0;if (back(i,b) = 0) /´ý»ØÊÕÇøºóÃæÊÇ¿Õ&

23、#207;зÖÇø Emptya.size_of_emptyEmptyb.size_of_empty;Emptyb.yesorno = 0;/¿ÕÂú¿Õ »ØÊÕÖ®ºó ¿Õdecrease_CountOfNotEmpty();decrease_CountOfEmpty();else /´ý»ØÊÕ·Ö

24、ÇøºóÃæû·ÖÇø,»òºóÃæÊÇÒÑ·ÖÅä·ÖÇø += += /¿ÕÂú »ØÊÕÖ®ºó ¿Õ /¿ÕÂú

25、;Âú »ØÊÕÖ®ºó ¿ÕÂú decrease_CountOfNotEmpty(); else /´ý»ØÊÕ·ÖÇøÇ°Ãæû·ÖÇø,»òÇ°ÃæÊÇÒ

26、09;·ÖÅä·ÖÇø if (back(i,b) = 0) /´ý»ØÊÕÇøºóÃæÊÇ¿ÕÏзÖÇø Emptyb.address_of_start =+= Not_Emptyi.address_of_start; Emptyb.size_of_emptyNot_Emptyi.size_of

27、_notempty;Emptyb.yesorno = 1;Not_Emptyi.yesorno = 0; /ÂúÂú¿Õ »ØÊÕÖ®ºó Âú¿Õ /Âú¿Õ »ØÊÕÖ®ºó ¿Õ decrease_CountOfNotEmpty(); else /´ý&

28、#187;ØÊÕ·ÖÇøºóÃæû·ÖÇø,»òºóÃæÊÇÒÑ·ÖÅä·ÖÇø a = -1; for (int ii=0;ii<CountOfEmpty;ii+) /¡ý¡ý¡ý

29、¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý¡ý

30、¡ý¡ý¡ý if (Emptyii.yesorno = 0) /ÕÒÒ»¸öûÓõĿÕÏзÖÇø±í£¬½«Ï±í·Ö¸øa£¬Èç¹&#

31、251;¶¼ÓÐÓ㬾ÍÀ©´ó¿ÕÏзÖÇø±íµÄ´óС a = ii; break; if (a = -1) CountOfEmpty += 1; /ÕÒÒ»¸öûÓõ&#

32、196;¿ÕÏзÖÇø±í£¬½«Ï±í·Ö¸øa£¬Èç¹û¶¼ÓÐÓ㬾ÍÀ©´ó¿ÕÏзÖÇ&

33、#248;±íµÄ´óСa = CountOfEmpty - 1; /¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡&#

34、252;¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡ü¡üEmptya.address_of_start = Not_Emptyi.address_of_start; Emptya.size_of_emptyNot_Emptyi.size_of_notempty;E

35、mptya.yesorno = 1; Not_Emptyi.yesorno = 0; /ÂúÂú Âú¿Õ /Âú »ØÊÕÖ®ºó ¿Õ /ÂúÂúÂú Âú¿ÕÂú / ÂúÂú ¿ÕÂú dec

36、rease_CountOfNotEmpty(); / CountOfNotEmpty -= 1;»ØÊÕÖ®ºóÈÃÒÑ·ÖÅä·ÖÇøÊý¼õÒ»£¬µ«ÊÇû¿¼Âǵ½¶Ô

37、Ó¦Çé¿ö»áʹ¿ÕÏкͷÖÅäÇøÊýÁ¿±ä»ò²»±äreturn 0;void qsort_empty_address_of_start(empty a,int low,int high) int i = low,j = high;empty

38、temp=alow; while(i<j)while(i<j && temp.address_of_start<= aj.address_of_start) j-;if(i<j) ai = aj; i+; while (i<j && ai.address_of_start < temp.address_of_start) if(i<j) aj = ai; j-; i+; ai = temp;if(low<i) qsort_empty_address_of_start(a,low,i-1); if(i<high

39、) qsort_empty_address_of_start(a,j+1,high); void show()int a2,num = 0,i,count = 0,times=0;cout<<"n*n"<<endl;while (count < Max_Size) where(num,a); if (a0 > a1) for (i=0;i<Emptya0.size_of_empty;i+) cout<<"¡ð" count += 1; if (count)% Num_Of_Row = 0) cout<<endl; Memory State num += Emptya0.size_of_empty; else cout<<setw(2)<<Not_Emptya1.pid; count +=