ext4_extents.h 8.1 KB

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