Home
last modified time | relevance | path

Searched refs:I_ENTRY_COUNT (Results 1 – 7 of 7) sorted by relevance

/linux-3.4.99/fs/reiserfs/
Ddir.c115 RFALSE(I_ENTRY_COUNT(ih) < entry_num, in reiserfs_readdir_dentry()
117 entry_num, I_ENTRY_COUNT(ih)); in reiserfs_readdir_dentry()
120 || entry_num < I_ENTRY_COUNT(ih)) { in reiserfs_readdir_dentry()
125 for (; entry_num < I_ENTRY_COUNT(ih); in reiserfs_readdir_dentry()
Dlbalance.c83 if (from < I_ENTRY_COUNT(ih)) { in leaf_copy_dir_entries()
116 FIRST_TO_LAST) ? I_ENTRY_COUNT(B_N_PITEM_HEAD(dest, in leaf_copy_dir_entries()
426 I_ENTRY_COUNT(ih) - cpy_bytes, in leaf_item_bottle()
695 && !I_ENTRY_COUNT(B_N_PITEM_HEAD(S0, 0)))) && in leaf_shift_left()
977 RFALSE(I_ENTRY_COUNT(ih) < from + del_count, in leaf_cut_entries()
979 I_ENTRY_COUNT(ih), from, del_count); in leaf_cut_entries()
999 for (i = I_ENTRY_COUNT(ih) - 1; i > from + del_count - 1; i--) in leaf_cut_entries()
1220 RFALSE(I_ENTRY_COUNT(ih) < before, in leaf_paste_entries()
1222 I_ENTRY_COUNT(ih), before); in leaf_paste_entries()
1237 for (i = I_ENTRY_COUNT(ih) - 1; i >= before; i--) in leaf_paste_entries()
[all …]
Ditem_ops.c399 for (i = 0; i < I_ENTRY_COUNT(ih); i++, deh++) { in direntry_print_item()
433 for (i = 0; i < I_ENTRY_COUNT(ih); i++, deh++) { in direntry_check_item()
Dnamei.c34 rbound = I_ENTRY_COUNT(ih) - 1; in bin_search_in_dir_item()
223 if (i == I_ENTRY_COUNT(de->de_ih) || in linear_search_in_dir_item()
Ddo_balan.c438 I_ENTRY_COUNT in balance_leaf()
845 I_ENTRY_COUNT(B_N_PITEM_HEAD in balance_leaf()
Dfix_node.c186 && I_ENTRY_COUNT(B_N_PITEM_HEAD(Sh, 0)) == 1)) { in create_virtual_node()
Dreiserfs.h1751 #define I_ENTRY_COUNT(ih) (ih_entry_count((ih))) macro