xfs_ialloc_btree.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  1. /*
  2. * Copyright (c) 2000-2001,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. #include "xfs.h"
  19. #include "xfs_fs.h"
  20. #include "xfs_format.h"
  21. #include "xfs_log_format.h"
  22. #include "xfs_trans_resv.h"
  23. #include "xfs_bit.h"
  24. #include "xfs_sb.h"
  25. #include "xfs_ag.h"
  26. #include "xfs_mount.h"
  27. #include "xfs_inode.h"
  28. #include "xfs_btree.h"
  29. #include "xfs_ialloc.h"
  30. #include "xfs_ialloc_btree.h"
  31. #include "xfs_alloc.h"
  32. #include "xfs_error.h"
  33. #include "xfs_trace.h"
  34. #include "xfs_cksum.h"
  35. #include "xfs_trans.h"
  36. STATIC int
  37. xfs_inobt_get_minrecs(
  38. struct xfs_btree_cur *cur,
  39. int level)
  40. {
  41. return cur->bc_mp->m_inobt_mnr[level != 0];
  42. }
  43. STATIC struct xfs_btree_cur *
  44. xfs_inobt_dup_cursor(
  45. struct xfs_btree_cur *cur)
  46. {
  47. return xfs_inobt_init_cursor(cur->bc_mp, cur->bc_tp,
  48. cur->bc_private.a.agbp, cur->bc_private.a.agno);
  49. }
  50. STATIC void
  51. xfs_inobt_set_root(
  52. struct xfs_btree_cur *cur,
  53. union xfs_btree_ptr *nptr,
  54. int inc) /* level change */
  55. {
  56. struct xfs_buf *agbp = cur->bc_private.a.agbp;
  57. struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
  58. agi->agi_root = nptr->s;
  59. be32_add_cpu(&agi->agi_level, inc);
  60. xfs_ialloc_log_agi(cur->bc_tp, agbp, XFS_AGI_ROOT | XFS_AGI_LEVEL);
  61. }
  62. STATIC int
  63. xfs_inobt_alloc_block(
  64. struct xfs_btree_cur *cur,
  65. union xfs_btree_ptr *start,
  66. union xfs_btree_ptr *new,
  67. int length,
  68. int *stat)
  69. {
  70. xfs_alloc_arg_t args; /* block allocation args */
  71. int error; /* error return value */
  72. xfs_agblock_t sbno = be32_to_cpu(start->s);
  73. XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
  74. memset(&args, 0, sizeof(args));
  75. args.tp = cur->bc_tp;
  76. args.mp = cur->bc_mp;
  77. args.fsbno = XFS_AGB_TO_FSB(args.mp, cur->bc_private.a.agno, sbno);
  78. args.minlen = 1;
  79. args.maxlen = 1;
  80. args.prod = 1;
  81. args.type = XFS_ALLOCTYPE_NEAR_BNO;
  82. error = xfs_alloc_vextent(&args);
  83. if (error) {
  84. XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
  85. return error;
  86. }
  87. if (args.fsbno == NULLFSBLOCK) {
  88. XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
  89. *stat = 0;
  90. return 0;
  91. }
  92. ASSERT(args.len == 1);
  93. XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
  94. new->s = cpu_to_be32(XFS_FSB_TO_AGBNO(args.mp, args.fsbno));
  95. *stat = 1;
  96. return 0;
  97. }
  98. STATIC int
  99. xfs_inobt_free_block(
  100. struct xfs_btree_cur *cur,
  101. struct xfs_buf *bp)
  102. {
  103. xfs_fsblock_t fsbno;
  104. int error;
  105. fsbno = XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(bp));
  106. error = xfs_free_extent(cur->bc_tp, fsbno, 1);
  107. if (error)
  108. return error;
  109. xfs_trans_binval(cur->bc_tp, bp);
  110. return error;
  111. }
  112. STATIC int
  113. xfs_inobt_get_maxrecs(
  114. struct xfs_btree_cur *cur,
  115. int level)
  116. {
  117. return cur->bc_mp->m_inobt_mxr[level != 0];
  118. }
  119. STATIC void
  120. xfs_inobt_init_key_from_rec(
  121. union xfs_btree_key *key,
  122. union xfs_btree_rec *rec)
  123. {
  124. key->inobt.ir_startino = rec->inobt.ir_startino;
  125. }
  126. STATIC void
  127. xfs_inobt_init_rec_from_key(
  128. union xfs_btree_key *key,
  129. union xfs_btree_rec *rec)
  130. {
  131. rec->inobt.ir_startino = key->inobt.ir_startino;
  132. }
  133. STATIC void
  134. xfs_inobt_init_rec_from_cur(
  135. struct xfs_btree_cur *cur,
  136. union xfs_btree_rec *rec)
  137. {
  138. rec->inobt.ir_startino = cpu_to_be32(cur->bc_rec.i.ir_startino);
  139. rec->inobt.ir_freecount = cpu_to_be32(cur->bc_rec.i.ir_freecount);
  140. rec->inobt.ir_free = cpu_to_be64(cur->bc_rec.i.ir_free);
  141. }
  142. /*
  143. * initial value of ptr for lookup
  144. */
  145. STATIC void
  146. xfs_inobt_init_ptr_from_cur(
  147. struct xfs_btree_cur *cur,
  148. union xfs_btree_ptr *ptr)
  149. {
  150. struct xfs_agi *agi = XFS_BUF_TO_AGI(cur->bc_private.a.agbp);
  151. ASSERT(cur->bc_private.a.agno == be32_to_cpu(agi->agi_seqno));
  152. ptr->s = agi->agi_root;
  153. }
  154. STATIC __int64_t
  155. xfs_inobt_key_diff(
  156. struct xfs_btree_cur *cur,
  157. union xfs_btree_key *key)
  158. {
  159. return (__int64_t)be32_to_cpu(key->inobt.ir_startino) -
  160. cur->bc_rec.i.ir_startino;
  161. }
  162. static int
  163. xfs_inobt_verify(
  164. struct xfs_buf *bp)
  165. {
  166. struct xfs_mount *mp = bp->b_target->bt_mount;
  167. struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
  168. struct xfs_perag *pag = bp->b_pag;
  169. unsigned int level;
  170. /*
  171. * During growfs operations, we can't verify the exact owner as the
  172. * perag is not fully initialised and hence not attached to the buffer.
  173. *
  174. * Similarly, during log recovery we will have a perag structure
  175. * attached, but the agi information will not yet have been initialised
  176. * from the on disk AGI. We don't currently use any of this information,
  177. * but beware of the landmine (i.e. need to check pag->pagi_init) if we
  178. * ever do.
  179. */
  180. switch (block->bb_magic) {
  181. case cpu_to_be32(XFS_IBT_CRC_MAGIC):
  182. if (!xfs_sb_version_hascrc(&mp->m_sb))
  183. return false;
  184. if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
  185. return false;
  186. if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
  187. return false;
  188. if (pag &&
  189. be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
  190. return false;
  191. /* fall through */
  192. case cpu_to_be32(XFS_IBT_MAGIC):
  193. break;
  194. default:
  195. return 0;
  196. }
  197. /* numrecs and level verification */
  198. level = be16_to_cpu(block->bb_level);
  199. if (level >= mp->m_in_maxlevels)
  200. return false;
  201. if (be16_to_cpu(block->bb_numrecs) > mp->m_inobt_mxr[level != 0])
  202. return false;
  203. /* sibling pointer verification */
  204. if (!block->bb_u.s.bb_leftsib ||
  205. (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
  206. block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
  207. return false;
  208. if (!block->bb_u.s.bb_rightsib ||
  209. (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
  210. block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
  211. return false;
  212. return true;
  213. }
  214. static void
  215. xfs_inobt_read_verify(
  216. struct xfs_buf *bp)
  217. {
  218. if (!(xfs_btree_sblock_verify_crc(bp) &&
  219. xfs_inobt_verify(bp))) {
  220. trace_xfs_btree_corrupt(bp, _RET_IP_);
  221. XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW,
  222. bp->b_target->bt_mount, bp->b_addr);
  223. xfs_buf_ioerror(bp, EFSCORRUPTED);
  224. }
  225. }
  226. static void
  227. xfs_inobt_write_verify(
  228. struct xfs_buf *bp)
  229. {
  230. if (!xfs_inobt_verify(bp)) {
  231. trace_xfs_btree_corrupt(bp, _RET_IP_);
  232. XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW,
  233. bp->b_target->bt_mount, bp->b_addr);
  234. xfs_buf_ioerror(bp, EFSCORRUPTED);
  235. }
  236. xfs_btree_sblock_calc_crc(bp);
  237. }
  238. const struct xfs_buf_ops xfs_inobt_buf_ops = {
  239. .verify_read = xfs_inobt_read_verify,
  240. .verify_write = xfs_inobt_write_verify,
  241. };
  242. #if defined(DEBUG) || defined(XFS_WARN)
  243. STATIC int
  244. xfs_inobt_keys_inorder(
  245. struct xfs_btree_cur *cur,
  246. union xfs_btree_key *k1,
  247. union xfs_btree_key *k2)
  248. {
  249. return be32_to_cpu(k1->inobt.ir_startino) <
  250. be32_to_cpu(k2->inobt.ir_startino);
  251. }
  252. STATIC int
  253. xfs_inobt_recs_inorder(
  254. struct xfs_btree_cur *cur,
  255. union xfs_btree_rec *r1,
  256. union xfs_btree_rec *r2)
  257. {
  258. return be32_to_cpu(r1->inobt.ir_startino) + XFS_INODES_PER_CHUNK <=
  259. be32_to_cpu(r2->inobt.ir_startino);
  260. }
  261. #endif /* DEBUG */
  262. static const struct xfs_btree_ops xfs_inobt_ops = {
  263. .rec_len = sizeof(xfs_inobt_rec_t),
  264. .key_len = sizeof(xfs_inobt_key_t),
  265. .dup_cursor = xfs_inobt_dup_cursor,
  266. .set_root = xfs_inobt_set_root,
  267. .alloc_block = xfs_inobt_alloc_block,
  268. .free_block = xfs_inobt_free_block,
  269. .get_minrecs = xfs_inobt_get_minrecs,
  270. .get_maxrecs = xfs_inobt_get_maxrecs,
  271. .init_key_from_rec = xfs_inobt_init_key_from_rec,
  272. .init_rec_from_key = xfs_inobt_init_rec_from_key,
  273. .init_rec_from_cur = xfs_inobt_init_rec_from_cur,
  274. .init_ptr_from_cur = xfs_inobt_init_ptr_from_cur,
  275. .key_diff = xfs_inobt_key_diff,
  276. .buf_ops = &xfs_inobt_buf_ops,
  277. #if defined(DEBUG) || defined(XFS_WARN)
  278. .keys_inorder = xfs_inobt_keys_inorder,
  279. .recs_inorder = xfs_inobt_recs_inorder,
  280. #endif
  281. };
  282. /*
  283. * Allocate a new inode btree cursor.
  284. */
  285. struct xfs_btree_cur * /* new inode btree cursor */
  286. xfs_inobt_init_cursor(
  287. struct xfs_mount *mp, /* file system mount point */
  288. struct xfs_trans *tp, /* transaction pointer */
  289. struct xfs_buf *agbp, /* buffer for agi structure */
  290. xfs_agnumber_t agno) /* allocation group number */
  291. {
  292. struct xfs_agi *agi = XFS_BUF_TO_AGI(agbp);
  293. struct xfs_btree_cur *cur;
  294. cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
  295. cur->bc_tp = tp;
  296. cur->bc_mp = mp;
  297. cur->bc_nlevels = be32_to_cpu(agi->agi_level);
  298. cur->bc_btnum = XFS_BTNUM_INO;
  299. cur->bc_blocklog = mp->m_sb.sb_blocklog;
  300. cur->bc_ops = &xfs_inobt_ops;
  301. if (xfs_sb_version_hascrc(&mp->m_sb))
  302. cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
  303. cur->bc_private.a.agbp = agbp;
  304. cur->bc_private.a.agno = agno;
  305. return cur;
  306. }
  307. /*
  308. * Calculate number of records in an inobt btree block.
  309. */
  310. int
  311. xfs_inobt_maxrecs(
  312. struct xfs_mount *mp,
  313. int blocklen,
  314. int leaf)
  315. {
  316. blocklen -= XFS_INOBT_BLOCK_LEN(mp);
  317. if (leaf)
  318. return blocklen / sizeof(xfs_inobt_rec_t);
  319. return blocklen / (sizeof(xfs_inobt_key_t) + sizeof(xfs_inobt_ptr_t));
  320. }