Searched refs:max_free (Results 1 - 4 of 4) sorted by relevance
| /freebsd-13-stable/sys/vm/ |
| H A D | vm_map.c | 998 root->left->max_free : root->start - left_ancestor->end);
1006 root->right->max_free : right_ancestor->start - root->end);
1039 vm_size_t max_free; \
1042 * Infer root->right->max_free == root->max_free when \
1043 * y->max_free < root->max_free || root->max_free == 0. \
1047 max_free = root->max_free; \
1200 vm_map_splay_merge_left_walk(vm_map_entry_t header, vm_map_entry_t root, vm_map_entry_t tail, vm_size_t max_free, vm_map_entry_t llist) argument
1225 vm_size_t max_free; local
1245 vm_size_t max_free; local
1257 vm_map_splay_merge_right_walk(vm_map_entry_t header, vm_map_entry_t root, vm_map_entry_t tail, vm_size_t max_free, vm_map_entry_t rlist) argument
1282 vm_size_t max_free; local
1302 vm_size_t max_free; local
[all...] |
| H A D | vm_map.h | 107 vm_size_t max_free; /* max free space in subtree */ member in struct:vm_map_entry
183 * subtree and one of its neighbors is saved in the max_free
|
| /freebsd-13-stable/lib/libc/db/hash/ |
| H A D | hash_page.c | 660 int max_free, offset, splitnum; local
667 max_free = hashp->SPARES[splitnum];
669 free_page = (max_free - 1) >> (hashp->BSHIFT + BYTE_SHIFT);
670 free_bit = (max_free - 1) & ((hashp->BSIZE << BYTE_SHIFT) - 1);
|
| /freebsd-13-stable/contrib/llvm-project/openmp/runtime/src/ |
| H A D | kmp_alloc.cpp | 395 static void bcheck(kmp_info_t *th, bufsize *max_free, bufsize *total_free) { argument
399 *total_free = *max_free = 0;
416 if (*max_free < best->bh.bb.bsize)
417 *max_free = best->bh.bb.bsize;
420 if (*max_free > (bufsize)sizeof(bhead_t))
421 *max_free -= sizeof(bhead_t);
|
Completed in 163 milliseconds