xfs_ag.h 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231
  1. /*
  2. * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #ifndef __XFS_AG_H__
  19. #define __XFS_AG_H__
  20. /*
  21. * Allocation group header
  22. * This is divided into three structures, placed in sequential 512-byte
  23. * buffers after a copy of the superblock (also in a 512-byte buffer).
  24. */
  25. struct xfs_buf;
  26. struct xfs_mount;
  27. struct xfs_trans;
  28. #define XFS_AGF_MAGIC 0x58414746 /* 'XAGF' */
  29. #define XFS_AGI_MAGIC 0x58414749 /* 'XAGI' */
  30. #define XFS_AGF_VERSION 1
  31. #define XFS_AGI_VERSION 1
  32. #define XFS_AGF_GOOD_VERSION(v) ((v) == XFS_AGF_VERSION)
  33. #define XFS_AGI_GOOD_VERSION(v) ((v) == XFS_AGI_VERSION)
  34. /*
  35. * Btree number 0 is bno, 1 is cnt. This value gives the size of the
  36. * arrays below.
  37. */
  38. #define XFS_BTNUM_AGF ((int)XFS_BTNUM_CNTi + 1)
  39. /*
  40. * The second word of agf_levels in the first a.g. overlaps the EFS
  41. * superblock's magic number. Since the magic numbers valid for EFS
  42. * are > 64k, our value cannot be confused for an EFS superblock's.
  43. */
  44. typedef struct xfs_agf {
  45. /*
  46. * Common allocation group header information
  47. */
  48. __be32 agf_magicnum; /* magic number == XFS_AGF_MAGIC */
  49. __be32 agf_versionnum; /* header version == XFS_AGF_VERSION */
  50. __be32 agf_seqno; /* sequence # starting from 0 */
  51. __be32 agf_length; /* size in blocks of a.g. */
  52. /*
  53. * Freespace information
  54. */
  55. __be32 agf_roots[XFS_BTNUM_AGF]; /* root blocks */
  56. __be32 agf_spare0; /* spare field */
  57. __be32 agf_levels[XFS_BTNUM_AGF]; /* btree levels */
  58. __be32 agf_spare1; /* spare field */
  59. __be32 agf_flfirst; /* first freelist block's index */
  60. __be32 agf_fllast; /* last freelist block's index */
  61. __be32 agf_flcount; /* count of blocks in freelist */
  62. __be32 agf_freeblks; /* total free blocks */
  63. __be32 agf_longest; /* longest free space */
  64. } xfs_agf_t;
  65. #define XFS_AGF_MAGICNUM 0x00000001
  66. #define XFS_AGF_VERSIONNUM 0x00000002
  67. #define XFS_AGF_SEQNO 0x00000004
  68. #define XFS_AGF_LENGTH 0x00000008
  69. #define XFS_AGF_ROOTS 0x00000010
  70. #define XFS_AGF_LEVELS 0x00000020
  71. #define XFS_AGF_FLFIRST 0x00000040
  72. #define XFS_AGF_FLLAST 0x00000080
  73. #define XFS_AGF_FLCOUNT 0x00000100
  74. #define XFS_AGF_FREEBLKS 0x00000200
  75. #define XFS_AGF_LONGEST 0x00000400
  76. #define XFS_AGF_NUM_BITS 11
  77. #define XFS_AGF_ALL_BITS ((1 << XFS_AGF_NUM_BITS) - 1)
  78. /* disk block (xfs_daddr_t) in the AG */
  79. #define XFS_AGF_DADDR(mp) ((xfs_daddr_t)(1 << (mp)->m_sectbb_log))
  80. #define XFS_AGF_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGF_DADDR(mp))
  81. #define XFS_BUF_TO_AGF(bp) ((xfs_agf_t *)XFS_BUF_PTR(bp))
  82. /*
  83. * Size of the unlinked inode hash table in the agi.
  84. */
  85. #define XFS_AGI_UNLINKED_BUCKETS 64
  86. typedef struct xfs_agi {
  87. /*
  88. * Common allocation group header information
  89. */
  90. __be32 agi_magicnum; /* magic number == XFS_AGI_MAGIC */
  91. __be32 agi_versionnum; /* header version == XFS_AGI_VERSION */
  92. __be32 agi_seqno; /* sequence # starting from 0 */
  93. __be32 agi_length; /* size in blocks of a.g. */
  94. /*
  95. * Inode information
  96. * Inodes are mapped by interpreting the inode number, so no
  97. * mapping data is needed here.
  98. */
  99. __be32 agi_count; /* count of allocated inodes */
  100. __be32 agi_root; /* root of inode btree */
  101. __be32 agi_level; /* levels in inode btree */
  102. __be32 agi_freecount; /* number of free inodes */
  103. __be32 agi_newino; /* new inode just allocated */
  104. __be32 agi_dirino; /* last directory inode chunk */
  105. /*
  106. * Hash table of inodes which have been unlinked but are
  107. * still being referenced.
  108. */
  109. __be32 agi_unlinked[XFS_AGI_UNLINKED_BUCKETS];
  110. } xfs_agi_t;
  111. #define XFS_AGI_MAGICNUM 0x00000001
  112. #define XFS_AGI_VERSIONNUM 0x00000002
  113. #define XFS_AGI_SEQNO 0x00000004
  114. #define XFS_AGI_LENGTH 0x00000008
  115. #define XFS_AGI_COUNT 0x00000010
  116. #define XFS_AGI_ROOT 0x00000020
  117. #define XFS_AGI_LEVEL 0x00000040
  118. #define XFS_AGI_FREECOUNT 0x00000080
  119. #define XFS_AGI_NEWINO 0x00000100
  120. #define XFS_AGI_DIRINO 0x00000200
  121. #define XFS_AGI_UNLINKED 0x00000400
  122. #define XFS_AGI_NUM_BITS 11
  123. #define XFS_AGI_ALL_BITS ((1 << XFS_AGI_NUM_BITS) - 1)
  124. /* disk block (xfs_daddr_t) in the AG */
  125. #define XFS_AGI_DADDR(mp) ((xfs_daddr_t)(2 << (mp)->m_sectbb_log))
  126. #define XFS_AGI_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGI_DADDR(mp))
  127. #define XFS_BUF_TO_AGI(bp) ((xfs_agi_t *)XFS_BUF_PTR(bp))
  128. /*
  129. * The third a.g. block contains the a.g. freelist, an array
  130. * of block pointers to blocks owned by the allocation btree code.
  131. */
  132. #define XFS_AGFL_DADDR(mp) ((xfs_daddr_t)(3 << (mp)->m_sectbb_log))
  133. #define XFS_AGFL_BLOCK(mp) XFS_HDR_BLOCK(mp, XFS_AGFL_DADDR(mp))
  134. #define XFS_AGFL_SIZE(mp) ((mp)->m_sb.sb_sectsize / sizeof(xfs_agblock_t))
  135. #define XFS_BUF_TO_AGFL(bp) ((xfs_agfl_t *)XFS_BUF_PTR(bp))
  136. typedef struct xfs_agfl {
  137. __be32 agfl_bno[1]; /* actually XFS_AGFL_SIZE(mp) */
  138. } xfs_agfl_t;
  139. /*
  140. * Busy block/extent entry. Used in perag to mark blocks that have been freed
  141. * but whose transactions aren't committed to disk yet.
  142. */
  143. typedef struct xfs_perag_busy {
  144. xfs_agblock_t busy_start;
  145. xfs_extlen_t busy_length;
  146. struct xfs_trans *busy_tp; /* transaction that did the free */
  147. } xfs_perag_busy_t;
  148. /*
  149. * Per-ag incore structure, copies of information in agf and agi,
  150. * to improve the performance of allocation group selection.
  151. *
  152. * pick sizes which fit in allocation buckets well
  153. */
  154. #if (BITS_PER_LONG == 32)
  155. #define XFS_PAGB_NUM_SLOTS 84
  156. #elif (BITS_PER_LONG == 64)
  157. #define XFS_PAGB_NUM_SLOTS 128
  158. #endif
  159. typedef struct xfs_perag
  160. {
  161. char pagf_init; /* this agf's entry is initialized */
  162. char pagi_init; /* this agi's entry is initialized */
  163. char pagf_metadata; /* the agf is preferred to be metadata */
  164. char pagi_inodeok; /* The agi is ok for inodes */
  165. __uint8_t pagf_levels[XFS_BTNUM_AGF];
  166. /* # of levels in bno & cnt btree */
  167. __uint32_t pagf_flcount; /* count of blocks in freelist */
  168. xfs_extlen_t pagf_freeblks; /* total free blocks */
  169. xfs_extlen_t pagf_longest; /* longest free space */
  170. xfs_agino_t pagi_freecount; /* number of free inodes */
  171. #ifdef __KERNEL__
  172. lock_t pagb_lock; /* lock for pagb_list */
  173. #endif
  174. int pagb_count; /* pagb slots in use */
  175. xfs_perag_busy_t *pagb_list; /* unstable blocks */
  176. } xfs_perag_t;
  177. #define XFS_AG_MAXLEVELS(mp) ((mp)->m_ag_maxlevels)
  178. #define XFS_MIN_FREELIST_RAW(bl,cl,mp) \
  179. (MIN(bl + 1, XFS_AG_MAXLEVELS(mp)) + MIN(cl + 1, XFS_AG_MAXLEVELS(mp)))
  180. #define XFS_MIN_FREELIST(a,mp) \
  181. (XFS_MIN_FREELIST_RAW( \
  182. be32_to_cpu((a)->agf_levels[XFS_BTNUM_BNOi]), \
  183. be32_to_cpu((a)->agf_levels[XFS_BTNUM_CNTi]), mp))
  184. #define XFS_MIN_FREELIST_PAG(pag,mp) \
  185. (XFS_MIN_FREELIST_RAW( \
  186. (uint_t)(pag)->pagf_levels[XFS_BTNUM_BNOi], \
  187. (uint_t)(pag)->pagf_levels[XFS_BTNUM_CNTi], mp))
  188. #define XFS_AGB_TO_FSB(mp,agno,agbno) \
  189. (((xfs_fsblock_t)(agno) << (mp)->m_sb.sb_agblklog) | (agbno))
  190. #define XFS_FSB_TO_AGNO(mp,fsbno) \
  191. ((xfs_agnumber_t)((fsbno) >> (mp)->m_sb.sb_agblklog))
  192. #define XFS_FSB_TO_AGBNO(mp,fsbno) \
  193. ((xfs_agblock_t)((fsbno) & XFS_MASK32LO((mp)->m_sb.sb_agblklog)))
  194. #define XFS_AGB_TO_DADDR(mp,agno,agbno) \
  195. ((xfs_daddr_t)XFS_FSB_TO_BB(mp, \
  196. (xfs_fsblock_t)(agno) * (mp)->m_sb.sb_agblocks + (agbno)))
  197. #define XFS_AG_DADDR(mp,agno,d) (XFS_AGB_TO_DADDR(mp, agno, 0) + (d))
  198. /*
  199. * For checking for bad ranges of xfs_daddr_t's, covering multiple
  200. * allocation groups or a single xfs_daddr_t that's a superblock copy.
  201. */
  202. #define XFS_AG_CHECK_DADDR(mp,d,len) \
  203. ((len) == 1 ? \
  204. ASSERT((d) == XFS_SB_DADDR || \
  205. XFS_DADDR_TO_AGBNO(mp, d) != XFS_SB_DADDR) : \
  206. ASSERT(XFS_DADDR_TO_AGNO(mp, d) == \
  207. XFS_DADDR_TO_AGNO(mp, (d) + (len) - 1)))
  208. #endif /* __XFS_AG_H__ */