| /fs/ubifs/ |
| D | budget.c | 109 liab = c->bi.idx_growth + c->bi.data_growth + c->bi.dd_growth; in get_liability()
183 idx_size = c->bi.old_idx_sz + c->bi.idx_growth + c->bi.uncommitted_idx; in ubifs_calc_min_idx_lebs()
346 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs); in do_budget_space()
351 outstanding = c->bi.data_growth + c->bi.dd_growth; in do_budget_space()
362 c->bi.min_idx_lebs = min_idx_lebs; in do_budget_space()
395 data_growth = req->new_ino ? c->bi.inode_budget : 0; in calc_data_growth()
397 data_growth += c->bi.page_budget; in calc_data_growth()
399 data_growth += c->bi.dent_budget; in calc_data_growth()
415 dd_growth = req->dirtied_page ? c->bi.page_budget : 0; in calc_dd_growth()
418 dd_growth += c->bi.inode_budget << (req->dirtied_ino - 1); in calc_dd_growth()
[all …]
|
| D | debug.c | 577 void ubifs_dump_budg(struct ubifs_info *c, const struct ubifs_budg_info *bi) in ubifs_dump_budg() argument
588 current->pid, bi->data_growth + bi->dd_growth, in ubifs_dump_budg()
589 bi->data_growth + bi->dd_growth + bi->idx_growth); in ubifs_dump_budg()
591 bi->data_growth, bi->dd_growth, bi->idx_growth); in ubifs_dump_budg()
593 bi->min_idx_lebs, bi->old_idx_sz, bi->uncommitted_idx); in ubifs_dump_budg()
595 bi->page_budget, bi->inode_budget, bi->dent_budget); in ubifs_dump_budg()
596 pr_err("\tnospace %u, nospace_rp %u\n", bi->nospace, bi->nospace_rp); in ubifs_dump_budg()
600 if (bi != &c->bi) in ubifs_dump_budg()
634 available = ubifs_calc_available(c, c->bi.min_idx_lebs); in ubifs_dump_budg()
635 outstanding = c->bi.data_growth + c->bi.dd_growth; in ubifs_dump_budg()
[all …]
|
| D | master.c | 151 if (c->bi.old_idx_sz & 7 || c->bi.old_idx_sz >= main_sz) { in validate_master()
221 c->lst.total_used + c->bi.old_idx_sz > main_sz) { in validate_master()
289 c->bi.old_idx_sz = le64_to_cpu(c->mst_node->index_size); in ubifs_read_master()
308 c->calc_idx_sz = c->bi.old_idx_sz; in ubifs_read_master()
|
| D | super.c | 376 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_evict_inode()
697 c->bi.page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE; in init_constants_sb()
698 c->bi.inode_budget = UBIFS_INO_NODE_SZ; in init_constants_sb()
699 c->bi.dent_budget = UBIFS_MAX_DENT_NODE_SZ; in init_constants_sb()
743 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in init_constants_master()
1146 ubifs_dump_budg(c, &c->bi); in check_free_space()
1311 err = dbg_check_idx_size(c, c->bi.old_idx_sz); in mount_ubifs()
1320 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in mount_ubifs()
1444 c->bi.old_idx_sz, c->bi.old_idx_sz >> 10, in mount_ubifs()
1445 c->bi.old_idx_sz >> 20); in mount_ubifs()
[all …]
|
| D | find.c | 255 if (c->bi.min_idx_lebs >= c->lst.idx_lebs) { in ubifs_find_dirty_leb()
256 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs; in ubifs_find_dirty_leb()
279 exclude_index = (c->bi.min_idx_lebs >= c->lst.idx_lebs); in ubifs_find_dirty_leb()
504 if (c->bi.min_idx_lebs > c->lst.idx_lebs) in ubifs_find_free_space()
505 rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs; in ubifs_find_free_space()
|
| D | tnc_commit.c | 388 ubifs_dump_budg(c, &c->bi); in layout_in_gaps()
782 ubifs_assert(c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c)); in ubifs_tnc_start_commit()
783 c->bi.old_idx_sz = c->calc_idx_sz; in ubifs_tnc_start_commit()
784 c->bi.uncommitted_idx = 0; in ubifs_tnc_start_commit()
785 c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c); in ubifs_tnc_start_commit()
|
| D | dir.c | 625 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_unlink()
715 c->bi.nospace = c->bi.nospace_rp = 0; in ubifs_rmdir()
|
| D | debug.h | 258 void ubifs_dump_budg(struct ubifs_info *c, const struct ubifs_budg_info *bi);
|
| /fs/ |
| D | bio-integrity.c | 151 struct blk_integrity *bi = bdev_get_integrity(bdev); in bdev_integrity_enabled() local
153 if (bi == NULL) in bdev_integrity_enabled()
156 if (rw == READ && bi->verify_fn != NULL && in bdev_integrity_enabled()
157 (bi->flags & INTEGRITY_FLAG_READ)) in bdev_integrity_enabled()
160 if (rw == WRITE && bi->generate_fn != NULL && in bdev_integrity_enabled()
161 (bi->flags & INTEGRITY_FLAG_WRITE)) in bdev_integrity_enabled()
196 static inline unsigned int bio_integrity_hw_sectors(struct blk_integrity *bi, in bio_integrity_hw_sectors() argument
200 if (bi->sector_size == 4096) in bio_integrity_hw_sectors()
216 struct blk_integrity *bi = bdev_get_integrity(bio->bi_bdev); in bio_integrity_tag_size() local
220 return bi->tag_size * (bio->bi_size / bi->sector_size); in bio_integrity_tag_size()
[all …]
|
| D | bio.c | 1677 void bio_flush_dcache_pages(struct bio *bi) in bio_flush_dcache_pages() argument
1682 bio_for_each_segment(bvec, bi, i) in bio_flush_dcache_pages()
1725 static void bio_pair_end_1(struct bio *bi, int err) in bio_pair_end_1() argument
1727 struct bio_pair *bp = container_of(bi, struct bio_pair, bio1); in bio_pair_end_1()
1735 static void bio_pair_end_2(struct bio *bi, int err) in bio_pair_end_2() argument
1737 struct bio_pair *bp = container_of(bi, struct bio_pair, bio2); in bio_pair_end_2()
1748 struct bio_pair *bio_split(struct bio *bi, int first_sectors) in bio_split() argument
1755 trace_block_split(bdev_get_queue(bi->bi_bdev), bi, in bio_split()
1756 bi->bi_sector + first_sectors); in bio_split()
1758 BUG_ON(bio_segments(bi) > 1); in bio_split()
[all …]
|
| /fs/reiserfs/ |
| D | do_balan.c | 25 struct buffer_info *bi) 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()
34 struct buffer_info *bi) 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 | lbalance.c | 726 static void leaf_delete_items_entirely(struct buffer_info *bi,
798 void leaf_insert_into_buf(struct buffer_info *bi, int before, in leaf_insert_into_buf() argument
802 struct buffer_head *bh = bi->bi_bh; in leaf_insert_into_buf()
858 do_balance_mark_leaf_dirty(bi->tb, bh, 1); in leaf_insert_into_buf()
860 if (bi->bi_parent) { in leaf_insert_into_buf()
862 t_dc = B_N_CHILD(bi->bi_parent, bi->bi_position); in leaf_insert_into_buf()
866 do_balance_mark_internal_dirty(bi->tb, bi->bi_parent, 0); in leaf_insert_into_buf()
872 void leaf_paste_in_buffer(struct buffer_info *bi, int affected_item_num, in leaf_paste_in_buffer() argument
876 struct buffer_head *bh = bi->bi_bh; in leaf_paste_in_buffer()
895 if (bi && bi->tb) in leaf_paste_in_buffer()
[all …]
|
| D | ibalance.c | 595 struct buffer_info bi; in balance_internal_when_delete() local
600 bi.tb = tb; in balance_internal_when_delete()
601 bi.bi_bh = tbSh; in balance_internal_when_delete()
602 bi.bi_parent = PATH_H_PPARENT(tb->tb_path, h); in balance_internal_when_delete()
603 bi.bi_position = PATH_H_POSITION(tb->tb_path, h + 1); in balance_internal_when_delete()
605 internal_delete_childs(&bi, child_pos, -insert_num); in balance_internal_when_delete()
621 RFALSE(bi.bi_parent, "root has parent (%p)", in balance_internal_when_delete()
622 bi.bi_parent); in balance_internal_when_delete()
761 struct buffer_info bi; in balance_internal() local
815 bi.tb = tb; in balance_internal()
[all …]
|
| D | bitmap.c | 139 struct reiserfs_bitmap_info *bi = &SB_AP_BITMAP(s)[bmap_n]; in scan_bitmap_block() local
154 if (!bi) { in scan_bitmap_block()
166 if (bi->free_count < min) { in scan_bitmap_block()
224 bi->free_count -= (end - *beg); in scan_bitmap_block()
|
| D | reiserfs.h | 2171 static inline struct super_block *sb_from_bi(struct buffer_info *bi) in sb_from_bi() argument
2173 return bi ? sb_from_tb(bi->tb) : NULL; in sb_from_bi()
2749 void print_bi(struct buffer_info *bi, char *mes);
2771 void leaf_insert_into_buf(struct buffer_info *bi, int before,
2774 void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
2777 void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
2779 void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
|
| /fs/gfs2/ |
| D | rgrp.c | 84 unsigned int buflen = rbm->bi->bi_len; in gfs2_setbit()
87 byte1 = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY); in gfs2_setbit()
88 end = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset + buflen; in gfs2_setbit()
99 rbm->bi->bi_start); in gfs2_setbit()
101 rbm->bi->bi_offset, rbm->bi->bi_len); in gfs2_setbit()
108 if (do_clone && rbm->bi->bi_clone) { in gfs2_setbit()
109 byte2 = rbm->bi->bi_clone + rbm->bi->bi_offset + (rbm->offset / GFS2_NBBY); in gfs2_setbit()
124 const u8 *buffer = rbm->bi->bi_bh->b_data + rbm->bi->bi_offset; in gfs2_testbit()
262 rbm->bi = rbm->rgd->rd_bits; in gfs2_rbm_from_block()
265 if (rbm->offset < (rbm->bi->bi_start + rbm->bi->bi_len) * GFS2_NBBY) in gfs2_rbm_from_block()
[all …]
|
| D | lops.c | 75 struct gfs2_bitmap *bi = rgd->rd_bits + index; in maybe_release_space() local
77 if (bi->bi_clone == 0) in maybe_release_space()
80 gfs2_rgrp_send_discards(sdp, rgd->rd_data0, bd->bd_bh, bi, 1, NULL); in maybe_release_space()
81 memcpy(bi->bi_clone + bi->bi_offset, in maybe_release_space()
82 bd->bd_bh->b_data + bi->bi_offset, bi->bi_len); in maybe_release_space()
83 clear_bit(GBF_FULL, &bi->bi_flags); in maybe_release_space()
|
| D | incore.h | 104 struct gfs2_bitmap *bi; /* Bitmap must belong to the rgd */ member
110 return rbm->rgd->rd_data0 + (rbm->bi->bi_start * GFS2_NBBY) + rbm->offset; in gfs2_rbm_to_block()
116 return (rbm1->rgd == rbm2->rgd) && (rbm1->bi == rbm2->bi) && in gfs2_rbm_eq()
|
| D | rgrp.h | 74 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed);
|
| /fs/bfs/ |
| D | file.c | 72 struct bfs_inode_info *bi = BFS_I(inode); in bfs_get_block() local
74 phys = bi->i_sblock + block; in bfs_get_block()
76 if (phys <= bi->i_eblock) { in bfs_get_block()
88 if (bi->i_sblock && (phys <= bi->i_eblock)) { in bfs_get_block()
107 if (bi->i_eblock == info->si_lf_eblk) { in bfs_get_block()
111 info->si_freeb -= phys - bi->i_eblock; in bfs_get_block()
112 info->si_lf_eblk = bi->i_eblock = phys; in bfs_get_block()
125 if (bi->i_sblock) { in bfs_get_block()
126 err = bfs_move_blocks(inode->i_sb, bi->i_sblock, in bfs_get_block()
127 bi->i_eblock, phys); in bfs_get_block()
[all …]
|
| D | inode.c | 171 struct bfs_inode_info *bi = BFS_I(inode); in bfs_evict_inode() local
192 if (bi->i_dsk_ino) { in bfs_evict_inode()
193 if (bi->i_sblock) in bfs_evict_inode()
194 info->si_freeb += bi->i_eblock + 1 - bi->i_sblock; in bfs_evict_inode()
205 if (info->si_lf_eblk == bi->i_eblock) in bfs_evict_inode()
206 info->si_lf_eblk = bi->i_sblock - 1; in bfs_evict_inode()
244 struct bfs_inode_info *bi; in bfs_alloc_inode() local
245 bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL); in bfs_alloc_inode()
246 if (!bi) in bfs_alloc_inode()
248 return &bi->vfs_inode; in bfs_alloc_inode()
[all …]
|
| /fs/xfs/ |
| D | xfs_rtalloc.h | 53 #define XFS_BITTOBLOCK(mp,bi) ((bi) >> (mp)->m_blkbit_log) argument
55 #define XFS_BITTOWORD(mp,bi) \ argument
56 ((int)(((bi) >> XFS_NBWORDLOG) & XFS_BLOCKWMASK(mp)))
|
| /fs/btrfs/ |
| D | print-tree.c | 166 struct btrfs_block_group_item *bi; in btrfs_print_leaf() local
269 bi = btrfs_item_ptr(l, i, in btrfs_print_leaf()
273 btrfs_disk_block_group_used(l, bi)); in btrfs_print_leaf()
|
| D | ctree.h | 2670 struct btrfs_balance_item *bi, in btrfs_balance_data() argument
2673 read_eb_member(eb, bi, struct btrfs_balance_item, data, ba); in btrfs_balance_data()
2677 struct btrfs_balance_item *bi, in btrfs_set_balance_data() argument
2680 write_eb_member(eb, bi, struct btrfs_balance_item, data, ba); in btrfs_set_balance_data()
2684 struct btrfs_balance_item *bi, in btrfs_balance_meta() argument
2687 read_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); in btrfs_balance_meta()
2691 struct btrfs_balance_item *bi, in btrfs_set_balance_meta() argument
2694 write_eb_member(eb, bi, struct btrfs_balance_item, meta, ba); in btrfs_set_balance_meta()
2698 struct btrfs_balance_item *bi, in btrfs_balance_sys() argument
2701 read_eb_member(eb, bi, struct btrfs_balance_item, sys, ba); in btrfs_balance_sys()
[all …]
|
| /fs/befs/ |
| D | linuxvfs.c | 279 struct befs_inode_info *bi; in befs_alloc_inode() local
280 bi = (struct befs_inode_info *)kmem_cache_alloc(befs_inode_cachep, in befs_alloc_inode()
282 if (!bi) in befs_alloc_inode()
284 return &bi->vfs_inode; in befs_alloc_inode()
300 struct befs_inode_info *bi = (struct befs_inode_info *) foo; in init_once() local
302 inode_init_once(&bi->vfs_inode); in init_once()
|