链表法页框的分配和去配
摘要：
采用链表的方法模拟分页式存储空间的分配和去配MemManager.h#pragma once#define MAX_MEM_LEN 512class CMemManager{private: struct MemItem { struct MemItem* prior; struct MemItem* next; bool bFree; int nPos; int nLen; int nOwner; MemItem(MemItem* pri, MemItem* nxt, bool bfree, int nPosition, int nLength) { prior = pri; next = 阅读全文
posted @ 2011-01-22 21:03 FlowingCloud 阅读(239) 评论(0) 推荐(0) 编辑
