first_free
static uint32_t first_free(uint32_t);
bit = bit + first_free(freep[j]);
if ((map->first_free == prev_entry) &&
map->first_free = new_entry;
entry = map->first_free;
KASSERT((entry) != (map)->first_free); \
if (map->first_free != &map->header && map->first_free->start >= start)
map->first_free = entry->prev;
if (map->first_free == ent) {
map->first_free = ent->prev;
if (map->first_free == oldent)
map->first_free = last;
if (srcmap->first_free != &srcmap->header &&
srcmap->first_free->start >= start)
srcmap->first_free = orig_entry->prev;
map->first_free = &map->header;
entry == map->first_free ? " (first_free)" : "");
if (map->first_free == e) {
map->first_free, e);
struct vm_map_entry * first_free; /* First free space hint */
D(vm_map, vm_map)->first_free);