ffs_subr.c revision 1.45 1 1.45 hannken /* $NetBSD: ffs_subr.c,v 1.45 2008/06/03 09:47:49 hannken Exp $ */
2 1.2 cgd
3 1.1 mycroft /*
4 1.1 mycroft * Copyright (c) 1982, 1986, 1989, 1993
5 1.1 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 mycroft *
7 1.1 mycroft * Redistribution and use in source and binary forms, with or without
8 1.1 mycroft * modification, are permitted provided that the following conditions
9 1.1 mycroft * are met:
10 1.1 mycroft * 1. Redistributions of source code must retain the above copyright
11 1.1 mycroft * notice, this list of conditions and the following disclaimer.
12 1.1 mycroft * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 mycroft * notice, this list of conditions and the following disclaimer in the
14 1.1 mycroft * documentation and/or other materials provided with the distribution.
15 1.29 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 mycroft * may be used to endorse or promote products derived from this software
17 1.1 mycroft * without specific prior written permission.
18 1.1 mycroft *
19 1.1 mycroft * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 mycroft * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 mycroft * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 mycroft * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 mycroft * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 mycroft * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 mycroft * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 mycroft * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 mycroft * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 mycroft * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 mycroft * SUCH DAMAGE.
30 1.1 mycroft *
31 1.10 fvdl * @(#)ffs_subr.c 8.5 (Berkeley) 3/21/95
32 1.1 mycroft */
33 1.19 lukem
34 1.30 lukem #if HAVE_NBTOOL_CONFIG_H
35 1.30 lukem #include "nbtool_config.h"
36 1.21 tv #endif
37 1.21 tv
38 1.30 lukem #include <sys/cdefs.h>
39 1.45 hannken __KERNEL_RCSID(0, "$NetBSD: ffs_subr.c,v 1.45 2008/06/03 09:47:49 hannken Exp $");
40 1.1 mycroft
41 1.1 mycroft #include <sys/param.h>
42 1.20 lukem
43 1.20 lukem /* in ffs_tables.c */
44 1.24 matt extern const int inside[], around[];
45 1.24 matt extern const u_char * const fragtbl[];
46 1.20 lukem
47 1.1 mycroft #include <ufs/ffs/fs.h>
48 1.7 christos #include <ufs/ffs/ffs_extern.h>
49 1.11 bouyer #include <ufs/ufs/ufs_bswap.h>
50 1.44 hubertf
51 1.44 hubertf #ifndef _KERNEL
52 1.44 hubertf #include <ufs/ufs/dinode.h>
53 1.35 xtraeme void panic(const char *, ...)
54 1.20 lukem __attribute__((__noreturn__,__format__(__printf__,1,2)));
55 1.13 drochner
56 1.20 lukem #else /* _KERNEL */
57 1.20 lukem #include <sys/systm.h>
58 1.1 mycroft #include <sys/vnode.h>
59 1.11 bouyer #include <sys/mount.h>
60 1.1 mycroft #include <sys/buf.h>
61 1.27 tron #include <sys/inttypes.h>
62 1.28 fvdl #include <sys/pool.h>
63 1.45 hannken #include <sys/fstrans.h>
64 1.18 lukem #include <ufs/ufs/inode.h>
65 1.11 bouyer #include <ufs/ufs/ufsmount.h>
66 1.11 bouyer #include <ufs/ufs/ufs_extern.h>
67 1.1 mycroft
68 1.1 mycroft /*
69 1.28 fvdl * Load up the contents of an inode and copy the appropriate pieces
70 1.28 fvdl * to the incore copy.
71 1.28 fvdl */
72 1.28 fvdl void
73 1.34 thorpej ffs_load_inode(struct buf *bp, struct inode *ip, struct fs *fs, ino_t ino)
74 1.28 fvdl {
75 1.28 fvdl struct ufs1_dinode *dp1;
76 1.28 fvdl struct ufs2_dinode *dp2;
77 1.28 fvdl
78 1.28 fvdl if (ip->i_ump->um_fstype == UFS1) {
79 1.28 fvdl dp1 = (struct ufs1_dinode *)bp->b_data + ino_to_fsbo(fs, ino);
80 1.28 fvdl #ifdef FFS_EI
81 1.28 fvdl if (UFS_FSNEEDSWAP(fs))
82 1.28 fvdl ffs_dinode1_swap(dp1, ip->i_din.ffs1_din);
83 1.28 fvdl else
84 1.28 fvdl #endif
85 1.28 fvdl *ip->i_din.ffs1_din = *dp1;
86 1.28 fvdl
87 1.28 fvdl ip->i_mode = ip->i_ffs1_mode;
88 1.28 fvdl ip->i_nlink = ip->i_ffs1_nlink;
89 1.28 fvdl ip->i_size = ip->i_ffs1_size;
90 1.28 fvdl ip->i_flags = ip->i_ffs1_flags;
91 1.28 fvdl ip->i_gen = ip->i_ffs1_gen;
92 1.28 fvdl ip->i_uid = ip->i_ffs1_uid;
93 1.28 fvdl ip->i_gid = ip->i_ffs1_gid;
94 1.28 fvdl } else {
95 1.28 fvdl dp2 = (struct ufs2_dinode *)bp->b_data + ino_to_fsbo(fs, ino);
96 1.28 fvdl #ifdef FFS_EI
97 1.28 fvdl if (UFS_FSNEEDSWAP(fs))
98 1.28 fvdl ffs_dinode2_swap(dp2, ip->i_din.ffs2_din);
99 1.28 fvdl else
100 1.28 fvdl #endif
101 1.28 fvdl *ip->i_din.ffs2_din = *dp2;
102 1.28 fvdl
103 1.28 fvdl ip->i_mode = ip->i_ffs2_mode;
104 1.28 fvdl ip->i_nlink = ip->i_ffs2_nlink;
105 1.28 fvdl ip->i_size = ip->i_ffs2_size;
106 1.28 fvdl ip->i_flags = ip->i_ffs2_flags;
107 1.28 fvdl ip->i_gen = ip->i_ffs2_gen;
108 1.28 fvdl ip->i_uid = ip->i_ffs2_uid;
109 1.28 fvdl ip->i_gid = ip->i_ffs2_gid;
110 1.28 fvdl }
111 1.28 fvdl }
112 1.28 fvdl
113 1.45 hannken int
114 1.45 hannken ffs_getblk(struct vnode *vp, daddr_t lblkno, daddr_t blkno, int size,
115 1.45 hannken bool clearbuf, buf_t **bpp)
116 1.45 hannken {
117 1.45 hannken int error = 0;
118 1.45 hannken
119 1.45 hannken KASSERT(blkno >= 0 || blkno == FFS_NOBLK);
120 1.45 hannken
121 1.45 hannken if ((*bpp = getblk(vp, lblkno, size, 0, 0)) == NULL)
122 1.45 hannken return ENOMEM;
123 1.45 hannken if (blkno != FFS_NOBLK)
124 1.45 hannken (*bpp)->b_blkno = blkno;
125 1.45 hannken if (clearbuf)
126 1.45 hannken clrbuf(*bpp);
127 1.45 hannken if ((*bpp)->b_blkno >= 0 && (error = fscow_run(*bpp, false)) != 0)
128 1.45 hannken brelse(*bpp, BC_INVAL);
129 1.45 hannken return error;
130 1.45 hannken }
131 1.45 hannken
132 1.20 lukem #endif /* _KERNEL */
133 1.1 mycroft
134 1.1 mycroft /*
135 1.33 perry * Update the frsum fields to reflect addition or deletion
136 1.1 mycroft * of some frags.
137 1.1 mycroft */
138 1.1 mycroft void
139 1.34 thorpej ffs_fragacct(struct fs *fs, int fragmap, int32_t fraglist[], int cnt,
140 1.43 christos int needswap)
141 1.1 mycroft {
142 1.1 mycroft int inblk;
143 1.15 augustss int field, subfield;
144 1.15 augustss int siz, pos;
145 1.1 mycroft
146 1.1 mycroft inblk = (int)(fragtbl[fs->fs_frag][fragmap]) << 1;
147 1.1 mycroft fragmap <<= 1;
148 1.1 mycroft for (siz = 1; siz < fs->fs_frag; siz++) {
149 1.22 mycroft if ((inblk & (1 << (siz + (fs->fs_frag & (NBBY - 1))))) == 0)
150 1.1 mycroft continue;
151 1.1 mycroft field = around[siz];
152 1.1 mycroft subfield = inside[siz];
153 1.1 mycroft for (pos = siz; pos <= fs->fs_frag; pos++) {
154 1.1 mycroft if ((fragmap & field) == subfield) {
155 1.11 bouyer fraglist[siz] = ufs_rw32(
156 1.12 kleink ufs_rw32(fraglist[siz], needswap) + cnt,
157 1.12 kleink needswap);
158 1.1 mycroft pos += siz;
159 1.1 mycroft field <<= siz;
160 1.1 mycroft subfield <<= siz;
161 1.1 mycroft }
162 1.1 mycroft field <<= 1;
163 1.1 mycroft subfield <<= 1;
164 1.1 mycroft }
165 1.1 mycroft }
166 1.1 mycroft }
167 1.1 mycroft
168 1.1 mycroft /*
169 1.1 mycroft * block operations
170 1.1 mycroft *
171 1.1 mycroft * check if a block is available
172 1.31 dbj * returns true if all the correponding bits in the free map are 1
173 1.33 perry * returns false if any corresponding bit in the free map is 0
174 1.1 mycroft */
175 1.1 mycroft int
176 1.34 thorpej ffs_isblock(struct fs *fs, u_char *cp, int32_t h)
177 1.1 mycroft {
178 1.16 lukem u_char mask;
179 1.1 mycroft
180 1.22 mycroft switch ((int)fs->fs_fragshift) {
181 1.22 mycroft case 3:
182 1.1 mycroft return (cp[h] == 0xff);
183 1.22 mycroft case 2:
184 1.1 mycroft mask = 0x0f << ((h & 0x1) << 2);
185 1.1 mycroft return ((cp[h >> 1] & mask) == mask);
186 1.22 mycroft case 1:
187 1.1 mycroft mask = 0x03 << ((h & 0x3) << 1);
188 1.1 mycroft return ((cp[h >> 2] & mask) == mask);
189 1.22 mycroft case 0:
190 1.1 mycroft mask = 0x01 << (h & 0x7);
191 1.1 mycroft return ((cp[h >> 3] & mask) == mask);
192 1.1 mycroft default:
193 1.22 mycroft panic("ffs_isblock: unknown fs_fragshift %d",
194 1.22 mycroft (int)fs->fs_fragshift);
195 1.14 fvdl }
196 1.14 fvdl }
197 1.14 fvdl
198 1.14 fvdl /*
199 1.31 dbj * check if a block is completely allocated
200 1.31 dbj * returns true if all the corresponding bits in the free map are 0
201 1.31 dbj * returns false if any corresponding bit in the free map is 1
202 1.14 fvdl */
203 1.14 fvdl int
204 1.34 thorpej ffs_isfreeblock(struct fs *fs, u_char *cp, int32_t h)
205 1.14 fvdl {
206 1.14 fvdl
207 1.22 mycroft switch ((int)fs->fs_fragshift) {
208 1.22 mycroft case 3:
209 1.14 fvdl return (cp[h] == 0);
210 1.22 mycroft case 2:
211 1.14 fvdl return ((cp[h >> 1] & (0x0f << ((h & 0x1) << 2))) == 0);
212 1.22 mycroft case 1:
213 1.14 fvdl return ((cp[h >> 2] & (0x03 << ((h & 0x3) << 1))) == 0);
214 1.22 mycroft case 0:
215 1.14 fvdl return ((cp[h >> 3] & (0x01 << (h & 0x7))) == 0);
216 1.14 fvdl default:
217 1.22 mycroft panic("ffs_isfreeblock: unknown fs_fragshift %d",
218 1.22 mycroft (int)fs->fs_fragshift);
219 1.1 mycroft }
220 1.1 mycroft }
221 1.1 mycroft
222 1.1 mycroft /*
223 1.1 mycroft * take a block out of the map
224 1.1 mycroft */
225 1.1 mycroft void
226 1.34 thorpej ffs_clrblock(struct fs *fs, u_char *cp, int32_t h)
227 1.1 mycroft {
228 1.1 mycroft
229 1.22 mycroft switch ((int)fs->fs_fragshift) {
230 1.22 mycroft case 3:
231 1.1 mycroft cp[h] = 0;
232 1.1 mycroft return;
233 1.22 mycroft case 2:
234 1.1 mycroft cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
235 1.1 mycroft return;
236 1.22 mycroft case 1:
237 1.1 mycroft cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
238 1.1 mycroft return;
239 1.22 mycroft case 0:
240 1.1 mycroft cp[h >> 3] &= ~(0x01 << (h & 0x7));
241 1.1 mycroft return;
242 1.1 mycroft default:
243 1.22 mycroft panic("ffs_clrblock: unknown fs_fragshift %d",
244 1.22 mycroft (int)fs->fs_fragshift);
245 1.1 mycroft }
246 1.1 mycroft }
247 1.1 mycroft
248 1.1 mycroft /*
249 1.1 mycroft * put a block into the map
250 1.1 mycroft */
251 1.1 mycroft void
252 1.34 thorpej ffs_setblock(struct fs *fs, u_char *cp, int32_t h)
253 1.1 mycroft {
254 1.1 mycroft
255 1.22 mycroft switch ((int)fs->fs_fragshift) {
256 1.22 mycroft case 3:
257 1.1 mycroft cp[h] = 0xff;
258 1.1 mycroft return;
259 1.22 mycroft case 2:
260 1.1 mycroft cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
261 1.1 mycroft return;
262 1.22 mycroft case 1:
263 1.1 mycroft cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
264 1.1 mycroft return;
265 1.22 mycroft case 0:
266 1.1 mycroft cp[h >> 3] |= (0x01 << (h & 0x7));
267 1.1 mycroft return;
268 1.1 mycroft default:
269 1.22 mycroft panic("ffs_setblock: unknown fs_fragshift %d",
270 1.22 mycroft (int)fs->fs_fragshift);
271 1.1 mycroft }
272 1.1 mycroft }
273