xfs: move allocation stack switch up to xfs_bmapi_allocate
[~shefty/rdma-dev.git] / fs / xfs / xfs_bmap.c
1 /*
2  * Copyright (c) 2000-2006 Silicon Graphics, Inc.
3  * All Rights Reserved.
4  *
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
7  * published by the Free Software Foundation.
8  *
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.
13  *
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
17  */
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_bit.h"
22 #include "xfs_log.h"
23 #include "xfs_inum.h"
24 #include "xfs_trans.h"
25 #include "xfs_sb.h"
26 #include "xfs_ag.h"
27 #include "xfs_dir2.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_alloc_btree.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_dinode.h"
33 #include "xfs_inode.h"
34 #include "xfs_btree.h"
35 #include "xfs_mount.h"
36 #include "xfs_itable.h"
37 #include "xfs_inode_item.h"
38 #include "xfs_extfree_item.h"
39 #include "xfs_alloc.h"
40 #include "xfs_bmap.h"
41 #include "xfs_rtalloc.h"
42 #include "xfs_error.h"
43 #include "xfs_attr_leaf.h"
44 #include "xfs_quota.h"
45 #include "xfs_trans_space.h"
46 #include "xfs_buf_item.h"
47 #include "xfs_filestream.h"
48 #include "xfs_vnodeops.h"
49 #include "xfs_trace.h"
50
51
52 kmem_zone_t             *xfs_bmap_free_item_zone;
53
54 /*
55  * Prototypes for internal bmap routines.
56  */
57
58 #ifdef DEBUG
59 STATIC void
60 xfs_bmap_check_leaf_extents(
61         struct xfs_btree_cur    *cur,
62         struct xfs_inode        *ip,
63         int                     whichfork);
64 #else
65 #define xfs_bmap_check_leaf_extents(cur, ip, whichfork)         do { } while (0)
66 #endif
67
68
69 /*
70  * Called from xfs_bmap_add_attrfork to handle extents format files.
71  */
72 STATIC int                                      /* error */
73 xfs_bmap_add_attrfork_extents(
74         xfs_trans_t             *tp,            /* transaction pointer */
75         xfs_inode_t             *ip,            /* incore inode pointer */
76         xfs_fsblock_t           *firstblock,    /* first block allocated */
77         xfs_bmap_free_t         *flist,         /* blocks to free at commit */
78         int                     *flags);        /* inode logging flags */
79
80 /*
81  * Called from xfs_bmap_add_attrfork to handle local format files.
82  */
83 STATIC int                                      /* error */
84 xfs_bmap_add_attrfork_local(
85         xfs_trans_t             *tp,            /* transaction pointer */
86         xfs_inode_t             *ip,            /* incore inode pointer */
87         xfs_fsblock_t           *firstblock,    /* first block allocated */
88         xfs_bmap_free_t         *flist,         /* blocks to free at commit */
89         int                     *flags);        /* inode logging flags */
90
91 /*
92  * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
93  * It figures out where to ask the underlying allocator to put the new extent.
94  */
95 STATIC int                              /* error */
96 xfs_bmap_alloc(
97         xfs_bmalloca_t          *ap);   /* bmap alloc argument struct */
98
99 /*
100  * Transform a btree format file with only one leaf node, where the
101  * extents list will fit in the inode, into an extents format file.
102  * Since the file extents are already in-core, all we have to do is
103  * give up the space for the btree root and pitch the leaf block.
104  */
105 STATIC int                              /* error */
106 xfs_bmap_btree_to_extents(
107         xfs_trans_t             *tp,    /* transaction pointer */
108         xfs_inode_t             *ip,    /* incore inode pointer */
109         xfs_btree_cur_t         *cur,   /* btree cursor */
110         int                     *logflagsp, /* inode logging flags */
111         int                     whichfork); /* data or attr fork */
112
113 /*
114  * Remove the entry "free" from the free item list.  Prev points to the
115  * previous entry, unless "free" is the head of the list.
116  */
117 STATIC void
118 xfs_bmap_del_free(
119         xfs_bmap_free_t         *flist, /* free item list header */
120         xfs_bmap_free_item_t    *prev,  /* previous item on list, if any */
121         xfs_bmap_free_item_t    *free); /* list item to be freed */
122
123 /*
124  * Convert an extents-format file into a btree-format file.
125  * The new file will have a root block (in the inode) and a single child block.
126  */
127 STATIC int                                      /* error */
128 xfs_bmap_extents_to_btree(
129         xfs_trans_t             *tp,            /* transaction pointer */
130         xfs_inode_t             *ip,            /* incore inode pointer */
131         xfs_fsblock_t           *firstblock,    /* first-block-allocated */
132         xfs_bmap_free_t         *flist,         /* blocks freed in xaction */
133         xfs_btree_cur_t         **curp,         /* cursor returned to caller */
134         int                     wasdel,         /* converting a delayed alloc */
135         int                     *logflagsp,     /* inode logging flags */
136         int                     whichfork);     /* data or attr fork */
137
138 /*
139  * Convert a local file to an extents file.
140  * This code is sort of bogus, since the file data needs to get
141  * logged so it won't be lost.  The bmap-level manipulations are ok, though.
142  */
143 STATIC int                              /* error */
144 xfs_bmap_local_to_extents(
145         xfs_trans_t     *tp,            /* transaction pointer */
146         xfs_inode_t     *ip,            /* incore inode pointer */
147         xfs_fsblock_t   *firstblock,    /* first block allocated in xaction */
148         xfs_extlen_t    total,          /* total blocks needed by transaction */
149         int             *logflagsp,     /* inode logging flags */
150         int             whichfork);     /* data or attr fork */
151
152 /*
153  * Search the extents list for the inode, for the extent containing bno.
154  * If bno lies in a hole, point to the next entry.  If bno lies past eof,
155  * *eofp will be set, and *prevp will contain the last entry (null if none).
156  * Else, *lastxp will be set to the index of the found
157  * entry; *gotp will contain the entry.
158  */
159 STATIC xfs_bmbt_rec_host_t *            /* pointer to found extent entry */
160 xfs_bmap_search_extents(
161         xfs_inode_t     *ip,            /* incore inode pointer */
162         xfs_fileoff_t   bno,            /* block number searched for */
163         int             whichfork,      /* data or attr fork */
164         int             *eofp,          /* out: end of file found */
165         xfs_extnum_t    *lastxp,        /* out: last extent index */
166         xfs_bmbt_irec_t *gotp,          /* out: extent entry found */
167         xfs_bmbt_irec_t *prevp);        /* out: previous extent entry found */
168
169 /*
170  * Compute the worst-case number of indirect blocks that will be used
171  * for ip's delayed extent of length "len".
172  */
173 STATIC xfs_filblks_t
174 xfs_bmap_worst_indlen(
175         xfs_inode_t             *ip,    /* incore inode pointer */
176         xfs_filblks_t           len);   /* delayed extent length */
177
178 #ifdef DEBUG
179 /*
180  * Perform various validation checks on the values being returned
181  * from xfs_bmapi().
182  */
183 STATIC void
184 xfs_bmap_validate_ret(
185         xfs_fileoff_t           bno,
186         xfs_filblks_t           len,
187         int                     flags,
188         xfs_bmbt_irec_t         *mval,
189         int                     nmap,
190         int                     ret_nmap);
191 #else
192 #define xfs_bmap_validate_ret(bno,len,flags,mval,onmap,nmap)
193 #endif /* DEBUG */
194
195 STATIC int
196 xfs_bmap_count_tree(
197         xfs_mount_t     *mp,
198         xfs_trans_t     *tp,
199         xfs_ifork_t     *ifp,
200         xfs_fsblock_t   blockno,
201         int             levelin,
202         int             *count);
203
204 STATIC void
205 xfs_bmap_count_leaves(
206         xfs_ifork_t             *ifp,
207         xfs_extnum_t            idx,
208         int                     numrecs,
209         int                     *count);
210
211 STATIC void
212 xfs_bmap_disk_count_leaves(
213         struct xfs_mount        *mp,
214         struct xfs_btree_block  *block,
215         int                     numrecs,
216         int                     *count);
217
218 /*
219  * Bmap internal routines.
220  */
221
222 STATIC int                              /* error */
223 xfs_bmbt_lookup_eq(
224         struct xfs_btree_cur    *cur,
225         xfs_fileoff_t           off,
226         xfs_fsblock_t           bno,
227         xfs_filblks_t           len,
228         int                     *stat)  /* success/failure */
229 {
230         cur->bc_rec.b.br_startoff = off;
231         cur->bc_rec.b.br_startblock = bno;
232         cur->bc_rec.b.br_blockcount = len;
233         return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
234 }
235
236 STATIC int                              /* error */
237 xfs_bmbt_lookup_ge(
238         struct xfs_btree_cur    *cur,
239         xfs_fileoff_t           off,
240         xfs_fsblock_t           bno,
241         xfs_filblks_t           len,
242         int                     *stat)  /* success/failure */
243 {
244         cur->bc_rec.b.br_startoff = off;
245         cur->bc_rec.b.br_startblock = bno;
246         cur->bc_rec.b.br_blockcount = len;
247         return xfs_btree_lookup(cur, XFS_LOOKUP_GE, stat);
248 }
249
250 /*
251  * Check if the inode needs to be converted to btree format.
252  */
253 static inline bool xfs_bmap_needs_btree(struct xfs_inode *ip, int whichfork)
254 {
255         return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_EXTENTS &&
256                 XFS_IFORK_NEXTENTS(ip, whichfork) >
257                         XFS_IFORK_MAXEXT(ip, whichfork);
258 }
259
260 /*
261  * Check if the inode should be converted to extent format.
262  */
263 static inline bool xfs_bmap_wants_extents(struct xfs_inode *ip, int whichfork)
264 {
265         return XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE &&
266                 XFS_IFORK_NEXTENTS(ip, whichfork) <=
267                         XFS_IFORK_MAXEXT(ip, whichfork);
268 }
269
270 /*
271  * Update the record referred to by cur to the value given
272  * by [off, bno, len, state].
273  * This either works (return 0) or gets an EFSCORRUPTED error.
274  */
275 STATIC int
276 xfs_bmbt_update(
277         struct xfs_btree_cur    *cur,
278         xfs_fileoff_t           off,
279         xfs_fsblock_t           bno,
280         xfs_filblks_t           len,
281         xfs_exntst_t            state)
282 {
283         union xfs_btree_rec     rec;
284
285         xfs_bmbt_disk_set_allf(&rec.bmbt, off, bno, len, state);
286         return xfs_btree_update(cur, &rec);
287 }
288
289 /*
290  * Called from xfs_bmap_add_attrfork to handle btree format files.
291  */
292 STATIC int                                      /* error */
293 xfs_bmap_add_attrfork_btree(
294         xfs_trans_t             *tp,            /* transaction pointer */
295         xfs_inode_t             *ip,            /* incore inode pointer */
296         xfs_fsblock_t           *firstblock,    /* first block allocated */
297         xfs_bmap_free_t         *flist,         /* blocks to free at commit */
298         int                     *flags)         /* inode logging flags */
299 {
300         xfs_btree_cur_t         *cur;           /* btree cursor */
301         int                     error;          /* error return value */
302         xfs_mount_t             *mp;            /* file system mount struct */
303         int                     stat;           /* newroot status */
304
305         mp = ip->i_mount;
306         if (ip->i_df.if_broot_bytes <= XFS_IFORK_DSIZE(ip))
307                 *flags |= XFS_ILOG_DBROOT;
308         else {
309                 cur = xfs_bmbt_init_cursor(mp, tp, ip, XFS_DATA_FORK);
310                 cur->bc_private.b.flist = flist;
311                 cur->bc_private.b.firstblock = *firstblock;
312                 if ((error = xfs_bmbt_lookup_ge(cur, 0, 0, 0, &stat)))
313                         goto error0;
314                 /* must be at least one entry */
315                 XFS_WANT_CORRUPTED_GOTO(stat == 1, error0);
316                 if ((error = xfs_btree_new_iroot(cur, flags, &stat)))
317                         goto error0;
318                 if (stat == 0) {
319                         xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
320                         return XFS_ERROR(ENOSPC);
321                 }
322                 *firstblock = cur->bc_private.b.firstblock;
323                 cur->bc_private.b.allocated = 0;
324                 xfs_btree_del_cursor(cur, XFS_BTREE_NOERROR);
325         }
326         return 0;
327 error0:
328         xfs_btree_del_cursor(cur, XFS_BTREE_ERROR);
329         return error;
330 }
331
332 /*
333  * Called from xfs_bmap_add_attrfork to handle extents format files.
334  */
335 STATIC int                                      /* error */
336 xfs_bmap_add_attrfork_extents(
337         xfs_trans_t             *tp,            /* transaction pointer */
338         xfs_inode_t             *ip,            /* incore inode pointer */
339         xfs_fsblock_t           *firstblock,    /* first block allocated */
340         xfs_bmap_free_t         *flist,         /* blocks to free at commit */
341         int                     *flags)         /* inode logging flags */
342 {
343         xfs_btree_cur_t         *cur;           /* bmap btree cursor */
344         int                     error;          /* error return value */
345
346         if (ip->i_d.di_nextents * sizeof(xfs_bmbt_rec_t) <= XFS_IFORK_DSIZE(ip))
347                 return 0;
348         cur = NULL;
349         error = xfs_bmap_extents_to_btree(tp, ip, firstblock, flist, &cur, 0,
350                 flags, XFS_DATA_FORK);
351         if (cur) {
352                 cur->bc_private.b.allocated = 0;
353                 xfs_btree_del_cursor(cur,
354                         error ? XFS_BTREE_ERROR : XFS_BTREE_NOERROR);
355         }
356         return error;
357 }
358
359 /*
360  * Called from xfs_bmap_add_attrfork to handle local format files.
361  */
362 STATIC int                                      /* error */
363 xfs_bmap_add_attrfork_local(
364         xfs_trans_t             *tp,            /* transaction pointer */
365         xfs_inode_t             *ip,            /* incore inode pointer */
366         xfs_fsblock_t           *firstblock,    /* first block allocated */
367         xfs_bmap_free_t         *flist,         /* blocks to free at commit */
368         int                     *flags)         /* inode logging flags */
369 {
370         xfs_da_args_t           dargs;          /* args for dir/attr code */
371         int                     error;          /* error return value */
372         xfs_mount_t             *mp;            /* mount structure pointer */
373
374         if (ip->i_df.if_bytes <= XFS_IFORK_DSIZE(ip))
375                 return 0;
376         if (S_ISDIR(ip->i_d.di_mode)) {
377                 mp = ip->i_mount;
378                 memset(&dargs, 0, sizeof(dargs));
379                 dargs.dp = ip;
380                 dargs.firstblock = firstblock;
381                 dargs.flist = flist;
382                 dargs.total = mp->m_dirblkfsbs;
383                 dargs.whichfork = XFS_DATA_FORK;
384                 dargs.trans = tp;
385                 error = xfs_dir2_sf_to_block(&dargs);
386         } else
387                 error = xfs_bmap_local_to_extents(tp, ip, firstblock, 1, flags,
388                         XFS_DATA_FORK);
389         return error;
390 }
391
392 /*
393  * Convert a delayed allocation to a real allocation.
394  */
395 STATIC int                              /* error */
396 xfs_bmap_add_extent_delay_real(
397         struct xfs_bmalloca     *bma)
398 {
399         struct xfs_bmbt_irec    *new = &bma->got;
400         int                     diff;   /* temp value */
401         xfs_bmbt_rec_host_t     *ep;    /* extent entry for idx */
402         int                     error;  /* error return value */
403         int                     i;      /* temp state */
404         xfs_ifork_t             *ifp;   /* inode fork pointer */
405         xfs_fileoff_t           new_endoff;     /* end offset of new entry */
406         xfs_bmbt_irec_t         r[3];   /* neighbor extent entries */
407                                         /* left is 0, right is 1, prev is 2 */
408         int                     rval=0; /* return value (logging flags) */
409         int                     state = 0;/* state bits, accessed thru macros */
410         xfs_filblks_t           da_new; /* new count del alloc blocks used */
411         xfs_filblks_t           da_old; /* old count del alloc blocks used */
412         xfs_filblks_t           temp=0; /* value for da_new calculations */
413         xfs_filblks_t           temp2=0;/* value for da_new calculations */
414         int                     tmp_rval;       /* partial logging flags */
415
416         ifp = XFS_IFORK_PTR(bma->ip, XFS_DATA_FORK);
417
418         ASSERT(bma->idx >= 0);
419         ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
420         ASSERT(!isnullstartblock(new->br_startblock));
421         ASSERT(!bma->cur ||
422                (bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
423
424         XFS_STATS_INC(xs_add_exlist);
425
426 #define LEFT            r[0]
427 #define RIGHT           r[1]
428 #define PREV            r[2]
429
430         /*
431          * Set up a bunch of variables to make the tests simpler.
432          */
433         ep = xfs_iext_get_ext(ifp, bma->idx);
434         xfs_bmbt_get_all(ep, &PREV);
435         new_endoff = new->br_startoff + new->br_blockcount;
436         ASSERT(PREV.br_startoff <= new->br_startoff);
437         ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
438
439         da_old = startblockval(PREV.br_startblock);
440         da_new = 0;
441
442         /*
443          * Set flags determining what part of the previous delayed allocation
444          * extent is being replaced by a real allocation.
445          */
446         if (PREV.br_startoff == new->br_startoff)
447                 state |= BMAP_LEFT_FILLING;
448         if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
449                 state |= BMAP_RIGHT_FILLING;
450
451         /*
452          * Check and set flags if this segment has a left neighbor.
453          * Don't set contiguous if the combined extent would be too large.
454          */
455         if (bma->idx > 0) {
456                 state |= BMAP_LEFT_VALID;
457                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &LEFT);
458
459                 if (isnullstartblock(LEFT.br_startblock))
460                         state |= BMAP_LEFT_DELAY;
461         }
462
463         if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
464             LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
465             LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
466             LEFT.br_state == new->br_state &&
467             LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
468                 state |= BMAP_LEFT_CONTIG;
469
470         /*
471          * Check and set flags if this segment has a right neighbor.
472          * Don't set contiguous if the combined extent would be too large.
473          * Also check for all-three-contiguous being too large.
474          */
475         if (bma->idx < bma->ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
476                 state |= BMAP_RIGHT_VALID;
477                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx + 1), &RIGHT);
478
479                 if (isnullstartblock(RIGHT.br_startblock))
480                         state |= BMAP_RIGHT_DELAY;
481         }
482
483         if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
484             new_endoff == RIGHT.br_startoff &&
485             new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
486             new->br_state == RIGHT.br_state &&
487             new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
488             ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
489                        BMAP_RIGHT_FILLING)) !=
490                       (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
491                        BMAP_RIGHT_FILLING) ||
492              LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
493                         <= MAXEXTLEN))
494                 state |= BMAP_RIGHT_CONTIG;
495
496         error = 0;
497         /*
498          * Switch out based on the FILLING and CONTIG state bits.
499          */
500         switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
501                          BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
502         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
503              BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
504                 /*
505                  * Filling in all of a previously delayed allocation extent.
506                  * The left and right neighbors are both contiguous with new.
507                  */
508                 bma->idx--;
509                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
510                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
511                         LEFT.br_blockcount + PREV.br_blockcount +
512                         RIGHT.br_blockcount);
513                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
514
515                 xfs_iext_remove(bma->ip, bma->idx + 1, 2, state);
516                 bma->ip->i_d.di_nextents--;
517                 if (bma->cur == NULL)
518                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
519                 else {
520                         rval = XFS_ILOG_CORE;
521                         error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
522                                         RIGHT.br_startblock,
523                                         RIGHT.br_blockcount, &i);
524                         if (error)
525                                 goto done;
526                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
527                         error = xfs_btree_delete(bma->cur, &i);
528                         if (error)
529                                 goto done;
530                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
531                         error = xfs_btree_decrement(bma->cur, 0, &i);
532                         if (error)
533                                 goto done;
534                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
535                         error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
536                                         LEFT.br_startblock,
537                                         LEFT.br_blockcount +
538                                         PREV.br_blockcount +
539                                         RIGHT.br_blockcount, LEFT.br_state);
540                         if (error)
541                                 goto done;
542                 }
543                 break;
544
545         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
546                 /*
547                  * Filling in all of a previously delayed allocation extent.
548                  * The left neighbor is contiguous, the right is not.
549                  */
550                 bma->idx--;
551
552                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
553                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
554                         LEFT.br_blockcount + PREV.br_blockcount);
555                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
556
557                 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
558                 if (bma->cur == NULL)
559                         rval = XFS_ILOG_DEXT;
560                 else {
561                         rval = 0;
562                         error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
563                                         LEFT.br_startblock, LEFT.br_blockcount,
564                                         &i);
565                         if (error)
566                                 goto done;
567                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
568                         error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
569                                         LEFT.br_startblock,
570                                         LEFT.br_blockcount +
571                                         PREV.br_blockcount, LEFT.br_state);
572                         if (error)
573                                 goto done;
574                 }
575                 break;
576
577         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
578                 /*
579                  * Filling in all of a previously delayed allocation extent.
580                  * The right neighbor is contiguous, the left is not.
581                  */
582                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
583                 xfs_bmbt_set_startblock(ep, new->br_startblock);
584                 xfs_bmbt_set_blockcount(ep,
585                         PREV.br_blockcount + RIGHT.br_blockcount);
586                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
587
588                 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
589                 if (bma->cur == NULL)
590                         rval = XFS_ILOG_DEXT;
591                 else {
592                         rval = 0;
593                         error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
594                                         RIGHT.br_startblock,
595                                         RIGHT.br_blockcount, &i);
596                         if (error)
597                                 goto done;
598                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
599                         error = xfs_bmbt_update(bma->cur, PREV.br_startoff,
600                                         new->br_startblock,
601                                         PREV.br_blockcount +
602                                         RIGHT.br_blockcount, PREV.br_state);
603                         if (error)
604                                 goto done;
605                 }
606                 break;
607
608         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
609                 /*
610                  * Filling in all of a previously delayed allocation extent.
611                  * Neither the left nor right neighbors are contiguous with
612                  * the new one.
613                  */
614                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
615                 xfs_bmbt_set_startblock(ep, new->br_startblock);
616                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
617
618                 bma->ip->i_d.di_nextents++;
619                 if (bma->cur == NULL)
620                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
621                 else {
622                         rval = XFS_ILOG_CORE;
623                         error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
624                                         new->br_startblock, new->br_blockcount,
625                                         &i);
626                         if (error)
627                                 goto done;
628                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
629                         bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
630                         error = xfs_btree_insert(bma->cur, &i);
631                         if (error)
632                                 goto done;
633                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
634                 }
635                 break;
636
637         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
638                 /*
639                  * Filling in the first part of a previous delayed allocation.
640                  * The left neighbor is contiguous.
641                  */
642                 trace_xfs_bmap_pre_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
643                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx - 1),
644                         LEFT.br_blockcount + new->br_blockcount);
645                 xfs_bmbt_set_startoff(ep,
646                         PREV.br_startoff + new->br_blockcount);
647                 trace_xfs_bmap_post_update(bma->ip, bma->idx - 1, state, _THIS_IP_);
648
649                 temp = PREV.br_blockcount - new->br_blockcount;
650                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
651                 xfs_bmbt_set_blockcount(ep, temp);
652                 if (bma->cur == NULL)
653                         rval = XFS_ILOG_DEXT;
654                 else {
655                         rval = 0;
656                         error = xfs_bmbt_lookup_eq(bma->cur, LEFT.br_startoff,
657                                         LEFT.br_startblock, LEFT.br_blockcount,
658                                         &i);
659                         if (error)
660                                 goto done;
661                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
662                         error = xfs_bmbt_update(bma->cur, LEFT.br_startoff,
663                                         LEFT.br_startblock,
664                                         LEFT.br_blockcount +
665                                         new->br_blockcount,
666                                         LEFT.br_state);
667                         if (error)
668                                 goto done;
669                 }
670                 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
671                         startblockval(PREV.br_startblock));
672                 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
673                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
674
675                 bma->idx--;
676                 break;
677
678         case BMAP_LEFT_FILLING:
679                 /*
680                  * Filling in the first part of a previous delayed allocation.
681                  * The left neighbor is not contiguous.
682                  */
683                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
684                 xfs_bmbt_set_startoff(ep, new_endoff);
685                 temp = PREV.br_blockcount - new->br_blockcount;
686                 xfs_bmbt_set_blockcount(ep, temp);
687                 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
688                 bma->ip->i_d.di_nextents++;
689                 if (bma->cur == NULL)
690                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
691                 else {
692                         rval = XFS_ILOG_CORE;
693                         error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
694                                         new->br_startblock, new->br_blockcount,
695                                         &i);
696                         if (error)
697                                 goto done;
698                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
699                         bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
700                         error = xfs_btree_insert(bma->cur, &i);
701                         if (error)
702                                 goto done;
703                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
704                 }
705
706                 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
707                         error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
708                                         bma->firstblock, bma->flist,
709                                         &bma->cur, 1, &tmp_rval, XFS_DATA_FORK);
710                         rval |= tmp_rval;
711                         if (error)
712                                 goto done;
713                 }
714                 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
715                         startblockval(PREV.br_startblock) -
716                         (bma->cur ? bma->cur->bc_private.b.allocated : 0));
717                 ep = xfs_iext_get_ext(ifp, bma->idx + 1);
718                 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
719                 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
720                 break;
721
722         case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
723                 /*
724                  * Filling in the last part of a previous delayed allocation.
725                  * The right neighbor is contiguous with the new allocation.
726                  */
727                 temp = PREV.br_blockcount - new->br_blockcount;
728                 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
729                 xfs_bmbt_set_blockcount(ep, temp);
730                 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx + 1),
731                         new->br_startoff, new->br_startblock,
732                         new->br_blockcount + RIGHT.br_blockcount,
733                         RIGHT.br_state);
734                 trace_xfs_bmap_post_update(bma->ip, bma->idx + 1, state, _THIS_IP_);
735                 if (bma->cur == NULL)
736                         rval = XFS_ILOG_DEXT;
737                 else {
738                         rval = 0;
739                         error = xfs_bmbt_lookup_eq(bma->cur, RIGHT.br_startoff,
740                                         RIGHT.br_startblock,
741                                         RIGHT.br_blockcount, &i);
742                         if (error)
743                                 goto done;
744                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
745                         error = xfs_bmbt_update(bma->cur, new->br_startoff,
746                                         new->br_startblock,
747                                         new->br_blockcount +
748                                         RIGHT.br_blockcount,
749                                         RIGHT.br_state);
750                         if (error)
751                                 goto done;
752                 }
753
754                 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
755                         startblockval(PREV.br_startblock));
756                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
757                 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
758                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
759
760                 bma->idx++;
761                 break;
762
763         case BMAP_RIGHT_FILLING:
764                 /*
765                  * Filling in the last part of a previous delayed allocation.
766                  * The right neighbor is not contiguous.
767                  */
768                 temp = PREV.br_blockcount - new->br_blockcount;
769                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
770                 xfs_bmbt_set_blockcount(ep, temp);
771                 xfs_iext_insert(bma->ip, bma->idx + 1, 1, new, state);
772                 bma->ip->i_d.di_nextents++;
773                 if (bma->cur == NULL)
774                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
775                 else {
776                         rval = XFS_ILOG_CORE;
777                         error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
778                                         new->br_startblock, new->br_blockcount,
779                                         &i);
780                         if (error)
781                                 goto done;
782                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
783                         bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
784                         error = xfs_btree_insert(bma->cur, &i);
785                         if (error)
786                                 goto done;
787                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
788                 }
789
790                 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
791                         error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
792                                 bma->firstblock, bma->flist, &bma->cur, 1,
793                                 &tmp_rval, XFS_DATA_FORK);
794                         rval |= tmp_rval;
795                         if (error)
796                                 goto done;
797                 }
798                 da_new = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(bma->ip, temp),
799                         startblockval(PREV.br_startblock) -
800                         (bma->cur ? bma->cur->bc_private.b.allocated : 0));
801                 ep = xfs_iext_get_ext(ifp, bma->idx);
802                 xfs_bmbt_set_startblock(ep, nullstartblock(da_new));
803                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
804
805                 bma->idx++;
806                 break;
807
808         case 0:
809                 /*
810                  * Filling in the middle part of a previous delayed allocation.
811                  * Contiguity is impossible here.
812                  * This case is avoided almost all the time.
813                  *
814                  * We start with a delayed allocation:
815                  *
816                  * +ddddddddddddddddddddddddddddddddddddddddddddddddddddddd+
817                  *  PREV @ idx
818                  *
819                  * and we are allocating:
820                  *                     +rrrrrrrrrrrrrrrrr+
821                  *                            new
822                  *
823                  * and we set it up for insertion as:
824                  * +ddddddddddddddddddd+rrrrrrrrrrrrrrrrr+ddddddddddddddddd+
825                  *                            new
826                  *  PREV @ idx          LEFT              RIGHT
827                  *                      inserted at idx + 1
828                  */
829                 temp = new->br_startoff - PREV.br_startoff;
830                 temp2 = PREV.br_startoff + PREV.br_blockcount - new_endoff;
831                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, 0, _THIS_IP_);
832                 xfs_bmbt_set_blockcount(ep, temp);      /* truncate PREV */
833                 LEFT = *new;
834                 RIGHT.br_state = PREV.br_state;
835                 RIGHT.br_startblock = nullstartblock(
836                                 (int)xfs_bmap_worst_indlen(bma->ip, temp2));
837                 RIGHT.br_startoff = new_endoff;
838                 RIGHT.br_blockcount = temp2;
839                 /* insert LEFT (r[0]) and RIGHT (r[1]) at the same time */
840                 xfs_iext_insert(bma->ip, bma->idx + 1, 2, &LEFT, state);
841                 bma->ip->i_d.di_nextents++;
842                 if (bma->cur == NULL)
843                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
844                 else {
845                         rval = XFS_ILOG_CORE;
846                         error = xfs_bmbt_lookup_eq(bma->cur, new->br_startoff,
847                                         new->br_startblock, new->br_blockcount,
848                                         &i);
849                         if (error)
850                                 goto done;
851                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
852                         bma->cur->bc_rec.b.br_state = XFS_EXT_NORM;
853                         error = xfs_btree_insert(bma->cur, &i);
854                         if (error)
855                                 goto done;
856                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
857                 }
858
859                 if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
860                         error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
861                                         bma->firstblock, bma->flist, &bma->cur,
862                                         1, &tmp_rval, XFS_DATA_FORK);
863                         rval |= tmp_rval;
864                         if (error)
865                                 goto done;
866                 }
867                 temp = xfs_bmap_worst_indlen(bma->ip, temp);
868                 temp2 = xfs_bmap_worst_indlen(bma->ip, temp2);
869                 diff = (int)(temp + temp2 - startblockval(PREV.br_startblock) -
870                         (bma->cur ? bma->cur->bc_private.b.allocated : 0));
871                 if (diff > 0) {
872                         error = xfs_icsb_modify_counters(bma->ip->i_mount,
873                                         XFS_SBS_FDBLOCKS,
874                                         -((int64_t)diff), 0);
875                         ASSERT(!error);
876                         if (error)
877                                 goto done;
878                 }
879
880                 ep = xfs_iext_get_ext(ifp, bma->idx);
881                 xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
882                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
883                 trace_xfs_bmap_pre_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
884                 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, bma->idx + 2),
885                         nullstartblock((int)temp2));
886                 trace_xfs_bmap_post_update(bma->ip, bma->idx + 2, state, _THIS_IP_);
887
888                 bma->idx++;
889                 da_new = temp + temp2;
890                 break;
891
892         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
893         case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
894         case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
895         case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
896         case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
897         case BMAP_LEFT_CONTIG:
898         case BMAP_RIGHT_CONTIG:
899                 /*
900                  * These cases are all impossible.
901                  */
902                 ASSERT(0);
903         }
904
905         /* convert to a btree if necessary */
906         if (xfs_bmap_needs_btree(bma->ip, XFS_DATA_FORK)) {
907                 int     tmp_logflags;   /* partial log flag return val */
908
909                 ASSERT(bma->cur == NULL);
910                 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
911                                 bma->firstblock, bma->flist, &bma->cur,
912                                 da_old > 0, &tmp_logflags, XFS_DATA_FORK);
913                 bma->logflags |= tmp_logflags;
914                 if (error)
915                         goto done;
916         }
917
918         /* adjust for changes in reserved delayed indirect blocks */
919         if (da_old || da_new) {
920                 temp = da_new;
921                 if (bma->cur)
922                         temp += bma->cur->bc_private.b.allocated;
923                 ASSERT(temp <= da_old);
924                 if (temp < da_old)
925                         xfs_icsb_modify_counters(bma->ip->i_mount,
926                                         XFS_SBS_FDBLOCKS,
927                                         (int64_t)(da_old - temp), 0);
928         }
929
930         /* clear out the allocated field, done with it now in any case. */
931         if (bma->cur)
932                 bma->cur->bc_private.b.allocated = 0;
933
934         xfs_bmap_check_leaf_extents(bma->cur, bma->ip, XFS_DATA_FORK);
935 done:
936         bma->logflags |= rval;
937         return error;
938 #undef  LEFT
939 #undef  RIGHT
940 #undef  PREV
941 }
942
943 /*
944  * Convert an unwritten allocation to a real allocation or vice versa.
945  */
946 STATIC int                              /* error */
947 xfs_bmap_add_extent_unwritten_real(
948         struct xfs_trans        *tp,
949         xfs_inode_t             *ip,    /* incore inode pointer */
950         xfs_extnum_t            *idx,   /* extent number to update/insert */
951         xfs_btree_cur_t         **curp, /* if *curp is null, not a btree */
952         xfs_bmbt_irec_t         *new,   /* new data to add to file extents */
953         xfs_fsblock_t           *first, /* pointer to firstblock variable */
954         xfs_bmap_free_t         *flist, /* list of extents to be freed */
955         int                     *logflagsp) /* inode logging flags */
956 {
957         xfs_btree_cur_t         *cur;   /* btree cursor */
958         xfs_bmbt_rec_host_t     *ep;    /* extent entry for idx */
959         int                     error;  /* error return value */
960         int                     i;      /* temp state */
961         xfs_ifork_t             *ifp;   /* inode fork pointer */
962         xfs_fileoff_t           new_endoff;     /* end offset of new entry */
963         xfs_exntst_t            newext; /* new extent state */
964         xfs_exntst_t            oldext; /* old extent state */
965         xfs_bmbt_irec_t         r[3];   /* neighbor extent entries */
966                                         /* left is 0, right is 1, prev is 2 */
967         int                     rval=0; /* return value (logging flags) */
968         int                     state = 0;/* state bits, accessed thru macros */
969
970         *logflagsp = 0;
971
972         cur = *curp;
973         ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
974
975         ASSERT(*idx >= 0);
976         ASSERT(*idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
977         ASSERT(!isnullstartblock(new->br_startblock));
978
979         XFS_STATS_INC(xs_add_exlist);
980
981 #define LEFT            r[0]
982 #define RIGHT           r[1]
983 #define PREV            r[2]
984
985         /*
986          * Set up a bunch of variables to make the tests simpler.
987          */
988         error = 0;
989         ep = xfs_iext_get_ext(ifp, *idx);
990         xfs_bmbt_get_all(ep, &PREV);
991         newext = new->br_state;
992         oldext = (newext == XFS_EXT_UNWRITTEN) ?
993                 XFS_EXT_NORM : XFS_EXT_UNWRITTEN;
994         ASSERT(PREV.br_state == oldext);
995         new_endoff = new->br_startoff + new->br_blockcount;
996         ASSERT(PREV.br_startoff <= new->br_startoff);
997         ASSERT(PREV.br_startoff + PREV.br_blockcount >= new_endoff);
998
999         /*
1000          * Set flags determining what part of the previous oldext allocation
1001          * extent is being replaced by a newext allocation.
1002          */
1003         if (PREV.br_startoff == new->br_startoff)
1004                 state |= BMAP_LEFT_FILLING;
1005         if (PREV.br_startoff + PREV.br_blockcount == new_endoff)
1006                 state |= BMAP_RIGHT_FILLING;
1007
1008         /*
1009          * Check and set flags if this segment has a left neighbor.
1010          * Don't set contiguous if the combined extent would be too large.
1011          */
1012         if (*idx > 0) {
1013                 state |= BMAP_LEFT_VALID;
1014                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &LEFT);
1015
1016                 if (isnullstartblock(LEFT.br_startblock))
1017                         state |= BMAP_LEFT_DELAY;
1018         }
1019
1020         if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1021             LEFT.br_startoff + LEFT.br_blockcount == new->br_startoff &&
1022             LEFT.br_startblock + LEFT.br_blockcount == new->br_startblock &&
1023             LEFT.br_state == newext &&
1024             LEFT.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1025                 state |= BMAP_LEFT_CONTIG;
1026
1027         /*
1028          * Check and set flags if this segment has a right neighbor.
1029          * Don't set contiguous if the combined extent would be too large.
1030          * Also check for all-three-contiguous being too large.
1031          */
1032         if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t) - 1) {
1033                 state |= BMAP_RIGHT_VALID;
1034                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx + 1), &RIGHT);
1035                 if (isnullstartblock(RIGHT.br_startblock))
1036                         state |= BMAP_RIGHT_DELAY;
1037         }
1038
1039         if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1040             new_endoff == RIGHT.br_startoff &&
1041             new->br_startblock + new->br_blockcount == RIGHT.br_startblock &&
1042             newext == RIGHT.br_state &&
1043             new->br_blockcount + RIGHT.br_blockcount <= MAXEXTLEN &&
1044             ((state & (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1045                        BMAP_RIGHT_FILLING)) !=
1046                       (BMAP_LEFT_CONTIG | BMAP_LEFT_FILLING |
1047                        BMAP_RIGHT_FILLING) ||
1048              LEFT.br_blockcount + new->br_blockcount + RIGHT.br_blockcount
1049                         <= MAXEXTLEN))
1050                 state |= BMAP_RIGHT_CONTIG;
1051
1052         /*
1053          * Switch out based on the FILLING and CONTIG state bits.
1054          */
1055         switch (state & (BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1056                          BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG)) {
1057         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG |
1058              BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1059                 /*
1060                  * Setting all of a previous oldext extent to newext.
1061                  * The left and right neighbors are both contiguous with new.
1062                  */
1063                 --*idx;
1064
1065                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1066                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1067                         LEFT.br_blockcount + PREV.br_blockcount +
1068                         RIGHT.br_blockcount);
1069                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1070
1071                 xfs_iext_remove(ip, *idx + 1, 2, state);
1072                 ip->i_d.di_nextents -= 2;
1073                 if (cur == NULL)
1074                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1075                 else {
1076                         rval = XFS_ILOG_CORE;
1077                         if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
1078                                         RIGHT.br_startblock,
1079                                         RIGHT.br_blockcount, &i)))
1080                                 goto done;
1081                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1082                         if ((error = xfs_btree_delete(cur, &i)))
1083                                 goto done;
1084                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1085                         if ((error = xfs_btree_decrement(cur, 0, &i)))
1086                                 goto done;
1087                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1088                         if ((error = xfs_btree_delete(cur, &i)))
1089                                 goto done;
1090                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1091                         if ((error = xfs_btree_decrement(cur, 0, &i)))
1092                                 goto done;
1093                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1094                         if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
1095                                 LEFT.br_startblock,
1096                                 LEFT.br_blockcount + PREV.br_blockcount +
1097                                 RIGHT.br_blockcount, LEFT.br_state)))
1098                                 goto done;
1099                 }
1100                 break;
1101
1102         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1103                 /*
1104                  * Setting all of a previous oldext extent to newext.
1105                  * The left neighbor is contiguous, the right is not.
1106                  */
1107                 --*idx;
1108
1109                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1110                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx),
1111                         LEFT.br_blockcount + PREV.br_blockcount);
1112                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1113
1114                 xfs_iext_remove(ip, *idx + 1, 1, state);
1115                 ip->i_d.di_nextents--;
1116                 if (cur == NULL)
1117                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1118                 else {
1119                         rval = XFS_ILOG_CORE;
1120                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1121                                         PREV.br_startblock, PREV.br_blockcount,
1122                                         &i)))
1123                                 goto done;
1124                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1125                         if ((error = xfs_btree_delete(cur, &i)))
1126                                 goto done;
1127                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1128                         if ((error = xfs_btree_decrement(cur, 0, &i)))
1129                                 goto done;
1130                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1131                         if ((error = xfs_bmbt_update(cur, LEFT.br_startoff,
1132                                 LEFT.br_startblock,
1133                                 LEFT.br_blockcount + PREV.br_blockcount,
1134                                 LEFT.br_state)))
1135                                 goto done;
1136                 }
1137                 break;
1138
1139         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1140                 /*
1141                  * Setting all of a previous oldext extent to newext.
1142                  * The right neighbor is contiguous, the left is not.
1143                  */
1144                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1145                 xfs_bmbt_set_blockcount(ep,
1146                         PREV.br_blockcount + RIGHT.br_blockcount);
1147                 xfs_bmbt_set_state(ep, newext);
1148                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1149                 xfs_iext_remove(ip, *idx + 1, 1, state);
1150                 ip->i_d.di_nextents--;
1151                 if (cur == NULL)
1152                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1153                 else {
1154                         rval = XFS_ILOG_CORE;
1155                         if ((error = xfs_bmbt_lookup_eq(cur, RIGHT.br_startoff,
1156                                         RIGHT.br_startblock,
1157                                         RIGHT.br_blockcount, &i)))
1158                                 goto done;
1159                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1160                         if ((error = xfs_btree_delete(cur, &i)))
1161                                 goto done;
1162                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1163                         if ((error = xfs_btree_decrement(cur, 0, &i)))
1164                                 goto done;
1165                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1166                         if ((error = xfs_bmbt_update(cur, new->br_startoff,
1167                                 new->br_startblock,
1168                                 new->br_blockcount + RIGHT.br_blockcount,
1169                                 newext)))
1170                                 goto done;
1171                 }
1172                 break;
1173
1174         case BMAP_LEFT_FILLING | BMAP_RIGHT_FILLING:
1175                 /*
1176                  * Setting all of a previous oldext extent to newext.
1177                  * Neither the left nor right neighbors are contiguous with
1178                  * the new one.
1179                  */
1180                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1181                 xfs_bmbt_set_state(ep, newext);
1182                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1183
1184                 if (cur == NULL)
1185                         rval = XFS_ILOG_DEXT;
1186                 else {
1187                         rval = 0;
1188                         if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1189                                         new->br_startblock, new->br_blockcount,
1190                                         &i)))
1191                                 goto done;
1192                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1193                         if ((error = xfs_bmbt_update(cur, new->br_startoff,
1194                                 new->br_startblock, new->br_blockcount,
1195                                 newext)))
1196                                 goto done;
1197                 }
1198                 break;
1199
1200         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG:
1201                 /*
1202                  * Setting the first part of a previous oldext extent to newext.
1203                  * The left neighbor is contiguous.
1204                  */
1205                 trace_xfs_bmap_pre_update(ip, *idx - 1, state, _THIS_IP_);
1206                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx - 1),
1207                         LEFT.br_blockcount + new->br_blockcount);
1208                 xfs_bmbt_set_startoff(ep,
1209                         PREV.br_startoff + new->br_blockcount);
1210                 trace_xfs_bmap_post_update(ip, *idx - 1, state, _THIS_IP_);
1211
1212                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1213                 xfs_bmbt_set_startblock(ep,
1214                         new->br_startblock + new->br_blockcount);
1215                 xfs_bmbt_set_blockcount(ep,
1216                         PREV.br_blockcount - new->br_blockcount);
1217                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1218
1219                 --*idx;
1220
1221                 if (cur == NULL)
1222                         rval = XFS_ILOG_DEXT;
1223                 else {
1224                         rval = 0;
1225                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1226                                         PREV.br_startblock, PREV.br_blockcount,
1227                                         &i)))
1228                                 goto done;
1229                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1230                         if ((error = xfs_bmbt_update(cur,
1231                                 PREV.br_startoff + new->br_blockcount,
1232                                 PREV.br_startblock + new->br_blockcount,
1233                                 PREV.br_blockcount - new->br_blockcount,
1234                                 oldext)))
1235                                 goto done;
1236                         if ((error = xfs_btree_decrement(cur, 0, &i)))
1237                                 goto done;
1238                         error = xfs_bmbt_update(cur, LEFT.br_startoff,
1239                                 LEFT.br_startblock,
1240                                 LEFT.br_blockcount + new->br_blockcount,
1241                                 LEFT.br_state);
1242                         if (error)
1243                                 goto done;
1244                 }
1245                 break;
1246
1247         case BMAP_LEFT_FILLING:
1248                 /*
1249                  * Setting the first part of a previous oldext extent to newext.
1250                  * The left neighbor is not contiguous.
1251                  */
1252                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1253                 ASSERT(ep && xfs_bmbt_get_state(ep) == oldext);
1254                 xfs_bmbt_set_startoff(ep, new_endoff);
1255                 xfs_bmbt_set_blockcount(ep,
1256                         PREV.br_blockcount - new->br_blockcount);
1257                 xfs_bmbt_set_startblock(ep,
1258                         new->br_startblock + new->br_blockcount);
1259                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1260
1261                 xfs_iext_insert(ip, *idx, 1, new, state);
1262                 ip->i_d.di_nextents++;
1263                 if (cur == NULL)
1264                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1265                 else {
1266                         rval = XFS_ILOG_CORE;
1267                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1268                                         PREV.br_startblock, PREV.br_blockcount,
1269                                         &i)))
1270                                 goto done;
1271                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1272                         if ((error = xfs_bmbt_update(cur,
1273                                 PREV.br_startoff + new->br_blockcount,
1274                                 PREV.br_startblock + new->br_blockcount,
1275                                 PREV.br_blockcount - new->br_blockcount,
1276                                 oldext)))
1277                                 goto done;
1278                         cur->bc_rec.b = *new;
1279                         if ((error = xfs_btree_insert(cur, &i)))
1280                                 goto done;
1281                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1282                 }
1283                 break;
1284
1285         case BMAP_RIGHT_FILLING | BMAP_RIGHT_CONTIG:
1286                 /*
1287                  * Setting the last part of a previous oldext extent to newext.
1288                  * The right neighbor is contiguous with the new allocation.
1289                  */
1290                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1291                 xfs_bmbt_set_blockcount(ep,
1292                         PREV.br_blockcount - new->br_blockcount);
1293                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1294
1295                 ++*idx;
1296
1297                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1298                 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
1299                         new->br_startoff, new->br_startblock,
1300                         new->br_blockcount + RIGHT.br_blockcount, newext);
1301                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1302
1303                 if (cur == NULL)
1304                         rval = XFS_ILOG_DEXT;
1305                 else {
1306                         rval = 0;
1307                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1308                                         PREV.br_startblock,
1309                                         PREV.br_blockcount, &i)))
1310                                 goto done;
1311                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1312                         if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
1313                                 PREV.br_startblock,
1314                                 PREV.br_blockcount - new->br_blockcount,
1315                                 oldext)))
1316                                 goto done;
1317                         if ((error = xfs_btree_increment(cur, 0, &i)))
1318                                 goto done;
1319                         if ((error = xfs_bmbt_update(cur, new->br_startoff,
1320                                 new->br_startblock,
1321                                 new->br_blockcount + RIGHT.br_blockcount,
1322                                 newext)))
1323                                 goto done;
1324                 }
1325                 break;
1326
1327         case BMAP_RIGHT_FILLING:
1328                 /*
1329                  * Setting the last part of a previous oldext extent to newext.
1330                  * The right neighbor is not contiguous.
1331                  */
1332                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1333                 xfs_bmbt_set_blockcount(ep,
1334                         PREV.br_blockcount - new->br_blockcount);
1335                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1336
1337                 ++*idx;
1338                 xfs_iext_insert(ip, *idx, 1, new, state);
1339
1340                 ip->i_d.di_nextents++;
1341                 if (cur == NULL)
1342                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1343                 else {
1344                         rval = XFS_ILOG_CORE;
1345                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1346                                         PREV.br_startblock, PREV.br_blockcount,
1347                                         &i)))
1348                                 goto done;
1349                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1350                         if ((error = xfs_bmbt_update(cur, PREV.br_startoff,
1351                                 PREV.br_startblock,
1352                                 PREV.br_blockcount - new->br_blockcount,
1353                                 oldext)))
1354                                 goto done;
1355                         if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1356                                         new->br_startblock, new->br_blockcount,
1357                                         &i)))
1358                                 goto done;
1359                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1360                         cur->bc_rec.b.br_state = XFS_EXT_NORM;
1361                         if ((error = xfs_btree_insert(cur, &i)))
1362                                 goto done;
1363                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1364                 }
1365                 break;
1366
1367         case 0:
1368                 /*
1369                  * Setting the middle part of a previous oldext extent to
1370                  * newext.  Contiguity is impossible here.
1371                  * One extent becomes three extents.
1372                  */
1373                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1374                 xfs_bmbt_set_blockcount(ep,
1375                         new->br_startoff - PREV.br_startoff);
1376                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1377
1378                 r[0] = *new;
1379                 r[1].br_startoff = new_endoff;
1380                 r[1].br_blockcount =
1381                         PREV.br_startoff + PREV.br_blockcount - new_endoff;
1382                 r[1].br_startblock = new->br_startblock + new->br_blockcount;
1383                 r[1].br_state = oldext;
1384
1385                 ++*idx;
1386                 xfs_iext_insert(ip, *idx, 2, &r[0], state);
1387
1388                 ip->i_d.di_nextents += 2;
1389                 if (cur == NULL)
1390                         rval = XFS_ILOG_CORE | XFS_ILOG_DEXT;
1391                 else {
1392                         rval = XFS_ILOG_CORE;
1393                         if ((error = xfs_bmbt_lookup_eq(cur, PREV.br_startoff,
1394                                         PREV.br_startblock, PREV.br_blockcount,
1395                                         &i)))
1396                                 goto done;
1397                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1398                         /* new right extent - oldext */
1399                         if ((error = xfs_bmbt_update(cur, r[1].br_startoff,
1400                                 r[1].br_startblock, r[1].br_blockcount,
1401                                 r[1].br_state)))
1402                                 goto done;
1403                         /* new left extent - oldext */
1404                         cur->bc_rec.b = PREV;
1405                         cur->bc_rec.b.br_blockcount =
1406                                 new->br_startoff - PREV.br_startoff;
1407                         if ((error = xfs_btree_insert(cur, &i)))
1408                                 goto done;
1409                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1410                         /*
1411                          * Reset the cursor to the position of the new extent
1412                          * we are about to insert as we can't trust it after
1413                          * the previous insert.
1414                          */
1415                         if ((error = xfs_bmbt_lookup_eq(cur, new->br_startoff,
1416                                         new->br_startblock, new->br_blockcount,
1417                                         &i)))
1418                                 goto done;
1419                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1420                         /* new middle extent - newext */
1421                         cur->bc_rec.b.br_state = new->br_state;
1422                         if ((error = xfs_btree_insert(cur, &i)))
1423                                 goto done;
1424                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1425                 }
1426                 break;
1427
1428         case BMAP_LEFT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1429         case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1430         case BMAP_LEFT_FILLING | BMAP_RIGHT_CONTIG:
1431         case BMAP_RIGHT_FILLING | BMAP_LEFT_CONTIG:
1432         case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1433         case BMAP_LEFT_CONTIG:
1434         case BMAP_RIGHT_CONTIG:
1435                 /*
1436                  * These cases are all impossible.
1437                  */
1438                 ASSERT(0);
1439         }
1440
1441         /* convert to a btree if necessary */
1442         if (xfs_bmap_needs_btree(ip, XFS_DATA_FORK)) {
1443                 int     tmp_logflags;   /* partial log flag return val */
1444
1445                 ASSERT(cur == NULL);
1446                 error = xfs_bmap_extents_to_btree(tp, ip, first, flist, &cur,
1447                                 0, &tmp_logflags, XFS_DATA_FORK);
1448                 *logflagsp |= tmp_logflags;
1449                 if (error)
1450                         goto done;
1451         }
1452
1453         /* clear out the allocated field, done with it now in any case. */
1454         if (cur) {
1455                 cur->bc_private.b.allocated = 0;
1456                 *curp = cur;
1457         }
1458
1459         xfs_bmap_check_leaf_extents(*curp, ip, XFS_DATA_FORK);
1460 done:
1461         *logflagsp |= rval;
1462         return error;
1463 #undef  LEFT
1464 #undef  RIGHT
1465 #undef  PREV
1466 }
1467
1468 /*
1469  * Convert a hole to a delayed allocation.
1470  */
1471 STATIC void
1472 xfs_bmap_add_extent_hole_delay(
1473         xfs_inode_t             *ip,    /* incore inode pointer */
1474         xfs_extnum_t            *idx,   /* extent number to update/insert */
1475         xfs_bmbt_irec_t         *new)   /* new data to add to file extents */
1476 {
1477         xfs_ifork_t             *ifp;   /* inode fork pointer */
1478         xfs_bmbt_irec_t         left;   /* left neighbor extent entry */
1479         xfs_filblks_t           newlen=0;       /* new indirect size */
1480         xfs_filblks_t           oldlen=0;       /* old indirect size */
1481         xfs_bmbt_irec_t         right;  /* right neighbor extent entry */
1482         int                     state;  /* state bits, accessed thru macros */
1483         xfs_filblks_t           temp=0; /* temp for indirect calculations */
1484
1485         ifp = XFS_IFORK_PTR(ip, XFS_DATA_FORK);
1486         state = 0;
1487         ASSERT(isnullstartblock(new->br_startblock));
1488
1489         /*
1490          * Check and set flags if this segment has a left neighbor
1491          */
1492         if (*idx > 0) {
1493                 state |= BMAP_LEFT_VALID;
1494                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx - 1), &left);
1495
1496                 if (isnullstartblock(left.br_startblock))
1497                         state |= BMAP_LEFT_DELAY;
1498         }
1499
1500         /*
1501          * Check and set flags if the current (right) segment exists.
1502          * If it doesn't exist, we're converting the hole at end-of-file.
1503          */
1504         if (*idx < ip->i_df.if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
1505                 state |= BMAP_RIGHT_VALID;
1506                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right);
1507
1508                 if (isnullstartblock(right.br_startblock))
1509                         state |= BMAP_RIGHT_DELAY;
1510         }
1511
1512         /*
1513          * Set contiguity flags on the left and right neighbors.
1514          * Don't let extents get too large, even if the pieces are contiguous.
1515          */
1516         if ((state & BMAP_LEFT_VALID) && (state & BMAP_LEFT_DELAY) &&
1517             left.br_startoff + left.br_blockcount == new->br_startoff &&
1518             left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1519                 state |= BMAP_LEFT_CONTIG;
1520
1521         if ((state & BMAP_RIGHT_VALID) && (state & BMAP_RIGHT_DELAY) &&
1522             new->br_startoff + new->br_blockcount == right.br_startoff &&
1523             new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
1524             (!(state & BMAP_LEFT_CONTIG) ||
1525              (left.br_blockcount + new->br_blockcount +
1526               right.br_blockcount <= MAXEXTLEN)))
1527                 state |= BMAP_RIGHT_CONTIG;
1528
1529         /*
1530          * Switch out based on the contiguity flags.
1531          */
1532         switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
1533         case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1534                 /*
1535                  * New allocation is contiguous with delayed allocations
1536                  * on the left and on the right.
1537                  * Merge all three into a single extent record.
1538                  */
1539                 --*idx;
1540                 temp = left.br_blockcount + new->br_blockcount +
1541                         right.br_blockcount;
1542
1543                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1544                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
1545                 oldlen = startblockval(left.br_startblock) +
1546                         startblockval(new->br_startblock) +
1547                         startblockval(right.br_startblock);
1548                 newlen = xfs_bmap_worst_indlen(ip, temp);
1549                 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
1550                         nullstartblock((int)newlen));
1551                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1552
1553                 xfs_iext_remove(ip, *idx + 1, 1, state);
1554                 break;
1555
1556         case BMAP_LEFT_CONTIG:
1557                 /*
1558                  * New allocation is contiguous with a delayed allocation
1559                  * on the left.
1560                  * Merge the new allocation with the left neighbor.
1561                  */
1562                 --*idx;
1563                 temp = left.br_blockcount + new->br_blockcount;
1564
1565                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1566                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, *idx), temp);
1567                 oldlen = startblockval(left.br_startblock) +
1568                         startblockval(new->br_startblock);
1569                 newlen = xfs_bmap_worst_indlen(ip, temp);
1570                 xfs_bmbt_set_startblock(xfs_iext_get_ext(ifp, *idx),
1571                         nullstartblock((int)newlen));
1572                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1573                 break;
1574
1575         case BMAP_RIGHT_CONTIG:
1576                 /*
1577                  * New allocation is contiguous with a delayed allocation
1578                  * on the right.
1579                  * Merge the new allocation with the right neighbor.
1580                  */
1581                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
1582                 temp = new->br_blockcount + right.br_blockcount;
1583                 oldlen = startblockval(new->br_startblock) +
1584                         startblockval(right.br_startblock);
1585                 newlen = xfs_bmap_worst_indlen(ip, temp);
1586                 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, *idx),
1587                         new->br_startoff,
1588                         nullstartblock((int)newlen), temp, right.br_state);
1589                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
1590                 break;
1591
1592         case 0:
1593                 /*
1594                  * New allocation is not contiguous with another
1595                  * delayed allocation.
1596                  * Insert a new entry.
1597                  */
1598                 oldlen = newlen = 0;
1599                 xfs_iext_insert(ip, *idx, 1, new, state);
1600                 break;
1601         }
1602         if (oldlen != newlen) {
1603                 ASSERT(oldlen > newlen);
1604                 xfs_icsb_modify_counters(ip->i_mount, XFS_SBS_FDBLOCKS,
1605                         (int64_t)(oldlen - newlen), 0);
1606                 /*
1607                  * Nothing to do for disk quota accounting here.
1608                  */
1609         }
1610 }
1611
1612 /*
1613  * Convert a hole to a real allocation.
1614  */
1615 STATIC int                              /* error */
1616 xfs_bmap_add_extent_hole_real(
1617         struct xfs_bmalloca     *bma,
1618         int                     whichfork)
1619 {
1620         struct xfs_bmbt_irec    *new = &bma->got;
1621         int                     error;  /* error return value */
1622         int                     i;      /* temp state */
1623         xfs_ifork_t             *ifp;   /* inode fork pointer */
1624         xfs_bmbt_irec_t         left;   /* left neighbor extent entry */
1625         xfs_bmbt_irec_t         right;  /* right neighbor extent entry */
1626         int                     rval=0; /* return value (logging flags) */
1627         int                     state;  /* state bits, accessed thru macros */
1628
1629         ifp = XFS_IFORK_PTR(bma->ip, whichfork);
1630
1631         ASSERT(bma->idx >= 0);
1632         ASSERT(bma->idx <= ifp->if_bytes / sizeof(struct xfs_bmbt_rec));
1633         ASSERT(!isnullstartblock(new->br_startblock));
1634         ASSERT(!bma->cur ||
1635                !(bma->cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL));
1636
1637         XFS_STATS_INC(xs_add_exlist);
1638
1639         state = 0;
1640         if (whichfork == XFS_ATTR_FORK)
1641                 state |= BMAP_ATTRFORK;
1642
1643         /*
1644          * Check and set flags if this segment has a left neighbor.
1645          */
1646         if (bma->idx > 0) {
1647                 state |= BMAP_LEFT_VALID;
1648                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx - 1), &left);
1649                 if (isnullstartblock(left.br_startblock))
1650                         state |= BMAP_LEFT_DELAY;
1651         }
1652
1653         /*
1654          * Check and set flags if this segment has a current value.
1655          * Not true if we're inserting into the "hole" at eof.
1656          */
1657         if (bma->idx < ifp->if_bytes / (uint)sizeof(xfs_bmbt_rec_t)) {
1658                 state |= BMAP_RIGHT_VALID;
1659                 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right);
1660                 if (isnullstartblock(right.br_startblock))
1661                         state |= BMAP_RIGHT_DELAY;
1662         }
1663
1664         /*
1665          * We're inserting a real allocation between "left" and "right".
1666          * Set the contiguity flags.  Don't let extents get too large.
1667          */
1668         if ((state & BMAP_LEFT_VALID) && !(state & BMAP_LEFT_DELAY) &&
1669             left.br_startoff + left.br_blockcount == new->br_startoff &&
1670             left.br_startblock + left.br_blockcount == new->br_startblock &&
1671             left.br_state == new->br_state &&
1672             left.br_blockcount + new->br_blockcount <= MAXEXTLEN)
1673                 state |= BMAP_LEFT_CONTIG;
1674
1675         if ((state & BMAP_RIGHT_VALID) && !(state & BMAP_RIGHT_DELAY) &&
1676             new->br_startoff + new->br_blockcount == right.br_startoff &&
1677             new->br_startblock + new->br_blockcount == right.br_startblock &&
1678             new->br_state == right.br_state &&
1679             new->br_blockcount + right.br_blockcount <= MAXEXTLEN &&
1680             (!(state & BMAP_LEFT_CONTIG) ||
1681              left.br_blockcount + new->br_blockcount +
1682              right.br_blockcount <= MAXEXTLEN))
1683                 state |= BMAP_RIGHT_CONTIG;
1684
1685         error = 0;
1686         /*
1687          * Select which case we're in here, and implement it.
1688          */
1689         switch (state & (BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG)) {
1690         case BMAP_LEFT_CONTIG | BMAP_RIGHT_CONTIG:
1691                 /*
1692                  * New allocation is contiguous with real allocations on the
1693                  * left and on the right.
1694                  * Merge all three into a single extent record.
1695                  */
1696                 --bma->idx;
1697                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1698                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1699                         left.br_blockcount + new->br_blockcount +
1700                         right.br_blockcount);
1701                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1702
1703                 xfs_iext_remove(bma->ip, bma->idx + 1, 1, state);
1704
1705                 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
1706                         XFS_IFORK_NEXTENTS(bma->ip, whichfork) - 1);
1707                 if (bma->cur == NULL) {
1708                         rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
1709                 } else {
1710                         rval = XFS_ILOG_CORE;
1711                         error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff,
1712                                         right.br_startblock, right.br_blockcount,
1713                                         &i);
1714                         if (error)
1715                                 goto done;
1716                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1717                         error = xfs_btree_delete(bma->cur, &i);
1718                         if (error)
1719                                 goto done;
1720                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1721                         error = xfs_btree_decrement(bma->cur, 0, &i);
1722                         if (error)
1723                                 goto done;
1724                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1725                         error = xfs_bmbt_update(bma->cur, left.br_startoff,
1726                                         left.br_startblock,
1727                                         left.br_blockcount +
1728                                                 new->br_blockcount +
1729                                                 right.br_blockcount,
1730                                         left.br_state);
1731                         if (error)
1732                                 goto done;
1733                 }
1734                 break;
1735
1736         case BMAP_LEFT_CONTIG:
1737                 /*
1738                  * New allocation is contiguous with a real allocation
1739                  * on the left.
1740                  * Merge the new allocation with the left neighbor.
1741                  */
1742                 --bma->idx;
1743                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1744                 xfs_bmbt_set_blockcount(xfs_iext_get_ext(ifp, bma->idx),
1745                         left.br_blockcount + new->br_blockcount);
1746                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1747
1748                 if (bma->cur == NULL) {
1749                         rval = xfs_ilog_fext(whichfork);
1750                 } else {
1751                         rval = 0;
1752                         error = xfs_bmbt_lookup_eq(bma->cur, left.br_startoff,
1753                                         left.br_startblock, left.br_blockcount,
1754                                         &i);
1755                         if (error)
1756                                 goto done;
1757                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1758                         error = xfs_bmbt_update(bma->cur, left.br_startoff,
1759                                         left.br_startblock,
1760                                         left.br_blockcount +
1761                                                 new->br_blockcount,
1762                                         left.br_state);
1763                         if (error)
1764                                 goto done;
1765                 }
1766                 break;
1767
1768         case BMAP_RIGHT_CONTIG:
1769                 /*
1770                  * New allocation is contiguous with a real allocation
1771                  * on the right.
1772                  * Merge the new allocation with the right neighbor.
1773                  */
1774                 trace_xfs_bmap_pre_update(bma->ip, bma->idx, state, _THIS_IP_);
1775                 xfs_bmbt_set_allf(xfs_iext_get_ext(ifp, bma->idx),
1776                         new->br_startoff, new->br_startblock,
1777                         new->br_blockcount + right.br_blockcount,
1778                         right.br_state);
1779                 trace_xfs_bmap_post_update(bma->ip, bma->idx, state, _THIS_IP_);
1780
1781                 if (bma->cur == NULL) {
1782                         rval = xfs_ilog_fext(whichfork);
1783                 } else {
1784                         rval = 0;
1785                         error = xfs_bmbt_lookup_eq(bma->cur,
1786                                         right.br_startoff,
1787                                         right.br_startblock,
1788                                         right.br_blockcount, &i);
1789                         if (error)
1790                                 goto done;
1791                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1792                         error = xfs_bmbt_update(bma->cur, new->br_startoff,
1793                                         new->br_startblock,
1794                                         new->br_blockcount +
1795                                                 right.br_blockcount,
1796                                         right.br_state);
1797                         if (error)
1798                                 goto done;
1799                 }
1800                 break;
1801
1802         case 0:
1803                 /*
1804                  * New allocation is not contiguous with another
1805                  * real allocation.
1806                  * Insert a new entry.
1807                  */
1808                 xfs_iext_insert(bma->ip, bma->idx, 1, new, state);
1809                 XFS_IFORK_NEXT_SET(bma->ip, whichfork,
1810                         XFS_IFORK_NEXTENTS(bma->ip, whichfork) + 1);
1811                 if (bma->cur == NULL) {
1812                         rval = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
1813                 } else {
1814                         rval = XFS_ILOG_CORE;
1815                         error = xfs_bmbt_lookup_eq(bma->cur,
1816                                         new->br_startoff,
1817                                         new->br_startblock,
1818                                         new->br_blockcount, &i);
1819                         if (error)
1820                                 goto done;
1821                         XFS_WANT_CORRUPTED_GOTO(i == 0, done);
1822                         bma->cur->bc_rec.b.br_state = new->br_state;
1823                         error = xfs_btree_insert(bma->cur, &i);
1824                         if (error)
1825                                 goto done;
1826                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
1827                 }
1828                 break;
1829         }
1830
1831         /* convert to a btree if necessary */
1832         if (xfs_bmap_needs_btree(bma->ip, whichfork)) {
1833                 int     tmp_logflags;   /* partial log flag return val */
1834
1835                 ASSERT(bma->cur == NULL);
1836                 error = xfs_bmap_extents_to_btree(bma->tp, bma->ip,
1837                                 bma->firstblock, bma->flist, &bma->cur,
1838                                 0, &tmp_logflags, whichfork);
1839                 bma->logflags |= tmp_logflags;
1840                 if (error)
1841                         goto done;
1842         }
1843
1844         /* clear out the allocated field, done with it now in any case. */
1845         if (bma->cur)
1846                 bma->cur->bc_private.b.allocated = 0;
1847
1848         xfs_bmap_check_leaf_extents(bma->cur, bma->ip, whichfork);
1849 done:
1850         bma->logflags |= rval;
1851         return error;
1852 }
1853
1854 /*
1855  * Adjust the size of the new extent based on di_extsize and rt extsize.
1856  */
1857 STATIC int
1858 xfs_bmap_extsize_align(
1859         xfs_mount_t     *mp,
1860         xfs_bmbt_irec_t *gotp,          /* next extent pointer */
1861         xfs_bmbt_irec_t *prevp,         /* previous extent pointer */
1862         xfs_extlen_t    extsz,          /* align to this extent size */
1863         int             rt,             /* is this a realtime inode? */
1864         int             eof,            /* is extent at end-of-file? */
1865         int             delay,          /* creating delalloc extent? */
1866         int             convert,        /* overwriting unwritten extent? */
1867         xfs_fileoff_t   *offp,          /* in/out: aligned offset */
1868         xfs_extlen_t    *lenp)          /* in/out: aligned length */
1869 {
1870         xfs_fileoff_t   orig_off;       /* original offset */
1871         xfs_extlen_t    orig_alen;      /* original length */
1872         xfs_fileoff_t   orig_end;       /* original off+len */
1873         xfs_fileoff_t   nexto;          /* next file offset */
1874         xfs_fileoff_t   prevo;          /* previous file offset */
1875         xfs_fileoff_t   align_off;      /* temp for offset */
1876         xfs_extlen_t    align_alen;     /* temp for length */
1877         xfs_extlen_t    temp;           /* temp for calculations */
1878
1879         if (convert)
1880                 return 0;
1881
1882         orig_off = align_off = *offp;
1883         orig_alen = align_alen = *lenp;
1884         orig_end = orig_off + orig_alen;
1885
1886         /*
1887          * If this request overlaps an existing extent, then don't
1888          * attempt to perform any additional alignment.
1889          */
1890         if (!delay && !eof &&
1891             (orig_off >= gotp->br_startoff) &&
1892             (orig_end <= gotp->br_startoff + gotp->br_blockcount)) {
1893                 return 0;
1894         }
1895
1896         /*
1897          * If the file offset is unaligned vs. the extent size
1898          * we need to align it.  This will be possible unless
1899          * the file was previously written with a kernel that didn't
1900          * perform this alignment, or if a truncate shot us in the
1901          * foot.
1902          */
1903         temp = do_mod(orig_off, extsz);
1904         if (temp) {
1905                 align_alen += temp;
1906                 align_off -= temp;
1907         }
1908         /*
1909          * Same adjustment for the end of the requested area.
1910          */
1911         if ((temp = (align_alen % extsz))) {
1912                 align_alen += extsz - temp;
1913         }
1914         /*
1915          * If the previous block overlaps with this proposed allocation
1916          * then move the start forward without adjusting the length.
1917          */
1918         if (prevp->br_startoff != NULLFILEOFF) {
1919                 if (prevp->br_startblock == HOLESTARTBLOCK)
1920                         prevo = prevp->br_startoff;
1921                 else
1922                         prevo = prevp->br_startoff + prevp->br_blockcount;
1923         } else
1924                 prevo = 0;
1925         if (align_off != orig_off && align_off < prevo)
1926                 align_off = prevo;
1927         /*
1928          * If the next block overlaps with this proposed allocation
1929          * then move the start back without adjusting the length,
1930          * but not before offset 0.
1931          * This may of course make the start overlap previous block,
1932          * and if we hit the offset 0 limit then the next block
1933          * can still overlap too.
1934          */
1935         if (!eof && gotp->br_startoff != NULLFILEOFF) {
1936                 if ((delay && gotp->br_startblock == HOLESTARTBLOCK) ||
1937                     (!delay && gotp->br_startblock == DELAYSTARTBLOCK))
1938                         nexto = gotp->br_startoff + gotp->br_blockcount;
1939                 else
1940                         nexto = gotp->br_startoff;
1941         } else
1942                 nexto = NULLFILEOFF;
1943         if (!eof &&
1944             align_off + align_alen != orig_end &&
1945             align_off + align_alen > nexto)
1946                 align_off = nexto > align_alen ? nexto - align_alen : 0;
1947         /*
1948          * If we're now overlapping the next or previous extent that
1949          * means we can't fit an extsz piece in this hole.  Just move
1950          * the start forward to the first valid spot and set
1951          * the length so we hit the end.
1952          */
1953         if (align_off != orig_off && align_off < prevo)
1954                 align_off = prevo;
1955         if (align_off + align_alen != orig_end &&
1956             align_off + align_alen > nexto &&
1957             nexto != NULLFILEOFF) {
1958                 ASSERT(nexto > prevo);
1959                 align_alen = nexto - align_off;
1960         }
1961
1962         /*
1963          * If realtime, and the result isn't a multiple of the realtime
1964          * extent size we need to remove blocks until it is.
1965          */
1966         if (rt && (temp = (align_alen % mp->m_sb.sb_rextsize))) {
1967                 /*
1968                  * We're not covering the original request, or
1969                  * we won't be able to once we fix the length.
1970                  */
1971                 if (orig_off < align_off ||
1972                     orig_end > align_off + align_alen ||
1973                     align_alen - temp < orig_alen)
1974                         return XFS_ERROR(EINVAL);
1975                 /*
1976                  * Try to fix it by moving the start up.
1977                  */
1978                 if (align_off + temp <= orig_off) {
1979                         align_alen -= temp;
1980                         align_off += temp;
1981                 }
1982                 /*
1983                  * Try to fix it by moving the end in.
1984                  */
1985                 else if (align_off + align_alen - temp >= orig_end)
1986                         align_alen -= temp;
1987                 /*
1988                  * Set the start to the minimum then trim the length.
1989                  */
1990                 else {
1991                         align_alen -= orig_off - align_off;
1992                         align_off = orig_off;
1993                         align_alen -= align_alen % mp->m_sb.sb_rextsize;
1994                 }
1995                 /*
1996                  * Result doesn't cover the request, fail it.
1997                  */
1998                 if (orig_off < align_off || orig_end > align_off + align_alen)
1999                         return XFS_ERROR(EINVAL);
2000         } else {
2001                 ASSERT(orig_off >= align_off);
2002                 ASSERT(orig_end <= align_off + align_alen);
2003         }
2004
2005 #ifdef DEBUG
2006         if (!eof && gotp->br_startoff != NULLFILEOFF)
2007                 ASSERT(align_off + align_alen <= gotp->br_startoff);
2008         if (prevp->br_startoff != NULLFILEOFF)
2009                 ASSERT(align_off >= prevp->br_startoff + prevp->br_blockcount);
2010 #endif
2011
2012         *lenp = align_alen;
2013         *offp = align_off;
2014         return 0;
2015 }
2016
2017 #define XFS_ALLOC_GAP_UNITS     4
2018
2019 STATIC void
2020 xfs_bmap_adjacent(
2021         xfs_bmalloca_t  *ap)            /* bmap alloc argument struct */
2022 {
2023         xfs_fsblock_t   adjust;         /* adjustment to block numbers */
2024         xfs_agnumber_t  fb_agno;        /* ag number of ap->firstblock */
2025         xfs_mount_t     *mp;            /* mount point structure */
2026         int             nullfb;         /* true if ap->firstblock isn't set */
2027         int             rt;             /* true if inode is realtime */
2028
2029 #define ISVALID(x,y)    \
2030         (rt ? \
2031                 (x) < mp->m_sb.sb_rblocks : \
2032                 XFS_FSB_TO_AGNO(mp, x) == XFS_FSB_TO_AGNO(mp, y) && \
2033                 XFS_FSB_TO_AGNO(mp, x) < mp->m_sb.sb_agcount && \
2034                 XFS_FSB_TO_AGBNO(mp, x) < mp->m_sb.sb_agblocks)
2035
2036         mp = ap->ip->i_mount;
2037         nullfb = *ap->firstblock == NULLFSBLOCK;
2038         rt = XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata;
2039         fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
2040         /*
2041          * If allocating at eof, and there's a previous real block,
2042          * try to use its last block as our starting point.
2043          */
2044         if (ap->eof && ap->prev.br_startoff != NULLFILEOFF &&
2045             !isnullstartblock(ap->prev.br_startblock) &&
2046             ISVALID(ap->prev.br_startblock + ap->prev.br_blockcount,
2047                     ap->prev.br_startblock)) {
2048                 ap->blkno = ap->prev.br_startblock + ap->prev.br_blockcount;
2049                 /*
2050                  * Adjust for the gap between prevp and us.
2051                  */
2052                 adjust = ap->offset -
2053                         (ap->prev.br_startoff + ap->prev.br_blockcount);
2054                 if (adjust &&
2055                     ISVALID(ap->blkno + adjust, ap->prev.br_startblock))
2056                         ap->blkno += adjust;
2057         }
2058         /*
2059          * If not at eof, then compare the two neighbor blocks.
2060          * Figure out whether either one gives us a good starting point,
2061          * and pick the better one.
2062          */
2063         else if (!ap->eof) {
2064                 xfs_fsblock_t   gotbno;         /* right side block number */
2065                 xfs_fsblock_t   gotdiff=0;      /* right side difference */
2066                 xfs_fsblock_t   prevbno;        /* left side block number */
2067                 xfs_fsblock_t   prevdiff=0;     /* left side difference */
2068
2069                 /*
2070                  * If there's a previous (left) block, select a requested
2071                  * start block based on it.
2072                  */
2073                 if (ap->prev.br_startoff != NULLFILEOFF &&
2074                     !isnullstartblock(ap->prev.br_startblock) &&
2075                     (prevbno = ap->prev.br_startblock +
2076                                ap->prev.br_blockcount) &&
2077                     ISVALID(prevbno, ap->prev.br_startblock)) {
2078                         /*
2079                          * Calculate gap to end of previous block.
2080                          */
2081                         adjust = prevdiff = ap->offset -
2082                                 (ap->prev.br_startoff +
2083                                  ap->prev.br_blockcount);
2084                         /*
2085                          * Figure the startblock based on the previous block's
2086                          * end and the gap size.
2087                          * Heuristic!
2088                          * If the gap is large relative to the piece we're
2089                          * allocating, or using it gives us an invalid block
2090                          * number, then just use the end of the previous block.
2091                          */
2092                         if (prevdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
2093                             ISVALID(prevbno + prevdiff,
2094                                     ap->prev.br_startblock))
2095                                 prevbno += adjust;
2096                         else
2097                                 prevdiff += adjust;
2098                         /*
2099                          * If the firstblock forbids it, can't use it,
2100                          * must use default.
2101                          */
2102                         if (!rt && !nullfb &&
2103                             XFS_FSB_TO_AGNO(mp, prevbno) != fb_agno)
2104                                 prevbno = NULLFSBLOCK;
2105                 }
2106                 /*
2107                  * No previous block or can't follow it, just default.
2108                  */
2109                 else
2110                         prevbno = NULLFSBLOCK;
2111                 /*
2112                  * If there's a following (right) block, select a requested
2113                  * start block based on it.
2114                  */
2115                 if (!isnullstartblock(ap->got.br_startblock)) {
2116                         /*
2117                          * Calculate gap to start of next block.
2118                          */
2119                         adjust = gotdiff = ap->got.br_startoff - ap->offset;
2120                         /*
2121                          * Figure the startblock based on the next block's
2122                          * start and the gap size.
2123                          */
2124                         gotbno = ap->got.br_startblock;
2125                         /*
2126                          * Heuristic!
2127                          * If the gap is large relative to the piece we're
2128                          * allocating, or using it gives us an invalid block
2129                          * number, then just use the start of the next block
2130                          * offset by our length.
2131                          */
2132                         if (gotdiff <= XFS_ALLOC_GAP_UNITS * ap->length &&
2133                             ISVALID(gotbno - gotdiff, gotbno))
2134                                 gotbno -= adjust;
2135                         else if (ISVALID(gotbno - ap->length, gotbno)) {
2136                                 gotbno -= ap->length;
2137                                 gotdiff += adjust - ap->length;
2138                         } else
2139                                 gotdiff += adjust;
2140                         /*
2141                          * If the firstblock forbids it, can't use it,
2142                          * must use default.
2143                          */
2144                         if (!rt && !nullfb &&
2145                             XFS_FSB_TO_AGNO(mp, gotbno) != fb_agno)
2146                                 gotbno = NULLFSBLOCK;
2147                 }
2148                 /*
2149                  * No next block, just default.
2150                  */
2151                 else
2152                         gotbno = NULLFSBLOCK;
2153                 /*
2154                  * If both valid, pick the better one, else the only good
2155                  * one, else ap->blkno is already set (to 0 or the inode block).
2156                  */
2157                 if (prevbno != NULLFSBLOCK && gotbno != NULLFSBLOCK)
2158                         ap->blkno = prevdiff <= gotdiff ? prevbno : gotbno;
2159                 else if (prevbno != NULLFSBLOCK)
2160                         ap->blkno = prevbno;
2161                 else if (gotbno != NULLFSBLOCK)
2162                         ap->blkno = gotbno;
2163         }
2164 #undef ISVALID
2165 }
2166
2167 STATIC int
2168 xfs_bmap_rtalloc(
2169         xfs_bmalloca_t  *ap)            /* bmap alloc argument struct */
2170 {
2171         xfs_alloctype_t atype = 0;      /* type for allocation routines */
2172         int             error;          /* error return value */
2173         xfs_mount_t     *mp;            /* mount point structure */
2174         xfs_extlen_t    prod = 0;       /* product factor for allocators */
2175         xfs_extlen_t    ralen = 0;      /* realtime allocation length */
2176         xfs_extlen_t    align;          /* minimum allocation alignment */
2177         xfs_rtblock_t   rtb;
2178
2179         mp = ap->ip->i_mount;
2180         align = xfs_get_extsz_hint(ap->ip);
2181         prod = align / mp->m_sb.sb_rextsize;
2182         error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
2183                                         align, 1, ap->eof, 0,
2184                                         ap->conv, &ap->offset, &ap->length);
2185         if (error)
2186                 return error;
2187         ASSERT(ap->length);
2188         ASSERT(ap->length % mp->m_sb.sb_rextsize == 0);
2189
2190         /*
2191          * If the offset & length are not perfectly aligned
2192          * then kill prod, it will just get us in trouble.
2193          */
2194         if (do_mod(ap->offset, align) || ap->length % align)
2195                 prod = 1;
2196         /*
2197          * Set ralen to be the actual requested length in rtextents.
2198          */
2199         ralen = ap->length / mp->m_sb.sb_rextsize;
2200         /*
2201          * If the old value was close enough to MAXEXTLEN that
2202          * we rounded up to it, cut it back so it's valid again.
2203          * Note that if it's a really large request (bigger than
2204          * MAXEXTLEN), we don't hear about that number, and can't
2205          * adjust the starting point to match it.
2206          */
2207         if (ralen * mp->m_sb.sb_rextsize >= MAXEXTLEN)
2208                 ralen = MAXEXTLEN / mp->m_sb.sb_rextsize;
2209
2210         /*
2211          * Lock out other modifications to the RT bitmap inode.
2212          */
2213         xfs_ilock(mp->m_rbmip, XFS_ILOCK_EXCL);
2214         xfs_trans_ijoin(ap->tp, mp->m_rbmip, XFS_ILOCK_EXCL);
2215
2216         /*
2217          * If it's an allocation to an empty file at offset 0,
2218          * pick an extent that will space things out in the rt area.
2219          */
2220         if (ap->eof && ap->offset == 0) {
2221                 xfs_rtblock_t uninitialized_var(rtx); /* realtime extent no */
2222
2223                 error = xfs_rtpick_extent(mp, ap->tp, ralen, &rtx);
2224                 if (error)
2225                         return error;
2226                 ap->blkno = rtx * mp->m_sb.sb_rextsize;
2227         } else {
2228                 ap->blkno = 0;
2229         }
2230
2231         xfs_bmap_adjacent(ap);
2232
2233         /*
2234          * Realtime allocation, done through xfs_rtallocate_extent.
2235          */
2236         atype = ap->blkno == 0 ?  XFS_ALLOCTYPE_ANY_AG : XFS_ALLOCTYPE_NEAR_BNO;
2237         do_div(ap->blkno, mp->m_sb.sb_rextsize);
2238         rtb = ap->blkno;
2239         ap->length = ralen;
2240         if ((error = xfs_rtallocate_extent(ap->tp, ap->blkno, 1, ap->length,
2241                                 &ralen, atype, ap->wasdel, prod, &rtb)))
2242                 return error;
2243         if (rtb == NULLFSBLOCK && prod > 1 &&
2244             (error = xfs_rtallocate_extent(ap->tp, ap->blkno, 1,
2245                                            ap->length, &ralen, atype,
2246                                            ap->wasdel, 1, &rtb)))
2247                 return error;
2248         ap->blkno = rtb;
2249         if (ap->blkno != NULLFSBLOCK) {
2250                 ap->blkno *= mp->m_sb.sb_rextsize;
2251                 ralen *= mp->m_sb.sb_rextsize;
2252                 ap->length = ralen;
2253                 ap->ip->i_d.di_nblocks += ralen;
2254                 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
2255                 if (ap->wasdel)
2256                         ap->ip->i_delayed_blks -= ralen;
2257                 /*
2258                  * Adjust the disk quota also. This was reserved
2259                  * earlier.
2260                  */
2261                 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
2262                         ap->wasdel ? XFS_TRANS_DQ_DELRTBCOUNT :
2263                                         XFS_TRANS_DQ_RTBCOUNT, (long) ralen);
2264         } else {
2265                 ap->length = 0;
2266         }
2267         return 0;
2268 }
2269
2270 STATIC int
2271 xfs_bmap_btalloc_nullfb(
2272         struct xfs_bmalloca     *ap,
2273         struct xfs_alloc_arg    *args,
2274         xfs_extlen_t            *blen)
2275 {
2276         struct xfs_mount        *mp = ap->ip->i_mount;
2277         struct xfs_perag        *pag;
2278         xfs_agnumber_t          ag, startag;
2279         int                     notinit = 0;
2280         int                     error;
2281
2282         if (ap->userdata && xfs_inode_is_filestream(ap->ip))
2283                 args->type = XFS_ALLOCTYPE_NEAR_BNO;
2284         else
2285                 args->type = XFS_ALLOCTYPE_START_BNO;
2286         args->total = ap->total;
2287
2288         /*
2289          * Search for an allocation group with a single extent large enough
2290          * for the request.  If one isn't found, then adjust the minimum
2291          * allocation size to the largest space found.
2292          */
2293         startag = ag = XFS_FSB_TO_AGNO(mp, args->fsbno);
2294         if (startag == NULLAGNUMBER)
2295                 startag = ag = 0;
2296
2297         pag = xfs_perag_get(mp, ag);
2298         while (*blen < args->maxlen) {
2299                 if (!pag->pagf_init) {
2300                         error = xfs_alloc_pagf_init(mp, args->tp, ag,
2301                                                     XFS_ALLOC_FLAG_TRYLOCK);
2302                         if (error) {
2303                                 xfs_perag_put(pag);
2304                                 return error;
2305                         }
2306                 }
2307
2308                 /*
2309                  * See xfs_alloc_fix_freelist...
2310                  */
2311                 if (pag->pagf_init) {
2312                         xfs_extlen_t    longest;
2313                         longest = xfs_alloc_longest_free_extent(mp, pag);
2314                         if (*blen < longest)
2315                                 *blen = longest;
2316                 } else
2317                         notinit = 1;
2318
2319                 if (xfs_inode_is_filestream(ap->ip)) {
2320                         if (*blen >= args->maxlen)
2321                                 break;
2322
2323                         if (ap->userdata) {
2324                                 /*
2325                                  * If startag is an invalid AG, we've
2326                                  * come here once before and
2327                                  * xfs_filestream_new_ag picked the
2328                                  * best currently available.
2329                                  *
2330                                  * Don't continue looping, since we
2331                                  * could loop forever.
2332                                  */
2333                                 if (startag == NULLAGNUMBER)
2334                                         break;
2335
2336                                 error = xfs_filestream_new_ag(ap, &ag);
2337                                 xfs_perag_put(pag);
2338                                 if (error)
2339                                         return error;
2340
2341                                 /* loop again to set 'blen'*/
2342                                 startag = NULLAGNUMBER;
2343                                 pag = xfs_perag_get(mp, ag);
2344                                 continue;
2345                         }
2346                 }
2347                 if (++ag == mp->m_sb.sb_agcount)
2348                         ag = 0;
2349                 if (ag == startag)
2350                         break;
2351                 xfs_perag_put(pag);
2352                 pag = xfs_perag_get(mp, ag);
2353         }
2354         xfs_perag_put(pag);
2355
2356         /*
2357          * Since the above loop did a BUF_TRYLOCK, it is
2358          * possible that there is space for this request.
2359          */
2360         if (notinit || *blen < ap->minlen)
2361                 args->minlen = ap->minlen;
2362         /*
2363          * If the best seen length is less than the request
2364          * length, use the best as the minimum.
2365          */
2366         else if (*blen < args->maxlen)
2367                 args->minlen = *blen;
2368         /*
2369          * Otherwise we've seen an extent as big as maxlen,
2370          * use that as the minimum.
2371          */
2372         else
2373                 args->minlen = args->maxlen;
2374
2375         /*
2376          * set the failure fallback case to look in the selected
2377          * AG as the stream may have moved.
2378          */
2379         if (xfs_inode_is_filestream(ap->ip))
2380                 ap->blkno = args->fsbno = XFS_AGB_TO_FSB(mp, ag, 0);
2381
2382         return 0;
2383 }
2384
2385 STATIC int
2386 xfs_bmap_btalloc(
2387         xfs_bmalloca_t  *ap)            /* bmap alloc argument struct */
2388 {
2389         xfs_mount_t     *mp;            /* mount point structure */
2390         xfs_alloctype_t atype = 0;      /* type for allocation routines */
2391         xfs_extlen_t    align;          /* minimum allocation alignment */
2392         xfs_agnumber_t  fb_agno;        /* ag number of ap->firstblock */
2393         xfs_agnumber_t  ag;
2394         xfs_alloc_arg_t args;
2395         xfs_extlen_t    blen;
2396         xfs_extlen_t    nextminlen = 0;
2397         int             nullfb;         /* true if ap->firstblock isn't set */
2398         int             isaligned;
2399         int             tryagain;
2400         int             error;
2401
2402         ASSERT(ap->length);
2403
2404         mp = ap->ip->i_mount;
2405         align = ap->userdata ? xfs_get_extsz_hint(ap->ip) : 0;
2406         if (unlikely(align)) {
2407                 error = xfs_bmap_extsize_align(mp, &ap->got, &ap->prev,
2408                                                 align, 0, ap->eof, 0, ap->conv,
2409                                                 &ap->offset, &ap->length);
2410                 ASSERT(!error);
2411                 ASSERT(ap->length);
2412         }
2413         nullfb = *ap->firstblock == NULLFSBLOCK;
2414         fb_agno = nullfb ? NULLAGNUMBER : XFS_FSB_TO_AGNO(mp, *ap->firstblock);
2415         if (nullfb) {
2416                 if (ap->userdata && xfs_inode_is_filestream(ap->ip)) {
2417                         ag = xfs_filestream_lookup_ag(ap->ip);
2418                         ag = (ag != NULLAGNUMBER) ? ag : 0;
2419                         ap->blkno = XFS_AGB_TO_FSB(mp, ag, 0);
2420                 } else {
2421                         ap->blkno = XFS_INO_TO_FSB(mp, ap->ip->i_ino);
2422                 }
2423         } else
2424                 ap->blkno = *ap->firstblock;
2425
2426         xfs_bmap_adjacent(ap);
2427
2428         /*
2429          * If allowed, use ap->blkno; otherwise must use firstblock since
2430          * it's in the right allocation group.
2431          */
2432         if (nullfb || XFS_FSB_TO_AGNO(mp, ap->blkno) == fb_agno)
2433                 ;
2434         else
2435                 ap->blkno = *ap->firstblock;
2436         /*
2437          * Normal allocation, done through xfs_alloc_vextent.
2438          */
2439         tryagain = isaligned = 0;
2440         memset(&args, 0, sizeof(args));
2441         args.tp = ap->tp;
2442         args.mp = mp;
2443         args.fsbno = ap->blkno;
2444
2445         /* Trim the allocation back to the maximum an AG can fit. */
2446         args.maxlen = MIN(ap->length, XFS_ALLOC_AG_MAX_USABLE(mp));
2447         args.firstblock = *ap->firstblock;
2448         blen = 0;
2449         if (nullfb) {
2450                 error = xfs_bmap_btalloc_nullfb(ap, &args, &blen);
2451                 if (error)
2452                         return error;
2453         } else if (ap->flist->xbf_low) {
2454                 if (xfs_inode_is_filestream(ap->ip))
2455                         args.type = XFS_ALLOCTYPE_FIRST_AG;
2456                 else
2457                         args.type = XFS_ALLOCTYPE_START_BNO;
2458                 args.total = args.minlen = ap->minlen;
2459         } else {
2460                 args.type = XFS_ALLOCTYPE_NEAR_BNO;
2461                 args.total = ap->total;
2462                 args.minlen = ap->minlen;
2463         }
2464         /* apply extent size hints if obtained earlier */
2465         if (unlikely(align)) {
2466                 args.prod = align;
2467                 if ((args.mod = (xfs_extlen_t)do_mod(ap->offset, args.prod)))
2468                         args.mod = (xfs_extlen_t)(args.prod - args.mod);
2469         } else if (mp->m_sb.sb_blocksize >= PAGE_CACHE_SIZE) {
2470                 args.prod = 1;
2471                 args.mod = 0;
2472         } else {
2473                 args.prod = PAGE_CACHE_SIZE >> mp->m_sb.sb_blocklog;
2474                 if ((args.mod = (xfs_extlen_t)(do_mod(ap->offset, args.prod))))
2475                         args.mod = (xfs_extlen_t)(args.prod - args.mod);
2476         }
2477         /*
2478          * If we are not low on available data blocks, and the
2479          * underlying logical volume manager is a stripe, and
2480          * the file offset is zero then try to allocate data
2481          * blocks on stripe unit boundary.
2482          * NOTE: ap->aeof is only set if the allocation length
2483          * is >= the stripe unit and the allocation offset is
2484          * at the end of file.
2485          */
2486         if (!ap->flist->xbf_low && ap->aeof) {
2487                 if (!ap->offset) {
2488                         args.alignment = mp->m_dalign;
2489                         atype = args.type;
2490                         isaligned = 1;
2491                         /*
2492                          * Adjust for alignment
2493                          */
2494                         if (blen > args.alignment && blen <= args.maxlen)
2495                                 args.minlen = blen - args.alignment;
2496                         args.minalignslop = 0;
2497                 } else {
2498                         /*
2499                          * First try an exact bno allocation.
2500                          * If it fails then do a near or start bno
2501                          * allocation with alignment turned on.
2502                          */
2503                         atype = args.type;
2504                         tryagain = 1;
2505                         args.type = XFS_ALLOCTYPE_THIS_BNO;
2506                         args.alignment = 1;
2507                         /*
2508                          * Compute the minlen+alignment for the
2509                          * next case.  Set slop so that the value
2510                          * of minlen+alignment+slop doesn't go up
2511                          * between the calls.
2512                          */
2513                         if (blen > mp->m_dalign && blen <= args.maxlen)
2514                                 nextminlen = blen - mp->m_dalign;
2515                         else
2516                                 nextminlen = args.minlen;
2517                         if (nextminlen + mp->m_dalign > args.minlen + 1)
2518                                 args.minalignslop =
2519                                         nextminlen + mp->m_dalign -
2520                                         args.minlen - 1;
2521                         else
2522                                 args.minalignslop = 0;
2523                 }
2524         } else {
2525                 args.alignment = 1;
2526                 args.minalignslop = 0;
2527         }
2528         args.minleft = ap->minleft;
2529         args.wasdel = ap->wasdel;
2530         args.isfl = 0;
2531         args.userdata = ap->userdata;
2532         if ((error = xfs_alloc_vextent(&args)))
2533                 return error;
2534         if (tryagain && args.fsbno == NULLFSBLOCK) {
2535                 /*
2536                  * Exact allocation failed. Now try with alignment
2537                  * turned on.
2538                  */
2539                 args.type = atype;
2540                 args.fsbno = ap->blkno;
2541                 args.alignment = mp->m_dalign;
2542                 args.minlen = nextminlen;
2543                 args.minalignslop = 0;
2544                 isaligned = 1;
2545                 if ((error = xfs_alloc_vextent(&args)))
2546                         return error;
2547         }
2548         if (isaligned && args.fsbno == NULLFSBLOCK) {
2549                 /*
2550                  * allocation failed, so turn off alignment and
2551                  * try again.
2552                  */
2553                 args.type = atype;
2554                 args.fsbno = ap->blkno;
2555                 args.alignment = 0;
2556                 if ((error = xfs_alloc_vextent(&args)))
2557                         return error;
2558         }
2559         if (args.fsbno == NULLFSBLOCK && nullfb &&
2560             args.minlen > ap->minlen) {
2561                 args.minlen = ap->minlen;
2562                 args.type = XFS_ALLOCTYPE_START_BNO;
2563                 args.fsbno = ap->blkno;
2564                 if ((error = xfs_alloc_vextent(&args)))
2565                         return error;
2566         }
2567         if (args.fsbno == NULLFSBLOCK && nullfb) {
2568                 args.fsbno = 0;
2569                 args.type = XFS_ALLOCTYPE_FIRST_AG;
2570                 args.total = ap->minlen;
2571                 args.minleft = 0;
2572                 if ((error = xfs_alloc_vextent(&args)))
2573                         return error;
2574                 ap->flist->xbf_low = 1;
2575         }
2576         if (args.fsbno != NULLFSBLOCK) {
2577                 /*
2578                  * check the allocation happened at the same or higher AG than
2579                  * the first block that was allocated.
2580                  */
2581                 ASSERT(*ap->firstblock == NULLFSBLOCK ||
2582                        XFS_FSB_TO_AGNO(mp, *ap->firstblock) ==
2583                        XFS_FSB_TO_AGNO(mp, args.fsbno) ||
2584                        (ap->flist->xbf_low &&
2585                         XFS_FSB_TO_AGNO(mp, *ap->firstblock) <
2586                         XFS_FSB_TO_AGNO(mp, args.fsbno)));
2587
2588                 ap->blkno = args.fsbno;
2589                 if (*ap->firstblock == NULLFSBLOCK)
2590                         *ap->firstblock = args.fsbno;
2591                 ASSERT(nullfb || fb_agno == args.agno ||
2592                        (ap->flist->xbf_low && fb_agno < args.agno));
2593                 ap->length = args.len;
2594                 ap->ip->i_d.di_nblocks += args.len;
2595                 xfs_trans_log_inode(ap->tp, ap->ip, XFS_ILOG_CORE);
2596                 if (ap->wasdel)
2597                         ap->ip->i_delayed_blks -= args.len;
2598                 /*
2599                  * Adjust the disk quota also. This was reserved
2600                  * earlier.
2601                  */
2602                 xfs_trans_mod_dquot_byino(ap->tp, ap->ip,
2603                         ap->wasdel ? XFS_TRANS_DQ_DELBCOUNT :
2604                                         XFS_TRANS_DQ_BCOUNT,
2605                         (long) args.len);
2606         } else {
2607                 ap->blkno = NULLFSBLOCK;
2608                 ap->length = 0;
2609         }
2610         return 0;
2611 }
2612
2613 /*
2614  * xfs_bmap_alloc is called by xfs_bmapi to allocate an extent for a file.
2615  * It figures out where to ask the underlying allocator to put the new extent.
2616  */
2617 STATIC int
2618 xfs_bmap_alloc(
2619         xfs_bmalloca_t  *ap)            /* bmap alloc argument struct */
2620 {
2621         if (XFS_IS_REALTIME_INODE(ap->ip) && ap->userdata)
2622                 return xfs_bmap_rtalloc(ap);
2623         return xfs_bmap_btalloc(ap);
2624 }
2625
2626 /*
2627  * Transform a btree format file with only one leaf node, where the
2628  * extents list will fit in the inode, into an extents format file.
2629  * Since the file extents are already in-core, all we have to do is
2630  * give up the space for the btree root and pitch the leaf block.
2631  */
2632 STATIC int                              /* error */
2633 xfs_bmap_btree_to_extents(
2634         xfs_trans_t             *tp,    /* transaction pointer */
2635         xfs_inode_t             *ip,    /* incore inode pointer */
2636         xfs_btree_cur_t         *cur,   /* btree cursor */
2637         int                     *logflagsp, /* inode logging flags */
2638         int                     whichfork)  /* data or attr fork */
2639 {
2640         /* REFERENCED */
2641         struct xfs_btree_block  *cblock;/* child btree block */
2642         xfs_fsblock_t           cbno;   /* child block number */
2643         xfs_buf_t               *cbp;   /* child block's buffer */
2644         int                     error;  /* error return value */
2645         xfs_ifork_t             *ifp;   /* inode fork data */
2646         xfs_mount_t             *mp;    /* mount point structure */
2647         __be64                  *pp;    /* ptr to block address */
2648         struct xfs_btree_block  *rblock;/* root btree block */
2649
2650         mp = ip->i_mount;
2651         ifp = XFS_IFORK_PTR(ip, whichfork);
2652         ASSERT(ifp->if_flags & XFS_IFEXTENTS);
2653         ASSERT(XFS_IFORK_FORMAT(ip, whichfork) == XFS_DINODE_FMT_BTREE);
2654         rblock = ifp->if_broot;
2655         ASSERT(be16_to_cpu(rblock->bb_level) == 1);
2656         ASSERT(be16_to_cpu(rblock->bb_numrecs) == 1);
2657         ASSERT(xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0) == 1);
2658         pp = XFS_BMAP_BROOT_PTR_ADDR(mp, rblock, 1, ifp->if_broot_bytes);
2659         cbno = be64_to_cpu(*pp);
2660         *logflagsp = 0;
2661 #ifdef DEBUG
2662         if ((error = xfs_btree_check_lptr(cur, cbno, 1)))
2663                 return error;
2664 #endif
2665         if ((error = xfs_btree_read_bufl(mp, tp, cbno, 0, &cbp,
2666                         XFS_BMAP_BTREE_REF)))
2667                 return error;
2668         cblock = XFS_BUF_TO_BLOCK(cbp);
2669         if ((error = xfs_btree_check_block(cur, cblock, 0, cbp)))
2670                 return error;
2671         xfs_bmap_add_free(cbno, 1, cur->bc_private.b.flist, mp);
2672         ip->i_d.di_nblocks--;
2673         xfs_trans_mod_dquot_byino(tp, ip, XFS_TRANS_DQ_BCOUNT, -1L);
2674         xfs_trans_binval(tp, cbp);
2675         if (cur->bc_bufs[0] == cbp)
2676                 cur->bc_bufs[0] = NULL;
2677         xfs_iroot_realloc(ip, -1, whichfork);
2678         ASSERT(ifp->if_broot == NULL);
2679         ASSERT((ifp->if_flags & XFS_IFBROOT) == 0);
2680         XFS_IFORK_FMT_SET(ip, whichfork, XFS_DINODE_FMT_EXTENTS);
2681         *logflagsp = XFS_ILOG_CORE | xfs_ilog_fext(whichfork);
2682         return 0;
2683 }
2684
2685 /*
2686  * Called by xfs_bmapi to update file extent records and the btree
2687  * after removing space (or undoing a delayed allocation).
2688  */
2689 STATIC int                              /* error */
2690 xfs_bmap_del_extent(
2691         xfs_inode_t             *ip,    /* incore inode pointer */
2692         xfs_trans_t             *tp,    /* current transaction pointer */
2693         xfs_extnum_t            *idx,   /* extent number to update/delete */
2694         xfs_bmap_free_t         *flist, /* list of extents to be freed */
2695         xfs_btree_cur_t         *cur,   /* if null, not a btree */
2696         xfs_bmbt_irec_t         *del,   /* data to remove from extents */
2697         int                     *logflagsp, /* inode logging flags */
2698         int                     whichfork) /* data or attr fork */
2699 {
2700         xfs_filblks_t           da_new; /* new delay-alloc indirect blocks */
2701         xfs_filblks_t           da_old; /* old delay-alloc indirect blocks */
2702         xfs_fsblock_t           del_endblock=0; /* first block past del */
2703         xfs_fileoff_t           del_endoff;     /* first offset past del */
2704         int                     delay;  /* current block is delayed allocated */
2705         int                     do_fx;  /* free extent at end of routine */
2706         xfs_bmbt_rec_host_t     *ep;    /* current extent entry pointer */
2707         int                     error;  /* error return value */
2708         int                     flags;  /* inode logging flags */
2709         xfs_bmbt_irec_t         got;    /* current extent entry */
2710         xfs_fileoff_t           got_endoff;     /* first offset past got */
2711         int                     i;      /* temp state */
2712         xfs_ifork_t             *ifp;   /* inode fork pointer */
2713         xfs_mount_t             *mp;    /* mount structure */
2714         xfs_filblks_t           nblks;  /* quota/sb block count */
2715         xfs_bmbt_irec_t         new;    /* new record to be inserted */
2716         /* REFERENCED */
2717         uint                    qfield; /* quota field to update */
2718         xfs_filblks_t           temp;   /* for indirect length calculations */
2719         xfs_filblks_t           temp2;  /* for indirect length calculations */
2720         int                     state = 0;
2721
2722         XFS_STATS_INC(xs_del_exlist);
2723
2724         if (whichfork == XFS_ATTR_FORK)
2725                 state |= BMAP_ATTRFORK;
2726
2727         mp = ip->i_mount;
2728         ifp = XFS_IFORK_PTR(ip, whichfork);
2729         ASSERT((*idx >= 0) && (*idx < ifp->if_bytes /
2730                 (uint)sizeof(xfs_bmbt_rec_t)));
2731         ASSERT(del->br_blockcount > 0);
2732         ep = xfs_iext_get_ext(ifp, *idx);
2733         xfs_bmbt_get_all(ep, &got);
2734         ASSERT(got.br_startoff <= del->br_startoff);
2735         del_endoff = del->br_startoff + del->br_blockcount;
2736         got_endoff = got.br_startoff + got.br_blockcount;
2737         ASSERT(got_endoff >= del_endoff);
2738         delay = isnullstartblock(got.br_startblock);
2739         ASSERT(isnullstartblock(del->br_startblock) == delay);
2740         flags = 0;
2741         qfield = 0;
2742         error = 0;
2743         /*
2744          * If deleting a real allocation, must free up the disk space.
2745          */
2746         if (!delay) {
2747                 flags = XFS_ILOG_CORE;
2748                 /*
2749                  * Realtime allocation.  Free it and record di_nblocks update.
2750                  */
2751                 if (whichfork == XFS_DATA_FORK && XFS_IS_REALTIME_INODE(ip)) {
2752                         xfs_fsblock_t   bno;
2753                         xfs_filblks_t   len;
2754
2755                         ASSERT(do_mod(del->br_blockcount,
2756                                       mp->m_sb.sb_rextsize) == 0);
2757                         ASSERT(do_mod(del->br_startblock,
2758                                       mp->m_sb.sb_rextsize) == 0);
2759                         bno = del->br_startblock;
2760                         len = del->br_blockcount;
2761                         do_div(bno, mp->m_sb.sb_rextsize);
2762                         do_div(len, mp->m_sb.sb_rextsize);
2763                         error = xfs_rtfree_extent(tp, bno, (xfs_extlen_t)len);
2764                         if (error)
2765                                 goto done;
2766                         do_fx = 0;
2767                         nblks = len * mp->m_sb.sb_rextsize;
2768                         qfield = XFS_TRANS_DQ_RTBCOUNT;
2769                 }
2770                 /*
2771                  * Ordinary allocation.
2772                  */
2773                 else {
2774                         do_fx = 1;
2775                         nblks = del->br_blockcount;
2776                         qfield = XFS_TRANS_DQ_BCOUNT;
2777                 }
2778                 /*
2779                  * Set up del_endblock and cur for later.
2780                  */
2781                 del_endblock = del->br_startblock + del->br_blockcount;
2782                 if (cur) {
2783                         if ((error = xfs_bmbt_lookup_eq(cur, got.br_startoff,
2784                                         got.br_startblock, got.br_blockcount,
2785                                         &i)))
2786                                 goto done;
2787                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2788                 }
2789                 da_old = da_new = 0;
2790         } else {
2791                 da_old = startblockval(got.br_startblock);
2792                 da_new = 0;
2793                 nblks = 0;
2794                 do_fx = 0;
2795         }
2796         /*
2797          * Set flag value to use in switch statement.
2798          * Left-contig is 2, right-contig is 1.
2799          */
2800         switch (((got.br_startoff == del->br_startoff) << 1) |
2801                 (got_endoff == del_endoff)) {
2802         case 3:
2803                 /*
2804                  * Matches the whole extent.  Delete the entry.
2805                  */
2806                 xfs_iext_remove(ip, *idx, 1,
2807                                 whichfork == XFS_ATTR_FORK ? BMAP_ATTRFORK : 0);
2808                 --*idx;
2809                 if (delay)
2810                         break;
2811
2812                 XFS_IFORK_NEXT_SET(ip, whichfork,
2813                         XFS_IFORK_NEXTENTS(ip, whichfork) - 1);
2814                 flags |= XFS_ILOG_CORE;
2815                 if (!cur) {
2816                         flags |= xfs_ilog_fext(whichfork);
2817                         break;
2818                 }
2819                 if ((error = xfs_btree_delete(cur, &i)))
2820                         goto done;
2821                 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2822                 break;
2823
2824         case 2:
2825                 /*
2826                  * Deleting the first part of the extent.
2827                  */
2828                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2829                 xfs_bmbt_set_startoff(ep, del_endoff);
2830                 temp = got.br_blockcount - del->br_blockcount;
2831                 xfs_bmbt_set_blockcount(ep, temp);
2832                 if (delay) {
2833                         temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2834                                 da_old);
2835                         xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2836                         trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2837                         da_new = temp;
2838                         break;
2839                 }
2840                 xfs_bmbt_set_startblock(ep, del_endblock);
2841                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2842                 if (!cur) {
2843                         flags |= xfs_ilog_fext(whichfork);
2844                         break;
2845                 }
2846                 if ((error = xfs_bmbt_update(cur, del_endoff, del_endblock,
2847                                 got.br_blockcount - del->br_blockcount,
2848                                 got.br_state)))
2849                         goto done;
2850                 break;
2851
2852         case 1:
2853                 /*
2854                  * Deleting the last part of the extent.
2855                  */
2856                 temp = got.br_blockcount - del->br_blockcount;
2857                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2858                 xfs_bmbt_set_blockcount(ep, temp);
2859                 if (delay) {
2860                         temp = XFS_FILBLKS_MIN(xfs_bmap_worst_indlen(ip, temp),
2861                                 da_old);
2862                         xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2863                         trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2864                         da_new = temp;
2865                         break;
2866                 }
2867                 trace_xfs_bmap_post_update(ip, *idx, state, _THIS_IP_);
2868                 if (!cur) {
2869                         flags |= xfs_ilog_fext(whichfork);
2870                         break;
2871                 }
2872                 if ((error = xfs_bmbt_update(cur, got.br_startoff,
2873                                 got.br_startblock,
2874                                 got.br_blockcount - del->br_blockcount,
2875                                 got.br_state)))
2876                         goto done;
2877                 break;
2878
2879         case 0:
2880                 /*
2881                  * Deleting the middle of the extent.
2882                  */
2883                 temp = del->br_startoff - got.br_startoff;
2884                 trace_xfs_bmap_pre_update(ip, *idx, state, _THIS_IP_);
2885                 xfs_bmbt_set_blockcount(ep, temp);
2886                 new.br_startoff = del_endoff;
2887                 temp2 = got_endoff - del_endoff;
2888                 new.br_blockcount = temp2;
2889                 new.br_state = got.br_state;
2890                 if (!delay) {
2891                         new.br_startblock = del_endblock;
2892                         flags |= XFS_ILOG_CORE;
2893                         if (cur) {
2894                                 if ((error = xfs_bmbt_update(cur,
2895                                                 got.br_startoff,
2896                                                 got.br_startblock, temp,
2897                                                 got.br_state)))
2898                                         goto done;
2899                                 if ((error = xfs_btree_increment(cur, 0, &i)))
2900                                         goto done;
2901                                 cur->bc_rec.b = new;
2902                                 error = xfs_btree_insert(cur, &i);
2903                                 if (error && error != ENOSPC)
2904                                         goto done;
2905                                 /*
2906                                  * If get no-space back from btree insert,
2907                                  * it tried a split, and we have a zero
2908                                  * block reservation.
2909                                  * Fix up our state and return the error.
2910                                  */
2911                                 if (error == ENOSPC) {
2912                                         /*
2913                                          * Reset the cursor, don't trust
2914                                          * it after any insert operation.
2915                                          */
2916                                         if ((error = xfs_bmbt_lookup_eq(cur,
2917                                                         got.br_startoff,
2918                                                         got.br_startblock,
2919                                                         temp, &i)))
2920                                                 goto done;
2921                                         XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2922                                         /*
2923                                          * Update the btree record back
2924                                          * to the original value.
2925                                          */
2926                                         if ((error = xfs_bmbt_update(cur,
2927                                                         got.br_startoff,
2928                                                         got.br_startblock,
2929                                                         got.br_blockcount,
2930                                                         got.br_state)))
2931                                                 goto done;
2932                                         /*
2933                                          * Reset the extent record back
2934                                          * to the original value.
2935                                          */
2936                                         xfs_bmbt_set_blockcount(ep,
2937                                                 got.br_blockcount);
2938                                         flags = 0;
2939                                         error = XFS_ERROR(ENOSPC);
2940                                         goto done;
2941                                 }
2942                                 XFS_WANT_CORRUPTED_GOTO(i == 1, done);
2943                         } else
2944                                 flags |= xfs_ilog_fext(whichfork);
2945                         XFS_IFORK_NEXT_SET(ip, whichfork,
2946                                 XFS_IFORK_NEXTENTS(ip, whichfork) + 1);
2947                 } else {
2948                         ASSERT(whichfork == XFS_DATA_FORK);
2949                         temp = xfs_bmap_worst_indlen(ip, temp);
2950                         xfs_bmbt_set_startblock(ep, nullstartblock((int)temp));
2951                         temp2 = xfs_bmap_worst_indlen(ip, temp2);
2952                         new.br_startblock = nullstartblock((int)temp2);
2953                         da_new = temp + temp2;
2954                         while (da_new > da_old) {
2955                                 if (temp) {
2956                                         temp--;
2957                                         da_new--;
2958                                         xfs_bmbt_set_startblock(ep,
2959                                                 nullstartblock((int)temp));
2960                                 }