alloc.h 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  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. struct ocfs2_alloc_context *meta_ac);
  36. int ocfs2_num_free_extents(struct ocfs2_super *osb,
  37. struct inode *inode,
  38. struct ocfs2_dinode *fe);
  39. /* how many new metadata chunks would an allocation need at maximum? */
  40. static inline int ocfs2_extend_meta_needed(struct ocfs2_dinode *fe)
  41. {
  42. /*
  43. * Rather than do all the work of determining how much we need
  44. * (involves a ton of reads and locks), just ask for the
  45. * maximal limit. That's a tree depth shift. So, one block for
  46. * level of the tree (current l_tree_depth), one block for the
  47. * new tree_depth==0 extent_block, and one block at the new
  48. * top-of-the tree.
  49. */
  50. return le16_to_cpu(fe->id2.i_list.l_tree_depth) + 2;
  51. }
  52. int ocfs2_truncate_log_init(struct ocfs2_super *osb);
  53. void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
  54. void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
  55. int cancel);
  56. int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
  57. int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
  58. int slot_num,
  59. struct ocfs2_dinode **tl_copy);
  60. int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
  61. struct ocfs2_dinode *tl_copy);
  62. struct ocfs2_truncate_context {
  63. struct inode *tc_ext_alloc_inode;
  64. struct buffer_head *tc_ext_alloc_bh;
  65. int tc_ext_alloc_locked; /* is it cluster locked? */
  66. /* these get destroyed once it's passed to ocfs2_commit_truncate. */
  67. struct buffer_head *tc_last_eb_bh;
  68. };
  69. int ocfs2_zero_tail_for_truncate(struct inode *inode, handle_t *handle,
  70. u64 new_i_size);
  71. int ocfs2_prepare_truncate(struct ocfs2_super *osb,
  72. struct inode *inode,
  73. struct buffer_head *fe_bh,
  74. struct ocfs2_truncate_context **tc);
  75. int ocfs2_commit_truncate(struct ocfs2_super *osb,
  76. struct inode *inode,
  77. struct buffer_head *fe_bh,
  78. struct ocfs2_truncate_context *tc);
  79. int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
  80. u32 cpos, struct buffer_head **leaf_bh);
  81. /*
  82. * Helper function to look at the # of clusters in an extent record.
  83. */
  84. static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
  85. struct ocfs2_extent_rec *rec)
  86. {
  87. /*
  88. * Cluster count in extent records is slightly different
  89. * between interior nodes and leaf nodes. This is to support
  90. * unwritten extents which need a flags field in leaf node
  91. * records, thus shrinking the available space for a clusters
  92. * field.
  93. */
  94. if (el->l_tree_depth)
  95. return le32_to_cpu(rec->e_int_clusters);
  96. else
  97. return le16_to_cpu(rec->e_leaf_clusters);
  98. }
  99. #endif /* OCFS2_ALLOC_H */