blob: cc1eadcbb0497ea6163b045dacb740481db27fe6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Nathan Scott7b718762005-11-02 14:58:39 +11002 * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 *
Nathan Scott7b718762005-11-02 14:58:39 +11005 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * published by the Free Software Foundation.
8 *
Nathan Scott7b718762005-11-02 14:58:39 +11009 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
Nathan Scott7b718762005-11-02 14:58:39 +110014 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070018#include "xfs.h"
Nathan Scotta844f452005-11-02 14:38:42 +110019#include "xfs_fs.h"
Dave Chinner632b89e2013-10-29 22:11:58 +110020#include "xfs_shared.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110021#include "xfs_format.h"
Dave Chinner239880e2013-10-23 10:50:10 +110022#include "xfs_log_format.h"
23#include "xfs_trans_resv.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include "xfs_sb.h"
25#include "xfs_ag.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070026#include "xfs_mount.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070027#include "xfs_btree.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110028#include "xfs_alloc_btree.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070029#include "xfs_alloc.h"
Dave Chinnerefc27b52012-04-29 10:39:43 +000030#include "xfs_extent_busy.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include "xfs_error.h"
Christoph Hellwig0b1b2132009-12-14 23:14:59 +000032#include "xfs_trace.h"
Christoph Hellwigee1a47a2013-04-21 14:53:46 -050033#include "xfs_cksum.h"
Dave Chinner239880e2013-10-23 10:50:10 +110034#include "xfs_trans.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070035
Linus Torvalds1da177e2005-04-16 15:20:36 -070036
Christoph Hellwig561f7d12008-10-30 16:53:59 +110037STATIC struct xfs_btree_cur *
38xfs_allocbt_dup_cursor(
39 struct xfs_btree_cur *cur)
40{
41 return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp,
42 cur->bc_private.a.agbp, cur->bc_private.a.agno,
43 cur->bc_btnum);
44}
45
Christoph Hellwig344207c2008-10-30 16:57:16 +110046STATIC void
47xfs_allocbt_set_root(
48 struct xfs_btree_cur *cur,
49 union xfs_btree_ptr *ptr,
50 int inc)
51{
52 struct xfs_buf *agbp = cur->bc_private.a.agbp;
53 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
54 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
55 int btnum = cur->bc_btnum;
Dave Chinnera862e0f2010-01-11 11:47:41 +000056 struct xfs_perag *pag = xfs_perag_get(cur->bc_mp, seqno);
Christoph Hellwig344207c2008-10-30 16:57:16 +110057
58 ASSERT(ptr->s != 0);
59
60 agf->agf_roots[btnum] = ptr->s;
61 be32_add_cpu(&agf->agf_levels[btnum], inc);
Dave Chinnera862e0f2010-01-11 11:47:41 +000062 pag->pagf_levels[btnum] += inc;
63 xfs_perag_put(pag);
Christoph Hellwig344207c2008-10-30 16:57:16 +110064
65 xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS);
66}
67
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +110068STATIC int
69xfs_allocbt_alloc_block(
70 struct xfs_btree_cur *cur,
71 union xfs_btree_ptr *start,
72 union xfs_btree_ptr *new,
73 int length,
74 int *stat)
75{
76 int error;
77 xfs_agblock_t bno;
78
79 XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY);
80
81 /* Allocate the new block from the freelist. If we can't, give up. */
82 error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp,
83 &bno, 1);
84 if (error) {
85 XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR);
86 return error;
87 }
88
89 if (bno == NULLAGBLOCK) {
90 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
91 *stat = 0;
92 return 0;
93 }
Christoph Hellwig97d3ac72011-04-24 19:06:16 +000094
Dave Chinner4ecbfe62012-04-29 10:41:10 +000095 xfs_extent_busy_reuse(cur->bc_mp, cur->bc_private.a.agno, bno, 1, false);
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +110096
97 xfs_trans_agbtree_delta(cur->bc_tp, 1);
98 new->s = cpu_to_be32(bno);
99
100 XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT);
101 *stat = 1;
102 return 0;
103}
104
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100105STATIC int
106xfs_allocbt_free_block(
107 struct xfs_btree_cur *cur,
108 struct xfs_buf *bp)
109{
110 struct xfs_buf *agbp = cur->bc_private.a.agbp;
111 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
112 xfs_agblock_t bno;
113 int error;
114
Eric Sandeenb6e32222009-01-14 23:22:07 -0600115 bno = xfs_daddr_to_agbno(cur->bc_mp, XFS_BUF_ADDR(bp));
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100116 error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1);
117 if (error)
118 return error;
119
Dave Chinner4ecbfe62012-04-29 10:41:10 +0000120 xfs_extent_busy_insert(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1,
121 XFS_EXTENT_BUSY_SKIP_DISCARD);
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100122 xfs_trans_agbtree_delta(cur->bc_tp, -1);
Dave Chinner4c05f9a2012-11-02 11:38:41 +1100123
124 xfs_trans_binval(cur->bc_tp, bp);
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100125 return 0;
126}
127
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100128/*
129 * Update the longest extent in the AGF
130 */
131STATIC void
132xfs_allocbt_update_lastrec(
133 struct xfs_btree_cur *cur,
134 struct xfs_btree_block *block,
135 union xfs_btree_rec *rec,
136 int ptr,
137 int reason)
138{
139 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
140 xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno);
Dave Chinnera862e0f2010-01-11 11:47:41 +0000141 struct xfs_perag *pag;
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100142 __be32 len;
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100143 int numrecs;
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100144
145 ASSERT(cur->bc_btnum == XFS_BTNUM_CNT);
146
147 switch (reason) {
148 case LASTREC_UPDATE:
149 /*
150 * If this is the last leaf block and it's the last record,
151 * then update the size of the longest extent in the AG.
152 */
153 if (ptr != xfs_btree_get_numrecs(block))
154 return;
155 len = rec->alloc.ar_blockcount;
156 break;
Christoph Hellwig4b22a572008-10-30 16:57:40 +1100157 case LASTREC_INSREC:
158 if (be32_to_cpu(rec->alloc.ar_blockcount) <=
159 be32_to_cpu(agf->agf_longest))
160 return;
161 len = rec->alloc.ar_blockcount;
162 break;
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100163 case LASTREC_DELREC:
164 numrecs = xfs_btree_get_numrecs(block);
165 if (ptr <= numrecs)
166 return;
167 ASSERT(ptr == numrecs + 1);
168
169 if (numrecs) {
170 xfs_alloc_rec_t *rrp;
171
Christoph Hellwig136341b2008-10-30 17:11:40 +1100172 rrp = XFS_ALLOC_REC_ADDR(cur->bc_mp, block, numrecs);
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100173 len = rrp->ar_blockcount;
174 } else {
175 len = 0;
176 }
177
178 break;
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100179 default:
180 ASSERT(0);
181 return;
182 }
183
184 agf->agf_longest = len;
Dave Chinnera862e0f2010-01-11 11:47:41 +0000185 pag = xfs_perag_get(cur->bc_mp, seqno);
186 pag->pagf_longest = be32_to_cpu(len);
187 xfs_perag_put(pag);
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100188 xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST);
189}
190
Christoph Hellwigce5e42d2008-10-30 16:55:23 +1100191STATIC int
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100192xfs_allocbt_get_minrecs(
193 struct xfs_btree_cur *cur,
194 int level)
195{
196 return cur->bc_mp->m_alloc_mnr[level != 0];
197}
198
199STATIC int
Christoph Hellwigce5e42d2008-10-30 16:55:23 +1100200xfs_allocbt_get_maxrecs(
201 struct xfs_btree_cur *cur,
202 int level)
203{
204 return cur->bc_mp->m_alloc_mxr[level != 0];
205}
206
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100207STATIC void
208xfs_allocbt_init_key_from_rec(
209 union xfs_btree_key *key,
210 union xfs_btree_rec *rec)
211{
212 ASSERT(rec->alloc.ar_startblock != 0);
213
214 key->alloc.ar_startblock = rec->alloc.ar_startblock;
215 key->alloc.ar_blockcount = rec->alloc.ar_blockcount;
216}
217
218STATIC void
Christoph Hellwig4b22a572008-10-30 16:57:40 +1100219xfs_allocbt_init_rec_from_key(
220 union xfs_btree_key *key,
221 union xfs_btree_rec *rec)
222{
223 ASSERT(key->alloc.ar_startblock != 0);
224
225 rec->alloc.ar_startblock = key->alloc.ar_startblock;
226 rec->alloc.ar_blockcount = key->alloc.ar_blockcount;
227}
228
229STATIC void
230xfs_allocbt_init_rec_from_cur(
231 struct xfs_btree_cur *cur,
232 union xfs_btree_rec *rec)
233{
234 ASSERT(cur->bc_rec.a.ar_startblock != 0);
235
236 rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
237 rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
238}
239
240STATIC void
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100241xfs_allocbt_init_ptr_from_cur(
242 struct xfs_btree_cur *cur,
243 union xfs_btree_ptr *ptr)
244{
245 struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp);
246
247 ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno));
248 ASSERT(agf->agf_roots[cur->bc_btnum] != 0);
249
250 ptr->s = agf->agf_roots[cur->bc_btnum];
251}
252
253STATIC __int64_t
254xfs_allocbt_key_diff(
255 struct xfs_btree_cur *cur,
256 union xfs_btree_key *key)
257{
258 xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a;
259 xfs_alloc_key_t *kp = &key->alloc;
260 __int64_t diff;
261
262 if (cur->bc_btnum == XFS_BTNUM_BNO) {
263 return (__int64_t)be32_to_cpu(kp->ar_startblock) -
264 rec->ar_startblock;
265 }
266
267 diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount;
268 if (diff)
269 return diff;
270
271 return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock;
272}
273
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500274static bool
Dave Chinner612cfbf2012-11-14 17:52:32 +1100275xfs_allocbt_verify(
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100276 struct xfs_buf *bp)
277{
278 struct xfs_mount *mp = bp->b_target->bt_mount;
279 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
280 struct xfs_perag *pag = bp->b_pag;
281 unsigned int level;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100282
283 /*
284 * magic number and level verification
285 *
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500286 * During growfs operations, we can't verify the exact level or owner as
287 * the perag is not fully initialised and hence not attached to the
288 * buffer. In this case, check against the maximum tree depth.
289 *
290 * Similarly, during log recovery we will have a perag structure
291 * attached, but the agf information will not yet have been initialised
292 * from the on disk AGF. Again, we can only check against maximum limits
293 * in this case.
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100294 */
295 level = be16_to_cpu(block->bb_level);
296 switch (block->bb_magic) {
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500297 case cpu_to_be32(XFS_ABTB_CRC_MAGIC):
298 if (!xfs_sb_version_hascrc(&mp->m_sb))
299 return false;
300 if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
301 return false;
302 if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
303 return false;
304 if (pag &&
305 be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
306 return false;
307 /* fall through */
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100308 case cpu_to_be32(XFS_ABTB_MAGIC):
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500309 if (pag && pag->pagf_init) {
310 if (level >= pag->pagf_levels[XFS_BTNUM_BNOi])
311 return false;
312 } else if (level >= mp->m_ag_maxlevels)
313 return false;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100314 break;
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500315 case cpu_to_be32(XFS_ABTC_CRC_MAGIC):
316 if (!xfs_sb_version_hascrc(&mp->m_sb))
317 return false;
318 if (!uuid_equal(&block->bb_u.s.bb_uuid, &mp->m_sb.sb_uuid))
319 return false;
320 if (block->bb_u.s.bb_blkno != cpu_to_be64(bp->b_bn))
321 return false;
322 if (pag &&
323 be32_to_cpu(block->bb_u.s.bb_owner) != pag->pag_agno)
324 return false;
325 /* fall through */
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100326 case cpu_to_be32(XFS_ABTC_MAGIC):
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500327 if (pag && pag->pagf_init) {
328 if (level >= pag->pagf_levels[XFS_BTNUM_CNTi])
329 return false;
330 } else if (level >= mp->m_ag_maxlevels)
331 return false;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100332 break;
333 default:
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500334 return false;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100335 }
336
337 /* numrecs verification */
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500338 if (be16_to_cpu(block->bb_numrecs) > mp->m_alloc_mxr[level != 0])
339 return false;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100340
341 /* sibling pointer verification */
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500342 if (!block->bb_u.s.bb_leftsib ||
343 (be32_to_cpu(block->bb_u.s.bb_leftsib) >= mp->m_sb.sb_agblocks &&
344 block->bb_u.s.bb_leftsib != cpu_to_be32(NULLAGBLOCK)))
345 return false;
346 if (!block->bb_u.s.bb_rightsib ||
347 (be32_to_cpu(block->bb_u.s.bb_rightsib) >= mp->m_sb.sb_agblocks &&
348 block->bb_u.s.bb_rightsib != cpu_to_be32(NULLAGBLOCK)))
349 return false;
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100350
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500351 return true;
Dave Chinner612cfbf2012-11-14 17:52:32 +1100352}
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100353
Dave Chinner612cfbf2012-11-14 17:52:32 +1100354static void
Dave Chinner1813dd62012-11-14 17:54:40 +1100355xfs_allocbt_read_verify(
356 struct xfs_buf *bp)
357{
Eric Sandeence5028c2014-02-27 15:23:10 +1100358 if (!xfs_btree_sblock_verify_crc(bp))
359 xfs_buf_ioerror(bp, EFSBADCRC);
360 else if (!xfs_allocbt_verify(bp))
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500361 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100362
363 if (bp->b_error) {
364 trace_xfs_btree_corrupt(bp, _RET_IP_);
365 xfs_verifier_error(bp);
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500366 }
Dave Chinner1813dd62012-11-14 17:54:40 +1100367}
368
369static void
Dave Chinner612cfbf2012-11-14 17:52:32 +1100370xfs_allocbt_write_verify(
371 struct xfs_buf *bp)
372{
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500373 if (!xfs_allocbt_verify(bp)) {
374 trace_xfs_btree_corrupt(bp, _RET_IP_);
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500375 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100376 xfs_verifier_error(bp);
Eric Sandeene0d2c232014-02-27 15:14:31 +1100377 return;
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500378 }
379 xfs_btree_sblock_calc_crc(bp);
380
Dave Chinner612cfbf2012-11-14 17:52:32 +1100381}
382
Dave Chinner1813dd62012-11-14 17:54:40 +1100383const struct xfs_buf_ops xfs_allocbt_buf_ops = {
384 .verify_read = xfs_allocbt_read_verify,
385 .verify_write = xfs_allocbt_write_verify,
386};
387
Dave Chinner3d3e6f62012-11-12 22:54:08 +1100388
Dave Chinner742ae1e2013-04-30 21:39:34 +1000389#if defined(DEBUG) || defined(XFS_WARN)
Christoph Hellwig4a26e662008-10-30 16:58:32 +1100390STATIC int
391xfs_allocbt_keys_inorder(
392 struct xfs_btree_cur *cur,
393 union xfs_btree_key *k1,
394 union xfs_btree_key *k2)
395{
396 if (cur->bc_btnum == XFS_BTNUM_BNO) {
397 return be32_to_cpu(k1->alloc.ar_startblock) <
398 be32_to_cpu(k2->alloc.ar_startblock);
399 } else {
400 return be32_to_cpu(k1->alloc.ar_blockcount) <
401 be32_to_cpu(k2->alloc.ar_blockcount) ||
402 (k1->alloc.ar_blockcount == k2->alloc.ar_blockcount &&
403 be32_to_cpu(k1->alloc.ar_startblock) <
404 be32_to_cpu(k2->alloc.ar_startblock));
405 }
406}
407
408STATIC int
409xfs_allocbt_recs_inorder(
410 struct xfs_btree_cur *cur,
411 union xfs_btree_rec *r1,
412 union xfs_btree_rec *r2)
413{
414 if (cur->bc_btnum == XFS_BTNUM_BNO) {
415 return be32_to_cpu(r1->alloc.ar_startblock) +
416 be32_to_cpu(r1->alloc.ar_blockcount) <=
417 be32_to_cpu(r2->alloc.ar_startblock);
418 } else {
419 return be32_to_cpu(r1->alloc.ar_blockcount) <
420 be32_to_cpu(r2->alloc.ar_blockcount) ||
421 (r1->alloc.ar_blockcount == r2->alloc.ar_blockcount &&
422 be32_to_cpu(r1->alloc.ar_startblock) <
423 be32_to_cpu(r2->alloc.ar_startblock));
424 }
425}
426#endif /* DEBUG */
427
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100428static const struct xfs_btree_ops xfs_allocbt_ops = {
Christoph Hellwig65f1eae2008-10-30 16:55:34 +1100429 .rec_len = sizeof(xfs_alloc_rec_t),
430 .key_len = sizeof(xfs_alloc_key_t),
431
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100432 .dup_cursor = xfs_allocbt_dup_cursor,
Christoph Hellwig344207c2008-10-30 16:57:16 +1100433 .set_root = xfs_allocbt_set_root,
Christoph Hellwigf5eb8e72008-10-30 16:57:03 +1100434 .alloc_block = xfs_allocbt_alloc_block,
Christoph Hellwigd4b3a4b2008-10-30 16:57:51 +1100435 .free_block = xfs_allocbt_free_block,
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100436 .update_lastrec = xfs_allocbt_update_lastrec,
Christoph Hellwig91cca5df2008-10-30 16:58:01 +1100437 .get_minrecs = xfs_allocbt_get_minrecs,
Christoph Hellwigce5e42d2008-10-30 16:55:23 +1100438 .get_maxrecs = xfs_allocbt_get_maxrecs,
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100439 .init_key_from_rec = xfs_allocbt_init_key_from_rec,
Christoph Hellwig4b22a572008-10-30 16:57:40 +1100440 .init_rec_from_key = xfs_allocbt_init_rec_from_key,
441 .init_rec_from_cur = xfs_allocbt_init_rec_from_cur,
Christoph Hellwigfe033cc2008-10-30 16:56:09 +1100442 .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur,
443 .key_diff = xfs_allocbt_key_diff,
Dave Chinner1813dd62012-11-14 17:54:40 +1100444 .buf_ops = &xfs_allocbt_buf_ops,
Dave Chinner742ae1e2013-04-30 21:39:34 +1000445#if defined(DEBUG) || defined(XFS_WARN)
Christoph Hellwig4a26e662008-10-30 16:58:32 +1100446 .keys_inorder = xfs_allocbt_keys_inorder,
447 .recs_inorder = xfs_allocbt_recs_inorder,
448#endif
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100449};
450
451/*
452 * Allocate a new allocation btree cursor.
453 */
454struct xfs_btree_cur * /* new alloc btree cursor */
455xfs_allocbt_init_cursor(
456 struct xfs_mount *mp, /* file system mount point */
457 struct xfs_trans *tp, /* transaction pointer */
458 struct xfs_buf *agbp, /* buffer for agf structure */
459 xfs_agnumber_t agno, /* allocation group number */
460 xfs_btnum_t btnum) /* btree identifier */
461{
462 struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp);
463 struct xfs_btree_cur *cur;
464
465 ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT);
466
467 cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP);
468
469 cur->bc_tp = tp;
470 cur->bc_mp = mp;
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100471 cur->bc_btnum = btnum;
472 cur->bc_blocklog = mp->m_sb.sb_blocklog;
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100473 cur->bc_ops = &xfs_allocbt_ops;
Christoph Hellwigdec58f12011-07-08 14:34:18 +0200474
475 if (btnum == XFS_BTNUM_CNT) {
476 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]);
Christoph Hellwig278d0ca2008-10-30 16:56:32 +1100477 cur->bc_flags = XFS_BTREE_LASTREC_UPDATE;
Christoph Hellwigdec58f12011-07-08 14:34:18 +0200478 } else {
479 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]);
480 }
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100481
482 cur->bc_private.a.agbp = agbp;
483 cur->bc_private.a.agno = agno;
484
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500485 if (xfs_sb_version_hascrc(&mp->m_sb))
486 cur->bc_flags |= XFS_BTREE_CRC_BLOCKS;
487
Christoph Hellwig561f7d12008-10-30 16:53:59 +1100488 return cur;
489}
Christoph Hellwig60197e82008-10-30 17:11:19 +1100490
491/*
492 * Calculate number of records in an alloc btree block.
493 */
494int
495xfs_allocbt_maxrecs(
496 struct xfs_mount *mp,
497 int blocklen,
498 int leaf)
499{
Christoph Hellwig7cc95a82008-10-30 17:14:34 +1100500 blocklen -= XFS_ALLOC_BLOCK_LEN(mp);
Christoph Hellwig60197e82008-10-30 17:11:19 +1100501
502 if (leaf)
503 return blocklen / sizeof(xfs_alloc_rec_t);
504 return blocklen / (sizeof(xfs_alloc_key_t) + sizeof(xfs_alloc_ptr_t));
505}