I_ENTRY_COUNT 102 fs/reiserfs/dir.c RFALSE(I_ENTRY_COUNT(ih) < entry_num, I_ENTRY_COUNT 104 fs/reiserfs/dir.c entry_num, I_ENTRY_COUNT(ih)); I_ENTRY_COUNT 107 fs/reiserfs/dir.c || entry_num < I_ENTRY_COUNT(ih)) { I_ENTRY_COUNT 112 fs/reiserfs/dir.c for (; entry_num < I_ENTRY_COUNT(ih); I_ENTRY_COUNT 424 fs/reiserfs/do_balan.c I_ENTRY_COUNT I_ENTRY_COUNT 855 fs/reiserfs/do_balan.c I_ENTRY_COUNT(B_N_PITEM_HEAD I_ENTRY_COUNT 186 fs/reiserfs/fix_node.c && I_ENTRY_COUNT(B_N_PITEM_HEAD(Sh, 0)) == 1)) { I_ENTRY_COUNT 396 fs/reiserfs/item_ops.c for (i = 0; i < I_ENTRY_COUNT(ih); i++, deh++) { I_ENTRY_COUNT 430 fs/reiserfs/item_ops.c for (i = 0; i < I_ENTRY_COUNT(ih); i++, deh++) { I_ENTRY_COUNT 83 fs/reiserfs/lbalance.c if (from < I_ENTRY_COUNT(ih)) { I_ENTRY_COUNT 116 fs/reiserfs/lbalance.c FIRST_TO_LAST) ? I_ENTRY_COUNT(B_N_PITEM_HEAD(dest, I_ENTRY_COUNT 423 fs/reiserfs/lbalance.c I_ENTRY_COUNT(ih) - cpy_bytes, I_ENTRY_COUNT 693 fs/reiserfs/lbalance.c && !I_ENTRY_COUNT(B_N_PITEM_HEAD(S0, 0)))) && I_ENTRY_COUNT 972 fs/reiserfs/lbalance.c RFALSE(I_ENTRY_COUNT(ih) < from + del_count, I_ENTRY_COUNT 974 fs/reiserfs/lbalance.c I_ENTRY_COUNT(ih), from, del_count); I_ENTRY_COUNT 994 fs/reiserfs/lbalance.c for (i = I_ENTRY_COUNT(ih) - 1; i > from + del_count - 1; i--) I_ENTRY_COUNT 1214 fs/reiserfs/lbalance.c RFALSE(I_ENTRY_COUNT(ih) < before, I_ENTRY_COUNT 1216 fs/reiserfs/lbalance.c I_ENTRY_COUNT(ih), before); I_ENTRY_COUNT 1231 fs/reiserfs/lbalance.c for (i = I_ENTRY_COUNT(ih) - 1; i >= before; i--) I_ENTRY_COUNT 1241 fs/reiserfs/lbalance.c old_entry_num = I_ENTRY_COUNT(ih); I_ENTRY_COUNT 1282 fs/reiserfs/lbalance.c for (i = 0; i < I_ENTRY_COUNT(ih); i++) { I_ENTRY_COUNT 1285 fs/reiserfs/lbalance.c I_ENTRY_COUNT(ih) - I_ENTRY_COUNT 33 fs/reiserfs/namei.c rbound = I_ENTRY_COUNT(ih) - 1; I_ENTRY_COUNT 224 fs/reiserfs/namei.c if (i == I_ENTRY_COUNT(de->de_ih) ||