HomeSort by: relevance | last modified time | path
    Searched refs:first_free (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/libarchive/dist/libarchive/
archive_write_add_filter_compress.c 96 int first_free; /* First unused entry. */ member in struct:private_data
192 state->first_free = FIRST;
277 if (clear_flg || state->first_free > state->cur_maxcode) {
382 if (state->first_free < state->max_maxcode) {
383 state->codetab[i] = state->first_free++; /* code -> hashtable */
404 state->first_free = FIRST;
  /src/sys/uvm/
uvm_map.h 225 struct vm_map_entry * first_free; /* First free space hint */ member in struct:vm_map
uvm_map.c 232 KASSERT((entry) != (map)->first_free); \
261 if (map->first_free == ent) {
262 map->first_free = ent->prev;
539 if (map->first_free == e) {
542 printf("first_free %p should be %p\n",
543 map->first_free, e);
556 printf("stale first_free\n");
1603 if ((map->first_free == prev_entry) &&
1605 map->first_free = new_entry;
2000 entry = map->first_free;
    [all...]
  /src/lib/libc/db/hash/
hash_page.c 78 static uint32_t first_free(uint32_t);
662 first_free(uint32_t map) function
792 bit = bit + first_free(freep[j]);
  /src/usr.bin/pmap/
pmap.c 146 printf("%*s first_free = %p,", indent(2), "",
147 D(vm_map, vm_map)->first_free);

Completed in 17 milliseconds