]>
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 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
6ca1c906 | 20 | #include "xfs_format.h" |
70a9883c | 21 | #include "xfs_shared.h" |
a844f451 | 22 | #include "xfs_bit.h" |
1da177e4 | 23 | #include "xfs_log.h" |
a844f451 | 24 | #include "xfs_inum.h" |
1da177e4 LT |
25 | #include "xfs_trans.h" |
26 | #include "xfs_sb.h" | |
27 | #include "xfs_ag.h" | |
f5ea1100 | 28 | #include "xfs_mount.h" |
a844f451 | 29 | #include "xfs_da_btree.h" |
2b9ab5ab DC |
30 | #include "xfs_dir2_format.h" |
31 | #include "xfs_dir2.h" | |
1da177e4 | 32 | #include "xfs_bmap_btree.h" |
a844f451 | 33 | #include "xfs_alloc_btree.h" |
1da177e4 | 34 | #include "xfs_ialloc_btree.h" |
1da177e4 | 35 | #include "xfs_dinode.h" |
1da177e4 | 36 | #include "xfs_inode.h" |
a844f451 | 37 | #include "xfs_btree.h" |
a844f451 | 38 | #include "xfs_mount.h" |
1da177e4 | 39 | #include "xfs_itable.h" |
a844f451 | 40 | #include "xfs_inode_item.h" |
1da177e4 LT |
41 | #include "xfs_extfree_item.h" |
42 | #include "xfs_alloc.h" | |
43 | #include "xfs_bmap.h" | |
68988114 | 44 | #include "xfs_bmap_util.h" |
1da177e4 LT |
45 | #include "xfs_rtalloc.h" |
46 | #include "xfs_error.h" | |
d8cc890d | 47 | #include "xfs_attr_leaf.h" |
1da177e4 LT |
48 | #include "xfs_quota.h" |
49 | #include "xfs_trans_space.h" | |
50 | #include "xfs_buf_item.h" | |
2a82b8be | 51 | #include "xfs_filestream.h" |
0b1b213f | 52 | #include "xfs_trace.h" |
19de7351 | 53 | #include "xfs_symlink.h" |
1da177e4 LT |
54 | |
55 | ||
1da177e4 LT |
56 | kmem_zone_t *xfs_bmap_free_item_zone; |
57 | ||
58 | /* | |
9e5987a7 | 59 | * Miscellaneous helper functions |
1da177e4 LT |
60 | */ |
61 | ||
1da177e4 | 62 | /* |
9e5987a7 DC |
63 | * Compute and fill in the value of the maximum depth of a bmap btree |
64 | * in this filesystem. Done once, during mount. | |
1da177e4 | 65 | */ |
9e5987a7 DC |
66 | void |
67 | xfs_bmap_compute_maxlevels( | |
68 | xfs_mount_t *mp, /* file system mount structure */ | |
69 | int whichfork) /* data or attr fork */ | |
70 | { | |
71 | int level; /* btree level */ | |
72 | uint maxblocks; /* max blocks at this level */ | |
73 | uint maxleafents; /* max leaf entries possible */ | |
74 | int maxrootrecs; /* max records in root block */ | |
75 | int minleafrecs; /* min records in leaf block */ | |
76 | int minnoderecs; /* min records in node block */ | |
77 | int sz; /* root block size */ | |
1da177e4 | 78 | |
9e5987a7 DC |
79 | /* |
80 | * The maximum number of extents in a file, hence the maximum | |
81 | * number of leaf entries, is controlled by the type of di_nextents | |
82 | * (a signed 32-bit number, xfs_extnum_t), or by di_anextents | |
83 | * (a signed 16-bit number, xfs_aextnum_t). | |
84 | * | |
85 | * Note that we can no longer assume that if we are in ATTR1 that | |
86 | * the fork offset of all the inodes will be | |
87 | * (xfs_default_attroffset(ip) >> 3) because we could have mounted | |
88 | * with ATTR2 and then mounted back with ATTR1, keeping the | |
89 | * di_forkoff's fixed but probably at various positions. Therefore, | |
90 | * for both ATTR1 and ATTR2 we have to assume the worst case scenario | |
91 | * of a minimum size available. | |
92 | */ | |
93 | if (whichfork == XFS_DATA_FORK) { | |
94 | maxleafents = MAXEXTNUM; | |
95 | sz = XFS_BMDR_SPACE_CALC(MINDBTPTRS); | |
96 | } else { | |
97 | maxleafents = MAXAEXTNUM; | |
98 | sz = XFS_BMDR_SPACE_CALC(MINABTPTRS); | |
99 | } | |
100 | maxrootrecs = xfs_bmdr_maxrecs(mp, sz, 0); | |
101 | minleafrecs = mp->m_bmap_dmnr[0]; | |
102 | minnoderecs = mp->m_bmap_dmnr[1]; | |
103 | maxblocks = (maxleafents + minleafrecs - 1) / minleafrecs; | |
104 | for (level = 1; maxblocks > 1; level++) { | |
105 | if (maxblocks <= maxrootrecs) | |
106 | maxblocks = 1; | |
107 | else | |
108 | maxblocks = (maxblocks + minnoderecs - 1) / minnoderecs; | |
109 | } | |
110 | mp->m_bm_maxlevels[whichfork] = level; | |
111 | } | |
91e11088 | 112 | |
fe033cc8 CH |
113 | STATIC int /* error */ |
114 | xfs_bmbt_lookup_eq( | |
115 | struct xfs_btree_cur *cur, | |
116 | xfs_fileoff_t off, | |
117 | xfs_fsblock_t bno, | |
118 | xfs_filblks_t len, | |
119 | int *stat) /* success/failure */ | |
120 | { | |
121 | cur->bc_rec.b.br_startoff = off; | |
122 | cur->bc_rec.b.br_startblock = bno; | |
123 | cur->bc_rec.b.br_blockcount = len; | |
124 | return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat); | |
125 | } | |
126 | ||
127 | STATIC int /* error */ | |
128 | xfs_bmbt_lookup_ge( | |
129 | struct xfs_btree_cur *cur, | |
130 | xfs_fileoff_t off, | |
131 | xfs_fsblock_t bno, | |
132 | xfs_filblks_t len, | |
133 | int *stat) /* success/failure */ | |
134 | { | |
135 | cur->bc_rec.b.br_startoff = off; | |
136 | cur->bc_rec.b.br_startblock = bno; | |
137 | cur->bc_rec.b.br_blockcount = len; | |
138 | return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat); | |
139 | } | |
140 | ||
278d0ca1 | 141 | /* |
8096b1eb CH |
142 | * Check if the inode needs to be converted to btree format. |
143 | */ | |
144 | static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork) | |
145 | { | |
146 | return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS && | |
147 | XFS_IFORK_NEXTENTS(ip, whichfork) > | |
148 | XFS_IFORK_MAXEXT(ip, whichfork); | |
149 | } | |
150 | ||
151 | /* | |
152 | * Check if the inode should be converted to extent format. | |
153 | */ | |
154 | static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork) | |
155 | { | |
156 | return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE && | |
157 | XFS_IFORK_NEXTENTS(ip, whichfork) <= | |
158 | XFS_IFORK_MAXEXT(ip, whichfork); | |
159 | } | |
160 | ||
161 | /* | |
162 | * Update the record referred to by cur to the value given | |
278d0ca1 CH |
163 | * by [off, bno, len, state]. |
164 | * This either works (return 0) or gets an EFSCORRUPTED error. | |
165 | */ | |
166 | STATIC int | |
167 | xfs_bmbt_update( | |
168 | struct xfs_btree_cur *cur, | |
169 | xfs_fileoff_t off, | |
170 | xfs_fsblock_t bno, | |
171 | xfs_filblks_t len, | |
172 | xfs_exntst_t state) | |
173 | { | |
174 | union xfs_btree_rec rec; | |
175 | ||
176 | xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state); | |
177 | return xfs_btree_update(cur, &rec); | |
178 | } | |
fe033cc8 | 179 | |
1da177e4 | 180 | /* |
9e5987a7 DC |
181 | * Compute the worst-case number of indirect blocks that will be used |
182 | * for ip's delayed extent of length "len". | |
1da177e4 | 183 | */ |
9e5987a7 DC |
184 | STATIC xfs_filblks_t |
185 | xfs_bmap_worst_indlen( | |
186 | xfs_inode_t *ip, /* incore inode pointer */ | |
187 | xfs_filblks_t len) /* delayed extent length */ | |
1da177e4 | 188 | { |
9e5987a7 DC |
189 | int level; /* btree level number */ |
190 | int maxrecs; /* maximum record count at this level */ | |
191 | xfs_mount_t *mp; /* mount structure */ | |
192 | xfs_filblks_t rval; /* return value */ | |
1da177e4 LT |
193 | |
194 | mp = ip->i_mount; | |
9e5987a7 DC |
195 | maxrecs = mp->m_bmap_dmxr[0]; |
196 | for (level = 0, rval = 0; | |
197 | level < XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK); | |
198 | level++) { | |
199 | len += maxrecs - 1; | |
200 | do_div(len, maxrecs); | |
201 | rval += len; | |
202 | if (len == 1) | |
203 | return rval + XFS_BM_MAXLEVELS(mp, XFS_DATA_FORK) - | |
204 | level - 1; | |
205 | if (level == 0) | |
206 | maxrecs = mp->m_bmap_dmxr[1]; | |
1da177e4 | 207 | } |
9e5987a7 | 208 | return rval; |
1da177e4 LT |
209 | } |
210 | ||
211 | /* | |
9e5987a7 | 212 | * Calculate the default attribute fork offset for newly created inodes. |
1da177e4 | 213 | */ |
9e5987a7 DC |
214 | uint |
215 | xfs_default_attroffset( | |
216 | struct xfs_inode *ip) | |
1da177e4 | 217 | { |
9e5987a7 DC |
218 | struct xfs_mount *mp = ip->i_mount; |
219 | uint offset; | |
1da177e4 | 220 | |
9e5987a7 | 221 | if (mp->m_sb.sb_inodesize == 256) { |
56cea2d0 | 222 | offset = XFS_LITINO(mp, ip->i_d.di_version) - |
9e5987a7 DC |
223 | XFS_BMDR_SPACE_CALC(MINABTPTRS); |
224 | } else { | |
225 | offset = XFS_BMDR_SPACE_CALC(6 * MINABTPTRS); | |
1da177e4 | 226 | } |
9e5987a7 | 227 | |
56cea2d0 | 228 | ASSERT(offset < XFS_LITINO(mp, ip->i_d.di_version)); |
9e5987a7 | 229 | return offset; |
1da177e4 LT |
230 | } |
231 | ||
232 | /* | |
9e5987a7 DC |
233 | * Helper routine to reset inode di_forkoff field when switching |
234 | * attribute fork from local to extent format - we reset it where | |
235 | * possible to make space available for inline data fork extents. | |
1e82379b DC |
236 | */ |
237 | STATIC void | |
9e5987a7 DC |
238 | xfs_bmap_forkoff_reset( |
239 | xfs_mount_t *mp, | |
240 | xfs_inode_t *ip, | |
241 | int whichfork) | |
1e82379b | 242 | { |
9e5987a7 DC |
243 | if (whichfork == XFS_ATTR_FORK && |
244 | ip->i_d.di_format != XFS_DINODE_FMT_DEV && | |
245 | ip->i_d.di_format != XFS_DINODE_FMT_UUID && | |
246 | ip->i_d.di_format != XFS_DINODE_FMT_BTREE) { | |
247 | uint dfl_forkoff = xfs_default_attroffset(ip) >> 3; | |
248 | ||
249 | if (dfl_forkoff > ip->i_d.di_forkoff) | |
250 | ip->i_d.di_forkoff = dfl_forkoff; | |
251 | } | |
1e82379b DC |
252 | } |
253 | ||
9e5987a7 DC |
254 | /* |
255 | * Debug/sanity checking code | |
256 | */ | |
7574aa92 | 257 | |
9e5987a7 DC |
258 | STATIC int |
259 | xfs_bmap_sanity_check( | |
260 | struct xfs_mount *mp, | |
261 | struct xfs_buf *bp, | |
262 | int level) | |
263 | { | |
264 | struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp); | |
7574aa92 | 265 | |
ee1a47ab CH |
266 | if (block->bb_magic != cpu_to_be32(XFS_BMAP_CRC_MAGIC) && |
267 | block->bb_magic != cpu_to_be32(XFS_BMAP_MAGIC)) | |
268 | return 0; | |
269 | ||
270 | if (be16_to_cpu(block->bb_level) != level || | |
9e5987a7 DC |
271 | be16_to_cpu(block->bb_numrecs) == 0 || |
272 | be16_to_cpu(block->bb_numrecs) > mp->m_bmap_dmxr[level != 0]) | |
273 | return 0; | |
ee1a47ab | 274 | |
9e5987a7 DC |
275 | return 1; |
276 | } | |
7574aa92 | 277 | |
9e5987a7 DC |
278 | #ifdef DEBUG |
279 | STATIC struct xfs_buf * | |
280 | xfs_bmap_get_bp( | |
281 | struct xfs_btree_cur *cur, | |
282 | xfs_fsblock_t bno) | |
283 | { | |
284 | struct xfs_log_item_desc *lidp; | |
285 | int i; | |
7574aa92 | 286 | |
9e5987a7 DC |
287 | if (!cur) |
288 | return NULL; | |
289 | ||
290 | for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) { | |
291 | if (!cur->bc_bufs[i]) | |
292 | break; | |
293 | if (XFS_BUF_ADDR(cur->bc_bufs[i]) == bno) | |
294 | return cur->bc_bufs[i]; | |
1da177e4 | 295 | } |
7574aa92 | 296 | |
9e5987a7 DC |
297 | /* Chase down all the log items to see if the bp is there */ |
298 | list_for_each_entry(lidp, &cur->bc_tp->t_items, lid_trans) { | |
299 | struct xfs_buf_log_item *bip; | |
300 | bip = (struct xfs_buf_log_item *)lidp->lid_item; | |
301 | if (bip->bli_item.li_type == XFS_LI_BUF && | |
302 | XFS_BUF_ADDR(bip->bli_buf) == bno) | |
303 | return bip->bli_buf; | |
304 | } | |
7574aa92 | 305 | |
9e5987a7 DC |
306 | return NULL; |
307 | } | |
0b1b213f | 308 | |
9e5987a7 DC |
309 | STATIC void |
310 | xfs_check_block( | |
311 | struct xfs_btree_block *block, | |
312 | xfs_mount_t *mp, | |
313 | int root, | |
314 | short sz) | |
315 | { | |
316 | int i, j, dmxr; | |
317 | __be64 *pp, *thispa; /* pointer to block address */ | |
318 | xfs_bmbt_key_t *prevp, *keyp; | |
1da177e4 | 319 | |
9e5987a7 | 320 | ASSERT(be16_to_cpu(block->bb_level) > 0); |
ec90c556 | 321 | |
9e5987a7 DC |
322 | prevp = NULL; |
323 | for( i = 1; i <= xfs_btree_get_numrecs(block); i++) { | |
324 | dmxr = mp->m_bmap_dmxr[0]; | |
325 | keyp = XFS_BMBT_KEY_ADDR(mp, block, i); | |
0b1b213f | 326 | |
9e5987a7 DC |
327 | if (prevp) { |
328 | ASSERT(be64_to_cpu(prevp->br_startoff) < | |
329 | be64_to_cpu(keyp->br_startoff)); | |
1da177e4 | 330 | } |
9e5987a7 | 331 | prevp = keyp; |
1da177e4 | 332 | |
1da177e4 | 333 | /* |
9e5987a7 | 334 | * Compare the block numbers to see if there are dups. |
1da177e4 | 335 | */ |
9e5987a7 DC |
336 | if (root) |
337 | pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, i, sz); | |
338 | else | |
339 | pp = XFS_BMBT_PTR_ADDR(mp, block, i, dmxr); | |
0b1b213f | 340 | |
9e5987a7 DC |
341 | for (j = i+1; j <= be16_to_cpu(block->bb_numrecs); j++) { |
342 | if (root) | |
343 | thispa = XFS_BMAP_BROOT_PTR_ADDR(mp, block, j, sz); | |
344 | else | |
345 | thispa = XFS_BMBT_PTR_ADDR(mp, block, j, dmxr); | |
346 | if (*thispa == *pp) { | |
347 | xfs_warn(mp, "%s: thispa(%d) == pp(%d) %Ld", | |
348 | __func__, j, i, | |
349 | (unsigned long long)be64_to_cpu(*thispa)); | |
350 | panic("%s: ptrs are equal in node\n", | |
351 | __func__); | |
352 | } | |
1da177e4 | 353 | } |
9e5987a7 DC |
354 | } |
355 | } | |
1da177e4 | 356 | |
9e5987a7 DC |
357 | /* |
358 | * Check that the extents for the inode ip are in the right order in all | |
359 | * btree leaves. | |
360 | */ | |
0b1b213f | 361 | |
9e5987a7 DC |
362 | STATIC void |
363 | xfs_bmap_check_leaf_extents( | |
364 | xfs_btree_cur_t *cur, /* btree cursor or null */ | |
365 | xfs_inode_t *ip, /* incore inode pointer */ | |
366 | int whichfork) /* data or attr fork */ | |
367 | { | |
368 | struct xfs_btree_block *block; /* current btree block */ | |
369 | xfs_fsblock_t bno; /* block # of "block" */ | |
370 | xfs_buf_t *bp; /* buffer for "block" */ | |
371 | int error; /* error return value */ | |
372 | xfs_extnum_t i=0, j; /* index into the extents list */ | |
373 | xfs_ifork_t *ifp; /* fork structure */ | |
374 | int level; /* btree level, for checking */ | |
375 | xfs_mount_t *mp; /* file system mount structure */ | |
376 | __be64 *pp; /* pointer to block address */ | |
377 | xfs_bmbt_rec_t *ep; /* pointer to current extent */ | |
378 | xfs_bmbt_rec_t last = {0, 0}; /* last extent in prev block */ | |
379 | xfs_bmbt_rec_t *nextp; /* pointer to next extent */ | |
380 | int bp_release = 0; | |
381 | ||
382 | if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) { | |
383 | return; | |
384 | } | |
385 | ||
386 | bno = NULLFSBLOCK; | |
387 | mp = ip->i_mount; | |
388 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
389 | block = ifp->if_broot; | |
390 | /* | |
391 | * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out. | |
392 | */ | |
393 | level = be16_to_cpu(block->bb_level); | |
394 | ASSERT(level > 0); | |
395 | xfs_check_block(block, mp, 1, ifp->if_broot_bytes); | |
396 | pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes); | |
397 | bno = be64_to_cpu(*pp); | |
398 | ||
399 | ASSERT(bno != NULLDFSBNO); | |
400 | ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount); | |
401 | ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks); | |
402 | ||
403 | /* | |
404 | * Go down the tree until leaf level is reached, following the first | |
405 | * pointer (leftmost) at each level. | |
406 | */ | |
407 | while (level-- > 0) { | |
408 | /* See if buf is in cur first */ | |
409 | bp_release = 0; | |
410 | bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno)); | |
411 | if (!bp) { | |
412 | bp_release = 1; | |
413 | error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp, | |
414 | XFS_BMAP_BTREE_REF, | |
415 | &xfs_bmbt_buf_ops); | |
572a4cf0 | 416 | if (error) |
9e5987a7 | 417 | goto error_norelse; |
1da177e4 | 418 | } |
9e5987a7 DC |
419 | block = XFS_BUF_TO_BLOCK(bp); |
420 | XFS_WANT_CORRUPTED_GOTO( | |
421 | xfs_bmap_sanity_check(mp, bp, level), | |
422 | error0); | |
423 | if (level == 0) | |
424 | break; | |
1da177e4 | 425 | |
1da177e4 | 426 | /* |
9e5987a7 DC |
427 | * Check this block for basic sanity (increasing keys and |
428 | * no duplicate blocks). | |
1da177e4 | 429 | */ |
0b1b213f | 430 | |
9e5987a7 DC |
431 | xfs_check_block(block, mp, 0, 0); |
432 | pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]); | |
433 | bno = be64_to_cpu(*pp); | |
434 | XFS_WANT_CORRUPTED_GOTO(XFS_FSB_SANITY_CHECK(mp, bno), error0); | |
435 | if (bp_release) { | |
436 | bp_release = 0; | |
437 | xfs_trans_brelse(NULL, bp); | |
1da177e4 | 438 | } |
9e5987a7 | 439 | } |
ec90c556 | 440 | |
9e5987a7 DC |
441 | /* |
442 | * Here with bp and block set to the leftmost leaf node in the tree. | |
443 | */ | |
444 | i = 0; | |
445 | ||
446 | /* | |
447 | * Loop over all leaf nodes checking that all extents are in the right order. | |
448 | */ | |
449 | for (;;) { | |
450 | xfs_fsblock_t nextbno; | |
451 | xfs_extnum_t num_recs; | |
452 | ||
453 | ||
454 | num_recs = xfs_btree_get_numrecs(block); | |
1da177e4 | 455 | |
1da177e4 | 456 | /* |
9e5987a7 | 457 | * Read-ahead the next leaf block, if any. |
1da177e4 | 458 | */ |
8096b1eb | 459 | |
9e5987a7 | 460 | nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib); |
1da177e4 | 461 | |
1da177e4 | 462 | /* |
9e5987a7 DC |
463 | * Check all the extents to make sure they are OK. |
464 | * If we had a previous block, the last entry should | |
465 | * conform with the first entry in this one. | |
1da177e4 | 466 | */ |
ec90c556 | 467 | |
9e5987a7 DC |
468 | ep = XFS_BMBT_REC_ADDR(mp, block, 1); |
469 | if (i) { | |
470 | ASSERT(xfs_bmbt_disk_get_startoff(&last) + | |
471 | xfs_bmbt_disk_get_blockcount(&last) <= | |
472 | xfs_bmbt_disk_get_startoff(ep)); | |
473 | } | |
474 | for (j = 1; j < num_recs; j++) { | |
475 | nextp = XFS_BMBT_REC_ADDR(mp, block, j + 1); | |
476 | ASSERT(xfs_bmbt_disk_get_startoff(ep) + | |
477 | xfs_bmbt_disk_get_blockcount(ep) <= | |
478 | xfs_bmbt_disk_get_startoff(nextp)); | |
479 | ep = nextp; | |
480 | } | |
1da177e4 | 481 | |
9e5987a7 DC |
482 | last = *ep; |
483 | i += num_recs; | |
484 | if (bp_release) { | |
485 | bp_release = 0; | |
486 | xfs_trans_brelse(NULL, bp); | |
487 | } | |
488 | bno = nextbno; | |
1da177e4 | 489 | /* |
9e5987a7 | 490 | * If we've reached the end, stop. |
1da177e4 | 491 | */ |
9e5987a7 DC |
492 | if (bno == NULLFSBLOCK) |
493 | break; | |
8096b1eb | 494 | |
9e5987a7 DC |
495 | bp_release = 0; |
496 | bp = xfs_bmap_get_bp(cur, XFS_FSB_TO_DADDR(mp, bno)); | |
497 | if (!bp) { | |
498 | bp_release = 1; | |
499 | error = xfs_btree_read_bufl(mp, NULL, bno, 0, &bp, | |
500 | XFS_BMAP_BTREE_REF, | |
501 | &xfs_bmbt_buf_ops); | |
b9b984d7 | 502 | if (error) |
9e5987a7 | 503 | goto error_norelse; |
1da177e4 | 504 | } |
9e5987a7 | 505 | block = XFS_BUF_TO_BLOCK(bp); |
a5bd606b | 506 | } |
9e5987a7 DC |
507 | if (bp_release) { |
508 | bp_release = 0; | |
509 | xfs_trans_brelse(NULL, bp); | |
a5bd606b | 510 | } |
9e5987a7 | 511 | return; |
a5bd606b | 512 | |
9e5987a7 DC |
513 | error0: |
514 | xfs_warn(mp, "%s: at error0", __func__); | |
515 | if (bp_release) | |
516 | xfs_trans_brelse(NULL, bp); | |
517 | error_norelse: | |
518 | xfs_warn(mp, "%s: BAD after btree leaves for %d extents", | |
519 | __func__, i); | |
520 | panic("%s: CORRUPTED BTREE OR SOMETHING", __func__); | |
521 | return; | |
1da177e4 LT |
522 | } |
523 | ||
524 | /* | |
9e5987a7 | 525 | * Add bmap trace insert entries for all the contents of the extent records. |
1da177e4 | 526 | */ |
9e5987a7 DC |
527 | void |
528 | xfs_bmap_trace_exlist( | |
529 | xfs_inode_t *ip, /* incore inode pointer */ | |
530 | xfs_extnum_t cnt, /* count of entries in the list */ | |
531 | int whichfork, /* data or attr fork */ | |
532 | unsigned long caller_ip) | |
1da177e4 | 533 | { |
9e5987a7 DC |
534 | xfs_extnum_t idx; /* extent record index */ |
535 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
536 | int state = 0; | |
a5bd606b | 537 | |
9e5987a7 DC |
538 | if (whichfork == XFS_ATTR_FORK) |
539 | state |= BMAP_ATTRFORK; | |
a5bd606b | 540 | |
9e5987a7 DC |
541 | ifp = XFS_IFORK_PTR(ip, whichfork); |
542 | ASSERT(cnt == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))); | |
543 | for (idx = 0; idx < cnt; idx++) | |
544 | trace_xfs_extlist(ip, idx, whichfork, caller_ip); | |
545 | } | |
a5bd606b | 546 | |
9e5987a7 DC |
547 | /* |
548 | * Validate that the bmbt_irecs being returned from bmapi are valid | |
a97f4df7 ZYW |
549 | * given the caller's original parameters. Specifically check the |
550 | * ranges of the returned irecs to ensure that they only extend beyond | |
9e5987a7 DC |
551 | * the given parameters if the XFS_BMAPI_ENTIRE flag was set. |
552 | */ | |
553 | STATIC void | |
554 | xfs_bmap_validate_ret( | |
555 | xfs_fileoff_t bno, | |
556 | xfs_filblks_t len, | |
557 | int flags, | |
558 | xfs_bmbt_irec_t *mval, | |
559 | int nmap, | |
560 | int ret_nmap) | |
561 | { | |
562 | int i; /* index to map values */ | |
a5bd606b | 563 | |
9e5987a7 | 564 | ASSERT(ret_nmap <= nmap); |
a5bd606b | 565 | |
9e5987a7 DC |
566 | for (i = 0; i < ret_nmap; i++) { |
567 | ASSERT(mval[i].br_blockcount > 0); | |
568 | if (!(flags & XFS_BMAPI_ENTIRE)) { | |
569 | ASSERT(mval[i].br_startoff >= bno); | |
570 | ASSERT(mval[i].br_blockcount <= len); | |
571 | ASSERT(mval[i].br_startoff + mval[i].br_blockcount <= | |
572 | bno + len); | |
573 | } else { | |
574 | ASSERT(mval[i].br_startoff < bno + len); | |
575 | ASSERT(mval[i].br_startoff + mval[i].br_blockcount > | |
576 | bno); | |
577 | } | |
578 | ASSERT(i == 0 || | |
579 | mval[i - 1].br_startoff + mval[i - 1].br_blockcount == | |
580 | mval[i].br_startoff); | |
581 | ASSERT(mval[i].br_startblock != DELAYSTARTBLOCK && | |
582 | mval[i].br_startblock != HOLESTARTBLOCK); | |
583 | ASSERT(mval[i].br_state == XFS_EXT_NORM || | |
584 | mval[i].br_state == XFS_EXT_UNWRITTEN); | |
585 | } | |
586 | } | |
7574aa92 | 587 | |
9e5987a7 DC |
588 | #else |
589 | #define xfs_bmap_check_leaf_extents(cur, ip, whichfork) do { } while (0) | |
590 | #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap) | |
591 | #endif /* DEBUG */ | |
7574aa92 | 592 | |
9e5987a7 DC |
593 | /* |
594 | * bmap free list manipulation functions | |
595 | */ | |
7574aa92 | 596 | |
9e5987a7 DC |
597 | /* |
598 | * Add the extent to the list of extents to be free at transaction end. | |
599 | * The list is maintained sorted (by block number). | |
600 | */ | |
601 | void | |
602 | xfs_bmap_add_free( | |
603 | xfs_fsblock_t bno, /* fs block number of extent */ | |
604 | xfs_filblks_t len, /* length of extent */ | |
605 | xfs_bmap_free_t *flist, /* list of extents */ | |
606 | xfs_mount_t *mp) /* mount point structure */ | |
607 | { | |
608 | xfs_bmap_free_item_t *cur; /* current (next) element */ | |
609 | xfs_bmap_free_item_t *new; /* new element */ | |
610 | xfs_bmap_free_item_t *prev; /* previous element */ | |
611 | #ifdef DEBUG | |
612 | xfs_agnumber_t agno; | |
613 | xfs_agblock_t agbno; | |
614 | ||
615 | ASSERT(bno != NULLFSBLOCK); | |
616 | ASSERT(len > 0); | |
617 | ASSERT(len <= MAXEXTLEN); | |
618 | ASSERT(!isnullstartblock(bno)); | |
619 | agno = XFS_FSB_TO_AGNO(mp, bno); | |
620 | agbno = XFS_FSB_TO_AGBNO(mp, bno); | |
621 | ASSERT(agno < mp->m_sb.sb_agcount); | |
622 | ASSERT(agbno < mp->m_sb.sb_agblocks); | |
623 | ASSERT(len < mp->m_sb.sb_agblocks); | |
624 | ASSERT(agbno + len <= mp->m_sb.sb_agblocks); | |
625 | #endif | |
626 | ASSERT(xfs_bmap_free_item_zone != NULL); | |
627 | new = kmem_zone_alloc(xfs_bmap_free_item_zone, KM_SLEEP); | |
628 | new->xbfi_startblock = bno; | |
629 | new->xbfi_blockcount = (xfs_extlen_t)len; | |
630 | for (prev = NULL, cur = flist->xbf_first; | |
631 | cur != NULL; | |
632 | prev = cur, cur = cur->xbfi_next) { | |
633 | if (cur->xbfi_startblock >= bno) | |
634 | break; | |
1da177e4 | 635 | } |
9e5987a7 DC |
636 | if (prev) |
637 | prev->xbfi_next = new; | |
638 | else | |
639 | flist->xbf_first = new; | |
640 | new->xbfi_next = cur; | |
641 | flist->xbf_count++; | |
642 | } | |
7574aa92 | 643 | |
9e5987a7 DC |
644 | /* |
645 | * Remove the entry "free" from the free item list. Prev points to the | |
646 | * previous entry, unless "free" is the head of the list. | |
647 | */ | |
68988114 | 648 | void |
9e5987a7 DC |
649 | xfs_bmap_del_free( |
650 | xfs_bmap_free_t *flist, /* free item list header */ | |
651 | xfs_bmap_free_item_t *prev, /* previous item on list, if any */ | |
652 | xfs_bmap_free_item_t *free) /* list item to be freed */ | |
653 | { | |
654 | if (prev) | |
655 | prev->xbfi_next = free->xbfi_next; | |
656 | else | |
657 | flist->xbf_first = free->xbfi_next; | |
658 | flist->xbf_count--; | |
659 | kmem_zone_free(xfs_bmap_free_item_zone, free); | |
660 | } | |
661 | ||
9e5987a7 DC |
662 | /* |
663 | * Free up any items left in the list. | |
664 | */ | |
665 | void | |
666 | xfs_bmap_cancel( | |
667 | xfs_bmap_free_t *flist) /* list of bmap_free_items */ | |
668 | { | |
669 | xfs_bmap_free_item_t *free; /* free list item */ | |
670 | xfs_bmap_free_item_t *next; | |
ec90c556 | 671 | |
9e5987a7 DC |
672 | if (flist->xbf_count == 0) |
673 | return; | |
674 | ASSERT(flist->xbf_first != NULL); | |
675 | for (free = flist->xbf_first; free; free = next) { | |
676 | next = free->xbfi_next; | |
677 | xfs_bmap_del_free(flist, NULL, free); | |
678 | } | |
679 | ASSERT(flist->xbf_count == 0); | |
680 | } | |
0b1b213f | 681 | |
9e5987a7 DC |
682 | /* |
683 | * Inode fork format manipulation functions | |
684 | */ | |
1da177e4 | 685 | |
9e5987a7 DC |
686 | /* |
687 | * Transform a btree format file with only one leaf node, where the | |
688 | * extents list will fit in the inode, into an extents format file. | |
689 | * Since the file extents are already in-core, all we have to do is | |
690 | * give up the space for the btree root and pitch the leaf block. | |
691 | */ | |
692 | STATIC int /* error */ | |
693 | xfs_bmap_btree_to_extents( | |
694 | xfs_trans_t *tp, /* transaction pointer */ | |
695 | xfs_inode_t *ip, /* incore inode pointer */ | |
696 | xfs_btree_cur_t *cur, /* btree cursor */ | |
697 | int *logflagsp, /* inode logging flags */ | |
698 | int whichfork) /* data or attr fork */ | |
699 | { | |
700 | /* REFERENCED */ | |
701 | struct xfs_btree_block *cblock;/* child btree block */ | |
702 | xfs_fsblock_t cbno; /* child block number */ | |
703 | xfs_buf_t *cbp; /* child block's buffer */ | |
704 | int error; /* error return value */ | |
705 | xfs_ifork_t *ifp; /* inode fork data */ | |
706 | xfs_mount_t *mp; /* mount point structure */ | |
707 | __be64 *pp; /* ptr to block address */ | |
708 | struct xfs_btree_block *rblock;/* root btree block */ | |
1da177e4 | 709 | |
9e5987a7 DC |
710 | mp = ip->i_mount; |
711 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
712 | ASSERT(ifp->if_flags & XFS_IFEXTENTS); | |
713 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE); | |
714 | rblock = ifp->if_broot; | |
715 | ASSERT(be16_to_cpu(rblock->bb_level) == 1); | |
716 | ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1); | |
717 | ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1); | |
718 | pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes); | |
719 | cbno = be64_to_cpu(*pp); | |
720 | *logflagsp = 0; | |
721 | #ifdef DEBUG | |
722 | if ((error = xfs_btree_check_lptr(cur, cbno, 1))) | |
723 | return error; | |
724 | #endif | |
725 | error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp, XFS_BMAP_BTREE_REF, | |
726 | &xfs_bmbt_buf_ops); | |
727 | if (error) | |
728 | return error; | |
729 | cblock = XFS_BUF_TO_BLOCK(cbp); | |
730 | if ((error = xfs_btree_check_block(cur, cblock, 0, cbp))) | |
731 | return error; | |
732 | xfs_bmap_add_free(cbno, 1, cur->bc_private.b.flist, mp); | |
733 | ip->i_d.di_nblocks--; | |
734 | xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L); | |
735 | xfs_trans_binval(tp, cbp); | |
736 | if (cur->bc_bufs[0] == cbp) | |
737 | cur->bc_bufs[0] = NULL; | |
738 | xfs_iroot_realloc(ip, -1, whichfork); | |
739 | ASSERT(ifp->if_broot == NULL); | |
740 | ASSERT((ifp->if_flags & XFS_IFBROOT) == 0); | |
741 | XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS); | |
742 | *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); | |
743 | return 0; | |
744 | } | |
0b1b213f | 745 | |
9e5987a7 DC |
746 | /* |
747 | * Convert an extents-format file into a btree-format file. | |
748 | * The new file will have a root block (in the inode) and a single child block. | |
749 | */ | |
750 | STATIC int /* error */ | |
751 | xfs_bmap_extents_to_btree( | |
752 | xfs_trans_t *tp, /* transaction pointer */ | |
753 | xfs_inode_t *ip, /* incore inode pointer */ | |
754 | xfs_fsblock_t *firstblock, /* first-block-allocated */ | |
755 | xfs_bmap_free_t *flist, /* blocks freed in xaction */ | |
756 | xfs_btree_cur_t **curp, /* cursor returned to caller */ | |
757 | int wasdel, /* converting a delayed alloc */ | |
758 | int *logflagsp, /* inode logging flags */ | |
759 | int whichfork) /* data or attr fork */ | |
760 | { | |
761 | struct xfs_btree_block *ablock; /* allocated (child) bt block */ | |
762 | xfs_buf_t *abp; /* buffer for ablock */ | |
763 | xfs_alloc_arg_t args; /* allocation arguments */ | |
764 | xfs_bmbt_rec_t *arp; /* child record pointer */ | |
765 | struct xfs_btree_block *block; /* btree root block */ | |
766 | xfs_btree_cur_t *cur; /* bmap btree cursor */ | |
767 | xfs_bmbt_rec_host_t *ep; /* extent record pointer */ | |
768 | int error; /* error return value */ | |
769 | xfs_extnum_t i, cnt; /* extent record index */ | |
770 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
771 | xfs_bmbt_key_t *kp; /* root block key pointer */ | |
772 | xfs_mount_t *mp; /* mount structure */ | |
773 | xfs_extnum_t nextents; /* number of file extents */ | |
774 | xfs_bmbt_ptr_t *pp; /* root block address pointer */ | |
1da177e4 | 775 | |
ee1a47ab | 776 | mp = ip->i_mount; |
9e5987a7 DC |
777 | ifp = XFS_IFORK_PTR(ip, whichfork); |
778 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS); | |
0b1b213f | 779 | |
9e5987a7 DC |
780 | /* |
781 | * Make space in the inode incore. | |
782 | */ | |
783 | xfs_iroot_realloc(ip, 1, whichfork); | |
784 | ifp->if_flags |= XFS_IFBROOT; | |
ec90c556 | 785 | |
9e5987a7 DC |
786 | /* |
787 | * Fill in the root. | |
788 | */ | |
789 | block = ifp->if_broot; | |
ee1a47ab CH |
790 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
791 | xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL, | |
792 | XFS_BMAP_CRC_MAGIC, 1, 1, ip->i_ino, | |
793 | XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS); | |
794 | else | |
795 | xfs_btree_init_block_int(mp, block, XFS_BUF_DADDR_NULL, | |
796 | XFS_BMAP_MAGIC, 1, 1, ip->i_ino, | |
797 | XFS_BTREE_LONG_PTRS); | |
0b1b213f | 798 | |
9e5987a7 DC |
799 | /* |
800 | * Need a cursor. Can't allocate until bb_level is filled in. | |
801 | */ | |
9e5987a7 DC |
802 | cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); |
803 | cur->bc_private.b.firstblock = *firstblock; | |
804 | cur->bc_private.b.flist = flist; | |
805 | cur->bc_private.b.flags = wasdel ? XFS_BTCUR_BPRV_WASDEL : 0; | |
806 | /* | |
807 | * Convert to a btree with two levels, one record in root. | |
808 | */ | |
809 | XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_BTREE); | |
810 | memset(&args, 0, sizeof(args)); | |
811 | args.tp = tp; | |
812 | args.mp = mp; | |
813 | args.firstblock = *firstblock; | |
814 | if (*firstblock == NULLFSBLOCK) { | |
815 | args.type = XFS_ALLOCTYPE_START_BNO; | |
816 | args.fsbno = XFS_INO_TO_FSB(mp, ip->i_ino); | |
817 | } else if (flist->xbf_low) { | |
818 | args.type = XFS_ALLOCTYPE_START_BNO; | |
819 | args.fsbno = *firstblock; | |
820 | } else { | |
821 | args.type = XFS_ALLOCTYPE_NEAR_BNO; | |
822 | args.fsbno = *firstblock; | |
823 | } | |
824 | args.minlen = args.maxlen = args.prod = 1; | |
825 | args.wasdel = wasdel; | |
826 | *logflagsp = 0; | |
827 | if ((error = xfs_alloc_vextent(&args))) { | |
828 | xfs_iroot_realloc(ip, -1, whichfork); | |
829 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
830 | return error; | |
831 | } | |
832 | /* | |
833 | * Allocation can't fail, the space was reserved. | |
834 | */ | |
835 | ASSERT(args.fsbno != NULLFSBLOCK); | |
836 | ASSERT(*firstblock == NULLFSBLOCK || | |
837 | args.agno == XFS_FSB_TO_AGNO(mp, *firstblock) || | |
838 | (flist->xbf_low && | |
839 | args.agno > XFS_FSB_TO_AGNO(mp, *firstblock))); | |
840 | *firstblock = cur->bc_private.b.firstblock = args.fsbno; | |
841 | cur->bc_private.b.allocated++; | |
842 | ip->i_d.di_nblocks++; | |
843 | xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, 1L); | |
844 | abp = xfs_btree_get_bufl(mp, tp, args.fsbno, 0); | |
845 | /* | |
846 | * Fill in the child block. | |
847 | */ | |
848 | abp->b_ops = &xfs_bmbt_buf_ops; | |
849 | ablock = XFS_BUF_TO_BLOCK(abp); | |
ee1a47ab CH |
850 | if (xfs_sb_version_hascrc(&mp->m_sb)) |
851 | xfs_btree_init_block_int(mp, ablock, abp->b_bn, | |
852 | XFS_BMAP_CRC_MAGIC, 0, 0, ip->i_ino, | |
853 | XFS_BTREE_LONG_PTRS | XFS_BTREE_CRC_BLOCKS); | |
854 | else | |
855 | xfs_btree_init_block_int(mp, ablock, abp->b_bn, | |
856 | XFS_BMAP_MAGIC, 0, 0, ip->i_ino, | |
857 | XFS_BTREE_LONG_PTRS); | |
858 | ||
9e5987a7 DC |
859 | arp = XFS_BMBT_REC_ADDR(mp, ablock, 1); |
860 | nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); | |
861 | for (cnt = i = 0; i < nextents; i++) { | |
862 | ep = xfs_iext_get_ext(ifp, i); | |
863 | if (!isnullstartblock(xfs_bmbt_get_startblock(ep))) { | |
864 | arp->l0 = cpu_to_be64(ep->l0); | |
865 | arp->l1 = cpu_to_be64(ep->l1); | |
866 | arp++; cnt++; | |
1da177e4 | 867 | } |
9e5987a7 DC |
868 | } |
869 | ASSERT(cnt == XFS_IFORK_NEXTENTS(ip, whichfork)); | |
870 | xfs_btree_set_numrecs(ablock, cnt); | |
1da177e4 | 871 | |
9e5987a7 DC |
872 | /* |
873 | * Fill in the root key and pointer. | |
874 | */ | |
875 | kp = XFS_BMBT_KEY_ADDR(mp, block, 1); | |
876 | arp = XFS_BMBT_REC_ADDR(mp, ablock, 1); | |
877 | kp->br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(arp)); | |
878 | pp = XFS_BMBT_PTR_ADDR(mp, block, 1, xfs_bmbt_get_maxrecs(cur, | |
879 | be16_to_cpu(block->bb_level))); | |
880 | *pp = cpu_to_be64(args.fsbno); | |
ec90c556 | 881 | |
9e5987a7 DC |
882 | /* |
883 | * Do all this logging at the end so that | |
884 | * the root is at the right level. | |
885 | */ | |
886 | xfs_btree_log_block(cur, abp, XFS_BB_ALL_BITS); | |
887 | xfs_btree_log_recs(cur, abp, 1, be16_to_cpu(ablock->bb_numrecs)); | |
888 | ASSERT(*curp == NULL); | |
889 | *curp = cur; | |
890 | *logflagsp = XFS_ILOG_CORE | xfs_ilog_fbroot(whichfork); | |
891 | return 0; | |
892 | } | |
ec90c556 | 893 | |
9e5987a7 DC |
894 | /* |
895 | * Convert a local file to an extents file. | |
896 | * This code is out of bounds for data forks of regular files, | |
897 | * since the file data needs to get logged so things will stay consistent. | |
898 | * (The bmap-level manipulations are ok, though). | |
899 | */ | |
f3508bcd DC |
900 | void |
901 | xfs_bmap_local_to_extents_empty( | |
902 | struct xfs_inode *ip, | |
903 | int whichfork) | |
904 | { | |
905 | struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); | |
906 | ||
907 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); | |
908 | ASSERT(ifp->if_bytes == 0); | |
909 | ASSERT(XFS_IFORK_NEXTENTS(ip, whichfork) == 0); | |
910 | ||
911 | xfs_bmap_forkoff_reset(ip->i_mount, ip, whichfork); | |
912 | ifp->if_flags &= ~XFS_IFINLINE; | |
913 | ifp->if_flags |= XFS_IFEXTENTS; | |
914 | XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS); | |
915 | } | |
916 | ||
917 | ||
9e5987a7 DC |
918 | STATIC int /* error */ |
919 | xfs_bmap_local_to_extents( | |
920 | xfs_trans_t *tp, /* transaction pointer */ | |
921 | xfs_inode_t *ip, /* incore inode pointer */ | |
922 | xfs_fsblock_t *firstblock, /* first block allocated in xaction */ | |
923 | xfs_extlen_t total, /* total blocks needed by transaction */ | |
924 | int *logflagsp, /* inode logging flags */ | |
925 | int whichfork, | |
ee1a47ab CH |
926 | void (*init_fn)(struct xfs_trans *tp, |
927 | struct xfs_buf *bp, | |
9e5987a7 DC |
928 | struct xfs_inode *ip, |
929 | struct xfs_ifork *ifp)) | |
930 | { | |
f3508bcd | 931 | int error = 0; |
9e5987a7 DC |
932 | int flags; /* logging flags returned */ |
933 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
f3508bcd DC |
934 | xfs_alloc_arg_t args; /* allocation arguments */ |
935 | xfs_buf_t *bp; /* buffer for extent block */ | |
936 | xfs_bmbt_rec_host_t *ep; /* extent record pointer */ | |
0b1b213f | 937 | |
9e5987a7 DC |
938 | /* |
939 | * We don't want to deal with the case of keeping inode data inline yet. | |
940 | * So sending the data fork of a regular inode is invalid. | |
941 | */ | |
942 | ASSERT(!(S_ISREG(ip->i_d.di_mode) && whichfork == XFS_DATA_FORK)); | |
943 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
944 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); | |
f3508bcd DC |
945 | |
946 | if (!ifp->if_bytes) { | |
947 | xfs_bmap_local_to_extents_empty(ip, whichfork); | |
948 | flags = XFS_ILOG_CORE; | |
949 | goto done; | |
950 | } | |
951 | ||
9e5987a7 DC |
952 | flags = 0; |
953 | error = 0; | |
f3508bcd DC |
954 | ASSERT((ifp->if_flags & (XFS_IFINLINE|XFS_IFEXTENTS|XFS_IFEXTIREC)) == |
955 | XFS_IFINLINE); | |
956 | memset(&args, 0, sizeof(args)); | |
957 | args.tp = tp; | |
958 | args.mp = ip->i_mount; | |
959 | args.firstblock = *firstblock; | |
960 | /* | |
961 | * Allocate a block. We know we need only one, since the | |
962 | * file currently fits in an inode. | |
963 | */ | |
964 | if (*firstblock == NULLFSBLOCK) { | |
965 | args.fsbno = XFS_INO_TO_FSB(args.mp, ip->i_ino); | |
966 | args.type = XFS_ALLOCTYPE_START_BNO; | |
9e5987a7 | 967 | } else { |
f3508bcd DC |
968 | args.fsbno = *firstblock; |
969 | args.type = XFS_ALLOCTYPE_NEAR_BNO; | |
9e5987a7 | 970 | } |
f3508bcd DC |
971 | args.total = total; |
972 | args.minlen = args.maxlen = args.prod = 1; | |
973 | error = xfs_alloc_vextent(&args); | |
974 | if (error) | |
975 | goto done; | |
976 | ||
977 | /* Can't fail, the space was reserved. */ | |
978 | ASSERT(args.fsbno != NULLFSBLOCK); | |
979 | ASSERT(args.len == 1); | |
980 | *firstblock = args.fsbno; | |
981 | bp = xfs_btree_get_bufl(args.mp, tp, args.fsbno, 0); | |
982 | ||
983 | /* initialise the block and copy the data */ | |
984 | init_fn(tp, bp, ip, ifp); | |
985 | ||
986 | /* account for the change in fork size and log everything */ | |
987 | xfs_trans_log_buf(tp, bp, 0, ifp->if_bytes - 1); | |
988 | xfs_idata_realloc(ip, -ifp->if_bytes, whichfork); | |
989 | xfs_bmap_local_to_extents_empty(ip, whichfork); | |
9e5987a7 | 990 | flags |= XFS_ILOG_CORE; |
f3508bcd DC |
991 | |
992 | xfs_iext_add(ifp, 0, 1); | |
993 | ep = xfs_iext_get_ext(ifp, 0); | |
994 | xfs_bmbt_set_allf(ep, 0, args.fsbno, 1, XFS_EXT_NORM); | |
995 | trace_xfs_bmap_post_update(ip, 0, | |
996 | whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0, | |
997 | _THIS_IP_); | |
998 | XFS_IFORK_NEXT_SET(ip, whichfork, 1); | |
999 | ip->i_d.di_nblocks = 1; | |
1000 | xfs_trans_mod_dquot_byino(tp, ip, | |
1001 | XFS_TRANS_DQ_BCOUNT, 1L); | |
1002 | flags |= xfs_ilog_fext(whichfork); | |
1003 | ||
9e5987a7 DC |
1004 | done: |
1005 | *logflagsp = flags; | |
1006 | return error; | |
1007 | } | |
ec90c556 | 1008 | |
9e5987a7 DC |
1009 | /* |
1010 | * Called from xfs_bmap_add_attrfork to handle btree format files. | |
1011 | */ | |
1012 | STATIC int /* error */ | |
1013 | xfs_bmap_add_attrfork_btree( | |
1014 | xfs_trans_t *tp, /* transaction pointer */ | |
1015 | xfs_inode_t *ip, /* incore inode pointer */ | |
1016 | xfs_fsblock_t *firstblock, /* first block allocated */ | |
1017 | xfs_bmap_free_t *flist, /* blocks to free at commit */ | |
1018 | int *flags) /* inode logging flags */ | |
1019 | { | |
1020 | xfs_btree_cur_t *cur; /* btree cursor */ | |
1021 | int error; /* error return value */ | |
1022 | xfs_mount_t *mp; /* file system mount struct */ | |
1023 | int stat; /* newroot status */ | |
ec90c556 | 1024 | |
9e5987a7 DC |
1025 | mp = ip->i_mount; |
1026 | if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip)) | |
1027 | *flags |= XFS_ILOG_DBROOT; | |
1028 | else { | |
1029 | cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK); | |
1030 | cur->bc_private.b.flist = flist; | |
1031 | cur->bc_private.b.firstblock = *firstblock; | |
1032 | if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat))) | |
1033 | goto error0; | |
1034 | /* must be at least one entry */ | |
1035 | XFS_WANT_CORRUPTED_GOTO(stat == 1, error0); | |
1036 | if ((error = xfs_btree_new_iroot(cur, flags, &stat))) | |
1037 | goto error0; | |
1038 | if (stat == 0) { | |
1039 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); | |
1040 | return XFS_ERROR(ENOSPC); | |
1da177e4 | 1041 | } |
9e5987a7 DC |
1042 | *firstblock = cur->bc_private.b.firstblock; |
1043 | cur->bc_private.b.allocated = 0; | |
1044 | xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR); | |
1da177e4 | 1045 | } |
9e5987a7 DC |
1046 | return 0; |
1047 | error0: | |
1048 | xfs_btree_del_cursor(cur, XFS_BTREE_ERROR); | |
1049 | return error; | |
1050 | } | |
a5bd606b | 1051 | |
9e5987a7 DC |
1052 | /* |
1053 | * Called from xfs_bmap_add_attrfork to handle extents format files. | |
1054 | */ | |
1055 | STATIC int /* error */ | |
1056 | xfs_bmap_add_attrfork_extents( | |
1057 | xfs_trans_t *tp, /* transaction pointer */ | |
1058 | xfs_inode_t *ip, /* incore inode pointer */ | |
1059 | xfs_fsblock_t *firstblock, /* first block allocated */ | |
1060 | xfs_bmap_free_t *flist, /* blocks to free at commit */ | |
1061 | int *flags) /* inode logging flags */ | |
1062 | { | |
1063 | xfs_btree_cur_t *cur; /* bmap btree cursor */ | |
1064 | int error; /* error return value */ | |
a5bd606b | 1065 | |
9e5987a7 DC |
1066 | if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip)) |
1067 | return 0; | |
1068 | cur = NULL; | |
1069 | error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist, &cur, 0, | |
1070 | flags, XFS_DATA_FORK); | |
a5bd606b CH |
1071 | if (cur) { |
1072 | cur->bc_private.b.allocated = 0; | |
9e5987a7 DC |
1073 | xfs_btree_del_cursor(cur, |
1074 | error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); | |
a5bd606b | 1075 | } |
1da177e4 | 1076 | return error; |
1da177e4 LT |
1077 | } |
1078 | ||
9e5987a7 DC |
1079 | /* |
1080 | * Called from xfs_bmap_add_attrfork to handle local format files. Each | |
1081 | * different data fork content type needs a different callout to do the | |
1082 | * conversion. Some are basic and only require special block initialisation | |
1083 | * callouts for the data formating, others (directories) are so specialised they | |
1084 | * handle everything themselves. | |
1085 | * | |
1086 | * XXX (dgc): investigate whether directory conversion can use the generic | |
1087 | * formatting callout. It should be possible - it's just a very complex | |
ee1a47ab | 1088 | * formatter. |
9e5987a7 DC |
1089 | */ |
1090 | STATIC int /* error */ | |
1091 | xfs_bmap_add_attrfork_local( | |
1092 | xfs_trans_t *tp, /* transaction pointer */ | |
1093 | xfs_inode_t *ip, /* incore inode pointer */ | |
1094 | xfs_fsblock_t *firstblock, /* first block allocated */ | |
1095 | xfs_bmap_free_t *flist, /* blocks to free at commit */ | |
1096 | int *flags) /* inode logging flags */ | |
1097 | { | |
1098 | xfs_da_args_t dargs; /* args for dir/attr code */ | |
7574aa92 | 1099 | |
9e5987a7 DC |
1100 | if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip)) |
1101 | return 0; | |
7574aa92 | 1102 | |
9e5987a7 DC |
1103 | if (S_ISDIR(ip->i_d.di_mode)) { |
1104 | memset(&dargs, 0, sizeof(dargs)); | |
1105 | dargs.dp = ip; | |
1106 | dargs.firstblock = firstblock; | |
1107 | dargs.flist = flist; | |
1108 | dargs.total = ip->i_mount->m_dirblkfsbs; | |
1109 | dargs.whichfork = XFS_DATA_FORK; | |
1110 | dargs.trans = tp; | |
1111 | return xfs_dir2_sf_to_block(&dargs); | |
1da177e4 | 1112 | } |
7574aa92 | 1113 | |
9e5987a7 DC |
1114 | if (S_ISLNK(ip->i_d.di_mode)) |
1115 | return xfs_bmap_local_to_extents(tp, ip, firstblock, 1, | |
1116 | flags, XFS_DATA_FORK, | |
1117 | xfs_symlink_local_to_remote); | |
7574aa92 | 1118 | |
f3508bcd DC |
1119 | /* should only be called for types that support local format data */ |
1120 | ASSERT(0); | |
1121 | return EFSCORRUPTED; | |
9e5987a7 | 1122 | } |
0b1b213f | 1123 | |
9e5987a7 DC |
1124 | /* |
1125 | * Convert inode from non-attributed to attributed. | |
1126 | * Must not be in a transaction, ip must not be locked. | |
1127 | */ | |
1128 | int /* error code */ | |
1129 | xfs_bmap_add_attrfork( | |
1130 | xfs_inode_t *ip, /* incore inode pointer */ | |
1131 | int size, /* space new attribute needs */ | |
1132 | int rsvd) /* xact may use reserved blks */ | |
1133 | { | |
1134 | xfs_fsblock_t firstblock; /* 1st block/ag allocated */ | |
1135 | xfs_bmap_free_t flist; /* freed extent records */ | |
1136 | xfs_mount_t *mp; /* mount structure */ | |
1137 | xfs_trans_t *tp; /* transaction pointer */ | |
1138 | int blks; /* space reservation */ | |
1139 | int version = 1; /* superblock attr version */ | |
1140 | int committed; /* xaction was committed */ | |
1141 | int logflags; /* logging flags */ | |
1142 | int error; /* error return value */ | |
0b1b213f | 1143 | |
9e5987a7 | 1144 | ASSERT(XFS_IFORK_Q(ip) == 0); |
1da177e4 | 1145 | |
9e5987a7 DC |
1146 | mp = ip->i_mount; |
1147 | ASSERT(!XFS_NOT_DQATTACHED(mp, ip)); | |
1148 | tp = xfs_trans_alloc(mp, XFS_TRANS_ADDAFORK); | |
1149 | blks = XFS_ADDAFORK_SPACE_RES(mp); | |
1150 | if (rsvd) | |
1151 | tp->t_flags |= XFS_TRANS_RESERVE; | |
3d3c8b52 JL |
1152 | error = xfs_trans_reserve(tp, &M_RES(mp)->tr_addafork, blks, 0); |
1153 | if (error) | |
9e5987a7 DC |
1154 | goto error0; |
1155 | xfs_ilock(ip, XFS_ILOCK_EXCL); | |
1156 | error = xfs_trans_reserve_quota_nblks(tp, ip, blks, 0, rsvd ? | |
1157 | XFS_QMOPT_RES_REGBLKS | XFS_QMOPT_FORCE_RES : | |
1158 | XFS_QMOPT_RES_REGBLKS); | |
1159 | if (error) { | |
1160 | xfs_iunlock(ip, XFS_ILOCK_EXCL); | |
1161 | xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES); | |
1162 | return error; | |
1163 | } | |
1164 | if (XFS_IFORK_Q(ip)) | |
1165 | goto error1; | |
1166 | if (ip->i_d.di_aformat != XFS_DINODE_FMT_EXTENTS) { | |
1da177e4 | 1167 | /* |
9e5987a7 | 1168 | * For inodes coming from pre-6.2 filesystems. |
1da177e4 | 1169 | */ |
9e5987a7 DC |
1170 | ASSERT(ip->i_d.di_aformat == 0); |
1171 | ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS; | |
1172 | } | |
1173 | ASSERT(ip->i_d.di_anextents == 0); | |
ec90c556 | 1174 | |
9e5987a7 DC |
1175 | xfs_trans_ijoin(tp, ip, XFS_ILOCK_EXCL); |
1176 | xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE); | |
1da177e4 | 1177 | |
9e5987a7 DC |
1178 | switch (ip->i_d.di_format) { |
1179 | case XFS_DINODE_FMT_DEV: | |
1180 | ip->i_d.di_forkoff = roundup(sizeof(xfs_dev_t), 8) >> 3; | |
1181 | break; | |
1182 | case XFS_DINODE_FMT_UUID: | |
1183 | ip->i_d.di_forkoff = roundup(sizeof(uuid_t), 8) >> 3; | |
1184 | break; | |
1185 | case XFS_DINODE_FMT_LOCAL: | |
1186 | case XFS_DINODE_FMT_EXTENTS: | |
1187 | case XFS_DINODE_FMT_BTREE: | |
1188 | ip->i_d.di_forkoff = xfs_attr_shortform_bytesfit(ip, size); | |
1189 | if (!ip->i_d.di_forkoff) | |
1190 | ip->i_d.di_forkoff = xfs_default_attroffset(ip) >> 3; | |
1191 | else if (mp->m_flags & XFS_MOUNT_ATTR2) | |
1192 | version = 2; | |
1da177e4 | 1193 | break; |
9e5987a7 DC |
1194 | default: |
1195 | ASSERT(0); | |
1196 | error = XFS_ERROR(EINVAL); | |
1197 | goto error1; | |
1198 | } | |
1da177e4 | 1199 | |
9e5987a7 DC |
1200 | ASSERT(ip->i_afp == NULL); |
1201 | ip->i_afp = kmem_zone_zalloc(xfs_ifork_zone, KM_SLEEP); | |
1202 | ip->i_afp->if_flags = XFS_IFEXTENTS; | |
1203 | logflags = 0; | |
1204 | xfs_bmap_init(&flist, &firstblock); | |
1205 | switch (ip->i_d.di_format) { | |
1206 | case XFS_DINODE_FMT_LOCAL: | |
1207 | error = xfs_bmap_add_attrfork_local(tp, ip, &firstblock, &flist, | |
1208 | &logflags); | |
1209 | break; | |
1210 | case XFS_DINODE_FMT_EXTENTS: | |
1211 | error = xfs_bmap_add_attrfork_extents(tp, ip, &firstblock, | |
1212 | &flist, &logflags); | |
1213 | break; | |
1214 | case XFS_DINODE_FMT_BTREE: | |
1215 | error = xfs_bmap_add_attrfork_btree(tp, ip, &firstblock, &flist, | |
1216 | &logflags); | |
1217 | break; | |
1218 | default: | |
1219 | error = 0; | |
1da177e4 LT |
1220 | break; |
1221 | } | |
9e5987a7 DC |
1222 | if (logflags) |
1223 | xfs_trans_log_inode(tp, ip, logflags); | |
1224 | if (error) | |
1225 | goto error2; | |
1226 | if (!xfs_sb_version_hasattr(&mp->m_sb) || | |
1227 | (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2)) { | |
1228 | __int64_t sbfields = 0; | |
1229 | ||
1230 | spin_lock(&mp->m_sb_lock); | |
1231 | if (!xfs_sb_version_hasattr(&mp->m_sb)) { | |
1232 | xfs_sb_version_addattr(&mp->m_sb); | |
1233 | sbfields |= XFS_SB_VERSIONNUM; | |
1234 | } | |
1235 | if (!xfs_sb_version_hasattr2(&mp->m_sb) && version == 2) { | |
1236 | xfs_sb_version_addattr2(&mp->m_sb); | |
1237 | sbfields |= (XFS_SB_VERSIONNUM | XFS_SB_FEATURES2); | |
1238 | } | |
1239 | if (sbfields) { | |
1240 | spin_unlock(&mp->m_sb_lock); | |
1241 | xfs_mod_sb(tp, sbfields); | |
1242 | } else | |
1243 | spin_unlock(&mp->m_sb_lock); | |
1da177e4 | 1244 | } |
9e5987a7 DC |
1245 | |
1246 | error = xfs_bmap_finish(&tp, &flist, &committed); | |
1247 | if (error) | |
1248 | goto error2; | |
1249 | return xfs_trans_commit(tp, XFS_TRANS_RELEASE_LOG_RES); | |
1250 | error2: | |
1251 | xfs_bmap_cancel(&flist); | |
1252 | error1: | |
1253 | xfs_iunlock(ip, XFS_ILOCK_EXCL); | |
1254 | error0: | |
1255 | xfs_trans_cancel(tp, XFS_TRANS_RELEASE_LOG_RES|XFS_TRANS_ABORT); | |
1256 | return error; | |
1da177e4 LT |
1257 | } |
1258 | ||
1259 | /* | |
9e5987a7 | 1260 | * Internal and external extent tree search functions. |
1da177e4 | 1261 | */ |
a5bd606b | 1262 | |
9e5987a7 DC |
1263 | /* |
1264 | * Read in the extents to if_extents. | |
1265 | * All inode fields are set up by caller, we just traverse the btree | |
1266 | * and copy the records in. If the file system cannot contain unwritten | |
1267 | * extents, the records are checked for no "state" flags. | |
1268 | */ | |
1269 | int /* error */ | |
1270 | xfs_bmap_read_extents( | |
1271 | xfs_trans_t *tp, /* transaction pointer */ | |
1272 | xfs_inode_t *ip, /* incore inode */ | |
1273 | int whichfork) /* data or attr fork */ | |
1274 | { | |
1275 | struct xfs_btree_block *block; /* current btree block */ | |
1276 | xfs_fsblock_t bno; /* block # of "block" */ | |
1277 | xfs_buf_t *bp; /* buffer for "block" */ | |
1278 | int error; /* error return value */ | |
1279 | xfs_exntfmt_t exntf; /* XFS_EXTFMT_NOSTATE, if checking */ | |
1280 | xfs_extnum_t i, j; /* index into the extents list */ | |
1281 | xfs_ifork_t *ifp; /* fork structure */ | |
1282 | int level; /* btree level, for checking */ | |
1283 | xfs_mount_t *mp; /* file system mount structure */ | |
1284 | __be64 *pp; /* pointer to block address */ | |
1285 | /* REFERENCED */ | |
1286 | xfs_extnum_t room; /* number of entries there's room for */ | |
6ef35544 | 1287 | |
9e5987a7 DC |
1288 | bno = NULLFSBLOCK; |
1289 | mp = ip->i_mount; | |
1290 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
1291 | exntf = (whichfork != XFS_DATA_FORK) ? XFS_EXTFMT_NOSTATE : | |
1292 | XFS_EXTFMT_INODE(ip); | |
1293 | block = ifp->if_broot; | |
1da177e4 | 1294 | /* |
9e5987a7 | 1295 | * Root level must use BMAP_BROOT_PTR_ADDR macro to get ptr out. |
1da177e4 | 1296 | */ |
9e5987a7 DC |
1297 | level = be16_to_cpu(block->bb_level); |
1298 | ASSERT(level > 0); | |
1299 | pp = XFS_BMAP_BROOT_PTR_ADDR(mp, block, 1, ifp->if_broot_bytes); | |
1300 | bno = be64_to_cpu(*pp); | |
1301 | ASSERT(bno != NULLDFSBNO); | |
1302 | ASSERT(XFS_FSB_TO_AGNO(mp, bno) < mp->m_sb.sb_agcount); | |
1303 | ASSERT(XFS_FSB_TO_AGBNO(mp, bno) < mp->m_sb.sb_agblocks); | |
1da177e4 | 1304 | /* |
9e5987a7 DC |
1305 | * Go down the tree until leaf level is reached, following the first |
1306 | * pointer (leftmost) at each level. | |
1da177e4 | 1307 | */ |
9e5987a7 DC |
1308 | while (level-- > 0) { |
1309 | error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, | |
1310 | XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops); | |
1311 | if (error) | |
1312 | return error; | |
1313 | block = XFS_BUF_TO_BLOCK(bp); | |
1314 | XFS_WANT_CORRUPTED_GOTO( | |
1315 | xfs_bmap_sanity_check(mp, bp, level), | |
1316 | error0); | |
1317 | if (level == 0) | |
1318 | break; | |
1319 | pp = XFS_BMBT_PTR_ADDR(mp, block, 1, mp->m_bmap_dmxr[1]); | |
1320 | bno = be64_to_cpu(*pp); | |
1321 | XFS_WANT_CORRUPTED_GOTO(XFS_FSB_SANITY_CHECK(mp, bno), error0); | |
1322 | xfs_trans_brelse(tp, bp); | |
1da177e4 LT |
1323 | } |
1324 | /* | |
9e5987a7 | 1325 | * Here with bp and block set to the leftmost leaf node in the tree. |
1da177e4 | 1326 | */ |
9e5987a7 DC |
1327 | room = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); |
1328 | i = 0; | |
1da177e4 | 1329 | /* |
9e5987a7 | 1330 | * Loop over all leaf nodes. Copy information to the extent records. |
1da177e4 | 1331 | */ |
9e5987a7 DC |
1332 | for (;;) { |
1333 | xfs_bmbt_rec_t *frp; | |
1334 | xfs_fsblock_t nextbno; | |
1335 | xfs_extnum_t num_recs; | |
1336 | xfs_extnum_t start; | |
0b1b213f | 1337 | |
9e5987a7 DC |
1338 | num_recs = xfs_btree_get_numrecs(block); |
1339 | if (unlikely(i + num_recs > room)) { | |
1340 | ASSERT(i + num_recs <= room); | |
1341 | xfs_warn(ip->i_mount, | |
1342 | "corrupt dinode %Lu, (btree extents).", | |
1343 | (unsigned long long) ip->i_ino); | |
1344 | XFS_CORRUPTION_ERROR("xfs_bmap_read_extents(1)", | |
1345 | XFS_ERRLEVEL_LOW, ip->i_mount, block); | |
1346 | goto error0; | |
1da177e4 | 1347 | } |
9e5987a7 DC |
1348 | XFS_WANT_CORRUPTED_GOTO( |
1349 | xfs_bmap_sanity_check(mp, bp, 0), | |
1350 | error0); | |
1da177e4 | 1351 | /* |
9e5987a7 | 1352 | * Read-ahead the next leaf block, if any. |
1da177e4 | 1353 | */ |
9e5987a7 DC |
1354 | nextbno = be64_to_cpu(block->bb_u.l.bb_rightsib); |
1355 | if (nextbno != NULLFSBLOCK) | |
1356 | xfs_btree_reada_bufl(mp, nextbno, 1, | |
1357 | &xfs_bmbt_buf_ops); | |
1da177e4 | 1358 | /* |
9e5987a7 | 1359 | * Copy records into the extent records. |
1da177e4 | 1360 | */ |
9e5987a7 DC |
1361 | frp = XFS_BMBT_REC_ADDR(mp, block, 1); |
1362 | start = i; | |
1363 | for (j = 0; j < num_recs; j++, i++, frp++) { | |
1364 | xfs_bmbt_rec_host_t *trp = xfs_iext_get_ext(ifp, i); | |
1365 | trp->l0 = be64_to_cpu(frp->l0); | |
1366 | trp->l1 = be64_to_cpu(frp->l1); | |
1da177e4 | 1367 | } |
9e5987a7 DC |
1368 | if (exntf == XFS_EXTFMT_NOSTATE) { |
1369 | /* | |
1370 | * Check all attribute bmap btree records and | |
1371 | * any "older" data bmap btree records for a | |
1372 | * set bit in the "extent flag" position. | |
1373 | */ | |
1374 | if (unlikely(xfs_check_nostate_extents(ifp, | |
1375 | start, num_recs))) { | |
1376 | XFS_ERROR_REPORT("xfs_bmap_read_extents(2)", | |
1377 | XFS_ERRLEVEL_LOW, | |
1378 | ip->i_mount); | |
1379 | goto error0; | |
1380 | } | |
1381 | } | |
1382 | xfs_trans_brelse(tp, bp); | |
1383 | bno = nextbno; | |
1da177e4 | 1384 | /* |
9e5987a7 | 1385 | * If we've reached the end, stop. |
1da177e4 | 1386 | */ |
9e5987a7 DC |
1387 | if (bno == NULLFSBLOCK) |
1388 | break; | |
1389 | error = xfs_btree_read_bufl(mp, tp, bno, 0, &bp, | |
1390 | XFS_BMAP_BTREE_REF, &xfs_bmbt_buf_ops); | |
1391 | if (error) | |
1392 | return error; | |
1393 | block = XFS_BUF_TO_BLOCK(bp); | |
1da177e4 | 1394 | } |
9e5987a7 DC |
1395 | ASSERT(i == (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))); |
1396 | ASSERT(i == XFS_IFORK_NEXTENTS(ip, whichfork)); | |
1397 | XFS_BMAP_TRACE_EXLIST(ip, i, whichfork); | |
1398 | return 0; | |
1399 | error0: | |
1400 | xfs_trans_brelse(tp, bp); | |
1401 | return XFS_ERROR(EFSCORRUPTED); | |
1402 | } | |
a5bd606b | 1403 | |
a5bd606b | 1404 | |
9e5987a7 DC |
1405 | /* |
1406 | * Search the extent records for the entry containing block bno. | |
1407 | * If bno lies in a hole, point to the next entry. If bno lies | |
1408 | * past eof, *eofp will be set, and *prevp will contain the last | |
1409 | * entry (null if none). Else, *lastxp will be set to the index | |
1410 | * of the found entry; *gotp will contain the entry. | |
1411 | */ | |
1412 | STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */ | |
1413 | xfs_bmap_search_multi_extents( | |
1414 | xfs_ifork_t *ifp, /* inode fork pointer */ | |
1415 | xfs_fileoff_t bno, /* block number searched for */ | |
1416 | int *eofp, /* out: end of file found */ | |
1417 | xfs_extnum_t *lastxp, /* out: last extent index */ | |
1418 | xfs_bmbt_irec_t *gotp, /* out: extent entry found */ | |
1419 | xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */ | |
1420 | { | |
1421 | xfs_bmbt_rec_host_t *ep; /* extent record pointer */ | |
1422 | xfs_extnum_t lastx; /* last extent index */ | |
a5bd606b | 1423 | |
9e5987a7 DC |
1424 | /* |
1425 | * Initialize the extent entry structure to catch access to | |
1426 | * uninitialized br_startblock field. | |
1427 | */ | |
1428 | gotp->br_startoff = 0xffa5a5a5a5a5a5a5LL; | |
1429 | gotp->br_blockcount = 0xa55a5a5a5a5a5a5aLL; | |
1430 | gotp->br_state = XFS_EXT_INVALID; | |
1431 | #if XFS_BIG_BLKNOS | |
1432 | gotp->br_startblock = 0xffffa5a5a5a5a5a5LL; | |
1433 | #else | |
1434 | gotp->br_startblock = 0xffffa5a5; | |
1435 | #endif | |
1436 | prevp->br_startoff = NULLFILEOFF; | |
c6534249 | 1437 | |
9e5987a7 DC |
1438 | ep = xfs_iext_bno_to_ext(ifp, bno, &lastx); |
1439 | if (lastx > 0) { | |
1440 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx - 1), prevp); | |
1441 | } | |
1442 | if (lastx < (ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t))) { | |
1443 | xfs_bmbt_get_all(ep, gotp); | |
1444 | *eofp = 0; | |
1445 | } else { | |
1446 | if (lastx > 0) { | |
1447 | *gotp = *prevp; | |
1448 | } | |
1449 | *eofp = 1; | |
1450 | ep = NULL; | |
1451 | } | |
1452 | *lastxp = lastx; | |
1453 | return ep; | |
1da177e4 LT |
1454 | } |
1455 | ||
dd9f438e | 1456 | /* |
9e5987a7 DC |
1457 | * Search the extents list for the inode, for the extent containing bno. |
1458 | * If bno lies in a hole, point to the next entry. If bno lies past eof, | |
1459 | * *eofp will be set, and *prevp will contain the last entry (null if none). | |
1460 | * Else, *lastxp will be set to the index of the found | |
1461 | * entry; *gotp will contain the entry. | |
dd9f438e | 1462 | */ |
9e5987a7 DC |
1463 | STATIC xfs_bmbt_rec_host_t * /* pointer to found extent entry */ |
1464 | xfs_bmap_search_extents( | |
1465 | xfs_inode_t *ip, /* incore inode pointer */ | |
1466 | xfs_fileoff_t bno, /* block number searched for */ | |
1467 | int fork, /* data or attr fork */ | |
1468 | int *eofp, /* out: end of file found */ | |
1469 | xfs_extnum_t *lastxp, /* out: last extent index */ | |
1470 | xfs_bmbt_irec_t *gotp, /* out: extent entry found */ | |
1471 | xfs_bmbt_irec_t *prevp) /* out: previous extent entry found */ | |
dd9f438e | 1472 | { |
9e5987a7 DC |
1473 | xfs_ifork_t *ifp; /* inode fork pointer */ |
1474 | xfs_bmbt_rec_host_t *ep; /* extent record pointer */ | |
dd9f438e | 1475 | |
9e5987a7 DC |
1476 | XFS_STATS_INC(xs_look_exlist); |
1477 | ifp = XFS_IFORK_PTR(ip, fork); | |
dd9f438e | 1478 | |
9e5987a7 | 1479 | ep = xfs_bmap_search_multi_extents(ifp, bno, eofp, lastxp, gotp, prevp); |
dd9f438e | 1480 | |
9e5987a7 DC |
1481 | if (unlikely(!(gotp->br_startblock) && (*lastxp != NULLEXTNUM) && |
1482 | !(XFS_IS_REALTIME_INODE(ip) && fork == XFS_DATA_FORK))) { | |
1483 | xfs_alert_tag(ip->i_mount, XFS_PTAG_FSBLOCK_ZERO, | |
1484 | "Access to block zero in inode %llu " | |
1485 | "start_block: %llx start_off: %llx " | |
08e96e1a | 1486 | "blkcnt: %llx extent-state: %x lastx: %x", |
9e5987a7 DC |
1487 | (unsigned long long)ip->i_ino, |
1488 | (unsigned long long)gotp->br_startblock, | |
1489 | (unsigned long long)gotp->br_startoff, | |
1490 | (unsigned long long)gotp->br_blockcount, | |
1491 | gotp->br_state, *lastxp); | |
1492 | *lastxp = NULLEXTNUM; | |
1493 | *eofp = 1; | |
1494 | return NULL; | |
dd9f438e | 1495 | } |
9e5987a7 DC |
1496 | return ep; |
1497 | } | |
dd9f438e | 1498 | |
9e5987a7 DC |
1499 | /* |
1500 | * Returns the file-relative block number of the first unused block(s) | |
1501 | * in the file with at least "len" logically contiguous blocks free. | |
1502 | * This is the lowest-address hole if the file has holes, else the first block | |
1503 | * past the end of file. | |
1504 | * Return 0 if the file is currently local (in-inode). | |
1505 | */ | |
1506 | int /* error */ | |
1507 | xfs_bmap_first_unused( | |
1508 | xfs_trans_t *tp, /* transaction pointer */ | |
1509 | xfs_inode_t *ip, /* incore inode */ | |
1510 | xfs_extlen_t len, /* size of hole to find */ | |
1511 | xfs_fileoff_t *first_unused, /* unused block */ | |
1512 | int whichfork) /* data or attr fork */ | |
1513 | { | |
1514 | int error; /* error return value */ | |
1515 | int idx; /* extent record index */ | |
1516 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
1517 | xfs_fileoff_t lastaddr; /* last block number seen */ | |
1518 | xfs_fileoff_t lowest; /* lowest useful block */ | |
1519 | xfs_fileoff_t max; /* starting useful block */ | |
1520 | xfs_fileoff_t off; /* offset for this block */ | |
1521 | xfs_extnum_t nextents; /* number of extent entries */ | |
1522 | ||
1523 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE || | |
1524 | XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS || | |
1525 | XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL); | |
1526 | if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) { | |
1527 | *first_unused = 0; | |
1528 | return 0; | |
dd9f438e | 1529 | } |
9e5987a7 DC |
1530 | ifp = XFS_IFORK_PTR(ip, whichfork); |
1531 | if (!(ifp->if_flags & XFS_IFEXTENTS) && | |
1532 | (error = xfs_iread_extents(tp, ip, whichfork))) | |
1533 | return error; | |
1534 | lowest = *first_unused; | |
1535 | nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); | |
1536 | for (idx = 0, lastaddr = 0, max = lowest; idx < nextents; idx++) { | |
1537 | xfs_bmbt_rec_host_t *ep = xfs_iext_get_ext(ifp, idx); | |
1538 | off = xfs_bmbt_get_startoff(ep); | |
1539 | /* | |
1540 | * See if the hole before this extent will work. | |
1541 | */ | |
1542 | if (off >= lowest + len && off - max >= len) { | |
1543 | *first_unused = max; | |
1544 | return 0; | |
1545 | } | |
1546 | lastaddr = off + xfs_bmbt_get_blockcount(ep); | |
1547 | max = XFS_FILEOFF_MAX(lastaddr, lowest); | |
dd9f438e | 1548 | } |
9e5987a7 DC |
1549 | *first_unused = max; |
1550 | return 0; | |
1551 | } | |
1552 | ||
1553 | /* | |
02bb4873 | 1554 | * Returns the file-relative block number of the last block - 1 before |
9e5987a7 DC |
1555 | * last_block (input value) in the file. |
1556 | * This is not based on i_size, it is based on the extent records. | |
1557 | * Returns 0 for local files, as they do not have extent records. | |
1558 | */ | |
1559 | int /* error */ | |
1560 | xfs_bmap_last_before( | |
1561 | xfs_trans_t *tp, /* transaction pointer */ | |
1562 | xfs_inode_t *ip, /* incore inode */ | |
1563 | xfs_fileoff_t *last_block, /* last block */ | |
1564 | int whichfork) /* data or attr fork */ | |
1565 | { | |
1566 | xfs_fileoff_t bno; /* input file offset */ | |
1567 | int eof; /* hit end of file */ | |
1568 | xfs_bmbt_rec_host_t *ep; /* pointer to last extent */ | |
1569 | int error; /* error return value */ | |
1570 | xfs_bmbt_irec_t got; /* current extent value */ | |
1571 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
1572 | xfs_extnum_t lastx; /* last extent used */ | |
1573 | xfs_bmbt_irec_t prev; /* previous extent value */ | |
1574 | ||
1575 | if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE && | |
1576 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && | |
1577 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL) | |
1578 | return XFS_ERROR(EIO); | |
1579 | if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) { | |
1580 | *last_block = 0; | |
1581 | return 0; | |
1582 | } | |
1583 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
1584 | if (!(ifp->if_flags & XFS_IFEXTENTS) && | |
1585 | (error = xfs_iread_extents(tp, ip, whichfork))) | |
1586 | return error; | |
1587 | bno = *last_block - 1; | |
1588 | ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, | |
1589 | &prev); | |
1590 | if (eof || xfs_bmbt_get_startoff(ep) > bno) { | |
1591 | if (prev.br_startoff == NULLFILEOFF) | |
1592 | *last_block = 0; | |
dd9f438e | 1593 | else |
9e5987a7 | 1594 | *last_block = prev.br_startoff + prev.br_blockcount; |
dd9f438e | 1595 | } |
dd9f438e | 1596 | /* |
9e5987a7 | 1597 | * Otherwise *last_block is already the right answer. |
dd9f438e | 1598 | */ |
9e5987a7 DC |
1599 | return 0; |
1600 | } | |
1601 | ||
68988114 | 1602 | int |
9e5987a7 DC |
1603 | xfs_bmap_last_extent( |
1604 | struct xfs_trans *tp, | |
1605 | struct xfs_inode *ip, | |
1606 | int whichfork, | |
1607 | struct xfs_bmbt_irec *rec, | |
1608 | int *is_empty) | |
1609 | { | |
1610 | struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, whichfork); | |
1611 | int error; | |
1612 | int nextents; | |
1613 | ||
1614 | if (!(ifp->if_flags & XFS_IFEXTENTS)) { | |
1615 | error = xfs_iread_extents(tp, ip, whichfork); | |
1616 | if (error) | |
1617 | return error; | |
dd9f438e NS |
1618 | } |
1619 | ||
9e5987a7 DC |
1620 | nextents = ifp->if_bytes / sizeof(xfs_bmbt_rec_t); |
1621 | if (nextents == 0) { | |
1622 | *is_empty = 1; | |
1623 | return 0; | |
1624 | } | |
dd9f438e | 1625 | |
9e5987a7 DC |
1626 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, nextents - 1), rec); |
1627 | *is_empty = 0; | |
dd9f438e NS |
1628 | return 0; |
1629 | } | |
1630 | ||
9e5987a7 DC |
1631 | /* |
1632 | * Check the last inode extent to determine whether this allocation will result | |
1633 | * in blocks being allocated at the end of the file. When we allocate new data | |
1634 | * blocks at the end of the file which do not start at the previous data block, | |
1635 | * we will try to align the new blocks at stripe unit boundaries. | |
1636 | * | |
1637 | * Returns 0 in bma->aeof if the file (fork) is empty as any new write will be | |
1638 | * at, or past the EOF. | |
1639 | */ | |
1640 | STATIC int | |
1641 | xfs_bmap_isaeof( | |
1642 | struct xfs_bmalloca *bma, | |
1643 | int whichfork) | |
1da177e4 | 1644 | { |
9e5987a7 DC |
1645 | struct xfs_bmbt_irec rec; |
1646 | int is_empty; | |
1647 | int error; | |
1da177e4 | 1648 | |
9e5987a7 DC |
1649 | bma->aeof = 0; |
1650 | error = xfs_bmap_last_extent(NULL, bma->ip, whichfork, &rec, | |
1651 | &is_empty); | |
1652 | if (error || is_empty) | |
1653 | return error; | |
1da177e4 | 1654 | |
1da177e4 | 1655 | /* |
9e5987a7 DC |
1656 | * Check if we are allocation or past the last extent, or at least into |
1657 | * the last delayed allocated extent. | |
1da177e4 | 1658 | */ |
9e5987a7 DC |
1659 | bma->aeof = bma->offset >= rec.br_startoff + rec.br_blockcount || |
1660 | (bma->offset >= rec.br_startoff && | |
1661 | isnullstartblock(rec.br_startblock)); | |
1662 | return 0; | |
1663 | } | |
1da177e4 | 1664 | |
9e5987a7 DC |
1665 | /* |
1666 | * Returns the file-relative block number of the first block past eof in | |
1667 | * the file. This is not based on i_size, it is based on the extent records. | |
1668 | * Returns 0 for local files, as they do not have extent records. | |
1669 | */ | |
1670 | int | |
1671 | xfs_bmap_last_offset( | |
1672 | struct xfs_trans *tp, | |
1673 | struct xfs_inode *ip, | |
1674 | xfs_fileoff_t *last_block, | |
1675 | int whichfork) | |
1676 | { | |
1677 | struct xfs_bmbt_irec rec; | |
1678 | int is_empty; | |
1679 | int error; | |
04e99455 | 1680 | |
9e5987a7 | 1681 | *last_block = 0; |
0892ccd6 | 1682 | |
9e5987a7 DC |
1683 | if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_LOCAL) |
1684 | return 0; | |
a365bdd5 | 1685 | |
9e5987a7 DC |
1686 | if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE && |
1687 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) | |
1688 | return XFS_ERROR(EIO); | |
a365bdd5 | 1689 | |
9e5987a7 DC |
1690 | error = xfs_bmap_last_extent(NULL, ip, whichfork, &rec, &is_empty); |
1691 | if (error || is_empty) | |
a365bdd5 | 1692 | return error; |
9e5987a7 DC |
1693 | |
1694 | *last_block = rec.br_startoff + rec.br_blockcount; | |
a365bdd5 NS |
1695 | return 0; |
1696 | } | |
1697 | ||
9e5987a7 DC |
1698 | /* |
1699 | * Returns whether the selected fork of the inode has exactly one | |
1700 | * block or not. For the data fork we check this matches di_size, | |
1701 | * implying the file's range is 0..bsize-1. | |
1702 | */ | |
1703 | int /* 1=>1 block, 0=>otherwise */ | |
1704 | xfs_bmap_one_block( | |
1705 | xfs_inode_t *ip, /* incore inode */ | |
1706 | int whichfork) /* data or attr fork */ | |
c467c049 | 1707 | { |
9e5987a7 DC |
1708 | xfs_bmbt_rec_host_t *ep; /* ptr to fork's extent */ |
1709 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
1710 | int rval; /* return value */ | |
1711 | xfs_bmbt_irec_t s; /* internal version of extent */ | |
c467c049 | 1712 | |
9e5987a7 DC |
1713 | #ifndef DEBUG |
1714 | if (whichfork == XFS_DATA_FORK) | |
1715 | return XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize; | |
1716 | #endif /* !DEBUG */ | |
1717 | if (XFS_IFORK_NEXTENTS(ip, whichfork) != 1) | |
1718 | return 0; | |
1719 | if (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) | |
1720 | return 0; | |
1721 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
1722 | ASSERT(ifp->if_flags & XFS_IFEXTENTS); | |
1723 | ep = xfs_iext_get_ext(ifp, 0); | |
1724 | xfs_bmbt_get_all(ep, &s); | |
1725 | rval = s.br_startoff == 0 && s.br_blockcount == 1; | |
1726 | if (rval && whichfork == XFS_DATA_FORK) | |
1727 | ASSERT(XFS_ISIZE(ip) == ip->i_mount->m_sb.sb_blocksize); | |
1728 | return rval; | |
1729 | } | |
c467c049 | 1730 | |
9e5987a7 DC |
1731 | /* |
1732 | * Extent tree manipulation functions used during allocation. | |
1733 | */ | |
c467c049 | 1734 | |
9e5987a7 DC |
1735 | /* |
1736 | * Convert a delayed allocation to a real allocation. | |
1737 | */ | |
1738 | STATIC int /* error */ | |
1739 | xfs_bmap_add_extent_delay_real( | |
1740 | struct xfs_bmalloca *bma) | |
1741 | { | |
1742 | struct xfs_bmbt_irec *new = &bma->got; | |
1743 | int diff; /* temp value */ | |
1744 | xfs_bmbt_rec_host_t *ep; /* extent entry for idx */ | |
1745 | int error; /* error return value */ | |
1746 | int i; /* temp state */ | |
1747 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
1748 | xfs_fileoff_t new_endoff; /* end offset of new entry */ | |
1749 | xfs_bmbt_irec_t r[3]; /* neighbor extent entries */ | |
1750 | /* left is 0, right is 1, prev is 2 */ | |
1751 | int rval=0; /* return value (logging flags) */ | |
1752 | int state = 0;/* state bits, accessed thru macros */ | |
1753 | xfs_filblks_t da_new; /* new count del alloc blocks used */ | |
1754 | xfs_filblks_t da_old; /* old count del alloc blocks used */ | |
1755 | xfs_filblks_t temp=0; /* value for da_new calculations */ | |
1756 | xfs_filblks_t temp2=0;/* value for da_new calculations */ | |
1757 | int tmp_rval; /* partial logging flags */ | |
c467c049 | 1758 | |
9e5987a7 | 1759 | ifp = XFS_IFORK_PTR(bma->ip, XFS_DATA_FORK); |
c467c049 | 1760 | |
9e5987a7 DC |
1761 | ASSERT(bma->idx >= 0); |
1762 | ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); | |
1763 | ASSERT(!isnullstartblock(new->br_startblock)); | |
1764 | ASSERT(!bma->cur || | |
1765 | (bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL)); | |
c467c049 | 1766 | |
9e5987a7 | 1767 | XFS_STATS_INC(xs_add_exlist); |
c467c049 | 1768 | |
9e5987a7 DC |
1769 | #define LEFT r[0] |
1770 | #define RIGHT r[1] | |
1771 | #define PREV r[2] | |
c467c049 CH |
1772 | |
1773 | /* | |
9e5987a7 | 1774 | * Set up a bunch of variables to make the tests simpler. |
c467c049 | 1775 | */ |
9e5987a7 DC |
1776 | ep = xfs_iext_get_ext(ifp, bma->idx); |
1777 | xfs_bmbt_get_all(ep, &PREV); | |
1778 | new_endoff = new->br_startoff + new->br_blockcount; | |
1779 | ASSERT(PREV.br_startoff <= new->br_startoff); | |
1780 | ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff); | |
1781 | ||
1782 | da_old = startblockval(PREV.br_startblock); | |
1783 | da_new = 0; | |
1784 | ||
c467c049 | 1785 | /* |
9e5987a7 DC |
1786 | * Set flags determining what part of the previous delayed allocation |
1787 | * extent is being replaced by a real allocation. | |
c467c049 | 1788 | */ |
9e5987a7 DC |
1789 | if (PREV.br_startoff == new->br_startoff) |
1790 | state |= BMAP_LEFT_FILLING; | |
1791 | if (PREV.br_startoff + PREV.br_blockcount == new_endoff) | |
1792 | state |= BMAP_RIGHT_FILLING; | |
c467c049 CH |
1793 | |
1794 | /* | |
9e5987a7 DC |
1795 | * Check and set flags if this segment has a left neighbor. |
1796 | * Don't set contiguous if the combined extent would be too large. | |
c467c049 | 1797 | */ |
9e5987a7 DC |
1798 | if (bma->idx > 0) { |
1799 | state |= BMAP_LEFT_VALID; | |
1800 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &LEFT); | |
a99ebf43 | 1801 | |
9e5987a7 DC |
1802 | if (isnullstartblock(LEFT.br_startblock)) |
1803 | state |= BMAP_LEFT_DELAY; | |
a365bdd5 | 1804 | } |
a365bdd5 | 1805 | |
9e5987a7 DC |
1806 | if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && |
1807 | LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff && | |
1808 | LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock && | |
1809 | LEFT.br_state == new->br_state && | |
1810 | LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN) | |
1811 | state |= BMAP_LEFT_CONTIG; | |
a365bdd5 | 1812 | |
1da177e4 | 1813 | /* |
9e5987a7 DC |
1814 | * Check and set flags if this segment has a right neighbor. |
1815 | * Don't set contiguous if the combined extent would be too large. | |
1816 | * Also check for all-three-contiguous being too large. | |
1da177e4 | 1817 | */ |
9e5987a7 DC |
1818 | if (bma->idx < bma->ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) { |
1819 | state |= BMAP_RIGHT_VALID; | |
1820 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx + 1), &RIGHT); | |
14b064ce | 1821 | |
9e5987a7 DC |
1822 | if (isnullstartblock(RIGHT.br_startblock)) |
1823 | state |= BMAP_RIGHT_DELAY; | |
1da177e4 | 1824 | } |
9e5987a7 DC |
1825 | |
1826 | if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && | |
1827 | new_endoff == RIGHT.br_startoff && | |
1828 | new->br_startblock + new->br_blockcount == RIGHT.br_startblock && | |
1829 | new->br_state == RIGHT.br_state && | |
1830 | new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN && | |
1831 | ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | | |
1832 | BMAP_RIGHT_FILLING)) != | |
1833 | (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | | |
1834 | BMAP_RIGHT_FILLING) || | |
1835 | LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount | |
1836 | <= MAXEXTLEN)) | |
1837 | state |= BMAP_RIGHT_CONTIG; | |
1838 | ||
1839 | error = 0; | |
1da177e4 | 1840 | /* |
9e5987a7 | 1841 | * Switch out based on the FILLING and CONTIG state bits. |
1da177e4 | 1842 | */ |
9e5987a7 DC |
1843 | switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | |
1844 | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) { | |
1845 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | | |
1846 | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: | |
1da177e4 | 1847 | /* |
9e5987a7 DC |
1848 | * Filling in all of a previously delayed allocation extent. |
1849 | * The left and right neighbors are both contiguous with new. | |
1da177e4 | 1850 | */ |
9e5987a7 DC |
1851 | bma->idx--; |
1852 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1853 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), | |
1854 | LEFT.br_blockcount + PREV.br_blockcount + | |
1855 | RIGHT.br_blockcount); | |
1856 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1857 | ||
1858 | xfs_iext_remove(bma->ip, bma->idx + 1, 2, state); | |
1859 | bma->ip->i_d.di_nextents--; | |
1860 | if (bma->cur == NULL) | |
1861 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
1862 | else { | |
1863 | rval = XFS_ILOG_CORE; | |
1864 | error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, | |
1865 | RIGHT.br_startblock, | |
1866 | RIGHT.br_blockcount, &i); | |
1867 | if (error) | |
1868 | goto done; | |
1869 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1870 | error = xfs_btree_delete(bma->cur, &i); | |
1871 | if (error) | |
1872 | goto done; | |
1873 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1874 | error = xfs_btree_decrement(bma->cur, 0, &i); | |
1875 | if (error) | |
1876 | goto done; | |
1877 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1878 | error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, | |
1879 | LEFT.br_startblock, | |
1880 | LEFT.br_blockcount + | |
1881 | PREV.br_blockcount + | |
1882 | RIGHT.br_blockcount, LEFT.br_state); | |
1883 | if (error) | |
1884 | goto done; | |
1885 | } | |
1886 | break; | |
1887 | ||
1888 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: | |
a365bdd5 | 1889 | /* |
9e5987a7 DC |
1890 | * Filling in all of a previously delayed allocation extent. |
1891 | * The left neighbor is contiguous, the right is not. | |
a365bdd5 | 1892 | */ |
9e5987a7 DC |
1893 | bma->idx--; |
1894 | ||
1895 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1896 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), | |
1897 | LEFT.br_blockcount + PREV.br_blockcount); | |
1898 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1899 | ||
1900 | xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); | |
1901 | if (bma->cur == NULL) | |
1902 | rval = XFS_ILOG_DEXT; | |
1903 | else { | |
1904 | rval = 0; | |
1905 | error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff, | |
1906 | LEFT.br_startblock, LEFT.br_blockcount, | |
1907 | &i); | |
1908 | if (error) | |
1909 | goto done; | |
1910 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1911 | error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, | |
1912 | LEFT.br_startblock, | |
1913 | LEFT.br_blockcount + | |
1914 | PREV.br_blockcount, LEFT.br_state); | |
1915 | if (error) | |
1916 | goto done; | |
1917 | } | |
1918 | break; | |
1919 | ||
1920 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: | |
0937e0fd | 1921 | /* |
9e5987a7 DC |
1922 | * Filling in all of a previously delayed allocation extent. |
1923 | * The right neighbor is contiguous, the left is not. | |
0937e0fd | 1924 | */ |
9e5987a7 DC |
1925 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); |
1926 | xfs_bmbt_set_startblock(ep, new->br_startblock); | |
1927 | xfs_bmbt_set_blockcount(ep, | |
1928 | PREV.br_blockcount + RIGHT.br_blockcount); | |
1929 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
0937e0fd | 1930 | |
9e5987a7 DC |
1931 | xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); |
1932 | if (bma->cur == NULL) | |
1933 | rval = XFS_ILOG_DEXT; | |
1934 | else { | |
1935 | rval = 0; | |
1936 | error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, | |
1937 | RIGHT.br_startblock, | |
1938 | RIGHT.br_blockcount, &i); | |
1939 | if (error) | |
1940 | goto done; | |
1941 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1942 | error = xfs_bmbt_update(bma->cur, PREV.br_startoff, | |
1943 | new->br_startblock, | |
1944 | PREV.br_blockcount + | |
1945 | RIGHT.br_blockcount, PREV.br_state); | |
1946 | if (error) | |
1947 | goto done; | |
1948 | } | |
1949 | break; | |
1950 | ||
1951 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING: | |
a365bdd5 | 1952 | /* |
9e5987a7 DC |
1953 | * Filling in all of a previously delayed allocation extent. |
1954 | * Neither the left nor right neighbors are contiguous with | |
1955 | * the new one. | |
a365bdd5 | 1956 | */ |
9e5987a7 DC |
1957 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); |
1958 | xfs_bmbt_set_startblock(ep, new->br_startblock); | |
1959 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
a365bdd5 | 1960 | |
9e5987a7 DC |
1961 | bma->ip->i_d.di_nextents++; |
1962 | if (bma->cur == NULL) | |
1963 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
1964 | else { | |
1965 | rval = XFS_ILOG_CORE; | |
1966 | error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, | |
1967 | new->br_startblock, new->br_blockcount, | |
1968 | &i); | |
1969 | if (error) | |
1970 | goto done; | |
1971 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
1972 | bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; | |
1973 | error = xfs_btree_insert(bma->cur, &i); | |
1974 | if (error) | |
1975 | goto done; | |
1976 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1977 | } | |
1978 | break; | |
1da177e4 | 1979 | |
9e5987a7 | 1980 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG: |
1da177e4 | 1981 | /* |
9e5987a7 DC |
1982 | * Filling in the first part of a previous delayed allocation. |
1983 | * The left neighbor is contiguous. | |
1da177e4 | 1984 | */ |
9e5987a7 DC |
1985 | trace_xfs_bmap_pre_update(bma->ip, bma->idx - 1, state, _THIS_IP_); |
1986 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx - 1), | |
1987 | LEFT.br_blockcount + new->br_blockcount); | |
1988 | xfs_bmbt_set_startoff(ep, | |
1989 | PREV.br_startoff + new->br_blockcount); | |
1990 | trace_xfs_bmap_post_update(bma->ip, bma->idx - 1, state, _THIS_IP_); | |
1da177e4 | 1991 | |
9e5987a7 DC |
1992 | temp = PREV.br_blockcount - new->br_blockcount; |
1993 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1994 | xfs_bmbt_set_blockcount(ep, temp); | |
1995 | if (bma->cur == NULL) | |
1996 | rval = XFS_ILOG_DEXT; | |
1997 | else { | |
1998 | rval = 0; | |
1999 | error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff, | |
2000 | LEFT.br_startblock, LEFT.br_blockcount, | |
2001 | &i); | |
2002 | if (error) | |
2003 | goto done; | |
2004 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2005 | error = xfs_bmbt_update(bma->cur, LEFT.br_startoff, | |
2006 | LEFT.br_startblock, | |
2007 | LEFT.br_blockcount + | |
2008 | new->br_blockcount, | |
2009 | LEFT.br_state); | |
f3ca8738 | 2010 | if (error) |
1da177e4 | 2011 | goto done; |
1da177e4 | 2012 | } |
9e5987a7 DC |
2013 | da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), |
2014 | startblockval(PREV.br_startblock)); | |
2015 | xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); | |
2016 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
2017 | ||
2018 | bma->idx--; | |
2019 | break; | |
2020 | ||
2021 | case BMAP_LEFT_FILLING: | |
1da177e4 | 2022 | /* |
9e5987a7 DC |
2023 | * Filling in the first part of a previous delayed allocation. |
2024 | * The left neighbor is not contiguous. | |
1da177e4 | 2025 | */ |
9e5987a7 DC |
2026 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); |
2027 | xfs_bmbt_set_startoff(ep, new_endoff); | |
2028 | temp = PREV.br_blockcount - new->br_blockcount; | |
2029 | xfs_bmbt_set_blockcount(ep, temp); | |
2030 | xfs_iext_insert(bma->ip, bma->idx, 1, new, state); | |
2031 | bma->ip->i_d.di_nextents++; | |
2032 | if (bma->cur == NULL) | |
2033 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
1da177e4 | 2034 | else { |
9e5987a7 DC |
2035 | rval = XFS_ILOG_CORE; |
2036 | error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, | |
2037 | new->br_startblock, new->br_blockcount, | |
2038 | &i); | |
2039 | if (error) | |
2040 | goto done; | |
2041 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
2042 | bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; | |
2043 | error = xfs_btree_insert(bma->cur, &i); | |
2044 | if (error) | |
1da177e4 | 2045 | goto done; |
6bd8fc8a | 2046 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); |
1da177e4 | 2047 | } |
233eebb9 | 2048 | |
9e5987a7 DC |
2049 | if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) { |
2050 | error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, | |
2051 | bma->firstblock, bma->flist, | |
2052 | &bma->cur, 1, &tmp_rval, XFS_DATA_FORK); | |
2053 | rval |= tmp_rval; | |
2054 | if (error) | |
2055 | goto done; | |
1da177e4 | 2056 | } |
9e5987a7 DC |
2057 | da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), |
2058 | startblockval(PREV.br_startblock) - | |
2059 | (bma->cur ? bma->cur->bc_private.b.allocated : 0)); | |
2060 | ep = xfs_iext_get_ext(ifp, bma->idx + 1); | |
2061 | xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); | |
2062 | trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_); | |
1da177e4 LT |
2063 | break; |
2064 | ||
9e5987a7 | 2065 | case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: |
1da177e4 | 2066 | /* |
9e5987a7 DC |
2067 | * Filling in the last part of a previous delayed allocation. |
2068 | * The right neighbor is contiguous with the new allocation. | |
1da177e4 | 2069 | */ |
9e5987a7 DC |
2070 | temp = PREV.br_blockcount - new->br_blockcount; |
2071 | trace_xfs_bmap_pre_update(bma->ip, bma->idx + 1, state, _THIS_IP_); | |
1da177e4 | 2072 | xfs_bmbt_set_blockcount(ep, temp); |
9e5987a7 DC |
2073 | xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx + 1), |
2074 | new->br_startoff, new->br_startblock, | |
2075 | new->br_blockcount + RIGHT.br_blockcount, | |
2076 | RIGHT.br_state); | |
2077 | trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_); | |
2078 | if (bma->cur == NULL) | |
2079 | rval = XFS_ILOG_DEXT; | |
2080 | else { | |
2081 | rval = 0; | |
2082 | error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff, | |
2083 | RIGHT.br_startblock, | |
2084 | RIGHT.br_blockcount, &i); | |
2085 | if (error) | |
2086 | goto done; | |
2087 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2088 | error = xfs_bmbt_update(bma->cur, new->br_startoff, | |
2089 | new->br_startblock, | |
2090 | new->br_blockcount + | |
2091 | RIGHT.br_blockcount, | |
2092 | RIGHT.br_state); | |
2093 | if (error) | |
2094 | goto done; | |
1da177e4 | 2095 | } |
9e5987a7 DC |
2096 | |
2097 | da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), | |
2098 | startblockval(PREV.br_startblock)); | |
2099 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
2100 | xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); | |
2101 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
2102 | ||
2103 | bma->idx++; | |
1da177e4 LT |
2104 | break; |
2105 | ||
9e5987a7 | 2106 | case BMAP_RIGHT_FILLING: |
1da177e4 | 2107 | /* |
9e5987a7 DC |
2108 | * Filling in the last part of a previous delayed allocation. |
2109 | * The right neighbor is not contiguous. | |
1da177e4 | 2110 | */ |
9e5987a7 DC |
2111 | temp = PREV.br_blockcount - new->br_blockcount; |
2112 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1da177e4 | 2113 | xfs_bmbt_set_blockcount(ep, temp); |
9e5987a7 DC |
2114 | xfs_iext_insert(bma->ip, bma->idx + 1, 1, new, state); |
2115 | bma->ip->i_d.di_nextents++; | |
2116 | if (bma->cur == NULL) | |
2117 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2118 | else { | |
2119 | rval = XFS_ILOG_CORE; | |
2120 | error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, | |
2121 | new->br_startblock, new->br_blockcount, | |
2122 | &i); | |
2123 | if (error) | |
2124 | goto done; | |
2125 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
2126 | bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; | |
2127 | error = xfs_btree_insert(bma->cur, &i); | |
2128 | if (error) | |
2129 | goto done; | |
2130 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1da177e4 | 2131 | } |
9e5987a7 DC |
2132 | |
2133 | if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) { | |
2134 | error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, | |
2135 | bma->firstblock, bma->flist, &bma->cur, 1, | |
2136 | &tmp_rval, XFS_DATA_FORK); | |
2137 | rval |= tmp_rval; | |
2138 | if (error) | |
2139 | goto done; | |
1da177e4 | 2140 | } |
9e5987a7 DC |
2141 | da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp), |
2142 | startblockval(PREV.br_startblock) - | |
2143 | (bma->cur ? bma->cur->bc_private.b.allocated : 0)); | |
2144 | ep = xfs_iext_get_ext(ifp, bma->idx); | |
2145 | xfs_bmbt_set_startblock(ep, nullstartblock(da_new)); | |
2146 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
2147 | ||
2148 | bma->idx++; | |
1da177e4 LT |
2149 | break; |
2150 | ||
2151 | case 0: | |
2152 | /* | |
9e5987a7 DC |
2153 | * Filling in the middle part of a previous delayed allocation. |
2154 | * Contiguity is impossible here. | |
2155 | * This case is avoided almost all the time. | |
2156 | * | |
2157 | * We start with a delayed allocation: | |
2158 | * | |
2159 | * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+ | |
2160 | * PREV @ idx | |
2161 | * | |
2162 | * and we are allocating: | |
2163 | * +rrrrrrrrrrrrrrrrr+ | |
2164 | * new | |
2165 | * | |
2166 | * and we set it up for insertion as: | |
2167 | * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+ | |
2168 | * new | |
2169 | * PREV @ idx LEFT RIGHT | |
2170 | * inserted at idx + 1 | |
1da177e4 | 2171 | */ |
9e5987a7 DC |
2172 | temp = new->br_startoff - PREV.br_startoff; |
2173 | temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff; | |
2174 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, 0, _THIS_IP_); | |
2175 | xfs_bmbt_set_blockcount(ep, temp); /* truncate PREV */ | |
2176 | LEFT = *new; | |
2177 | RIGHT.br_state = PREV.br_state; | |
2178 | RIGHT.br_startblock = nullstartblock( | |
2179 | (int)xfs_bmap_worst_indlen(bma->ip, temp2)); | |
2180 | RIGHT.br_startoff = new_endoff; | |
2181 | RIGHT.br_blockcount = temp2; | |
2182 | /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */ | |
2183 | xfs_iext_insert(bma->ip, bma->idx + 1, 2, &LEFT, state); | |
2184 | bma->ip->i_d.di_nextents++; | |
2185 | if (bma->cur == NULL) | |
2186 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2187 | else { | |
2188 | rval = XFS_ILOG_CORE; | |
2189 | error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff, | |
2190 | new->br_startblock, new->br_blockcount, | |
2191 | &i); | |
2192 | if (error) | |
2193 | goto done; | |
2194 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
2195 | bma->cur->bc_rec.b.br_state = XFS_EXT_NORM; | |
2196 | error = xfs_btree_insert(bma->cur, &i); | |
2197 | if (error) | |
2198 | goto done; | |
2199 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1da177e4 | 2200 | } |
1da177e4 | 2201 | |
9e5987a7 DC |
2202 | if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) { |
2203 | error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, | |
2204 | bma->firstblock, bma->flist, &bma->cur, | |
2205 | 1, &tmp_rval, XFS_DATA_FORK); | |
2206 | rval |= tmp_rval; | |
2207 | if (error) | |
2208 | goto done; | |
2209 | } | |
2210 | temp = xfs_bmap_worst_indlen(bma->ip, temp); | |
2211 | temp2 = xfs_bmap_worst_indlen(bma->ip, temp2); | |
2212 | diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) - | |
2213 | (bma->cur ? bma->cur->bc_private.b.allocated : 0)); | |
2214 | if (diff > 0) { | |
2215 | error = xfs_icsb_modify_counters(bma->ip->i_mount, | |
2216 | XFS_SBS_FDBLOCKS, | |
2217 | -((int64_t)diff), 0); | |
2218 | ASSERT(!error); | |
2219 | if (error) | |
2220 | goto done; | |
2221 | } | |
2222 | ||
2223 | ep = xfs_iext_get_ext(ifp, bma->idx); | |
2224 | xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); | |
2225 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
2226 | trace_xfs_bmap_pre_update(bma->ip, bma->idx + 2, state, _THIS_IP_); | |
2227 | xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, bma->idx + 2), | |
2228 | nullstartblock((int)temp2)); | |
2229 | trace_xfs_bmap_post_update(bma->ip, bma->idx + 2, state, _THIS_IP_); | |
2230 | ||
2231 | bma->idx++; | |
2232 | da_new = temp + temp2; | |
2233 | break; | |
2234 | ||
2235 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2236 | case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2237 | case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG: | |
2238 | case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: | |
2239 | case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2240 | case BMAP_LEFT_CONTIG: | |
2241 | case BMAP_RIGHT_CONTIG: | |
2242 | /* | |
2243 | * These cases are all impossible. | |
2244 | */ | |
2245 | ASSERT(0); | |
2246 | } | |
2247 | ||
2248 | /* convert to a btree if necessary */ | |
2249 | if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) { | |
2250 | int tmp_logflags; /* partial log flag return val */ | |
2251 | ||
2252 | ASSERT(bma->cur == NULL); | |
2253 | error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, | |
2254 | bma->firstblock, bma->flist, &bma->cur, | |
2255 | da_old > 0, &tmp_logflags, XFS_DATA_FORK); | |
2256 | bma->logflags |= tmp_logflags; | |
2257 | if (error) | |
2258 | goto done; | |
2259 | } | |
2260 | ||
2261 | /* adjust for changes in reserved delayed indirect blocks */ | |
2262 | if (da_old || da_new) { | |
2263 | temp = da_new; | |
2264 | if (bma->cur) | |
2265 | temp += bma->cur->bc_private.b.allocated; | |
2266 | ASSERT(temp <= da_old); | |
2267 | if (temp < da_old) | |
2268 | xfs_icsb_modify_counters(bma->ip->i_mount, | |
2269 | XFS_SBS_FDBLOCKS, | |
2270 | (int64_t)(da_old - temp), 0); | |
96540c78 | 2271 | } |
9e5987a7 DC |
2272 | |
2273 | /* clear out the allocated field, done with it now in any case. */ | |
2274 | if (bma->cur) | |
2275 | bma->cur->bc_private.b.allocated = 0; | |
2276 | ||
2277 | xfs_bmap_check_leaf_extents(bma->cur, bma->ip, XFS_DATA_FORK); | |
1da177e4 | 2278 | done: |
9e5987a7 | 2279 | bma->logflags |= rval; |
1da177e4 | 2280 | return error; |
9e5987a7 DC |
2281 | #undef LEFT |
2282 | #undef RIGHT | |
2283 | #undef PREV | |
1da177e4 LT |
2284 | } |
2285 | ||
2286 | /* | |
9e5987a7 | 2287 | * Convert an unwritten allocation to a real allocation or vice versa. |
1da177e4 | 2288 | */ |
9e5987a7 DC |
2289 | STATIC int /* error */ |
2290 | xfs_bmap_add_extent_unwritten_real( | |
2291 | struct xfs_trans *tp, | |
2292 | xfs_inode_t *ip, /* incore inode pointer */ | |
2293 | xfs_extnum_t *idx, /* extent number to update/insert */ | |
2294 | xfs_btree_cur_t **curp, /* if *curp is null, not a btree */ | |
2295 | xfs_bmbt_irec_t *new, /* new data to add to file extents */ | |
2296 | xfs_fsblock_t *first, /* pointer to firstblock variable */ | |
2297 | xfs_bmap_free_t *flist, /* list of extents to be freed */ | |
2298 | int *logflagsp) /* inode logging flags */ | |
1da177e4 | 2299 | { |
9e5987a7 DC |
2300 | xfs_btree_cur_t *cur; /* btree cursor */ |
2301 | xfs_bmbt_rec_host_t *ep; /* extent entry for idx */ | |
2302 | int error; /* error return value */ | |
2303 | int i; /* temp state */ | |
2304 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
2305 | xfs_fileoff_t new_endoff; /* end offset of new entry */ | |
2306 | xfs_exntst_t newext; /* new extent state */ | |
2307 | xfs_exntst_t oldext; /* old extent state */ | |
2308 | xfs_bmbt_irec_t r[3]; /* neighbor extent entries */ | |
2309 | /* left is 0, right is 1, prev is 2 */ | |
2310 | int rval=0; /* return value (logging flags) */ | |
2311 | int state = 0;/* state bits, accessed thru macros */ | |
1da177e4 | 2312 | |
9e5987a7 | 2313 | *logflagsp = 0; |
1da177e4 | 2314 | |
9e5987a7 DC |
2315 | cur = *curp; |
2316 | ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK); | |
8096b1eb | 2317 | |
9e5987a7 DC |
2318 | ASSERT(*idx >= 0); |
2319 | ASSERT(*idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); | |
2320 | ASSERT(!isnullstartblock(new->br_startblock)); | |
2321 | ||
2322 | XFS_STATS_INC(xs_add_exlist); | |
2323 | ||
2324 | #define LEFT r[0] | |
2325 | #define RIGHT r[1] | |
2326 | #define PREV r[2] | |
7cc95a82 | 2327 | |
1da177e4 | 2328 | /* |
9e5987a7 | 2329 | * Set up a bunch of variables to make the tests simpler. |
1da177e4 | 2330 | */ |
9e5987a7 DC |
2331 | error = 0; |
2332 | ep = xfs_iext_get_ext(ifp, *idx); | |
2333 | xfs_bmbt_get_all(ep, &PREV); | |
2334 | newext = new->br_state; | |
2335 | oldext = (newext == XFS_EXT_UNWRITTEN) ? | |
2336 | XFS_EXT_NORM : XFS_EXT_UNWRITTEN; | |
2337 | ASSERT(PREV.br_state == oldext); | |
2338 | new_endoff = new->br_startoff + new->br_blockcount; | |
2339 | ASSERT(PREV.br_startoff <= new->br_startoff); | |
2340 | ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff); | |
7cc95a82 | 2341 | |
1da177e4 | 2342 | /* |
9e5987a7 DC |
2343 | * Set flags determining what part of the previous oldext allocation |
2344 | * extent is being replaced by a newext allocation. | |
1da177e4 | 2345 | */ |
9e5987a7 DC |
2346 | if (PREV.br_startoff == new->br_startoff) |
2347 | state |= BMAP_LEFT_FILLING; | |
2348 | if (PREV.br_startoff + PREV.br_blockcount == new_endoff) | |
2349 | state |= BMAP_RIGHT_FILLING; | |
2350 | ||
1da177e4 | 2351 | /* |
9e5987a7 DC |
2352 | * Check and set flags if this segment has a left neighbor. |
2353 | * Don't set contiguous if the combined extent would be too large. | |
1da177e4 | 2354 | */ |
9e5987a7 DC |
2355 | if (*idx > 0) { |
2356 | state |= BMAP_LEFT_VALID; | |
2357 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT); | |
2358 | ||
2359 | if (isnullstartblock(LEFT.br_startblock)) | |
2360 | state |= BMAP_LEFT_DELAY; | |
1da177e4 | 2361 | } |
9e5987a7 DC |
2362 | |
2363 | if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && | |
2364 | LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff && | |
2365 | LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock && | |
2366 | LEFT.br_state == newext && | |
2367 | LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN) | |
2368 | state |= BMAP_LEFT_CONTIG; | |
2369 | ||
1da177e4 | 2370 | /* |
9e5987a7 DC |
2371 | * Check and set flags if this segment has a right neighbor. |
2372 | * Don't set contiguous if the combined extent would be too large. | |
2373 | * Also check for all-three-contiguous being too large. | |
1da177e4 | 2374 | */ |
9e5987a7 DC |
2375 | if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) { |
2376 | state |= BMAP_RIGHT_VALID; | |
2377 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT); | |
2378 | if (isnullstartblock(RIGHT.br_startblock)) | |
2379 | state |= BMAP_RIGHT_DELAY; | |
1da177e4 | 2380 | } |
7cc95a82 | 2381 | |
9e5987a7 DC |
2382 | if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && |
2383 | new_endoff == RIGHT.br_startoff && | |
2384 | new->br_startblock + new->br_blockcount == RIGHT.br_startblock && | |
2385 | newext == RIGHT.br_state && | |
2386 | new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN && | |
2387 | ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | | |
2388 | BMAP_RIGHT_FILLING)) != | |
2389 | (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING | | |
2390 | BMAP_RIGHT_FILLING) || | |
2391 | LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount | |
2392 | <= MAXEXTLEN)) | |
2393 | state |= BMAP_RIGHT_CONTIG; | |
136341b4 | 2394 | |
1da177e4 | 2395 | /* |
9e5987a7 | 2396 | * Switch out based on the FILLING and CONTIG state bits. |
1da177e4 | 2397 | */ |
9e5987a7 DC |
2398 | switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | |
2399 | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) { | |
2400 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | | |
2401 | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: | |
2402 | /* | |
2403 | * Setting all of a previous oldext extent to newext. | |
2404 | * The left and right neighbors are both contiguous with new. | |
2405 | */ | |
2406 | --*idx; | |
1a5902c5 | 2407 | |
9e5987a7 DC |
2408 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2409 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), | |
2410 | LEFT.br_blockcount + PREV.br_blockcount + | |
2411 | RIGHT.br_blockcount); | |
2412 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1a5902c5 | 2413 | |
9e5987a7 DC |
2414 | xfs_iext_remove(ip, *idx + 1, 2, state); |
2415 | ip->i_d.di_nextents -= 2; | |
2416 | if (cur == NULL) | |
2417 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2418 | else { | |
2419 | rval = XFS_ILOG_CORE; | |
2420 | if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff, | |
2421 | RIGHT.br_startblock, | |
2422 | RIGHT.br_blockcount, &i))) | |
2423 | goto done; | |
2424 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2425 | if ((error = xfs_btree_delete(cur, &i))) | |
2426 | goto done; | |
2427 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2428 | if ((error = xfs_btree_decrement(cur, 0, &i))) | |
2429 | goto done; | |
2430 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2431 | if ((error = xfs_btree_delete(cur, &i))) | |
2432 | goto done; | |
2433 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2434 | if ((error = xfs_btree_decrement(cur, 0, &i))) | |
2435 | goto done; | |
2436 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2437 | if ((error = xfs_bmbt_update(cur, LEFT.br_startoff, | |
2438 | LEFT.br_startblock, | |
2439 | LEFT.br_blockcount + PREV.br_blockcount + | |
2440 | RIGHT.br_blockcount, LEFT.br_state))) | |
2441 | goto done; | |
2442 | } | |
2443 | break; | |
1a5902c5 | 2444 | |
9e5987a7 DC |
2445 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: |
2446 | /* | |
2447 | * Setting all of a previous oldext extent to newext. | |
2448 | * The left neighbor is contiguous, the right is not. | |
2449 | */ | |
2450 | --*idx; | |
d8cc890d | 2451 | |
9e5987a7 DC |
2452 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2453 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), | |
2454 | LEFT.br_blockcount + PREV.br_blockcount); | |
2455 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1da177e4 | 2456 | |
9e5987a7 DC |
2457 | xfs_iext_remove(ip, *idx + 1, 1, state); |
2458 | ip->i_d.di_nextents--; | |
2459 | if (cur == NULL) | |
2460 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2461 | else { | |
2462 | rval = XFS_ILOG_CORE; | |
2463 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2464 | PREV.br_startblock, PREV.br_blockcount, | |
2465 | &i))) | |
2466 | goto done; | |
2467 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2468 | if ((error = xfs_btree_delete(cur, &i))) | |
2469 | goto done; | |
2470 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2471 | if ((error = xfs_btree_decrement(cur, 0, &i))) | |
2472 | goto done; | |
2473 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2474 | if ((error = xfs_bmbt_update(cur, LEFT.br_startoff, | |
2475 | LEFT.br_startblock, | |
2476 | LEFT.br_blockcount + PREV.br_blockcount, | |
2477 | LEFT.br_state))) | |
2478 | goto done; | |
2479 | } | |
2480 | break; | |
1da177e4 | 2481 | |
9e5987a7 | 2482 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: |
1da177e4 | 2483 | /* |
9e5987a7 DC |
2484 | * Setting all of a previous oldext extent to newext. |
2485 | * The right neighbor is contiguous, the left is not. | |
1da177e4 | 2486 | */ |
9e5987a7 DC |
2487 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2488 | xfs_bmbt_set_blockcount(ep, | |
2489 | PREV.br_blockcount + RIGHT.br_blockcount); | |
2490 | xfs_bmbt_set_state(ep, newext); | |
2491 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
2492 | xfs_iext_remove(ip, *idx + 1, 1, state); | |
2493 | ip->i_d.di_nextents--; | |
2494 | if (cur == NULL) | |
2495 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2496 | else { | |
2497 | rval = XFS_ILOG_CORE; | |
2498 | if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff, | |
2499 | RIGHT.br_startblock, | |
2500 | RIGHT.br_blockcount, &i))) | |
2501 | goto done; | |
2502 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2503 | if ((error = xfs_btree_delete(cur, &i))) | |
2504 | goto done; | |
2505 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2506 | if ((error = xfs_btree_decrement(cur, 0, &i))) | |
2507 | goto done; | |
2508 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2509 | if ((error = xfs_bmbt_update(cur, new->br_startoff, | |
2510 | new->br_startblock, | |
2511 | new->br_blockcount + RIGHT.br_blockcount, | |
2512 | newext))) | |
2513 | goto done; | |
1da177e4 | 2514 | } |
9e5987a7 | 2515 | break; |
1e82379b | 2516 | |
9e5987a7 DC |
2517 | case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING: |
2518 | /* | |
2519 | * Setting all of a previous oldext extent to newext. | |
2520 | * Neither the left nor right neighbors are contiguous with | |
2521 | * the new one. | |
2522 | */ | |
2523 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
2524 | xfs_bmbt_set_state(ep, newext); | |
2525 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1e82379b | 2526 | |
9e5987a7 DC |
2527 | if (cur == NULL) |
2528 | rval = XFS_ILOG_DEXT; | |
2529 | else { | |
2530 | rval = 0; | |
2531 | if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, | |
2532 | new->br_startblock, new->br_blockcount, | |
2533 | &i))) | |
2534 | goto done; | |
2535 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2536 | if ((error = xfs_bmbt_update(cur, new->br_startoff, | |
2537 | new->br_startblock, new->br_blockcount, | |
2538 | newext))) | |
2539 | goto done; | |
2540 | } | |
2541 | break; | |
1e82379b | 2542 | |
9e5987a7 DC |
2543 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG: |
2544 | /* | |
2545 | * Setting the first part of a previous oldext extent to newext. | |
2546 | * The left neighbor is contiguous. | |
2547 | */ | |
2548 | trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_); | |
2549 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1), | |
2550 | LEFT.br_blockcount + new->br_blockcount); | |
2551 | xfs_bmbt_set_startoff(ep, | |
2552 | PREV.br_startoff + new->br_blockcount); | |
2553 | trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_); | |
1da177e4 | 2554 | |
9e5987a7 DC |
2555 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2556 | xfs_bmbt_set_startblock(ep, | |
2557 | new->br_startblock + new->br_blockcount); | |
2558 | xfs_bmbt_set_blockcount(ep, | |
2559 | PREV.br_blockcount - new->br_blockcount); | |
2560 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
0293ce3a | 2561 | |
9e5987a7 | 2562 | --*idx; |
8867bc9b | 2563 | |
9e5987a7 DC |
2564 | if (cur == NULL) |
2565 | rval = XFS_ILOG_DEXT; | |
2566 | else { | |
2567 | rval = 0; | |
2568 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2569 | PREV.br_startblock, PREV.br_blockcount, | |
2570 | &i))) | |
2571 | goto done; | |
2572 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2573 | if ((error = xfs_bmbt_update(cur, | |
2574 | PREV.br_startoff + new->br_blockcount, | |
2575 | PREV.br_startblock + new->br_blockcount, | |
2576 | PREV.br_blockcount - new->br_blockcount, | |
2577 | oldext))) | |
2578 | goto done; | |
2579 | if ((error = xfs_btree_decrement(cur, 0, &i))) | |
2580 | goto done; | |
2581 | error = xfs_bmbt_update(cur, LEFT.br_startoff, | |
2582 | LEFT.br_startblock, | |
2583 | LEFT.br_blockcount + new->br_blockcount, | |
2584 | LEFT.br_state); | |
2585 | if (error) | |
2586 | goto done; | |
8867bc9b | 2587 | } |
9e5987a7 | 2588 | break; |
0293ce3a | 2589 | |
9e5987a7 DC |
2590 | case BMAP_LEFT_FILLING: |
2591 | /* | |
2592 | * Setting the first part of a previous oldext extent to newext. | |
2593 | * The left neighbor is not contiguous. | |
2594 | */ | |
2595 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
2596 | ASSERT(ep && xfs_bmbt_get_state(ep) == oldext); | |
2597 | xfs_bmbt_set_startoff(ep, new_endoff); | |
2598 | xfs_bmbt_set_blockcount(ep, | |
2599 | PREV.br_blockcount - new->br_blockcount); | |
2600 | xfs_bmbt_set_startblock(ep, | |
2601 | new->br_startblock + new->br_blockcount); | |
2602 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1da177e4 | 2603 | |
9e5987a7 DC |
2604 | xfs_iext_insert(ip, *idx, 1, new, state); |
2605 | ip->i_d.di_nextents++; | |
2606 | if (cur == NULL) | |
2607 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2608 | else { | |
2609 | rval = XFS_ILOG_CORE; | |
2610 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2611 | PREV.br_startblock, PREV.br_blockcount, | |
2612 | &i))) | |
2613 | goto done; | |
2614 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2615 | if ((error = xfs_bmbt_update(cur, | |
2616 | PREV.br_startoff + new->br_blockcount, | |
2617 | PREV.br_startblock + new->br_blockcount, | |
2618 | PREV.br_blockcount - new->br_blockcount, | |
2619 | oldext))) | |
2620 | goto done; | |
2621 | cur->bc_rec.b = *new; | |
2622 | if ((error = xfs_btree_insert(cur, &i))) | |
2623 | goto done; | |
2624 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2625 | } | |
2626 | break; | |
1da177e4 | 2627 | |
9e5987a7 DC |
2628 | case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG: |
2629 | /* | |
2630 | * Setting the last part of a previous oldext extent to newext. | |
2631 | * The right neighbor is contiguous with the new allocation. | |
2632 | */ | |
2633 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
2634 | xfs_bmbt_set_blockcount(ep, | |
2635 | PREV.br_blockcount - new->br_blockcount); | |
2636 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
0293ce3a | 2637 | |
9e5987a7 | 2638 | ++*idx; |
1da177e4 | 2639 | |
9e5987a7 DC |
2640 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2641 | xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx), | |
2642 | new->br_startoff, new->br_startblock, | |
2643 | new->br_blockcount + RIGHT.br_blockcount, newext); | |
2644 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1da177e4 | 2645 | |
9e5987a7 DC |
2646 | if (cur == NULL) |
2647 | rval = XFS_ILOG_DEXT; | |
2648 | else { | |
2649 | rval = 0; | |
2650 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2651 | PREV.br_startblock, | |
2652 | PREV.br_blockcount, &i))) | |
2653 | goto done; | |
2654 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2655 | if ((error = xfs_bmbt_update(cur, PREV.br_startoff, | |
2656 | PREV.br_startblock, | |
2657 | PREV.br_blockcount - new->br_blockcount, | |
2658 | oldext))) | |
2659 | goto done; | |
2660 | if ((error = xfs_btree_increment(cur, 0, &i))) | |
2661 | goto done; | |
2662 | if ((error = xfs_bmbt_update(cur, new->br_startoff, | |
2663 | new->br_startblock, | |
2664 | new->br_blockcount + RIGHT.br_blockcount, | |
2665 | newext))) | |
2666 | goto done; | |
2667 | } | |
2668 | break; | |
1da177e4 | 2669 | |
9e5987a7 DC |
2670 | case BMAP_RIGHT_FILLING: |
2671 | /* | |
2672 | * Setting the last part of a previous oldext extent to newext. | |
2673 | * The right neighbor is not contiguous. | |
2674 | */ | |
2675 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
2676 | xfs_bmbt_set_blockcount(ep, | |
2677 | PREV.br_blockcount - new->br_blockcount); | |
2678 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1da177e4 | 2679 | |
9e5987a7 DC |
2680 | ++*idx; |
2681 | xfs_iext_insert(ip, *idx, 1, new, state); | |
d8cc890d | 2682 | |
9e5987a7 DC |
2683 | ip->i_d.di_nextents++; |
2684 | if (cur == NULL) | |
2685 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2686 | else { | |
2687 | rval = XFS_ILOG_CORE; | |
2688 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2689 | PREV.br_startblock, PREV.br_blockcount, | |
2690 | &i))) | |
2691 | goto done; | |
2692 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2693 | if ((error = xfs_bmbt_update(cur, PREV.br_startoff, | |
2694 | PREV.br_startblock, | |
2695 | PREV.br_blockcount - new->br_blockcount, | |
2696 | oldext))) | |
2697 | goto done; | |
2698 | if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, | |
2699 | new->br_startblock, new->br_blockcount, | |
2700 | &i))) | |
2701 | goto done; | |
2702 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
2703 | cur->bc_rec.b.br_state = XFS_EXT_NORM; | |
2704 | if ((error = xfs_btree_insert(cur, &i))) | |
2705 | goto done; | |
2706 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2707 | } | |
2708 | break; | |
2709 | ||
2710 | case 0: | |
1da177e4 | 2711 | /* |
9e5987a7 DC |
2712 | * Setting the middle part of a previous oldext extent to |
2713 | * newext. Contiguity is impossible here. | |
2714 | * One extent becomes three extents. | |
1da177e4 | 2715 | */ |
9e5987a7 DC |
2716 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2717 | xfs_bmbt_set_blockcount(ep, | |
2718 | new->br_startoff - PREV.br_startoff); | |
2719 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
898621d5 | 2720 | |
9e5987a7 DC |
2721 | r[0] = *new; |
2722 | r[1].br_startoff = new_endoff; | |
2723 | r[1].br_blockcount = | |
2724 | PREV.br_startoff + PREV.br_blockcount - new_endoff; | |
2725 | r[1].br_startblock = new->br_startblock + new->br_blockcount; | |
2726 | r[1].br_state = oldext; | |
898621d5 | 2727 | |
9e5987a7 DC |
2728 | ++*idx; |
2729 | xfs_iext_insert(ip, *idx, 2, &r[0], state); | |
2730 | ||
2731 | ip->i_d.di_nextents += 2; | |
2732 | if (cur == NULL) | |
2733 | rval = XFS_ILOG_CORE | XFS_ILOG_DEXT; | |
2734 | else { | |
2735 | rval = XFS_ILOG_CORE; | |
2736 | if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff, | |
2737 | PREV.br_startblock, PREV.br_blockcount, | |
2738 | &i))) | |
2739 | goto done; | |
2740 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2741 | /* new right extent - oldext */ | |
2742 | if ((error = xfs_bmbt_update(cur, r[1].br_startoff, | |
2743 | r[1].br_startblock, r[1].br_blockcount, | |
2744 | r[1].br_state))) | |
2745 | goto done; | |
2746 | /* new left extent - oldext */ | |
2747 | cur->bc_rec.b = PREV; | |
2748 | cur->bc_rec.b.br_blockcount = | |
2749 | new->br_startoff - PREV.br_startoff; | |
2750 | if ((error = xfs_btree_insert(cur, &i))) | |
2751 | goto done; | |
2752 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2753 | /* | |
2754 | * Reset the cursor to the position of the new extent | |
2755 | * we are about to insert as we can't trust it after | |
2756 | * the previous insert. | |
2757 | */ | |
2758 | if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff, | |
2759 | new->br_startblock, new->br_blockcount, | |
2760 | &i))) | |
2761 | goto done; | |
2762 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
2763 | /* new middle extent - newext */ | |
2764 | cur->bc_rec.b.br_state = new->br_state; | |
2765 | if ((error = xfs_btree_insert(cur, &i))) | |
2766 | goto done; | |
2767 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
2768 | } | |
1da177e4 | 2769 | break; |
9e5987a7 DC |
2770 | |
2771 | case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2772 | case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2773 | case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG: | |
2774 | case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG: | |
2775 | case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2776 | case BMAP_LEFT_CONTIG: | |
2777 | case BMAP_RIGHT_CONTIG: | |
2778 | /* | |
2779 | * These cases are all impossible. | |
2780 | */ | |
1da177e4 | 2781 | ASSERT(0); |
1da177e4 | 2782 | } |
8096b1eb | 2783 | |
9e5987a7 DC |
2784 | /* convert to a btree if necessary */ |
2785 | if (xfs_bmap_needs_btree(ip, XFS_DATA_FORK)) { | |
2786 | int tmp_logflags; /* partial log flag return val */ | |
2787 | ||
2788 | ASSERT(cur == NULL); | |
2789 | error = xfs_bmap_extents_to_btree(tp, ip, first, flist, &cur, | |
2790 | 0, &tmp_logflags, XFS_DATA_FORK); | |
2791 | *logflagsp |= tmp_logflags; | |
2792 | if (error) | |
2793 | goto done; | |
1da177e4 | 2794 | } |
da087bad | 2795 | |
9e5987a7 DC |
2796 | /* clear out the allocated field, done with it now in any case. */ |
2797 | if (cur) { | |
2798 | cur->bc_private.b.allocated = 0; | |
2799 | *curp = cur; | |
1da177e4 | 2800 | } |
8096b1eb | 2801 | |
9e5987a7 DC |
2802 | xfs_bmap_check_leaf_extents(*curp, ip, XFS_DATA_FORK); |
2803 | done: | |
2804 | *logflagsp |= rval; | |
1da177e4 | 2805 | return error; |
9e5987a7 DC |
2806 | #undef LEFT |
2807 | #undef RIGHT | |
2808 | #undef PREV | |
1da177e4 LT |
2809 | } |
2810 | ||
2811 | /* | |
9e5987a7 | 2812 | * Convert a hole to a delayed allocation. |
1da177e4 | 2813 | */ |
9e5987a7 DC |
2814 | STATIC void |
2815 | xfs_bmap_add_extent_hole_delay( | |
2816 | xfs_inode_t *ip, /* incore inode pointer */ | |
2817 | xfs_extnum_t *idx, /* extent number to update/insert */ | |
2818 | xfs_bmbt_irec_t *new) /* new data to add to file extents */ | |
1da177e4 | 2819 | { |
9e5987a7 DC |
2820 | xfs_ifork_t *ifp; /* inode fork pointer */ |
2821 | xfs_bmbt_irec_t left; /* left neighbor extent entry */ | |
2822 | xfs_filblks_t newlen=0; /* new indirect size */ | |
2823 | xfs_filblks_t oldlen=0; /* old indirect size */ | |
2824 | xfs_bmbt_irec_t right; /* right neighbor extent entry */ | |
2825 | int state; /* state bits, accessed thru macros */ | |
2826 | xfs_filblks_t temp=0; /* temp for indirect calculations */ | |
1da177e4 | 2827 | |
9e5987a7 DC |
2828 | ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK); |
2829 | state = 0; | |
2830 | ASSERT(isnullstartblock(new->br_startblock)); | |
1da177e4 LT |
2831 | |
2832 | /* | |
9e5987a7 | 2833 | * Check and set flags if this segment has a left neighbor |
1da177e4 | 2834 | */ |
9e5987a7 DC |
2835 | if (*idx > 0) { |
2836 | state |= BMAP_LEFT_VALID; | |
2837 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left); | |
2838 | ||
2839 | if (isnullstartblock(left.br_startblock)) | |
2840 | state |= BMAP_LEFT_DELAY; | |
1da177e4 | 2841 | } |
1da177e4 | 2842 | |
9e5987a7 DC |
2843 | /* |
2844 | * Check and set flags if the current (right) segment exists. | |
2845 | * If it doesn't exist, we're converting the hole at end-of-file. | |
2846 | */ | |
2847 | if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) { | |
2848 | state |= BMAP_RIGHT_VALID; | |
2849 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right); | |
1da177e4 | 2850 | |
9e5987a7 DC |
2851 | if (isnullstartblock(right.br_startblock)) |
2852 | state |= BMAP_RIGHT_DELAY; | |
1da177e4 | 2853 | } |
9e5987a7 | 2854 | |
1da177e4 | 2855 | /* |
9e5987a7 DC |
2856 | * Set contiguity flags on the left and right neighbors. |
2857 | * Don't let extents get too large, even if the pieces are contiguous. | |
1da177e4 | 2858 | */ |
9e5987a7 DC |
2859 | if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) && |
2860 | left.br_startoff + left.br_blockcount == new->br_startoff && | |
2861 | left.br_blockcount + new->br_blockcount <= MAXEXTLEN) | |
2862 | state |= BMAP_LEFT_CONTIG; | |
2863 | ||
2864 | if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) && | |
2865 | new->br_startoff + new->br_blockcount == right.br_startoff && | |
2866 | new->br_blockcount + right.br_blockcount <= MAXEXTLEN && | |
2867 | (!(state & BMAP_LEFT_CONTIG) || | |
2868 | (left.br_blockcount + new->br_blockcount + | |
2869 | right.br_blockcount <= MAXEXTLEN))) | |
2870 | state |= BMAP_RIGHT_CONTIG; | |
cc09c0dc DC |
2871 | |
2872 | /* | |
9e5987a7 | 2873 | * Switch out based on the contiguity flags. |
cc09c0dc | 2874 | */ |
9e5987a7 DC |
2875 | switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) { |
2876 | case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
2877 | /* | |
2878 | * New allocation is contiguous with delayed allocations | |
2879 | * on the left and on the right. | |
2880 | * Merge all three into a single extent record. | |
2881 | */ | |
2882 | --*idx; | |
2883 | temp = left.br_blockcount + new->br_blockcount + | |
2884 | right.br_blockcount; | |
cc09c0dc | 2885 | |
9e5987a7 DC |
2886 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2887 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp); | |
2888 | oldlen = startblockval(left.br_startblock) + | |
2889 | startblockval(new->br_startblock) + | |
2890 | startblockval(right.br_startblock); | |
2891 | newlen = xfs_bmap_worst_indlen(ip, temp); | |
2892 | xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx), | |
2893 | nullstartblock((int)newlen)); | |
2894 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
1da177e4 | 2895 | |
9e5987a7 DC |
2896 | xfs_iext_remove(ip, *idx + 1, 1, state); |
2897 | break; | |
1da177e4 | 2898 | |
9e5987a7 DC |
2899 | case BMAP_LEFT_CONTIG: |
2900 | /* | |
2901 | * New allocation is contiguous with a delayed allocation | |
2902 | * on the left. | |
2903 | * Merge the new allocation with the left neighbor. | |
2904 | */ | |
2905 | --*idx; | |
2906 | temp = left.br_blockcount + new->br_blockcount; | |
1da177e4 | 2907 | |
9e5987a7 DC |
2908 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); |
2909 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp); | |
2910 | oldlen = startblockval(left.br_startblock) + | |
2911 | startblockval(new->br_startblock); | |
2912 | newlen = xfs_bmap_worst_indlen(ip, temp); | |
2913 | xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx), | |
2914 | nullstartblock((int)newlen)); | |
2915 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
2916 | break; | |
1da177e4 | 2917 | |
9e5987a7 DC |
2918 | case BMAP_RIGHT_CONTIG: |
2919 | /* | |
2920 | * New allocation is contiguous with a delayed allocation | |
2921 | * on the right. | |
2922 | * Merge the new allocation with the right neighbor. | |
2923 | */ | |
2924 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
2925 | temp = new->br_blockcount + right.br_blockcount; | |
2926 | oldlen = startblockval(new->br_startblock) + | |
2927 | startblockval(right.br_startblock); | |
2928 | newlen = xfs_bmap_worst_indlen(ip, temp); | |
2929 | xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx), | |
2930 | new->br_startoff, | |
2931 | nullstartblock((int)newlen), temp, right.br_state); | |
2932 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
2933 | break; | |
2934 | ||
2935 | case 0: | |
2936 | /* | |
2937 | * New allocation is not contiguous with another | |
2938 | * delayed allocation. | |
2939 | * Insert a new entry. | |
2940 | */ | |
2941 | oldlen = newlen = 0; | |
2942 | xfs_iext_insert(ip, *idx, 1, new, state); | |
2943 | break; | |
1da177e4 | 2944 | } |
9e5987a7 DC |
2945 | if (oldlen != newlen) { |
2946 | ASSERT(oldlen > newlen); | |
2947 | xfs_icsb_modify_counters(ip->i_mount, XFS_SBS_FDBLOCKS, | |
2948 | (int64_t)(oldlen - newlen), 0); | |
1da177e4 | 2949 | /* |
9e5987a7 | 2950 | * Nothing to do for disk quota accounting here. |
1da177e4 | 2951 | */ |
1da177e4 | 2952 | } |
1da177e4 LT |
2953 | } |
2954 | ||
2955 | /* | |
9e5987a7 | 2956 | * Convert a hole to a real allocation. |
1da177e4 | 2957 | */ |
9e5987a7 DC |
2958 | STATIC int /* error */ |
2959 | xfs_bmap_add_extent_hole_real( | |
2960 | struct xfs_bmalloca *bma, | |
2961 | int whichfork) | |
27a3f8f2 | 2962 | { |
9e5987a7 DC |
2963 | struct xfs_bmbt_irec *new = &bma->got; |
2964 | int error; /* error return value */ | |
2965 | int i; /* temp state */ | |
2966 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
2967 | xfs_bmbt_irec_t left; /* left neighbor extent entry */ | |
2968 | xfs_bmbt_irec_t right; /* right neighbor extent entry */ | |
2969 | int rval=0; /* return value (logging flags) */ | |
2970 | int state; /* state bits, accessed thru macros */ | |
27a3f8f2 | 2971 | |
9e5987a7 | 2972 | ifp = XFS_IFORK_PTR(bma->ip, whichfork); |
27a3f8f2 | 2973 | |
9e5987a7 DC |
2974 | ASSERT(bma->idx >= 0); |
2975 | ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec)); | |
2976 | ASSERT(!isnullstartblock(new->br_startblock)); | |
2977 | ASSERT(!bma->cur || | |
2978 | !(bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL)); | |
27a3f8f2 | 2979 | |
9e5987a7 | 2980 | XFS_STATS_INC(xs_add_exlist); |
27a3f8f2 | 2981 | |
9e5987a7 DC |
2982 | state = 0; |
2983 | if (whichfork == XFS_ATTR_FORK) | |
2984 | state |= BMAP_ATTRFORK; | |
27a3f8f2 | 2985 | |
9e5987a7 DC |
2986 | /* |
2987 | * Check and set flags if this segment has a left neighbor. | |
2988 | */ | |
2989 | if (bma->idx > 0) { | |
2990 | state |= BMAP_LEFT_VALID; | |
2991 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &left); | |
2992 | if (isnullstartblock(left.br_startblock)) | |
2993 | state |= BMAP_LEFT_DELAY; | |
2994 | } | |
27a3f8f2 CH |
2995 | |
2996 | /* | |
9e5987a7 DC |
2997 | * Check and set flags if this segment has a current value. |
2998 | * Not true if we're inserting into the "hole" at eof. | |
27a3f8f2 | 2999 | */ |
9e5987a7 DC |
3000 | if (bma->idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) { |
3001 | state |= BMAP_RIGHT_VALID; | |
3002 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right); | |
3003 | if (isnullstartblock(right.br_startblock)) | |
3004 | state |= BMAP_RIGHT_DELAY; | |
3005 | } | |
27a3f8f2 | 3006 | |
9e5987a7 DC |
3007 | /* |
3008 | * We're inserting a real allocation between "left" and "right". | |
3009 | * Set the contiguity flags. Don't let extents get too large. | |
3010 | */ | |
3011 | if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) && | |
3012 | left.br_startoff + left.br_blockcount == new->br_startoff && | |
3013 | left.br_startblock + left.br_blockcount == new->br_startblock && | |
3014 | left.br_state == new->br_state && | |
3015 | left.br_blockcount + new->br_blockcount <= MAXEXTLEN) | |
3016 | state |= BMAP_LEFT_CONTIG; | |
27a3f8f2 | 3017 | |
9e5987a7 DC |
3018 | if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) && |
3019 | new->br_startoff + new->br_blockcount == right.br_startoff && | |
3020 | new->br_startblock + new->br_blockcount == right.br_startblock && | |
3021 | new->br_state == right.br_state && | |
3022 | new->br_blockcount + right.br_blockcount <= MAXEXTLEN && | |
3023 | (!(state & BMAP_LEFT_CONTIG) || | |
3024 | left.br_blockcount + new->br_blockcount + | |
3025 | right.br_blockcount <= MAXEXTLEN)) | |
3026 | state |= BMAP_RIGHT_CONTIG; | |
27a3f8f2 | 3027 | |
9e5987a7 DC |
3028 | error = 0; |
3029 | /* | |
3030 | * Select which case we're in here, and implement it. | |
3031 | */ | |
3032 | switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) { | |
3033 | case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG: | |
3034 | /* | |
3035 | * New allocation is contiguous with real allocations on the | |
3036 | * left and on the right. | |
3037 | * Merge all three into a single extent record. | |
3038 | */ | |
3039 | --bma->idx; | |
3040 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
3041 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), | |
3042 | left.br_blockcount + new->br_blockcount + | |
3043 | right.br_blockcount); | |
3044 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
27a3f8f2 | 3045 | |
9e5987a7 | 3046 | xfs_iext_remove(bma->ip, bma->idx + 1, 1, state); |
27a3f8f2 | 3047 | |
9e5987a7 DC |
3048 | XFS_IFORK_NEXT_SET(bma->ip, whichfork, |
3049 | XFS_IFORK_NEXTENTS(bma->ip, whichfork) - 1); | |
3050 | if (bma->cur == NULL) { | |
3051 | rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); | |
3052 | } else { | |
3053 | rval = XFS_ILOG_CORE; | |
3054 | error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff, | |
3055 | right.br_startblock, right.br_blockcount, | |
3056 | &i); | |
3057 | if (error) | |
3058 | goto done; | |
3059 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3060 | error = xfs_btree_delete(bma->cur, &i); | |
3061 | if (error) | |
3062 | goto done; | |
3063 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3064 | error = xfs_btree_decrement(bma->cur, 0, &i); | |
3065 | if (error) | |
3066 | goto done; | |
3067 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3068 | error = xfs_bmbt_update(bma->cur, left.br_startoff, | |
3069 | left.br_startblock, | |
3070 | left.br_blockcount + | |
3071 | new->br_blockcount + | |
3072 | right.br_blockcount, | |
3073 | left.br_state); | |
3074 | if (error) | |
3075 | goto done; | |
3076 | } | |
3077 | break; | |
27a3f8f2 | 3078 | |
9e5987a7 DC |
3079 | case BMAP_LEFT_CONTIG: |
3080 | /* | |
3081 | * New allocation is contiguous with a real allocation | |
3082 | * on the left. | |
3083 | * Merge the new allocation with the left neighbor. | |
3084 | */ | |
3085 | --bma->idx; | |
3086 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
3087 | xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx), | |
3088 | left.br_blockcount + new->br_blockcount); | |
3089 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
1da177e4 | 3090 | |
9e5987a7 DC |
3091 | if (bma->cur == NULL) { |
3092 | rval = xfs_ilog_fext(whichfork); | |
3093 | } else { | |
3094 | rval = 0; | |
3095 | error = xfs_bmbt_lookup_eq(bma->cur, left.br_startoff, | |
3096 | left.br_startblock, left.br_blockcount, | |
3097 | &i); | |
3098 | if (error) | |
3099 | goto done; | |
3100 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3101 | error = xfs_bmbt_update(bma->cur, left.br_startoff, | |
3102 | left.br_startblock, | |
3103 | left.br_blockcount + | |
3104 | new->br_blockcount, | |
3105 | left.br_state); | |
3106 | if (error) | |
3107 | goto done; | |
3108 | } | |
3109 | break; | |
27a3f8f2 | 3110 | |
9e5987a7 DC |
3111 | case BMAP_RIGHT_CONTIG: |
3112 | /* | |
3113 | * New allocation is contiguous with a real allocation | |
3114 | * on the right. | |
3115 | * Merge the new allocation with the right neighbor. | |
3116 | */ | |
3117 | trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_); | |
3118 | xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx), | |
3119 | new->br_startoff, new->br_startblock, | |
3120 | new->br_blockcount + right.br_blockcount, | |
3121 | right.br_state); | |
3122 | trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_); | |
27a3f8f2 | 3123 | |
9e5987a7 DC |
3124 | if (bma->cur == NULL) { |
3125 | rval = xfs_ilog_fext(whichfork); | |
3126 | } else { | |
3127 | rval = 0; | |
3128 | error = xfs_bmbt_lookup_eq(bma->cur, | |
3129 | right.br_startoff, | |
3130 | right.br_startblock, | |
3131 | right.br_blockcount, &i); | |
3132 | if (error) | |
3133 | goto done; | |
3134 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3135 | error = xfs_bmbt_update(bma->cur, new->br_startoff, | |
3136 | new->br_startblock, | |
3137 | new->br_blockcount + | |
3138 | right.br_blockcount, | |
3139 | right.br_state); | |
3140 | if (error) | |
3141 | goto done; | |
3142 | } | |
3143 | break; | |
3144 | ||
3145 | case 0: | |
3146 | /* | |
3147 | * New allocation is not contiguous with another | |
3148 | * real allocation. | |
3149 | * Insert a new entry. | |
3150 | */ | |
3151 | xfs_iext_insert(bma->ip, bma->idx, 1, new, state); | |
3152 | XFS_IFORK_NEXT_SET(bma->ip, whichfork, | |
3153 | XFS_IFORK_NEXTENTS(bma->ip, whichfork) + 1); | |
3154 | if (bma->cur == NULL) { | |
3155 | rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork); | |
3156 | } else { | |
3157 | rval = XFS_ILOG_CORE; | |
3158 | error = xfs_bmbt_lookup_eq(bma->cur, | |
3159 | new->br_startoff, | |
3160 | new->br_startblock, | |
3161 | new->br_blockcount, &i); | |
3162 | if (error) | |
3163 | goto done; | |
3164 | XFS_WANT_CORRUPTED_GOTO(i == 0, done); | |
3165 | bma->cur->bc_rec.b.br_state = new->br_state; | |
3166 | error = xfs_btree_insert(bma->cur, &i); | |
3167 | if (error) | |
3168 | goto done; | |
3169 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
3170 | } | |
3171 | break; | |
3172 | } | |
3173 | ||
3174 | /* convert to a btree if necessary */ | |
3175 | if (xfs_bmap_needs_btree(bma->ip, whichfork)) { | |
3176 | int tmp_logflags; /* partial log flag return val */ | |
3177 | ||
3178 | ASSERT(bma->cur == NULL); | |
3179 | error = xfs_bmap_extents_to_btree(bma->tp, bma->ip, | |
3180 | bma->firstblock, bma->flist, &bma->cur, | |
3181 | 0, &tmp_logflags, whichfork); | |
3182 | bma->logflags |= tmp_logflags; | |
3183 | if (error) | |
3184 | goto done; | |
3185 | } | |
3186 | ||
3187 | /* clear out the allocated field, done with it now in any case. */ | |
3188 | if (bma->cur) | |
3189 | bma->cur->bc_private.b.allocated = 0; | |
3190 | ||
3191 | xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork); | |
3192 | done: | |
3193 | bma->logflags |= rval; | |
3194 | return error; | |
1da177e4 LT |
3195 | } |
3196 | ||
3197 | /* | |
9e5987a7 | 3198 | * Functions used in the extent read, allocate and remove paths |
1da177e4 | 3199 | */ |
1da177e4 | 3200 | |
9e5987a7 DC |
3201 | /* |
3202 | * Adjust the size of the new extent based on di_extsize and rt extsize. | |
3203 | */ | |
68988114 | 3204 | int |
9e5987a7 DC |
3205 | xfs_bmap_extsize_align( |
3206 | xfs_mount_t *mp, | |
3207 | xfs_bmbt_irec_t *gotp, /* next extent pointer */ | |
3208 | xfs_bmbt_irec_t *prevp, /* previous extent pointer */ | |
3209 | xfs_extlen_t extsz, /* align to this extent size */ | |
3210 | int rt, /* is this a realtime inode? */ | |
3211 | int eof, /* is extent at end-of-file? */ | |
3212 | int delay, /* creating delalloc extent? */ | |
3213 | int convert, /* overwriting unwritten extent? */ | |
3214 | xfs_fileoff_t *offp, /* in/out: aligned offset */ | |
3215 | xfs_extlen_t *lenp) /* in/out: aligned length */ | |
4e8938fe | 3216 | { |
9e5987a7 DC |
3217 | xfs_fileoff_t orig_off; /* original offset */ |
3218 | xfs_extlen_t orig_alen; /* original length */ | |
3219 | xfs_fileoff_t orig_end; /* original off+len */ | |
3220 | xfs_fileoff_t nexto; /* next file offset */ | |
3221 | xfs_fileoff_t prevo; /* previous file offset */ | |
3222 | xfs_fileoff_t align_off; /* temp for offset */ | |
3223 | xfs_extlen_t align_alen; /* temp for length */ | |
3224 | xfs_extlen_t temp; /* temp for calculations */ | |
4e8938fe | 3225 | |
9e5987a7 | 3226 | if (convert) |
4e8938fe | 3227 | return 0; |
4e8938fe | 3228 | |
9e5987a7 DC |
3229 | orig_off = align_off = *offp; |
3230 | orig_alen = align_alen = *lenp; | |
3231 | orig_end = orig_off + orig_alen; | |
1da177e4 | 3232 | |
1da177e4 | 3233 | /* |
9e5987a7 DC |
3234 | * If this request overlaps an existing extent, then don't |
3235 | * attempt to perform any additional alignment. | |
1da177e4 | 3236 | */ |
9e5987a7 DC |
3237 | if (!delay && !eof && |
3238 | (orig_off >= gotp->br_startoff) && | |
3239 | (orig_end <= gotp->br_startoff + gotp->br_blockcount)) { | |
3240 | return 0; | |
3241 | } | |
3242 | ||
1da177e4 | 3243 | /* |
9e5987a7 DC |
3244 | * If the file offset is unaligned vs. the extent size |
3245 | * we need to align it. This will be possible unless | |
3246 | * the file was previously written with a kernel that didn't | |
3247 | * perform this alignment, or if a truncate shot us in the | |
3248 | * foot. | |
1da177e4 | 3249 | */ |
9e5987a7 DC |
3250 | temp = do_mod(orig_off, extsz); |
3251 | if (temp) { | |
3252 | align_alen += temp; | |
3253 | align_off -= temp; | |
1da177e4 LT |
3254 | } |
3255 | /* | |
9e5987a7 | 3256 | * Same adjustment for the end of the requested area. |
1da177e4 | 3257 | */ |
9e5987a7 DC |
3258 | if ((temp = (align_alen % extsz))) { |
3259 | align_alen += extsz - temp; | |
3260 | } | |
1da177e4 | 3261 | /* |
9e5987a7 DC |
3262 | * If the previous block overlaps with this proposed allocation |
3263 | * then move the start forward without adjusting the length. | |
1da177e4 | 3264 | */ |
9e5987a7 DC |
3265 | if (prevp->br_startoff != NULLFILEOFF) { |
3266 | if (prevp->br_startblock == HOLESTARTBLOCK) | |
3267 | prevo = prevp->br_startoff; | |
3268 | else | |
3269 | prevo = prevp->br_startoff + prevp->br_blockcount; | |
3270 | } else | |
3271 | prevo = 0; | |
3272 | if (align_off != orig_off && align_off < prevo) | |
3273 | align_off = prevo; | |
3274 | /* | |
3275 | * If the next block overlaps with this proposed allocation | |
3276 | * then move the start back without adjusting the length, | |
3277 | * but not before offset 0. | |
3278 | * This may of course make the start overlap previous block, | |
3279 | * and if we hit the offset 0 limit then the next block | |
3280 | * can still overlap too. | |
3281 | */ | |
3282 | if (!eof && gotp->br_startoff != NULLFILEOFF) { | |
3283 | if ((delay && gotp->br_startblock == HOLESTARTBLOCK) || | |
3284 | (!delay && gotp->br_startblock == DELAYSTARTBLOCK)) | |
3285 | nexto = gotp->br_startoff + gotp->br_blockcount; | |
3286 | else | |
3287 | nexto = gotp->br_startoff; | |
3288 | } else | |
3289 | nexto = NULLFILEOFF; | |
3290 | if (!eof && | |
3291 | align_off + align_alen != orig_end && | |
3292 | align_off + align_alen > nexto) | |
3293 | align_off = nexto > align_alen ? nexto - align_alen : 0; | |
3294 | /* | |
3295 | * If we're now overlapping the next or previous extent that | |
3296 | * means we can't fit an extsz piece in this hole. Just move | |
3297 | * the start forward to the first valid spot and set | |
3298 | * the length so we hit the end. | |
3299 | */ | |
3300 | if (align_off != orig_off && align_off < prevo) | |
3301 | align_off = prevo; | |
3302 | if (align_off + align_alen != orig_end && | |
3303 | align_off + align_alen > nexto && | |
3304 | nexto != NULLFILEOFF) { | |
3305 | ASSERT(nexto > prevo); | |
3306 | align_alen = nexto - align_off; | |
3307 | } | |
1da177e4 | 3308 | |
9e5987a7 DC |
3309 | /* |
3310 | * If realtime, and the result isn't a multiple of the realtime | |
3311 | * extent size we need to remove blocks until it is. | |
3312 | */ | |
3313 | if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) { | |
1da177e4 | 3314 | /* |
9e5987a7 DC |
3315 | * We're not covering the original request, or |
3316 | * we won't be able to once we fix the length. | |
1da177e4 | 3317 | */ |
9e5987a7 DC |
3318 | if (orig_off < align_off || |
3319 | orig_end > align_off + align_alen || | |
3320 | align_alen - temp < orig_alen) | |
3321 | return XFS_ERROR(EINVAL); | |
1da177e4 | 3322 | /* |
9e5987a7 | 3323 | * Try to fix it by moving the start up. |
1da177e4 | 3324 | */ |
9e5987a7 DC |
3325 | if (align_off + temp <= orig_off) { |
3326 | align_alen -= temp; | |
3327 | align_off += temp; | |
1da177e4 | 3328 | } |
9e5987a7 DC |
3329 | /* |
3330 | * Try to fix it by moving the end in. | |
3331 | */ | |
3332 | else if (align_off + align_alen - temp >= orig_end) | |
3333 | align_alen -= temp; | |
3334 | /* | |
3335 | * Set the start to the minimum then trim the length. | |
3336 | */ | |
3337 | else { | |
3338 | align_alen -= orig_off - align_off; | |
3339 | align_off = orig_off; | |
3340 | align_alen -= align_alen % mp->m_sb.sb_rextsize; | |
1da177e4 | 3341 | } |
1da177e4 | 3342 | /* |
9e5987a7 | 3343 | * Result doesn't cover the request, fail it. |
1da177e4 | 3344 | */ |
9e5987a7 DC |
3345 | if (orig_off < align_off || orig_end > align_off + align_alen) |
3346 | return XFS_ERROR(EINVAL); | |
3347 | } else { | |
3348 | ASSERT(orig_off >= align_off); | |
3349 | ASSERT(orig_end <= align_off + align_alen); | |
1da177e4 | 3350 | } |
1da177e4 | 3351 | |
0b1b213f | 3352 | #ifdef DEBUG |
9e5987a7 DC |
3353 | if (!eof && gotp->br_startoff != NULLFILEOFF) |
3354 | ASSERT(align_off + align_alen <= gotp->br_startoff); | |
3355 | if (prevp->br_startoff != NULLFILEOFF) | |
3356 | ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount); | |
3357 | #endif | |
1da177e4 | 3358 | |
9e5987a7 DC |
3359 | *lenp = align_alen; |
3360 | *offp = align_off; | |
3361 | return 0; | |
1da177e4 | 3362 | } |
1da177e4 | 3363 | |
9e5987a7 DC |
3364 | #define XFS_ALLOC_GAP_UNITS 4 |
3365 | ||
68988114 | 3366 | void |
9e5987a7 | 3367 | xfs_bmap_adjacent( |
68988114 | 3368 | struct xfs_bmalloca *ap) /* bmap alloc argument struct */ |
1da177e4 | 3369 | { |
9e5987a7 DC |
3370 | xfs_fsblock_t adjust; /* adjustment to block numbers */ |
3371 | xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */ | |
3372 | xfs_mount_t *mp; /* mount point structure */ | |
3373 | int nullfb; /* true if ap->firstblock isn't set */ | |
3374 | int rt; /* true if inode is realtime */ | |
1da177e4 | 3375 | |
9e5987a7 DC |
3376 | #define ISVALID(x,y) \ |
3377 | (rt ? \ | |
3378 | (x) < mp->m_sb.sb_rblocks : \ | |
3379 | XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \ | |
3380 | XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \ | |
3381 | XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks) | |
1da177e4 | 3382 | |
9e5987a7 DC |
3383 | mp = ap->ip->i_mount; |
3384 | nullfb = *ap->firstblock == NULLFSBLOCK; | |
3385 | rt = XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata; | |
3386 | fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock); | |
3387 | /* | |
3388 | * If allocating at eof, and there's a previous real block, | |
3389 | * try to use its last block as our starting point. | |
3390 | */ | |
3391 | if (ap->eof && ap->prev.br_startoff != NULLFILEOFF && | |
3392 | !isnullstartblock(ap->prev.br_startblock) && | |
3393 | ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount, | |
3394 | ap->prev.br_startblock)) { | |
3395 | ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount; | |
3396 | /* | |
3397 | * Adjust for the gap between prevp and us. | |
3398 | */ | |
3399 | adjust = ap->offset - | |
3400 | (ap->prev.br_startoff + ap->prev.br_blockcount); | |
3401 | if (adjust && | |
3402 | ISVALID(ap->blkno + adjust, ap->prev.br_startblock)) | |
3403 | ap->blkno += adjust; | |
3404 | } | |
3405 | /* | |
3406 | * If not at eof, then compare the two neighbor blocks. | |
3407 | * Figure out whether either one gives us a good starting point, | |
3408 | * and pick the better one. | |
3409 | */ | |
3410 | else if (!ap->eof) { | |
3411 | xfs_fsblock_t gotbno; /* right side block number */ | |
3412 | xfs_fsblock_t gotdiff=0; /* right side difference */ | |
3413 | xfs_fsblock_t prevbno; /* left side block number */ | |
3414 | xfs_fsblock_t prevdiff=0; /* left side difference */ | |
3415 | ||
3416 | /* | |
3417 | * If there's a previous (left) block, select a requested | |
3418 | * start block based on it. | |
3419 | */ | |
3420 | if (ap->prev.br_startoff != NULLFILEOFF && | |
3421 | !isnullstartblock(ap->prev.br_startblock) && | |
3422 | (prevbno = ap->prev.br_startblock + | |
3423 | ap->prev.br_blockcount) && | |
3424 | ISVALID(prevbno, ap->prev.br_startblock)) { | |
3425 | /* | |
3426 | * Calculate gap to end of previous block. | |
3427 | */ | |
3428 | adjust = prevdiff = ap->offset - | |
3429 | (ap->prev.br_startoff + | |
3430 | ap->prev.br_blockcount); | |
3431 | /* | |
3432 | * Figure the startblock based on the previous block's | |
3433 | * end and the gap size. | |
3434 | * Heuristic! | |
3435 | * If the gap is large relative to the piece we're | |
3436 | * allocating, or using it gives us an invalid block | |
3437 | * number, then just use the end of the previous block. | |
3438 | */ | |
3439 | if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length && | |
3440 | ISVALID(prevbno + prevdiff, | |
3441 | ap->prev.br_startblock)) | |
3442 | prevbno += adjust; | |
3443 | else | |
3444 | prevdiff += adjust; | |
3445 | /* | |
3446 | * If the firstblock forbids it, can't use it, | |
3447 | * must use default. | |
3448 | */ | |
3449 | if (!rt && !nullfb && | |
3450 | XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno) | |
3451 | prevbno = NULLFSBLOCK; | |
1da177e4 | 3452 | } |
9e5987a7 DC |
3453 | /* |
3454 | * No previous block or can't follow it, just default. | |
3455 | */ | |
3456 | else | |
3457 | prevbno = NULLFSBLOCK; | |
3458 | /* | |
3459 | * If there's a following (right) block, select a requested | |
3460 | * start block based on it. | |
3461 | */ | |
3462 | if (!isnullstartblock(ap->got.br_startblock)) { | |
3463 | /* | |
3464 | * Calculate gap to start of next block. | |
3465 | */ | |
3466 | adjust = gotdiff = ap->got.br_startoff - ap->offset; | |
3467 | /* | |
3468 | * Figure the startblock based on the next block's | |
3469 | * start and the gap size. | |
3470 | */ | |
3471 | gotbno = ap->got.br_startblock; | |
3472 | /* | |
3473 | * Heuristic! | |
3474 | * If the gap is large relative to the piece we're | |
3475 | * allocating, or using it gives us an invalid block | |
3476 | * number, then just use the start of the next block | |
3477 | * offset by our length. | |
3478 | */ | |
3479 | if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length && | |
3480 | ISVALID(gotbno - gotdiff, gotbno)) | |
3481 | gotbno -= adjust; | |
3482 | else if (ISVALID(gotbno - ap->length, gotbno)) { | |
3483 | gotbno -= ap->length; | |
3484 | gotdiff += adjust - ap->length; | |
3485 | } else | |
3486 | gotdiff += adjust; | |
3487 | /* | |
3488 | * If the firstblock forbids it, can't use it, | |
3489 | * must use default. | |
3490 | */ | |
3491 | if (!rt && !nullfb && | |
3492 | XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno) | |
3493 | gotbno = NULLFSBLOCK; | |
3494 | } | |
3495 | /* | |
3496 | * No next block, just default. | |
3497 | */ | |
3498 | else | |
3499 | gotbno = NULLFSBLOCK; | |
3500 | /* | |
3501 | * If both valid, pick the better one, else the only good | |
3502 | * one, else ap->blkno is already set (to 0 or the inode block). | |
3503 | */ | |
3504 | if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK) | |
3505 | ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno; | |
3506 | else if (prevbno != NULLFSBLOCK) | |
3507 | ap->blkno = prevbno; | |
3508 | else if (gotbno != NULLFSBLOCK) | |
3509 | ap->blkno = gotbno; | |
1da177e4 | 3510 | } |
9e5987a7 | 3511 | #undef ISVALID |
1da177e4 | 3512 | } |
1da177e4 | 3513 | |
b64dfe4e | 3514 | STATIC int |
9e5987a7 DC |
3515 | xfs_bmap_btalloc_nullfb( |
3516 | struct xfs_bmalloca *ap, | |
3517 | struct xfs_alloc_arg *args, | |
3518 | xfs_extlen_t *blen) | |
b64dfe4e | 3519 | { |
9e5987a7 DC |
3520 | struct xfs_mount *mp = ap->ip->i_mount; |
3521 | struct xfs_perag *pag; | |
3522 | xfs_agnumber_t ag, startag; | |
3523 | int notinit = 0; | |
b64dfe4e CH |
3524 | int error; |
3525 | ||
9e5987a7 DC |
3526 | if (ap->userdata && xfs_inode_is_filestream(ap->ip)) |
3527 | args->type = XFS_ALLOCTYPE_NEAR_BNO; | |
3528 | else | |
3529 | args->type = XFS_ALLOCTYPE_START_BNO; | |
3530 | args->total = ap->total; | |
b64dfe4e CH |
3531 | |
3532 | /* | |
9e5987a7 DC |
3533 | * Search for an allocation group with a single extent large enough |
3534 | * for the request. If one isn't found, then adjust the minimum | |
3535 | * allocation size to the largest space found. | |
b64dfe4e | 3536 | */ |
9e5987a7 DC |
3537 | startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno); |
3538 | if (startag == NULLAGNUMBER) | |
3539 | startag = ag = 0; | |
b64dfe4e | 3540 | |
9e5987a7 DC |
3541 | pag = xfs_perag_get(mp, ag); |
3542 | while (*blen < args->maxlen) { | |
3543 | if (!pag->pagf_init) { | |
3544 | error = xfs_alloc_pagf_init(mp, args->tp, ag, | |
3545 | XFS_ALLOC_FLAG_TRYLOCK); | |
3546 | if (error) { | |
3547 | xfs_perag_put(pag); | |
3548 | return error; | |
3549 | } | |
3550 | } | |
b64dfe4e | 3551 | |
9e5987a7 DC |
3552 | /* |
3553 | * See xfs_alloc_fix_freelist... | |
3554 | */ | |
3555 | if (pag->pagf_init) { | |
3556 | xfs_extlen_t longest; | |
3557 | longest = xfs_alloc_longest_free_extent(mp, pag); | |
3558 | if (*blen < longest) | |
3559 | *blen = longest; | |
3560 | } else | |
3561 | notinit = 1; | |
b64dfe4e | 3562 | |
9e5987a7 DC |
3563 | if (xfs_inode_is_filestream(ap->ip)) { |
3564 | if (*blen >= args->maxlen) | |
3565 | break; | |
b64dfe4e | 3566 | |
9e5987a7 DC |
3567 | if (ap->userdata) { |
3568 | /* | |
3569 | * If startag is an invalid AG, we've | |
3570 | * come here once before and | |
3571 | * xfs_filestream_new_ag picked the | |
3572 | * best currently available. | |
3573 | * | |
3574 | * Don't continue looping, since we | |
3575 | * could loop forever. | |
3576 | */ | |
3577 | if (startag == NULLAGNUMBER) | |
3578 | break; | |
b64dfe4e | 3579 | |
9e5987a7 DC |
3580 | error = xfs_filestream_new_ag(ap, &ag); |
3581 | xfs_perag_put(pag); | |
3582 | if (error) | |
3583 | return error; | |
b64dfe4e | 3584 | |
9e5987a7 DC |
3585 | /* loop again to set 'blen'*/ |
3586 | startag = NULLAGNUMBER; | |
3587 | pag = xfs_perag_get(mp, ag); | |
3588 | continue; | |
3589 | } | |
3590 | } | |
3591 | if (++ag == mp->m_sb.sb_agcount) | |
3592 | ag = 0; | |
3593 | if (ag == startag) | |
3594 | break; | |
3595 | xfs_perag_put(pag); | |
3596 | pag = xfs_perag_get(mp, ag); | |
3597 | } | |
3598 | xfs_perag_put(pag); | |
b64dfe4e | 3599 | |
9e5987a7 DC |
3600 | /* |
3601 | * Since the above loop did a BUF_TRYLOCK, it is | |
3602 | * possible that there is space for this request. | |
3603 | */ | |
3604 | if (notinit || *blen < ap->minlen) | |
3605 | args->minlen = ap->minlen; | |
3606 | /* | |
3607 | * If the best seen length is less than the request | |
3608 | * length, use the best as the minimum. | |
3609 | */ | |
3610 | else if (*blen < args->maxlen) | |
3611 | args->minlen = *blen; | |
3612 | /* | |
3613 | * Otherwise we've seen an extent as big as maxlen, | |
3614 | * use that as the minimum. | |
3615 | */ | |
3616 | else | |
3617 | args->minlen = args->maxlen; | |
b64dfe4e CH |
3618 | |
3619 | /* | |
9e5987a7 DC |
3620 | * set the failure fallback case to look in the selected |
3621 | * AG as the stream may have moved. | |
b64dfe4e | 3622 | */ |
9e5987a7 DC |
3623 | if (xfs_inode_is_filestream(ap->ip)) |
3624 | ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0); | |
b64dfe4e | 3625 | |
b64dfe4e | 3626 | return 0; |
b64dfe4e CH |
3627 | } |
3628 | ||
9e5987a7 DC |
3629 | STATIC int |
3630 | xfs_bmap_btalloc( | |
68988114 | 3631 | struct xfs_bmalloca *ap) /* bmap alloc argument struct */ |
4403280a | 3632 | { |
9e5987a7 DC |
3633 | xfs_mount_t *mp; /* mount point structure */ |
3634 | xfs_alloctype_t atype = 0; /* type for allocation routines */ | |
3635 | xfs_extlen_t align; /* minimum allocation alignment */ | |
3636 | xfs_agnumber_t fb_agno; /* ag number of ap->firstblock */ | |
3637 | xfs_agnumber_t ag; | |
3638 | xfs_alloc_arg_t args; | |
3639 | xfs_extlen_t blen; | |
3640 | xfs_extlen_t nextminlen = 0; | |
3641 | int nullfb; /* true if ap->firstblock isn't set */ | |
3642 | int isaligned; | |
3643 | int tryagain; | |
3644 | int error; | |
4403280a | 3645 | |
9e5987a7 | 3646 | ASSERT(ap->length); |
4403280a | 3647 | |
9e5987a7 DC |
3648 | mp = ap->ip->i_mount; |
3649 | align = ap->userdata ? xfs_get_extsz_hint(ap->ip) : 0; | |
3650 | if (unlikely(align)) { | |
3651 | error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev, | |
3652 | align, 0, ap->eof, 0, ap->conv, | |
3653 | &ap->offset, &ap->length); | |
3654 | ASSERT(!error); | |
3655 | ASSERT(ap->length); | |
4403280a | 3656 | } |
9e5987a7 DC |
3657 | nullfb = *ap->firstblock == NULLFSBLOCK; |
3658 | fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock); | |
3659 | if (nullfb) { | |
3660 | if (ap->userdata && xfs_inode_is_filestream(ap->ip)) { | |
3661 | ag = xfs_filestream_lookup_ag(ap->ip); | |
3662 | ag = (ag != NULLAGNUMBER) ? ag : 0; | |
3663 | ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0); | |
3664 | } else { | |
3665 | ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino); | |
3666 | } | |
3667 | } else | |
3668 | ap->blkno = *ap->firstblock; | |
4403280a | 3669 | |
9e5987a7 | 3670 | xfs_bmap_adjacent(ap); |
4403280a | 3671 | |
9e5987a7 DC |
3672 | /* |
3673 | * If allowed, use ap->blkno; otherwise must use firstblock since | |
3674 | * it's in the right allocation group. | |
3675 | */ | |
3676 | if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno) | |
3677 | ; | |
3678 | else | |
3679 | ap->blkno = *ap->firstblock; | |
3680 | /* | |
3681 | * Normal allocation, done through xfs_alloc_vextent. | |
3682 | */ | |
3683 | tryagain = isaligned = 0; | |
3684 | memset(&args, 0, sizeof(args)); | |
3685 | args.tp = ap->tp; | |
3686 | args.mp = mp; | |
3687 | args.fsbno = ap->blkno; | |
4403280a | 3688 | |
9e5987a7 DC |
3689 | /* Trim the allocation back to the maximum an AG can fit. */ |
3690 | args.maxlen = MIN(ap->length, XFS_ALLOC_AG_MAX_USABLE(mp)); | |
3691 | args.firstblock = *ap->firstblock; | |
3692 | blen = 0; | |
3693 | if (nullfb) { | |
3694 | error = xfs_bmap_btalloc_nullfb(ap, &args, &blen); | |
4403280a CH |
3695 | if (error) |
3696 | return error; | |
9e5987a7 DC |
3697 | } else if (ap->flist->xbf_low) { |
3698 | if (xfs_inode_is_filestream(ap->ip)) | |
3699 | args.type = XFS_ALLOCTYPE_FIRST_AG; | |
3700 | else | |
3701 | args.type = XFS_ALLOCTYPE_START_BNO; | |
3702 | args.total = args.minlen = ap->minlen; | |
3703 | } else { | |
3704 | args.type = XFS_ALLOCTYPE_NEAR_BNO; | |
3705 | args.total = ap->total; | |
3706 | args.minlen = ap->minlen; | |
4403280a | 3707 | } |
9e5987a7 DC |
3708 | /* apply extent size hints if obtained earlier */ |
3709 | if (unlikely(align)) { | |
3710 | args.prod = align; | |
3711 | if ((args.mod = (xfs_extlen_t)do_mod(ap->offset, args.prod))) | |
3712 | args.mod = (xfs_extlen_t)(args.prod - args.mod); | |
3713 | } else if (mp->m_sb.sb_blocksize >= PAGE_CACHE_SIZE) { | |
3714 | args.prod = 1; | |
3715 | args.mod = 0; | |
3716 | } else { | |
3717 | args.prod = PAGE_CACHE_SIZE >> mp->m_sb.sb_blocklog; | |
3718 | if ((args.mod = (xfs_extlen_t)(do_mod(ap->offset, args.prod)))) | |
3719 | args.mod = (xfs_extlen_t)(args.prod - args.mod); | |
4403280a | 3720 | } |
7e47a4ef | 3721 | /* |
9e5987a7 DC |
3722 | * If we are not low on available data blocks, and the |
3723 | * underlying logical volume manager is a stripe, and | |
3724 | * the file offset is zero then try to allocate data | |
3725 | * blocks on stripe unit boundary. | |
3726 | * NOTE: ap->aeof is only set if the allocation length | |
3727 | * is >= the stripe unit and the allocation offset is | |
3728 | * at the end of file. | |
7e47a4ef | 3729 | */ |
9e5987a7 DC |
3730 | if (!ap->flist->xbf_low && ap->aeof) { |
3731 | if (!ap->offset) { | |
3732 | args.alignment = mp->m_dalign; | |
3733 | atype = args.type; | |
3734 | isaligned = 1; | |
3735 | /* | |
3736 | * Adjust for alignment | |
3737 | */ | |
3738 | if (blen > args.alignment && blen <= args.maxlen) | |
3739 | args.minlen = blen - args.alignment; | |
3740 | args.minalignslop = 0; | |
3741 | } else { | |
3742 | /* | |
3743 | * First try an exact bno allocation. | |
3744 | * If it fails then do a near or start bno | |
3745 | * allocation with alignment turned on. | |
3746 | */ | |
3747 | atype = args.type; | |
3748 | tryagain = 1; | |
3749 | args.type = XFS_ALLOCTYPE_THIS_BNO; | |
3750 | args.alignment = 1; | |
3751 | /* | |
3752 | * Compute the minlen+alignment for the | |
3753 | * next case. Set slop so that the value | |
3754 | * of minlen+alignment+slop doesn't go up | |
3755 | * between the calls. | |
3756 | */ | |
3757 | if (blen > mp->m_dalign && blen <= args.maxlen) | |
3758 | nextminlen = blen - mp->m_dalign; | |
3759 | else | |
3760 | nextminlen = args.minlen; | |
3761 | if (nextminlen + mp->m_dalign > args.minlen + 1) | |
3762 | args.minalignslop = | |
3763 | nextminlen + mp->m_dalign - | |
3764 | args.minlen - 1; | |
3765 | else | |
3766 | args.minalignslop = 0; | |
7e47a4ef DC |
3767 | } |
3768 | } else { | |
9e5987a7 DC |
3769 | args.alignment = 1; |
3770 | args.minalignslop = 0; | |
7e47a4ef | 3771 | } |
9e5987a7 DC |
3772 | args.minleft = ap->minleft; |
3773 | args.wasdel = ap->wasdel; | |
3774 | args.isfl = 0; | |
3775 | args.userdata = ap->userdata; | |
3776 | if ((error = xfs_alloc_vextent(&args))) | |
3777 | return error; | |
3778 | if (tryagain && args.fsbno == NULLFSBLOCK) { | |
3779 | /* | |
3780 | * Exact allocation failed. Now try with alignment | |
3781 | * turned on. | |
3782 | */ | |
3783 | args.type = atype; | |
3784 | args.fsbno = ap->blkno; | |
3785 | args.alignment = mp->m_dalign; | |
3786 | args.minlen = nextminlen; | |
3787 | args.minalignslop = 0; | |
3788 | isaligned = 1; | |
3789 | if ((error = xfs_alloc_vextent(&args))) | |
3790 | return error; | |
7e47a4ef | 3791 | } |
9e5987a7 DC |
3792 | if (isaligned && args.fsbno == NULLFSBLOCK) { |
3793 | /* | |
3794 | * allocation failed, so turn off alignment and | |
3795 | * try again. | |
3796 | */ | |
3797 | args.type = atype; | |
3798 | args.fsbno = ap->blkno; | |
3799 | args.alignment = 0; | |
3800 | if ((error = xfs_alloc_vextent(&args))) | |
7e47a4ef DC |
3801 | return error; |
3802 | } | |
9e5987a7 DC |
3803 | if (args.fsbno == NULLFSBLOCK && nullfb && |
3804 | args.minlen > ap->minlen) { | |
3805 | args.minlen = ap->minlen; | |
3806 | args.type = XFS_ALLOCTYPE_START_BNO; | |
3807 | args.fsbno = ap->blkno; | |
3808 | if ((error = xfs_alloc_vextent(&args))) | |
3809 | return error; | |
7e47a4ef | 3810 | } |
9e5987a7 DC |
3811 | if (args.fsbno == NULLFSBLOCK && nullfb) { |
3812 | args.fsbno = 0; | |
3813 | args.type = XFS_ALLOCTYPE_FIRST_AG; | |
3814 | args.total = ap->minlen; | |
3815 | args.minleft = 0; | |
3816 | if ((error = xfs_alloc_vextent(&args))) | |
3817 | return error; | |
3818 | ap->flist->xbf_low = 1; | |
3819 | } | |
3820 | if (args.fsbno != NULLFSBLOCK) { | |
3821 | /* | |
3822 | * check the allocation happened at the same or higher AG than | |
3823 | * the first block that was allocated. | |
3824 | */ | |
3825 | ASSERT(*ap->firstblock == NULLFSBLOCK || | |
3826 | XFS_FSB_TO_AGNO(mp, *ap->firstblock) == | |
3827 | XFS_FSB_TO_AGNO(mp, args.fsbno) || | |
3828 | (ap->flist->xbf_low && | |
3829 | XFS_FSB_TO_AGNO(mp, *ap->firstblock) < | |
3830 | XFS_FSB_TO_AGNO(mp, args.fsbno))); | |
7e47a4ef | 3831 | |
9e5987a7 DC |
3832 | ap->blkno = args.fsbno; |
3833 | if (*ap->firstblock == NULLFSBLOCK) | |
3834 | *ap->firstblock = args.fsbno; | |
3835 | ASSERT(nullfb || fb_agno == args.agno || | |
3836 | (ap->flist->xbf_low && fb_agno < args.agno)); | |
3837 | ap->length = args.len; | |
3838 | ap->ip->i_d.di_nblocks += args.len; | |
3839 | xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE); | |
3840 | if (ap->wasdel) | |
3841 | ap->ip->i_delayed_blks -= args.len; | |
3842 | /* | |
3843 | * Adjust the disk quota also. This was reserved | |
3844 | * earlier. | |
3845 | */ | |
3846 | xfs_trans_mod_dquot_byino(ap->tp, ap->ip, | |
3847 | ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT : | |
3848 | XFS_TRANS_DQ_BCOUNT, | |
3849 | (long) args.len); | |
3850 | } else { | |
3851 | ap->blkno = NULLFSBLOCK; | |
3852 | ap->length = 0; | |
3853 | } | |
3854 | return 0; | |
3855 | } | |
7e47a4ef | 3856 | |
9e5987a7 DC |
3857 | /* |
3858 | * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file. | |
3859 | * It figures out where to ask the underlying allocator to put the new extent. | |
3860 | */ | |
3861 | STATIC int | |
3862 | xfs_bmap_alloc( | |
68988114 | 3863 | struct xfs_bmalloca *ap) /* bmap alloc argument struct */ |
9e5987a7 DC |
3864 | { |
3865 | if (XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata) | |
3866 | return xfs_bmap_rtalloc(ap); | |
3867 | return xfs_bmap_btalloc(ap); | |
3868 | } | |
a5bd606b | 3869 | |
9e5987a7 DC |
3870 | /* |
3871 | * Trim the returned map to the required bounds | |
3872 | */ | |
3873 | STATIC void | |
3874 | xfs_bmapi_trim_map( | |
3875 | struct xfs_bmbt_irec *mval, | |
3876 | struct xfs_bmbt_irec *got, | |
3877 | xfs_fileoff_t *bno, | |
3878 | xfs_filblks_t len, | |
3879 | xfs_fileoff_t obno, | |
3880 | xfs_fileoff_t end, | |
3881 | int n, | |
3882 | int flags) | |
3883 | { | |
3884 | if ((flags & XFS_BMAPI_ENTIRE) || | |
3885 | got->br_startoff + got->br_blockcount <= obno) { | |
3886 | *mval = *got; | |
3887 | if (isnullstartblock(got->br_startblock)) | |
3888 | mval->br_startblock = DELAYSTARTBLOCK; | |
3889 | return; | |
3890 | } | |
7e47a4ef | 3891 | |
9e5987a7 DC |
3892 | if (obno > *bno) |
3893 | *bno = obno; | |
3894 | ASSERT((*bno >= obno) || (n == 0)); | |
3895 | ASSERT(*bno < end); | |
3896 | mval->br_startoff = *bno; | |
3897 | if (isnullstartblock(got->br_startblock)) | |
3898 | mval->br_startblock = DELAYSTARTBLOCK; | |
3899 | else | |
3900 | mval->br_startblock = got->br_startblock + | |
3901 | (*bno - got->br_startoff); | |
7e47a4ef | 3902 | /* |
9e5987a7 DC |
3903 | * Return the minimum of what we got and what we asked for for |
3904 | * the length. We can use the len variable here because it is | |
3905 | * modified below and we could have been there before coming | |
3906 | * here if the first part of the allocation didn't overlap what | |
3907 | * was asked for. | |
7e47a4ef | 3908 | */ |
9e5987a7 DC |
3909 | mval->br_blockcount = XFS_FILBLKS_MIN(end - *bno, |
3910 | got->br_blockcount - (*bno - got->br_startoff)); | |
3911 | mval->br_state = got->br_state; | |
3912 | ASSERT(mval->br_blockcount <= len); | |
3913 | return; | |
7e47a4ef DC |
3914 | } |
3915 | ||
9e5987a7 DC |
3916 | /* |
3917 | * Update and validate the extent map to return | |
3918 | */ | |
3919 | STATIC void | |
3920 | xfs_bmapi_update_map( | |
3921 | struct xfs_bmbt_irec **map, | |
3922 | xfs_fileoff_t *bno, | |
3923 | xfs_filblks_t *len, | |
3924 | xfs_fileoff_t obno, | |
3925 | xfs_fileoff_t end, | |
3926 | int *n, | |
3927 | int flags) | |
e04426b9 | 3928 | { |
9e5987a7 | 3929 | xfs_bmbt_irec_t *mval = *map; |
e04426b9 | 3930 | |
9e5987a7 DC |
3931 | ASSERT((flags & XFS_BMAPI_ENTIRE) || |
3932 | ((mval->br_startoff + mval->br_blockcount) <= end)); | |
3933 | ASSERT((flags & XFS_BMAPI_ENTIRE) || (mval->br_blockcount <= *len) || | |
3934 | (mval->br_startoff < obno)); | |
e04426b9 | 3935 | |
9e5987a7 DC |
3936 | *bno = mval->br_startoff + mval->br_blockcount; |
3937 | *len = end - *bno; | |
3938 | if (*n > 0 && mval->br_startoff == mval[-1].br_startoff) { | |
3939 | /* update previous map with new information */ | |
3940 | ASSERT(mval->br_startblock == mval[-1].br_startblock); | |
3941 | ASSERT(mval->br_blockcount > mval[-1].br_blockcount); | |
3942 | ASSERT(mval->br_state == mval[-1].br_state); | |
3943 | mval[-1].br_blockcount = mval->br_blockcount; | |
3944 | mval[-1].br_state = mval->br_state; | |
3945 | } else if (*n > 0 && mval->br_startblock != DELAYSTARTBLOCK && | |
3946 | mval[-1].br_startblock != DELAYSTARTBLOCK && | |
3947 | mval[-1].br_startblock != HOLESTARTBLOCK && | |
3948 | mval->br_startblock == mval[-1].br_startblock + | |
3949 | mval[-1].br_blockcount && | |
3950 | ((flags & XFS_BMAPI_IGSTATE) || | |
3951 | mval[-1].br_state == mval->br_state)) { | |
3952 | ASSERT(mval->br_startoff == | |
3953 | mval[-1].br_startoff + mval[-1].br_blockcount); | |
3954 | mval[-1].br_blockcount += mval->br_blockcount; | |
3955 | } else if (*n > 0 && | |
3956 | mval->br_startblock == DELAYSTARTBLOCK && | |
3957 | mval[-1].br_startblock == DELAYSTARTBLOCK && | |
3958 | mval->br_startoff == | |
3959 | mval[-1].br_startoff + mval[-1].br_blockcount) { | |
3960 | mval[-1].br_blockcount += mval->br_blockcount; | |
3961 | mval[-1].br_state = mval->br_state; | |
3962 | } else if (!((*n == 0) && | |
3963 | ((mval->br_startoff + mval->br_blockcount) <= | |
3964 | obno))) { | |
3965 | mval++; | |
3966 | (*n)++; | |
3967 | } | |
3968 | *map = mval; | |
e04426b9 DC |
3969 | } |
3970 | ||
3971 | /* | |
9e5987a7 | 3972 | * Map file blocks to filesystem blocks without allocation. |
e04426b9 DC |
3973 | */ |
3974 | int | |
9e5987a7 DC |
3975 | xfs_bmapi_read( |
3976 | struct xfs_inode *ip, | |
3977 | xfs_fileoff_t bno, | |
b447fe5a | 3978 | xfs_filblks_t len, |
9e5987a7 DC |
3979 | struct xfs_bmbt_irec *mval, |
3980 | int *nmap, | |
c315c90b | 3981 | int flags) |
b447fe5a | 3982 | { |
9e5987a7 DC |
3983 | struct xfs_mount *mp = ip->i_mount; |
3984 | struct xfs_ifork *ifp; | |
3985 | struct xfs_bmbt_irec got; | |
3986 | struct xfs_bmbt_irec prev; | |
3987 | xfs_fileoff_t obno; | |
3988 | xfs_fileoff_t end; | |
3989 | xfs_extnum_t lastx; | |
3990 | int error; | |
3991 | int eof; | |
3992 | int n = 0; | |
b447fe5a DC |
3993 | int whichfork = (flags & XFS_BMAPI_ATTRFORK) ? |
3994 | XFS_ATTR_FORK : XFS_DATA_FORK; | |
b447fe5a | 3995 | |
9e5987a7 DC |
3996 | ASSERT(*nmap >= 1); |
3997 | ASSERT(!(flags & ~(XFS_BMAPI_ATTRFORK|XFS_BMAPI_ENTIRE| | |
3998 | XFS_BMAPI_IGSTATE))); | |
b447fe5a | 3999 | |
9e5987a7 DC |
4000 | if (unlikely(XFS_TEST_ERROR( |
4001 | (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && | |
4002 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), | |
4003 | mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { | |
4004 | XFS_ERROR_REPORT("xfs_bmapi_read", XFS_ERRLEVEL_LOW, mp); | |
4005 | return XFS_ERROR(EFSCORRUPTED); | |
4006 | } | |
b447fe5a | 4007 | |
9e5987a7 DC |
4008 | if (XFS_FORCED_SHUTDOWN(mp)) |
4009 | return XFS_ERROR(EIO); | |
4010 | ||
4011 | XFS_STATS_INC(xs_blk_mapr); | |
4012 | ||
4013 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
4014 | ||
4015 | if (!(ifp->if_flags & XFS_IFEXTENTS)) { | |
4016 | error = xfs_iread_extents(NULL, ip, whichfork); | |
4017 | if (error) | |
4018 | return error; | |
b447fe5a | 4019 | } |
b447fe5a | 4020 | |
9e5987a7 DC |
4021 | xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, &prev); |
4022 | end = bno + len; | |
4023 | obno = bno; | |
b447fe5a | 4024 | |
9e5987a7 DC |
4025 | while (bno < end && n < *nmap) { |
4026 | /* Reading past eof, act as though there's a hole up to end. */ | |
4027 | if (eof) | |
4028 | got.br_startoff = end; | |
4029 | if (got.br_startoff > bno) { | |
4030 | /* Reading in a hole. */ | |
4031 | mval->br_startoff = bno; | |
4032 | mval->br_startblock = HOLESTARTBLOCK; | |
4033 | mval->br_blockcount = | |
4034 | XFS_FILBLKS_MIN(len, got.br_startoff - bno); | |
4035 | mval->br_state = XFS_EXT_NORM; | |
4036 | bno += mval->br_blockcount; | |
4037 | len -= mval->br_blockcount; | |
4038 | mval++; | |
4039 | n++; | |
4040 | continue; | |
4041 | } | |
b447fe5a | 4042 | |
9e5987a7 DC |
4043 | /* set up the extent map to return. */ |
4044 | xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags); | |
4045 | xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags); | |
4046 | ||
4047 | /* If we're done, stop now. */ | |
4048 | if (bno >= end || n >= *nmap) | |
4049 | break; | |
4050 | ||
4051 | /* Else go on to the next record. */ | |
4052 | if (++lastx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) | |
4053 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx), &got); | |
4054 | else | |
4055 | eof = 1; | |
4056 | } | |
4057 | *nmap = n; | |
b447fe5a DC |
4058 | return 0; |
4059 | } | |
4060 | ||
9e5987a7 DC |
4061 | STATIC int |
4062 | xfs_bmapi_reserve_delalloc( | |
4063 | struct xfs_inode *ip, | |
4064 | xfs_fileoff_t aoff, | |
4065 | xfs_filblks_t len, | |
4066 | struct xfs_bmbt_irec *got, | |
4067 | struct xfs_bmbt_irec *prev, | |
4068 | xfs_extnum_t *lastx, | |
4069 | int eof) | |
1da177e4 | 4070 | { |
c0dc7828 | 4071 | struct xfs_mount *mp = ip->i_mount; |
9e5987a7 DC |
4072 | struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK); |
4073 | xfs_extlen_t alen; | |
4074 | xfs_extlen_t indlen; | |
4075 | char rt = XFS_IS_REALTIME_INODE(ip); | |
4076 | xfs_extlen_t extsz; | |
4077 | int error; | |
c0dc7828 | 4078 | |
9e5987a7 DC |
4079 | alen = XFS_FILBLKS_MIN(len, MAXEXTLEN); |
4080 | if (!eof) | |
4081 | alen = XFS_FILBLKS_MIN(alen, got->br_startoff - aoff); | |
1da177e4 | 4082 | |
9e5987a7 DC |
4083 | /* Figure out the extent size, adjust alen */ |
4084 | extsz = xfs_get_extsz_hint(ip); | |
4085 | if (extsz) { | |
4086 | /* | |
4087 | * Make sure we don't exceed a single extent length when we | |
4088 | * align the extent by reducing length we are going to | |
4089 | * allocate by the maximum amount extent size aligment may | |
4090 | * require. | |
4091 | */ | |
4092 | alen = XFS_FILBLKS_MIN(len, MAXEXTLEN - (2 * extsz - 1)); | |
4093 | error = xfs_bmap_extsize_align(mp, got, prev, extsz, rt, eof, | |
4094 | 1, 0, &aoff, &alen); | |
4095 | ASSERT(!error); | |
4096 | } | |
4097 | ||
4098 | if (rt) | |
4099 | extsz = alen / mp->m_sb.sb_rextsize; | |
4100 | ||
4101 | /* | |
4102 | * Make a transaction-less quota reservation for delayed allocation | |
4103 | * blocks. This number gets adjusted later. We return if we haven't | |
4104 | * allocated blocks already inside this loop. | |
4105 | */ | |
4106 | error = xfs_trans_reserve_quota_nblks(NULL, ip, (long)alen, 0, | |
4107 | rt ? XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS); | |
4108 | if (error) | |
4109 | return error; | |
4110 | ||
4111 | /* | |
4112 | * Split changing sb for alen and indlen since they could be coming | |
4113 | * from different places. | |
4114 | */ | |
4115 | indlen = (xfs_extlen_t)xfs_bmap_worst_indlen(ip, alen); | |
4116 | ASSERT(indlen > 0); | |
4117 | ||
4118 | if (rt) { | |
4119 | error = xfs_mod_incore_sb(mp, XFS_SBS_FREXTENTS, | |
4120 | -((int64_t)extsz), 0); | |
4121 | } else { | |
4122 | error = xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS, | |
4123 | -((int64_t)alen), 0); | |
4124 | } | |
4125 | ||
4126 | if (error) | |
4127 | goto out_unreserve_quota; | |
4128 | ||
4129 | error = xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS, | |
4130 | -((int64_t)indlen), 0); | |
4131 | if (error) | |
4132 | goto out_unreserve_blocks; | |
4133 | ||
4134 | ||
4135 | ip->i_delayed_blks += alen; | |
4136 | ||
4137 | got->br_startoff = aoff; | |
4138 | got->br_startblock = nullstartblock(indlen); | |
4139 | got->br_blockcount = alen; | |
4140 | got->br_state = XFS_EXT_NORM; | |
4141 | xfs_bmap_add_extent_hole_delay(ip, lastx, got); | |
4142 | ||
4143 | /* | |
4144 | * Update our extent pointer, given that xfs_bmap_add_extent_hole_delay | |
4145 | * might have merged it into one of the neighbouring ones. | |
4146 | */ | |
4147 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *lastx), got); | |
4148 | ||
4149 | ASSERT(got->br_startoff <= aoff); | |
4150 | ASSERT(got->br_startoff + got->br_blockcount >= aoff + alen); | |
4151 | ASSERT(isnullstartblock(got->br_startblock)); | |
4152 | ASSERT(got->br_state == XFS_EXT_NORM); | |
4153 | return 0; | |
4154 | ||
4155 | out_unreserve_blocks: | |
4156 | if (rt) | |
4157 | xfs_mod_incore_sb(mp, XFS_SBS_FREXTENTS, extsz, 0); | |
4158 | else | |
4159 | xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS, alen, 0); | |
4160 | out_unreserve_quota: | |
4161 | if (XFS_IS_QUOTA_ON(mp)) | |
4162 | xfs_trans_unreserve_quota_nblks(NULL, ip, (long)alen, 0, rt ? | |
4163 | XFS_QMOPT_RES_RTBLKS : XFS_QMOPT_RES_REGBLKS); | |
4164 | return error; | |
4165 | } | |
4166 | ||
4167 | /* | |
4168 | * Map file blocks to filesystem blocks, adding delayed allocations as needed. | |
4169 | */ | |
4170 | int | |
4171 | xfs_bmapi_delay( | |
4172 | struct xfs_inode *ip, /* incore inode */ | |
4173 | xfs_fileoff_t bno, /* starting file offs. mapped */ | |
4174 | xfs_filblks_t len, /* length to map in file */ | |
4175 | struct xfs_bmbt_irec *mval, /* output: map values */ | |
4176 | int *nmap, /* i/o: mval size/count */ | |
4177 | int flags) /* XFS_BMAPI_... */ | |
4178 | { | |
4179 | struct xfs_mount *mp = ip->i_mount; | |
4180 | struct xfs_ifork *ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK); | |
4181 | struct xfs_bmbt_irec got; /* current file extent record */ | |
4182 | struct xfs_bmbt_irec prev; /* previous file extent record */ | |
4183 | xfs_fileoff_t obno; /* old block number (offset) */ | |
4184 | xfs_fileoff_t end; /* end of mapped file region */ | |
4185 | xfs_extnum_t lastx; /* last useful extent number */ | |
4186 | int eof; /* we've hit the end of extents */ | |
4187 | int n = 0; /* current extent index */ | |
4188 | int error = 0; | |
c0dc7828 | 4189 | |
1da177e4 | 4190 | ASSERT(*nmap >= 1); |
c0dc7828 | 4191 | ASSERT(*nmap <= XFS_BMAP_MAX_NMAP); |
9e5987a7 | 4192 | ASSERT(!(flags & ~XFS_BMAPI_ENTIRE)); |
c0dc7828 | 4193 | |
1da177e4 | 4194 | if (unlikely(XFS_TEST_ERROR( |
9e5987a7 DC |
4195 | (XFS_IFORK_FORMAT(ip, XFS_DATA_FORK) != XFS_DINODE_FMT_EXTENTS && |
4196 | XFS_IFORK_FORMAT(ip, XFS_DATA_FORK) != XFS_DINODE_FMT_BTREE), | |
1da177e4 | 4197 | mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { |
9e5987a7 | 4198 | XFS_ERROR_REPORT("xfs_bmapi_delay", XFS_ERRLEVEL_LOW, mp); |
1da177e4 LT |
4199 | return XFS_ERROR(EFSCORRUPTED); |
4200 | } | |
c0dc7828 | 4201 | |
1da177e4 LT |
4202 | if (XFS_FORCED_SHUTDOWN(mp)) |
4203 | return XFS_ERROR(EIO); | |
c0dc7828 | 4204 | |
c0dc7828 DC |
4205 | XFS_STATS_INC(xs_blk_mapw); |
4206 | ||
c0dc7828 | 4207 | if (!(ifp->if_flags & XFS_IFEXTENTS)) { |
9e5987a7 | 4208 | error = xfs_iread_extents(NULL, ip, XFS_DATA_FORK); |
c0dc7828 | 4209 | if (error) |
9e5987a7 | 4210 | return error; |
c0dc7828 DC |
4211 | } |
4212 | ||
9e5987a7 | 4213 | xfs_bmap_search_extents(ip, bno, XFS_DATA_FORK, &eof, &lastx, &got, &prev); |
1da177e4 LT |
4214 | end = bno + len; |
4215 | obno = bno; | |
7e47a4ef | 4216 | |
1da177e4 | 4217 | while (bno < end && n < *nmap) { |
9e5987a7 DC |
4218 | if (eof || got.br_startoff > bno) { |
4219 | error = xfs_bmapi_reserve_delalloc(ip, bno, len, &got, | |
4220 | &prev, &lastx, eof); | |
4221 | if (error) { | |
4222 | if (n == 0) { | |
4223 | *nmap = 0; | |
4224 | return error; | |
4225 | } | |
4226 | break; | |
4227 | } | |
4228 | } | |
c0dc7828 | 4229 | |
9e5987a7 DC |
4230 | /* set up the extent map to return. */ |
4231 | xfs_bmapi_trim_map(mval, &got, &bno, len, obno, end, n, flags); | |
aef9a895 DC |
4232 | xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags); |
4233 | ||
9e5987a7 DC |
4234 | /* If we're done, stop now. */ |
4235 | if (bno >= end || n >= *nmap) | |
1da177e4 | 4236 | break; |
c0dc7828 DC |
4237 | |
4238 | /* Else go on to the next record. */ | |
9e5987a7 DC |
4239 | prev = got; |
4240 | if (++lastx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) | |
4241 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, lastx), &got); | |
4242 | else | |
5690f921 | 4243 | eof = 1; |
1da177e4 | 4244 | } |
9e5987a7 | 4245 | |
1da177e4 | 4246 | *nmap = n; |
9e5987a7 DC |
4247 | return 0; |
4248 | } | |
c0dc7828 | 4249 | |
c315c90b | 4250 | |
68988114 | 4251 | int |
9e5987a7 DC |
4252 | __xfs_bmapi_allocate( |
4253 | struct xfs_bmalloca *bma) | |
4254 | { | |
4255 | struct xfs_mount *mp = bma->ip->i_mount; | |
4256 | int whichfork = (bma->flags & XFS_BMAPI_ATTRFORK) ? | |
4257 | XFS_ATTR_FORK : XFS_DATA_FORK; | |
4258 | struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork); | |
4259 | int tmp_logflags = 0; | |
4260 | int error; | |
9e5987a7 DC |
4261 | |
4262 | ASSERT(bma->length > 0); | |
4263 | ||
1da177e4 | 4264 | /* |
9e5987a7 DC |
4265 | * For the wasdelay case, we could also just allocate the stuff asked |
4266 | * for in this bmap call but that wouldn't be as good. | |
1da177e4 | 4267 | */ |
9e5987a7 DC |
4268 | if (bma->wasdel) { |
4269 | bma->length = (xfs_extlen_t)bma->got.br_blockcount; | |
4270 | bma->offset = bma->got.br_startoff; | |
4271 | if (bma->idx != NULLEXTNUM && bma->idx) { | |
4272 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), | |
4273 | &bma->prev); | |
1da177e4 | 4274 | } |
9e5987a7 DC |
4275 | } else { |
4276 | bma->length = XFS_FILBLKS_MIN(bma->length, MAXEXTLEN); | |
4277 | if (!bma->eof) | |
4278 | bma->length = XFS_FILBLKS_MIN(bma->length, | |
4279 | bma->got.br_startoff - bma->offset); | |
1da177e4 | 4280 | } |
1da177e4 | 4281 | |
9e5987a7 DC |
4282 | /* |
4283 | * Indicate if this is the first user data in the file, or just any | |
4284 | * user data. | |
4285 | */ | |
4286 | if (!(bma->flags & XFS_BMAPI_METADATA)) { | |
4287 | bma->userdata = (bma->offset == 0) ? | |
4288 | XFS_ALLOC_INITIAL_USER_DATA : XFS_ALLOC_USERDATA; | |
4289 | } | |
1da177e4 | 4290 | |
9e5987a7 | 4291 | bma->minlen = (bma->flags & XFS_BMAPI_CONTIG) ? bma->length : 1; |
0b1b213f | 4292 | |
9e5987a7 DC |
4293 | /* |
4294 | * Only want to do the alignment at the eof if it is userdata and | |
4295 | * allocation length is larger than a stripe unit. | |
4296 | */ | |
4297 | if (mp->m_dalign && bma->length >= mp->m_dalign && | |
4298 | !(bma->flags & XFS_BMAPI_METADATA) && whichfork == XFS_DATA_FORK) { | |
4299 | error = xfs_bmap_isaeof(bma, whichfork); | |
4300 | if (error) | |
4301 | return error; | |
1da177e4 | 4302 | } |
8096b1eb | 4303 | |
9e5987a7 DC |
4304 | error = xfs_bmap_alloc(bma); |
4305 | if (error) | |
1da177e4 | 4306 | return error; |
9e5987a7 DC |
4307 | |
4308 | if (bma->flist->xbf_low) | |
4309 | bma->minleft = 0; | |
4310 | if (bma->cur) | |
4311 | bma->cur->bc_private.b.firstblock = *bma->firstblock; | |
4312 | if (bma->blkno == NULLFSBLOCK) | |
1da177e4 | 4313 | return 0; |
9e5987a7 DC |
4314 | if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) { |
4315 | bma->cur = xfs_bmbt_init_cursor(mp, bma->tp, bma->ip, whichfork); | |
4316 | bma->cur->bc_private.b.firstblock = *bma->firstblock; | |
4317 | bma->cur->bc_private.b.flist = bma->flist; | |
1da177e4 | 4318 | } |
9e5987a7 DC |
4319 | /* |
4320 | * Bump the number of extents we've allocated | |
4321 | * in this call. | |
4322 | */ | |
4323 | bma->nallocs++; | |
4324 | ||
4325 | if (bma->cur) | |
4326 | bma->cur->bc_private.b.flags = | |
4327 | bma->wasdel ? XFS_BTCUR_BPRV_WASDEL : 0; | |
4328 | ||
4329 | bma->got.br_startoff = bma->offset; | |
4330 | bma->got.br_startblock = bma->blkno; | |
4331 | bma->got.br_blockcount = bma->length; | |
4332 | bma->got.br_state = XFS_EXT_NORM; | |
b4e9181e | 4333 | |
1da177e4 | 4334 | /* |
9e5987a7 DC |
4335 | * A wasdelay extent has been initialized, so shouldn't be flagged |
4336 | * as unwritten. | |
1da177e4 | 4337 | */ |
9e5987a7 DC |
4338 | if (!bma->wasdel && (bma->flags & XFS_BMAPI_PREALLOC) && |
4339 | xfs_sb_version_hasextflgbit(&mp->m_sb)) | |
4340 | bma->got.br_state = XFS_EXT_UNWRITTEN; | |
4341 | ||
4342 | if (bma->wasdel) | |
4343 | error = xfs_bmap_add_extent_delay_real(bma); | |
4344 | else | |
4345 | error = xfs_bmap_add_extent_hole_real(bma, whichfork); | |
4346 | ||
4347 | bma->logflags |= tmp_logflags; | |
4348 | if (error) | |
4349 | return error; | |
4350 | ||
4351 | /* | |
4352 | * Update our extent pointer, given that xfs_bmap_add_extent_delay_real | |
4353 | * or xfs_bmap_add_extent_hole_real might have merged it into one of | |
4354 | * the neighbouring ones. | |
4355 | */ | |
4356 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got); | |
4357 | ||
4358 | ASSERT(bma->got.br_startoff <= bma->offset); | |
4359 | ASSERT(bma->got.br_startoff + bma->got.br_blockcount >= | |
4360 | bma->offset + bma->length); | |
4361 | ASSERT(bma->got.br_state == XFS_EXT_NORM || | |
4362 | bma->got.br_state == XFS_EXT_UNWRITTEN); | |
4363 | return 0; | |
4364 | } | |
4365 | ||
9e5987a7 DC |
4366 | STATIC int |
4367 | xfs_bmapi_convert_unwritten( | |
4368 | struct xfs_bmalloca *bma, | |
4369 | struct xfs_bmbt_irec *mval, | |
4370 | xfs_filblks_t len, | |
4371 | int flags) | |
4372 | { | |
4373 | int whichfork = (flags & XFS_BMAPI_ATTRFORK) ? | |
4374 | XFS_ATTR_FORK : XFS_DATA_FORK; | |
4375 | struct xfs_ifork *ifp = XFS_IFORK_PTR(bma->ip, whichfork); | |
4376 | int tmp_logflags = 0; | |
4377 | int error; | |
4378 | ||
4379 | /* check if we need to do unwritten->real conversion */ | |
4380 | if (mval->br_state == XFS_EXT_UNWRITTEN && | |
4381 | (flags & XFS_BMAPI_PREALLOC)) | |
4382 | return 0; | |
4383 | ||
4384 | /* check if we need to do real->unwritten conversion */ | |
4385 | if (mval->br_state == XFS_EXT_NORM && | |
4386 | (flags & (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) != | |
4387 | (XFS_BMAPI_PREALLOC | XFS_BMAPI_CONVERT)) | |
4388 | return 0; | |
4389 | ||
4390 | /* | |
4391 | * Modify (by adding) the state flag, if writing. | |
4392 | */ | |
4393 | ASSERT(mval->br_blockcount <= len); | |
4394 | if ((ifp->if_flags & XFS_IFBROOT) && !bma->cur) { | |
4395 | bma->cur = xfs_bmbt_init_cursor(bma->ip->i_mount, bma->tp, | |
4396 | bma->ip, whichfork); | |
4397 | bma->cur->bc_private.b.firstblock = *bma->firstblock; | |
4398 | bma->cur->bc_private.b.flist = bma->flist; | |
1da177e4 | 4399 | } |
9e5987a7 DC |
4400 | mval->br_state = (mval->br_state == XFS_EXT_UNWRITTEN) |
4401 | ? XFS_EXT_NORM : XFS_EXT_UNWRITTEN; | |
5575acc7 | 4402 | |
9e5987a7 DC |
4403 | error = xfs_bmap_add_extent_unwritten_real(bma->tp, bma->ip, &bma->idx, |
4404 | &bma->cur, mval, bma->firstblock, bma->flist, | |
4405 | &tmp_logflags); | |
4406 | bma->logflags |= tmp_logflags; | |
4407 | if (error) | |
4408 | return error; | |
4409 | ||
4410 | /* | |
4411 | * Update our extent pointer, given that | |
4412 | * xfs_bmap_add_extent_unwritten_real might have merged it into one | |
4413 | * of the neighbouring ones. | |
4414 | */ | |
4415 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &bma->got); | |
4416 | ||
4417 | /* | |
4418 | * We may have combined previously unwritten space with written space, | |
4419 | * so generate another request. | |
4420 | */ | |
4421 | if (mval->br_blockcount < len) | |
4422 | return EAGAIN; | |
4423 | return 0; | |
4424 | } | |
4425 | ||
4426 | /* | |
4427 | * Map file blocks to filesystem blocks, and allocate blocks or convert the | |
4428 | * extent state if necessary. Details behaviour is controlled by the flags | |
4429 | * parameter. Only allocates blocks from a single allocation group, to avoid | |
4430 | * locking problems. | |
4431 | * | |
4432 | * The returned value in "firstblock" from the first call in a transaction | |
4433 | * must be remembered and presented to subsequent calls in "firstblock". | |
4434 | * An upper bound for the number of blocks to be allocated is supplied to | |
4435 | * the first call in "total"; if no allocation group has that many free | |
4436 | * blocks then the call will fail (return NULLFSBLOCK in "firstblock"). | |
4437 | */ | |
4438 | int | |
4439 | xfs_bmapi_write( | |
4440 | struct xfs_trans *tp, /* transaction pointer */ | |
4441 | struct xfs_inode *ip, /* incore inode */ | |
4442 | xfs_fileoff_t bno, /* starting file offs. mapped */ | |
4443 | xfs_filblks_t len, /* length to map in file */ | |
4444 | int flags, /* XFS_BMAPI_... */ | |
4445 | xfs_fsblock_t *firstblock, /* first allocated block | |
4446 | controls a.g. for allocs */ | |
4447 | xfs_extlen_t total, /* total blocks needed */ | |
4448 | struct xfs_bmbt_irec *mval, /* output: map values */ | |
4449 | int *nmap, /* i/o: mval size/count */ | |
4450 | struct xfs_bmap_free *flist) /* i/o: list extents to free */ | |
4451 | { | |
4452 | struct xfs_mount *mp = ip->i_mount; | |
4453 | struct xfs_ifork *ifp; | |
a30b0367 | 4454 | struct xfs_bmalloca bma = { NULL }; /* args for xfs_bmap_alloc */ |
9e5987a7 DC |
4455 | xfs_fileoff_t end; /* end of mapped file region */ |
4456 | int eof; /* after the end of extents */ | |
4457 | int error; /* error return */ | |
4458 | int n; /* current extent index */ | |
4459 | xfs_fileoff_t obno; /* old block number (offset) */ | |
4460 | int whichfork; /* data or attr fork */ | |
4461 | char inhole; /* current location is hole in file */ | |
4462 | char wasdelay; /* old extent was delayed */ | |
4463 | ||
4464 | #ifdef DEBUG | |
4465 | xfs_fileoff_t orig_bno; /* original block number value */ | |
4466 | int orig_flags; /* original flags arg value */ | |
4467 | xfs_filblks_t orig_len; /* original value of len arg */ | |
4468 | struct xfs_bmbt_irec *orig_mval; /* original value of mval */ | |
4469 | int orig_nmap; /* original value of *nmap */ | |
4470 | ||
4471 | orig_bno = bno; | |
4472 | orig_len = len; | |
4473 | orig_flags = flags; | |
4474 | orig_mval = mval; | |
4475 | orig_nmap = *nmap; | |
4476 | #endif | |
f3508bcd DC |
4477 | whichfork = (flags & XFS_BMAPI_ATTRFORK) ? |
4478 | XFS_ATTR_FORK : XFS_DATA_FORK; | |
9e5987a7 DC |
4479 | |
4480 | ASSERT(*nmap >= 1); | |
4481 | ASSERT(*nmap <= XFS_BMAP_MAX_NMAP); | |
4482 | ASSERT(!(flags & XFS_BMAPI_IGSTATE)); | |
4483 | ASSERT(tp != NULL); | |
4484 | ASSERT(len > 0); | |
f3508bcd | 4485 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_LOCAL); |
9e5987a7 DC |
4486 | |
4487 | if (unlikely(XFS_TEST_ERROR( | |
4488 | (XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && | |
f3508bcd | 4489 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE), |
9e5987a7 DC |
4490 | mp, XFS_ERRTAG_BMAPIFORMAT, XFS_RANDOM_BMAPIFORMAT))) { |
4491 | XFS_ERROR_REPORT("xfs_bmapi_write", XFS_ERRLEVEL_LOW, mp); | |
4492 | return XFS_ERROR(EFSCORRUPTED); | |
5575acc7 KD |
4493 | } |
4494 | ||
9e5987a7 DC |
4495 | if (XFS_FORCED_SHUTDOWN(mp)) |
4496 | return XFS_ERROR(EIO); | |
4497 | ||
4498 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
4499 | ||
4500 | XFS_STATS_INC(xs_blk_mapw); | |
4501 | ||
9e5987a7 DC |
4502 | if (*firstblock == NULLFSBLOCK) { |
4503 | if (XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE) | |
4504 | bma.minleft = be16_to_cpu(ifp->if_broot->bb_level) + 1; | |
4505 | else | |
4506 | bma.minleft = 1; | |
4507 | } else { | |
4508 | bma.minleft = 0; | |
4509 | } | |
4510 | ||
4511 | if (!(ifp->if_flags & XFS_IFEXTENTS)) { | |
4512 | error = xfs_iread_extents(tp, ip, whichfork); | |
4513 | if (error) | |
4514 | goto error0; | |
4515 | } | |
4516 | ||
4517 | xfs_bmap_search_extents(ip, bno, whichfork, &eof, &bma.idx, &bma.got, | |
4518 | &bma.prev); | |
4519 | n = 0; | |
4520 | end = bno + len; | |
4521 | obno = bno; | |
4522 | ||
4523 | bma.tp = tp; | |
4524 | bma.ip = ip; | |
4525 | bma.total = total; | |
4526 | bma.userdata = 0; | |
4527 | bma.flist = flist; | |
4528 | bma.firstblock = firstblock; | |
4529 | ||
4530 | if (flags & XFS_BMAPI_STACK_SWITCH) | |
4531 | bma.stack_switch = 1; | |
4532 | ||
4533 | while (bno < end && n < *nmap) { | |
4534 | inhole = eof || bma.got.br_startoff > bno; | |
4535 | wasdelay = !inhole && isnullstartblock(bma.got.br_startblock); | |
4536 | ||
1da177e4 | 4537 | /* |
9e5987a7 DC |
4538 | * First, deal with the hole before the allocated space |
4539 | * that we found, if any. | |
1da177e4 | 4540 | */ |
9e5987a7 DC |
4541 | if (inhole || wasdelay) { |
4542 | bma.eof = eof; | |
4543 | bma.conv = !!(flags & XFS_BMAPI_CONVERT); | |
4544 | bma.wasdel = wasdelay; | |
4545 | bma.offset = bno; | |
4546 | bma.flags = flags; | |
4547 | ||
1da177e4 | 4548 | /* |
9e5987a7 DC |
4549 | * There's a 32/64 bit type mismatch between the |
4550 | * allocation length request (which can be 64 bits in | |
4551 | * length) and the bma length request, which is | |
4552 | * xfs_extlen_t and therefore 32 bits. Hence we have to | |
4553 | * check for 32-bit overflows and handle them here. | |
1da177e4 | 4554 | */ |
9e5987a7 DC |
4555 | if (len > (xfs_filblks_t)MAXEXTLEN) |
4556 | bma.length = MAXEXTLEN; | |
4557 | else | |
4558 | bma.length = len; | |
4559 | ||
4560 | ASSERT(len > 0); | |
4561 | ASSERT(bma.length > 0); | |
4562 | error = xfs_bmapi_allocate(&bma); | |
1da177e4 LT |
4563 | if (error) |
4564 | goto error0; | |
9e5987a7 DC |
4565 | if (bma.blkno == NULLFSBLOCK) |
4566 | break; | |
1da177e4 | 4567 | } |
9e5987a7 DC |
4568 | |
4569 | /* Deal with the allocated space we found. */ | |
4570 | xfs_bmapi_trim_map(mval, &bma.got, &bno, len, obno, | |
4571 | end, n, flags); | |
4572 | ||
4573 | /* Execute unwritten extent conversion if necessary */ | |
4574 | error = xfs_bmapi_convert_unwritten(&bma, mval, len, flags); | |
4575 | if (error == EAGAIN) | |
4576 | continue; | |
4577 | if (error) | |
4578 | goto error0; | |
4579 | ||
4580 | /* update the extent map to return */ | |
4581 | xfs_bmapi_update_map(&mval, &bno, &len, obno, end, &n, flags); | |
4582 | ||
4583 | /* | |
4584 | * If we're done, stop now. Stop when we've allocated | |
4585 | * XFS_BMAP_MAX_NMAP extents no matter what. Otherwise | |
4586 | * the transaction may get too big. | |
4587 | */ | |
4588 | if (bno >= end || n >= *nmap || bma.nallocs >= *nmap) | |
4589 | break; | |
4590 | ||
4591 | /* Else go on to the next record. */ | |
4592 | bma.prev = bma.got; | |
4593 | if (++bma.idx < ifp->if_bytes / sizeof(xfs_bmbt_rec_t)) { | |
4594 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma.idx), | |
4595 | &bma.got); | |
4596 | } else | |
4597 | eof = 1; | |
4598 | } | |
4599 | *nmap = n; | |
4600 | ||
4601 | /* | |
4602 | * Transform from btree to extents, give it cur. | |
4603 | */ | |
4604 | if (xfs_bmap_wants_extents(ip, whichfork)) { | |
4605 | int tmp_logflags = 0; | |
4606 | ||
4607 | ASSERT(bma.cur); | |
4608 | error = xfs_bmap_btree_to_extents(tp, ip, bma.cur, | |
4609 | &tmp_logflags, whichfork); | |
4610 | bma.logflags |= tmp_logflags; | |
4611 | if (error) | |
4612 | goto error0; | |
4613 | } | |
4614 | ||
4615 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE || | |
4616 | XFS_IFORK_NEXTENTS(ip, whichfork) > | |
4617 | XFS_IFORK_MAXEXT(ip, whichfork)); | |
4618 | error = 0; | |
4619 | error0: | |
4620 | /* | |
4621 | * Log everything. Do this after conversion, there's no point in | |
4622 | * logging the extent records if we've converted to btree format. | |
4623 | */ | |
4624 | if ((bma.logflags & xfs_ilog_fext(whichfork)) && | |
4625 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) | |
4626 | bma.logflags &= ~xfs_ilog_fext(whichfork); | |
4627 | else if ((bma.logflags & xfs_ilog_fbroot(whichfork)) && | |
4628 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) | |
4629 | bma.logflags &= ~xfs_ilog_fbroot(whichfork); | |
4630 | /* | |
4631 | * Log whatever the flags say, even if error. Otherwise we might miss | |
4632 | * detecting a case where the data is changed, there's an error, | |
4633 | * and it's not logged so we don't shutdown when we should. | |
4634 | */ | |
4635 | if (bma.logflags) | |
4636 | xfs_trans_log_inode(tp, ip, bma.logflags); | |
4637 | ||
4638 | if (bma.cur) { | |
4639 | if (!error) { | |
4640 | ASSERT(*firstblock == NULLFSBLOCK || | |
4641 | XFS_FSB_TO_AGNO(mp, *firstblock) == | |
4642 | XFS_FSB_TO_AGNO(mp, | |
4643 | bma.cur->bc_private.b.firstblock) || | |
4644 | (flist->xbf_low && | |
4645 | XFS_FSB_TO_AGNO(mp, *firstblock) < | |
4646 | XFS_FSB_TO_AGNO(mp, | |
4647 | bma.cur->bc_private.b.firstblock))); | |
4648 | *firstblock = bma.cur->bc_private.b.firstblock; | |
1da177e4 | 4649 | } |
9e5987a7 DC |
4650 | xfs_btree_del_cursor(bma.cur, |
4651 | error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); | |
4652 | } | |
4653 | if (!error) | |
4654 | xfs_bmap_validate_ret(orig_bno, orig_len, orig_flags, orig_mval, | |
4655 | orig_nmap, *nmap); | |
4656 | return error; | |
4657 | } | |
06d10dd9 | 4658 | |
9e5987a7 DC |
4659 | /* |
4660 | * Called by xfs_bmapi to update file extent records and the btree | |
4661 | * after removing space (or undoing a delayed allocation). | |
4662 | */ | |
4663 | STATIC int /* error */ | |
4664 | xfs_bmap_del_extent( | |
4665 | xfs_inode_t *ip, /* incore inode pointer */ | |
4666 | xfs_trans_t *tp, /* current transaction pointer */ | |
4667 | xfs_extnum_t *idx, /* extent number to update/delete */ | |
4668 | xfs_bmap_free_t *flist, /* list of extents to be freed */ | |
4669 | xfs_btree_cur_t *cur, /* if null, not a btree */ | |
4670 | xfs_bmbt_irec_t *del, /* data to remove from extents */ | |
4671 | int *logflagsp, /* inode logging flags */ | |
4672 | int whichfork) /* data or attr fork */ | |
4673 | { | |
4674 | xfs_filblks_t da_new; /* new delay-alloc indirect blocks */ | |
4675 | xfs_filblks_t da_old; /* old delay-alloc indirect blocks */ | |
4676 | xfs_fsblock_t del_endblock=0; /* first block past del */ | |
4677 | xfs_fileoff_t del_endoff; /* first offset past del */ | |
4678 | int delay; /* current block is delayed allocated */ | |
4679 | int do_fx; /* free extent at end of routine */ | |
4680 | xfs_bmbt_rec_host_t *ep; /* current extent entry pointer */ | |
4681 | int error; /* error return value */ | |
4682 | int flags; /* inode logging flags */ | |
4683 | xfs_bmbt_irec_t got; /* current extent entry */ | |
4684 | xfs_fileoff_t got_endoff; /* first offset past got */ | |
4685 | int i; /* temp state */ | |
4686 | xfs_ifork_t *ifp; /* inode fork pointer */ | |
4687 | xfs_mount_t *mp; /* mount structure */ | |
4688 | xfs_filblks_t nblks; /* quota/sb block count */ | |
4689 | xfs_bmbt_irec_t new; /* new record to be inserted */ | |
4690 | /* REFERENCED */ | |
4691 | uint qfield; /* quota field to update */ | |
4692 | xfs_filblks_t temp; /* for indirect length calculations */ | |
4693 | xfs_filblks_t temp2; /* for indirect length calculations */ | |
4694 | int state = 0; | |
4695 | ||
4696 | XFS_STATS_INC(xs_del_exlist); | |
4697 | ||
4698 | if (whichfork == XFS_ATTR_FORK) | |
4699 | state |= BMAP_ATTRFORK; | |
4700 | ||
4701 | mp = ip->i_mount; | |
4702 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
4703 | ASSERT((*idx >= 0) && (*idx < ifp->if_bytes / | |
4704 | (uint)sizeof(xfs_bmbt_rec_t))); | |
4705 | ASSERT(del->br_blockcount > 0); | |
4706 | ep = xfs_iext_get_ext(ifp, *idx); | |
4707 | xfs_bmbt_get_all(ep, &got); | |
4708 | ASSERT(got.br_startoff <= del->br_startoff); | |
4709 | del_endoff = del->br_startoff + del->br_blockcount; | |
4710 | got_endoff = got.br_startoff + got.br_blockcount; | |
4711 | ASSERT(got_endoff >= del_endoff); | |
4712 | delay = isnullstartblock(got.br_startblock); | |
4713 | ASSERT(isnullstartblock(del->br_startblock) == delay); | |
4714 | flags = 0; | |
4715 | qfield = 0; | |
4716 | error = 0; | |
4717 | /* | |
4718 | * If deleting a real allocation, must free up the disk space. | |
4719 | */ | |
4720 | if (!delay) { | |
4721 | flags = XFS_ILOG_CORE; | |
4722 | /* | |
4723 | * Realtime allocation. Free it and record di_nblocks update. | |
4724 | */ | |
4725 | if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) { | |
4726 | xfs_fsblock_t bno; | |
4727 | xfs_filblks_t len; | |
4728 | ||
4729 | ASSERT(do_mod(del->br_blockcount, | |
4730 | mp->m_sb.sb_rextsize) == 0); | |
4731 | ASSERT(do_mod(del->br_startblock, | |
4732 | mp->m_sb.sb_rextsize) == 0); | |
4733 | bno = del->br_startblock; | |
4734 | len = del->br_blockcount; | |
4735 | do_div(bno, mp->m_sb.sb_rextsize); | |
4736 | do_div(len, mp->m_sb.sb_rextsize); | |
4737 | error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len); | |
4738 | if (error) | |
4739 | goto done; | |
4740 | do_fx = 0; | |
4741 | nblks = len * mp->m_sb.sb_rextsize; | |
4742 | qfield = XFS_TRANS_DQ_RTBCOUNT; | |
4743 | } | |
1da177e4 | 4744 | /* |
9e5987a7 | 4745 | * Ordinary allocation. |
1da177e4 | 4746 | */ |
9e5987a7 DC |
4747 | else { |
4748 | do_fx = 1; | |
4749 | nblks = del->br_blockcount; | |
4750 | qfield = XFS_TRANS_DQ_BCOUNT; | |
1da177e4 | 4751 | } |
1da177e4 | 4752 | /* |
9e5987a7 | 4753 | * Set up del_endblock and cur for later. |
1da177e4 | 4754 | */ |
9e5987a7 DC |
4755 | del_endblock = del->br_startblock + del->br_blockcount; |
4756 | if (cur) { | |
4757 | if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff, | |
4758 | got.br_startblock, got.br_blockcount, | |
4759 | &i))) | |
4760 | goto done; | |
4761 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
1da177e4 | 4762 | } |
9e5987a7 DC |
4763 | da_old = da_new = 0; |
4764 | } else { | |
4765 | da_old = startblockval(got.br_startblock); | |
4766 | da_new = 0; | |
4767 | nblks = 0; | |
4768 | do_fx = 0; | |
1da177e4 LT |
4769 | } |
4770 | /* | |
9e5987a7 DC |
4771 | * Set flag value to use in switch statement. |
4772 | * Left-contig is 2, right-contig is 1. | |
1da177e4 | 4773 | */ |
9e5987a7 DC |
4774 | switch (((got.br_startoff == del->br_startoff) << 1) | |
4775 | (got_endoff == del_endoff)) { | |
4776 | case 3: | |
4777 | /* | |
4778 | * Matches the whole extent. Delete the entry. | |
4779 | */ | |
4780 | xfs_iext_remove(ip, *idx, 1, | |
4781 | whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0); | |
4782 | --*idx; | |
4783 | if (delay) | |
4784 | break; | |
4785 | ||
4786 | XFS_IFORK_NEXT_SET(ip, whichfork, | |
4787 | XFS_IFORK_NEXTENTS(ip, whichfork) - 1); | |
4788 | flags |= XFS_ILOG_CORE; | |
4789 | if (!cur) { | |
4790 | flags |= xfs_ilog_fext(whichfork); | |
4791 | break; | |
4792 | } | |
4793 | if ((error = xfs_btree_delete(cur, &i))) | |
4794 | goto done; | |
4795 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
4796 | break; | |
4797 | ||
4798 | case 2: | |
4799 | /* | |
4800 | * Deleting the first part of the extent. | |
4801 | */ | |
4802 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
4803 | xfs_bmbt_set_startoff(ep, del_endoff); | |
4804 | temp = got.br_blockcount - del->br_blockcount; | |
4805 | xfs_bmbt_set_blockcount(ep, temp); | |
4806 | if (delay) { | |
4807 | temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), | |
4808 | da_old); | |
4809 | xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); | |
4810 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
4811 | da_new = temp; | |
4812 | break; | |
4813 | } | |
4814 | xfs_bmbt_set_startblock(ep, del_endblock); | |
4815 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
4816 | if (!cur) { | |
4817 | flags |= xfs_ilog_fext(whichfork); | |
4818 | break; | |
4819 | } | |
4820 | if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock, | |
4821 | got.br_blockcount - del->br_blockcount, | |
4822 | got.br_state))) | |
4823 | goto done; | |
4824 | break; | |
4825 | ||
4826 | case 1: | |
4827 | /* | |
4828 | * Deleting the last part of the extent. | |
4829 | */ | |
4830 | temp = got.br_blockcount - del->br_blockcount; | |
4831 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
4832 | xfs_bmbt_set_blockcount(ep, temp); | |
4833 | if (delay) { | |
4834 | temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp), | |
4835 | da_old); | |
4836 | xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); | |
4837 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
4838 | da_new = temp; | |
4839 | break; | |
4840 | } | |
4841 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
4842 | if (!cur) { | |
4843 | flags |= xfs_ilog_fext(whichfork); | |
4844 | break; | |
4845 | } | |
4846 | if ((error = xfs_bmbt_update(cur, got.br_startoff, | |
4847 | got.br_startblock, | |
4848 | got.br_blockcount - del->br_blockcount, | |
4849 | got.br_state))) | |
4850 | goto done; | |
4851 | break; | |
4852 | ||
4853 | case 0: | |
4854 | /* | |
4855 | * Deleting the middle of the extent. | |
4856 | */ | |
4857 | temp = del->br_startoff - got.br_startoff; | |
4858 | trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_); | |
4859 | xfs_bmbt_set_blockcount(ep, temp); | |
4860 | new.br_startoff = del_endoff; | |
4861 | temp2 = got_endoff - del_endoff; | |
4862 | new.br_blockcount = temp2; | |
4863 | new.br_state = got.br_state; | |
4864 | if (!delay) { | |
4865 | new.br_startblock = del_endblock; | |
4866 | flags |= XFS_ILOG_CORE; | |
4867 | if (cur) { | |
4868 | if ((error = xfs_bmbt_update(cur, | |
4869 | got.br_startoff, | |
4870 | got.br_startblock, temp, | |
4871 | got.br_state))) | |
4872 | goto done; | |
4873 | if ((error = xfs_btree_increment(cur, 0, &i))) | |
4874 | goto done; | |
4875 | cur->bc_rec.b = new; | |
4876 | error = xfs_btree_insert(cur, &i); | |
4877 | if (error && error != ENOSPC) | |
4878 | goto done; | |
4879 | /* | |
4880 | * If get no-space back from btree insert, | |
4881 | * it tried a split, and we have a zero | |
4882 | * block reservation. | |
4883 | * Fix up our state and return the error. | |
4884 | */ | |
4885 | if (error == ENOSPC) { | |
4886 | /* | |
4887 | * Reset the cursor, don't trust | |
4888 | * it after any insert operation. | |
4889 | */ | |
4890 | if ((error = xfs_bmbt_lookup_eq(cur, | |
4891 | got.br_startoff, | |
4892 | got.br_startblock, | |
4893 | temp, &i))) | |
4894 | goto done; | |
4895 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
4896 | /* | |
4897 | * Update the btree record back | |
4898 | * to the original value. | |
4899 | */ | |
4900 | if ((error = xfs_bmbt_update(cur, | |
4901 | got.br_startoff, | |
4902 | got.br_startblock, | |
4903 | got.br_blockcount, | |
4904 | got.br_state))) | |
4905 | goto done; | |
4906 | /* | |
4907 | * Reset the extent record back | |
4908 | * to the original value. | |
4909 | */ | |
4910 | xfs_bmbt_set_blockcount(ep, | |
4911 | got.br_blockcount); | |
4912 | flags = 0; | |
4913 | error = XFS_ERROR(ENOSPC); | |
4914 | goto done; | |
4915 | } | |
4916 | XFS_WANT_CORRUPTED_GOTO(i == 1, done); | |
4917 | } else | |
4918 | flags |= xfs_ilog_fext(whichfork); | |
4919 | XFS_IFORK_NEXT_SET(ip, whichfork, | |
4920 | XFS_IFORK_NEXTENTS(ip, whichfork) + 1); | |
4921 | } else { | |
4922 | ASSERT(whichfork == XFS_DATA_FORK); | |
4923 | temp = xfs_bmap_worst_indlen(ip, temp); | |
4924 | xfs_bmbt_set_startblock(ep, nullstartblock((int)temp)); | |
4925 | temp2 = xfs_bmap_worst_indlen(ip, temp2); | |
4926 | new.br_startblock = nullstartblock((int)temp2); | |
4927 | da_new = temp + temp2; | |
4928 | while (da_new > da_old) { | |
4929 | if (temp) { | |
4930 | temp--; | |
4931 | da_new--; | |
4932 | xfs_bmbt_set_startblock(ep, | |
4933 | nullstartblock((int)temp)); | |
4934 | } | |
4935 | if (da_new == da_old) | |
4936 | break; | |
4937 | if (temp2) { | |
4938 | temp2--; | |
4939 | da_new--; | |
4940 | new.br_startblock = | |
4941 | nullstartblock((int)temp2); | |
4942 | } | |
4943 | } | |
4944 | } | |
4945 | trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_); | |
4946 | xfs_iext_insert(ip, *idx + 1, 1, &new, state); | |
4947 | ++*idx; | |
4948 | break; | |
1da177e4 LT |
4949 | } |
4950 | /* | |
9e5987a7 | 4951 | * If we need to, add to list of extents to delete. |
1da177e4 | 4952 | */ |
9e5987a7 DC |
4953 | if (do_fx) |
4954 | xfs_bmap_add_free(del->br_startblock, del->br_blockcount, flist, | |
4955 | mp); | |
1da177e4 | 4956 | /* |
9e5987a7 | 4957 | * Adjust inode # blocks in the file. |
1da177e4 | 4958 | */ |
9e5987a7 DC |
4959 | if (nblks) |
4960 | ip->i_d.di_nblocks -= nblks; | |
1da177e4 | 4961 | /* |
9e5987a7 | 4962 | * Adjust quota data. |
1da177e4 | 4963 | */ |
9e5987a7 DC |
4964 | if (qfield) |
4965 | xfs_trans_mod_dquot_byino(tp, ip, qfield, (long)-nblks); | |
4966 | ||
4967 | /* | |
4968 | * Account for change in delayed indirect blocks. | |
4969 | * Nothing to do for disk quota accounting here. | |
4970 | */ | |
4971 | ASSERT(da_old >= da_new); | |
4972 | if (da_old > da_new) { | |
4973 | xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS, | |
4974 | (int64_t)(da_old - da_new), 0); | |
1da177e4 | 4975 | } |
9e5987a7 DC |
4976 | done: |
4977 | *logflagsp = flags; | |
1da177e4 LT |
4978 | return error; |
4979 | } | |
4980 | ||
3bacbcd8 | 4981 | /* |
9e5987a7 DC |
4982 | * Unmap (remove) blocks from a file. |
4983 | * If nexts is nonzero then the number of extents to remove is limited to | |
4984 | * that value. If not all extents in the block range can be removed then | |
4985 | * *done is set. | |
3bacbcd8 | 4986 | */ |
9e5987a7 DC |
4987 | int /* error */ |
4988 | xfs_bunmapi( | |
4989 | xfs_trans_t *tp, /* transaction pointer */ | |
4990 | struct xfs_inode *ip, /* incore inode */ | |
4991 | xfs_fileoff_t bno, /* starting offset to unmap */ | |
4992 | xfs_filblks_t len, /* length to unmap in file */ | |
4993 | int flags, /* misc flags */ | |
4994 | xfs_extnum_t nexts, /* number of extents max */ | |
4995 | xfs_fsblock_t *firstblock, /* first allocated block | |
4996 | controls a.g. for allocs */ | |
4997 | xfs_bmap_free_t *flist, /* i/o: list extents to free */ | |
4998 | int *done) /* set if not done yet */ | |
3bacbcd8 | 4999 | { |
9e5987a7 DC |
5000 | xfs_btree_cur_t *cur; /* bmap btree cursor */ |
5001 | xfs_bmbt_irec_t del; /* extent being deleted */ | |
5002 | int eof; /* is deleting at eof */ | |
5003 | xfs_bmbt_rec_host_t *ep; /* extent record pointer */ | |
5004 | int error; /* error return value */ | |
5005 | xfs_extnum_t extno; /* extent number in list */ | |
5006 | xfs_bmbt_irec_t got; /* current extent record */ | |
5af317c9 | 5007 | xfs_ifork_t *ifp; /* inode fork pointer */ |
9e5987a7 DC |
5008 | int isrt; /* freeing in rt area */ |
5009 | xfs_extnum_t lastx; /* last extent index used */ | |
5010 | int logflags; /* transaction logging flags */ | |
5011 | xfs_extlen_t mod; /* rt extent offset */ | |
5012 | xfs_mount_t *mp; /* mount structure */ | |
5013 | xfs_extnum_t nextents; /* number of file extents */ | |
5014 | xfs_bmbt_irec_t prev; /* previous extent record */ | |
5015 | xfs_fileoff_t start; /* first file offset deleted */ | |
5016 | int tmp_logflags; /* partial logging flags */ | |
5017 | int wasdel; /* was a delayed alloc extent */ | |
5018 | int whichfork; /* data or attribute fork */ | |
5019 | xfs_fsblock_t sum; | |
1da177e4 | 5020 | |
9e5987a7 | 5021 | trace_xfs_bunmap(ip, bno, len, flags, _RET_IP_); |
1da177e4 | 5022 | |
9e5987a7 DC |
5023 | whichfork = (flags & XFS_BMAPI_ATTRFORK) ? |
5024 | XFS_ATTR_FORK : XFS_DATA_FORK; | |
5025 | ifp = XFS_IFORK_PTR(ip, whichfork); | |
5026 | if (unlikely( | |
5027 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS && | |
5028 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE)) { | |
5029 | XFS_ERROR_REPORT("xfs_bunmapi", XFS_ERRLEVEL_LOW, | |
5030 | ip->i_mount); | |
5031 | return XFS_ERROR(EFSCORRUPTED); | |
1da177e4 | 5032 | } |
9e5987a7 DC |
5033 | mp = ip->i_mount; |
5034 | if (XFS_FORCED_SHUTDOWN(mp)) | |
5035 | return XFS_ERROR(EIO); | |
1da177e4 | 5036 | |
9e5987a7 DC |
5037 | ASSERT(len > 0); |
5038 | ASSERT(nexts >= 0); | |
1da177e4 | 5039 | |
9e5987a7 DC |
5040 | if (!(ifp->if_flags & XFS_IFEXTENTS) && |
5041 | (error = xfs_iread_extents(tp, ip, whichfork))) | |
5042 | return error; | |
5043 | nextents = ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t); | |
5044 | if (nextents == 0) { | |
5045 | *done = 1; | |
5046 | return 0; | |
5047 | } | |
5048 | XFS_STATS_INC(xs_blk_unmap); | |
5049 | isrt = (whichfork == XFS_DATA_FORK) && XFS_IS_REALTIME_INODE(ip); | |
5050 | start = bno; | |
5051 | bno = start + len - 1; | |
5052 | ep = xfs_bmap_search_extents(ip, bno, whichfork, &eof, &lastx, &got, | |
5053 | &prev); | |
1da177e4 | 5054 | |
9e5987a7 DC |
5055 | /* |
5056 | * Check to see if the given block number is past the end of the | |
5057 | * file, back up to the last block if so... | |
5058 | */ | |
5059 | if (eof) { | |
5060 | ep = xfs_iext_get_ext(ifp, --lastx); | |
5061 | xfs_bmbt_get_all(ep, &got); | |
5062 | bno = got.br_startoff + got.br_blockcount - 1; | |
5063 | } | |
5064 | logflags = 0; | |
5065 | if (ifp->if_flags & XFS_IFBROOT) { | |
5066 | ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE); | |
5067 | cur = xfs_bmbt_init_cursor(mp, tp, ip, whichfork); | |
5068 | cur->bc_private.b.firstblock = *firstblock; | |
5069 | cur->bc_private.b.flist = flist; | |
5070 | cur->bc_private.b.flags = 0; | |
5071 | } else | |
5072 | cur = NULL; | |
5073 | ||
5074 | if (isrt) { | |
5075 | /* | |
5076 | * Synchronize by locking the bitmap inode. | |
5077 | */ | |
5078 | xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL); | |
5079 | xfs_trans_ijoin(tp, mp->m_rbmip, XFS_ILOCK_EXCL); | |
5080 | } | |
58e20770 | 5081 | |
9e5987a7 DC |
5082 | extno = 0; |
5083 | while (bno != (xfs_fileoff_t)-1 && bno >= start && lastx >= 0 && | |
5084 | (nexts == 0 || extno < nexts)) { | |
5085 | /* | |
5086 | * Is the found extent after a hole in which bno lives? | |
5087 | * Just back up to the previous extent, if so. | |
5088 | */ | |
5089 | if (got.br_startoff > bno) { | |
5090 | if (--lastx < 0) | |
5091 | break; | |
5092 | ep = xfs_iext_get_ext(ifp, lastx); | |
5093 | xfs_bmbt_get_all(ep, &got); | |
5094 | } | |
5095 | /* | |
5096 | * Is the last block of this extent before the range | |
5097 | * we're supposed to delete? If so, we're done. | |
5098 | */ | |
5099 | bno = XFS_FILEOFF_MIN(bno, | |
5100 | got.br_startoff + got.br_blockcount - 1); | |
5101 | if (bno < start) | |
5102 | break; | |
5103 | /* | |
5104 | * Then deal with the (possibly delayed) allocated space | |
5105 | * we found. | |
5106 | */ | |
5107 | ASSERT(ep != NULL); | |
5108 | del = got; | |
5109 | wasdel = isnullstartblock(del.br_startblock); | |
5110 | if (got.br_startoff < start) { | |
5111 | del.br_startoff = start; | |
5112 | del.br_blockcount -= start - got.br_startoff; | |
5113 | if (!wasdel) | |
5114 | del.br_startblock += start - got.br_startoff; | |
5115 | } | |
5116 | if (del.br_startoff + del.br_blockcount > bno + 1) | |
5117 | del.br_blockcount = bno + 1 - del.br_startoff; | |
5118 | sum = del.br_startblock + del.br_blockcount; | |
5119 | if (isrt && | |
5120 | (mod = do_mod(sum, mp->m_sb.sb_rextsize))) { | |
58e20770 | 5121 | /* |
9e5987a7 DC |
5122 | * Realtime extent not lined up at the end. |
5123 | * The extent could have been split into written | |
5124 | * and unwritten pieces, or we could just be | |
5125 | * unmapping part of it. But we can't really | |
5126 | * get rid of part of a realtime extent. | |
58e20770 | 5127 | */ |
9e5987a7 DC |
5128 | if (del.br_state == XFS_EXT_UNWRITTEN || |
5129 | !xfs_sb_version_hasextflgbit(&mp->m_sb)) { | |
5130 | /* | |
5131 | * This piece is unwritten, or we're not | |
5132 | * using unwritten extents. Skip over it. | |
5133 | */ | |
5134 | ASSERT(bno >= mod); | |
5135 | bno -= mod > del.br_blockcount ? | |
5136 | del.br_blockcount : mod; | |
5137 | if (bno < got.br_startoff) { | |
5138 | if (--lastx >= 0) | |
5139 | xfs_bmbt_get_all(xfs_iext_get_ext( | |
5140 | ifp, lastx), &got); | |
5141 | } | |
5142 | continue; | |
1da177e4 | 5143 | } |
9af25465 | 5144 | /* |
9e5987a7 DC |
5145 | * It's written, turn it unwritten. |
5146 | * This is better than zeroing it. | |
9af25465 | 5147 | */ |
9e5987a7 DC |
5148 | ASSERT(del.br_state == XFS_EXT_NORM); |
5149 | ASSERT(xfs_trans_get_block_res(tp) > 0); | |
5150 | /* | |
5151 | * If this spans a realtime extent boundary, | |
5152 | * chop it back to the start of the one we end at. | |
5153 | */ | |
5154 | if (del.br_blockcount > mod) { | |
5155 | del.br_startoff += del.br_blockcount - mod; | |
5156 | del.br_startblock += del.br_blockcount - mod; | |
5157 | del.br_blockcount = mod; | |
5158 | } | |
5159 | del.br_state = XFS_EXT_UNWRITTEN; | |
5160 | error = xfs_bmap_add_extent_unwritten_real(tp, ip, | |
5161 | &lastx, &cur, &del, firstblock, flist, | |
5162 | &logflags); | |
5163 | if (error) | |
5164 | goto error0; | |
5165 | goto nodelete; | |
5166 | } | |
5167 | if (isrt && (mod = do_mod(del.br_startblock, mp->m_sb.sb_rextsize))) { | |
5168 | /* | |
5169 | * Realtime extent is lined up at the end but not | |
5170 | * at the front. We'll get rid of full extents if | |
5171 | * we can. | |
5172 | */ | |
5173 | mod = mp->m_sb.sb_rextsize - mod; | |
5174 | if (del.br_blockcount > mod) { | |
5175 | del.br_blockcount -= mod; | |
5176 | del.br_startoff += mod; | |
5177 | del.br_startblock += mod; | |
5178 | } else if ((del.br_startoff == start && | |
5179 | (del.br_state == XFS_EXT_UNWRITTEN || | |
5180 | xfs_trans_get_block_res(tp) == 0)) || | |
5181 | !xfs_sb_version_hasextflgbit(&mp->m_sb)) { | |
5182 | /* | |
5183 | * Can't make it unwritten. There isn't | |
5184 | * a full extent here so just skip it. | |
5185 | */ | |
5186 | ASSERT(bno >= del.br_blockcount); | |
5187 | bno -= del.br_blockcount; | |
5188 | if (got.br_startoff > bno) { | |
5189 | if (--lastx >= 0) { | |
5190 | ep = xfs_iext_get_ext(ifp, | |
5191 | lastx); | |
5192 | xfs_bmbt_get_all(ep, &got); | |
5193 | } | |
5194 | } | |
9af25465 | 5195 | continue; |
9e5987a7 DC |
5196 | } else if (del.br_state == XFS_EXT_UNWRITTEN) { |
5197 | /* | |
5198 | * This one is already unwritten. | |
5199 | * It must have a written left neighbor. | |
5200 | * Unwrite the killed part of that one and | |
5201 | * try again. | |
5202 | */ | |
5203 | ASSERT(lastx > 0); | |
5204 | xfs_bmbt_get_all(xfs_iext_get_ext(ifp, | |
5205 | lastx - 1), &prev); | |
5206 | ASSERT(prev.br_state == XFS_EXT_NORM); | |
5207 | ASSERT(!isnullstartblock(prev.br_startblock)); | |
5208 | ASSERT(del.br_startblock == | |
5209 | prev.br_startblock + prev.br_blockcount); | |
5210 | if (prev.br_startoff < start) { | |
5211 | mod = start - prev.br_startoff; | |
5212 | prev.br_blockcount -= mod; | |
5213 | prev.br_startblock += mod; | |
5214 | prev.br_startoff = start; | |
5215 | } | |
5216 | prev.br_state = XFS_EXT_UNWRITTEN; | |
5217 | lastx--; | |
5218 | error = xfs_bmap_add_extent_unwritten_real(tp, | |
5219 | ip, &lastx, &cur, &prev, | |
5220 | firstblock, flist, &logflags); | |
5221 | if (error) | |
5222 | goto error0; | |
5223 | goto nodelete; | |
5224 | } else { | |
5225 | ASSERT(del.br_state == XFS_EXT_NORM); | |
5226 | del.br_state = XFS_EXT_UNWRITTEN; | |
5227 | error = xfs_bmap_add_extent_unwritten_real(tp, | |
5228 | ip, &lastx, &cur, &del, | |
5229 | firstblock, flist, &logflags); | |
5230 | if (error) | |
5231 | goto error0; | |
5232 | goto nodelete; | |
9af25465 | 5233 | } |
1da177e4 | 5234 | } |
9e5987a7 DC |
5235 | if (wasdel) { |
5236 | ASSERT(startblockval(del.br_startblock) > 0); | |
5237 | /* Update realtime/data freespace, unreserve quota */ | |
5238 | if (isrt) { | |
5239 | xfs_filblks_t rtexts; | |
1da177e4 | 5240 | |
9e5987a7 DC |
5241 | rtexts = XFS_FSB_TO_B(mp, del.br_blockcount); |
5242 | do_div(rtexts, mp->m_sb.sb_rextsize); | |
5243 | xfs_mod_incore_sb(mp, XFS_SBS_FREXTENTS, | |
5244 | (int64_t)rtexts, 0); | |
5245 | (void)xfs_trans_reserve_quota_nblks(NULL, | |
5246 | ip, -((long)del.br_blockcount), 0, | |
5247 | XFS_QMOPT_RES_RTBLKS); | |
5248 | } else { | |
5249 | xfs_icsb_modify_counters(mp, XFS_SBS_FDBLOCKS, | |
5250 | (int64_t)del.br_blockcount, 0); | |
5251 | (void)xfs_trans_reserve_quota_nblks(NULL, | |
5252 | ip, -((long)del.br_blockcount), 0, | |
5253 | XFS_QMOPT_RES_REGBLKS); | |
5254 | } | |
5255 | ip->i_delayed_blks -= del.br_blockcount; | |
5256 | if (cur) | |
5257 | cur->bc_private.b.flags |= | |
5258 | XFS_BTCUR_BPRV_WASDEL; | |
5259 | } else if (cur) | |
5260 | cur->bc_private.b.flags &= ~XFS_BTCUR_BPRV_WASDEL; | |
5261 | /* | |
5262 | * If it's the case where the directory code is running | |
5263 | * with no block reservation, and the deleted block is in | |
5264 | * the middle of its extent, and the resulting insert | |
5265 | * of an extent would cause transformation to btree format, | |
5266 | * then reject it. The calling code will then swap | |
5267 | * blocks around instead. | |
5268 | * We have to do this now, rather than waiting for the | |
5269 | * conversion to btree format, since the transaction | |
5270 | * will be dirty. | |
5271 | */ | |
5272 | if (!wasdel && xfs_trans_get_block_res(tp) == 0 && | |
5273 | XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS && | |
5274 | XFS_IFORK_NEXTENTS(ip, whichfork) >= /* Note the >= */ | |
5275 | XFS_IFORK_MAXEXT(ip, whichfork) && | |
5276 | del.br_startoff > got.br_startoff && | |
5277 | del.br_startoff + del.br_blockcount < | |
5278 | got.br_startoff + got.br_blockcount) { | |
5279 | error = XFS_ERROR(ENOSPC); | |
5280 | goto error0; | |
1da177e4 | 5281 | } |
9e5987a7 DC |
5282 | error = xfs_bmap_del_extent(ip, tp, &lastx, flist, cur, &del, |
5283 | &tmp_logflags, whichfork); | |
5284 | logflags |= tmp_logflags; | |
5285 | if (error) | |
5286 | goto error0; | |
5287 | bno = del.br_startoff - 1; | |
5288 | nodelete: | |
1da177e4 | 5289 | /* |
9e5987a7 | 5290 | * If not done go on to the next (previous) record. |
1da177e4 | 5291 | */ |
9e5987a7 DC |
5292 | if (bno != (xfs_fileoff_t)-1 && bno >= start) { |
5293 | if (lastx >= 0) { | |
5294 | ep = xfs_iext_get_ext(ifp, lastx); | |
5295 | if (xfs_bmbt_get_startoff(ep) > bno) { | |
5296 | if (--lastx >= 0) | |
5297 | ep = xfs_iext_get_ext(ifp, | |
5298 | lastx); | |
5299 | } | |
5300 | xfs_bmbt_get_all(ep, &got); | |
1da177e4 | 5301 | } |
9e5987a7 | 5302 | extno++; |
1da177e4 LT |
5303 | } |
5304 | } | |
9e5987a7 | 5305 | *done = bno == (xfs_fileoff_t)-1 || bno < start || lastx < 0; |
576039cf | 5306 | |
1da177e4 | 5307 | /* |
9e5987a7 | 5308 | * Convert to a btree if necessary. |
1da177e4 | 5309 | */ |
9e5987a7 DC |
5310 | if (xfs_bmap_needs_btree(ip, whichfork)) { |
5311 | ASSERT(cur == NULL); | |
5312 | error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist, | |
5313 | &cur, 0, &tmp_logflags, whichfork); | |
5314 | logflags |= tmp_logflags; | |
5315 | if (error) | |
5316 | goto error0; | |
1da177e4 | 5317 | } |
1da177e4 | 5318 | /* |
9e5987a7 | 5319 | * transform from btree to extents, give it cur |
1da177e4 | 5320 | */ |
9e5987a7 DC |
5321 | else if (xfs_bmap_wants_extents(ip, whichfork)) { |
5322 | ASSERT(cur != NULL); | |
5323 | error = xfs_bmap_btree_to_extents(tp, ip, cur, &tmp_logflags, | |
5324 | whichfork); | |
5325 | logflags |= tmp_logflags; | |
5326 | if (error) | |
5327 | goto error0; | |
5328 | } | |
1da177e4 | 5329 | /* |
9e5987a7 | 5330 | * transform from extents to local? |
1da177e4 | 5331 | */ |
9e5987a7 DC |
5332 | error = 0; |
5333 | error0: | |
5334 | /* | |
5335 | * Log everything. Do this after conversion, there's no point in | |
5336 | * logging the extent records if we've converted to btree format. | |
5337 | */ | |
5338 | if ((logflags & xfs_ilog_fext(whichfork)) && | |
5339 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_EXTENTS) | |
5340 | logflags &= ~xfs_ilog_fext(whichfork); | |
5341 | else if ((logflags & xfs_ilog_fbroot(whichfork)) && | |
5342 | XFS_IFORK_FORMAT(ip, whichfork) != XFS_DINODE_FMT_BTREE) | |
5343 | logflags &= ~xfs_ilog_fbroot(whichfork); | |
5344 | /* | |
5345 | * Log inode even in the error case, if the transaction | |
5346 | * is dirty we'll need to shut down the filesystem. | |
5347 | */ | |
5348 | if (logflags) | |
5349 | xfs_trans_log_inode(tp, ip, logflags); | |
5350 | if (cur) { | |
5351 | if (!error) { | |
5352 | *firstblock = cur->bc_private.b.firstblock; | |
5353 | cur->bc_private.b.allocated = 0; | |
5354 | } | |
5355 | xfs_btree_del_cursor(cur, | |
5356 | error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR); | |
5357 | } | |
5358 | return error; | |
5359 | } |