Searched refs:bn (Results 1 - 12 of 12) sorted by relevance

/fs/jfs/
H A Djfs_btree.h31 s64 next; right sibling bn
32 s64 prev; left sibling bn
112 s64 bn; /* 8: */ member in struct:btframe
133 (BTSTACK)->top->bn = BN;\
149 printk(KERN_ERR "bn = %Lx, index = %d\n",
150 (long long)btstack->stack[i].bn,
157 BN = (LEAF)->bn;\
H A Djfs_dtree.c334 static u32 add_index(tid_t tid, struct inode *ip, s64 bn, int slot) argument
372 DTSaddress(dirtab_slot, bn);
477 DTSaddress(dirtab_slot, bn);
524 static void modify_index(tid_t tid, struct inode *ip, u32 index, s64 bn, argument
534 DTSaddress(dirtab_slot, bn);
585 s64 bn; local
631 * by convention, root bn = 0.
633 for (bn = 0;;) {
635 DT_GETPAGE(ip, bn, mp, psize, p, rc);
705 btsp->bn
827 s64 bn; local
2086 s64 bn; local
2451 s64 bn; local
2646 s64 bn; local
2918 add_missing_indices(struct inode *inode, s64 bn) argument
3016 s64 bn; local
3347 s64 bn; local
3425 s64 bn; local
3921 s64 bn = 0; local
4525 s64 bn; local
[all...]
H A Djfs_xtree.c152 s64 bn; local
188 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
235 * btstack contains (bn, index) of search path traversed to the entry.
245 s64 bn; /* block number */ local
275 * by convention, root bn = 0.
277 for (bn = 0;;) {
279 XT_GETPAGE(ip, bn, mp, PSIZE, p, rc);
360 btsp->bn = bn;
407 btsp->bn
545 s64 bn; local
1369 s64 bn; local
1532 s64 bn; local
1711 s64 bn; local
2178 s64 bn, xaddr; local
2344 s64 bn; local
2577 s64 bn; local
2898 s64 bn; /* block number */ local
3168 s64 bn; local
3720 s64 bn; local
[all...]
/fs/freevxfs/
H A Dvxfs_bmap.c67 vxfs_bmap_ext4(struct inode *ip, long bn) argument
80 if (bn >= 0 && bn < d->size)
81 return (bn + d->extent);
82 bn -= d->size;
85 if ((bn / (indsize * indsize * bsize / 4)) == 0) {
95 bno = indir[(bn/indsize) % (indsize*bn)] + (bn%indsize);
/fs/gfs2/
H A Dbmap.c401 unsigned offset, u64 bn)
408 mp->mp_bh[i] = gfs2_meta_new(gl, bn);
413 *ptr = cpu_to_be64(bn);
458 u64 bn, dblock = 0; local
508 error = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
513 gfs2_trans_add_unrevoke(sdp, bn, n);
523 gfs2_indirect_init(mp, ip->i_gl, i, 0, bn++);
552 mp->mp_list[i-1], bn++);
564 dblock = bn;
566 *ptr++ = cpu_to_be64(bn
399 gfs2_indirect_init(struct metapath *mp, struct gfs2_glock *gl, unsigned int i, unsigned offset, u64 bn) argument
722 u64 bn, bstart; local
877 u64 bn; local
[all...]
H A Dxattr.c140 u64 bn; local
144 bn = be64_to_cpu(*eablk);
146 error = gfs2_meta_read(ip->i_gl, bn, DIO_WAIT, &eabh);
235 u64 bn = 0; local
253 bn = be64_to_cpu(*dataptrs);
259 rgd = gfs2_blk2rgrpd(sdp, bn, 1);
280 bn = be64_to_cpu(*dataptrs);
282 if (bstart + blen == bn)
287 bstart = bn;
1319 u64 bn; local
1364 u64 bn; local
[all...]
H A Drgrp.h46 extern int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
H A Ddir.c832 u64 bn; local
840 error = gfs2_alloc_blocks(ip, &bn, &n, 0, NULL);
843 bh = gfs2_meta_new(ip->i_gl, bn);
847 gfs2_trans_add_unrevoke(GFS2_SB(inode), bn, 1);
884 u64 bn; local
896 bn = bh->b_blocknr;
943 *lp = cpu_to_be64(bn);
975 u64 bn, leaf_no; local
1004 bn = nbh->b_blocknr;
1030 lp[x] = cpu_to_be64(bn);
1649 u64 bn; local
[all...]
H A Drgrp.c2237 * @bn: Used to return the starting block number
2245 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *nblocks, argument
2320 *bn = block;
/fs/reiserfs/
H A Djournal.c139 struct reiserfs_bitmap_node *bn; local
142 bn = kmalloc(sizeof(struct reiserfs_bitmap_node), GFP_NOFS);
143 if (!bn) {
146 bn->data = kzalloc(sb->s_blocksize, GFP_NOFS);
147 if (!bn->data) {
148 kfree(bn);
151 bn->id = id++;
152 INIT_LIST_HEAD(&bn->list);
153 return bn;
159 struct reiserfs_bitmap_node *bn local
179 free_bitmap_node(struct super_block *sb, struct reiserfs_bitmap_node *bn) argument
197 struct reiserfs_bitmap_node *bn = NULL; local
261 struct reiserfs_bitmap_node *bn; local
979 b_blocknr_t bn; local
[all...]
/fs/xfs/
H A Dxfs_aops.c620 sector_t bn; local
628 bn = (iomap_bn >> (inode->i_blkbits - BBSHIFT)) +
631 ASSERT(bn || XFS_IS_REALTIME_INODE(XFS_I(inode)));
633 bh->b_blocknr = bn;
/fs/nilfs2/
H A Dsegment.c2038 static void nilfs_segctor_do_flush(struct nilfs_sc_info *sci, int bn) argument
2041 if (!(sci->sc_flush_request & (1 << bn))) {
2044 sci->sc_flush_request |= (1 << bn);

Completed in 183 milliseconds