Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-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" | |
1da177e4 | 27 | #include "xfs_dir2.h" |
1da177e4 | 28 | #include "xfs_mount.h" |
1da177e4 | 29 | #include "xfs_bmap_btree.h" |
1da177e4 LT |
30 | #include "xfs_dinode.h" |
31 | #include "xfs_inode.h" | |
32 | #include "xfs_alloc.h" | |
33 | #include "xfs_bmap.h" | |
1da177e4 LT |
34 | #include "xfs_rtalloc.h" |
35 | #include "xfs_fsops.h" | |
36 | #include "xfs_error.h" | |
37 | #include "xfs_rw.h" | |
38 | #include "xfs_inode_item.h" | |
39 | #include "xfs_trans_space.h" | |
43355099 | 40 | #include "xfs_utils.h" |
0b1b213f | 41 | #include "xfs_trace.h" |
1922c949 | 42 | #include "xfs_buf.h" |
1da177e4 LT |
43 | |
44 | ||
45 | /* | |
46 | * Prototypes for internal functions. | |
47 | */ | |
48 | ||
49 | ||
50 | STATIC int xfs_rtallocate_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t, | |
51 | xfs_extlen_t, xfs_buf_t **, xfs_fsblock_t *); | |
52 | STATIC int xfs_rtany_summary(xfs_mount_t *, xfs_trans_t *, int, int, | |
53 | xfs_rtblock_t, xfs_buf_t **, xfs_fsblock_t *, int *); | |
54 | STATIC int xfs_rtcheck_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t, | |
55 | xfs_extlen_t, int, xfs_rtblock_t *, int *); | |
56 | STATIC int xfs_rtfind_back(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t, | |
57 | xfs_rtblock_t, xfs_rtblock_t *); | |
58 | STATIC int xfs_rtfind_forw(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t, | |
59 | xfs_rtblock_t, xfs_rtblock_t *); | |
60 | STATIC int xfs_rtget_summary( xfs_mount_t *, xfs_trans_t *, int, | |
61 | xfs_rtblock_t, xfs_buf_t **, xfs_fsblock_t *, xfs_suminfo_t *); | |
62 | STATIC int xfs_rtmodify_range(xfs_mount_t *, xfs_trans_t *, xfs_rtblock_t, | |
63 | xfs_extlen_t, int); | |
64 | STATIC int xfs_rtmodify_summary(xfs_mount_t *, xfs_trans_t *, int, | |
65 | xfs_rtblock_t, int, xfs_buf_t **, xfs_fsblock_t *); | |
66 | ||
67 | /* | |
68 | * Internal functions. | |
69 | */ | |
70 | ||
1da177e4 LT |
71 | /* |
72 | * Allocate space to the bitmap or summary file, and zero it, for growfs. | |
73 | */ | |
74 | STATIC int /* error */ | |
75 | xfs_growfs_rt_alloc( | |
76 | xfs_mount_t *mp, /* file system mount point */ | |
77 | xfs_extlen_t oblocks, /* old count of blocks */ | |
78 | xfs_extlen_t nblocks, /* new count of blocks */ | |
1050c71e | 79 | xfs_inode_t *ip) /* inode (bitmap/summary) */ |
1da177e4 LT |
80 | { |
81 | xfs_fileoff_t bno; /* block number in file */ | |
82 | xfs_buf_t *bp; /* temporary buffer for zeroing */ | |
1da177e4 LT |
83 | int committed; /* transaction committed flag */ |
84 | xfs_daddr_t d; /* disk block address */ | |
85 | int error; /* error return value */ | |
86 | xfs_fsblock_t firstblock; /* first block allocated in xaction */ | |
87 | xfs_bmap_free_t flist; /* list of freed blocks */ | |
88 | xfs_fsblock_t fsbno; /* filesystem block for bno */ | |
1da177e4 LT |
89 | xfs_bmbt_irec_t map; /* block map output */ |
90 | int nmap; /* number of block maps */ | |
91 | int resblks; /* space reservation */ | |
1da177e4 LT |
92 | |
93 | /* | |
94 | * Allocate space to the file, as necessary. | |
95 | */ | |
96 | while (oblocks < nblocks) { | |
0924b585 DC |
97 | int cancelflags = 0; |
98 | xfs_trans_t *tp; | |
99 | ||
1da177e4 LT |
100 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ALLOC); |
101 | resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks); | |
1da177e4 LT |
102 | /* |
103 | * Reserve space & log for one extent added to the file. | |
104 | */ | |
105 | if ((error = xfs_trans_reserve(tp, resblks, | |
106 | XFS_GROWRTALLOC_LOG_RES(mp), 0, | |
107 | XFS_TRANS_PERM_LOG_RES, | |
108 | XFS_DEFAULT_PERM_LOG_COUNT))) | |
e5720eec | 109 | goto error_cancel; |
1da177e4 LT |
110 | cancelflags = XFS_TRANS_RELEASE_LOG_RES; |
111 | /* | |
112 | * Lock the inode. | |
113 | */ | |
1050c71e | 114 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
ddc3415a | 115 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); |
1050c71e | 116 | |
9d87c319 | 117 | xfs_bmap_init(&flist, &firstblock); |
1da177e4 LT |
118 | /* |
119 | * Allocate blocks to the bitmap file. | |
120 | */ | |
121 | nmap = 1; | |
122 | cancelflags |= XFS_TRANS_ABORT; | |
c0dc7828 DC |
123 | error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks, |
124 | XFS_BMAPI_METADATA, &firstblock, | |
125 | resblks, &map, &nmap, &flist); | |
1da177e4 LT |
126 | if (!error && nmap < 1) |
127 | error = XFS_ERROR(ENOSPC); | |
128 | if (error) | |
e5720eec | 129 | goto error_cancel; |
1da177e4 LT |
130 | /* |
131 | * Free any blocks freed up in the transaction, then commit. | |
132 | */ | |
f7c99b6f | 133 | error = xfs_bmap_finish(&tp, &flist, &committed); |
1da177e4 | 134 | if (error) |
e5720eec DC |
135 | goto error_cancel; |
136 | error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); | |
137 | if (error) | |
138 | goto error; | |
1da177e4 LT |
139 | /* |
140 | * Now we need to clear the allocated blocks. | |
141 | * Do this one block per transaction, to keep it simple. | |
142 | */ | |
143 | cancelflags = 0; | |
144 | for (bno = map.br_startoff, fsbno = map.br_startblock; | |
145 | bno < map.br_startoff + map.br_blockcount; | |
146 | bno++, fsbno++) { | |
147 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ZERO); | |
148 | /* | |
149 | * Reserve log for one block zeroing. | |
150 | */ | |
151 | if ((error = xfs_trans_reserve(tp, 0, | |
152 | XFS_GROWRTZERO_LOG_RES(mp), 0, 0, 0))) | |
e5720eec | 153 | goto error_cancel; |
1da177e4 LT |
154 | /* |
155 | * Lock the bitmap inode. | |
156 | */ | |
1050c71e | 157 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
ddc3415a | 158 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); |
1da177e4 LT |
159 | /* |
160 | * Get a buffer for the block. | |
161 | */ | |
162 | d = XFS_FSB_TO_DADDR(mp, fsbno); | |
163 | bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d, | |
164 | mp->m_bsize, 0); | |
165 | if (bp == NULL) { | |
166 | error = XFS_ERROR(EIO); | |
0924b585 DC |
167 | error_cancel: |
168 | xfs_trans_cancel(tp, cancelflags); | |
169 | goto error; | |
1da177e4 | 170 | } |
62926044 | 171 | memset(bp->b_addr, 0, mp->m_sb.sb_blocksize); |
1da177e4 LT |
172 | xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1); |
173 | /* | |
174 | * Commit the transaction. | |
175 | */ | |
e5720eec DC |
176 | error = xfs_trans_commit(tp, 0); |
177 | if (error) | |
178 | goto error; | |
1da177e4 LT |
179 | } |
180 | /* | |
181 | * Go on to the next extent, if any. | |
182 | */ | |
183 | oblocks = map.br_startoff + map.br_blockcount; | |
184 | } | |
185 | return 0; | |
e5720eec | 186 | error: |
1da177e4 LT |
187 | return error; |
188 | } | |
189 | ||
190 | /* | |
191 | * Attempt to allocate an extent minlen<=len<=maxlen starting from | |
192 | * bitmap block bbno. If we don't get maxlen then use prod to trim | |
193 | * the length, if given. Returns error; returns starting block in *rtblock. | |
194 | * The lengths are all in rtextents. | |
195 | */ | |
196 | STATIC int /* error */ | |
197 | xfs_rtallocate_extent_block( | |
198 | xfs_mount_t *mp, /* file system mount point */ | |
199 | xfs_trans_t *tp, /* transaction pointer */ | |
200 | xfs_rtblock_t bbno, /* bitmap block number */ | |
201 | xfs_extlen_t minlen, /* minimum length to allocate */ | |
202 | xfs_extlen_t maxlen, /* maximum length to allocate */ | |
203 | xfs_extlen_t *len, /* out: actual length allocated */ | |
204 | xfs_rtblock_t *nextp, /* out: next block to try */ | |
205 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
206 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
207 | xfs_extlen_t prod, /* extent product factor */ | |
208 | xfs_rtblock_t *rtblock) /* out: start block allocated */ | |
209 | { | |
210 | xfs_rtblock_t besti; /* best rtblock found so far */ | |
211 | xfs_rtblock_t bestlen; /* best length found so far */ | |
212 | xfs_rtblock_t end; /* last rtblock in chunk */ | |
213 | int error; /* error value */ | |
214 | xfs_rtblock_t i; /* current rtblock trying */ | |
215 | xfs_rtblock_t next; /* next rtblock to try */ | |
216 | int stat; /* status from internal calls */ | |
217 | ||
218 | /* | |
219 | * Loop over all the extents starting in this bitmap block, | |
220 | * looking for one that's long enough. | |
221 | */ | |
222 | for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0, | |
223 | end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1; | |
224 | i <= end; | |
225 | i++) { | |
226 | /* | |
227 | * See if there's a free extent of maxlen starting at i. | |
228 | * If it's not so then next will contain the first non-free. | |
229 | */ | |
230 | error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat); | |
231 | if (error) { | |
232 | return error; | |
233 | } | |
234 | if (stat) { | |
235 | /* | |
236 | * i for maxlen is all free, allocate and return that. | |
237 | */ | |
238 | error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp, | |
239 | rsb); | |
240 | if (error) { | |
241 | return error; | |
242 | } | |
243 | *len = maxlen; | |
244 | *rtblock = i; | |
245 | return 0; | |
246 | } | |
247 | /* | |
248 | * In the case where we have a variable-sized allocation | |
249 | * request, figure out how big this free piece is, | |
250 | * and if it's big enough for the minimum, and the best | |
251 | * so far, remember it. | |
252 | */ | |
253 | if (minlen < maxlen) { | |
254 | xfs_rtblock_t thislen; /* this extent size */ | |
255 | ||
256 | thislen = next - i; | |
257 | if (thislen >= minlen && thislen > bestlen) { | |
258 | besti = i; | |
259 | bestlen = thislen; | |
260 | } | |
261 | } | |
262 | /* | |
263 | * If not done yet, find the start of the next free space. | |
264 | */ | |
265 | if (next < end) { | |
266 | error = xfs_rtfind_forw(mp, tp, next, end, &i); | |
267 | if (error) { | |
268 | return error; | |
269 | } | |
270 | } else | |
271 | break; | |
272 | } | |
273 | /* | |
274 | * Searched the whole thing & didn't find a maxlen free extent. | |
275 | */ | |
276 | if (minlen < maxlen && besti != -1) { | |
277 | xfs_extlen_t p; /* amount to trim length by */ | |
278 | ||
279 | /* | |
280 | * If size should be a multiple of prod, make that so. | |
281 | */ | |
282 | if (prod > 1 && (p = do_mod(bestlen, prod))) | |
283 | bestlen -= p; | |
284 | /* | |
285 | * Allocate besti for bestlen & return that. | |
286 | */ | |
287 | error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb); | |
288 | if (error) { | |
289 | return error; | |
290 | } | |
291 | *len = bestlen; | |
292 | *rtblock = besti; | |
293 | return 0; | |
294 | } | |
295 | /* | |
296 | * Allocation failed. Set *nextp to the next block to try. | |
297 | */ | |
298 | *nextp = next; | |
299 | *rtblock = NULLRTBLOCK; | |
300 | return 0; | |
301 | } | |
302 | ||
303 | /* | |
304 | * Allocate an extent of length minlen<=len<=maxlen, starting at block | |
305 | * bno. If we don't get maxlen then use prod to trim the length, if given. | |
306 | * Returns error; returns starting block in *rtblock. | |
307 | * The lengths are all in rtextents. | |
308 | */ | |
309 | STATIC int /* error */ | |
310 | xfs_rtallocate_extent_exact( | |
311 | xfs_mount_t *mp, /* file system mount point */ | |
312 | xfs_trans_t *tp, /* transaction pointer */ | |
313 | xfs_rtblock_t bno, /* starting block number to allocate */ | |
314 | xfs_extlen_t minlen, /* minimum length to allocate */ | |
315 | xfs_extlen_t maxlen, /* maximum length to allocate */ | |
316 | xfs_extlen_t *len, /* out: actual length allocated */ | |
317 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
318 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
319 | xfs_extlen_t prod, /* extent product factor */ | |
320 | xfs_rtblock_t *rtblock) /* out: start block allocated */ | |
321 | { | |
322 | int error; /* error value */ | |
323 | xfs_extlen_t i; /* extent length trimmed due to prod */ | |
324 | int isfree; /* extent is free */ | |
325 | xfs_rtblock_t next; /* next block to try (dummy) */ | |
326 | ||
327 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); | |
328 | /* | |
329 | * Check if the range in question (for maxlen) is free. | |
330 | */ | |
331 | error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree); | |
332 | if (error) { | |
333 | return error; | |
334 | } | |
335 | if (isfree) { | |
336 | /* | |
337 | * If it is, allocate it and return success. | |
338 | */ | |
339 | error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); | |
340 | if (error) { | |
341 | return error; | |
342 | } | |
343 | *len = maxlen; | |
344 | *rtblock = bno; | |
345 | return 0; | |
346 | } | |
347 | /* | |
348 | * If not, allocate what there is, if it's at least minlen. | |
349 | */ | |
350 | maxlen = next - bno; | |
351 | if (maxlen < minlen) { | |
352 | /* | |
353 | * Failed, return failure status. | |
354 | */ | |
355 | *rtblock = NULLRTBLOCK; | |
356 | return 0; | |
357 | } | |
358 | /* | |
359 | * Trim off tail of extent, if prod is specified. | |
360 | */ | |
361 | if (prod > 1 && (i = maxlen % prod)) { | |
362 | maxlen -= i; | |
363 | if (maxlen < minlen) { | |
364 | /* | |
365 | * Now we can't do it, return failure status. | |
366 | */ | |
367 | *rtblock = NULLRTBLOCK; | |
368 | return 0; | |
369 | } | |
370 | } | |
371 | /* | |
372 | * Allocate what we can and return it. | |
373 | */ | |
374 | error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); | |
375 | if (error) { | |
376 | return error; | |
377 | } | |
378 | *len = maxlen; | |
379 | *rtblock = bno; | |
380 | return 0; | |
381 | } | |
382 | ||
383 | /* | |
384 | * Allocate an extent of length minlen<=len<=maxlen, starting as near | |
385 | * to bno as possible. If we don't get maxlen then use prod to trim | |
386 | * the length, if given. The lengths are all in rtextents. | |
387 | */ | |
388 | STATIC int /* error */ | |
389 | xfs_rtallocate_extent_near( | |
390 | xfs_mount_t *mp, /* file system mount point */ | |
391 | xfs_trans_t *tp, /* transaction pointer */ | |
392 | xfs_rtblock_t bno, /* starting block number to allocate */ | |
393 | xfs_extlen_t minlen, /* minimum length to allocate */ | |
394 | xfs_extlen_t maxlen, /* maximum length to allocate */ | |
395 | xfs_extlen_t *len, /* out: actual length allocated */ | |
396 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
397 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
398 | xfs_extlen_t prod, /* extent product factor */ | |
399 | xfs_rtblock_t *rtblock) /* out: start block allocated */ | |
400 | { | |
401 | int any; /* any useful extents from summary */ | |
402 | xfs_rtblock_t bbno; /* bitmap block number */ | |
403 | int error; /* error value */ | |
404 | int i; /* bitmap block offset (loop control) */ | |
405 | int j; /* secondary loop control */ | |
406 | int log2len; /* log2 of minlen */ | |
407 | xfs_rtblock_t n; /* next block to try */ | |
408 | xfs_rtblock_t r; /* result block */ | |
409 | ||
410 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); | |
411 | /* | |
412 | * If the block number given is off the end, silently set it to | |
413 | * the last block. | |
414 | */ | |
415 | if (bno >= mp->m_sb.sb_rextents) | |
416 | bno = mp->m_sb.sb_rextents - 1; | |
417 | /* | |
418 | * Try the exact allocation first. | |
419 | */ | |
420 | error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len, | |
421 | rbpp, rsb, prod, &r); | |
422 | if (error) { | |
423 | return error; | |
424 | } | |
425 | /* | |
426 | * If the exact allocation worked, return that. | |
427 | */ | |
428 | if (r != NULLRTBLOCK) { | |
429 | *rtblock = r; | |
430 | return 0; | |
431 | } | |
432 | bbno = XFS_BITTOBLOCK(mp, bno); | |
433 | i = 0; | |
79071eb0 | 434 | ASSERT(minlen != 0); |
1da177e4 LT |
435 | log2len = xfs_highbit32(minlen); |
436 | /* | |
437 | * Loop over all bitmap blocks (bbno + i is current block). | |
438 | */ | |
439 | for (;;) { | |
440 | /* | |
441 | * Get summary information of extents of all useful levels | |
442 | * starting in this bitmap block. | |
443 | */ | |
444 | error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1, | |
445 | bbno + i, rbpp, rsb, &any); | |
446 | if (error) { | |
447 | return error; | |
448 | } | |
449 | /* | |
450 | * If there are any useful extents starting here, try | |
451 | * allocating one. | |
452 | */ | |
453 | if (any) { | |
454 | /* | |
455 | * On the positive side of the starting location. | |
456 | */ | |
457 | if (i >= 0) { | |
458 | /* | |
459 | * Try to allocate an extent starting in | |
460 | * this block. | |
461 | */ | |
462 | error = xfs_rtallocate_extent_block(mp, tp, | |
463 | bbno + i, minlen, maxlen, len, &n, rbpp, | |
464 | rsb, prod, &r); | |
465 | if (error) { | |
466 | return error; | |
467 | } | |
468 | /* | |
469 | * If it worked, return it. | |
470 | */ | |
471 | if (r != NULLRTBLOCK) { | |
472 | *rtblock = r; | |
473 | return 0; | |
474 | } | |
475 | } | |
476 | /* | |
477 | * On the negative side of the starting location. | |
478 | */ | |
479 | else { /* i < 0 */ | |
480 | /* | |
481 | * Loop backwards through the bitmap blocks from | |
482 | * the starting point-1 up to where we are now. | |
483 | * There should be an extent which ends in this | |
484 | * bitmap block and is long enough. | |
485 | */ | |
486 | for (j = -1; j > i; j--) { | |
487 | /* | |
488 | * Grab the summary information for | |
489 | * this bitmap block. | |
490 | */ | |
491 | error = xfs_rtany_summary(mp, tp, | |
492 | log2len, mp->m_rsumlevels - 1, | |
493 | bbno + j, rbpp, rsb, &any); | |
494 | if (error) { | |
495 | return error; | |
496 | } | |
497 | /* | |
498 | * If there's no extent given in the | |
499 | * summary that means the extent we | |
500 | * found must carry over from an | |
501 | * earlier block. If there is an | |
502 | * extent given, we've already tried | |
503 | * that allocation, don't do it again. | |
504 | */ | |
505 | if (any) | |
506 | continue; | |
507 | error = xfs_rtallocate_extent_block(mp, | |
508 | tp, bbno + j, minlen, maxlen, | |
509 | len, &n, rbpp, rsb, prod, &r); | |
510 | if (error) { | |
511 | return error; | |
512 | } | |
513 | /* | |
514 | * If it works, return the extent. | |
515 | */ | |
516 | if (r != NULLRTBLOCK) { | |
517 | *rtblock = r; | |
518 | return 0; | |
519 | } | |
520 | } | |
521 | /* | |
522 | * There weren't intervening bitmap blocks | |
523 | * with a long enough extent, or the | |
524 | * allocation didn't work for some reason | |
525 | * (i.e. it's a little * too short). | |
526 | * Try to allocate from the summary block | |
527 | * that we found. | |
528 | */ | |
529 | error = xfs_rtallocate_extent_block(mp, tp, | |
530 | bbno + i, minlen, maxlen, len, &n, rbpp, | |
531 | rsb, prod, &r); | |
532 | if (error) { | |
533 | return error; | |
534 | } | |
535 | /* | |
536 | * If it works, return the extent. | |
537 | */ | |
538 | if (r != NULLRTBLOCK) { | |
539 | *rtblock = r; | |
540 | return 0; | |
541 | } | |
542 | } | |
543 | } | |
544 | /* | |
545 | * Loop control. If we were on the positive side, and there's | |
546 | * still more blocks on the negative side, go there. | |
547 | */ | |
548 | if (i > 0 && (int)bbno - i >= 0) | |
549 | i = -i; | |
550 | /* | |
551 | * If positive, and no more negative, but there are more | |
552 | * positive, go there. | |
553 | */ | |
554 | else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1) | |
555 | i++; | |
556 | /* | |
557 | * If negative or 0 (just started), and there are positive | |
558 | * blocks to go, go there. The 0 case moves to block 1. | |
559 | */ | |
560 | else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1) | |
561 | i = 1 - i; | |
562 | /* | |
563 | * If negative or 0 and there are more negative blocks, | |
564 | * go there. | |
565 | */ | |
566 | else if (i <= 0 && (int)bbno + i > 0) | |
567 | i--; | |
568 | /* | |
569 | * Must be done. Return failure. | |
570 | */ | |
571 | else | |
572 | break; | |
573 | } | |
574 | *rtblock = NULLRTBLOCK; | |
575 | return 0; | |
576 | } | |
577 | ||
578 | /* | |
579 | * Allocate an extent of length minlen<=len<=maxlen, with no position | |
580 | * specified. If we don't get maxlen then use prod to trim | |
581 | * the length, if given. The lengths are all in rtextents. | |
582 | */ | |
583 | STATIC int /* error */ | |
584 | xfs_rtallocate_extent_size( | |
585 | xfs_mount_t *mp, /* file system mount point */ | |
586 | xfs_trans_t *tp, /* transaction pointer */ | |
587 | xfs_extlen_t minlen, /* minimum length to allocate */ | |
588 | xfs_extlen_t maxlen, /* maximum length to allocate */ | |
589 | xfs_extlen_t *len, /* out: actual length allocated */ | |
590 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
591 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
592 | xfs_extlen_t prod, /* extent product factor */ | |
593 | xfs_rtblock_t *rtblock) /* out: start block allocated */ | |
594 | { | |
595 | int error; /* error value */ | |
596 | int i; /* bitmap block number */ | |
597 | int l; /* level number (loop control) */ | |
598 | xfs_rtblock_t n; /* next block to be tried */ | |
599 | xfs_rtblock_t r; /* result block number */ | |
600 | xfs_suminfo_t sum; /* summary information for extents */ | |
601 | ||
602 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); | |
79071eb0 DC |
603 | ASSERT(maxlen != 0); |
604 | ||
1da177e4 LT |
605 | /* |
606 | * Loop over all the levels starting with maxlen. | |
607 | * At each level, look at all the bitmap blocks, to see if there | |
608 | * are extents starting there that are long enough (>= maxlen). | |
609 | * Note, only on the initial level can the allocation fail if | |
610 | * the summary says there's an extent. | |
611 | */ | |
612 | for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) { | |
613 | /* | |
614 | * Loop over all the bitmap blocks. | |
615 | */ | |
616 | for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { | |
617 | /* | |
618 | * Get the summary for this level/block. | |
619 | */ | |
620 | error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, | |
621 | &sum); | |
622 | if (error) { | |
623 | return error; | |
624 | } | |
625 | /* | |
626 | * Nothing there, on to the next block. | |
627 | */ | |
628 | if (!sum) | |
629 | continue; | |
630 | /* | |
631 | * Try allocating the extent. | |
632 | */ | |
633 | error = xfs_rtallocate_extent_block(mp, tp, i, maxlen, | |
634 | maxlen, len, &n, rbpp, rsb, prod, &r); | |
635 | if (error) { | |
636 | return error; | |
637 | } | |
638 | /* | |
639 | * If it worked, return that. | |
640 | */ | |
641 | if (r != NULLRTBLOCK) { | |
642 | *rtblock = r; | |
643 | return 0; | |
644 | } | |
645 | /* | |
646 | * If the "next block to try" returned from the | |
647 | * allocator is beyond the next bitmap block, | |
648 | * skip to that bitmap block. | |
649 | */ | |
650 | if (XFS_BITTOBLOCK(mp, n) > i + 1) | |
651 | i = XFS_BITTOBLOCK(mp, n) - 1; | |
652 | } | |
653 | } | |
654 | /* | |
655 | * Didn't find any maxlen blocks. Try smaller ones, unless | |
656 | * we're asking for a fixed size extent. | |
657 | */ | |
658 | if (minlen > --maxlen) { | |
659 | *rtblock = NULLRTBLOCK; | |
660 | return 0; | |
661 | } | |
79071eb0 DC |
662 | ASSERT(minlen != 0); |
663 | ASSERT(maxlen != 0); | |
664 | ||
1da177e4 LT |
665 | /* |
666 | * Loop over sizes, from maxlen down to minlen. | |
667 | * This time, when we do the allocations, allow smaller ones | |
668 | * to succeed. | |
669 | */ | |
670 | for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) { | |
671 | /* | |
672 | * Loop over all the bitmap blocks, try an allocation | |
673 | * starting in that block. | |
674 | */ | |
675 | for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { | |
676 | /* | |
677 | * Get the summary information for this level/block. | |
678 | */ | |
679 | error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, | |
680 | &sum); | |
681 | if (error) { | |
682 | return error; | |
683 | } | |
684 | /* | |
685 | * If nothing there, go on to next. | |
686 | */ | |
687 | if (!sum) | |
688 | continue; | |
689 | /* | |
690 | * Try the allocation. Make sure the specified | |
691 | * minlen/maxlen are in the possible range for | |
692 | * this summary level. | |
693 | */ | |
694 | error = xfs_rtallocate_extent_block(mp, tp, i, | |
695 | XFS_RTMAX(minlen, 1 << l), | |
696 | XFS_RTMIN(maxlen, (1 << (l + 1)) - 1), | |
697 | len, &n, rbpp, rsb, prod, &r); | |
698 | if (error) { | |
699 | return error; | |
700 | } | |
701 | /* | |
702 | * If it worked, return that extent. | |
703 | */ | |
704 | if (r != NULLRTBLOCK) { | |
705 | *rtblock = r; | |
706 | return 0; | |
707 | } | |
708 | /* | |
709 | * If the "next block to try" returned from the | |
710 | * allocator is beyond the next bitmap block, | |
711 | * skip to that bitmap block. | |
712 | */ | |
713 | if (XFS_BITTOBLOCK(mp, n) > i + 1) | |
714 | i = XFS_BITTOBLOCK(mp, n) - 1; | |
715 | } | |
716 | } | |
717 | /* | |
718 | * Got nothing, return failure. | |
719 | */ | |
720 | *rtblock = NULLRTBLOCK; | |
721 | return 0; | |
722 | } | |
723 | ||
724 | /* | |
725 | * Mark an extent specified by start and len allocated. | |
726 | * Updates all the summary information as well as the bitmap. | |
727 | */ | |
728 | STATIC int /* error */ | |
729 | xfs_rtallocate_range( | |
730 | xfs_mount_t *mp, /* file system mount point */ | |
731 | xfs_trans_t *tp, /* transaction pointer */ | |
732 | xfs_rtblock_t start, /* start block to allocate */ | |
733 | xfs_extlen_t len, /* length to allocate */ | |
734 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
735 | xfs_fsblock_t *rsb) /* in/out: summary block number */ | |
736 | { | |
737 | xfs_rtblock_t end; /* end of the allocated extent */ | |
738 | int error; /* error value */ | |
739 | xfs_rtblock_t postblock; /* first block allocated > end */ | |
740 | xfs_rtblock_t preblock; /* first block allocated < start */ | |
741 | ||
742 | end = start + len - 1; | |
743 | /* | |
744 | * Assume we're allocating out of the middle of a free extent. | |
745 | * We need to find the beginning and end of the extent so we can | |
746 | * properly update the summary. | |
747 | */ | |
748 | error = xfs_rtfind_back(mp, tp, start, 0, &preblock); | |
749 | if (error) { | |
750 | return error; | |
751 | } | |
752 | /* | |
753 | * Find the next allocated block (end of free extent). | |
754 | */ | |
755 | error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1, | |
756 | &postblock); | |
757 | if (error) { | |
758 | return error; | |
759 | } | |
760 | /* | |
761 | * Decrement the summary information corresponding to the entire | |
762 | * (old) free extent. | |
763 | */ | |
764 | error = xfs_rtmodify_summary(mp, tp, | |
765 | XFS_RTBLOCKLOG(postblock + 1 - preblock), | |
766 | XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb); | |
767 | if (error) { | |
768 | return error; | |
769 | } | |
770 | /* | |
771 | * If there are blocks not being allocated at the front of the | |
772 | * old extent, add summary data for them to be free. | |
773 | */ | |
774 | if (preblock < start) { | |
775 | error = xfs_rtmodify_summary(mp, tp, | |
776 | XFS_RTBLOCKLOG(start - preblock), | |
777 | XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb); | |
778 | if (error) { | |
779 | return error; | |
780 | } | |
781 | } | |
782 | /* | |
783 | * If there are blocks not being allocated at the end of the | |
784 | * old extent, add summary data for them to be free. | |
785 | */ | |
786 | if (postblock > end) { | |
787 | error = xfs_rtmodify_summary(mp, tp, | |
788 | XFS_RTBLOCKLOG(postblock - end), | |
789 | XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb); | |
790 | if (error) { | |
791 | return error; | |
792 | } | |
793 | } | |
794 | /* | |
795 | * Modify the bitmap to mark this extent allocated. | |
796 | */ | |
797 | error = xfs_rtmodify_range(mp, tp, start, len, 0); | |
798 | return error; | |
799 | } | |
800 | ||
801 | /* | |
802 | * Return whether there are any free extents in the size range given | |
803 | * by low and high, for the bitmap block bbno. | |
804 | */ | |
805 | STATIC int /* error */ | |
806 | xfs_rtany_summary( | |
807 | xfs_mount_t *mp, /* file system mount structure */ | |
808 | xfs_trans_t *tp, /* transaction pointer */ | |
809 | int low, /* low log2 extent size */ | |
810 | int high, /* high log2 extent size */ | |
811 | xfs_rtblock_t bbno, /* bitmap block number */ | |
812 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
813 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
814 | int *stat) /* out: any good extents here? */ | |
815 | { | |
816 | int error; /* error value */ | |
817 | int log; /* loop counter, log2 of ext. size */ | |
818 | xfs_suminfo_t sum; /* summary data */ | |
819 | ||
820 | /* | |
821 | * Loop over logs of extent sizes. Order is irrelevant. | |
822 | */ | |
823 | for (log = low; log <= high; log++) { | |
824 | /* | |
825 | * Get one summary datum. | |
826 | */ | |
827 | error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum); | |
828 | if (error) { | |
829 | return error; | |
830 | } | |
831 | /* | |
832 | * If there are any, return success. | |
833 | */ | |
834 | if (sum) { | |
835 | *stat = 1; | |
836 | return 0; | |
837 | } | |
838 | } | |
839 | /* | |
840 | * Found nothing, return failure. | |
841 | */ | |
842 | *stat = 0; | |
843 | return 0; | |
844 | } | |
845 | ||
846 | /* | |
847 | * Get a buffer for the bitmap or summary file block specified. | |
848 | * The buffer is returned read and locked. | |
849 | */ | |
850 | STATIC int /* error */ | |
851 | xfs_rtbuf_get( | |
852 | xfs_mount_t *mp, /* file system mount structure */ | |
853 | xfs_trans_t *tp, /* transaction pointer */ | |
854 | xfs_rtblock_t block, /* block number in bitmap or summary */ | |
855 | int issum, /* is summary not bitmap */ | |
856 | xfs_buf_t **bpp) /* output: buffer for the block */ | |
857 | { | |
858 | xfs_buf_t *bp; /* block buffer, result */ | |
1da177e4 | 859 | xfs_inode_t *ip; /* bitmap or summary inode */ |
5b777ad5 DC |
860 | xfs_bmbt_irec_t map; |
861 | int nmap; | |
862 | int error; /* error value */ | |
1da177e4 LT |
863 | |
864 | ip = issum ? mp->m_rsumip : mp->m_rbmip; | |
5b777ad5 DC |
865 | |
866 | error = xfs_bmapi_read(ip, block, 1, &map, &nmap, XFS_DATA_FORK); | |
867 | if (error) | |
1da177e4 | 868 | return error; |
5b777ad5 DC |
869 | |
870 | ASSERT(map.br_startblock != NULLFSBLOCK); | |
871 | error = xfs_trans_read_buf(mp, tp, mp->m_ddev_targp, | |
872 | XFS_FSB_TO_DADDR(mp, map.br_startblock), | |
1da177e4 | 873 | mp->m_bsize, 0, &bp); |
5b777ad5 | 874 | if (error) |
1da177e4 | 875 | return error; |
5a52c2a5 | 876 | ASSERT(!xfs_buf_geterror(bp)); |
1da177e4 LT |
877 | *bpp = bp; |
878 | return 0; | |
879 | } | |
880 | ||
881 | #ifdef DEBUG | |
882 | /* | |
883 | * Check that the given extent (block range) is allocated already. | |
884 | */ | |
885 | STATIC int /* error */ | |
886 | xfs_rtcheck_alloc_range( | |
887 | xfs_mount_t *mp, /* file system mount point */ | |
888 | xfs_trans_t *tp, /* transaction pointer */ | |
889 | xfs_rtblock_t bno, /* starting block number of extent */ | |
890 | xfs_extlen_t len, /* length of extent */ | |
891 | int *stat) /* out: 1 for allocated, 0 for not */ | |
892 | { | |
893 | xfs_rtblock_t new; /* dummy for xfs_rtcheck_range */ | |
894 | ||
895 | return xfs_rtcheck_range(mp, tp, bno, len, 0, &new, stat); | |
896 | } | |
897 | #endif | |
898 | ||
1da177e4 LT |
899 | /* |
900 | * Check that the given range is either all allocated (val = 0) or | |
901 | * all free (val = 1). | |
902 | */ | |
903 | STATIC int /* error */ | |
904 | xfs_rtcheck_range( | |
905 | xfs_mount_t *mp, /* file system mount point */ | |
906 | xfs_trans_t *tp, /* transaction pointer */ | |
907 | xfs_rtblock_t start, /* starting block number of extent */ | |
908 | xfs_extlen_t len, /* length of extent */ | |
909 | int val, /* 1 for free, 0 for allocated */ | |
910 | xfs_rtblock_t *new, /* out: first block not matching */ | |
911 | int *stat) /* out: 1 for matches, 0 for not */ | |
912 | { | |
913 | xfs_rtword_t *b; /* current word in buffer */ | |
914 | int bit; /* bit number in the word */ | |
915 | xfs_rtblock_t block; /* bitmap block number */ | |
916 | xfs_buf_t *bp; /* buf for the block */ | |
917 | xfs_rtword_t *bufp; /* starting word in buffer */ | |
918 | int error; /* error value */ | |
919 | xfs_rtblock_t i; /* current bit number rel. to start */ | |
920 | xfs_rtblock_t lastbit; /* last useful bit in word */ | |
921 | xfs_rtword_t mask; /* mask of relevant bits for value */ | |
922 | xfs_rtword_t wdiff; /* difference from wanted value */ | |
923 | int word; /* word number in the buffer */ | |
924 | ||
925 | /* | |
926 | * Compute starting bitmap block number | |
927 | */ | |
928 | block = XFS_BITTOBLOCK(mp, start); | |
929 | /* | |
930 | * Read the bitmap block. | |
931 | */ | |
932 | error = xfs_rtbuf_get(mp, tp, block, 0, &bp); | |
933 | if (error) { | |
934 | return error; | |
935 | } | |
62926044 | 936 | bufp = bp->b_addr; |
1da177e4 LT |
937 | /* |
938 | * Compute the starting word's address, and starting bit. | |
939 | */ | |
940 | word = XFS_BITTOWORD(mp, start); | |
941 | b = &bufp[word]; | |
942 | bit = (int)(start & (XFS_NBWORD - 1)); | |
943 | /* | |
944 | * 0 (allocated) => all zero's; 1 (free) => all one's. | |
945 | */ | |
946 | val = -val; | |
947 | /* | |
948 | * If not starting on a word boundary, deal with the first | |
949 | * (partial) word. | |
950 | */ | |
951 | if (bit) { | |
952 | /* | |
953 | * Compute first bit not examined. | |
954 | */ | |
955 | lastbit = XFS_RTMIN(bit + len, XFS_NBWORD); | |
956 | /* | |
957 | * Mask of relevant bits. | |
958 | */ | |
959 | mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit; | |
960 | /* | |
961 | * Compute difference between actual and desired value. | |
962 | */ | |
963 | if ((wdiff = (*b ^ val) & mask)) { | |
964 | /* | |
965 | * Different, compute first wrong bit and return. | |
966 | */ | |
967 | xfs_trans_brelse(tp, bp); | |
968 | i = XFS_RTLOBIT(wdiff) - bit; | |
969 | *new = start + i; | |
970 | *stat = 0; | |
971 | return 0; | |
972 | } | |
973 | i = lastbit - bit; | |
974 | /* | |
975 | * Go on to next block if that's where the next word is | |
976 | * and we need the next word. | |
977 | */ | |
978 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
979 | /* | |
980 | * If done with this block, get the next one. | |
981 | */ | |
982 | xfs_trans_brelse(tp, bp); | |
983 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
984 | if (error) { | |
985 | return error; | |
986 | } | |
62926044 | 987 | b = bufp = bp->b_addr; |
1da177e4 LT |
988 | word = 0; |
989 | } else { | |
990 | /* | |
991 | * Go on to the next word in the buffer. | |
992 | */ | |
993 | b++; | |
994 | } | |
995 | } else { | |
996 | /* | |
997 | * Starting on a word boundary, no partial word. | |
998 | */ | |
999 | i = 0; | |
1000 | } | |
1001 | /* | |
1002 | * Loop over whole words in buffers. When we use up one buffer | |
1003 | * we move on to the next one. | |
1004 | */ | |
1005 | while (len - i >= XFS_NBWORD) { | |
1006 | /* | |
1007 | * Compute difference between actual and desired value. | |
1008 | */ | |
1009 | if ((wdiff = *b ^ val)) { | |
1010 | /* | |
1011 | * Different, compute first wrong bit and return. | |
1012 | */ | |
1013 | xfs_trans_brelse(tp, bp); | |
1014 | i += XFS_RTLOBIT(wdiff); | |
1015 | *new = start + i; | |
1016 | *stat = 0; | |
1017 | return 0; | |
1018 | } | |
1019 | i += XFS_NBWORD; | |
1020 | /* | |
1021 | * Go on to next block if that's where the next word is | |
1022 | * and we need the next word. | |
1023 | */ | |
1024 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
1025 | /* | |
1026 | * If done with this block, get the next one. | |
1027 | */ | |
1028 | xfs_trans_brelse(tp, bp); | |
1029 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
1030 | if (error) { | |
1031 | return error; | |
1032 | } | |
62926044 | 1033 | b = bufp = bp->b_addr; |
1da177e4 LT |
1034 | word = 0; |
1035 | } else { | |
1036 | /* | |
1037 | * Go on to the next word in the buffer. | |
1038 | */ | |
1039 | b++; | |
1040 | } | |
1041 | } | |
1042 | /* | |
1043 | * If not ending on a word boundary, deal with the last | |
1044 | * (partial) word. | |
1045 | */ | |
1046 | if ((lastbit = len - i)) { | |
1047 | /* | |
1048 | * Mask of relevant bits. | |
1049 | */ | |
1050 | mask = ((xfs_rtword_t)1 << lastbit) - 1; | |
1051 | /* | |
1052 | * Compute difference between actual and desired value. | |
1053 | */ | |
1054 | if ((wdiff = (*b ^ val) & mask)) { | |
1055 | /* | |
1056 | * Different, compute first wrong bit and return. | |
1057 | */ | |
1058 | xfs_trans_brelse(tp, bp); | |
1059 | i += XFS_RTLOBIT(wdiff); | |
1060 | *new = start + i; | |
1061 | *stat = 0; | |
1062 | return 0; | |
1063 | } else | |
1064 | i = len; | |
1065 | } | |
1066 | /* | |
1067 | * Successful, return. | |
1068 | */ | |
1069 | xfs_trans_brelse(tp, bp); | |
1070 | *new = start + i; | |
1071 | *stat = 1; | |
1072 | return 0; | |
1073 | } | |
1074 | ||
1075 | /* | |
1076 | * Copy and transform the summary file, given the old and new | |
1077 | * parameters in the mount structures. | |
1078 | */ | |
1079 | STATIC int /* error */ | |
1080 | xfs_rtcopy_summary( | |
1081 | xfs_mount_t *omp, /* old file system mount point */ | |
1082 | xfs_mount_t *nmp, /* new file system mount point */ | |
1083 | xfs_trans_t *tp) /* transaction pointer */ | |
1084 | { | |
1085 | xfs_rtblock_t bbno; /* bitmap block number */ | |
1086 | xfs_buf_t *bp; /* summary buffer */ | |
1087 | int error; /* error return value */ | |
1088 | int log; /* summary level number (log length) */ | |
1089 | xfs_suminfo_t sum; /* summary data */ | |
1090 | xfs_fsblock_t sumbno; /* summary block number */ | |
1091 | ||
1092 | bp = NULL; | |
1093 | for (log = omp->m_rsumlevels - 1; log >= 0; log--) { | |
1094 | for (bbno = omp->m_sb.sb_rbmblocks - 1; | |
1095 | (xfs_srtblock_t)bbno >= 0; | |
1096 | bbno--) { | |
1097 | error = xfs_rtget_summary(omp, tp, log, bbno, &bp, | |
1098 | &sumbno, &sum); | |
1099 | if (error) | |
1100 | return error; | |
1101 | if (sum == 0) | |
1102 | continue; | |
1103 | error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum, | |
1104 | &bp, &sumbno); | |
1105 | if (error) | |
1106 | return error; | |
1107 | error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum, | |
1108 | &bp, &sumbno); | |
1109 | if (error) | |
1110 | return error; | |
1111 | ASSERT(sum > 0); | |
1112 | } | |
1113 | } | |
1114 | return 0; | |
1115 | } | |
1116 | ||
1117 | /* | |
1118 | * Searching backward from start to limit, find the first block whose | |
1119 | * allocated/free state is different from start's. | |
1120 | */ | |
1121 | STATIC int /* error */ | |
1122 | xfs_rtfind_back( | |
1123 | xfs_mount_t *mp, /* file system mount point */ | |
1124 | xfs_trans_t *tp, /* transaction pointer */ | |
1125 | xfs_rtblock_t start, /* starting block to look at */ | |
1126 | xfs_rtblock_t limit, /* last block to look at */ | |
1127 | xfs_rtblock_t *rtblock) /* out: start block found */ | |
1128 | { | |
1129 | xfs_rtword_t *b; /* current word in buffer */ | |
1130 | int bit; /* bit number in the word */ | |
1131 | xfs_rtblock_t block; /* bitmap block number */ | |
1132 | xfs_buf_t *bp; /* buf for the block */ | |
1133 | xfs_rtword_t *bufp; /* starting word in buffer */ | |
1134 | int error; /* error value */ | |
1135 | xfs_rtblock_t firstbit; /* first useful bit in the word */ | |
1136 | xfs_rtblock_t i; /* current bit number rel. to start */ | |
1137 | xfs_rtblock_t len; /* length of inspected area */ | |
1138 | xfs_rtword_t mask; /* mask of relevant bits for value */ | |
1139 | xfs_rtword_t want; /* mask for "good" values */ | |
1140 | xfs_rtword_t wdiff; /* difference from wanted value */ | |
1141 | int word; /* word number in the buffer */ | |
1142 | ||
1143 | /* | |
1144 | * Compute and read in starting bitmap block for starting block. | |
1145 | */ | |
1146 | block = XFS_BITTOBLOCK(mp, start); | |
1147 | error = xfs_rtbuf_get(mp, tp, block, 0, &bp); | |
1148 | if (error) { | |
1149 | return error; | |
1150 | } | |
62926044 | 1151 | bufp = bp->b_addr; |
1da177e4 LT |
1152 | /* |
1153 | * Get the first word's index & point to it. | |
1154 | */ | |
1155 | word = XFS_BITTOWORD(mp, start); | |
1156 | b = &bufp[word]; | |
1157 | bit = (int)(start & (XFS_NBWORD - 1)); | |
1158 | len = start - limit + 1; | |
1159 | /* | |
1160 | * Compute match value, based on the bit at start: if 1 (free) | |
1161 | * then all-ones, else all-zeroes. | |
1162 | */ | |
1163 | want = (*b & ((xfs_rtword_t)1 << bit)) ? -1 : 0; | |
1164 | /* | |
1165 | * If the starting position is not word-aligned, deal with the | |
1166 | * partial word. | |
1167 | */ | |
1168 | if (bit < XFS_NBWORD - 1) { | |
1169 | /* | |
1170 | * Calculate first (leftmost) bit number to look at, | |
1171 | * and mask for all the relevant bits in this word. | |
1172 | */ | |
1173 | firstbit = XFS_RTMAX((xfs_srtblock_t)(bit - len + 1), 0); | |
1174 | mask = (((xfs_rtword_t)1 << (bit - firstbit + 1)) - 1) << | |
1175 | firstbit; | |
1176 | /* | |
1177 | * Calculate the difference between the value there | |
1178 | * and what we're looking for. | |
1179 | */ | |
1180 | if ((wdiff = (*b ^ want) & mask)) { | |
1181 | /* | |
1182 | * Different. Mark where we are and return. | |
1183 | */ | |
1184 | xfs_trans_brelse(tp, bp); | |
1185 | i = bit - XFS_RTHIBIT(wdiff); | |
1186 | *rtblock = start - i + 1; | |
1187 | return 0; | |
1188 | } | |
1189 | i = bit - firstbit + 1; | |
1190 | /* | |
1191 | * Go on to previous block if that's where the previous word is | |
1192 | * and we need the previous word. | |
1193 | */ | |
1194 | if (--word == -1 && i < len) { | |
1195 | /* | |
1196 | * If done with this block, get the previous one. | |
1197 | */ | |
1198 | xfs_trans_brelse(tp, bp); | |
1199 | error = xfs_rtbuf_get(mp, tp, --block, 0, &bp); | |
1200 | if (error) { | |
1201 | return error; | |
1202 | } | |
62926044 | 1203 | bufp = bp->b_addr; |
1da177e4 LT |
1204 | word = XFS_BLOCKWMASK(mp); |
1205 | b = &bufp[word]; | |
1206 | } else { | |
1207 | /* | |
1208 | * Go on to the previous word in the buffer. | |
1209 | */ | |
1210 | b--; | |
1211 | } | |
1212 | } else { | |
1213 | /* | |
1214 | * Starting on a word boundary, no partial word. | |
1215 | */ | |
1216 | i = 0; | |
1217 | } | |
1218 | /* | |
1219 | * Loop over whole words in buffers. When we use up one buffer | |
1220 | * we move on to the previous one. | |
1221 | */ | |
1222 | while (len - i >= XFS_NBWORD) { | |
1223 | /* | |
1224 | * Compute difference between actual and desired value. | |
1225 | */ | |
1226 | if ((wdiff = *b ^ want)) { | |
1227 | /* | |
1228 | * Different, mark where we are and return. | |
1229 | */ | |
1230 | xfs_trans_brelse(tp, bp); | |
1231 | i += XFS_NBWORD - 1 - XFS_RTHIBIT(wdiff); | |
1232 | *rtblock = start - i + 1; | |
1233 | return 0; | |
1234 | } | |
1235 | i += XFS_NBWORD; | |
1236 | /* | |
1237 | * Go on to previous block if that's where the previous word is | |
1238 | * and we need the previous word. | |
1239 | */ | |
1240 | if (--word == -1 && i < len) { | |
1241 | /* | |
1242 | * If done with this block, get the previous one. | |
1243 | */ | |
1244 | xfs_trans_brelse(tp, bp); | |
1245 | error = xfs_rtbuf_get(mp, tp, --block, 0, &bp); | |
1246 | if (error) { | |
1247 | return error; | |
1248 | } | |
62926044 | 1249 | bufp = bp->b_addr; |
1da177e4 LT |
1250 | word = XFS_BLOCKWMASK(mp); |
1251 | b = &bufp[word]; | |
1252 | } else { | |
1253 | /* | |
1254 | * Go on to the previous word in the buffer. | |
1255 | */ | |
1256 | b--; | |
1257 | } | |
1258 | } | |
1259 | /* | |
1260 | * If not ending on a word boundary, deal with the last | |
1261 | * (partial) word. | |
1262 | */ | |
1263 | if (len - i) { | |
1264 | /* | |
1265 | * Calculate first (leftmost) bit number to look at, | |
1266 | * and mask for all the relevant bits in this word. | |
1267 | */ | |
1268 | firstbit = XFS_NBWORD - (len - i); | |
1269 | mask = (((xfs_rtword_t)1 << (len - i)) - 1) << firstbit; | |
1270 | /* | |
1271 | * Compute difference between actual and desired value. | |
1272 | */ | |
1273 | if ((wdiff = (*b ^ want) & mask)) { | |
1274 | /* | |
1275 | * Different, mark where we are and return. | |
1276 | */ | |
1277 | xfs_trans_brelse(tp, bp); | |
1278 | i += XFS_NBWORD - 1 - XFS_RTHIBIT(wdiff); | |
1279 | *rtblock = start - i + 1; | |
1280 | return 0; | |
1281 | } else | |
1282 | i = len; | |
1283 | } | |
1284 | /* | |
1285 | * No match, return that we scanned the whole area. | |
1286 | */ | |
1287 | xfs_trans_brelse(tp, bp); | |
1288 | *rtblock = start - i + 1; | |
1289 | return 0; | |
1290 | } | |
1291 | ||
1292 | /* | |
1293 | * Searching forward from start to limit, find the first block whose | |
1294 | * allocated/free state is different from start's. | |
1295 | */ | |
1296 | STATIC int /* error */ | |
1297 | xfs_rtfind_forw( | |
1298 | xfs_mount_t *mp, /* file system mount point */ | |
1299 | xfs_trans_t *tp, /* transaction pointer */ | |
1300 | xfs_rtblock_t start, /* starting block to look at */ | |
1301 | xfs_rtblock_t limit, /* last block to look at */ | |
1302 | xfs_rtblock_t *rtblock) /* out: start block found */ | |
1303 | { | |
1304 | xfs_rtword_t *b; /* current word in buffer */ | |
1305 | int bit; /* bit number in the word */ | |
1306 | xfs_rtblock_t block; /* bitmap block number */ | |
1307 | xfs_buf_t *bp; /* buf for the block */ | |
1308 | xfs_rtword_t *bufp; /* starting word in buffer */ | |
1309 | int error; /* error value */ | |
1310 | xfs_rtblock_t i; /* current bit number rel. to start */ | |
1311 | xfs_rtblock_t lastbit; /* last useful bit in the word */ | |
1312 | xfs_rtblock_t len; /* length of inspected area */ | |
1313 | xfs_rtword_t mask; /* mask of relevant bits for value */ | |
1314 | xfs_rtword_t want; /* mask for "good" values */ | |
1315 | xfs_rtword_t wdiff; /* difference from wanted value */ | |
1316 | int word; /* word number in the buffer */ | |
1317 | ||
1318 | /* | |
1319 | * Compute and read in starting bitmap block for starting block. | |
1320 | */ | |
1321 | block = XFS_BITTOBLOCK(mp, start); | |
1322 | error = xfs_rtbuf_get(mp, tp, block, 0, &bp); | |
1323 | if (error) { | |
1324 | return error; | |
1325 | } | |
62926044 | 1326 | bufp = bp->b_addr; |
1da177e4 LT |
1327 | /* |
1328 | * Get the first word's index & point to it. | |
1329 | */ | |
1330 | word = XFS_BITTOWORD(mp, start); | |
1331 | b = &bufp[word]; | |
1332 | bit = (int)(start & (XFS_NBWORD - 1)); | |
1333 | len = limit - start + 1; | |
1334 | /* | |
1335 | * Compute match value, based on the bit at start: if 1 (free) | |
1336 | * then all-ones, else all-zeroes. | |
1337 | */ | |
1338 | want = (*b & ((xfs_rtword_t)1 << bit)) ? -1 : 0; | |
1339 | /* | |
1340 | * If the starting position is not word-aligned, deal with the | |
1341 | * partial word. | |
1342 | */ | |
1343 | if (bit) { | |
1344 | /* | |
1345 | * Calculate last (rightmost) bit number to look at, | |
1346 | * and mask for all the relevant bits in this word. | |
1347 | */ | |
1348 | lastbit = XFS_RTMIN(bit + len, XFS_NBWORD); | |
1349 | mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit; | |
1350 | /* | |
1351 | * Calculate the difference between the value there | |
1352 | * and what we're looking for. | |
1353 | */ | |
1354 | if ((wdiff = (*b ^ want) & mask)) { | |
1355 | /* | |
1356 | * Different. Mark where we are and return. | |
1357 | */ | |
1358 | xfs_trans_brelse(tp, bp); | |
1359 | i = XFS_RTLOBIT(wdiff) - bit; | |
1360 | *rtblock = start + i - 1; | |
1361 | return 0; | |
1362 | } | |
1363 | i = lastbit - bit; | |
1364 | /* | |
1365 | * Go on to next block if that's where the next word is | |
1366 | * and we need the next word. | |
1367 | */ | |
1368 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
1369 | /* | |
1370 | * If done with this block, get the previous one. | |
1371 | */ | |
1372 | xfs_trans_brelse(tp, bp); | |
1373 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
1374 | if (error) { | |
1375 | return error; | |
1376 | } | |
62926044 | 1377 | b = bufp = bp->b_addr; |
1da177e4 LT |
1378 | word = 0; |
1379 | } else { | |
1380 | /* | |
1381 | * Go on to the previous word in the buffer. | |
1382 | */ | |
1383 | b++; | |
1384 | } | |
1385 | } else { | |
1386 | /* | |
1387 | * Starting on a word boundary, no partial word. | |
1388 | */ | |
1389 | i = 0; | |
1390 | } | |
1391 | /* | |
1392 | * Loop over whole words in buffers. When we use up one buffer | |
1393 | * we move on to the next one. | |
1394 | */ | |
1395 | while (len - i >= XFS_NBWORD) { | |
1396 | /* | |
1397 | * Compute difference between actual and desired value. | |
1398 | */ | |
1399 | if ((wdiff = *b ^ want)) { | |
1400 | /* | |
1401 | * Different, mark where we are and return. | |
1402 | */ | |
1403 | xfs_trans_brelse(tp, bp); | |
1404 | i += XFS_RTLOBIT(wdiff); | |
1405 | *rtblock = start + i - 1; | |
1406 | return 0; | |
1407 | } | |
1408 | i += XFS_NBWORD; | |
1409 | /* | |
1410 | * Go on to next block if that's where the next word is | |
1411 | * and we need the next word. | |
1412 | */ | |
1413 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
1414 | /* | |
1415 | * If done with this block, get the next one. | |
1416 | */ | |
1417 | xfs_trans_brelse(tp, bp); | |
1418 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
1419 | if (error) { | |
1420 | return error; | |
1421 | } | |
62926044 | 1422 | b = bufp = bp->b_addr; |
1da177e4 LT |
1423 | word = 0; |
1424 | } else { | |
1425 | /* | |
1426 | * Go on to the next word in the buffer. | |
1427 | */ | |
1428 | b++; | |
1429 | } | |
1430 | } | |
1431 | /* | |
1432 | * If not ending on a word boundary, deal with the last | |
1433 | * (partial) word. | |
1434 | */ | |
1435 | if ((lastbit = len - i)) { | |
1436 | /* | |
1437 | * Calculate mask for all the relevant bits in this word. | |
1438 | */ | |
1439 | mask = ((xfs_rtword_t)1 << lastbit) - 1; | |
1440 | /* | |
1441 | * Compute difference between actual and desired value. | |
1442 | */ | |
1443 | if ((wdiff = (*b ^ want) & mask)) { | |
1444 | /* | |
1445 | * Different, mark where we are and return. | |
1446 | */ | |
1447 | xfs_trans_brelse(tp, bp); | |
1448 | i += XFS_RTLOBIT(wdiff); | |
1449 | *rtblock = start + i - 1; | |
1450 | return 0; | |
1451 | } else | |
1452 | i = len; | |
1453 | } | |
1454 | /* | |
1455 | * No match, return that we scanned the whole area. | |
1456 | */ | |
1457 | xfs_trans_brelse(tp, bp); | |
1458 | *rtblock = start + i - 1; | |
1459 | return 0; | |
1460 | } | |
1461 | ||
1462 | /* | |
1463 | * Mark an extent specified by start and len freed. | |
1464 | * Updates all the summary information as well as the bitmap. | |
1465 | */ | |
1466 | STATIC int /* error */ | |
1467 | xfs_rtfree_range( | |
1468 | xfs_mount_t *mp, /* file system mount point */ | |
1469 | xfs_trans_t *tp, /* transaction pointer */ | |
1470 | xfs_rtblock_t start, /* starting block to free */ | |
1471 | xfs_extlen_t len, /* length to free */ | |
1472 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
1473 | xfs_fsblock_t *rsb) /* in/out: summary block number */ | |
1474 | { | |
1475 | xfs_rtblock_t end; /* end of the freed extent */ | |
1476 | int error; /* error value */ | |
1477 | xfs_rtblock_t postblock; /* first block freed > end */ | |
1478 | xfs_rtblock_t preblock; /* first block freed < start */ | |
1479 | ||
1480 | end = start + len - 1; | |
1481 | /* | |
1482 | * Modify the bitmap to mark this extent freed. | |
1483 | */ | |
1484 | error = xfs_rtmodify_range(mp, tp, start, len, 1); | |
1485 | if (error) { | |
1486 | return error; | |
1487 | } | |
1488 | /* | |
1489 | * Assume we're freeing out of the middle of an allocated extent. | |
1490 | * We need to find the beginning and end of the extent so we can | |
1491 | * properly update the summary. | |
1492 | */ | |
1493 | error = xfs_rtfind_back(mp, tp, start, 0, &preblock); | |
1494 | if (error) { | |
1495 | return error; | |
1496 | } | |
1497 | /* | |
1498 | * Find the next allocated block (end of allocated extent). | |
1499 | */ | |
1500 | error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1, | |
1501 | &postblock); | |
3daeb42c DC |
1502 | if (error) |
1503 | return error; | |
1da177e4 LT |
1504 | /* |
1505 | * If there are blocks not being freed at the front of the | |
1506 | * old extent, add summary data for them to be allocated. | |
1507 | */ | |
1508 | if (preblock < start) { | |
1509 | error = xfs_rtmodify_summary(mp, tp, | |
1510 | XFS_RTBLOCKLOG(start - preblock), | |
1511 | XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb); | |
1512 | if (error) { | |
1513 | return error; | |
1514 | } | |
1515 | } | |
1516 | /* | |
1517 | * If there are blocks not being freed at the end of the | |
1518 | * old extent, add summary data for them to be allocated. | |
1519 | */ | |
1520 | if (postblock > end) { | |
1521 | error = xfs_rtmodify_summary(mp, tp, | |
1522 | XFS_RTBLOCKLOG(postblock - end), | |
1523 | XFS_BITTOBLOCK(mp, end + 1), -1, rbpp, rsb); | |
1524 | if (error) { | |
1525 | return error; | |
1526 | } | |
1527 | } | |
1528 | /* | |
1529 | * Increment the summary information corresponding to the entire | |
1530 | * (new) free extent. | |
1531 | */ | |
1532 | error = xfs_rtmodify_summary(mp, tp, | |
1533 | XFS_RTBLOCKLOG(postblock + 1 - preblock), | |
1534 | XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb); | |
1535 | return error; | |
1536 | } | |
1537 | ||
1538 | /* | |
1539 | * Read and return the summary information for a given extent size, | |
1540 | * bitmap block combination. | |
1541 | * Keeps track of a current summary block, so we don't keep reading | |
1542 | * it from the buffer cache. | |
1543 | */ | |
1544 | STATIC int /* error */ | |
1545 | xfs_rtget_summary( | |
1546 | xfs_mount_t *mp, /* file system mount structure */ | |
1547 | xfs_trans_t *tp, /* transaction pointer */ | |
1548 | int log, /* log2 of extent size */ | |
1549 | xfs_rtblock_t bbno, /* bitmap block number */ | |
1550 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
1551 | xfs_fsblock_t *rsb, /* in/out: summary block number */ | |
1552 | xfs_suminfo_t *sum) /* out: summary info for this block */ | |
1553 | { | |
1554 | xfs_buf_t *bp; /* buffer for summary block */ | |
1555 | int error; /* error value */ | |
1556 | xfs_fsblock_t sb; /* summary fsblock */ | |
1557 | int so; /* index into the summary file */ | |
1558 | xfs_suminfo_t *sp; /* pointer to returned data */ | |
1559 | ||
1560 | /* | |
1561 | * Compute entry number in the summary file. | |
1562 | */ | |
1563 | so = XFS_SUMOFFS(mp, log, bbno); | |
1564 | /* | |
1565 | * Compute the block number in the summary file. | |
1566 | */ | |
1567 | sb = XFS_SUMOFFSTOBLOCK(mp, so); | |
1568 | /* | |
1569 | * If we have an old buffer, and the block number matches, use that. | |
1570 | */ | |
1571 | if (rbpp && *rbpp && *rsb == sb) | |
1572 | bp = *rbpp; | |
1573 | /* | |
1574 | * Otherwise we have to get the buffer. | |
1575 | */ | |
1576 | else { | |
1577 | /* | |
1578 | * If there was an old one, get rid of it first. | |
1579 | */ | |
1580 | if (rbpp && *rbpp) | |
1581 | xfs_trans_brelse(tp, *rbpp); | |
1582 | error = xfs_rtbuf_get(mp, tp, sb, 1, &bp); | |
1583 | if (error) { | |
1584 | return error; | |
1585 | } | |
1586 | /* | |
1587 | * Remember this buffer and block for the next call. | |
1588 | */ | |
1589 | if (rbpp) { | |
1590 | *rbpp = bp; | |
1591 | *rsb = sb; | |
1592 | } | |
1593 | } | |
1594 | /* | |
1595 | * Point to the summary information & copy it out. | |
1596 | */ | |
1597 | sp = XFS_SUMPTR(mp, bp, so); | |
1598 | *sum = *sp; | |
1599 | /* | |
1600 | * Drop the buffer if we're not asked to remember it. | |
1601 | */ | |
1602 | if (!rbpp) | |
1603 | xfs_trans_brelse(tp, bp); | |
1604 | return 0; | |
1605 | } | |
1606 | ||
1607 | /* | |
1608 | * Set the given range of bitmap bits to the given value. | |
1609 | * Do whatever I/O and logging is required. | |
1610 | */ | |
1611 | STATIC int /* error */ | |
1612 | xfs_rtmodify_range( | |
1613 | xfs_mount_t *mp, /* file system mount point */ | |
1614 | xfs_trans_t *tp, /* transaction pointer */ | |
1615 | xfs_rtblock_t start, /* starting block to modify */ | |
1616 | xfs_extlen_t len, /* length of extent to modify */ | |
1617 | int val) /* 1 for free, 0 for allocated */ | |
1618 | { | |
1619 | xfs_rtword_t *b; /* current word in buffer */ | |
1620 | int bit; /* bit number in the word */ | |
1621 | xfs_rtblock_t block; /* bitmap block number */ | |
1622 | xfs_buf_t *bp; /* buf for the block */ | |
1623 | xfs_rtword_t *bufp; /* starting word in buffer */ | |
1624 | int error; /* error value */ | |
1625 | xfs_rtword_t *first; /* first used word in the buffer */ | |
1626 | int i; /* current bit number rel. to start */ | |
1627 | int lastbit; /* last useful bit in word */ | |
1628 | xfs_rtword_t mask; /* mask o frelevant bits for value */ | |
1629 | int word; /* word number in the buffer */ | |
1630 | ||
1631 | /* | |
1632 | * Compute starting bitmap block number. | |
1633 | */ | |
1634 | block = XFS_BITTOBLOCK(mp, start); | |
1635 | /* | |
1636 | * Read the bitmap block, and point to its data. | |
1637 | */ | |
1638 | error = xfs_rtbuf_get(mp, tp, block, 0, &bp); | |
1639 | if (error) { | |
1640 | return error; | |
1641 | } | |
62926044 | 1642 | bufp = bp->b_addr; |
1da177e4 LT |
1643 | /* |
1644 | * Compute the starting word's address, and starting bit. | |
1645 | */ | |
1646 | word = XFS_BITTOWORD(mp, start); | |
1647 | first = b = &bufp[word]; | |
1648 | bit = (int)(start & (XFS_NBWORD - 1)); | |
1649 | /* | |
1650 | * 0 (allocated) => all zeroes; 1 (free) => all ones. | |
1651 | */ | |
1652 | val = -val; | |
1653 | /* | |
1654 | * If not starting on a word boundary, deal with the first | |
1655 | * (partial) word. | |
1656 | */ | |
1657 | if (bit) { | |
1658 | /* | |
1659 | * Compute first bit not changed and mask of relevant bits. | |
1660 | */ | |
1661 | lastbit = XFS_RTMIN(bit + len, XFS_NBWORD); | |
1662 | mask = (((xfs_rtword_t)1 << (lastbit - bit)) - 1) << bit; | |
1663 | /* | |
1664 | * Set/clear the active bits. | |
1665 | */ | |
1666 | if (val) | |
1667 | *b |= mask; | |
1668 | else | |
1669 | *b &= ~mask; | |
1670 | i = lastbit - bit; | |
1671 | /* | |
1672 | * Go on to the next block if that's where the next word is | |
1673 | * and we need the next word. | |
1674 | */ | |
1675 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
1676 | /* | |
1677 | * Log the changed part of this block. | |
1678 | * Get the next one. | |
1679 | */ | |
1680 | xfs_trans_log_buf(tp, bp, | |
1681 | (uint)((char *)first - (char *)bufp), | |
1682 | (uint)((char *)b - (char *)bufp)); | |
1683 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
1684 | if (error) { | |
1685 | return error; | |
1686 | } | |
62926044 | 1687 | first = b = bufp = bp->b_addr; |
1da177e4 LT |
1688 | word = 0; |
1689 | } else { | |
1690 | /* | |
1691 | * Go on to the next word in the buffer | |
1692 | */ | |
1693 | b++; | |
1694 | } | |
1695 | } else { | |
1696 | /* | |
1697 | * Starting on a word boundary, no partial word. | |
1698 | */ | |
1699 | i = 0; | |
1700 | } | |
1701 | /* | |
1702 | * Loop over whole words in buffers. When we use up one buffer | |
1703 | * we move on to the next one. | |
1704 | */ | |
1705 | while (len - i >= XFS_NBWORD) { | |
1706 | /* | |
1707 | * Set the word value correctly. | |
1708 | */ | |
1709 | *b = val; | |
1710 | i += XFS_NBWORD; | |
1711 | /* | |
1712 | * Go on to the next block if that's where the next word is | |
1713 | * and we need the next word. | |
1714 | */ | |
1715 | if (++word == XFS_BLOCKWSIZE(mp) && i < len) { | |
1716 | /* | |
1717 | * Log the changed part of this block. | |
1718 | * Get the next one. | |
1719 | */ | |
1720 | xfs_trans_log_buf(tp, bp, | |
1721 | (uint)((char *)first - (char *)bufp), | |
1722 | (uint)((char *)b - (char *)bufp)); | |
1723 | error = xfs_rtbuf_get(mp, tp, ++block, 0, &bp); | |
1724 | if (error) { | |
1725 | return error; | |
1726 | } | |
62926044 | 1727 | first = b = bufp = bp->b_addr; |
1da177e4 LT |
1728 | word = 0; |
1729 | } else { | |
1730 | /* | |
1731 | * Go on to the next word in the buffer | |
1732 | */ | |
1733 | b++; | |
1734 | } | |
1735 | } | |
1736 | /* | |
1737 | * If not ending on a word boundary, deal with the last | |
1738 | * (partial) word. | |
1739 | */ | |
1740 | if ((lastbit = len - i)) { | |
1741 | /* | |
1742 | * Compute a mask of relevant bits. | |
1743 | */ | |
1744 | bit = 0; | |
1745 | mask = ((xfs_rtword_t)1 << lastbit) - 1; | |
1746 | /* | |
1747 | * Set/clear the active bits. | |
1748 | */ | |
1749 | if (val) | |
1750 | *b |= mask; | |
1751 | else | |
1752 | *b &= ~mask; | |
1753 | b++; | |
1754 | } | |
1755 | /* | |
1756 | * Log any remaining changed bytes. | |
1757 | */ | |
1758 | if (b > first) | |
1759 | xfs_trans_log_buf(tp, bp, (uint)((char *)first - (char *)bufp), | |
1760 | (uint)((char *)b - (char *)bufp - 1)); | |
1761 | return 0; | |
1762 | } | |
1763 | ||
1764 | /* | |
1765 | * Read and modify the summary information for a given extent size, | |
1766 | * bitmap block combination. | |
1767 | * Keeps track of a current summary block, so we don't keep reading | |
1768 | * it from the buffer cache. | |
1769 | */ | |
1770 | STATIC int /* error */ | |
1771 | xfs_rtmodify_summary( | |
1772 | xfs_mount_t *mp, /* file system mount point */ | |
1773 | xfs_trans_t *tp, /* transaction pointer */ | |
1774 | int log, /* log2 of extent size */ | |
1775 | xfs_rtblock_t bbno, /* bitmap block number */ | |
1776 | int delta, /* change to make to summary info */ | |
1777 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ | |
1778 | xfs_fsblock_t *rsb) /* in/out: summary block number */ | |
1779 | { | |
1780 | xfs_buf_t *bp; /* buffer for the summary block */ | |
1781 | int error; /* error value */ | |
1782 | xfs_fsblock_t sb; /* summary fsblock */ | |
1783 | int so; /* index into the summary file */ | |
1784 | xfs_suminfo_t *sp; /* pointer to returned data */ | |
1785 | ||
1786 | /* | |
1787 | * Compute entry number in the summary file. | |
1788 | */ | |
1789 | so = XFS_SUMOFFS(mp, log, bbno); | |
1790 | /* | |
1791 | * Compute the block number in the summary file. | |
1792 | */ | |
1793 | sb = XFS_SUMOFFSTOBLOCK(mp, so); | |
1794 | /* | |
1795 | * If we have an old buffer, and the block number matches, use that. | |
1796 | */ | |
1797 | if (rbpp && *rbpp && *rsb == sb) | |
1798 | bp = *rbpp; | |
1799 | /* | |
1800 | * Otherwise we have to get the buffer. | |
1801 | */ | |
1802 | else { | |
1803 | /* | |
1804 | * If there was an old one, get rid of it first. | |
1805 | */ | |
1806 | if (rbpp && *rbpp) | |
1807 | xfs_trans_brelse(tp, *rbpp); | |
1808 | error = xfs_rtbuf_get(mp, tp, sb, 1, &bp); | |
1809 | if (error) { | |
1810 | return error; | |
1811 | } | |
1812 | /* | |
1813 | * Remember this buffer and block for the next call. | |
1814 | */ | |
1815 | if (rbpp) { | |
1816 | *rbpp = bp; | |
1817 | *rsb = sb; | |
1818 | } | |
1819 | } | |
1820 | /* | |
1821 | * Point to the summary information, modify and log it. | |
1822 | */ | |
1823 | sp = XFS_SUMPTR(mp, bp, so); | |
1824 | *sp += delta; | |
62926044 CS |
1825 | xfs_trans_log_buf(tp, bp, (uint)((char *)sp - (char *)bp->b_addr), |
1826 | (uint)((char *)sp - (char *)bp->b_addr + sizeof(*sp) - 1)); | |
1da177e4 LT |
1827 | return 0; |
1828 | } | |
1829 | ||
1830 | /* | |
1831 | * Visible (exported) functions. | |
1832 | */ | |
1833 | ||
1834 | /* | |
1835 | * Grow the realtime area of the filesystem. | |
1836 | */ | |
1837 | int | |
1838 | xfs_growfs_rt( | |
1839 | xfs_mount_t *mp, /* mount point for filesystem */ | |
1840 | xfs_growfs_rt_t *in) /* growfs rt input struct */ | |
1841 | { | |
1842 | xfs_rtblock_t bmbno; /* bitmap block number */ | |
1843 | xfs_buf_t *bp; /* temporary buffer */ | |
1da177e4 | 1844 | int error; /* error return value */ |
1da177e4 LT |
1845 | xfs_mount_t *nmp; /* new (fake) mount structure */ |
1846 | xfs_drfsbno_t nrblocks; /* new number of realtime blocks */ | |
1847 | xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */ | |
1848 | xfs_drtbno_t nrextents; /* new number of realtime extents */ | |
1849 | uint8_t nrextslog; /* new log2 of sb_rextents */ | |
1850 | xfs_extlen_t nrsumblocks; /* new number of summary blocks */ | |
1851 | uint nrsumlevels; /* new rt summary levels */ | |
1852 | uint nrsumsize; /* new size of rt summary, bytes */ | |
1853 | xfs_sb_t *nsbp; /* new superblock */ | |
1854 | xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */ | |
1855 | xfs_extlen_t rsumblocks; /* current number of rt summary blks */ | |
1856 | xfs_sb_t *sbp; /* old superblock */ | |
1857 | xfs_fsblock_t sumbno; /* summary block number */ | |
1da177e4 LT |
1858 | |
1859 | sbp = &mp->m_sb; | |
1860 | /* | |
1861 | * Initial error checking. | |
1862 | */ | |
743bb465 | 1863 | if (!capable(CAP_SYS_ADMIN)) |
1864 | return XFS_ERROR(EPERM); | |
73024cf1 | 1865 | if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL || |
1da177e4 LT |
1866 | (nrblocks = in->newblocks) <= sbp->sb_rblocks || |
1867 | (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize))) | |
1868 | return XFS_ERROR(EINVAL); | |
4cc929ee NS |
1869 | if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks))) |
1870 | return error; | |
1da177e4 LT |
1871 | /* |
1872 | * Read in the last block of the device, make sure it exists. | |
1873 | */ | |
1922c949 DC |
1874 | bp = xfs_buf_read_uncached(mp, mp->m_rtdev_targp, |
1875 | XFS_FSB_TO_BB(mp, nrblocks - 1), | |
1876 | XFS_FSB_TO_B(mp, 1), 0); | |
1877 | if (!bp) | |
1878 | return EIO; | |
1da177e4 | 1879 | xfs_buf_relse(bp); |
1922c949 | 1880 | |
1da177e4 LT |
1881 | /* |
1882 | * Calculate new parameters. These are the final values to be reached. | |
1883 | */ | |
1884 | nrextents = nrblocks; | |
1885 | do_div(nrextents, in->extsize); | |
68c32715 | 1886 | nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize); |
1da177e4 LT |
1887 | nrextslog = xfs_highbit32(nrextents); |
1888 | nrsumlevels = nrextslog + 1; | |
1889 | nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks; | |
1890 | nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); | |
1891 | nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); | |
1892 | /* | |
1893 | * New summary size can't be more than half the size of | |
1894 | * the log. This prevents us from getting a log overflow, | |
1895 | * since we'll log basically the whole summary file at once. | |
1896 | */ | |
1897 | if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1)) | |
1898 | return XFS_ERROR(EINVAL); | |
1899 | /* | |
1900 | * Get the old block counts for bitmap and summary inodes. | |
1901 | * These can't change since other growfs callers are locked out. | |
1902 | */ | |
1903 | rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size); | |
1904 | rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size); | |
1905 | /* | |
1906 | * Allocate space to the bitmap and summary files, as necessary. | |
1907 | */ | |
1050c71e CH |
1908 | error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip); |
1909 | if (error) | |
1da177e4 | 1910 | return error; |
1050c71e CH |
1911 | error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip); |
1912 | if (error) | |
1da177e4 | 1913 | return error; |
d432c80e NS |
1914 | /* |
1915 | * Allocate a new (fake) mount/sb. | |
1916 | */ | |
1917 | nmp = kmem_alloc(sizeof(*nmp), KM_SLEEP); | |
1da177e4 LT |
1918 | /* |
1919 | * Loop over the bitmap blocks. | |
1920 | * We will do everything one bitmap block at a time. | |
1921 | * Skip the current block if it is exactly full. | |
1922 | * This also deals with the case where there were no rtextents before. | |
1923 | */ | |
1924 | for (bmbno = sbp->sb_rbmblocks - | |
1925 | ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0); | |
1926 | bmbno < nrbmblocks; | |
1927 | bmbno++) { | |
0924b585 DC |
1928 | xfs_trans_t *tp; |
1929 | int cancelflags = 0; | |
1930 | ||
1da177e4 LT |
1931 | *nmp = *mp; |
1932 | nsbp = &nmp->m_sb; | |
1933 | /* | |
1934 | * Calculate new sb and mount fields for this round. | |
1935 | */ | |
1936 | nsbp->sb_rextsize = in->extsize; | |
1937 | nsbp->sb_rbmblocks = bmbno + 1; | |
1938 | nsbp->sb_rblocks = | |
1939 | XFS_RTMIN(nrblocks, | |
1940 | nsbp->sb_rbmblocks * NBBY * | |
1941 | nsbp->sb_blocksize * nsbp->sb_rextsize); | |
1942 | nsbp->sb_rextents = nsbp->sb_rblocks; | |
1943 | do_div(nsbp->sb_rextents, nsbp->sb_rextsize); | |
79071eb0 | 1944 | ASSERT(nsbp->sb_rextents != 0); |
1da177e4 LT |
1945 | nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents); |
1946 | nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1; | |
1947 | nrsumsize = | |
1948 | (uint)sizeof(xfs_suminfo_t) * nrsumlevels * | |
1949 | nsbp->sb_rbmblocks; | |
1950 | nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); | |
1951 | nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); | |
1952 | /* | |
1953 | * Start a transaction, get the log reservation. | |
1954 | */ | |
1955 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_FREE); | |
1da177e4 LT |
1956 | if ((error = xfs_trans_reserve(tp, 0, |
1957 | XFS_GROWRTFREE_LOG_RES(nmp), 0, 0, 0))) | |
0924b585 | 1958 | goto error_cancel; |
1da177e4 LT |
1959 | /* |
1960 | * Lock out other callers by grabbing the bitmap inode lock. | |
1961 | */ | |
1050c71e | 1962 | xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL); |
ddc3415a | 1963 | xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); |
1da177e4 LT |
1964 | /* |
1965 | * Update the bitmap inode's size. | |
1966 | */ | |
1967 | mp->m_rbmip->i_d.di_size = | |
1968 | nsbp->sb_rbmblocks * nsbp->sb_blocksize; | |
1969 | xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); | |
1970 | cancelflags |= XFS_TRANS_ABORT; | |
1971 | /* | |
1972 | * Get the summary inode into the transaction. | |
1973 | */ | |
1050c71e | 1974 | xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL); |
ddc3415a | 1975 | xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL); |
1da177e4 LT |
1976 | /* |
1977 | * Update the summary inode's size. | |
1978 | */ | |
1979 | mp->m_rsumip->i_d.di_size = nmp->m_rsumsize; | |
1980 | xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE); | |
1981 | /* | |
1982 | * Copy summary data from old to new sizes. | |
1983 | * Do this when the real size (not block-aligned) changes. | |
1984 | */ | |
1985 | if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks || | |
1986 | mp->m_rsumlevels != nmp->m_rsumlevels) { | |
1987 | error = xfs_rtcopy_summary(mp, nmp, tp); | |
1988 | if (error) | |
0924b585 | 1989 | goto error_cancel; |
1da177e4 LT |
1990 | } |
1991 | /* | |
1992 | * Update superblock fields. | |
1993 | */ | |
1994 | if (nsbp->sb_rextsize != sbp->sb_rextsize) | |
1995 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE, | |
1996 | nsbp->sb_rextsize - sbp->sb_rextsize); | |
1997 | if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks) | |
1998 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS, | |
1999 | nsbp->sb_rbmblocks - sbp->sb_rbmblocks); | |
2000 | if (nsbp->sb_rblocks != sbp->sb_rblocks) | |
2001 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS, | |
2002 | nsbp->sb_rblocks - sbp->sb_rblocks); | |
2003 | if (nsbp->sb_rextents != sbp->sb_rextents) | |
2004 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS, | |
2005 | nsbp->sb_rextents - sbp->sb_rextents); | |
2006 | if (nsbp->sb_rextslog != sbp->sb_rextslog) | |
2007 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG, | |
2008 | nsbp->sb_rextslog - sbp->sb_rextslog); | |
2009 | /* | |
2010 | * Free new extent. | |
2011 | */ | |
2012 | bp = NULL; | |
2013 | error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents, | |
2014 | nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno); | |
0924b585 DC |
2015 | if (error) { |
2016 | error_cancel: | |
2017 | xfs_trans_cancel(tp, cancelflags); | |
d432c80e | 2018 | break; |
0924b585 | 2019 | } |
1da177e4 LT |
2020 | /* |
2021 | * Mark more blocks free in the superblock. | |
2022 | */ | |
2023 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, | |
2024 | nsbp->sb_rextents - sbp->sb_rextents); | |
1da177e4 LT |
2025 | /* |
2026 | * Update mp values into the real mp structure. | |
2027 | */ | |
2028 | mp->m_rsumlevels = nrsumlevels; | |
2029 | mp->m_rsumsize = nrsumsize; | |
e5720eec DC |
2030 | |
2031 | error = xfs_trans_commit(tp, 0); | |
0924b585 | 2032 | if (error) |
e5720eec | 2033 | break; |
1da177e4 | 2034 | } |
d432c80e | 2035 | |
1da177e4 | 2036 | /* |
d432c80e | 2037 | * Free the fake mp structure. |
1da177e4 | 2038 | */ |
f0e2d93c | 2039 | kmem_free(nmp); |
d432c80e | 2040 | |
1da177e4 LT |
2041 | return error; |
2042 | } | |
2043 | ||
2044 | /* | |
2045 | * Allocate an extent in the realtime subvolume, with the usual allocation | |
2046 | * parameters. The length units are all in realtime extents, as is the | |
2047 | * result block number. | |
2048 | */ | |
2049 | int /* error */ | |
2050 | xfs_rtallocate_extent( | |
2051 | xfs_trans_t *tp, /* transaction pointer */ | |
2052 | xfs_rtblock_t bno, /* starting block number to allocate */ | |
2053 | xfs_extlen_t minlen, /* minimum length to allocate */ | |
2054 | xfs_extlen_t maxlen, /* maximum length to allocate */ | |
2055 | xfs_extlen_t *len, /* out: actual length allocated */ | |
2056 | xfs_alloctype_t type, /* allocation type XFS_ALLOCTYPE... */ | |
2057 | int wasdel, /* was a delayed allocation extent */ | |
2058 | xfs_extlen_t prod, /* extent product factor */ | |
2059 | xfs_rtblock_t *rtblock) /* out: start block allocated */ | |
2060 | { | |
04e99455 | 2061 | xfs_mount_t *mp = tp->t_mountp; |
1da177e4 | 2062 | int error; /* error value */ |
1da177e4 LT |
2063 | xfs_rtblock_t r; /* result allocated block */ |
2064 | xfs_fsblock_t sb; /* summary file block number */ | |
2065 | xfs_buf_t *sumbp; /* summary file block buffer */ | |
2066 | ||
04e99455 | 2067 | ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); |
1da177e4 | 2068 | ASSERT(minlen > 0 && minlen <= maxlen); |
04e99455 | 2069 | |
1da177e4 LT |
2070 | /* |
2071 | * If prod is set then figure out what to do to minlen and maxlen. | |
2072 | */ | |
2073 | if (prod > 1) { | |
2074 | xfs_extlen_t i; | |
2075 | ||
2076 | if ((i = maxlen % prod)) | |
2077 | maxlen -= i; | |
2078 | if ((i = minlen % prod)) | |
2079 | minlen += prod - i; | |
2080 | if (maxlen < minlen) { | |
2081 | *rtblock = NULLRTBLOCK; | |
2082 | return 0; | |
2083 | } | |
2084 | } | |
04e99455 | 2085 | |
1da177e4 LT |
2086 | sumbp = NULL; |
2087 | /* | |
2088 | * Allocate by size, or near another block, or exactly at some block. | |
2089 | */ | |
2090 | switch (type) { | |
2091 | case XFS_ALLOCTYPE_ANY_AG: | |
2092 | error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len, | |
2093 | &sumbp, &sb, prod, &r); | |
2094 | break; | |
2095 | case XFS_ALLOCTYPE_NEAR_BNO: | |
2096 | error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen, | |
2097 | len, &sumbp, &sb, prod, &r); | |
2098 | break; | |
2099 | case XFS_ALLOCTYPE_THIS_BNO: | |
2100 | error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, | |
2101 | len, &sumbp, &sb, prod, &r); | |
2102 | break; | |
2103 | default: | |
04e99455 | 2104 | error = EIO; |
1da177e4 LT |
2105 | ASSERT(0); |
2106 | } | |
04e99455 | 2107 | if (error) |
1da177e4 | 2108 | return error; |
04e99455 | 2109 | |
1da177e4 LT |
2110 | /* |
2111 | * If it worked, update the superblock. | |
2112 | */ | |
2113 | if (r != NULLRTBLOCK) { | |
2114 | long slen = (long)*len; | |
2115 | ||
2116 | ASSERT(*len >= minlen && *len <= maxlen); | |
2117 | if (wasdel) | |
2118 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen); | |
2119 | else | |
2120 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen); | |
2121 | } | |
2122 | *rtblock = r; | |
2123 | return 0; | |
2124 | } | |
2125 | ||
2126 | /* | |
2127 | * Free an extent in the realtime subvolume. Length is expressed in | |
2128 | * realtime extents, as is the block number. | |
2129 | */ | |
2130 | int /* error */ | |
2131 | xfs_rtfree_extent( | |
2132 | xfs_trans_t *tp, /* transaction pointer */ | |
2133 | xfs_rtblock_t bno, /* starting block number to free */ | |
2134 | xfs_extlen_t len) /* length of extent freed */ | |
2135 | { | |
2136 | int error; /* error value */ | |
1da177e4 LT |
2137 | xfs_mount_t *mp; /* file system mount structure */ |
2138 | xfs_fsblock_t sb; /* summary file block number */ | |
2139 | xfs_buf_t *sumbp; /* summary file block buffer */ | |
2140 | ||
2141 | mp = tp->t_mountp; | |
2142 | /* | |
2143 | * Synchronize by locking the bitmap inode. | |
2144 | */ | |
1050c71e | 2145 | xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL); |
ddc3415a | 2146 | xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); |
1050c71e | 2147 | |
1da177e4 LT |
2148 | #if defined(__KERNEL__) && defined(DEBUG) |
2149 | /* | |
2150 | * Check to see that this whole range is currently allocated. | |
2151 | */ | |
2152 | { | |
2153 | int stat; /* result from checking range */ | |
2154 | ||
2155 | error = xfs_rtcheck_alloc_range(mp, tp, bno, len, &stat); | |
2156 | if (error) { | |
2157 | return error; | |
2158 | } | |
2159 | ASSERT(stat); | |
2160 | } | |
2161 | #endif | |
2162 | sumbp = NULL; | |
2163 | /* | |
2164 | * Free the range of realtime blocks. | |
2165 | */ | |
2166 | error = xfs_rtfree_range(mp, tp, bno, len, &sumbp, &sb); | |
2167 | if (error) { | |
2168 | return error; | |
2169 | } | |
2170 | /* | |
2171 | * Mark more blocks free in the superblock. | |
2172 | */ | |
2173 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, (long)len); | |
2174 | /* | |
2175 | * If we've now freed all the blocks, reset the file sequence | |
2176 | * number to 0. | |
2177 | */ | |
2178 | if (tp->t_frextents_delta + mp->m_sb.sb_frextents == | |
2179 | mp->m_sb.sb_rextents) { | |
1050c71e CH |
2180 | if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) |
2181 | mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM; | |
2182 | *(__uint64_t *)&mp->m_rbmip->i_d.di_atime = 0; | |
2183 | xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); | |
1da177e4 LT |
2184 | } |
2185 | return 0; | |
2186 | } | |
2187 | ||
2188 | /* | |
2189 | * Initialize realtime fields in the mount structure. | |
2190 | */ | |
2191 | int /* error */ | |
2192 | xfs_rtmount_init( | |
2193 | xfs_mount_t *mp) /* file system mount structure */ | |
2194 | { | |
2195 | xfs_buf_t *bp; /* buffer for last block of subvolume */ | |
2196 | xfs_daddr_t d; /* address of last block of subvolume */ | |
1da177e4 LT |
2197 | xfs_sb_t *sbp; /* filesystem superblock copy in mount */ |
2198 | ||
2199 | sbp = &mp->m_sb; | |
2200 | if (sbp->sb_rblocks == 0) | |
2201 | return 0; | |
2202 | if (mp->m_rtdev_targp == NULL) { | |
0b932ccc DC |
2203 | xfs_warn(mp, |
2204 | "Filesystem has a realtime volume, use rtdev=device option"); | |
1da177e4 LT |
2205 | return XFS_ERROR(ENODEV); |
2206 | } | |
2207 | mp->m_rsumlevels = sbp->sb_rextslog + 1; | |
2208 | mp->m_rsumsize = | |
2209 | (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels * | |
2210 | sbp->sb_rbmblocks; | |
2211 | mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize); | |
2212 | mp->m_rbmip = mp->m_rsumip = NULL; | |
2213 | /* | |
2214 | * Check that the realtime section is an ok size. | |
2215 | */ | |
2216 | d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks); | |
2217 | if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) { | |
0b932ccc | 2218 | xfs_warn(mp, "realtime mount -- %llu != %llu", |
1da177e4 LT |
2219 | (unsigned long long) XFS_BB_TO_FSB(mp, d), |
2220 | (unsigned long long) mp->m_sb.sb_rblocks); | |
657a4cff | 2221 | return XFS_ERROR(EFBIG); |
1da177e4 | 2222 | } |
1922c949 DC |
2223 | bp = xfs_buf_read_uncached(mp, mp->m_rtdev_targp, |
2224 | d - XFS_FSB_TO_BB(mp, 1), | |
2225 | XFS_FSB_TO_B(mp, 1), 0); | |
2226 | if (!bp) { | |
0b932ccc | 2227 | xfs_warn(mp, "realtime device size check failed"); |
1922c949 | 2228 | return EIO; |
1da177e4 LT |
2229 | } |
2230 | xfs_buf_relse(bp); | |
2231 | return 0; | |
2232 | } | |
2233 | ||
2234 | /* | |
2235 | * Get the bitmap and summary inodes into the mount structure | |
2236 | * at mount time. | |
2237 | */ | |
2238 | int /* error */ | |
2239 | xfs_rtmount_inodes( | |
2240 | xfs_mount_t *mp) /* file system mount structure */ | |
2241 | { | |
2242 | int error; /* error return value */ | |
2243 | xfs_sb_t *sbp; | |
2244 | ||
2245 | sbp = &mp->m_sb; | |
2246 | if (sbp->sb_rbmino == NULLFSINO) | |
2247 | return 0; | |
7b6259e7 | 2248 | error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip); |
1da177e4 LT |
2249 | if (error) |
2250 | return error; | |
2251 | ASSERT(mp->m_rbmip != NULL); | |
2252 | ASSERT(sbp->sb_rsumino != NULLFSINO); | |
7b6259e7 | 2253 | error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip); |
1da177e4 | 2254 | if (error) { |
43355099 | 2255 | IRELE(mp->m_rbmip); |
1da177e4 LT |
2256 | return error; |
2257 | } | |
2258 | ASSERT(mp->m_rsumip != NULL); | |
2259 | return 0; | |
2260 | } | |
2261 | ||
b93b6e43 CH |
2262 | void |
2263 | xfs_rtunmount_inodes( | |
2264 | struct xfs_mount *mp) | |
2265 | { | |
2266 | if (mp->m_rbmip) | |
2267 | IRELE(mp->m_rbmip); | |
2268 | if (mp->m_rsumip) | |
2269 | IRELE(mp->m_rsumip); | |
2270 | } | |
2271 | ||
1da177e4 LT |
2272 | /* |
2273 | * Pick an extent for allocation at the start of a new realtime file. | |
2274 | * Use the sequence number stored in the atime field of the bitmap inode. | |
2275 | * Translate this to a fraction of the rtextents, and return the product | |
2276 | * of rtextents and the fraction. | |
2277 | * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ... | |
2278 | */ | |
2279 | int /* error */ | |
2280 | xfs_rtpick_extent( | |
2281 | xfs_mount_t *mp, /* file system mount point */ | |
2282 | xfs_trans_t *tp, /* transaction pointer */ | |
2283 | xfs_extlen_t len, /* allocation length (rtextents) */ | |
2284 | xfs_rtblock_t *pick) /* result rt extent */ | |
2285 | { | |
2286 | xfs_rtblock_t b; /* result block */ | |
1da177e4 LT |
2287 | int log2; /* log of sequence number */ |
2288 | __uint64_t resid; /* residual after log removed */ | |
2289 | __uint64_t seq; /* sequence number of file creation */ | |
2290 | __uint64_t *seqp; /* pointer to seqno in inode */ | |
2291 | ||
04e99455 CH |
2292 | ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); |
2293 | ||
2294 | seqp = (__uint64_t *)&mp->m_rbmip->i_d.di_atime; | |
2295 | if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) { | |
2296 | mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM; | |
1da177e4 LT |
2297 | *seqp = 0; |
2298 | } | |
2299 | seq = *seqp; | |
2300 | if ((log2 = xfs_highbit64(seq)) == -1) | |
2301 | b = 0; | |
2302 | else { | |
2303 | resid = seq - (1ULL << log2); | |
2304 | b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >> | |
2305 | (log2 + 1); | |
2306 | if (b >= mp->m_sb.sb_rextents) | |
2307 | b = do_mod(b, mp->m_sb.sb_rextents); | |
2308 | if (b + len > mp->m_sb.sb_rextents) | |
2309 | b = mp->m_sb.sb_rextents - len; | |
2310 | } | |
2311 | *seqp = seq + 1; | |
04e99455 | 2312 | xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); |
1da177e4 LT |
2313 | *pick = b; |
2314 | return 0; | |
2315 | } |