The free list is the structure that the runtime uses to keep track of available heap space. Typically, the free list points to holes in the heap where new objects can be allocated. The free list keeps track of the holes in a manner that can range from a simple linked list to more priority and size-based approaches. Each time a new object goes on the heap, the free list is used to find a hole of free space where it fits.
See also Fragmentation.