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 /* the block group preferred for allocations. This pointer is buggy 32 * and needs to be replaced with a bytenr instead 33 */ 34 struct btrfs_block_group_cache *block_group; 35 36 /* key used to find this inode on disk. This is used by the code 37 * to read in roots of subvolumes 38 */ 39 struct btrfs_key location; 40 41 /* the extent_tree has caches of all the extent mappings to disk */ 42 struct extent_map_tree extent_tree; 43 44 /* the io_tree does range state (DIRTY, LOCKED etc) */ 45 struct extent_io_tree io_tree; 46 47 /* special utility tree used to record which mirrors have already been 48 * tried when checksums fail for a given block 49 */ 50 struct extent_io_tree io_failure_tree; 51 52 /* held while inesrting or deleting extents from files */ 53 struct mutex extent_mutex; 54 55 /* held while logging the inode in tree-log.c */ 56 struct mutex log_mutex; 57 58 /* used to order data wrt metadata */ 59 struct btrfs_ordered_inode_tree ordered_tree; 60 61 /* standard acl pointers */ 62 struct posix_acl *i_acl; 63 struct posix_acl *i_default_acl; 64 65 /* for keeping track of orphaned inodes */ 66 struct list_head i_orphan; 67 68 /* list of all the delalloc inodes in the FS. There are times we need 69 * to write all the delalloc pages to disk, and this list is used 70 * to walk them all. 71 */ 72 struct list_head delalloc_inodes; 73 74 /* full 64 bit generation number, struct vfs_inode doesn't have a big 75 * enough field for this. 76 */ 77 u64 generation; 78 79 /* sequence number for NFS changes */ 80 u64 sequence; 81 82 /* 83 * transid of the trans_handle that last modified this inode 84 */ 85 u64 last_trans; 86 /* 87 * transid that last logged this inode 88 */ 89 u64 logged_trans; 90 91 /* 92 * trans that last made a change that should be fully fsync'd. This 93 * gets reset to zero each time the inode is logged 94 */ 95 u64 log_dirty_trans; 96 97 /* total number of bytes pending delalloc, used by stat to calc the 98 * real block usage of the file 99 */ 100 u64 delalloc_bytes; 101 102 /* 103 * the size of the file stored in the metadata on disk. data=ordered 104 * means the in-memory i_size might be larger than the size on disk 105 * because not all the blocks are written yet. 106 */ 107 u64 disk_i_size; 108 109 /* flags field from the on disk inode */ 110 u32 flags; 111 112 /* 113 * if this is a directory then index_cnt is the counter for the index 114 * number for new files that are created 115 */ 116 u64 index_cnt; 117 118 struct inode vfs_inode; 119 }; 120 121 static inline struct btrfs_inode *BTRFS_I(struct inode *inode) 122 { 123 return container_of(inode, struct btrfs_inode, vfs_inode); 124 } 125 126 static inline void btrfs_i_size_write(struct inode *inode, u64 size) 127 { 128 inode->i_size = size; 129 BTRFS_I(inode)->disk_i_size = size; 130 } 131 132 133 #endif 134