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"
26 /* in memory btrfs inode */
28 /* which subvolume this inode belongs to */
29 struct btrfs_root *root;
31 /* key used to find this inode on disk. This is used by the code
32 * to read in roots of subvolumes
34 struct btrfs_key location;
36 /* the extent_tree has caches of all the extent mappings to disk */
37 struct extent_map_tree extent_tree;
39 /* the io_tree does range state (DIRTY, LOCKED etc) */
40 struct extent_io_tree io_tree;
42 /* special utility tree used to record which mirrors have already been
43 * tried when checksums fail for a given block
45 struct extent_io_tree io_failure_tree;
47 /* held while inesrting or deleting extents from files */
48 struct mutex extent_mutex;
50 /* held while logging the inode in tree-log.c */
51 struct mutex log_mutex;
53 /* used to order data wrt metadata */
54 struct btrfs_ordered_inode_tree ordered_tree;
56 /* for keeping track of orphaned inodes */
57 struct list_head i_orphan;
59 /* list of all the delalloc inodes in the FS. There are times we need
60 * to write all the delalloc pages to disk, and this list is used
63 struct list_head delalloc_inodes;
66 * list for tracking inodes that must be sent to disk before a
67 * rename or truncate commit
69 struct list_head ordered_operations;
71 /* node for the red-black tree that links inodes in subvolume root */
72 struct rb_node rb_node;
74 /* the space_info for where this inode's data allocations are done */
75 struct btrfs_space_info *space_info;
77 /* full 64 bit generation number, struct vfs_inode doesn't have a big
78 * enough field for this.
82 /* sequence number for NFS changes */
86 * transid of the trans_handle that last modified this inode
90 * transid that last logged this inode
94 /* total number of bytes pending delalloc, used by stat to calc the
95 * real block usage of the file
99 /* total number of bytes that may be used for this inode for
105 * the size of the file stored in the metadata on disk. data=ordered
106 * means the in-memory i_size might be larger than the size on disk
107 * because not all the blocks are written yet.
111 /* flags field from the on disk inode */
115 * if this is a directory then index_cnt is the counter for the index
116 * number for new files that are created
120 /* the start of block group preferred for allocations. */
123 /* the fsync log has some corner cases that mean we have to check
124 * directories to see if any unlinks have been done before
125 * the directory was logged. See tree-log.c for all the
128 u64 last_unlink_trans;
131 * ordered_data_close is set by truncate when a file that used
132 * to have good data has been truncated to zero. When it is set
133 * the btrfs file release call will add this inode to the
134 * ordered operations list so that we make sure to flush out any
135 * new data the application may have written before commit.
137 * yes, its silly to have a single bitflag, but we might grow more
140 unsigned ordered_data_close:1;
142 struct inode vfs_inode;
145 static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
147 return container_of(inode, struct btrfs_inode, vfs_inode);
150 static inline void btrfs_i_size_write(struct inode *inode, u64 size)
152 inode->i_size = size;
153 BTRFS_I(inode)->disk_i_size = size;