bmap.h 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273
  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_insert)(struct nilfs_bmap *, __u64, __u64);
  58. int (*bop_delete)(struct nilfs_bmap *, __u64);
  59. void (*bop_clear)(struct nilfs_bmap *);
  60. int (*bop_propagate)(const struct nilfs_bmap *, struct buffer_head *);
  61. void (*bop_lookup_dirty_buffers)(struct nilfs_bmap *,
  62. struct list_head *);
  63. int (*bop_assign)(struct nilfs_bmap *,
  64. struct buffer_head **,
  65. sector_t,
  66. union nilfs_binfo *);
  67. int (*bop_mark)(struct nilfs_bmap *, __u64, int);
  68. /* The following functions are internal use only. */
  69. int (*bop_last_key)(const struct nilfs_bmap *, __u64 *);
  70. int (*bop_check_insert)(const struct nilfs_bmap *, __u64);
  71. int (*bop_check_delete)(struct nilfs_bmap *, __u64);
  72. int (*bop_gather_data)(struct nilfs_bmap *, __u64 *, __u64 *, int);
  73. };
  74. #define NILFS_BMAP_SIZE (NILFS_INODE_BMAP_SIZE * sizeof(__le64))
  75. #define NILFS_BMAP_KEY_BIT (sizeof(unsigned long) * 8 /* CHAR_BIT */)
  76. #define NILFS_BMAP_NEW_PTR_INIT \
  77. (1UL << (sizeof(unsigned long) * 8 /* CHAR_BIT */ - 1))
  78. static inline int nilfs_bmap_is_new_ptr(unsigned long ptr)
  79. {
  80. return !!(ptr & NILFS_BMAP_NEW_PTR_INIT);
  81. }
  82. /**
  83. * struct nilfs_bmap - bmap structure
  84. * @b_u: raw data
  85. * @b_sem: semaphore
  86. * @b_inode: owner of bmap
  87. * @b_ops: bmap operation table
  88. * @b_last_allocated_key: last allocated key for data block
  89. * @b_last_allocated_ptr: last allocated ptr for data block
  90. * @b_ptr_type: pointer type
  91. * @b_state: state
  92. */
  93. struct nilfs_bmap {
  94. union {
  95. __u8 u_flags;
  96. __le64 u_data[NILFS_BMAP_SIZE / sizeof(__le64)];
  97. } b_u;
  98. struct rw_semaphore b_sem;
  99. struct inode *b_inode;
  100. const struct nilfs_bmap_operations *b_ops;
  101. __u64 b_last_allocated_key;
  102. __u64 b_last_allocated_ptr;
  103. int b_ptr_type;
  104. int b_state;
  105. };
  106. /* pointer type */
  107. #define NILFS_BMAP_PTR_P 0 /* physical block number (i.e. LBN) */
  108. #define NILFS_BMAP_PTR_VS 1 /* virtual block number (single
  109. version) */
  110. #define NILFS_BMAP_PTR_VM 2 /* virtual block number (has multiple
  111. versions) */
  112. #define NILFS_BMAP_PTR_U (-1) /* never perform pointer operations */
  113. #define NILFS_BMAP_USE_VBN(bmap) ((bmap)->b_ptr_type > 0)
  114. /* state */
  115. #define NILFS_BMAP_DIRTY 0x00000001
  116. int nilfs_bmap_test_and_clear_dirty(struct nilfs_bmap *);
  117. int nilfs_bmap_read(struct nilfs_bmap *, struct nilfs_inode *);
  118. void nilfs_bmap_write(struct nilfs_bmap *, struct nilfs_inode *);
  119. int nilfs_bmap_lookup(struct nilfs_bmap *, unsigned long, unsigned long *);
  120. int nilfs_bmap_insert(struct nilfs_bmap *, unsigned long, unsigned long);
  121. int nilfs_bmap_delete(struct nilfs_bmap *, unsigned long);
  122. int nilfs_bmap_last_key(struct nilfs_bmap *, unsigned long *);
  123. int nilfs_bmap_truncate(struct nilfs_bmap *, unsigned long);
  124. void nilfs_bmap_clear(struct nilfs_bmap *);
  125. int nilfs_bmap_propagate(struct nilfs_bmap *, struct buffer_head *);
  126. void nilfs_bmap_lookup_dirty_buffers(struct nilfs_bmap *, struct list_head *);
  127. int nilfs_bmap_assign(struct nilfs_bmap *, struct buffer_head **,
  128. unsigned long, union nilfs_binfo *);
  129. int nilfs_bmap_lookup_at_level(struct nilfs_bmap *, __u64, int, __u64 *);
  130. int nilfs_bmap_mark(struct nilfs_bmap *, __u64, int);
  131. void nilfs_bmap_init_gc(struct nilfs_bmap *);
  132. void nilfs_bmap_init_gcdat(struct nilfs_bmap *, struct nilfs_bmap *);
  133. void nilfs_bmap_commit_gcdat(struct nilfs_bmap *, struct nilfs_bmap *);
  134. /*
  135. * Internal use only
  136. */
  137. int nilfs_bmap_prepare_alloc_v(struct nilfs_bmap *,
  138. union nilfs_bmap_ptr_req *);
  139. void nilfs_bmap_commit_alloc_v(struct nilfs_bmap *,
  140. union nilfs_bmap_ptr_req *);
  141. void nilfs_bmap_abort_alloc_v(struct nilfs_bmap *,
  142. union nilfs_bmap_ptr_req *);
  143. static inline int nilfs_bmap_prepare_alloc_ptr(struct nilfs_bmap *bmap,
  144. union nilfs_bmap_ptr_req *req)
  145. {
  146. if (NILFS_BMAP_USE_VBN(bmap))
  147. return nilfs_bmap_prepare_alloc_v(bmap, req);
  148. /* ignore target ptr */
  149. req->bpr_ptr = bmap->b_last_allocated_ptr++;
  150. return 0;
  151. }
  152. static inline void nilfs_bmap_commit_alloc_ptr(struct nilfs_bmap *bmap,
  153. union nilfs_bmap_ptr_req *req)
  154. {
  155. if (NILFS_BMAP_USE_VBN(bmap))
  156. nilfs_bmap_commit_alloc_v(bmap, req);
  157. }
  158. static inline void nilfs_bmap_abort_alloc_ptr(struct nilfs_bmap *bmap,
  159. union nilfs_bmap_ptr_req *req)
  160. {
  161. if (NILFS_BMAP_USE_VBN(bmap))
  162. nilfs_bmap_abort_alloc_v(bmap, req);
  163. else
  164. bmap->b_last_allocated_ptr--;
  165. }
  166. int nilfs_bmap_prepare_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  167. void nilfs_bmap_commit_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  168. void nilfs_bmap_abort_end_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *);
  169. static inline int nilfs_bmap_prepare_end_ptr(struct nilfs_bmap *bmap,
  170. union nilfs_bmap_ptr_req *req)
  171. {
  172. return NILFS_BMAP_USE_VBN(bmap) ?
  173. nilfs_bmap_prepare_end_v(bmap, req) : 0;
  174. }
  175. static inline void nilfs_bmap_commit_end_ptr(struct nilfs_bmap *bmap,
  176. union nilfs_bmap_ptr_req *req)
  177. {
  178. if (NILFS_BMAP_USE_VBN(bmap))
  179. nilfs_bmap_commit_end_v(bmap, req);
  180. }
  181. static inline void nilfs_bmap_abort_end_ptr(struct nilfs_bmap *bmap,
  182. union nilfs_bmap_ptr_req *req)
  183. {
  184. if (NILFS_BMAP_USE_VBN(bmap))
  185. nilfs_bmap_abort_end_v(bmap, req);
  186. }
  187. int nilfs_bmap_start_v(struct nilfs_bmap *, union nilfs_bmap_ptr_req *,
  188. sector_t);
  189. int nilfs_bmap_move_v(const struct nilfs_bmap *, __u64, sector_t);
  190. int nilfs_bmap_mark_dirty(const struct nilfs_bmap *, __u64);
  191. __u64 nilfs_bmap_data_get_key(const struct nilfs_bmap *,
  192. const struct buffer_head *);
  193. __u64 nilfs_bmap_find_target_seq(const struct nilfs_bmap *, __u64);
  194. __u64 nilfs_bmap_find_target_in_group(const struct nilfs_bmap *);
  195. int nilfs_bmap_prepare_update_v(struct nilfs_bmap *,
  196. union nilfs_bmap_ptr_req *,
  197. union nilfs_bmap_ptr_req *);
  198. void nilfs_bmap_commit_update_v(struct nilfs_bmap *,
  199. union nilfs_bmap_ptr_req *,
  200. union nilfs_bmap_ptr_req *);
  201. void nilfs_bmap_abort_update_v(struct nilfs_bmap *,
  202. union nilfs_bmap_ptr_req *,
  203. union nilfs_bmap_ptr_req *);
  204. void nilfs_bmap_add_blocks(const struct nilfs_bmap *, int);
  205. void nilfs_bmap_sub_blocks(const struct nilfs_bmap *, int);
  206. /* Assume that bmap semaphore is locked. */
  207. static inline int nilfs_bmap_dirty(const struct nilfs_bmap *bmap)
  208. {
  209. return !!(bmap->b_state & NILFS_BMAP_DIRTY);
  210. }
  211. /* Assume that bmap semaphore is locked. */
  212. static inline void nilfs_bmap_set_dirty(struct nilfs_bmap *bmap)
  213. {
  214. bmap->b_state |= NILFS_BMAP_DIRTY;
  215. }
  216. /* Assume that bmap semaphore is locked. */
  217. static inline void nilfs_bmap_clear_dirty(struct nilfs_bmap *bmap)
  218. {
  219. bmap->b_state &= ~NILFS_BMAP_DIRTY;
  220. }
  221. #define NILFS_BMAP_LARGE 0x1
  222. #define NILFS_BMAP_SMALL_LOW NILFS_DIRECT_KEY_MIN
  223. #define NILFS_BMAP_SMALL_HIGH NILFS_DIRECT_KEY_MAX
  224. #define NILFS_BMAP_LARGE_LOW NILFS_BTREE_ROOT_NCHILDREN_MAX
  225. #define NILFS_BMAP_LARGE_HIGH NILFS_BTREE_KEY_MAX
  226. #endif /* _NILFS_BMAP_H */