Home
last modified time | relevance | path

Searched refs:B_NR_ITEMS (Results 1 – 10 of 10) sorted by relevance

/fs/reiserfs/
Dibalance.c218 RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1 in internal_delete_pointers_items()
223 B_NR_ITEMS(cur) + 1, first_i); in internal_delete_pointers_items()
237 RFALSE(first_i + del_num > B_NR_ITEMS(cur), in internal_delete_pointers_items()
314 nr_src = B_NR_ITEMS(src); in internal_copy_pointers_items()
323 RFALSE(cpy_num - 1 + B_NR_ITEMS(dest) > (int)MAX_NR_KEY(dest), in internal_copy_pointers_items()
325 cpy_num, B_NR_ITEMS(dest), MAX_NR_KEY(dest)); in internal_copy_pointers_items()
419 B_NR_ITEMS(src_bi->bi_bh)) + 1) ? 0 : j - cpy_num + in internal_move_pointers_items()
444 RFALSE(dest_position_before > B_NR_ITEMS(dest) || in internal_insert_key()
445 src_position >= B_NR_ITEMS(src), in internal_insert_key()
447 dest_position_before, B_NR_ITEMS(dest), in internal_insert_key()
[all …]
Dlbalance.c55 LAST_TO_FIRST) ? ((B_NR_ITEMS(dest)) ? 0 : -1) : (B_NR_ITEMS(dest) in leaf_copy_dir_entries()
104 LAST_TO_FIRST) ? 0 : B_NR_ITEMS(dest), in leaf_copy_dir_entries()
110 FIRST_TO_LAST) ? (B_NR_ITEMS(dest) - in leaf_copy_dir_entries()
117 (last_first == FIRST_TO_LAST) ? (B_NR_ITEMS(dest) - 1) : 0; in leaf_copy_dir_entries()
144 dest_nr_item = B_NR_ITEMS(dest); in leaf_copy_boundary_item()
220 src_nr_item = B_NR_ITEMS(src); in leaf_copy_boundary_item()
324 RFALSE(B_NR_ITEMS(src) - first < cpy_num, in leaf_copy_items_entirely()
326 B_NR_ITEMS(src), cpy_num, first); in leaf_copy_items_entirely()
455 leaf_insert_into_buf(dest_bi, B_NR_ITEMS(dest), &n_ih, in leaf_item_bottle()
531 RFALSE(B_NR_ITEMS(src) < cpy_num, in leaf_copy_items()
[all …]
Ddo_balan.c94 if (B_NR_ITEMS(tbS0)) { in balance_leaf_when_delete_del()
149 int n = B_NR_ITEMS(tbS0); in balance_leaf_when_delete_left()
161 1 < B_NR_ITEMS(tb->FR[0])) in balance_leaf_when_delete_left()
168 B_NR_ITEMS(tb->R[0]), -1, in balance_leaf_when_delete_left()
180 B_NR_ITEMS(tb->L[0]), -1, NULL); in balance_leaf_when_delete_left()
267 n = B_NR_ITEMS(tbS0); in balance_leaf_when_delete()
292 int n = B_NR_ITEMS(tb->L[0]); in balance_leaf_insert_left()
355 int n = B_NR_ITEMS(tb->L[0]); in balance_leaf_paste_left_shift_dirent()
373 pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); in balance_leaf_paste_left_shift_dirent()
418 int n = B_NR_ITEMS(tb->L[0]); in balance_leaf_paste_left_shift()
[all …]
Dfix_node.c72 B_NR_ITEMS(Sh) + ((vn->vn_mode == M_INSERT) ? 1 : 0) - in create_virtual_node()
156 || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) in create_virtual_node()
163 || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) { in create_virtual_node()
169 (B_NR_ITEMS(Sh) == 1 in create_virtual_node()
716 RFALSE(B_NR_ITEMS(S0) != 1, in are_leaves_removable()
718 B_NR_ITEMS(S0)); in are_leaves_removable()
927 order = B_NR_ITEMS(l); in get_lfree()
986 tb->lkey[h] : B_NR_ITEMS(tb->FL[h]); in is_left_neighbor_in_cache()
1060 B_NR_ITEMS(parent)) in get_far_parent()
1076 first_last_position = B_NR_ITEMS(parent); in get_far_parent()
[all …]
Dprints.c152 B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); in scnprintf_block_head()
456 to = B_NR_ITEMS(bh); in print_internal()
459 to = min_t(int, last, B_NR_ITEMS(bh)); in print_internal()
752 if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) in check_internal_block_head()
756 bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - in check_internal_block_head()
757 DC_SIZE * (B_NR_ITEMS(bh) + 1)) in check_internal_block_head()
770 for (i = 0, ih = item_head(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) in check_leaf()
Ddir.c118 RFALSE(item_num > B_NR_ITEMS(bh) - 1, in reiserfs_readdir_inode()
120 item_num, B_NR_ITEMS(bh)); in reiserfs_readdir_inode()
235 if (item_num != B_NR_ITEMS(bh) - 1) in reiserfs_readdir_inode()
Dstree.c240 B_NR_ITEMS(parent)) in get_lkey()
286 B_NR_ITEMS(parent)) in get_rkey()
301 if (position != B_NR_ITEMS(parent)) in get_rkey()
771 B_NR_ITEMS(bh), in search_by_key()
809 int limit = B_NR_ITEMS(bh); in search_by_key()
940 if (PATH_LAST_POSITION(path) >= B_NR_ITEMS(bh)) in comp_items()
Dreiserfs.h1683 #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh))) macro
2048 ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
3131 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
Dsuper.c295 if (item_pos != B_NR_ITEMS(bh)) { in finish_unfinished()
Dinode.c429 if (PATH_LAST_POSITION(&path) != (B_NR_ITEMS(bh) - 1)) in _get_block_create_0()