Home | History | Annotate | Line # | Download | only in ffs
ffs_bswap.c revision 1.13 
      1 /*	$NetBSD: ffs_bswap.c,v 1.13 2001/09/06 02:16:02 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 <stdio.h>
     47 #include <stdlib.h>
     48 #include <string.h>
     49 #define panic(x)	printf("%s\n", (x)), abort()
     50 #endif
     51 
     52 void
     53 ffs_sb_swap(struct fs *o, struct fs *n)
     54 {
     55 	int i, needswap, len;
     56 	u_int32_t *o32, *n32;
     57 	u_int16_t *o16, *n16;
     58 	u_int32_t postbloff, postblfmt;
     59 
     60 	if (o->fs_magic == FS_MAGIC) {
     61 		needswap = 0;
     62 	} else if (o->fs_magic == bswap32(FS_MAGIC)) {
     63 		needswap = 1;
     64 	} else {
     65 		panic("ffs_sb_swap: can't determine magic");
     66 	}
     67 	postbloff = ufs_rw32(o->fs_postbloff, needswap);
     68 	postblfmt = ufs_rw32(o->fs_postblformat, needswap);
     69 
     70 	/*
     71 	 * In order to avoid a lot of lines, as the first 52 fields of
     72 	 * the superblock are u_int32_t, we loop here to convert it.
     73 	 */
     74 	o32 = (u_int32_t *)o;
     75 	n32 = (u_int32_t *)n;
     76 	for (i = 0; i < 52; i++)
     77 		n32[i] = bswap32(o32[i]);
     78 
     79 	n->fs_cpc = bswap32(o->fs_cpc);
     80 	n->fs_avgfilesize = bswap32(o->fs_avgfilesize);
     81 	n->fs_avgfpdir = bswap32(o->fs_avgfpdir);
     82 	n->fs_contigsumsize = bswap32(o->fs_contigsumsize);
     83 	n->fs_maxsymlinklen = bswap32(o->fs_maxsymlinklen);
     84 	n->fs_inodefmt = bswap32(o->fs_inodefmt);
     85 	n->fs_maxfilesize = bswap64(o->fs_maxfilesize);
     86 	n->fs_qbmask = bswap64(o->fs_qbmask);
     87 	n->fs_qfmask = bswap64(o->fs_qfmask);
     88 	n->fs_state = bswap32(o->fs_state);
     89 	n->fs_postblformat = bswap32(o->fs_postblformat);
     90 	n->fs_nrpos = bswap32(o->fs_nrpos);
     91 	n->fs_postbloff = bswap32(o->fs_postbloff);
     92 	n->fs_rotbloff = bswap32(o->fs_rotbloff);
     93 	n->fs_magic = bswap32(o->fs_magic);
     94 	/* byteswap the postbl */
     95 	o16 = (postblfmt == FS_42POSTBLFMT) ? o->fs_opostbl[0] :
     96 	    (int16_t *)((u_int8_t *)o + postbloff);
     97 	n16 = (postblfmt == FS_42POSTBLFMT) ? n->fs_opostbl[0] :
     98 	    (int16_t *)((u_int8_t *)n + postbloff);
     99 	len = postblfmt == FS_42POSTBLFMT ?
    100 	    128 /* fs_opostbl[16][8] */ :
    101 	    ufs_rw32(o->fs_cpc, needswap) * ufs_rw32(o->fs_nrpos, needswap);
    102 	for (i = 0; i < len; i++)
    103 		n16[i] = bswap16(o16[i]);
    104 }
    105 
    106 void
    107 ffs_dinode_swap(struct dinode *o, struct dinode *n)
    108 {
    109 
    110 	n->di_mode = bswap16(o->di_mode);
    111 	n->di_nlink = bswap16(o->di_nlink);
    112 	n->di_u.oldids[0] = bswap16(o->di_u.oldids[0]);
    113 	n->di_u.oldids[1] = bswap16(o->di_u.oldids[1]);
    114 	n->di_size = bswap64(o->di_size);
    115 	n->di_atime = bswap32(o->di_atime);
    116 	n->di_atimensec = bswap32(o->di_atimensec);
    117 	n->di_mtime = bswap32(o->di_mtime);
    118 	n->di_mtimensec = bswap32(o->di_mtimensec);
    119 	n->di_ctime = bswap32(o->di_ctime);
    120 	n->di_ctimensec = bswap32(o->di_ctimensec);
    121 	memcpy(n->di_db, o->di_db, (NDADDR + NIADDR) * sizeof(u_int32_t));
    122 	n->di_flags = bswap32(o->di_flags);
    123 	n->di_blocks = bswap32(o->di_blocks);
    124 	n->di_gen = bswap32(o->di_gen);
    125 	n->di_uid = bswap32(o->di_uid);
    126 	n->di_gid = bswap32(o->di_gid);
    127 }
    128 
    129 void
    130 ffs_csum_swap(struct csum *o, struct csum *n, int size)
    131 {
    132 	int i;
    133 	u_int32_t *oint, *nint;
    134 
    135 	oint = (u_int32_t*)o;
    136 	nint = (u_int32_t*)n;
    137 
    138 	for (i = 0; i < size / sizeof(u_int32_t); i++)
    139 		nint[i] = bswap32(oint[i]);
    140 }
    141