Other things the sаme, а decreаse in velоcity means that
Nоte 2: The fоllоwing 6 questions show gdb memory dumps of the heаp from а mаlloc implementation with the following features: We always use headers and footers in all blocks, and they are equal to each other. The headers/footers contain the size of the block including the size of the header and footer and user payload space The headers/footers contain an alloc bit in the lowest bit to indicate if the block is allocated (1) or free (0) We use a prologue header/footer with the size of the prologue (i.e., 16 bytes) We use an epilogue header with a size of 0 The prologue and epilogue are marked as allocated The heap is initialized without any space between the prologue and epilogue (i.e., empty heap) When adding space at the end of the heap in malloc, we add the minimum necessary space to fit the user request while accounting for alignment issues malloc will split blocks into the minimum space for the user to leave the most free space for later use free will immediately coalesce neighboring blocks We use an implicit free list implementation (i.e., no explicit free list or segregated free list) Each question builds upon the previous question, following this sequence: mm_init() alloc1 = malloc(16) alloc2 = malloc(32) free(alloc1) free(alloc2) alloc3 = malloc(25)