ffs_bswap.c revision 1.25 1 1.25 dbj /* $NetBSD: ffs_bswap.c,v 1.25 2003/12/31 18:40:23 dbj Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1998 Manuel Bouyer.
5 1.1 bouyer *
6 1.1 bouyer * Redistribution and use in source and binary forms, with or without
7 1.1 bouyer * modification, are permitted provided that the following conditions
8 1.1 bouyer * are met:
9 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
10 1.1 bouyer * notice, this list of conditions and the following disclaimer.
11 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
13 1.1 bouyer * documentation and/or other materials provided with the distribution.
14 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
15 1.1 bouyer * must display the following acknowledgement:
16 1.21 bouyer * This product includes software developed by Manuel Bouyer.
17 1.21 bouyer * 4. The name of the author may not be used to endorse or promote products
18 1.21 bouyer * derived from this software without specific prior written permission.
19 1.1 bouyer *
20 1.8 bouyer * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 1.8 bouyer * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 1.8 bouyer * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 1.8 bouyer * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 1.8 bouyer * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 1.8 bouyer * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 1.8 bouyer * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 1.8 bouyer * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 1.8 bouyer * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 1.8 bouyer * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 1.1 bouyer *
31 1.1 bouyer */
32 1.15 lukem
33 1.22 lukem #if HAVE_NBTOOL_CONFIG_H
34 1.22 lukem #include "nbtool_config.h"
35 1.17 tv #endif
36 1.17 tv
37 1.22 lukem #include <sys/cdefs.h>
38 1.25 dbj __KERNEL_RCSID(0, "$NetBSD: ffs_bswap.c,v 1.25 2003/12/31 18:40:23 dbj Exp $");
39 1.1 bouyer
40 1.2 ragge #include <sys/param.h>
41 1.11 lukem #if defined(_KERNEL)
42 1.1 bouyer #include <sys/systm.h>
43 1.11 lukem #endif
44 1.9 enami
45 1.1 bouyer #include <ufs/ufs/dinode.h>
46 1.1 bouyer #include <ufs/ufs/ufs_bswap.h>
47 1.1 bouyer #include <ufs/ffs/fs.h>
48 1.1 bouyer #include <ufs/ffs/ffs_extern.h>
49 1.6 thorpej
50 1.6 thorpej #if !defined(_KERNEL)
51 1.14 lukem #include <stddef.h>
52 1.11 lukem #include <stdio.h>
53 1.11 lukem #include <stdlib.h>
54 1.6 thorpej #include <string.h>
55 1.11 lukem #define panic(x) printf("%s\n", (x)), abort()
56 1.6 thorpej #endif
57 1.1 bouyer
58 1.1 bouyer void
59 1.11 lukem ffs_sb_swap(struct fs *o, struct fs *n)
60 1.1 bouyer {
61 1.18 fvdl int i;
62 1.1 bouyer u_int32_t *o32, *n32;
63 1.11 lukem
64 1.9 enami /*
65 1.14 lukem * In order to avoid a lot of lines, as the first N fields (52)
66 1.14 lukem * of the superblock up to fs_fmod are u_int32_t, we just loop
67 1.14 lukem * here to convert them.
68 1.1 bouyer */
69 1.1 bouyer o32 = (u_int32_t *)o;
70 1.1 bouyer n32 = (u_int32_t *)n;
71 1.14 lukem for (i = 0; i < offsetof(struct fs, fs_fmod) / sizeof(u_int32_t); i++)
72 1.1 bouyer n32[i] = bswap32(o32[i]);
73 1.9 enami
74 1.18 fvdl n->fs_swuid = bswap64(o->fs_swuid);
75 1.23 dbj n->fs_cgrotor = bswap32(o->fs_cgrotor); /* Unused */
76 1.18 fvdl n->fs_old_cpc = bswap32(o->fs_old_cpc);
77 1.25 dbj
78 1.25 dbj /* These fields overlap with a possible location for the
79 1.25 dbj * historic FS_DYNAMICPOSTBLFMT postbl table, and with the
80 1.25 dbj * first half of the historic FS_42POSTBLFMT postbl table.
81 1.25 dbj */
82 1.18 fvdl n->fs_maxbsize = bswap32(o->fs_maxbsize);
83 1.18 fvdl n->fs_sblockloc = bswap64(o->fs_sblockloc);
84 1.18 fvdl ffs_csumtotal_swap(&o->fs_cstotal, &n->fs_cstotal);
85 1.18 fvdl n->fs_time = bswap64(o->fs_time);
86 1.18 fvdl n->fs_size = bswap64(o->fs_size);
87 1.18 fvdl n->fs_dsize = bswap64(o->fs_dsize);
88 1.18 fvdl n->fs_csaddr = bswap64(o->fs_csaddr);
89 1.25 dbj n->fs_pendingblocks = bswap64(o->fs_pendingblocks);
90 1.25 dbj n->fs_pendinginodes = bswap32(o->fs_pendinginodes);
91 1.25 dbj
92 1.25 dbj /* These fields overlap with the second half of the
93 1.25 dbj * historic FS_42POSTBLFMT postbl table
94 1.25 dbj */
95 1.25 dbj /* fs_snapinum[20] - ignore for now */
96 1.13 lukem n->fs_avgfilesize = bswap32(o->fs_avgfilesize);
97 1.13 lukem n->fs_avgfpdir = bswap32(o->fs_avgfpdir);
98 1.25 dbj /* fs_sparecon[28] - ignore for now */
99 1.24 dbj n->fs_flags = bswap32(o->fs_flags);
100 1.1 bouyer n->fs_contigsumsize = bswap32(o->fs_contigsumsize);
101 1.1 bouyer n->fs_maxsymlinklen = bswap32(o->fs_maxsymlinklen);
102 1.18 fvdl n->fs_old_inodefmt = bswap32(o->fs_old_inodefmt);
103 1.1 bouyer n->fs_maxfilesize = bswap64(o->fs_maxfilesize);
104 1.1 bouyer n->fs_qbmask = bswap64(o->fs_qbmask);
105 1.1 bouyer n->fs_qfmask = bswap64(o->fs_qfmask);
106 1.1 bouyer n->fs_state = bswap32(o->fs_state);
107 1.18 fvdl n->fs_old_postblformat = bswap32(o->fs_old_postblformat);
108 1.18 fvdl n->fs_old_nrpos = bswap32(o->fs_old_nrpos);
109 1.18 fvdl n->fs_old_postbloff = bswap32(o->fs_old_postbloff);
110 1.18 fvdl n->fs_old_rotbloff = bswap32(o->fs_old_rotbloff);
111 1.25 dbj
112 1.1 bouyer n->fs_magic = bswap32(o->fs_magic);
113 1.1 bouyer }
114 1.1 bouyer
115 1.1 bouyer void
116 1.18 fvdl ffs_dinode1_swap(struct ufs1_dinode *o, struct ufs1_dinode *n)
117 1.1 bouyer {
118 1.9 enami
119 1.1 bouyer n->di_mode = bswap16(o->di_mode);
120 1.1 bouyer n->di_nlink = bswap16(o->di_nlink);
121 1.1 bouyer n->di_u.oldids[0] = bswap16(o->di_u.oldids[0]);
122 1.1 bouyer n->di_u.oldids[1] = bswap16(o->di_u.oldids[1]);
123 1.1 bouyer n->di_size = bswap64(o->di_size);
124 1.1 bouyer n->di_atime = bswap32(o->di_atime);
125 1.1 bouyer n->di_atimensec = bswap32(o->di_atimensec);
126 1.1 bouyer n->di_mtime = bswap32(o->di_mtime);
127 1.1 bouyer n->di_mtimensec = bswap32(o->di_mtimensec);
128 1.1 bouyer n->di_ctime = bswap32(o->di_ctime);
129 1.1 bouyer n->di_ctimensec = bswap32(o->di_ctimensec);
130 1.5 perry memcpy(n->di_db, o->di_db, (NDADDR + NIADDR) * sizeof(u_int32_t));
131 1.1 bouyer n->di_flags = bswap32(o->di_flags);
132 1.1 bouyer n->di_blocks = bswap32(o->di_blocks);
133 1.1 bouyer n->di_gen = bswap32(o->di_gen);
134 1.1 bouyer n->di_uid = bswap32(o->di_uid);
135 1.1 bouyer n->di_gid = bswap32(o->di_gid);
136 1.1 bouyer }
137 1.1 bouyer
138 1.1 bouyer void
139 1.18 fvdl ffs_dinode2_swap(struct ufs2_dinode *o, struct ufs2_dinode *n)
140 1.18 fvdl {
141 1.18 fvdl n->di_mode = bswap16(o->di_mode);
142 1.18 fvdl n->di_nlink = bswap16(o->di_nlink);
143 1.18 fvdl n->di_uid = bswap32(o->di_uid);
144 1.18 fvdl n->di_gid = bswap32(o->di_gid);
145 1.18 fvdl n->di_blksize = bswap32(o->di_blksize);
146 1.18 fvdl n->di_size = bswap64(o->di_size);
147 1.18 fvdl n->di_blocks = bswap64(o->di_blocks);
148 1.18 fvdl n->di_atime = bswap64(o->di_atime);
149 1.18 fvdl n->di_atimensec = bswap32(o->di_atimensec);
150 1.18 fvdl n->di_mtime = bswap64(o->di_mtime);
151 1.18 fvdl n->di_mtimensec = bswap32(o->di_mtimensec);
152 1.18 fvdl n->di_ctime = bswap64(o->di_ctime);
153 1.18 fvdl n->di_ctimensec = bswap32(o->di_ctimensec);
154 1.18 fvdl n->di_birthtime = bswap64(o->di_ctime);
155 1.18 fvdl n->di_birthnsec = bswap32(o->di_ctimensec);
156 1.18 fvdl n->di_gen = bswap32(o->di_gen);
157 1.18 fvdl n->di_kernflags = bswap32(o->di_kernflags);
158 1.18 fvdl n->di_flags = bswap32(o->di_flags);
159 1.18 fvdl n->di_extsize = bswap32(o->di_extsize);
160 1.18 fvdl memcpy(n->di_extb, o->di_extb, (NXADDR + NDADDR + NIADDR) * 8);
161 1.18 fvdl }
162 1.18 fvdl
163 1.18 fvdl void
164 1.11 lukem ffs_csum_swap(struct csum *o, struct csum *n, int size)
165 1.1 bouyer {
166 1.1 bouyer int i;
167 1.1 bouyer u_int32_t *oint, *nint;
168 1.1 bouyer
169 1.1 bouyer oint = (u_int32_t*)o;
170 1.1 bouyer nint = (u_int32_t*)n;
171 1.1 bouyer
172 1.1 bouyer for (i = 0; i < size / sizeof(u_int32_t); i++)
173 1.1 bouyer nint[i] = bswap32(oint[i]);
174 1.18 fvdl }
175 1.18 fvdl
176 1.18 fvdl void
177 1.18 fvdl ffs_csumtotal_swap(struct csum_total *o, struct csum_total *n)
178 1.18 fvdl {
179 1.18 fvdl n->cs_ndir = bswap64(o->cs_ndir);
180 1.18 fvdl n->cs_nbfree = bswap64(o->cs_nbfree);
181 1.18 fvdl n->cs_nifree = bswap64(o->cs_nifree);
182 1.18 fvdl n->cs_nffree = bswap64(o->cs_nffree);
183 1.18 fvdl n->cs_numclusters = bswap64(o->cs_numclusters);
184 1.18 fvdl }
185 1.18 fvdl
186 1.19 enami /*
187 1.19 enami * Note that ffs_cg_swap may be called with o == n.
188 1.19 enami */
189 1.18 fvdl void
190 1.18 fvdl ffs_cg_swap(struct cg *o, struct cg *n, struct fs *fs)
191 1.18 fvdl {
192 1.18 fvdl int i;
193 1.18 fvdl u_int32_t *n32, *o32;
194 1.18 fvdl u_int16_t *n16, *o16;
195 1.19 enami int32_t btotoff, boff, clustersumoff;
196 1.18 fvdl
197 1.18 fvdl n->cg_firstfield = bswap32(o->cg_firstfield);
198 1.18 fvdl n->cg_magic = bswap32(o->cg_magic);
199 1.18 fvdl n->cg_old_time = bswap32(o->cg_old_time);
200 1.18 fvdl n->cg_cgx = bswap32(o->cg_cgx);
201 1.18 fvdl n->cg_old_ncyl = bswap16(o->cg_old_ncyl);
202 1.18 fvdl n->cg_old_niblk = bswap16(o->cg_old_niblk);
203 1.18 fvdl n->cg_ndblk = bswap32(o->cg_ndblk);
204 1.18 fvdl n->cg_cs.cs_ndir = bswap32(o->cg_cs.cs_ndir);
205 1.18 fvdl n->cg_cs.cs_nbfree = bswap32(o->cg_cs.cs_nbfree);
206 1.18 fvdl n->cg_cs.cs_nifree = bswap32(o->cg_cs.cs_nifree);
207 1.18 fvdl n->cg_cs.cs_nffree = bswap32(o->cg_cs.cs_nffree);
208 1.18 fvdl n->cg_rotor = bswap32(o->cg_rotor);
209 1.18 fvdl n->cg_frotor = bswap32(o->cg_frotor);
210 1.18 fvdl n->cg_irotor = bswap32(o->cg_irotor);
211 1.19 enami for (i = 0; i < MAXFRAG; i++)
212 1.18 fvdl n->cg_frsum[i] = bswap32(o->cg_frsum[i]);
213 1.23 dbj
214 1.23 dbj /* XXX This check should probably really just be
215 1.23 dbj * (n->cg_magic != CG_MAGIC) -- dbj
216 1.23 dbj */
217 1.23 dbj if ((fs->fs_magic != FS_UFS2_MAGIC) &&
218 1.23 dbj (fs->fs_old_postblformat == FS_42POSTBLFMT)) { /* old format */
219 1.18 fvdl struct ocg *on, *oo;
220 1.18 fvdl int j;
221 1.18 fvdl on = (struct ocg *)n;
222 1.18 fvdl oo = (struct ocg *)o;
223 1.23 dbj
224 1.23 dbj for (i = 0; i < 32; i++) {
225 1.18 fvdl on->cg_btot[i] = bswap32(oo->cg_btot[i]);
226 1.18 fvdl for (j = 0; j < 8; j++)
227 1.18 fvdl on->cg_b[i][j] = bswap16(oo->cg_b[i][j]);
228 1.18 fvdl }
229 1.18 fvdl memmove(on->cg_iused, oo->cg_iused, 256);
230 1.18 fvdl on->cg_magic = bswap32(oo->cg_magic);
231 1.18 fvdl } else { /* new format */
232 1.23 dbj
233 1.23 dbj n->cg_old_btotoff = bswap32(o->cg_old_btotoff);
234 1.23 dbj n->cg_old_boff = bswap32(o->cg_old_boff);
235 1.23 dbj n->cg_iusedoff = bswap32(o->cg_iusedoff);
236 1.23 dbj n->cg_freeoff = bswap32(o->cg_freeoff);
237 1.23 dbj n->cg_nextfreeoff = bswap32(o->cg_nextfreeoff);
238 1.23 dbj n->cg_clustersumoff = bswap32(o->cg_clustersumoff);
239 1.23 dbj n->cg_clusteroff = bswap32(o->cg_clusteroff);
240 1.23 dbj n->cg_nclusterblks = bswap32(o->cg_nclusterblks);
241 1.23 dbj n->cg_niblk = bswap32(o->cg_niblk);
242 1.23 dbj n->cg_initediblk = bswap32(o->cg_initediblk);
243 1.23 dbj n->cg_time = bswap64(o->cg_time);
244 1.23 dbj
245 1.23 dbj if (fs->fs_magic == FS_UFS2_MAGIC)
246 1.23 dbj return;
247 1.23 dbj
248 1.18 fvdl if (n->cg_magic == CG_MAGIC) {
249 1.19 enami btotoff = n->cg_old_btotoff;
250 1.19 enami boff = n->cg_old_boff;
251 1.19 enami clustersumoff = n->cg_clustersumoff;
252 1.18 fvdl } else {
253 1.23 dbj /* XXX this shouldn't happen -- dbj */
254 1.19 enami btotoff = bswap32(n->cg_old_btotoff);
255 1.19 enami boff = bswap32(n->cg_old_boff);
256 1.19 enami clustersumoff = bswap32(n->cg_clustersumoff);
257 1.18 fvdl }
258 1.19 enami n32 = (u_int32_t *)((u_int8_t *)n + btotoff);
259 1.19 enami o32 = (u_int32_t *)((u_int8_t *)o + btotoff);
260 1.19 enami n16 = (u_int16_t *)((u_int8_t *)n + boff);
261 1.19 enami o16 = (u_int16_t *)((u_int8_t *)o + boff);
262 1.19 enami
263 1.19 enami for (i = 0; i < fs->fs_old_cpg; i++)
264 1.18 fvdl n32[i] = bswap32(o32[i]);
265 1.18 fvdl
266 1.19 enami for (i = 0; i < fs->fs_old_cpg * fs->fs_old_nrpos; i++)
267 1.18 fvdl n16[i] = bswap16(o16[i]);
268 1.18 fvdl
269 1.19 enami n32 = (u_int32_t *)((u_int8_t *)n + clustersumoff);
270 1.19 enami o32 = (u_int32_t *)((u_int8_t *)o + clustersumoff);
271 1.18 fvdl for (i = 1; i < fs->fs_contigsumsize + 1; i++)
272 1.18 fvdl n32[i] = bswap32(o32[i]);
273 1.18 fvdl }
274 1.1 bouyer }
275