1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/*
* Copyright (c) 2000-2001 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://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
*/
#ifndef _XR_DIR2_H
#define _XR_DIR2_H
struct blkmap;
struct bmap_ext;
/*
* the cursor gets passed up and down the da btree processing
* routines. The interior block processing routines use the
* cursor to determine if the pointers to and from the preceding
* and succeeding sibling blocks are ok and whether the values in
* the current block are consistent with the entries in the parent
* nodes. When a block is traversed, a parent-verification routine
* is called to verify if the next logical entry in the next level up
* is consistent with the greatest hashval in the next block of the
* current level. The verification routine is itself recursive and
* calls itself if it has to traverse an interior block to get
* the next logical entry. The routine recurses upwards through
* the tree until it finds a block where it can simply step to
* the next entry. The hashval in that entry should be equal to
* the hashval being passed to it (the greatest hashval in the block
* that the entry points to). If that isn't true, then the tree
* is blown and we need to trash it, salvage and trash it, or fix it.
* Currently, we just trash it.
*/
typedef struct dir2_level_state {
xfs_dabuf_t *bp; /* block bp */
xfs_dablk_t bno; /* file block number */
xfs_dahash_t hashval; /* last verified hashval */
int index; /* current index in block */
int dirty; /* is buffer dirty ? (1 == yes) */
} dir2_level_state_t;
typedef struct dir2_bt_cursor {
int active; /* highest level in tree (# levels-1) */
int type; /* 0 if dir, 1 if attr */
xfs_ino_t ino;
xfs_dablk_t greatest_bno;
xfs_dinode_t *dip;
dir2_level_state_t level[XFS_DA_NODE_MAXDEPTH];
struct blkmap *blkmap;
} dir2_bt_cursor_t;
/* ROUTINES */
void
err_release_dir2_cursor(
xfs_mount_t *mp,
dir2_bt_cursor_t *cursor,
int prev_level);
xfs_dabuf_t *
da_read_buf(
xfs_mount_t *mp,
int nex,
struct bmap_ext *bmp);
int
da_bwrite(
xfs_mount_t *mp,
xfs_dabuf_t *bp);
void
da_brelse(
xfs_dabuf_t *bp);
int
process_dir2(
xfs_mount_t *mp,
xfs_ino_t ino,
xfs_dinode_t *dip,
int ino_discovery,
int *dirty,
char *dirname,
xfs_ino_t *parent,
struct blkmap *blkmap);
void
process_sf_dir2_fixi8(
xfs_dir2_sf_t *sfp,
xfs_dir2_sf_entry_t **next_sfep);
void
dir2_add_badlist(
xfs_ino_t ino);
int
dir2_is_badino(
xfs_ino_t ino);
#endif /* _XR_DIR2_H */
|