Lines Matching refs:free
10 * cache friendly) and locating the next free space likewise.
82 free(axmap->levels[i].map);
84 free(axmap->levels);
85 free(axmap);
125 free(axmap->levels[i].map);
127 free(axmap->levels);
128 free(axmap);
340 * Start at the bottom, then converge towards first free bit at the top
358 * First free bit here is our index into the first
359 * free bit at the next higher level
407 * 'bit_nr' is already set. Find the next free bit after this one.
425 * find the first free one, the map is practically full.
