| /fs/reiserfs/ |
| D | do_balan.c | 19 static inline void buffer_info_init_left(struct tree_balance *tb, in buffer_info_init_left() argument
22 bi->tb = tb; in buffer_info_init_left()
23 bi->bi_bh = tb->L[0]; in buffer_info_init_left()
24 bi->bi_parent = tb->FL[0]; in buffer_info_init_left()
25 bi->bi_position = get_left_neighbor_position(tb, 0); in buffer_info_init_left()
28 static inline void buffer_info_init_right(struct tree_balance *tb, in buffer_info_init_right() argument
31 bi->tb = tb; in buffer_info_init_right()
32 bi->bi_bh = tb->R[0]; in buffer_info_init_right()
33 bi->bi_parent = tb->FR[0]; in buffer_info_init_right()
34 bi->bi_position = get_right_neighbor_position(tb, 0); in buffer_info_init_right()
[all …]
|
| D | fix_node.c | 51 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
54 struct virtual_node *vn = tb->tb_vn; in create_virtual_node()
58 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
76 vn->vn_vi = (struct virtual_item *)(tb->tb_vn + 1); in create_virtual_node()
115 op_create_vi(vn, vi, is_affected, tb->insert_size[0]); in create_virtual_node()
116 if (tb->vn_buf + tb->vn_buf_size < vn->vn_free_ptr) in create_virtual_node()
117 reiserfs_panic(tb->tb_sb, "vs-8030", in create_virtual_node()
125 vn->vn_vi[new_num].vi_item_len += tb->insert_size[0]; in create_virtual_node()
137 vi->vi_item_len = tb->insert_size[0]; in create_virtual_node()
[all …]
|
| D | ibalance.c | 28 struct tree_balance *tb, in internal_define_dest_src_infos() argument
41 src_bi->tb = tb; in internal_define_dest_src_infos()
42 src_bi->bi_bh = PATH_H_PBUFFER(tb->tb_path, h); in internal_define_dest_src_infos()
43 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, h); in internal_define_dest_src_infos()
44 src_bi->bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in internal_define_dest_src_infos()
45 dest_bi->tb = tb; in internal_define_dest_src_infos()
46 dest_bi->bi_bh = tb->L[h]; in internal_define_dest_src_infos()
47 dest_bi->bi_parent = tb->FL[h]; in internal_define_dest_src_infos()
48 dest_bi->bi_position = get_left_neighbor_position(tb, h); in internal_define_dest_src_infos()
49 *d_key = tb->lkey[h]; in internal_define_dest_src_infos()
[all …]
|
| D | prints.c | 640 void store_print_tb(struct tree_balance *tb) in store_print_tb() argument
646 if (!tb) in store_print_tb()
654 REISERFS_SB(tb->tb_sb)->s_do_balance, in store_print_tb()
655 tb->tb_mode, PATH_LAST_POSITION(tb->tb_path), in store_print_tb()
656 tb->tb_path->pos_in_item); in store_print_tb()
658 for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { in store_print_tb()
659 if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= in store_print_tb()
660 tb->tb_path->path_length in store_print_tb()
661 && PATH_H_PATH_OFFSET(tb->tb_path, in store_print_tb()
663 tbSh = PATH_H_PBUFFER(tb->tb_path, h); in store_print_tb()
[all …]
|
| D | lbalance.c | 392 do_balance_mark_leaf_dirty(dest_bi->tb, dest, 0); in leaf_copy_items_entirely()
405 do_balance_mark_internal_dirty(dest_bi->tb, dest_bi->bi_parent, in leaf_copy_items_entirely()
629 static void leaf_define_dest_src_infos(int shift_mode, struct tree_balance *tb, in leaf_define_dest_src_infos() argument
641 src_bi->tb = tb; in leaf_define_dest_src_infos()
642 src_bi->bi_bh = PATH_PLAST_BUFFER(tb->tb_path); in leaf_define_dest_src_infos()
643 src_bi->bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in leaf_define_dest_src_infos()
646 src_bi->bi_position = PATH_H_B_ITEM_ORDER(tb->tb_path, 0); in leaf_define_dest_src_infos()
647 dest_bi->tb = tb; in leaf_define_dest_src_infos()
648 dest_bi->bi_bh = tb->L[0]; in leaf_define_dest_src_infos()
649 dest_bi->bi_parent = tb->FL[0]; in leaf_define_dest_src_infos()
[all …]
|
| D | stree.c | 1164 static int calc_deleted_bytes_number(struct tree_balance *tb, char mode) in calc_deleted_bytes_number() argument
1167 struct item_head *p_le_ih = tp_item_head(tb->tb_path); in calc_deleted_bytes_number()
1174 M_DELETE) ? ih_item_len(p_le_ih) : -tb->insert_size[0]; in calc_deleted_bytes_number()
1186 (PATH_PLAST_BUFFER(tb->tb_path)->b_size); in calc_deleted_bytes_number()
1191 struct tree_balance *tb, in init_tb_struct() argument
1198 memset(tb, '\0', sizeof(struct tree_balance)); in init_tb_struct()
1199 tb->transaction_handle = th; in init_tb_struct()
1200 tb->tb_sb = sb; in init_tb_struct()
1201 tb->tb_path = path; in init_tb_struct()
1204 tb->insert_size[0] = size; in init_tb_struct()
[all …]
|
| D | reiserfs.h | 2304 #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen) argument
2590 struct tree_balance *tb; member
2596 static inline struct super_block *sb_from_tb(struct tree_balance *tb) in sb_from_tb() argument
2598 return tb ? tb->tb_sb : NULL; in sb_from_tb()
2603 return bi ? sb_from_tb(bi->tb) : NULL; in sb_from_bi()
3183 int fix_nodes(int n_op_mode, struct tree_balance *tb,
3200 void store_print_tb(struct tree_balance *tb);
3219 int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
3221 int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
3222 int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
[all …]
|
| /fs/smbfs_common/ |
| D | cifs_arc4.c | 43 u32 ty, ta, tb; in cifs_arc4_crypt() local
62 tb = S[ty]; in cifs_arc4_crypt()
68 b = tb; in cifs_arc4_crypt()
|
| /fs/nfsd/ |
| D | nfs4xdr.c | 121 struct svcxdr_tmpbuf *tb; in svcxdr_tmpalloc() local
123 tb = kmalloc(sizeof(*tb) + len, GFP_KERNEL); in svcxdr_tmpalloc()
124 if (!tb) in svcxdr_tmpalloc()
126 tb->next = argp->to_free; in svcxdr_tmpalloc()
127 argp->to_free = tb; in svcxdr_tmpalloc()
128 return tb->buf; in svcxdr_tmpalloc()
5409 struct svcxdr_tmpbuf *tb = args->to_free; in nfsd4_release_compoundargs() local
5410 args->to_free = tb->next; in nfsd4_release_compoundargs()
5411 kfree(tb); in nfsd4_release_compoundargs()
|
| /fs/ntfs/ |
| D | mft.c | 1286 u8 *b, tb; in ntfs_mft_bitmap_extend_allocation_nolock() local
1333 tb = 1 << (lcn & 7ull); in ntfs_mft_bitmap_extend_allocation_nolock()
1335 if (*b != 0xff && !(*b & tb)) { in ntfs_mft_bitmap_extend_allocation_nolock()
1337 *b |= tb; in ntfs_mft_bitmap_extend_allocation_nolock()
|
| /fs/unicode/ |
| D | mkutf8data.c | 2432 unsigned int tb = 0x11a7; in hangul_decompose() local
2458 mapping[i++] = tb + ti; in hangul_decompose()
|