Blame view
fs/jfs/jfs_extent.c
17.6 KB
1da177e4c
|
1 2 3 4 5 |
/* * Copyright (C) International Business Machines Corp., 2000-2004 * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by |
63f83c9fc
|
6 |
* the Free Software Foundation; either version 2 of the License, or |
1da177e4c
|
7 |
* (at your option) any later version. |
63f83c9fc
|
8 |
* |
1da177e4c
|
9 10 11 12 13 14 |
* This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See * the GNU General Public License for more details. * * You should have received a copy of the GNU General Public License |
63f83c9fc
|
15 |
* along with this program; if not, write to the Free Software |
1da177e4c
|
16 17 18 19 20 21 |
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include <linux/fs.h> #include <linux/quotaops.h> #include "jfs_incore.h" |
1868f4aa5
|
22 |
#include "jfs_inode.h" |
1da177e4c
|
23 24 25 26 27 28 29 30 31 32 33 34 35 |
#include "jfs_superblock.h" #include "jfs_dmap.h" #include "jfs_extent.h" #include "jfs_debug.h" /* * forward references */ static int extBalloc(struct inode *, s64, s64 *, s64 *); #ifdef _NOTYET static int extBrealloc(struct inode *, s64, s64, s64 *, s64 *); #endif static s64 extRoundDown(s64 nb); |
f720e3ba5
|
36 37 38 39 |
#define DPD(a) (printk("(a): %d ",(a))) #define DPC(a) (printk("(a): %c ",(a))) |
1da177e4c
|
40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 |
#define DPL1(a) \ { \ if ((a) >> 32) \ printk("(a): %x%08x ",(a)); \ else \ printk("(a): %x ",(a) << 32); \ } #define DPL(a) \ { \ if ((a) >> 32) \ printk("(a): %x%08x ",(a)); \ else \ printk("(a): %x ",(a) << 32); \ } |
f720e3ba5
|
56 57 58 59 60 61 62 63 64 65 66 67 |
#define DPD1(a) (printk("(a): %d ",(a))) #define DPX(a) (printk("(a): %08x ",(a))) #define DPX1(a) (printk("(a): %08x ",(a))) #define DPS(a) (printk("%s ",(a))) #define DPE(a) (printk(" ENTERING: %s ",(a))) #define DPE1(a) (printk(" ENTERING: %s",(a))) #define DPS1(a) (printk(" %s ",(a))) |
1da177e4c
|
68 69 70 71 72 |
/* * NAME: extAlloc() * |
f720e3ba5
|
73 |
* FUNCTION: allocate an extent for a specified page range within a |
1da177e4c
|
74 75 76 77 78 79 80 81 82 83 |
* file. * * PARAMETERS: * ip - the inode of the file. * xlen - requested extent length. * pno - the starting page number with the file. * xp - pointer to an xad. on entry, xad describes an * extent that is used as an allocation hint if the * xaddr of the xad is non-zero. on successful exit, * the xad describes the newly allocated extent. |
4d81715fc
|
84 |
* abnr - bool indicating whether the newly allocated extent |
1da177e4c
|
85 86 87 |
* should be marked as allocated but not recorded. * * RETURN VALUES: |
f720e3ba5
|
88 89 90 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
91 92 |
*/ int |
4d81715fc
|
93 |
extAlloc(struct inode *ip, s64 xlen, s64 pno, xad_t * xp, bool abnr) |
1da177e4c
|
94 95 96 97 98 99 100 101 102 103 |
{ struct jfs_sb_info *sbi = JFS_SBI(ip->i_sb); s64 nxlen, nxaddr, xoff, hint, xaddr = 0; int rc; int xflag; /* This blocks if we are low on resources */ txBeginAnon(ip->i_sb); /* Avoid race with jfs_commit_inode() */ |
1de87444f
|
104 |
mutex_lock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 |
/* validate extent length */ if (xlen > MAXXLEN) xlen = MAXXLEN; /* get the page's starting extent offset */ xoff = pno << sbi->l2nbperpage; /* check if an allocation hint was provided */ if ((hint = addressXAD(xp))) { /* get the size of the extent described by the hint */ nxlen = lengthXAD(xp); /* check if the hint is for the portion of the file * immediately previous to the current allocation * request and if hint extent has the same abnr * value as the current request. if so, we can * extend the hint extent to include the current * extent if we can allocate the blocks immediately * following the hint extent. */ if (offsetXAD(xp) + nxlen == xoff && |
4d81715fc
|
127 |
abnr == ((xp->flag & XAD_NOTRECORDED) ? true : false)) |
1da177e4c
|
128 129 130 131 132 133 134 |
xaddr = hint + nxlen; /* adjust the hint to the last block of the extent */ hint += (nxlen - 1); } /* allocate the disk blocks for the extent. initially, extBalloc() |
63f83c9fc
|
135 |
* will try to allocate disk blocks for the requested size (xlen). |
d6e05edc5
|
136 |
* if this fails (xlen contiguous free blocks not avaliable), it'll |
1da177e4c
|
137 138 139 140 141 142 143 144 145 |
* try to allocate a smaller number of blocks (producing a smaller * extent), with this smaller number of blocks consisting of the * requested number of blocks rounded down to the next smaller * power of 2 number (i.e. 16 -> 8). it'll continue to round down * and retry the allocation until the number of blocks to allocate * is smaller than the number of blocks per page. */ nxlen = xlen; if ((rc = extBalloc(ip, hint ? hint : INOHINT(ip), &nxlen, &nxaddr))) { |
1de87444f
|
146 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
147 148 149 150 |
return (rc); } /* Allocate blocks to quota. */ |
c94d2a22f
|
151 |
if (vfs_dq_alloc_block(ip, nxlen)) { |
1da177e4c
|
152 |
dbFree(ip, nxaddr, (s64) nxlen); |
1de87444f
|
153 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
154 155 156 157 |
return -EDQUOT; } /* determine the value of the extent flag */ |
4d81715fc
|
158 |
xflag = abnr ? XAD_NOTRECORDED : 0; |
1da177e4c
|
159 |
|
63f83c9fc
|
160 |
/* if we can extend the hint extent to cover the current request, |
1da177e4c
|
161 162 163 164 165 166 167 |
* extend it. otherwise, insert a new extent to * cover the current request. */ if (xaddr && xaddr == nxaddr) rc = xtExtend(0, ip, xoff, (int) nxlen, 0); else rc = xtInsert(0, ip, xflag, xoff, (int) nxlen, &nxaddr, 0); |
63f83c9fc
|
168 |
/* if the extend or insert failed, |
1da177e4c
|
169 170 171 172 |
* free the newly allocated blocks and return the error. */ if (rc) { dbFree(ip, nxaddr, nxlen); |
c94d2a22f
|
173 |
vfs_dq_free_block(ip, nxlen); |
1de87444f
|
174 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
175 176 177 178 179 180 181 182 183 184 |
return (rc); } /* set the results of the extent allocation */ XADaddress(xp, nxaddr); XADlength(xp, nxlen); XADoffset(xp, xoff); xp->flag = xflag; mark_inode_dirty(ip); |
1de87444f
|
185 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
186 187 188 189 190 191 192 193 194 195 196 197 198 199 |
/* * COMMIT_SyncList flags an anonymous tlock on page that is on * sync list. * We need to commit the inode to get the page written disk. */ if (test_and_clear_cflag(COMMIT_Synclist,ip)) jfs_commit_inode(ip, 0); return (0); } #ifdef _NOTYET /* |
f720e3ba5
|
200 |
* NAME: extRealloc() |
1da177e4c
|
201 |
* |
f720e3ba5
|
202 |
* FUNCTION: extend the allocation of a file extent containing a |
1da177e4c
|
203 204 205 206 207 208 209 210 |
* partial back last page. * * PARAMETERS: * ip - the inode of the file. * cp - cbuf for the partial backed last page. * xlen - request size of the resulting extent. * xp - pointer to an xad. on successful exit, the xad * describes the newly allocated extent. |
4d81715fc
|
211 |
* abnr - bool indicating whether the newly allocated extent |
1da177e4c
|
212 213 214 |
* should be marked as allocated but not recorded. * * RETURN VALUES: |
f720e3ba5
|
215 216 217 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
218 |
*/ |
4d81715fc
|
219 |
int extRealloc(struct inode *ip, s64 nxlen, xad_t * xp, bool abnr) |
1da177e4c
|
220 221 222 223 224 225 226 227 228 |
{ struct super_block *sb = ip->i_sb; s64 xaddr, xlen, nxaddr, delta, xoff; s64 ntail, nextend, ninsert; int rc, nbperpage = JFS_SBI(sb)->nbperpage; int xflag; /* This blocks if we are low on resources */ txBeginAnon(ip->i_sb); |
1de87444f
|
229 |
mutex_lock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
230 231 232 233 234 235 236 237 238 239 240 241 |
/* validate extent length */ if (nxlen > MAXXLEN) nxlen = MAXXLEN; /* get the extend (partial) page's disk block address and * number of blocks. */ xaddr = addressXAD(xp); xlen = lengthXAD(xp); xoff = offsetXAD(xp); /* if the extend page is abnr and if the request is for |
63f83c9fc
|
242 |
* the extent to be allocated and recorded, |
1da177e4c
|
243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 |
* make the page allocated and recorded. */ if ((xp->flag & XAD_NOTRECORDED) && !abnr) { xp->flag = 0; if ((rc = xtUpdate(0, ip, xp))) goto exit; } /* try to allocated the request number of blocks for the * extent. dbRealloc() first tries to satisfy the request * by extending the allocation in place. otherwise, it will * try to allocate a new set of blocks large enough for the * request. in satisfying a request, dbReAlloc() may allocate * less than what was request but will always allocate enough * space as to satisfy the extend page. */ if ((rc = extBrealloc(ip, xaddr, xlen, &nxlen, &nxaddr))) goto exit; /* Allocat blocks to quota. */ |
c94d2a22f
|
263 |
if (vfs_dq_alloc_block(ip, nxlen)) { |
1da177e4c
|
264 |
dbFree(ip, nxaddr, (s64) nxlen); |
1de87444f
|
265 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 |
return -EDQUOT; } delta = nxlen - xlen; /* check if the extend page is not abnr but the request is abnr * and the allocated disk space is for more than one page. if this * is the case, there is a miss match of abnr between the extend page * and the one or more pages following the extend page. as a result, * two extents will have to be manipulated. the first will be that * of the extent of the extend page and will be manipulated thru * an xtExtend() or an xtTailgate(), depending upon whether the * disk allocation occurred as an inplace extension. the second * extent will be manipulated (created) through an xtInsert() and * will be for the pages following the extend page. */ if (abnr && (!(xp->flag & XAD_NOTRECORDED)) && (nxlen > nbperpage)) { ntail = nbperpage; nextend = ntail - xlen; ninsert = nxlen - nbperpage; xflag = XAD_NOTRECORDED; } else { ntail = nxlen; nextend = delta; ninsert = 0; xflag = xp->flag; } /* if we were able to extend the disk allocation in place, * extend the extent. otherwise, move the extent to a * new disk location. */ if (xaddr == nxaddr) { /* extend the extent */ if ((rc = xtExtend(0, ip, xoff + xlen, (int) nextend, 0))) { dbFree(ip, xaddr + xlen, delta); |
c94d2a22f
|
304 |
vfs_dq_free_block(ip, nxlen); |
1da177e4c
|
305 306 307 308 309 310 311 312 313 314 |
goto exit; } } else { /* * move the extent to a new location: * * xtTailgate() accounts for relocated tail extent; */ if ((rc = xtTailgate(0, ip, xoff, (int) ntail, nxaddr, 0))) { dbFree(ip, nxaddr, nxlen); |
c94d2a22f
|
315 |
vfs_dq_free_block(ip, nxlen); |
1da177e4c
|
316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 |
goto exit; } } /* check if we need to also insert a new extent */ if (ninsert) { /* perform the insert. if it fails, free the blocks * to be inserted and make it appear that we only did * the xtExtend() or xtTailgate() above. */ xaddr = nxaddr + ntail; if (xtInsert (0, ip, xflag, xoff + ntail, (int) ninsert, &xaddr, 0)) { dbFree(ip, xaddr, (s64) ninsert); delta = nextend; nxlen = ntail; xflag = 0; } } /* set the return results */ XADaddress(xp, nxaddr); XADlength(xp, nxlen); XADoffset(xp, xoff); xp->flag = xflag; mark_inode_dirty(ip); exit: |
1de87444f
|
345 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
346 347 348 349 350 351 |
return (rc); } #endif /* _NOTYET */ /* |
f720e3ba5
|
352 |
* NAME: extHint() |
1da177e4c
|
353 |
* |
f720e3ba5
|
354 |
* FUNCTION: produce an extent allocation hint for a file offset. |
1da177e4c
|
355 356 357 358 359 360 361 362 |
* * PARAMETERS: * ip - the inode of the file. * offset - file offset for which the hint is needed. * xp - pointer to the xad that is to be filled in with * the hint. * * RETURN VALUES: |
f720e3ba5
|
363 364 |
* 0 - success * -EIO - i/o error. |
1da177e4c
|
365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 |
*/ int extHint(struct inode *ip, s64 offset, xad_t * xp) { struct super_block *sb = ip->i_sb; struct xadlist xadl; struct lxdlist lxdl; lxd_t lxd; s64 prev; int rc, nbperpage = JFS_SBI(sb)->nbperpage; /* init the hint as "no hint provided" */ XADaddress(xp, 0); /* determine the starting extent offset of the page previous * to the page containing the offset. */ prev = ((offset & ~POFFSET) >> JFS_SBI(sb)->l2bsize) - nbperpage; /* if the offsets in the first page of the file, * no hint provided. */ if (prev < 0) return (0); /* prepare to lookup the previous page's extent info */ lxdl.maxnlxd = 1; lxdl.nlxd = 1; lxdl.lxd = &lxd; LXDoffset(&lxd, prev) |
f720e3ba5
|
394 |
LXDlength(&lxd, nbperpage); |
1da177e4c
|
395 396 397 398 399 400 401 402 |
xadl.maxnxad = 1; xadl.nxad = 0; xadl.xad = xp; /* perform the lookup */ if ((rc = xtLookupList(ip, &lxdl, &xadl, 0))) return (rc); |
f720e3ba5
|
403 |
/* check if no extent exists for the previous page. |
1da177e4c
|
404 405 406 |
* this is possible for sparse files. */ if (xadl.nxad == 0) { |
f720e3ba5
|
407 |
// assert(ISSPARSE(ip)); |
1da177e4c
|
408 409 410 411 412 413 414 |
return (0); } /* only preserve the abnr flag within the xad flags * of the returned hint. */ xp->flag &= XAD_NOTRECORDED; |
f720e3ba5
|
415 |
if(xadl.nxad != 1 || lengthXAD(xp) != nbperpage) { |
1da177e4c
|
416 417 |
jfs_error(ip->i_sb, "extHint: corrupt xtree"); return -EIO; |
f720e3ba5
|
418 |
} |
1da177e4c
|
419 420 421 422 423 424 |
return (0); } /* |
f720e3ba5
|
425 |
* NAME: extRecord() |
1da177e4c
|
426 |
* |
f720e3ba5
|
427 |
* FUNCTION: change a page with a file from not recorded to recorded. |
1da177e4c
|
428 429 430 431 432 433 |
* * PARAMETERS: * ip - inode of the file. * cp - cbuf of the file page. * * RETURN VALUES: |
f720e3ba5
|
434 435 436 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
437 438 439 440 441 442 |
*/ int extRecord(struct inode *ip, xad_t * xp) { int rc; txBeginAnon(ip->i_sb); |
1de87444f
|
443 |
mutex_lock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
444 445 446 |
/* update the extent */ rc = xtUpdate(0, ip, xp); |
1de87444f
|
447 |
mutex_unlock(&JFS_IP(ip)->commit_mutex); |
1da177e4c
|
448 449 450 451 452 453 |
return rc; } #ifdef _NOTYET /* |
f720e3ba5
|
454 |
* NAME: extFill() |
1da177e4c
|
455 |
* |
f720e3ba5
|
456 |
* FUNCTION: allocate disk space for a file page that represents |
1da177e4c
|
457 458 459 460 461 462 463 |
* a file hole. * * PARAMETERS: * ip - the inode of the file. * cp - cbuf of the file page represent the hole. * * RETURN VALUES: |
f720e3ba5
|
464 465 466 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
467 468 469 470 |
*/ int extFill(struct inode *ip, xad_t * xp) { int rc, nbperpage = JFS_SBI(ip->i_sb)->nbperpage; |
ba52de123
|
471 |
s64 blkno = offsetXAD(xp) >> ip->i_blkbits; |
1da177e4c
|
472 |
|
f720e3ba5
|
473 |
// assert(ISSPARSE(ip)); |
1da177e4c
|
474 475 476 477 478 |
/* initialize the extent allocation hint */ XADaddress(xp, 0); /* allocate an extent to fill the hole */ |
4d81715fc
|
479 |
if ((rc = extAlloc(ip, nbperpage, blkno, xp, false))) |
1da177e4c
|
480 481 482 483 484 485 486 487 488 489 490 491 |
return (rc); assert(lengthPXD(xp) == nbperpage); return (0); } #endif /* _NOTYET */ /* * NAME: extBalloc() * |
f720e3ba5
|
492 |
* FUNCTION: allocate disk blocks to form an extent. |
1da177e4c
|
493 494 |
* * initially, we will try to allocate disk blocks for the |
63f83c9fc
|
495 |
* requested size (nblocks). if this fails (nblocks |
d6e05edc5
|
496 |
* contiguous free blocks not avaliable), we'll try to allocate |
1da177e4c
|
497 498 499 500 501 502 |
* a smaller number of blocks (producing a smaller extent), with * this smaller number of blocks consisting of the requested * number of blocks rounded down to the next smaller power of 2 * number (i.e. 16 -> 8). we'll continue to round down and * retry the allocation until the number of blocks to allocate * is smaller than the number of blocks per page. |
63f83c9fc
|
503 |
* |
1da177e4c
|
504 505 506 507 508 509 510 511 |
* PARAMETERS: * ip - the inode of the file. * hint - disk block number to be used as an allocation hint. * *nblocks - pointer to an s64 value. on entry, this value specifies * the desired number of block to be allocated. on successful * exit, this value is set to the number of blocks actually * allocated. * blkno - pointer to a block address that is filled in on successful |
63f83c9fc
|
512 |
* return with the starting block number of the newly |
1da177e4c
|
513 514 515 |
* allocated block range. * * RETURN VALUES: |
f720e3ba5
|
516 517 518 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
519 520 521 522 523 524 525 526 527 528 529 530 531 |
*/ static int extBalloc(struct inode *ip, s64 hint, s64 * nblocks, s64 * blkno) { struct jfs_inode_info *ji = JFS_IP(ip); struct jfs_sb_info *sbi = JFS_SBI(ip->i_sb); s64 nb, nblks, daddr, max; int rc, nbperpage = sbi->nbperpage; struct bmap *bmp = sbi->bmap; int ag; /* get the number of blocks to initially attempt to allocate. * we'll first try the number of blocks requested unless this |
d6e05edc5
|
532 |
* number is greater than the maximum number of contiguous free |
63f83c9fc
|
533 |
* blocks in the map. in that case, we'll start off with the |
1da177e4c
|
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 |
* maximum free. */ max = (s64) 1 << bmp->db_maxfreebud; if (*nblocks >= max && *nblocks > nbperpage) nb = nblks = (max > nbperpage) ? max : nbperpage; else nb = nblks = *nblocks; /* try to allocate blocks */ while ((rc = dbAlloc(ip, hint, nb, &daddr)) != 0) { /* if something other than an out of space error, * stop and return this error. */ if (rc != -ENOSPC) return (rc); /* decrease the allocation request size */ nb = min(nblks, extRoundDown(nb)); /* give up if we cannot cover a page */ if (nb < nbperpage) return (rc); } *nblocks = nb; *blkno = daddr; if (S_ISREG(ip->i_mode) && (ji->fileset == FILESYSTEM_I)) { ag = BLKTOAG(daddr, sbi); spin_lock_irq(&ji->ag_lock); if (ji->active_ag == -1) { atomic_inc(&bmp->db_active[ag]); ji->active_ag = ag; } else if (ji->active_ag != ag) { atomic_dec(&bmp->db_active[ji->active_ag]); atomic_inc(&bmp->db_active[ag]); ji->active_ag = ag; } spin_unlock_irq(&ji->ag_lock); } return (0); } #ifdef _NOTYET /* * NAME: extBrealloc() * |
f720e3ba5
|
583 |
* FUNCTION: attempt to extend an extent's allocation. |
1da177e4c
|
584 |
* |
63f83c9fc
|
585 586 587 |
* Initially, we will try to extend the extent's allocation * in place. If this fails, we'll try to move the extent * to a new set of blocks. If moving the extent, we initially |
1da177e4c
|
588 |
* will try to allocate disk blocks for the requested size |
63f83c9fc
|
589 590 |
* (newnblks). if this fails (new contiguous free blocks not * avaliable), we'll try to allocate a smaller number of |
1da177e4c
|
591 592 593 |
* blocks (producing a smaller extent), with this smaller * number of blocks consisting of the requested number of * blocks rounded down to the next smaller power of 2 |
63f83c9fc
|
594 |
* number (i.e. 16 -> 8). We'll continue to round down and |
1da177e4c
|
595 596 |
* retry the allocation until the number of blocks to allocate * is smaller than the number of blocks per page. |
63f83c9fc
|
597 |
* |
1da177e4c
|
598 599 |
* PARAMETERS: * ip - the inode of the file. |
f720e3ba5
|
600 601 |
* blkno - starting block number of the extents current allocation. * nblks - number of blocks within the extents current allocation. |
1da177e4c
|
602 603 604 605 606 607 608 |
* newnblks - pointer to a s64 value. on entry, this value is the * the new desired extent size (number of blocks). on * successful exit, this value is set to the extent's actual * new size (new number of blocks). * newblkno - the starting block number of the extents new allocation. * * RETURN VALUES: |
f720e3ba5
|
609 610 611 |
* 0 - success * -EIO - i/o error. * -ENOSPC - insufficient disk resources. |
1da177e4c
|
612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 |
*/ static int extBrealloc(struct inode *ip, s64 blkno, s64 nblks, s64 * newnblks, s64 * newblkno) { int rc; /* try to extend in place */ if ((rc = dbExtend(ip, blkno, nblks, *newnblks - nblks)) == 0) { *newblkno = blkno; return (0); } else { if (rc != -ENOSPC) return (rc); } |
63f83c9fc
|
627 |
/* in place extension not possible. |
1da177e4c
|
628 629 630 631 632 633 634 635 |
* try to move the extent to a new set of blocks. */ return (extBalloc(ip, blkno, newnblks, newblkno)); } #endif /* _NOTYET */ /* |
f720e3ba5
|
636 |
* NAME: extRoundDown() |
1da177e4c
|
637 |
* |
f720e3ba5
|
638 |
* FUNCTION: round down a specified number of blocks to the next |
1da177e4c
|
639 640 641 642 643 644 |
* smallest power of 2 number. * * PARAMETERS: * nb - the inode of the file. * * RETURN VALUES: |
f720e3ba5
|
645 |
* next smallest power of 2 number. |
1da177e4c
|
646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 |
*/ static s64 extRoundDown(s64 nb) { int i; u64 m, k; for (i = 0, m = (u64) 1 << 63; i < 64; i++, m >>= 1) { if (m & nb) break; } i = 63 - i; k = (u64) 1 << i; k = ((k - 1) & nb) ? k : k >> 1; return (k); } |