1 /* SPDX-License-Identifier: GPL-2.0-or-later * <<
2 /* 1 /*
3 * Copyright (C) International Business Mach 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
4 */ 17 */
5 #ifndef _H_JFS_IMAP 18 #ifndef _H_JFS_IMAP
6 #define _H_JFS_IMAP 19 #define _H_JFS_IMAP
7 20
8 #include "jfs_txnmgr.h" 21 #include "jfs_txnmgr.h"
9 22
10 /* 23 /*
11 * jfs_imap.h: disk inode manager 24 * jfs_imap.h: disk inode manager
12 */ 25 */
13 26
14 #define EXTSPERIAG 128 /* number of d 27 #define EXTSPERIAG 128 /* number of disk inode extent per iag */
15 #define IMAPBLKNO 0 /* lblkno of d 28 #define IMAPBLKNO 0 /* lblkno of dinomap within inode map */
16 #define SMAPSZ 4 /* number of w 29 #define SMAPSZ 4 /* number of words per summary map */
17 #define EXTSPERSUM 32 /* number of e 30 #define EXTSPERSUM 32 /* number of extents per summary map entry */
18 #define L2EXTSPERSUM 5 /* l2 number o 31 #define L2EXTSPERSUM 5 /* l2 number of extents per summary map */
19 #define PGSPERIEXT 4 /* number of 4 32 #define PGSPERIEXT 4 /* number of 4K pages per dinode extent */
20 #define MAXIAGS ((1<<20)-1) /* max 33 #define MAXIAGS ((1<<20)-1) /* maximum number of iags */
21 #define MAXAG 128 /* maximum num 34 #define MAXAG 128 /* maximum number of allocation groups */
22 35
23 #define AMAPSIZE 512 /* bytes in th 36 #define AMAPSIZE 512 /* bytes in the IAG allocation maps */
24 #define SMAPSIZE 16 /* bytes in th 37 #define SMAPSIZE 16 /* bytes in the IAG summary maps */
25 38
26 /* convert inode number to iag number */ 39 /* convert inode number to iag number */
27 #define INOTOIAG(ino) ((ino) >> L2INOSPERIAG 40 #define INOTOIAG(ino) ((ino) >> L2INOSPERIAG)
28 41
29 /* convert iag number to logical block number 42 /* convert iag number to logical block number of the iag page */
30 #define IAGTOLBLK(iagno,l2nbperpg) (((iag 43 #define IAGTOLBLK(iagno,l2nbperpg) (((iagno) + 1) << (l2nbperpg))
31 44
32 /* get the starting block number of the 4K pag 45 /* get the starting block number of the 4K page of an inode extent
33 * that contains ino. 46 * that contains ino.
34 */ 47 */
35 #define INOPBLK(pxd,ino,l2nbperpg) (addre 48 #define INOPBLK(pxd,ino,l2nbperpg) (addressPXD((pxd)) + \
36 ((((ino) & (INOSPEREXT-1)) >> L2INOSPE 49 ((((ino) & (INOSPEREXT-1)) >> L2INOSPERPAGE) << (l2nbperpg)))
37 50
38 /* 51 /*
39 * inode allocation map: 52 * inode allocation map:
40 * 53 *
41 * inode allocation map consists of 54 * inode allocation map consists of
42 * . the inode map control page and 55 * . the inode map control page and
43 * . inode allocation group pages (per 4096 in 56 * . inode allocation group pages (per 4096 inodes)
44 * which are addressed by standard JFS xtree. 57 * which are addressed by standard JFS xtree.
45 */ 58 */
46 /* 59 /*
47 * inode allocation group page (per 4096 60 * inode allocation group page (per 4096 inodes of an AG)
48 */ 61 */
49 struct iag { 62 struct iag {
50 __le64 agstart; /* 8: starting 63 __le64 agstart; /* 8: starting block of ag */
51 __le32 iagnum; /* 4: inode al 64 __le32 iagnum; /* 4: inode allocation group number */
52 __le32 inofreefwd; /* 4: ag inode 65 __le32 inofreefwd; /* 4: ag inode free list forward */
53 __le32 inofreeback; /* 4: ag inode 66 __le32 inofreeback; /* 4: ag inode free list back */
54 __le32 extfreefwd; /* 4: ag inode 67 __le32 extfreefwd; /* 4: ag inode extent free list forward */
55 __le32 extfreeback; /* 4: ag inode 68 __le32 extfreeback; /* 4: ag inode extent free list back */
56 __le32 iagfree; /* 4: iag free 69 __le32 iagfree; /* 4: iag free list */
57 70
58 /* summary map: 1 bit per inode extent 71 /* summary map: 1 bit per inode extent */
59 __le32 inosmap[SMAPSZ]; /* 16: sum map 72 __le32 inosmap[SMAPSZ]; /* 16: sum map of mapwords w/ free inodes;
60 * note: 73 * note: this indicates free and backed
61 * inodes 74 * inodes, if the extent is not backed the
62 * value 75 * value will be 1. if the extent is
63 * backed 76 * backed but all inodes are being used the
64 * value 77 * value will be 1. if the extent is
65 * backed 78 * backed but at least one of the inodes is
66 * free t 79 * free the value will be 0.
67 */ 80 */
68 __le32 extsmap[SMAPSZ]; /* 16: sum map 81 __le32 extsmap[SMAPSZ]; /* 16: sum map of mapwords w/ free extents */
69 __le32 nfreeinos; /* 4: number o 82 __le32 nfreeinos; /* 4: number of free inodes */
70 __le32 nfreeexts; /* 4: number o 83 __le32 nfreeexts; /* 4: number of free extents */
71 /* (72) */ 84 /* (72) */
72 u8 pad[1976]; /* 1976: pad t 85 u8 pad[1976]; /* 1976: pad to 2048 bytes */
73 /* allocation bit map: 1 bit per inode 86 /* allocation bit map: 1 bit per inode (0 - free, 1 - allocated) */
74 __le32 wmap[EXTSPERIAG]; /* 512 87 __le32 wmap[EXTSPERIAG]; /* 512: working allocation map */
75 __le32 pmap[EXTSPERIAG]; /* 512 88 __le32 pmap[EXTSPERIAG]; /* 512: persistent allocation map */
76 pxd_t inoext[EXTSPERIAG]; /* 102 89 pxd_t inoext[EXTSPERIAG]; /* 1024: inode extent addresses */
77 }; /* (4096) */ 90 }; /* (4096) */
78 91
79 /* 92 /*
80 * per AG control information (in inode m 93 * per AG control information (in inode map control page)
81 */ 94 */
82 struct iagctl_disk { 95 struct iagctl_disk {
83 __le32 inofree; /* 4: free ino 96 __le32 inofree; /* 4: free inode list anchor */
84 __le32 extfree; /* 4: free ext 97 __le32 extfree; /* 4: free extent list anchor */
85 __le32 numinos; /* 4: number o 98 __le32 numinos; /* 4: number of backed inodes */
86 __le32 numfree; /* 4: number o 99 __le32 numfree; /* 4: number of free inodes */
87 }; /* (16) */ 100 }; /* (16) */
88 101
89 struct iagctl { 102 struct iagctl {
90 int inofree; /* free inode 103 int inofree; /* free inode list anchor */
91 int extfree; /* free extent 104 int extfree; /* free extent list anchor */
92 int numinos; /* number of b 105 int numinos; /* number of backed inodes */
93 int numfree; /* number of f 106 int numfree; /* number of free inodes */
94 }; 107 };
95 108
96 /* 109 /*
97 * per fileset/aggregate inode map contro 110 * per fileset/aggregate inode map control page
98 */ 111 */
99 struct dinomap_disk { 112 struct dinomap_disk {
100 __le32 in_freeiag; /* 4: free iag 113 __le32 in_freeiag; /* 4: free iag list anchor */
101 __le32 in_nextiag; /* 4: next fre 114 __le32 in_nextiag; /* 4: next free iag number */
102 __le32 in_numinos; /* 4: num of b 115 __le32 in_numinos; /* 4: num of backed inodes */
103 __le32 in_numfree; /* 4: num of f 116 __le32 in_numfree; /* 4: num of free backed inodes */
104 __le32 in_nbperiext; /* 4: num of b 117 __le32 in_nbperiext; /* 4: num of blocks per inode extent */
105 __le32 in_l2nbperiext; /* 4: l2 of in 118 __le32 in_l2nbperiext; /* 4: l2 of in_nbperiext */
106 __le32 in_diskblock; /* 4: for stan 119 __le32 in_diskblock; /* 4: for standalone test driver */
107 __le32 in_maxag; /* 4: for stan 120 __le32 in_maxag; /* 4: for standalone test driver */
108 u8 pad[2016]; /* 2016: pad t 121 u8 pad[2016]; /* 2016: pad to 2048 */
109 struct iagctl_disk in_agctl[MAXAG]; /* 122 struct iagctl_disk in_agctl[MAXAG]; /* 2048: AG control information */
110 }; /* (4096) */ 123 }; /* (4096) */
111 124
112 struct dinomap { 125 struct dinomap {
113 int in_freeiag; /* free iag li 126 int in_freeiag; /* free iag list anchor */
114 int in_nextiag; /* next free i 127 int in_nextiag; /* next free iag number */
115 int in_numinos; /* num of back 128 int in_numinos; /* num of backed inodes */
116 int in_numfree; /* num of free 129 int in_numfree; /* num of free backed inodes */
117 int in_nbperiext; /* num of bloc 130 int in_nbperiext; /* num of blocks per inode extent */
118 int in_l2nbperiext; /* l2 of in_nb 131 int in_l2nbperiext; /* l2 of in_nbperiext */
119 int in_diskblock; /* for standal 132 int in_diskblock; /* for standalone test driver */
120 int in_maxag; /* for standal 133 int in_maxag; /* for standalone test driver */
121 struct iagctl in_agctl[MAXAG]; /* AG 134 struct iagctl in_agctl[MAXAG]; /* AG control information */
122 }; 135 };
123 136
124 /* 137 /*
125 * In-core inode map control page 138 * In-core inode map control page
126 */ 139 */
127 struct inomap { 140 struct inomap {
128 struct dinomap im_imap; /* 409 141 struct dinomap im_imap; /* 4096: inode allocation control */
129 struct inode *im_ipimap; /* 4: 142 struct inode *im_ipimap; /* 4: ptr to inode for imap */
130 struct mutex im_freelock; /* 4: 143 struct mutex im_freelock; /* 4: iag free list lock */
131 struct mutex im_aglock[MAXAG]; /* 512 144 struct mutex im_aglock[MAXAG]; /* 512: per AG locks */
132 u32 *im_DBGdimap; 145 u32 *im_DBGdimap;
133 atomic_t im_numinos; /* num of back 146 atomic_t im_numinos; /* num of backed inodes */
134 atomic_t im_numfree; /* num of free 147 atomic_t im_numfree; /* num of free backed inodes */
135 }; 148 };
136 149
137 #define im_freeiag im_imap.in_freeiag 150 #define im_freeiag im_imap.in_freeiag
138 #define im_nextiag im_imap.in_nextiag 151 #define im_nextiag im_imap.in_nextiag
139 #define im_agctl im_imap.in_agctl 152 #define im_agctl im_imap.in_agctl
140 #define im_nbperiext im_imap.in_nbperiext 153 #define im_nbperiext im_imap.in_nbperiext
141 #define im_l2nbperiext im_imap.in_l2nbperiext 154 #define im_l2nbperiext im_imap.in_l2nbperiext
142 155
143 /* for standalone testdriver 156 /* for standalone testdriver
144 */ 157 */
145 #define im_diskblock im_imap.in_diskblock 158 #define im_diskblock im_imap.in_diskblock
146 #define im_maxag im_imap.in_maxag 159 #define im_maxag im_imap.in_maxag
147 160
148 extern int diFree(struct inode *); 161 extern int diFree(struct inode *);
149 extern int diAlloc(struct inode *, bool, struc 162 extern int diAlloc(struct inode *, bool, struct inode *);
150 extern int diSync(struct inode *); 163 extern int diSync(struct inode *);
151 /* external references */ 164 /* external references */
152 extern int diUpdatePMap(struct inode *ipimap, 165 extern int diUpdatePMap(struct inode *ipimap, unsigned long inum,
153 bool is_free, struct t 166 bool is_free, struct tblock * tblk);
154 extern int diExtendFS(struct inode *ipimap, st 167 extern int diExtendFS(struct inode *ipimap, struct inode *ipbmap);
155 extern int diMount(struct inode *); 168 extern int diMount(struct inode *);
156 extern int diUnmount(struct inode *, int); 169 extern int diUnmount(struct inode *, int);
157 extern int diRead(struct inode *); 170 extern int diRead(struct inode *);
158 extern struct inode *diReadSpecial(struct supe 171 extern struct inode *diReadSpecial(struct super_block *, ino_t, int);
159 extern void diWriteSpecial(struct inode *, int 172 extern void diWriteSpecial(struct inode *, int);
160 extern void diFreeSpecial(struct inode *); 173 extern void diFreeSpecial(struct inode *);
161 extern int diWrite(tid_t tid, struct inode *); 174 extern int diWrite(tid_t tid, struct inode *);
162 #endif /* _H_JFS_IMAP 175 #endif /* _H_JFS_IMAP */
163 176
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.