]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
3e57ecf6 | 2 | * Copyright (c) 2000-2006 Silicon Graphics, Inc. |
7b718769 | 3 | * All Rights Reserved. |
1da177e4 | 4 | * |
7b718769 NS |
5 | * This program is free software; you can redistribute it and/or |
6 | * modify it under the terms of the GNU General Public License as | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
9 | * This program is distributed in the hope that it would 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. | |
1da177e4 | 13 | * |
7b718769 NS |
14 | * You should have received a copy of the GNU General Public License |
15 | * along with this program; if not, write the Free Software Foundation, | |
16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
1da177e4 LT |
17 | */ |
18 | #ifndef __XFS_BMAP_H__ | |
19 | #define __XFS_BMAP_H__ | |
20 | ||
21 | struct getbmap; | |
22 | struct xfs_bmbt_irec; | |
4eea22f0 | 23 | struct xfs_ifork; |
1da177e4 LT |
24 | struct xfs_inode; |
25 | struct xfs_mount; | |
26 | struct xfs_trans; | |
27 | ||
a8272ce0 DC |
28 | extern kmem_zone_t *xfs_bmap_free_item_zone; |
29 | ||
1da177e4 LT |
30 | /* |
31 | * List of extents to be free "later". | |
32 | * The list is kept sorted on xbf_startblock. | |
33 | */ | |
34 | typedef struct xfs_bmap_free_item | |
35 | { | |
36 | xfs_fsblock_t xbfi_startblock;/* starting fs block number */ | |
37 | xfs_extlen_t xbfi_blockcount;/* number of blocks in extent */ | |
38 | struct xfs_bmap_free_item *xbfi_next; /* link to next entry */ | |
39 | } xfs_bmap_free_item_t; | |
40 | ||
41 | /* | |
42 | * Header for free extent list. | |
b877e3d3 LM |
43 | * |
44 | * xbf_low is used by the allocator to activate the lowspace algorithm - | |
45 | * when free space is running low the extent allocator may choose to | |
46 | * allocate an extent from an AG without leaving sufficient space for | |
47 | * a btree split when inserting the new extent. In this case the allocator | |
48 | * will enable the lowspace algorithm which is supposed to allow further | |
49 | * allocations (such as btree splits and newroots) to allocate from | |
50 | * sequential AGs. In order to avoid locking AGs out of order the lowspace | |
51 | * algorithm will start searching for free space from AG 0. If the correct | |
52 | * transaction reservations have been made then this algorithm will eventually | |
53 | * find all the space it needs. | |
1da177e4 LT |
54 | */ |
55 | typedef struct xfs_bmap_free | |
56 | { | |
57 | xfs_bmap_free_item_t *xbf_first; /* list of to-be-free extents */ | |
58 | int xbf_count; /* count of items on list */ | |
b877e3d3 | 59 | int xbf_low; /* alloc in low mode */ |
1da177e4 LT |
60 | } xfs_bmap_free_t; |
61 | ||
62 | #define XFS_BMAP_MAX_NMAP 4 | |
63 | ||
64 | /* | |
c0dc7828 | 65 | * Flags for xfs_bmapi_* |
1da177e4 | 66 | */ |
c0dc7828 DC |
67 | #define XFS_BMAPI_ENTIRE 0x001 /* return entire extent, not trimmed */ |
68 | #define XFS_BMAPI_METADATA 0x002 /* mapping metadata not user data */ | |
69 | #define XFS_BMAPI_ATTRFORK 0x004 /* use attribute fork not data */ | |
70 | #define XFS_BMAPI_PREALLOC 0x008 /* preallocation op: unwritten space */ | |
71 | #define XFS_BMAPI_IGSTATE 0x010 /* Ignore state - */ | |
1da177e4 | 72 | /* combine contig. space */ |
c0dc7828 | 73 | #define XFS_BMAPI_CONTIG 0x020 /* must allocate only one extent */ |
44722352 DC |
74 | /* |
75 | * unwritten extent conversion - this needs write cache flushing and no additional | |
76 | * allocation alignments. When specified with XFS_BMAPI_PREALLOC it converts | |
77 | * from written to unwritten, otherwise convert from unwritten to written. | |
78 | */ | |
c0dc7828 | 79 | #define XFS_BMAPI_CONVERT 0x040 |
1da177e4 | 80 | |
0b1b213f | 81 | #define XFS_BMAPI_FLAGS \ |
0b1b213f CH |
82 | { XFS_BMAPI_ENTIRE, "ENTIRE" }, \ |
83 | { XFS_BMAPI_METADATA, "METADATA" }, \ | |
0b1b213f | 84 | { XFS_BMAPI_ATTRFORK, "ATTRFORK" }, \ |
0b1b213f CH |
85 | { XFS_BMAPI_PREALLOC, "PREALLOC" }, \ |
86 | { XFS_BMAPI_IGSTATE, "IGSTATE" }, \ | |
87 | { XFS_BMAPI_CONTIG, "CONTIG" }, \ | |
88 | { XFS_BMAPI_CONVERT, "CONVERT" } | |
89 | ||
90 | ||
a844f451 NS |
91 | static inline int xfs_bmapi_aflag(int w) |
92 | { | |
93 | return (w == XFS_ATTR_FORK ? XFS_BMAPI_ATTRFORK : 0); | |
94 | } | |
1da177e4 LT |
95 | |
96 | /* | |
97 | * Special values for xfs_bmbt_irec_t br_startblock field. | |
98 | */ | |
99 | #define DELAYSTARTBLOCK ((xfs_fsblock_t)-1LL) | |
100 | #define HOLESTARTBLOCK ((xfs_fsblock_t)-2LL) | |
101 | ||
a844f451 NS |
102 | static inline void xfs_bmap_init(xfs_bmap_free_t *flp, xfs_fsblock_t *fbp) |
103 | { | |
1da177e4 | 104 | ((flp)->xbf_first = NULL, (flp)->xbf_count = 0, \ |
a844f451 NS |
105 | (flp)->xbf_low = 0, *(fbp) = NULLFSBLOCK); |
106 | } | |
1da177e4 LT |
107 | |
108 | /* | |
109 | * Argument structure for xfs_bmap_alloc. | |
110 | */ | |
111 | typedef struct xfs_bmalloca { | |
0937e0fd DC |
112 | xfs_fsblock_t *firstblock; /* i/o first block allocated */ |
113 | struct xfs_bmap_free *flist; /* bmap freelist */ | |
1da177e4 LT |
114 | struct xfs_trans *tp; /* transaction pointer */ |
115 | struct xfs_inode *ip; /* incore inode pointer */ | |
baf41a52 DC |
116 | struct xfs_bmbt_irec prev; /* extent before the new one */ |
117 | struct xfs_bmbt_irec got; /* extent after, or delayed */ | |
3a75667e DC |
118 | |
119 | xfs_fileoff_t offset; /* offset in file filling in */ | |
120 | xfs_extlen_t length; /* i/o length asked/allocated */ | |
121 | xfs_fsblock_t blkno; /* starting block of new extent */ | |
122 | ||
29c8d17a | 123 | struct xfs_btree_cur *cur; /* btree cursor */ |
e0c3da5d DC |
124 | xfs_extnum_t idx; /* current extent index */ |
125 | int nallocs;/* number of extents alloc'd */ | |
29c8d17a | 126 | |
1da177e4 | 127 | xfs_extlen_t total; /* total blocks needed for xaction */ |
9da096fd | 128 | xfs_extlen_t minlen; /* minimum allocation size (blocks) */ |
1da177e4 LT |
129 | xfs_extlen_t minleft; /* amount must be left after alloc */ |
130 | char eof; /* set if allocating past last extent */ | |
131 | char wasdel; /* replacing a delayed allocation */ | |
132 | char userdata;/* set if is user data */ | |
dd9f438e NS |
133 | char aeof; /* allocated space at eof */ |
134 | char conv; /* overwriting unwritten extents */ | |
1da177e4 LT |
135 | } xfs_bmalloca_t; |
136 | ||
7574aa92 CH |
137 | /* |
138 | * Flags for xfs_bmap_add_extent*. | |
139 | */ | |
140 | #define BMAP_LEFT_CONTIG (1 << 0) | |
141 | #define BMAP_RIGHT_CONTIG (1 << 1) | |
142 | #define BMAP_LEFT_FILLING (1 << 2) | |
143 | #define BMAP_RIGHT_FILLING (1 << 3) | |
144 | #define BMAP_LEFT_DELAY (1 << 4) | |
145 | #define BMAP_RIGHT_DELAY (1 << 5) | |
146 | #define BMAP_LEFT_VALID (1 << 6) | |
147 | #define BMAP_RIGHT_VALID (1 << 7) | |
6ef35544 | 148 | #define BMAP_ATTRFORK (1 << 8) |
7574aa92 | 149 | |
0b1b213f CH |
150 | #define XFS_BMAP_EXT_FLAGS \ |
151 | { BMAP_LEFT_CONTIG, "LC" }, \ | |
152 | { BMAP_RIGHT_CONTIG, "RC" }, \ | |
153 | { BMAP_LEFT_FILLING, "LF" }, \ | |
154 | { BMAP_RIGHT_FILLING, "RF" }, \ | |
155 | { BMAP_ATTRFORK, "ATTR" } | |
1da177e4 LT |
156 | |
157 | /* | |
158 | * Add bmap trace insert entries for all the contents of the extent list. | |
0b1b213f CH |
159 | * |
160 | * Quite excessive tracing. Only do this for debug builds. | |
1da177e4 | 161 | */ |
0b1b213f | 162 | #if defined(__KERNEL) && defined(DEBUG) |
1da177e4 LT |
163 | void |
164 | xfs_bmap_trace_exlist( | |
1da177e4 LT |
165 | struct xfs_inode *ip, /* incore inode pointer */ |
166 | xfs_extnum_t cnt, /* count of entries in list */ | |
0b1b213f CH |
167 | int whichfork, |
168 | unsigned long caller_ip); /* data or attr fork */ | |
3a59c94c | 169 | #define XFS_BMAP_TRACE_EXLIST(ip,c,w) \ |
0b1b213f CH |
170 | xfs_bmap_trace_exlist(ip,c,w, _THIS_IP_) |
171 | #else | |
3a59c94c | 172 | #define XFS_BMAP_TRACE_EXLIST(ip,c,w) |
0b1b213f | 173 | #endif |
1da177e4 LT |
174 | |
175 | /* | |
176 | * Convert inode from non-attributed to attributed. | |
177 | * Must not be in a transaction, ip must not be locked. | |
178 | */ | |
179 | int /* error code */ | |
180 | xfs_bmap_add_attrfork( | |
181 | struct xfs_inode *ip, /* incore inode pointer */ | |
d8cc890d NS |
182 | int size, /* space needed for new attribute */ |
183 | int rsvd); /* flag for reserved block allocation */ | |
1da177e4 LT |
184 | |
185 | /* | |
186 | * Add the extent to the list of extents to be free at transaction end. | |
187 | * The list is maintained sorted (by block number). | |
188 | */ | |
189 | void | |
190 | xfs_bmap_add_free( | |
191 | xfs_fsblock_t bno, /* fs block number of extent */ | |
192 | xfs_filblks_t len, /* length of extent */ | |
193 | xfs_bmap_free_t *flist, /* list of extents */ | |
194 | struct xfs_mount *mp); /* mount point structure */ | |
195 | ||
196 | /* | |
197 | * Routine to clean up the free list data structure when | |
198 | * an error occurs during a transaction. | |
199 | */ | |
200 | void | |
201 | xfs_bmap_cancel( | |
202 | xfs_bmap_free_t *flist); /* free list to clean up */ | |
203 | ||
204 | /* | |
205 | * Compute and fill in the value of the maximum depth of a bmap btree | |
206 | * in this filesystem. Done once, during mount. | |
207 | */ | |
208 | void | |
209 | xfs_bmap_compute_maxlevels( | |
210 | struct xfs_mount *mp, /* file system mount structure */ | |
211 | int whichfork); /* data or attr fork */ | |
212 | ||
1da177e4 LT |
213 | /* |
214 | * Returns the file-relative block number of the first unused block in the file. | |
215 | * This is the lowest-address hole if the file has holes, else the first block | |
216 | * past the end of file. | |
217 | */ | |
218 | int /* error */ | |
219 | xfs_bmap_first_unused( | |
220 | struct xfs_trans *tp, /* transaction pointer */ | |
221 | struct xfs_inode *ip, /* incore inode */ | |
222 | xfs_extlen_t len, /* size of hole to find */ | |
223 | xfs_fileoff_t *unused, /* unused block num */ | |
224 | int whichfork); /* data or attr fork */ | |
225 | ||
226 | /* | |
227 | * Returns the file-relative block number of the last block + 1 before | |
228 | * last_block (input value) in the file. | |
229 | * This is not based on i_size, it is based on the extent list. | |
230 | * Returns 0 for local files, as they do not have an extent list. | |
231 | */ | |
232 | int /* error */ | |
233 | xfs_bmap_last_before( | |
234 | struct xfs_trans *tp, /* transaction pointer */ | |
235 | struct xfs_inode *ip, /* incore inode */ | |
236 | xfs_fileoff_t *last_block, /* last block */ | |
237 | int whichfork); /* data or attr fork */ | |
238 | ||
239 | /* | |
240 | * Returns the file-relative block number of the first block past eof in | |
241 | * the file. This is not based on i_size, it is based on the extent list. | |
242 | * Returns 0 for local files, as they do not have an extent list. | |
243 | */ | |
244 | int /* error */ | |
245 | xfs_bmap_last_offset( | |
246 | struct xfs_trans *tp, /* transaction pointer */ | |
247 | struct xfs_inode *ip, /* incore inode */ | |
248 | xfs_fileoff_t *unused, /* last block num */ | |
249 | int whichfork); /* data or attr fork */ | |
250 | ||
251 | /* | |
252 | * Returns whether the selected fork of the inode has exactly one | |
253 | * block or not. For the data fork we check this matches di_size, | |
254 | * implying the file's range is 0..bsize-1. | |
255 | */ | |
256 | int | |
257 | xfs_bmap_one_block( | |
258 | struct xfs_inode *ip, /* incore inode */ | |
259 | int whichfork); /* data or attr fork */ | |
260 | ||
261 | /* | |
262 | * Read in the extents to iu_extents. | |
263 | * All inode fields are set up by caller, we just traverse the btree | |
264 | * and copy the records in. | |
265 | */ | |
266 | int /* error */ | |
267 | xfs_bmap_read_extents( | |
268 | struct xfs_trans *tp, /* transaction pointer */ | |
269 | struct xfs_inode *ip, /* incore inode */ | |
270 | int whichfork); /* data or attr fork */ | |
271 | ||
5c8ed202 DC |
272 | int xfs_bmapi_read(struct xfs_inode *ip, xfs_fileoff_t bno, |
273 | xfs_filblks_t len, struct xfs_bmbt_irec *mval, | |
274 | int *nmap, int flags); | |
4403280a CH |
275 | int xfs_bmapi_delay(struct xfs_inode *ip, xfs_fileoff_t bno, |
276 | xfs_filblks_t len, struct xfs_bmbt_irec *mval, | |
277 | int *nmap, int flags); | |
c0dc7828 DC |
278 | int xfs_bmapi_write(struct xfs_trans *tp, struct xfs_inode *ip, |
279 | xfs_fileoff_t bno, xfs_filblks_t len, int flags, | |
280 | xfs_fsblock_t *firstblock, xfs_extlen_t total, | |
281 | struct xfs_bmbt_irec *mval, int *nmap, | |
282 | struct xfs_bmap_free *flist); | |
5c8ed202 | 283 | |
1da177e4 LT |
284 | /* |
285 | * Unmap (remove) blocks from a file. | |
286 | * If nexts is nonzero then the number of extents to remove is limited to | |
287 | * that value. If not all extents in the block range can be removed then | |
288 | * *done is set. | |
289 | */ | |
290 | int /* error */ | |
291 | xfs_bunmapi( | |
292 | struct xfs_trans *tp, /* transaction pointer */ | |
293 | struct xfs_inode *ip, /* incore inode */ | |
294 | xfs_fileoff_t bno, /* starting offset to unmap */ | |
295 | xfs_filblks_t len, /* length to unmap in file */ | |
296 | int flags, /* XFS_BMAPI_... */ | |
297 | xfs_extnum_t nexts, /* number of extents max */ | |
298 | xfs_fsblock_t *firstblock, /* first allocated block | |
299 | controls a.g. for allocs */ | |
300 | xfs_bmap_free_t *flist, /* i/o: list extents to free */ | |
301 | int *done); /* set if not done yet */ | |
302 | ||
847fff5c BN |
303 | /* |
304 | * Check an extent list, which has just been read, for | |
305 | * any bit in the extent flag field. | |
306 | */ | |
307 | int | |
308 | xfs_check_nostate_extents( | |
309 | struct xfs_ifork *ifp, | |
310 | xfs_extnum_t idx, | |
311 | xfs_extnum_t num); | |
312 | ||
1a5902c5 CH |
313 | uint |
314 | xfs_default_attroffset( | |
315 | struct xfs_inode *ip); | |
316 | ||
847fff5c BN |
317 | #ifdef __KERNEL__ |
318 | ||
319 | /* | |
320 | * Routine to be called at transaction's end by xfs_bmapi, xfs_bunmapi | |
321 | * caller. Frees all the extents that need freeing, which must be done | |
322 | * last due to locking considerations. | |
323 | * | |
324 | * Return 1 if the given transaction was committed and a new one allocated, | |
325 | * and 0 otherwise. | |
326 | */ | |
327 | int /* error */ | |
328 | xfs_bmap_finish( | |
329 | struct xfs_trans **tp, /* transaction pointer addr */ | |
330 | xfs_bmap_free_t *flist, /* i/o: list extents to free */ | |
331 | int *committed); /* xact committed or not */ | |
332 | ||
8a7141a8 ES |
333 | /* bmap to userspace formatter - copy to user & advance pointer */ |
334 | typedef int (*xfs_bmap_format_t)(void **, struct getbmapx *, int *); | |
335 | ||
1da177e4 | 336 | /* |
8a7141a8 | 337 | * Get inode's extents as described in bmv, and format for output. |
1da177e4 LT |
338 | */ |
339 | int /* error code */ | |
340 | xfs_getbmap( | |
993386c1 | 341 | xfs_inode_t *ip, |
8a7141a8 ES |
342 | struct getbmapx *bmv, /* user bmap structure */ |
343 | xfs_bmap_format_t formatter, /* format to user */ | |
344 | void *arg); /* formatter arg */ | |
1da177e4 | 345 | |
1da177e4 LT |
346 | /* |
347 | * Check if the endoff is outside the last extent. If so the caller will grow | |
348 | * the allocation to a stripe unit boundary | |
349 | */ | |
350 | int | |
351 | xfs_bmap_eof( | |
352 | struct xfs_inode *ip, | |
353 | xfs_fileoff_t endoff, | |
354 | int whichfork, | |
355 | int *eof); | |
356 | ||
357 | /* | |
358 | * Count fsblocks of the given fork. | |
359 | */ | |
360 | int | |
361 | xfs_bmap_count_blocks( | |
362 | xfs_trans_t *tp, | |
363 | struct xfs_inode *ip, | |
364 | int whichfork, | |
365 | int *count); | |
366 | ||
c726de44 DC |
367 | int |
368 | xfs_bmap_punch_delalloc_range( | |
369 | struct xfs_inode *ip, | |
370 | xfs_fileoff_t start_fsb, | |
371 | xfs_fileoff_t length); | |
1da177e4 LT |
372 | #endif /* __KERNEL__ */ |
373 | ||
374 | #endif /* __XFS_BMAP_H__ */ |