C++实现可变分区存储管理代码

#include <STDIO.H>    
#include <MALLOC.H>    
#include <STDLIB.H>    
#include <STRING.H>    
   
#define  BLOCK_SIZE     500             //初始空闲分区大小    
#define  NULL           0    
   
typedef struct Node{   
    int             start_address;      //空闲区首地址    
    int             block_size;         //空闲区大小    
    struct Node*    prior;              //前向指针    
    struct Node*    next;               //后向指针    
    int             state;              //空闲区状态    
}Node,*LinkList;   
   
LinkList    L;                          //指向用户存储区的首地址    
LinkList    Free;                       //空闲分区链表头指针    
LinkList    Assigned;                   //已分配区链表头指针    
   
//--------------------------------------------------------------    
void InitBlock(void) //初始化    
{   
    L = (LinkList)malloc(sizeof(Node));   
       
    L->start_address = 0;   
    L->block_size = BLOCK_SIZE;   
    L->prior = NULL;   
    L->next = NULL;   
    L->state = 0;   

       
    Free = (LinkList)malloc(sizeof(Node));      //建立空闲区链表(含头指针)    
    Assigned = (LinkList)malloc(sizeof(Node));  //建立分配区链表(含头指针)    
   
    Assigned->block_size = Free->block_size = 0;   
    Assigned->start_address = Free->start_address = 0;   
    Assigned->prior = Free->prior = NULL;   
    Assigned->next = Free->next = NULL;   
    Assigned->state = Free->state = 0;   
   
   
    //printf("\n初始化空闲块成功\n");    
}   
//--------------------------------------------------------------    
void Display()      //显示存储区分配情况    
{   
    LinkList p;   
   
    printf("****存储区情况****:\n");   
    printf("已经分配区有:\n");   
    for(p = L;p != NULL;p = p->next)   
    {   
        if(p->block_size == 0)   continue;   
        if(p->state == 1)   
        {          
            printf("(%3d,%3d)\n",p->start_address ,p->start_address+p->block_size);   
        }   
    }   
   
    printf("空闲区有:\n");