jfs_dmap.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316
  1. /*
  2. * Copyright (C) International Business Machines Corp., 2000-2002
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  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
  12. * the GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  17. */
  18. #ifndef _H_JFS_DMAP
  19. #define _H_JFS_DMAP
  20. #include "jfs_txnmgr.h"
  21. #define BMAPVERSION 1 /* version number */
  22. #define TREESIZE (256+64+16+4+1) /* size of a dmap tree */
  23. #define LEAFIND (64+16+4+1) /* index of 1st leaf of a dmap tree */
  24. #define LPERDMAP 256 /* num leaves per dmap tree */
  25. #define L2LPERDMAP 8 /* l2 number of leaves per dmap tree */
  26. #define DBWORD 32 /* # of blks covered by a map word */
  27. #define L2DBWORD 5 /* l2 # of blks covered by a mword */
  28. #define BUDMIN L2DBWORD /* max free string in a map word */
  29. #define BPERDMAP (LPERDMAP * DBWORD) /* num of blks per dmap */
  30. #define L2BPERDMAP 13 /* l2 num of blks per dmap */
  31. #define CTLTREESIZE (1024+256+64+16+4+1) /* size of a dmapctl tree */
  32. #define CTLLEAFIND (256+64+16+4+1) /* idx of 1st leaf of a dmapctl tree */
  33. #define LPERCTL 1024 /* num of leaves per dmapctl tree */
  34. #define L2LPERCTL 10 /* l2 num of leaves per dmapctl tree */
  35. #define ROOT 0 /* index of the root of a tree */
  36. #define NOFREE ((s8) -1) /* no blocks free */
  37. #define MAXAG 128 /* max number of allocation groups */
  38. #define L2MAXAG 7 /* l2 max num of AG */
  39. #define L2MINAGSZ 25 /* l2 of minimum AG size in bytes */
  40. #define BMAPBLKNO 0 /* lblkno of bmap within the map */
  41. /*
  42. * maximum l2 number of disk blocks at the various dmapctl levels.
  43. */
  44. #define L2MAXL0SIZE (L2BPERDMAP + 1 * L2LPERCTL)
  45. #define L2MAXL1SIZE (L2BPERDMAP + 2 * L2LPERCTL)
  46. #define L2MAXL2SIZE (L2BPERDMAP + 3 * L2LPERCTL)
  47. /*
  48. * maximum number of disk blocks at the various dmapctl levels.
  49. */
  50. #define MAXL0SIZE ((s64)1 << L2MAXL0SIZE)
  51. #define MAXL1SIZE ((s64)1 << L2MAXL1SIZE)
  52. #define MAXL2SIZE ((s64)1 << L2MAXL2SIZE)
  53. #define MAXMAPSIZE MAXL2SIZE /* maximum aggregate map size */
  54. /*
  55. * determine the maximum free string for four (lower level) nodes
  56. * of the tree.
  57. */
  58. static inline signed char TREEMAX(signed char *cp)
  59. {
  60. signed char tmp1, tmp2;
  61. tmp1 = max(*(cp+2), *(cp+3));
  62. tmp2 = max(*(cp), *(cp+1));
  63. return max(tmp1, tmp2);
  64. }
  65. /*
  66. * convert disk block number to the logical block number of the dmap
  67. * describing the disk block. s is the log2(number of logical blocks per page)
  68. *
  69. * The calculation figures out how many logical pages are in front of the dmap.
  70. * - the number of dmaps preceding it
  71. * - the number of L0 pages preceding its L0 page
  72. * - the number of L1 pages preceding its L1 page
  73. * - 3 is added to account for the L2, L1, and L0 page for this dmap
  74. * - 1 is added to account for the control page of the map.
  75. */
  76. #define BLKTODMAP(b,s) \
  77. ((((b) >> 13) + ((b) >> 23) + ((b) >> 33) + 3 + 1) << (s))
  78. /*
  79. * convert disk block number to the logical block number of the LEVEL 0
  80. * dmapctl describing the disk block. s is the log2(number of logical blocks
  81. * per page)
  82. *
  83. * The calculation figures out how many logical pages are in front of the L0.
  84. * - the number of dmap pages preceding it
  85. * - the number of L0 pages preceding it
  86. * - the number of L1 pages preceding its L1 page
  87. * - 2 is added to account for the L2, and L1 page for this L0
  88. * - 1 is added to account for the control page of the map.
  89. */
  90. #define BLKTOL0(b,s) \
  91. (((((b) >> 23) << 10) + ((b) >> 23) + ((b) >> 33) + 2 + 1) << (s))
  92. /*
  93. * convert disk block number to the logical block number of the LEVEL 1
  94. * dmapctl describing the disk block. s is the log2(number of logical blocks
  95. * per page)
  96. *
  97. * The calculation figures out how many logical pages are in front of the L1.
  98. * - the number of dmap pages preceding it
  99. * - the number of L0 pages preceding it
  100. * - the number of L1 pages preceding it
  101. * - 1 is added to account for the L2 page
  102. * - 1 is added to account for the control page of the map.
  103. */
  104. #define BLKTOL1(b,s) \
  105. (((((b) >> 33) << 20) + (((b) >> 33) << 10) + ((b) >> 33) + 1 + 1) << (s))
  106. /*
  107. * convert disk block number to the logical block number of the dmapctl
  108. * at the specified level which describes the disk block.
  109. */
  110. #define BLKTOCTL(b,s,l) \
  111. (((l) == 2) ? 1 : ((l) == 1) ? BLKTOL1((b),(s)) : BLKTOL0((b),(s)))
  112. /*
  113. * convert aggregate map size to the zero origin dmapctl level of the
  114. * top dmapctl.
  115. */
  116. #define BMAPSZTOLEV(size) \
  117. (((size) <= MAXL0SIZE) ? 0 : ((size) <= MAXL1SIZE) ? 1 : 2)
  118. /* convert disk block number to allocation group number.
  119. */
  120. #define BLKTOAG(b,sbi) ((b) >> ((sbi)->bmap->db_agl2size))
  121. /* convert allocation group number to starting disk block
  122. * number.
  123. */
  124. #define AGTOBLK(a,ip) \
  125. ((s64)(a) << (JFS_SBI((ip)->i_sb)->bmap->db_agl2size))
  126. /*
  127. * dmap summary tree
  128. *
  129. * dmaptree must be consistent with dmapctl.
  130. */
  131. struct dmaptree {
  132. __le32 nleafs; /* 4: number of tree leafs */
  133. __le32 l2nleafs; /* 4: l2 number of tree leafs */
  134. __le32 leafidx; /* 4: index of first tree leaf */
  135. __le32 height; /* 4: height of the tree */
  136. s8 budmin; /* 1: min l2 tree leaf value to combine */
  137. s8 stree[TREESIZE]; /* TREESIZE: tree */
  138. u8 pad[2]; /* 2: pad to word boundary */
  139. }; /* - 360 - */
  140. /*
  141. * dmap page per 8K blocks bitmap
  142. */
  143. struct dmap {
  144. __le32 nblocks; /* 4: num blks covered by this dmap */
  145. __le32 nfree; /* 4: num of free blks in this dmap */
  146. __le64 start; /* 8: starting blkno for this dmap */
  147. struct dmaptree tree; /* 360: dmap tree */
  148. u8 pad[1672]; /* 1672: pad to 2048 bytes */
  149. __le32 wmap[LPERDMAP]; /* 1024: bits of the working map */
  150. __le32 pmap[LPERDMAP]; /* 1024: bits of the persistent map */
  151. }; /* - 4096 - */
  152. /*
  153. * disk map control page per level.
  154. *
  155. * dmapctl must be consistent with dmaptree.
  156. */
  157. struct dmapctl {
  158. __le32 nleafs; /* 4: number of tree leafs */
  159. __le32 l2nleafs; /* 4: l2 number of tree leafs */
  160. __le32 leafidx; /* 4: index of the first tree leaf */
  161. __le32 height; /* 4: height of tree */
  162. s8 budmin; /* 1: minimum l2 tree leaf value */
  163. s8 stree[CTLTREESIZE]; /* CTLTREESIZE: dmapctl tree */
  164. u8 pad[2714]; /* 2714: pad to 4096 */
  165. }; /* - 4096 - */
  166. /*
  167. * common definition for dmaptree within dmap and dmapctl
  168. */
  169. typedef union dmtree {
  170. struct dmaptree t1;
  171. struct dmapctl t2;
  172. } dmtree_t;
  173. /* macros for accessing fields within dmtree */
  174. #define dmt_nleafs t1.nleafs
  175. #define dmt_l2nleafs t1.l2nleafs
  176. #define dmt_leafidx t1.leafidx
  177. #define dmt_height t1.height
  178. #define dmt_budmin t1.budmin
  179. #define dmt_stree t1.stree
  180. /*
  181. * on-disk aggregate disk allocation map descriptor.
  182. */
  183. struct dbmap_disk {
  184. __le64 dn_mapsize; /* 8: number of blocks in aggregate */
  185. __le64 dn_nfree; /* 8: num free blks in aggregate map */
  186. __le32 dn_l2nbperpage; /* 4: number of blks per page */
  187. __le32 dn_numag; /* 4: total number of ags */
  188. __le32 dn_maxlevel; /* 4: number of active ags */
  189. __le32 dn_maxag; /* 4: max active alloc group number */
  190. __le32 dn_agpref; /* 4: preferred alloc group (hint) */
  191. __le32 dn_aglevel; /* 4: dmapctl level holding the AG */
  192. __le32 dn_agheight; /* 4: height in dmapctl of the AG */
  193. __le32 dn_agwidth; /* 4: width in dmapctl of the AG */
  194. __le32 dn_agstart; /* 4: start tree index at AG height */
  195. __le32 dn_agl2size; /* 4: l2 num of blks per alloc group */
  196. __le64 dn_agfree[MAXAG];/* 8*MAXAG: per AG free count */
  197. __le64 dn_agsize; /* 8: num of blks per alloc group */
  198. s8 dn_maxfreebud; /* 1: max free buddy system */
  199. u8 pad[3007]; /* 3007: pad to 4096 */
  200. }; /* - 4096 - */
  201. struct dbmap {
  202. s64 dn_mapsize; /* number of blocks in aggregate */
  203. s64 dn_nfree; /* num free blks in aggregate map */
  204. int dn_l2nbperpage; /* number of blks per page */
  205. int dn_numag; /* total number of ags */
  206. int dn_maxlevel; /* number of active ags */
  207. int dn_maxag; /* max active alloc group number */
  208. int dn_agpref; /* preferred alloc group (hint) */
  209. int dn_aglevel; /* dmapctl level holding the AG */
  210. int dn_agheight; /* height in dmapctl of the AG */
  211. int dn_agwidth; /* width in dmapctl of the AG */
  212. int dn_agstart; /* start tree index at AG height */
  213. int dn_agl2size; /* l2 num of blks per alloc group */
  214. s64 dn_agfree[MAXAG]; /* per AG free count */
  215. s64 dn_agsize; /* num of blks per alloc group */
  216. signed char dn_maxfreebud; /* max free buddy system */
  217. }; /* - 4096 - */
  218. /*
  219. * in-memory aggregate disk allocation map descriptor.
  220. */
  221. struct bmap {
  222. struct dbmap db_bmap; /* on-disk aggregate map descriptor */
  223. struct inode *db_ipbmap; /* ptr to aggregate map incore inode */
  224. struct mutex db_bmaplock; /* aggregate map lock */
  225. atomic_t db_active[MAXAG]; /* count of active, open files in AG */
  226. u32 *db_DBmap;
  227. };
  228. /* macros for accessing fields within in-memory aggregate map descriptor */
  229. #define db_mapsize db_bmap.dn_mapsize
  230. #define db_nfree db_bmap.dn_nfree
  231. #define db_agfree db_bmap.dn_agfree
  232. #define db_agsize db_bmap.dn_agsize
  233. #define db_agl2size db_bmap.dn_agl2size
  234. #define db_agwidth db_bmap.dn_agwidth
  235. #define db_agheight db_bmap.dn_agheight
  236. #define db_agstart db_bmap.dn_agstart
  237. #define db_numag db_bmap.dn_numag
  238. #define db_maxlevel db_bmap.dn_maxlevel
  239. #define db_aglevel db_bmap.dn_aglevel
  240. #define db_agpref db_bmap.dn_agpref
  241. #define db_maxag db_bmap.dn_maxag
  242. #define db_maxfreebud db_bmap.dn_maxfreebud
  243. #define db_l2nbperpage db_bmap.dn_l2nbperpage
  244. /*
  245. * macros for various conversions needed by the allocators.
  246. * blkstol2(), cntlz(), and cnttz() are operating system dependent functions.
  247. */
  248. /* convert number of blocks to log2 number of blocks, rounding up to
  249. * the next log2 value if blocks is not a l2 multiple.
  250. */
  251. #define BLKSTOL2(d) (blkstol2(d))
  252. /* convert number of leafs to log2 leaf value */
  253. #define NLSTOL2BSZ(n) (31 - cntlz((n)) + BUDMIN)
  254. /* convert leaf index to log2 leaf value */
  255. #define LITOL2BSZ(n,m,b) ((((n) == 0) ? (m) : cnttz((n))) + (b))
  256. /* convert a block number to a dmap control leaf index */
  257. #define BLKTOCTLLEAF(b,m) \
  258. (((b) & (((s64)1 << ((m) + L2LPERCTL)) - 1)) >> (m))
  259. /* convert log2 leaf value to buddy size */
  260. #define BUDSIZE(s,m) (1 << ((s) - (m)))
  261. /*
  262. * external references.
  263. */
  264. extern int dbMount(struct inode *ipbmap);
  265. extern int dbUnmount(struct inode *ipbmap, int mounterror);
  266. extern int dbFree(struct inode *ipbmap, s64 blkno, s64 nblocks);
  267. extern int dbUpdatePMap(struct inode *ipbmap,
  268. int free, s64 blkno, s64 nblocks, struct tblock * tblk);
  269. extern int dbNextAG(struct inode *ipbmap);
  270. extern int dbAlloc(struct inode *ipbmap, s64 hint, s64 nblocks, s64 * results);
  271. extern int dbReAlloc(struct inode *ipbmap,
  272. s64 blkno, s64 nblocks, s64 addnblocks, s64 * results);
  273. extern int dbSync(struct inode *ipbmap);
  274. extern int dbAllocBottomUp(struct inode *ip, s64 blkno, s64 nblocks);
  275. extern int dbExtendFS(struct inode *ipbmap, s64 blkno, s64 nblocks);
  276. extern void dbFinalizeBmap(struct inode *ipbmap);
  277. extern s64 dbMapFileSizeToMapSize(struct inode *ipbmap);
  278. extern s64 dbDiscardAG(struct inode *ip, int agno, s64 minlen);
  279. #endif /* _H_JFS_DMAP */