Aren
/
NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
NetBSD/sbin/fsck_ffs/extern.h

82 lines
3.3 KiB
C
Raw Normal View History

remove redundant declarations
2001-02-05 00:25:54 +03:00
/* $NetBSD: extern.h,v 1.13 2001/02/04 21:25:54 christos Exp $ */
convert to new RCS Id conventions; reduce my headache
1995-03-18 17:54:19 +03:00
more cleanups from Jim Jegers, passed over by me.
1994-12-05 23:15:31 +03:00
/*
adjust; from jimj.
1994-12-06 22:13:02 +03:00
* Copyright (c) 1994 James A. Jegers
more cleanups from Jim Jegers, passed over by me.
1994-12-05 23:15:31 +03:00
* All rights reserved.
*
* 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.
adjust; from jimj.
1994-12-06 22:13:02 +03:00
* 2. The name of the author may not be used to endorse or promote products
more cleanups from Jim Jegers, passed over by me.
1994-12-05 23:15:31 +03:00
* derived from this software without specific prior written permission
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
void adjust __P((struct inodesc *, int));
ufs_daddr_t allocblk __P((long));
ino_t allocdir __P((ino_t, ino_t, int));
ino_t allocino __P((ino_t request, int type));
void blkerror __P((ino_t, char *, ufs_daddr_t));
int bread __P((int, char *, ufs_daddr_t, long));
void bufinit __P((void));
void bwrite __P((int, char *, ufs_daddr_t, long));
void cacheino __P((struct dinode *, ino_t));
void catch __P((int));
void catchquit __P((int));
int changeino __P((ino_t, char *, ino_t));
int chkrange __P((ufs_daddr_t, int));
Add support for non-native byteorder FFS, and converting byteorder. Also, be a bit more conservative with the clean flag: don't mark the FS clean when we know there may still be errors (user anserwed 'n' to a question, or fsck says "you must rerun fsck").
1998-03-18 20:01:23 +03:00
void ckfini __P((void));
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
int ckinode __P((struct dinode *, struct inodesc *));
void clri __P((struct inodesc *, char *, int));
In pass 5, check alternate superblocks for consistency with the current in-core master superblock, and fix them up if they're incorrect. Move the code that writes the alternate superblocks if (cvtlevel || doswap) into pass 5 for efficiency. Reviewd by Charles Hannum, and used by me to fix up a curdled file system.
2001-01-26 20:37:16 +03:00
int cmpsblks __P((const struct fs *, struct fs *));
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
struct dinode * getnextinode __P((ino_t));
void direrror __P((ino_t, char *));
int dirscan __P((struct inodesc *));
int dofix __P((struct inodesc *, char *));
void fileerror __P((ino_t, ino_t, char *));
int findino __P((struct inodesc *));
int findname __P((struct inodesc *));
void flush __P((int, struct bufarea *));
void freeblk __P((ufs_daddr_t, long));
void freeino __P((ino_t));
void freeinodebuf __P((void));
int ftypeok __P((struct dinode *));
remove redundant declarations
2001-02-05 00:25:54 +03:00
void getblk __P((struct bufarea *, ufs_daddr_t, long));
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
struct bufarea *getdatablk __P((ufs_daddr_t, long));
struct inoinfo *getinoinfo __P((ino_t));
struct dinode *ginode __P((ino_t));
void getpathname __P((char *, ino_t, ino_t));
void inocleanup __P((void));
void inodirty __P((void));
int linkup __P((ino_t, ino_t));
int makeentry __P((ino_t, ino_t, char *));
void pass1 __P((void));
void pass1b __P((void));
int pass1check __P((struct inodesc *));
void pass2 __P((void));
void pass3 __P((void));
void pass4 __P((void));
int pass4check __P((struct inodesc *));
void pass5 __P((void));
void pinode __P((ino_t));
The reconnect algorithm was historically O(n^4). Some years ago I made it O(n^2). Someone helpfully made it O(n^4) again. Today I'm making it O(n). If that's not good enough, I don't know what else to do. B-) Technical details: * The graph traversal in propagate() is modified to be able to start from any point in the tree. To handle certain exceptional cases, it is also modified to work in two passes, marking the tree with a special tag and then changing it to DFOUND. * The reconnect case now modifies the child/sibling pointers and calls propagate() to propagate the connection state starting with the reconnected directory. Pray that you never encounter a file system trashed enough for this to matter.
2001-01-09 08:51:14 +03:00
void propagate __P((ino_t));
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
int reply __P((char *));
void resetinodebuf __P((void));
const poisoning.
1998-07-27 00:32:42 +04:00
int setup __P((const char *));
resolve conflicts from lite-2 merge.
1997-09-16 20:44:43 +04:00
void voidquit __P((int));
Add support for non-native byteorder FFS, and converting byteorder. Also, be a bit more conservative with the clean flag: don't mark the FS clean when we know there may still be errors (user anserwed 'n' to a question, or fsck says "you must rerun fsck").
1998-03-18 20:01:23 +03:00
void swap_cg __P((struct cg *, struct cg *));
void copyback_cg __P((struct bufarea *));