88 lines
2.8 KiB
C
88 lines
2.8 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
*
|
|
* Copyright (c) 2002 Poul-Henning Kamp
|
|
* Copyright (c) 2002 Networks Associates Technology, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This software was developed for the FreeBSD Project by Poul-Henning Kamp
|
|
* and NAI Labs, the Security Research Division of Network Associates, Inc.
|
|
* under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
|
|
* DARPA CHATS research program.
|
|
*
|
|
* 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. The names of the authors may not 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>
|
|
#include <sys/param.h>
|
|
#include <sys/time.h>
|
|
#include <sys/stdint.h>
|
|
|
|
#include <ufs/ufs/dinode.h>
|
|
#include <ufs/ufs/dir.h>
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <err.h>
|
|
#include <string.h>
|
|
|
|
#include "fsck.h"
|
|
|
|
/*
|
|
* Scan each entry in an ea block.
|
|
*/
|
|
int
|
|
eascan(struct inodesc *idesc, struct ufs2_dinode *dp)
|
|
{
|
|
#if 1
|
|
return (0);
|
|
#else
|
|
struct bufarea *bp;
|
|
u_int n;
|
|
u_char *cp;
|
|
long blksiz;
|
|
|
|
printf("Inode %ju extsize %ju\n",
|
|
(intmax_t)idesc->id_number, (uintmax_t)dp->di_extsize);
|
|
if (dp->di_extsize == 0)
|
|
return 0;
|
|
if (dp->di_extsize <= sblock.fs_fsize)
|
|
blksiz = sblock.fs_fsize;
|
|
else
|
|
blksiz = sblock.fs_bsize;
|
|
bp = getdatablk(dp->di_extb[0], blksiz, BT_EXTATTR);
|
|
if (bp->b_errs)
|
|
return (STOP);
|
|
printf("blksiz = %ju\n", (intmax_t)blksiz);
|
|
cp = (u_char *)bp->b_un.b_buf;
|
|
for (n = 0; n < blksiz; n++) {
|
|
printf("%02x", cp[n]);
|
|
if ((n & 31) == 31)
|
|
printf("\n");
|
|
}
|
|
brelse(bp);
|
|
return (STOP);
|
|
#endif
|
|
}
|