/*
* Copyright (c) 2000-2002 Silicon Graphics, Inc. All Rights Reserved.
- *
+ *
* This program is free software; you can redistribute it and/or modify it
* under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
- *
+ *
* This program is distributed in the hope that it would be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
- *
+ *
* Further, this software is distributed without any warranty that it is
* free of the rightful claim of any third person regarding infringement
* or the like. Any license provided herein, whether implied or
* otherwise, applies only to this software file. Patent licenses, if
* any, provided herein do not apply to combinations of this program with
* other software, or any other product whatsoever.
- *
+ *
* You should have received a copy of the GNU General Public License along
* with this program; if not, write the Free Software Foundation, Inc., 59
* Temple Place - Suite 330, Boston MA 02111-1307, USA.
- *
+ *
* Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
* Mountain View, CA 94043, or:
- *
- * http://www.sgi.com
- *
- * For further information regarding this notice, see:
- *
+ *
+ * http://www.sgi.com
+ *
+ * For further information regarding this notice, see:
+ *
* http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
*/
for (i = 0; i < XFS_DIR_LEAF_MAPSIZE; i++) {
if (holes->hentries[i].size == 0)
continue;
-
+
start = holes->hentries[i].base;
len = holes->hentries[i].size;
if (holemap->hentries[i].base ==
block_hmap->hentries[k].base
&& holemap->hentries[i].size ==
- block_hmap->hentries[k].size)
+ block_hmap->hentries[k].size)
found = 1;
}
if (!found) {
traverse_int_dablock(xfs_mount_t *mp,
da_bt_cursor_t *da_cursor,
xfs_dablk_t *rbno,
- int whichfork)
+ int whichfork)
{
xfs_dablk_t bno;
int i;
if (INT_GET(node->hdr.level, ARCH_CONVERT) == i - 1) {
i--;
} else {
- if (whichfork == XFS_DATA_FORK)
+ if (whichfork == XFS_DATA_FORK)
do_warn(_("bad directory btree for "
"directory inode %llu\n"),
da_cursor->ino);
* walk down left side of btree, release buffers as you
* go. if the root block is a leaf (single-level btree),
* just return it.
- *
+ *
*/
bp = libxfs_readbuf(mp->m_dev, XFS_FSB_TO_DADDR(mp, fsbno),
* validating it. bno value should be ok since
* it was set when the block was first read in.
*/
- cursor->level[this_level].hashval =
+ cursor->level[this_level].hashval =
INT_GET(node->btree[entry - 1].hashval, ARCH_CONVERT);
/*
xfs_mount_t *mp,
xfs_dir_leafblock_t *leaf,
xfs_dablk_t da_bno,
- xfs_ino_t ino,
+ xfs_ino_t ino,
xfs_dahash_t last_hashval, /* last hashval encountered */
int ino_discovery,
blkmap_t *blkmap,
ino);
}
}
-
+
/*
* now we can mark entries with NULLFSINO's bad
*/
for (i = 0; i < XFS_DIR_LEAF_MAPSIZE; i++) {
do_warn(
"- (%d, %d) ", bholemap.hentries[i].base,
- bholemap.hentries[i].size);
+ bholemap.hentries[i].size);
}
do_warn(_("- holes flag = %d\n"), bholemap.lost_holes);
}
if (INT_GET(dip->di_core.di_size, ARCH_CONVERT) <
(da_cursor.greatest_bno + 1) * mp->m_sb.sb_blocksize) {
if ((xfs_fsize_t) (da_cursor.greatest_bno
- * mp->m_sb.sb_blocksize) > UINT_MAX) {
+ * mp->m_sb.sb_blocksize) > UINT_MAX) {
do_warn(
_("out of range internal directory block numbers (inode %llu)\n"),
ino);
do_warn(_("no .. entry for root directory %llu\n"), ino);
need_root_dotdot = 1;
}
-
+
#ifdef XR_DIR_TRACE
fprintf(stderr, "(process_dir), parent of %llu is %llu\n", ino, parent);
#endif