1 /* 2 * Copyright (C) 2007 Oracle. All rights reserved. 3 * 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. 7 * 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. 12 * 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. 17 */ 18 19 #ifndef __BTRFS_I__ 20 #define __BTRFS_I__ 21 22 #include "extent_map.h" 23 #include "extent_io.h" 24 #include "ordered-data.h" 25 #include "delayed-inode.h" 26 27 /* 28 * ordered_data_close is set by truncate when a file that used 29 * to have good data has been truncated to zero. When it is set 30 * the btrfs file release call will add this inode to the 31 * ordered operations list so that we make sure to flush out any 32 * new data the application may have written before commit. 33 */ 34 #define BTRFS_INODE_ORDERED_DATA_CLOSE 0 35 #define BTRFS_INODE_ORPHAN_META_RESERVED 1 36 #define BTRFS_INODE_DUMMY 2 37 #define BTRFS_INODE_IN_DEFRAG 3 38 #define BTRFS_INODE_DELALLOC_META_RESERVED 4 39 #define BTRFS_INODE_HAS_ORPHAN_ITEM 5 40 #define BTRFS_INODE_HAS_ASYNC_EXTENT 6 41 42 /* in memory btrfs inode */ 43 struct btrfs_inode { 44 /* which subvolume this inode belongs to */ 45 struct btrfs_root *root; 46 47 /* key used to find this inode on disk. This is used by the code 48 * to read in roots of subvolumes 49 */ 50 struct btrfs_key location; 51 52 /* Lock for counters */ 53 spinlock_t lock; 54 55 /* the extent_tree has caches of all the extent mappings to disk */ 56 struct extent_map_tree extent_tree; 57 58 /* the io_tree does range state (DIRTY, LOCKED etc) */ 59 struct extent_io_tree io_tree; 60 61 /* special utility tree used to record which mirrors have already been 62 * tried when checksums fail for a given block 63 */ 64 struct extent_io_tree io_failure_tree; 65 66 /* held while logging the inode in tree-log.c */ 67 struct mutex log_mutex; 68 69 /* held while doing delalloc reservations */ 70 struct mutex delalloc_mutex; 71 72 /* used to order data wrt metadata */ 73 struct btrfs_ordered_inode_tree ordered_tree; 74 75 /* list of all the delalloc inodes in the FS. There are times we need 76 * to write all the delalloc pages to disk, and this list is used 77 * to walk them all. 78 */ 79 struct list_head delalloc_inodes; 80 81 /* 82 * list for tracking inodes that must be sent to disk before a 83 * rename or truncate commit 84 */ 85 struct list_head ordered_operations; 86 87 /* node for the red-black tree that links inodes in subvolume root */ 88 struct rb_node rb_node; 89 90 /* the space_info for where this inode's data allocations are done */ 91 struct btrfs_space_info *space_info; 92 93 unsigned long runtime_flags; 94 95 /* full 64 bit generation number, struct vfs_inode doesn't have a big 96 * enough field for this. 97 */ 98 u64 generation; 99 100 /* 101 * transid of the trans_handle that last modified this inode 102 */ 103 u64 last_trans; 104 105 /* 106 * log transid when this inode was last modified 107 */ 108 u64 last_sub_trans; 109 110 /* 111 * transid that last logged this inode 112 */ 113 u64 logged_trans; 114 115 /* total number of bytes pending delalloc, used by stat to calc the 116 * real block usage of the file 117 */ 118 u64 delalloc_bytes; 119 120 /* 121 * the size of the file stored in the metadata on disk. data=ordered 122 * means the in-memory i_size might be larger than the size on disk 123 * because not all the blocks are written yet. 124 */ 125 u64 disk_i_size; 126 127 /* 128 * if this is a directory then index_cnt is the counter for the index 129 * number for new files that are created 130 */ 131 u64 index_cnt; 132 133 /* the fsync log has some corner cases that mean we have to check 134 * directories to see if any unlinks have been done before 135 * the directory was logged. See tree-log.c for all the 136 * details 137 */ 138 u64 last_unlink_trans; 139 140 /* 141 * Number of bytes outstanding that are going to need csums. This is 142 * used in ENOSPC accounting. 143 */ 144 u64 csum_bytes; 145 146 /* flags field from the on disk inode */ 147 u32 flags; 148 149 /* 150 * Counters to keep track of the number of extent item's we may use due 151 * to delalloc and such. outstanding_extents is the number of extent 152 * items we think we'll end up using, and reserved_extents is the number 153 * of extent items we've reserved metadata for. 154 */ 155 unsigned outstanding_extents; 156 unsigned reserved_extents; 157 158 /* 159 * always compress this one file 160 */ 161 unsigned force_compress; 162 163 struct btrfs_delayed_node *delayed_node; 164 165 struct inode vfs_inode; 166 }; 167 168 extern unsigned char btrfs_filetype_table[]; 169 170 static inline struct btrfs_inode *BTRFS_I(struct inode *inode) 171 { 172 return container_of(inode, struct btrfs_inode, vfs_inode); 173 } 174 175 static inline u64 btrfs_ino(struct inode *inode) 176 { 177 u64 ino = BTRFS_I(inode)->location.objectid; 178 179 /* 180 * !ino: btree_inode 181 * type == BTRFS_ROOT_ITEM_KEY: subvol dir 182 */ 183 if (!ino || BTRFS_I(inode)->location.type == BTRFS_ROOT_ITEM_KEY) 184 ino = inode->i_ino; 185 return ino; 186 } 187 188 static inline void btrfs_i_size_write(struct inode *inode, u64 size) 189 { 190 i_size_write(inode, size); 191 BTRFS_I(inode)->disk_i_size = size; 192 } 193 194 static inline bool btrfs_is_free_space_inode(struct btrfs_root *root, 195 struct inode *inode) 196 { 197 if (root == root->fs_info->tree_root || 198 BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID) 199 return true; 200 return false; 201 } 202 203 static inline int btrfs_inode_in_log(struct inode *inode, u64 generation) 204 { 205 struct btrfs_root *root = BTRFS_I(inode)->root; 206 int ret = 0; 207 208 mutex_lock(&root->log_mutex); 209 if (BTRFS_I(inode)->logged_trans == generation && 210 BTRFS_I(inode)->last_sub_trans <= root->last_log_commit) 211 ret = 1; 212 mutex_unlock(&root->log_mutex); 213 return ret; 214 } 215 216 #endif 217