Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 2 | * Copyright (c) 2000-2005 Silicon Graphics, Inc. |
| 3 | * All Rights Reserved. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 4 | * |
Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 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 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 7 | * published by the Free Software Foundation. |
| 8 | * |
Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 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. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 13 | * |
Nathan Scott | 7b71876 | 2005-11-02 14:58:39 +1100 | [diff] [blame] | 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 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 17 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 18 | #include "xfs.h" |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 19 | #include "xfs_fs.h" |
Dave Chinner | 70a9883c | 2013-10-23 10:36:05 +1100 | [diff] [blame] | 20 | #include "xfs_shared.h" |
Dave Chinner | 239880e | 2013-10-23 10:50:10 +1100 | [diff] [blame] | 21 | #include "xfs_format.h" |
| 22 | #include "xfs_log_format.h" |
| 23 | #include "xfs_trans_resv.h" |
Nathan Scott | a844f45 | 2005-11-02 14:38:42 +1100 | [diff] [blame] | 24 | #include "xfs_bit.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | #include "xfs_sb.h" |
| 26 | #include "xfs_ag.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 27 | #include "xfs_mount.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 28 | #include "xfs_inode.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 29 | #include "xfs_bmap.h" |
Dave Chinner | 6898811 | 2013-08-12 20:49:42 +1000 | [diff] [blame] | 30 | #include "xfs_bmap_util.h" |
Dave Chinner | a4fbe6a | 2013-10-23 10:51:50 +1100 | [diff] [blame] | 31 | #include "xfs_bmap_btree.h" |
| 32 | #include "xfs_alloc.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 33 | #include "xfs_error.h" |
Dave Chinner | 239880e | 2013-10-23 10:50:10 +1100 | [diff] [blame] | 34 | #include "xfs_trans.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 35 | #include "xfs_trans_space.h" |
Christoph Hellwig | 0b1b213 | 2009-12-14 23:14:59 +0000 | [diff] [blame] | 36 | #include "xfs_trace.h" |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 37 | #include "xfs_buf.h" |
Dave Chinner | 33479e0 | 2012-10-08 21:56:11 +1100 | [diff] [blame] | 38 | #include "xfs_icache.h" |
Dave Chinner | a4fbe6a | 2013-10-23 10:51:50 +1100 | [diff] [blame] | 39 | #include "xfs_dinode.h" |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 40 | #include "xfs_rtalloc.h" |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 41 | |
| 42 | |
| 43 | /* |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 44 | * Read and return the summary information for a given extent size, |
| 45 | * bitmap block combination. |
| 46 | * Keeps track of a current summary block, so we don't keep reading |
| 47 | * it from the buffer cache. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 48 | */ |
| 49 | STATIC int /* error */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 50 | xfs_rtget_summary( |
| 51 | xfs_mount_t *mp, /* file system mount structure */ |
| 52 | xfs_trans_t *tp, /* transaction pointer */ |
| 53 | int log, /* log2 of extent size */ |
| 54 | xfs_rtblock_t bbno, /* bitmap block number */ |
| 55 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 56 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 57 | xfs_suminfo_t *sum) /* out: summary info for this block */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 58 | { |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 59 | xfs_buf_t *bp; /* buffer for summary block */ |
| 60 | int error; /* error value */ |
| 61 | xfs_fsblock_t sb; /* summary fsblock */ |
| 62 | int so; /* index into the summary file */ |
| 63 | xfs_suminfo_t *sp; /* pointer to returned data */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 64 | |
| 65 | /* |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 66 | * Compute entry number in the summary file. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 67 | */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 68 | so = XFS_SUMOFFS(mp, log, bbno); |
| 69 | /* |
| 70 | * Compute the block number in the summary file. |
| 71 | */ |
| 72 | sb = XFS_SUMOFFSTOBLOCK(mp, so); |
| 73 | /* |
| 74 | * If we have an old buffer, and the block number matches, use that. |
| 75 | */ |
| 76 | if (rbpp && *rbpp && *rsb == sb) |
| 77 | bp = *rbpp; |
| 78 | /* |
| 79 | * Otherwise we have to get the buffer. |
| 80 | */ |
| 81 | else { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 82 | /* |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 83 | * If there was an old one, get rid of it first. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 84 | */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 85 | if (rbpp && *rbpp) |
| 86 | xfs_trans_brelse(tp, *rbpp); |
| 87 | error = xfs_rtbuf_get(mp, tp, sb, 1, &bp); |
| 88 | if (error) { |
| 89 | return error; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 90 | } |
| 91 | /* |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 92 | * Remember this buffer and block for the next call. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 93 | */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 94 | if (rbpp) { |
| 95 | *rbpp = bp; |
| 96 | *rsb = sb; |
| 97 | } |
| 98 | } |
| 99 | /* |
| 100 | * Point to the summary information & copy it out. |
| 101 | */ |
| 102 | sp = XFS_SUMPTR(mp, bp, so); |
| 103 | *sum = *sp; |
| 104 | /* |
| 105 | * Drop the buffer if we're not asked to remember it. |
| 106 | */ |
| 107 | if (!rbpp) |
| 108 | xfs_trans_brelse(tp, bp); |
| 109 | return 0; |
| 110 | } |
| 111 | |
| 112 | |
| 113 | /* |
| 114 | * Return whether there are any free extents in the size range given |
| 115 | * by low and high, for the bitmap block bbno. |
| 116 | */ |
| 117 | STATIC int /* error */ |
| 118 | xfs_rtany_summary( |
| 119 | xfs_mount_t *mp, /* file system mount structure */ |
| 120 | xfs_trans_t *tp, /* transaction pointer */ |
| 121 | int low, /* low log2 extent size */ |
| 122 | int high, /* high log2 extent size */ |
| 123 | xfs_rtblock_t bbno, /* bitmap block number */ |
| 124 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 125 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 126 | int *stat) /* out: any good extents here? */ |
| 127 | { |
| 128 | int error; /* error value */ |
| 129 | int log; /* loop counter, log2 of ext. size */ |
| 130 | xfs_suminfo_t sum; /* summary data */ |
| 131 | |
| 132 | /* |
| 133 | * Loop over logs of extent sizes. Order is irrelevant. |
| 134 | */ |
| 135 | for (log = low; log <= high; log++) { |
| 136 | /* |
| 137 | * Get one summary datum. |
| 138 | */ |
| 139 | error = xfs_rtget_summary(mp, tp, log, bbno, rbpp, rsb, &sum); |
| 140 | if (error) { |
| 141 | return error; |
| 142 | } |
| 143 | /* |
| 144 | * If there are any, return success. |
| 145 | */ |
| 146 | if (sum) { |
| 147 | *stat = 1; |
| 148 | return 0; |
| 149 | } |
| 150 | } |
| 151 | /* |
| 152 | * Found nothing, return failure. |
| 153 | */ |
| 154 | *stat = 0; |
| 155 | return 0; |
| 156 | } |
| 157 | |
| 158 | |
| 159 | /* |
| 160 | * Copy and transform the summary file, given the old and new |
| 161 | * parameters in the mount structures. |
| 162 | */ |
| 163 | STATIC int /* error */ |
| 164 | xfs_rtcopy_summary( |
| 165 | xfs_mount_t *omp, /* old file system mount point */ |
| 166 | xfs_mount_t *nmp, /* new file system mount point */ |
| 167 | xfs_trans_t *tp) /* transaction pointer */ |
| 168 | { |
| 169 | xfs_rtblock_t bbno; /* bitmap block number */ |
| 170 | xfs_buf_t *bp; /* summary buffer */ |
| 171 | int error; /* error return value */ |
| 172 | int log; /* summary level number (log length) */ |
| 173 | xfs_suminfo_t sum; /* summary data */ |
| 174 | xfs_fsblock_t sumbno; /* summary block number */ |
| 175 | |
| 176 | bp = NULL; |
| 177 | for (log = omp->m_rsumlevels - 1; log >= 0; log--) { |
| 178 | for (bbno = omp->m_sb.sb_rbmblocks - 1; |
| 179 | (xfs_srtblock_t)bbno >= 0; |
| 180 | bbno--) { |
| 181 | error = xfs_rtget_summary(omp, tp, log, bbno, &bp, |
| 182 | &sumbno, &sum); |
| 183 | if (error) |
| 184 | return error; |
| 185 | if (sum == 0) |
| 186 | continue; |
| 187 | error = xfs_rtmodify_summary(omp, tp, log, bbno, -sum, |
| 188 | &bp, &sumbno); |
| 189 | if (error) |
| 190 | return error; |
| 191 | error = xfs_rtmodify_summary(nmp, tp, log, bbno, sum, |
| 192 | &bp, &sumbno); |
| 193 | if (error) |
| 194 | return error; |
| 195 | ASSERT(sum > 0); |
| 196 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 197 | } |
| 198 | return 0; |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 199 | } |
| 200 | /* |
| 201 | * Mark an extent specified by start and len allocated. |
| 202 | * Updates all the summary information as well as the bitmap. |
| 203 | */ |
| 204 | STATIC int /* error */ |
| 205 | xfs_rtallocate_range( |
| 206 | xfs_mount_t *mp, /* file system mount point */ |
| 207 | xfs_trans_t *tp, /* transaction pointer */ |
| 208 | xfs_rtblock_t start, /* start block to allocate */ |
| 209 | xfs_extlen_t len, /* length to allocate */ |
| 210 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 211 | xfs_fsblock_t *rsb) /* in/out: summary block number */ |
| 212 | { |
| 213 | xfs_rtblock_t end; /* end of the allocated extent */ |
| 214 | int error; /* error value */ |
| 215 | xfs_rtblock_t postblock = 0; /* first block allocated > end */ |
| 216 | xfs_rtblock_t preblock = 0; /* first block allocated < start */ |
Kamal Dasu | 5575acc | 2012-02-23 00:41:39 +0000 | [diff] [blame] | 217 | |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 218 | end = start + len - 1; |
| 219 | /* |
| 220 | * Assume we're allocating out of the middle of a free extent. |
| 221 | * We need to find the beginning and end of the extent so we can |
| 222 | * properly update the summary. |
| 223 | */ |
| 224 | error = xfs_rtfind_back(mp, tp, start, 0, &preblock); |
| 225 | if (error) { |
| 226 | return error; |
| 227 | } |
| 228 | /* |
| 229 | * Find the next allocated block (end of free extent). |
| 230 | */ |
| 231 | error = xfs_rtfind_forw(mp, tp, end, mp->m_sb.sb_rextents - 1, |
| 232 | &postblock); |
| 233 | if (error) { |
| 234 | return error; |
| 235 | } |
| 236 | /* |
| 237 | * Decrement the summary information corresponding to the entire |
| 238 | * (old) free extent. |
| 239 | */ |
| 240 | error = xfs_rtmodify_summary(mp, tp, |
| 241 | XFS_RTBLOCKLOG(postblock + 1 - preblock), |
| 242 | XFS_BITTOBLOCK(mp, preblock), -1, rbpp, rsb); |
| 243 | if (error) { |
| 244 | return error; |
| 245 | } |
| 246 | /* |
| 247 | * If there are blocks not being allocated at the front of the |
| 248 | * old extent, add summary data for them to be free. |
| 249 | */ |
| 250 | if (preblock < start) { |
| 251 | error = xfs_rtmodify_summary(mp, tp, |
| 252 | XFS_RTBLOCKLOG(start - preblock), |
| 253 | XFS_BITTOBLOCK(mp, preblock), 1, rbpp, rsb); |
| 254 | if (error) { |
| 255 | return error; |
| 256 | } |
| 257 | } |
| 258 | /* |
| 259 | * If there are blocks not being allocated at the end of the |
| 260 | * old extent, add summary data for them to be free. |
| 261 | */ |
| 262 | if (postblock > end) { |
| 263 | error = xfs_rtmodify_summary(mp, tp, |
| 264 | XFS_RTBLOCKLOG(postblock - end), |
| 265 | XFS_BITTOBLOCK(mp, end + 1), 1, rbpp, rsb); |
| 266 | if (error) { |
| 267 | return error; |
| 268 | } |
| 269 | } |
| 270 | /* |
| 271 | * Modify the bitmap to mark this extent allocated. |
| 272 | */ |
| 273 | error = xfs_rtmodify_range(mp, tp, start, len, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 274 | return error; |
| 275 | } |
| 276 | |
| 277 | /* |
| 278 | * Attempt to allocate an extent minlen<=len<=maxlen starting from |
| 279 | * bitmap block bbno. If we don't get maxlen then use prod to trim |
| 280 | * the length, if given. Returns error; returns starting block in *rtblock. |
| 281 | * The lengths are all in rtextents. |
| 282 | */ |
| 283 | STATIC int /* error */ |
| 284 | xfs_rtallocate_extent_block( |
| 285 | xfs_mount_t *mp, /* file system mount point */ |
| 286 | xfs_trans_t *tp, /* transaction pointer */ |
| 287 | xfs_rtblock_t bbno, /* bitmap block number */ |
| 288 | xfs_extlen_t minlen, /* minimum length to allocate */ |
| 289 | xfs_extlen_t maxlen, /* maximum length to allocate */ |
| 290 | xfs_extlen_t *len, /* out: actual length allocated */ |
| 291 | xfs_rtblock_t *nextp, /* out: next block to try */ |
| 292 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 293 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 294 | xfs_extlen_t prod, /* extent product factor */ |
| 295 | xfs_rtblock_t *rtblock) /* out: start block allocated */ |
| 296 | { |
| 297 | xfs_rtblock_t besti; /* best rtblock found so far */ |
| 298 | xfs_rtblock_t bestlen; /* best length found so far */ |
| 299 | xfs_rtblock_t end; /* last rtblock in chunk */ |
| 300 | int error; /* error value */ |
| 301 | xfs_rtblock_t i; /* current rtblock trying */ |
| 302 | xfs_rtblock_t next; /* next rtblock to try */ |
| 303 | int stat; /* status from internal calls */ |
| 304 | |
| 305 | /* |
| 306 | * Loop over all the extents starting in this bitmap block, |
| 307 | * looking for one that's long enough. |
| 308 | */ |
| 309 | for (i = XFS_BLOCKTOBIT(mp, bbno), besti = -1, bestlen = 0, |
| 310 | end = XFS_BLOCKTOBIT(mp, bbno + 1) - 1; |
| 311 | i <= end; |
| 312 | i++) { |
| 313 | /* |
| 314 | * See if there's a free extent of maxlen starting at i. |
| 315 | * If it's not so then next will contain the first non-free. |
| 316 | */ |
| 317 | error = xfs_rtcheck_range(mp, tp, i, maxlen, 1, &next, &stat); |
| 318 | if (error) { |
| 319 | return error; |
| 320 | } |
| 321 | if (stat) { |
| 322 | /* |
| 323 | * i for maxlen is all free, allocate and return that. |
| 324 | */ |
| 325 | error = xfs_rtallocate_range(mp, tp, i, maxlen, rbpp, |
| 326 | rsb); |
| 327 | if (error) { |
| 328 | return error; |
| 329 | } |
| 330 | *len = maxlen; |
| 331 | *rtblock = i; |
| 332 | return 0; |
| 333 | } |
| 334 | /* |
| 335 | * In the case where we have a variable-sized allocation |
| 336 | * request, figure out how big this free piece is, |
| 337 | * and if it's big enough for the minimum, and the best |
| 338 | * so far, remember it. |
| 339 | */ |
| 340 | if (minlen < maxlen) { |
| 341 | xfs_rtblock_t thislen; /* this extent size */ |
| 342 | |
| 343 | thislen = next - i; |
| 344 | if (thislen >= minlen && thislen > bestlen) { |
| 345 | besti = i; |
| 346 | bestlen = thislen; |
| 347 | } |
| 348 | } |
| 349 | /* |
| 350 | * If not done yet, find the start of the next free space. |
| 351 | */ |
| 352 | if (next < end) { |
| 353 | error = xfs_rtfind_forw(mp, tp, next, end, &i); |
| 354 | if (error) { |
| 355 | return error; |
| 356 | } |
| 357 | } else |
| 358 | break; |
| 359 | } |
| 360 | /* |
| 361 | * Searched the whole thing & didn't find a maxlen free extent. |
| 362 | */ |
| 363 | if (minlen < maxlen && besti != -1) { |
| 364 | xfs_extlen_t p; /* amount to trim length by */ |
| 365 | |
| 366 | /* |
| 367 | * If size should be a multiple of prod, make that so. |
| 368 | */ |
| 369 | if (prod > 1 && (p = do_mod(bestlen, prod))) |
| 370 | bestlen -= p; |
| 371 | /* |
| 372 | * Allocate besti for bestlen & return that. |
| 373 | */ |
| 374 | error = xfs_rtallocate_range(mp, tp, besti, bestlen, rbpp, rsb); |
| 375 | if (error) { |
| 376 | return error; |
| 377 | } |
| 378 | *len = bestlen; |
| 379 | *rtblock = besti; |
| 380 | return 0; |
| 381 | } |
| 382 | /* |
| 383 | * Allocation failed. Set *nextp to the next block to try. |
| 384 | */ |
| 385 | *nextp = next; |
| 386 | *rtblock = NULLRTBLOCK; |
| 387 | return 0; |
| 388 | } |
| 389 | |
| 390 | /* |
| 391 | * Allocate an extent of length minlen<=len<=maxlen, starting at block |
| 392 | * bno. If we don't get maxlen then use prod to trim the length, if given. |
| 393 | * Returns error; returns starting block in *rtblock. |
| 394 | * The lengths are all in rtextents. |
| 395 | */ |
| 396 | STATIC int /* error */ |
| 397 | xfs_rtallocate_extent_exact( |
| 398 | xfs_mount_t *mp, /* file system mount point */ |
| 399 | xfs_trans_t *tp, /* transaction pointer */ |
| 400 | xfs_rtblock_t bno, /* starting block number to allocate */ |
| 401 | xfs_extlen_t minlen, /* minimum length to allocate */ |
| 402 | xfs_extlen_t maxlen, /* maximum length to allocate */ |
| 403 | xfs_extlen_t *len, /* out: actual length allocated */ |
| 404 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 405 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 406 | xfs_extlen_t prod, /* extent product factor */ |
| 407 | xfs_rtblock_t *rtblock) /* out: start block allocated */ |
| 408 | { |
| 409 | int error; /* error value */ |
| 410 | xfs_extlen_t i; /* extent length trimmed due to prod */ |
| 411 | int isfree; /* extent is free */ |
| 412 | xfs_rtblock_t next; /* next block to try (dummy) */ |
| 413 | |
| 414 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); |
| 415 | /* |
| 416 | * Check if the range in question (for maxlen) is free. |
| 417 | */ |
| 418 | error = xfs_rtcheck_range(mp, tp, bno, maxlen, 1, &next, &isfree); |
| 419 | if (error) { |
| 420 | return error; |
| 421 | } |
| 422 | if (isfree) { |
| 423 | /* |
| 424 | * If it is, allocate it and return success. |
| 425 | */ |
| 426 | error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); |
| 427 | if (error) { |
| 428 | return error; |
| 429 | } |
| 430 | *len = maxlen; |
| 431 | *rtblock = bno; |
| 432 | return 0; |
| 433 | } |
| 434 | /* |
| 435 | * If not, allocate what there is, if it's at least minlen. |
| 436 | */ |
| 437 | maxlen = next - bno; |
| 438 | if (maxlen < minlen) { |
| 439 | /* |
| 440 | * Failed, return failure status. |
| 441 | */ |
| 442 | *rtblock = NULLRTBLOCK; |
| 443 | return 0; |
| 444 | } |
| 445 | /* |
| 446 | * Trim off tail of extent, if prod is specified. |
| 447 | */ |
| 448 | if (prod > 1 && (i = maxlen % prod)) { |
| 449 | maxlen -= i; |
| 450 | if (maxlen < minlen) { |
| 451 | /* |
| 452 | * Now we can't do it, return failure status. |
| 453 | */ |
| 454 | *rtblock = NULLRTBLOCK; |
| 455 | return 0; |
| 456 | } |
| 457 | } |
| 458 | /* |
| 459 | * Allocate what we can and return it. |
| 460 | */ |
| 461 | error = xfs_rtallocate_range(mp, tp, bno, maxlen, rbpp, rsb); |
| 462 | if (error) { |
| 463 | return error; |
| 464 | } |
| 465 | *len = maxlen; |
| 466 | *rtblock = bno; |
| 467 | return 0; |
| 468 | } |
| 469 | |
| 470 | /* |
| 471 | * Allocate an extent of length minlen<=len<=maxlen, starting as near |
| 472 | * to bno as possible. If we don't get maxlen then use prod to trim |
| 473 | * the length, if given. The lengths are all in rtextents. |
| 474 | */ |
| 475 | STATIC int /* error */ |
| 476 | xfs_rtallocate_extent_near( |
| 477 | xfs_mount_t *mp, /* file system mount point */ |
| 478 | xfs_trans_t *tp, /* transaction pointer */ |
| 479 | xfs_rtblock_t bno, /* starting block number to allocate */ |
| 480 | xfs_extlen_t minlen, /* minimum length to allocate */ |
| 481 | xfs_extlen_t maxlen, /* maximum length to allocate */ |
| 482 | xfs_extlen_t *len, /* out: actual length allocated */ |
| 483 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 484 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 485 | xfs_extlen_t prod, /* extent product factor */ |
| 486 | xfs_rtblock_t *rtblock) /* out: start block allocated */ |
| 487 | { |
| 488 | int any; /* any useful extents from summary */ |
| 489 | xfs_rtblock_t bbno; /* bitmap block number */ |
| 490 | int error; /* error value */ |
| 491 | int i; /* bitmap block offset (loop control) */ |
| 492 | int j; /* secondary loop control */ |
| 493 | int log2len; /* log2 of minlen */ |
| 494 | xfs_rtblock_t n; /* next block to try */ |
| 495 | xfs_rtblock_t r; /* result block */ |
| 496 | |
| 497 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); |
| 498 | /* |
| 499 | * If the block number given is off the end, silently set it to |
| 500 | * the last block. |
| 501 | */ |
| 502 | if (bno >= mp->m_sb.sb_rextents) |
| 503 | bno = mp->m_sb.sb_rextents - 1; |
| 504 | /* |
| 505 | * Try the exact allocation first. |
| 506 | */ |
| 507 | error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, len, |
| 508 | rbpp, rsb, prod, &r); |
| 509 | if (error) { |
| 510 | return error; |
| 511 | } |
| 512 | /* |
| 513 | * If the exact allocation worked, return that. |
| 514 | */ |
| 515 | if (r != NULLRTBLOCK) { |
| 516 | *rtblock = r; |
| 517 | return 0; |
| 518 | } |
| 519 | bbno = XFS_BITTOBLOCK(mp, bno); |
| 520 | i = 0; |
David Chinner | 79071eb | 2008-08-13 15:41:12 +1000 | [diff] [blame] | 521 | ASSERT(minlen != 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 522 | log2len = xfs_highbit32(minlen); |
| 523 | /* |
| 524 | * Loop over all bitmap blocks (bbno + i is current block). |
| 525 | */ |
| 526 | for (;;) { |
| 527 | /* |
| 528 | * Get summary information of extents of all useful levels |
| 529 | * starting in this bitmap block. |
| 530 | */ |
| 531 | error = xfs_rtany_summary(mp, tp, log2len, mp->m_rsumlevels - 1, |
| 532 | bbno + i, rbpp, rsb, &any); |
| 533 | if (error) { |
| 534 | return error; |
| 535 | } |
| 536 | /* |
| 537 | * If there are any useful extents starting here, try |
| 538 | * allocating one. |
| 539 | */ |
| 540 | if (any) { |
| 541 | /* |
| 542 | * On the positive side of the starting location. |
| 543 | */ |
| 544 | if (i >= 0) { |
| 545 | /* |
| 546 | * Try to allocate an extent starting in |
| 547 | * this block. |
| 548 | */ |
| 549 | error = xfs_rtallocate_extent_block(mp, tp, |
| 550 | bbno + i, minlen, maxlen, len, &n, rbpp, |
| 551 | rsb, prod, &r); |
| 552 | if (error) { |
| 553 | return error; |
| 554 | } |
| 555 | /* |
| 556 | * If it worked, return it. |
| 557 | */ |
| 558 | if (r != NULLRTBLOCK) { |
| 559 | *rtblock = r; |
| 560 | return 0; |
| 561 | } |
| 562 | } |
| 563 | /* |
| 564 | * On the negative side of the starting location. |
| 565 | */ |
| 566 | else { /* i < 0 */ |
| 567 | /* |
| 568 | * Loop backwards through the bitmap blocks from |
| 569 | * the starting point-1 up to where we are now. |
| 570 | * There should be an extent which ends in this |
| 571 | * bitmap block and is long enough. |
| 572 | */ |
| 573 | for (j = -1; j > i; j--) { |
| 574 | /* |
| 575 | * Grab the summary information for |
| 576 | * this bitmap block. |
| 577 | */ |
| 578 | error = xfs_rtany_summary(mp, tp, |
| 579 | log2len, mp->m_rsumlevels - 1, |
| 580 | bbno + j, rbpp, rsb, &any); |
| 581 | if (error) { |
| 582 | return error; |
| 583 | } |
| 584 | /* |
| 585 | * If there's no extent given in the |
| 586 | * summary that means the extent we |
| 587 | * found must carry over from an |
| 588 | * earlier block. If there is an |
| 589 | * extent given, we've already tried |
| 590 | * that allocation, don't do it again. |
| 591 | */ |
| 592 | if (any) |
| 593 | continue; |
| 594 | error = xfs_rtallocate_extent_block(mp, |
| 595 | tp, bbno + j, minlen, maxlen, |
| 596 | len, &n, rbpp, rsb, prod, &r); |
| 597 | if (error) { |
| 598 | return error; |
| 599 | } |
| 600 | /* |
| 601 | * If it works, return the extent. |
| 602 | */ |
| 603 | if (r != NULLRTBLOCK) { |
| 604 | *rtblock = r; |
| 605 | return 0; |
| 606 | } |
| 607 | } |
| 608 | /* |
| 609 | * There weren't intervening bitmap blocks |
| 610 | * with a long enough extent, or the |
| 611 | * allocation didn't work for some reason |
| 612 | * (i.e. it's a little * too short). |
| 613 | * Try to allocate from the summary block |
| 614 | * that we found. |
| 615 | */ |
| 616 | error = xfs_rtallocate_extent_block(mp, tp, |
| 617 | bbno + i, minlen, maxlen, len, &n, rbpp, |
| 618 | rsb, prod, &r); |
| 619 | if (error) { |
| 620 | return error; |
| 621 | } |
| 622 | /* |
| 623 | * If it works, return the extent. |
| 624 | */ |
| 625 | if (r != NULLRTBLOCK) { |
| 626 | *rtblock = r; |
| 627 | return 0; |
| 628 | } |
| 629 | } |
| 630 | } |
| 631 | /* |
| 632 | * Loop control. If we were on the positive side, and there's |
| 633 | * still more blocks on the negative side, go there. |
| 634 | */ |
| 635 | if (i > 0 && (int)bbno - i >= 0) |
| 636 | i = -i; |
| 637 | /* |
| 638 | * If positive, and no more negative, but there are more |
| 639 | * positive, go there. |
| 640 | */ |
| 641 | else if (i > 0 && (int)bbno + i < mp->m_sb.sb_rbmblocks - 1) |
| 642 | i++; |
| 643 | /* |
| 644 | * If negative or 0 (just started), and there are positive |
| 645 | * blocks to go, go there. The 0 case moves to block 1. |
| 646 | */ |
| 647 | else if (i <= 0 && (int)bbno - i < mp->m_sb.sb_rbmblocks - 1) |
| 648 | i = 1 - i; |
| 649 | /* |
| 650 | * If negative or 0 and there are more negative blocks, |
| 651 | * go there. |
| 652 | */ |
| 653 | else if (i <= 0 && (int)bbno + i > 0) |
| 654 | i--; |
| 655 | /* |
| 656 | * Must be done. Return failure. |
| 657 | */ |
| 658 | else |
| 659 | break; |
| 660 | } |
| 661 | *rtblock = NULLRTBLOCK; |
| 662 | return 0; |
| 663 | } |
| 664 | |
| 665 | /* |
| 666 | * Allocate an extent of length minlen<=len<=maxlen, with no position |
| 667 | * specified. If we don't get maxlen then use prod to trim |
| 668 | * the length, if given. The lengths are all in rtextents. |
| 669 | */ |
| 670 | STATIC int /* error */ |
| 671 | xfs_rtallocate_extent_size( |
| 672 | xfs_mount_t *mp, /* file system mount point */ |
| 673 | xfs_trans_t *tp, /* transaction pointer */ |
| 674 | xfs_extlen_t minlen, /* minimum length to allocate */ |
| 675 | xfs_extlen_t maxlen, /* maximum length to allocate */ |
| 676 | xfs_extlen_t *len, /* out: actual length allocated */ |
| 677 | xfs_buf_t **rbpp, /* in/out: summary block buffer */ |
| 678 | xfs_fsblock_t *rsb, /* in/out: summary block number */ |
| 679 | xfs_extlen_t prod, /* extent product factor */ |
| 680 | xfs_rtblock_t *rtblock) /* out: start block allocated */ |
| 681 | { |
| 682 | int error; /* error value */ |
| 683 | int i; /* bitmap block number */ |
| 684 | int l; /* level number (loop control) */ |
| 685 | xfs_rtblock_t n; /* next block to be tried */ |
| 686 | xfs_rtblock_t r; /* result block number */ |
| 687 | xfs_suminfo_t sum; /* summary information for extents */ |
| 688 | |
| 689 | ASSERT(minlen % prod == 0 && maxlen % prod == 0); |
David Chinner | 79071eb | 2008-08-13 15:41:12 +1000 | [diff] [blame] | 690 | ASSERT(maxlen != 0); |
| 691 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 692 | /* |
| 693 | * Loop over all the levels starting with maxlen. |
| 694 | * At each level, look at all the bitmap blocks, to see if there |
| 695 | * are extents starting there that are long enough (>= maxlen). |
| 696 | * Note, only on the initial level can the allocation fail if |
| 697 | * the summary says there's an extent. |
| 698 | */ |
| 699 | for (l = xfs_highbit32(maxlen); l < mp->m_rsumlevels; l++) { |
| 700 | /* |
| 701 | * Loop over all the bitmap blocks. |
| 702 | */ |
| 703 | for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { |
| 704 | /* |
| 705 | * Get the summary for this level/block. |
| 706 | */ |
| 707 | error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, |
| 708 | &sum); |
| 709 | if (error) { |
| 710 | return error; |
| 711 | } |
| 712 | /* |
| 713 | * Nothing there, on to the next block. |
| 714 | */ |
| 715 | if (!sum) |
| 716 | continue; |
| 717 | /* |
| 718 | * Try allocating the extent. |
| 719 | */ |
| 720 | error = xfs_rtallocate_extent_block(mp, tp, i, maxlen, |
| 721 | maxlen, len, &n, rbpp, rsb, prod, &r); |
| 722 | if (error) { |
| 723 | return error; |
| 724 | } |
| 725 | /* |
| 726 | * If it worked, return that. |
| 727 | */ |
| 728 | if (r != NULLRTBLOCK) { |
| 729 | *rtblock = r; |
| 730 | return 0; |
| 731 | } |
| 732 | /* |
| 733 | * If the "next block to try" returned from the |
| 734 | * allocator is beyond the next bitmap block, |
| 735 | * skip to that bitmap block. |
| 736 | */ |
| 737 | if (XFS_BITTOBLOCK(mp, n) > i + 1) |
| 738 | i = XFS_BITTOBLOCK(mp, n) - 1; |
| 739 | } |
| 740 | } |
| 741 | /* |
| 742 | * Didn't find any maxlen blocks. Try smaller ones, unless |
| 743 | * we're asking for a fixed size extent. |
| 744 | */ |
| 745 | if (minlen > --maxlen) { |
| 746 | *rtblock = NULLRTBLOCK; |
| 747 | return 0; |
| 748 | } |
David Chinner | 79071eb | 2008-08-13 15:41:12 +1000 | [diff] [blame] | 749 | ASSERT(minlen != 0); |
| 750 | ASSERT(maxlen != 0); |
| 751 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 752 | /* |
| 753 | * Loop over sizes, from maxlen down to minlen. |
| 754 | * This time, when we do the allocations, allow smaller ones |
| 755 | * to succeed. |
| 756 | */ |
| 757 | for (l = xfs_highbit32(maxlen); l >= xfs_highbit32(minlen); l--) { |
| 758 | /* |
| 759 | * Loop over all the bitmap blocks, try an allocation |
| 760 | * starting in that block. |
| 761 | */ |
| 762 | for (i = 0; i < mp->m_sb.sb_rbmblocks; i++) { |
| 763 | /* |
| 764 | * Get the summary information for this level/block. |
| 765 | */ |
| 766 | error = xfs_rtget_summary(mp, tp, l, i, rbpp, rsb, |
| 767 | &sum); |
| 768 | if (error) { |
| 769 | return error; |
| 770 | } |
| 771 | /* |
| 772 | * If nothing there, go on to next. |
| 773 | */ |
| 774 | if (!sum) |
| 775 | continue; |
| 776 | /* |
| 777 | * Try the allocation. Make sure the specified |
| 778 | * minlen/maxlen are in the possible range for |
| 779 | * this summary level. |
| 780 | */ |
| 781 | error = xfs_rtallocate_extent_block(mp, tp, i, |
| 782 | XFS_RTMAX(minlen, 1 << l), |
| 783 | XFS_RTMIN(maxlen, (1 << (l + 1)) - 1), |
| 784 | len, &n, rbpp, rsb, prod, &r); |
| 785 | if (error) { |
| 786 | return error; |
| 787 | } |
| 788 | /* |
| 789 | * If it worked, return that extent. |
| 790 | */ |
| 791 | if (r != NULLRTBLOCK) { |
| 792 | *rtblock = r; |
| 793 | return 0; |
| 794 | } |
| 795 | /* |
| 796 | * If the "next block to try" returned from the |
| 797 | * allocator is beyond the next bitmap block, |
| 798 | * skip to that bitmap block. |
| 799 | */ |
| 800 | if (XFS_BITTOBLOCK(mp, n) > i + 1) |
| 801 | i = XFS_BITTOBLOCK(mp, n) - 1; |
| 802 | } |
| 803 | } |
| 804 | /* |
| 805 | * Got nothing, return failure. |
| 806 | */ |
| 807 | *rtblock = NULLRTBLOCK; |
| 808 | return 0; |
| 809 | } |
| 810 | |
| 811 | /* |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 812 | * Allocate space to the bitmap or summary file, and zero it, for growfs. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 813 | */ |
| 814 | STATIC int /* error */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 815 | xfs_growfs_rt_alloc( |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 816 | xfs_mount_t *mp, /* file system mount point */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 817 | xfs_extlen_t oblocks, /* old count of blocks */ |
| 818 | xfs_extlen_t nblocks, /* new count of blocks */ |
| 819 | xfs_inode_t *ip) /* inode (bitmap/summary) */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 820 | { |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 821 | xfs_fileoff_t bno; /* block number in file */ |
| 822 | xfs_buf_t *bp; /* temporary buffer for zeroing */ |
| 823 | int committed; /* transaction committed flag */ |
| 824 | xfs_daddr_t d; /* disk block address */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 825 | int error; /* error return value */ |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 826 | xfs_fsblock_t firstblock; /* first block allocated in xaction */ |
| 827 | xfs_bmap_free_t flist; /* list of freed blocks */ |
| 828 | xfs_fsblock_t fsbno; /* filesystem block for bno */ |
| 829 | xfs_bmbt_irec_t map; /* block map output */ |
| 830 | int nmap; /* number of block maps */ |
| 831 | int resblks; /* space reservation */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 832 | |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 833 | /* |
| 834 | * Allocate space to the file, as necessary. |
| 835 | */ |
| 836 | while (oblocks < nblocks) { |
| 837 | int cancelflags = 0; |
| 838 | xfs_trans_t *tp; |
| 839 | |
| 840 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ALLOC); |
| 841 | resblks = XFS_GROWFSRT_SPACE_RES(mp, nblocks - oblocks); |
| 842 | /* |
| 843 | * Reserve space & log for one extent added to the file. |
| 844 | */ |
| 845 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growdata, |
| 846 | resblks, 0); |
| 847 | if (error) |
| 848 | goto error_cancel; |
| 849 | cancelflags = XFS_TRANS_RELEASE_LOG_RES; |
| 850 | /* |
| 851 | * Lock the inode. |
| 852 | */ |
| 853 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 854 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); |
| 855 | |
| 856 | xfs_bmap_init(&flist, &firstblock); |
| 857 | /* |
| 858 | * Allocate blocks to the bitmap file. |
| 859 | */ |
| 860 | nmap = 1; |
| 861 | cancelflags |= XFS_TRANS_ABORT; |
| 862 | error = xfs_bmapi_write(tp, ip, oblocks, nblocks - oblocks, |
| 863 | XFS_BMAPI_METADATA, &firstblock, |
| 864 | resblks, &map, &nmap, &flist); |
| 865 | if (!error && nmap < 1) |
| 866 | error = XFS_ERROR(ENOSPC); |
| 867 | if (error) |
| 868 | goto error_cancel; |
| 869 | /* |
| 870 | * Free any blocks freed up in the transaction, then commit. |
| 871 | */ |
| 872 | error = xfs_bmap_finish(&tp, &flist, &committed); |
| 873 | if (error) |
| 874 | goto error_cancel; |
| 875 | error = xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); |
| 876 | if (error) |
| 877 | goto error; |
| 878 | /* |
| 879 | * Now we need to clear the allocated blocks. |
| 880 | * Do this one block per transaction, to keep it simple. |
| 881 | */ |
| 882 | cancelflags = 0; |
| 883 | for (bno = map.br_startoff, fsbno = map.br_startblock; |
| 884 | bno < map.br_startoff + map.br_blockcount; |
| 885 | bno++, fsbno++) { |
| 886 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_ZERO); |
| 887 | /* |
| 888 | * Reserve log for one block zeroing. |
| 889 | */ |
| 890 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growrtzero, |
| 891 | 0, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 892 | if (error) |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 893 | goto error_cancel; |
| 894 | /* |
| 895 | * Lock the bitmap inode. |
| 896 | */ |
| 897 | xfs_ilock(ip, XFS_ILOCK_EXCL); |
| 898 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); |
| 899 | /* |
| 900 | * Get a buffer for the block. |
| 901 | */ |
| 902 | d = XFS_FSB_TO_DADDR(mp, fsbno); |
| 903 | bp = xfs_trans_get_buf(tp, mp->m_ddev_targp, d, |
| 904 | mp->m_bsize, 0); |
| 905 | if (bp == NULL) { |
| 906 | error = XFS_ERROR(EIO); |
| 907 | error_cancel: |
| 908 | xfs_trans_cancel(tp, cancelflags); |
| 909 | goto error; |
| 910 | } |
| 911 | memset(bp->b_addr, 0, mp->m_sb.sb_blocksize); |
| 912 | xfs_trans_log_buf(tp, bp, 0, mp->m_sb.sb_blocksize - 1); |
| 913 | /* |
| 914 | * Commit the transaction. |
| 915 | */ |
| 916 | error = xfs_trans_commit(tp, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 917 | if (error) |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 918 | goto error; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 919 | } |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 920 | /* |
| 921 | * Go on to the next extent, if any. |
| 922 | */ |
| 923 | oblocks = map.br_startoff + map.br_blockcount; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 924 | } |
| 925 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 926 | |
Dave Chinner | c963c61 | 2013-10-15 09:17:56 +1100 | [diff] [blame^] | 927 | error: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 928 | return error; |
| 929 | } |
| 930 | |
| 931 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 932 | * Visible (exported) functions. |
| 933 | */ |
| 934 | |
| 935 | /* |
| 936 | * Grow the realtime area of the filesystem. |
| 937 | */ |
| 938 | int |
| 939 | xfs_growfs_rt( |
| 940 | xfs_mount_t *mp, /* mount point for filesystem */ |
| 941 | xfs_growfs_rt_t *in) /* growfs rt input struct */ |
| 942 | { |
| 943 | xfs_rtblock_t bmbno; /* bitmap block number */ |
| 944 | xfs_buf_t *bp; /* temporary buffer */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 945 | int error; /* error return value */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 946 | xfs_mount_t *nmp; /* new (fake) mount structure */ |
| 947 | xfs_drfsbno_t nrblocks; /* new number of realtime blocks */ |
| 948 | xfs_extlen_t nrbmblocks; /* new number of rt bitmap blocks */ |
| 949 | xfs_drtbno_t nrextents; /* new number of realtime extents */ |
| 950 | uint8_t nrextslog; /* new log2 of sb_rextents */ |
| 951 | xfs_extlen_t nrsumblocks; /* new number of summary blocks */ |
| 952 | uint nrsumlevels; /* new rt summary levels */ |
| 953 | uint nrsumsize; /* new size of rt summary, bytes */ |
| 954 | xfs_sb_t *nsbp; /* new superblock */ |
| 955 | xfs_extlen_t rbmblocks; /* current number of rt bitmap blocks */ |
| 956 | xfs_extlen_t rsumblocks; /* current number of rt summary blks */ |
| 957 | xfs_sb_t *sbp; /* old superblock */ |
| 958 | xfs_fsblock_t sumbno; /* summary block number */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 959 | |
| 960 | sbp = &mp->m_sb; |
| 961 | /* |
| 962 | * Initial error checking. |
| 963 | */ |
sandeen@sandeen.net | 743bb465 | 2008-11-25 21:20:06 -0600 | [diff] [blame] | 964 | if (!capable(CAP_SYS_ADMIN)) |
| 965 | return XFS_ERROR(EPERM); |
Eric Sesterhenn | 73024cf | 2006-06-28 08:42:26 +1000 | [diff] [blame] | 966 | if (mp->m_rtdev_targp == NULL || mp->m_rbmip == NULL || |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 967 | (nrblocks = in->newblocks) <= sbp->sb_rblocks || |
| 968 | (sbp->sb_rblocks && (in->extsize != sbp->sb_rextsize))) |
| 969 | return XFS_ERROR(EINVAL); |
Nathan Scott | 4cc929e | 2007-05-14 18:24:02 +1000 | [diff] [blame] | 970 | if ((error = xfs_sb_validate_fsb_count(sbp, nrblocks))) |
| 971 | return error; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 972 | /* |
| 973 | * Read in the last block of the device, make sure it exists. |
| 974 | */ |
Dave Chinner | e70b73f | 2012-04-23 15:58:49 +1000 | [diff] [blame] | 975 | bp = xfs_buf_read_uncached(mp->m_rtdev_targp, |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 976 | XFS_FSB_TO_BB(mp, nrblocks - 1), |
Dave Chinner | c3f8fc7 | 2012-11-12 22:54:01 +1100 | [diff] [blame] | 977 | XFS_FSB_TO_BB(mp, 1), 0, NULL); |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 978 | if (!bp) |
| 979 | return EIO; |
Dave Chinner | eab4e63 | 2012-11-12 22:54:02 +1100 | [diff] [blame] | 980 | if (bp->b_error) { |
| 981 | error = bp->b_error; |
| 982 | xfs_buf_relse(bp); |
| 983 | return error; |
| 984 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 985 | xfs_buf_relse(bp); |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 986 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 987 | /* |
| 988 | * Calculate new parameters. These are the final values to be reached. |
| 989 | */ |
| 990 | nrextents = nrblocks; |
| 991 | do_div(nrextents, in->extsize); |
Nathan Scott | 68c3271 | 2006-09-28 11:03:53 +1000 | [diff] [blame] | 992 | nrbmblocks = howmany_64(nrextents, NBBY * sbp->sb_blocksize); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 993 | nrextslog = xfs_highbit32(nrextents); |
| 994 | nrsumlevels = nrextslog + 1; |
| 995 | nrsumsize = (uint)sizeof(xfs_suminfo_t) * nrsumlevels * nrbmblocks; |
| 996 | nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); |
| 997 | nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); |
| 998 | /* |
| 999 | * New summary size can't be more than half the size of |
| 1000 | * the log. This prevents us from getting a log overflow, |
| 1001 | * since we'll log basically the whole summary file at once. |
| 1002 | */ |
| 1003 | if (nrsumblocks > (mp->m_sb.sb_logblocks >> 1)) |
| 1004 | return XFS_ERROR(EINVAL); |
| 1005 | /* |
| 1006 | * Get the old block counts for bitmap and summary inodes. |
| 1007 | * These can't change since other growfs callers are locked out. |
| 1008 | */ |
| 1009 | rbmblocks = XFS_B_TO_FSB(mp, mp->m_rbmip->i_d.di_size); |
| 1010 | rsumblocks = XFS_B_TO_FSB(mp, mp->m_rsumip->i_d.di_size); |
| 1011 | /* |
| 1012 | * Allocate space to the bitmap and summary files, as necessary. |
| 1013 | */ |
Christoph Hellwig | 1050c71 | 2011-02-13 13:25:31 +0000 | [diff] [blame] | 1014 | error = xfs_growfs_rt_alloc(mp, rbmblocks, nrbmblocks, mp->m_rbmip); |
| 1015 | if (error) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1016 | return error; |
Christoph Hellwig | 1050c71 | 2011-02-13 13:25:31 +0000 | [diff] [blame] | 1017 | error = xfs_growfs_rt_alloc(mp, rsumblocks, nrsumblocks, mp->m_rsumip); |
| 1018 | if (error) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1019 | return error; |
Nathan Scott | d432c80 | 2006-09-28 11:03:44 +1000 | [diff] [blame] | 1020 | /* |
| 1021 | * Allocate a new (fake) mount/sb. |
| 1022 | */ |
| 1023 | nmp = kmem_alloc(sizeof(*nmp), KM_SLEEP); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1024 | /* |
| 1025 | * Loop over the bitmap blocks. |
| 1026 | * We will do everything one bitmap block at a time. |
| 1027 | * Skip the current block if it is exactly full. |
| 1028 | * This also deals with the case where there were no rtextents before. |
| 1029 | */ |
| 1030 | for (bmbno = sbp->sb_rbmblocks - |
| 1031 | ((sbp->sb_rextents & ((1 << mp->m_blkbit_log) - 1)) != 0); |
| 1032 | bmbno < nrbmblocks; |
| 1033 | bmbno++) { |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1034 | xfs_trans_t *tp; |
| 1035 | int cancelflags = 0; |
| 1036 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1037 | *nmp = *mp; |
| 1038 | nsbp = &nmp->m_sb; |
| 1039 | /* |
| 1040 | * Calculate new sb and mount fields for this round. |
| 1041 | */ |
| 1042 | nsbp->sb_rextsize = in->extsize; |
| 1043 | nsbp->sb_rbmblocks = bmbno + 1; |
| 1044 | nsbp->sb_rblocks = |
| 1045 | XFS_RTMIN(nrblocks, |
| 1046 | nsbp->sb_rbmblocks * NBBY * |
| 1047 | nsbp->sb_blocksize * nsbp->sb_rextsize); |
| 1048 | nsbp->sb_rextents = nsbp->sb_rblocks; |
| 1049 | do_div(nsbp->sb_rextents, nsbp->sb_rextsize); |
David Chinner | 79071eb | 2008-08-13 15:41:12 +1000 | [diff] [blame] | 1050 | ASSERT(nsbp->sb_rextents != 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1051 | nsbp->sb_rextslog = xfs_highbit32(nsbp->sb_rextents); |
| 1052 | nrsumlevels = nmp->m_rsumlevels = nsbp->sb_rextslog + 1; |
| 1053 | nrsumsize = |
| 1054 | (uint)sizeof(xfs_suminfo_t) * nrsumlevels * |
| 1055 | nsbp->sb_rbmblocks; |
| 1056 | nrsumblocks = XFS_B_TO_FSB(mp, nrsumsize); |
| 1057 | nmp->m_rsumsize = nrsumsize = XFS_FSB_TO_B(mp, nrsumblocks); |
| 1058 | /* |
| 1059 | * Start a transaction, get the log reservation. |
| 1060 | */ |
| 1061 | tp = xfs_trans_alloc(mp, XFS_TRANS_GROWFSRT_FREE); |
Jie Liu | 3d3c8b5 | 2013-08-12 20:49:59 +1000 | [diff] [blame] | 1062 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_growrtfree, |
| 1063 | 0, 0); |
| 1064 | if (error) |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1065 | goto error_cancel; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1066 | /* |
| 1067 | * Lock out other callers by grabbing the bitmap inode lock. |
| 1068 | */ |
Christoph Hellwig | 1050c71 | 2011-02-13 13:25:31 +0000 | [diff] [blame] | 1069 | xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL); |
Christoph Hellwig | ddc3415 | 2011-09-19 15:00:54 +0000 | [diff] [blame] | 1070 | xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1071 | /* |
| 1072 | * Update the bitmap inode's size. |
| 1073 | */ |
| 1074 | mp->m_rbmip->i_d.di_size = |
| 1075 | nsbp->sb_rbmblocks * nsbp->sb_blocksize; |
| 1076 | xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); |
| 1077 | cancelflags |= XFS_TRANS_ABORT; |
| 1078 | /* |
| 1079 | * Get the summary inode into the transaction. |
| 1080 | */ |
Christoph Hellwig | 1050c71 | 2011-02-13 13:25:31 +0000 | [diff] [blame] | 1081 | xfs_ilock(mp->m_rsumip, XFS_ILOCK_EXCL); |
Christoph Hellwig | ddc3415 | 2011-09-19 15:00:54 +0000 | [diff] [blame] | 1082 | xfs_trans_ijoin(tp, mp->m_rsumip, XFS_ILOCK_EXCL); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1083 | /* |
| 1084 | * Update the summary inode's size. |
| 1085 | */ |
| 1086 | mp->m_rsumip->i_d.di_size = nmp->m_rsumsize; |
| 1087 | xfs_trans_log_inode(tp, mp->m_rsumip, XFS_ILOG_CORE); |
| 1088 | /* |
| 1089 | * Copy summary data from old to new sizes. |
| 1090 | * Do this when the real size (not block-aligned) changes. |
| 1091 | */ |
| 1092 | if (sbp->sb_rbmblocks != nsbp->sb_rbmblocks || |
| 1093 | mp->m_rsumlevels != nmp->m_rsumlevels) { |
| 1094 | error = xfs_rtcopy_summary(mp, nmp, tp); |
| 1095 | if (error) |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1096 | goto error_cancel; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1097 | } |
| 1098 | /* |
| 1099 | * Update superblock fields. |
| 1100 | */ |
| 1101 | if (nsbp->sb_rextsize != sbp->sb_rextsize) |
| 1102 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSIZE, |
| 1103 | nsbp->sb_rextsize - sbp->sb_rextsize); |
| 1104 | if (nsbp->sb_rbmblocks != sbp->sb_rbmblocks) |
| 1105 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBMBLOCKS, |
| 1106 | nsbp->sb_rbmblocks - sbp->sb_rbmblocks); |
| 1107 | if (nsbp->sb_rblocks != sbp->sb_rblocks) |
| 1108 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RBLOCKS, |
| 1109 | nsbp->sb_rblocks - sbp->sb_rblocks); |
| 1110 | if (nsbp->sb_rextents != sbp->sb_rextents) |
| 1111 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTENTS, |
| 1112 | nsbp->sb_rextents - sbp->sb_rextents); |
| 1113 | if (nsbp->sb_rextslog != sbp->sb_rextslog) |
| 1114 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_REXTSLOG, |
| 1115 | nsbp->sb_rextslog - sbp->sb_rextslog); |
| 1116 | /* |
| 1117 | * Free new extent. |
| 1118 | */ |
| 1119 | bp = NULL; |
| 1120 | error = xfs_rtfree_range(nmp, tp, sbp->sb_rextents, |
| 1121 | nsbp->sb_rextents - sbp->sb_rextents, &bp, &sumbno); |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1122 | if (error) { |
| 1123 | error_cancel: |
| 1124 | xfs_trans_cancel(tp, cancelflags); |
Nathan Scott | d432c80 | 2006-09-28 11:03:44 +1000 | [diff] [blame] | 1125 | break; |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1126 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1127 | /* |
| 1128 | * Mark more blocks free in the superblock. |
| 1129 | */ |
| 1130 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, |
| 1131 | nsbp->sb_rextents - sbp->sb_rextents); |
| 1132 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1133 | * Update mp values into the real mp structure. |
| 1134 | */ |
| 1135 | mp->m_rsumlevels = nrsumlevels; |
| 1136 | mp->m_rsumsize = nrsumsize; |
David Chinner | e5720ee | 2008-04-10 12:21:18 +1000 | [diff] [blame] | 1137 | |
| 1138 | error = xfs_trans_commit(tp, 0); |
Dave Chinner | 0924b58 | 2008-11-28 14:23:34 +1100 | [diff] [blame] | 1139 | if (error) |
David Chinner | e5720ee | 2008-04-10 12:21:18 +1000 | [diff] [blame] | 1140 | break; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1141 | } |
Nathan Scott | d432c80 | 2006-09-28 11:03:44 +1000 | [diff] [blame] | 1142 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1143 | /* |
Nathan Scott | d432c80 | 2006-09-28 11:03:44 +1000 | [diff] [blame] | 1144 | * Free the fake mp structure. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1145 | */ |
Denys Vlasenko | f0e2d93 | 2008-05-19 16:31:57 +1000 | [diff] [blame] | 1146 | kmem_free(nmp); |
Nathan Scott | d432c80 | 2006-09-28 11:03:44 +1000 | [diff] [blame] | 1147 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1148 | return error; |
| 1149 | } |
| 1150 | |
| 1151 | /* |
| 1152 | * Allocate an extent in the realtime subvolume, with the usual allocation |
| 1153 | * parameters. The length units are all in realtime extents, as is the |
| 1154 | * result block number. |
| 1155 | */ |
| 1156 | int /* error */ |
| 1157 | xfs_rtallocate_extent( |
| 1158 | xfs_trans_t *tp, /* transaction pointer */ |
| 1159 | xfs_rtblock_t bno, /* starting block number to allocate */ |
| 1160 | xfs_extlen_t minlen, /* minimum length to allocate */ |
| 1161 | xfs_extlen_t maxlen, /* maximum length to allocate */ |
| 1162 | xfs_extlen_t *len, /* out: actual length allocated */ |
| 1163 | xfs_alloctype_t type, /* allocation type XFS_ALLOCTYPE... */ |
| 1164 | int wasdel, /* was a delayed allocation extent */ |
| 1165 | xfs_extlen_t prod, /* extent product factor */ |
| 1166 | xfs_rtblock_t *rtblock) /* out: start block allocated */ |
| 1167 | { |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1168 | xfs_mount_t *mp = tp->t_mountp; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1169 | int error; /* error value */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1170 | xfs_rtblock_t r; /* result allocated block */ |
| 1171 | xfs_fsblock_t sb; /* summary file block number */ |
| 1172 | xfs_buf_t *sumbp; /* summary file block buffer */ |
| 1173 | |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1174 | ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1175 | ASSERT(minlen > 0 && minlen <= maxlen); |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1176 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1177 | /* |
| 1178 | * If prod is set then figure out what to do to minlen and maxlen. |
| 1179 | */ |
| 1180 | if (prod > 1) { |
| 1181 | xfs_extlen_t i; |
| 1182 | |
| 1183 | if ((i = maxlen % prod)) |
| 1184 | maxlen -= i; |
| 1185 | if ((i = minlen % prod)) |
| 1186 | minlen += prod - i; |
| 1187 | if (maxlen < minlen) { |
| 1188 | *rtblock = NULLRTBLOCK; |
| 1189 | return 0; |
| 1190 | } |
| 1191 | } |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1192 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1193 | sumbp = NULL; |
| 1194 | /* |
| 1195 | * Allocate by size, or near another block, or exactly at some block. |
| 1196 | */ |
| 1197 | switch (type) { |
| 1198 | case XFS_ALLOCTYPE_ANY_AG: |
| 1199 | error = xfs_rtallocate_extent_size(mp, tp, minlen, maxlen, len, |
| 1200 | &sumbp, &sb, prod, &r); |
| 1201 | break; |
| 1202 | case XFS_ALLOCTYPE_NEAR_BNO: |
| 1203 | error = xfs_rtallocate_extent_near(mp, tp, bno, minlen, maxlen, |
| 1204 | len, &sumbp, &sb, prod, &r); |
| 1205 | break; |
| 1206 | case XFS_ALLOCTYPE_THIS_BNO: |
| 1207 | error = xfs_rtallocate_extent_exact(mp, tp, bno, minlen, maxlen, |
| 1208 | len, &sumbp, &sb, prod, &r); |
| 1209 | break; |
| 1210 | default: |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1211 | error = EIO; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1212 | ASSERT(0); |
| 1213 | } |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1214 | if (error) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1215 | return error; |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1216 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1217 | /* |
| 1218 | * If it worked, update the superblock. |
| 1219 | */ |
| 1220 | if (r != NULLRTBLOCK) { |
| 1221 | long slen = (long)*len; |
| 1222 | |
| 1223 | ASSERT(*len >= minlen && *len <= maxlen); |
| 1224 | if (wasdel) |
| 1225 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_RES_FREXTENTS, -slen); |
| 1226 | else |
| 1227 | xfs_trans_mod_sb(tp, XFS_TRANS_SB_FREXTENTS, -slen); |
| 1228 | } |
| 1229 | *rtblock = r; |
| 1230 | return 0; |
| 1231 | } |
| 1232 | |
| 1233 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1234 | * Initialize realtime fields in the mount structure. |
| 1235 | */ |
| 1236 | int /* error */ |
| 1237 | xfs_rtmount_init( |
| 1238 | xfs_mount_t *mp) /* file system mount structure */ |
| 1239 | { |
| 1240 | xfs_buf_t *bp; /* buffer for last block of subvolume */ |
| 1241 | xfs_daddr_t d; /* address of last block of subvolume */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1242 | xfs_sb_t *sbp; /* filesystem superblock copy in mount */ |
| 1243 | |
| 1244 | sbp = &mp->m_sb; |
| 1245 | if (sbp->sb_rblocks == 0) |
| 1246 | return 0; |
| 1247 | if (mp->m_rtdev_targp == NULL) { |
Dave Chinner | 0b932cc | 2011-03-07 10:08:35 +1100 | [diff] [blame] | 1248 | xfs_warn(mp, |
| 1249 | "Filesystem has a realtime volume, use rtdev=device option"); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1250 | return XFS_ERROR(ENODEV); |
| 1251 | } |
| 1252 | mp->m_rsumlevels = sbp->sb_rextslog + 1; |
| 1253 | mp->m_rsumsize = |
| 1254 | (uint)sizeof(xfs_suminfo_t) * mp->m_rsumlevels * |
| 1255 | sbp->sb_rbmblocks; |
| 1256 | mp->m_rsumsize = roundup(mp->m_rsumsize, sbp->sb_blocksize); |
| 1257 | mp->m_rbmip = mp->m_rsumip = NULL; |
| 1258 | /* |
| 1259 | * Check that the realtime section is an ok size. |
| 1260 | */ |
| 1261 | d = (xfs_daddr_t)XFS_FSB_TO_BB(mp, mp->m_sb.sb_rblocks); |
| 1262 | if (XFS_BB_TO_FSB(mp, d) != mp->m_sb.sb_rblocks) { |
Dave Chinner | 0b932cc | 2011-03-07 10:08:35 +1100 | [diff] [blame] | 1263 | xfs_warn(mp, "realtime mount -- %llu != %llu", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1264 | (unsigned long long) XFS_BB_TO_FSB(mp, d), |
| 1265 | (unsigned long long) mp->m_sb.sb_rblocks); |
Eric Sandeen | 657a4cf | 2010-04-30 03:42:49 +0000 | [diff] [blame] | 1266 | return XFS_ERROR(EFBIG); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1267 | } |
Dave Chinner | e70b73f | 2012-04-23 15:58:49 +1000 | [diff] [blame] | 1268 | bp = xfs_buf_read_uncached(mp->m_rtdev_targp, |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 1269 | d - XFS_FSB_TO_BB(mp, 1), |
Dave Chinner | c3f8fc7 | 2012-11-12 22:54:01 +1100 | [diff] [blame] | 1270 | XFS_FSB_TO_BB(mp, 1), 0, NULL); |
Dave Chinner | eab4e63 | 2012-11-12 22:54:02 +1100 | [diff] [blame] | 1271 | if (!bp || bp->b_error) { |
Dave Chinner | 0b932cc | 2011-03-07 10:08:35 +1100 | [diff] [blame] | 1272 | xfs_warn(mp, "realtime device size check failed"); |
Dave Chinner | eab4e63 | 2012-11-12 22:54:02 +1100 | [diff] [blame] | 1273 | if (bp) |
| 1274 | xfs_buf_relse(bp); |
Dave Chinner | 1922c94 | 2010-09-22 10:47:20 +1000 | [diff] [blame] | 1275 | return EIO; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1276 | } |
| 1277 | xfs_buf_relse(bp); |
| 1278 | return 0; |
| 1279 | } |
| 1280 | |
| 1281 | /* |
| 1282 | * Get the bitmap and summary inodes into the mount structure |
| 1283 | * at mount time. |
| 1284 | */ |
| 1285 | int /* error */ |
| 1286 | xfs_rtmount_inodes( |
| 1287 | xfs_mount_t *mp) /* file system mount structure */ |
| 1288 | { |
| 1289 | int error; /* error return value */ |
| 1290 | xfs_sb_t *sbp; |
| 1291 | |
| 1292 | sbp = &mp->m_sb; |
| 1293 | if (sbp->sb_rbmino == NULLFSINO) |
| 1294 | return 0; |
Dave Chinner | 7b6259e | 2010-06-24 11:35:17 +1000 | [diff] [blame] | 1295 | error = xfs_iget(mp, NULL, sbp->sb_rbmino, 0, 0, &mp->m_rbmip); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1296 | if (error) |
| 1297 | return error; |
| 1298 | ASSERT(mp->m_rbmip != NULL); |
| 1299 | ASSERT(sbp->sb_rsumino != NULLFSINO); |
Dave Chinner | 7b6259e | 2010-06-24 11:35:17 +1000 | [diff] [blame] | 1300 | error = xfs_iget(mp, NULL, sbp->sb_rsumino, 0, 0, &mp->m_rsumip); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1301 | if (error) { |
Christoph Hellwig | 4335509 | 2008-03-27 18:01:08 +1100 | [diff] [blame] | 1302 | IRELE(mp->m_rbmip); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1303 | return error; |
| 1304 | } |
| 1305 | ASSERT(mp->m_rsumip != NULL); |
| 1306 | return 0; |
| 1307 | } |
| 1308 | |
Christoph Hellwig | b93b6e4 | 2009-02-04 09:33:58 +0100 | [diff] [blame] | 1309 | void |
| 1310 | xfs_rtunmount_inodes( |
| 1311 | struct xfs_mount *mp) |
| 1312 | { |
| 1313 | if (mp->m_rbmip) |
| 1314 | IRELE(mp->m_rbmip); |
| 1315 | if (mp->m_rsumip) |
| 1316 | IRELE(mp->m_rsumip); |
| 1317 | } |
| 1318 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1319 | /* |
| 1320 | * Pick an extent for allocation at the start of a new realtime file. |
| 1321 | * Use the sequence number stored in the atime field of the bitmap inode. |
| 1322 | * Translate this to a fraction of the rtextents, and return the product |
| 1323 | * of rtextents and the fraction. |
| 1324 | * The fraction sequence is 0, 1/2, 1/4, 3/4, 1/8, ..., 7/8, 1/16, ... |
| 1325 | */ |
| 1326 | int /* error */ |
| 1327 | xfs_rtpick_extent( |
| 1328 | xfs_mount_t *mp, /* file system mount point */ |
| 1329 | xfs_trans_t *tp, /* transaction pointer */ |
| 1330 | xfs_extlen_t len, /* allocation length (rtextents) */ |
| 1331 | xfs_rtblock_t *pick) /* result rt extent */ |
| 1332 | { |
| 1333 | xfs_rtblock_t b; /* result block */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1334 | int log2; /* log of sequence number */ |
| 1335 | __uint64_t resid; /* residual after log removed */ |
| 1336 | __uint64_t seq; /* sequence number of file creation */ |
| 1337 | __uint64_t *seqp; /* pointer to seqno in inode */ |
| 1338 | |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1339 | ASSERT(xfs_isilocked(mp->m_rbmip, XFS_ILOCK_EXCL)); |
| 1340 | |
| 1341 | seqp = (__uint64_t *)&mp->m_rbmip->i_d.di_atime; |
| 1342 | if (!(mp->m_rbmip->i_d.di_flags & XFS_DIFLAG_NEWRTBM)) { |
| 1343 | mp->m_rbmip->i_d.di_flags |= XFS_DIFLAG_NEWRTBM; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1344 | *seqp = 0; |
| 1345 | } |
| 1346 | seq = *seqp; |
| 1347 | if ((log2 = xfs_highbit64(seq)) == -1) |
| 1348 | b = 0; |
| 1349 | else { |
| 1350 | resid = seq - (1ULL << log2); |
| 1351 | b = (mp->m_sb.sb_rextents * ((resid << 1) + 1ULL)) >> |
| 1352 | (log2 + 1); |
| 1353 | if (b >= mp->m_sb.sb_rextents) |
| 1354 | b = do_mod(b, mp->m_sb.sb_rextents); |
| 1355 | if (b + len > mp->m_sb.sb_rextents) |
| 1356 | b = mp->m_sb.sb_rextents - len; |
| 1357 | } |
| 1358 | *seqp = seq + 1; |
Christoph Hellwig | 04e9945 | 2011-01-25 09:06:19 +0000 | [diff] [blame] | 1359 | xfs_trans_log_inode(tp, mp->m_rbmip, XFS_ILOG_CORE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1360 | *pick = b; |
| 1361 | return 0; |
| 1362 | } |