| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A D | do_balan.c | 114 int pos_in_item = tb->tb_path->pos_in_item; in balance_leaf_when_delete_cut() local
127 leaf_cut_from_buffer(&bi, item_pos, pos_in_item, in balance_leaf_when_delete_cut()
130 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], in balance_leaf_when_delete_cut()
134 if (!item_pos && !pos_in_item && tb->CFL[0]) in balance_leaf_when_delete_cut()
137 leaf_cut_from_buffer(&bi, item_pos, pos_in_item, in balance_leaf_when_delete_cut()
362 if (tb->lbytes > tb->pos_in_item) { in balance_leaf_paste_left_shift_dirent()
365 int ret, l_pos_in_item = tb->pos_in_item; in balance_leaf_paste_left_shift_dirent()
390 * when we have merge directory item, pos_in_item in balance_leaf_paste_left_shift_dirent()
410 tb->pos_in_item in balance_leaf_paste_left_shift_dirent()
[all...] |
| H A D | inode.c | 216 __le32 * item, int pos_in_item) in allocation_needed()
221 get_block_num(item, pos_in_item)) in allocation_needed()
334 blocknr = get_block_num(ind_item, path.pos_in_item); in _get_block_create_0()
338 if (path.pos_in_item == in _get_block_create_0()
414 if ((le_ih_k_offset(ih) + path.pos_in_item) > inode->i_size) in _get_block_create_0()
419 path.pos_in_item; in _get_block_create_0()
422 chars = ih_item_len(ih) - path.pos_in_item; in _get_block_create_0()
424 memcpy(p, ih_item_body(bh, ih) + path.pos_in_item, chars); in _get_block_create_0()
664 int pos_in_item; in reiserfs_get_block() local
750 pos_in_item in reiserfs_get_block()
214 allocation_needed(int retval, b_blocknr_t allocated, struct item_head *ih, __le32 * item, int pos_in_item) allocation_needed() argument
2375 int pos_in_item; map_block_for_writepage() local
[all...] |
| H A D | stree.c | 841 * maximal key less than key, and *pos_in_item is set to one
843 * directory item, and it is not found, *pos_in_item is set to one
885 pos_in_item(search_path) = 0; in search_for_position_by_key()
909 pos_in_item(search_path) = offset - item_offset; in search_for_position_by_key()
911 pos_in_item(search_path) /= blk_size; in search_for_position_by_key()
918 * path. Set pos_in_item out of the item. in search_for_position_by_key()
921 pos_in_item(search_path) = in search_for_position_by_key()
924 pos_in_item(search_path) = ih_item_len(p_le_ih); in search_for_position_by_key()
970 pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1); in prepare_for_direct_item()
971 *cut_size = -(ih_item_len(le_ih) - pos_in_item(pat in prepare_for_direct_item()
[all...] |
| H A D | lbalance.c | 979 int pos_in_item, int paste_size, in leaf_paste_in_buffer()
1028 if (!pos_in_item) { in leaf_paste_in_buffer()
1138 * pos_in_item - first byte that must be cut
1139 * cut_size - number of bytes to be cut beginning from pos_in_item
1142 * pos_in_item - number of first deleted entry
1146 int pos_in_item, int cut_size) in leaf_cut_from_buffer()
1163 cut_size = leaf_cut_entries(bh, ih, pos_in_item, cut_size); in leaf_cut_from_buffer()
1164 if (pos_in_item == 0) { in leaf_cut_from_buffer()
1175 RFALSE(pos_in_item && pos_in_item in leaf_cut_from_buffer()
978 leaf_paste_in_buffer(struct buffer_info *bi, int affected_item_num, int pos_in_item, int paste_size, const char *body, int zeros_number) leaf_paste_in_buffer() argument
1145 leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, int pos_in_item, int cut_size) leaf_cut_from_buffer() argument
[all...] |
| H A D | bitmap.c | 859 int pos_in_item; in get_left_neighbor() local
874 pos_in_item = path->pos_in_item; in get_left_neighbor()
884 if (pos_in_item == I_UNFM_NUM(ih)) in get_left_neighbor()
885 pos_in_item--; in get_left_neighbor()
886 while (pos_in_item >= 0) { in get_left_neighbor()
887 int t = get_block_num(item, pos_in_item); in get_left_neighbor()
893 pos_in_item--; in get_left_neighbor()
|
| H A D | reiserfs.h | 2138 int pos_in_item; member
2141 #define pos_in_item(path) ((path)->pos_in_item) macro
2254 const struct item_head *ih, int pos_in_item) in entry_length()
2258 deh = B_I_DEH(bh, ih) + pos_in_item; in entry_length()
2259 if (pos_in_item) in entry_length()
2518 int pos_in_item; member
3231 int pos_in_item, int paste_size,
3234 int pos_in_item, int cut_size);
2253 entry_length(const struct buffer_head *bh, const struct item_head *ih, int pos_in_item) entry_length() argument
|
| H A D | item_ops.c | 431 int pos_in_item, int mode) in old_entry_num()
440 if (virtual_entry_num < pos_in_item) in old_entry_num()
430 old_entry_num(int is_affected, int virtual_entry_num, int pos_in_item, int mode) old_entry_num() argument
|
| H A D | fix_node.c | 2065 int pos_in_item, in check_balance()
2074 vn->vn_pos_in_item = pos_in_item; in check_balance()
2537 * pos_in_item - comment this if you can
2549 int pos_in_item; in fix_nodes() local
2560 pos_in_item = tb->tb_path->pos_in_item; in fix_nodes()
2636 pos_in_item, ins_ih, data); in fix_nodes()
2061 check_balance(int mode, struct tree_balance *tb, int h, int inum, int pos_in_item, struct item_head *ins_ih, const void *data) check_balance() argument
|
| H A D | namei.c | 165 path->pos_in_item = de->de_entry_num; in search_by_entry_key()
337 path_to_entry->pos_in_item = de->de_entry_num; in reiserfs_find_entry()
|
| H A D | prints.c | 656 tb->tb_path->pos_in_item); in store_print_tb()
|
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A D | do_balan.c | 114 int pos_in_item = tb->tb_path->pos_in_item; in balance_leaf_when_delete_cut() local
127 leaf_cut_from_buffer(&bi, item_pos, pos_in_item, in balance_leaf_when_delete_cut()
130 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], in balance_leaf_when_delete_cut()
134 if (!item_pos && !pos_in_item && tb->CFL[0]) in balance_leaf_when_delete_cut()
137 leaf_cut_from_buffer(&bi, item_pos, pos_in_item, in balance_leaf_when_delete_cut()
362 if (tb->lbytes > tb->pos_in_item) { in balance_leaf_paste_left_shift_dirent()
365 int ret, l_pos_in_item = tb->pos_in_item; in balance_leaf_paste_left_shift_dirent()
390 * when we have merge directory item, pos_in_item in balance_leaf_paste_left_shift_dirent()
410 tb->pos_in_item in balance_leaf_paste_left_shift_dirent()
[all...] |
| H A D | inode.c | 216 __le32 * item, int pos_in_item) in allocation_needed()
221 get_block_num(item, pos_in_item)) in allocation_needed()
332 blocknr = get_block_num(ind_item, path.pos_in_item); in _get_block_create_0()
336 if (path.pos_in_item == in _get_block_create_0()
406 if ((le_ih_k_offset(ih) + path.pos_in_item) > inode->i_size) in _get_block_create_0()
411 path.pos_in_item; in _get_block_create_0()
414 chars = ih_item_len(ih) - path.pos_in_item; in _get_block_create_0()
416 memcpy(p, ih_item_body(bh, ih) + path.pos_in_item, chars); in _get_block_create_0()
656 int pos_in_item; in reiserfs_get_block() local
742 pos_in_item in reiserfs_get_block()
214 allocation_needed(int retval, b_blocknr_t allocated, struct item_head *ih, __le32 * item, int pos_in_item) allocation_needed() argument
2363 int pos_in_item; map_block_for_writepage() local
[all...] |
| H A D | stree.c | 841 * maximal key less than key, and *pos_in_item is set to one
843 * directory item, and it is not found, *pos_in_item is set to one
885 pos_in_item(search_path) = 0; in search_for_position_by_key()
909 pos_in_item(search_path) = offset - item_offset; in search_for_position_by_key()
911 pos_in_item(search_path) /= blk_size; in search_for_position_by_key()
918 * path. Set pos_in_item out of the item. in search_for_position_by_key()
921 pos_in_item(search_path) = in search_for_position_by_key()
924 pos_in_item(search_path) = ih_item_len(p_le_ih); in search_for_position_by_key()
970 pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1); in prepare_for_direct_item()
971 *cut_size = -(ih_item_len(le_ih) - pos_in_item(pat in prepare_for_direct_item()
[all...] |
| H A D | lbalance.c | 979 int pos_in_item, int paste_size, in leaf_paste_in_buffer()
1028 if (!pos_in_item) { in leaf_paste_in_buffer()
1138 * pos_in_item - first byte that must be cut
1139 * cut_size - number of bytes to be cut beginning from pos_in_item
1142 * pos_in_item - number of first deleted entry
1146 int pos_in_item, int cut_size) in leaf_cut_from_buffer()
1163 cut_size = leaf_cut_entries(bh, ih, pos_in_item, cut_size); in leaf_cut_from_buffer()
1164 if (pos_in_item == 0) { in leaf_cut_from_buffer()
1175 RFALSE(pos_in_item && pos_in_item in leaf_cut_from_buffer()
978 leaf_paste_in_buffer(struct buffer_info *bi, int affected_item_num, int pos_in_item, int paste_size, const char *body, int zeros_number) leaf_paste_in_buffer() argument
1145 leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, int pos_in_item, int cut_size) leaf_cut_from_buffer() argument
[all...] |
| H A D | bitmap.c | 859 int pos_in_item; in get_left_neighbor() local
874 pos_in_item = path->pos_in_item; in get_left_neighbor()
884 if (pos_in_item == I_UNFM_NUM(ih)) in get_left_neighbor()
885 pos_in_item--; in get_left_neighbor()
886 while (pos_in_item >= 0) { in get_left_neighbor()
887 int t = get_block_num(item, pos_in_item); in get_left_neighbor()
893 pos_in_item--; in get_left_neighbor()
|
| H A D | reiserfs.h | 2135 int pos_in_item; member
2138 #define pos_in_item(path) ((path)->pos_in_item) macro
2251 const struct item_head *ih, int pos_in_item) in entry_length()
2255 deh = B_I_DEH(bh, ih) + pos_in_item; in entry_length()
2256 if (pos_in_item) in entry_length()
2515 int pos_in_item; member
3231 int pos_in_item, int paste_size,
3234 int pos_in_item, int cut_size);
2250 entry_length(const struct buffer_head *bh, const struct item_head *ih, int pos_in_item) entry_length() argument
|
| H A D | item_ops.c | 431 int pos_in_item, int mode) in old_entry_num()
440 if (virtual_entry_num < pos_in_item) in old_entry_num()
430 old_entry_num(int is_affected, int virtual_entry_num, int pos_in_item, int mode) old_entry_num() argument
|
| H A D | fix_node.c | 2065 int pos_in_item, in check_balance()
2074 vn->vn_pos_in_item = pos_in_item; in check_balance()
2538 * pos_in_item - comment this if you can
2550 int pos_in_item; in fix_nodes() local
2561 pos_in_item = tb->tb_path->pos_in_item; in fix_nodes()
2637 pos_in_item, ins_ih, data); in fix_nodes()
2061 check_balance(int mode, struct tree_balance *tb, int h, int inum, int pos_in_item, struct item_head *ins_ih, const void *data) check_balance() argument
|
| H A D | namei.c | 166 path->pos_in_item = de->de_entry_num; in search_by_entry_key()
338 path_to_entry->pos_in_item = de->de_entry_num; in reiserfs_find_entry()
|
| H A D | prints.c | 656 tb->tb_path->pos_in_item); in store_print_tb()
|