Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
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. | |
1da177e4 | 13 | * |
7b718769 NS |
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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
1da177e4 | 20 | #include "xfs_types.h" |
a844f451 | 21 | #include "xfs_bit.h" |
1da177e4 | 22 | #include "xfs_log.h" |
a844f451 | 23 | #include "xfs_inum.h" |
1da177e4 LT |
24 | #include "xfs_trans.h" |
25 | #include "xfs_sb.h" | |
26 | #include "xfs_ag.h" | |
a844f451 | 27 | #include "xfs_dir2.h" |
1da177e4 LT |
28 | #include "xfs_dmapi.h" |
29 | #include "xfs_mount.h" | |
a844f451 | 30 | #include "xfs_bmap_btree.h" |
1da177e4 LT |
31 | #include "xfs_alloc_btree.h" |
32 | #include "xfs_ialloc_btree.h" | |
a844f451 NS |
33 | #include "xfs_dir2_sf.h" |
34 | #include "xfs_attr_sf.h" | |
35 | #include "xfs_dinode.h" | |
36 | #include "xfs_inode.h" | |
1da177e4 | 37 | #include "xfs_btree.h" |
f5eb8e7c | 38 | #include "xfs_btree_trace.h" |
1da177e4 LT |
39 | #include "xfs_ialloc.h" |
40 | #include "xfs_alloc.h" | |
41 | #include "xfs_error.h" | |
42 | ||
43 | /* | |
44 | * Prototypes for internal functions. | |
45 | */ | |
46 | ||
47 | STATIC void xfs_alloc_log_block(xfs_trans_t *, xfs_buf_t *, int); | |
48 | STATIC void xfs_alloc_log_keys(xfs_btree_cur_t *, xfs_buf_t *, int, int); | |
49 | STATIC void xfs_alloc_log_ptrs(xfs_btree_cur_t *, xfs_buf_t *, int, int); | |
50 | STATIC void xfs_alloc_log_recs(xfs_btree_cur_t *, xfs_buf_t *, int, int); | |
1da177e4 LT |
51 | |
52 | /* | |
53 | * Internal functions. | |
54 | */ | |
55 | ||
56 | /* | |
57 | * Single level of the xfs_alloc_delete record deletion routine. | |
58 | * Delete record pointed to by cur/level. | |
59 | * Remove the record from its block then rebalance the tree. | |
60 | * Return 0 for error, 1 for done, 2 to go on to the next level. | |
61 | */ | |
62 | STATIC int /* error */ | |
63 | xfs_alloc_delrec( | |
64 | xfs_btree_cur_t *cur, /* btree cursor */ | |
65 | int level, /* level removing record from */ | |
66 | int *stat) /* fail/done/go-on */ | |
67 | { | |
68 | xfs_agf_t *agf; /* allocation group freelist header */ | |
69 | xfs_alloc_block_t *block; /* btree block record/key lives in */ | |
70 | xfs_agblock_t bno; /* btree block number */ | |
71 | xfs_buf_t *bp; /* buffer for block */ | |
72 | int error; /* error return value */ | |
73 | int i; /* loop index */ | |
74 | xfs_alloc_key_t key; /* kp points here if block is level 0 */ | |
75 | xfs_agblock_t lbno; /* left block's block number */ | |
76 | xfs_buf_t *lbp; /* left block's buffer pointer */ | |
77 | xfs_alloc_block_t *left; /* left btree block */ | |
78 | xfs_alloc_key_t *lkp=NULL; /* left block key pointer */ | |
79 | xfs_alloc_ptr_t *lpp=NULL; /* left block address pointer */ | |
80 | int lrecs=0; /* number of records in left block */ | |
81 | xfs_alloc_rec_t *lrp; /* left block record pointer */ | |
82 | xfs_mount_t *mp; /* mount structure */ | |
83 | int ptr; /* index in btree block for this rec */ | |
84 | xfs_agblock_t rbno; /* right block's block number */ | |
85 | xfs_buf_t *rbp; /* right block's buffer pointer */ | |
86 | xfs_alloc_block_t *right; /* right btree block */ | |
87 | xfs_alloc_key_t *rkp; /* right block key pointer */ | |
88 | xfs_alloc_ptr_t *rpp; /* right block address pointer */ | |
89 | int rrecs=0; /* number of records in right block */ | |
91d87232 | 90 | int numrecs; |
1da177e4 LT |
91 | xfs_alloc_rec_t *rrp; /* right block record pointer */ |
92 | xfs_btree_cur_t *tcur; /* temporary btree cursor */ | |
93 | ||
94 | /* | |
95 | * Get the index of the entry being deleted, check for nothing there. | |
96 | */ | |
97 | ptr = cur->bc_ptrs[level]; | |
98 | if (ptr == 0) { | |
99 | *stat = 0; | |
100 | return 0; | |
101 | } | |
102 | /* | |
103 | * Get the buffer & block containing the record or key/ptr. | |
104 | */ | |
105 | bp = cur->bc_bufs[level]; | |
106 | block = XFS_BUF_TO_ALLOC_BLOCK(bp); | |
107 | #ifdef DEBUG | |
108 | if ((error = xfs_btree_check_sblock(cur, block, level, bp))) | |
109 | return error; | |
110 | #endif | |
111 | /* | |
112 | * Fail if we're off the end of the block. | |
113 | */ | |
91d87232 ES |
114 | numrecs = be16_to_cpu(block->bb_numrecs); |
115 | if (ptr > numrecs) { | |
1da177e4 LT |
116 | *stat = 0; |
117 | return 0; | |
118 | } | |
119 | XFS_STATS_INC(xs_abt_delrec); | |
120 | /* | |
121 | * It's a nonleaf. Excise the key and ptr being deleted, by | |
122 | * sliding the entries past them down one. | |
123 | * Log the changed areas of the block. | |
124 | */ | |
125 | if (level > 0) { | |
126 | lkp = XFS_ALLOC_KEY_ADDR(block, 1, cur); | |
127 | lpp = XFS_ALLOC_PTR_ADDR(block, 1, cur); | |
128 | #ifdef DEBUG | |
91d87232 | 129 | for (i = ptr; i < numrecs; i++) { |
16259e7d | 130 | if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(lpp[i]), level))) |
1da177e4 LT |
131 | return error; |
132 | } | |
133 | #endif | |
91d87232 | 134 | if (ptr < numrecs) { |
1da177e4 | 135 | memmove(&lkp[ptr - 1], &lkp[ptr], |
91d87232 | 136 | (numrecs - ptr) * sizeof(*lkp)); |
1da177e4 | 137 | memmove(&lpp[ptr - 1], &lpp[ptr], |
91d87232 ES |
138 | (numrecs - ptr) * sizeof(*lpp)); |
139 | xfs_alloc_log_ptrs(cur, bp, ptr, numrecs - 1); | |
140 | xfs_alloc_log_keys(cur, bp, ptr, numrecs - 1); | |
1da177e4 LT |
141 | } |
142 | } | |
143 | /* | |
144 | * It's a leaf. Excise the record being deleted, by sliding the | |
145 | * entries past it down one. Log the changed areas of the block. | |
146 | */ | |
147 | else { | |
148 | lrp = XFS_ALLOC_REC_ADDR(block, 1, cur); | |
91d87232 | 149 | if (ptr < numrecs) { |
1da177e4 | 150 | memmove(&lrp[ptr - 1], &lrp[ptr], |
91d87232 ES |
151 | (numrecs - ptr) * sizeof(*lrp)); |
152 | xfs_alloc_log_recs(cur, bp, ptr, numrecs - 1); | |
1da177e4 LT |
153 | } |
154 | /* | |
155 | * If it's the first record in the block, we'll need a key | |
156 | * structure to pass up to the next level (updkey). | |
157 | */ | |
158 | if (ptr == 1) { | |
16259e7d CH |
159 | key.ar_startblock = lrp->ar_startblock; |
160 | key.ar_blockcount = lrp->ar_blockcount; | |
1da177e4 LT |
161 | lkp = &key; |
162 | } | |
163 | } | |
164 | /* | |
165 | * Decrement and log the number of entries in the block. | |
166 | */ | |
91d87232 ES |
167 | numrecs--; |
168 | block->bb_numrecs = cpu_to_be16(numrecs); | |
1da177e4 LT |
169 | xfs_alloc_log_block(cur->bc_tp, bp, XFS_BB_NUMRECS); |
170 | /* | |
171 | * See if the longest free extent in the allocation group was | |
172 | * changed by this operation. True if it's the by-size btree, and | |
173 | * this is the leaf level, and there is no right sibling block, | |
174 | * and this was the last record. | |
175 | */ | |
176 | agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); | |
177 | mp = cur->bc_mp; | |
178 | ||
179 | if (level == 0 && | |
180 | cur->bc_btnum == XFS_BTNUM_CNT && | |
16259e7d | 181 | be32_to_cpu(block->bb_rightsib) == NULLAGBLOCK && |
91d87232 ES |
182 | ptr > numrecs) { |
183 | ASSERT(ptr == numrecs + 1); | |
1da177e4 LT |
184 | /* |
185 | * There are still records in the block. Grab the size | |
186 | * from the last one. | |
187 | */ | |
91d87232 ES |
188 | if (numrecs) { |
189 | rrp = XFS_ALLOC_REC_ADDR(block, numrecs, cur); | |
16259e7d | 190 | agf->agf_longest = rrp->ar_blockcount; |
1da177e4 LT |
191 | } |
192 | /* | |
193 | * No free extents left. | |
194 | */ | |
195 | else | |
196 | agf->agf_longest = 0; | |
16259e7d CH |
197 | mp->m_perag[be32_to_cpu(agf->agf_seqno)].pagf_longest = |
198 | be32_to_cpu(agf->agf_longest); | |
1da177e4 LT |
199 | xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, |
200 | XFS_AGF_LONGEST); | |
201 | } | |
202 | /* | |
203 | * Is this the root level? If so, we're almost done. | |
204 | */ | |
205 | if (level == cur->bc_nlevels - 1) { | |
206 | /* | |
207 | * If this is the root level, | |
208 | * and there's only one entry left, | |
209 | * and it's NOT the leaf level, | |
210 | * then we can get rid of this level. | |
211 | */ | |
91d87232 | 212 | if (numrecs == 1 && level > 0) { |
1da177e4 LT |
213 | /* |
214 | * lpp is still set to the first pointer in the block. | |
215 | * Make it the new root of the btree. | |
216 | */ | |
16259e7d CH |
217 | bno = be32_to_cpu(agf->agf_roots[cur->bc_btnum]); |
218 | agf->agf_roots[cur->bc_btnum] = *lpp; | |
413d57c9 | 219 | be32_add_cpu(&agf->agf_levels[cur->bc_btnum], -1); |
16259e7d | 220 | mp->m_perag[be32_to_cpu(agf->agf_seqno)].pagf_levels[cur->bc_btnum]--; |
1da177e4 LT |
221 | /* |
222 | * Put this buffer/block on the ag's freelist. | |
223 | */ | |
92821e2b DC |
224 | error = xfs_alloc_put_freelist(cur->bc_tp, |
225 | cur->bc_private.a.agbp, NULL, bno, 1); | |
226 | if (error) | |
1da177e4 LT |
227 | return error; |
228 | /* | |
229 | * Since blocks move to the free list without the | |
230 | * coordination used in xfs_bmap_finish, we can't allow | |
231 | * block to be available for reallocation and | |
232 | * non-transaction writing (user data) until we know | |
233 | * that the transaction that moved it to the free list | |
234 | * is permanently on disk. We track the blocks by | |
235 | * declaring these blocks as "busy"; the busy list is | |
236 | * maintained on a per-ag basis and each transaction | |
237 | * records which entries should be removed when the | |
238 | * iclog commits to disk. If a busy block is | |
239 | * allocated, the iclog is pushed up to the LSN | |
240 | * that freed the block. | |
241 | */ | |
242 | xfs_alloc_mark_busy(cur->bc_tp, | |
16259e7d | 243 | be32_to_cpu(agf->agf_seqno), bno, 1); |
1da177e4 LT |
244 | |
245 | xfs_trans_agbtree_delta(cur->bc_tp, -1); | |
246 | xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, | |
247 | XFS_AGF_ROOTS | XFS_AGF_LEVELS); | |
248 | /* | |
249 | * Update the cursor so there's one fewer level. | |
250 | */ | |
251 | xfs_btree_setbuf(cur, level, NULL); | |
252 | cur->bc_nlevels--; | |
253 | } else if (level > 0 && | |
8df4da4a | 254 | (error = xfs_btree_decrement(cur, level, &i))) |
1da177e4 LT |
255 | return error; |
256 | *stat = 1; | |
257 | return 0; | |
258 | } | |
259 | /* | |
260 | * If we deleted the leftmost entry in the block, update the | |
261 | * key values above us in the tree. | |
262 | */ | |
38bb7423 | 263 | if (ptr == 1 && (error = xfs_btree_updkey(cur, (union xfs_btree_key *)lkp, level + 1))) |
1da177e4 LT |
264 | return error; |
265 | /* | |
266 | * If the number of records remaining in the block is at least | |
267 | * the minimum, we're done. | |
268 | */ | |
91d87232 | 269 | if (numrecs >= XFS_ALLOC_BLOCK_MINRECS(level, cur)) { |
8df4da4a | 270 | if (level > 0 && (error = xfs_btree_decrement(cur, level, &i))) |
1da177e4 LT |
271 | return error; |
272 | *stat = 1; | |
273 | return 0; | |
274 | } | |
275 | /* | |
276 | * Otherwise, we have to move some records around to keep the | |
277 | * tree balanced. Look at the left and right sibling blocks to | |
278 | * see if we can re-balance by moving only one record. | |
279 | */ | |
16259e7d CH |
280 | rbno = be32_to_cpu(block->bb_rightsib); |
281 | lbno = be32_to_cpu(block->bb_leftsib); | |
1da177e4 LT |
282 | bno = NULLAGBLOCK; |
283 | ASSERT(rbno != NULLAGBLOCK || lbno != NULLAGBLOCK); | |
284 | /* | |
285 | * Duplicate the cursor so our btree manipulations here won't | |
286 | * disrupt the next level up. | |
287 | */ | |
288 | if ((error = xfs_btree_dup_cursor(cur, &tcur))) | |
289 | return error; | |
290 | /* | |
291 | * If there's a right sibling, see if it's ok to shift an entry | |
292 | * out of it. | |
293 | */ | |
294 | if (rbno != NULLAGBLOCK) { | |
295 | /* | |
296 | * Move the temp cursor to the last entry in the next block. | |
297 | * Actually any entry but the first would suffice. | |
298 | */ | |
299 | i = xfs_btree_lastrec(tcur, level); | |
300 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
637aa50f | 301 | if ((error = xfs_btree_increment(tcur, level, &i))) |
1da177e4 LT |
302 | goto error0; |
303 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
304 | i = xfs_btree_lastrec(tcur, level); | |
305 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
306 | /* | |
307 | * Grab a pointer to the block. | |
308 | */ | |
309 | rbp = tcur->bc_bufs[level]; | |
310 | right = XFS_BUF_TO_ALLOC_BLOCK(rbp); | |
311 | #ifdef DEBUG | |
312 | if ((error = xfs_btree_check_sblock(cur, right, level, rbp))) | |
313 | goto error0; | |
314 | #endif | |
315 | /* | |
316 | * Grab the current block number, for future use. | |
317 | */ | |
16259e7d | 318 | bno = be32_to_cpu(right->bb_leftsib); |
1da177e4 LT |
319 | /* |
320 | * If right block is full enough so that removing one entry | |
321 | * won't make it too empty, and left-shifting an entry out | |
322 | * of right to us works, we're done. | |
323 | */ | |
16259e7d | 324 | if (be16_to_cpu(right->bb_numrecs) - 1 >= |
1da177e4 | 325 | XFS_ALLOC_BLOCK_MINRECS(level, cur)) { |
687b890a | 326 | if ((error = xfs_btree_lshift(tcur, level, &i))) |
1da177e4 LT |
327 | goto error0; |
328 | if (i) { | |
16259e7d | 329 | ASSERT(be16_to_cpu(block->bb_numrecs) >= |
1da177e4 LT |
330 | XFS_ALLOC_BLOCK_MINRECS(level, cur)); |
331 | xfs_btree_del_cursor(tcur, | |
332 | XFS_BTREE_NOERROR); | |
333 | if (level > 0 && | |
8df4da4a | 334 | (error = xfs_btree_decrement(cur, level, |
1da177e4 LT |
335 | &i))) |
336 | return error; | |
337 | *stat = 1; | |
338 | return 0; | |
339 | } | |
340 | } | |
341 | /* | |
342 | * Otherwise, grab the number of records in right for | |
343 | * future reference, and fix up the temp cursor to point | |
344 | * to our block again (last record). | |
345 | */ | |
16259e7d | 346 | rrecs = be16_to_cpu(right->bb_numrecs); |
1da177e4 LT |
347 | if (lbno != NULLAGBLOCK) { |
348 | i = xfs_btree_firstrec(tcur, level); | |
349 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
8df4da4a | 350 | if ((error = xfs_btree_decrement(tcur, level, &i))) |
1da177e4 LT |
351 | goto error0; |
352 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
353 | } | |
354 | } | |
355 | /* | |
356 | * If there's a left sibling, see if it's ok to shift an entry | |
357 | * out of it. | |
358 | */ | |
359 | if (lbno != NULLAGBLOCK) { | |
360 | /* | |
361 | * Move the temp cursor to the first entry in the | |
362 | * previous block. | |
363 | */ | |
364 | i = xfs_btree_firstrec(tcur, level); | |
365 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
8df4da4a | 366 | if ((error = xfs_btree_decrement(tcur, level, &i))) |
1da177e4 LT |
367 | goto error0; |
368 | XFS_WANT_CORRUPTED_GOTO(i == 1, error0); | |
369 | xfs_btree_firstrec(tcur, level); | |
370 | /* | |
371 | * Grab a pointer to the block. | |
372 | */ | |
373 | lbp = tcur->bc_bufs[level]; | |
374 | left = XFS_BUF_TO_ALLOC_BLOCK(lbp); | |
375 | #ifdef DEBUG | |
376 | if ((error = xfs_btree_check_sblock(cur, left, level, lbp))) | |
377 | goto error0; | |
378 | #endif | |
379 | /* | |
380 | * Grab the current block number, for future use. | |
381 | */ | |
16259e7d | 382 | bno = be32_to_cpu(left->bb_rightsib); |
1da177e4 LT |
383 | /* |
384 | * If left block is full enough so that removing one entry | |
385 | * won't make it too empty, and right-shifting an entry out | |
386 | * of left to us works, we're done. | |
387 | */ | |
16259e7d | 388 | if (be16_to_cpu(left->bb_numrecs) - 1 >= |
1da177e4 | 389 | XFS_ALLOC_BLOCK_MINRECS(level, cur)) { |
9eaead51 | 390 | if ((error = xfs_btree_rshift(tcur, level, &i))) |
1da177e4 LT |
391 | goto error0; |
392 | if (i) { | |
16259e7d | 393 | ASSERT(be16_to_cpu(block->bb_numrecs) >= |
1da177e4 LT |
394 | XFS_ALLOC_BLOCK_MINRECS(level, cur)); |
395 | xfs_btree_del_cursor(tcur, | |
396 | XFS_BTREE_NOERROR); | |
397 | if (level == 0) | |
398 | cur->bc_ptrs[0]++; | |
399 | *stat = 1; | |
400 | return 0; | |
401 | } | |
402 | } | |
403 | /* | |
404 | * Otherwise, grab the number of records in right for | |
405 | * future reference. | |
406 | */ | |
16259e7d | 407 | lrecs = be16_to_cpu(left->bb_numrecs); |
1da177e4 LT |
408 | } |
409 | /* | |
410 | * Delete the temp cursor, we're done with it. | |
411 | */ | |
412 | xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR); | |
413 | /* | |
414 | * If here, we need to do a join to keep the tree balanced. | |
415 | */ | |
416 | ASSERT(bno != NULLAGBLOCK); | |
417 | /* | |
418 | * See if we can join with the left neighbor block. | |
419 | */ | |
420 | if (lbno != NULLAGBLOCK && | |
91d87232 | 421 | lrecs + numrecs <= XFS_ALLOC_BLOCK_MAXRECS(level, cur)) { |
1da177e4 LT |
422 | /* |
423 | * Set "right" to be the starting block, | |
424 | * "left" to be the left neighbor. | |
425 | */ | |
426 | rbno = bno; | |
427 | right = block; | |
91d87232 | 428 | rrecs = be16_to_cpu(right->bb_numrecs); |
1da177e4 LT |
429 | rbp = bp; |
430 | if ((error = xfs_btree_read_bufs(mp, cur->bc_tp, | |
431 | cur->bc_private.a.agno, lbno, 0, &lbp, | |
432 | XFS_ALLOC_BTREE_REF))) | |
433 | return error; | |
434 | left = XFS_BUF_TO_ALLOC_BLOCK(lbp); | |
91d87232 | 435 | lrecs = be16_to_cpu(left->bb_numrecs); |
1da177e4 LT |
436 | if ((error = xfs_btree_check_sblock(cur, left, level, lbp))) |
437 | return error; | |
438 | } | |
439 | /* | |
440 | * If that won't work, see if we can join with the right neighbor block. | |
441 | */ | |
442 | else if (rbno != NULLAGBLOCK && | |
91d87232 | 443 | rrecs + numrecs <= XFS_ALLOC_BLOCK_MAXRECS(level, cur)) { |
1da177e4 LT |
444 | /* |
445 | * Set "left" to be the starting block, | |
446 | * "right" to be the right neighbor. | |
447 | */ | |
448 | lbno = bno; | |
449 | left = block; | |
91d87232 | 450 | lrecs = be16_to_cpu(left->bb_numrecs); |
1da177e4 LT |
451 | lbp = bp; |
452 | if ((error = xfs_btree_read_bufs(mp, cur->bc_tp, | |
453 | cur->bc_private.a.agno, rbno, 0, &rbp, | |
454 | XFS_ALLOC_BTREE_REF))) | |
455 | return error; | |
456 | right = XFS_BUF_TO_ALLOC_BLOCK(rbp); | |
91d87232 | 457 | rrecs = be16_to_cpu(right->bb_numrecs); |
1da177e4 LT |
458 | if ((error = xfs_btree_check_sblock(cur, right, level, rbp))) |
459 | return error; | |
460 | } | |
461 | /* | |
462 | * Otherwise, we can't fix the imbalance. | |
463 | * Just return. This is probably a logic error, but it's not fatal. | |
464 | */ | |
465 | else { | |
8df4da4a | 466 | if (level > 0 && (error = xfs_btree_decrement(cur, level, &i))) |
1da177e4 LT |
467 | return error; |
468 | *stat = 1; | |
469 | return 0; | |
470 | } | |
471 | /* | |
472 | * We're now going to join "left" and "right" by moving all the stuff | |
473 | * in "right" to "left" and deleting "right". | |
474 | */ | |
475 | if (level > 0) { | |
476 | /* | |
477 | * It's a non-leaf. Move keys and pointers. | |
478 | */ | |
91d87232 ES |
479 | lkp = XFS_ALLOC_KEY_ADDR(left, lrecs + 1, cur); |
480 | lpp = XFS_ALLOC_PTR_ADDR(left, lrecs + 1, cur); | |
1da177e4 LT |
481 | rkp = XFS_ALLOC_KEY_ADDR(right, 1, cur); |
482 | rpp = XFS_ALLOC_PTR_ADDR(right, 1, cur); | |
483 | #ifdef DEBUG | |
91d87232 | 484 | for (i = 0; i < rrecs; i++) { |
16259e7d | 485 | if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(rpp[i]), level))) |
1da177e4 LT |
486 | return error; |
487 | } | |
488 | #endif | |
91d87232 ES |
489 | memcpy(lkp, rkp, rrecs * sizeof(*lkp)); |
490 | memcpy(lpp, rpp, rrecs * sizeof(*lpp)); | |
491 | xfs_alloc_log_keys(cur, lbp, lrecs + 1, lrecs + rrecs); | |
492 | xfs_alloc_log_ptrs(cur, lbp, lrecs + 1, lrecs + rrecs); | |
1da177e4 LT |
493 | } else { |
494 | /* | |
495 | * It's a leaf. Move records. | |
496 | */ | |
91d87232 | 497 | lrp = XFS_ALLOC_REC_ADDR(left, lrecs + 1, cur); |
1da177e4 | 498 | rrp = XFS_ALLOC_REC_ADDR(right, 1, cur); |
91d87232 ES |
499 | memcpy(lrp, rrp, rrecs * sizeof(*lrp)); |
500 | xfs_alloc_log_recs(cur, lbp, lrecs + 1, lrecs + rrecs); | |
1da177e4 LT |
501 | } |
502 | /* | |
503 | * If we joined with the left neighbor, set the buffer in the | |
504 | * cursor to the left block, and fix up the index. | |
505 | */ | |
506 | if (bp != lbp) { | |
507 | xfs_btree_setbuf(cur, level, lbp); | |
91d87232 | 508 | cur->bc_ptrs[level] += lrecs; |
1da177e4 LT |
509 | } |
510 | /* | |
511 | * If we joined with the right neighbor and there's a level above | |
512 | * us, increment the cursor at that level. | |
513 | */ | |
514 | else if (level + 1 < cur->bc_nlevels && | |
637aa50f | 515 | (error = xfs_btree_increment(cur, level + 1, &i))) |
1da177e4 LT |
516 | return error; |
517 | /* | |
518 | * Fix up the number of records in the surviving block. | |
519 | */ | |
91d87232 ES |
520 | lrecs += rrecs; |
521 | left->bb_numrecs = cpu_to_be16(lrecs); | |
1da177e4 LT |
522 | /* |
523 | * Fix up the right block pointer in the surviving block, and log it. | |
524 | */ | |
16259e7d | 525 | left->bb_rightsib = right->bb_rightsib; |
1da177e4 LT |
526 | xfs_alloc_log_block(cur->bc_tp, lbp, XFS_BB_NUMRECS | XFS_BB_RIGHTSIB); |
527 | /* | |
528 | * If there is a right sibling now, make it point to the | |
529 | * remaining block. | |
530 | */ | |
16259e7d | 531 | if (be32_to_cpu(left->bb_rightsib) != NULLAGBLOCK) { |
1da177e4 LT |
532 | xfs_alloc_block_t *rrblock; |
533 | xfs_buf_t *rrbp; | |
534 | ||
535 | if ((error = xfs_btree_read_bufs(mp, cur->bc_tp, | |
16259e7d | 536 | cur->bc_private.a.agno, be32_to_cpu(left->bb_rightsib), 0, |
1da177e4 LT |
537 | &rrbp, XFS_ALLOC_BTREE_REF))) |
538 | return error; | |
539 | rrblock = XFS_BUF_TO_ALLOC_BLOCK(rrbp); | |
540 | if ((error = xfs_btree_check_sblock(cur, rrblock, level, rrbp))) | |
541 | return error; | |
16259e7d | 542 | rrblock->bb_leftsib = cpu_to_be32(lbno); |
1da177e4 LT |
543 | xfs_alloc_log_block(cur->bc_tp, rrbp, XFS_BB_LEFTSIB); |
544 | } | |
545 | /* | |
546 | * Free the deleting block by putting it on the freelist. | |
547 | */ | |
92821e2b DC |
548 | error = xfs_alloc_put_freelist(cur->bc_tp, |
549 | cur->bc_private.a.agbp, NULL, rbno, 1); | |
550 | if (error) | |
1da177e4 LT |
551 | return error; |
552 | /* | |
553 | * Since blocks move to the free list without the coordination | |
554 | * used in xfs_bmap_finish, we can't allow block to be available | |
555 | * for reallocation and non-transaction writing (user data) | |
556 | * until we know that the transaction that moved it to the free | |
557 | * list is permanently on disk. We track the blocks by declaring | |
558 | * these blocks as "busy"; the busy list is maintained on a | |
559 | * per-ag basis and each transaction records which entries | |
560 | * should be removed when the iclog commits to disk. If a | |
561 | * busy block is allocated, the iclog is pushed up to the | |
562 | * LSN that freed the block. | |
563 | */ | |
16259e7d | 564 | xfs_alloc_mark_busy(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1); |
1da177e4 | 565 | xfs_trans_agbtree_delta(cur->bc_tp, -1); |
16259e7d | 566 | |
1da177e4 LT |
567 | /* |
568 | * Adjust the current level's cursor so that we're left referring | |
569 | * to the right node, after we're done. | |
570 | * If this leaves the ptr value 0 our caller will fix it up. | |
571 | */ | |
572 | if (level > 0) | |
573 | cur->bc_ptrs[level]--; | |
574 | /* | |
575 | * Return value means the next level up has something to do. | |
576 | */ | |
577 | *stat = 2; | |
578 | return 0; | |
579 | ||
580 | error0: | |
581 | xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR); | |
582 | return error; | |
583 | } | |
584 | ||
1da177e4 LT |
585 | /* |
586 | * Log header fields from a btree block. | |
587 | */ | |
588 | STATIC void | |
589 | xfs_alloc_log_block( | |
590 | xfs_trans_t *tp, /* transaction pointer */ | |
591 | xfs_buf_t *bp, /* buffer containing btree block */ | |
592 | int fields) /* mask of fields: XFS_BB_... */ | |
593 | { | |
594 | int first; /* first byte offset logged */ | |
595 | int last; /* last byte offset logged */ | |
596 | static const short offsets[] = { /* table of offsets */ | |
597 | offsetof(xfs_alloc_block_t, bb_magic), | |
598 | offsetof(xfs_alloc_block_t, bb_level), | |
599 | offsetof(xfs_alloc_block_t, bb_numrecs), | |
600 | offsetof(xfs_alloc_block_t, bb_leftsib), | |
601 | offsetof(xfs_alloc_block_t, bb_rightsib), | |
602 | sizeof(xfs_alloc_block_t) | |
603 | }; | |
604 | ||
605 | xfs_btree_offsets(fields, offsets, XFS_BB_NUM_BITS, &first, &last); | |
606 | xfs_trans_log_buf(tp, bp, first, last); | |
607 | } | |
608 | ||
609 | /* | |
610 | * Log keys from a btree block (nonleaf). | |
611 | */ | |
612 | STATIC void | |
613 | xfs_alloc_log_keys( | |
614 | xfs_btree_cur_t *cur, /* btree cursor */ | |
615 | xfs_buf_t *bp, /* buffer containing btree block */ | |
616 | int kfirst, /* index of first key to log */ | |
617 | int klast) /* index of last key to log */ | |
618 | { | |
619 | xfs_alloc_block_t *block; /* btree block to log from */ | |
620 | int first; /* first byte offset logged */ | |
621 | xfs_alloc_key_t *kp; /* key pointer in btree block */ | |
622 | int last; /* last byte offset logged */ | |
623 | ||
624 | block = XFS_BUF_TO_ALLOC_BLOCK(bp); | |
625 | kp = XFS_ALLOC_KEY_ADDR(block, 1, cur); | |
626 | first = (int)((xfs_caddr_t)&kp[kfirst - 1] - (xfs_caddr_t)block); | |
627 | last = (int)(((xfs_caddr_t)&kp[klast] - 1) - (xfs_caddr_t)block); | |
628 | xfs_trans_log_buf(cur->bc_tp, bp, first, last); | |
629 | } | |
630 | ||
631 | /* | |
632 | * Log block pointer fields from a btree block (nonleaf). | |
633 | */ | |
634 | STATIC void | |
635 | xfs_alloc_log_ptrs( | |
636 | xfs_btree_cur_t *cur, /* btree cursor */ | |
637 | xfs_buf_t *bp, /* buffer containing btree block */ | |
638 | int pfirst, /* index of first pointer to log */ | |
639 | int plast) /* index of last pointer to log */ | |
640 | { | |
641 | xfs_alloc_block_t *block; /* btree block to log from */ | |
642 | int first; /* first byte offset logged */ | |
643 | int last; /* last byte offset logged */ | |
644 | xfs_alloc_ptr_t *pp; /* block-pointer pointer in btree blk */ | |
645 | ||
646 | block = XFS_BUF_TO_ALLOC_BLOCK(bp); | |
647 | pp = XFS_ALLOC_PTR_ADDR(block, 1, cur); | |
648 | first = (int)((xfs_caddr_t)&pp[pfirst - 1] - (xfs_caddr_t)block); | |
649 | last = (int)(((xfs_caddr_t)&pp[plast] - 1) - (xfs_caddr_t)block); | |
650 | xfs_trans_log_buf(cur->bc_tp, bp, first, last); | |
651 | } | |
652 | ||
653 | /* | |
654 | * Log records from a btree block (leaf). | |
655 | */ | |
656 | STATIC void | |
657 | xfs_alloc_log_recs( | |
658 | xfs_btree_cur_t *cur, /* btree cursor */ | |
659 | xfs_buf_t *bp, /* buffer containing btree block */ | |
660 | int rfirst, /* index of first record to log */ | |
661 | int rlast) /* index of last record to log */ | |
662 | { | |
663 | xfs_alloc_block_t *block; /* btree block to log from */ | |
664 | int first; /* first byte offset logged */ | |
665 | int last; /* last byte offset logged */ | |
666 | xfs_alloc_rec_t *rp; /* record pointer for btree block */ | |
667 | ||
668 | ||
669 | block = XFS_BUF_TO_ALLOC_BLOCK(bp); | |
670 | rp = XFS_ALLOC_REC_ADDR(block, 1, cur); | |
671 | #ifdef DEBUG | |
672 | { | |
673 | xfs_agf_t *agf; | |
674 | xfs_alloc_rec_t *p; | |
675 | ||
676 | agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); | |
677 | for (p = &rp[rfirst - 1]; p <= &rp[rlast - 1]; p++) | |
16259e7d CH |
678 | ASSERT(be32_to_cpu(p->ar_startblock) + |
679 | be32_to_cpu(p->ar_blockcount) <= | |
680 | be32_to_cpu(agf->agf_length)); | |
1da177e4 LT |
681 | } |
682 | #endif | |
683 | first = (int)((xfs_caddr_t)&rp[rfirst - 1] - (xfs_caddr_t)block); | |
684 | last = (int)(((xfs_caddr_t)&rp[rlast] - 1) - (xfs_caddr_t)block); | |
685 | xfs_trans_log_buf(cur->bc_tp, bp, first, last); | |
686 | } | |
687 | ||
1da177e4 | 688 | |
1da177e4 LT |
689 | /* |
690 | * Externally visible routines. | |
691 | */ | |
692 | ||
1da177e4 LT |
693 | /* |
694 | * Delete the record pointed to by cur. | |
695 | * The cursor refers to the place where the record was (could be inserted) | |
696 | * when the operation returns. | |
697 | */ | |
698 | int /* error */ | |
699 | xfs_alloc_delete( | |
700 | xfs_btree_cur_t *cur, /* btree cursor */ | |
701 | int *stat) /* success/failure */ | |
702 | { | |
703 | int error; /* error return value */ | |
704 | int i; /* result code */ | |
705 | int level; /* btree level */ | |
706 | ||
707 | /* | |
708 | * Go up the tree, starting at leaf level. | |
709 | * If 2 is returned then a join was done; go to the next level. | |
710 | * Otherwise we are done. | |
711 | */ | |
712 | for (level = 0, i = 2; i == 2; level++) { | |
713 | if ((error = xfs_alloc_delrec(cur, level, &i))) | |
714 | return error; | |
715 | } | |
716 | if (i == 0) { | |
717 | for (level = 1; level < cur->bc_nlevels; level++) { | |
718 | if (cur->bc_ptrs[level] == 0) { | |
8df4da4a | 719 | if ((error = xfs_btree_decrement(cur, level, &i))) |
1da177e4 LT |
720 | return error; |
721 | break; | |
722 | } | |
723 | } | |
724 | } | |
725 | *stat = i; | |
726 | return 0; | |
727 | } | |
728 | ||
729 | /* | |
730 | * Get the data from the pointed-to record. | |
731 | */ | |
732 | int /* error */ | |
733 | xfs_alloc_get_rec( | |
734 | xfs_btree_cur_t *cur, /* btree cursor */ | |
735 | xfs_agblock_t *bno, /* output: starting block of extent */ | |
736 | xfs_extlen_t *len, /* output: length of extent */ | |
737 | int *stat) /* output: success/failure */ | |
738 | { | |
739 | xfs_alloc_block_t *block; /* btree block */ | |
740 | #ifdef DEBUG | |
741 | int error; /* error return value */ | |
742 | #endif | |
743 | int ptr; /* record number */ | |
744 | ||
745 | ptr = cur->bc_ptrs[0]; | |
746 | block = XFS_BUF_TO_ALLOC_BLOCK(cur->bc_bufs[0]); | |
747 | #ifdef DEBUG | |
748 | if ((error = xfs_btree_check_sblock(cur, block, 0, cur->bc_bufs[0]))) | |
749 | return error; | |
750 | #endif | |
751 | /* | |
752 | * Off the right end or left end, return failure. | |
753 | */ | |
16259e7d | 754 | if (ptr > be16_to_cpu(block->bb_numrecs) || ptr <= 0) { |
1da177e4 LT |
755 | *stat = 0; |
756 | return 0; | |
757 | } | |
758 | /* | |
759 | * Point to the record and extract its data. | |
760 | */ | |
761 | { | |
762 | xfs_alloc_rec_t *rec; /* record data */ | |
763 | ||
764 | rec = XFS_ALLOC_REC_ADDR(block, ptr, cur); | |
16259e7d CH |
765 | *bno = be32_to_cpu(rec->ar_startblock); |
766 | *len = be32_to_cpu(rec->ar_blockcount); | |
1da177e4 LT |
767 | } |
768 | *stat = 1; | |
769 | return 0; | |
770 | } | |
771 | ||
1da177e4 | 772 | |
278d0ca1 CH |
773 | STATIC struct xfs_btree_cur * |
774 | xfs_allocbt_dup_cursor( | |
775 | struct xfs_btree_cur *cur) | |
776 | { | |
777 | return xfs_allocbt_init_cursor(cur->bc_mp, cur->bc_tp, | |
778 | cur->bc_private.a.agbp, cur->bc_private.a.agno, | |
779 | cur->bc_btnum); | |
780 | } | |
781 | ||
344207ce CH |
782 | STATIC void |
783 | xfs_allocbt_set_root( | |
784 | struct xfs_btree_cur *cur, | |
785 | union xfs_btree_ptr *ptr, | |
786 | int inc) | |
787 | { | |
788 | struct xfs_buf *agbp = cur->bc_private.a.agbp; | |
789 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
790 | xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno); | |
791 | int btnum = cur->bc_btnum; | |
792 | ||
793 | ASSERT(ptr->s != 0); | |
794 | ||
795 | agf->agf_roots[btnum] = ptr->s; | |
796 | be32_add_cpu(&agf->agf_levels[btnum], inc); | |
797 | cur->bc_mp->m_perag[seqno].pagf_levels[btnum] += inc; | |
798 | ||
799 | xfs_alloc_log_agf(cur->bc_tp, agbp, XFS_AGF_ROOTS | XFS_AGF_LEVELS); | |
800 | } | |
801 | ||
f5eb8e7c CH |
802 | STATIC int |
803 | xfs_allocbt_alloc_block( | |
804 | struct xfs_btree_cur *cur, | |
805 | union xfs_btree_ptr *start, | |
806 | union xfs_btree_ptr *new, | |
807 | int length, | |
808 | int *stat) | |
809 | { | |
810 | int error; | |
811 | xfs_agblock_t bno; | |
812 | ||
813 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ENTRY); | |
814 | ||
815 | /* Allocate the new block from the freelist. If we can't, give up. */ | |
816 | error = xfs_alloc_get_freelist(cur->bc_tp, cur->bc_private.a.agbp, | |
817 | &bno, 1); | |
818 | if (error) { | |
819 | XFS_BTREE_TRACE_CURSOR(cur, XBT_ERROR); | |
820 | return error; | |
821 | } | |
822 | ||
823 | if (bno == NULLAGBLOCK) { | |
824 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); | |
825 | *stat = 0; | |
826 | return 0; | |
827 | } | |
828 | ||
829 | xfs_trans_agbtree_delta(cur->bc_tp, 1); | |
830 | new->s = cpu_to_be32(bno); | |
831 | ||
832 | XFS_BTREE_TRACE_CURSOR(cur, XBT_EXIT); | |
833 | *stat = 1; | |
834 | return 0; | |
835 | } | |
836 | ||
d4b3a4b7 CH |
837 | STATIC int |
838 | xfs_allocbt_free_block( | |
839 | struct xfs_btree_cur *cur, | |
840 | struct xfs_buf *bp) | |
841 | { | |
842 | struct xfs_buf *agbp = cur->bc_private.a.agbp; | |
843 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
844 | xfs_agblock_t bno; | |
845 | int error; | |
846 | ||
847 | bno = XFS_DADDR_TO_AGBNO(cur->bc_mp, XFS_BUF_ADDR(bp)); | |
848 | error = xfs_alloc_put_freelist(cur->bc_tp, agbp, NULL, bno, 1); | |
849 | if (error) | |
850 | return error; | |
851 | ||
852 | /* | |
853 | * Since blocks move to the free list without the coordination used in | |
854 | * xfs_bmap_finish, we can't allow block to be available for | |
855 | * reallocation and non-transaction writing (user data) until we know | |
856 | * that the transaction that moved it to the free list is permanently | |
857 | * on disk. We track the blocks by declaring these blocks as "busy"; | |
858 | * the busy list is maintained on a per-ag basis and each transaction | |
859 | * records which entries should be removed when the iclog commits to | |
860 | * disk. If a busy block is allocated, the iclog is pushed up to the | |
861 | * LSN that freed the block. | |
862 | */ | |
863 | xfs_alloc_mark_busy(cur->bc_tp, be32_to_cpu(agf->agf_seqno), bno, 1); | |
864 | xfs_trans_agbtree_delta(cur->bc_tp, -1); | |
865 | return 0; | |
866 | } | |
867 | ||
1da177e4 | 868 | /* |
278d0ca1 | 869 | * Update the longest extent in the AGF |
1da177e4 | 870 | */ |
278d0ca1 CH |
871 | STATIC void |
872 | xfs_allocbt_update_lastrec( | |
873 | struct xfs_btree_cur *cur, | |
874 | struct xfs_btree_block *block, | |
875 | union xfs_btree_rec *rec, | |
876 | int ptr, | |
877 | int reason) | |
1da177e4 | 878 | { |
278d0ca1 CH |
879 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); |
880 | xfs_agnumber_t seqno = be32_to_cpu(agf->agf_seqno); | |
881 | __be32 len; | |
1da177e4 | 882 | |
278d0ca1 | 883 | ASSERT(cur->bc_btnum == XFS_BTNUM_CNT); |
1da177e4 | 884 | |
278d0ca1 CH |
885 | switch (reason) { |
886 | case LASTREC_UPDATE: | |
1da177e4 | 887 | /* |
278d0ca1 CH |
888 | * If this is the last leaf block and it's the last record, |
889 | * then update the size of the longest extent in the AG. | |
1da177e4 | 890 | */ |
278d0ca1 CH |
891 | if (ptr != xfs_btree_get_numrecs(block)) |
892 | return; | |
893 | len = rec->alloc.ar_blockcount; | |
894 | break; | |
4b22a571 CH |
895 | case LASTREC_INSREC: |
896 | if (be32_to_cpu(rec->alloc.ar_blockcount) <= | |
897 | be32_to_cpu(agf->agf_longest)) | |
898 | return; | |
899 | len = rec->alloc.ar_blockcount; | |
900 | break; | |
278d0ca1 CH |
901 | default: |
902 | ASSERT(0); | |
903 | return; | |
1da177e4 | 904 | } |
561f7d17 | 905 | |
278d0ca1 CH |
906 | agf->agf_longest = len; |
907 | cur->bc_mp->m_perag[seqno].pagf_longest = be32_to_cpu(len); | |
908 | xfs_alloc_log_agf(cur->bc_tp, cur->bc_private.a.agbp, XFS_AGF_LONGEST); | |
561f7d17 CH |
909 | } |
910 | ||
ce5e42db CH |
911 | STATIC int |
912 | xfs_allocbt_get_maxrecs( | |
913 | struct xfs_btree_cur *cur, | |
914 | int level) | |
915 | { | |
916 | return cur->bc_mp->m_alloc_mxr[level != 0]; | |
917 | } | |
918 | ||
fe033cc8 CH |
919 | STATIC void |
920 | xfs_allocbt_init_key_from_rec( | |
921 | union xfs_btree_key *key, | |
922 | union xfs_btree_rec *rec) | |
923 | { | |
924 | ASSERT(rec->alloc.ar_startblock != 0); | |
925 | ||
926 | key->alloc.ar_startblock = rec->alloc.ar_startblock; | |
927 | key->alloc.ar_blockcount = rec->alloc.ar_blockcount; | |
928 | } | |
929 | ||
4b22a571 CH |
930 | STATIC void |
931 | xfs_allocbt_init_rec_from_key( | |
932 | union xfs_btree_key *key, | |
933 | union xfs_btree_rec *rec) | |
934 | { | |
935 | ASSERT(key->alloc.ar_startblock != 0); | |
936 | ||
937 | rec->alloc.ar_startblock = key->alloc.ar_startblock; | |
938 | rec->alloc.ar_blockcount = key->alloc.ar_blockcount; | |
939 | } | |
940 | ||
941 | STATIC void | |
942 | xfs_allocbt_init_rec_from_cur( | |
943 | struct xfs_btree_cur *cur, | |
944 | union xfs_btree_rec *rec) | |
945 | { | |
946 | ASSERT(cur->bc_rec.a.ar_startblock != 0); | |
947 | ||
948 | rec->alloc.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock); | |
949 | rec->alloc.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount); | |
950 | } | |
951 | ||
fe033cc8 CH |
952 | STATIC void |
953 | xfs_allocbt_init_ptr_from_cur( | |
954 | struct xfs_btree_cur *cur, | |
955 | union xfs_btree_ptr *ptr) | |
956 | { | |
957 | struct xfs_agf *agf = XFS_BUF_TO_AGF(cur->bc_private.a.agbp); | |
958 | ||
959 | ASSERT(cur->bc_private.a.agno == be32_to_cpu(agf->agf_seqno)); | |
960 | ASSERT(agf->agf_roots[cur->bc_btnum] != 0); | |
961 | ||
962 | ptr->s = agf->agf_roots[cur->bc_btnum]; | |
963 | } | |
964 | ||
965 | STATIC __int64_t | |
966 | xfs_allocbt_key_diff( | |
967 | struct xfs_btree_cur *cur, | |
968 | union xfs_btree_key *key) | |
969 | { | |
970 | xfs_alloc_rec_incore_t *rec = &cur->bc_rec.a; | |
971 | xfs_alloc_key_t *kp = &key->alloc; | |
972 | __int64_t diff; | |
973 | ||
974 | if (cur->bc_btnum == XFS_BTNUM_BNO) { | |
975 | return (__int64_t)be32_to_cpu(kp->ar_startblock) - | |
976 | rec->ar_startblock; | |
977 | } | |
978 | ||
979 | diff = (__int64_t)be32_to_cpu(kp->ar_blockcount) - rec->ar_blockcount; | |
980 | if (diff) | |
981 | return diff; | |
982 | ||
983 | return (__int64_t)be32_to_cpu(kp->ar_startblock) - rec->ar_startblock; | |
984 | } | |
985 | ||
8c4ed633 CH |
986 | #ifdef XFS_BTREE_TRACE |
987 | ktrace_t *xfs_allocbt_trace_buf; | |
988 | ||
989 | STATIC void | |
990 | xfs_allocbt_trace_enter( | |
991 | struct xfs_btree_cur *cur, | |
992 | const char *func, | |
993 | char *s, | |
994 | int type, | |
995 | int line, | |
996 | __psunsigned_t a0, | |
997 | __psunsigned_t a1, | |
998 | __psunsigned_t a2, | |
999 | __psunsigned_t a3, | |
1000 | __psunsigned_t a4, | |
1001 | __psunsigned_t a5, | |
1002 | __psunsigned_t a6, | |
1003 | __psunsigned_t a7, | |
1004 | __psunsigned_t a8, | |
1005 | __psunsigned_t a9, | |
1006 | __psunsigned_t a10) | |
1007 | { | |
1008 | ktrace_enter(xfs_allocbt_trace_buf, (void *)(__psint_t)type, | |
1009 | (void *)func, (void *)s, NULL, (void *)cur, | |
1010 | (void *)a0, (void *)a1, (void *)a2, (void *)a3, | |
1011 | (void *)a4, (void *)a5, (void *)a6, (void *)a7, | |
1012 | (void *)a8, (void *)a9, (void *)a10); | |
1013 | } | |
1014 | ||
1015 | STATIC void | |
1016 | xfs_allocbt_trace_cursor( | |
1017 | struct xfs_btree_cur *cur, | |
1018 | __uint32_t *s0, | |
1019 | __uint64_t *l0, | |
1020 | __uint64_t *l1) | |
1021 | { | |
1022 | *s0 = cur->bc_private.a.agno; | |
1023 | *l0 = cur->bc_rec.a.ar_startblock; | |
1024 | *l1 = cur->bc_rec.a.ar_blockcount; | |
1025 | } | |
1026 | ||
1027 | STATIC void | |
1028 | xfs_allocbt_trace_key( | |
1029 | struct xfs_btree_cur *cur, | |
1030 | union xfs_btree_key *key, | |
1031 | __uint64_t *l0, | |
1032 | __uint64_t *l1) | |
1033 | { | |
1034 | *l0 = be32_to_cpu(key->alloc.ar_startblock); | |
1035 | *l1 = be32_to_cpu(key->alloc.ar_blockcount); | |
1036 | } | |
1037 | ||
1038 | STATIC void | |
1039 | xfs_allocbt_trace_record( | |
1040 | struct xfs_btree_cur *cur, | |
1041 | union xfs_btree_rec *rec, | |
1042 | __uint64_t *l0, | |
1043 | __uint64_t *l1, | |
1044 | __uint64_t *l2) | |
1045 | { | |
1046 | *l0 = be32_to_cpu(rec->alloc.ar_startblock); | |
1047 | *l1 = be32_to_cpu(rec->alloc.ar_blockcount); | |
1048 | *l2 = 0; | |
1049 | } | |
1050 | #endif /* XFS_BTREE_TRACE */ | |
1051 | ||
561f7d17 | 1052 | static const struct xfs_btree_ops xfs_allocbt_ops = { |
65f1eaea CH |
1053 | .rec_len = sizeof(xfs_alloc_rec_t), |
1054 | .key_len = sizeof(xfs_alloc_key_t), | |
1055 | ||
561f7d17 | 1056 | .dup_cursor = xfs_allocbt_dup_cursor, |
344207ce | 1057 | .set_root = xfs_allocbt_set_root, |
f5eb8e7c | 1058 | .alloc_block = xfs_allocbt_alloc_block, |
d4b3a4b7 | 1059 | .free_block = xfs_allocbt_free_block, |
278d0ca1 | 1060 | .update_lastrec = xfs_allocbt_update_lastrec, |
ce5e42db | 1061 | .get_maxrecs = xfs_allocbt_get_maxrecs, |
fe033cc8 | 1062 | .init_key_from_rec = xfs_allocbt_init_key_from_rec, |
4b22a571 CH |
1063 | .init_rec_from_key = xfs_allocbt_init_rec_from_key, |
1064 | .init_rec_from_cur = xfs_allocbt_init_rec_from_cur, | |
fe033cc8 CH |
1065 | .init_ptr_from_cur = xfs_allocbt_init_ptr_from_cur, |
1066 | .key_diff = xfs_allocbt_key_diff, | |
8c4ed633 CH |
1067 | |
1068 | #ifdef XFS_BTREE_TRACE | |
1069 | .trace_enter = xfs_allocbt_trace_enter, | |
1070 | .trace_cursor = xfs_allocbt_trace_cursor, | |
1071 | .trace_key = xfs_allocbt_trace_key, | |
1072 | .trace_record = xfs_allocbt_trace_record, | |
1073 | #endif | |
561f7d17 CH |
1074 | }; |
1075 | ||
1076 | /* | |
1077 | * Allocate a new allocation btree cursor. | |
1078 | */ | |
1079 | struct xfs_btree_cur * /* new alloc btree cursor */ | |
1080 | xfs_allocbt_init_cursor( | |
1081 | struct xfs_mount *mp, /* file system mount point */ | |
1082 | struct xfs_trans *tp, /* transaction pointer */ | |
1083 | struct xfs_buf *agbp, /* buffer for agf structure */ | |
1084 | xfs_agnumber_t agno, /* allocation group number */ | |
1085 | xfs_btnum_t btnum) /* btree identifier */ | |
1086 | { | |
1087 | struct xfs_agf *agf = XFS_BUF_TO_AGF(agbp); | |
1088 | struct xfs_btree_cur *cur; | |
1089 | ||
1090 | ASSERT(btnum == XFS_BTNUM_BNO || btnum == XFS_BTNUM_CNT); | |
1091 | ||
1092 | cur = kmem_zone_zalloc(xfs_btree_cur_zone, KM_SLEEP); | |
1093 | ||
1094 | cur->bc_tp = tp; | |
1095 | cur->bc_mp = mp; | |
1096 | cur->bc_nlevels = be32_to_cpu(agf->agf_levels[btnum]); | |
1097 | cur->bc_btnum = btnum; | |
1098 | cur->bc_blocklog = mp->m_sb.sb_blocklog; | |
1099 | ||
1100 | cur->bc_ops = &xfs_allocbt_ops; | |
278d0ca1 CH |
1101 | if (btnum == XFS_BTNUM_CNT) |
1102 | cur->bc_flags = XFS_BTREE_LASTREC_UPDATE; | |
561f7d17 CH |
1103 | |
1104 | cur->bc_private.a.agbp = agbp; | |
1105 | cur->bc_private.a.agno = agno; | |
1106 | ||
1107 | return cur; | |
1108 | } |