malloc的工作原理.docVIP

该函数演示了malloc 的工作原理： 1. malloc 在一块平台的内存区管理内存（可以称之为堆) 2. malloc 由管理块和数据块构成 3. malloc 首先以链表的方式搜索已管理的内存，没有找到，再从大池里扩展一块进入valid_address 管理区 */ #include stdio.h #include stdlib.h #include conio.h #define SIZE 0x10000 struct mem_control_block { int is_available; int size; }; int has_initialized = 0; void *g_managed_memory_start; void *g_last_valid_address; void malloc_init(); void myfree(void *firstbyte); void *mymalloc(long numbytes); void simu_init(void) { g_last_valid_address=malloc(SIZE); } void sbrk(int n) { /* 它的愿意是内存不够了，向系统追加申请内存，由系统连接为一块平坦的内存 在我们的模拟中，已经是一块平坦的内存，所以此函数没有意义 */ if(((int)g_last_valid_address+n)(int)g_managed_memory_start+SIZE) { printf(memory full!\n); exit(1); } } int main(void) { void *p1, *p2, *p3,*p4,*p5; simu_init(); p1=mymalloc(0x100); p2=mymalloc(0x200); p3=mymalloc(0x300); printf(p1 offset: %x\n,(char *)p1-(char *)g_managed_memory_start); printf(p2 offset: %x\n,(char *)p2-(char *)g_managed_memory_start); printf(p3 offset: %x\n,(char *)p3-(char *)g_managed_memory_start); myfree(p2); p4=mymalloc(0x50); p5=mymalloc(0x50); printf(p4 offset: %x\n,(char *)p4-(char *)g_managed_memory_start); printf(p5 offset: %x\n,(char *)p5-(char *)g_managed_memory_start); myfree(p1); myfree(p3); myfree(p4); myfree(p5); system(pause); return 0; } void malloc_init() { /* grab the last valid address from the OS */ // g_last_valid_address = sbrk(0); /* we dont have any memory to manage yet, so *just set the beginning to be g_last_valid_address */ g_managed_memory_start = g_last_valid_address; /* Okay, were initialized and ready to go */ has_initialized = 1; } void myfree(void *firstbyte) { struct mem_control_block *mcb; /* Backup from the given pointer to find the * mem_control_block */ mcb = (struct mem_control_block*)((int)firstbyte - sizeof(struct mem_control_bl