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 code shared by both lowmem and
21 #ifndef __BTRFS_CHECK_COMMON_H__
22 #define __BTRFS_CHECK_COMMON_H__
28 * Use for tree walk to walk through trees whose leaves/nodes can be shared
29 * between different trees. (Namely subvolume/fs trees)
32 u64 bytenr[BTRFS_MAX_LEVEL];
33 u64 refs[BTRFS_MAX_LEVEL];
34 int need_check[BTRFS_MAX_LEVEL];
35 /* field for checking all trees */
36 int checked[BTRFS_MAX_LEVEL];
37 /* the corresponding extent should be marked as full backref or not */
38 int full_backref[BTRFS_MAX_LEVEL];
41 extern u64 bytes_used;
42 extern u64 total_csum_bytes;
43 extern u64 total_btree_bytes;
44 extern u64 total_fs_tree_bytes;
45 extern u64 total_extent_tree_bytes;
46 extern u64 btree_space_waste;
47 extern u64 data_bytes_allocated;
48 extern u64 data_bytes_referenced;
49 extern struct list_head duplicate_extents;
50 extern struct list_head delete_items;
52 extern int init_extent_tree;
53 extern int check_data_csum;
54 extern struct btrfs_fs_info *global_info;
55 extern struct task_ctx ctx;
56 extern struct cache_tree *roots_info_cache;
58 static inline u8 imode_to_type(u32 imode)
61 static unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
62 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
63 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
64 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
65 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
66 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
67 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
68 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
71 return btrfs_type_by_mode[(imode & S_IFMT) >> S_SHIFT];
75 static inline int fs_root_objectid(u64 objectid)
77 if (objectid == BTRFS_TREE_RELOC_OBJECTID ||
78 objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
80 return is_fstree(objectid);
83 int count_csum_range(struct btrfs_fs_info *fs_info, u64 start,
85 int insert_inode_item(struct btrfs_trans_handle *trans,
86 struct btrfs_root *root, u64 ino, u64 size,
87 u64 nbytes, u64 nlink, u32 mode);
88 int link_inode_to_lostfound(struct btrfs_trans_handle *trans,
89 struct btrfs_root *root,
90 struct btrfs_path *path,
91 u64 ino, char *namebuf, u32 name_len,
92 u8 filetype, u64 *ref_count);
93 void check_dev_size_alignment(u64 devid, u64 total_bytes, u32 sectorsize);
94 void reada_walk_down(struct btrfs_root *root, struct extent_buffer *node,
96 int check_child_node(struct extent_buffer *parent, int slot,
97 struct extent_buffer *child);