suballoc.h 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * suballoc.h
  5. *
  6. * Defines sub allocator api
  7. *
  8. * Copyright (C) 2003, 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 _CHAINALLOC_H_
  26. #define _CHAINALLOC_H_
  27. typedef int (group_search_t)(struct inode *,
  28. struct buffer_head *,
  29. u32, /* bits_wanted */
  30. u32, /* min_bits */
  31. u64, /* max_block */
  32. u16 *, /* *bit_off */
  33. u16 *); /* *bits_found */
  34. struct ocfs2_alloc_context {
  35. struct inode *ac_inode; /* which bitmap are we allocating from? */
  36. struct buffer_head *ac_bh; /* file entry bh */
  37. u32 ac_alloc_slot; /* which slot are we allocating from? */
  38. u32 ac_bits_wanted;
  39. u32 ac_bits_given;
  40. #define OCFS2_AC_USE_LOCAL 1
  41. #define OCFS2_AC_USE_MAIN 2
  42. #define OCFS2_AC_USE_INODE 3
  43. #define OCFS2_AC_USE_META 4
  44. u32 ac_which;
  45. /* these are used by the chain search */
  46. u16 ac_chain;
  47. int ac_allow_chain_relink;
  48. group_search_t *ac_group_search;
  49. u64 ac_last_group;
  50. u64 ac_max_block; /* Highest block number to allocate. 0 is
  51. is the same as ~0 - unlimited */
  52. };
  53. void ocfs2_init_steal_slots(struct ocfs2_super *osb);
  54. void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
  55. static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
  56. {
  57. return ac->ac_bits_wanted - ac->ac_bits_given;
  58. }
  59. /*
  60. * Please note that the caller must make sure that root_el is the root
  61. * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
  62. * the result may be wrong.
  63. */
  64. int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
  65. struct ocfs2_extent_list *root_el,
  66. struct ocfs2_alloc_context **ac);
  67. int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
  68. int blocks,
  69. struct ocfs2_alloc_context **ac);
  70. int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
  71. struct ocfs2_alloc_context **ac);
  72. int ocfs2_reserve_clusters(struct ocfs2_super *osb,
  73. u32 bits_wanted,
  74. struct ocfs2_alloc_context **ac);
  75. int ocfs2_claim_metadata(struct ocfs2_super *osb,
  76. handle_t *handle,
  77. struct ocfs2_alloc_context *ac,
  78. u32 bits_wanted,
  79. u16 *suballoc_bit_start,
  80. u32 *num_bits,
  81. u64 *blkno_start);
  82. int ocfs2_claim_new_inode(struct ocfs2_super *osb,
  83. handle_t *handle,
  84. struct inode *dir,
  85. struct buffer_head *parent_fe_bh,
  86. struct ocfs2_alloc_context *ac,
  87. u16 *suballoc_bit,
  88. u64 *fe_blkno);
  89. int ocfs2_claim_clusters(struct ocfs2_super *osb,
  90. handle_t *handle,
  91. struct ocfs2_alloc_context *ac,
  92. u32 min_clusters,
  93. u32 *cluster_start,
  94. u32 *num_clusters);
  95. /*
  96. * Use this variant of ocfs2_claim_clusters to specify a maxiumum
  97. * number of clusters smaller than the allocation reserved.
  98. */
  99. int __ocfs2_claim_clusters(struct ocfs2_super *osb,
  100. handle_t *handle,
  101. struct ocfs2_alloc_context *ac,
  102. u32 min_clusters,
  103. u32 max_clusters,
  104. u32 *cluster_start,
  105. u32 *num_clusters);
  106. int ocfs2_free_suballoc_bits(handle_t *handle,
  107. struct inode *alloc_inode,
  108. struct buffer_head *alloc_bh,
  109. unsigned int start_bit,
  110. u64 bg_blkno,
  111. unsigned int count);
  112. int ocfs2_free_dinode(handle_t *handle,
  113. struct inode *inode_alloc_inode,
  114. struct buffer_head *inode_alloc_bh,
  115. struct ocfs2_dinode *di);
  116. int ocfs2_free_clusters(handle_t *handle,
  117. struct inode *bitmap_inode,
  118. struct buffer_head *bitmap_bh,
  119. u64 start_blk,
  120. unsigned int num_clusters);
  121. int ocfs2_release_clusters(handle_t *handle,
  122. struct inode *bitmap_inode,
  123. struct buffer_head *bitmap_bh,
  124. u64 start_blk,
  125. unsigned int num_clusters);
  126. static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
  127. {
  128. u64 group = block - (u64) bit;
  129. return group;
  130. }
  131. static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
  132. u64 bg_blkno)
  133. {
  134. /* This should work for all block group descriptors as only
  135. * the 1st group descriptor of the cluster bitmap is
  136. * different. */
  137. if (bg_blkno == osb->first_cluster_group_blkno)
  138. return 0;
  139. /* the rest of the block groups are located at the beginning
  140. * of their 1st cluster, so a direct translation just
  141. * works. */
  142. return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
  143. }
  144. static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
  145. {
  146. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  147. return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
  148. }
  149. /* This is for local alloc ONLY. Others should use the task-specific
  150. * apis above. */
  151. int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
  152. struct ocfs2_alloc_context *ac);
  153. void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac);
  154. /* given a cluster offset, calculate which block group it belongs to
  155. * and return that block offset. */
  156. u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);
  157. /*
  158. * By default, ocfs2_read_group_descriptor() calls ocfs2_error() when it
  159. * finds a problem. A caller that wants to check a group descriptor
  160. * without going readonly should read the block with ocfs2_read_block[s]()
  161. * and then checking it with this function. This is only resize, really.
  162. * Everyone else should be using ocfs2_read_group_descriptor().
  163. */
  164. int ocfs2_check_group_descriptor(struct super_block *sb,
  165. struct ocfs2_dinode *di,
  166. struct buffer_head *bh);
  167. /*
  168. * Read a group descriptor block into *bh. If *bh is NULL, a bh will be
  169. * allocated. This is a cached read. The descriptor will be validated with
  170. * ocfs2_validate_group_descriptor().
  171. */
  172. int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
  173. u64 gd_blkno, struct buffer_head **bh);
  174. int ocfs2_lock_allocators(struct inode *inode, struct ocfs2_extent_tree *et,
  175. u32 clusters_to_add, u32 extents_to_split,
  176. struct ocfs2_alloc_context **data_ac,
  177. struct ocfs2_alloc_context **meta_ac);
  178. int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res);
  179. #endif /* _CHAINALLOC_H_ */