1 /* $NetBSD: subr_disk.c,v 1.12 1994/06/29 06:32:56 cgd Exp $ */ 2 3 /* 4 * Copyright (c) 1982, 1986, 1988, 1993 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the University of 23 * California, Berkeley and its contributors. 24 * 4. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 * 40 * @(#)ufs_disksubr.c 8.5 (Berkeley) 1/21/94 41 */ 42 43 #include <sys/param.h> 44 #include <sys/systm.h> 45 #include <sys/buf.h> 46 #include <sys/disklabel.h> 47 #include <sys/syslog.h> 48 49 /* 50 * Seek sort for disks. We depend on the driver which calls us using b_resid 51 * as the current cylinder number. 52 * 53 * The argument ap structure holds a b_actf activity chain pointer on which we 54 * keep two queues, sorted in ascending cylinder order. The first queue holds 55 * those requests which are positioned after the current cylinder (in the first 56 * request); the second holds requests which came in after their cylinder number 57 * was passed. Thus we implement a one way scan, retracting after reaching the 58 * end of the drive to the first request on the second queue, at which time it 59 * becomes the first queue. 60 * 61 * A one-way scan is natural because of the way UNIX read-ahead blocks are 62 * allocated. 63 */ 64 65 /* 66 * For portability with historic industry practice, the 67 * cylinder number has to be maintained in the `b_resid' 68 * field. 69 */ 70 #define b_cylinder b_resid 71 72 void 73 disksort(ap, bp) 74 register struct buf *ap, *bp; 75 { 76 register struct buf *bq; 77 78 /* If the queue is empty, then it's easy. */ 79 if (ap->b_actf == NULL) { 80 bp->b_actf = NULL; 81 ap->b_actf = bp; 82 return; 83 } 84 85 /* 86 * If we lie after the first (currently active) request, then we 87 * must locate the second request list and add ourselves to it. 88 */ 89 bq = ap->b_actf; 90 if (bp->b_cylinder < bq->b_cylinder) { 91 while (bq->b_actf) { 92 /* 93 * Check for an ``inversion'' in the normally ascending 94 * cylinder numbers, indicating the start of the second 95 * request list. 96 */ 97 if (bq->b_actf->b_cylinder < bq->b_cylinder) { 98 /* 99 * Search the second request list for the first 100 * request at a larger cylinder number. We go 101 * before that; if there is no such request, we 102 * go at end. 103 */ 104 do { 105 if (bp->b_cylinder < 106 bq->b_actf->b_cylinder) 107 goto insert; 108 if (bp->b_cylinder == 109 bq->b_actf->b_cylinder && 110 bp->b_blkno < bq->b_actf->b_blkno) 111 goto insert; 112 bq = bq->b_actf; 113 } while (bq->b_actf); 114 goto insert; /* after last */ 115 } 116 bq = bq->b_actf; 117 } 118 /* 119 * No inversions... we will go after the last, and 120 * be the first request in the second request list. 121 */ 122 goto insert; 123 } 124 /* 125 * Request is at/after the current request... 126 * sort in the first request list. 127 */ 128 while (bq->b_actf) { 129 /* 130 * We want to go after the current request if there is an 131 * inversion after it (i.e. it is the end of the first 132 * request list), or if the next request is a larger cylinder 133 * than our request. 134 */ 135 if (bq->b_actf->b_cylinder < bq->b_cylinder || 136 bp->b_cylinder < bq->b_actf->b_cylinder || 137 (bp->b_cylinder == bq->b_actf->b_cylinder && 138 bp->b_blkno < bq->b_actf->b_blkno)) 139 goto insert; 140 bq = bq->b_actf; 141 } 142 /* 143 * Neither a second list nor a larger request... we go at the end of 144 * the first list, which is the same as the end of the whole schebang. 145 */ 146 insert: bp->b_actf = bq->b_actf; 147 bq->b_actf = bp; 148 } 149 150 /* encoding of disk minor numbers, should be elsewhere... */ 151 #define dkunit(dev) (minor(dev) >> 3) 152 #define dkpart(dev) (minor(dev) & 07) 153 #define dkminor(unit, part) (((unit) << 3) | (part)) 154 155 /* 156 * Compute checksum for disk label. 157 */ 158 u_int 159 dkcksum(lp) 160 register struct disklabel *lp; 161 { 162 register u_short *start, *end; 163 register u_short sum = 0; 164 165 start = (u_short *)lp; 166 end = (u_short *)&lp->d_partitions[lp->d_npartitions]; 167 while (start < end) 168 sum ^= *start++; 169 return (sum); 170 } 171 172 /* 173 * Disk error is the preface to plaintive error messages 174 * about failing disk transfers. It prints messages of the form 175 176 hp0g: hard error reading fsbn 12345 of 12344-12347 (hp0 bn %d cn %d tn %d sn %d) 177 178 * if the offset of the error in the transfer and a disk label 179 * are both available. blkdone should be -1 if the position of the error 180 * is unknown; the disklabel pointer may be null from drivers that have not 181 * been converted to use them. The message is printed with printf 182 * if pri is LOG_PRINTF, otherwise it uses log at the specified priority. 183 * The message should be completed (with at least a newline) with printf 184 * or addlog, respectively. There is no trailing space. 185 */ 186 void 187 diskerr(bp, dname, what, pri, blkdone, lp) 188 register struct buf *bp; 189 char *dname, *what; 190 int pri, blkdone; 191 register struct disklabel *lp; 192 { 193 int unit = dkunit(bp->b_dev), part = dkpart(bp->b_dev); 194 register void (*pr) __P((const char *, ...)); 195 char partname = 'a' + part; 196 int sn; 197 198 if (pri != LOG_PRINTF) { 199 log(pri, ""); 200 pr = addlog; 201 } else 202 pr = printf; 203 (*pr)("%s%d%c: %s %sing fsbn ", dname, unit, partname, what, 204 bp->b_flags & B_READ ? "read" : "writ"); 205 sn = bp->b_blkno; 206 if (bp->b_bcount <= DEV_BSIZE) 207 (*pr)("%d", sn); 208 else { 209 if (blkdone >= 0) { 210 sn += blkdone; 211 (*pr)("%d of ", sn); 212 } 213 (*pr)("%d-%d", bp->b_blkno, 214 bp->b_blkno + (bp->b_bcount - 1) / DEV_BSIZE); 215 } 216 if (lp && (blkdone >= 0 || bp->b_bcount <= lp->d_secsize)) { 217 #ifdef tahoe 218 sn *= DEV_BSIZE / lp->d_secsize; /* XXX */ 219 #endif 220 sn += lp->d_partitions[part].p_offset; 221 (*pr)(" (%s%d bn %d; cn %d", dname, unit, sn, 222 sn / lp->d_secpercyl); 223 sn %= lp->d_secpercyl; 224 (*pr)(" tn %d sn %d)", sn / lp->d_nsectors, sn % lp->d_nsectors); 225 } 226 } 227