/linux-master/fs/xfs/scrub/ |
H A D | agino_bitmap.h | 26 xfs_agino_t agino, unsigned int len) 28 return xbitmap32_clear(&bitmap->aginobitmap, agino, len); 32 xfs_agino_t agino, unsigned int len) 34 return xbitmap32_set(&bitmap->aginobitmap, agino, len); 38 xfs_agino_t agino, unsigned int *len) 40 return xbitmap32_test(&bitmap->aginobitmap, agino, len); 25 xagino_bitmap_clear(struct xagino_bitmap *bitmap, xfs_agino_t agino, unsigned int len) argument 31 xagino_bitmap_set(struct xagino_bitmap *bitmap, xfs_agino_t agino, unsigned int len) argument 37 xagino_bitmap_test(struct xagino_bitmap *bitmap, xfs_agino_t agino, unsigned int *len) argument
|
H A D | ialloc.c | 68 xfs_agino_t agino, 81 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &has_record); 91 if (frec.ir_startino + XFS_INODES_PER_CHUNK <= agino) 95 frec_idx = agino - frec.ir_startino; 135 xfs_agino_t agino, 147 for (i = agino, rec_idx = agino - irec->ir_startino; 148 i < agino + nr_inodes; 171 xfs_agino_t agino, 184 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_L 65 xchk_inobt_xref_finobt( struct xfs_scrub *sc, struct xfs_inobt_rec_incore *irec, xfs_agino_t agino, bool free, bool hole) argument 132 xchk_inobt_chunk_xref_finobt( struct xfs_scrub *sc, struct xfs_inobt_rec_incore *irec, xfs_agino_t agino, unsigned int nr_inodes) argument 168 xchk_finobt_xref_inobt( struct xfs_scrub *sc, struct xfs_inobt_rec_incore *frec, xfs_agino_t agino, bool ffree, bool fhole) argument 220 xchk_finobt_chunk_xref_inobt( struct xfs_scrub *sc, struct xfs_inobt_rec_incore *frec, xfs_agino_t agino, unsigned int nr_inodes) argument 253 xchk_iallocbt_chunk( struct xchk_btree *bs, struct xfs_inobt_rec_incore *irec, xfs_agino_t agino, unsigned int nr_inodes) argument 308 xfs_agino_t agino; local 581 xfs_agino_t agino; local [all...] |
H A D | agheader_repair.c | 979 * Record a forwards unlinked chain pointer from agino -> next_agino in our 985 xfs_agino_t agino, 990 return xfarray_store(ragi->iunlink_next, agino, &next_agino); 994 * Record a backwards unlinked chain pointer from prev_ino <- agino in our 1000 xfs_agino_t agino, 1005 return xfarray_store(ragi->iunlink_prev, agino, &prev_agino); 1009 * Given an @agino, look up the next inode in the iunlink bucket. Returns 1010 * NULLAGINO if we're at the end of the chain, 0 if @agino is not in memory 1016 xfs_agino_t agino) 1020 ip = xfs_iunlink_lookup(sc->sa.pag, agino); 983 xrep_iunlink_store_next( struct xrep_agi *ragi, xfs_agino_t agino, xfs_agino_t next_agino) argument 998 xrep_iunlink_store_prev( struct xrep_agi *ragi, xfs_agino_t agino, xfs_agino_t prev_agino) argument 1014 xrep_iunlink_next( struct xfs_scrub *sc, xfs_agino_t agino) argument 1034 xrep_iunlink_reload_next( struct xrep_agi *ragi, xfs_agino_t prev_agino, xfs_agino_t agino) argument 1089 xfs_agino_t agino = next_agino; local 1139 xfs_agino_t agino; local 1247 xfs_agino_t agino; local 1417 xrep_iunlink_add_to_bucket( struct xrep_agi *ragi, xfs_agino_t agino) argument 1536 xfarray_idx_t agino = idx - 1; local 1596 xfarray_idx_t agino = idx - 1; local 1655 xfs_agino_t agino; local [all...] |
H A D | iscan.c | 101 xfs_agino_t agino = *cursor; local 107 if (agino > last) { 117 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &has_rec); 153 if (rec.ir_startino + XFS_INODES_PER_CHUNK <= agino) 165 if (agino >= rec.ir_startino) 167 agino + 1 - rec.ir_startino); 202 xfs_agino_t agino) 215 cursor = XFS_AGINO_TO_INO(mp, agno, agino); 229 * Prepare to return agno/agino to the iscan caller by moving the lastino 315 xfs_agino_t agino; local 199 xchk_iscan_move_cursor( struct xchk_iscan *iscan, xfs_agnumber_t agno, xfs_agino_t agino) argument [all...] |
H A D | ialloc_repair.c | 150 xfs_agino_t agino; local 156 agino = cluster_ag_base + cluster_index; 157 fsino = XFS_AGINO_TO_INO(mp, agno, agino); 172 error = xchk_inode_is_allocated(sc, agino, inuse); 346 xfs_agino_t agino; local 378 agino = XFS_AGB_TO_AGINO(mp, agbno); 379 if (!xfs_verify_agino(sc->sa.pag, agino)) 382 agino = XFS_AGB_TO_AGINO(mp, agbno + len) - 1; 383 if (!xfs_verify_agino(sc->sa.pag, agino)) 645 * earlier. The records were collected in order of increasing agino, [all...] |
H A D | agheader.c | 881 xfs_agino_t agino = be32_to_cpu(agi->agi_unlinked[i]); local 883 while (agino != NULLAGINO) { 884 if (agino % XFS_AGI_UNLINKED_BUCKETS != i) { 889 ip = xfs_iunlink_lookup(sc->sa.pag, agino); 900 agino = ip->i_next_unlinked; 917 xfs_agino_t agino; local 965 agino = be32_to_cpu(agi->agi_newino); 966 if (!xfs_verify_agino_or_null(pag, agino)) 969 agino = be32_to_cpu(agi->agi_dirino); 970 if (!xfs_verify_agino_or_null(pag, agino)) [all...] |
H A D | inode.c | 611 xfs_agino_t agino; local 618 agino = XFS_INO_TO_AGINO(sc->mp, ino); 624 error = xfs_inobt_lookup(sc->sa.fino_cur, agino, XFS_LOOKUP_LE, 639 if (rec.ir_startino > agino || 640 rec.ir_startino + XFS_INODES_PER_CHUNK <= agino) 643 if (rec.ir_free & XFS_INOBT_MASK(agino - rec.ir_startino))
|
H A D | trace.h | 2072 TP_printk("dev %d:%d agno 0x%x agino 0x%x holemask 0x%x count 0x%x freecount 0x%x freemask 0x%llx", 3324 __field(xfs_agino_t, agino) 3333 __entry->agino = XFS_INO_TO_AGINO(pag->pag_mount, ip->i_ino); 3339 TP_printk("dev %d:%d agno 0x%x bucket %u agino 0x%x bucket_agino 0x%x prev_agino 0x%x next_agino 0x%x", 3343 __entry->agino, 3355 __field(xfs_agino_t, agino) 3364 __entry->agino = XFS_INO_TO_AGINO(ip->i_mount, ip->i_ino); 3370 TP_printk("dev %d:%d agno 0x%x bucket %u agino 0x%x nlink %u old_prev_agino %u prev_agino 0x%x next_agino 0x%x", 3373 __entry->agino % XFS_AGI_UNLINKED_BUCKETS, 3374 __entry->agino, [all...] |
H A D | rmap_repair.c | 614 xfs_agino_t agino; local 628 agino = irec.ir_startino; 632 agbno = XFS_AGINO_TO_AGBNO(mp, agino); 643 for (i = 0, agino = irec.ir_startino; 645 i += iperhole / XFS_INODES_PER_HOLEMASK_BIT, agino += iperhole) { 651 agbno = XFS_AGINO_TO_AGBNO(mp, agino);
|
H A D | common.h | 252 int xchk_inode_is_allocated(struct xfs_scrub *sc, xfs_agino_t agino,
|
H A D | common.c | 1316 xfs_agino_t agino, 1338 ino = XFS_AGINO_TO_INO(sc->mp, pag->pag_agno, agino); 1344 ip = radix_tree_lookup(&pag->pag_ici_root, agino); 1314 xchk_inode_is_allocated( struct xfs_scrub *sc, xfs_agino_t agino, bool *inuse) argument
|
H A D | inode_repair.c | 174 xfs_agino_t agino; local 179 agino = be32_to_cpu(dip->di_next_unlinked); 181 if (xfs_verify_agino_or_null(bp->b_pag, agino))
|
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_types.c | 84 xfs_agino_t agino) 90 return agino >= first && agino <= last; 103 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, ino); local 107 if (XFS_AGINO_TO_INO(mp, agno, agino) != ino) 109 return xfs_verify_agno_agino(mp, agno, agino); 81 xfs_verify_agno_agino( struct xfs_mount *mp, xfs_agnumber_t agno, xfs_agino_t agino) argument
|
H A D | xfs_ag.h | 207 xfs_verify_agino(struct xfs_perag *pag, xfs_agino_t agino) argument 209 if (agino < pag->agino_min) 211 if (agino > pag->agino_max) 221 xfs_verify_agino_or_null(struct xfs_perag *pag, xfs_agino_t agino) argument 223 if (agino == NULLAGINO) 225 return xfs_verify_agino(pag, agino);
|
H A D | xfs_ialloc.c | 1015 xfs_agino_t agino, 1022 error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_EQ, &i); 2043 xfs_agino_t agino, 2057 ASSERT(XFS_AGINO_TO_AGBNO(mp, agino) < be32_to_cpu(agi->agi_length)); 2071 if ((error = xfs_inobt_lookup(cur, agino, XFS_LOOKUP_LE, &i))) { 2095 off = agino - rec.ir_startino; 2179 xfs_agino_t agino, 2185 int offset = agino - ibtrec->ir_startino; 2297 xfs_agino_t agino; /* allocation group inode number */ local 2311 agino 1013 xfs_ialloc_get_rec( struct xfs_btree_cur *cur, xfs_agino_t agino, xfs_inobt_rec_incore_t *rec, int *done) argument 2039 xfs_difree_inobt( struct xfs_perag *pag, struct xfs_trans *tp, struct xfs_buf *agbp, xfs_agino_t agino, struct xfs_icluster *xic, struct xfs_inobt_rec_incore *orec) argument 2175 xfs_difree_finobt( struct xfs_perag *pag, struct xfs_trans *tp, struct xfs_buf *agbp, xfs_agino_t agino, struct xfs_inobt_rec_incore *ibtrec) argument 2359 xfs_imap_lookup( struct xfs_perag *pag, struct xfs_trans *tp, xfs_agino_t agino, xfs_agblock_t agbno, xfs_agblock_t *chunk_agbno, xfs_agblock_t *offset_agbno, int flags) argument 2431 xfs_agino_t agino; /* inode number within alloc group */ local 2837 xfs_agino_t agino; local 3105 xfs_agino_t agino; local [all...] |
/linux-master/fs/xfs/ |
H A D | xfs_iwalk.c | 128 * @agino so that we skip them. This is how we restart an inode walk that was 133 xfs_agino_t agino, /* starting inode of chunk */ 138 idx = agino - irec->ir_startino; 245 * inobt and make the record look like all the inodes before agino are free so 258 xfs_agino_t agino, 277 if (agino == 0) 287 error = xfs_inobt_lookup(*curpp, agino, XFS_LOOKUP_LE, has_more); 292 * If the LE lookup at @agino yields no records, jump ahead to the 315 if (irec->ir_startino + XFS_INODES_PER_CHUNK <= agino) 319 * If agino fel 132 xfs_iwalk_adjust_start( xfs_agino_t agino, struct xfs_inobt_rec_incore *irec) argument 256 xfs_iwalk_ag_start( struct xfs_iwalk_ag *iwag, xfs_agino_t agino, struct xfs_btree_cur **curpp, struct xfs_buf **agi_bpp, int *has_more) argument 405 xfs_agino_t agino; local [all...] |
H A D | xfs_icache.c | 227 xfs_agino_t agino, 236 radix_tree_tag_set(&pag->pag_ici_root, agino, tag); 266 xfs_agino_t agino, 274 * Reclaim can signal (with a null agino) that it cleared its own tag 277 if (agino != NULLAGINO) 278 radix_tree_tag_clear(&pag->pag_ici_root, agino, tag); 615 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, ino); local 704 error = radix_tree_insert(&pag->pag_ici_root, agino, ip); 751 xfs_agino_t agino; local 764 agino 225 xfs_perag_set_inode_tag( struct xfs_perag *pag, xfs_agino_t agino, unsigned int tag) argument 264 xfs_perag_clear_inode_tag( struct xfs_perag *pag, xfs_agino_t agino, unsigned int tag) argument [all...] |
H A D | xfs_itable.c | 259 * next chunk. In other words, the magic agino value of zero takes us to the 260 * first chunk in the AG, and an agino value past the end of the AG takes us to 272 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, startino); local 275 startino != XFS_AGINO_TO_INO(mp, agno, agino);
|
H A D | xfs_trace.h | 13 * agino: per-AG inode number 899 TP_PROTO(struct xfs_mount *mp, xfs_agnumber_t agno, xfs_agino_t agino, 901 TP_ARGS(mp, agno, agino, holemask, nagino, nholemask), 905 __field(xfs_agino_t, agino) 913 __entry->agino = agino; 918 TP_printk("dev %d:%d agno 0x%x agino 0x%x holemask 0x%x new_agino 0x%x new_holemask 0x%x", 921 __entry->agino, 928 TP_PROTO(struct xfs_mount *mp, xfs_agnumber_t agno, xfs_agino_t agino, 930 TP_ARGS(mp, agno, agino, holemas [all...] |
H A D | xfs_inode.c | 2066 xfs_agino_t agino) 2071 ip = radix_tree_lookup(&pag->pag_ici_root, agino); 2092 * Update the prev pointer of the next agino. Returns -ENOLINK if the inode 2226 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, ip->i_ino); local 2227 short bucket_index = agino % XFS_AGI_UNLINKED_BUCKETS; 2236 if (next_agino == agino || 2247 error = xfs_iunlink_update_backref(pag, agino, next_agino); 2249 error = xfs_iunlink_reload_next(tp, agibp, agino, next_agino); 2266 return xfs_iunlink_update_bucket(tp, pag, agibp, bucket_index, agino); 2312 xfs_agino_t agino local 2064 xfs_iunlink_lookup( struct xfs_perag *pag, xfs_agino_t agino) argument 4065 xfs_agino_t agino = XFS_INO_TO_AGINO(mp, ip->i_ino); local [all...] |
H A D | xfs_log_recover.c | 2725 xfs_agino_t prev_agino, agino; local 2728 agino = be32_to_cpu(agi->agi_unlinked[bucket]); 2729 while (agino != NULLAGINO) { 2731 XFS_AGINO_TO_INO(mp, pag->pag_agno, agino), 2739 agino = ip->i_next_unlinked; 2759 prev_agino = agino;
|
H A D | xfs_super.c | 285 xfs_agino_t agino; local 305 agino = XFS_AGB_TO_AGINO(mp, sbp->sb_agblocks - 1); 306 ino = XFS_AGINO_TO_INO(mp, agcount - 1, agino); 321 ino = XFS_AGINO_TO_INO(mp, index, agino);
|
H A D | xfs_inode.h | 32 xfs_ino_t i_ino; /* inode number (agno/agino)*/ 622 struct xfs_inode *xfs_iunlink_lookup(struct xfs_perag *pag, xfs_agino_t agino);
|