|
|
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
26: /*
27: * Copyright (c) 1988 University of Utah.
28: * Copyright (c) 1990, 1993
29: * The Regents of the University of California. All rights reserved.
30: *
31: * This code is derived from software contributed to Berkeley by
32: * the Systems Programming Group of the University of Utah Computer
33: * Science Department.
34: *
35: * Redistribution and use in source and binary forms, with or without
36: * modification, are permitted provided that the following conditions
37: * are met:
38: * 1. Redistributions of source code must retain the above copyright
39: * notice, this list of conditions and the following disclaimer.
40: * 2. Redistributions in binary form must reproduce the above copyright
41: * notice, this list of conditions and the following disclaimer in the
42: * documentation and/or other materials provided with the distribution.
43: * 3. All advertising materials mentioning features or use of this software
44: * must display the following acknowledgement:
45: * This product includes software developed by the University of
46: * California, Berkeley and its contributors.
47: * 4. Neither the name of the University nor the names of its contributors
48: * may be used to endorse or promote products derived from this software
49: * without specific prior written permission.
50: *
51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61: * SUCH DAMAGE.
62: *
63: * from: Utah $Hdr: cdvar.h 1.1 90/07/09$
64: *
65: * @(#)cdvar.h 8.1 (Berkeley) 6/10/93
66: */
67:
68: #define NCCDISKS 8 /* max # of component disks */
69:
70: /*
71: * A concatenated disk is described at config time by this structure.
72: */
73: struct ccddevice {
74: int ccd_unit; /* logical unit of this ccd */
75: int ccd_interleave; /* interleave (DEV_BSIZE blocks) */
76: int ccd_flags; /* misc. information */
77: int ccd_dk; /* disk number */
78: dev_t ccd_dev[NCCDISKS]; /* component devices */
79: };
80:
81: /* ccd_flags */
82: #define CCDF_SWAP 0x01 /* interleave should be dmmax */
83: #define CCDF_UNIFORM 0x02 /* use LCCD of sizes for uniform interleave */
84:
85: /*
86: * Component info table.
87: * Describes a single component of a concatenated disk.
88: */
89: struct ccdcinfo {
90: dev_t ci_dev; /* devno */
91: size_t ci_size; /* size */
92: };
93:
94: /*
95: * Interleave description table.
96: * Computed at boot time to speed irregular-interleave lookups.
97: * The idea is that we interleave in "groups". First we interleave
98: * evenly over all component disks up to the size of the smallest
99: * component (the first group), then we interleave evenly over all
100: * remaining disks up to the size of the next-smallest (second group),
101: * and so on.
102: *
103: * Each table entry describes the interleave characteristics of one
104: * of these groups. For example if a concatenated disk consisted of
105: * three components of 5, 3, and 7 DEV_BSIZE blocks interleaved at
106: * DEV_BSIZE (1), the table would have three entries:
107: *
108: * ndisk startblk startoff dev
109: * 3 0 0 0, 1, 2
110: * 2 9 3 0, 2
111: * 1 13 5 2
112: * 0 - - -
113: *
114: * which says that the first nine blocks (0-8) are interleaved over
115: * 3 disks (0, 1, 2) starting at block offset 0 on any component disk,
116: * the next 4 blocks (9-12) are interleaved over 2 disks (0, 2) starting
117: * at component block 3, and the remaining blocks (13-14) are on disk
118: * 2 starting at offset 5.
119: */
120: struct ccdiinfo {
121: int ii_ndisk; /* # of disks range is interleaved over */
122: daddr_t ii_startblk; /* starting scaled block # for range */
123: daddr_t ii_startoff; /* starting component offset (block #) */
124: char ii_index[NCCDISKS];/* ordered list of components in range */
125: };
126:
127: #ifdef _KERNEL
128: extern struct ccddevice ccddevice[];
129: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.