2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public
4 * License v2 as published by the Free Software Foundation.
6 * This program is distributed in the hope that it will be useful,
7 * but WITHOUT ANY WARRANTY; without even the implied warranty of
8 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
9 * General Public License for more details.
11 * You should have received a copy of the GNU General Public
12 * License along with this program; if not, write to the
13 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
14 * Boston, MA 021110-1307, USA.
18 * Defines and function declarations for original mode check.
21 #ifndef __BTRFS_CHECK_ORIGINAL_H__
22 #define __BTRFS_CHECK_ORIGINAL_H__
23 #include "rbtree-utils.h"
25 struct extent_backref {
27 unsigned int is_data:1;
28 unsigned int found_extent_tree:1;
29 unsigned int full_backref:1;
30 unsigned int found_ref:1;
31 unsigned int broken:1;
34 static inline struct extent_backref* rb_node_to_extent_backref(struct rb_node *node)
36 return rb_entry(node, struct extent_backref, node);
40 struct extent_backref node;
54 static inline struct data_backref* to_data_backref(struct extent_backref *back)
56 return container_of(back, struct data_backref, node);
60 * Much like data_backref, just removed the undetermined members
61 * and change it to use list_head.
62 * During extent scan, it is stored in root->orphan_data_extent.
63 * During fs tree scan, it is then moved to inode_rec->orphan_data_extents.
65 struct orphan_data_extent {
66 struct list_head list;
75 struct extent_backref node;
82 static inline struct tree_backref* to_tree_backref(struct extent_backref *back)
84 return container_of(back, struct tree_backref, node);
87 /* Explicit initialization for extent_record::flag_block_full_backref */
88 enum { FLAG_UNSET = 2 };
90 struct extent_record {
91 struct list_head backrefs;
92 struct list_head dups;
93 struct rb_root backref_tree;
94 struct list_head list;
95 struct cache_extent cache;
96 struct btrfs_disk_key parent_key;
101 u64 extent_item_refs;
103 u64 parent_generation;
107 unsigned int flag_block_full_backref:2;
108 unsigned int found_rec:1;
109 unsigned int content_checked:1;
110 unsigned int owner_ref_checked:1;
111 unsigned int is_root:1;
112 unsigned int metadata:1;
113 unsigned int bad_full_backref:1;
114 unsigned int crossing_stripes:1;
115 unsigned int wrong_chunk_type:1;
118 static inline struct extent_record* to_extent_record(struct list_head *entry)
120 return container_of(entry, struct extent_record, list);
123 struct inode_backref {
124 struct list_head list;
125 unsigned int found_dir_item:1;
126 unsigned int found_dir_index:1;
127 unsigned int found_inode_ref:1;
137 static inline struct inode_backref* to_inode_backref(struct list_head *entry)
139 return list_entry(entry, struct inode_backref, list);
142 struct root_item_record {
143 struct list_head list;
149 struct btrfs_key drop_key;
152 #define REF_ERR_NO_DIR_ITEM (1 << 0)
153 #define REF_ERR_NO_DIR_INDEX (1 << 1)
154 #define REF_ERR_NO_INODE_REF (1 << 2)
155 #define REF_ERR_DUP_DIR_ITEM (1 << 3)
156 #define REF_ERR_DUP_DIR_INDEX (1 << 4)
157 #define REF_ERR_DUP_INODE_REF (1 << 5)
158 #define REF_ERR_INDEX_UNMATCH (1 << 6)
159 #define REF_ERR_FILETYPE_UNMATCH (1 << 7)
160 #define REF_ERR_NAME_TOO_LONG (1 << 8) // 100
161 #define REF_ERR_NO_ROOT_REF (1 << 9)
162 #define REF_ERR_NO_ROOT_BACKREF (1 << 10)
163 #define REF_ERR_DUP_ROOT_REF (1 << 11)
164 #define REF_ERR_DUP_ROOT_BACKREF (1 << 12)
166 struct file_extent_hole {
172 #define I_ERR_NO_INODE_ITEM (1 << 0)
173 #define I_ERR_NO_ORPHAN_ITEM (1 << 1)
174 #define I_ERR_DUP_INODE_ITEM (1 << 2)
175 #define I_ERR_DUP_DIR_INDEX (1 << 3)
176 #define I_ERR_ODD_DIR_ITEM (1 << 4)
177 #define I_ERR_ODD_FILE_EXTENT (1 << 5)
178 #define I_ERR_BAD_FILE_EXTENT (1 << 6)
179 #define I_ERR_FILE_EXTENT_OVERLAP (1 << 7)
180 #define I_ERR_FILE_EXTENT_DISCOUNT (1 << 8) // 100
181 #define I_ERR_DIR_ISIZE_WRONG (1 << 9)
182 #define I_ERR_FILE_NBYTES_WRONG (1 << 10) // 400
183 #define I_ERR_ODD_CSUM_ITEM (1 << 11)
184 #define I_ERR_SOME_CSUM_MISSING (1 << 12)
185 #define I_ERR_LINK_COUNT_WRONG (1 << 13)
186 #define I_ERR_FILE_EXTENT_ORPHAN (1 << 14)
188 struct inode_record {
189 struct list_head backrefs;
190 unsigned int checked:1;
191 unsigned int merging:1;
192 unsigned int found_inode_item:1;
193 unsigned int found_dir_item:1;
194 unsigned int found_file_extent:1;
195 unsigned int found_csum_item:1;
196 unsigned int some_csum_missing:1;
197 unsigned int nodatasum:1;
210 struct rb_root holes;
211 struct list_head orphan_extents;
216 struct root_backref {
217 struct list_head list;
218 unsigned int found_dir_item:1;
219 unsigned int found_dir_index:1;
220 unsigned int found_back_ref:1;
221 unsigned int found_forward_ref:1;
222 unsigned int reachable:1;
231 static inline struct root_backref* to_root_backref(struct list_head *entry)
233 return list_entry(entry, struct root_backref, list);
237 struct list_head backrefs;
238 struct cache_extent cache;
239 unsigned int found_root_item:1;
245 struct cache_extent cache;
250 struct cache_extent cache;
251 struct cache_tree root_cache;
252 struct cache_tree inode_cache;
253 struct inode_record *current;
262 struct walk_control {
263 struct cache_tree shared;
264 struct shared_node *nodes[BTRFS_MAX_LEVEL];
270 struct btrfs_key key;
272 struct list_head list;
275 struct extent_entry {
280 struct list_head list;
283 struct root_item_info {
284 /* level of the root */
286 /* number of nodes at this level, must be 1 for a root */
290 struct cache_extent cache_extent;