2 ms·
classic Unix memory management is based about "break pointers" which describe highest address of data segment, and a top of stack pointer, which limits the stac
by p_l 8y ago
classic Unix memory management is based about "break pointers" which describe highest address of data segment, and a top of stack pointer, which limits the stack segment. Those areas are linear and you can't free a part in the middle.
This is a historical curiosity from PDP-11 before the advent of paging, but apparently still used by some malloc() implementations. Modern memory management doesn't use linear mapping but instead uses paging to create chunks of accessible memory. Some applications still use a big linear address space by appropriately asking the OS then interoperating with memory management to only request the memory that is needed