105 lines
4.1 KiB
C
105 lines
4.1 KiB
C
/*
|
|
* Copyright (c) 1988 University of Utah.
|
|
* Copyright (c) 1990 The Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to Berkeley by
|
|
* the Systems Programming Group of the University of Utah Computer
|
|
* Science Department.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* from: Utah Hdr: cdvar.h 1.1 90/07/09
|
|
* from: @(#)cdvar.h 7.2 (Berkeley) 11/4/90
|
|
* $Id: cdvar.h,v 1.2 1993/08/01 19:23:53 mycroft Exp $
|
|
*/
|
|
|
|
#define NCDISKS 8 /* max # of component disks */
|
|
|
|
/*
|
|
* A concatenated disk is described at config time by this structure.
|
|
*/
|
|
struct cddevice {
|
|
int cd_unit; /* logical unit of this cd */
|
|
int cd_interleave; /* interleave (DEV_BSIZE blocks) */
|
|
int cd_flags; /* misc. information */
|
|
int cd_dk; /* disk number */
|
|
dev_t cd_dev[NCDISKS]; /* component devices */
|
|
};
|
|
|
|
/* cd_flags */
|
|
#define CDF_SWAP 0x01 /* interleave should be dmmax */
|
|
#define CDF_UNIFORM 0x02 /* use LCD of sizes for uniform interleave */
|
|
|
|
/*
|
|
* Component info table.
|
|
* Describes a single component of a concatenated disk.
|
|
*/
|
|
struct cdcinfo {
|
|
dev_t ci_dev; /* devno */
|
|
size_t ci_size; /* size */
|
|
};
|
|
|
|
/*
|
|
* Interleave description table.
|
|
* Computed at boot time to speed irregular-interleave lookups.
|
|
* The idea is that we interleave in "groups". First we interleave
|
|
* evenly over all component disks up to the size of the smallest
|
|
* component (the first group), then we interleave evenly over all
|
|
* remaining disks up to the size of the next-smallest (second group),
|
|
* and so on.
|
|
*
|
|
* Each table entry describes the interleave characteristics of one
|
|
* of these groups. For example if a concatenated disk consisted of
|
|
* three components of 5, 3, and 7 DEV_BSIZE blocks interleaved at
|
|
* DEV_BSIZE (1), the table would have three entries:
|
|
*
|
|
* ndisk startblk startoff dev
|
|
* 3 0 0 0, 1, 2
|
|
* 2 9 3 0, 2
|
|
* 1 13 5 2
|
|
* 0 - - -
|
|
*
|
|
* which says that the first nine blocks (0-8) are interleaved over
|
|
* 3 disks (0, 1, 2) starting at block offset 0 on any component disk,
|
|
* the next 4 blocks (9-12) are interleaved over 2 disks (0, 2) starting
|
|
* at component block 3, and the remaining blocks (13-14) are on disk
|
|
* 2 starting at offset 5.
|
|
*/
|
|
struct cdiinfo {
|
|
int ii_ndisk; /* # of disks range is interleaved over */
|
|
daddr_t ii_startblk; /* starting scaled block # for range */
|
|
daddr_t ii_startoff; /* starting component offset (block #) */
|
|
char ii_index[NCDISKS];/* ordered list of components in range */
|
|
};
|
|
|
|
#ifdef KERNEL
|
|
extern struct cddevice cddevice[];
|
|
#endif
|