alloc.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  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. struct ocfs2_alloc_context;
  28. int ocfs2_insert_extent(struct ocfs2_super *osb,
  29. handle_t *handle,
  30. struct inode *inode,
  31. struct buffer_head *fe_bh,
  32. u32 cpos,
  33. u64 start_blk,
  34. u32 new_clusters,
  35. u8 flags,
  36. struct ocfs2_alloc_context *meta_ac);
  37. struct ocfs2_cached_dealloc_ctxt;
  38. int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *di_bh,
  39. handle_t *handle, u32 cpos, u32 len, u32 phys,
  40. struct ocfs2_alloc_context *meta_ac,
  41. struct ocfs2_cached_dealloc_ctxt *dealloc);
  42. int ocfs2_num_free_extents(struct ocfs2_super *osb,
  43. struct inode *inode,
  44. struct ocfs2_dinode *fe);
  45. /* how many new metadata chunks would an allocation need at maximum? */
  46. static inline int ocfs2_extend_meta_needed(struct ocfs2_dinode *fe)
  47. {
  48. /*
  49. * Rather than do all the work of determining how much we need
  50. * (involves a ton of reads and locks), just ask for the
  51. * maximal limit. That's a tree depth shift. So, one block for
  52. * level of the tree (current l_tree_depth), one block for the
  53. * new tree_depth==0 extent_block, and one block at the new
  54. * top-of-the tree.
  55. */
  56. return le16_to_cpu(fe->id2.i_list.l_tree_depth) + 2;
  57. }
  58. int ocfs2_truncate_log_init(struct ocfs2_super *osb);
  59. void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
  60. void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
  61. int cancel);
  62. int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
  63. int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
  64. int slot_num,
  65. struct ocfs2_dinode **tl_copy);
  66. int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
  67. struct ocfs2_dinode *tl_copy);
  68. /*
  69. * Process local structure which describes the block unlinks done
  70. * during an operation. This is populated via
  71. * ocfs2_cache_block_dealloc().
  72. *
  73. * ocfs2_run_deallocs() should be called after the potentially
  74. * de-allocating routines. No journal handles should be open, and most
  75. * locks should have been dropped.
  76. */
  77. struct ocfs2_cached_dealloc_ctxt {
  78. struct ocfs2_per_slot_free_list *c_first_suballocator;
  79. };
  80. static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
  81. {
  82. c->c_first_suballocator = NULL;
  83. }
  84. int ocfs2_run_deallocs(struct ocfs2_super *osb,
  85. struct ocfs2_cached_dealloc_ctxt *ctxt);
  86. struct ocfs2_truncate_context {
  87. struct ocfs2_cached_dealloc_ctxt tc_dealloc;
  88. int tc_ext_alloc_locked; /* is it cluster locked? */
  89. /* these get destroyed once it's passed to ocfs2_commit_truncate. */
  90. struct buffer_head *tc_last_eb_bh;
  91. };
  92. int ocfs2_zero_tail_for_truncate(struct inode *inode, handle_t *handle,
  93. u64 new_i_size);
  94. int ocfs2_prepare_truncate(struct ocfs2_super *osb,
  95. struct inode *inode,
  96. struct buffer_head *fe_bh,
  97. struct ocfs2_truncate_context **tc);
  98. int ocfs2_commit_truncate(struct ocfs2_super *osb,
  99. struct inode *inode,
  100. struct buffer_head *fe_bh,
  101. struct ocfs2_truncate_context *tc);
  102. int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
  103. u32 cpos, struct buffer_head **leaf_bh);
  104. int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
  105. /*
  106. * Helper function to look at the # of clusters in an extent record.
  107. */
  108. static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
  109. struct ocfs2_extent_rec *rec)
  110. {
  111. /*
  112. * Cluster count in extent records is slightly different
  113. * between interior nodes and leaf nodes. This is to support
  114. * unwritten extents which need a flags field in leaf node
  115. * records, thus shrinking the available space for a clusters
  116. * field.
  117. */
  118. if (el->l_tree_depth)
  119. return le32_to_cpu(rec->e_int_clusters);
  120. else
  121. return le16_to_cpu(rec->e_leaf_clusters);
  122. }
  123. #endif /* OCFS2_ALLOC_H */