ffs_bswap.c revision 1.10.2.4 1 1.10.2.4 nathanw /* $NetBSD: ffs_bswap.c,v 1.10.2.4 2002/01/08 00:34:46 nathanw 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.1 bouyer * This product includes software developed by the University of
17 1.1 bouyer * California, Berkeley and its contributors.
18 1.1 bouyer * 4. Neither the name of the University nor the names of its contributors
19 1.1 bouyer * may be used to endorse or promote products derived from this software
20 1.1 bouyer * without specific prior written permission.
21 1.1 bouyer *
22 1.8 bouyer * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 1.8 bouyer * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 1.8 bouyer * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 1.8 bouyer * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 1.8 bouyer * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 1.8 bouyer * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 1.8 bouyer * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 1.8 bouyer * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 1.8 bouyer * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 1.8 bouyer * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 1.1 bouyer *
33 1.1 bouyer */
34 1.1 bouyer
35 1.10.2.3 nathanw #include <sys/cdefs.h>
36 1.10.2.4 nathanw __KERNEL_RCSID(0, "$NetBSD: ffs_bswap.c,v 1.10.2.4 2002/01/08 00:34:46 nathanw Exp $");
37 1.10.2.3 nathanw
38 1.2 ragge #include <sys/param.h>
39 1.10.2.1 nathanw #if defined(_KERNEL)
40 1.1 bouyer #include <sys/systm.h>
41 1.10.2.1 nathanw #endif
42 1.9 enami
43 1.1 bouyer #include <ufs/ufs/dinode.h>
44 1.1 bouyer #include <ufs/ufs/ufs_bswap.h>
45 1.1 bouyer #include <ufs/ffs/fs.h>
46 1.1 bouyer #include <ufs/ffs/ffs_extern.h>
47 1.6 thorpej
48 1.6 thorpej #if !defined(_KERNEL)
49 1.10.2.3 nathanw #include <stddef.h>
50 1.10.2.1 nathanw #include <stdio.h>
51 1.10.2.1 nathanw #include <stdlib.h>
52 1.6 thorpej #include <string.h>
53 1.10.2.1 nathanw #define panic(x) printf("%s\n", (x)), abort()
54 1.6 thorpej #endif
55 1.1 bouyer
56 1.1 bouyer void
57 1.10.2.1 nathanw ffs_sb_swap(struct fs *o, struct fs *n)
58 1.1 bouyer {
59 1.10.2.1 nathanw int i, needswap, len;
60 1.1 bouyer u_int32_t *o32, *n32;
61 1.1 bouyer u_int16_t *o16, *n16;
62 1.10.2.1 nathanw u_int32_t postbloff, postblfmt;
63 1.10.2.1 nathanw
64 1.10.2.1 nathanw if (o->fs_magic == FS_MAGIC) {
65 1.10.2.1 nathanw needswap = 0;
66 1.10.2.1 nathanw } else if (o->fs_magic == bswap32(FS_MAGIC)) {
67 1.10.2.1 nathanw needswap = 1;
68 1.10.2.1 nathanw } else {
69 1.10.2.1 nathanw panic("ffs_sb_swap: can't determine magic");
70 1.10.2.1 nathanw }
71 1.10.2.1 nathanw postbloff = ufs_rw32(o->fs_postbloff, needswap);
72 1.10.2.1 nathanw postblfmt = ufs_rw32(o->fs_postblformat, needswap);
73 1.10.2.3 nathanw /* compute these before swapping, in case o == n */
74 1.10.2.3 nathanw o16 = (postblfmt == FS_42POSTBLFMT) ? o->fs_opostbl[0] :
75 1.10.2.3 nathanw (int16_t *)((u_int8_t *)o + postbloff);
76 1.10.2.3 nathanw n16 = (postblfmt == FS_42POSTBLFMT) ? n->fs_opostbl[0] :
77 1.10.2.3 nathanw (int16_t *)((u_int8_t *)n + postbloff);
78 1.10.2.3 nathanw len = postblfmt == FS_42POSTBLFMT ?
79 1.10.2.3 nathanw sizeof(o->fs_opostbl) / sizeof(o->fs_opostbl[0][0]) :
80 1.10.2.3 nathanw ufs_rw32(o->fs_cpc, needswap) * ufs_rw32(o->fs_nrpos, needswap);
81 1.10.2.1 nathanw
82 1.9 enami /*
83 1.10.2.3 nathanw * In order to avoid a lot of lines, as the first N fields (52)
84 1.10.2.3 nathanw * of the superblock up to fs_fmod are u_int32_t, we just loop
85 1.10.2.3 nathanw * here to convert them.
86 1.1 bouyer */
87 1.1 bouyer o32 = (u_int32_t *)o;
88 1.1 bouyer n32 = (u_int32_t *)n;
89 1.10.2.3 nathanw for (i = 0; i < offsetof(struct fs, fs_fmod) / sizeof(u_int32_t); i++)
90 1.1 bouyer n32[i] = bswap32(o32[i]);
91 1.9 enami
92 1.10.2.3 nathanw /* fs_cgrotor is now unused */
93 1.1 bouyer n->fs_cpc = bswap32(o->fs_cpc);
94 1.10.2.3 nathanw /* fs_opostbl - may be done below */
95 1.10.2.3 nathanw /* fs_snapinum[20] - ignore for now */
96 1.10.2.2 nathanw n->fs_avgfilesize = bswap32(o->fs_avgfilesize);
97 1.10.2.2 nathanw n->fs_avgfpdir = bswap32(o->fs_avgfpdir);
98 1.10.2.3 nathanw /* fs_sparecon[28] - ignore for now */
99 1.10.2.4 nathanw n->fs_pendingblocks = bswap32(o->fs_pendingblocks);
100 1.10.2.4 nathanw n->fs_pendinginodes = bswap32(o->fs_pendinginodes);
101 1.1 bouyer n->fs_contigsumsize = bswap32(o->fs_contigsumsize);
102 1.1 bouyer n->fs_maxsymlinklen = bswap32(o->fs_maxsymlinklen);
103 1.1 bouyer n->fs_inodefmt = bswap32(o->fs_inodefmt);
104 1.1 bouyer n->fs_maxfilesize = bswap64(o->fs_maxfilesize);
105 1.1 bouyer n->fs_qbmask = bswap64(o->fs_qbmask);
106 1.1 bouyer n->fs_qfmask = bswap64(o->fs_qfmask);
107 1.1 bouyer n->fs_state = bswap32(o->fs_state);
108 1.1 bouyer n->fs_postblformat = bswap32(o->fs_postblformat);
109 1.1 bouyer n->fs_nrpos = bswap32(o->fs_nrpos);
110 1.1 bouyer n->fs_postbloff = bswap32(o->fs_postbloff);
111 1.1 bouyer n->fs_rotbloff = bswap32(o->fs_rotbloff);
112 1.1 bouyer n->fs_magic = bswap32(o->fs_magic);
113 1.10.2.3 nathanw /* byteswap the postbl */
114 1.10.2.1 nathanw for (i = 0; i < len; i++)
115 1.1 bouyer n16[i] = bswap16(o16[i]);
116 1.1 bouyer }
117 1.1 bouyer
118 1.1 bouyer void
119 1.10.2.1 nathanw ffs_dinode_swap(struct dinode *o, struct dinode *n)
120 1.1 bouyer {
121 1.9 enami
122 1.1 bouyer n->di_mode = bswap16(o->di_mode);
123 1.1 bouyer n->di_nlink = bswap16(o->di_nlink);
124 1.1 bouyer n->di_u.oldids[0] = bswap16(o->di_u.oldids[0]);
125 1.1 bouyer n->di_u.oldids[1] = bswap16(o->di_u.oldids[1]);
126 1.1 bouyer n->di_size = bswap64(o->di_size);
127 1.1 bouyer n->di_atime = bswap32(o->di_atime);
128 1.1 bouyer n->di_atimensec = bswap32(o->di_atimensec);
129 1.1 bouyer n->di_mtime = bswap32(o->di_mtime);
130 1.1 bouyer n->di_mtimensec = bswap32(o->di_mtimensec);
131 1.1 bouyer n->di_ctime = bswap32(o->di_ctime);
132 1.1 bouyer n->di_ctimensec = bswap32(o->di_ctimensec);
133 1.5 perry memcpy(n->di_db, o->di_db, (NDADDR + NIADDR) * sizeof(u_int32_t));
134 1.1 bouyer n->di_flags = bswap32(o->di_flags);
135 1.1 bouyer n->di_blocks = bswap32(o->di_blocks);
136 1.1 bouyer n->di_gen = bswap32(o->di_gen);
137 1.1 bouyer n->di_uid = bswap32(o->di_uid);
138 1.1 bouyer n->di_gid = bswap32(o->di_gid);
139 1.1 bouyer }
140 1.1 bouyer
141 1.1 bouyer void
142 1.10.2.1 nathanw ffs_csum_swap(struct csum *o, struct csum *n, int size)
143 1.1 bouyer {
144 1.1 bouyer int i;
145 1.1 bouyer u_int32_t *oint, *nint;
146 1.1 bouyer
147 1.1 bouyer oint = (u_int32_t*)o;
148 1.1 bouyer nint = (u_int32_t*)n;
149 1.1 bouyer
150 1.1 bouyer for (i = 0; i < size / sizeof(u_int32_t); i++)
151 1.1 bouyer nint[i] = bswap32(oint[i]);
152 1.1 bouyer }
153