ext4_extents.h 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275
  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. * If EXT_STATS is defined then stats numbers are collected.
  41. * These number will be displayed at umount time.
  42. */
  43. #define EXT_STATS_
  44. /*
  45. * ext4_inode has i_block array (60 bytes total).
  46. * The first 12 bytes store ext4_extent_header;
  47. * the remainder stores an array of ext4_extent.
  48. * For non-inode extent blocks, ext4_extent_tail
  49. * follows the array.
  50. */
  51. /*
  52. * This is the extent tail on-disk structure.
  53. * All other extent structures are 12 bytes long. It turns out that
  54. * block_size % 12 >= 4 for at least all powers of 2 greater than 512, which
  55. * covers all valid ext4 block sizes. Therefore, this tail structure can be
  56. * crammed into the end of the block without having to rebalance the tree.
  57. */
  58. struct ext4_extent_tail {
  59. __le32 et_checksum; /* crc32c(uuid+inum+extent_block) */
  60. };
  61. /*
  62. * This is the extent on-disk structure.
  63. * It's used at the bottom of the tree.
  64. */
  65. struct ext4_extent {
  66. __le32 ee_block; /* first logical block extent covers */
  67. __le16 ee_len; /* number of blocks covered by extent */
  68. __le16 ee_start_hi; /* high 16 bits of physical block */
  69. __le32 ee_start_lo; /* low 32 bits of physical block */
  70. };
  71. /*
  72. * This is index on-disk structure.
  73. * It's used at all the levels except the bottom.
  74. */
  75. struct ext4_extent_idx {
  76. __le32 ei_block; /* index covers logical blocks from 'block' */
  77. __le32 ei_leaf_lo; /* pointer to the physical block of the next *
  78. * level. leaf or next index could be there */
  79. __le16 ei_leaf_hi; /* high 16 bits of physical block */
  80. __u16 ei_unused;
  81. };
  82. /*
  83. * Each block (leaves and indexes), even inode-stored has header.
  84. */
  85. struct ext4_extent_header {
  86. __le16 eh_magic; /* probably will support different formats */
  87. __le16 eh_entries; /* number of valid entries */
  88. __le16 eh_max; /* capacity of store in entries */
  89. __le16 eh_depth; /* has tree real underlying blocks? */
  90. __le32 eh_generation; /* generation of the tree */
  91. };
  92. #define EXT4_EXT_MAGIC cpu_to_le16(0xf30a)
  93. #define EXT4_MAX_EXTENT_DEPTH 5
  94. #define EXT4_EXTENT_TAIL_OFFSET(hdr) \
  95. (sizeof(struct ext4_extent_header) + \
  96. (sizeof(struct ext4_extent) * le16_to_cpu((hdr)->eh_max)))
  97. static inline struct ext4_extent_tail *
  98. find_ext4_extent_tail(struct ext4_extent_header *eh)
  99. {
  100. return (struct ext4_extent_tail *)(((void *)eh) +
  101. EXT4_EXTENT_TAIL_OFFSET(eh));
  102. }
  103. /*
  104. * Array of ext4_ext_path contains path to some extent.
  105. * Creation/lookup routines use it for traversal/splitting/etc.
  106. * Truncate uses it to simulate recursive walking.
  107. */
  108. struct ext4_ext_path {
  109. ext4_fsblk_t p_block;
  110. __u16 p_depth;
  111. __u16 p_maxdepth;
  112. struct ext4_extent *p_ext;
  113. struct ext4_extent_idx *p_idx;
  114. struct ext4_extent_header *p_hdr;
  115. struct buffer_head *p_bh;
  116. };
  117. /*
  118. * structure for external API
  119. */
  120. /*
  121. * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an
  122. * initialized extent. This is 2^15 and not (2^16 - 1), since we use the
  123. * MSB of ee_len field in the extent datastructure to signify if this
  124. * particular extent is an initialized extent or an unwritten (i.e.
  125. * preallocated).
  126. * EXT_UNWRITTEN_MAX_LEN is the maximum number of blocks we can have in an
  127. * unwritten extent.
  128. * If ee_len is <= 0x8000, it is an initialized extent. Otherwise, it is an
  129. * unwritten one. In other words, if MSB of ee_len is set, it is an
  130. * unwritten extent with only one special scenario when ee_len = 0x8000.
  131. * In this case we can not have an unwritten extent of zero length and
  132. * thus we make it as a special case of initialized extent with 0x8000 length.
  133. * This way we get better extent-to-group alignment for initialized extents.
  134. * Hence, the maximum number of blocks we can have in an *initialized*
  135. * extent is 2^15 (32768) and in an *unwritten* extent is 2^15-1 (32767).
  136. */
  137. #define EXT_INIT_MAX_LEN (1UL << 15)
  138. #define EXT_UNWRITTEN_MAX_LEN (EXT_INIT_MAX_LEN - 1)
  139. #define EXT_FIRST_EXTENT(__hdr__) \
  140. ((struct ext4_extent *) (((char *) (__hdr__)) + \
  141. sizeof(struct ext4_extent_header)))
  142. #define EXT_FIRST_INDEX(__hdr__) \
  143. ((struct ext4_extent_idx *) (((char *) (__hdr__)) + \
  144. sizeof(struct ext4_extent_header)))
  145. #define EXT_HAS_FREE_INDEX(__path__) \
  146. (le16_to_cpu((__path__)->p_hdr->eh_entries) \
  147. < le16_to_cpu((__path__)->p_hdr->eh_max))
  148. #define EXT_LAST_EXTENT(__hdr__) \
  149. (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
  150. #define EXT_LAST_INDEX(__hdr__) \
  151. (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_entries) - 1)
  152. #define EXT_MAX_EXTENT(__hdr__) \
  153. (EXT_FIRST_EXTENT((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
  154. #define EXT_MAX_INDEX(__hdr__) \
  155. (EXT_FIRST_INDEX((__hdr__)) + le16_to_cpu((__hdr__)->eh_max) - 1)
  156. static inline struct ext4_extent_header *ext_inode_hdr(struct inode *inode)
  157. {
  158. return (struct ext4_extent_header *) EXT4_I(inode)->i_data;
  159. }
  160. static inline struct ext4_extent_header *ext_block_hdr(struct buffer_head *bh)
  161. {
  162. return (struct ext4_extent_header *) bh->b_data;
  163. }
  164. static inline unsigned short ext_depth(struct inode *inode)
  165. {
  166. return le16_to_cpu(ext_inode_hdr(inode)->eh_depth);
  167. }
  168. static inline void ext4_ext_mark_unwritten(struct ext4_extent *ext)
  169. {
  170. /* We can not have an unwritten extent of zero length! */
  171. BUG_ON((le16_to_cpu(ext->ee_len) & ~EXT_INIT_MAX_LEN) == 0);
  172. ext->ee_len |= cpu_to_le16(EXT_INIT_MAX_LEN);
  173. }
  174. static inline int ext4_ext_is_unwritten(struct ext4_extent *ext)
  175. {
  176. /* Extent with ee_len of 0x8000 is treated as an initialized extent */
  177. return (le16_to_cpu(ext->ee_len) > EXT_INIT_MAX_LEN);
  178. }
  179. static inline int ext4_ext_get_actual_len(struct ext4_extent *ext)
  180. {
  181. return (le16_to_cpu(ext->ee_len) <= EXT_INIT_MAX_LEN ?
  182. le16_to_cpu(ext->ee_len) :
  183. (le16_to_cpu(ext->ee_len) - EXT_INIT_MAX_LEN));
  184. }
  185. static inline void ext4_ext_mark_initialized(struct ext4_extent *ext)
  186. {
  187. ext->ee_len = cpu_to_le16(ext4_ext_get_actual_len(ext));
  188. }
  189. /*
  190. * ext4_ext_pblock:
  191. * combine low and high parts of physical block number into ext4_fsblk_t
  192. */
  193. static inline ext4_fsblk_t ext4_ext_pblock(struct ext4_extent *ex)
  194. {
  195. ext4_fsblk_t block;
  196. block = le32_to_cpu(ex->ee_start_lo);
  197. block |= ((ext4_fsblk_t) le16_to_cpu(ex->ee_start_hi) << 31) << 1;
  198. return block;
  199. }
  200. /*
  201. * ext4_idx_pblock:
  202. * combine low and high parts of a leaf physical block number into ext4_fsblk_t
  203. */
  204. static inline ext4_fsblk_t ext4_idx_pblock(struct ext4_extent_idx *ix)
  205. {
  206. ext4_fsblk_t block;
  207. block = le32_to_cpu(ix->ei_leaf_lo);
  208. block |= ((ext4_fsblk_t) le16_to_cpu(ix->ei_leaf_hi) << 31) << 1;
  209. return block;
  210. }
  211. /*
  212. * ext4_ext_store_pblock:
  213. * stores a large physical block number into an extent struct,
  214. * breaking it into parts
  215. */
  216. static inline void ext4_ext_store_pblock(struct ext4_extent *ex,
  217. ext4_fsblk_t pb)
  218. {
  219. ex->ee_start_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
  220. ex->ee_start_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
  221. 0xffff);
  222. }
  223. /*
  224. * ext4_idx_store_pblock:
  225. * stores a large physical block number into an index struct,
  226. * breaking it into parts
  227. */
  228. static inline void ext4_idx_store_pblock(struct ext4_extent_idx *ix,
  229. ext4_fsblk_t pb)
  230. {
  231. ix->ei_leaf_lo = cpu_to_le32((unsigned long) (pb & 0xffffffff));
  232. ix->ei_leaf_hi = cpu_to_le16((unsigned long) ((pb >> 31) >> 1) &
  233. 0xffff);
  234. }
  235. #define ext4_ext_dirty(handle, inode, path) \
  236. __ext4_ext_dirty(__func__, __LINE__, (handle), (inode), (path))
  237. int __ext4_ext_dirty(const char *where, unsigned int line, handle_t *handle,
  238. struct inode *inode, struct ext4_ext_path *path);
  239. #endif /* _EXT4_EXTENTS */