suballoc.h 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159
  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,
  30. u32,
  31. u16 *,
  32. u16 *);
  33. struct ocfs2_alloc_context {
  34. struct inode *ac_inode; /* which bitmap are we allocating from? */
  35. struct buffer_head *ac_bh; /* file entry bh */
  36. u32 ac_alloc_slot; /* which slot are we allocating from? */
  37. u32 ac_bits_wanted;
  38. u32 ac_bits_given;
  39. #define OCFS2_AC_USE_LOCAL 1
  40. #define OCFS2_AC_USE_MAIN 2
  41. #define OCFS2_AC_USE_INODE 3
  42. #define OCFS2_AC_USE_META 4
  43. u32 ac_which;
  44. /* these are used by the chain search */
  45. u16 ac_chain;
  46. int ac_allow_chain_relink;
  47. group_search_t *ac_group_search;
  48. u64 ac_last_group;
  49. };
  50. void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
  51. static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
  52. {
  53. return ac->ac_bits_wanted - ac->ac_bits_given;
  54. }
  55. int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
  56. struct ocfs2_dinode *fe,
  57. struct ocfs2_alloc_context **ac);
  58. int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
  59. struct ocfs2_alloc_context **ac);
  60. int ocfs2_reserve_clusters(struct ocfs2_super *osb,
  61. u32 bits_wanted,
  62. struct ocfs2_alloc_context **ac);
  63. int ocfs2_claim_metadata(struct ocfs2_super *osb,
  64. handle_t *handle,
  65. struct ocfs2_alloc_context *ac,
  66. u32 bits_wanted,
  67. u16 *suballoc_bit_start,
  68. u32 *num_bits,
  69. u64 *blkno_start);
  70. int ocfs2_claim_new_inode(struct ocfs2_super *osb,
  71. handle_t *handle,
  72. struct ocfs2_alloc_context *ac,
  73. u16 *suballoc_bit,
  74. u64 *fe_blkno);
  75. int ocfs2_claim_clusters(struct ocfs2_super *osb,
  76. handle_t *handle,
  77. struct ocfs2_alloc_context *ac,
  78. u32 min_clusters,
  79. u32 *cluster_start,
  80. u32 *num_clusters);
  81. /*
  82. * Use this variant of ocfs2_claim_clusters to specify a maxiumum
  83. * number of clusters smaller than the allocation reserved.
  84. */
  85. int __ocfs2_claim_clusters(struct ocfs2_super *osb,
  86. handle_t *handle,
  87. struct ocfs2_alloc_context *ac,
  88. u32 min_clusters,
  89. u32 max_clusters,
  90. u32 *cluster_start,
  91. u32 *num_clusters);
  92. int ocfs2_free_suballoc_bits(handle_t *handle,
  93. struct inode *alloc_inode,
  94. struct buffer_head *alloc_bh,
  95. unsigned int start_bit,
  96. u64 bg_blkno,
  97. unsigned int count);
  98. int ocfs2_free_dinode(handle_t *handle,
  99. struct inode *inode_alloc_inode,
  100. struct buffer_head *inode_alloc_bh,
  101. struct ocfs2_dinode *di);
  102. int ocfs2_free_clusters(handle_t *handle,
  103. struct inode *bitmap_inode,
  104. struct buffer_head *bitmap_bh,
  105. u64 start_blk,
  106. unsigned int num_clusters);
  107. static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
  108. {
  109. u64 group = block - (u64) bit;
  110. return group;
  111. }
  112. static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
  113. u64 bg_blkno)
  114. {
  115. /* This should work for all block group descriptors as only
  116. * the 1st group descriptor of the cluster bitmap is
  117. * different. */
  118. if (bg_blkno == osb->first_cluster_group_blkno)
  119. return 0;
  120. /* the rest of the block groups are located at the beginning
  121. * of their 1st cluster, so a direct translation just
  122. * works. */
  123. return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
  124. }
  125. static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
  126. {
  127. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  128. return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
  129. }
  130. /* This is for local alloc ONLY. Others should use the task-specific
  131. * apis above. */
  132. int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
  133. struct ocfs2_alloc_context *ac);
  134. /* given a cluster offset, calculate which block group it belongs to
  135. * and return that block offset. */
  136. u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);
  137. /* somewhat more expensive than our other checks, so use sparingly. */
  138. int ocfs2_check_group_descriptor(struct super_block *sb,
  139. struct ocfs2_dinode *di,
  140. struct ocfs2_group_desc *gd);
  141. #endif /* _CHAINALLOC_H_ */