Skip to content
All tags

#free-list

2 posts
learning deep-dive Reading Stanford CS107

Stanford CS107 Lecture 23: The Allocator Invariants Behind In-Place realloc

CS107 Lecture 23 advances the explicit free list to in-place realloc: split a useful remainder when shrinking, absorb free right neighbors when growing, and allocate-copy-free only as a fallback, while preserving both the physical heap and logical list.

#cs107#stanford#systems-programming#memory-management#realloc#free-list
learning deep-dive Reading Stanford CS107

Stanford CS107 Lecture 22: Why an Explicit Free List Lives in Two Orders at Once

CS107 Lecture 22 replaces an implicit list with an explicit free list. Searches visit only reusable blocks, but every free block now has both physical neighbors and logical links, so unlinking, coalescing, and reinsertion must preserve both structures.

#cs107#stanford#systems-programming#memory-management#malloc#free-list