/fs/bfs/ |
H A D | file.c | 72 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 D | inode.c | 169 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/btrfs/ |
H A D | print-tree.c | 180 struct btrfs_block_group_item *bi; local 274 bi = btrfs_item_ptr(l, i, 277 btrfs_disk_block_group_used(l, bi));
|
H A D | relocation.c | 627 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);
|
H A D | extent-tree.c | 987 struct btrfs_tree_block_info *bi; local 1028 new_size += sizeof(*bi); 1048 bi = (struct btrfs_tree_block_info *)(item + 1); 1050 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi)); 1051 btrfs_set_tree_block_level(leaf, bi, (int)owner); 2117 struct btrfs_tree_block_info *bi; local 2119 bi = (struct btrfs_tree_block_info *)(ei + 1); 2120 btrfs_set_tree_block_key(leaf, bi, &extent_op->key); 3138 unsigned long bi; local 6021 struct btrfs_tree_block_info *bi; local [all...] |
H A D | ctree.h | 2894 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...] |
/fs/reiserfs/ |
H A D | ibalance.c | 638 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 D | do_balan.c | 20 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 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, 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 D | bitmap.c | 148 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);
|
H A D | reiserfs.h | 2598 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,
|
/fs/befs/ |
H A D | linuxvfs.c | 283 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);
|
/fs/gfs2/ |
H A D | lops.c | 76 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);
|
H A D | rgrp.c | 92 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...] |
/fs/ubifs/ |
H A D | debug.c | 577 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 D | ubifs.h | 1103 * @space_lock: protects @bi and @lst 1105 * @bi: budgeting information 1340 struct ubifs_budg_info bi; member in struct:ubifs_info
|