btrfs_inode.h 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  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 <linux/hash.h>
  21. #include "extent_map.h"
  22. #include "extent_io.h"
  23. #include "ordered-data.h"
  24. #include "delayed-inode.h"
  25. /*
  26. * ordered_data_close is set by truncate when a file that used
  27. * to have good data has been truncated to zero. When it is set
  28. * the btrfs file release call will add this inode to the
  29. * ordered operations list so that we make sure to flush out any
  30. * new data the application may have written before commit.
  31. */
  32. #define BTRFS_INODE_ORDERED_DATA_CLOSE 0
  33. #define BTRFS_INODE_ORPHAN_META_RESERVED 1
  34. #define BTRFS_INODE_DUMMY 2
  35. #define BTRFS_INODE_IN_DEFRAG 3
  36. #define BTRFS_INODE_DELALLOC_META_RESERVED 4
  37. #define BTRFS_INODE_HAS_ORPHAN_ITEM 5
  38. #define BTRFS_INODE_HAS_ASYNC_EXTENT 6
  39. #define BTRFS_INODE_NEEDS_FULL_SYNC 7
  40. #define BTRFS_INODE_COPY_EVERYTHING 8
  41. #define BTRFS_INODE_IN_DELALLOC_LIST 9
  42. #define BTRFS_INODE_READDIO_NEED_LOCK 10
  43. #define BTRFS_INODE_HAS_PROPS 11
  44. /*
  45. * The following 3 bits are meant only for the btree inode.
  46. * When any of them is set, it means an error happened while writing an
  47. * extent buffer belonging to:
  48. * 1) a non-log btree
  49. * 2) a log btree and first log sub-transaction
  50. * 3) a log btree and second log sub-transaction
  51. */
  52. #define BTRFS_INODE_BTREE_ERR 12
  53. #define BTRFS_INODE_BTREE_LOG1_ERR 13
  54. #define BTRFS_INODE_BTREE_LOG2_ERR 14
  55. /* in memory btrfs inode */
  56. struct btrfs_inode {
  57. /* which subvolume this inode belongs to */
  58. struct btrfs_root *root;
  59. /* key used to find this inode on disk. This is used by the code
  60. * to read in roots of subvolumes
  61. */
  62. struct btrfs_key location;
  63. /* Lock for counters */
  64. spinlock_t lock;
  65. /* the extent_tree has caches of all the extent mappings to disk */
  66. struct extent_map_tree extent_tree;
  67. /* the io_tree does range state (DIRTY, LOCKED etc) */
  68. struct extent_io_tree io_tree;
  69. /* special utility tree used to record which mirrors have already been
  70. * tried when checksums fail for a given block
  71. */
  72. struct extent_io_tree io_failure_tree;
  73. /* held while logging the inode in tree-log.c */
  74. struct mutex log_mutex;
  75. /* held while doing delalloc reservations */
  76. struct mutex delalloc_mutex;
  77. /* used to order data wrt metadata */
  78. struct btrfs_ordered_inode_tree ordered_tree;
  79. /* list of all the delalloc inodes in the FS. There are times we need
  80. * to write all the delalloc pages to disk, and this list is used
  81. * to walk them all.
  82. */
  83. struct list_head delalloc_inodes;
  84. /* node for the red-black tree that links inodes in subvolume root */
  85. struct rb_node rb_node;
  86. unsigned long runtime_flags;
  87. /* Keep track of who's O_SYNC/fsyncing currently */
  88. atomic_t sync_writers;
  89. /* full 64 bit generation number, struct vfs_inode doesn't have a big
  90. * enough field for this.
  91. */
  92. u64 generation;
  93. /*
  94. * transid of the trans_handle that last modified this inode
  95. */
  96. u64 last_trans;
  97. /*
  98. * transid that last logged this inode
  99. */
  100. u64 logged_trans;
  101. /*
  102. * log transid when this inode was last modified
  103. */
  104. int last_sub_trans;
  105. /* a local copy of root's last_log_commit */
  106. int last_log_commit;
  107. /* total number of bytes pending delalloc, used by stat to calc the
  108. * real block usage of the file
  109. */
  110. u64 delalloc_bytes;
  111. /*
  112. * total number of bytes pending defrag, used by stat to check whether
  113. * it needs COW.
  114. */
  115. u64 defrag_bytes;
  116. /*
  117. * the size of the file stored in the metadata on disk. data=ordered
  118. * means the in-memory i_size might be larger than the size on disk
  119. * because not all the blocks are written yet.
  120. */
  121. u64 disk_i_size;
  122. /*
  123. * if this is a directory then index_cnt is the counter for the index
  124. * number for new files that are created
  125. */
  126. u64 index_cnt;
  127. /* Cache the directory index number to speed the dir/file remove */
  128. u64 dir_index;
  129. /* the fsync log has some corner cases that mean we have to check
  130. * directories to see if any unlinks have been done before
  131. * the directory was logged. See tree-log.c for all the
  132. * details
  133. */
  134. u64 last_unlink_trans;
  135. /*
  136. * Number of bytes outstanding that are going to need csums. This is
  137. * used in ENOSPC accounting.
  138. */
  139. u64 csum_bytes;
  140. /* flags field from the on disk inode */
  141. u32 flags;
  142. /*
  143. * Counters to keep track of the number of extent item's we may use due
  144. * to delalloc and such. outstanding_extents is the number of extent
  145. * items we think we'll end up using, and reserved_extents is the number
  146. * of extent items we've reserved metadata for.
  147. */
  148. unsigned outstanding_extents;
  149. unsigned reserved_extents;
  150. /*
  151. * always compress this one file
  152. */
  153. unsigned force_compress;
  154. struct btrfs_delayed_node *delayed_node;
  155. struct inode vfs_inode;
  156. };
  157. extern unsigned char btrfs_filetype_table[];
  158. static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
  159. {
  160. return container_of(inode, struct btrfs_inode, vfs_inode);
  161. }
  162. static inline unsigned long btrfs_inode_hash(u64 objectid,
  163. const struct btrfs_root *root)
  164. {
  165. u64 h = objectid ^ (root->objectid * GOLDEN_RATIO_PRIME);
  166. #if BITS_PER_LONG == 32
  167. h = (h >> 32) ^ (h & 0xffffffff);
  168. #endif
  169. return (unsigned long)h;
  170. }
  171. static inline void btrfs_insert_inode_hash(struct inode *inode)
  172. {
  173. unsigned long h = btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root);
  174. __insert_inode_hash(inode, h);
  175. }
  176. static inline u64 btrfs_ino(struct inode *inode)
  177. {
  178. u64 ino = BTRFS_I(inode)->location.objectid;
  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. static inline void btrfs_i_size_write(struct inode *inode, u64 size)
  188. {
  189. i_size_write(inode, size);
  190. BTRFS_I(inode)->disk_i_size = size;
  191. }
  192. static inline bool btrfs_is_free_space_inode(struct inode *inode)
  193. {
  194. struct btrfs_root *root = BTRFS_I(inode)->root;
  195. if (root == root->fs_info->tree_root &&
  196. btrfs_ino(inode) != BTRFS_BTREE_INODE_OBJECTID)
  197. return true;
  198. if (BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID)
  199. return true;
  200. return false;
  201. }
  202. static inline int btrfs_inode_in_log(struct inode *inode, u64 generation)
  203. {
  204. if (BTRFS_I(inode)->logged_trans == generation &&
  205. BTRFS_I(inode)->last_sub_trans <=
  206. BTRFS_I(inode)->last_log_commit &&
  207. BTRFS_I(inode)->last_sub_trans <=
  208. BTRFS_I(inode)->root->last_log_commit) {
  209. /*
  210. * After a ranged fsync we might have left some extent maps
  211. * (that fall outside the fsync's range). So return false
  212. * here if the list isn't empty, to make sure btrfs_log_inode()
  213. * will be called and process those extent maps.
  214. */
  215. smp_mb();
  216. if (list_empty(&BTRFS_I(inode)->extent_tree.modified_extents))
  217. return 1;
  218. }
  219. return 0;
  220. }
  221. #define BTRFS_DIO_ORIG_BIO_SUBMITTED 0x1
  222. struct btrfs_dio_private {
  223. struct inode *inode;
  224. unsigned long flags;
  225. u64 logical_offset;
  226. u64 disk_bytenr;
  227. u64 bytes;
  228. void *private;
  229. /* number of bios pending for this dio */
  230. atomic_t pending_bios;
  231. /* IO errors */
  232. int errors;
  233. /* orig_bio is our btrfs_io_bio */
  234. struct bio *orig_bio;
  235. /* dio_bio came from fs/direct-io.c */
  236. struct bio *dio_bio;
  237. /*
  238. * The original bio may be splited to several sub-bios, this is
  239. * done during endio of sub-bios
  240. */
  241. int (*subio_endio)(struct inode *, struct btrfs_io_bio *, int);
  242. };
  243. /*
  244. * Disable DIO read nolock optimization, so new dio readers will be forced
  245. * to grab i_mutex. It is used to avoid the endless truncate due to
  246. * nonlocked dio read.
  247. */
  248. static inline void btrfs_inode_block_unlocked_dio(struct inode *inode)
  249. {
  250. set_bit(BTRFS_INODE_READDIO_NEED_LOCK, &BTRFS_I(inode)->runtime_flags);
  251. smp_mb();
  252. }
  253. static inline void btrfs_inode_resume_unlocked_dio(struct inode *inode)
  254. {
  255. smp_mb__before_atomic();
  256. clear_bit(BTRFS_INODE_READDIO_NEED_LOCK,
  257. &BTRFS_I(inode)->runtime_flags);
  258. }
  259. bool btrfs_page_exists_in_range(struct inode *inode, loff_t start, loff_t end);
  260. #endif