| /fs/ |
| D | bio-integrity.c | 155 struct blk_integrity *bi = bdev_get_integrity(bdev); in bdev_integrity_enabled() local
157 if (bi == NULL) in bdev_integrity_enabled()
160 if (rw == READ && bi->verify_fn != NULL && in bdev_integrity_enabled()
161 (bi->flags & INTEGRITY_FLAG_READ)) in bdev_integrity_enabled()
164 if (rw == WRITE && bi->generate_fn != NULL && in bdev_integrity_enabled()
165 (bi->flags & INTEGRITY_FLAG_WRITE)) in bdev_integrity_enabled()
200 static inline unsigned int bio_integrity_hw_sectors(struct blk_integrity *bi, in bio_integrity_hw_sectors() argument
204 if (bi->sector_size == 4096) in bio_integrity_hw_sectors()
220 struct blk_integrity *bi = bdev_get_integrity(bio->bi_bdev); in bio_integrity_tag_size() local
224 return bi->tag_size * (bio->bi_size / bi->sector_size); in bio_integrity_tag_size()
[all …]
|
| D | bio.c | 1399 static void bio_pair_end_1(struct bio *bi, int err) in bio_pair_end_1() argument
1401 struct bio_pair *bp = container_of(bi, struct bio_pair, bio1); in bio_pair_end_1()
1409 static void bio_pair_end_2(struct bio *bi, int err) in bio_pair_end_2() argument
1411 struct bio_pair *bp = container_of(bi, struct bio_pair, bio2); in bio_pair_end_2()
1423 struct bio_pair *bio_split(struct bio *bi, int first_sectors) in bio_split() argument
1430 trace_block_split(bdev_get_queue(bi->bi_bdev), bi, in bio_split()
1431 bi->bi_sector + first_sectors); in bio_split()
1433 BUG_ON(bi->bi_vcnt != 1); in bio_split()
1434 BUG_ON(bi->bi_idx != 0); in bio_split()
1437 bp->bio1 = *bi; in bio_split()
[all …]
|
| /fs/reiserfs/ |
| D | do_balan.c | 77 struct buffer_info bi; in balance_leaf_when_delete() local
99 bi.tb = tb; in balance_leaf_when_delete()
100 bi.bi_bh = tbS0; in balance_leaf_when_delete()
101 bi.bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in balance_leaf_when_delete()
102 bi.bi_position = PATH_H_POSITION(tb->tb_path, 1); in balance_leaf_when_delete()
103 leaf_delete_items(&bi, 0, item_pos, 1, -1); in balance_leaf_when_delete()
124 bi.tb = tb; in balance_leaf_when_delete()
125 bi.bi_bh = tbS0; in balance_leaf_when_delete()
126 bi.bi_parent = PATH_H_PPARENT(tb->tb_path, 0); in balance_leaf_when_delete()
127 bi.bi_position = PATH_H_POSITION(tb->tb_path, 1); in balance_leaf_when_delete()
[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 | lbalance.c | 724 static void leaf_delete_items_entirely(struct buffer_info *bi,
796 void leaf_insert_into_buf(struct buffer_info *bi, int before, in leaf_insert_into_buf() argument
800 struct buffer_head *bh = bi->bi_bh; in leaf_insert_into_buf()
856 do_balance_mark_leaf_dirty(bi->tb, bh, 1); in leaf_insert_into_buf()
858 if (bi->bi_parent) { in leaf_insert_into_buf()
860 t_dc = B_N_CHILD(bi->bi_parent, bi->bi_position); in leaf_insert_into_buf()
864 do_balance_mark_internal_dirty(bi->tb, bi->bi_parent, 0); in leaf_insert_into_buf()
870 void leaf_paste_in_buffer(struct buffer_info *bi, int affected_item_num, in leaf_paste_in_buffer() argument
874 struct buffer_head *bh = bi->bi_bh; in leaf_paste_in_buffer()
945 do_balance_mark_leaf_dirty(bi->tb, bh, 0); in leaf_paste_in_buffer()
[all …]
|
| D | bitmap.c | 141 struct reiserfs_bitmap_info *bi = &SB_AP_BITMAP(s)[bmap_n]; in scan_bitmap_block() local
156 if (!bi) { in scan_bitmap_block()
168 if (bi->free_count < min) { in scan_bitmap_block()
226 bi->free_count -= (end - *beg); in scan_bitmap_block()
|
| /fs/gfs2/ |
| D | rgrp.c | 255 struct gfs2_bitmap *bi = NULL; in gfs2_rgrp_verify() local
264 bi = rgd->rd_bits + buf; in gfs2_rgrp_verify()
267 bi->bi_bh->b_data + in gfs2_rgrp_verify()
268 bi->bi_offset, in gfs2_rgrp_verify()
269 bi->bi_len, x); in gfs2_rgrp_verify()
420 struct gfs2_bitmap *bi; in compute_bitstructs() local
435 bi = rgd->rd_bits + x; in compute_bitstructs()
440 bi->bi_offset = sizeof(struct gfs2_rgrp); in compute_bitstructs()
441 bi->bi_start = 0; in compute_bitstructs()
442 bi->bi_len = bytes; in compute_bitstructs()
[all …]
|
| /fs/bfs/ |
| D | file.c | 73 struct bfs_inode_info *bi = BFS_I(inode); in bfs_get_block() local
76 phys = bi->i_sblock + block; in bfs_get_block()
78 if (phys <= bi->i_eblock) { in bfs_get_block()
90 if (bi->i_sblock && (phys <= bi->i_eblock)) { in bfs_get_block()
109 if (bi->i_eblock == info->si_lf_eblk) { in bfs_get_block()
113 info->si_freeb -= phys - bi->i_eblock; in bfs_get_block()
114 info->si_lf_eblk = bi->i_eblock = phys; in bfs_get_block()
128 if (bi->i_sblock) { in bfs_get_block()
129 err = bfs_move_blocks(inode->i_sb, bi->i_sblock, in bfs_get_block()
130 bi->i_eblock, phys); in bfs_get_block()
[all …]
|
| D | inode.c | 161 struct bfs_inode_info *bi = BFS_I(inode); in bfs_delete_inode() local
191 if (bi->i_dsk_ino) { in bfs_delete_inode()
192 if (bi->i_sblock) in bfs_delete_inode()
193 info->si_freeb += bi->i_eblock + 1 - bi->i_sblock; in bfs_delete_inode()
204 if (info->si_lf_eblk == bi->i_eblock) { in bfs_delete_inode()
205 info->si_lf_eblk = bi->i_sblock - 1; in bfs_delete_inode()
258 struct bfs_inode_info *bi; in bfs_alloc_inode() local
259 bi = kmem_cache_alloc(bfs_inode_cachep, GFP_KERNEL); in bfs_alloc_inode()
260 if (!bi) in bfs_alloc_inode()
262 return &bi->vfs_inode; in bfs_alloc_inode()
[all …]
|
| /fs/yaffs2/ |
| D | yaffs_checkptrw.c | 43 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, i); in yaffs_CheckpointErase() local
44 if (bi->blockState == YAFFS_BLOCK_STATE_CHECKPOINT) { in yaffs_CheckpointErase()
50 bi->blockState = YAFFS_BLOCK_STATE_EMPTY; in yaffs_CheckpointErase()
55 bi->blockState = YAFFS_BLOCK_STATE_DEAD; in yaffs_CheckpointErase()
79 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, i); in yaffs_CheckpointFindNextErasedBlock() local
80 if (bi->blockState == YAFFS_BLOCK_STATE_EMPTY) { in yaffs_CheckpointFindNextErasedBlock()
215 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, dev->checkpointCurrentBlock); in yaffs_CheckpointFlushBuffer() local
216 bi->blockState = YAFFS_BLOCK_STATE_CHECKPOINT; in yaffs_CheckpointFlushBuffer()
365 yaffs_BlockInfo *bi = NULL; in yaffs_CheckpointClose() local
367 bi = yaffs_GetBlockInfo(dev, blk); in yaffs_CheckpointClose()
[all …]
|
| D | yaffs_guts.c | 427 static void yaffs_VerifyBlock(yaffs_Device *dev, yaffs_BlockInfo *bi, int n) in yaffs_VerifyBlock() argument
436 if (bi->blockState >= YAFFS_NUMBER_OF_BLOCK_STATES) in yaffs_VerifyBlock()
437 T(YAFFS_TRACE_VERIFY, (TSTR("Block %d has undefined state %d"TENDSTR), n, bi->blockState)); in yaffs_VerifyBlock()
439 switch (bi->blockState) { in yaffs_VerifyBlock()
444 n, blockStateName[bi->blockState])); in yaffs_VerifyBlock()
449 actuallyUsed = bi->pagesInUse - bi->softDeletions; in yaffs_VerifyBlock()
451 if (bi->pagesInUse < 0 || bi->pagesInUse > dev->nChunksPerBlock || in yaffs_VerifyBlock()
452 bi->softDeletions < 0 || bi->softDeletions > dev->nChunksPerBlock || in yaffs_VerifyBlock()
455 n, bi->pagesInUse, bi->softDeletions)); in yaffs_VerifyBlock()
460 if (inUse != bi->pagesInUse) in yaffs_VerifyBlock()
[all …]
|
| D | yaffs_nand.c | 49 yaffs_BlockInfo *bi = yaffs_GetBlockInfo(dev, chunkInNAND/dev->nChunksPerBlock); in yaffs_ReadChunkWithTagsFromNAND() local
50 yaffs_HandleChunkError(dev, bi); in yaffs_ReadChunkWithTagsFromNAND()
|
| D | yaffs_guts.h | 899 void yaffs_HandleChunkError(yaffs_Device *dev, yaffs_BlockInfo *bi);
|
| /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 | 57 struct btrfs_block_group_item *bi; in btrfs_print_leaf() local
143 bi = btrfs_item_ptr(l, i, in btrfs_print_leaf()
147 btrfs_disk_block_group_used(l, bi)); in btrfs_print_leaf()
|
| D | super.c | 303 struct btrfs_inode *bi; in btrfs_fill_super() local
324 bi = BTRFS_I(inode); in btrfs_fill_super()
325 bi->location.objectid = inode->i_ino; in btrfs_fill_super()
326 bi->location.offset = 0; in btrfs_fill_super()
327 bi->root = tree_root->fs_info->fs_root; in btrfs_fill_super()
329 btrfs_set_key_type(&bi->location, BTRFS_INODE_ITEM_KEY); in btrfs_fill_super()
|
| D | inode.c | 2973 struct btrfs_inode *bi = BTRFS_I(inode); in init_btrfs_i() local
2975 bi->i_acl = NULL; in init_btrfs_i()
2976 bi->i_default_acl = NULL; in init_btrfs_i()
2978 bi->generation = 0; in init_btrfs_i()
2979 bi->sequence = 0; in init_btrfs_i()
2980 bi->last_trans = 0; in init_btrfs_i()
2981 bi->logged_trans = 0; in init_btrfs_i()
2982 bi->delalloc_bytes = 0; in init_btrfs_i()
2983 bi->reserved_bytes = 0; in init_btrfs_i()
2984 bi->disk_i_size = 0; in init_btrfs_i()
[all …]
|
| D | extent-tree.c | 1820 unsigned long bi; in write_one_cache_group() local
1829 bi = btrfs_item_ptr_offset(leaf, path->slots[0]); in write_one_cache_group()
1830 write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); in write_one_cache_group()
|
| /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()
295 struct befs_inode_info *bi = (struct befs_inode_info *) foo; in init_once() local
297 inode_init_once(&bi->vfs_inode); in init_once()
|