Home | History | Annotate | Line # | Download | only in ffs
ffs_bswap.c revision 1.4 
      1 /*	$NetBSD: ffs_bswap.c,v 1.4 1998/06/13 16:26:22 kleink 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 REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  *
     34  */
     35 
     36 #include <sys/param.h>
     37 #include <sys/systm.h>
     38 #include <ufs/ufs/dinode.h>
     39 #include <ufs/ufs/ufs_bswap.h>
     40 #include <ufs/ffs/fs.h>
     41 #include <ufs/ffs/ffs_extern.h>
     42 
     43 void
     44 ffs_sb_swap(o, n, ns)
     45 	struct fs *o, *n;
     46 	int ns;
     47 {
     48 	int i;
     49 	u_int32_t *o32, *n32;
     50 	u_int16_t *o16, *n16;
     51 
     52 	/* in order to avoid a lot of lines, as the first 52 fields of
     53 	 * the superblock are u_int32_t, we loop here to convert it.
     54 	 */
     55 	o32 = (u_int32_t *)o;
     56 	n32 = (u_int32_t *)n;
     57 	for (i=0; i< 52; i++)
     58 		n32[i] = bswap32(o32[i]);
     59 
     60 	n->fs_cpc = bswap32(o->fs_cpc);
     61 	n->fs_fscktime = bswap32(o->fs_fscktime);
     62 	n->fs_contigsumsize = bswap32(o->fs_contigsumsize);
     63 	n->fs_maxsymlinklen = bswap32(o->fs_maxsymlinklen);
     64 	n->fs_inodefmt = bswap32(o->fs_inodefmt);
     65 	n->fs_maxfilesize = bswap64(o->fs_maxfilesize);
     66 	n->fs_qbmask = bswap64(o->fs_qbmask);
     67 	n->fs_qfmask = bswap64(o->fs_qfmask);
     68 	n->fs_state = bswap32(o->fs_state);
     69 	n->fs_postblformat = bswap32(o->fs_postblformat);
     70 	n->fs_nrpos = bswap32(o->fs_nrpos);
     71 	n->fs_postbloff = bswap32(o->fs_postbloff);
     72 	n->fs_rotbloff = bswap32(o->fs_rotbloff);
     73 	n->fs_magic = bswap32(o->fs_magic);
     74 	/* byteswap the postbl */
     75 	o16 = (ufs_rw32(o->fs_postblformat, ns) == FS_42POSTBLFMT)
     76 	    ? o->fs_opostbl[0]
     77 	    : (int16_t *)((u_int8_t *)o + ufs_rw32(o->fs_postbloff, ns));
     78 	n16 = (ufs_rw32(o->fs_postblformat, ns) == FS_42POSTBLFMT)
     79 	    ? n->fs_opostbl[0]
     80 	    : (int16_t *)((u_int8_t *)n + ufs_rw32(n->fs_postbloff, ns));
     81 	for (i = 0;
     82 	     i < ufs_rw32(o->fs_cpc, ns) * ufs_rw32(o->fs_nrpos, ns);
     83 	     i++)
     84 		n16[i] = bswap16(o16[i]);
     85 }
     86 
     87 void
     88 ffs_dinode_swap(o, n)
     89 	struct dinode *o, *n;
     90 {
     91 	n->di_mode = bswap16(o->di_mode);
     92 	n->di_nlink = bswap16(o->di_nlink);
     93 	n->di_u.oldids[0] = bswap16(o->di_u.oldids[0]);
     94 	n->di_u.oldids[1] = bswap16(o->di_u.oldids[1]);
     95 	n->di_size = bswap64(o->di_size);
     96 	n->di_atime = bswap32(o->di_atime);
     97 	n->di_atimensec = bswap32(o->di_atimensec);
     98 	n->di_mtime = bswap32(o->di_mtime);
     99 	n->di_mtimensec = bswap32(o->di_mtimensec);
    100 	n->di_ctime = bswap32(o->di_ctime);
    101 	n->di_ctimensec = bswap32(o->di_ctimensec);
    102 	bcopy(o->di_db, n->di_db, (NDADDR + NIADDR) * sizeof(u_int32_t));
    103 	n->di_flags = bswap32(o->di_flags);
    104 	n->di_blocks = bswap32(o->di_blocks);
    105 	n->di_gen = bswap32(o->di_gen);
    106 	n->di_uid = bswap32(o->di_uid);
    107 	n->di_gid = bswap32(o->di_gid);
    108 }
    109 
    110 void
    111 ffs_csum_swap(o, n, size)
    112 	struct csum *o, *n;
    113 	int size;
    114 {
    115 	int i;
    116 	u_int32_t *oint, *nint;
    117 
    118 	oint = (u_int32_t*)o;
    119 	nint = (u_int32_t*)n;
    120 
    121 	for (i = 0; i < size / sizeof(u_int32_t); i++)
    122 		nint[i] = bswap32(oint[i]);
    123 }
    124