[unix-history] / usr / src / sys / ufs / ffs / ufs_disksubr.c

/*
 * Copyright (c) 1982, 1986, 1988 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms are permitted
 * provided that the above copyright notice and this paragraph are
 * duplicated in all such forms and that any documentation,
 * advertising materials, and other materials related to such
 * distribution and use acknowledge that the software was developed
 * by the University of California, Berkeley.  The name of the
 * University may not be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *	@(#)ufs_disksubr.c	7.12 (Berkeley) %G%
 */

#include "param.h"
#include "systm.h"
#include "buf.h"
#include "disklabel.h"
#include "syslog.h"
#include "user.h"

/*
 * Seek sort for disks.  We depend on the driver
 * which calls us using b_resid as the current cylinder number.
 *
 * The argument dp structure holds a b_actf activity chain pointer
 * on which we keep two queues, sorted in ascending cylinder order.
 * The first queue holds those requests which are positioned after
 * the current cylinder (in the first request); the second holds
 * requests which came in after their cylinder number was passed.
 * Thus we implement a one way scan, retracting after reaching the
 * end of the drive to the first request on the second queue,
 * at which time it becomes the first queue.
 *
 * A one-way scan is natural because of the way UNIX read-ahead
 * blocks are allocated.
 */

#define	b_cylin	b_resid

disksort(dp, bp)
	register struct buf *dp, *bp;
{
	register struct buf *ap;

	/*
	 * If nothing on the activity queue, then
	 * we become the only thing.
	 */
	ap = dp->b_actf;
	if(ap == NULL) {
		dp->b_actf = bp;
		dp->b_actl = bp;
		bp->av_forw = NULL;
		return;
	}
	/*
	 * If we lie after the first (currently active)
	 * request, then we must locate the second request list
	 * and add ourselves to it.
	 */
	if (bp->b_cylin < ap->b_cylin) {
		while (ap->av_forw) {
			/*
			 * Check for an ``inversion'' in the
			 * normally ascending cylinder numbers,
			 * indicating the start of the second request list.
			 */
			if (ap->av_forw->b_cylin < ap->b_cylin) {
				/*
				 * Search the second request list
				 * for the first request at a larger
				 * cylinder number.  We go before that;
				 * if there is no such request, we go at end.
				 */
				do {
					if (bp->b_cylin < ap->av_forw->b_cylin)
						goto insert;
					if (bp->b_cylin == ap->av_forw->b_cylin &&
					    bp->b_blkno < ap->av_forw->b_blkno)
						goto insert;
					ap = ap->av_forw;
				} while (ap->av_forw);
				goto insert;		/* after last */
			}
			ap = ap->av_forw;
		}
		/*
		 * No inversions... we will go after the last, and
		 * be the first request in the second request list.
		 */
		goto insert;
	}
	/*
	 * Request is at/after the current request...
	 * sort in the first request list.
	 */
	while (ap->av_forw) {
		/*
		 * We want to go after the current request
		 * if there is an inversion after it (i.e. it is
		 * the end of the first request list), or if
		 * the next request is a larger cylinder than our request.
		 */
		if (ap->av_forw->b_cylin < ap->b_cylin ||
		    bp->b_cylin < ap->av_forw->b_cylin ||
		    (bp->b_cylin == ap->av_forw->b_cylin &&
		    bp->b_blkno < ap->av_forw->b_blkno))
			goto insert;
		ap = ap->av_forw;
	}
	/*
	 * Neither a second list nor a larger
	 * request... we go at the end of the first list,
	 * which is the same as the end of the whole schebang.
	 */
insert:
	bp->av_forw = ap->av_forw;
	ap->av_forw = bp;
	if (ap == dp->b_actl)
		dp->b_actl = bp;
}

/*
 * Attempt to read a disk label from a device
 * using the indicated stategy routine.
 * The label must be partly set up before this:
 * secpercyl and anything required in the strategy routine
 * (e.g., sector size) must be filled in before calling us.
 * Returns null on success and an error string on failure.
 */
char *
readdisklabel(dev, strat, lp)
	dev_t dev;
	int (*strat)();
	register struct disklabel *lp;
{
	register struct buf *bp;
	struct disklabel *dlp;
	char *msg = NULL;

	if (lp->d_secperunit == 0)
		lp->d_secperunit = 0x1fffffff;
	lp->d_npartitions = 1;
	if (lp->d_partitions[0].p_size == 0)
		lp->d_partitions[0].p_size = 0x1fffffff;
	lp->d_partitions[0].p_offset = 0;

	bp = geteblk((int)lp->d_secsize);
	bp->b_dev = dev;
	bp->b_blkno = LABELSECTOR;
	bp->b_bcount = lp->d_secsize;
	bp->b_flags = B_BUSY | B_READ;
	bp->b_cylin = LABELSECTOR / lp->d_secpercyl;
	(*strat)(bp);
	if (biowait(bp)) {
		msg = "I/O error";
	} else for (dlp = (struct disklabel *)bp->b_un.b_addr;
	    dlp <= (struct disklabel *)(bp->b_un.b_addr+DEV_BSIZE-sizeof(*dlp));
	    dlp = (struct disklabel *)((char *)dlp + sizeof(long))) {
		if (dlp->d_magic != DISKMAGIC || dlp->d_magic2 != DISKMAGIC) {
			if (msg == NULL)
				msg = "no disk label";
		} else if (dkcksum(dlp) != 0)
			msg = "disk label corrupted";
		else {
			*lp = *dlp;
			msg = NULL;
			break;
		}
	}
	if (lp->d_npartitions > MAXPARTITIONS)
		lp->d_npartitions = MAXPARTITIONS;
	bp->b_flags = B_INVAL | B_AGE;
	brelse(bp);
	return (msg);
}

/*
 * Check new disk label for sensibility
 * before setting it.
 */
setdisklabel(olp, nlp, openmask)
	register struct disklabel *olp, *nlp;
	u_long openmask;
{
	register i;
	register struct partition *opp, *npp;

	if (nlp->d_magic != DISKMAGIC || nlp->d_magic2 != DISKMAGIC ||
	    dkcksum(nlp) != 0)
		return (EINVAL);
	while ((i = ffs((long)openmask)) != 0) {
		i--;
		openmask &= ~(1 << i);
		if (nlp->d_npartitions <= i)
			return (EBUSY);
		opp = &olp->d_partitions[i];
		npp = &nlp->d_partitions[i];
		if (npp->p_offset != opp->p_offset || npp->p_size < opp->p_size)
			return (EBUSY);
		/*
		 * Copy internally-set partition information
		 * if new label doesn't include it.		XXX
		 */
		if (npp->p_fstype == FS_UNUSED && opp->p_fstype != FS_UNUSED) {
			npp->p_fstype = opp->p_fstype;
			npp->p_fsize = opp->p_fsize;
			npp->p_frag = opp->p_frag;
			npp->p_cpg = opp->p_cpg;
		}
	}
 	nlp->d_checksum = 0;
 	nlp->d_checksum = dkcksum(nlp);
	*olp = *nlp;
	return (0);
}

/* encoding of disk minor numbers, should be elsewhere... */
#define dkunit(dev)		(minor(dev) >> 3)
#define dkpart(dev)		(minor(dev) & 07)
#define dkminor(unit, part)	(((unit) << 3) | (part))

/*
 * Write disk label back to device after modification.
 */
writedisklabel(dev, strat, lp)
	dev_t dev;
	int (*strat)();
	register struct disklabel *lp;
{
	struct buf *bp;
	struct disklabel *dlp;
	int labelpart;
	int error = 0;

	labelpart = dkpart(dev);
	if (lp->d_partitions[labelpart].p_offset != 0) {
		if (lp->d_partitions[0].p_offset != 0)
			return (EXDEV);			/* not quite right */
		labelpart = 0;
	}
	bp = geteblk((int)lp->d_secsize);
	bp->b_dev = makedev(major(dev), dkminor(dkunit(dev), labelpart));
	bp->b_blkno = LABELSECTOR;
	bp->b_bcount = lp->d_secsize;
	bp->b_flags = B_READ;
	(*strat)(bp);
	if (error = biowait(bp))
		goto done;
	for (dlp = (struct disklabel *)bp->b_un.b_addr;
	    dlp <= (struct disklabel *)
	      (bp->b_un.b_addr + lp->d_secsize - sizeof(*dlp));
	    dlp = (struct disklabel *)((char *)dlp + sizeof(long))) {
		if (dlp->d_magic == DISKMAGIC && dlp->d_magic2 == DISKMAGIC &&
		    dkcksum(dlp) == 0) {
			*dlp = *lp;
			bp->b_flags = B_WRITE;
			(*strat)(bp);
			error = biowait(bp);
			goto done;
		}
	}
	error = ESRCH;
done:
	brelse(bp);
	return (error);
}

/*
 * Compute checksum for disk label.
 */
dkcksum(lp)
	register struct disklabel *lp;
{
	register u_short *start, *end;
	register u_short sum = 0;

	start = (u_short *)lp;
	end = (u_short *)&lp->d_partitions[lp->d_npartitions];
	while (start < end)
		sum ^= *start++;
	return (sum);
}

/*
 * Disk error is the preface to plaintive error messages
 * about failing disk transfers.  It prints messages of the form

hp0g: hard error reading fsbn 12345 of 12344-12347 (hp0 bn %d cn %d tn %d sn %d)

 * if the offset of the error in the transfer and a disk label
 * are both available.  blkdone should be -1 if the position of the error
 * is unknown; the disklabel pointer may be null from drivers that have not
 * been converted to use them.  The message is printed with printf
 * if pri is LOG_PRINTF, otherwise it uses log at the specified priority.
 * The message should be completed (with at least a newline) with printf
 * or addlog, respectively.  There is no trailing space.
 */
diskerr(bp, dname, what, pri, blkdone, lp)
	register struct buf *bp;
	char *dname, *what;
	int pri, blkdone;
	register struct disklabel *lp;
{
	int unit = dkunit(bp->b_dev), part = dkpart(bp->b_dev);
	register int (*pr)(), sn;
	char partname = 'a' + part;
	extern printf(), addlog();

	if (pri != LOG_PRINTF) {
		log(pri, "");
		pr = addlog;
	} else
		pr = printf;
	(*pr)("%s%d%c: %s %sing fsbn ", dname, unit, partname, what,
	    bp->b_flags & B_READ ? "read" : "writ");
	sn = bp->b_blkno;
	if (bp->b_bcount <= DEV_BSIZE)
		(*pr)("%d", sn);
	else {
		if (blkdone >= 0) {
			sn += blkdone;
			(*pr)("%d of ", sn);
		}
		(*pr)("%d-%d", bp->b_blkno,
		    bp->b_blkno + (bp->b_bcount - 1) / DEV_BSIZE);
	}
	if (lp && (blkdone >= 0 || bp->b_bcount <= lp->d_secsize)) {
#ifdef tahoe
		sn *= DEV_BSIZE / lp->d_secsize;		/* XXX */
#endif
		sn += lp->d_partitions[part].p_offset;
		(*pr)(" (%s%d bn %d; cn %d", dname, unit, sn,
		    sn / lp->d_secpercyl);
		sn %= lp->d_secpercyl;
		(*pr)(" tn %d sn %d)", sn / lp->d_nsectors, sn % lp->d_nsectors);
	}
}
Commit	Line	Data
da7c5cc6	1	/*
1ad7f5c8	2	* Copyright (c) 1982, 1986, 1988 Regents of the University of California.
7188ac27	3	* All rights reserved.
da7c5cc6	4	*
7188ac27 KM	5	* Redistribution and use in source and binary forms are permitted
	6	* provided that the above copyright notice and this paragraph are
	7	* duplicated in all such forms and that any documentation,
	8	* advertising materials, and other materials related to such
	9	* distribution and use acknowledge that the software was developed
	10	* by the University of California, Berkeley. The name of the
	11	* University may not be used to endorse or promote products derived
	12	* from this software without specific prior written permission.
	13	* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
	14	* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
	15	* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
	16	*
	17	* @(#)ufs_disksubr.c 7.12 (Berkeley) %G%
da7c5cc6	18	*/
200a8f27	19
97934dfa MK	20	#include "param.h"
	21	#include "systm.h"
	22	#include "buf.h"
	23	#include "disklabel.h"
1ad7f5c8	24	#include "syslog.h"
9573c71c MK	25	#include "user.h"
9573c71c MK	26
200a8f27	27	/*
0d67fde4 BJ	28	* Seek sort for disks. We depend on the driver
	29	* which calls us using b_resid as the current cylinder number.
	30	*
	31	* The argument dp structure holds a b_actf activity chain pointer
	32	* on which we keep two queues, sorted in ascending cylinder order.
	33	* The first queue holds those requests which are positioned after
	34	* the current cylinder (in the first request); the second holds
	35	* requests which came in after their cylinder number was passed.
	36	* Thus we implement a one way scan, retracting after reaching the
	37	* end of the drive to the first request on the second queue,
	38	* at which time it becomes the first queue.
	39	*
	40	* A one-way scan is natural because of the way UNIX read-ahead
	41	* blocks are allocated.
200a8f27 BJ	42	*/
200a8f27 BJ	43
200a8f27 BJ	44	#define b_cylin b_resid
	45
	46	disksort(dp, bp)
0d67fde4	47	register struct buf dp, bp;
200a8f27 BJ	48	{
200a8f27 BJ	49	register struct buf *ap;
200a8f27	50
0d67fde4 BJ	51	/*
	52	* If nothing on the activity queue, then
	53	* we become the only thing.
	54	*/
200a8f27 BJ	55	ap = dp->b_actf;
	56	if(ap == NULL) {
	57	dp->b_actf = bp;
	58	dp->b_actl = bp;
	59	bp->av_forw = NULL;
	60	return;
	61	}
0d67fde4 BJ	62	/*
	63	* If we lie after the first (currently active)
	64	* request, then we must locate the second request list
	65	* and add ourselves to it.
	66	*/
	67	if (bp->b_cylin < ap->b_cylin) {
	68	while (ap->av_forw) {
	69	/*
	70	* Check for an ``inversion'' in the
	71	* normally ascending cylinder numbers,
	72	* indicating the start of the second request list.
	73	*/
	74	if (ap->av_forw->b_cylin < ap->b_cylin) {
	75	/*
	76	* Search the second request list
	77	* for the first request at a larger
	78	* cylinder number. We go before that;
	79	* if there is no such request, we go at end.
	80	*/
	81	do {
	82	if (bp->b_cylin < ap->av_forw->b_cylin)
	83	goto insert;
667e5665 MK	84	if (bp->b_cylin == ap->av_forw->b_cylin &&
	85	bp->b_blkno < ap->av_forw->b_blkno)
	86	goto insert;
0d67fde4 BJ	87	ap = ap->av_forw;
	88	} while (ap->av_forw);
	89	goto insert; /* after last */
	90	}
	91	ap = ap->av_forw;
200a8f27	92	}
0d67fde4 BJ	93	/*
	94	* No inversions... we will go after the last, and
	95	* be the first request in the second request list.
	96	*/
	97	goto insert;
200a8f27	98	}
0d67fde4 BJ	99	/*
	100	* Request is at/after the current request...
	101	* sort in the first request list.
	102	*/
	103	while (ap->av_forw) {
	104	/*
	105	* We want to go after the current request
	106	* if there is an inversion after it (i.e. it is
	107	* the end of the first request list), or if
	108	* the next request is a larger cylinder than our request.
	109	*/
	110	if (ap->av_forw->b_cylin < ap->b_cylin \|\|
667e5665 MK	111	bp->b_cylin < ap->av_forw->b_cylin \|\|
	112	(bp->b_cylin == ap->av_forw->b_cylin &&
	113	bp->b_blkno < ap->av_forw->b_blkno))
0d67fde4 BJ	114	goto insert;
	115	ap = ap->av_forw;
	116	}
	117	/*
	118	* Neither a second list nor a larger
	119	* request... we go at the end of the first list,
	120	* which is the same as the end of the whole schebang.
	121	*/
	122	insert:
	123	bp->av_forw = ap->av_forw;
	124	ap->av_forw = bp;
	125	if (ap == dp->b_actl)
200a8f27 BJ	126	dp->b_actl = bp;
200a8f27 BJ	127	}
97934dfa	128
9573c71c MK	129	/*
	130	* Attempt to read a disk label from a device
	131	* using the indicated stategy routine.
	132	* The label must be partly set up before this:
	133	* secpercyl and anything required in the strategy routine
	134	* (e.g., sector size) must be filled in before calling us.
	135	* Returns null on success and an error string on failure.
	136	*/
	137	char *
	138	readdisklabel(dev, strat, lp)
	139	dev_t dev;
	140	int (*strat)();
	141	register struct disklabel *lp;
	142	{
	143	register struct buf *bp;
	144	struct disklabel *dlp;
	145	char *msg = NULL;
	146
	147	if (lp->d_secperunit == 0)
	148	lp->d_secperunit = 0x1fffffff;
	149	lp->d_npartitions = 1;
	150	if (lp->d_partitions[0].p_size == 0)
	151	lp->d_partitions[0].p_size = 0x1fffffff;
	152	lp->d_partitions[0].p_offset = 0;
	153
d3633d66	154	bp = geteblk((int)lp->d_secsize);
9573c71c MK	155	bp->b_dev = dev;
9573c71c MK	156	bp->b_blkno = LABELSECTOR;
cd6cd535	157	bp->b_bcount = lp->d_secsize;
9573c71c MK	158	bp->b_flags = B_BUSY \| B_READ;
	159	bp->b_cylin = LABELSECTOR / lp->d_secpercyl;
	160	(*strat)(bp);
7188ac27	161	if (biowait(bp)) {
9573c71c	162	msg = "I/O error";
cd6cd535 MK	163	} else for (dlp = (struct disklabel *)bp->b_un.b_addr;
	164	dlp <= (struct disklabel )(bp->b_un.b_addr+DEV_BSIZE-sizeof(dlp));
	165	dlp = (struct disklabel )((char )dlp + sizeof(long))) {
	166	if (dlp->d_magic != DISKMAGIC \|\| dlp->d_magic2 != DISKMAGIC) {
	167	if (msg == NULL)
	168	msg = "no disk label";
	169	} else if (dkcksum(dlp) != 0)
9573c71c	170	msg = "disk label corrupted";
cd6cd535	171	else {
9573c71c	172	lp = dlp;
cd6cd535 MK	173	msg = NULL;
	174	break;
	175	}
9573c71c	176	}
cd6cd535 MK	177	if (lp->d_npartitions > MAXPARTITIONS)
cd6cd535 MK	178	lp->d_npartitions = MAXPARTITIONS;
9573c71c MK	179	bp->b_flags = B_INVAL \| B_AGE;
	180	brelse(bp);
	181	return (msg);
	182	}
	183
667e5665 MK	184	/*
	185	* Check new disk label for sensibility
	186	* before setting it.
	187	*/
	188	setdisklabel(olp, nlp, openmask)
	189	register struct disklabel olp, nlp;
	190	u_long openmask;
	191	{
	192	register i;
	193	register struct partition opp, npp;
	194
	195	if (nlp->d_magic != DISKMAGIC \|\| nlp->d_magic2 != DISKMAGIC \|\|
	196	dkcksum(nlp) != 0)
	197	return (EINVAL);
5adcb337	198	while ((i = ffs((long)openmask)) != 0) {
667e5665 MK	199	i--;
	200	openmask &= ~(1 << i);
	201	if (nlp->d_npartitions <= i)
	202	return (EBUSY);
	203	opp = &olp->d_partitions[i];
	204	npp = &nlp->d_partitions[i];
	205	if (npp->p_offset != opp->p_offset \|\| npp->p_size < opp->p_size)
	206	return (EBUSY);
	207	/*
	208	* Copy internally-set partition information
	209	* if new label doesn't include it. XXX
	210	*/
	211	if (npp->p_fstype == FS_UNUSED && opp->p_fstype != FS_UNUSED) {
	212	npp->p_fstype = opp->p_fstype;
	213	npp->p_fsize = opp->p_fsize;
	214	npp->p_frag = opp->p_frag;
	215	npp->p_cpg = opp->p_cpg;
	216	}
	217	}
d3633d66 MK	218	nlp->d_checksum = 0;
d3633d66 MK	219	nlp->d_checksum = dkcksum(nlp);
667e5665 MK	220	olp = nlp;
	221	return (0);
	222	}
	223
	224	/* encoding of disk minor numbers, should be elsewhere... */
	225	#define dkunit(dev) (minor(dev) >> 3)
	226	#define dkpart(dev) (minor(dev) & 07)
	227	#define dkminor(unit, part) (((unit) << 3) \| (part))
	228
	229	/*
	230	* Write disk label back to device after modification.
	231	*/
	232	writedisklabel(dev, strat, lp)
	233	dev_t dev;
	234	int (*strat)();
	235	register struct disklabel *lp;
	236	{
	237	struct buf *bp;
	238	struct disklabel *dlp;
	239	int labelpart;
	240	int error = 0;
	241
	242	labelpart = dkpart(dev);
	243	if (lp->d_partitions[labelpart].p_offset != 0) {
	244	if (lp->d_partitions[0].p_offset != 0)
	245	return (EXDEV); /* not quite right */
	246	labelpart = 0;
	247	}
d3633d66	248	bp = geteblk((int)lp->d_secsize);
667e5665 MK	249	bp->b_dev = makedev(major(dev), dkminor(dkunit(dev), labelpart));
	250	bp->b_blkno = LABELSECTOR;
	251	bp->b_bcount = lp->d_secsize;
	252	bp->b_flags = B_READ;
	253	(*strat)(bp);
7188ac27	254	if (error = biowait(bp))
d3633d66	255	goto done;
d3633d66 MK	256	for (dlp = (struct disklabel *)bp->b_un.b_addr;
	257	dlp <= (struct disklabel *)
	258	(bp->b_un.b_addr + lp->d_secsize - sizeof(*dlp));
	259	dlp = (struct disklabel )((char )dlp + sizeof(long))) {
	260	if (dlp->d_magic == DISKMAGIC && dlp->d_magic2 == DISKMAGIC &&
	261	dkcksum(dlp) == 0) {
	262	dlp = lp;
	263	bp->b_flags = B_WRITE;
	264	(*strat)(bp);
7188ac27	265	error = biowait(bp);
d3633d66 MK	266	goto done;
d3633d66 MK	267	}
667e5665	268	}
d3633d66 MK	269	error = ESRCH;
d3633d66 MK	270	done:
667e5665 MK	271	brelse(bp);
	272	return (error);
	273	}
	274
97934dfa MK	275	/*
	276	* Compute checksum for disk label.
	277	*/
	278	dkcksum(lp)
	279	register struct disklabel *lp;
	280	{
	281	register u_short start, end;
	282	register u_short sum = 0;
	283
	284	start = (u_short *)lp;
	285	end = (u_short *)&lp->d_partitions[lp->d_npartitions];
	286	while (start < end)
	287	sum ^= *start++;
	288	return (sum);
	289	}
1ad7f5c8 MK	290
	291	/*
	292	* Disk error is the preface to plaintive error messages
	293	* about failing disk transfers. It prints messages of the form
05de9101 MK	294
	295	hp0g: hard error reading fsbn 12345 of 12344-12347 (hp0 bn %d cn %d tn %d sn %d)
	296
1ad7f5c8 MK	297	* if the offset of the error in the transfer and a disk label
	298	* are both available. blkdone should be -1 if the position of the error
	299	* is unknown; the disklabel pointer may be null from drivers that have not
	300	* been converted to use them. The message is printed with printf
	301	* if pri is LOG_PRINTF, otherwise it uses log at the specified priority.
	302	* The message should be completed (with at least a newline) with printf
	303	* or addlog, respectively. There is no trailing space.
	304	*/
	305	diskerr(bp, dname, what, pri, blkdone, lp)
	306	register struct buf *bp;
	307	char dname, what;
	308	int pri, blkdone;
	309	register struct disklabel *lp;
	310	{
	311	int unit = dkunit(bp->b_dev), part = dkpart(bp->b_dev);
	312	register int (*pr)(), sn;
	313	char partname = 'a' + part;
	314	extern printf(), addlog();
	315
	316	if (pri != LOG_PRINTF) {
	317	log(pri, "");
	318	pr = addlog;
	319	} else
	320	pr = printf;
	321	(*pr)("%s%d%c: %s %sing fsbn ", dname, unit, partname, what,
	322	bp->b_flags & B_READ ? "read" : "writ");
	323	sn = bp->b_blkno;
	324	if (bp->b_bcount <= DEV_BSIZE)
	325	(*pr)("%d", sn);
	326	else {
	327	if (blkdone >= 0) {
	328	sn += blkdone;
	329	(*pr)("%d of ", sn);
	330	}
	331	(*pr)("%d-%d", bp->b_blkno,
	332	bp->b_blkno + (bp->b_bcount - 1) / DEV_BSIZE);
	333	}
f2a9617b MK	334	if (lp && (blkdone >= 0 \|\| bp->b_bcount <= lp->d_secsize)) {
	335	#ifdef tahoe
	336	sn = DEV_BSIZE / lp->d_secsize; / XXX */
	337	#endif
1ad7f5c8	338	sn += lp->d_partitions[part].p_offset;
05de9101 MK	339	(*pr)(" (%s%d bn %d; cn %d", dname, unit, sn,
	340	sn / lp->d_secpercyl);
	341	sn %= lp->d_secpercyl;
9f79ca31	342	(*pr)(" tn %d sn %d)", sn / lp->d_nsectors, sn % lp->d_nsectors);
1ad7f5c8 MK	343	}
1ad7f5c8 MK	344	}