Searched refs:MAX_CHILD_SIZE (Results 1 – 4 of 4) sorted by relevance
/linux-6.1.9/fs/reiserfs/ |
D | ibalance.c | 158 MAX_CHILD_SIZE(bh[i]) - B_FREE_SPACE(bh[i])); in internal_insert_childs() 662 MAX_CHILD_SIZE(tbSh) - DC_SIZE, in balance_internal_when_delete() 909 MAX_CHILD_SIZE(insert_ptr[k]) - in balance_internal() 975 MAX_CHILD_SIZE(insert_ptr in balance_internal() 1020 (MAX_CHILD_SIZE(tbSh_1) - B_FREE_SPACE(tbSh_1))); in balance_internal() 1121 (MAX_CHILD_SIZE in balance_internal()
|
D | fix_node.c | 62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node() 420 max_node_size = MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, h)); in get_num_ver() 748 if (MAX_CHILD_SIZE(S0) + vn->vn_size <= rfree + lfree + ih_size) { in are_leaves_removable() 931 return (MAX_CHILD_SIZE(f) - dc_size(B_N_CHILD(f, order))); in get_lfree() 954 return (MAX_CHILD_SIZE(f) - dc_size(B_N_CHILD(f, order))); in get_rfree() 1285 if (lfree + rfree + sfree < MAX_CHILD_SIZE(Sh) + levbytes in can_node_be_removed() 1952 maxsize = MAX_CHILD_SIZE(S0); /* maximal possible size of an item */ in dc_check_balance_leaf() 2194 MAX_CHILD_SIZE(bh) - in get_neighbors() 2231 MAX_CHILD_SIZE(bh) - in get_neighbors() 2234 B_FREE_SPACE(bh), MAX_CHILD_SIZE(bh), in get_neighbors()
|
D | do_balan.c | 1476 set_blkh_free_space(blkh, MAX_CHILD_SIZE(bi->bi_bh)); in make_empty_node() 1686 MAX_CHILD_SIZE(tb->L[0]) - in check_after_balance_leaf() 1696 MAX_CHILD_SIZE(tb->R[0]) - in check_after_balance_leaf() 1706 (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf() 1710 int right = (MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)) - in check_after_balance_leaf() 1719 MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, 0)), in check_after_balance_leaf()
|
D | reiserfs.h | 2058 #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE )) macro 2061 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur))) 2064 #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
|