suballoc.h 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  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_free_alloc_context(struct ocfs2_alloc_context *ac);
  54. static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
  55. {
  56. return ac->ac_bits_wanted - ac->ac_bits_given;
  57. }
  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. int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
  64. struct ocfs2_extent_list *root_el,
  65. struct ocfs2_alloc_context **ac);
  66. int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
  67. int blocks,
  68. struct ocfs2_alloc_context **ac);
  69. int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
  70. struct ocfs2_alloc_context **ac);
  71. int ocfs2_reserve_clusters(struct ocfs2_super *osb,
  72. u32 bits_wanted,
  73. struct ocfs2_alloc_context **ac);
  74. int ocfs2_claim_metadata(struct ocfs2_super *osb,
  75. handle_t *handle,
  76. struct ocfs2_alloc_context *ac,
  77. u32 bits_wanted,
  78. u16 *suballoc_bit_start,
  79. u32 *num_bits,
  80. u64 *blkno_start);
  81. int ocfs2_claim_new_inode(struct ocfs2_super *osb,
  82. handle_t *handle,
  83. struct inode *dir,
  84. struct buffer_head *parent_fe_bh,
  85. struct ocfs2_alloc_context *ac,
  86. u16 *suballoc_bit,
  87. u64 *fe_blkno);
  88. int ocfs2_claim_clusters(struct ocfs2_super *osb,
  89. handle_t *handle,
  90. struct ocfs2_alloc_context *ac,
  91. u32 min_clusters,
  92. u32 *cluster_start,
  93. u32 *num_clusters);
  94. /*
  95. * Use this variant of ocfs2_claim_clusters to specify a maxiumum
  96. * number of clusters smaller than the allocation reserved.
  97. */
  98. int __ocfs2_claim_clusters(struct ocfs2_super *osb,
  99. handle_t *handle,
  100. struct ocfs2_alloc_context *ac,
  101. u32 min_clusters,
  102. u32 max_clusters,
  103. u32 *cluster_start,
  104. u32 *num_clusters);
  105. int ocfs2_free_suballoc_bits(handle_t *handle,
  106. struct inode *alloc_inode,
  107. struct buffer_head *alloc_bh,
  108. unsigned int start_bit,
  109. u64 bg_blkno,
  110. unsigned int count);
  111. int ocfs2_free_dinode(handle_t *handle,
  112. struct inode *inode_alloc_inode,
  113. struct buffer_head *inode_alloc_bh,
  114. struct ocfs2_dinode *di);
  115. int ocfs2_free_clusters(handle_t *handle,
  116. struct inode *bitmap_inode,
  117. struct buffer_head *bitmap_bh,
  118. u64 start_blk,
  119. unsigned int num_clusters);
  120. static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
  121. {
  122. u64 group = block - (u64) bit;
  123. return group;
  124. }
  125. static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
  126. u64 bg_blkno)
  127. {
  128. /* This should work for all block group descriptors as only
  129. * the 1st group descriptor of the cluster bitmap is
  130. * different. */
  131. if (bg_blkno == osb->first_cluster_group_blkno)
  132. return 0;
  133. /* the rest of the block groups are located at the beginning
  134. * of their 1st cluster, so a direct translation just
  135. * works. */
  136. return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
  137. }
  138. static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
  139. {
  140. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  141. return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
  142. }
  143. /* This is for local alloc ONLY. Others should use the task-specific
  144. * apis above. */
  145. int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
  146. struct ocfs2_alloc_context *ac);
  147. void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac);
  148. /* given a cluster offset, calculate which block group it belongs to
  149. * and return that block offset. */
  150. u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);
  151. /*
  152. * By default, ocfs2_read_group_descriptor() calls ocfs2_error() when it
  153. * finds a problem. A caller that wants to check a group descriptor
  154. * without going readonly should read the block with ocfs2_read_block[s]()
  155. * and then checking it with this function. This is only resize, really.
  156. * Everyone else should be using ocfs2_read_group_descriptor().
  157. */
  158. int ocfs2_check_group_descriptor(struct super_block *sb,
  159. struct ocfs2_dinode *di,
  160. struct buffer_head *bh);
  161. /*
  162. * Read a group descriptor block into *bh. If *bh is NULL, a bh will be
  163. * allocated. This is a cached read. The descriptor will be validated with
  164. * ocfs2_validate_group_descriptor().
  165. */
  166. int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
  167. u64 gd_blkno, struct buffer_head **bh);
  168. int ocfs2_lock_allocators(struct inode *inode, struct ocfs2_extent_tree *et,
  169. u32 clusters_to_add, u32 extents_to_split,
  170. struct ocfs2_alloc_context **data_ac,
  171. struct ocfs2_alloc_context **meta_ac);
  172. int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res);
  173. #endif /* _CHAINALLOC_H_ */