bmap.h 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277
  1. /*
  2. * bmap.h - NILFS block mapping.
  3. *
  4. * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Written by Koji Sato <koji@osrg.net>.
  21. */
  22. #ifndef _NILFS_BMAP_H
  23. #define _NILFS_BMAP_H
  24. #include <linux/types.h>
  25. #include <linux/fs.h>
  26. #include <linux/buffer_head.h>
  27. #include <linux/nilfs2_fs.h>
  28. #include "alloc.h"
  29. #define NILFS_BMAP_INVALID_PTR 0
  30. #define nilfs_bmap_dkey_to_key(dkey) le64_to_cpu(dkey)
  31. #define nilfs_bmap_key_to_dkey(key) cpu_to_le64(key)
  32. #define nilfs_bmap_dptr_to_ptr(dptr) le64_to_cpu(dptr)
  33. #define nilfs_bmap_ptr_to_dptr(ptr) cpu_to_le64(ptr)
  34. #define nilfs_bmap_keydiff_abs(diff) ((diff) < 0 ? -(diff) : (diff))
  35. struct nilfs_bmap;
  36. /**
  37. * union nilfs_bmap_ptr_req - request for bmap ptr
  38. * @bpr_ptr: bmap pointer
  39. * @bpr_req: request for persistent allocator
  40. */
  41. union nilfs_bmap_ptr_req {
  42. __u64 bpr_ptr;
  43. struct nilfs_palloc_req bpr_req;
  44. };
  45. /**
  46. * struct nilfs_bmap_stats - bmap statistics
  47. * @bs_nblocks: number of blocks created or deleted
  48. */
  49. struct nilfs_bmap_stats {
  50. unsigned int bs_nblocks;
  51. };
  52. /**
  53. * struct nilfs_bmap_operations - bmap operation table
  54. */
  55. struct nilfs_bmap_operations {
  56. int (*bop_lookup)(const struct nilfs_bmap *, __u64, int, __u64 *);
  57. int (*bop_lookup_contig)(const struct nilfs_bmap *, __u64, __u64 *,
  58. unsigned);
  59. int (*bop_insert)(struct nilfs_bmap *, __u64, __u64);
  60. int (*bop_delete)(struct nilfs_bmap *, __u64);
  61. void (*bop_clear)(struct nilfs_bmap *);
  62. int (*bop_propagate)(const struct nilfs_bmap *, struct buffer_head *);
  63. void (*bop_lookup_dirty_buffers)(struct nilfs_bmap *,
  64. struct list_head *);
  65. int (*bop_assign)(struct nilfs_bmap *,
  66. struct buffer_head **,
  67. sector_t,
  68. union nilfs_binfo *);
  69. int (*bop_mark)(struct nilfs_bmap *, __u64, int);
  70. /* The following functions are internal use only. */
  71. int (*bop_last_key)(const struct nilfs_bmap *, __u64 *);
  72. int (*bop_check_insert)(const struct nilfs_bmap *, __u64);
  73. int (*bop_check_delete)(struct nilfs_bmap *, __u64);
  74. int (*bop_gather_data)(struct nilfs_bmap *, __u64 *, __u64 *, int);
  75. };
  76. #define NILFS_BMAP_SIZE (NILFS_INODE_BMAP_SIZE * sizeof(__le64))
  77. #define NILFS_BMAP_KEY_BIT (sizeof(unsigned long) * 8 /* CHAR_BIT */)
  78. #define NILFS_BMAP_NEW_PTR_INIT \
  79. (1UL << (sizeof(unsigned long) * 8 /* CHAR_BIT */ - 1))
  80. static inline int nilfs_bmap_is_new_ptr(unsigned long ptr)
  81. {
  82. return !!(ptr & NILFS_BMAP_NEW_PTR_INIT);
  83. }
  84. /**
  85. * struct nilfs_bmap - bmap structure
  86. * @b_u: raw data
  87. * @b_sem: semaphore
  88. * @b_inode: owner of bmap
  89. * @b_ops: bmap operation table
  90. * @b_last_allocated_key: last allocated key for data block
  91. * @b_last_allocated_ptr: last allocated ptr for data block
  92. * @b_ptr_type: pointer type
  93. * @b_state: state
  94. */
  95. struct nilfs_bmap {
  96. union {
  97. __u8 u_flags;
  98. __le64 u_data[NILFS_BMAP_SIZE / sizeof(__le64)];
  99. } b_u;
  100. struct rw_semaphore b_sem;
  101. struct inode *b_inode;
  102. const struct nilfs_bmap_operations *b_ops;
  103. __u64 b_last_allocated_key;
  104. __u64 b_last_allocated_ptr;
  105. int b_ptr_type;
  106. int b_state;
  107. };
  108. /* pointer type */
  109. #define NILFS_BMAP_PTR_P 0 /* physical block number (i.e. LBN) */
  110. #define NILFS_BMAP_PTR_VS 1 /* virtual block number (single
  111. version) */
  112. #define NILFS_BMAP_PTR_VM 2 /* virtual block number (has multiple
  113. versions) */
  114. #define NILFS_BMAP_PTR_U (-1) /* never perform pointer operations */
  115. #define NILFS_BMAP_USE_VBN(bmap) ((bmap)->b_ptr_type > 0)
  116. /* state */
  117. #define NILFS_BMAP_DIRTY 0x00000001
  118. int nilfs_bmap_test_and_clear_dirty(struct nilfs_bmap *);
  119. int nilfs_bmap_read(struct nilfs_bmap *, struct nilfs_inode *);
  120. void nilfs_bmap_write(struct nilfs_bmap *, struct nilfs_inode *);
  121. int nilfs_bmap_lookup(struct nilfs_bmap *, unsigned long, unsigned long *);
  122. int nilfs_bmap_lookup_contig(struct nilfs_bmap *, __u64, __u64 *, unsigned);
  123. int nilfs_bmap_insert(struct nilfs_bmap *, unsigned long, unsigned long);
  124. int nilfs_bmap_delete(struct nilfs_bmap *, unsigned long);
  125. int nilfs_bmap_last_key(struct nilfs_bmap *, unsigned long *);
  126. int nilfs_bmap_truncate(struct nilfs_bmap *, unsigned long);
  127. void nilfs_bmap_clear(struct nilfs_bmap *);
  128. int nilfs_bmap_propagate(struct nilfs_bmap *, struct buffer_head *);
  129. void nilfs_bmap_lookup_dirty_buffers(struct nilfs_bmap *, struct list_head *);
  130. int nilfs_bmap_assign(struct nilfs_bmap *, struct buffer_head **,
  131. unsigned long, union nilfs_binfo *);
  132. int nilfs_bmap_lookup_at_level(struct nilfs_bmap *, __u64, int, __u64 *);
  133. int nilfs_bmap_mark(struct nilfs_bmap *, __u64, int);
  134. void nilfs_bmap_init_gc(struct nilfs_bmap *);
  135. void nilfs_bmap_init_gcdat(struct nilfs_bmap *, struct nilfs_bmap *);
  136. void nilfs_bmap_commit_gcdat(struct nilfs_bmap *, struct nilfs_bmap *);
  137. /*
  138. * Internal use only
  139. */
  140. struct inode *nilfs_bmap_get_dat(const struct nilfs_bmap *);
  141. int nilfs_bmap_prepare_alloc_v(struct nilfs_bmap *,
  142. union nilfs_bmap_ptr_req *);
  143. void nilfs_bmap_commit_alloc_v(struct nilfs_bmap *,
  144. union nilfs_bmap_ptr_req *);
  145. void nilfs_bmap_abort_alloc_v(struct nilfs_bmap *,
  146. union nilfs_bmap_ptr_req *);
  147. static inline int nilfs_bmap_prepare_alloc_ptr(struct nilfs_bmap *bmap,
  148. union nilfs_bmap_ptr_req *req)
  149. {
  150. if (NILFS_BMAP_USE_VBN(bmap))
  151. return nilfs_bmap_prepare_alloc_v(bmap, req);
  152. /* ignore target ptr */
  153. req->bpr_ptr = bmap->b_last_allocated_ptr++;
  154. return 0;
  155. }
  156. static inline void nilfs_bmap_commit_alloc_ptr(struct nilfs_bmap *bmap,
  157. union nilfs_bmap_ptr_req *req)
  158. {
  159. if (NILFS_BMAP_USE_VBN(bmap))
  160. nilfs_bmap_commit_alloc_v(bmap, req);
  161. }
  162. static inline void nilfs_bmap_abort_alloc_ptr(struct nilfs_bmap *bmap,
  163. union nilfs_bmap_ptr_req *req)
  164. {
  165. if (NILFS_BMAP_USE_VBN(bmap))
  166. nilfs_bmap_abort_alloc_v(bmap, req);
  167. else
  168. bmap->b_last_allocated_ptr--;
  169. }
  170. int nilfs_bmap_prepare_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  171. void nilfs_bmap_commit_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  172. void nilfs_bmap_abort_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  173. static inline int nilfs_bmap_prepare_end_ptr(struct nilfs_bmap *bmap,
  174. union nilfs_bmap_ptr_req *req)
  175. {
  176. return NILFS_BMAP_USE_VBN(bmap) ?
  177. nilfs_bmap_prepare_end_v(bmap, req) : 0;
  178. }
  179. static inline void nilfs_bmap_commit_end_ptr(struct nilfs_bmap *bmap,
  180. union nilfs_bmap_ptr_req *req)
  181. {
  182. if (NILFS_BMAP_USE_VBN(bmap))
  183. nilfs_bmap_commit_end_v(bmap, req);
  184. }
  185. static inline void nilfs_bmap_abort_end_ptr(struct nilfs_bmap *bmap,
  186. union nilfs_bmap_ptr_req *req)
  187. {
  188. if (NILFS_BMAP_USE_VBN(bmap))
  189. nilfs_bmap_abort_end_v(bmap, req);
  190. }
  191. int nilfs_bmap_start_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *,
  192. sector_t);
  193. int nilfs_bmap_move_v(const struct nilfs_bmap *, __u64, sector_t);
  194. int nilfs_bmap_mark_dirty(const struct nilfs_bmap *, __u64);
  195. __u64 nilfs_bmap_data_get_key(const struct nilfs_bmap *,
  196. const struct buffer_head *);
  197. __u64 nilfs_bmap_find_target_seq(const struct nilfs_bmap *, __u64);
  198. __u64 nilfs_bmap_find_target_in_group(const struct nilfs_bmap *);
  199. int nilfs_bmap_prepare_update_v(struct nilfs_bmap *,
  200. union nilfs_bmap_ptr_req *,
  201. union nilfs_bmap_ptr_req *);
  202. void nilfs_bmap_commit_update_v(struct nilfs_bmap *,
  203. union nilfs_bmap_ptr_req *,
  204. union nilfs_bmap_ptr_req *);
  205. void nilfs_bmap_abort_update_v(struct nilfs_bmap *,
  206. union nilfs_bmap_ptr_req *,
  207. union nilfs_bmap_ptr_req *);
  208. void nilfs_bmap_add_blocks(const struct nilfs_bmap *, int);
  209. void nilfs_bmap_sub_blocks(const struct nilfs_bmap *, int);
  210. /* Assume that bmap semaphore is locked. */
  211. static inline int nilfs_bmap_dirty(const struct nilfs_bmap *bmap)
  212. {
  213. return !!(bmap->b_state & NILFS_BMAP_DIRTY);
  214. }
  215. /* Assume that bmap semaphore is locked. */
  216. static inline void nilfs_bmap_set_dirty(struct nilfs_bmap *bmap)
  217. {
  218. bmap->b_state |= NILFS_BMAP_DIRTY;
  219. }
  220. /* Assume that bmap semaphore is locked. */
  221. static inline void nilfs_bmap_clear_dirty(struct nilfs_bmap *bmap)
  222. {
  223. bmap->b_state &= ~NILFS_BMAP_DIRTY;
  224. }
  225. #define NILFS_BMAP_LARGE 0x1
  226. #define NILFS_BMAP_SMALL_LOW NILFS_DIRECT_KEY_MIN
  227. #define NILFS_BMAP_SMALL_HIGH NILFS_DIRECT_KEY_MAX
  228. #define NILFS_BMAP_LARGE_LOW NILFS_BTREE_ROOT_NCHILDREN_MAX
  229. #define NILFS_BMAP_LARGE_HIGH NILFS_BTREE_KEY_MAX
  230. #endif /* _NILFS_BMAP_H */