Description: Simulated memory management.
Application memory, if the current node indicates the memory is empty and same size, directly to the sign of the node position into zero, and returned to the head of the node address, if the current node indicates the memory space is greater than the application of space, is to apply for a new node is inserted into the back of the current node, the symbol of the current node position to 0, the size of the memory block to apply to the size of the memory, will be the sign of the new node location into empty, the size of the size of the original block minus the size of the current node.
If the memory space of the application is larger than the size of the block of the current null node, then the backward lookup continues.
When the memory is freed, it is defined *prev,* PRV *prev points to the free memory block, and PRV points to the former node of the freed block.
If the release of the node's first address the same as the first address of the current node and the current node is not empty, will be the sign of the current node position into 1, if a node is empty, before the current node are merged, if the current node of a node is empty, after the merge again
- [memery] - This is a simulation of the operating sy
- [neicunguanli] - 1. Simulated operating system memory man
- [radio] - Theoretical analysis and simulation expe
- [code] - KWIC system pipe/filter style realize
- [JinChengDiaoDu] - Analog realization of the process schedu
File list (Check if you may need any files):
Download