@@ -454,7 +454,7 @@ read_ag_header(int fd, xfs_agnumber_t agno, wbuf *buf, ag_header_t *ag,
ASSERT(be32_to_cpu(ag->xfs_agf->agf_magicnum) == XFS_AGF_MAGIC);
ag->xfs_agi = (xfs_agi_t *) (buf->data + diff + 2 * sectorsize);
ASSERT(be32_to_cpu(ag->xfs_agi->agi_magicnum) == XFS_AGI_MAGIC);
- ag->xfs_agfl = (xfs_agfl_t *) (buf->data + diff + 3 * sectorsize);
+ ag->xfs_agfl = (struct xfs_agfl *) (buf->data + diff + 3 * sectorsize);
}
@@ -21,7 +21,7 @@ typedef struct ag_header {
xfs_dsb_t *xfs_sb; /* superblock for filesystem or AG */
xfs_agf_t *xfs_agf; /* free space info */
xfs_agi_t *xfs_agi; /* free inode info */
- xfs_agfl_t *xfs_agfl; /* AG freelist */
+ struct xfs_agfl *xfs_agfl; /* AG freelist */
char *residue;
int residue_length;
} ag_header_t;
@@ -34,7 +34,7 @@ const field_t agfl_crc_hfld[] = { {
{ NULL }
};
-#define OFF(f) bitize(offsetof(xfs_agfl_t, agfl_ ## f))
+#define OFF(f) bitize(offsetof(struct xfs_agfl, agfl_ ## f))
const field_t agfl_flds[] = {
{ "bno", FLDT_AGBLOCKNZ, OI(OFF(magicnum)), agfl_bno_size,
FLD_ARRAY|FLD_COUNT, TYP_DATA },
@@ -783,15 +783,15 @@ typedef struct xfs_agi {
*/
#define XFS_AGFL_DADDR(mp) ((xfs_daddr_t)(3 << (mp)->m_sectbb_log))
#define XFS_AGFL_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGFL_DADDR(mp))
-#define XFS_BUF_TO_AGFL(bp) ((xfs_agfl_t *)((bp)->b_addr))
+#define XFS_BUF_TO_AGFL(bp) ((struct xfs_agfl *)((bp)->b_addr))
-typedef struct xfs_agfl {
+struct xfs_agfl {
__be32 agfl_magicnum;
__be32 agfl_seqno;
uuid_t agfl_uuid;
__be64 agfl_lsn;
__be32 agfl_crc;
-} __attribute__((packed)) xfs_agfl_t;
+} __attribute__((packed));
#define XFS_AGFL_CRC_OFF offsetof(struct xfs_agfl, agfl_crc)
@@ -441,7 +441,7 @@ calculate_freespace_cursor(xfs_mount_t *mp, xfs_agnumber_t agno,
* as they will be *after* accounting for the free space
* we've used up will need fewer blocks to to represent
* than we've allocated. We can use the AGFL to hold
- * xfs_agfl_size (sector/xfs_agfl_t) blocks but that's it.
+ * xfs_agfl_size (sector/struct xfs_agfl) blocks but that's it.
* Thus we limit things to xfs_agfl_size/2 for each of the 2 btrees.
* if the number of extra blocks is more than that,
* we'll have to be called again.