| C Tutorial | Simple dynamic storage allocation | |||
|
The C Language C History BCPL Euclid’s Algorithm in C Euclid on the PDP-11 Pieces of C C Types Declarators Struct bit-fields Code generated by bit fields C Unions Layout of Records and Unions C Storage Classes malloc() and free() Dynamic Storage Allocation Simple Dynamic Storage Allocation malloc() and free() variants Fragmentation Fragmentation and Handles Automatic Garbage Collection Arrays Lazy Logical Operators The Switch Statement setjmp/longjmp: Sloppy exceptions Nondeterminism in C
|
Maintaining information about free memory Simplest: Linked list The algorithm for locating a suitable block Simplest: First-fit The algorithm for freeing an allocated block Simplest: Coalesce adjacent free blocks
Contact for more learning: webmaster@freehost7com |
|