头歌平台 操作系统 首次适应算法

作者: HUI 发布: 2022年5月8日 5阅读 0评论

1
#include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; #include &lt;stdbool.h&gt; #define FREE <span class="hljs-number">0</span> #define BUSY <span class="hljs-number">1</span> #define Max_length <span class="hljs-number">640</span> typedef struct freearea { int ID; int size; int address; bool isUsed; } freearea; typedef struct DuNode { freearea <span class="hljs-keyword">data</span>; struct DuNode *prior; struct DuNode *next; } DuNode, *DuLinkList; DuLinkList m_rid; DuLinkList m_last; void init() { m_rid &#61; (DuLinkList)malloc(sizeof(DuNode)); m_last &#61; (DuLinkList)malloc(sizeof(DuNode)); <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span>prior &#61; NULL; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span>next &#61; m_last; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span>prior &#61; m_rid; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span>next &#61; NULL; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span><span class="hljs-keyword">data</span>.size &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; BUSY;  <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.address &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.size &#61; Max_length; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.ID &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; <span class="hljs-number">0</span>; } int first_fit(int ID,int size) { DuLinkList temp &#61; (DuLinkList)malloc(sizeof(DuNode)); D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;ID; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.size&#61;size; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;BUSY; <span class="hljs-keyword">while</span>(p) { <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-keyword">data</span>.ID &#61;&#61; ID) { printf(<span class="hljs-string">&#34;该作业号对应的作业已经在内存中&#xff01;&#34;</span>); return <span class="hljs-number">0</span>; } <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed&#61;&#61;FREE &amp;&amp; p-&gt;</span><span class="hljs-keyword">data</span>.size&#61;&#61;size) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;BUSY; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;ID; return <span class="hljs-number">1</span>; } <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed&#61;&#61;FREE &amp;&amp; p-&gt;</span><span class="hljs-keyword">data</span>.size&gt;size) { <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span>next&#61;p; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>&#61;p-&gt;</span>prior; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#61;p-&gt;</span><span class="hljs-keyword">data</span>.address; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span>next&#61;temp; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span>prior&#61;temp; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#61;temp-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#43;temp-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.size-&#61;size; return <span class="hljs-number">1</span>; } <span class="hljs-function"><span class="hljs-title">p</span>&#61;p-&gt;</span>next; } return <span class="hljs-number">0</span>; } void alloc() { int ID,size1; printf(<span class="hljs-string">&#34;请输入作业号&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;ID); printf(<span class="hljs-string">&#34;请输入所需内存大小&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;size1); <span class="hljs-keyword">if</span> (ID&lt;&#61;<span class="hljs-number">0</span> || size1&lt;&#61;<span class="hljs-number">0</span>) printf(<span class="hljs-string">&#34;错误&#xff01;请输入正确的作业号和请求的内存大小&#34;</span>); <span class="hljs-keyword">if</span>(first_fit(ID,size1)) printf(<span class="hljs-string">&#34;分配内存成功&#xff01;\n&#34;</span>); <span class="hljs-keyword">else</span> printf(<span class="hljs-string">&#34;分配内存失败&#xff01;\n&#34;</span>); } void freeNode() { int ID; D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; printf(<span class="hljs-string">&#34;输入需要释放内存的作业号&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;ID); <span class="hljs-keyword">while</span> (p) { <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.ID &#61;&#61; ID) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.ID &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; FREE; <span class="hljs-function"><span class="hljs-title">if</span> (!p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span>next; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span> &#61; p-&gt;</span>prior; } <span class="hljs-function"><span class="hljs-title">if</span> (!p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed)  { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>prior&#61;p; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-function"><span class="hljs-title">if</span>(!p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; !p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed)  { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span> &#61; p-&gt;</span>prior; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } printf(<span class="hljs-string">&#34;释放内存成功&#xff01;\n&#34;</span>); break; } <span class="hljs-function"><span class="hljs-title">p</span> &#61; p-&gt;</span>next; <span class="hljs-keyword">if</span>(!p) printf(<span class="hljs-string">&#34;内存中没有该需要释放内存的作业&#xff01;&#34;</span>); } } void show() { printf(<span class="hljs-string">&#34;------------------&#34;</span>); printf(<span class="hljs-string">&#34;内存分配情况&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; <span class="hljs-keyword">while</span>(p) { printf(<span class="hljs-string">&#34;分区号&#xff1a;&#34;</span>); <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;&#61;FREE) printf(<span class="hljs-string">&#34;FREE\n&#34;</span>); <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;%d \n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.ID); <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;起始地址&#xff1a;%d\n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.address); <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;内存大小&#xff1a;%d\n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.size); printf(<span class="hljs-string">&#34;分区状态&#xff1a;&#34;</span>); <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;&#61;FREE) printf(<span class="hljs-string">&#34;空闲\n&#34;</span>); <span class="hljs-keyword">else</span> printf(<span class="hljs-string">&#34;已分配\n&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); <span class="hljs-function"><span class="hljs-title">p</span>&#61;p-&gt;</span>next; } } int main() { printf(<span class="hljs-string">&#34;------------------&#34;</span>); printf(<span class="hljs-string">&#34;首次适应算法&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); init(); int tag &#61; <span class="hljs-number">1</span>; <span class="hljs-keyword">while</span>(tag &lt; <span class="hljs-number">3</span> &amp;&amp; tag &gt; <span class="hljs-number">0</span>) { printf(<span class="hljs-string">&#34;输入要进行的操作&#34;</span>); printf(<span class="hljs-string">&#34;&#xff08;1-分配内存&#xff0c;2-内存释放&#xff0c;其他-退出程序&#xff09;&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;tag); switch(tag) { case <span class="hljs-number">1</span>: alloc(); show(); break; case <span class="hljs-number">2</span>: freeNode(); show(); break; default: printf(<span class="hljs-string">&#34;程序已退出&#xff01;&#34;</span>); } } }

1
#include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; #include &lt;stdbool.h&gt; #define FREE <span class="hljs-number">0</span> #define BUSY <span class="hljs-number">1</span> #define Max_length <span class="hljs-number">640</span> typedef struct freearea { int ID; int size; int address; bool isUsed; } freearea; typedef struct DuNode { freearea <span class="hljs-keyword">data</span>; struct DuNode *prior; struct DuNode *next; } DuNode, *DuLinkList; DuLinkList m_rid; DuLinkList m_last; void init() { m_rid &#61; (DuLinkList)malloc(sizeof(DuNode)); m_last &#61; (DuLinkList)malloc(sizeof(DuNode)); <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span>prior &#61; NULL; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span>next &#61; m_last; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span>prior &#61; m_rid; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span>next &#61; NULL; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span><span class="hljs-keyword">data</span>.size &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_rid</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; BUSY;  <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.address &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.size &#61; Max_length; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.ID &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">m_last</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; <span class="hljs-number">0</span>; } int first_fit(int ID,int size) { DuLinkList temp &#61; (DuLinkList)malloc(sizeof(DuNode)); D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;ID; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.size&#61;size; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;BUSY; <span class="hljs-keyword">while</span>(p) { <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-keyword">data</span>.ID &#61;&#61; ID) { printf(<span class="hljs-string">&#34;该作业号对应的作业已经在内存中&#xff01;&#34;</span>); return <span class="hljs-number">0</span>; } <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed&#61;&#61;FREE &amp;&amp; p-&gt;</span><span class="hljs-keyword">data</span>.size&#61;&#61;size) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;BUSY; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;ID; return <span class="hljs-number">1</span>; } <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed&#61;&#61;FREE &amp;&amp; p-&gt;</span><span class="hljs-keyword">data</span>.size&gt;size) { <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span>next&#61;p; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>&#61;p-&gt;</span>prior; <span class="hljs-function"><span class="hljs-title">temp</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#61;p-&gt;</span><span class="hljs-keyword">data</span>.address; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span>next&#61;temp; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span>prior&#61;temp; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#61;temp-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.address&#43;temp-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.size-&#61;size; return <span class="hljs-number">1</span>; } <span class="hljs-function"><span class="hljs-title">p</span>&#61;p-&gt;</span>next; } return <span class="hljs-number">0</span>; } void alloc() { int ID,size1; printf(<span class="hljs-string">&#34;请输入作业号&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;ID); printf(<span class="hljs-string">&#34;请输入所需内存大小&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;size1); <span class="hljs-keyword">if</span> (ID&lt;&#61;<span class="hljs-number">0</span> || size1&lt;&#61;<span class="hljs-number">0</span>) printf(<span class="hljs-string">&#34;错误&#xff01;请输入正确的作业号和请求的内存大小&#34;</span>); <span class="hljs-keyword">if</span>(first_fit(ID,size1)) printf(<span class="hljs-string">&#34;分配内存成功&#xff01;\n&#34;</span>); <span class="hljs-keyword">else</span> printf(<span class="hljs-string">&#34;分配内存失败&#xff01;\n&#34;</span>); } void freeNode() { int ID; D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; printf(<span class="hljs-string">&#34;输入需要释放内存的作业号&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;ID); <span class="hljs-keyword">while</span> (p) { <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.ID &#61;&#61; ID) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.ID &#61; <span class="hljs-number">0</span>; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed &#61; FREE; <span class="hljs-function"><span class="hljs-title">if</span> (!p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span>next; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span> &#61; p-&gt;</span>prior; } <span class="hljs-function"><span class="hljs-title">if</span> (!p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed)  { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>prior&#61;p; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-function"><span class="hljs-title">if</span>(!p-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.isUsed &amp;&amp; !p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.isUsed)  { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43;&#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">data</span>.size &#43; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-keyword">data</span>.size; <span class="hljs-function"><span class="hljs-title">if</span>(p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next) { <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span> &#61; p-&gt;</span>prior; <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">p</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">prior</span>-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span> &#61; p-&gt;</span><span class="hljs-function"><span class="hljs-title">next</span>-&gt;</span>next; } printf(<span class="hljs-string">&#34;释放内存成功&#xff01;\n&#34;</span>); break; } <span class="hljs-function"><span class="hljs-title">p</span> &#61; p-&gt;</span>next; <span class="hljs-keyword">if</span>(!p) printf(<span class="hljs-string">&#34;内存中没有该需要释放内存的作业&#xff01;&#34;</span>); } } void show() { printf(<span class="hljs-string">&#34;------------------&#34;</span>); printf(<span class="hljs-string">&#34;内存分配情况&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); D<span class="hljs-function"><span class="hljs-title">uNode</span> *p &#61; m_rid-&gt;</span>next; <span class="hljs-keyword">while</span>(p) { printf(<span class="hljs-string">&#34;分区号&#xff1a;&#34;</span>); <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.ID&#61;&#61;FREE) printf(<span class="hljs-string">&#34;FREE\n&#34;</span>); <span class="hljs-keyword">else</span> <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;%d \n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.ID); <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;起始地址&#xff1a;%d\n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.address); <span class="hljs-function"><span class="hljs-title">printf</span>(&#34;内存大小&#xff1a;%d\n&#34;, p-&gt;</span><span class="hljs-keyword">data</span>.size); printf(<span class="hljs-string">&#34;分区状态&#xff1a;&#34;</span>); <span class="hljs-function"><span class="hljs-title">if</span> (p-&gt;</span><span class="hljs-keyword">data</span>.isUsed&#61;&#61;FREE) printf(<span class="hljs-string">&#34;空闲\n&#34;</span>); <span class="hljs-keyword">else</span> printf(<span class="hljs-string">&#34;已分配\n&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); <span class="hljs-function"><span class="hljs-title">p</span>&#61;p-&gt;</span>next; } } int main() { printf(<span class="hljs-string">&#34;------------------&#34;</span>); printf(<span class="hljs-string">&#34;首次适应算法&#34;</span>); printf(<span class="hljs-string">&#34;------------------\n&#34;</span>); init(); int tag &#61; <span class="hljs-number">1</span>; <span class="hljs-keyword">while</span>(tag &lt; <span class="hljs-number">3</span> &amp;&amp; tag &gt; <span class="hljs-number">0</span>) { printf(<span class="hljs-string">&#34;输入要进行的操作&#34;</span>); printf(<span class="hljs-string">&#34;&#xff08;1-分配内存&#xff0c;2-内存释放&#xff0c;其他-退出程序&#xff09;&#xff1a;&#34;</span>); scanf(<span class="hljs-string">&#34;%d&#34;</span>, &amp;tag); switch(tag) { case <span class="hljs-number">1</span>: alloc(); show(); break; case <span class="hljs-number">2</span>: freeNode(); show(); break; default: printf(<span class="hljs-string">&#34;程序已退出&#xff01;&#34;</span>); } } }
本文来自网络，不代表软粉网立场，转载请注明出处：https://www.rfff.net/p/3718.html
打赏 1赞

作者: HUI

相关文章

发表评论

您的电子邮箱地址不会被公开。

返回顶部