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