qgroup.h 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188
  1. /*
  2. * Copyright (C) 2014 Facebook. 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_QGROUP__
  19. #define __BTRFS_QGROUP__
  20. #include "ulist.h"
  21. #include "delayed-ref.h"
  22. /*
  23. * Btrfs qgroup overview
  24. *
  25. * Btrfs qgroup splits into 3 main part:
  26. * 1) Reserve
  27. * Reserve metadata/data space for incoming operations
  28. * Affect how qgroup limit works
  29. *
  30. * 2) Trace
  31. * Tell btrfs qgroup to trace dirty extents.
  32. *
  33. * Dirty extents including:
  34. * - Newly allocated extents
  35. * - Extents going to be deleted (in this trans)
  36. * - Extents whose owner is going to be modified
  37. *
  38. * This is the main part affects whether qgroup numbers will stay
  39. * consistent.
  40. * Btrfs qgroup can trace clean extents and won't cause any problem,
  41. * but it will consume extra CPU time, it should be avoided if possible.
  42. *
  43. * 3) Account
  44. * Btrfs qgroup will updates its numbers, based on dirty extents traced
  45. * in previous step.
  46. *
  47. * Normally at qgroup rescan and transaction commit time.
  48. */
  49. /*
  50. * Record a dirty extent, and info qgroup to update quota on it
  51. * TODO: Use kmem cache to alloc it.
  52. */
  53. struct btrfs_qgroup_extent_record {
  54. struct rb_node node;
  55. u64 bytenr;
  56. u64 num_bytes;
  57. struct ulist *old_roots;
  58. };
  59. /*
  60. * For qgroup event trace points only
  61. */
  62. #define QGROUP_RESERVE (1<<0)
  63. #define QGROUP_RELEASE (1<<1)
  64. #define QGROUP_FREE (1<<2)
  65. int btrfs_quota_enable(struct btrfs_trans_handle *trans,
  66. struct btrfs_fs_info *fs_info);
  67. int btrfs_quota_disable(struct btrfs_trans_handle *trans,
  68. struct btrfs_fs_info *fs_info);
  69. int btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info);
  70. void btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info);
  71. int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
  72. bool interruptible);
  73. int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans,
  74. struct btrfs_fs_info *fs_info, u64 src, u64 dst);
  75. int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans,
  76. struct btrfs_fs_info *fs_info, u64 src, u64 dst);
  77. int btrfs_create_qgroup(struct btrfs_trans_handle *trans,
  78. struct btrfs_fs_info *fs_info, u64 qgroupid);
  79. int btrfs_remove_qgroup(struct btrfs_trans_handle *trans,
  80. struct btrfs_fs_info *fs_info, u64 qgroupid);
  81. int btrfs_limit_qgroup(struct btrfs_trans_handle *trans,
  82. struct btrfs_fs_info *fs_info, u64 qgroupid,
  83. struct btrfs_qgroup_limit *limit);
  84. int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info);
  85. void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info);
  86. struct btrfs_delayed_extent_op;
  87. int btrfs_qgroup_prepare_account_extents(struct btrfs_trans_handle *trans,
  88. struct btrfs_fs_info *fs_info);
  89. /*
  90. * Inform qgroup to trace one dirty extent, its info is recorded in @record.
  91. * So qgroup can account it at commit trans time.
  92. *
  93. * No lock version, caller must acquire delayed ref lock and allocate memory.
  94. *
  95. * Return 0 for success insert
  96. * Return >0 for existing record, caller can free @record safely.
  97. * Error is not possible
  98. */
  99. int btrfs_qgroup_trace_extent_nolock(
  100. struct btrfs_fs_info *fs_info,
  101. struct btrfs_delayed_ref_root *delayed_refs,
  102. struct btrfs_qgroup_extent_record *record);
  103. /*
  104. * Inform qgroup to trace one dirty extent, specified by @bytenr and
  105. * @num_bytes.
  106. * So qgroup can account it at commit trans time.
  107. *
  108. * Better encapsulated version.
  109. *
  110. * Return 0 if the operation is done.
  111. * Return <0 for error, like memory allocation failure or invalid parameter
  112. * (NULL trans)
  113. */
  114. int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans,
  115. struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes,
  116. gfp_t gfp_flag);
  117. /*
  118. * Inform qgroup to trace all leaf items of data
  119. *
  120. * Return 0 for success
  121. * Return <0 for error(ENOMEM)
  122. */
  123. int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
  124. struct btrfs_fs_info *fs_info,
  125. struct extent_buffer *eb);
  126. /*
  127. * Inform qgroup to trace a whole subtree, including all its child tree
  128. * blocks and data.
  129. * The root tree block is specified by @root_eb.
  130. *
  131. * Normally used by relocation(tree block swap) and subvolume deletion.
  132. *
  133. * Return 0 for success
  134. * Return <0 for error(ENOMEM or tree search error)
  135. */
  136. int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
  137. struct btrfs_root *root,
  138. struct extent_buffer *root_eb,
  139. u64 root_gen, int root_level);
  140. int
  141. btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans,
  142. struct btrfs_fs_info *fs_info,
  143. u64 bytenr, u64 num_bytes,
  144. struct ulist *old_roots, struct ulist *new_roots);
  145. int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans,
  146. struct btrfs_fs_info *fs_info);
  147. int btrfs_run_qgroups(struct btrfs_trans_handle *trans,
  148. struct btrfs_fs_info *fs_info);
  149. int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans,
  150. struct btrfs_fs_info *fs_info, u64 srcid, u64 objectid,
  151. struct btrfs_qgroup_inherit *inherit);
  152. void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
  153. u64 ref_root, u64 num_bytes);
  154. /*
  155. * TODO: Add proper trace point for it, as btrfs_qgroup_free() is
  156. * called by everywhere, can't provide good trace for delayed ref case.
  157. */
  158. static inline void btrfs_qgroup_free_delayed_ref(struct btrfs_fs_info *fs_info,
  159. u64 ref_root, u64 num_bytes)
  160. {
  161. btrfs_qgroup_free_refroot(fs_info, ref_root, num_bytes);
  162. trace_btrfs_qgroup_free_delayed_ref(fs_info, ref_root, num_bytes);
  163. }
  164. void assert_qgroups_uptodate(struct btrfs_trans_handle *trans);
  165. #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
  166. int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
  167. u64 rfer, u64 excl);
  168. #endif
  169. /* New io_tree based accurate qgroup reserve API */
  170. int btrfs_qgroup_reserve_data(struct inode *inode, u64 start, u64 len);
  171. int btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len);
  172. int btrfs_qgroup_free_data(struct inode *inode, u64 start, u64 len);
  173. int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes);
  174. void btrfs_qgroup_free_meta_all(struct btrfs_root *root);
  175. void btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes);
  176. void btrfs_qgroup_check_reserved_leak(struct inode *inode);
  177. #endif /* __BTRFS_QGROUP__ */