btrfs_inode.h 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  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. /* in memory btrfs inode */
  24. struct btrfs_inode {
  25. /* which subvolume this inode belongs to */
  26. struct btrfs_root *root;
  27. /* key used to find this inode on disk. This is used by the code
  28. * to read in roots of subvolumes
  29. */
  30. struct btrfs_key location;
  31. /* the extent_tree has caches of all the extent mappings to disk */
  32. struct extent_map_tree extent_tree;
  33. /* the io_tree does range state (DIRTY, LOCKED etc) */
  34. struct extent_io_tree io_tree;
  35. /* special utility tree used to record which mirrors have already been
  36. * tried when checksums fail for a given block
  37. */
  38. struct extent_io_tree io_failure_tree;
  39. /* held while logging the inode in tree-log.c */
  40. struct mutex log_mutex;
  41. /* used to order data wrt metadata */
  42. struct btrfs_ordered_inode_tree ordered_tree;
  43. /* for keeping track of orphaned inodes */
  44. struct list_head i_orphan;
  45. /* list of all the delalloc inodes in the FS. There are times we need
  46. * to write all the delalloc pages to disk, and this list is used
  47. * to walk them all.
  48. */
  49. struct list_head delalloc_inodes;
  50. /*
  51. * list for tracking inodes that must be sent to disk before a
  52. * rename or truncate commit
  53. */
  54. struct list_head ordered_operations;
  55. /* node for the red-black tree that links inodes in subvolume root */
  56. struct rb_node rb_node;
  57. /* the space_info for where this inode's data allocations are done */
  58. struct btrfs_space_info *space_info;
  59. /* full 64 bit generation number, struct vfs_inode doesn't have a big
  60. * enough field for this.
  61. */
  62. u64 generation;
  63. /* sequence number for NFS changes */
  64. u64 sequence;
  65. /*
  66. * transid of the trans_handle that last modified this inode
  67. */
  68. u64 last_trans;
  69. /*
  70. * log transid when this inode was last modified
  71. */
  72. u64 last_sub_trans;
  73. /*
  74. * transid that last logged this inode
  75. */
  76. u64 logged_trans;
  77. /* total number of bytes pending delalloc, used by stat to calc the
  78. * real block usage of the file
  79. */
  80. u64 delalloc_bytes;
  81. /* total number of bytes that may be used for this inode for
  82. * delalloc
  83. */
  84. u64 reserved_bytes;
  85. /*
  86. * the size of the file stored in the metadata on disk. data=ordered
  87. * means the in-memory i_size might be larger than the size on disk
  88. * because not all the blocks are written yet.
  89. */
  90. u64 disk_i_size;
  91. /* flags field from the on disk inode */
  92. u32 flags;
  93. /*
  94. * if this is a directory then index_cnt is the counter for the index
  95. * number for new files that are created
  96. */
  97. u64 index_cnt;
  98. /* the start of block group preferred for allocations. */
  99. u64 block_group;
  100. /* the fsync log has some corner cases that mean we have to check
  101. * directories to see if any unlinks have been done before
  102. * the directory was logged. See tree-log.c for all the
  103. * details
  104. */
  105. u64 last_unlink_trans;
  106. /*
  107. * Counters to keep track of the number of extent item's we may use due
  108. * to delalloc and such. outstanding_extents is the number of extent
  109. * items we think we'll end up using, and reserved_extents is the number
  110. * of extent items we've reserved metadata for.
  111. */
  112. spinlock_t accounting_lock;
  113. atomic_t outstanding_extents;
  114. int reserved_extents;
  115. /*
  116. * ordered_data_close is set by truncate when a file that used
  117. * to have good data has been truncated to zero. When it is set
  118. * the btrfs file release call will add this inode to the
  119. * ordered operations list so that we make sure to flush out any
  120. * new data the application may have written before commit.
  121. *
  122. * yes, its silly to have a single bitflag, but we might grow more
  123. * of these.
  124. */
  125. unsigned ordered_data_close:1;
  126. unsigned orphan_meta_reserved:1;
  127. unsigned dummy_inode:1;
  128. /*
  129. * always compress this one file
  130. */
  131. unsigned force_compress:1;
  132. struct inode vfs_inode;
  133. };
  134. static inline struct btrfs_inode *BTRFS_I(struct inode *inode)
  135. {
  136. return container_of(inode, struct btrfs_inode, vfs_inode);
  137. }
  138. static inline void btrfs_i_size_write(struct inode *inode, u64 size)
  139. {
  140. i_size_write(inode, size);
  141. BTRFS_I(inode)->disk_i_size = size;
  142. }
  143. #endif