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