btrfs_inode.h 5.4 KB

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