1 /* 2 * Copyright (c) 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This software was developed by the Computer Systems Engineering group 6 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 7 * contributed to Berkeley. 8 * 9 * All advertising materials mentioning features or use of this software 10 * must display the following acknowledgement: 11 * This product includes software developed by the University of 12 * California, Lawrence Berkeley Laboratory. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions 16 * are met: 17 * 1. Redistributions of source code must retain the above copyright 18 * notice, this list of conditions and the following disclaimer. 19 * 2. Redistributions in binary form must reproduce the above copyright 20 * notice, this list of conditions and the following disclaimer in the 21 * documentation and/or other materials provided with the distribution. 22 * 3. All advertising materials mentioning features or use of this software 23 * must display the following acknowledgement: 24 * This product includes software developed by the University of 25 * California, Berkeley and its contributors. 26 * 4. Neither the name of the University nor the names of its contributors 27 * may be used to endorse or promote products derived from this software 28 * without specific prior written permission. 29 * 30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 * 42 * from: Header: disk.h,v 1.5 92/11/19 04:33:03 torek Exp (LBL) 43 * 44 * from: @(#)disk.h 8.1 (Berkeley) 6/2/93 45 * $Id: disk.h,v 1.5 1994/05/21 04:07:16 cgd Exp $ 46 */ 47 48 /* 49 * Disk device structures. 50 * 51 * Note that this is only a preliminary outline. The final disk structures 52 * may be somewhat different. 53 */ 54 struct buf; 55 56 struct dkdevice { 57 struct device dk_dev; /* base device */ 58 struct dkdevice *dk_next; /* list of disks; not yet used */ 59 int dk_bps; /* xfer rate: bytes per second */ 60 int dk_bopenmask; /* block devices open */ 61 int dk_copenmask; /* character devices open */ 62 int dk_openmask; /* composite (bopen|copen) */ 63 int dk_state; /* label state ### */ 64 int dk_blkshift; /* shift to convert DEV_BSIZE to blks */ 65 int dk_byteshift; /* shift to convert bytes to blks */ 66 struct dkdriver *dk_driver; /* pointer to driver */ 67 daddr_t dk_labelsector; /* sector containing label */ 68 struct disklabel dk_label; /* label */ 69 struct cpu_disklabel dk_cpulabel; 70 }; 71 72 struct dkdriver { 73 void (*d_strategy) __P((struct buf *)); 74 #ifdef notyet 75 int (*d_open) __P((dev_t dev, int ifmt, int, struct proc *)); 76 int (*d_close) __P((dev_t dev, int, int ifmt, struct proc *)); 77 int (*d_ioctl) __P((dev_t dev, int cmd, caddr_t data, int fflag, 78 struct proc *)); 79 int (*d_dump) __P((dev_t)); 80 void (*d_start) __P((struct buf *, daddr_t)); 81 int (*d_mklabel) __P((struct dkdevice *)); 82 #endif 83 }; 84 85 /* states */ 86 #define DK_CLOSED 0 /* drive is closed */ 87 #define DK_WANTOPEN 1 /* drive being opened */ 88 #define DK_WANTOPENRAW 2 /* drive being opened */ 89 #define DK_RDLABEL 3 /* label being read */ 90 #define DK_OPEN 4 /* label read, drive open */ 91 #define DK_OPENRAW 5 /* open without label */ 92 93 #ifdef DISKSORT_STATS 94 /* 95 * Stats from disksort(). 96 */ 97 struct disksort_stats { 98 long ds_newhead; /* # new queue heads created */ 99 long ds_newtail; /* # new queue tails created */ 100 long ds_midfirst; /* # insertions into sort list */ 101 long ds_endfirst; /* # insertions at end of sort list */ 102 long ds_newsecond; /* # inversions (2nd lists) created */ 103 long ds_midsecond; /* # insertions into 2nd list */ 104 long ds_endsecond; /* # insertions at end of 2nd list */ 105 }; 106 #endif 107