| /fs/ubifs/ |
| D | budget.c | 94 liab = c->bi.idx_growth + c->bi.data_growth + c->bi.dd_growth; in get_liability()
168 idx_size = c->bi.old_idx_sz + c->bi.idx_growth + c->bi.uncommitted_idx; in ubifs_calc_min_idx_lebs()
330 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs); in do_budget_space()
335 outstanding = c->bi.data_growth + c->bi.dd_growth; in do_budget_space()
346 c->bi.min_idx_lebs = min_idx_lebs; in do_budget_space()
379 data_growth = req->new_ino ? c->bi.inode_budget : 0; in calc_data_growth()
381 data_growth += c->bi.page_budget; in calc_data_growth()
383 data_growth += c->bi.dent_budget; in calc_data_growth()
399 dd_growth = req->dirtied_page ? c->bi.page_budget : 0; in calc_dd_growth()
402 dd_growth += c->bi.inode_budget * req->dirtied_ino; in calc_dd_growth()
[all …]
|
| D | debug.c | 612 void ubifs_dump_budg(struct ubifs_info *c, const struct ubifs_budg_info *bi) in ubifs_dump_budg() argument
623 current->pid, bi->data_growth + bi->dd_growth, in ubifs_dump_budg()
624 bi->data_growth + bi->dd_growth + bi->idx_growth); in ubifs_dump_budg()
626 bi->data_growth, bi->dd_growth, bi->idx_growth); in ubifs_dump_budg()
628 bi->min_idx_lebs, bi->old_idx_sz, bi->uncommitted_idx); in ubifs_dump_budg()
630 bi->page_budget, bi->inode_budget, bi->dent_budget); in ubifs_dump_budg()
631 pr_err("\tnospace %u, nospace_rp %u\n", bi->nospace, bi->nospace_rp); in ubifs_dump_budg()
635 if (bi != &c->bi) in ubifs_dump_budg()
669 available = ubifs_calc_available(c, c->bi.min_idx_lebs); in ubifs_dump_budg()
670 outstanding = c->bi.data_growth + c->bi.dd_growth; in ubifs_dump_budg()
[all …]
|
| D | master.c | 224 if (c->bi.old_idx_sz & 7 || c->bi.old_idx_sz >= main_sz) { in validate_master()
294 c->lst.total_used + c->bi.old_idx_sz > main_sz) { in validate_master()
362 c->bi.old_idx_sz = le64_to_cpu(c->mst_node->index_size); in ubifs_read_master()
383 c->calc_idx_sz = c->bi.old_idx_sz; in ubifs_read_master()
|
| D | super.c | 390 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_evict_inode()
725 c->bi.page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE; in init_constants_sb()
726 c->bi.inode_budget = UBIFS_INO_NODE_SZ; in init_constants_sb()
727 c->bi.dent_budget = UBIFS_MAX_DENT_NODE_SZ; in init_constants_sb()
771 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in init_constants_master()
1244 ubifs_dump_budg(c, &c->bi); in check_free_space()
1451 err = dbg_check_idx_size(c, c->bi.old_idx_sz); in mount_ubifs()
1460 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in mount_ubifs()
1591 c->bi.old_idx_sz, c->bi.old_idx_sz >> 10, in mount_ubifs()
1592 c->bi.old_idx_sz >> 20); in mount_ubifs()
[all …]
|
| D | find.c | 243 if (c->bi.min_idx_lebs >= c->lst.idx_lebs) { in ubifs_find_dirty_leb()
244 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs; in ubifs_find_dirty_leb()
267 exclude_index = (c->bi.min_idx_lebs >= c->lst.idx_lebs); in ubifs_find_dirty_leb()
492 if (c->bi.min_idx_lebs > c->lst.idx_lebs) in ubifs_find_free_space()
493 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs; in ubifs_find_free_space()
|
| D | tnc_commit.c | 384 ubifs_dump_budg(c, &c->bi); in layout_in_gaps()
799 ubifs_assert(c, c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c)); in ubifs_tnc_start_commit()
800 c->bi.old_idx_sz = c->calc_idx_sz; in ubifs_tnc_start_commit()
801 c->bi.uncommitted_idx = 0; in ubifs_tnc_start_commit()
802 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in ubifs_tnc_start_commit()
|
| D | dir.c | 854 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_unlink()
957 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_rmdir()
|
| /fs/reiserfs/ |
| D | do_balan.c | 20 struct buffer_info *bi) 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()
29 struct buffer_info *bi) 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 | lbalance.c | 814 static void leaf_delete_items_entirely(struct buffer_info *bi,
901 void leaf_insert_into_buf(struct buffer_info *bi, int before, in leaf_insert_into_buf() argument
906 struct buffer_head *bh = bi->bi_bh; in leaf_insert_into_buf()
962 do_balance_mark_leaf_dirty(bi->tb, bh, 1); in leaf_insert_into_buf()
964 if (bi->bi_parent) { in leaf_insert_into_buf()
966 t_dc = B_N_CHILD(bi->bi_parent, bi->bi_position); in leaf_insert_into_buf()
970 do_balance_mark_internal_dirty(bi->tb, bi->bi_parent, 0); in leaf_insert_into_buf()
978 void leaf_paste_in_buffer(struct buffer_info *bi, int affected_item_num, in leaf_paste_in_buffer() argument
982 struct buffer_head *bh = bi->bi_bh; in leaf_paste_in_buffer()
1001 if (bi && bi->tb) in leaf_paste_in_buffer()
[all …]
|
| D | ibalance.c | 638 struct buffer_info bi; in balance_internal_when_delete() local
643 bi.tb = tb; in balance_internal_when_delete()
644 bi.bi_bh = tbSh; in balance_internal_when_delete()
645 bi.bi_parent = PATH_H_PPARENT(tb->tb_path, h); in balance_internal_when_delete()
646 bi.bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in balance_internal_when_delete()
648 internal_delete_childs(&bi, child_pos, -insert_num); in balance_internal_when_delete()
664 RFALSE(bi.bi_parent, "root has parent (%p)", in balance_internal_when_delete()
665 bi.bi_parent); in balance_internal_when_delete()
812 struct buffer_info bi; in balance_internal() local
871 bi.tb = tb; in balance_internal()
[all …]
|
| D | bitmap.c | 148 struct reiserfs_bitmap_info *bi = &SB_AP_BITMAP(s)[bmap_n]; in scan_bitmap_block() local
158 if (!bi) { in scan_bitmap_block()
170 if (bi->free_count < min) { in scan_bitmap_block()
257 bi->free_count -= (end - *beg); in scan_bitmap_block()
|
| D | reiserfs.h | 2600 static inline struct super_block *sb_from_bi(struct buffer_info *bi) in sb_from_bi() argument
2602 return bi ? sb_from_tb(bi->tb) : NULL; in sb_from_bi()
3204 void print_bi(struct buffer_info *bi, char *mes);
3226 void leaf_insert_into_buf(struct buffer_info *bi, int before,
3230 void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
3233 void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
3235 void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
|
| /fs/gfs2/ |
| D | rgrp.c | 97 struct gfs2_bitmap *bi = rbm_bi(rbm); in gfs2_setbit() local
98 unsigned int buflen = bi->bi_bytes; in gfs2_setbit()
101 byte1 = bi->bi_bh->b_data + bi->bi_offset + (rbm->offset / GFS2_NBBY); in gfs2_setbit()
102 end = bi->bi_bh->b_data + bi->bi_offset + buflen; in gfs2_setbit()
114 (unsigned long long)rbm->rgd->rd_addr, bi->bi_start, in gfs2_setbit()
115 (unsigned long long)bi->bi_bh->b_blocknr); in gfs2_setbit()
117 bi->bi_offset, bi->bi_bytes, in gfs2_setbit()
125 if (do_clone && bi->bi_clone) { in gfs2_setbit()
126 byte2 = bi->bi_clone + bi->bi_offset + (rbm->offset / GFS2_NBBY); in gfs2_setbit()
145 struct gfs2_bitmap *bi = rbm_bi(rbm); in gfs2_testbit() local
[all …]
|
| D | lops.c | 77 struct gfs2_bitmap *bi = rgd->rd_bits + index; in maybe_release_space() local
80 if (bi->bi_clone == NULL) in maybe_release_space()
83 gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bd->bd_bh, bi, 1, NULL); in maybe_release_space()
84 memcpy(bi->bi_clone + bi->bi_offset, in maybe_release_space()
85 bd->bd_bh->b_data + bi->bi_offset, bi->bi_bytes); in maybe_release_space()
86 clear_bit(GBF_FULL, &bi->bi_flags); in maybe_release_space()
|
| D | rgrp.h | 75 const struct gfs2_bitmap *bi, unsigned minlen,
|
| /fs/bfs/ |
| D | file.c | 71 struct bfs_inode_info *bi = BFS_I(inode); in bfs_get_block() local
73 phys = bi->i_sblock + block; in bfs_get_block()
75 if (phys <= bi->i_eblock) { in bfs_get_block()
87 if (bi->i_sblock && (phys <= bi->i_eblock)) { in bfs_get_block()
106 if (bi->i_eblock == info->si_lf_eblk) { in bfs_get_block()
110 info->si_freeb -= phys - bi->i_eblock; in bfs_get_block()
111 info->si_lf_eblk = bi->i_eblock = phys; in bfs_get_block()
124 if (bi->i_sblock) { in bfs_get_block()
125 err = bfs_move_blocks(inode->i_sb, bi->i_sblock, in bfs_get_block()
126 bi->i_eblock, phys); in bfs_get_block()
[all …]
|
| D | inode.c | 170 struct bfs_inode_info *bi = BFS_I(inode); in bfs_evict_inode() local
191 if (bi->i_dsk_ino) { in bfs_evict_inode()
192 if (bi->i_sblock) in bfs_evict_inode()
193 info->si_freeb += bi->i_eblock + 1 - bi->i_sblock; in bfs_evict_inode()
204 if (info->si_lf_eblk == bi->i_eblock) in bfs_evict_inode()
205 info->si_lf_eblk = bi->i_sblock - 1; in bfs_evict_inode()
241 struct bfs_inode_info *bi; in bfs_alloc_inode() local
242 bi = alloc_inode_sb(sb, bfs_inode_cachep, GFP_KERNEL); in bfs_alloc_inode()
243 if (!bi) in bfs_alloc_inode()
245 return &bi->vfs_inode; in bfs_alloc_inode()
[all …]
|
| /fs/xfs/ |
| D | xfs_bmap_item.c | 250 struct xfs_bmap_intent *bi) in xfs_trans_log_finish_bmap_update() argument
254 error = xfs_bmap_finish_one(tp, bi); in xfs_trans_log_finish_bmap_update()
312 struct xfs_bmap_intent *bi) in xfs_bmap_update_log_item() argument
328 map->me_owner = bi->bi_owner->i_ino; in xfs_bmap_update_log_item()
329 map->me_startblock = bi->bi_bmap.br_startblock; in xfs_bmap_update_log_item()
330 map->me_startoff = bi->bi_bmap.br_startoff; in xfs_bmap_update_log_item()
331 map->me_len = bi->bi_bmap.br_blockcount; in xfs_bmap_update_log_item()
332 xfs_trans_set_bmap_flags(map, bi->bi_type, bi->bi_whichfork, in xfs_bmap_update_log_item()
333 bi->bi_bmap.br_state); in xfs_bmap_update_log_item()
345 struct xfs_bmap_intent *bi; in xfs_bmap_update_create_intent() local
[all …]
|
| /fs/adfs/ |
| D | dir_fplus.c | 74 unsigned int end, bs, bi, i; in adfs_fplus_checkbyte() local
82 for (dircheck = 0, bi = 0; end; bi++) { in adfs_fplus_checkbyte()
83 bp = (void *)dir->bhs[bi]->b_data; in adfs_fplus_checkbyte()
84 bs = dir->bhs[bi]->b_size; in adfs_fplus_checkbyte()
|
| /fs/btrfs/ |
| D | accessors.h | 792 const struct btrfs_balance_item *bi, in btrfs_balance_data() argument
795 read_eb_member(eb, bi, struct btrfs_balance_item, data, ba); in btrfs_balance_data()
799 struct btrfs_balance_item *bi, in btrfs_set_balance_data() argument
802 write_eb_member(eb, bi, struct btrfs_balance_item, data, ba); in btrfs_set_balance_data()
806 const struct btrfs_balance_item *bi, in btrfs_balance_meta() argument
809 read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); in btrfs_balance_meta()
813 struct btrfs_balance_item *bi, in btrfs_set_balance_meta() argument
816 write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); in btrfs_set_balance_meta()
820 const struct btrfs_balance_item *bi, in btrfs_balance_sys() argument
823 read_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); in btrfs_balance_sys()
[all …]
|
| D | print-tree.c | 212 struct btrfs_block_group_item *bi; in btrfs_print_leaf() local
297 bi = btrfs_item_ptr(l, i, in btrfs_print_leaf()
301 btrfs_block_group_used(l, bi), in btrfs_print_leaf()
302 btrfs_block_group_chunk_objectid(l, bi), in btrfs_print_leaf()
303 btrfs_block_group_flags(l, bi)); in btrfs_print_leaf()
|
| /fs/befs/ |
| D | linuxvfs.c | 278 struct befs_inode_info *bi; in befs_alloc_inode() local
280 bi = alloc_inode_sb(sb, befs_inode_cachep, GFP_KERNEL); in befs_alloc_inode()
281 if (!bi) in befs_alloc_inode()
283 return &bi->vfs_inode; in befs_alloc_inode()
293 struct befs_inode_info *bi = (struct befs_inode_info *) foo; in init_once() local
295 inode_init_once(&bi->vfs_inode); in init_once()
|
| /fs/xfs/libxfs/ |
| D | xfs_bmap.h | 246 struct xfs_bmap_intent *bi);
248 int xfs_bmap_finish_one(struct xfs_trans *tp, struct xfs_bmap_intent *bi);
|
| D | xfs_bmap.c | 6079 struct xfs_bmap_intent *bi; in __xfs_bmap_add() local
6090 bi = kmem_cache_alloc(xfs_bmap_intent_cache, GFP_NOFS | __GFP_NOFAIL); in __xfs_bmap_add()
6091 INIT_LIST_HEAD(&bi->bi_list); in __xfs_bmap_add()
6092 bi->bi_type = type; in __xfs_bmap_add()
6093 bi->bi_owner = ip; in __xfs_bmap_add()
6094 bi->bi_whichfork = whichfork; in __xfs_bmap_add()
6095 bi->bi_bmap = *bmap; in __xfs_bmap_add()
6097 xfs_bmap_update_get_group(tp->t_mountp, bi); in __xfs_bmap_add()
6098 xfs_defer_add(tp, XFS_DEFER_OPS_TYPE_BMAP, &bi->bi_list); in __xfs_bmap_add()
6135 struct xfs_bmap_intent *bi) in xfs_bmap_finish_one() argument
[all …]
|
| D | xfs_format.h | 1158 #define XFS_BITTOBLOCK(mp,bi) ((bi) >> (mp)->m_blkbit_log) argument
1160 #define XFS_BITTOWORD(mp,bi) \ argument
1161 ((int)(((bi) >> XFS_NBWORDLOG) & XFS_BLOCKWMASK(mp)))
|