ext4_extents.h 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  1. /*
  2. * Copyright (c) 2003-2006, Cluster File Systems, Inc, info@clusterfs.com
  3. * Written by Alex Tomas <alex@clusterfs.com>
  4. *
  5. * This program is free software; you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License version 2 as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public Licens
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-
  17. */
  18. #ifndef _EXT4_EXTENTS
  19. #define _EXT4_EXTENTS
  20. #include "ext4.h"
  21. /*
  22. * With AGGRESSIVE_TEST defined, the capacity of index/leaf blocks
  23. * becomes very small, so index split, in-depth growing and
  24. * other hard changes happen much more often.
  25. * This is for debug purposes only.
  26. */
  27. #define AGGRESSIVE_TEST_
  28. /*
  29. * With EXTENTS_STATS defined, the number of blocks and extents
  30. * are collected in the truncate path. They'll be shown at
  31. * umount time.
  32. */
  33. #define EXTENTS_STATS__
  34. /*
  35. * If CHECK_BINSEARCH is defined, then the results of the binary search
  36. * will also be checked by linear search.
  37. */
  38. #define CHECK_BINSEARCH__
  39. /*
  40. * Turn on EXT_DEBUG to get lots of info about extents operations.
  41. */
  42. #define EXT_DEBUG__
  43. #ifdef EXT_DEBUG
  44. #define ext_debug(a...) printk(a)
  45. #else
  46. #define ext_debug(a...)
  47. #endif
  48. /*
  49. * If EXT_STATS is defined then stats numbers are collected.
  50. * These number will be displayed at umount time.
  51. */
  52. #define EXT_STATS_
  53. /*
  54. * ext4_inode has i_block array (60 bytes total).
  55. * The first 12 bytes store ext4_extent_header;
  56. * the remainder stores an array of ext4_extent.
  57. */
  58. /*
  59. * This is the extent on-disk structure.
  60. * It's used at the bottom of the tree.
  61. */
  62. struct ext4_extent {
  63. __le32 ee_block; /* first logical block extent covers */
  64. __le16 ee_len; /* number of blocks covered by extent */
  65. __le16 ee_start_hi; /* high 16 bits of physical block */
  66. __le32 ee_start_lo; /* low 32 bits of physical block */
  67. };
  68. /*
  69. * This is index on-disk structure.
  70. * It's used at all the levels except the bottom.
  71. */
  72. struct ext4_extent_idx {
  73. __le32 ei_block; /* index covers logical blocks from 'block' */
  74. __le32 ei_leaf_lo; /* pointer to the physical block of the next *
  75. * level. leaf or next index could be there */
  76. __le16 ei_leaf_hi; /* high 16 bits of physical block */
  77. __u16 ei_unused;
  78. };
  79. /*
  80. * Each block (leaves and indexes), even inode-stored has header.
  81. */
  82. struct ext4_extent_header {
  83. __le16 eh_magic; /* probably will support different formats */
  84. __le16 eh_entries; /* number of valid entries */
  85. __le16 eh_max; /* capacity of store in entries */
  86. __le16 eh_depth; /* has tree real underlying blocks? */
  87. __le32 eh_generation; /* generation of the tree */
  88. };
  89. #define EXT4_EXT_MAGIC cpu_to_le16(0xf30a)
  90. /*
  91. * Array of ext4_ext_path contains path to some extent.
  92. * Creation/lookup routines use it for traversal/splitting/etc.
  93. * Truncate uses it to simulate recursive walking.
  94. */
  95. struct ext4_ext_path {
  96. ext4_fsblk_t p_block;
  97. __u16 p_depth;
  98. struct ext4_extent *p_ext;
  99. struct ext4_extent_idx *p_idx;
  100. struct ext4_extent_header *p_hdr;
  101. struct buffer_head *p_bh;
  102. };
  103. /*
  104. * structure for external API
  105. */
  106. /*
  107. * to be called by ext4_ext_walk_space()
  108. * negative retcode - error
  109. * positive retcode - signal for ext4_ext_walk_space(), see below
  110. * callback must return valid extent (passed or newly created)
  111. */
  112. typedef int (*ext_prepare_callback)(struct inode *, ext4_lblk_t,
  113. struct ext4_ext_cache *,
  114. struct ext4_extent *, void *);
  115. #define EXT_CONTINUE 0
  116. #define EXT_BREAK 1
  117. #define EXT_REPEAT 2
  118. /*
  119. * Maximum number of logical blocks in a file; ext4_extent's ee_block is
  120. * __le32.
  121. */
  122. #define EXT_MAX_BLOCKS 0xffffffff
  123. /*
  124. * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an
  125. * initialized extent. This is 2^15 and not (2^16 - 1), since we use the
  126. * MSB of ee_len field in the extent datastructure to signify if this
  127. * particular extent is an initialized extent or an uninitialized (i.e.
  128. * preallocated).
  129. * EXT_UNINIT_MAX_LEN is the maximum number of blocks we can have in an
  130. * uninitialized extent.
  131. * If ee_len is <= 0x8000, it is an initialized extent. Otherwise, it is an
  132. * uninitialized one. In other words, if MSB of ee_len is set, it is an
  133. * uninitialized extent with only one special scenario when ee_len = 0x8000.
  134. * In this case we can not have an uninitialized extent of zero length and
  135. * thus we make it as a special case of initialized extent with 0x8000 length.
  136. * This way we get better extent-to-group alignment for initialized extents.
  137. * Hence, the maximum number of blocks we can have in an *initialized*
  138. * extent is 2^15 (32768) and in an *uninitialized* extent is 2^15-1 (32767).
  139. */
  140. #define EXT_INIT_MAX_LEN (1UL << 15)
  141. #define EXT_UNINIT_MAX_LEN (EXT_INIT_MAX_LEN - 1)
  142. #define EXT_FIRST_EXTENT(__hdr__) \
  143. ((struct ext4_extent *) (((char *) (__hdr__)) + \
  144. sizeof(struct ext4_extent_header)))
  145. #define EXT_FIRST_INDEX(__hdr__) \
  146. ((struct ext4_extent_idx *) (((char *) (__hdr__)) + \
  147. sizeof(struct ext4_extent_header)))
  148. #define EXT_HAS_FREE_INDEX(__path__) \
  149. (le16_to_cpu((__path__)->p_hdr->eh_entries) \
  150. < le16_to_cpu((__path__)->p_hdr->eh_max))
  151. #define EXT_LAST_EXTENT(__hdr__) \
  152. (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
  153. #define EXT_LAST_INDEX(__hdr__) \
  154. (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
  155. #define EXT_MAX_EXTENT(__hdr__) \
  156. (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
  157. #define EXT_MAX_INDEX(__hdr__) \
  158. (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
  159. static inline struct ext4_extent_header *ext_inode_hdr(struct inode *inode)
  160. {
  161. return (struct ext4_extent_header *) EXT4_I(inode)->i_data;
  162. }
  163. static inline struct ext4_extent_header *ext_block_hdr(struct buffer_head *bh)
  164. {
  165. return (struct ext4_extent_header *) bh->b_data;
  166. }
  167. static inline unsigned short ext_depth(struct inode *inode)
  168. {
  169. return le16_to_cpu(ext_inode_hdr(inode)->eh_depth);
  170. }
  171. static inline void
  172. ext4_ext_invalidate_cache(struct inode *inode)
  173. {
  174. EXT4_I(inode)->i_cached_extent.ec_len = 0;
  175. }
  176. static inline void ext4_ext_mark_uninitialized(struct ext4_extent *ext)
  177. {
  178. /* We can not have an uninitialized extent of zero length! */
  179. BUG_ON((le16_to_cpu(ext->ee_len) & ~EXT_INIT_MAX_LEN) == 0);
  180. ext->ee_len |= cpu_to_le16(EXT_INIT_MAX_LEN);
  181. }
  182. static inline int ext4_ext_is_uninitialized(struct ext4_extent *ext)
  183. {
  184. /* Extent with ee_len of 0x8000 is treated as an initialized extent */
  185. return (le16_to_cpu(ext->ee_len) > EXT_INIT_MAX_LEN);
  186. }
  187. static inline int ext4_ext_get_actual_len(struct ext4_extent *ext)
  188. {
  189. return (le16_to_cpu(ext->ee_len) <= EXT_INIT_MAX_LEN ?
  190. le16_to_cpu(ext->ee_len) :
  191. (le16_to_cpu(ext->ee_len) - EXT_INIT_MAX_LEN));
  192. }
  193. static inline void ext4_ext_mark_initialized(struct ext4_extent *ext)
  194. {
  195. ext->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ext));
  196. }
  197. /*
  198. * ext4_ext_pblock:
  199. * combine low and high parts of physical block number into ext4_fsblk_t
  200. */
  201. static inline ext4_fsblk_t ext4_ext_pblock(struct ext4_extent *ex)
  202. {
  203. ext4_fsblk_t block;
  204. block = le32_to_cpu(ex->ee_start_lo);
  205. block |= ((ext4_fsblk_t) le16_to_cpu(ex->ee_start_hi) << 31) << 1;
  206. return block;
  207. }
  208. /*
  209. * ext4_idx_pblock:
  210. * combine low and high parts of a leaf physical block number into ext4_fsblk_t
  211. */
  212. static inline ext4_fsblk_t ext4_idx_pblock(struct ext4_extent_idx *ix)
  213. {
  214. ext4_fsblk_t block;
  215. block = le32_to_cpu(ix->ei_leaf_lo);
  216. block |= ((ext4_fsblk_t) le16_to_cpu(ix->ei_leaf_hi) << 31) << 1;
  217. return block;
  218. }
  219. /*
  220. * ext4_ext_store_pblock:
  221. * stores a large physical block number into an extent struct,
  222. * breaking it into parts
  223. */
  224. static inline void ext4_ext_store_pblock(struct ext4_extent *ex,
  225. ext4_fsblk_t pb)
  226. {
  227. ex->ee_start_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
  228. ex->ee_start_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
  229. 0xffff);
  230. }
  231. /*
  232. * ext4_idx_store_pblock:
  233. * stores a large physical block number into an index struct,
  234. * breaking it into parts
  235. */
  236. static inline void ext4_idx_store_pblock(struct ext4_extent_idx *ix,
  237. ext4_fsblk_t pb)
  238. {
  239. ix->ei_leaf_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
  240. ix->ei_leaf_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
  241. 0xffff);
  242. }
  243. extern int ext4_ext_calc_metadata_amount(struct inode *inode,
  244. ext4_lblk_t lblocks);
  245. extern int ext4_extent_tree_init(handle_t *, struct inode *);
  246. extern int ext4_ext_calc_credits_for_single_extent(struct inode *inode,
  247. int num,
  248. struct ext4_ext_path *path);
  249. extern int ext4_can_extents_be_merged(struct inode *inode,
  250. struct ext4_extent *ex1,
  251. struct ext4_extent *ex2);
  252. extern int ext4_ext_insert_extent(handle_t *, struct inode *, struct ext4_ext_path *, struct ext4_extent *, int);
  253. extern struct ext4_ext_path *ext4_ext_find_extent(struct inode *, ext4_lblk_t,
  254. struct ext4_ext_path *);
  255. extern void ext4_ext_drop_refs(struct ext4_ext_path *);
  256. extern int ext4_ext_check_inode(struct inode *inode);
  257. #endif /* _EXT4_EXTENTS */