btrfs_inode.h 5.2 KB
Newer Older
C
Chris Mason 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * Copyright (C) 2007 Oracle.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */

C
Chris Mason 已提交
19 20 21
#ifndef __BTRFS_I__
#define __BTRFS_I__

22
#include "extent_map.h"
23
#include "extent_io.h"
24
#include "ordered-data.h"
25
#include "delayed-inode.h"
26

A
Aneesh 已提交
27
/* in memory btrfs inode */
C
Chris Mason 已提交
28
struct btrfs_inode {
C
Chris Mason 已提交
29
	/* which subvolume this inode belongs to */
30
	struct btrfs_root *root;
C
Chris Mason 已提交
31 32 33 34

	/* key used to find this inode on disk.  This is used by the code
	 * to read in roots of subvolumes
	 */
35
	struct btrfs_key location;
C
Chris Mason 已提交
36

37 38 39
	/* Lock for counters */
	spinlock_t lock;

C
Chris Mason 已提交
40
	/* the extent_tree has caches of all the extent mappings to disk */
41
	struct extent_map_tree extent_tree;
C
Chris Mason 已提交
42 43

	/* the io_tree does range state (DIRTY, LOCKED etc) */
44
	struct extent_io_tree io_tree;
C
Chris Mason 已提交
45 46 47 48

	/* special utility tree used to record which mirrors have already been
	 * tried when checksums fail for a given block
	 */
49
	struct extent_io_tree io_failure_tree;
C
Chris Mason 已提交
50 51

	/* held while logging the inode in tree-log.c */
52
	struct mutex log_mutex;
C
Chris Mason 已提交
53 54

	/* used to order data wrt metadata */
55
	struct btrfs_ordered_inode_tree ordered_tree;
56

57 58 59
	/* for keeping track of orphaned inodes */
	struct list_head i_orphan;

C
Chris Mason 已提交
60 61 62 63
	/* list of all the delalloc inodes in the FS.  There are times we need
	 * to write all the delalloc pages to disk, and this list is used
	 * to walk them all.
	 */
64 65
	struct list_head delalloc_inodes;

66 67 68 69 70 71
	/*
	 * list for tracking inodes that must be sent to disk before a
	 * rename or truncate commit
	 */
	struct list_head ordered_operations;

72 73 74
	/* node for the red-black tree that links inodes in subvolume root */
	struct rb_node rb_node;

J
Josef Bacik 已提交
75 76 77
	/* the space_info for where this inode's data allocations are done */
	struct btrfs_space_info *space_info;

C
Chris Mason 已提交
78 79 80
	/* full 64 bit generation number, struct vfs_inode doesn't have a big
	 * enough field for this.
	 */
81 82
	u64 generation;

83 84 85
	/* sequence number for NFS changes */
	u64 sequence;

86 87 88 89
	/*
	 * transid of the trans_handle that last modified this inode
	 */
	u64 last_trans;
90 91 92 93 94 95

	/*
	 * log transid when this inode was last modified
	 */
	u64 last_sub_trans;

96 97 98 99
	/*
	 * transid that last logged this inode
	 */
	u64 logged_trans;
C
Chris Mason 已提交
100

C
Chris Mason 已提交
101 102 103
	/* total number of bytes pending delalloc, used by stat to calc the
	 * real block usage of the file
	 */
C
Chris Mason 已提交
104
	u64 delalloc_bytes;
C
Chris Mason 已提交
105

J
Josef Bacik 已提交
106 107 108 109 110
	/* total number of bytes that may be used for this inode for
	 * delalloc
	 */
	u64 reserved_bytes;

C
Chris Mason 已提交
111 112 113 114 115
	/*
	 * the size of the file stored in the metadata on disk.  data=ordered
	 * means the in-memory i_size might be larger than the size on disk
	 * because not all the blocks are written yet.
	 */
116
	u64 disk_i_size;
C
Chris Mason 已提交
117 118

	/* flags field from the on disk inode */
Y
Yan 已提交
119
	u32 flags;
120 121 122 123 124 125

	/*
	 * if this is a directory then index_cnt is the counter for the index
	 * number for new files that are created
	 */
	u64 index_cnt;
C
Chris Mason 已提交
126

127 128 129 130 131 132 133
	/* the fsync log has some corner cases that mean we have to check
	 * directories to see if any unlinks have been done before
	 * the directory was logged.  See tree-log.c for all the
	 * details
	 */
	u64 last_unlink_trans;

J
Josef Bacik 已提交
134
	/*
135 136 137 138
	 * Counters to keep track of the number of extent item's we may use due
	 * to delalloc and such.  outstanding_extents is the number of extent
	 * items we think we'll end up using, and reserved_extents is the number
	 * of extent items we've reserved metadata for.
J
Josef Bacik 已提交
139
	 */
140 141
	unsigned outstanding_extents;
	unsigned reserved_extents;
J
Josef Bacik 已提交
142

143 144 145 146 147 148 149 150 151 152 153
	/*
	 * ordered_data_close is set by truncate when a file that used
	 * to have good data has been truncated to zero.  When it is set
	 * the btrfs file release call will add this inode to the
	 * ordered operations list so that we make sure to flush out any
	 * new data the application may have written before commit.
	 *
	 * yes, its silly to have a single bitflag, but we might grow more
	 * of these.
	 */
	unsigned ordered_data_close:1;
154
	unsigned orphan_meta_reserved:1;
155
	unsigned dummy_inode:1;
C
Chris Mason 已提交
156
	unsigned in_defrag:1;
157

C
Chris Mason 已提交
158 159 160
	/*
	 * always compress this one file
	 */
161
	unsigned force_compress:4;
C
Chris Mason 已提交
162

163 164
	struct btrfs_delayed_node *delayed_node;

C
Chris Mason 已提交
165
	struct inode vfs_inode;
C
Chris Mason 已提交
166
};
167

168 169
extern unsigned char btrfs_filetype_table[];

C
Chris Mason 已提交
170 171 172 173 174
static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
{
	return container_of(inode, struct btrfs_inode, vfs_inode);
}

L
Li Zefan 已提交
175 176 177 178 179 180 181 182 183
static inline u64 btrfs_ino(struct inode *inode)
{
	u64 ino = BTRFS_I(inode)->location.objectid;

	if (ino <= BTRFS_FIRST_FREE_OBJECTID)
		ino = inode->i_ino;
	return ino;
}

184 185
static inline void btrfs_i_size_write(struct inode *inode, u64 size)
{
186
	i_size_write(inode, size);
187 188 189
	BTRFS_I(inode)->disk_i_size = size;
}

190 191 192 193 194 195 196 197 198
static inline bool btrfs_is_free_space_inode(struct btrfs_root *root,
				       struct inode *inode)
{
	if (root == root->fs_info->tree_root ||
	    BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID)
		return true;
	return false;
}

C
Chris Mason 已提交
199
#endif