udf_strat_rmw.c revision 1.5
1 /* $NetBSD: udf_strat_rmw.c,v 1.5 2008/07/07 18:45:27 reinoud Exp $ */ 2 3 /* 4 * Copyright (c) 2006, 2008 Reinoud Zandijk 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 * 27 */ 28 29 #include <sys/cdefs.h> 30 #ifndef lint 31 __KERNEL_RCSID(0, "$NetBSD: udf_strat_rmw.c,v 1.5 2008/07/07 18:45:27 reinoud Exp $"); 32 #endif /* not lint */ 33 34 35 #if defined(_KERNEL_OPT) 36 #include "opt_quota.h" 37 #include "opt_compat_netbsd.h" 38 #endif 39 40 #include <sys/param.h> 41 #include <sys/systm.h> 42 #include <sys/sysctl.h> 43 #include <sys/namei.h> 44 #include <sys/proc.h> 45 #include <sys/kernel.h> 46 #include <sys/vnode.h> 47 #include <miscfs/genfs/genfs_node.h> 48 #include <sys/mount.h> 49 #include <sys/buf.h> 50 #include <sys/file.h> 51 #include <sys/device.h> 52 #include <sys/disklabel.h> 53 #include <sys/ioctl.h> 54 #include <sys/malloc.h> 55 #include <sys/dirent.h> 56 #include <sys/stat.h> 57 #include <sys/conf.h> 58 #include <sys/kauth.h> 59 #include <sys/kthread.h> 60 #include <dev/clock_subr.h> 61 62 #include <fs/udf/ecma167-udf.h> 63 #include <fs/udf/udf_mount.h> 64 65 #if defined(_KERNEL_OPT) 66 #include "opt_udf.h" 67 #endif 68 69 #include "udf.h" 70 #include "udf_subr.h" 71 #include "udf_bswap.h" 72 73 74 #define VTOI(vnode) ((struct udf_node *) (vnode)->v_data) 75 #define PRIV(ump) ((struct strat_private *) (ump)->strategy_private) 76 #define BTOE(buf) ((struct udf_eccline *) ((buf)->b_private)) 77 78 /* --------------------------------------------------------------------- */ 79 80 #define UDF_MAX_PACKET_SIZE 64 /* DONT change this */ 81 82 /* sheduler states */ 83 #define UDF_SHED_MAX 6 84 #define UDF_SHED_READING 1 85 #define UDF_SHED_WRITING 2 86 #define UDF_SHED_SEQWRITING 3 87 #define UDF_SHED_IDLE 4 /* resting */ 88 #define UDF_SHED_FREE 5 /* recycleable */ 89 90 /* flags */ 91 #define ECC_LOCKED 0x01 /* prevent access */ 92 #define ECC_WANTED 0x02 /* trying access */ 93 #define ECC_SEQWRITING 0x04 /* sequential queue */ 94 #define ECC_FLOATING 0x08 /* not queued yet */ 95 96 97 TAILQ_HEAD(ecclineq, udf_eccline); 98 struct udf_eccline { 99 struct udf_mount *ump; 100 uint64_t present; /* preserve these */ 101 uint64_t readin; /* bitmap */ 102 uint64_t dirty; /* bitmap */ 103 uint64_t error; /* bitmap */ 104 uint32_t refcnt; 105 106 uint32_t flags; 107 uint32_t start_sector; /* physical */ 108 109 struct buf *buf; 110 void *blob; 111 112 struct buf *bufs[UDF_MAX_PACKET_SIZE]; 113 uint32_t bufs_bpos[UDF_MAX_PACKET_SIZE]; 114 int bufs_len[UDF_MAX_PACKET_SIZE]; 115 116 int queued_on; /* on which BUFQ list */ 117 LIST_ENTRY(udf_eccline) hashchain; /* on sector lookup */ 118 }; 119 120 121 struct strat_private { 122 lwp_t *queue_lwp; 123 kcondvar_t discstrat_cv; /* to wait on */ 124 kmutex_t discstrat_mutex; /* disc strategy */ 125 kmutex_t seqwrite_mutex; /* protect mappings */ 126 127 int run_thread; /* thread control */ 128 int thread_finished; /* thread control */ 129 int cur_queue; 130 131 int num_floating; 132 int num_queued[UDF_SHED_MAX]; 133 struct bufq_state *queues[UDF_SHED_MAX]; 134 struct timespec last_queued[UDF_SHED_MAX]; 135 struct disk_strategy old_strategy_setting; 136 137 struct pool eccline_pool; 138 struct pool ecclineblob_pool; 139 LIST_HEAD(, udf_eccline) eccline_hash[UDF_ECCBUF_HASHSIZE]; 140 }; 141 142 /* --------------------------------------------------------------------- */ 143 144 #define UDF_LOCK_ECCLINE(eccline) udf_lock_eccline(eccline) 145 #define UDF_UNLOCK_ECCLINE(eccline) udf_unlock_eccline(eccline) 146 147 /* can be called with or without discstrat lock */ 148 static void 149 udf_lock_eccline(struct udf_eccline *eccline) 150 { 151 struct strat_private *priv = PRIV(eccline->ump); 152 int waslocked, ret; 153 154 waslocked = mutex_owned(&priv->discstrat_mutex); 155 if (!waslocked) 156 mutex_enter(&priv->discstrat_mutex); 157 158 /* wait until its unlocked first */ 159 while (eccline->flags & ECC_LOCKED) { 160 eccline->flags |= ECC_WANTED; 161 ret = cv_timedwait(&priv->discstrat_cv, &priv->discstrat_mutex, 162 hz/8); 163 if (ret == EWOULDBLOCK) 164 DPRINTF(LOCKING, ("eccline lock helt, waiting for " 165 "release")); 166 } 167 eccline->flags |= ECC_LOCKED; 168 eccline->flags &= ~ECC_WANTED; 169 170 if (!waslocked) 171 mutex_exit(&priv->discstrat_mutex); 172 } 173 174 175 /* can be called with or without discstrat lock */ 176 static void 177 udf_unlock_eccline(struct udf_eccline *eccline) 178 { 179 struct strat_private *priv = PRIV(eccline->ump); 180 int waslocked; 181 182 KASSERT(mutex_owned(&priv->discstrat_mutex)); 183 184 waslocked = mutex_owned(&priv->discstrat_mutex); 185 if (!waslocked) 186 mutex_enter(&priv->discstrat_mutex); 187 188 eccline->flags &= ~ECC_LOCKED; 189 cv_broadcast(&priv->discstrat_cv); 190 191 if (!waslocked) 192 mutex_exit(&priv->discstrat_mutex); 193 } 194 195 196 /* NOTE discstrat_mutex should be held! */ 197 static void 198 udf_dispose_eccline(struct udf_eccline *eccline) 199 { 200 struct strat_private *priv = PRIV(eccline->ump); 201 struct buf *ret; 202 203 KASSERT(mutex_owned(&priv->discstrat_mutex)); 204 205 KASSERT(eccline->refcnt == 0); 206 KASSERT(eccline->dirty == 0); 207 208 DPRINTF(ECCLINE, ("dispose eccline with start sector %d, " 209 "present %0"PRIx64"\n", eccline->start_sector, 210 eccline->present)); 211 212 if (eccline->queued_on) { 213 ret = BUFQ_CANCEL(priv->queues[eccline->queued_on], eccline->buf); 214 KASSERT(ret == eccline->buf); 215 priv->num_queued[eccline->queued_on]--; 216 } 217 LIST_REMOVE(eccline, hashchain); 218 219 if (eccline->flags & ECC_FLOATING) { 220 eccline->flags &= ~ECC_FLOATING; 221 priv->num_floating--; 222 } 223 224 putiobuf(eccline->buf); 225 pool_put(&priv->ecclineblob_pool, eccline->blob); 226 pool_put(&priv->eccline_pool, eccline); 227 } 228 229 230 /* NOTE discstrat_mutex should be held! */ 231 static void 232 udf_push_eccline(struct udf_eccline *eccline, int newqueue) 233 { 234 struct strat_private *priv = PRIV(eccline->ump); 235 struct buf *ret; 236 int curqueue; 237 238 KASSERT(mutex_owned(&priv->discstrat_mutex)); 239 240 DPRINTF(PARANOIA, ("DEBUG: buf %p pushed on queue %d\n", eccline->buf, newqueue)); 241 242 /* requeue */ 243 curqueue = eccline->queued_on; 244 if (curqueue) { 245 ret = BUFQ_CANCEL(priv->queues[curqueue], eccline->buf); 246 247 DPRINTF(PARANOIA, ("push_eccline BUFQ_CANCEL returned %p when " 248 "requested to remove %p from queue %d\n", ret, 249 eccline->buf, curqueue)); 250 #ifdef DIAGNOSTIC 251 if (ret == NULL) { 252 int i; 253 254 printf("udf_push_eccline: bufq_cancel can't find " 255 "buffer; dumping queues\n"); 256 for (i = 1; i < UDF_SHED_MAX; i++) { 257 printf("queue %d\n\t", i); 258 ret = BUFQ_GET(priv->queues[i]); 259 while (ret) { 260 printf("%p ", ret); 261 if (ret == eccline->buf) 262 printf("[<-] "); 263 ret = BUFQ_GET(priv->queues[i]); 264 } 265 printf("\n"); 266 } 267 panic("fatal queue bug; exit"); 268 } 269 #endif 270 271 KASSERT(ret == eccline->buf); 272 priv->num_queued[curqueue]--; 273 } 274 275 BUFQ_PUT(priv->queues[newqueue], eccline->buf); 276 eccline->queued_on = newqueue; 277 priv->num_queued[newqueue]++; 278 vfs_timestamp(&priv->last_queued[newqueue]); 279 280 if (eccline->flags & ECC_FLOATING) { 281 eccline->flags &= ~ECC_FLOATING; 282 priv->num_floating--; 283 } 284 285 if ((newqueue != UDF_SHED_FREE) && (newqueue != UDF_SHED_IDLE)) 286 cv_signal(&priv->discstrat_cv); 287 } 288 289 290 static struct udf_eccline * 291 udf_pop_eccline(struct strat_private *priv, int queued_on) 292 { 293 struct udf_eccline *eccline; 294 struct buf *buf; 295 296 KASSERT(mutex_owned(&priv->discstrat_mutex)); 297 298 buf = BUFQ_GET(priv->queues[queued_on]); 299 if (!buf) { 300 KASSERT(priv->num_queued[queued_on] == 0); 301 return NULL; 302 } 303 304 eccline = BTOE(buf); 305 KASSERT(eccline->queued_on == queued_on); 306 eccline->queued_on = 0; 307 priv->num_queued[queued_on]--; 308 309 if (eccline->flags & ECC_FLOATING) 310 panic("popping already marked floating eccline"); 311 eccline->flags |= ECC_FLOATING; 312 priv->num_floating++; 313 314 DPRINTF(PARANOIA, ("DEBUG: buf %p popped from queue %d\n", 315 eccline->buf, queued_on)); 316 317 return eccline; 318 } 319 320 321 static struct udf_eccline * 322 udf_geteccline(struct udf_mount *ump, uint32_t sector, int flags) 323 { 324 struct strat_private *priv = PRIV(ump); 325 struct udf_eccline *eccline; 326 uint32_t start_sector, lb_size, blobsize; 327 uint8_t *eccline_blob; 328 int line, line_offset; 329 int num_busy, ret; 330 331 line_offset = sector % ump->packet_size; 332 start_sector = sector - line_offset; 333 line = (start_sector/ump->packet_size) & UDF_ECCBUF_HASHMASK; 334 335 mutex_enter(&priv->discstrat_mutex); 336 337 retry: 338 DPRINTF(ECCLINE, ("get line sector %d, line %d\n", sector, line)); 339 LIST_FOREACH(eccline, &priv->eccline_hash[line], hashchain) { 340 if (eccline->start_sector == start_sector) { 341 DPRINTF(ECCLINE, ("\tfound eccline, start_sector %d\n", 342 eccline->start_sector)); 343 344 UDF_LOCK_ECCLINE(eccline); 345 /* move from freelist (!) */ 346 if (eccline->queued_on == UDF_SHED_FREE) { 347 DPRINTF(ECCLINE, ("was on freelist\n")); 348 KASSERT(eccline->refcnt == 0); 349 udf_push_eccline(eccline, UDF_SHED_IDLE); 350 } 351 eccline->refcnt++; 352 mutex_exit(&priv->discstrat_mutex); 353 return eccline; 354 } 355 } 356 357 DPRINTF(ECCLINE, ("\tnot found in eccline cache\n")); 358 /* not found in eccline cache */ 359 360 lb_size = udf_rw32(ump->logical_vol->lb_size); 361 blobsize = ump->packet_size * lb_size; 362 363 /* dont allow too many pending requests */ 364 DPRINTF(ECCLINE, ("\tallocating new eccline\n")); 365 num_busy = (priv->num_queued[UDF_SHED_SEQWRITING] + priv->num_floating); 366 if ((flags & ECC_SEQWRITING) && (num_busy > UDF_ECCLINE_MAXBUSY)) { 367 ret = cv_timedwait(&priv->discstrat_cv, 368 &priv->discstrat_mutex, hz/8); 369 goto retry; 370 } 371 372 eccline_blob = pool_get(&priv->ecclineblob_pool, PR_NOWAIT); 373 eccline = pool_get(&priv->eccline_pool, PR_NOWAIT); 374 if ((eccline_blob == NULL) || (eccline == NULL)) { 375 if (eccline_blob) 376 pool_put(&priv->ecclineblob_pool, eccline_blob); 377 if (eccline) 378 pool_put(&priv->eccline_pool, eccline); 379 380 /* out of memory for now; canibalise freelist */ 381 eccline = udf_pop_eccline(priv, UDF_SHED_FREE); 382 if (eccline == NULL) { 383 /* serious trouble; wait and retry */ 384 cv_timedwait(&priv->discstrat_cv, 385 &priv->discstrat_mutex, hz/8); 386 goto retry; 387 } 388 /* push back line if we're waiting for it */ 389 if (eccline->flags & ECC_WANTED) { 390 udf_push_eccline(eccline, UDF_SHED_IDLE); 391 goto retry; 392 } 393 394 /* unlink this entry */ 395 LIST_REMOVE(eccline, hashchain); 396 397 KASSERT(eccline->flags & ECC_FLOATING); 398 399 eccline_blob = eccline->blob; 400 memset(eccline, 0, sizeof(struct udf_eccline)); 401 eccline->flags = ECC_FLOATING; 402 } else { 403 memset(eccline, 0, sizeof(struct udf_eccline)); 404 eccline->flags = ECC_FLOATING; 405 priv->num_floating++; 406 } 407 408 eccline->queued_on = 0; 409 eccline->blob = eccline_blob; 410 eccline->buf = getiobuf(NULL, true); 411 eccline->buf->b_private = eccline; /* IMPORTANT */ 412 413 /* initialise eccline blob */ 414 memset(eccline->blob, 0, blobsize); 415 416 eccline->ump = ump; 417 eccline->present = eccline->readin = eccline->dirty = 0; 418 eccline->error = 0; 419 eccline->refcnt = 0; 420 eccline->start_sector = start_sector; 421 422 LIST_INSERT_HEAD(&priv->eccline_hash[line], eccline, hashchain); 423 424 /* 425 * TODO possible optimalisation for checking overlap with partitions 426 * to get a clue on future eccline usage 427 */ 428 eccline->refcnt++; 429 UDF_LOCK_ECCLINE(eccline); 430 431 mutex_exit(&priv->discstrat_mutex); 432 433 return eccline; 434 } 435 436 437 static void 438 udf_puteccline(struct udf_eccline *eccline) 439 { 440 struct strat_private *priv = PRIV(eccline->ump); 441 struct udf_eccline *deccline; 442 struct udf_mount *ump = eccline->ump; 443 uint64_t allbits = ((uint64_t) 1 << ump->packet_size)-1; 444 int newqueue, tries; 445 446 mutex_enter(&priv->discstrat_mutex); 447 448 /* clear directly all readin requests from present ones */ 449 if (eccline->readin & eccline->present) { 450 /* clear all read bits that are already read in */ 451 eccline->readin &= (~eccline->present) & allbits; 452 wakeup(eccline); 453 } 454 455 DPRINTF(ECCLINE, ("put eccline start sector %d, refcnt %d\n", 456 eccline->start_sector, eccline->refcnt)); 457 458 /* requeue */ 459 newqueue = UDF_SHED_FREE; 460 if (eccline->refcnt > 1) 461 newqueue = UDF_SHED_IDLE; 462 if (eccline->flags & ECC_WANTED) 463 newqueue = UDF_SHED_IDLE; 464 if (eccline->dirty) { 465 newqueue = UDF_SHED_WRITING; 466 if (eccline->flags & ECC_SEQWRITING) 467 newqueue = UDF_SHED_SEQWRITING; 468 } 469 470 /* if we have active nodes */ 471 if (eccline->refcnt > 1) { 472 /* we dont set it on seqwriting */ 473 eccline->flags &= ~ECC_SEQWRITING; 474 } 475 476 /* if we need reading in or not all is yet present, queue reading */ 477 if ((eccline->readin) || (eccline->present != allbits)) 478 newqueue = UDF_SHED_READING; 479 480 /* reduce the number of kept free buffers */ 481 tries = priv->num_queued[UDF_SHED_FREE] - UDF_ECCLINE_MAXFREE; 482 while (tries > 0 /* priv->num_queued[UDF_SHED_FREE] > UDF_ECCLINE_MAXFREE */) { 483 deccline = udf_pop_eccline(priv, UDF_SHED_FREE); 484 KASSERT(deccline); 485 KASSERT(deccline->refcnt == 0); 486 if (deccline->flags & ECC_WANTED) { 487 udf_push_eccline(deccline, UDF_SHED_IDLE); 488 DPRINTF(ECCLINE, ("Tried removing, pushed back to free list\n")); 489 } else { 490 DPRINTF(ECCLINE, ("Removing entry from free list\n")); 491 udf_dispose_eccline(deccline); 492 } 493 tries--; 494 } 495 496 udf_push_eccline(eccline, newqueue); 497 498 KASSERT(eccline->refcnt >= 1); 499 eccline->refcnt--; 500 UDF_UNLOCK_ECCLINE(eccline); 501 502 mutex_exit(&priv->discstrat_mutex); 503 } 504 505 /* --------------------------------------------------------------------- */ 506 507 static int 508 udf_create_nodedscr_rmw(struct udf_strat_args *args) 509 { 510 union dscrptr **dscrptr = &args->dscr; 511 struct udf_mount *ump = args->ump; 512 struct long_ad *icb = args->icb; 513 struct udf_eccline *eccline; 514 uint64_t bit; 515 uint32_t sectornr, lb_size, dummy; 516 uint8_t *mem; 517 int error, eccsect; 518 519 error = udf_translate_vtop(ump, icb, §ornr, &dummy); 520 if (error) 521 return error; 522 523 lb_size = udf_rw32(ump->logical_vol->lb_size); 524 525 /* get our eccline */ 526 eccline = udf_geteccline(ump, sectornr, 0); 527 eccsect = sectornr - eccline->start_sector; 528 529 bit = (uint64_t) 1 << eccsect; 530 eccline->readin &= ~bit; /* just in case */ 531 eccline->present |= bit; 532 eccline->dirty &= ~bit; /* Err... euhm... clean? */ 533 534 eccline->refcnt++; 535 536 /* clear space */ 537 mem = ((uint8_t *) eccline->blob) + eccsect * lb_size; 538 memset(mem, 0, lb_size); 539 540 udf_puteccline(eccline); 541 542 *dscrptr = (union dscrptr *) mem; 543 return 0; 544 } 545 546 547 static void 548 udf_free_nodedscr_rmw(struct udf_strat_args *args) 549 { 550 struct udf_mount *ump = args->ump; 551 struct long_ad *icb = args->icb; 552 struct udf_eccline *eccline; 553 uint64_t bit; 554 uint32_t sectornr, dummy; 555 int error, eccsect; 556 557 error = udf_translate_vtop(ump, icb, §ornr, &dummy); 558 if (error) 559 return; 560 561 /* get our eccline */ 562 eccline = udf_geteccline(ump, sectornr, 0); 563 eccsect = sectornr - eccline->start_sector; 564 565 bit = (uint64_t) 1 << eccsect; 566 eccline->readin &= ~bit; /* just in case */ 567 568 KASSERT(eccline->refcnt >= 1); 569 eccline->refcnt--; 570 571 udf_puteccline(eccline); 572 } 573 574 575 static int 576 udf_read_nodedscr_rmw(struct udf_strat_args *args) 577 { 578 union dscrptr **dscrptr = &args->dscr; 579 struct udf_mount *ump = args->ump; 580 struct long_ad *icb = args->icb; 581 struct udf_eccline *eccline; 582 uint64_t bit; 583 uint32_t sectornr, dummy; 584 uint8_t *pos; 585 int sector_size = ump->discinfo.sector_size; 586 int lb_size = udf_rw32(ump->logical_vol->lb_size); 587 int i, error, dscrlen, eccsect; 588 589 lb_size = lb_size; 590 KASSERT(sector_size == lb_size); 591 error = udf_translate_vtop(ump, icb, §ornr, &dummy); 592 if (error) 593 return error; 594 595 /* get our eccline */ 596 eccline = udf_geteccline(ump, sectornr, 0); 597 eccsect = sectornr - eccline->start_sector; 598 599 bit = (uint64_t) 1 << eccsect; 600 if ((eccline->present & bit) == 0) { 601 /* mark bit for readin */ 602 eccline->readin |= bit; 603 eccline->refcnt++; /* prevent recycling */ 604 KASSERT(eccline->bufs[eccsect] == NULL); 605 udf_puteccline(eccline); 606 607 /* wait for completion; XXX remodel to lock bit code */ 608 error = 0; 609 while ((eccline->present & bit) == 0) { 610 tsleep(eccline, PRIBIO+1, "udflvdrd", hz/8); 611 if (eccline->error & bit) { 612 KASSERT(eccline->refcnt >= 1); 613 eccline->refcnt--; /* undo temp refcnt */ 614 *dscrptr = NULL; 615 return EIO; /* XXX error code */ 616 } 617 } 618 619 /* reget our line */ 620 eccline = udf_geteccline(ump, sectornr, 0); 621 KASSERT(eccline->refcnt >= 1); 622 eccline->refcnt--; /* undo refcnt */ 623 } 624 625 *dscrptr = (union dscrptr *) 626 (((uint8_t *) eccline->blob) + eccsect * sector_size); 627 628 /* code from read_phys_descr */ 629 /* check if its a valid tag */ 630 error = udf_check_tag(*dscrptr); 631 if (error) { 632 /* check if its an empty block */ 633 pos = (uint8_t *) *dscrptr; 634 for (i = 0; i < sector_size; i++, pos++) { 635 if (*pos) break; 636 } 637 if (i == sector_size) { 638 /* return no error but with no dscrptr */ 639 error = 0; 640 } 641 *dscrptr = NULL; 642 udf_puteccline(eccline); 643 return error; 644 } 645 646 /* calculate descriptor size */ 647 dscrlen = udf_tagsize(*dscrptr, sector_size); 648 error = udf_check_tag_payload(*dscrptr, dscrlen); 649 if (error) { 650 *dscrptr = NULL; 651 udf_puteccline(eccline); 652 return error; 653 } 654 655 eccline->refcnt++; 656 udf_puteccline(eccline); 657 658 return 0; 659 } 660 661 662 static int 663 udf_write_nodedscr_rmw(struct udf_strat_args *args) 664 { 665 union dscrptr *dscrptr = args->dscr; 666 struct udf_mount *ump = args->ump; 667 struct long_ad *icb = args->icb; 668 struct udf_node *udf_node = args->udf_node; 669 struct udf_eccline *eccline; 670 uint64_t bit; 671 uint32_t sectornr, logsectornr, dummy; 672 // int waitfor = args->waitfor; 673 int sector_size = ump->discinfo.sector_size; 674 int lb_size = udf_rw32(ump->logical_vol->lb_size); 675 int error, eccsect; 676 677 lb_size = lb_size; 678 KASSERT(sector_size == lb_size); 679 sectornr = 0; 680 error = udf_translate_vtop(ump, icb, §ornr, &dummy); 681 if (error) 682 return error; 683 684 /* add reference to the vnode to prevent recycling */ 685 vhold(udf_node->vnode); 686 687 /* get our eccline */ 688 eccline = udf_geteccline(ump, sectornr, 0); 689 eccsect = sectornr - eccline->start_sector; 690 691 bit = (uint64_t) 1 << eccsect; 692 693 /* old callback still pending? */ 694 if (eccline->bufs[eccsect]) { 695 DPRINTF(WRITE, ("udf_write_nodedscr_rmw: writing descriptor" 696 " over buffer?\n")); 697 nestiobuf_done(eccline->bufs[eccsect], 698 eccline->bufs_len[eccsect], 699 0); 700 eccline->bufs[eccsect] = NULL; 701 } 702 703 /* set sector number in the descriptor and validate */ 704 dscrptr = (union dscrptr *) 705 (((uint8_t *) eccline->blob) + eccsect * sector_size); 706 KASSERT(dscrptr == args->dscr); 707 708 logsectornr = udf_rw32(icb->loc.lb_num); 709 dscrptr->tag.tag_loc = udf_rw32(logsectornr); 710 udf_validate_tag_and_crc_sums(dscrptr); 711 712 udf_fixup_node_internals(ump, (uint8_t *) dscrptr, UDF_C_NODE); 713 714 /* set our flags */ 715 KASSERT(eccline->present & bit); 716 eccline->dirty |= bit; 717 718 KASSERT(udf_tagsize(dscrptr, sector_size) <= sector_size); 719 720 udf_puteccline(eccline); 721 722 holdrele(udf_node->vnode); 723 udf_node->outstanding_nodedscr--; 724 if (udf_node->outstanding_nodedscr == 0) { 725 UDF_UNLOCK_NODE(udf_node, udf_node->i_flags & IN_CALLBACK_ULK); 726 wakeup(&udf_node->outstanding_nodedscr); 727 } 728 729 /* XXX waitfor not used */ 730 return 0; 731 } 732 733 734 static void 735 udf_queuebuf_rmw(struct udf_strat_args *args) 736 { 737 struct udf_mount *ump = args->ump; 738 struct buf *buf = args->nestbuf; 739 struct strat_private *priv = PRIV(ump); 740 struct udf_eccline *eccline; 741 struct long_ad *node_ad_cpy; 742 uint64_t bit, *lmapping, *pmapping, *lmappos, *pmappos, blknr; 743 uint32_t buf_len, len, sectornr, our_sectornr; 744 uint32_t bpos; 745 uint8_t *fidblk, *src, *dst; 746 int sector_size = ump->discinfo.sector_size; 747 int blks = sector_size / DEV_BSIZE; 748 int eccsect, what, queue, error; 749 750 KASSERT(ump); 751 KASSERT(buf); 752 KASSERT(buf->b_iodone == nestiobuf_iodone); 753 754 blknr = buf->b_blkno; 755 our_sectornr = blknr / blks; 756 757 what = buf->b_udf_c_type; 758 queue = UDF_SHED_READING; 759 if ((buf->b_flags & B_READ) == 0) { 760 /* writing */ 761 queue = UDF_SHED_SEQWRITING; 762 if (what == UDF_C_DSCR) 763 queue = UDF_SHED_WRITING; 764 if (what == UDF_C_NODE) 765 queue = UDF_SHED_WRITING; 766 } 767 768 if (queue == UDF_SHED_READING) { 769 DPRINTF(SHEDULE, ("\nudf_queuebuf_rmw READ %p : sector %d type %d," 770 "b_resid %d, b_bcount %d, b_bufsize %d\n", 771 buf, (uint32_t) buf->b_blkno / blks, buf->b_udf_c_type, 772 buf->b_resid, buf->b_bcount, buf->b_bufsize)); 773 774 /* mark bits for reading */ 775 buf_len = buf->b_bcount; 776 sectornr = our_sectornr; 777 eccline = udf_geteccline(ump, sectornr, 0); 778 eccsect = sectornr - eccline->start_sector; 779 bpos = 0; 780 while (buf_len) { 781 len = MIN(buf_len, sector_size); 782 if (eccsect == ump->packet_size) { 783 udf_puteccline(eccline); 784 eccline = udf_geteccline(ump, sectornr, 0); 785 eccsect = sectornr - eccline->start_sector; 786 } 787 bit = (uint64_t) 1 << eccsect; 788 error = eccline->error & bit ? EIO : 0; 789 if (eccline->present & bit) { 790 src = (uint8_t *) eccline->blob + 791 eccsect * sector_size; 792 dst = (uint8_t *) buf->b_data + bpos; 793 if (!error) 794 memcpy(dst, src, len); 795 nestiobuf_done(buf, len, error); 796 } else { 797 eccline->readin |= bit; 798 KASSERT(eccline->bufs[eccsect] == NULL); 799 eccline->bufs[eccsect] = buf; 800 eccline->bufs_bpos[eccsect] = bpos; 801 eccline->bufs_len[eccsect] = len; 802 } 803 bpos += sector_size; 804 eccsect++; 805 sectornr++; 806 buf_len -= len; 807 } 808 udf_puteccline(eccline); 809 return; 810 } 811 812 if (queue == UDF_SHED_WRITING) { 813 DPRINTF(SHEDULE, ("\nudf_queuebuf_rmw WRITE %p : sector %d " 814 "type %d, b_resid %d, b_bcount %d, b_bufsize %d\n", 815 buf, (uint32_t) buf->b_blkno / blks, buf->b_udf_c_type, 816 buf->b_resid, buf->b_bcount, buf->b_bufsize)); 817 /* if we have FIDs fixup using buffer's sector number(s) */ 818 if (buf->b_udf_c_type == UDF_C_FIDS) { 819 panic("UDF_C_FIDS in SHED_WRITING!\n"); 820 #if 0 821 buf_len = buf->b_bcount; 822 sectornr = our_sectornr; 823 bpos = 0; 824 while (buf_len) { 825 len = MIN(buf_len, sector_size); 826 fidblk = (uint8_t *) buf->b_data + bpos; 827 udf_fixup_fid_block(fidblk, sector_size, 828 0, len, sectornr); 829 sectornr++; 830 bpos += len; 831 buf_len -= len; 832 } 833 #endif 834 } 835 udf_fixup_node_internals(ump, buf->b_data, buf->b_udf_c_type); 836 837 /* copy parts into the bufs and set for writing */ 838 buf_len = buf->b_bcount; 839 sectornr = our_sectornr; 840 eccline = udf_geteccline(ump, sectornr, 0); 841 eccsect = sectornr - eccline->start_sector; 842 bpos = 0; 843 while (buf_len) { 844 len = MIN(buf_len, sector_size); 845 if (eccsect == ump->packet_size) { 846 udf_puteccline(eccline); 847 eccline = udf_geteccline(ump, sectornr, 0); 848 eccsect = sectornr - eccline->start_sector; 849 } 850 bit = (uint64_t) 1 << eccsect; 851 KASSERT((eccline->readin & bit) == 0); 852 eccline->present |= bit; 853 eccline->dirty |= bit; 854 if (eccline->bufs[eccsect]) { 855 /* old callback still pending */ 856 nestiobuf_done(eccline->bufs[eccsect], 857 eccline->bufs_len[eccsect], 858 0); 859 eccline->bufs[eccsect] = NULL; 860 } 861 862 src = (uint8_t *) buf->b_data + bpos; 863 dst = (uint8_t *) eccline->blob + eccsect * sector_size; 864 if (len != sector_size) 865 memset(dst, 0, sector_size); 866 memcpy(dst, src, len); 867 868 /* note that its finished for this extent */ 869 eccline->bufs[eccsect] = NULL; 870 nestiobuf_done(buf, len, 0); 871 872 bpos += sector_size; 873 eccsect++; 874 sectornr++; 875 buf_len -= len; 876 } 877 udf_puteccline(eccline); 878 return; 879 880 } 881 882 /* sequential writing */ 883 KASSERT(queue == UDF_SHED_SEQWRITING); 884 DPRINTF(SHEDULE, ("\nudf_queuebuf_rmw SEQWRITE %p : sector XXXX " 885 "type %d, b_resid %d, b_bcount %d, b_bufsize %d\n", 886 buf, buf->b_udf_c_type, buf->b_resid, buf->b_bcount, 887 buf->b_bufsize)); 888 /* 889 * Buffers should not have been allocated to disc addresses yet on 890 * this queue. Note that a buffer can get multiple extents allocated. 891 * Note that it *looks* like the normal writing but its different in 892 * the details. 893 * 894 * lmapping contains lb_num relative to base partition. pmapping 895 * contains lb_num as used for disc adressing. 896 */ 897 mutex_enter(&priv->seqwrite_mutex); 898 899 lmapping = ump->la_lmapping; 900 pmapping = ump->la_pmapping; 901 node_ad_cpy = ump->la_node_ad_cpy; 902 903 /* 904 * XXX should we try to claim/organize the allocated memory to block 905 * aligned pieces? 906 */ 907 /* allocate buf and get its logical and physical mappings */ 908 udf_late_allocate_buf(ump, buf, lmapping, pmapping, node_ad_cpy); 909 910 /* if we have FIDs, fixup using the new allocation table */ 911 if (buf->b_udf_c_type == UDF_C_FIDS) { 912 buf_len = buf->b_bcount; 913 bpos = 0; 914 lmappos = lmapping; 915 while (buf_len) { 916 sectornr = *lmappos++; 917 len = MIN(buf_len, sector_size); 918 fidblk = (uint8_t *) buf->b_data + bpos; 919 udf_fixup_fid_block(fidblk, sector_size, 920 0, len, sectornr); 921 bpos += len; 922 buf_len -= len; 923 } 924 } 925 udf_fixup_node_internals(ump, buf->b_data, buf->b_udf_c_type); 926 927 /* copy parts into the bufs and set for writing */ 928 pmappos = pmapping; 929 buf_len = buf->b_bcount; 930 sectornr = *pmappos++; 931 eccline = udf_geteccline(ump, sectornr, ECC_SEQWRITING); 932 eccsect = sectornr - eccline->start_sector; 933 bpos = 0; 934 while (buf_len) { 935 len = MIN(buf_len, sector_size); 936 eccsect = sectornr - eccline->start_sector; 937 if ((eccsect < 0) || (eccsect >= ump->packet_size)) { 938 eccline->flags |= ECC_SEQWRITING; 939 udf_puteccline(eccline); 940 eccline = udf_geteccline(ump, sectornr, ECC_SEQWRITING); 941 eccsect = sectornr - eccline->start_sector; 942 } 943 bit = (uint64_t) 1 << eccsect; 944 KASSERT((eccline->readin & bit) == 0); 945 eccline->present |= bit; 946 eccline->dirty |= bit; 947 eccline->bufs[eccsect] = NULL; 948 949 src = (uint8_t *) buf->b_data + bpos; 950 dst = (uint8_t *) 951 eccline->blob + eccsect * sector_size; 952 if (len != sector_size) 953 memset(dst, 0, sector_size); 954 memcpy(dst, src, len); 955 956 /* note that its finished for this extent */ 957 nestiobuf_done(buf, len, 0); 958 959 bpos += sector_size; 960 sectornr = *pmappos++; 961 buf_len -= len; 962 } 963 eccline->flags |= ECC_SEQWRITING; 964 udf_puteccline(eccline); 965 mutex_exit(&priv->seqwrite_mutex); 966 } 967 968 /* --------------------------------------------------------------------- */ 969 970 static void 971 udf_shedule_read_callback(struct buf *buf) 972 { 973 struct udf_eccline *eccline = BTOE(buf); 974 struct udf_mount *ump = eccline->ump; 975 uint64_t bit; 976 uint8_t *src, *dst; 977 int sector_size = ump->discinfo.sector_size; 978 int error, i, len; 979 980 DPRINTF(ECCLINE, ("read callback called\n")); 981 /* post process read action */ 982 error = buf->b_error; 983 for (i = 0; i < ump->packet_size; i++) { 984 bit = (uint64_t) 1 << i; 985 src = (uint8_t *) buf->b_data + i * sector_size; 986 dst = (uint8_t *) eccline->blob + i * sector_size; 987 if (eccline->present & bit) 988 continue; 989 if (error) { 990 eccline->error |= bit; 991 } else { 992 eccline->present |= bit; 993 } 994 if (eccline->bufs[i]) { 995 dst = (uint8_t *) eccline->bufs[i]->b_data + 996 eccline->bufs_bpos[i]; 997 len = eccline->bufs_len[i]; 998 if (!error) 999 memcpy(dst, src, len); 1000 nestiobuf_done(eccline->bufs[i], len, error); 1001 eccline->bufs[i] = NULL; 1002 } 1003 1004 } 1005 KASSERT(buf->b_data == eccline->blob); 1006 KASSERT(eccline->present == ((uint64_t) 1 << ump->packet_size)-1); 1007 1008 /* 1009 * XXX TODO what to do on read errors? read in all sectors 1010 * synchronously and allocate a sparable entry? 1011 */ 1012 1013 wakeup(eccline); 1014 udf_puteccline(eccline); 1015 DPRINTF(ECCLINE, ("read callback finished\n")); 1016 } 1017 1018 1019 static void 1020 udf_shedule_write_callback(struct buf *buf) 1021 { 1022 struct udf_eccline *eccline = BTOE(buf); 1023 struct udf_mount *ump = eccline->ump; 1024 uint64_t bit; 1025 int error, i, len; 1026 1027 DPRINTF(ECCLINE, ("write callback called\n")); 1028 /* post process write action */ 1029 error = buf->b_error; 1030 for (i = 0; i < ump->packet_size; i++) { 1031 bit = (uint64_t) 1 << i; 1032 if ((eccline->dirty & bit) == 0) 1033 continue; 1034 if (error) { 1035 eccline->error |= bit; 1036 } else { 1037 eccline->dirty &= ~bit; 1038 } 1039 if (eccline->bufs[i]) { 1040 len = eccline->bufs_len[i]; 1041 nestiobuf_done(eccline->bufs[i], len, error); 1042 eccline->bufs[i] = NULL; 1043 } 1044 } 1045 KASSERT(eccline->dirty == 0); 1046 1047 KASSERT(error == 0); 1048 /* 1049 * XXX TODO on write errors allocate a sparable entry 1050 */ 1051 1052 wakeup(eccline); 1053 udf_puteccline(eccline); 1054 } 1055 1056 1057 static void 1058 udf_issue_eccline(struct udf_eccline *eccline, int queued_on) 1059 { 1060 struct udf_mount *ump = eccline->ump; 1061 struct strat_private *priv = PRIV(ump); 1062 struct buf *buf, *nestbuf; 1063 uint64_t bit, allbits = ((uint64_t) 1 << ump->packet_size)-1; 1064 uint32_t start; 1065 int sector_size = ump->discinfo.sector_size; 1066 int blks = sector_size / DEV_BSIZE; 1067 int i; 1068 1069 if (queued_on == UDF_SHED_READING) { 1070 DPRINTF(SHEDULE, ("udf_issue_eccline reading : ")); 1071 /* read all bits that are not yet present */ 1072 eccline->readin = (~eccline->present) & allbits; 1073 KASSERT(eccline->readin); 1074 start = eccline->start_sector; 1075 buf = eccline->buf; 1076 buf_init(buf); 1077 buf->b_flags = B_READ | B_ASYNC; 1078 SET(buf->b_cflags, BC_BUSY); /* mark buffer busy */ 1079 buf->b_oflags = 0; 1080 buf->b_iodone = udf_shedule_read_callback; 1081 buf->b_data = eccline->blob; 1082 buf->b_bcount = ump->packet_size * sector_size; 1083 buf->b_resid = buf->b_bcount; 1084 buf->b_bufsize = buf->b_bcount; 1085 buf->b_private = eccline; 1086 BIO_SETPRIO(buf, BPRIO_DEFAULT); 1087 buf->b_lblkno = buf->b_blkno = buf->b_rawblkno = start * blks; 1088 buf->b_proc = NULL; 1089 1090 if (eccline->present != 0) { 1091 for (i = 0; i < ump->packet_size; i++) { 1092 bit = (uint64_t) 1 << i; 1093 if (eccline->present & bit) { 1094 nestiobuf_done(buf, sector_size, 0); 1095 continue; 1096 } 1097 nestbuf = getiobuf(NULL, true); 1098 nestiobuf_setup(buf, nestbuf, i * sector_size, 1099 sector_size); 1100 /* adjust blocknumber to read */ 1101 nestbuf->b_blkno = buf->b_blkno + i*blks; 1102 nestbuf->b_rawblkno = buf->b_rawblkno + i*blks; 1103 1104 DPRINTF(SHEDULE, ("sector %d ", 1105 start + i)); 1106 /* call asynchronous */ 1107 VOP_STRATEGY(ump->devvp, nestbuf); 1108 } 1109 DPRINTF(SHEDULE, ("\n")); 1110 return; 1111 } 1112 } else { 1113 /* write or seqwrite */ 1114 DPRINTF(SHEDULE, ("udf_issue_eccline writing or seqwriting : ")); 1115 if (eccline->present != allbits) { 1116 /* requeue to read-only */ 1117 DPRINTF(SHEDULE, ("\n\t-> not complete, requeue to " 1118 "reading\n")); 1119 udf_push_eccline(eccline, UDF_SHED_READING); 1120 return; 1121 } 1122 start = eccline->start_sector; 1123 buf = eccline->buf; 1124 buf_init(buf); 1125 buf->b_flags = B_WRITE | B_ASYNC; 1126 SET(buf->b_cflags, BC_BUSY); /* mark buffer busy */ 1127 buf->b_oflags = 0; 1128 buf->b_iodone = udf_shedule_write_callback; 1129 buf->b_data = eccline->blob; 1130 buf->b_bcount = ump->packet_size * sector_size; 1131 buf->b_resid = buf->b_bcount; 1132 buf->b_bufsize = buf->b_bcount; 1133 buf->b_private = eccline; 1134 BIO_SETPRIO(buf, BPRIO_DEFAULT); 1135 buf->b_lblkno = buf->b_blkno = buf->b_rawblkno = start * blks; 1136 buf->b_proc = NULL; 1137 } 1138 1139 mutex_exit(&priv->discstrat_mutex); 1140 /* call asynchronous */ 1141 DPRINTF(SHEDULE, ("sector %d for %d\n", 1142 start, ump->packet_size)); 1143 VOP_STRATEGY(ump->devvp, buf); 1144 mutex_enter(&priv->discstrat_mutex); 1145 } 1146 1147 1148 static void 1149 udf_discstrat_thread(void *arg) 1150 { 1151 struct udf_mount *ump = (struct udf_mount *) arg; 1152 struct strat_private *priv = PRIV(ump); 1153 struct udf_eccline *eccline; 1154 struct timespec now, *last; 1155 int new_queue, wait, work; 1156 1157 work = 1; 1158 mutex_enter(&priv->discstrat_mutex); 1159 priv->num_floating = 0; 1160 while (priv->run_thread || work || priv->num_floating) { 1161 /* process the current selected queue */ 1162 /* maintenance: free exess ecclines */ 1163 while (priv->num_queued[UDF_SHED_FREE] > UDF_ECCLINE_MAXFREE) { 1164 eccline = udf_pop_eccline(priv, UDF_SHED_FREE); 1165 KASSERT(eccline); 1166 KASSERT(eccline->refcnt == 0); 1167 DPRINTF(ECCLINE, ("Removing entry from free list\n")); 1168 udf_dispose_eccline(eccline); 1169 } 1170 1171 /* get our time */ 1172 vfs_timestamp(&now); 1173 last = &priv->last_queued[priv->cur_queue]; 1174 1175 /* don't shedule too quickly when there is only one */ 1176 if (priv->cur_queue == UDF_SHED_WRITING) { 1177 if (priv->num_queued[priv->cur_queue] <= 2) { 1178 if (now.tv_sec - last->tv_sec < 2) { 1179 /* wait some time */ 1180 cv_timedwait(&priv->discstrat_cv, 1181 &priv->discstrat_mutex, hz); 1182 } 1183 } 1184 } 1185 1186 /* get our line */ 1187 eccline = udf_pop_eccline(priv, priv->cur_queue); 1188 if (eccline) { 1189 wait = 0; 1190 new_queue = priv->cur_queue; 1191 DPRINTF(ECCLINE, ("UDF_ISSUE_ECCLINE\n")); 1192 1193 /* complete the `get' by locking and refcounting it */ 1194 UDF_LOCK_ECCLINE(eccline); 1195 eccline->refcnt++; 1196 1197 udf_issue_eccline(eccline, priv->cur_queue); 1198 } else { 1199 wait = 1; 1200 /* check if we can/should switch */ 1201 new_queue = priv->cur_queue; 1202 if (BUFQ_PEEK(priv->queues[UDF_SHED_READING])) 1203 new_queue = UDF_SHED_READING; 1204 if (BUFQ_PEEK(priv->queues[UDF_SHED_WRITING])) 1205 new_queue = UDF_SHED_WRITING; 1206 if (BUFQ_PEEK(priv->queues[UDF_SHED_SEQWRITING])) 1207 new_queue = UDF_SHED_SEQWRITING; 1208 1209 /* dont switch seqwriting too fast */ 1210 if (priv->cur_queue == UDF_SHED_READING) { 1211 if (now.tv_sec - last->tv_sec < 1) 1212 new_queue = priv->cur_queue; 1213 } 1214 if (priv->cur_queue == UDF_SHED_WRITING) { 1215 if (now.tv_sec - last->tv_sec < 2) 1216 new_queue = priv->cur_queue; 1217 } 1218 if (priv->cur_queue == UDF_SHED_SEQWRITING) { 1219 if (now.tv_sec - last->tv_sec < 4) 1220 new_queue = priv->cur_queue; 1221 } 1222 } 1223 1224 /* give room */ 1225 mutex_exit(&priv->discstrat_mutex); 1226 1227 if (new_queue != priv->cur_queue) { 1228 wait = 0; 1229 DPRINTF(SHEDULE, ("switching from %d to %d\n", 1230 priv->cur_queue, new_queue)); 1231 priv->cur_queue = new_queue; 1232 } 1233 mutex_enter(&priv->discstrat_mutex); 1234 1235 /* wait for more if needed */ 1236 if (wait) 1237 cv_timedwait(&priv->discstrat_cv, 1238 &priv->discstrat_mutex, hz); /* /8 */ 1239 1240 work = (BUFQ_PEEK(priv->queues[UDF_SHED_READING]) != NULL); 1241 work |= (BUFQ_PEEK(priv->queues[UDF_SHED_WRITING]) != NULL); 1242 work |= (BUFQ_PEEK(priv->queues[UDF_SHED_SEQWRITING]) != NULL); 1243 1244 DPRINTF(PARANOIA, ("work : (%d, %d, %d) -> work %d, float %d\n", 1245 (BUFQ_PEEK(priv->queues[UDF_SHED_READING]) != NULL), 1246 (BUFQ_PEEK(priv->queues[UDF_SHED_WRITING]) != NULL), 1247 (BUFQ_PEEK(priv->queues[UDF_SHED_SEQWRITING]) != NULL), 1248 work, priv->num_floating)); 1249 } 1250 1251 mutex_exit(&priv->discstrat_mutex); 1252 1253 /* tear down remaining ecclines */ 1254 mutex_enter(&priv->discstrat_mutex); 1255 KASSERT(priv->num_queued[UDF_SHED_IDLE] == 0); 1256 KASSERT(priv->num_queued[UDF_SHED_READING] == 0); 1257 KASSERT(priv->num_queued[UDF_SHED_WRITING] == 0); 1258 KASSERT(priv->num_queued[UDF_SHED_SEQWRITING] == 0); 1259 1260 KASSERT(BUFQ_PEEK(priv->queues[UDF_SHED_IDLE]) == NULL); 1261 KASSERT(BUFQ_PEEK(priv->queues[UDF_SHED_READING]) == NULL); 1262 KASSERT(BUFQ_PEEK(priv->queues[UDF_SHED_WRITING]) == NULL); 1263 KASSERT(BUFQ_PEEK(priv->queues[UDF_SHED_SEQWRITING]) == NULL); 1264 eccline = udf_pop_eccline(priv, UDF_SHED_FREE); 1265 while (eccline) { 1266 udf_dispose_eccline(eccline); 1267 eccline = udf_pop_eccline(priv, UDF_SHED_FREE); 1268 } 1269 KASSERT(priv->num_queued[UDF_SHED_FREE] == 0); 1270 mutex_exit(&priv->discstrat_mutex); 1271 1272 priv->thread_finished = 1; 1273 wakeup(&priv->run_thread); 1274 kthread_exit(0); 1275 /* not reached */ 1276 } 1277 1278 /* --------------------------------------------------------------------- */ 1279 1280 /* 1281 * Buffer memory pool allocator. 1282 */ 1283 1284 static void * 1285 ecclinepool_page_alloc(struct pool *pp, int flags) 1286 { 1287 return (void *)uvm_km_alloc(kernel_map, 1288 MAXBSIZE, MAXBSIZE, 1289 ((flags & PR_WAITOK) ? 0 : UVM_KMF_NOWAIT | UVM_KMF_TRYLOCK) 1290 | UVM_KMF_WIRED /* UVM_KMF_PAGABLE? */); 1291 } 1292 1293 static void 1294 ecclinepool_page_free(struct pool *pp, void *v) 1295 { 1296 uvm_km_free(kernel_map, (vaddr_t)v, MAXBSIZE, UVM_KMF_WIRED); 1297 } 1298 1299 static struct pool_allocator ecclinepool_allocator = { 1300 .pa_alloc = ecclinepool_page_alloc, 1301 .pa_free = ecclinepool_page_free, 1302 .pa_pagesz = MAXBSIZE, 1303 }; 1304 1305 1306 static void 1307 udf_discstrat_init_rmw(struct udf_strat_args *args) 1308 { 1309 struct udf_mount *ump = args->ump; 1310 struct strat_private *priv = PRIV(ump); 1311 uint32_t lb_size, blobsize, hashline; 1312 int i; 1313 1314 KASSERT(ump); 1315 KASSERT(ump->logical_vol); 1316 KASSERT(priv == NULL); 1317 1318 lb_size = udf_rw32(ump->logical_vol->lb_size); 1319 blobsize = ump->packet_size * lb_size; 1320 KASSERT(lb_size > 0); 1321 KASSERT(ump->packet_size <= 64); 1322 1323 /* initialise our memory space */ 1324 ump->strategy_private = malloc(sizeof(struct strat_private), 1325 M_UDFTEMP, M_WAITOK); 1326 priv = ump->strategy_private; 1327 memset(priv, 0 , sizeof(struct strat_private)); 1328 1329 /* initialise locks */ 1330 cv_init(&priv->discstrat_cv, "udfstrat"); 1331 mutex_init(&priv->discstrat_mutex, MUTEX_DRIVER, IPL_BIO); 1332 mutex_init(&priv->seqwrite_mutex, MUTEX_DEFAULT, IPL_NONE); 1333 1334 /* initialise struct eccline pool */ 1335 pool_init(&priv->eccline_pool, sizeof(struct udf_eccline), 1336 0, 0, 0, "udf_eccline_pool", NULL, IPL_NONE); 1337 1338 /* initialise eccline blob pool */ 1339 pool_init(&priv->ecclineblob_pool, blobsize, 1340 0,0,0, "udf_eccline_blob", &ecclinepool_allocator, IPL_NONE); 1341 1342 /* initialise main queues */ 1343 for (i = 0; i < UDF_SHED_MAX; i++) { 1344 priv->num_queued[i] = 0; 1345 vfs_timestamp(&priv->last_queued[i]); 1346 } 1347 bufq_alloc(&priv->queues[UDF_SHED_READING], "disksort", 1348 BUFQ_SORT_RAWBLOCK); 1349 bufq_alloc(&priv->queues[UDF_SHED_WRITING], "disksort", 1350 BUFQ_SORT_RAWBLOCK); 1351 bufq_alloc(&priv->queues[UDF_SHED_SEQWRITING], "disksort", 0); 1352 1353 /* initialise administrative queues */ 1354 bufq_alloc(&priv->queues[UDF_SHED_IDLE], "fcfs", 0); 1355 bufq_alloc(&priv->queues[UDF_SHED_FREE], "fcfs", 0); 1356 1357 for (hashline = 0; hashline < UDF_ECCBUF_HASHSIZE; hashline++) { 1358 LIST_INIT(&priv->eccline_hash[hashline]); 1359 } 1360 1361 /* create our disk strategy thread */ 1362 priv->cur_queue = UDF_SHED_READING; 1363 priv->thread_finished = 0; 1364 priv->run_thread = 1; 1365 if (kthread_create(PRI_NONE, 0 /* KTHREAD_MPSAFE*/, NULL /* cpu_info*/, 1366 udf_discstrat_thread, ump, &priv->queue_lwp, 1367 "%s", "udf_rw")) { 1368 panic("fork udf_rw"); 1369 } 1370 } 1371 1372 1373 static void 1374 udf_discstrat_finish_rmw(struct udf_strat_args *args) 1375 { 1376 struct udf_mount *ump = args->ump; 1377 struct strat_private *priv = PRIV(ump); 1378 int error; 1379 1380 if (ump == NULL) 1381 return; 1382 1383 /* stop our sheduling thread */ 1384 KASSERT(priv->run_thread == 1); 1385 priv->run_thread = 0; 1386 wakeup(priv->queue_lwp); 1387 while (!priv->thread_finished) { 1388 error = tsleep(&priv->run_thread, PRIBIO+1, 1389 "udfshedfin", hz); 1390 } 1391 /* kthread should be finished now */ 1392 1393 /* cleanup our pools */ 1394 pool_destroy(&priv->eccline_pool); 1395 pool_destroy(&priv->ecclineblob_pool); 1396 1397 cv_destroy(&priv->discstrat_cv); 1398 mutex_destroy(&priv->discstrat_mutex); 1399 mutex_destroy(&priv->seqwrite_mutex); 1400 1401 /* free our private space */ 1402 free(ump->strategy_private, M_UDFTEMP); 1403 ump->strategy_private = NULL; 1404 } 1405 1406 /* --------------------------------------------------------------------- */ 1407 1408 struct udf_strategy udf_strat_rmw = 1409 { 1410 udf_create_nodedscr_rmw, 1411 udf_free_nodedscr_rmw, 1412 udf_read_nodedscr_rmw, 1413 udf_write_nodedscr_rmw, 1414 udf_queuebuf_rmw, 1415 udf_discstrat_init_rmw, 1416 udf_discstrat_finish_rmw 1417 }; 1418 1419
Indexes created Fri Sep 26 08:10:20 GMT 2025