]> git.saurik.com Git - apple/xnu.git/blame_incremental - bsd/ufs/ffs/ffs_subr.c
xnu-792.18.15.tar.gz
[apple/xnu.git] / bsd / ufs / ffs / ffs_subr.c
... / ...
CommitLineData
1/*
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
5 *
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
14 *
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
25 *
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
27 */
28/* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
29/*
30 * Copyright (c) 1982, 1986, 1989, 1993
31 * The Regents of the University of California. All rights reserved.
32 *
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted provided that the following conditions
35 * are met:
36 * 1. Redistributions of source code must retain the above copyright
37 * notice, this list of conditions and the following disclaimer.
38 * 2. Redistributions in binary form must reproduce the above copyright
39 * notice, this list of conditions and the following disclaimer in the
40 * documentation and/or other materials provided with the distribution.
41 * 3. All advertising materials mentioning features or use of this software
42 * must display the following acknowledgement:
43 * This product includes software developed by the University of
44 * California, Berkeley and its contributors.
45 * 4. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
48 *
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 * SUCH DAMAGE.
60 *
61 * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95
62 */
63
64#include <rev_endian_fs.h>
65#include <sys/param.h>
66#if REV_ENDIAN_FS
67#include <sys/mount_internal.h>
68#endif /* REV_ENDIAN_FS */
69
70#ifndef KERNEL
71#include <ufs/ufs/dinode.h>
72#include <ufs/ffs/fs.h>
73#else
74
75#include <sys/systm.h>
76#include <sys/vnode_internal.h>
77#include <sys/buf.h>
78#include <sys/quota.h>
79#include <ufs/ufs/quota.h>
80#include <ufs/ufs/inode.h>
81#include <ufs/ffs/fs.h>
82#include <ufs/ffs/ffs_extern.h>
83#if REV_ENDIAN_FS
84#include <ufs/ufs/ufs_byte_order.h>
85#endif /* REV_ENDIAN_FS */
86
87/*
88 * Return buffer with the contents of block "offset" from the beginning of
89 * directory "ip". If "res" is non-zero, fill it in with a pointer to the
90 * remaining space in the directory.
91 */
92__private_extern__
93int
94ffs_blkatoff(vnode_t vp, off_t offset, char **res, buf_t *bpp)
95{
96 struct inode *ip;
97 register struct fs *fs;
98 struct buf *bp;
99 ufs_daddr_t lbn;
100 int bsize, error;
101#if REV_ENDIAN_FS
102 struct mount *mp = vnode_mount(vp);
103 int rev_endian=(mp->mnt_flag & MNT_REVEND);
104#endif /* REV_ENDIAN_FS */
105
106 ip = VTOI(vp);
107 fs = ip->i_fs;
108 lbn = lblkno(fs, offset);
109 bsize = blksize(fs, ip, lbn);
110
111 *bpp = NULL;
112 if (error = (int)buf_bread(vp, (daddr64_t)((unsigned)lbn), bsize, NOCRED, &bp)) {
113 buf_brelse(bp);
114 return (error);
115 }
116#if REV_ENDIAN_FS
117 if (rev_endian)
118 byte_swap_dir_block_in((char *)buf_dataptr(bp), buf_count(bp));
119#endif /* REV_ENDIAN_FS */
120
121 if (res)
122 *res = (char *)buf_dataptr(bp) + blkoff(fs, offset);
123 *bpp = bp;
124 return (0);
125}
126#endif
127
128/*
129 * Update the frsum fields to reflect addition or deletion
130 * of some frags.
131 */
132void
133ffs_fragacct(fs, fragmap, fraglist, cnt)
134 struct fs *fs;
135 int fragmap;
136 int32_t fraglist[];
137 int cnt;
138{
139 int inblk;
140 register int field, subfield;
141 register int siz, pos;
142
143 inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
144 fragmap <<= 1;
145 for (siz = 1; siz < fs->fs_frag; siz++) {
146 if ((inblk & (1 << (siz + (fs->fs_frag % NBBY)))) == 0)
147 continue;
148 field = around[siz];
149 subfield = inside[siz];
150 for (pos = siz; pos <= fs->fs_frag; pos++) {
151 if ((fragmap & field) == subfield) {
152 fraglist[siz] += cnt;
153 pos += siz;
154 field <<= siz;
155 subfield <<= siz;
156 }
157 field <<= 1;
158 subfield <<= 1;
159 }
160 }
161}
162
163/*
164 * block operations
165 *
166 * check if a block is available
167 */
168int
169ffs_isblock(fs, cp, h)
170 struct fs *fs;
171 unsigned char *cp;
172 ufs_daddr_t h;
173{
174 unsigned char mask;
175
176 switch ((int)fs->fs_frag) {
177 case 8:
178 return (cp[h] == 0xff);
179 case 4:
180 mask = 0x0f << ((h & 0x1) << 2);
181 return ((cp[h >> 1] & mask) == mask);
182 case 2:
183 mask = 0x03 << ((h & 0x3) << 1);
184 return ((cp[h >> 2] & mask) == mask);
185 case 1:
186 mask = 0x01 << (h & 0x7);
187 return ((cp[h >> 3] & mask) == mask);
188 default:
189 panic("ffs_isblock");
190 }
191 /* NOTREACHED */
192 return 0;
193}
194
195/*
196 * take a block out of the map
197 */
198void
199ffs_clrblock(fs, cp, h)
200 struct fs *fs;
201 u_char *cp;
202 ufs_daddr_t h;
203{
204
205 switch ((int)fs->fs_frag) {
206 case 8:
207 cp[h] = 0;
208 return;
209 case 4:
210 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
211 return;
212 case 2:
213 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
214 return;
215 case 1:
216 cp[h >> 3] &= ~(0x01 << (h & 0x7));
217 return;
218 default:
219 panic("ffs_clrblock");
220 }
221}
222
223/*
224 * put a block into the map
225 */
226void
227ffs_setblock(fs, cp, h)
228 struct fs *fs;
229 unsigned char *cp;
230 ufs_daddr_t h;
231{
232
233 switch ((int)fs->fs_frag) {
234
235 case 8:
236 cp[h] = 0xff;
237 return;
238 case 4:
239 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
240 return;
241 case 2:
242 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
243 return;
244 case 1:
245 cp[h >> 3] |= (0x01 << (h & 0x7));
246 return;
247 default:
248 panic("ffs_setblock");
249 }
250}