![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to ffs_tables.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Apple Darwin 0.x] / kernel / bsd / ufs / ffs|
Return to ffs_tables.c CVS log | Up to [Apple Darwin 0.x] / kernel / bsd / ufs / ffs |
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) 1982, 1986, 1993
28: * The Regents of the University of California. All rights reserved.
29: *
30: * Redistribution and use in source and binary forms, with or without
31: * modification, are permitted provided that the following conditions
32: * are met:
33: * 1. Redistributions of source code must retain the above copyright
34: * notice, this list of conditions and the following disclaimer.
35: * 2. Redistributions in binary form must reproduce the above copyright
36: * notice, this list of conditions and the following disclaimer in the
37: * documentation and/or other materials provided with the distribution.
38: * 3. All advertising materials mentioning features or use of this software
39: * must display the following acknowledgement:
40: * This product includes software developed by the University of
41: * California, Berkeley and its contributors.
42: * 4. Neither the name of the University nor the names of its contributors
43: * may be used to endorse or promote products derived from this software
44: * without specific prior written permission.
45: *
46: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
47: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
48: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
49: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
50: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
51: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
52: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
54: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
55: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
56: * SUCH DAMAGE.
57: *
58: * @(#)ffs_tables.c 8.1 (Berkeley) 6/11/93
59: */
60:
61: #include <sys/param.h>
62:
63: /*
64: * Bit patterns for identifying fragments in the block map
65: * used as ((map & around) == inside)
66: */
67: int around[9] = {
68: 0x3, 0x7, 0xf, 0x1f, 0x3f, 0x7f, 0xff, 0x1ff, 0x3ff
69: };
70: int inside[9] = {
71: 0x0, 0x2, 0x6, 0xe, 0x1e, 0x3e, 0x7e, 0xfe, 0x1fe
72: };
73:
74: /*
75: * Given a block map bit pattern, the frag tables tell whether a
76: * particular size fragment is available.
77: *
78: * used as:
79: * if ((1 << (size - 1)) & fragtbl[fs->fs_frag][map] {
80: * at least one fragment of the indicated size is available
81: * }
82: *
83: * These tables are used by the scanc instruction on the VAX to
84: * quickly find an appropriate fragment.
85: */
86: u_char fragtbl124[256] = {
87: 0x00, 0x16, 0x16, 0x2a, 0x16, 0x16, 0x26, 0x4e,
88: 0x16, 0x16, 0x16, 0x3e, 0x2a, 0x3e, 0x4e, 0x8a,
89: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
90: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
91: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
92: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
93: 0x2a, 0x3e, 0x3e, 0x2a, 0x3e, 0x3e, 0x2e, 0x6e,
94: 0x3e, 0x3e, 0x3e, 0x3e, 0x2a, 0x3e, 0x6e, 0xaa,
95: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
96: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
97: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
98: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
99: 0x26, 0x36, 0x36, 0x2e, 0x36, 0x36, 0x26, 0x6e,
100: 0x36, 0x36, 0x36, 0x3e, 0x2e, 0x3e, 0x6e, 0xae,
101: 0x4e, 0x5e, 0x5e, 0x6e, 0x5e, 0x5e, 0x6e, 0x4e,
102: 0x5e, 0x5e, 0x5e, 0x7e, 0x6e, 0x7e, 0x4e, 0xce,
103: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
104: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
105: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
106: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
107: 0x16, 0x16, 0x16, 0x3e, 0x16, 0x16, 0x36, 0x5e,
108: 0x16, 0x16, 0x16, 0x3e, 0x3e, 0x3e, 0x5e, 0x9e,
109: 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x7e,
110: 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x7e, 0xbe,
111: 0x2a, 0x3e, 0x3e, 0x2a, 0x3e, 0x3e, 0x2e, 0x6e,
112: 0x3e, 0x3e, 0x3e, 0x3e, 0x2a, 0x3e, 0x6e, 0xaa,
113: 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x7e,
114: 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x3e, 0x7e, 0xbe,
115: 0x4e, 0x5e, 0x5e, 0x6e, 0x5e, 0x5e, 0x6e, 0x4e,
116: 0x5e, 0x5e, 0x5e, 0x7e, 0x6e, 0x7e, 0x4e, 0xce,
117: 0x8a, 0x9e, 0x9e, 0xaa, 0x9e, 0x9e, 0xae, 0xce,
118: 0x9e, 0x9e, 0x9e, 0xbe, 0xaa, 0xbe, 0xce, 0x8a,
119: };
120:
121: u_char fragtbl8[256] = {
122: 0x00, 0x01, 0x01, 0x02, 0x01, 0x01, 0x02, 0x04,
123: 0x01, 0x01, 0x01, 0x03, 0x02, 0x03, 0x04, 0x08,
124: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
125: 0x02, 0x03, 0x03, 0x02, 0x04, 0x05, 0x08, 0x10,
126: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
127: 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
128: 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06,
129: 0x04, 0x05, 0x05, 0x06, 0x08, 0x09, 0x10, 0x20,
130: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
131: 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
132: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
133: 0x03, 0x03, 0x03, 0x03, 0x05, 0x05, 0x09, 0x11,
134: 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06,
135: 0x03, 0x03, 0x03, 0x03, 0x02, 0x03, 0x06, 0x0a,
136: 0x04, 0x05, 0x05, 0x06, 0x05, 0x05, 0x06, 0x04,
137: 0x08, 0x09, 0x09, 0x0a, 0x10, 0x11, 0x20, 0x40,
138: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
139: 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
140: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
141: 0x03, 0x03, 0x03, 0x03, 0x05, 0x05, 0x09, 0x11,
142: 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05,
143: 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
144: 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x07,
145: 0x05, 0x05, 0x05, 0x07, 0x09, 0x09, 0x11, 0x21,
146: 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06,
147: 0x03, 0x03, 0x03, 0x03, 0x02, 0x03, 0x06, 0x0a,
148: 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x07,
149: 0x02, 0x03, 0x03, 0x02, 0x06, 0x07, 0x0a, 0x12,
150: 0x04, 0x05, 0x05, 0x06, 0x05, 0x05, 0x06, 0x04,
151: 0x05, 0x05, 0x05, 0x07, 0x06, 0x07, 0x04, 0x0c,
152: 0x08, 0x09, 0x09, 0x0a, 0x09, 0x09, 0x0a, 0x0c,
153: 0x10, 0x11, 0x11, 0x12, 0x20, 0x21, 0x40, 0x80,
154: };
155:
156: /*
157: * The actual fragtbl array.
158: */
159: u_char *fragtbl[MAXFRAG + 1] = {
160: 0, fragtbl124, fragtbl124, 0, fragtbl124, 0, 0, 0, fragtbl8,
161: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.