| /fs/reiserfs/ |
| D | do_balan.c | 24 static inline void buffer_info_init_left(struct tree_balance *tb, in buffer_info_init_left() argument
27 bi->tb = tb; in buffer_info_init_left()
28 bi->bi_bh = tb->L[0]; in buffer_info_init_left()
29 bi->bi_parent = tb->FL[0]; in buffer_info_init_left()
30 bi->bi_position = get_left_neighbor_position(tb, 0); in buffer_info_init_left()
33 static inline void buffer_info_init_right(struct tree_balance *tb, in buffer_info_init_right() argument
36 bi->tb = tb; in buffer_info_init_right()
37 bi->bi_bh = tb->R[0]; in buffer_info_init_right()
38 bi->bi_parent = tb->FR[0]; in buffer_info_init_right()
39 bi->bi_position = get_right_neighbor_position(tb, 0); in buffer_info_init_right()
[all …]
|
| D | fix_node.c | 78 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
81 struct virtual_node *vn = tb->tb_vn; in create_virtual_node()
85 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
89 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
103 vn->vn_vi = (struct virtual_item *)(tb->tb_vn + 1); in create_virtual_node()
137 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); in create_virtual_node()
138 if (tb->vn_buf + tb->vn_buf_size < vn->vn_free_ptr) in create_virtual_node()
139 reiserfs_panic(tb->tb_sb, "vs-8030", in create_virtual_node()
147 vn->vn_vi[new_num].vi_item_len += tb->insert_size[0]; in create_virtual_node()
158 vi->vi_item_len = tb->insert_size[0]; in create_virtual_node()
[all …]
|
| D | ibalance.c | 25 struct tree_balance *tb, in internal_define_dest_src_infos() argument
36 src_bi->tb = tb; in internal_define_dest_src_infos()
37 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos()
38 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos()
39 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos()
40 dest_bi->tb = tb; in internal_define_dest_src_infos()
41 dest_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
42 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
43 dest_bi->bi_position = get_left_neighbor_position(tb, h); in internal_define_dest_src_infos()
44 *d_key = tb->lkey[h]; in internal_define_dest_src_infos()
[all …]
|
| D | prints.c | 613 void store_print_tb(struct tree_balance *tb) in store_print_tb() argument
619 if (!tb) in store_print_tb()
627 REISERFS_SB(tb->tb_sb)->s_do_balance, in store_print_tb()
628 tb->tb_mode, PATH_LAST_POSITION(tb->tb_path), in store_print_tb()
629 tb->tb_path->pos_in_item); in store_print_tb()
631 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
632 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
633 tb->tb_path->path_length in store_print_tb()
634 && PATH_H_PATH_OFFSET(tb->tb_path, in store_print_tb()
636 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
[all …]
|
| D | lbalance.c | 361 do_balance_mark_leaf_dirty(dest_bi->tb, dest, 0); in leaf_copy_items_entirely()
374 do_balance_mark_internal_dirty(dest_bi->tb, dest_bi->bi_parent, in leaf_copy_items_entirely()
556 static void leaf_define_dest_src_infos(int shift_mode, struct tree_balance *tb, in leaf_define_dest_src_infos() argument
568 src_bi->tb = tb; in leaf_define_dest_src_infos()
569 src_bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); in leaf_define_dest_src_infos()
570 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in leaf_define_dest_src_infos()
571 src_bi->bi_position = PATH_H_B_ITEM_ORDER(tb->tb_path, 0); /* src->b_item_order */ in leaf_define_dest_src_infos()
572 dest_bi->tb = tb; in leaf_define_dest_src_infos()
573 dest_bi->bi_bh = tb->L[0]; in leaf_define_dest_src_infos()
574 dest_bi->bi_parent = tb->FL[0]; in leaf_define_dest_src_infos()
[all …]
|
| D | stree.c | 1099 static int calc_deleted_bytes_number(struct tree_balance *tb, char mode) in calc_deleted_bytes_number() argument
1102 struct item_head *p_le_ih = PATH_PITEM_HEAD(tb->tb_path); in calc_deleted_bytes_number()
1109 M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0]; in calc_deleted_bytes_number()
1119 (PATH_PLAST_BUFFER(tb->tb_path)->b_size); in calc_deleted_bytes_number()
1124 struct tree_balance *tb, in init_tb_struct() argument
1131 memset(tb, '\0', sizeof(struct tree_balance)); in init_tb_struct()
1132 tb->transaction_handle = th; in init_tb_struct()
1133 tb->tb_sb = sb; in init_tb_struct()
1134 tb->tb_path = path; in init_tb_struct()
1137 tb->insert_size[0] = size; in init_tb_struct()
[all …]
|
| D | reiserfs.h | 1977 #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen) argument
2155 struct tree_balance *tb; member
2161 static inline struct super_block *sb_from_tb(struct tree_balance *tb) in sb_from_tb() argument
2163 return tb ? tb->tb_sb : NULL; in sb_from_tb()
2168 return bi ? sb_from_tb(bi->tb) : NULL; in sb_from_bi()
2722 int fix_nodes(int n_op_mode, struct tree_balance *tb,
2739 void store_print_tb(struct tree_balance *tb);
2758 int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
2760 int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
2761 int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
[all …]
|
| /fs/nfsd/ |
| D | nfs4xdr.c | 187 struct tmpbuf *tb; in defer_free() local
189 tb = kmalloc(sizeof(*tb), GFP_KERNEL); in defer_free()
190 if (!tb) in defer_free()
192 tb->buf = p; in defer_free()
193 tb->release = release; in defer_free()
194 tb->next = argp->to_free; in defer_free()
195 argp->to_free = tb; in defer_free()
3612 struct tmpbuf *tb = args->to_free; in nfsd4_release_compoundargs() local
3613 args->to_free = tb->next; in nfsd4_release_compoundargs()
3614 tb->release(tb->buf); in nfsd4_release_compoundargs()
[all …]
|
| /fs/ntfs/ |
| D | mft.c | 1291 u8 *b, tb; in ntfs_mft_bitmap_extend_allocation_nolock() local
1338 tb = 1 << (lcn & 7ull); in ntfs_mft_bitmap_extend_allocation_nolock()
1340 if (*b != 0xff && !(*b & tb)) { in ntfs_mft_bitmap_extend_allocation_nolock()
1342 *b |= tb; in ntfs_mft_bitmap_extend_allocation_nolock()
|