Bugs

Linear search to find the length of contiguous chunk of free memory.

Synopsis: Allocator asks for chunks of free memory containing at least n pages. It maintains a list of all such chunks sorted by size in ascending order. A chunk is represented as a linked list of page descriptors. The allocator searches the list linearly until a chunk of size at least n pages is found. For each chunk the allocator computes the length on the fly by following the linked list of page descriptors.

Fix: Precompute the lenght of a chunk of free memory each time its size changes and store it in the page descriptor of the first page of that chunk.

Files: (m3core) RTHeapDep.i3, RTHeapRep.m3, RTCollector.m3

Modified: August 15th, 1995, Przemek Pardyak (pardy@cs.washington.edu)

Subranges represented by too few bits.

Problem:

Fix:

Files:

Modified: November 13th, 1995, Przemek Pardyak (pardy@cs.washington.edu)