Merge from vendor branch HEIMDAL:
[dragonfly.git] / sys / kern / subr_disk.c
CommitLineData
984263bc 1/*
8c10bfcf
MD
2 * Copyright (c) 2003,2004 The DragonFly Project. All rights reserved.
3 *
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
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 *
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
16 * distribution.
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
984263bc
MD
34 * ----------------------------------------------------------------------------
35 * "THE BEER-WARE LICENSE" (Revision 42):
36 * <phk@FreeBSD.ORG> wrote this file. As long as you retain this notice you
37 * can do whatever you want with this stuff. If we meet some day, and you think
38 * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
39 * ----------------------------------------------------------------------------
40 *
7a9e53ad
MD
41 * Copyright (c) 1982, 1986, 1988, 1993
42 * The Regents of the University of California. All rights reserved.
43 * (c) UNIX System Laboratories, Inc.
44 * All or some portions of this file are derived from material licensed
45 * to the University of California by American Telephone and Telegraph
46 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
47 * the permission of UNIX System Laboratories, Inc.
48 *
49 * Redistribution and use in source and binary forms, with or without
50 * modification, are permitted provided that the following conditions
51 * are met:
52 * 1. Redistributions of source code must retain the above copyright
53 * notice, this list of conditions and the following disclaimer.
54 * 2. Redistributions in binary form must reproduce the above copyright
55 * notice, this list of conditions and the following disclaimer in the
56 * documentation and/or other materials provided with the distribution.
57 * 3. All advertising materials mentioning features or use of this software
58 * must display the following acknowledgement:
59 * This product includes software developed by the University of
60 * California, Berkeley and its contributors.
61 * 4. Neither the name of the University nor the names of its contributors
62 * may be used to endorse or promote products derived from this software
63 * without specific prior written permission.
64 *
65 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
66 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
67 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
68 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
69 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
70 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
71 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
72 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
73 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
74 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
75 * SUCH DAMAGE.
984263bc 76 *
7a9e53ad
MD
77 * @(#)ufs_disksubr.c 8.5 (Berkeley) 1/21/94
78 * $FreeBSD: src/sys/kern/subr_disk.c,v 1.20.2.6 2001/10/05 07:14:57 peter Exp $
79 * $FreeBSD: src/sys/ufs/ufs/ufs_disksubr.c,v 1.44.2.3 2001/03/05 05:42:19 obrien Exp $
0015ee8d 80 * $DragonFly: src/sys/kern/subr_disk.c,v 1.14 2004/09/15 02:56:35 dillon Exp $
984263bc
MD
81 */
82
83#include <sys/param.h>
84#include <sys/systm.h>
85#include <sys/kernel.h>
7a9e53ad 86#include <sys/proc.h>
984263bc
MD
87#include <sys/sysctl.h>
88#include <sys/buf.h>
89#include <sys/conf.h>
7a9e53ad
MD
90#include <sys/disklabel.h>
91#include <sys/diskslice.h>
984263bc
MD
92#include <sys/disk.h>
93#include <sys/malloc.h>
94#include <sys/sysctl.h>
95#include <machine/md_var.h>
96#include <sys/ctype.h>
7a9e53ad
MD
97#include <sys/syslog.h>
98#include <sys/device.h>
335dda38
MD
99#include <sys/msgport.h>
100#include <sys/msgport2.h>
7a9e53ad 101#include <sys/buf2.h>
984263bc
MD
102
103static MALLOC_DEFINE(M_DISK, "disk", "disk data");
104
105static d_strategy_t diskstrategy;
106static d_open_t diskopen;
107static d_close_t diskclose;
108static d_ioctl_t diskioctl;
109static d_psize_t diskpsize;
e4c9c0c8 110static d_clone_t diskclone;
335dda38 111static int disk_putport(lwkt_port_t port, lwkt_msg_t msg);
984263bc
MD
112
113static LIST_HEAD(, disk) disklist = LIST_HEAD_INITIALIZER(&disklist);
114
335dda38 115/*
e4c9c0c8
MD
116 * Create a slice and unit managed disk.
117 *
118 * Our port layer will be responsible for assigning pblkno and handling
119 * high level partition operations, then forwarding the requests to the
120 * raw device.
121 *
122 * The raw device (based on rawsw) is returned to the caller, NOT the
123 * slice and unit managed cdev. The caller typically sets various
124 * driver parameters and IO limits on the returned rawdev which we must
125 * inherit when our managed device is opened.
335dda38 126 */
984263bc 127dev_t
e4c9c0c8 128disk_create(int unit, struct disk *dp, int flags, struct cdevsw *rawsw)
984263bc 129{
e4c9c0c8
MD
130 dev_t rawdev;
131 struct cdevsw *devsw;
132
133 /*
134 * Create the raw backing device
135 */
136 compile_devsw(rawsw);
fbda7fa6 137 rawdev = make_dev(rawsw, dkmakeminor(unit, WHOLE_DISK_SLICE, RAW_PART),
e4c9c0c8
MD
138 UID_ROOT, GID_OPERATOR, 0640,
139 "%s%d", rawsw->d_name, unit);
984263bc 140
e4c9c0c8
MD
141 /*
142 * Initialize our intercept port
143 */
984263bc 144 bzero(dp, sizeof(*dp));
e4c9c0c8 145 lwkt_initport(&dp->d_port, NULL);
df2244e3 146 dp->d_port.mp_putport = disk_putport;
e4c9c0c8 147 dp->d_rawsw = rawsw;
984263bc 148
e4c9c0c8
MD
149 /*
150 * We install a custom cdevsw rather then the passed cdevsw,
151 * and save our disk structure in d_data so we can get at it easily
152 * without any complex cloning code.
335dda38 153 */
e4c9c0c8
MD
154 devsw = cdevsw_add_override(rawdev, dkunitmask(), dkmakeunit(unit));
155 devsw->d_port = &dp->d_port;
156 devsw->d_data = dp;
157 devsw->d_clone = diskclone;
158 dp->d_devsw = devsw;
159 dp->d_rawdev = rawdev;
160 dp->d_cdev = make_dev(devsw,
161 dkmakeminor(unit, WHOLE_DISK_SLICE, RAW_PART),
162 UID_ROOT, GID_OPERATOR, 0640,
163 "%s%d", devsw->d_name, unit);
164
984263bc 165 dp->d_dsflags = flags;
984263bc 166 LIST_INSERT_HEAD(&disklist, dp, d_list);
e4c9c0c8 167 return (dp->d_rawdev);
984263bc
MD
168}
169
e4c9c0c8
MD
170/*
171 * This routine is called when an adapter detaches. The higher level
172 * managed disk device is destroyed while the lower level raw device is
173 * released.
174 */
335dda38
MD
175void
176disk_destroy(struct disk *disk)
177{
e4c9c0c8 178 if (disk->d_devsw) {
0015ee8d
MD
179 cdevsw_remove(disk->d_devsw, dkunitmask(),
180 dkmakeunit(dkunit(disk->d_cdev)));
e4c9c0c8
MD
181 LIST_REMOVE(disk, d_list);
182 }
0015ee8d
MD
183 if (disk->d_rawsw) {
184 destroy_all_dev(disk->d_rawsw, dkunitmask(),
185 dkmakeunit(dkunit(disk->d_rawdev)));
186 }
335dda38 187 bzero(disk, sizeof(*disk));
335dda38
MD
188}
189
984263bc
MD
190int
191disk_dumpcheck(dev_t dev, u_int *count, u_int *blkno, u_int *secsize)
192{
193 struct disk *dp;
194 struct disklabel *dl;
195 u_int boff;
196
197 dp = dev->si_disk;
198 if (!dp)
199 return (ENXIO);
200 if (!dp->d_slice)
201 return (ENXIO);
202 dl = dsgetlabel(dev, dp->d_slice);
203 if (!dl)
204 return (ENXIO);
205 *count = Maxmem * (PAGE_SIZE / dl->d_secsize);
206 if (dumplo <= LABELSECTOR ||
207 (dumplo + *count > dl->d_partitions[dkpart(dev)].p_size))
208 return (EINVAL);
209 boff = dl->d_partitions[dkpart(dev)].p_offset +
210 dp->d_slice->dss_slices[dkslice(dev)].ds_offset;
211 *blkno = boff + dumplo;
212 *secsize = dl->d_secsize;
213 return (0);
214
215}
216
217void
218disk_invalidate (struct disk *disk)
219{
220 if (disk->d_slice)
221 dsgone(&disk->d_slice);
222}
223
984263bc
MD
224struct disk *
225disk_enumerate(struct disk *disk)
226{
227 if (!disk)
228 return (LIST_FIRST(&disklist));
229 else
230 return (LIST_NEXT(disk, d_list));
231}
232
fbda7fa6
MD
233static
234int
984263bc
MD
235sysctl_disks(SYSCTL_HANDLER_ARGS)
236{
237 struct disk *disk;
238 int error, first;
239
240 disk = NULL;
241 first = 1;
242
243 while ((disk = disk_enumerate(disk))) {
244 if (!first) {
245 error = SYSCTL_OUT(req, " ", 1);
246 if (error)
247 return error;
248 } else {
249 first = 0;
250 }
e4c9c0c8 251 error = SYSCTL_OUT(req, disk->d_rawdev->si_name, strlen(disk->d_rawdev->si_name));
984263bc
MD
252 if (error)
253 return error;
254 }
255 error = SYSCTL_OUT(req, "", 1);
256 return error;
257}
258
259SYSCTL_PROC(_kern, OID_AUTO, disks, CTLTYPE_STRING | CTLFLAG_RD, 0, NULL,
260 sysctl_disks, "A", "names of available disks");
261
262/*
335dda38 263 * The port intercept functions
984263bc 264 */
335dda38
MD
265static
266int
267disk_putport(lwkt_port_t port, lwkt_msg_t lmsg)
268{
269 struct disk *disk = (struct disk *)port;
270 cdevallmsg_t msg = (cdevallmsg_t)lmsg;
271 int error;
272
b44419cb 273 switch(msg->am_lmsg.ms_cmd.cm_op) {
335dda38
MD
274 case CDEV_CMD_OPEN:
275 error = diskopen(
276 msg->am_open.msg.dev,
277 msg->am_open.oflags,
278 msg->am_open.devtype,
279 msg->am_open.td);
280 break;
281 case CDEV_CMD_CLOSE:
282 error = diskclose(
283 msg->am_close.msg.dev,
284 msg->am_close.fflag,
285 msg->am_close.devtype,
286 msg->am_close.td);
287 break;
288 case CDEV_CMD_IOCTL:
289 error = diskioctl(
290 msg->am_ioctl.msg.dev,
291 msg->am_ioctl.cmd,
292 msg->am_ioctl.data,
293 msg->am_ioctl.fflag,
294 msg->am_ioctl.td);
295 break;
296 case CDEV_CMD_STRATEGY:
297 diskstrategy(msg->am_strategy.bp);
298 error = 0;
299 break;
300 case CDEV_CMD_PSIZE:
301 msg->am_psize.result = diskpsize(msg->am_psize.msg.dev);
302 error = 0; /* XXX */
303 break;
e4c9c0c8
MD
304 case CDEV_CMD_READ:
305 error = physio(msg->am_read.msg.dev,
306 msg->am_read.uio, msg->am_read.ioflag);
307 break;
308 case CDEV_CMD_WRITE:
309 error = physio(msg->am_write.msg.dev,
310 msg->am_write.uio, msg->am_write.ioflag);
311 break;
312 case CDEV_CMD_POLL:
313 case CDEV_CMD_KQFILTER:
314 error = ENODEV;
315 case CDEV_CMD_MMAP:
316 error = -1;
317 break;
318 case CDEV_CMD_DUMP:
319 error = disk_dumpcheck(msg->am_dump.msg.dev,
320 &msg->am_dump.count,
321 &msg->am_dump.blkno,
322 &msg->am_dump.secsize);
323 if (error == 0) {
324 msg->am_dump.msg.dev = disk->d_rawdev;
325 error = lwkt_forwardmsg(disk->d_rawdev->si_port,
326 &msg->am_dump.msg.msg);
327 printf("error2 %d\n", error);
328 }
329 break;
335dda38 330 default:
e4c9c0c8 331 error = ENOTSUP;
335dda38
MD
332 break;
333 }
334 return(error);
335}
984263bc 336
e4c9c0c8
MD
337/*
338 * When new device entries are instantiated, make sure they inherit our
339 * si_disk structure and block and iosize limits from the raw device.
340 *
341 * This routine is always called synchronously in the context of the
342 * client.
343 *
344 * XXX The various io and block size constraints are not always initialized
345 * properly by devices.
346 */
347static
348int
349diskclone(dev_t dev)
350{
351 struct disk *dp;
352
353 dp = dev->si_devsw->d_data;
354 KKASSERT(dp != NULL);
355 dev->si_disk = dp;
356 dev->si_iosize_max = dp->d_rawdev->si_iosize_max;
357 dev->si_bsize_phys = dp->d_rawdev->si_bsize_phys;
358 dev->si_bsize_best = dp->d_rawdev->si_bsize_best;
359 return(0);
360}
361
362/*
363 * Open a disk device or partition.
364 */
fbda7fa6
MD
365static
366int
41c20dac 367diskopen(dev_t dev, int oflags, int devtype, struct thread *td)
984263bc 368{
984263bc
MD
369 struct disk *dp;
370 int error;
371
e4c9c0c8
MD
372 /*
373 * dp can't be NULL here XXX.
374 */
984263bc 375 error = 0;
e4c9c0c8 376 dp = dev->si_disk;
335dda38 377 if (dp == NULL)
984263bc
MD
378 return (ENXIO);
379
e4c9c0c8
MD
380 /*
381 * Deal with open races
382 */
984263bc
MD
383 while (dp->d_flags & DISKFLAG_LOCK) {
384 dp->d_flags |= DISKFLAG_WANTED;
377d4740 385 error = tsleep(dp, PCATCH, "diskopen", hz);
984263bc
MD
386 if (error)
387 return (error);
388 }
389 dp->d_flags |= DISKFLAG_LOCK;
390
e4c9c0c8
MD
391 /*
392 * Open the underlying raw device.
393 */
984263bc 394 if (!dsisopen(dp->d_slice)) {
e4c9c0c8 395#if 0
984263bc
MD
396 if (!pdev->si_iosize_max)
397 pdev->si_iosize_max = dev->si_iosize_max;
e4c9c0c8
MD
398#endif
399 error = dev_dopen(dp->d_rawdev, oflags, devtype, td);
984263bc
MD
400 }
401
e4c9c0c8
MD
402 /*
403 * Inherit properties from the underlying device now that it is
404 * open.
405 */
406 diskclone(dev);
984263bc
MD
407
408 if (error)
409 goto out;
410
411 error = dsopen(dev, devtype, dp->d_dsflags, &dp->d_slice, &dp->d_label);
412
413 if (!dsisopen(dp->d_slice))
e4c9c0c8 414 dev_dclose(dp->d_rawdev, oflags, devtype, td);
984263bc
MD
415out:
416 dp->d_flags &= ~DISKFLAG_LOCK;
417 if (dp->d_flags & DISKFLAG_WANTED) {
418 dp->d_flags &= ~DISKFLAG_WANTED;
419 wakeup(dp);
420 }
421
422 return(error);
423}
424
e4c9c0c8
MD
425/*
426 * Close a disk device or partition
427 */
fbda7fa6
MD
428static
429int
41c20dac 430diskclose(dev_t dev, int fflag, int devtype, struct thread *td)
984263bc
MD
431{
432 struct disk *dp;
433 int error;
984263bc
MD
434
435 error = 0;
e4c9c0c8
MD
436 dp = dev->si_disk;
437
984263bc
MD
438 dsclose(dev, devtype, dp->d_slice);
439 if (!dsisopen(dp->d_slice))
e4c9c0c8 440 error = dev_dclose(dp->d_rawdev, fflag, devtype, td);
984263bc
MD
441 return (error);
442}
443
e4c9c0c8
MD
444/*
445 * Execute strategy routine
446 */
fbda7fa6
MD
447static
448void
984263bc
MD
449diskstrategy(struct buf *bp)
450{
984263bc
MD
451 struct disk *dp;
452
e4c9c0c8 453 dp = bp->b_dev->si_disk;
984263bc 454
e4c9c0c8 455 if (dp == NULL) {
984263bc
MD
456 bp->b_error = ENXIO;
457 bp->b_flags |= B_ERROR;
458 biodone(bp);
459 return;
460 }
e4c9c0c8 461 KKASSERT(bp->b_dev->si_disk == dp);
984263bc
MD
462
463 if (dscheck(bp, dp->d_slice) <= 0) {
464 biodone(bp);
465 return;
466 }
e4c9c0c8
MD
467 bp->b_dev = dp->d_rawdev;
468 dev_dstrategy(dp->d_rawdev, bp);
984263bc
MD
469}
470
335dda38 471/*
e4c9c0c8
MD
472 * First execute the ioctl on the disk device, and if it isn't supported
473 * try running it on the backing device.
335dda38 474 */
fbda7fa6
MD
475static
476int
41c20dac 477diskioctl(dev_t dev, u_long cmd, caddr_t data, int fflag, struct thread *td)
984263bc
MD
478{
479 struct disk *dp;
480 int error;
984263bc 481
e4c9c0c8
MD
482 dp = dev->si_disk;
483 if (dp == NULL)
984263bc 484 return (ENXIO);
e4c9c0c8 485
984263bc
MD
486 error = dsioctl(dev, cmd, data, fflag, &dp->d_slice);
487 if (error == ENOIOCTL)
e4c9c0c8 488 error = dev_dioctl(dp->d_rawdev, cmd, data, fflag, td);
984263bc
MD
489 return (error);
490}
491
e4c9c0c8
MD
492/*
493 *
494 */
fbda7fa6
MD
495static
496int
984263bc
MD
497diskpsize(dev_t dev)
498{
499 struct disk *dp;
984263bc 500
e4c9c0c8
MD
501 dp = dev->si_disk;
502 if (dp == NULL)
984263bc 503 return (-1);
e4c9c0c8
MD
504 return(dssize(dev, &dp->d_slice));
505#if 0
984263bc
MD
506 if (dp != dev->si_disk) {
507 dev->si_drv1 = pdev->si_drv1;
508 dev->si_drv2 = pdev->si_drv2;
509 /* XXX: don't set bp->b_dev->si_disk (?) */
510 }
e4c9c0c8 511#endif
984263bc
MD
512}
513
514SYSCTL_DECL(_debug_sizeof);
515
516SYSCTL_INT(_debug_sizeof, OID_AUTO, disklabel, CTLFLAG_RD,
517 0, sizeof(struct disklabel), "sizeof(struct disklabel)");
518
519SYSCTL_INT(_debug_sizeof, OID_AUTO, diskslices, CTLFLAG_RD,
520 0, sizeof(struct diskslices), "sizeof(struct diskslices)");
521
522SYSCTL_INT(_debug_sizeof, OID_AUTO, disk, CTLFLAG_RD,
523 0, sizeof(struct disk), "sizeof(struct disk)");
7a9e53ad
MD
524
525
526/*
527 * Seek sort for disks.
528 *
529 * The buf_queue keep two queues, sorted in ascending block order. The first
530 * queue holds those requests which are positioned after the current block
531 * (in the first request); the second, which starts at queue->switch_point,
532 * holds requests which came in after their block number was passed. Thus
533 * we implement a one way scan, retracting after reaching the end of the drive
534 * to the first request on the second queue, at which time it becomes the
535 * first queue.
536 *
537 * A one-way scan is natural because of the way UNIX read-ahead blocks are
538 * allocated.
539 */
540void
fbda7fa6 541bufqdisksort(struct buf_queue_head *bufq, struct buf *bp)
7a9e53ad
MD
542{
543 struct buf *bq;
544 struct buf *bn;
545 struct buf *be;
546
547 be = TAILQ_LAST(&bufq->queue, buf_queue);
548 /*
549 * If the queue is empty or we are an
550 * ordered transaction, then it's easy.
551 */
fbda7fa6
MD
552 if ((bq = bufq_first(bufq)) == NULL ||
553 (bp->b_flags & B_ORDERED) != 0) {
7a9e53ad
MD
554 bufq_insert_tail(bufq, bp);
555 return;
556 } else if (bufq->insert_point != NULL) {
557
558 /*
559 * A certain portion of the list is
560 * "locked" to preserve ordering, so
561 * we can only insert after the insert
562 * point.
563 */
564 bq = bufq->insert_point;
565 } else {
566
567 /*
568 * If we lie before the last removed (currently active)
569 * request, and are not inserting ourselves into the
570 * "locked" portion of the list, then we must add ourselves
571 * to the second request list.
572 */
573 if (bp->b_pblkno < bufq->last_pblkno) {
574
575 bq = bufq->switch_point;
576 /*
577 * If we are starting a new secondary list,
578 * then it's easy.
579 */
580 if (bq == NULL) {
581 bufq->switch_point = bp;
582 bufq_insert_tail(bufq, bp);
583 return;
584 }
585 /*
586 * If we lie ahead of the current switch point,
587 * insert us before the switch point and move
588 * the switch point.
589 */
590 if (bp->b_pblkno < bq->b_pblkno) {
591 bufq->switch_point = bp;
592 TAILQ_INSERT_BEFORE(bq, bp, b_act);
593 return;
594 }
595 } else {
596 if (bufq->switch_point != NULL)
597 be = TAILQ_PREV(bufq->switch_point,
598 buf_queue, b_act);
599 /*
600 * If we lie between last_pblkno and bq,
601 * insert before bq.
602 */
603 if (bp->b_pblkno < bq->b_pblkno) {
604 TAILQ_INSERT_BEFORE(bq, bp, b_act);
605 return;
606 }
607 }
608 }
609
610 /*
611 * Request is at/after our current position in the list.
612 * Optimize for sequential I/O by seeing if we go at the tail.
613 */
614 if (bp->b_pblkno > be->b_pblkno) {
615 TAILQ_INSERT_AFTER(&bufq->queue, be, bp, b_act);
616 return;
617 }
618
619 /* Otherwise, insertion sort */
620 while ((bn = TAILQ_NEXT(bq, b_act)) != NULL) {
621
622 /*
623 * We want to go after the current request if it is the end
624 * of the first request list, or if the next request is a
625 * larger cylinder than our request.
626 */
627 if (bn == bufq->switch_point
628 || bp->b_pblkno < bn->b_pblkno)
629 break;
630 bq = bn;
631 }
632 TAILQ_INSERT_AFTER(&bufq->queue, bq, bp, b_act);
633}
634
635
636/*
637 * Attempt to read a disk label from a device using the indicated strategy
638 * routine. The label must be partly set up before this: secpercyl, secsize
639 * and anything required in the strategy routine (e.g., dummy bounds for the
640 * partition containing the label) must be filled in before calling us.
641 * Returns NULL on success and an error string on failure.
642 */
643char *
e4c9c0c8 644readdisklabel(dev_t dev, struct disklabel *lp)
7a9e53ad
MD
645{
646 struct buf *bp;
647 struct disklabel *dlp;
648 char *msg = NULL;
649
650 bp = geteblk((int)lp->d_secsize);
651 bp->b_dev = dev;
652 bp->b_blkno = LABELSECTOR * ((int)lp->d_secsize/DEV_BSIZE);
653 bp->b_bcount = lp->d_secsize;
654 bp->b_flags &= ~B_INVAL;
655 bp->b_flags |= B_READ;
656 BUF_STRATEGY(bp, 1);
657 if (biowait(bp))
658 msg = "I/O error";
659 else for (dlp = (struct disklabel *)bp->b_data;
660 dlp <= (struct disklabel *)((char *)bp->b_data +
661 lp->d_secsize - sizeof(*dlp));
662 dlp = (struct disklabel *)((char *)dlp + sizeof(long))) {
663 if (dlp->d_magic != DISKMAGIC || dlp->d_magic2 != DISKMAGIC) {
664 if (msg == NULL)
665 msg = "no disk label";
666 } else if (dlp->d_npartitions > MAXPARTITIONS ||
667 dkcksum(dlp) != 0)
668 msg = "disk label corrupted";
669 else {
670 *lp = *dlp;
671 msg = NULL;
672 break;
673 }
674 }
675 bp->b_flags |= B_INVAL | B_AGE;
676 brelse(bp);
677 return (msg);
678}
679
680/*
681 * Check new disk label for sensibility before setting it.
682 */
683int
fbda7fa6 684setdisklabel(struct disklabel *olp, struct disklabel *nlp, u_long openmask)
7a9e53ad
MD
685{
686 int i;
687 struct partition *opp, *npp;
688
689 /*
690 * Check it is actually a disklabel we are looking at.
691 */
692 if (nlp->d_magic != DISKMAGIC || nlp->d_magic2 != DISKMAGIC ||
693 dkcksum(nlp) != 0)
694 return (EINVAL);
695 /*
696 * For each partition that we think is open,
697 */
698 while ((i = ffs((long)openmask)) != 0) {
699 i--;
700 /*
701 * Check it is not changing....
702 */
703 openmask &= ~(1 << i);
704 if (nlp->d_npartitions <= i)
705 return (EBUSY);
706 opp = &olp->d_partitions[i];
707 npp = &nlp->d_partitions[i];
708 if (npp->p_offset != opp->p_offset || npp->p_size < opp->p_size)
709 return (EBUSY);
710 /*
711 * Copy internally-set partition information
712 * if new label doesn't include it. XXX
713 * (If we are using it then we had better stay the same type)
714 * This is possibly dubious, as someone else noted (XXX)
715 */
716 if (npp->p_fstype == FS_UNUSED && opp->p_fstype != FS_UNUSED) {
717 npp->p_fstype = opp->p_fstype;
718 npp->p_fsize = opp->p_fsize;
719 npp->p_frag = opp->p_frag;
720 npp->p_cpg = opp->p_cpg;
721 }
722 }
723 nlp->d_checksum = 0;
724 nlp->d_checksum = dkcksum(nlp);
725 *olp = *nlp;
726 return (0);
727}
728
729/*
730 * Write disk label back to device after modification.
731 */
732int
e4c9c0c8 733writedisklabel(dev_t dev, struct disklabel *lp)
7a9e53ad
MD
734{
735 struct buf *bp;
736 struct disklabel *dlp;
737 int error = 0;
738
739 if (lp->d_partitions[RAW_PART].p_offset != 0)
740 return (EXDEV); /* not quite right */
741 bp = geteblk((int)lp->d_secsize);
742 bp->b_dev = dkmodpart(dev, RAW_PART);
743 bp->b_blkno = LABELSECTOR * ((int)lp->d_secsize/DEV_BSIZE);
744 bp->b_bcount = lp->d_secsize;
745#if 1
746 /*
747 * We read the label first to see if it's there,
748 * in which case we will put ours at the same offset into the block..
749 * (I think this is stupid [Julian])
750 * Note that you can't write a label out over a corrupted label!
751 * (also stupid.. how do you write the first one? by raw writes?)
752 */
753 bp->b_flags &= ~B_INVAL;
754 bp->b_flags |= B_READ;
755 BUF_STRATEGY(bp, 1);
756 error = biowait(bp);
757 if (error)
758 goto done;
759 for (dlp = (struct disklabel *)bp->b_data;
760 dlp <= (struct disklabel *)
761 ((char *)bp->b_data + lp->d_secsize - sizeof(*dlp));
762 dlp = (struct disklabel *)((char *)dlp + sizeof(long))) {
763 if (dlp->d_magic == DISKMAGIC && dlp->d_magic2 == DISKMAGIC &&
764 dkcksum(dlp) == 0) {
765 *dlp = *lp;
766 bp->b_flags &= ~(B_DONE | B_READ);
767 bp->b_flags |= B_WRITE;
e4c9c0c8 768 bp->b_dev = dkmodpart(dev, RAW_PART);
7a9e53ad
MD
769#ifdef __alpha__
770 alpha_fix_srm_checksum(bp);
771#endif
772 BUF_STRATEGY(bp, 1);
773 error = biowait(bp);
774 goto done;
775 }
776 }
777 error = ESRCH;
778done:
779#else
780 bzero(bp->b_data, lp->d_secsize);
781 dlp = (struct disklabel *)bp->b_data;
782 *dlp = *lp;
783 bp->b_flags &= ~B_INVAL;
784 bp->b_flags |= B_WRITE;
785 BUF_STRATEGY(bp, 1);
786 error = biowait(bp);
787#endif
788 bp->b_flags |= B_INVAL | B_AGE;
789 brelse(bp);
790 return (error);
791}
792
793/*
794 * Disk error is the preface to plaintive error messages
795 * about failing disk transfers. It prints messages of the form
796
797hp0g: hard error reading fsbn 12345 of 12344-12347 (hp0 bn %d cn %d tn %d sn %d)
798
799 * if the offset of the error in the transfer and a disk label
800 * are both available. blkdone should be -1 if the position of the error
801 * is unknown; the disklabel pointer may be null from drivers that have not
802 * been converted to use them. The message is printed with printf
803 * if pri is LOG_PRINTF, otherwise it uses log at the specified priority.
804 * The message should be completed (with at least a newline) with printf
805 * or addlog, respectively. There is no trailing space.
806 */
807void
ee3ad2c9
MD
808diskerr(struct buf *bp, dev_t dev, char *what, int pri,
809 int blkdone, struct disklabel *lp)
7a9e53ad 810{
ee3ad2c9
MD
811 int unit = dkunit(dev);
812 int slice = dkslice(dev);
813 int part = dkpart(dev);
7a9e53ad
MD
814 char partname[2];
815 char *sname;
816 daddr_t sn;
817
ee3ad2c9 818 sname = dsname(dev, unit, slice, part, partname);
7a9e53ad
MD
819 printf("%s%s: %s %sing fsbn ", sname, partname, what,
820 bp->b_flags & B_READ ? "read" : "writ");
821 sn = bp->b_blkno;
ee3ad2c9 822 if (bp->b_bcount <= DEV_BSIZE) {
7a9e53ad 823 printf("%ld", (long)sn);
ee3ad2c9 824 } else {
7a9e53ad
MD
825 if (blkdone >= 0) {
826 sn += blkdone;
827 printf("%ld of ", (long)sn);
828 }
829 printf("%ld-%ld", (long)bp->b_blkno,
830 (long)(bp->b_blkno + (bp->b_bcount - 1) / DEV_BSIZE));
831 }
832 if (lp && (blkdone >= 0 || bp->b_bcount <= lp->d_secsize)) {
833#ifdef tahoe
834 sn *= DEV_BSIZE / lp->d_secsize; /* XXX */
835#endif
836 sn += lp->d_partitions[part].p_offset;
837 /*
838 * XXX should add slice offset and not print the slice,
839 * but we don't know the slice pointer.
840 * XXX should print bp->b_pblkno so that this will work
841 * independent of slices, labels and bad sector remapping,
842 * but some drivers don't set bp->b_pblkno.
843 */
844 printf(" (%s bn %ld; cn %ld", sname, (long)sn,
845 (long)(sn / lp->d_secpercyl));
846 sn %= (long)lp->d_secpercyl;
847 printf(" tn %ld sn %ld)", (long)(sn / lp->d_nsectors),
848 (long)(sn % lp->d_nsectors));
849 }
850}