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