2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
22 #include "extent_map.h"
23 #include "extent_io.h"
24 #include "ordered-data.h"
25 #include "delayed-inode.h"
27 /* in memory btrfs inode */
29 /* which subvolume this inode belongs to */
30 struct btrfs_root *root;
32 /* key used to find this inode on disk. This is used by the code
33 * to read in roots of subvolumes
35 struct btrfs_key location;
37 /* the extent_tree has caches of all the extent mappings to disk */
38 struct extent_map_tree extent_tree;
40 /* the io_tree does range state (DIRTY, LOCKED etc) */
41 struct extent_io_tree io_tree;
43 /* special utility tree used to record which mirrors have already been
44 * tried when checksums fail for a given block
46 struct extent_io_tree io_failure_tree;
48 /* held while logging the inode in tree-log.c */
49 struct mutex log_mutex;
51 /* used to order data wrt metadata */
52 struct btrfs_ordered_inode_tree ordered_tree;
54 /* for keeping track of orphaned inodes */
55 struct list_head i_orphan;
57 /* list of all the delalloc inodes in the FS. There are times we need
58 * to write all the delalloc pages to disk, and this list is used
61 struct list_head delalloc_inodes;
64 * list for tracking inodes that must be sent to disk before a
65 * rename or truncate commit
67 struct list_head ordered_operations;
69 /* node for the red-black tree that links inodes in subvolume root */
70 struct rb_node rb_node;
72 /* the space_info for where this inode's data allocations are done */
73 struct btrfs_space_info *space_info;
75 /* full 64 bit generation number, struct vfs_inode doesn't have a big
76 * enough field for this.
80 /* sequence number for NFS changes */
84 * transid of the trans_handle that last modified this inode
89 * log transid when this inode was last modified
94 * transid that last logged this inode
98 /* total number of bytes pending delalloc, used by stat to calc the
99 * real block usage of the file
103 /* total number of bytes that may be used for this inode for
109 * the size of the file stored in the metadata on disk. data=ordered
110 * means the in-memory i_size might be larger than the size on disk
111 * because not all the blocks are written yet.
115 /* flags field from the on disk inode */
119 * if this is a directory then index_cnt is the counter for the index
120 * number for new files that are created
124 /* the start of block group preferred for allocations. */
127 /* the fsync log has some corner cases that mean we have to check
128 * directories to see if any unlinks have been done before
129 * the directory was logged. See tree-log.c for all the
132 u64 last_unlink_trans;
135 * Counters to keep track of the number of extent item's we may use due
136 * to delalloc and such. outstanding_extents is the number of extent
137 * items we think we'll end up using, and reserved_extents is the number
138 * of extent items we've reserved metadata for.
140 atomic_t outstanding_extents;
141 atomic_t reserved_extents;
144 * ordered_data_close is set by truncate when a file that used
145 * to have good data has been truncated to zero. When it is set
146 * the btrfs file release call will add this inode to the
147 * ordered operations list so that we make sure to flush out any
148 * new data the application may have written before commit.
150 * yes, its silly to have a single bitflag, but we might grow more
153 unsigned ordered_data_close:1;
154 unsigned orphan_meta_reserved:1;
155 unsigned dummy_inode:1;
156 unsigned in_defrag:1;
159 * always compress this one file
161 unsigned force_compress:4;
163 struct btrfs_delayed_node *delayed_node;
165 struct inode vfs_inode;
168 extern unsigned char btrfs_filetype_table[];
170 static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
172 return container_of(inode, struct btrfs_inode, vfs_inode);
175 static inline u64 btrfs_ino(struct inode *inode)
177 u64 ino = BTRFS_I(inode)->location.objectid;
179 if (ino <= BTRFS_FIRST_FREE_OBJECTID)
184 static inline void btrfs_i_size_write(struct inode *inode, u64 size)
186 i_size_write(inode, size);
187 BTRFS_I(inode)->disk_i_size = size;