Home
last modified time | relevance | path

Searched refs:b_inode (Results 1 – 6 of 6) sorted by relevance

/openbmc/linux/fs/nilfs2/
H A Dbmap.c24 struct the_nilfs *nilfs = bmap->b_inode->i_sb->s_fs_info; in nilfs_bmap_get_dat()
32 struct inode *inode = bmap->b_inode; in nilfs_bmap_convert_error()
457 bmap->b_inode->i_blkbits); in nilfs_bmap_data_get_key()
482 unsigned long group = bmap->b_inode->i_ino / entries_per_group; in nilfs_bmap_find_target_in_group()
485 (bmap->b_inode->i_ino % NILFS_BMAP_GROUP_DIV) * in nilfs_bmap_find_target_in_group()
513 bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode; in nilfs_bmap_read()
514 switch (bmap->b_inode->i_ino) { in nilfs_bmap_read()
554 if (bmap->b_inode->i_ino == NILFS_DAT_INO) in nilfs_bmap_write()
564 bmap->b_inode = &NILFS_BMAP_I(bmap)->vfs_inode; in nilfs_bmap_init_gc()
H A Ddirect.c142 nilfs_inode_add_blocks(bmap->b_inode, 1); in nilfs_direct_insert()
164 nilfs_inode_sub_blocks(bmap->b_inode, 1); in nilfs_direct_delete()
337 nilfs_crit(bmap->b_inode->i_sb, in nilfs_direct_assign()
340 bmap->b_inode->i_ino, (unsigned long long)key); in nilfs_direct_assign()
345 nilfs_crit(bmap->b_inode->i_sb, in nilfs_direct_assign()
348 bmap->b_inode->i_ino, (unsigned long long)ptr); in nilfs_direct_assign()
H A Dbtree.c114 return i_blocksize(btree->b_inode); in nilfs_btree_node_size()
455 nilfs_crit(btree->b_inode->i_sb, in nilfs_btree_bad_node()
457 btree->b_inode->i_ino, in nilfs_btree_bad_node()
523 nilfs_err(btree->b_inode->i_sb, in __nilfs_btree_get_block()
525 btree->b_inode->i_ino, (unsigned long long)ptr); in __nilfs_btree_get_block()
1257 nilfs_inode_add_blocks(btree->b_inode, stats.bs_nblocks); in nilfs_btree_insert()
1609 nilfs_inode_sub_blocks(btree->b_inode, stats.bs_nblocks); in nilfs_btree_delete()
2098 nilfs_crit(btree->b_inode->i_sb, in nilfs_btree_propagate()
2100 btree->b_inode->i_ino, in nilfs_btree_propagate()
2138 nilfs_warn(btree->b_inode->i_sb, in nilfs_btree_add_dirty_buffer()
[all …]
H A Dbmap.h105 struct inode *b_inode; member
/openbmc/u-boot/fs/jffs2/
H A Djffs2_nand_1pass.c138 struct b_inode *new; in insert_inode()
140 if (!(new = (struct b_inode *)add_node(list, sizeof(struct b_inode)))) { in insert_inode()
263 struct b_inode *jNode; in jffs2_1pass_read_inode()
276 for (jNode = (struct b_inode *)pL->frag.listHead; jNode; jNode = jNode->next) { in jffs2_1pass_read_inode()
287 for (jNode = (struct b_inode *)pL->frag.listHead; jNode; jNode = jNode->next) { in jffs2_1pass_read_inode()
445 dump_inode(struct b_lists *pL, struct b_dirent *d, struct b_inode *i) in dump_inode()
483 struct b_inode *jNode = (struct b_inode *)pL->frag.listHead; in jffs2_1pass_list_inodes()
484 struct b_inode *i = NULL; in jffs2_1pass_list_inodes()
559 struct b_inode *jNode; in jffs2_1pass_resolve_inode()
592 for (jNode = (struct b_inode *)pL->frag.listHead; jNode; jNode = jNode->next) { in jffs2_1pass_resolve_inode()
H A Djffs2_nand_private.h10 struct b_inode { struct
11 struct b_inode *next; argument