Home
last modified time | relevance | path

Searched refs:B_FREE_SPACE (Results 1 – 6 of 6) sorted by relevance

/linux-6.1.9/fs/reiserfs/
Dibalance.c146 RFALSE(B_FREE_SPACE(cur) < count * (KEY_SIZE + DC_SIZE), in internal_insert_childs()
148 B_FREE_SPACE(cur), count * (KEY_SIZE + DC_SIZE)); in internal_insert_childs()
158 MAX_CHILD_SIZE(bh[i]) - B_FREE_SPACE(bh[i])); in internal_insert_childs()
449 RFALSE(B_FREE_SPACE(dest) < KEY_SIZE, in internal_insert_key()
450 "no enough free space (%d) in dest buffer", B_FREE_SPACE(dest)); in internal_insert_key()
661 || B_FREE_SPACE(tbSh) != in balance_internal_when_delete()
910 B_FREE_SPACE(insert_ptr[k])); in balance_internal()
977 B_FREE_SPACE(insert_ptr in balance_internal()
1020 (MAX_CHILD_SIZE(tbSh_1) - B_FREE_SPACE(tbSh_1))); in balance_internal()
1123 B_FREE_SPACE(insert_ptr in balance_internal()
Dfix_node.c62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
1401 sfree = B_FREE_SPACE(Sh); in ip_check_balance()
1956 RFALSE(-levbytes >= maxsize - B_FREE_SPACE(S0), in dc_check_balance_leaf()
2193 B_FREE_SPACE(bh) != in get_neighbors()
2230 && B_FREE_SPACE(bh) != in get_neighbors()
2234 B_FREE_SPACE(bh), MAX_CHILD_SIZE(bh), in get_neighbors()
Dprints.c152 B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); in scnprintf_block_head()
755 if (B_FREE_SPACE(bh) != in check_internal_block_head()
Ddo_balan.c1685 if (B_FREE_SPACE(tb->L[0]) != in check_after_balance_leaf()
1695 if (B_FREE_SPACE(tb->R[0]) != in check_after_balance_leaf()
1705 (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) != in check_after_balance_leaf()
1709 int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)); in check_after_balance_leaf()
Dreiserfs.h1686 #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) macro
2061 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
3130 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
Dlbalance.c352 B_FREE_SPACE(dest), cpy_num * IH_SIZE); in leaf_copy_items_entirely()