fs/btrfs/btrfs_inode.h

   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         /* standard acl pointers */
  57         struct posix_acl *i_acl;
  58         struct posix_acl *i_default_acl;
  59
  60         /* for keeping track of orphaned inodes */
  61         struct list_head i_orphan;
  62
  63         /* list of all the delalloc inodes in the FS.  There are times we need
  64          * to write all the delalloc pages to disk, and this list is used
  65          * to walk them all.
  66          */
  67         struct list_head delalloc_inodes;
  68
  69         /*
  70          * list for tracking inodes that must be sent to disk before a
  71          * rename or truncate commit
  72          */
  73         struct list_head ordered_operations;
  74
  75         /* node for the red-black tree that links inodes in subvolume root */
  76         struct rb_node rb_node;
  77
  78         /* the space_info for where this inode's data allocations are done */
  79         struct btrfs_space_info *space_info;
  80
  81         /* full 64 bit generation number, struct vfs_inode doesn't have a big
  82          * enough field for this.
  83          */
  84         u64 generation;
  85
  86         /* sequence number for NFS changes */
  87         u64 sequence;
  88
  89         /*
  90          * transid of the trans_handle that last modified this inode
  91          */
  92         u64 last_trans;
  93         /*
  94          * transid that last logged this inode
  95          */
  96         u64 logged_trans;
  97
  98         /* total number of bytes pending delalloc, used by stat to calc the
  99          * real block usage of the file
 100          */
 101         u64 delalloc_bytes;
 102
 103         /* total number of bytes that may be used for this inode for
 104          * delalloc
 105          */
 106         u64 reserved_bytes;
 107
 108         /*
 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.
 112          */
 113         u64 disk_i_size;
 114
 115         /* flags field from the on disk inode */
 116         u32 flags;
 117
 118         /*
 119          * if this is a directory then index_cnt is the counter for the index
 120          * number for new files that are created
 121          */
 122         u64 index_cnt;
 123
 124         /* the start of block group preferred for allocations. */
 125         u64 block_group;
 126
 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
 130          * details
 131          */
 132         u64 last_unlink_trans;
 133
 134         /*
 135          * ordered_data_close is set by truncate when a file that used
 136          * to have good data has been truncated to zero.  When it is set
 137          * the btrfs file release call will add this inode to the
 138          * ordered operations list so that we make sure to flush out any
 139          * new data the application may have written before commit.
 140          *
 141          * yes, its silly to have a single bitflag, but we might grow more
 142          * of these.
 143          */
 144         unsigned ordered_data_close:1;
 145
 146         struct inode vfs_inode;
 147 };
 148
 149 static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
 150 {
 151         return container_of(inode, struct btrfs_inode, vfs_inode);
 152 }
 153
 154 static inline void btrfs_i_size_write(struct inode *inode, u64 size)
 155 {
 156         inode->i_size = size;
 157         BTRFS_I(inode)->disk_i_size = size;
 158 }
 159
 160 #endif