Searched refs:max_free (Results 1 – 4 of 4) sorted by relevance
997 root->left->max_free : root->start - left_ancestor->end); in vm_map_entry_max_free_left()1005 root->right->max_free : right_ancestor->start - root->end); in vm_map_entry_max_free_right()1038 vm_size_t max_free; \1046 max_free = root->max_free; \1047 KASSERT(max_free == vm_size_max( \1051 if (max_free - 1 < vm_map_entry_max_free_left(root, llist)) \1052 max_free = vm_map_entry_max_free_right(root, rlist); \1059 if (max_free < y->max_free) \1060 root->max_free = max_free = \1061 vm_size_max(max_free, z->max_free); \[all …]
106 vm_size_t max_free; /* max free space in subtree */ member
654 int max_free, offset, splitnum; in overflow_page() local661 max_free = hashp->SPARES[splitnum]; in overflow_page()663 free_page = (max_free - 1) >> (hashp->BSHIFT + BYTE_SHIFT); in overflow_page()664 free_bit = (max_free - 1) & ((hashp->BSIZE << BYTE_SHIFT) - 1); in overflow_page()
395 static void bcheck(kmp_info_t *th, bufsize *max_free, bufsize *total_free) { in bcheck() argument399 *total_free = *max_free = 0; in bcheck()416 if (*max_free < best->bh.bb.bsize) in bcheck()417 *max_free = best->bh.bb.bsize; in bcheck()420 if (*max_free > (bufsize)sizeof(bhead_t)) in bcheck()421 *max_free -= sizeof(bhead_t); in bcheck()