alloc.h 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * alloc.h
  5. *
  6. * Function prototypes
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #ifndef OCFS2_ALLOC_H
  26. #define OCFS2_ALLOC_H
  27. enum ocfs2_extent_tree_type {
  28. OCFS2_DINODE_EXTENT = 0,
  29. };
  30. struct ocfs2_alloc_context;
  31. int ocfs2_insert_extent(struct ocfs2_super *osb,
  32. handle_t *handle,
  33. struct inode *inode,
  34. struct buffer_head *root_bh,
  35. u32 cpos,
  36. u64 start_blk,
  37. u32 new_clusters,
  38. u8 flags,
  39. struct ocfs2_alloc_context *meta_ac,
  40. enum ocfs2_extent_tree_type et_type);
  41. struct ocfs2_cached_dealloc_ctxt;
  42. int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *root_bh,
  43. handle_t *handle, u32 cpos, u32 len, u32 phys,
  44. struct ocfs2_alloc_context *meta_ac,
  45. struct ocfs2_cached_dealloc_ctxt *dealloc,
  46. enum ocfs2_extent_tree_type et_type);
  47. int ocfs2_remove_extent(struct inode *inode, struct buffer_head *root_bh,
  48. u32 cpos, u32 len, handle_t *handle,
  49. struct ocfs2_alloc_context *meta_ac,
  50. struct ocfs2_cached_dealloc_ctxt *dealloc,
  51. enum ocfs2_extent_tree_type et_type);
  52. int ocfs2_num_free_extents(struct ocfs2_super *osb,
  53. struct inode *inode,
  54. struct buffer_head *root_bh,
  55. enum ocfs2_extent_tree_type et_type);
  56. /*
  57. * how many new metadata chunks would an allocation need at maximum?
  58. *
  59. * Please note that the caller must make sure that root_el is the root
  60. * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
  61. * the result may be wrong.
  62. */
  63. static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el)
  64. {
  65. /*
  66. * Rather than do all the work of determining how much we need
  67. * (involves a ton of reads and locks), just ask for the
  68. * maximal limit. That's a tree depth shift. So, one block for
  69. * level of the tree (current l_tree_depth), one block for the
  70. * new tree_depth==0 extent_block, and one block at the new
  71. * top-of-the tree.
  72. */
  73. return le16_to_cpu(root_el->l_tree_depth) + 2;
  74. }
  75. void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di);
  76. void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di);
  77. int ocfs2_convert_inline_data_to_extents(struct inode *inode,
  78. struct buffer_head *di_bh);
  79. int ocfs2_truncate_log_init(struct ocfs2_super *osb);
  80. void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
  81. void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
  82. int cancel);
  83. int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
  84. int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
  85. int slot_num,
  86. struct ocfs2_dinode **tl_copy);
  87. int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
  88. struct ocfs2_dinode *tl_copy);
  89. int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb);
  90. int ocfs2_truncate_log_append(struct ocfs2_super *osb,
  91. handle_t *handle,
  92. u64 start_blk,
  93. unsigned int num_clusters);
  94. int __ocfs2_flush_truncate_log(struct ocfs2_super *osb);
  95. /*
  96. * Process local structure which describes the block unlinks done
  97. * during an operation. This is populated via
  98. * ocfs2_cache_block_dealloc().
  99. *
  100. * ocfs2_run_deallocs() should be called after the potentially
  101. * de-allocating routines. No journal handles should be open, and most
  102. * locks should have been dropped.
  103. */
  104. struct ocfs2_cached_dealloc_ctxt {
  105. struct ocfs2_per_slot_free_list *c_first_suballocator;
  106. };
  107. static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
  108. {
  109. c->c_first_suballocator = NULL;
  110. }
  111. int ocfs2_run_deallocs(struct ocfs2_super *osb,
  112. struct ocfs2_cached_dealloc_ctxt *ctxt);
  113. struct ocfs2_truncate_context {
  114. struct ocfs2_cached_dealloc_ctxt tc_dealloc;
  115. int tc_ext_alloc_locked; /* is it cluster locked? */
  116. /* these get destroyed once it's passed to ocfs2_commit_truncate. */
  117. struct buffer_head *tc_last_eb_bh;
  118. };
  119. int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
  120. u64 range_start, u64 range_end);
  121. int ocfs2_prepare_truncate(struct ocfs2_super *osb,
  122. struct inode *inode,
  123. struct buffer_head *fe_bh,
  124. struct ocfs2_truncate_context **tc);
  125. int ocfs2_commit_truncate(struct ocfs2_super *osb,
  126. struct inode *inode,
  127. struct buffer_head *fe_bh,
  128. struct ocfs2_truncate_context *tc);
  129. int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
  130. unsigned int start, unsigned int end, int trunc);
  131. int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
  132. u32 cpos, struct buffer_head **leaf_bh);
  133. int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
  134. /*
  135. * Helper function to look at the # of clusters in an extent record.
  136. */
  137. static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
  138. struct ocfs2_extent_rec *rec)
  139. {
  140. /*
  141. * Cluster count in extent records is slightly different
  142. * between interior nodes and leaf nodes. This is to support
  143. * unwritten extents which need a flags field in leaf node
  144. * records, thus shrinking the available space for a clusters
  145. * field.
  146. */
  147. if (el->l_tree_depth)
  148. return le32_to_cpu(rec->e_int_clusters);
  149. else
  150. return le16_to_cpu(rec->e_leaf_clusters);
  151. }
  152. /*
  153. * This is only valid for leaf nodes, which are the only ones that can
  154. * have empty extents anyway.
  155. */
  156. static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec)
  157. {
  158. return !rec->e_leaf_clusters;
  159. }
  160. #endif /* OCFS2_ALLOC_H */