Searched refs:B_FREE_SPACE (Results 1 – 6 of 6) sorted by relevance
/linux-3.4.99/fs/reiserfs/ |
D | ibalance.c | 138 RFALSE(B_FREE_SPACE(cur) < count * (KEY_SIZE + DC_SIZE), in internal_insert_childs() 140 B_FREE_SPACE(cur), count * (KEY_SIZE + DC_SIZE)); in internal_insert_childs() 150 MAX_CHILD_SIZE(bh[i]) - B_FREE_SPACE(bh[i])); in internal_insert_childs() 425 RFALSE(B_FREE_SPACE(dest) < KEY_SIZE, in internal_insert_key() 426 "no enough free space (%d) in dest buffer", B_FREE_SPACE(dest)); in internal_insert_key() 618 || B_FREE_SPACE(tbSh) != in balance_internal_when_delete() 848 B_FREE_SPACE(insert_ptr[k])); in balance_internal() 912 B_FREE_SPACE(insert_ptr in balance_internal() 955 (MAX_CHILD_SIZE(tbSh_1) - B_FREE_SPACE(tbSh_1))); in balance_internal() 1052 B_FREE_SPACE(insert_ptr in balance_internal()
|
D | prints.c | 137 B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); in sprintf_block_head() 731 if (B_FREE_SPACE(bh) != in check_internal_block_head()
|
D | fix_node.c | 89 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node() 1284 sfree = B_FREE_SPACE(Sh); in ip_check_balance() 1767 RFALSE(-levbytes >= maxsize - B_FREE_SPACE(S0), in dc_check_balance_leaf() 1989 B_FREE_SPACE(bh) != in get_neighbors() 2026 && B_FREE_SPACE(bh) != in get_neighbors() 2030 B_FREE_SPACE(bh), MAX_CHILD_SIZE(bh), in get_neighbors()
|
D | do_balan.c | 1867 if (B_FREE_SPACE(tb->L[0]) != in check_after_balance_leaf() 1877 if (B_FREE_SPACE(tb->R[0]) != in check_after_balance_leaf() 1887 (B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)) != in check_after_balance_leaf() 1891 int left = B_FREE_SPACE(PATH_H_PBUFFER(tb->tb_path, 0)); in check_after_balance_leaf()
|
D | reiserfs.h | 1457 #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) macro 1837 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur))) 2669 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
|
D | lbalance.c | 322 B_FREE_SPACE(dest), cpy_num * IH_SIZE); in leaf_copy_items_entirely()
|