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