My own implementation of malloc() and free().
This was a university assignment I had to complete. I am planning to expand on it as a project. If you have any suggestions please send me an email at g.sidd97@gmail.com
- Clone this repository on your
Ubunturunning device - Open your teminal.
- Navigate to the root directory where all the files are downloaded
- Execute the command
make all - It might show you a bunch of warnings, etc. As long as there is no error run the command
./myalloc
- Initially a contigious chunk of dynamic memory is assigned to demonstrate the working of the various methods and interfaces.
- Memory (free and occupied) is managed by maintaining two separate linked lists with the address of the memory available/used.
- Splitting/Coalescing is used to make sure fragmentation is avoided.
- Any request for memory less than
8 bytesis allocated all 8 bytes - Only one source of internal fragmentation - size of free/used memory is stored in the 8 bytes above each memory pointer in the corresponding linked lists.
-
FIRST_FIT: finds the first address in memory chunk which can fit the requested allocation size.BEST_FIT: finds the smallest possible memory hole that can accomadate the requested size (traverses whole list of Free memory).WORST_FIT: finds the largest possible memory hole that can accomodate the requested size (again, traverses through the whole Free memory list).
- Also supports the compaction function to make sure free memory is optimized.
- Can print the layout of memory chunk being managed.
- Can print memory statistics to console if needed.
- If you have ideas about other functionalities that can be added to this repo, do let me know! all ideas are highly appreciated!!
Siddharth Gupta