| /linux-master/fs/reiserfs/ |
| H A D | do_balan.c | 114 int pos_in_item = tb->tb_path->pos_in_item; local
127 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
130 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0],
134 if (!item_pos && !pos_in_item && tb->CFL[0])
137 leaf_cut_from_buffer(&bi, item_pos, pos_in_item,
362 if (tb->lbytes > tb->pos_in_item) {
365 int ret, l_pos_in_item = tb->pos_in_item;
390 * when we have merge directory item, pos_in_item
410 tb->pos_in_item
[all...] |
| H A D | inode.c | 216 __le32 * item, int pos_in_item)
221 get_block_num(item, pos_in_item))
332 blocknr = get_block_num(ind_item, path.pos_in_item);
336 if (path.pos_in_item ==
406 if ((le_ih_k_offset(ih) + path.pos_in_item) > inode->i_size)
411 path.pos_in_item;
414 chars = ih_item_len(ih) - path.pos_in_item;
416 memcpy(p, ih_item_body(bh, ih) + path.pos_in_item, chars);
656 int pos_in_item; local
742 pos_in_item
214 allocation_needed(int retval, b_blocknr_t allocated, struct item_head *ih, __le32 * item, int pos_in_item) argument
2359 int pos_in_item; 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;
909 pos_in_item(search_path) = offset - item_offset;
911 pos_in_item(search_path) /= blk_size;
918 * path. Set pos_in_item out of the item.
921 pos_in_item(search_path) =
924 pos_in_item(search_path) = ih_item_len(p_le_ih);
970 pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1);
971 *cut_size = -(ih_item_len(le_ih) - pos_in_item(pat
[all...] |
| H A D | lbalance.c | 979 int pos_in_item, int paste_size,
1028 if (!pos_in_item) {
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)
1163 cut_size = leaf_cut_entries(bh, ih, pos_in_item, cut_size);
1164 if (pos_in_item == 0) {
1175 RFALSE(pos_in_item && pos_in_item
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) argument
1145 leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, int pos_in_item, int cut_size) argument
[all...] |
| H A D | bitmap.c | 859 int pos_in_item; local
874 pos_in_item = path->pos_in_item;
884 if (pos_in_item == I_UNFM_NUM(ih))
885 pos_in_item--;
886 while (pos_in_item >= 0) {
887 int t = get_block_num(item, pos_in_item);
893 pos_in_item--;
|
| H A D | reiserfs.h | 2135 int pos_in_item; member in struct:treepath
2138 #define pos_in_item(path) ((path)->pos_in_item) macro
2251 const struct item_head *ih, int pos_in_item)
2255 deh = B_I_DEH(bh, ih) + pos_in_item;
2256 if (pos_in_item)
2515 int pos_in_item; member in struct:tree_balance
3234 int pos_in_item, int paste_size,
3237 int pos_in_item, int cut_size);
2250 entry_length(const struct buffer_head *bh, const struct item_head *ih, int pos_in_item) argument
|
| H A D | item_ops.c | 431 int pos_in_item, int mode)
440 if (virtual_entry_num < pos_in_item)
430 old_entry_num(int is_affected, int virtual_entry_num, int pos_in_item, int mode) argument
|
| H A D | fix_node.c | 2065 int pos_in_item,
2074 vn->vn_pos_in_item = pos_in_item;
2538 * pos_in_item - comment this if you can
2550 int pos_in_item; local
2561 pos_in_item = tb->tb_path->pos_in_item;
2637 pos_in_item, ins_ih, data);
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) argument
|
| H A D | prints.c | 656 tb->tb_path->pos_in_item);
|
| H A D | namei.c | 166 path->pos_in_item = de->de_entry_num;
338 path_to_entry->pos_in_item = de->de_entry_num;
|