suballoc.h 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  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_bits_wanted;
  37. u32 ac_bits_given;
  38. #define OCFS2_AC_USE_LOCAL 1
  39. #define OCFS2_AC_USE_MAIN 2
  40. #define OCFS2_AC_USE_INODE 3
  41. #define OCFS2_AC_USE_META 4
  42. u32 ac_which;
  43. struct ocfs2_journal_handle *ac_handle;
  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. };
  49. void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
  50. static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
  51. {
  52. return ac->ac_bits_wanted - ac->ac_bits_given;
  53. }
  54. int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
  55. struct ocfs2_journal_handle *handle,
  56. struct ocfs2_dinode *fe,
  57. struct ocfs2_alloc_context **ac);
  58. int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
  59. struct ocfs2_journal_handle *handle,
  60. struct ocfs2_alloc_context **ac);
  61. int ocfs2_reserve_clusters(struct ocfs2_super *osb,
  62. struct ocfs2_journal_handle *handle,
  63. u32 bits_wanted,
  64. struct ocfs2_alloc_context **ac);
  65. int ocfs2_claim_metadata(struct ocfs2_super *osb,
  66. struct ocfs2_journal_handle *handle,
  67. struct ocfs2_alloc_context *ac,
  68. u32 bits_wanted,
  69. u16 *suballoc_bit_start,
  70. u32 *num_bits,
  71. u64 *blkno_start);
  72. int ocfs2_claim_new_inode(struct ocfs2_super *osb,
  73. struct ocfs2_journal_handle *handle,
  74. struct ocfs2_alloc_context *ac,
  75. u16 *suballoc_bit,
  76. u64 *fe_blkno);
  77. int ocfs2_claim_clusters(struct ocfs2_super *osb,
  78. struct ocfs2_journal_handle *handle,
  79. struct ocfs2_alloc_context *ac,
  80. u32 min_clusters,
  81. u32 *cluster_start,
  82. u32 *num_clusters);
  83. int ocfs2_free_dinode(struct ocfs2_journal_handle *handle,
  84. struct inode *inode_alloc_inode,
  85. struct buffer_head *inode_alloc_bh,
  86. struct ocfs2_dinode *di);
  87. int ocfs2_free_extent_block(struct ocfs2_journal_handle *handle,
  88. struct inode *eb_alloc_inode,
  89. struct buffer_head *eb_alloc_bh,
  90. struct ocfs2_extent_block *eb);
  91. int ocfs2_free_clusters(struct ocfs2_journal_handle *handle,
  92. struct inode *bitmap_inode,
  93. struct buffer_head *bitmap_bh,
  94. u64 start_blk,
  95. unsigned int num_clusters);
  96. static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
  97. u64 bg_blkno)
  98. {
  99. /* This should work for all block group descriptors as only
  100. * the 1st group descriptor of the cluster bitmap is
  101. * different. */
  102. if (bg_blkno == osb->first_cluster_group_blkno)
  103. return 0;
  104. /* the rest of the block groups are located at the beginning
  105. * of their 1st cluster, so a direct translation just
  106. * works. */
  107. return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
  108. }
  109. static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
  110. {
  111. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  112. return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
  113. }
  114. /* This is for local alloc ONLY. Others should use the task-specific
  115. * apis above. */
  116. int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
  117. struct ocfs2_alloc_context *ac);
  118. #endif /* _CHAINALLOC_H_ */