xfs_ialloc_btree.h 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180
  1. /*
  2. * Copyright (c) 2000,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_IALLOC_BTREE_H__
  19. #define __XFS_IALLOC_BTREE_H__
  20. /*
  21. * Inode map on-disk structures
  22. */
  23. struct xfs_buf;
  24. struct xfs_btree_cur;
  25. struct xfs_btree_sblock;
  26. struct xfs_mount;
  27. /*
  28. * There is a btree for the inode map per allocation group.
  29. */
  30. #define XFS_IBT_MAGIC 0x49414254 /* 'IABT' */
  31. typedef __uint64_t xfs_inofree_t;
  32. #define XFS_INODES_PER_CHUNK (NBBY * sizeof(xfs_inofree_t))
  33. #define XFS_INODES_PER_CHUNK_LOG (XFS_NBBYLOG + 3)
  34. #define XFS_INOBT_ALL_FREE ((xfs_inofree_t)-1)
  35. #define XFS_INOBT_MASKN(i,n) xfs_inobt_maskn(i,n)
  36. static inline xfs_inofree_t xfs_inobt_maskn(int i, int n)
  37. {
  38. return (((n) >= XFS_INODES_PER_CHUNK ? \
  39. (xfs_inofree_t)0 : ((xfs_inofree_t)1 << (n))) - 1) << (i);
  40. }
  41. /*
  42. * Data record structure
  43. */
  44. typedef struct xfs_inobt_rec {
  45. __be32 ir_startino; /* starting inode number */
  46. __be32 ir_freecount; /* count of free inodes (set bits) */
  47. __be64 ir_free; /* free inode mask */
  48. } xfs_inobt_rec_t;
  49. typedef struct xfs_inobt_rec_incore {
  50. xfs_agino_t ir_startino; /* starting inode number */
  51. __int32_t ir_freecount; /* count of free inodes (set bits) */
  52. xfs_inofree_t ir_free; /* free inode mask */
  53. } xfs_inobt_rec_incore_t;
  54. /*
  55. * Key structure
  56. */
  57. typedef struct xfs_inobt_key {
  58. __be32 ir_startino; /* starting inode number */
  59. } xfs_inobt_key_t;
  60. /* btree pointer type */
  61. typedef __be32 xfs_inobt_ptr_t;
  62. /* btree block header type */
  63. typedef struct xfs_btree_sblock xfs_inobt_block_t;
  64. #define XFS_BUF_TO_INOBT_BLOCK(bp) ((xfs_inobt_block_t *)XFS_BUF_PTR(bp))
  65. /*
  66. * Bit manipulations for ir_free.
  67. */
  68. #define XFS_INOBT_MASK(i) ((xfs_inofree_t)1 << (i))
  69. #define XFS_INOBT_IS_FREE(rp,i) \
  70. (((rp)->ir_free & XFS_INOBT_MASK(i)) != 0)
  71. #define XFS_INOBT_IS_FREE_DISK(rp,i) \
  72. ((be64_to_cpu((rp)->ir_free) & XFS_INOBT_MASK(i)) != 0)
  73. #define XFS_INOBT_SET_FREE(rp,i) ((rp)->ir_free |= XFS_INOBT_MASK(i))
  74. #define XFS_INOBT_CLR_FREE(rp,i) ((rp)->ir_free &= ~XFS_INOBT_MASK(i))
  75. /*
  76. * Real block structures have a size equal to the disk block size.
  77. */
  78. #define XFS_INOBT_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_inobt_mxr[lev != 0])
  79. #define XFS_INOBT_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_inobt_mnr[lev != 0])
  80. #define XFS_INOBT_IS_LAST_REC(cur) \
  81. ((cur)->bc_ptrs[0] == be16_to_cpu(XFS_BUF_TO_INOBT_BLOCK((cur)->bc_bufs[0])->bb_numrecs))
  82. /*
  83. * Maximum number of inode btree levels.
  84. */
  85. #define XFS_IN_MAXLEVELS(mp) ((mp)->m_in_maxlevels)
  86. /*
  87. * block numbers in the AG.
  88. */
  89. #define XFS_IBT_BLOCK(mp) ((xfs_agblock_t)(XFS_CNT_BLOCK(mp) + 1))
  90. #define XFS_PREALLOC_BLOCKS(mp) ((xfs_agblock_t)(XFS_IBT_BLOCK(mp) + 1))
  91. /*
  92. * Record, key, and pointer address macros for btree blocks.
  93. */
  94. #define XFS_INOBT_REC_ADDR(bb,i,cur) \
  95. (XFS_BTREE_REC_ADDR(xfs_inobt, bb, i))
  96. #define XFS_INOBT_KEY_ADDR(bb,i,cur) \
  97. (XFS_BTREE_KEY_ADDR(xfs_inobt, bb, i))
  98. #define XFS_INOBT_PTR_ADDR(bb,i,cur) \
  99. (XFS_BTREE_PTR_ADDR(xfs_inobt, bb, \
  100. i, XFS_INOBT_BLOCK_MAXRECS(1, cur)))
  101. /*
  102. * Decrement cursor by one record at the level.
  103. * For nonzero levels the leaf-ward information is untouched.
  104. */
  105. extern int xfs_inobt_decrement(struct xfs_btree_cur *cur, int level, int *stat);
  106. /*
  107. * Delete the record pointed to by cur.
  108. * The cursor refers to the place where the record was (could be inserted)
  109. * when the operation returns.
  110. */
  111. extern int xfs_inobt_delete(struct xfs_btree_cur *cur, int *stat);
  112. /*
  113. * Get the data from the pointed-to record.
  114. */
  115. extern int xfs_inobt_get_rec(struct xfs_btree_cur *cur, xfs_agino_t *ino,
  116. __int32_t *fcnt, xfs_inofree_t *free, int *stat);
  117. /*
  118. * Increment cursor by one record at the level.
  119. * For nonzero levels the leaf-ward information is untouched.
  120. */
  121. extern int xfs_inobt_increment(struct xfs_btree_cur *cur, int level, int *stat);
  122. /*
  123. * Insert the current record at the point referenced by cur.
  124. * The cursor may be inconsistent on return if splits have been done.
  125. */
  126. extern int xfs_inobt_insert(struct xfs_btree_cur *cur, int *stat);
  127. /*
  128. * Lookup the record equal to ino in the btree given by cur.
  129. */
  130. extern int xfs_inobt_lookup_eq(struct xfs_btree_cur *cur, xfs_agino_t ino,
  131. __int32_t fcnt, xfs_inofree_t free, int *stat);
  132. /*
  133. * Lookup the first record greater than or equal to ino
  134. * in the btree given by cur.
  135. */
  136. extern int xfs_inobt_lookup_ge(struct xfs_btree_cur *cur, xfs_agino_t ino,
  137. __int32_t fcnt, xfs_inofree_t free, int *stat);
  138. /*
  139. * Lookup the first record less than or equal to ino
  140. * in the btree given by cur.
  141. */
  142. extern int xfs_inobt_lookup_le(struct xfs_btree_cur *cur, xfs_agino_t ino,
  143. __int32_t fcnt, xfs_inofree_t free, int *stat);
  144. /*
  145. * Update the record referred to by cur, to the value given
  146. * by [ino, fcnt, free].
  147. * This either works (return 0) or gets an EFSCORRUPTED error.
  148. */
  149. extern int xfs_inobt_update(struct xfs_btree_cur *cur, xfs_agino_t ino,
  150. __int32_t fcnt, xfs_inofree_t free);
  151. #endif /* __XFS_IALLOC_BTREE_H__ */