Searched refs:bi (Results 1 - 25 of 31) sorted by relevance

12

/fs/ubifs/
H A Dbudget.c109 liab = c->bi.idx_growth + c->bi.data_growth + c->bi.dd_growth;
183 idx_size = c->bi.old_idx_sz + c->bi.idx_growth + c->bi.uncommitted_idx;
295 * Notes about @c->bi.min_idx_lebs and @c->lst.idx_lebs variables:
300 * o @c->bi.min_idx_lebs is the number of LEBS the index presumably takes. IOW,
301 * the index may be consolidated to take up to @c->bi.min_idx_lebs LEBs.
346 min_idx_lebs, c->bi
[all...]
H A Dmaster.c151 if (c->bi.old_idx_sz & 7 || c->bi.old_idx_sz >= main_sz) {
221 c->lst.total_used + c->bi.old_idx_sz > main_sz) {
289 c->bi.old_idx_sz = le64_to_cpu(c->mst_node->index_size);
308 c->calc_idx_sz = c->bi.old_idx_sz;
H A Ddebug.c577 void ubifs_dump_budg(struct ubifs_info *c, const struct ubifs_budg_info *bi) argument
588 current->pid, bi->data_growth + bi->dd_growth,
589 bi->data_growth + bi->dd_growth + bi->idx_growth);
591 bi->data_growth, bi->dd_growth, bi->idx_growth);
593 bi
[all...]
H A Dsuper.c377 c->bi.nospace = c->bi.nospace_rp = 0;
696 * it is not included into 'c->bi.inode_budget'.
698 c->bi.page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE;
699 c->bi.inode_budget = UBIFS_INO_NODE_SZ;
700 c->bi.dent_budget = UBIFS_MAX_DENT_NODE_SZ;
744 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
1131 ubifs_dump_budg(c, &c->bi);
1301 err = dbg_check_idx_size(c, c->bi.old_idx_sz);
1310 c->bi
[all...]
H A Dfind.c255 if (c->bi.min_idx_lebs >= c->lst.idx_lebs) {
256 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs;
279 exclude_index = (c->bi.min_idx_lebs >= c->lst.idx_lebs);
504 if (c->bi.min_idx_lebs > c->lst.idx_lebs)
505 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs;
H A Dtnc_commit.c388 ubifs_dump_budg(c, &c->bi);
775 * committed index ('c->bi.old_idx_sz') and zero out the index growth
781 ubifs_assert(c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c));
782 c->bi.old_idx_sz = c->calc_idx_sz;
783 c->bi.uncommitted_idx = 0;
784 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
H A Ddebug.h258 void ubifs_dump_budg(struct ubifs_info *c, const struct ubifs_budg_info *bi);
H A Ddir.c599 c->bi.nospace = c->bi.nospace_rp = 0;
689 c->bi.nospace = c->bi.nospace_rp = 0;
H A Dfile.c216 struct ubifs_budget_req req = { .dd_growth = c->bi.page_budget};
1194 c->bi.nospace = c->bi.nospace_rp = 0;
H A Dreplay.c1052 * UBIFS budgeting calculations use @c->bi.uncommitted_idx variable
1053 * to roughly estimate index growth. Things like @c->bi.min_idx_lebs
1057 c->bi.uncommitted_idx = atomic_long_read(&c->dirty_zn_cnt);
1058 c->bi.uncommitted_idx *= c->max_idx_node_sz;
/fs/bfs/
H A Dfile.c72 struct bfs_inode_info *bi = BFS_I(inode); local
74 phys = bi->i_sblock + block;
76 if (phys <= bi->i_eblock) {
88 if (bi->i_sblock && (phys <= bi->i_eblock)) {
107 if (bi->i_eblock == info->si_lf_eblk) {
111 info->si_freeb -= phys - bi->i_eblock;
112 info->si_lf_eblk = bi->i_eblock = phys;
125 if (bi->i_sblock) {
126 err = bfs_move_blocks(inode->i_sb, bi
[all...]
H A Dinode.c169 struct bfs_inode_info *bi = BFS_I(inode); local
190 if (bi->i_dsk_ino) {
191 if (bi->i_sblock)
192 info->si_freeb += bi->i_eblock + 1 - bi->i_sblock;
203 if (info->si_lf_eblk == bi->i_eblock)
204 info->si_lf_eblk = bi->i_sblock - 1;
242 struct bfs_inode_info *bi; local
243 bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL);
244 if (!bi)
262 struct bfs_inode_info *bi = foo; local
[all...]
/fs/reiserfs/
H A Ddo_balan.c20 struct buffer_info *bi)
22 bi->tb = tb;
23 bi->bi_bh = tb->L[0];
24 bi->bi_parent = tb->FL[0];
25 bi->bi_position = get_left_neighbor_position(tb, 0);
29 struct buffer_info *bi)
31 bi->tb = tb;
32 bi->bi_bh = tb->R[0];
33 bi->bi_parent = tb->FR[0];
34 bi
19 buffer_info_init_left(struct tree_balance *tb, struct buffer_info *bi) argument
28 buffer_info_init_right(struct tree_balance *tb, struct buffer_info *bi) argument
37 buffer_info_init_tbS0(struct tree_balance *tb, struct buffer_info *bi) argument
46 buffer_info_init_bh(struct tree_balance *tb, struct buffer_info *bi, struct buffer_head *bh) argument
81 struct buffer_info bi; local
115 struct buffer_info bi; local
243 struct buffer_info bi; local
294 struct buffer_info bi; local
362 struct buffer_info bi; local
425 struct buffer_info bi; local
544 struct buffer_info bi; local
634 struct buffer_info bi; local
721 struct buffer_info bi; local
775 struct buffer_info bi; local
852 struct buffer_info bi; local
937 struct buffer_info bi; local
1030 struct buffer_info bi; local
1087 struct buffer_info bi; local
1160 struct buffer_info bi; local
1276 struct buffer_info bi; local
1294 struct buffer_info bi; local
1327 struct buffer_info bi; local
1479 make_empty_node(struct buffer_info *bi) argument
1497 struct buffer_info bi; local
[all...]
H A Dibalance.c638 struct buffer_info bi; local
643 bi.tb = tb;
644 bi.bi_bh = tbSh;
645 bi.bi_parent = PATH_H_PPARENT(tb->tb_path, h);
646 bi.bi_position = PATH_H_POSITION(tb->tb_path, h + 1);
648 internal_delete_childs(&bi, child_pos, -insert_num);
664 RFALSE(bi.bi_parent, "root has parent (%p)",
665 bi.bi_parent);
812 struct buffer_info bi; local
871 bi
[all...]
H A Dlbalance.c814 static void leaf_delete_items_entirely(struct buffer_info *bi,
901 void leaf_insert_into_buf(struct buffer_info *bi, int before, argument
906 struct buffer_head *bh = bi->bi_bh;
962 do_balance_mark_leaf_dirty(bi->tb, bh, 1);
964 if (bi->bi_parent) {
966 t_dc = B_N_CHILD(bi->bi_parent, bi->bi_position);
970 do_balance_mark_internal_dirty(bi->tb, bi->bi_parent, 0);
978 void leaf_paste_in_buffer(struct buffer_info *bi, in argument
1145 leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, int pos_in_item, int cut_size) argument
1240 leaf_delete_items_entirely(struct buffer_info *bi, int first, int del_num) argument
1314 leaf_paste_entries(struct buffer_info *bi, int item_num, int before, int new_entry_count, struct reiserfs_de_head *new_dehs, const char *records, int paste_size) argument
[all...]
H A Dreiserfs.h2598 static inline struct super_block *sb_from_bi(struct buffer_info *bi) argument
2600 return bi ? sb_from_tb(bi->tb) : NULL;
3199 void print_bi(struct buffer_info *bi, char *mes);
3221 void leaf_insert_into_buf(struct buffer_info *bi, int before,
3225 void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
3228 void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
3230 void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
H A Dbitmap.c148 struct reiserfs_bitmap_info *bi = &SB_AP_BITMAP(s)[bmap_n]; local
158 if (!bi) {
170 if (bi->free_count < min) {
257 bi->free_count -= (end - *beg);
/fs/gfs2/
H A Drgrp.c92 struct gfs2_bitmap *bi = rbm_bi(rbm); local
93 unsigned int buflen = bi->bi_len;
96 byte1 = bi->bi_bh->b_data + bi->bi_offset + (rbm->offset / GFS2_NBBY);
97 end = bi->bi_bh->b_data + bi->bi_offset + buflen;
107 (unsigned long long)rbm->rgd->rd_addr, bi->bi_start);
109 bi->bi_offset, bi->bi_len);
116 if (do_clone && bi
132 struct gfs2_bitmap *bi = rbm_bi(rbm); local
362 struct gfs2_bitmap *bi; local
447 struct gfs2_bitmap *bi = NULL; local
592 struct gfs2_bitmap *bi = rgd->rd_bits + x; local
648 struct gfs2_bitmap *bi = rbm_bi(&rs->rs_rbm); local
767 struct gfs2_bitmap *bi; local
1081 struct gfs2_bitmap *bi; local
1119 struct gfs2_bitmap *bi; local
1226 struct gfs2_bitmap *bi = rgd->rd_bits + x; local
1235 gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset, struct buffer_head *bh, const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed) argument
1364 struct gfs2_bitmap *bi = rgd->rd_bits + x; local
1634 struct gfs2_bitmap *bi; local
1683 struct gfs2_bitmap *bi = rbm_bi(rbm); local
2100 struct gfs2_bitmap *bi, *bi_prev = NULL; local
[all...]
H A Drgrp.h74 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed);
H A Dlops.c76 struct gfs2_bitmap *bi = rgd->rd_bits + index; local
78 if (bi->bi_clone == NULL)
81 gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bd->bd_bh, bi, 1, NULL);
82 memcpy(bi->bi_clone + bi->bi_offset,
83 bd->bd_bh->b_data + bi->bi_offset, bi->bi_len);
84 clear_bit(GBF_FULL, &bi->bi_flags);
/fs/xfs/libxfs/
H A Dxfs_format.h60 #define XFS_BITTOBLOCK(mp,bi) ((bi) >> (mp)->m_blkbit_log)
62 #define XFS_BITTOWORD(mp,bi) \
63 ((int)(((bi) >> XFS_NBWORDLOG) & XFS_BLOCKWMASK(mp)))
/fs/btrfs/
H A Dprint-tree.c180 struct btrfs_block_group_item *bi; local
274 bi = btrfs_item_ptr(l, i,
277 btrfs_disk_block_group_used(l, bi));
H A Dctree.h2894 struct btrfs_balance_item *bi,
2897 read_eb_member(eb, bi, struct btrfs_balance_item, data, ba);
2901 struct btrfs_balance_item *bi,
2904 write_eb_member(eb, bi, struct btrfs_balance_item, data, ba);
2908 struct btrfs_balance_item *bi,
2911 read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba);
2915 struct btrfs_balance_item *bi,
2918 write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba);
2922 struct btrfs_balance_item *bi,
2925 read_eb_member(eb, bi, struc
2893 btrfs_balance_data(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
2900 btrfs_set_balance_data(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
2907 btrfs_balance_meta(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
2914 btrfs_set_balance_meta(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
2921 btrfs_balance_sys(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
2928 btrfs_set_balance_sys(struct extent_buffer *eb, struct btrfs_balance_item *bi, struct btrfs_disk_balance_args *ba) argument
[all...]
H A Drelocation.c627 struct btrfs_tree_block_info *bi; local
644 item_size <= sizeof(*ei) + sizeof(*bi)) {
645 WARN_ON(item_size < sizeof(*ei) + sizeof(*bi));
655 bi = (struct btrfs_tree_block_info *)(ei + 1);
656 *ptr = (unsigned long)(bi + 1);
3282 struct btrfs_tree_block_info *bi; local
3293 item_size >= sizeof(*ei) + sizeof(*bi)) {
3297 bi = (struct btrfs_tree_block_info *)(ei + 1);
3298 level = btrfs_tree_block_level(eb, bi);
/fs/befs/
H A Dlinuxvfs.c283 struct befs_inode_info *bi; local
284 bi = (struct befs_inode_info *)kmem_cache_alloc(befs_inode_cachep,
286 if (!bi)
288 return &bi->vfs_inode;
304 struct befs_inode_info *bi = (struct befs_inode_info *) foo; local
306 inode_init_once(&bi->vfs_inode);

Completed in 239 milliseconds

12