NetBSD/sbin/fsck_ffs/utilities.c

673 lines
15 KiB
C
Raw Normal View History

/* $NetBSD: utilities.c,v 1.25 1998/05/06 02:45:09 mycroft Exp $ */
1995-04-23 14:33:03 +04:00
1993-03-21 12:45:37 +03:00
/*
* Copyright (c) 1980, 1986, 1993
* The Regents of the University of California. All rights reserved.
1993-03-21 12:45:37 +03:00
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
1993-03-21 12:45:37 +03:00
#ifndef lint
#if 0
1997-09-16 20:44:43 +04:00
static char sccsid[] = "@(#)utilities.c 8.6 (Berkeley) 5/19/95";
#else
__RCSID("$NetBSD: utilities.c,v 1.25 1998/05/06 02:45:09 mycroft Exp $");
#endif
1993-03-21 12:45:37 +03:00
#endif /* not lint */
#include <sys/param.h>
1994-04-25 22:28:42 +04:00
#include <sys/time.h>
1997-09-16 20:44:43 +04:00
#include <ufs/ufs/dinode.h>
#include <ufs/ufs/dir.h>
#include <ufs/ffs/fs.h>
#include <ufs/ffs/ffs_extern.h>
1997-09-16 20:44:43 +04:00
1993-03-21 12:45:37 +03:00
#include <ctype.h>
1997-09-16 20:44:43 +04:00
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
1997-09-16 20:44:43 +04:00
#include <string.h>
#include <unistd.h>
1996-09-28 02:45:10 +04:00
#include "fsutil.h"
1993-03-21 12:45:37 +03:00
#include "fsck.h"
#include "extern.h"
1993-03-21 12:45:37 +03:00
long diskreads, totalreads; /* Disk cache statistics */
1997-09-16 20:44:43 +04:00
static void rwerror __P((char *, ufs_daddr_t));
int
1993-03-21 12:45:37 +03:00
ftypeok(dp)
struct dinode *dp;
{
switch (iswap16(dp->di_mode) & IFMT) {
1993-03-21 12:45:37 +03:00
case IFDIR:
case IFREG:
case IFBLK:
case IFCHR:
case IFLNK:
case IFSOCK:
case IFIFO:
return (1);
default:
if (debug)
printf("bad file type 0%o\n", iswap16(dp->di_mode));
1993-03-21 12:45:37 +03:00
return (0);
}
}
int
1993-03-21 12:45:37 +03:00
reply(question)
char *question;
{
int persevere;
char c;
if (preen)
pfatal("INTERNAL ERROR: GOT TO reply()");
persevere = !strcmp(question, "CONTINUE");
printf("\n");
if (!persevere && (nflag || fswritefd < 0)) {
printf("%s? no\n\n", question);
return (0);
}
if (yflag || (persevere && nflag)) {
printf("%s? yes\n\n", question);
return (1);
}
do {
printf("%s? [yn] ", question);
(void) fflush(stdout);
c = getc(stdin);
while (c != '\n' && getc(stdin) != '\n')
if (feof(stdin))
return (0);
} while (c != 'y' && c != 'Y' && c != 'n' && c != 'N');
printf("\n");
if (c == 'y' || c == 'Y')
return (1);
return (0);
}
/*
* Malloc buffers and set up cache.
*/
void
1993-03-21 12:45:37 +03:00
bufinit()
{
struct bufarea *bp;
1993-03-21 12:45:37 +03:00
long bufcnt, i;
char *bufp;
pbp = pdirbp = (struct bufarea *)0;
bufp = malloc((unsigned int)sblock->fs_bsize);
1993-03-21 12:45:37 +03:00
if (bufp == 0)
1997-09-16 20:44:43 +04:00
errx(EEXIT, "cannot allocate buffer pool");
1993-03-21 12:45:37 +03:00
cgblk.b_un.b_buf = bufp;
initbarea(&cgblk);
bufhead.b_next = bufhead.b_prev = &bufhead;
bufcnt = MAXBUFSPACE / sblock->fs_bsize;
1993-03-21 12:45:37 +03:00
if (bufcnt < MINBUFS)
bufcnt = MINBUFS;
for (i = 0; i < bufcnt; i++) {
bp = (struct bufarea *)malloc(sizeof(struct bufarea));
bufp = malloc((unsigned int)sblock->fs_bsize);
1993-03-21 12:45:37 +03:00
if (bp == NULL || bufp == NULL) {
if (i >= MINBUFS)
break;
1997-09-16 20:44:43 +04:00
errx(EEXIT, "cannot allocate buffer pool");
1993-03-21 12:45:37 +03:00
}
bp->b_un.b_buf = bufp;
bp->b_prev = &bufhead;
bp->b_next = bufhead.b_next;
bufhead.b_next->b_prev = bp;
bufhead.b_next = bp;
initbarea(bp);
}
bufhead.b_size = i; /* save number of buffers */
}
/*
* Manage a cache of directory blocks.
*/
struct bufarea *
getdatablk(blkno, size)
1997-09-16 20:44:43 +04:00
ufs_daddr_t blkno;
1993-03-21 12:45:37 +03:00
long size;
{
struct bufarea *bp;
1993-03-21 12:45:37 +03:00
for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next)
if (bp->b_bno == fsbtodb(sblock, blkno))
1993-03-21 12:45:37 +03:00
goto foundit;
for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev)
if ((bp->b_flags & B_INUSE) == 0)
break;
if (bp == &bufhead)
1997-09-16 20:44:43 +04:00
errx(EEXIT, "deadlocked buffer pool");
1993-03-21 12:45:37 +03:00
getblk(bp, blkno, size);
/* fall through */
foundit:
totalreads++;
bp->b_prev->b_next = bp->b_next;
bp->b_next->b_prev = bp->b_prev;
bp->b_prev = &bufhead;
bp->b_next = bufhead.b_next;
bufhead.b_next->b_prev = bp;
bufhead.b_next = bp;
bp->b_flags |= B_INUSE;
return (bp);
}
void
getblk(bp, blk, size)
struct bufarea *bp;
1997-09-16 20:44:43 +04:00
ufs_daddr_t blk;
1993-03-21 12:45:37 +03:00
long size;
{
1997-09-16 20:44:43 +04:00
ufs_daddr_t dblk;
1993-03-21 12:45:37 +03:00
dblk = fsbtodb(sblock, blk);
1993-03-21 12:45:37 +03:00
if (bp->b_bno != dblk) {
flush(fswritefd, bp);
diskreads++;
bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size);
bp->b_bno = dblk;
bp->b_size = size;
}
}
void
1993-03-21 12:45:37 +03:00
flush(fd, bp)
int fd;
struct bufarea *bp;
1993-03-21 12:45:37 +03:00
{
int i, j;
1993-03-21 12:45:37 +03:00
if (!bp->b_dirty)
return;
if (bp->b_errs != 0)
pfatal("WRITING %sZERO'ED BLOCK %d TO DISK\n",
(bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ",
bp->b_bno);
bp->b_dirty = 0;
bp->b_errs = 0;
bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size);
if (bp != &sblk)
return;
for (i = 0, j = 0; i < sblock->fs_cssize; i += sblock->fs_bsize, j++) {
int size = sblock->fs_cssize - i < sblock->fs_bsize ?
sblock->fs_cssize - i : sblock->fs_bsize;
/*
* The following routines assumes that struct csum is made of
* u_int32_t's
*/
if (needswap) {
u_int32_t *cd = (u_int32_t *)sblock->fs_csp[j];
int k;
for (k = 0; k < size / sizeof(u_int32_t); k++)
cd[k] = bswap32(cd[k]);
}
bwrite(fswritefd, (char *)sblock->fs_csp[j],
fsbtodb(sblock, sblock->fs_csaddr + j * sblock->fs_frag),
sblock->fs_cssize - i < sblock->fs_bsize ?
sblock->fs_cssize - i : sblock->fs_bsize);
if (needswap) {
u_int32_t *cd = (u_int32_t *)sblock->fs_csp[j];
int k;
for (k = 0; k < size / sizeof(u_int32_t); k++)
cd[k] = bswap32(cd[k]);
}
1993-03-21 12:45:37 +03:00
}
}
static void
1993-03-21 12:45:37 +03:00
rwerror(mesg, blk)
char *mesg;
1997-09-16 20:44:43 +04:00
ufs_daddr_t blk;
1993-03-21 12:45:37 +03:00
{
if (preen == 0)
printf("\n");
pfatal("CANNOT %s: BLK %d", mesg, blk);
1993-03-21 12:45:37 +03:00
if (reply("CONTINUE") == 0)
1997-09-16 20:44:43 +04:00
exit(EEXIT);
1993-03-21 12:45:37 +03:00
}
void
ckfini()
1993-03-21 12:45:37 +03:00
{
struct bufarea *bp, *nbp;
1997-09-16 20:44:43 +04:00
int ofsmodified, cnt = 0;
1993-03-21 12:45:37 +03:00
if (fswritefd < 0) {
(void)close(fsreadfd);
return;
}
1993-03-21 12:45:37 +03:00
flush(fswritefd, &sblk);
if (havesb && sblk.b_bno != SBOFF / dev_bsize &&
!preen && reply("UPDATE STANDARD SUPERBLOCK")) {
sblk.b_bno = SBOFF / dev_bsize;
sbdirty();
flush(fswritefd, &sblk);
}
flush(fswritefd, &cgblk);
free(cgblk.b_un.b_buf);
for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
1993-03-21 12:45:37 +03:00
cnt++;
flush(fswritefd, bp);
nbp = bp->b_prev;
free(bp->b_un.b_buf);
free((char *)bp);
}
if (bufhead.b_size != cnt)
1997-09-16 20:44:43 +04:00
errx(EEXIT, "Panic: lost %d buffers", bufhead.b_size - cnt);
1993-03-21 12:45:37 +03:00
pbp = pdirbp = (struct bufarea *)0;
if (markclean && (sblock->fs_clean & FS_ISCLEAN) == 0) {
/*
* Mark the file system as clean, and sync the superblock.
*/
if (preen)
pwarn("MARKING FILE SYSTEM CLEAN\n");
else if (!reply("MARK FILE SYSTEM CLEAN"))
markclean = 0;
if (markclean) {
sblock->fs_clean = FS_ISCLEAN;
sbdirty();
1997-09-16 20:44:43 +04:00
ofsmodified = fsmodified;
flush(fswritefd, &sblk);
#if LITE2BORKEN
1997-09-16 20:44:43 +04:00
fsmodified = ofsmodified;
#endif
1997-09-16 20:44:43 +04:00
if (!preen)
printf(
"\n***** FILE SYSTEM MARKED CLEAN *****\n");
}
}
1993-03-21 12:45:37 +03:00
if (debug)
printf("cache missed %ld of %ld (%d%%)\n", diskreads,
totalreads, (int)(diskreads * 100 / totalreads));
(void)close(fsreadfd);
(void)close(fswritefd);
}
int
1993-03-21 12:45:37 +03:00
bread(fd, buf, blk, size)
int fd;
char *buf;
1997-09-16 20:44:43 +04:00
ufs_daddr_t blk;
1993-03-21 12:45:37 +03:00
long size;
{
char *cp;
int i, errs;
off_t offset;
1993-03-21 12:45:37 +03:00
offset = blk;
offset *= dev_bsize;
if (lseek(fd, offset, 0) < 0)
1993-03-21 12:45:37 +03:00
rwerror("SEEK", blk);
else if (read(fd, buf, (int)size) == size)
return (0);
rwerror("READ", blk);
if (lseek(fd, offset, 0) < 0)
1993-03-21 12:45:37 +03:00
rwerror("SEEK", blk);
errs = 0;
memset(buf, 0, (size_t)size);
1993-03-21 12:45:37 +03:00
printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
if (read(fd, cp, (int)secsize) != secsize) {
(void)lseek(fd, offset + i + secsize, 0);
1993-03-21 12:45:37 +03:00
if (secsize != dev_bsize && dev_bsize != 1)
printf(" %ld (%ld),",
(blk * dev_bsize + i) / secsize,
blk + i / dev_bsize);
else
printf(" %ld,", blk + i / dev_bsize);
errs++;
}
}
printf("\n");
return (errs);
}
void
1993-03-21 12:45:37 +03:00
bwrite(fd, buf, blk, size)
int fd;
char *buf;
1997-09-16 20:44:43 +04:00
ufs_daddr_t blk;
1993-03-21 12:45:37 +03:00
long size;
{
int i;
char *cp;
off_t offset;
1993-03-21 12:45:37 +03:00
if (fd < 0)
return;
offset = blk;
offset *= dev_bsize;
if (lseek(fd, offset, 0) < 0)
1993-03-21 12:45:37 +03:00
rwerror("SEEK", blk);
else if (write(fd, buf, (int)size) == size) {
fsmodified = 1;
return;
}
rwerror("WRITE", blk);
if (lseek(fd, offset, 0) < 0)
1993-03-21 12:45:37 +03:00
rwerror("SEEK", blk);
printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
if (write(fd, cp, (int)dev_bsize) != dev_bsize) {
(void)lseek(fd, offset + i + dev_bsize, 0);
1993-03-21 12:45:37 +03:00
printf(" %ld,", blk + i / dev_bsize);
}
printf("\n");
return;
}
/*
* allocate a data block with the specified number of fragments
*/
1997-09-16 20:44:43 +04:00
ufs_daddr_t
1993-03-21 12:45:37 +03:00
allocblk(frags)
long frags;
{
int i, j, k;
1993-03-21 12:45:37 +03:00
if (frags <= 0 || frags > sblock->fs_frag)
1993-03-21 12:45:37 +03:00
return (0);
for (i = 0; i < maxfsblock - sblock->fs_frag; i += sblock->fs_frag) {
for (j = 0; j <= sblock->fs_frag - frags; j++) {
1993-03-21 12:45:37 +03:00
if (testbmap(i + j))
continue;
for (k = 1; k < frags; k++)
if (testbmap(i + j + k))
break;
if (k < frags) {
j += k;
continue;
}
for (k = 0; k < frags; k++)
setbmap(i + j + k);
n_blks += frags;
return (i + j);
}
}
return (0);
}
/*
* Free a previously allocated block
*/
void
1993-03-21 12:45:37 +03:00
freeblk(blkno, frags)
1997-09-16 20:44:43 +04:00
ufs_daddr_t blkno;
1993-03-21 12:45:37 +03:00
long frags;
{
struct inodesc idesc;
idesc.id_blkno = blkno;
idesc.id_numfrags = frags;
(void)pass4check(&idesc);
}
/*
* Find a pathname
*/
void
1993-03-21 12:45:37 +03:00
getpathname(namebuf, curdir, ino)
char *namebuf;
ino_t curdir, ino;
{
int len;
char *cp;
1993-03-21 12:45:37 +03:00
struct inodesc idesc;
static int busy = 0;
if (curdir == ino && ino == ROOTINO) {
(void)strcpy(namebuf, "/");
return;
}
1993-03-21 12:45:37 +03:00
if (busy ||
(statemap[curdir] != DSTATE && statemap[curdir] != DFOUND)) {
(void)strcpy(namebuf, "?");
return;
}
busy = 1;
memset(&idesc, 0, sizeof(struct inodesc));
1993-03-21 12:45:37 +03:00
idesc.id_type = DATA;
idesc.id_fix = IGNORE;
cp = &namebuf[MAXPATHLEN - 1];
*cp = '\0';
if (curdir != ino) {
idesc.id_parent = curdir;
goto namelookup;
}
while (ino != ROOTINO) {
idesc.id_number = ino;
idesc.id_func = findino;
idesc.id_name = "..";
if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
break;
namelookup:
idesc.id_number = idesc.id_parent;
idesc.id_parent = ino;
idesc.id_func = findname;
idesc.id_name = namebuf;
if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
break;
len = strlen(namebuf);
cp -= len;
1997-09-16 20:44:43 +04:00
memmove(cp, namebuf, (size_t)len);
1993-03-21 12:45:37 +03:00
*--cp = '/';
if (cp < &namebuf[MAXNAMLEN])
break;
ino = idesc.id_number;
}
busy = 0;
if (ino != ROOTINO)
*--cp = '?';
1997-09-16 20:44:43 +04:00
memmove(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
1993-03-21 12:45:37 +03:00
}
void
1997-09-16 20:44:43 +04:00
catch(sig)
int sig;
1993-03-21 12:45:37 +03:00
{
if (!doinglevel2) {
markclean = 0;
ckfini();
}
1993-03-21 12:45:37 +03:00
exit(12);
}
/*
* When preening, allow a single quit to signal
* a special exit after filesystem checks complete
* so that reboot sequence may be interrupted.
*/
void
1997-09-16 20:44:43 +04:00
catchquit(sig)
int sig;
1993-03-21 12:45:37 +03:00
{
1998-03-30 06:07:59 +04:00
extern int returntosingle;
1993-03-21 12:45:37 +03:00
printf("returning to single-user after filesystem check\n");
returntosingle = 1;
(void)signal(SIGQUIT, SIG_DFL);
}
/*
* Ignore a single quit signal; wait and flush just in case.
* Used by child processes in preen.
*/
void
1997-09-16 20:44:43 +04:00
voidquit(sig)
int sig;
1993-03-21 12:45:37 +03:00
{
sleep(1);
(void)signal(SIGQUIT, SIG_IGN);
(void)signal(SIGQUIT, SIG_DFL);
}
/*
* determine whether an inode should be fixed.
*/
int
1993-03-21 12:45:37 +03:00
dofix(idesc, msg)
struct inodesc *idesc;
1993-03-21 12:45:37 +03:00
char *msg;
{
switch (idesc->id_fix) {
case DONTKNOW:
if (idesc->id_type == DATA)
direrror(idesc->id_number, msg);
else
pwarn(msg);
if (preen) {
printf(" (SALVAGED)\n");
idesc->id_fix = FIX;
return (ALTERED);
}
if (reply("SALVAGE") == 0) {
idesc->id_fix = NOFIX;
return (0);
}
idesc->id_fix = FIX;
return (ALTERED);
case FIX:
return (ALTERED);
case NOFIX:
case IGNORE:
return (0);
default:
1997-09-16 20:44:43 +04:00
errx(EEXIT, "UNKNOWN INODESC FIX MODE %d", idesc->id_fix);
1993-03-21 12:45:37 +03:00
}
/* NOTREACHED */
1997-09-16 20:44:43 +04:00
return (0);
1993-03-21 12:45:37 +03:00
}
void
copyback_cg(blk)
struct bufarea *blk;
{
memcpy(blk->b_un.b_cg, cgrp, sblock->fs_cgsize);
if (needswap)
swap_cg(cgrp, blk->b_un.b_cg);
}
void
swap_cg(o, n)
struct cg *o, *n;
{
int i;
u_int32_t *n32, *o32;
u_int16_t *n16, *o16;
n->cg_firstfield = bswap32(o->cg_firstfield);
n->cg_magic = bswap32(o->cg_magic);
n->cg_time = bswap32(o->cg_time);
n->cg_cgx = bswap32(o->cg_cgx);
n->cg_ncyl = bswap16(o->cg_ncyl);
n->cg_niblk = bswap16(o->cg_niblk);
n->cg_ndblk = bswap32(o->cg_ndblk);
n->cg_cs.cs_ndir = bswap32(o->cg_cs.cs_ndir);
n->cg_cs.cs_nbfree = bswap32(o->cg_cs.cs_nbfree);
n->cg_cs.cs_nifree = bswap32(o->cg_cs.cs_nifree);
n->cg_cs.cs_nffree = bswap32(o->cg_cs.cs_nffree);
n->cg_rotor = bswap32(o->cg_rotor);
n->cg_frotor = bswap32(o->cg_frotor);
n->cg_irotor = bswap32(o->cg_irotor);
n->cg_btotoff = bswap32(o->cg_btotoff);
n->cg_boff = bswap32(o->cg_boff);
n->cg_iusedoff = bswap32(o->cg_iusedoff);
n->cg_freeoff = bswap32(o->cg_freeoff);
n->cg_nextfreeoff = bswap32(o->cg_nextfreeoff);
n->cg_clustersumoff = bswap32(o->cg_clustersumoff);
n->cg_clusteroff = bswap32(o->cg_clusteroff);
n->cg_nclusterblks = bswap32(o->cg_nclusterblks);
for (i=0; i < MAXFRAG; i++)
n->cg_frsum[i] = bswap32(o->cg_frsum[i]);
if (sblock->fs_postblformat == FS_42POSTBLFMT) { /* old format */
struct ocg *on, *oo;
int j;
on = (struct ocg *)n;
oo = (struct ocg *)o;
for(i = 0; i < 8; i++) {
on->cg_frsum[i] = bswap32(oo->cg_frsum[i]);
}
for(i = 0; i < 32; i++) {
on->cg_btot[i] = bswap32(oo->cg_btot[i]);
for (j = 0; j < 8; j++)
on->cg_b[i][j] = bswap16(oo->cg_b[i][j]);
}
memmove(on->cg_iused, oo->cg_iused, 256);
on->cg_magic = bswap32(oo->cg_magic);
} else { /* new format */
if (n->cg_magic == CG_MAGIC) {
n32 = (u_int32_t*)((u_int8_t*)n + n->cg_btotoff);
o32 = (u_int32_t*)((u_int8_t*)o + n->cg_btotoff);
n16 = (u_int16_t*)((u_int8_t*)n + n->cg_boff);
o16 = (u_int16_t*)((u_int8_t*)o + n->cg_boff);
} else {
n32 = (u_int32_t*)((u_int8_t*)n + o->cg_btotoff);
o32 = (u_int32_t*)((u_int8_t*)o + o->cg_btotoff);
n16 = (u_int16_t*)((u_int8_t*)n + o->cg_boff);
o16 = (u_int16_t*)((u_int8_t*)o + o->cg_boff);
}
for (i=0; i < sblock->fs_cpg; i++)
n32[i] = bswap32(o32[i]);
for (i=0; i < sblock->fs_cpg * sblock->fs_nrpos; i++)
n16[i] = bswap16(o16[i]);
if (n->cg_magic == CG_MAGIC) {
n32 = (u_int32_t*)((u_int8_t*)n + n->cg_clustersumoff);
o32 = (u_int32_t*)((u_int8_t*)o + n->cg_clustersumoff);
} else {
n32 = (u_int32_t*)((u_int8_t*)n + o->cg_clustersumoff);
o32 = (u_int32_t*)((u_int8_t*)o + o->cg_clustersumoff);
}
for (i = 0; i < sblock->fs_contigsumsize + 1; i++)
n32[i] = bswap32(o32[i]);
}
}