1 1.20 reinoud /* $NetBSD: udf_strat_sequential.c,v 1.20 2023/06/27 09:58:50 reinoud Exp $ */ 2 1.1 reinoud 3 1.1 reinoud /* 4 1.1 reinoud * Copyright (c) 2006, 2008 Reinoud Zandijk 5 1.1 reinoud * All rights reserved. 6 1.18 skrll * 7 1.1 reinoud * Redistribution and use in source and binary forms, with or without 8 1.1 reinoud * modification, are permitted provided that the following conditions 9 1.1 reinoud * are met: 10 1.1 reinoud * 1. Redistributions of source code must retain the above copyright 11 1.1 reinoud * notice, this list of conditions and the following disclaimer. 12 1.1 reinoud * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 reinoud * notice, this list of conditions and the following disclaimer in the 14 1.1 reinoud * documentation and/or other materials provided with the distribution. 15 1.18 skrll * 16 1.1 reinoud * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17 1.1 reinoud * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18 1.1 reinoud * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19 1.1 reinoud * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20 1.1 reinoud * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21 1.1 reinoud * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22 1.1 reinoud * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23 1.1 reinoud * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24 1.1 reinoud * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25 1.1 reinoud * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26 1.18 skrll * 27 1.1 reinoud */ 28 1.1 reinoud 29 1.1 reinoud #include <sys/cdefs.h> 30 1.1 reinoud #ifndef lint 31 1.20 reinoud __KERNEL_RCSID(0, "$NetBSD: udf_strat_sequential.c,v 1.20 2023/06/27 09:58:50 reinoud Exp $"); 32 1.1 reinoud #endif /* not lint */ 33 1.1 reinoud 34 1.1 reinoud 35 1.1 reinoud #if defined(_KERNEL_OPT) 36 1.1 reinoud #include "opt_compat_netbsd.h" 37 1.1 reinoud #endif 38 1.1 reinoud 39 1.1 reinoud #include <sys/param.h> 40 1.1 reinoud #include <sys/systm.h> 41 1.1 reinoud #include <sys/sysctl.h> 42 1.1 reinoud #include <sys/namei.h> 43 1.1 reinoud #include <sys/proc.h> 44 1.1 reinoud #include <sys/kernel.h> 45 1.1 reinoud #include <sys/vnode.h> 46 1.1 reinoud #include <miscfs/genfs/genfs_node.h> 47 1.1 reinoud #include <sys/mount.h> 48 1.1 reinoud #include <sys/buf.h> 49 1.1 reinoud #include <sys/file.h> 50 1.1 reinoud #include <sys/device.h> 51 1.1 reinoud #include <sys/disklabel.h> 52 1.1 reinoud #include <sys/ioctl.h> 53 1.1 reinoud #include <sys/malloc.h> 54 1.1 reinoud #include <sys/dirent.h> 55 1.1 reinoud #include <sys/stat.h> 56 1.1 reinoud #include <sys/conf.h> 57 1.1 reinoud #include <sys/kauth.h> 58 1.1 reinoud #include <sys/kthread.h> 59 1.1 reinoud #include <dev/clock_subr.h> 60 1.1 reinoud 61 1.1 reinoud #include <fs/udf/ecma167-udf.h> 62 1.1 reinoud #include <fs/udf/udf_mount.h> 63 1.1 reinoud 64 1.1 reinoud #include "udf.h" 65 1.1 reinoud #include "udf_subr.h" 66 1.1 reinoud #include "udf_bswap.h" 67 1.1 reinoud 68 1.1 reinoud 69 1.1 reinoud #define VTOI(vnode) ((struct udf_node *) vnode->v_data) 70 1.1 reinoud #define PRIV(ump) ((struct strat_private *) ump->strategy_private) 71 1.1 reinoud 72 1.1 reinoud /* --------------------------------------------------------------------- */ 73 1.1 reinoud 74 1.1 reinoud /* BUFQ's */ 75 1.1 reinoud #define UDF_SHED_MAX 3 76 1.1 reinoud 77 1.1 reinoud #define UDF_SHED_READING 0 78 1.1 reinoud #define UDF_SHED_WRITING 1 79 1.1 reinoud #define UDF_SHED_SEQWRITING 2 80 1.1 reinoud 81 1.1 reinoud struct strat_private { 82 1.1 reinoud struct pool desc_pool; /* node descriptors */ 83 1.1 reinoud 84 1.1 reinoud lwp_t *queue_lwp; 85 1.1 reinoud kcondvar_t discstrat_cv; /* to wait on */ 86 1.1 reinoud kmutex_t discstrat_mutex; /* disc strategy */ 87 1.1 reinoud 88 1.20 reinoud int thread_running; /* thread control */ 89 1.1 reinoud int run_thread; /* thread control */ 90 1.20 reinoud int thread_finished; /* thread control */ 91 1.20 reinoud 92 1.15 reinoud int sync_req; /* thread control */ 93 1.1 reinoud int cur_queue; 94 1.1 reinoud 95 1.1 reinoud struct disk_strategy old_strategy_setting; 96 1.1 reinoud struct bufq_state *queues[UDF_SHED_MAX]; 97 1.1 reinoud struct timespec last_queued[UDF_SHED_MAX]; 98 1.1 reinoud }; 99 1.1 reinoud 100 1.1 reinoud 101 1.1 reinoud /* --------------------------------------------------------------------- */ 102 1.1 reinoud 103 1.1 reinoud static void 104 1.1 reinoud udf_wr_nodedscr_callback(struct buf *buf) 105 1.1 reinoud { 106 1.1 reinoud struct udf_node *udf_node; 107 1.1 reinoud 108 1.1 reinoud KASSERT(buf); 109 1.1 reinoud KASSERT(buf->b_data); 110 1.1 reinoud 111 1.1 reinoud /* called when write action is done */ 112 1.1 reinoud DPRINTF(WRITE, ("udf_wr_nodedscr_callback(): node written out\n")); 113 1.1 reinoud 114 1.1 reinoud udf_node = VTOI(buf->b_vp); 115 1.1 reinoud if (udf_node == NULL) { 116 1.1 reinoud putiobuf(buf); 117 1.1 reinoud printf("udf_wr_node_callback: NULL node?\n"); 118 1.1 reinoud return; 119 1.1 reinoud } 120 1.1 reinoud 121 1.1 reinoud /* XXX right flags to mark dirty again on error? */ 122 1.1 reinoud if (buf->b_error) { 123 1.1 reinoud udf_node->i_flags |= IN_MODIFIED | IN_ACCESSED; 124 1.17 andvar /* XXX TODO reschedule on error */ 125 1.1 reinoud } 126 1.1 reinoud 127 1.2 reinoud /* decrement outstanding_nodedscr */ 128 1.2 reinoud KASSERT(udf_node->outstanding_nodedscr >= 1); 129 1.2 reinoud udf_node->outstanding_nodedscr--; 130 1.2 reinoud if (udf_node->outstanding_nodedscr == 0) { 131 1.2 reinoud /* first unlock the node */ 132 1.10 reinoud UDF_UNLOCK_NODE(udf_node, 0); 133 1.20 reinoud cv_broadcast(&udf_node->node_lock); 134 1.2 reinoud } 135 1.1 reinoud 136 1.1 reinoud putiobuf(buf); 137 1.1 reinoud } 138 1.1 reinoud 139 1.1 reinoud /* --------------------------------------------------------------------- */ 140 1.1 reinoud 141 1.1 reinoud static int 142 1.1 reinoud udf_create_logvol_dscr_seq(struct udf_strat_args *args) 143 1.1 reinoud { 144 1.1 reinoud union dscrptr **dscrptr = &args->dscr; 145 1.1 reinoud struct udf_mount *ump = args->ump; 146 1.1 reinoud struct strat_private *priv = PRIV(ump); 147 1.1 reinoud uint32_t lb_size; 148 1.1 reinoud 149 1.1 reinoud lb_size = udf_rw32(ump->logical_vol->lb_size); 150 1.1 reinoud *dscrptr = pool_get(&priv->desc_pool, PR_WAITOK); 151 1.1 reinoud memset(*dscrptr, 0, lb_size); 152 1.1 reinoud 153 1.1 reinoud return 0; 154 1.1 reinoud } 155 1.1 reinoud 156 1.1 reinoud 157 1.1 reinoud static void 158 1.1 reinoud udf_free_logvol_dscr_seq(struct udf_strat_args *args) 159 1.1 reinoud { 160 1.1 reinoud union dscrptr *dscr = args->dscr; 161 1.1 reinoud struct udf_mount *ump = args->ump; 162 1.1 reinoud struct strat_private *priv = PRIV(ump); 163 1.1 reinoud 164 1.1 reinoud pool_put(&priv->desc_pool, dscr); 165 1.1 reinoud } 166 1.1 reinoud 167 1.1 reinoud 168 1.1 reinoud static int 169 1.1 reinoud udf_read_logvol_dscr_seq(struct udf_strat_args *args) 170 1.1 reinoud { 171 1.1 reinoud union dscrptr **dscrptr = &args->dscr; 172 1.1 reinoud union dscrptr *tmpdscr; 173 1.1 reinoud struct udf_mount *ump = args->ump; 174 1.1 reinoud struct long_ad *icb = args->icb; 175 1.1 reinoud struct strat_private *priv = PRIV(ump); 176 1.1 reinoud uint32_t lb_size; 177 1.1 reinoud uint32_t sector, dummy; 178 1.1 reinoud int error; 179 1.1 reinoud 180 1.1 reinoud lb_size = udf_rw32(ump->logical_vol->lb_size); 181 1.1 reinoud 182 1.1 reinoud error = udf_translate_vtop(ump, icb, §or, &dummy); 183 1.1 reinoud if (error) 184 1.1 reinoud return error; 185 1.1 reinoud 186 1.1 reinoud /* try to read in fe/efe */ 187 1.1 reinoud error = udf_read_phys_dscr(ump, sector, M_UDFTEMP, &tmpdscr); 188 1.1 reinoud if (error) 189 1.1 reinoud return error; 190 1.1 reinoud 191 1.1 reinoud *dscrptr = pool_get(&priv->desc_pool, PR_WAITOK); 192 1.1 reinoud memcpy(*dscrptr, tmpdscr, lb_size); 193 1.1 reinoud free(tmpdscr, M_UDFTEMP); 194 1.1 reinoud 195 1.1 reinoud return 0; 196 1.1 reinoud } 197 1.1 reinoud 198 1.1 reinoud 199 1.1 reinoud static int 200 1.1 reinoud udf_write_logvol_dscr_seq(struct udf_strat_args *args) 201 1.1 reinoud { 202 1.1 reinoud union dscrptr *dscr = args->dscr; 203 1.1 reinoud struct udf_mount *ump = args->ump; 204 1.1 reinoud struct udf_node *udf_node = args->udf_node; 205 1.1 reinoud struct long_ad *icb = args->icb; 206 1.1 reinoud int waitfor = args->waitfor; 207 1.1 reinoud uint32_t logsectornr, sectornr, dummy; 208 1.1 reinoud int error, vpart; 209 1.1 reinoud 210 1.1 reinoud /* 211 1.18 skrll * we have to decide if we write it out sequential or at its fixed 212 1.1 reinoud * position by examining the partition its (to be) written on. 213 1.1 reinoud */ 214 1.1 reinoud vpart = udf_rw16(udf_node->loc.loc.part_num); 215 1.1 reinoud logsectornr = udf_rw32(icb->loc.lb_num); 216 1.1 reinoud sectornr = 0; 217 1.1 reinoud if (ump->vtop_tp[vpart] != UDF_VTOP_TYPE_VIRT) { 218 1.1 reinoud error = udf_translate_vtop(ump, icb, §ornr, &dummy); 219 1.1 reinoud if (error) 220 1.2 reinoud goto out; 221 1.1 reinoud } 222 1.1 reinoud 223 1.1 reinoud if (waitfor) { 224 1.1 reinoud DPRINTF(WRITE, ("udf_write_logvol_dscr: sync write\n")); 225 1.1 reinoud 226 1.1 reinoud error = udf_write_phys_dscr_sync(ump, udf_node, UDF_C_NODE, 227 1.1 reinoud dscr, sectornr, logsectornr); 228 1.1 reinoud } else { 229 1.1 reinoud DPRINTF(WRITE, ("udf_write_logvol_dscr: no wait, async write\n")); 230 1.1 reinoud 231 1.1 reinoud error = udf_write_phys_dscr_async(ump, udf_node, UDF_C_NODE, 232 1.1 reinoud dscr, sectornr, logsectornr, udf_wr_nodedscr_callback); 233 1.1 reinoud /* will be UNLOCKED in call back */ 234 1.2 reinoud return error; 235 1.2 reinoud } 236 1.2 reinoud out: 237 1.2 reinoud udf_node->outstanding_nodedscr--; 238 1.2 reinoud if (udf_node->outstanding_nodedscr == 0) { 239 1.2 reinoud UDF_UNLOCK_NODE(udf_node, 0); 240 1.20 reinoud cv_broadcast(&udf_node->node_lock); 241 1.1 reinoud } 242 1.1 reinoud 243 1.1 reinoud return error; 244 1.1 reinoud } 245 1.1 reinoud 246 1.1 reinoud /* --------------------------------------------------------------------- */ 247 1.1 reinoud 248 1.1 reinoud /* 249 1.17 andvar * Main file-system specific scheduler. Due to the nature of optical media 250 1.17 andvar * scheduling can't be performed in the traditional way. Most OS 251 1.1 reinoud * implementations i've seen thus read or write a file atomically giving all 252 1.1 reinoud * kinds of side effects. 253 1.1 reinoud * 254 1.17 andvar * This implementation uses a kernel thread to schedule the queued requests in 255 1.19 skrll * such a way that is semi-optimal for optical media; this means approximately 256 1.1 reinoud * (R*|(Wr*|Ws*))* since switching between reading and writing is expensive in 257 1.1 reinoud * time. 258 1.1 reinoud */ 259 1.1 reinoud 260 1.1 reinoud static void 261 1.1 reinoud udf_queuebuf_seq(struct udf_strat_args *args) 262 1.1 reinoud { 263 1.1 reinoud struct udf_mount *ump = args->ump; 264 1.1 reinoud struct buf *nestbuf = args->nestbuf; 265 1.1 reinoud struct strat_private *priv = PRIV(ump); 266 1.1 reinoud int queue; 267 1.1 reinoud int what; 268 1.1 reinoud 269 1.1 reinoud KASSERT(ump); 270 1.1 reinoud KASSERT(nestbuf); 271 1.1 reinoud KASSERT(nestbuf->b_iodone == nestiobuf_iodone); 272 1.1 reinoud 273 1.1 reinoud what = nestbuf->b_udf_c_type; 274 1.1 reinoud queue = UDF_SHED_READING; 275 1.1 reinoud if ((nestbuf->b_flags & B_READ) == 0) { 276 1.1 reinoud /* writing */ 277 1.1 reinoud queue = UDF_SHED_SEQWRITING; 278 1.8 reinoud if (what == UDF_C_ABSOLUTE) 279 1.1 reinoud queue = UDF_SHED_WRITING; 280 1.1 reinoud } 281 1.1 reinoud 282 1.17 andvar /* use our own scheduler lists for more complex scheduling */ 283 1.1 reinoud mutex_enter(&priv->discstrat_mutex); 284 1.7 yamt bufq_put(priv->queues[queue], nestbuf); 285 1.1 reinoud vfs_timestamp(&priv->last_queued[queue]); 286 1.1 reinoud mutex_exit(&priv->discstrat_mutex); 287 1.1 reinoud 288 1.1 reinoud /* signal our thread that there might be something to do */ 289 1.1 reinoud cv_signal(&priv->discstrat_cv); 290 1.1 reinoud } 291 1.1 reinoud 292 1.1 reinoud /* --------------------------------------------------------------------- */ 293 1.1 reinoud 294 1.15 reinoud static void 295 1.15 reinoud udf_sync_caches_seq(struct udf_strat_args *args) 296 1.15 reinoud { 297 1.15 reinoud struct udf_mount *ump = args->ump; 298 1.15 reinoud struct strat_private *priv = PRIV(ump); 299 1.15 reinoud 300 1.15 reinoud /* we might be called during unmount inadvertedly, be on safe side */ 301 1.15 reinoud if (!priv) 302 1.15 reinoud return; 303 1.15 reinoud 304 1.15 reinoud /* signal our thread that there might be something to do */ 305 1.15 reinoud priv->sync_req = 1; 306 1.15 reinoud cv_signal(&priv->discstrat_cv); 307 1.15 reinoud 308 1.15 reinoud mutex_enter(&priv->discstrat_mutex); 309 1.15 reinoud while (priv->sync_req) { 310 1.15 reinoud cv_timedwait(&priv->discstrat_cv, 311 1.15 reinoud &priv->discstrat_mutex, hz/8); 312 1.15 reinoud } 313 1.15 reinoud mutex_exit(&priv->discstrat_mutex); 314 1.15 reinoud } 315 1.15 reinoud 316 1.15 reinoud /* --------------------------------------------------------------------- */ 317 1.15 reinoud 318 1.1 reinoud /* TODO convert to lb_size */ 319 1.1 reinoud static void 320 1.3 reinoud udf_VAT_mapping_update(struct udf_mount *ump, struct buf *buf, uint32_t lb_map) 321 1.1 reinoud { 322 1.1 reinoud union dscrptr *fdscr = (union dscrptr *) buf->b_data; 323 1.1 reinoud struct vnode *vp = buf->b_vp; 324 1.1 reinoud struct udf_node *udf_node = VTOI(vp); 325 1.3 reinoud uint32_t lb_num; 326 1.1 reinoud uint32_t udf_rw32_lbmap; 327 1.1 reinoud int c_type = buf->b_udf_c_type; 328 1.1 reinoud int error; 329 1.1 reinoud 330 1.1 reinoud /* only interested when we're using a VAT */ 331 1.1 reinoud KASSERT(ump->vat_node); 332 1.4 reinoud KASSERT(ump->vtop_alloc[ump->node_part] == UDF_ALLOC_VAT); 333 1.1 reinoud 334 1.1 reinoud /* only nodes are recorded in the VAT */ 335 1.1 reinoud /* NOTE: and the fileset descriptor (FIXME ?) */ 336 1.1 reinoud if (c_type != UDF_C_NODE) 337 1.1 reinoud return; 338 1.1 reinoud 339 1.1 reinoud udf_rw32_lbmap = udf_rw32(lb_map); 340 1.1 reinoud 341 1.1 reinoud /* if we're the VAT itself, only update our assigned sector number */ 342 1.1 reinoud if (udf_node == ump->vat_node) { 343 1.1 reinoud fdscr->tag.tag_loc = udf_rw32_lbmap; 344 1.1 reinoud udf_validate_tag_sum(fdscr); 345 1.1 reinoud DPRINTF(TRANSLATE, ("VAT assigned to sector %u\n", 346 1.1 reinoud udf_rw32(udf_rw32_lbmap))); 347 1.1 reinoud /* no use mapping the VAT node in the VAT */ 348 1.1 reinoud return; 349 1.1 reinoud } 350 1.1 reinoud 351 1.2 reinoud /* record new position in VAT file */ 352 1.2 reinoud lb_num = udf_rw32(fdscr->tag.tag_loc); 353 1.1 reinoud 354 1.2 reinoud /* lb_num = udf_rw32(udf_node->write_loc.loc.lb_num); */ 355 1.1 reinoud 356 1.1 reinoud DPRINTF(TRANSLATE, ("VAT entry change (log %u -> phys %u)\n", 357 1.1 reinoud lb_num, lb_map)); 358 1.1 reinoud 359 1.1 reinoud /* VAT should be the longer than this write, can't go wrong */ 360 1.1 reinoud KASSERT(lb_num <= ump->vat_entries); 361 1.1 reinoud 362 1.1 reinoud mutex_enter(&ump->allocate_mutex); 363 1.1 reinoud error = udf_vat_write(ump->vat_node, 364 1.1 reinoud (uint8_t *) &udf_rw32_lbmap, 4, 365 1.1 reinoud ump->vat_offset + lb_num * 4); 366 1.1 reinoud mutex_exit(&ump->allocate_mutex); 367 1.1 reinoud 368 1.1 reinoud if (error) 369 1.1 reinoud panic( "udf_VAT_mapping_update: HELP! i couldn't " 370 1.1 reinoud "write in the VAT file ?\n"); 371 1.1 reinoud } 372 1.1 reinoud 373 1.1 reinoud 374 1.1 reinoud static void 375 1.1 reinoud udf_issue_buf(struct udf_mount *ump, int queue, struct buf *buf) 376 1.1 reinoud { 377 1.8 reinoud union dscrptr *dscr; 378 1.1 reinoud struct long_ad *node_ad_cpy; 379 1.3 reinoud struct part_desc *pdesc; 380 1.12 christos uint64_t *lmapping, *lmappos; 381 1.12 christos uint32_t sectornr, bpos; 382 1.3 reinoud uint32_t ptov; 383 1.3 reinoud uint16_t vpart_num; 384 1.1 reinoud uint8_t *fidblk; 385 1.1 reinoud int sector_size = ump->discinfo.sector_size; 386 1.1 reinoud int blks = sector_size / DEV_BSIZE; 387 1.1 reinoud int len, buf_len; 388 1.1 reinoud 389 1.1 reinoud /* if reading, just pass to the device's STRATEGY */ 390 1.1 reinoud if (queue == UDF_SHED_READING) { 391 1.1 reinoud DPRINTF(SHEDULE, ("\nudf_issue_buf READ %p : sector %d type %d," 392 1.1 reinoud "b_resid %d, b_bcount %d, b_bufsize %d\n", 393 1.1 reinoud buf, (uint32_t) buf->b_blkno / blks, buf->b_udf_c_type, 394 1.1 reinoud buf->b_resid, buf->b_bcount, buf->b_bufsize)); 395 1.1 reinoud VOP_STRATEGY(ump->devvp, buf); 396 1.1 reinoud return; 397 1.1 reinoud } 398 1.1 reinoud 399 1.1 reinoud if (queue == UDF_SHED_WRITING) { 400 1.1 reinoud DPRINTF(SHEDULE, ("\nudf_issue_buf WRITE %p : sector %d " 401 1.1 reinoud "type %d, b_resid %d, b_bcount %d, b_bufsize %d\n", 402 1.1 reinoud buf, (uint32_t) buf->b_blkno / blks, buf->b_udf_c_type, 403 1.1 reinoud buf->b_resid, buf->b_bcount, buf->b_bufsize)); 404 1.8 reinoud KASSERT(buf->b_udf_c_type == UDF_C_ABSOLUTE); 405 1.8 reinoud 406 1.8 reinoud // udf_fixup_node_internals(ump, buf->b_data, buf->b_udf_c_type); 407 1.1 reinoud VOP_STRATEGY(ump->devvp, buf); 408 1.1 reinoud return; 409 1.1 reinoud } 410 1.1 reinoud 411 1.1 reinoud KASSERT(queue == UDF_SHED_SEQWRITING); 412 1.1 reinoud DPRINTF(SHEDULE, ("\nudf_issue_buf SEQWRITE %p : sector XXXX " 413 1.1 reinoud "type %d, b_resid %d, b_bcount %d, b_bufsize %d\n", 414 1.1 reinoud buf, buf->b_udf_c_type, buf->b_resid, buf->b_bcount, 415 1.1 reinoud buf->b_bufsize)); 416 1.1 reinoud 417 1.1 reinoud /* 418 1.1 reinoud * Buffers should not have been allocated to disc addresses yet on 419 1.1 reinoud * this queue. Note that a buffer can get multiple extents allocated. 420 1.1 reinoud * 421 1.1 reinoud * lmapping contains lb_num relative to base partition. 422 1.1 reinoud */ 423 1.1 reinoud lmapping = ump->la_lmapping; 424 1.1 reinoud node_ad_cpy = ump->la_node_ad_cpy; 425 1.1 reinoud 426 1.3 reinoud /* logically allocate buf and map it in the file */ 427 1.3 reinoud udf_late_allocate_buf(ump, buf, lmapping, node_ad_cpy, &vpart_num); 428 1.3 reinoud 429 1.3 reinoud /* 430 1.3 reinoud * NOTE We are using the knowledge here that sequential media will 431 1.3 reinoud * always be mapped linearly. Thus no use to explicitly translate the 432 1.3 reinoud * lmapping list. 433 1.3 reinoud */ 434 1.3 reinoud 435 1.3 reinoud /* calculate offset from physical base partition */ 436 1.3 reinoud pdesc = ump->partitions[ump->vtop[vpart_num]]; 437 1.3 reinoud ptov = udf_rw32(pdesc->start_loc); 438 1.3 reinoud 439 1.3 reinoud /* set buffers blkno to the physical block number */ 440 1.3 reinoud buf->b_blkno = (*lmapping + ptov) * blks; 441 1.1 reinoud 442 1.8 reinoud /* fixate floating descriptors */ 443 1.8 reinoud if (buf->b_udf_c_type == UDF_C_FLOAT_DSCR) { 444 1.8 reinoud /* set our tag location to the absolute position */ 445 1.8 reinoud dscr = (union dscrptr *) buf->b_data; 446 1.8 reinoud dscr->tag.tag_loc = udf_rw32(*lmapping + ptov); 447 1.8 reinoud udf_validate_tag_and_crc_sums(dscr); 448 1.8 reinoud } 449 1.8 reinoud 450 1.8 reinoud /* update mapping in the VAT */ 451 1.8 reinoud if (buf->b_udf_c_type == UDF_C_NODE) { 452 1.8 reinoud udf_VAT_mapping_update(ump, buf, *lmapping); 453 1.8 reinoud udf_fixup_node_internals(ump, buf->b_data, buf->b_udf_c_type); 454 1.8 reinoud } 455 1.8 reinoud 456 1.1 reinoud /* if we have FIDs, fixup using the new allocation table */ 457 1.1 reinoud if (buf->b_udf_c_type == UDF_C_FIDS) { 458 1.1 reinoud buf_len = buf->b_bcount; 459 1.1 reinoud bpos = 0; 460 1.1 reinoud lmappos = lmapping; 461 1.1 reinoud while (buf_len) { 462 1.1 reinoud sectornr = *lmappos++; 463 1.1 reinoud len = MIN(buf_len, sector_size); 464 1.1 reinoud fidblk = (uint8_t *) buf->b_data + bpos; 465 1.1 reinoud udf_fixup_fid_block(fidblk, sector_size, 466 1.1 reinoud 0, len, sectornr); 467 1.1 reinoud bpos += len; 468 1.1 reinoud buf_len -= len; 469 1.1 reinoud } 470 1.1 reinoud } 471 1.4 reinoud 472 1.1 reinoud VOP_STRATEGY(ump->devvp, buf); 473 1.1 reinoud } 474 1.1 reinoud 475 1.1 reinoud 476 1.1 reinoud static void 477 1.1 reinoud udf_doshedule(struct udf_mount *ump) 478 1.1 reinoud { 479 1.1 reinoud struct buf *buf; 480 1.1 reinoud struct timespec now, *last; 481 1.1 reinoud struct strat_private *priv = PRIV(ump); 482 1.1 reinoud void (*b_callback)(struct buf *); 483 1.1 reinoud int new_queue; 484 1.1 reinoud int error; 485 1.1 reinoud 486 1.7 yamt buf = bufq_get(priv->queues[priv->cur_queue]); 487 1.1 reinoud if (buf) { 488 1.1 reinoud /* transfer from the current queue to the device queue */ 489 1.1 reinoud mutex_exit(&priv->discstrat_mutex); 490 1.1 reinoud 491 1.1 reinoud /* transform buffer to synchronous; XXX needed? */ 492 1.1 reinoud b_callback = buf->b_iodone; 493 1.1 reinoud buf->b_iodone = NULL; 494 1.1 reinoud CLR(buf->b_flags, B_ASYNC); 495 1.1 reinoud 496 1.1 reinoud /* issue and wait on completion */ 497 1.1 reinoud udf_issue_buf(ump, priv->cur_queue, buf); 498 1.1 reinoud biowait(buf); 499 1.1 reinoud 500 1.1 reinoud mutex_enter(&priv->discstrat_mutex); 501 1.1 reinoud 502 1.1 reinoud /* if there is an error, repair this error, otherwise propagate */ 503 1.1 reinoud if (buf->b_error && ((buf->b_flags & B_READ) == 0)) { 504 1.1 reinoud /* check what we need to do */ 505 1.1 reinoud panic("UDF write error, can't handle yet!\n"); 506 1.1 reinoud } 507 1.1 reinoud 508 1.1 reinoud /* propagate result to higher layers */ 509 1.1 reinoud if (b_callback) { 510 1.1 reinoud buf->b_iodone = b_callback; 511 1.1 reinoud (*buf->b_iodone)(buf); 512 1.1 reinoud } 513 1.1 reinoud 514 1.1 reinoud return; 515 1.1 reinoud } 516 1.1 reinoud 517 1.1 reinoud /* Check if we're idling in this state */ 518 1.1 reinoud vfs_timestamp(&now); 519 1.1 reinoud last = &priv->last_queued[priv->cur_queue]; 520 1.1 reinoud if (ump->discinfo.mmc_class == MMC_CLASS_CD) { 521 1.1 reinoud /* dont switch too fast for CD media; its expensive in time */ 522 1.1 reinoud if (now.tv_sec - last->tv_sec < 3) 523 1.1 reinoud return; 524 1.1 reinoud } 525 1.1 reinoud 526 1.1 reinoud /* check if we can/should switch */ 527 1.1 reinoud new_queue = priv->cur_queue; 528 1.1 reinoud 529 1.7 yamt if (bufq_peek(priv->queues[UDF_SHED_READING])) 530 1.1 reinoud new_queue = UDF_SHED_READING; 531 1.9 reinoud if (bufq_peek(priv->queues[UDF_SHED_WRITING])) /* only for unmount */ 532 1.9 reinoud new_queue = UDF_SHED_WRITING; 533 1.7 yamt if (bufq_peek(priv->queues[UDF_SHED_SEQWRITING])) 534 1.1 reinoud new_queue = UDF_SHED_SEQWRITING; 535 1.1 reinoud if (priv->cur_queue == UDF_SHED_READING) { 536 1.1 reinoud if (new_queue == UDF_SHED_SEQWRITING) { 537 1.1 reinoud /* TODO use flag to signal if this is needed */ 538 1.1 reinoud mutex_exit(&priv->discstrat_mutex); 539 1.1 reinoud 540 1.1 reinoud /* update trackinfo for data and metadata */ 541 1.1 reinoud error = udf_update_trackinfo(ump, 542 1.1 reinoud &ump->data_track); 543 1.1 reinoud assert(error == 0); 544 1.1 reinoud error = udf_update_trackinfo(ump, 545 1.1 reinoud &ump->metadata_track); 546 1.1 reinoud assert(error == 0); 547 1.1 reinoud mutex_enter(&priv->discstrat_mutex); 548 1.13 christos __USE(error); 549 1.1 reinoud } 550 1.1 reinoud } 551 1.1 reinoud 552 1.1 reinoud if (new_queue != priv->cur_queue) { 553 1.1 reinoud DPRINTF(SHEDULE, ("switching from %d to %d\n", 554 1.1 reinoud priv->cur_queue, new_queue)); 555 1.16 reinoud if (new_queue == UDF_SHED_READING) 556 1.16 reinoud udf_mmc_synchronise_caches(ump); 557 1.1 reinoud } 558 1.1 reinoud 559 1.1 reinoud priv->cur_queue = new_queue; 560 1.1 reinoud } 561 1.1 reinoud 562 1.1 reinoud 563 1.1 reinoud static void 564 1.1 reinoud udf_discstrat_thread(void *arg) 565 1.1 reinoud { 566 1.1 reinoud struct udf_mount *ump = (struct udf_mount *) arg; 567 1.1 reinoud struct strat_private *priv = PRIV(ump); 568 1.1 reinoud int empty; 569 1.1 reinoud 570 1.1 reinoud empty = 1; 571 1.20 reinoud 572 1.20 reinoud priv->thread_running = 1; 573 1.20 reinoud cv_broadcast(&priv->discstrat_cv); 574 1.20 reinoud 575 1.1 reinoud mutex_enter(&priv->discstrat_mutex); 576 1.15 reinoud while (priv->run_thread || !empty || priv->sync_req) { 577 1.1 reinoud /* process the current selected queue */ 578 1.1 reinoud udf_doshedule(ump); 579 1.7 yamt empty = (bufq_peek(priv->queues[UDF_SHED_READING]) == NULL); 580 1.7 yamt empty &= (bufq_peek(priv->queues[UDF_SHED_WRITING]) == NULL); 581 1.7 yamt empty &= (bufq_peek(priv->queues[UDF_SHED_SEQWRITING]) == NULL); 582 1.1 reinoud 583 1.1 reinoud /* wait for more if needed */ 584 1.15 reinoud if (empty) { 585 1.15 reinoud if (priv->sync_req) { 586 1.15 reinoud /* on sync, we need to simulate a read->write transition */ 587 1.15 reinoud udf_mmc_synchronise_caches(ump); 588 1.15 reinoud priv->cur_queue = UDF_SHED_READING; 589 1.15 reinoud priv->sync_req = 0; 590 1.15 reinoud } 591 1.1 reinoud cv_timedwait(&priv->discstrat_cv, 592 1.1 reinoud &priv->discstrat_mutex, hz/8); 593 1.15 reinoud } 594 1.1 reinoud } 595 1.1 reinoud mutex_exit(&priv->discstrat_mutex); 596 1.1 reinoud 597 1.20 reinoud priv->thread_running = 0; 598 1.20 reinoud priv->thread_finished = 1; 599 1.20 reinoud cv_broadcast(&priv->discstrat_cv); 600 1.20 reinoud 601 1.1 reinoud kthread_exit(0); 602 1.1 reinoud /* not reached */ 603 1.1 reinoud } 604 1.1 reinoud 605 1.1 reinoud /* --------------------------------------------------------------------- */ 606 1.1 reinoud 607 1.1 reinoud static void 608 1.1 reinoud udf_discstrat_init_seq(struct udf_strat_args *args) 609 1.1 reinoud { 610 1.1 reinoud struct udf_mount *ump = args->ump; 611 1.1 reinoud struct strat_private *priv = PRIV(ump); 612 1.1 reinoud struct disk_strategy dkstrat; 613 1.1 reinoud uint32_t lb_size; 614 1.1 reinoud 615 1.1 reinoud KASSERT(ump); 616 1.1 reinoud KASSERT(ump->logical_vol); 617 1.1 reinoud KASSERT(priv == NULL); 618 1.1 reinoud 619 1.1 reinoud lb_size = udf_rw32(ump->logical_vol->lb_size); 620 1.1 reinoud KASSERT(lb_size > 0); 621 1.1 reinoud 622 1.1 reinoud /* initialise our memory space */ 623 1.1 reinoud ump->strategy_private = malloc(sizeof(struct strat_private), 624 1.1 reinoud M_UDFTEMP, M_WAITOK); 625 1.1 reinoud priv = ump->strategy_private; 626 1.1 reinoud memset(priv, 0 , sizeof(struct strat_private)); 627 1.1 reinoud 628 1.1 reinoud /* initialise locks */ 629 1.1 reinoud cv_init(&priv->discstrat_cv, "udfstrat"); 630 1.1 reinoud mutex_init(&priv->discstrat_mutex, MUTEX_DEFAULT, IPL_NONE); 631 1.1 reinoud 632 1.1 reinoud /* 633 1.1 reinoud * Initialise pool for descriptors associated with nodes. This is done 634 1.1 reinoud * in lb_size units though currently lb_size is dictated to be 635 1.1 reinoud * sector_size. 636 1.1 reinoud */ 637 1.1 reinoud pool_init(&priv->desc_pool, lb_size, 0, 0, 0, "udf_desc_pool", NULL, 638 1.1 reinoud IPL_NONE); 639 1.1 reinoud 640 1.1 reinoud /* 641 1.1 reinoud * remember old device strategy method and explicit set method 642 1.1 reinoud * `discsort' since we have our own more complex strategy that is not 643 1.1 reinoud * implementable on the CD device and other strategies will get in the 644 1.1 reinoud * way. 645 1.1 reinoud */ 646 1.1 reinoud memset(&priv->old_strategy_setting, 0, 647 1.1 reinoud sizeof(struct disk_strategy)); 648 1.1 reinoud VOP_IOCTL(ump->devvp, DIOCGSTRATEGY, &priv->old_strategy_setting, 649 1.1 reinoud FREAD | FKIOCTL, NOCRED); 650 1.1 reinoud memset(&dkstrat, 0, sizeof(struct disk_strategy)); 651 1.1 reinoud strcpy(dkstrat.dks_name, "discsort"); 652 1.1 reinoud VOP_IOCTL(ump->devvp, DIOCSSTRATEGY, &dkstrat, FWRITE | FKIOCTL, 653 1.1 reinoud NOCRED); 654 1.1 reinoud 655 1.17 andvar /* initialise our internal scheduler */ 656 1.1 reinoud priv->cur_queue = UDF_SHED_READING; 657 1.1 reinoud bufq_alloc(&priv->queues[UDF_SHED_READING], "disksort", 658 1.1 reinoud BUFQ_SORT_RAWBLOCK); 659 1.1 reinoud bufq_alloc(&priv->queues[UDF_SHED_WRITING], "disksort", 660 1.1 reinoud BUFQ_SORT_RAWBLOCK); 661 1.1 reinoud bufq_alloc(&priv->queues[UDF_SHED_SEQWRITING], "fcfs", 0); 662 1.1 reinoud vfs_timestamp(&priv->last_queued[UDF_SHED_READING]); 663 1.1 reinoud vfs_timestamp(&priv->last_queued[UDF_SHED_WRITING]); 664 1.1 reinoud vfs_timestamp(&priv->last_queued[UDF_SHED_SEQWRITING]); 665 1.1 reinoud 666 1.1 reinoud /* create our disk strategy thread */ 667 1.20 reinoud priv->thread_finished = 0; 668 1.20 reinoud priv->thread_running = 0; 669 1.20 reinoud priv->run_thread = 1; 670 1.20 reinoud priv->sync_req = 0; 671 1.1 reinoud if (kthread_create(PRI_NONE, 0 /* KTHREAD_MPSAFE*/, NULL /* cpu_info*/, 672 1.1 reinoud udf_discstrat_thread, ump, &priv->queue_lwp, 673 1.1 reinoud "%s", "udf_rw")) { 674 1.1 reinoud panic("fork udf_rw"); 675 1.1 reinoud } 676 1.20 reinoud 677 1.20 reinoud /* wait for thread to spin up */ 678 1.20 reinoud mutex_enter(&priv->discstrat_mutex); 679 1.20 reinoud while (!priv->thread_running) { 680 1.20 reinoud cv_timedwait(&priv->discstrat_cv, &priv->discstrat_mutex, hz); 681 1.20 reinoud } 682 1.20 reinoud mutex_exit(&priv->discstrat_mutex); 683 1.1 reinoud } 684 1.1 reinoud 685 1.1 reinoud 686 1.1 reinoud static void 687 1.1 reinoud udf_discstrat_finish_seq(struct udf_strat_args *args) 688 1.1 reinoud { 689 1.1 reinoud struct udf_mount *ump = args->ump; 690 1.1 reinoud struct strat_private *priv = PRIV(ump); 691 1.1 reinoud 692 1.1 reinoud if (ump == NULL) 693 1.1 reinoud return; 694 1.1 reinoud 695 1.17 andvar /* stop our scheduling thread */ 696 1.1 reinoud KASSERT(priv->run_thread == 1); 697 1.1 reinoud priv->run_thread = 0; 698 1.20 reinoud 699 1.20 reinoud mutex_enter(&priv->discstrat_mutex); 700 1.20 reinoud while (!priv->thread_finished) { 701 1.20 reinoud cv_broadcast(&priv->discstrat_cv); 702 1.20 reinoud cv_timedwait(&priv->discstrat_cv, &priv->discstrat_mutex, hz); 703 1.20 reinoud } 704 1.20 reinoud mutex_exit(&priv->discstrat_mutex); 705 1.20 reinoud 706 1.1 reinoud /* kthread should be finished now */ 707 1.1 reinoud 708 1.1 reinoud /* set back old device strategy method */ 709 1.1 reinoud VOP_IOCTL(ump->devvp, DIOCSSTRATEGY, &priv->old_strategy_setting, 710 1.1 reinoud FWRITE, NOCRED); 711 1.1 reinoud 712 1.1 reinoud /* destroy our pool */ 713 1.1 reinoud pool_destroy(&priv->desc_pool); 714 1.1 reinoud 715 1.11 drochner mutex_destroy(&priv->discstrat_mutex); 716 1.11 drochner cv_destroy(&priv->discstrat_cv); 717 1.11 drochner 718 1.1 reinoud /* free our private space */ 719 1.1 reinoud free(ump->strategy_private, M_UDFTEMP); 720 1.1 reinoud ump->strategy_private = NULL; 721 1.1 reinoud } 722 1.1 reinoud 723 1.1 reinoud /* --------------------------------------------------------------------- */ 724 1.1 reinoud 725 1.1 reinoud struct udf_strategy udf_strat_sequential = 726 1.1 reinoud { 727 1.1 reinoud udf_create_logvol_dscr_seq, 728 1.1 reinoud udf_free_logvol_dscr_seq, 729 1.1 reinoud udf_read_logvol_dscr_seq, 730 1.1 reinoud udf_write_logvol_dscr_seq, 731 1.1 reinoud udf_queuebuf_seq, 732 1.15 reinoud udf_sync_caches_seq, 733 1.1 reinoud udf_discstrat_init_seq, 734 1.1 reinoud udf_discstrat_finish_seq 735 1.1 reinoud }; 736 1.18 skrll 737 1.1 reinoud 738