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 26 /* in memory btrfs inode */ 27 struct btrfs_inode { 28 /* which subvolume this inode belongs to */ 29 struct btrfs_root *root; 30 31 /* key used to find this inode on disk. This is used by the code 32 * to read in roots of subvolumes 33 */ 34 struct btrfs_key location; 35 36 /* the extent_tree has caches of all the extent mappings to disk */ 37 struct extent_map_tree extent_tree; 38 39 /* the io_tree does range state (DIRTY, LOCKED etc) */ 40 struct extent_io_tree io_tree; 41 42 /* special utility tree used to record which mirrors have already been 43 * tried when checksums fail for a given block 44 */ 45 struct extent_io_tree io_failure_tree; 46 47 /* held while inesrting or deleting extents from files */ 48 struct mutex extent_mutex; 49 50 /* held while logging the inode in tree-log.c */ 51 struct mutex log_mutex; 52 53 /* used to order data wrt metadata */ 54 struct btrfs_ordered_inode_tree ordered_tree; 55 56 /* for keeping track of orphaned inodes */ 57 struct list_head i_orphan; 58 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 61 * to walk them all. 62 */ 63 struct list_head delalloc_inodes; 64 65 /* 66 * list for tracking inodes that must be sent to disk before a 67 * rename or truncate commit 68 */ 69 struct list_head ordered_operations; 70 71 /* node for the red-black tree that links inodes in subvolume root */ 72 struct rb_node rb_node; 73 74 /* the space_info for where this inode's data allocations are done */ 75 struct btrfs_space_info *space_info; 76 77 /* full 64 bit generation number, struct vfs_inode doesn't have a big 78 * enough field for this. 79 */ 80 u64 generation; 81 82 /* sequence number for NFS changes */ 83 u64 sequence; 84 85 /* 86 * transid of the trans_handle that last modified this inode 87 */ 88 u64 last_trans; 89 /* 90 * transid that last logged this inode 91 */ 92 u64 logged_trans; 93 94 /* total number of bytes pending delalloc, used by stat to calc the 95 * real block usage of the file 96 */ 97 u64 delalloc_bytes; 98 99 /* total number of bytes that may be used for this inode for 100 * delalloc 101 */ 102 u64 reserved_bytes; 103 104 /* 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. 108 */ 109 u64 disk_i_size; 110 111 /* flags field from the on disk inode */ 112 u32 flags; 113 114 /* 115 * if this is a directory then index_cnt is the counter for the index 116 * number for new files that are created 117 */ 118 u64 index_cnt; 119 120 /* the start of block group preferred for allocations. */ 121 u64 block_group; 122 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 126 * details 127 */ 128 u64 last_unlink_trans; 129 130 /* 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. 136 * 137 * yes, its silly to have a single bitflag, but we might grow more 138 * of these. 139 */ 140 unsigned ordered_data_close:1; 141 unsigned dummy_inode:1; 142 143 struct inode vfs_inode; 144 }; 145 146 static inline struct btrfs_inode *BTRFS_I(struct inode *inode) 147 { 148 return container_of(inode, struct btrfs_inode, vfs_inode); 149 } 150 151 static inline void btrfs_i_size_write(struct inode *inode, u64 size) 152 { 153 inode->i_size = size; 154 BTRFS_I(inode)->disk_i_size = size; 155 } 156 157 #endif 158