Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2014 Red Hat, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_log_format.h"
11#include "xfs_trans_resv.h"
12#include "xfs_bit.h"
13#include "xfs_mount.h"
14#include "xfs_sb.h"
15#include "xfs_defer.h"
16#include "xfs_btree.h"
17#include "xfs_trans.h"
18#include "xfs_alloc.h"
19#include "xfs_rmap.h"
20#include "xfs_rmap_btree.h"
21#include "xfs_trace.h"
22#include "xfs_errortag.h"
23#include "xfs_error.h"
24#include "xfs_inode.h"
25#include "xfs_ag.h"
26
27struct kmem_cache *xfs_rmap_intent_cache;
28
29/*
30 * Lookup the first record less than or equal to [bno, len, owner, offset]
31 * in the btree given by cur.
32 */
33int
34xfs_rmap_lookup_le(
35 struct xfs_btree_cur *cur,
36 xfs_agblock_t bno,
37 uint64_t owner,
38 uint64_t offset,
39 unsigned int flags,
40 struct xfs_rmap_irec *irec,
41 int *stat)
42{
43 int get_stat = 0;
44 int error;
45
46 cur->bc_rec.r.rm_startblock = bno;
47 cur->bc_rec.r.rm_blockcount = 0;
48 cur->bc_rec.r.rm_owner = owner;
49 cur->bc_rec.r.rm_offset = offset;
50 cur->bc_rec.r.rm_flags = flags;
51
52 error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat);
53 if (error || !(*stat) || !irec)
54 return error;
55
56 error = xfs_rmap_get_rec(cur, irec, &get_stat);
57 if (error)
58 return error;
59 if (!get_stat)
60 return -EFSCORRUPTED;
61
62 return 0;
63}
64
65/*
66 * Lookup the record exactly matching [bno, len, owner, offset]
67 * in the btree given by cur.
68 */
69int
70xfs_rmap_lookup_eq(
71 struct xfs_btree_cur *cur,
72 xfs_agblock_t bno,
73 xfs_extlen_t len,
74 uint64_t owner,
75 uint64_t offset,
76 unsigned int flags,
77 int *stat)
78{
79 cur->bc_rec.r.rm_startblock = bno;
80 cur->bc_rec.r.rm_blockcount = len;
81 cur->bc_rec.r.rm_owner = owner;
82 cur->bc_rec.r.rm_offset = offset;
83 cur->bc_rec.r.rm_flags = flags;
84 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
85}
86
87/*
88 * Update the record referred to by cur to the value given
89 * by [bno, len, owner, offset].
90 * This either works (return 0) or gets an EFSCORRUPTED error.
91 */
92STATIC int
93xfs_rmap_update(
94 struct xfs_btree_cur *cur,
95 struct xfs_rmap_irec *irec)
96{
97 union xfs_btree_rec rec;
98 int error;
99
100 trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.pag->pag_agno,
101 irec->rm_startblock, irec->rm_blockcount,
102 irec->rm_owner, irec->rm_offset, irec->rm_flags);
103
104 rec.rmap.rm_startblock = cpu_to_be32(irec->rm_startblock);
105 rec.rmap.rm_blockcount = cpu_to_be32(irec->rm_blockcount);
106 rec.rmap.rm_owner = cpu_to_be64(irec->rm_owner);
107 rec.rmap.rm_offset = cpu_to_be64(
108 xfs_rmap_irec_offset_pack(irec));
109 error = xfs_btree_update(cur, &rec);
110 if (error)
111 trace_xfs_rmap_update_error(cur->bc_mp,
112 cur->bc_ag.pag->pag_agno, error, _RET_IP_);
113 return error;
114}
115
116int
117xfs_rmap_insert(
118 struct xfs_btree_cur *rcur,
119 xfs_agblock_t agbno,
120 xfs_extlen_t len,
121 uint64_t owner,
122 uint64_t offset,
123 unsigned int flags)
124{
125 int i;
126 int error;
127
128 trace_xfs_rmap_insert(rcur->bc_mp, rcur->bc_ag.pag->pag_agno, agbno,
129 len, owner, offset, flags);
130
131 error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
132 if (error)
133 goto done;
134 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 0)) {
135 error = -EFSCORRUPTED;
136 goto done;
137 }
138
139 rcur->bc_rec.r.rm_startblock = agbno;
140 rcur->bc_rec.r.rm_blockcount = len;
141 rcur->bc_rec.r.rm_owner = owner;
142 rcur->bc_rec.r.rm_offset = offset;
143 rcur->bc_rec.r.rm_flags = flags;
144 error = xfs_btree_insert(rcur, &i);
145 if (error)
146 goto done;
147 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
148 error = -EFSCORRUPTED;
149 goto done;
150 }
151done:
152 if (error)
153 trace_xfs_rmap_insert_error(rcur->bc_mp,
154 rcur->bc_ag.pag->pag_agno, error, _RET_IP_);
155 return error;
156}
157
158STATIC int
159xfs_rmap_delete(
160 struct xfs_btree_cur *rcur,
161 xfs_agblock_t agbno,
162 xfs_extlen_t len,
163 uint64_t owner,
164 uint64_t offset,
165 unsigned int flags)
166{
167 int i;
168 int error;
169
170 trace_xfs_rmap_delete(rcur->bc_mp, rcur->bc_ag.pag->pag_agno, agbno,
171 len, owner, offset, flags);
172
173 error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
174 if (error)
175 goto done;
176 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
177 error = -EFSCORRUPTED;
178 goto done;
179 }
180
181 error = xfs_btree_delete(rcur, &i);
182 if (error)
183 goto done;
184 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
185 error = -EFSCORRUPTED;
186 goto done;
187 }
188done:
189 if (error)
190 trace_xfs_rmap_delete_error(rcur->bc_mp,
191 rcur->bc_ag.pag->pag_agno, error, _RET_IP_);
192 return error;
193}
194
195/* Convert an internal btree record to an rmap record. */
196xfs_failaddr_t
197xfs_rmap_btrec_to_irec(
198 const union xfs_btree_rec *rec,
199 struct xfs_rmap_irec *irec)
200{
201 irec->rm_startblock = be32_to_cpu(rec->rmap.rm_startblock);
202 irec->rm_blockcount = be32_to_cpu(rec->rmap.rm_blockcount);
203 irec->rm_owner = be64_to_cpu(rec->rmap.rm_owner);
204 return xfs_rmap_irec_offset_unpack(be64_to_cpu(rec->rmap.rm_offset),
205 irec);
206}
207
208/* Simple checks for rmap records. */
209xfs_failaddr_t
210xfs_rmap_check_irec(
211 struct xfs_btree_cur *cur,
212 const struct xfs_rmap_irec *irec)
213{
214 struct xfs_mount *mp = cur->bc_mp;
215 bool is_inode;
216 bool is_unwritten;
217 bool is_bmbt;
218 bool is_attr;
219
220 if (irec->rm_blockcount == 0)
221 return __this_address;
222 if (irec->rm_startblock <= XFS_AGFL_BLOCK(mp)) {
223 if (irec->rm_owner != XFS_RMAP_OWN_FS)
224 return __this_address;
225 if (irec->rm_blockcount != XFS_AGFL_BLOCK(mp) + 1)
226 return __this_address;
227 } else {
228 /* check for valid extent range, including overflow */
229 if (!xfs_verify_agbext(cur->bc_ag.pag, irec->rm_startblock,
230 irec->rm_blockcount))
231 return __this_address;
232 }
233
234 if (!(xfs_verify_ino(mp, irec->rm_owner) ||
235 (irec->rm_owner <= XFS_RMAP_OWN_FS &&
236 irec->rm_owner >= XFS_RMAP_OWN_MIN)))
237 return __this_address;
238
239 /* Check flags. */
240 is_inode = !XFS_RMAP_NON_INODE_OWNER(irec->rm_owner);
241 is_bmbt = irec->rm_flags & XFS_RMAP_BMBT_BLOCK;
242 is_attr = irec->rm_flags & XFS_RMAP_ATTR_FORK;
243 is_unwritten = irec->rm_flags & XFS_RMAP_UNWRITTEN;
244
245 if (is_bmbt && irec->rm_offset != 0)
246 return __this_address;
247
248 if (!is_inode && irec->rm_offset != 0)
249 return __this_address;
250
251 if (is_unwritten && (is_bmbt || !is_inode || is_attr))
252 return __this_address;
253
254 if (!is_inode && (is_bmbt || is_unwritten || is_attr))
255 return __this_address;
256
257 /* Check for a valid fork offset, if applicable. */
258 if (is_inode && !is_bmbt &&
259 !xfs_verify_fileext(mp, irec->rm_offset, irec->rm_blockcount))
260 return __this_address;
261
262 return NULL;
263}
264
265static inline int
266xfs_rmap_complain_bad_rec(
267 struct xfs_btree_cur *cur,
268 xfs_failaddr_t fa,
269 const struct xfs_rmap_irec *irec)
270{
271 struct xfs_mount *mp = cur->bc_mp;
272
273 xfs_warn(mp,
274 "Reverse Mapping BTree record corruption in AG %d detected at %pS!",
275 cur->bc_ag.pag->pag_agno, fa);
276 xfs_warn(mp,
277 "Owner 0x%llx, flags 0x%x, start block 0x%x block count 0x%x",
278 irec->rm_owner, irec->rm_flags, irec->rm_startblock,
279 irec->rm_blockcount);
280 return -EFSCORRUPTED;
281}
282
283/*
284 * Get the data from the pointed-to record.
285 */
286int
287xfs_rmap_get_rec(
288 struct xfs_btree_cur *cur,
289 struct xfs_rmap_irec *irec,
290 int *stat)
291{
292 union xfs_btree_rec *rec;
293 xfs_failaddr_t fa;
294 int error;
295
296 error = xfs_btree_get_rec(cur, &rec, stat);
297 if (error || !*stat)
298 return error;
299
300 fa = xfs_rmap_btrec_to_irec(rec, irec);
301 if (!fa)
302 fa = xfs_rmap_check_irec(cur, irec);
303 if (fa)
304 return xfs_rmap_complain_bad_rec(cur, fa, irec);
305
306 return 0;
307}
308
309struct xfs_find_left_neighbor_info {
310 struct xfs_rmap_irec high;
311 struct xfs_rmap_irec *irec;
312};
313
314/* For each rmap given, figure out if it matches the key we want. */
315STATIC int
316xfs_rmap_find_left_neighbor_helper(
317 struct xfs_btree_cur *cur,
318 const struct xfs_rmap_irec *rec,
319 void *priv)
320{
321 struct xfs_find_left_neighbor_info *info = priv;
322
323 trace_xfs_rmap_find_left_neighbor_candidate(cur->bc_mp,
324 cur->bc_ag.pag->pag_agno, rec->rm_startblock,
325 rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
326 rec->rm_flags);
327
328 if (rec->rm_owner != info->high.rm_owner)
329 return 0;
330 if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
331 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
332 rec->rm_offset + rec->rm_blockcount - 1 != info->high.rm_offset)
333 return 0;
334
335 *info->irec = *rec;
336 return -ECANCELED;
337}
338
339/*
340 * Find the record to the left of the given extent, being careful only to
341 * return a match with the same owner and adjacent physical and logical
342 * block ranges.
343 */
344STATIC int
345xfs_rmap_find_left_neighbor(
346 struct xfs_btree_cur *cur,
347 xfs_agblock_t bno,
348 uint64_t owner,
349 uint64_t offset,
350 unsigned int flags,
351 struct xfs_rmap_irec *irec,
352 int *stat)
353{
354 struct xfs_find_left_neighbor_info info;
355 int found = 0;
356 int error;
357
358 *stat = 0;
359 if (bno == 0)
360 return 0;
361 info.high.rm_startblock = bno - 1;
362 info.high.rm_owner = owner;
363 if (!XFS_RMAP_NON_INODE_OWNER(owner) &&
364 !(flags & XFS_RMAP_BMBT_BLOCK)) {
365 if (offset == 0)
366 return 0;
367 info.high.rm_offset = offset - 1;
368 } else
369 info.high.rm_offset = 0;
370 info.high.rm_flags = flags;
371 info.high.rm_blockcount = 0;
372 info.irec = irec;
373
374 trace_xfs_rmap_find_left_neighbor_query(cur->bc_mp,
375 cur->bc_ag.pag->pag_agno, bno, 0, owner, offset, flags);
376
377 /*
378 * Historically, we always used the range query to walk every reverse
379 * mapping that could possibly overlap the key that the caller asked
380 * for, and filter out the ones that don't. That is very slow when
381 * there are a lot of records.
382 *
383 * However, there are two scenarios where the classic btree search can
384 * produce correct results -- if the index contains a record that is an
385 * exact match for the lookup key; and if there are no other records
386 * between the record we want and the key we supplied.
387 *
388 * As an optimization, try a non-overlapped lookup first. This makes
389 * extent conversion and remap operations run a bit faster if the
390 * physical extents aren't being shared. If we don't find what we
391 * want, we fall back to the overlapped query.
392 */
393 error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, irec,
394 &found);
395 if (error)
396 return error;
397 if (found)
398 error = xfs_rmap_find_left_neighbor_helper(cur, irec, &info);
399 if (!error)
400 error = xfs_rmap_query_range(cur, &info.high, &info.high,
401 xfs_rmap_find_left_neighbor_helper, &info);
402 if (error != -ECANCELED)
403 return error;
404
405 *stat = 1;
406 trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
407 cur->bc_ag.pag->pag_agno, irec->rm_startblock,
408 irec->rm_blockcount, irec->rm_owner, irec->rm_offset,
409 irec->rm_flags);
410 return 0;
411}
412
413/* For each rmap given, figure out if it matches the key we want. */
414STATIC int
415xfs_rmap_lookup_le_range_helper(
416 struct xfs_btree_cur *cur,
417 const struct xfs_rmap_irec *rec,
418 void *priv)
419{
420 struct xfs_find_left_neighbor_info *info = priv;
421
422 trace_xfs_rmap_lookup_le_range_candidate(cur->bc_mp,
423 cur->bc_ag.pag->pag_agno, rec->rm_startblock,
424 rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
425 rec->rm_flags);
426
427 if (rec->rm_owner != info->high.rm_owner)
428 return 0;
429 if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
430 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
431 (rec->rm_offset > info->high.rm_offset ||
432 rec->rm_offset + rec->rm_blockcount <= info->high.rm_offset))
433 return 0;
434
435 *info->irec = *rec;
436 return -ECANCELED;
437}
438
439/*
440 * Find the record to the left of the given extent, being careful only to
441 * return a match with the same owner and overlapping physical and logical
442 * block ranges. This is the overlapping-interval version of
443 * xfs_rmap_lookup_le.
444 */
445int
446xfs_rmap_lookup_le_range(
447 struct xfs_btree_cur *cur,
448 xfs_agblock_t bno,
449 uint64_t owner,
450 uint64_t offset,
451 unsigned int flags,
452 struct xfs_rmap_irec *irec,
453 int *stat)
454{
455 struct xfs_find_left_neighbor_info info;
456 int found = 0;
457 int error;
458
459 info.high.rm_startblock = bno;
460 info.high.rm_owner = owner;
461 if (!XFS_RMAP_NON_INODE_OWNER(owner) && !(flags & XFS_RMAP_BMBT_BLOCK))
462 info.high.rm_offset = offset;
463 else
464 info.high.rm_offset = 0;
465 info.high.rm_flags = flags;
466 info.high.rm_blockcount = 0;
467 *stat = 0;
468 info.irec = irec;
469
470 trace_xfs_rmap_lookup_le_range(cur->bc_mp, cur->bc_ag.pag->pag_agno,
471 bno, 0, owner, offset, flags);
472
473 /*
474 * Historically, we always used the range query to walk every reverse
475 * mapping that could possibly overlap the key that the caller asked
476 * for, and filter out the ones that don't. That is very slow when
477 * there are a lot of records.
478 *
479 * However, there are two scenarios where the classic btree search can
480 * produce correct results -- if the index contains a record that is an
481 * exact match for the lookup key; and if there are no other records
482 * between the record we want and the key we supplied.
483 *
484 * As an optimization, try a non-overlapped lookup first. This makes
485 * scrub run much faster on most filesystems because bmbt records are
486 * usually an exact match for rmap records. If we don't find what we
487 * want, we fall back to the overlapped query.
488 */
489 error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, irec,
490 &found);
491 if (error)
492 return error;
493 if (found)
494 error = xfs_rmap_lookup_le_range_helper(cur, irec, &info);
495 if (!error)
496 error = xfs_rmap_query_range(cur, &info.high, &info.high,
497 xfs_rmap_lookup_le_range_helper, &info);
498 if (error != -ECANCELED)
499 return error;
500
501 *stat = 1;
502 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
503 cur->bc_ag.pag->pag_agno, irec->rm_startblock,
504 irec->rm_blockcount, irec->rm_owner, irec->rm_offset,
505 irec->rm_flags);
506 return 0;
507}
508
509/*
510 * Perform all the relevant owner checks for a removal op. If we're doing an
511 * unknown-owner removal then we have no owner information to check.
512 */
513static int
514xfs_rmap_free_check_owner(
515 struct xfs_mount *mp,
516 uint64_t ltoff,
517 struct xfs_rmap_irec *rec,
518 xfs_filblks_t len,
519 uint64_t owner,
520 uint64_t offset,
521 unsigned int flags)
522{
523 int error = 0;
524
525 if (owner == XFS_RMAP_OWN_UNKNOWN)
526 return 0;
527
528 /* Make sure the unwritten flag matches. */
529 if (XFS_IS_CORRUPT(mp,
530 (flags & XFS_RMAP_UNWRITTEN) !=
531 (rec->rm_flags & XFS_RMAP_UNWRITTEN))) {
532 error = -EFSCORRUPTED;
533 goto out;
534 }
535
536 /* Make sure the owner matches what we expect to find in the tree. */
537 if (XFS_IS_CORRUPT(mp, owner != rec->rm_owner)) {
538 error = -EFSCORRUPTED;
539 goto out;
540 }
541
542 /* Check the offset, if necessary. */
543 if (XFS_RMAP_NON_INODE_OWNER(owner))
544 goto out;
545
546 if (flags & XFS_RMAP_BMBT_BLOCK) {
547 if (XFS_IS_CORRUPT(mp,
548 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK))) {
549 error = -EFSCORRUPTED;
550 goto out;
551 }
552 } else {
553 if (XFS_IS_CORRUPT(mp, rec->rm_offset > offset)) {
554 error = -EFSCORRUPTED;
555 goto out;
556 }
557 if (XFS_IS_CORRUPT(mp,
558 offset + len > ltoff + rec->rm_blockcount)) {
559 error = -EFSCORRUPTED;
560 goto out;
561 }
562 }
563
564out:
565 return error;
566}
567
568/*
569 * Find the extent in the rmap btree and remove it.
570 *
571 * The record we find should always be an exact match for the extent that we're
572 * looking for, since we insert them into the btree without modification.
573 *
574 * Special Case #1: when growing the filesystem, we "free" an extent when
575 * growing the last AG. This extent is new space and so it is not tracked as
576 * used space in the btree. The growfs code will pass in an owner of
577 * XFS_RMAP_OWN_NULL to indicate that it expected that there is no owner of this
578 * extent. We verify that - the extent lookup result in a record that does not
579 * overlap.
580 *
581 * Special Case #2: EFIs do not record the owner of the extent, so when
582 * recovering EFIs from the log we pass in XFS_RMAP_OWN_UNKNOWN to tell the rmap
583 * btree to ignore the owner (i.e. wildcard match) so we don't trigger
584 * corruption checks during log recovery.
585 */
586STATIC int
587xfs_rmap_unmap(
588 struct xfs_btree_cur *cur,
589 xfs_agblock_t bno,
590 xfs_extlen_t len,
591 bool unwritten,
592 const struct xfs_owner_info *oinfo)
593{
594 struct xfs_mount *mp = cur->bc_mp;
595 struct xfs_rmap_irec ltrec;
596 uint64_t ltoff;
597 int error = 0;
598 int i;
599 uint64_t owner;
600 uint64_t offset;
601 unsigned int flags;
602 bool ignore_off;
603
604 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
605 ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
606 (flags & XFS_RMAP_BMBT_BLOCK);
607 if (unwritten)
608 flags |= XFS_RMAP_UNWRITTEN;
609 trace_xfs_rmap_unmap(mp, cur->bc_ag.pag->pag_agno, bno, len,
610 unwritten, oinfo);
611
612 /*
613 * We should always have a left record because there's a static record
614 * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
615 * will not ever be removed from the tree.
616 */
617 error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, <rec, &i);
618 if (error)
619 goto out_error;
620 if (XFS_IS_CORRUPT(mp, i != 1)) {
621 error = -EFSCORRUPTED;
622 goto out_error;
623 }
624
625 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
626 cur->bc_ag.pag->pag_agno, ltrec.rm_startblock,
627 ltrec.rm_blockcount, ltrec.rm_owner,
628 ltrec.rm_offset, ltrec.rm_flags);
629 ltoff = ltrec.rm_offset;
630
631 /*
632 * For growfs, the incoming extent must be beyond the left record we
633 * just found as it is new space and won't be used by anyone. This is
634 * just a corruption check as we don't actually do anything with this
635 * extent. Note that we need to use >= instead of > because it might
636 * be the case that the "left" extent goes all the way to EOFS.
637 */
638 if (owner == XFS_RMAP_OWN_NULL) {
639 if (XFS_IS_CORRUPT(mp,
640 bno <
641 ltrec.rm_startblock + ltrec.rm_blockcount)) {
642 error = -EFSCORRUPTED;
643 goto out_error;
644 }
645 goto out_done;
646 }
647
648 /*
649 * If we're doing an unknown-owner removal for EFI recovery, we expect
650 * to find the full range in the rmapbt or nothing at all. If we
651 * don't find any rmaps overlapping either end of the range, we're
652 * done. Hopefully this means that the EFI creator already queued
653 * (and finished) a RUI to remove the rmap.
654 */
655 if (owner == XFS_RMAP_OWN_UNKNOWN &&
656 ltrec.rm_startblock + ltrec.rm_blockcount <= bno) {
657 struct xfs_rmap_irec rtrec;
658
659 error = xfs_btree_increment(cur, 0, &i);
660 if (error)
661 goto out_error;
662 if (i == 0)
663 goto out_done;
664 error = xfs_rmap_get_rec(cur, &rtrec, &i);
665 if (error)
666 goto out_error;
667 if (XFS_IS_CORRUPT(mp, i != 1)) {
668 error = -EFSCORRUPTED;
669 goto out_error;
670 }
671 if (rtrec.rm_startblock >= bno + len)
672 goto out_done;
673 }
674
675 /* Make sure the extent we found covers the entire freeing range. */
676 if (XFS_IS_CORRUPT(mp,
677 ltrec.rm_startblock > bno ||
678 ltrec.rm_startblock + ltrec.rm_blockcount <
679 bno + len)) {
680 error = -EFSCORRUPTED;
681 goto out_error;
682 }
683
684 /* Check owner information. */
685 error = xfs_rmap_free_check_owner(mp, ltoff, <rec, len, owner,
686 offset, flags);
687 if (error)
688 goto out_error;
689
690 if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
691 /* exact match, simply remove the record from rmap tree */
692 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
693 ltrec.rm_startblock, ltrec.rm_blockcount,
694 ltrec.rm_owner, ltrec.rm_offset,
695 ltrec.rm_flags);
696 error = xfs_btree_delete(cur, &i);
697 if (error)
698 goto out_error;
699 if (XFS_IS_CORRUPT(mp, i != 1)) {
700 error = -EFSCORRUPTED;
701 goto out_error;
702 }
703 } else if (ltrec.rm_startblock == bno) {
704 /*
705 * overlap left hand side of extent: move the start, trim the
706 * length and update the current record.
707 *
708 * ltbno ltlen
709 * Orig: |oooooooooooooooooooo|
710 * Freeing: |fffffffff|
711 * Result: |rrrrrrrrrr|
712 * bno len
713 */
714 ltrec.rm_startblock += len;
715 ltrec.rm_blockcount -= len;
716 if (!ignore_off)
717 ltrec.rm_offset += len;
718 error = xfs_rmap_update(cur, <rec);
719 if (error)
720 goto out_error;
721 } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
722 /*
723 * overlap right hand side of extent: trim the length and update
724 * the current record.
725 *
726 * ltbno ltlen
727 * Orig: |oooooooooooooooooooo|
728 * Freeing: |fffffffff|
729 * Result: |rrrrrrrrrr|
730 * bno len
731 */
732 ltrec.rm_blockcount -= len;
733 error = xfs_rmap_update(cur, <rec);
734 if (error)
735 goto out_error;
736 } else {
737
738 /*
739 * overlap middle of extent: trim the length of the existing
740 * record to the length of the new left-extent size, increment
741 * the insertion position so we can insert a new record
742 * containing the remaining right-extent space.
743 *
744 * ltbno ltlen
745 * Orig: |oooooooooooooooooooo|
746 * Freeing: |fffffffff|
747 * Result: |rrrrr| |rrrr|
748 * bno len
749 */
750 xfs_extlen_t orig_len = ltrec.rm_blockcount;
751
752 ltrec.rm_blockcount = bno - ltrec.rm_startblock;
753 error = xfs_rmap_update(cur, <rec);
754 if (error)
755 goto out_error;
756
757 error = xfs_btree_increment(cur, 0, &i);
758 if (error)
759 goto out_error;
760
761 cur->bc_rec.r.rm_startblock = bno + len;
762 cur->bc_rec.r.rm_blockcount = orig_len - len -
763 ltrec.rm_blockcount;
764 cur->bc_rec.r.rm_owner = ltrec.rm_owner;
765 if (ignore_off)
766 cur->bc_rec.r.rm_offset = 0;
767 else
768 cur->bc_rec.r.rm_offset = offset + len;
769 cur->bc_rec.r.rm_flags = flags;
770 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno,
771 cur->bc_rec.r.rm_startblock,
772 cur->bc_rec.r.rm_blockcount,
773 cur->bc_rec.r.rm_owner,
774 cur->bc_rec.r.rm_offset,
775 cur->bc_rec.r.rm_flags);
776 error = xfs_btree_insert(cur, &i);
777 if (error)
778 goto out_error;
779 }
780
781out_done:
782 trace_xfs_rmap_unmap_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
783 unwritten, oinfo);
784out_error:
785 if (error)
786 trace_xfs_rmap_unmap_error(mp, cur->bc_ag.pag->pag_agno,
787 error, _RET_IP_);
788 return error;
789}
790
791/*
792 * Remove a reference to an extent in the rmap btree.
793 */
794int
795xfs_rmap_free(
796 struct xfs_trans *tp,
797 struct xfs_buf *agbp,
798 struct xfs_perag *pag,
799 xfs_agblock_t bno,
800 xfs_extlen_t len,
801 const struct xfs_owner_info *oinfo)
802{
803 struct xfs_mount *mp = tp->t_mountp;
804 struct xfs_btree_cur *cur;
805 int error;
806
807 if (!xfs_has_rmapbt(mp))
808 return 0;
809
810 cur = xfs_rmapbt_init_cursor(mp, tp, agbp, pag);
811
812 error = xfs_rmap_unmap(cur, bno, len, false, oinfo);
813
814 xfs_btree_del_cursor(cur, error);
815 return error;
816}
817
818/*
819 * A mergeable rmap must have the same owner and the same values for
820 * the unwritten, attr_fork, and bmbt flags. The startblock and
821 * offset are checked separately.
822 */
823static bool
824xfs_rmap_is_mergeable(
825 struct xfs_rmap_irec *irec,
826 uint64_t owner,
827 unsigned int flags)
828{
829 if (irec->rm_owner == XFS_RMAP_OWN_NULL)
830 return false;
831 if (irec->rm_owner != owner)
832 return false;
833 if ((flags & XFS_RMAP_UNWRITTEN) ^
834 (irec->rm_flags & XFS_RMAP_UNWRITTEN))
835 return false;
836 if ((flags & XFS_RMAP_ATTR_FORK) ^
837 (irec->rm_flags & XFS_RMAP_ATTR_FORK))
838 return false;
839 if ((flags & XFS_RMAP_BMBT_BLOCK) ^
840 (irec->rm_flags & XFS_RMAP_BMBT_BLOCK))
841 return false;
842 return true;
843}
844
845/*
846 * When we allocate a new block, the first thing we do is add a reference to
847 * the extent in the rmap btree. This takes the form of a [agbno, length,
848 * owner, offset] record. Flags are encoded in the high bits of the offset
849 * field.
850 */
851STATIC int
852xfs_rmap_map(
853 struct xfs_btree_cur *cur,
854 xfs_agblock_t bno,
855 xfs_extlen_t len,
856 bool unwritten,
857 const struct xfs_owner_info *oinfo)
858{
859 struct xfs_mount *mp = cur->bc_mp;
860 struct xfs_rmap_irec ltrec;
861 struct xfs_rmap_irec gtrec;
862 int have_gt;
863 int have_lt;
864 int error = 0;
865 int i;
866 uint64_t owner;
867 uint64_t offset;
868 unsigned int flags = 0;
869 bool ignore_off;
870
871 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
872 ASSERT(owner != 0);
873 ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
874 (flags & XFS_RMAP_BMBT_BLOCK);
875 if (unwritten)
876 flags |= XFS_RMAP_UNWRITTEN;
877 trace_xfs_rmap_map(mp, cur->bc_ag.pag->pag_agno, bno, len,
878 unwritten, oinfo);
879 ASSERT(!xfs_rmap_should_skip_owner_update(oinfo));
880
881 /*
882 * For the initial lookup, look for an exact match or the left-adjacent
883 * record for our insertion point. This will also give us the record for
884 * start block contiguity tests.
885 */
886 error = xfs_rmap_lookup_le(cur, bno, owner, offset, flags, <rec,
887 &have_lt);
888 if (error)
889 goto out_error;
890 if (have_lt) {
891 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
892 cur->bc_ag.pag->pag_agno, ltrec.rm_startblock,
893 ltrec.rm_blockcount, ltrec.rm_owner,
894 ltrec.rm_offset, ltrec.rm_flags);
895
896 if (!xfs_rmap_is_mergeable(<rec, owner, flags))
897 have_lt = 0;
898 }
899
900 if (XFS_IS_CORRUPT(mp,
901 have_lt != 0 &&
902 ltrec.rm_startblock + ltrec.rm_blockcount > bno)) {
903 error = -EFSCORRUPTED;
904 goto out_error;
905 }
906
907 /*
908 * Increment the cursor to see if we have a right-adjacent record to our
909 * insertion point. This will give us the record for end block
910 * contiguity tests.
911 */
912 error = xfs_btree_increment(cur, 0, &have_gt);
913 if (error)
914 goto out_error;
915 if (have_gt) {
916 error = xfs_rmap_get_rec(cur, >rec, &have_gt);
917 if (error)
918 goto out_error;
919 if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
920 error = -EFSCORRUPTED;
921 goto out_error;
922 }
923 if (XFS_IS_CORRUPT(mp, bno + len > gtrec.rm_startblock)) {
924 error = -EFSCORRUPTED;
925 goto out_error;
926 }
927 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
928 cur->bc_ag.pag->pag_agno, gtrec.rm_startblock,
929 gtrec.rm_blockcount, gtrec.rm_owner,
930 gtrec.rm_offset, gtrec.rm_flags);
931 if (!xfs_rmap_is_mergeable(>rec, owner, flags))
932 have_gt = 0;
933 }
934
935 /*
936 * Note: cursor currently points one record to the right of ltrec, even
937 * if there is no record in the tree to the right.
938 */
939 if (have_lt &&
940 ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
941 (ignore_off || ltrec.rm_offset + ltrec.rm_blockcount == offset)) {
942 /*
943 * left edge contiguous, merge into left record.
944 *
945 * ltbno ltlen
946 * orig: |ooooooooo|
947 * adding: |aaaaaaaaa|
948 * result: |rrrrrrrrrrrrrrrrrrr|
949 * bno len
950 */
951 ltrec.rm_blockcount += len;
952 if (have_gt &&
953 bno + len == gtrec.rm_startblock &&
954 (ignore_off || offset + len == gtrec.rm_offset) &&
955 (unsigned long)ltrec.rm_blockcount + len +
956 gtrec.rm_blockcount <= XFS_RMAP_LEN_MAX) {
957 /*
958 * right edge also contiguous, delete right record
959 * and merge into left record.
960 *
961 * ltbno ltlen gtbno gtlen
962 * orig: |ooooooooo| |ooooooooo|
963 * adding: |aaaaaaaaa|
964 * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
965 */
966 ltrec.rm_blockcount += gtrec.rm_blockcount;
967 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
968 gtrec.rm_startblock,
969 gtrec.rm_blockcount,
970 gtrec.rm_owner,
971 gtrec.rm_offset,
972 gtrec.rm_flags);
973 error = xfs_btree_delete(cur, &i);
974 if (error)
975 goto out_error;
976 if (XFS_IS_CORRUPT(mp, i != 1)) {
977 error = -EFSCORRUPTED;
978 goto out_error;
979 }
980 }
981
982 /* point the cursor back to the left record and update */
983 error = xfs_btree_decrement(cur, 0, &have_gt);
984 if (error)
985 goto out_error;
986 error = xfs_rmap_update(cur, <rec);
987 if (error)
988 goto out_error;
989 } else if (have_gt &&
990 bno + len == gtrec.rm_startblock &&
991 (ignore_off || offset + len == gtrec.rm_offset)) {
992 /*
993 * right edge contiguous, merge into right record.
994 *
995 * gtbno gtlen
996 * Orig: |ooooooooo|
997 * adding: |aaaaaaaaa|
998 * Result: |rrrrrrrrrrrrrrrrrrr|
999 * bno len
1000 */
1001 gtrec.rm_startblock = bno;
1002 gtrec.rm_blockcount += len;
1003 if (!ignore_off)
1004 gtrec.rm_offset = offset;
1005 error = xfs_rmap_update(cur, >rec);
1006 if (error)
1007 goto out_error;
1008 } else {
1009 /*
1010 * no contiguous edge with identical owner, insert
1011 * new record at current cursor position.
1012 */
1013 cur->bc_rec.r.rm_startblock = bno;
1014 cur->bc_rec.r.rm_blockcount = len;
1015 cur->bc_rec.r.rm_owner = owner;
1016 cur->bc_rec.r.rm_offset = offset;
1017 cur->bc_rec.r.rm_flags = flags;
1018 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno, len,
1019 owner, offset, flags);
1020 error = xfs_btree_insert(cur, &i);
1021 if (error)
1022 goto out_error;
1023 if (XFS_IS_CORRUPT(mp, i != 1)) {
1024 error = -EFSCORRUPTED;
1025 goto out_error;
1026 }
1027 }
1028
1029 trace_xfs_rmap_map_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
1030 unwritten, oinfo);
1031out_error:
1032 if (error)
1033 trace_xfs_rmap_map_error(mp, cur->bc_ag.pag->pag_agno,
1034 error, _RET_IP_);
1035 return error;
1036}
1037
1038/*
1039 * Add a reference to an extent in the rmap btree.
1040 */
1041int
1042xfs_rmap_alloc(
1043 struct xfs_trans *tp,
1044 struct xfs_buf *agbp,
1045 struct xfs_perag *pag,
1046 xfs_agblock_t bno,
1047 xfs_extlen_t len,
1048 const struct xfs_owner_info *oinfo)
1049{
1050 struct xfs_mount *mp = tp->t_mountp;
1051 struct xfs_btree_cur *cur;
1052 int error;
1053
1054 if (!xfs_has_rmapbt(mp))
1055 return 0;
1056
1057 cur = xfs_rmapbt_init_cursor(mp, tp, agbp, pag);
1058 error = xfs_rmap_map(cur, bno, len, false, oinfo);
1059
1060 xfs_btree_del_cursor(cur, error);
1061 return error;
1062}
1063
1064#define RMAP_LEFT_CONTIG (1 << 0)
1065#define RMAP_RIGHT_CONTIG (1 << 1)
1066#define RMAP_LEFT_FILLING (1 << 2)
1067#define RMAP_RIGHT_FILLING (1 << 3)
1068#define RMAP_LEFT_VALID (1 << 6)
1069#define RMAP_RIGHT_VALID (1 << 7)
1070
1071#define LEFT r[0]
1072#define RIGHT r[1]
1073#define PREV r[2]
1074#define NEW r[3]
1075
1076/*
1077 * Convert an unwritten extent to a real extent or vice versa.
1078 * Does not handle overlapping extents.
1079 */
1080STATIC int
1081xfs_rmap_convert(
1082 struct xfs_btree_cur *cur,
1083 xfs_agblock_t bno,
1084 xfs_extlen_t len,
1085 bool unwritten,
1086 const struct xfs_owner_info *oinfo)
1087{
1088 struct xfs_mount *mp = cur->bc_mp;
1089 struct xfs_rmap_irec r[4]; /* neighbor extent entries */
1090 /* left is 0, right is 1, */
1091 /* prev is 2, new is 3 */
1092 uint64_t owner;
1093 uint64_t offset;
1094 uint64_t new_endoff;
1095 unsigned int oldext;
1096 unsigned int newext;
1097 unsigned int flags = 0;
1098 int i;
1099 int state = 0;
1100 int error;
1101
1102 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
1103 ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
1104 (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
1105 oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
1106 new_endoff = offset + len;
1107 trace_xfs_rmap_convert(mp, cur->bc_ag.pag->pag_agno, bno, len,
1108 unwritten, oinfo);
1109
1110 /*
1111 * For the initial lookup, look for an exact match or the left-adjacent
1112 * record for our insertion point. This will also give us the record for
1113 * start block contiguity tests.
1114 */
1115 error = xfs_rmap_lookup_le(cur, bno, owner, offset, oldext, &PREV, &i);
1116 if (error)
1117 goto done;
1118 if (XFS_IS_CORRUPT(mp, i != 1)) {
1119 error = -EFSCORRUPTED;
1120 goto done;
1121 }
1122
1123 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
1124 cur->bc_ag.pag->pag_agno, PREV.rm_startblock,
1125 PREV.rm_blockcount, PREV.rm_owner,
1126 PREV.rm_offset, PREV.rm_flags);
1127
1128 ASSERT(PREV.rm_offset <= offset);
1129 ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
1130 ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
1131 newext = ~oldext & XFS_RMAP_UNWRITTEN;
1132
1133 /*
1134 * Set flags determining what part of the previous oldext allocation
1135 * extent is being replaced by a newext allocation.
1136 */
1137 if (PREV.rm_offset == offset)
1138 state |= RMAP_LEFT_FILLING;
1139 if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
1140 state |= RMAP_RIGHT_FILLING;
1141
1142 /*
1143 * Decrement the cursor to see if we have a left-adjacent record to our
1144 * insertion point. This will give us the record for end block
1145 * contiguity tests.
1146 */
1147 error = xfs_btree_decrement(cur, 0, &i);
1148 if (error)
1149 goto done;
1150 if (i) {
1151 state |= RMAP_LEFT_VALID;
1152 error = xfs_rmap_get_rec(cur, &LEFT, &i);
1153 if (error)
1154 goto done;
1155 if (XFS_IS_CORRUPT(mp, i != 1)) {
1156 error = -EFSCORRUPTED;
1157 goto done;
1158 }
1159 if (XFS_IS_CORRUPT(mp,
1160 LEFT.rm_startblock + LEFT.rm_blockcount >
1161 bno)) {
1162 error = -EFSCORRUPTED;
1163 goto done;
1164 }
1165 trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
1166 cur->bc_ag.pag->pag_agno, LEFT.rm_startblock,
1167 LEFT.rm_blockcount, LEFT.rm_owner,
1168 LEFT.rm_offset, LEFT.rm_flags);
1169 if (LEFT.rm_startblock + LEFT.rm_blockcount == bno &&
1170 LEFT.rm_offset + LEFT.rm_blockcount == offset &&
1171 xfs_rmap_is_mergeable(&LEFT, owner, newext))
1172 state |= RMAP_LEFT_CONTIG;
1173 }
1174
1175 /*
1176 * Increment the cursor to see if we have a right-adjacent record to our
1177 * insertion point. This will give us the record for end block
1178 * contiguity tests.
1179 */
1180 error = xfs_btree_increment(cur, 0, &i);
1181 if (error)
1182 goto done;
1183 if (XFS_IS_CORRUPT(mp, i != 1)) {
1184 error = -EFSCORRUPTED;
1185 goto done;
1186 }
1187 error = xfs_btree_increment(cur, 0, &i);
1188 if (error)
1189 goto done;
1190 if (i) {
1191 state |= RMAP_RIGHT_VALID;
1192 error = xfs_rmap_get_rec(cur, &RIGHT, &i);
1193 if (error)
1194 goto done;
1195 if (XFS_IS_CORRUPT(mp, i != 1)) {
1196 error = -EFSCORRUPTED;
1197 goto done;
1198 }
1199 if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
1200 error = -EFSCORRUPTED;
1201 goto done;
1202 }
1203 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
1204 cur->bc_ag.pag->pag_agno, RIGHT.rm_startblock,
1205 RIGHT.rm_blockcount, RIGHT.rm_owner,
1206 RIGHT.rm_offset, RIGHT.rm_flags);
1207 if (bno + len == RIGHT.rm_startblock &&
1208 offset + len == RIGHT.rm_offset &&
1209 xfs_rmap_is_mergeable(&RIGHT, owner, newext))
1210 state |= RMAP_RIGHT_CONTIG;
1211 }
1212
1213 /* check that left + prev + right is not too long */
1214 if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1215 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
1216 (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1217 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
1218 (unsigned long)LEFT.rm_blockcount + len +
1219 RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
1220 state &= ~RMAP_RIGHT_CONTIG;
1221
1222 trace_xfs_rmap_convert_state(mp, cur->bc_ag.pag->pag_agno, state,
1223 _RET_IP_);
1224
1225 /* reset the cursor back to PREV */
1226 error = xfs_rmap_lookup_le(cur, bno, owner, offset, oldext, NULL, &i);
1227 if (error)
1228 goto done;
1229 if (XFS_IS_CORRUPT(mp, i != 1)) {
1230 error = -EFSCORRUPTED;
1231 goto done;
1232 }
1233
1234 /*
1235 * Switch out based on the FILLING and CONTIG state bits.
1236 */
1237 switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1238 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
1239 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1240 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1241 /*
1242 * Setting all of a previous oldext extent to newext.
1243 * The left and right neighbors are both contiguous with new.
1244 */
1245 error = xfs_btree_increment(cur, 0, &i);
1246 if (error)
1247 goto done;
1248 if (XFS_IS_CORRUPT(mp, i != 1)) {
1249 error = -EFSCORRUPTED;
1250 goto done;
1251 }
1252 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
1253 RIGHT.rm_startblock, RIGHT.rm_blockcount,
1254 RIGHT.rm_owner, RIGHT.rm_offset,
1255 RIGHT.rm_flags);
1256 error = xfs_btree_delete(cur, &i);
1257 if (error)
1258 goto done;
1259 if (XFS_IS_CORRUPT(mp, i != 1)) {
1260 error = -EFSCORRUPTED;
1261 goto done;
1262 }
1263 error = xfs_btree_decrement(cur, 0, &i);
1264 if (error)
1265 goto done;
1266 if (XFS_IS_CORRUPT(mp, i != 1)) {
1267 error = -EFSCORRUPTED;
1268 goto done;
1269 }
1270 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
1271 PREV.rm_startblock, PREV.rm_blockcount,
1272 PREV.rm_owner, PREV.rm_offset,
1273 PREV.rm_flags);
1274 error = xfs_btree_delete(cur, &i);
1275 if (error)
1276 goto done;
1277 if (XFS_IS_CORRUPT(mp, i != 1)) {
1278 error = -EFSCORRUPTED;
1279 goto done;
1280 }
1281 error = xfs_btree_decrement(cur, 0, &i);
1282 if (error)
1283 goto done;
1284 if (XFS_IS_CORRUPT(mp, i != 1)) {
1285 error = -EFSCORRUPTED;
1286 goto done;
1287 }
1288 NEW = LEFT;
1289 NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
1290 error = xfs_rmap_update(cur, &NEW);
1291 if (error)
1292 goto done;
1293 break;
1294
1295 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1296 /*
1297 * Setting all of a previous oldext extent to newext.
1298 * The left neighbor is contiguous, the right is not.
1299 */
1300 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
1301 PREV.rm_startblock, PREV.rm_blockcount,
1302 PREV.rm_owner, PREV.rm_offset,
1303 PREV.rm_flags);
1304 error = xfs_btree_delete(cur, &i);
1305 if (error)
1306 goto done;
1307 if (XFS_IS_CORRUPT(mp, i != 1)) {
1308 error = -EFSCORRUPTED;
1309 goto done;
1310 }
1311 error = xfs_btree_decrement(cur, 0, &i);
1312 if (error)
1313 goto done;
1314 if (XFS_IS_CORRUPT(mp, i != 1)) {
1315 error = -EFSCORRUPTED;
1316 goto done;
1317 }
1318 NEW = LEFT;
1319 NEW.rm_blockcount += PREV.rm_blockcount;
1320 error = xfs_rmap_update(cur, &NEW);
1321 if (error)
1322 goto done;
1323 break;
1324
1325 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1326 /*
1327 * Setting all of a previous oldext extent to newext.
1328 * The right neighbor is contiguous, the left is not.
1329 */
1330 error = xfs_btree_increment(cur, 0, &i);
1331 if (error)
1332 goto done;
1333 if (XFS_IS_CORRUPT(mp, i != 1)) {
1334 error = -EFSCORRUPTED;
1335 goto done;
1336 }
1337 trace_xfs_rmap_delete(mp, cur->bc_ag.pag->pag_agno,
1338 RIGHT.rm_startblock, RIGHT.rm_blockcount,
1339 RIGHT.rm_owner, RIGHT.rm_offset,
1340 RIGHT.rm_flags);
1341 error = xfs_btree_delete(cur, &i);
1342 if (error)
1343 goto done;
1344 if (XFS_IS_CORRUPT(mp, i != 1)) {
1345 error = -EFSCORRUPTED;
1346 goto done;
1347 }
1348 error = xfs_btree_decrement(cur, 0, &i);
1349 if (error)
1350 goto done;
1351 if (XFS_IS_CORRUPT(mp, i != 1)) {
1352 error = -EFSCORRUPTED;
1353 goto done;
1354 }
1355 NEW = PREV;
1356 NEW.rm_blockcount = len + RIGHT.rm_blockcount;
1357 NEW.rm_flags = newext;
1358 error = xfs_rmap_update(cur, &NEW);
1359 if (error)
1360 goto done;
1361 break;
1362
1363 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
1364 /*
1365 * Setting all of a previous oldext extent to newext.
1366 * Neither the left nor right neighbors are contiguous with
1367 * the new one.
1368 */
1369 NEW = PREV;
1370 NEW.rm_flags = newext;
1371 error = xfs_rmap_update(cur, &NEW);
1372 if (error)
1373 goto done;
1374 break;
1375
1376 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
1377 /*
1378 * Setting the first part of a previous oldext extent to newext.
1379 * The left neighbor is contiguous.
1380 */
1381 NEW = PREV;
1382 NEW.rm_offset += len;
1383 NEW.rm_startblock += len;
1384 NEW.rm_blockcount -= len;
1385 error = xfs_rmap_update(cur, &NEW);
1386 if (error)
1387 goto done;
1388 error = xfs_btree_decrement(cur, 0, &i);
1389 if (error)
1390 goto done;
1391 NEW = LEFT;
1392 NEW.rm_blockcount += len;
1393 error = xfs_rmap_update(cur, &NEW);
1394 if (error)
1395 goto done;
1396 break;
1397
1398 case RMAP_LEFT_FILLING:
1399 /*
1400 * Setting the first part of a previous oldext extent to newext.
1401 * The left neighbor is not contiguous.
1402 */
1403 NEW = PREV;
1404 NEW.rm_startblock += len;
1405 NEW.rm_offset += len;
1406 NEW.rm_blockcount -= len;
1407 error = xfs_rmap_update(cur, &NEW);
1408 if (error)
1409 goto done;
1410 NEW.rm_startblock = bno;
1411 NEW.rm_owner = owner;
1412 NEW.rm_offset = offset;
1413 NEW.rm_blockcount = len;
1414 NEW.rm_flags = newext;
1415 cur->bc_rec.r = NEW;
1416 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno,
1417 len, owner, offset, newext);
1418 error = xfs_btree_insert(cur, &i);
1419 if (error)
1420 goto done;
1421 if (XFS_IS_CORRUPT(mp, i != 1)) {
1422 error = -EFSCORRUPTED;
1423 goto done;
1424 }
1425 break;
1426
1427 case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1428 /*
1429 * Setting the last part of a previous oldext extent to newext.
1430 * The right neighbor is contiguous with the new allocation.
1431 */
1432 NEW = PREV;
1433 NEW.rm_blockcount -= len;
1434 error = xfs_rmap_update(cur, &NEW);
1435 if (error)
1436 goto done;
1437 error = xfs_btree_increment(cur, 0, &i);
1438 if (error)
1439 goto done;
1440 NEW = RIGHT;
1441 NEW.rm_offset = offset;
1442 NEW.rm_startblock = bno;
1443 NEW.rm_blockcount += len;
1444 error = xfs_rmap_update(cur, &NEW);
1445 if (error)
1446 goto done;
1447 break;
1448
1449 case RMAP_RIGHT_FILLING:
1450 /*
1451 * Setting the last part of a previous oldext extent to newext.
1452 * The right neighbor is not contiguous.
1453 */
1454 NEW = PREV;
1455 NEW.rm_blockcount -= len;
1456 error = xfs_rmap_update(cur, &NEW);
1457 if (error)
1458 goto done;
1459 error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
1460 oldext, &i);
1461 if (error)
1462 goto done;
1463 if (XFS_IS_CORRUPT(mp, i != 0)) {
1464 error = -EFSCORRUPTED;
1465 goto done;
1466 }
1467 NEW.rm_startblock = bno;
1468 NEW.rm_owner = owner;
1469 NEW.rm_offset = offset;
1470 NEW.rm_blockcount = len;
1471 NEW.rm_flags = newext;
1472 cur->bc_rec.r = NEW;
1473 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno,
1474 len, owner, offset, newext);
1475 error = xfs_btree_insert(cur, &i);
1476 if (error)
1477 goto done;
1478 if (XFS_IS_CORRUPT(mp, i != 1)) {
1479 error = -EFSCORRUPTED;
1480 goto done;
1481 }
1482 break;
1483
1484 case 0:
1485 /*
1486 * Setting the middle part of a previous oldext extent to
1487 * newext. Contiguity is impossible here.
1488 * One extent becomes three extents.
1489 */
1490 /* new right extent - oldext */
1491 NEW.rm_startblock = bno + len;
1492 NEW.rm_owner = owner;
1493 NEW.rm_offset = new_endoff;
1494 NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
1495 new_endoff;
1496 NEW.rm_flags = PREV.rm_flags;
1497 error = xfs_rmap_update(cur, &NEW);
1498 if (error)
1499 goto done;
1500 /* new left extent - oldext */
1501 NEW = PREV;
1502 NEW.rm_blockcount = offset - PREV.rm_offset;
1503 cur->bc_rec.r = NEW;
1504 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno,
1505 NEW.rm_startblock, NEW.rm_blockcount,
1506 NEW.rm_owner, NEW.rm_offset,
1507 NEW.rm_flags);
1508 error = xfs_btree_insert(cur, &i);
1509 if (error)
1510 goto done;
1511 if (XFS_IS_CORRUPT(mp, i != 1)) {
1512 error = -EFSCORRUPTED;
1513 goto done;
1514 }
1515 /*
1516 * Reset the cursor to the position of the new extent
1517 * we are about to insert as we can't trust it after
1518 * the previous insert.
1519 */
1520 error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
1521 oldext, &i);
1522 if (error)
1523 goto done;
1524 if (XFS_IS_CORRUPT(mp, i != 0)) {
1525 error = -EFSCORRUPTED;
1526 goto done;
1527 }
1528 /* new middle extent - newext */
1529 cur->bc_rec.r.rm_flags &= ~XFS_RMAP_UNWRITTEN;
1530 cur->bc_rec.r.rm_flags |= newext;
1531 trace_xfs_rmap_insert(mp, cur->bc_ag.pag->pag_agno, bno, len,
1532 owner, offset, newext);
1533 error = xfs_btree_insert(cur, &i);
1534 if (error)
1535 goto done;
1536 if (XFS_IS_CORRUPT(mp, i != 1)) {
1537 error = -EFSCORRUPTED;
1538 goto done;
1539 }
1540 break;
1541
1542 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1543 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1544 case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
1545 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1546 case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1547 case RMAP_LEFT_CONTIG:
1548 case RMAP_RIGHT_CONTIG:
1549 /*
1550 * These cases are all impossible.
1551 */
1552 ASSERT(0);
1553 }
1554
1555 trace_xfs_rmap_convert_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
1556 unwritten, oinfo);
1557done:
1558 if (error)
1559 trace_xfs_rmap_convert_error(cur->bc_mp,
1560 cur->bc_ag.pag->pag_agno, error, _RET_IP_);
1561 return error;
1562}
1563
1564/*
1565 * Convert an unwritten extent to a real extent or vice versa. If there is no
1566 * possibility of overlapping extents, delegate to the simpler convert
1567 * function.
1568 */
1569STATIC int
1570xfs_rmap_convert_shared(
1571 struct xfs_btree_cur *cur,
1572 xfs_agblock_t bno,
1573 xfs_extlen_t len,
1574 bool unwritten,
1575 const struct xfs_owner_info *oinfo)
1576{
1577 struct xfs_mount *mp = cur->bc_mp;
1578 struct xfs_rmap_irec r[4]; /* neighbor extent entries */
1579 /* left is 0, right is 1, */
1580 /* prev is 2, new is 3 */
1581 uint64_t owner;
1582 uint64_t offset;
1583 uint64_t new_endoff;
1584 unsigned int oldext;
1585 unsigned int newext;
1586 unsigned int flags = 0;
1587 int i;
1588 int state = 0;
1589 int error;
1590
1591 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
1592 ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
1593 (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
1594 oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
1595 new_endoff = offset + len;
1596 trace_xfs_rmap_convert(mp, cur->bc_ag.pag->pag_agno, bno, len,
1597 unwritten, oinfo);
1598
1599 /*
1600 * For the initial lookup, look for and exact match or the left-adjacent
1601 * record for our insertion point. This will also give us the record for
1602 * start block contiguity tests.
1603 */
1604 error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, oldext,
1605 &PREV, &i);
1606 if (error)
1607 goto done;
1608 if (XFS_IS_CORRUPT(mp, i != 1)) {
1609 error = -EFSCORRUPTED;
1610 goto done;
1611 }
1612
1613 ASSERT(PREV.rm_offset <= offset);
1614 ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
1615 ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
1616 newext = ~oldext & XFS_RMAP_UNWRITTEN;
1617
1618 /*
1619 * Set flags determining what part of the previous oldext allocation
1620 * extent is being replaced by a newext allocation.
1621 */
1622 if (PREV.rm_offset == offset)
1623 state |= RMAP_LEFT_FILLING;
1624 if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
1625 state |= RMAP_RIGHT_FILLING;
1626
1627 /* Is there a left record that abuts our range? */
1628 error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, newext,
1629 &LEFT, &i);
1630 if (error)
1631 goto done;
1632 if (i) {
1633 state |= RMAP_LEFT_VALID;
1634 if (XFS_IS_CORRUPT(mp,
1635 LEFT.rm_startblock + LEFT.rm_blockcount >
1636 bno)) {
1637 error = -EFSCORRUPTED;
1638 goto done;
1639 }
1640 if (xfs_rmap_is_mergeable(&LEFT, owner, newext))
1641 state |= RMAP_LEFT_CONTIG;
1642 }
1643
1644 /* Is there a right record that abuts our range? */
1645 error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
1646 newext, &i);
1647 if (error)
1648 goto done;
1649 if (i) {
1650 state |= RMAP_RIGHT_VALID;
1651 error = xfs_rmap_get_rec(cur, &RIGHT, &i);
1652 if (error)
1653 goto done;
1654 if (XFS_IS_CORRUPT(mp, i != 1)) {
1655 error = -EFSCORRUPTED;
1656 goto done;
1657 }
1658 if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
1659 error = -EFSCORRUPTED;
1660 goto done;
1661 }
1662 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
1663 cur->bc_ag.pag->pag_agno, RIGHT.rm_startblock,
1664 RIGHT.rm_blockcount, RIGHT.rm_owner,
1665 RIGHT.rm_offset, RIGHT.rm_flags);
1666 if (xfs_rmap_is_mergeable(&RIGHT, owner, newext))
1667 state |= RMAP_RIGHT_CONTIG;
1668 }
1669
1670 /* check that left + prev + right is not too long */
1671 if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1672 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
1673 (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1674 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
1675 (unsigned long)LEFT.rm_blockcount + len +
1676 RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
1677 state &= ~RMAP_RIGHT_CONTIG;
1678
1679 trace_xfs_rmap_convert_state(mp, cur->bc_ag.pag->pag_agno, state,
1680 _RET_IP_);
1681 /*
1682 * Switch out based on the FILLING and CONTIG state bits.
1683 */
1684 switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1685 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
1686 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1687 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1688 /*
1689 * Setting all of a previous oldext extent to newext.
1690 * The left and right neighbors are both contiguous with new.
1691 */
1692 error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
1693 RIGHT.rm_blockcount, RIGHT.rm_owner,
1694 RIGHT.rm_offset, RIGHT.rm_flags);
1695 if (error)
1696 goto done;
1697 error = xfs_rmap_delete(cur, PREV.rm_startblock,
1698 PREV.rm_blockcount, PREV.rm_owner,
1699 PREV.rm_offset, PREV.rm_flags);
1700 if (error)
1701 goto done;
1702 NEW = LEFT;
1703 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1704 NEW.rm_blockcount, NEW.rm_owner,
1705 NEW.rm_offset, NEW.rm_flags, &i);
1706 if (error)
1707 goto done;
1708 if (XFS_IS_CORRUPT(mp, i != 1)) {
1709 error = -EFSCORRUPTED;
1710 goto done;
1711 }
1712 NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
1713 error = xfs_rmap_update(cur, &NEW);
1714 if (error)
1715 goto done;
1716 break;
1717
1718 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1719 /*
1720 * Setting all of a previous oldext extent to newext.
1721 * The left neighbor is contiguous, the right is not.
1722 */
1723 error = xfs_rmap_delete(cur, PREV.rm_startblock,
1724 PREV.rm_blockcount, PREV.rm_owner,
1725 PREV.rm_offset, PREV.rm_flags);
1726 if (error)
1727 goto done;
1728 NEW = LEFT;
1729 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1730 NEW.rm_blockcount, NEW.rm_owner,
1731 NEW.rm_offset, NEW.rm_flags, &i);
1732 if (error)
1733 goto done;
1734 if (XFS_IS_CORRUPT(mp, i != 1)) {
1735 error = -EFSCORRUPTED;
1736 goto done;
1737 }
1738 NEW.rm_blockcount += PREV.rm_blockcount;
1739 error = xfs_rmap_update(cur, &NEW);
1740 if (error)
1741 goto done;
1742 break;
1743
1744 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1745 /*
1746 * Setting all of a previous oldext extent to newext.
1747 * The right neighbor is contiguous, the left is not.
1748 */
1749 error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
1750 RIGHT.rm_blockcount, RIGHT.rm_owner,
1751 RIGHT.rm_offset, RIGHT.rm_flags);
1752 if (error)
1753 goto done;
1754 NEW = PREV;
1755 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1756 NEW.rm_blockcount, NEW.rm_owner,
1757 NEW.rm_offset, NEW.rm_flags, &i);
1758 if (error)
1759 goto done;
1760 if (XFS_IS_CORRUPT(mp, i != 1)) {
1761 error = -EFSCORRUPTED;
1762 goto done;
1763 }
1764 NEW.rm_blockcount += RIGHT.rm_blockcount;
1765 NEW.rm_flags = RIGHT.rm_flags;
1766 error = xfs_rmap_update(cur, &NEW);
1767 if (error)
1768 goto done;
1769 break;
1770
1771 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
1772 /*
1773 * Setting all of a previous oldext extent to newext.
1774 * Neither the left nor right neighbors are contiguous with
1775 * the new one.
1776 */
1777 NEW = PREV;
1778 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1779 NEW.rm_blockcount, NEW.rm_owner,
1780 NEW.rm_offset, NEW.rm_flags, &i);
1781 if (error)
1782 goto done;
1783 if (XFS_IS_CORRUPT(mp, i != 1)) {
1784 error = -EFSCORRUPTED;
1785 goto done;
1786 }
1787 NEW.rm_flags = newext;
1788 error = xfs_rmap_update(cur, &NEW);
1789 if (error)
1790 goto done;
1791 break;
1792
1793 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
1794 /*
1795 * Setting the first part of a previous oldext extent to newext.
1796 * The left neighbor is contiguous.
1797 */
1798 NEW = PREV;
1799 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1800 NEW.rm_blockcount, NEW.rm_owner,
1801 NEW.rm_offset, NEW.rm_flags);
1802 if (error)
1803 goto done;
1804 NEW.rm_offset += len;
1805 NEW.rm_startblock += len;
1806 NEW.rm_blockcount -= len;
1807 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1808 NEW.rm_blockcount, NEW.rm_owner,
1809 NEW.rm_offset, NEW.rm_flags);
1810 if (error)
1811 goto done;
1812 NEW = LEFT;
1813 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1814 NEW.rm_blockcount, NEW.rm_owner,
1815 NEW.rm_offset, NEW.rm_flags, &i);
1816 if (error)
1817 goto done;
1818 if (XFS_IS_CORRUPT(mp, i != 1)) {
1819 error = -EFSCORRUPTED;
1820 goto done;
1821 }
1822 NEW.rm_blockcount += len;
1823 error = xfs_rmap_update(cur, &NEW);
1824 if (error)
1825 goto done;
1826 break;
1827
1828 case RMAP_LEFT_FILLING:
1829 /*
1830 * Setting the first part of a previous oldext extent to newext.
1831 * The left neighbor is not contiguous.
1832 */
1833 NEW = PREV;
1834 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1835 NEW.rm_blockcount, NEW.rm_owner,
1836 NEW.rm_offset, NEW.rm_flags);
1837 if (error)
1838 goto done;
1839 NEW.rm_offset += len;
1840 NEW.rm_startblock += len;
1841 NEW.rm_blockcount -= len;
1842 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1843 NEW.rm_blockcount, NEW.rm_owner,
1844 NEW.rm_offset, NEW.rm_flags);
1845 if (error)
1846 goto done;
1847 error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
1848 if (error)
1849 goto done;
1850 break;
1851
1852 case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1853 /*
1854 * Setting the last part of a previous oldext extent to newext.
1855 * The right neighbor is contiguous with the new allocation.
1856 */
1857 NEW = PREV;
1858 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1859 NEW.rm_blockcount, NEW.rm_owner,
1860 NEW.rm_offset, NEW.rm_flags, &i);
1861 if (error)
1862 goto done;
1863 if (XFS_IS_CORRUPT(mp, i != 1)) {
1864 error = -EFSCORRUPTED;
1865 goto done;
1866 }
1867 NEW.rm_blockcount = offset - NEW.rm_offset;
1868 error = xfs_rmap_update(cur, &NEW);
1869 if (error)
1870 goto done;
1871 NEW = RIGHT;
1872 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1873 NEW.rm_blockcount, NEW.rm_owner,
1874 NEW.rm_offset, NEW.rm_flags);
1875 if (error)
1876 goto done;
1877 NEW.rm_offset = offset;
1878 NEW.rm_startblock = bno;
1879 NEW.rm_blockcount += len;
1880 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1881 NEW.rm_blockcount, NEW.rm_owner,
1882 NEW.rm_offset, NEW.rm_flags);
1883 if (error)
1884 goto done;
1885 break;
1886
1887 case RMAP_RIGHT_FILLING:
1888 /*
1889 * Setting the last part of a previous oldext extent to newext.
1890 * The right neighbor is not contiguous.
1891 */
1892 NEW = PREV;
1893 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1894 NEW.rm_blockcount, NEW.rm_owner,
1895 NEW.rm_offset, NEW.rm_flags, &i);
1896 if (error)
1897 goto done;
1898 if (XFS_IS_CORRUPT(mp, i != 1)) {
1899 error = -EFSCORRUPTED;
1900 goto done;
1901 }
1902 NEW.rm_blockcount -= len;
1903 error = xfs_rmap_update(cur, &NEW);
1904 if (error)
1905 goto done;
1906 error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
1907 if (error)
1908 goto done;
1909 break;
1910
1911 case 0:
1912 /*
1913 * Setting the middle part of a previous oldext extent to
1914 * newext. Contiguity is impossible here.
1915 * One extent becomes three extents.
1916 */
1917 /* new right extent - oldext */
1918 NEW.rm_startblock = bno + len;
1919 NEW.rm_owner = owner;
1920 NEW.rm_offset = new_endoff;
1921 NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
1922 new_endoff;
1923 NEW.rm_flags = PREV.rm_flags;
1924 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1925 NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
1926 NEW.rm_flags);
1927 if (error)
1928 goto done;
1929 /* new left extent - oldext */
1930 NEW = PREV;
1931 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1932 NEW.rm_blockcount, NEW.rm_owner,
1933 NEW.rm_offset, NEW.rm_flags, &i);
1934 if (error)
1935 goto done;
1936 if (XFS_IS_CORRUPT(mp, i != 1)) {
1937 error = -EFSCORRUPTED;
1938 goto done;
1939 }
1940 NEW.rm_blockcount = offset - NEW.rm_offset;
1941 error = xfs_rmap_update(cur, &NEW);
1942 if (error)
1943 goto done;
1944 /* new middle extent - newext */
1945 NEW.rm_startblock = bno;
1946 NEW.rm_blockcount = len;
1947 NEW.rm_owner = owner;
1948 NEW.rm_offset = offset;
1949 NEW.rm_flags = newext;
1950 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1951 NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
1952 NEW.rm_flags);
1953 if (error)
1954 goto done;
1955 break;
1956
1957 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1958 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1959 case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
1960 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1961 case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1962 case RMAP_LEFT_CONTIG:
1963 case RMAP_RIGHT_CONTIG:
1964 /*
1965 * These cases are all impossible.
1966 */
1967 ASSERT(0);
1968 }
1969
1970 trace_xfs_rmap_convert_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
1971 unwritten, oinfo);
1972done:
1973 if (error)
1974 trace_xfs_rmap_convert_error(cur->bc_mp,
1975 cur->bc_ag.pag->pag_agno, error, _RET_IP_);
1976 return error;
1977}
1978
1979#undef NEW
1980#undef LEFT
1981#undef RIGHT
1982#undef PREV
1983
1984/*
1985 * Find an extent in the rmap btree and unmap it. For rmap extent types that
1986 * can overlap (data fork rmaps on reflink filesystems) we must be careful
1987 * that the prev/next records in the btree might belong to another owner.
1988 * Therefore we must use delete+insert to alter any of the key fields.
1989 *
1990 * For every other situation there can only be one owner for a given extent,
1991 * so we can call the regular _free function.
1992 */
1993STATIC int
1994xfs_rmap_unmap_shared(
1995 struct xfs_btree_cur *cur,
1996 xfs_agblock_t bno,
1997 xfs_extlen_t len,
1998 bool unwritten,
1999 const struct xfs_owner_info *oinfo)
2000{
2001 struct xfs_mount *mp = cur->bc_mp;
2002 struct xfs_rmap_irec ltrec;
2003 uint64_t ltoff;
2004 int error = 0;
2005 int i;
2006 uint64_t owner;
2007 uint64_t offset;
2008 unsigned int flags;
2009
2010 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
2011 if (unwritten)
2012 flags |= XFS_RMAP_UNWRITTEN;
2013 trace_xfs_rmap_unmap(mp, cur->bc_ag.pag->pag_agno, bno, len,
2014 unwritten, oinfo);
2015
2016 /*
2017 * We should always have a left record because there's a static record
2018 * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
2019 * will not ever be removed from the tree.
2020 */
2021 error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, flags,
2022 <rec, &i);
2023 if (error)
2024 goto out_error;
2025 if (XFS_IS_CORRUPT(mp, i != 1)) {
2026 error = -EFSCORRUPTED;
2027 goto out_error;
2028 }
2029 ltoff = ltrec.rm_offset;
2030
2031 /* Make sure the extent we found covers the entire freeing range. */
2032 if (XFS_IS_CORRUPT(mp,
2033 ltrec.rm_startblock > bno ||
2034 ltrec.rm_startblock + ltrec.rm_blockcount <
2035 bno + len)) {
2036 error = -EFSCORRUPTED;
2037 goto out_error;
2038 }
2039
2040 /* Make sure the owner matches what we expect to find in the tree. */
2041 if (XFS_IS_CORRUPT(mp, owner != ltrec.rm_owner)) {
2042 error = -EFSCORRUPTED;
2043 goto out_error;
2044 }
2045
2046 /* Make sure the unwritten flag matches. */
2047 if (XFS_IS_CORRUPT(mp,
2048 (flags & XFS_RMAP_UNWRITTEN) !=
2049 (ltrec.rm_flags & XFS_RMAP_UNWRITTEN))) {
2050 error = -EFSCORRUPTED;
2051 goto out_error;
2052 }
2053
2054 /* Check the offset. */
2055 if (XFS_IS_CORRUPT(mp, ltrec.rm_offset > offset)) {
2056 error = -EFSCORRUPTED;
2057 goto out_error;
2058 }
2059 if (XFS_IS_CORRUPT(mp, offset > ltoff + ltrec.rm_blockcount)) {
2060 error = -EFSCORRUPTED;
2061 goto out_error;
2062 }
2063
2064 if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
2065 /* Exact match, simply remove the record from rmap tree. */
2066 error = xfs_rmap_delete(cur, ltrec.rm_startblock,
2067 ltrec.rm_blockcount, ltrec.rm_owner,
2068 ltrec.rm_offset, ltrec.rm_flags);
2069 if (error)
2070 goto out_error;
2071 } else if (ltrec.rm_startblock == bno) {
2072 /*
2073 * Overlap left hand side of extent: move the start, trim the
2074 * length and update the current record.
2075 *
2076 * ltbno ltlen
2077 * Orig: |oooooooooooooooooooo|
2078 * Freeing: |fffffffff|
2079 * Result: |rrrrrrrrrr|
2080 * bno len
2081 */
2082
2083 /* Delete prev rmap. */
2084 error = xfs_rmap_delete(cur, ltrec.rm_startblock,
2085 ltrec.rm_blockcount, ltrec.rm_owner,
2086 ltrec.rm_offset, ltrec.rm_flags);
2087 if (error)
2088 goto out_error;
2089
2090 /* Add an rmap at the new offset. */
2091 ltrec.rm_startblock += len;
2092 ltrec.rm_blockcount -= len;
2093 ltrec.rm_offset += len;
2094 error = xfs_rmap_insert(cur, ltrec.rm_startblock,
2095 ltrec.rm_blockcount, ltrec.rm_owner,
2096 ltrec.rm_offset, ltrec.rm_flags);
2097 if (error)
2098 goto out_error;
2099 } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
2100 /*
2101 * Overlap right hand side of extent: trim the length and
2102 * update the current record.
2103 *
2104 * ltbno ltlen
2105 * Orig: |oooooooooooooooooooo|
2106 * Freeing: |fffffffff|
2107 * Result: |rrrrrrrrrr|
2108 * bno len
2109 */
2110 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2111 ltrec.rm_blockcount, ltrec.rm_owner,
2112 ltrec.rm_offset, ltrec.rm_flags, &i);
2113 if (error)
2114 goto out_error;
2115 if (XFS_IS_CORRUPT(mp, i != 1)) {
2116 error = -EFSCORRUPTED;
2117 goto out_error;
2118 }
2119 ltrec.rm_blockcount -= len;
2120 error = xfs_rmap_update(cur, <rec);
2121 if (error)
2122 goto out_error;
2123 } else {
2124 /*
2125 * Overlap middle of extent: trim the length of the existing
2126 * record to the length of the new left-extent size, increment
2127 * the insertion position so we can insert a new record
2128 * containing the remaining right-extent space.
2129 *
2130 * ltbno ltlen
2131 * Orig: |oooooooooooooooooooo|
2132 * Freeing: |fffffffff|
2133 * Result: |rrrrr| |rrrr|
2134 * bno len
2135 */
2136 xfs_extlen_t orig_len = ltrec.rm_blockcount;
2137
2138 /* Shrink the left side of the rmap */
2139 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2140 ltrec.rm_blockcount, ltrec.rm_owner,
2141 ltrec.rm_offset, ltrec.rm_flags, &i);
2142 if (error)
2143 goto out_error;
2144 if (XFS_IS_CORRUPT(mp, i != 1)) {
2145 error = -EFSCORRUPTED;
2146 goto out_error;
2147 }
2148 ltrec.rm_blockcount = bno - ltrec.rm_startblock;
2149 error = xfs_rmap_update(cur, <rec);
2150 if (error)
2151 goto out_error;
2152
2153 /* Add an rmap at the new offset */
2154 error = xfs_rmap_insert(cur, bno + len,
2155 orig_len - len - ltrec.rm_blockcount,
2156 ltrec.rm_owner, offset + len,
2157 ltrec.rm_flags);
2158 if (error)
2159 goto out_error;
2160 }
2161
2162 trace_xfs_rmap_unmap_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
2163 unwritten, oinfo);
2164out_error:
2165 if (error)
2166 trace_xfs_rmap_unmap_error(cur->bc_mp,
2167 cur->bc_ag.pag->pag_agno, error, _RET_IP_);
2168 return error;
2169}
2170
2171/*
2172 * Find an extent in the rmap btree and map it. For rmap extent types that
2173 * can overlap (data fork rmaps on reflink filesystems) we must be careful
2174 * that the prev/next records in the btree might belong to another owner.
2175 * Therefore we must use delete+insert to alter any of the key fields.
2176 *
2177 * For every other situation there can only be one owner for a given extent,
2178 * so we can call the regular _alloc function.
2179 */
2180STATIC int
2181xfs_rmap_map_shared(
2182 struct xfs_btree_cur *cur,
2183 xfs_agblock_t bno,
2184 xfs_extlen_t len,
2185 bool unwritten,
2186 const struct xfs_owner_info *oinfo)
2187{
2188 struct xfs_mount *mp = cur->bc_mp;
2189 struct xfs_rmap_irec ltrec;
2190 struct xfs_rmap_irec gtrec;
2191 int have_gt;
2192 int have_lt;
2193 int error = 0;
2194 int i;
2195 uint64_t owner;
2196 uint64_t offset;
2197 unsigned int flags = 0;
2198
2199 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
2200 if (unwritten)
2201 flags |= XFS_RMAP_UNWRITTEN;
2202 trace_xfs_rmap_map(mp, cur->bc_ag.pag->pag_agno, bno, len,
2203 unwritten, oinfo);
2204
2205 /* Is there a left record that abuts our range? */
2206 error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, flags,
2207 <rec, &have_lt);
2208 if (error)
2209 goto out_error;
2210 if (have_lt &&
2211 !xfs_rmap_is_mergeable(<rec, owner, flags))
2212 have_lt = 0;
2213
2214 /* Is there a right record that abuts our range? */
2215 error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
2216 flags, &have_gt);
2217 if (error)
2218 goto out_error;
2219 if (have_gt) {
2220 error = xfs_rmap_get_rec(cur, >rec, &have_gt);
2221 if (error)
2222 goto out_error;
2223 if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
2224 error = -EFSCORRUPTED;
2225 goto out_error;
2226 }
2227 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
2228 cur->bc_ag.pag->pag_agno, gtrec.rm_startblock,
2229 gtrec.rm_blockcount, gtrec.rm_owner,
2230 gtrec.rm_offset, gtrec.rm_flags);
2231
2232 if (!xfs_rmap_is_mergeable(>rec, owner, flags))
2233 have_gt = 0;
2234 }
2235
2236 if (have_lt &&
2237 ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
2238 ltrec.rm_offset + ltrec.rm_blockcount == offset) {
2239 /*
2240 * Left edge contiguous, merge into left record.
2241 *
2242 * ltbno ltlen
2243 * orig: |ooooooooo|
2244 * adding: |aaaaaaaaa|
2245 * result: |rrrrrrrrrrrrrrrrrrr|
2246 * bno len
2247 */
2248 ltrec.rm_blockcount += len;
2249 if (have_gt &&
2250 bno + len == gtrec.rm_startblock &&
2251 offset + len == gtrec.rm_offset) {
2252 /*
2253 * Right edge also contiguous, delete right record
2254 * and merge into left record.
2255 *
2256 * ltbno ltlen gtbno gtlen
2257 * orig: |ooooooooo| |ooooooooo|
2258 * adding: |aaaaaaaaa|
2259 * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
2260 */
2261 ltrec.rm_blockcount += gtrec.rm_blockcount;
2262 error = xfs_rmap_delete(cur, gtrec.rm_startblock,
2263 gtrec.rm_blockcount, gtrec.rm_owner,
2264 gtrec.rm_offset, gtrec.rm_flags);
2265 if (error)
2266 goto out_error;
2267 }
2268
2269 /* Point the cursor back to the left record and update. */
2270 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2271 ltrec.rm_blockcount, ltrec.rm_owner,
2272 ltrec.rm_offset, ltrec.rm_flags, &i);
2273 if (error)
2274 goto out_error;
2275 if (XFS_IS_CORRUPT(mp, i != 1)) {
2276 error = -EFSCORRUPTED;
2277 goto out_error;
2278 }
2279
2280 error = xfs_rmap_update(cur, <rec);
2281 if (error)
2282 goto out_error;
2283 } else if (have_gt &&
2284 bno + len == gtrec.rm_startblock &&
2285 offset + len == gtrec.rm_offset) {
2286 /*
2287 * Right edge contiguous, merge into right record.
2288 *
2289 * gtbno gtlen
2290 * Orig: |ooooooooo|
2291 * adding: |aaaaaaaaa|
2292 * Result: |rrrrrrrrrrrrrrrrrrr|
2293 * bno len
2294 */
2295 /* Delete the old record. */
2296 error = xfs_rmap_delete(cur, gtrec.rm_startblock,
2297 gtrec.rm_blockcount, gtrec.rm_owner,
2298 gtrec.rm_offset, gtrec.rm_flags);
2299 if (error)
2300 goto out_error;
2301
2302 /* Move the start and re-add it. */
2303 gtrec.rm_startblock = bno;
2304 gtrec.rm_blockcount += len;
2305 gtrec.rm_offset = offset;
2306 error = xfs_rmap_insert(cur, gtrec.rm_startblock,
2307 gtrec.rm_blockcount, gtrec.rm_owner,
2308 gtrec.rm_offset, gtrec.rm_flags);
2309 if (error)
2310 goto out_error;
2311 } else {
2312 /*
2313 * No contiguous edge with identical owner, insert
2314 * new record at current cursor position.
2315 */
2316 error = xfs_rmap_insert(cur, bno, len, owner, offset, flags);
2317 if (error)
2318 goto out_error;
2319 }
2320
2321 trace_xfs_rmap_map_done(mp, cur->bc_ag.pag->pag_agno, bno, len,
2322 unwritten, oinfo);
2323out_error:
2324 if (error)
2325 trace_xfs_rmap_map_error(cur->bc_mp,
2326 cur->bc_ag.pag->pag_agno, error, _RET_IP_);
2327 return error;
2328}
2329
2330/* Insert a raw rmap into the rmapbt. */
2331int
2332xfs_rmap_map_raw(
2333 struct xfs_btree_cur *cur,
2334 struct xfs_rmap_irec *rmap)
2335{
2336 struct xfs_owner_info oinfo;
2337
2338 oinfo.oi_owner = rmap->rm_owner;
2339 oinfo.oi_offset = rmap->rm_offset;
2340 oinfo.oi_flags = 0;
2341 if (rmap->rm_flags & XFS_RMAP_ATTR_FORK)
2342 oinfo.oi_flags |= XFS_OWNER_INFO_ATTR_FORK;
2343 if (rmap->rm_flags & XFS_RMAP_BMBT_BLOCK)
2344 oinfo.oi_flags |= XFS_OWNER_INFO_BMBT_BLOCK;
2345
2346 if (rmap->rm_flags || XFS_RMAP_NON_INODE_OWNER(rmap->rm_owner))
2347 return xfs_rmap_map(cur, rmap->rm_startblock,
2348 rmap->rm_blockcount,
2349 rmap->rm_flags & XFS_RMAP_UNWRITTEN,
2350 &oinfo);
2351
2352 return xfs_rmap_map_shared(cur, rmap->rm_startblock,
2353 rmap->rm_blockcount,
2354 rmap->rm_flags & XFS_RMAP_UNWRITTEN,
2355 &oinfo);
2356}
2357
2358struct xfs_rmap_query_range_info {
2359 xfs_rmap_query_range_fn fn;
2360 void *priv;
2361};
2362
2363/* Format btree record and pass to our callback. */
2364STATIC int
2365xfs_rmap_query_range_helper(
2366 struct xfs_btree_cur *cur,
2367 const union xfs_btree_rec *rec,
2368 void *priv)
2369{
2370 struct xfs_rmap_query_range_info *query = priv;
2371 struct xfs_rmap_irec irec;
2372 xfs_failaddr_t fa;
2373
2374 fa = xfs_rmap_btrec_to_irec(rec, &irec);
2375 if (!fa)
2376 fa = xfs_rmap_check_irec(cur, &irec);
2377 if (fa)
2378 return xfs_rmap_complain_bad_rec(cur, fa, &irec);
2379
2380 return query->fn(cur, &irec, query->priv);
2381}
2382
2383/* Find all rmaps between two keys. */
2384int
2385xfs_rmap_query_range(
2386 struct xfs_btree_cur *cur,
2387 const struct xfs_rmap_irec *low_rec,
2388 const struct xfs_rmap_irec *high_rec,
2389 xfs_rmap_query_range_fn fn,
2390 void *priv)
2391{
2392 union xfs_btree_irec low_brec = { .r = *low_rec };
2393 union xfs_btree_irec high_brec = { .r = *high_rec };
2394 struct xfs_rmap_query_range_info query = { .priv = priv, .fn = fn };
2395
2396 return xfs_btree_query_range(cur, &low_brec, &high_brec,
2397 xfs_rmap_query_range_helper, &query);
2398}
2399
2400/* Find all rmaps. */
2401int
2402xfs_rmap_query_all(
2403 struct xfs_btree_cur *cur,
2404 xfs_rmap_query_range_fn fn,
2405 void *priv)
2406{
2407 struct xfs_rmap_query_range_info query;
2408
2409 query.priv = priv;
2410 query.fn = fn;
2411 return xfs_btree_query_all(cur, xfs_rmap_query_range_helper, &query);
2412}
2413
2414/* Clean up after calling xfs_rmap_finish_one. */
2415void
2416xfs_rmap_finish_one_cleanup(
2417 struct xfs_trans *tp,
2418 struct xfs_btree_cur *rcur,
2419 int error)
2420{
2421 struct xfs_buf *agbp;
2422
2423 if (rcur == NULL)
2424 return;
2425 agbp = rcur->bc_ag.agbp;
2426 xfs_btree_del_cursor(rcur, error);
2427 if (error)
2428 xfs_trans_brelse(tp, agbp);
2429}
2430
2431/*
2432 * Process one of the deferred rmap operations. We pass back the
2433 * btree cursor to maintain our lock on the rmapbt between calls.
2434 * This saves time and eliminates a buffer deadlock between the
2435 * superblock and the AGF because we'll always grab them in the same
2436 * order.
2437 */
2438int
2439xfs_rmap_finish_one(
2440 struct xfs_trans *tp,
2441 struct xfs_rmap_intent *ri,
2442 struct xfs_btree_cur **pcur)
2443{
2444 struct xfs_mount *mp = tp->t_mountp;
2445 struct xfs_btree_cur *rcur;
2446 struct xfs_buf *agbp = NULL;
2447 int error = 0;
2448 struct xfs_owner_info oinfo;
2449 xfs_agblock_t bno;
2450 bool unwritten;
2451
2452 bno = XFS_FSB_TO_AGBNO(mp, ri->ri_bmap.br_startblock);
2453
2454 trace_xfs_rmap_deferred(mp, ri->ri_pag->pag_agno, ri->ri_type, bno,
2455 ri->ri_owner, ri->ri_whichfork,
2456 ri->ri_bmap.br_startoff, ri->ri_bmap.br_blockcount,
2457 ri->ri_bmap.br_state);
2458
2459 if (XFS_TEST_ERROR(false, mp, XFS_ERRTAG_RMAP_FINISH_ONE))
2460 return -EIO;
2461
2462 /*
2463 * If we haven't gotten a cursor or the cursor AG doesn't match
2464 * the startblock, get one now.
2465 */
2466 rcur = *pcur;
2467 if (rcur != NULL && rcur->bc_ag.pag != ri->ri_pag) {
2468 xfs_rmap_finish_one_cleanup(tp, rcur, 0);
2469 rcur = NULL;
2470 *pcur = NULL;
2471 }
2472 if (rcur == NULL) {
2473 /*
2474 * Refresh the freelist before we start changing the
2475 * rmapbt, because a shape change could cause us to
2476 * allocate blocks.
2477 */
2478 error = xfs_free_extent_fix_freelist(tp, ri->ri_pag, &agbp);
2479 if (error)
2480 return error;
2481 if (XFS_IS_CORRUPT(tp->t_mountp, !agbp))
2482 return -EFSCORRUPTED;
2483
2484 rcur = xfs_rmapbt_init_cursor(mp, tp, agbp, ri->ri_pag);
2485 }
2486 *pcur = rcur;
2487
2488 xfs_rmap_ino_owner(&oinfo, ri->ri_owner, ri->ri_whichfork,
2489 ri->ri_bmap.br_startoff);
2490 unwritten = ri->ri_bmap.br_state == XFS_EXT_UNWRITTEN;
2491 bno = XFS_FSB_TO_AGBNO(rcur->bc_mp, ri->ri_bmap.br_startblock);
2492
2493 switch (ri->ri_type) {
2494 case XFS_RMAP_ALLOC:
2495 case XFS_RMAP_MAP:
2496 error = xfs_rmap_map(rcur, bno, ri->ri_bmap.br_blockcount,
2497 unwritten, &oinfo);
2498 break;
2499 case XFS_RMAP_MAP_SHARED:
2500 error = xfs_rmap_map_shared(rcur, bno,
2501 ri->ri_bmap.br_blockcount, unwritten, &oinfo);
2502 break;
2503 case XFS_RMAP_FREE:
2504 case XFS_RMAP_UNMAP:
2505 error = xfs_rmap_unmap(rcur, bno, ri->ri_bmap.br_blockcount,
2506 unwritten, &oinfo);
2507 break;
2508 case XFS_RMAP_UNMAP_SHARED:
2509 error = xfs_rmap_unmap_shared(rcur, bno,
2510 ri->ri_bmap.br_blockcount, unwritten, &oinfo);
2511 break;
2512 case XFS_RMAP_CONVERT:
2513 error = xfs_rmap_convert(rcur, bno, ri->ri_bmap.br_blockcount,
2514 !unwritten, &oinfo);
2515 break;
2516 case XFS_RMAP_CONVERT_SHARED:
2517 error = xfs_rmap_convert_shared(rcur, bno,
2518 ri->ri_bmap.br_blockcount, !unwritten, &oinfo);
2519 break;
2520 default:
2521 ASSERT(0);
2522 error = -EFSCORRUPTED;
2523 }
2524
2525 return error;
2526}
2527
2528/*
2529 * Don't defer an rmap if we aren't an rmap filesystem.
2530 */
2531static bool
2532xfs_rmap_update_is_needed(
2533 struct xfs_mount *mp,
2534 int whichfork)
2535{
2536 return xfs_has_rmapbt(mp) && whichfork != XFS_COW_FORK;
2537}
2538
2539/*
2540 * Record a rmap intent; the list is kept sorted first by AG and then by
2541 * increasing age.
2542 */
2543static void
2544__xfs_rmap_add(
2545 struct xfs_trans *tp,
2546 enum xfs_rmap_intent_type type,
2547 uint64_t owner,
2548 int whichfork,
2549 struct xfs_bmbt_irec *bmap)
2550{
2551 struct xfs_rmap_intent *ri;
2552
2553 trace_xfs_rmap_defer(tp->t_mountp,
2554 XFS_FSB_TO_AGNO(tp->t_mountp, bmap->br_startblock),
2555 type,
2556 XFS_FSB_TO_AGBNO(tp->t_mountp, bmap->br_startblock),
2557 owner, whichfork,
2558 bmap->br_startoff,
2559 bmap->br_blockcount,
2560 bmap->br_state);
2561
2562 ri = kmem_cache_alloc(xfs_rmap_intent_cache, GFP_NOFS | __GFP_NOFAIL);
2563 INIT_LIST_HEAD(&ri->ri_list);
2564 ri->ri_type = type;
2565 ri->ri_owner = owner;
2566 ri->ri_whichfork = whichfork;
2567 ri->ri_bmap = *bmap;
2568
2569 xfs_rmap_update_get_group(tp->t_mountp, ri);
2570 xfs_defer_add(tp, &ri->ri_list, &xfs_rmap_update_defer_type);
2571}
2572
2573/* Map an extent into a file. */
2574void
2575xfs_rmap_map_extent(
2576 struct xfs_trans *tp,
2577 struct xfs_inode *ip,
2578 int whichfork,
2579 struct xfs_bmbt_irec *PREV)
2580{
2581 enum xfs_rmap_intent_type type = XFS_RMAP_MAP;
2582
2583 if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
2584 return;
2585
2586 if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
2587 type = XFS_RMAP_MAP_SHARED;
2588
2589 __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
2590}
2591
2592/* Unmap an extent out of a file. */
2593void
2594xfs_rmap_unmap_extent(
2595 struct xfs_trans *tp,
2596 struct xfs_inode *ip,
2597 int whichfork,
2598 struct xfs_bmbt_irec *PREV)
2599{
2600 enum xfs_rmap_intent_type type = XFS_RMAP_UNMAP;
2601
2602 if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
2603 return;
2604
2605 if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
2606 type = XFS_RMAP_UNMAP_SHARED;
2607
2608 __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
2609}
2610
2611/*
2612 * Convert a data fork extent from unwritten to real or vice versa.
2613 *
2614 * Note that tp can be NULL here as no transaction is used for COW fork
2615 * unwritten conversion.
2616 */
2617void
2618xfs_rmap_convert_extent(
2619 struct xfs_mount *mp,
2620 struct xfs_trans *tp,
2621 struct xfs_inode *ip,
2622 int whichfork,
2623 struct xfs_bmbt_irec *PREV)
2624{
2625 enum xfs_rmap_intent_type type = XFS_RMAP_CONVERT;
2626
2627 if (!xfs_rmap_update_is_needed(mp, whichfork))
2628 return;
2629
2630 if (whichfork != XFS_ATTR_FORK && xfs_is_reflink_inode(ip))
2631 type = XFS_RMAP_CONVERT_SHARED;
2632
2633 __xfs_rmap_add(tp, type, ip->i_ino, whichfork, PREV);
2634}
2635
2636/* Schedule the creation of an rmap for non-file data. */
2637void
2638xfs_rmap_alloc_extent(
2639 struct xfs_trans *tp,
2640 xfs_agnumber_t agno,
2641 xfs_agblock_t bno,
2642 xfs_extlen_t len,
2643 uint64_t owner)
2644{
2645 struct xfs_bmbt_irec bmap;
2646
2647 if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
2648 return;
2649
2650 bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
2651 bmap.br_blockcount = len;
2652 bmap.br_startoff = 0;
2653 bmap.br_state = XFS_EXT_NORM;
2654
2655 __xfs_rmap_add(tp, XFS_RMAP_ALLOC, owner, XFS_DATA_FORK, &bmap);
2656}
2657
2658/* Schedule the deletion of an rmap for non-file data. */
2659void
2660xfs_rmap_free_extent(
2661 struct xfs_trans *tp,
2662 xfs_agnumber_t agno,
2663 xfs_agblock_t bno,
2664 xfs_extlen_t len,
2665 uint64_t owner)
2666{
2667 struct xfs_bmbt_irec bmap;
2668
2669 if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
2670 return;
2671
2672 bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
2673 bmap.br_blockcount = len;
2674 bmap.br_startoff = 0;
2675 bmap.br_state = XFS_EXT_NORM;
2676
2677 __xfs_rmap_add(tp, XFS_RMAP_FREE, owner, XFS_DATA_FORK, &bmap);
2678}
2679
2680/* Compare rmap records. Returns -1 if a < b, 1 if a > b, and 0 if equal. */
2681int
2682xfs_rmap_compare(
2683 const struct xfs_rmap_irec *a,
2684 const struct xfs_rmap_irec *b)
2685{
2686 __u64 oa;
2687 __u64 ob;
2688
2689 oa = xfs_rmap_irec_offset_pack(a);
2690 ob = xfs_rmap_irec_offset_pack(b);
2691
2692 if (a->rm_startblock < b->rm_startblock)
2693 return -1;
2694 else if (a->rm_startblock > b->rm_startblock)
2695 return 1;
2696 else if (a->rm_owner < b->rm_owner)
2697 return -1;
2698 else if (a->rm_owner > b->rm_owner)
2699 return 1;
2700 else if (oa < ob)
2701 return -1;
2702 else if (oa > ob)
2703 return 1;
2704 else
2705 return 0;
2706}
2707
2708/*
2709 * Scan the physical storage part of the keyspace of the reverse mapping index
2710 * and tell us if the area has no records, is fully mapped by records, or is
2711 * partially filled.
2712 */
2713int
2714xfs_rmap_has_records(
2715 struct xfs_btree_cur *cur,
2716 xfs_agblock_t bno,
2717 xfs_extlen_t len,
2718 enum xbtree_recpacking *outcome)
2719{
2720 union xfs_btree_key mask = {
2721 .rmap.rm_startblock = cpu_to_be32(-1U),
2722 };
2723 union xfs_btree_irec low;
2724 union xfs_btree_irec high;
2725
2726 memset(&low, 0, sizeof(low));
2727 low.r.rm_startblock = bno;
2728 memset(&high, 0xFF, sizeof(high));
2729 high.r.rm_startblock = bno + len - 1;
2730
2731 return xfs_btree_has_records(cur, &low, &high, &mask, outcome);
2732}
2733
2734struct xfs_rmap_ownercount {
2735 /* Owner that we're looking for. */
2736 struct xfs_rmap_irec good;
2737
2738 /* rmap search keys */
2739 struct xfs_rmap_irec low;
2740 struct xfs_rmap_irec high;
2741
2742 struct xfs_rmap_matches *results;
2743
2744 /* Stop early if we find a nonmatch? */
2745 bool stop_on_nonmatch;
2746};
2747
2748/* Does this rmap represent space that can have multiple owners? */
2749static inline bool
2750xfs_rmap_shareable(
2751 struct xfs_mount *mp,
2752 const struct xfs_rmap_irec *rmap)
2753{
2754 if (!xfs_has_reflink(mp))
2755 return false;
2756 if (XFS_RMAP_NON_INODE_OWNER(rmap->rm_owner))
2757 return false;
2758 if (rmap->rm_flags & (XFS_RMAP_ATTR_FORK |
2759 XFS_RMAP_BMBT_BLOCK))
2760 return false;
2761 return true;
2762}
2763
2764static inline void
2765xfs_rmap_ownercount_init(
2766 struct xfs_rmap_ownercount *roc,
2767 xfs_agblock_t bno,
2768 xfs_extlen_t len,
2769 const struct xfs_owner_info *oinfo,
2770 struct xfs_rmap_matches *results)
2771{
2772 memset(roc, 0, sizeof(*roc));
2773 roc->results = results;
2774
2775 roc->low.rm_startblock = bno;
2776 memset(&roc->high, 0xFF, sizeof(roc->high));
2777 roc->high.rm_startblock = bno + len - 1;
2778
2779 memset(results, 0, sizeof(*results));
2780 roc->good.rm_startblock = bno;
2781 roc->good.rm_blockcount = len;
2782 roc->good.rm_owner = oinfo->oi_owner;
2783 roc->good.rm_offset = oinfo->oi_offset;
2784 if (oinfo->oi_flags & XFS_OWNER_INFO_ATTR_FORK)
2785 roc->good.rm_flags |= XFS_RMAP_ATTR_FORK;
2786 if (oinfo->oi_flags & XFS_OWNER_INFO_BMBT_BLOCK)
2787 roc->good.rm_flags |= XFS_RMAP_BMBT_BLOCK;
2788}
2789
2790/* Figure out if this is a match for the owner. */
2791STATIC int
2792xfs_rmap_count_owners_helper(
2793 struct xfs_btree_cur *cur,
2794 const struct xfs_rmap_irec *rec,
2795 void *priv)
2796{
2797 struct xfs_rmap_ownercount *roc = priv;
2798 struct xfs_rmap_irec check = *rec;
2799 unsigned int keyflags;
2800 bool filedata;
2801 int64_t delta;
2802
2803 filedata = !XFS_RMAP_NON_INODE_OWNER(check.rm_owner) &&
2804 !(check.rm_flags & XFS_RMAP_BMBT_BLOCK);
2805
2806 /* Trim the part of check that comes before the comparison range. */
2807 delta = (int64_t)roc->good.rm_startblock - check.rm_startblock;
2808 if (delta > 0) {
2809 check.rm_startblock += delta;
2810 check.rm_blockcount -= delta;
2811 if (filedata)
2812 check.rm_offset += delta;
2813 }
2814
2815 /* Trim the part of check that comes after the comparison range. */
2816 delta = (check.rm_startblock + check.rm_blockcount) -
2817 (roc->good.rm_startblock + roc->good.rm_blockcount);
2818 if (delta > 0)
2819 check.rm_blockcount -= delta;
2820
2821 /* Don't care about unwritten status for establishing ownership. */
2822 keyflags = check.rm_flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK);
2823
2824 if (check.rm_startblock == roc->good.rm_startblock &&
2825 check.rm_blockcount == roc->good.rm_blockcount &&
2826 check.rm_owner == roc->good.rm_owner &&
2827 check.rm_offset == roc->good.rm_offset &&
2828 keyflags == roc->good.rm_flags) {
2829 roc->results->matches++;
2830 } else {
2831 roc->results->non_owner_matches++;
2832 if (xfs_rmap_shareable(cur->bc_mp, &roc->good) ^
2833 xfs_rmap_shareable(cur->bc_mp, &check))
2834 roc->results->bad_non_owner_matches++;
2835 }
2836
2837 if (roc->results->non_owner_matches && roc->stop_on_nonmatch)
2838 return -ECANCELED;
2839
2840 return 0;
2841}
2842
2843/* Count the number of owners and non-owners of this range of blocks. */
2844int
2845xfs_rmap_count_owners(
2846 struct xfs_btree_cur *cur,
2847 xfs_agblock_t bno,
2848 xfs_extlen_t len,
2849 const struct xfs_owner_info *oinfo,
2850 struct xfs_rmap_matches *results)
2851{
2852 struct xfs_rmap_ownercount roc;
2853 int error;
2854
2855 xfs_rmap_ownercount_init(&roc, bno, len, oinfo, results);
2856 error = xfs_rmap_query_range(cur, &roc.low, &roc.high,
2857 xfs_rmap_count_owners_helper, &roc);
2858 if (error)
2859 return error;
2860
2861 /*
2862 * There can't be any non-owner rmaps that conflict with the given
2863 * owner if we didn't find any rmaps matching the owner.
2864 */
2865 if (!results->matches)
2866 results->bad_non_owner_matches = 0;
2867
2868 return 0;
2869}
2870
2871/*
2872 * Given an extent and some owner info, can we find records overlapping
2873 * the extent whose owner info does not match the given owner?
2874 */
2875int
2876xfs_rmap_has_other_keys(
2877 struct xfs_btree_cur *cur,
2878 xfs_agblock_t bno,
2879 xfs_extlen_t len,
2880 const struct xfs_owner_info *oinfo,
2881 bool *has_other)
2882{
2883 struct xfs_rmap_matches res;
2884 struct xfs_rmap_ownercount roc;
2885 int error;
2886
2887 xfs_rmap_ownercount_init(&roc, bno, len, oinfo, &res);
2888 roc.stop_on_nonmatch = true;
2889
2890 error = xfs_rmap_query_range(cur, &roc.low, &roc.high,
2891 xfs_rmap_count_owners_helper, &roc);
2892 if (error == -ECANCELED) {
2893 *has_other = true;
2894 return 0;
2895 }
2896 if (error)
2897 return error;
2898
2899 *has_other = false;
2900 return 0;
2901}
2902
2903const struct xfs_owner_info XFS_RMAP_OINFO_SKIP_UPDATE = {
2904 .oi_owner = XFS_RMAP_OWN_NULL,
2905};
2906const struct xfs_owner_info XFS_RMAP_OINFO_ANY_OWNER = {
2907 .oi_owner = XFS_RMAP_OWN_UNKNOWN,
2908};
2909const struct xfs_owner_info XFS_RMAP_OINFO_FS = {
2910 .oi_owner = XFS_RMAP_OWN_FS,
2911};
2912const struct xfs_owner_info XFS_RMAP_OINFO_LOG = {
2913 .oi_owner = XFS_RMAP_OWN_LOG,
2914};
2915const struct xfs_owner_info XFS_RMAP_OINFO_AG = {
2916 .oi_owner = XFS_RMAP_OWN_AG,
2917};
2918const struct xfs_owner_info XFS_RMAP_OINFO_INOBT = {
2919 .oi_owner = XFS_RMAP_OWN_INOBT,
2920};
2921const struct xfs_owner_info XFS_RMAP_OINFO_INODES = {
2922 .oi_owner = XFS_RMAP_OWN_INODES,
2923};
2924const struct xfs_owner_info XFS_RMAP_OINFO_REFC = {
2925 .oi_owner = XFS_RMAP_OWN_REFC,
2926};
2927const struct xfs_owner_info XFS_RMAP_OINFO_COW = {
2928 .oi_owner = XFS_RMAP_OWN_COW,
2929};
2930
2931int __init
2932xfs_rmap_intent_init_cache(void)
2933{
2934 xfs_rmap_intent_cache = kmem_cache_create("xfs_rmap_intent",
2935 sizeof(struct xfs_rmap_intent),
2936 0, 0, NULL);
2937
2938 return xfs_rmap_intent_cache != NULL ? 0 : -ENOMEM;
2939}
2940
2941void
2942xfs_rmap_intent_destroy_cache(void)
2943{
2944 kmem_cache_destroy(xfs_rmap_intent_cache);
2945 xfs_rmap_intent_cache = NULL;
2946}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2014 Red Hat, Inc.
4 * All Rights Reserved.
5 */
6#include "xfs.h"
7#include "xfs_fs.h"
8#include "xfs_shared.h"
9#include "xfs_format.h"
10#include "xfs_log_format.h"
11#include "xfs_trans_resv.h"
12#include "xfs_bit.h"
13#include "xfs_mount.h"
14#include "xfs_defer.h"
15#include "xfs_btree.h"
16#include "xfs_trans.h"
17#include "xfs_alloc.h"
18#include "xfs_rmap.h"
19#include "xfs_rmap_btree.h"
20#include "xfs_trace.h"
21#include "xfs_errortag.h"
22#include "xfs_error.h"
23#include "xfs_inode.h"
24
25/*
26 * Lookup the first record less than or equal to [bno, len, owner, offset]
27 * in the btree given by cur.
28 */
29int
30xfs_rmap_lookup_le(
31 struct xfs_btree_cur *cur,
32 xfs_agblock_t bno,
33 xfs_extlen_t len,
34 uint64_t owner,
35 uint64_t offset,
36 unsigned int flags,
37 int *stat)
38{
39 cur->bc_rec.r.rm_startblock = bno;
40 cur->bc_rec.r.rm_blockcount = len;
41 cur->bc_rec.r.rm_owner = owner;
42 cur->bc_rec.r.rm_offset = offset;
43 cur->bc_rec.r.rm_flags = flags;
44 return xfs_btree_lookup(cur, XFS_LOOKUP_LE, stat);
45}
46
47/*
48 * Lookup the record exactly matching [bno, len, owner, offset]
49 * in the btree given by cur.
50 */
51int
52xfs_rmap_lookup_eq(
53 struct xfs_btree_cur *cur,
54 xfs_agblock_t bno,
55 xfs_extlen_t len,
56 uint64_t owner,
57 uint64_t offset,
58 unsigned int flags,
59 int *stat)
60{
61 cur->bc_rec.r.rm_startblock = bno;
62 cur->bc_rec.r.rm_blockcount = len;
63 cur->bc_rec.r.rm_owner = owner;
64 cur->bc_rec.r.rm_offset = offset;
65 cur->bc_rec.r.rm_flags = flags;
66 return xfs_btree_lookup(cur, XFS_LOOKUP_EQ, stat);
67}
68
69/*
70 * Update the record referred to by cur to the value given
71 * by [bno, len, owner, offset].
72 * This either works (return 0) or gets an EFSCORRUPTED error.
73 */
74STATIC int
75xfs_rmap_update(
76 struct xfs_btree_cur *cur,
77 struct xfs_rmap_irec *irec)
78{
79 union xfs_btree_rec rec;
80 int error;
81
82 trace_xfs_rmap_update(cur->bc_mp, cur->bc_ag.agno,
83 irec->rm_startblock, irec->rm_blockcount,
84 irec->rm_owner, irec->rm_offset, irec->rm_flags);
85
86 rec.rmap.rm_startblock = cpu_to_be32(irec->rm_startblock);
87 rec.rmap.rm_blockcount = cpu_to_be32(irec->rm_blockcount);
88 rec.rmap.rm_owner = cpu_to_be64(irec->rm_owner);
89 rec.rmap.rm_offset = cpu_to_be64(
90 xfs_rmap_irec_offset_pack(irec));
91 error = xfs_btree_update(cur, &rec);
92 if (error)
93 trace_xfs_rmap_update_error(cur->bc_mp,
94 cur->bc_ag.agno, error, _RET_IP_);
95 return error;
96}
97
98int
99xfs_rmap_insert(
100 struct xfs_btree_cur *rcur,
101 xfs_agblock_t agbno,
102 xfs_extlen_t len,
103 uint64_t owner,
104 uint64_t offset,
105 unsigned int flags)
106{
107 int i;
108 int error;
109
110 trace_xfs_rmap_insert(rcur->bc_mp, rcur->bc_ag.agno, agbno,
111 len, owner, offset, flags);
112
113 error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
114 if (error)
115 goto done;
116 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 0)) {
117 error = -EFSCORRUPTED;
118 goto done;
119 }
120
121 rcur->bc_rec.r.rm_startblock = agbno;
122 rcur->bc_rec.r.rm_blockcount = len;
123 rcur->bc_rec.r.rm_owner = owner;
124 rcur->bc_rec.r.rm_offset = offset;
125 rcur->bc_rec.r.rm_flags = flags;
126 error = xfs_btree_insert(rcur, &i);
127 if (error)
128 goto done;
129 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
130 error = -EFSCORRUPTED;
131 goto done;
132 }
133done:
134 if (error)
135 trace_xfs_rmap_insert_error(rcur->bc_mp,
136 rcur->bc_ag.agno, error, _RET_IP_);
137 return error;
138}
139
140STATIC int
141xfs_rmap_delete(
142 struct xfs_btree_cur *rcur,
143 xfs_agblock_t agbno,
144 xfs_extlen_t len,
145 uint64_t owner,
146 uint64_t offset,
147 unsigned int flags)
148{
149 int i;
150 int error;
151
152 trace_xfs_rmap_delete(rcur->bc_mp, rcur->bc_ag.agno, agbno,
153 len, owner, offset, flags);
154
155 error = xfs_rmap_lookup_eq(rcur, agbno, len, owner, offset, flags, &i);
156 if (error)
157 goto done;
158 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
159 error = -EFSCORRUPTED;
160 goto done;
161 }
162
163 error = xfs_btree_delete(rcur, &i);
164 if (error)
165 goto done;
166 if (XFS_IS_CORRUPT(rcur->bc_mp, i != 1)) {
167 error = -EFSCORRUPTED;
168 goto done;
169 }
170done:
171 if (error)
172 trace_xfs_rmap_delete_error(rcur->bc_mp,
173 rcur->bc_ag.agno, error, _RET_IP_);
174 return error;
175}
176
177/* Convert an internal btree record to an rmap record. */
178int
179xfs_rmap_btrec_to_irec(
180 union xfs_btree_rec *rec,
181 struct xfs_rmap_irec *irec)
182{
183 irec->rm_startblock = be32_to_cpu(rec->rmap.rm_startblock);
184 irec->rm_blockcount = be32_to_cpu(rec->rmap.rm_blockcount);
185 irec->rm_owner = be64_to_cpu(rec->rmap.rm_owner);
186 return xfs_rmap_irec_offset_unpack(be64_to_cpu(rec->rmap.rm_offset),
187 irec);
188}
189
190/*
191 * Get the data from the pointed-to record.
192 */
193int
194xfs_rmap_get_rec(
195 struct xfs_btree_cur *cur,
196 struct xfs_rmap_irec *irec,
197 int *stat)
198{
199 struct xfs_mount *mp = cur->bc_mp;
200 xfs_agnumber_t agno = cur->bc_ag.agno;
201 union xfs_btree_rec *rec;
202 int error;
203
204 error = xfs_btree_get_rec(cur, &rec, stat);
205 if (error || !*stat)
206 return error;
207
208 if (xfs_rmap_btrec_to_irec(rec, irec))
209 goto out_bad_rec;
210
211 if (irec->rm_blockcount == 0)
212 goto out_bad_rec;
213 if (irec->rm_startblock <= XFS_AGFL_BLOCK(mp)) {
214 if (irec->rm_owner != XFS_RMAP_OWN_FS)
215 goto out_bad_rec;
216 if (irec->rm_blockcount != XFS_AGFL_BLOCK(mp) + 1)
217 goto out_bad_rec;
218 } else {
219 /* check for valid extent range, including overflow */
220 if (!xfs_verify_agbno(mp, agno, irec->rm_startblock))
221 goto out_bad_rec;
222 if (irec->rm_startblock >
223 irec->rm_startblock + irec->rm_blockcount)
224 goto out_bad_rec;
225 if (!xfs_verify_agbno(mp, agno,
226 irec->rm_startblock + irec->rm_blockcount - 1))
227 goto out_bad_rec;
228 }
229
230 if (!(xfs_verify_ino(mp, irec->rm_owner) ||
231 (irec->rm_owner <= XFS_RMAP_OWN_FS &&
232 irec->rm_owner >= XFS_RMAP_OWN_MIN)))
233 goto out_bad_rec;
234
235 return 0;
236out_bad_rec:
237 xfs_warn(mp,
238 "Reverse Mapping BTree record corruption in AG %d detected!",
239 agno);
240 xfs_warn(mp,
241 "Owner 0x%llx, flags 0x%x, start block 0x%x block count 0x%x",
242 irec->rm_owner, irec->rm_flags, irec->rm_startblock,
243 irec->rm_blockcount);
244 return -EFSCORRUPTED;
245}
246
247struct xfs_find_left_neighbor_info {
248 struct xfs_rmap_irec high;
249 struct xfs_rmap_irec *irec;
250 int *stat;
251};
252
253/* For each rmap given, figure out if it matches the key we want. */
254STATIC int
255xfs_rmap_find_left_neighbor_helper(
256 struct xfs_btree_cur *cur,
257 struct xfs_rmap_irec *rec,
258 void *priv)
259{
260 struct xfs_find_left_neighbor_info *info = priv;
261
262 trace_xfs_rmap_find_left_neighbor_candidate(cur->bc_mp,
263 cur->bc_ag.agno, rec->rm_startblock,
264 rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
265 rec->rm_flags);
266
267 if (rec->rm_owner != info->high.rm_owner)
268 return 0;
269 if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
270 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
271 rec->rm_offset + rec->rm_blockcount - 1 != info->high.rm_offset)
272 return 0;
273
274 *info->irec = *rec;
275 *info->stat = 1;
276 return -ECANCELED;
277}
278
279/*
280 * Find the record to the left of the given extent, being careful only to
281 * return a match with the same owner and adjacent physical and logical
282 * block ranges.
283 */
284int
285xfs_rmap_find_left_neighbor(
286 struct xfs_btree_cur *cur,
287 xfs_agblock_t bno,
288 uint64_t owner,
289 uint64_t offset,
290 unsigned int flags,
291 struct xfs_rmap_irec *irec,
292 int *stat)
293{
294 struct xfs_find_left_neighbor_info info;
295 int error;
296
297 *stat = 0;
298 if (bno == 0)
299 return 0;
300 info.high.rm_startblock = bno - 1;
301 info.high.rm_owner = owner;
302 if (!XFS_RMAP_NON_INODE_OWNER(owner) &&
303 !(flags & XFS_RMAP_BMBT_BLOCK)) {
304 if (offset == 0)
305 return 0;
306 info.high.rm_offset = offset - 1;
307 } else
308 info.high.rm_offset = 0;
309 info.high.rm_flags = flags;
310 info.high.rm_blockcount = 0;
311 info.irec = irec;
312 info.stat = stat;
313
314 trace_xfs_rmap_find_left_neighbor_query(cur->bc_mp,
315 cur->bc_ag.agno, bno, 0, owner, offset, flags);
316
317 error = xfs_rmap_query_range(cur, &info.high, &info.high,
318 xfs_rmap_find_left_neighbor_helper, &info);
319 if (error == -ECANCELED)
320 error = 0;
321 if (*stat)
322 trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
323 cur->bc_ag.agno, irec->rm_startblock,
324 irec->rm_blockcount, irec->rm_owner,
325 irec->rm_offset, irec->rm_flags);
326 return error;
327}
328
329/* For each rmap given, figure out if it matches the key we want. */
330STATIC int
331xfs_rmap_lookup_le_range_helper(
332 struct xfs_btree_cur *cur,
333 struct xfs_rmap_irec *rec,
334 void *priv)
335{
336 struct xfs_find_left_neighbor_info *info = priv;
337
338 trace_xfs_rmap_lookup_le_range_candidate(cur->bc_mp,
339 cur->bc_ag.agno, rec->rm_startblock,
340 rec->rm_blockcount, rec->rm_owner, rec->rm_offset,
341 rec->rm_flags);
342
343 if (rec->rm_owner != info->high.rm_owner)
344 return 0;
345 if (!XFS_RMAP_NON_INODE_OWNER(rec->rm_owner) &&
346 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK) &&
347 (rec->rm_offset > info->high.rm_offset ||
348 rec->rm_offset + rec->rm_blockcount <= info->high.rm_offset))
349 return 0;
350
351 *info->irec = *rec;
352 *info->stat = 1;
353 return -ECANCELED;
354}
355
356/*
357 * Find the record to the left of the given extent, being careful only to
358 * return a match with the same owner and overlapping physical and logical
359 * block ranges. This is the overlapping-interval version of
360 * xfs_rmap_lookup_le.
361 */
362int
363xfs_rmap_lookup_le_range(
364 struct xfs_btree_cur *cur,
365 xfs_agblock_t bno,
366 uint64_t owner,
367 uint64_t offset,
368 unsigned int flags,
369 struct xfs_rmap_irec *irec,
370 int *stat)
371{
372 struct xfs_find_left_neighbor_info info;
373 int error;
374
375 info.high.rm_startblock = bno;
376 info.high.rm_owner = owner;
377 if (!XFS_RMAP_NON_INODE_OWNER(owner) && !(flags & XFS_RMAP_BMBT_BLOCK))
378 info.high.rm_offset = offset;
379 else
380 info.high.rm_offset = 0;
381 info.high.rm_flags = flags;
382 info.high.rm_blockcount = 0;
383 *stat = 0;
384 info.irec = irec;
385 info.stat = stat;
386
387 trace_xfs_rmap_lookup_le_range(cur->bc_mp,
388 cur->bc_ag.agno, bno, 0, owner, offset, flags);
389 error = xfs_rmap_query_range(cur, &info.high, &info.high,
390 xfs_rmap_lookup_le_range_helper, &info);
391 if (error == -ECANCELED)
392 error = 0;
393 if (*stat)
394 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
395 cur->bc_ag.agno, irec->rm_startblock,
396 irec->rm_blockcount, irec->rm_owner,
397 irec->rm_offset, irec->rm_flags);
398 return error;
399}
400
401/*
402 * Perform all the relevant owner checks for a removal op. If we're doing an
403 * unknown-owner removal then we have no owner information to check.
404 */
405static int
406xfs_rmap_free_check_owner(
407 struct xfs_mount *mp,
408 uint64_t ltoff,
409 struct xfs_rmap_irec *rec,
410 xfs_filblks_t len,
411 uint64_t owner,
412 uint64_t offset,
413 unsigned int flags)
414{
415 int error = 0;
416
417 if (owner == XFS_RMAP_OWN_UNKNOWN)
418 return 0;
419
420 /* Make sure the unwritten flag matches. */
421 if (XFS_IS_CORRUPT(mp,
422 (flags & XFS_RMAP_UNWRITTEN) !=
423 (rec->rm_flags & XFS_RMAP_UNWRITTEN))) {
424 error = -EFSCORRUPTED;
425 goto out;
426 }
427
428 /* Make sure the owner matches what we expect to find in the tree. */
429 if (XFS_IS_CORRUPT(mp, owner != rec->rm_owner)) {
430 error = -EFSCORRUPTED;
431 goto out;
432 }
433
434 /* Check the offset, if necessary. */
435 if (XFS_RMAP_NON_INODE_OWNER(owner))
436 goto out;
437
438 if (flags & XFS_RMAP_BMBT_BLOCK) {
439 if (XFS_IS_CORRUPT(mp,
440 !(rec->rm_flags & XFS_RMAP_BMBT_BLOCK))) {
441 error = -EFSCORRUPTED;
442 goto out;
443 }
444 } else {
445 if (XFS_IS_CORRUPT(mp, rec->rm_offset > offset)) {
446 error = -EFSCORRUPTED;
447 goto out;
448 }
449 if (XFS_IS_CORRUPT(mp,
450 offset + len > ltoff + rec->rm_blockcount)) {
451 error = -EFSCORRUPTED;
452 goto out;
453 }
454 }
455
456out:
457 return error;
458}
459
460/*
461 * Find the extent in the rmap btree and remove it.
462 *
463 * The record we find should always be an exact match for the extent that we're
464 * looking for, since we insert them into the btree without modification.
465 *
466 * Special Case #1: when growing the filesystem, we "free" an extent when
467 * growing the last AG. This extent is new space and so it is not tracked as
468 * used space in the btree. The growfs code will pass in an owner of
469 * XFS_RMAP_OWN_NULL to indicate that it expected that there is no owner of this
470 * extent. We verify that - the extent lookup result in a record that does not
471 * overlap.
472 *
473 * Special Case #2: EFIs do not record the owner of the extent, so when
474 * recovering EFIs from the log we pass in XFS_RMAP_OWN_UNKNOWN to tell the rmap
475 * btree to ignore the owner (i.e. wildcard match) so we don't trigger
476 * corruption checks during log recovery.
477 */
478STATIC int
479xfs_rmap_unmap(
480 struct xfs_btree_cur *cur,
481 xfs_agblock_t bno,
482 xfs_extlen_t len,
483 bool unwritten,
484 const struct xfs_owner_info *oinfo)
485{
486 struct xfs_mount *mp = cur->bc_mp;
487 struct xfs_rmap_irec ltrec;
488 uint64_t ltoff;
489 int error = 0;
490 int i;
491 uint64_t owner;
492 uint64_t offset;
493 unsigned int flags;
494 bool ignore_off;
495
496 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
497 ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
498 (flags & XFS_RMAP_BMBT_BLOCK);
499 if (unwritten)
500 flags |= XFS_RMAP_UNWRITTEN;
501 trace_xfs_rmap_unmap(mp, cur->bc_ag.agno, bno, len,
502 unwritten, oinfo);
503
504 /*
505 * We should always have a left record because there's a static record
506 * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
507 * will not ever be removed from the tree.
508 */
509 error = xfs_rmap_lookup_le(cur, bno, len, owner, offset, flags, &i);
510 if (error)
511 goto out_error;
512 if (XFS_IS_CORRUPT(mp, i != 1)) {
513 error = -EFSCORRUPTED;
514 goto out_error;
515 }
516
517 error = xfs_rmap_get_rec(cur, <rec, &i);
518 if (error)
519 goto out_error;
520 if (XFS_IS_CORRUPT(mp, i != 1)) {
521 error = -EFSCORRUPTED;
522 goto out_error;
523 }
524 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
525 cur->bc_ag.agno, ltrec.rm_startblock,
526 ltrec.rm_blockcount, ltrec.rm_owner,
527 ltrec.rm_offset, ltrec.rm_flags);
528 ltoff = ltrec.rm_offset;
529
530 /*
531 * For growfs, the incoming extent must be beyond the left record we
532 * just found as it is new space and won't be used by anyone. This is
533 * just a corruption check as we don't actually do anything with this
534 * extent. Note that we need to use >= instead of > because it might
535 * be the case that the "left" extent goes all the way to EOFS.
536 */
537 if (owner == XFS_RMAP_OWN_NULL) {
538 if (XFS_IS_CORRUPT(mp,
539 bno <
540 ltrec.rm_startblock + ltrec.rm_blockcount)) {
541 error = -EFSCORRUPTED;
542 goto out_error;
543 }
544 goto out_done;
545 }
546
547 /*
548 * If we're doing an unknown-owner removal for EFI recovery, we expect
549 * to find the full range in the rmapbt or nothing at all. If we
550 * don't find any rmaps overlapping either end of the range, we're
551 * done. Hopefully this means that the EFI creator already queued
552 * (and finished) a RUI to remove the rmap.
553 */
554 if (owner == XFS_RMAP_OWN_UNKNOWN &&
555 ltrec.rm_startblock + ltrec.rm_blockcount <= bno) {
556 struct xfs_rmap_irec rtrec;
557
558 error = xfs_btree_increment(cur, 0, &i);
559 if (error)
560 goto out_error;
561 if (i == 0)
562 goto out_done;
563 error = xfs_rmap_get_rec(cur, &rtrec, &i);
564 if (error)
565 goto out_error;
566 if (XFS_IS_CORRUPT(mp, i != 1)) {
567 error = -EFSCORRUPTED;
568 goto out_error;
569 }
570 if (rtrec.rm_startblock >= bno + len)
571 goto out_done;
572 }
573
574 /* Make sure the extent we found covers the entire freeing range. */
575 if (XFS_IS_CORRUPT(mp,
576 ltrec.rm_startblock > bno ||
577 ltrec.rm_startblock + ltrec.rm_blockcount <
578 bno + len)) {
579 error = -EFSCORRUPTED;
580 goto out_error;
581 }
582
583 /* Check owner information. */
584 error = xfs_rmap_free_check_owner(mp, ltoff, <rec, len, owner,
585 offset, flags);
586 if (error)
587 goto out_error;
588
589 if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
590 /* exact match, simply remove the record from rmap tree */
591 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
592 ltrec.rm_startblock, ltrec.rm_blockcount,
593 ltrec.rm_owner, ltrec.rm_offset,
594 ltrec.rm_flags);
595 error = xfs_btree_delete(cur, &i);
596 if (error)
597 goto out_error;
598 if (XFS_IS_CORRUPT(mp, i != 1)) {
599 error = -EFSCORRUPTED;
600 goto out_error;
601 }
602 } else if (ltrec.rm_startblock == bno) {
603 /*
604 * overlap left hand side of extent: move the start, trim the
605 * length and update the current record.
606 *
607 * ltbno ltlen
608 * Orig: |oooooooooooooooooooo|
609 * Freeing: |fffffffff|
610 * Result: |rrrrrrrrrr|
611 * bno len
612 */
613 ltrec.rm_startblock += len;
614 ltrec.rm_blockcount -= len;
615 if (!ignore_off)
616 ltrec.rm_offset += len;
617 error = xfs_rmap_update(cur, <rec);
618 if (error)
619 goto out_error;
620 } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
621 /*
622 * overlap right hand side of extent: trim the length and update
623 * the current record.
624 *
625 * ltbno ltlen
626 * Orig: |oooooooooooooooooooo|
627 * Freeing: |fffffffff|
628 * Result: |rrrrrrrrrr|
629 * bno len
630 */
631 ltrec.rm_blockcount -= len;
632 error = xfs_rmap_update(cur, <rec);
633 if (error)
634 goto out_error;
635 } else {
636
637 /*
638 * overlap middle of extent: trim the length of the existing
639 * record to the length of the new left-extent size, increment
640 * the insertion position so we can insert a new record
641 * containing the remaining right-extent space.
642 *
643 * ltbno ltlen
644 * Orig: |oooooooooooooooooooo|
645 * Freeing: |fffffffff|
646 * Result: |rrrrr| |rrrr|
647 * bno len
648 */
649 xfs_extlen_t orig_len = ltrec.rm_blockcount;
650
651 ltrec.rm_blockcount = bno - ltrec.rm_startblock;
652 error = xfs_rmap_update(cur, <rec);
653 if (error)
654 goto out_error;
655
656 error = xfs_btree_increment(cur, 0, &i);
657 if (error)
658 goto out_error;
659
660 cur->bc_rec.r.rm_startblock = bno + len;
661 cur->bc_rec.r.rm_blockcount = orig_len - len -
662 ltrec.rm_blockcount;
663 cur->bc_rec.r.rm_owner = ltrec.rm_owner;
664 if (ignore_off)
665 cur->bc_rec.r.rm_offset = 0;
666 else
667 cur->bc_rec.r.rm_offset = offset + len;
668 cur->bc_rec.r.rm_flags = flags;
669 trace_xfs_rmap_insert(mp, cur->bc_ag.agno,
670 cur->bc_rec.r.rm_startblock,
671 cur->bc_rec.r.rm_blockcount,
672 cur->bc_rec.r.rm_owner,
673 cur->bc_rec.r.rm_offset,
674 cur->bc_rec.r.rm_flags);
675 error = xfs_btree_insert(cur, &i);
676 if (error)
677 goto out_error;
678 }
679
680out_done:
681 trace_xfs_rmap_unmap_done(mp, cur->bc_ag.agno, bno, len,
682 unwritten, oinfo);
683out_error:
684 if (error)
685 trace_xfs_rmap_unmap_error(mp, cur->bc_ag.agno,
686 error, _RET_IP_);
687 return error;
688}
689
690/*
691 * Remove a reference to an extent in the rmap btree.
692 */
693int
694xfs_rmap_free(
695 struct xfs_trans *tp,
696 struct xfs_buf *agbp,
697 xfs_agnumber_t agno,
698 xfs_agblock_t bno,
699 xfs_extlen_t len,
700 const struct xfs_owner_info *oinfo)
701{
702 struct xfs_mount *mp = tp->t_mountp;
703 struct xfs_btree_cur *cur;
704 int error;
705
706 if (!xfs_sb_version_hasrmapbt(&mp->m_sb))
707 return 0;
708
709 cur = xfs_rmapbt_init_cursor(mp, tp, agbp, agno);
710
711 error = xfs_rmap_unmap(cur, bno, len, false, oinfo);
712
713 xfs_btree_del_cursor(cur, error);
714 return error;
715}
716
717/*
718 * A mergeable rmap must have the same owner and the same values for
719 * the unwritten, attr_fork, and bmbt flags. The startblock and
720 * offset are checked separately.
721 */
722static bool
723xfs_rmap_is_mergeable(
724 struct xfs_rmap_irec *irec,
725 uint64_t owner,
726 unsigned int flags)
727{
728 if (irec->rm_owner == XFS_RMAP_OWN_NULL)
729 return false;
730 if (irec->rm_owner != owner)
731 return false;
732 if ((flags & XFS_RMAP_UNWRITTEN) ^
733 (irec->rm_flags & XFS_RMAP_UNWRITTEN))
734 return false;
735 if ((flags & XFS_RMAP_ATTR_FORK) ^
736 (irec->rm_flags & XFS_RMAP_ATTR_FORK))
737 return false;
738 if ((flags & XFS_RMAP_BMBT_BLOCK) ^
739 (irec->rm_flags & XFS_RMAP_BMBT_BLOCK))
740 return false;
741 return true;
742}
743
744/*
745 * When we allocate a new block, the first thing we do is add a reference to
746 * the extent in the rmap btree. This takes the form of a [agbno, length,
747 * owner, offset] record. Flags are encoded in the high bits of the offset
748 * field.
749 */
750STATIC int
751xfs_rmap_map(
752 struct xfs_btree_cur *cur,
753 xfs_agblock_t bno,
754 xfs_extlen_t len,
755 bool unwritten,
756 const struct xfs_owner_info *oinfo)
757{
758 struct xfs_mount *mp = cur->bc_mp;
759 struct xfs_rmap_irec ltrec;
760 struct xfs_rmap_irec gtrec;
761 int have_gt;
762 int have_lt;
763 int error = 0;
764 int i;
765 uint64_t owner;
766 uint64_t offset;
767 unsigned int flags = 0;
768 bool ignore_off;
769
770 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
771 ASSERT(owner != 0);
772 ignore_off = XFS_RMAP_NON_INODE_OWNER(owner) ||
773 (flags & XFS_RMAP_BMBT_BLOCK);
774 if (unwritten)
775 flags |= XFS_RMAP_UNWRITTEN;
776 trace_xfs_rmap_map(mp, cur->bc_ag.agno, bno, len,
777 unwritten, oinfo);
778 ASSERT(!xfs_rmap_should_skip_owner_update(oinfo));
779
780 /*
781 * For the initial lookup, look for an exact match or the left-adjacent
782 * record for our insertion point. This will also give us the record for
783 * start block contiguity tests.
784 */
785 error = xfs_rmap_lookup_le(cur, bno, len, owner, offset, flags,
786 &have_lt);
787 if (error)
788 goto out_error;
789 if (have_lt) {
790 error = xfs_rmap_get_rec(cur, <rec, &have_lt);
791 if (error)
792 goto out_error;
793 if (XFS_IS_CORRUPT(mp, have_lt != 1)) {
794 error = -EFSCORRUPTED;
795 goto out_error;
796 }
797 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
798 cur->bc_ag.agno, ltrec.rm_startblock,
799 ltrec.rm_blockcount, ltrec.rm_owner,
800 ltrec.rm_offset, ltrec.rm_flags);
801
802 if (!xfs_rmap_is_mergeable(<rec, owner, flags))
803 have_lt = 0;
804 }
805
806 if (XFS_IS_CORRUPT(mp,
807 have_lt != 0 &&
808 ltrec.rm_startblock + ltrec.rm_blockcount > bno)) {
809 error = -EFSCORRUPTED;
810 goto out_error;
811 }
812
813 /*
814 * Increment the cursor to see if we have a right-adjacent record to our
815 * insertion point. This will give us the record for end block
816 * contiguity tests.
817 */
818 error = xfs_btree_increment(cur, 0, &have_gt);
819 if (error)
820 goto out_error;
821 if (have_gt) {
822 error = xfs_rmap_get_rec(cur, >rec, &have_gt);
823 if (error)
824 goto out_error;
825 if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
826 error = -EFSCORRUPTED;
827 goto out_error;
828 }
829 if (XFS_IS_CORRUPT(mp, bno + len > gtrec.rm_startblock)) {
830 error = -EFSCORRUPTED;
831 goto out_error;
832 }
833 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
834 cur->bc_ag.agno, gtrec.rm_startblock,
835 gtrec.rm_blockcount, gtrec.rm_owner,
836 gtrec.rm_offset, gtrec.rm_flags);
837 if (!xfs_rmap_is_mergeable(>rec, owner, flags))
838 have_gt = 0;
839 }
840
841 /*
842 * Note: cursor currently points one record to the right of ltrec, even
843 * if there is no record in the tree to the right.
844 */
845 if (have_lt &&
846 ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
847 (ignore_off || ltrec.rm_offset + ltrec.rm_blockcount == offset)) {
848 /*
849 * left edge contiguous, merge into left record.
850 *
851 * ltbno ltlen
852 * orig: |ooooooooo|
853 * adding: |aaaaaaaaa|
854 * result: |rrrrrrrrrrrrrrrrrrr|
855 * bno len
856 */
857 ltrec.rm_blockcount += len;
858 if (have_gt &&
859 bno + len == gtrec.rm_startblock &&
860 (ignore_off || offset + len == gtrec.rm_offset) &&
861 (unsigned long)ltrec.rm_blockcount + len +
862 gtrec.rm_blockcount <= XFS_RMAP_LEN_MAX) {
863 /*
864 * right edge also contiguous, delete right record
865 * and merge into left record.
866 *
867 * ltbno ltlen gtbno gtlen
868 * orig: |ooooooooo| |ooooooooo|
869 * adding: |aaaaaaaaa|
870 * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
871 */
872 ltrec.rm_blockcount += gtrec.rm_blockcount;
873 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
874 gtrec.rm_startblock,
875 gtrec.rm_blockcount,
876 gtrec.rm_owner,
877 gtrec.rm_offset,
878 gtrec.rm_flags);
879 error = xfs_btree_delete(cur, &i);
880 if (error)
881 goto out_error;
882 if (XFS_IS_CORRUPT(mp, i != 1)) {
883 error = -EFSCORRUPTED;
884 goto out_error;
885 }
886 }
887
888 /* point the cursor back to the left record and update */
889 error = xfs_btree_decrement(cur, 0, &have_gt);
890 if (error)
891 goto out_error;
892 error = xfs_rmap_update(cur, <rec);
893 if (error)
894 goto out_error;
895 } else if (have_gt &&
896 bno + len == gtrec.rm_startblock &&
897 (ignore_off || offset + len == gtrec.rm_offset)) {
898 /*
899 * right edge contiguous, merge into right record.
900 *
901 * gtbno gtlen
902 * Orig: |ooooooooo|
903 * adding: |aaaaaaaaa|
904 * Result: |rrrrrrrrrrrrrrrrrrr|
905 * bno len
906 */
907 gtrec.rm_startblock = bno;
908 gtrec.rm_blockcount += len;
909 if (!ignore_off)
910 gtrec.rm_offset = offset;
911 error = xfs_rmap_update(cur, >rec);
912 if (error)
913 goto out_error;
914 } else {
915 /*
916 * no contiguous edge with identical owner, insert
917 * new record at current cursor position.
918 */
919 cur->bc_rec.r.rm_startblock = bno;
920 cur->bc_rec.r.rm_blockcount = len;
921 cur->bc_rec.r.rm_owner = owner;
922 cur->bc_rec.r.rm_offset = offset;
923 cur->bc_rec.r.rm_flags = flags;
924 trace_xfs_rmap_insert(mp, cur->bc_ag.agno, bno, len,
925 owner, offset, flags);
926 error = xfs_btree_insert(cur, &i);
927 if (error)
928 goto out_error;
929 if (XFS_IS_CORRUPT(mp, i != 1)) {
930 error = -EFSCORRUPTED;
931 goto out_error;
932 }
933 }
934
935 trace_xfs_rmap_map_done(mp, cur->bc_ag.agno, bno, len,
936 unwritten, oinfo);
937out_error:
938 if (error)
939 trace_xfs_rmap_map_error(mp, cur->bc_ag.agno,
940 error, _RET_IP_);
941 return error;
942}
943
944/*
945 * Add a reference to an extent in the rmap btree.
946 */
947int
948xfs_rmap_alloc(
949 struct xfs_trans *tp,
950 struct xfs_buf *agbp,
951 xfs_agnumber_t agno,
952 xfs_agblock_t bno,
953 xfs_extlen_t len,
954 const struct xfs_owner_info *oinfo)
955{
956 struct xfs_mount *mp = tp->t_mountp;
957 struct xfs_btree_cur *cur;
958 int error;
959
960 if (!xfs_sb_version_hasrmapbt(&mp->m_sb))
961 return 0;
962
963 cur = xfs_rmapbt_init_cursor(mp, tp, agbp, agno);
964 error = xfs_rmap_map(cur, bno, len, false, oinfo);
965
966 xfs_btree_del_cursor(cur, error);
967 return error;
968}
969
970#define RMAP_LEFT_CONTIG (1 << 0)
971#define RMAP_RIGHT_CONTIG (1 << 1)
972#define RMAP_LEFT_FILLING (1 << 2)
973#define RMAP_RIGHT_FILLING (1 << 3)
974#define RMAP_LEFT_VALID (1 << 6)
975#define RMAP_RIGHT_VALID (1 << 7)
976
977#define LEFT r[0]
978#define RIGHT r[1]
979#define PREV r[2]
980#define NEW r[3]
981
982/*
983 * Convert an unwritten extent to a real extent or vice versa.
984 * Does not handle overlapping extents.
985 */
986STATIC int
987xfs_rmap_convert(
988 struct xfs_btree_cur *cur,
989 xfs_agblock_t bno,
990 xfs_extlen_t len,
991 bool unwritten,
992 const struct xfs_owner_info *oinfo)
993{
994 struct xfs_mount *mp = cur->bc_mp;
995 struct xfs_rmap_irec r[4]; /* neighbor extent entries */
996 /* left is 0, right is 1, */
997 /* prev is 2, new is 3 */
998 uint64_t owner;
999 uint64_t offset;
1000 uint64_t new_endoff;
1001 unsigned int oldext;
1002 unsigned int newext;
1003 unsigned int flags = 0;
1004 int i;
1005 int state = 0;
1006 int error;
1007
1008 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
1009 ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
1010 (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
1011 oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
1012 new_endoff = offset + len;
1013 trace_xfs_rmap_convert(mp, cur->bc_ag.agno, bno, len,
1014 unwritten, oinfo);
1015
1016 /*
1017 * For the initial lookup, look for an exact match or the left-adjacent
1018 * record for our insertion point. This will also give us the record for
1019 * start block contiguity tests.
1020 */
1021 error = xfs_rmap_lookup_le(cur, bno, len, owner, offset, oldext, &i);
1022 if (error)
1023 goto done;
1024 if (XFS_IS_CORRUPT(mp, i != 1)) {
1025 error = -EFSCORRUPTED;
1026 goto done;
1027 }
1028
1029 error = xfs_rmap_get_rec(cur, &PREV, &i);
1030 if (error)
1031 goto done;
1032 if (XFS_IS_CORRUPT(mp, i != 1)) {
1033 error = -EFSCORRUPTED;
1034 goto done;
1035 }
1036 trace_xfs_rmap_lookup_le_range_result(cur->bc_mp,
1037 cur->bc_ag.agno, PREV.rm_startblock,
1038 PREV.rm_blockcount, PREV.rm_owner,
1039 PREV.rm_offset, PREV.rm_flags);
1040
1041 ASSERT(PREV.rm_offset <= offset);
1042 ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
1043 ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
1044 newext = ~oldext & XFS_RMAP_UNWRITTEN;
1045
1046 /*
1047 * Set flags determining what part of the previous oldext allocation
1048 * extent is being replaced by a newext allocation.
1049 */
1050 if (PREV.rm_offset == offset)
1051 state |= RMAP_LEFT_FILLING;
1052 if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
1053 state |= RMAP_RIGHT_FILLING;
1054
1055 /*
1056 * Decrement the cursor to see if we have a left-adjacent record to our
1057 * insertion point. This will give us the record for end block
1058 * contiguity tests.
1059 */
1060 error = xfs_btree_decrement(cur, 0, &i);
1061 if (error)
1062 goto done;
1063 if (i) {
1064 state |= RMAP_LEFT_VALID;
1065 error = xfs_rmap_get_rec(cur, &LEFT, &i);
1066 if (error)
1067 goto done;
1068 if (XFS_IS_CORRUPT(mp, i != 1)) {
1069 error = -EFSCORRUPTED;
1070 goto done;
1071 }
1072 if (XFS_IS_CORRUPT(mp,
1073 LEFT.rm_startblock + LEFT.rm_blockcount >
1074 bno)) {
1075 error = -EFSCORRUPTED;
1076 goto done;
1077 }
1078 trace_xfs_rmap_find_left_neighbor_result(cur->bc_mp,
1079 cur->bc_ag.agno, LEFT.rm_startblock,
1080 LEFT.rm_blockcount, LEFT.rm_owner,
1081 LEFT.rm_offset, LEFT.rm_flags);
1082 if (LEFT.rm_startblock + LEFT.rm_blockcount == bno &&
1083 LEFT.rm_offset + LEFT.rm_blockcount == offset &&
1084 xfs_rmap_is_mergeable(&LEFT, owner, newext))
1085 state |= RMAP_LEFT_CONTIG;
1086 }
1087
1088 /*
1089 * Increment the cursor to see if we have a right-adjacent record to our
1090 * insertion point. This will give us the record for end block
1091 * contiguity tests.
1092 */
1093 error = xfs_btree_increment(cur, 0, &i);
1094 if (error)
1095 goto done;
1096 if (XFS_IS_CORRUPT(mp, i != 1)) {
1097 error = -EFSCORRUPTED;
1098 goto done;
1099 }
1100 error = xfs_btree_increment(cur, 0, &i);
1101 if (error)
1102 goto done;
1103 if (i) {
1104 state |= RMAP_RIGHT_VALID;
1105 error = xfs_rmap_get_rec(cur, &RIGHT, &i);
1106 if (error)
1107 goto done;
1108 if (XFS_IS_CORRUPT(mp, i != 1)) {
1109 error = -EFSCORRUPTED;
1110 goto done;
1111 }
1112 if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
1113 error = -EFSCORRUPTED;
1114 goto done;
1115 }
1116 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
1117 cur->bc_ag.agno, RIGHT.rm_startblock,
1118 RIGHT.rm_blockcount, RIGHT.rm_owner,
1119 RIGHT.rm_offset, RIGHT.rm_flags);
1120 if (bno + len == RIGHT.rm_startblock &&
1121 offset + len == RIGHT.rm_offset &&
1122 xfs_rmap_is_mergeable(&RIGHT, owner, newext))
1123 state |= RMAP_RIGHT_CONTIG;
1124 }
1125
1126 /* check that left + prev + right is not too long */
1127 if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1128 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
1129 (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1130 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
1131 (unsigned long)LEFT.rm_blockcount + len +
1132 RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
1133 state &= ~RMAP_RIGHT_CONTIG;
1134
1135 trace_xfs_rmap_convert_state(mp, cur->bc_ag.agno, state,
1136 _RET_IP_);
1137
1138 /* reset the cursor back to PREV */
1139 error = xfs_rmap_lookup_le(cur, bno, len, owner, offset, oldext, &i);
1140 if (error)
1141 goto done;
1142 if (XFS_IS_CORRUPT(mp, i != 1)) {
1143 error = -EFSCORRUPTED;
1144 goto done;
1145 }
1146
1147 /*
1148 * Switch out based on the FILLING and CONTIG state bits.
1149 */
1150 switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1151 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
1152 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1153 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1154 /*
1155 * Setting all of a previous oldext extent to newext.
1156 * The left and right neighbors are both contiguous with new.
1157 */
1158 error = xfs_btree_increment(cur, 0, &i);
1159 if (error)
1160 goto done;
1161 if (XFS_IS_CORRUPT(mp, i != 1)) {
1162 error = -EFSCORRUPTED;
1163 goto done;
1164 }
1165 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
1166 RIGHT.rm_startblock, RIGHT.rm_blockcount,
1167 RIGHT.rm_owner, RIGHT.rm_offset,
1168 RIGHT.rm_flags);
1169 error = xfs_btree_delete(cur, &i);
1170 if (error)
1171 goto done;
1172 if (XFS_IS_CORRUPT(mp, i != 1)) {
1173 error = -EFSCORRUPTED;
1174 goto done;
1175 }
1176 error = xfs_btree_decrement(cur, 0, &i);
1177 if (error)
1178 goto done;
1179 if (XFS_IS_CORRUPT(mp, i != 1)) {
1180 error = -EFSCORRUPTED;
1181 goto done;
1182 }
1183 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
1184 PREV.rm_startblock, PREV.rm_blockcount,
1185 PREV.rm_owner, PREV.rm_offset,
1186 PREV.rm_flags);
1187 error = xfs_btree_delete(cur, &i);
1188 if (error)
1189 goto done;
1190 if (XFS_IS_CORRUPT(mp, i != 1)) {
1191 error = -EFSCORRUPTED;
1192 goto done;
1193 }
1194 error = xfs_btree_decrement(cur, 0, &i);
1195 if (error)
1196 goto done;
1197 if (XFS_IS_CORRUPT(mp, i != 1)) {
1198 error = -EFSCORRUPTED;
1199 goto done;
1200 }
1201 NEW = LEFT;
1202 NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
1203 error = xfs_rmap_update(cur, &NEW);
1204 if (error)
1205 goto done;
1206 break;
1207
1208 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1209 /*
1210 * Setting all of a previous oldext extent to newext.
1211 * The left neighbor is contiguous, the right is not.
1212 */
1213 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
1214 PREV.rm_startblock, PREV.rm_blockcount,
1215 PREV.rm_owner, PREV.rm_offset,
1216 PREV.rm_flags);
1217 error = xfs_btree_delete(cur, &i);
1218 if (error)
1219 goto done;
1220 if (XFS_IS_CORRUPT(mp, i != 1)) {
1221 error = -EFSCORRUPTED;
1222 goto done;
1223 }
1224 error = xfs_btree_decrement(cur, 0, &i);
1225 if (error)
1226 goto done;
1227 if (XFS_IS_CORRUPT(mp, i != 1)) {
1228 error = -EFSCORRUPTED;
1229 goto done;
1230 }
1231 NEW = LEFT;
1232 NEW.rm_blockcount += PREV.rm_blockcount;
1233 error = xfs_rmap_update(cur, &NEW);
1234 if (error)
1235 goto done;
1236 break;
1237
1238 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1239 /*
1240 * Setting all of a previous oldext extent to newext.
1241 * The right neighbor is contiguous, the left is not.
1242 */
1243 error = xfs_btree_increment(cur, 0, &i);
1244 if (error)
1245 goto done;
1246 if (XFS_IS_CORRUPT(mp, i != 1)) {
1247 error = -EFSCORRUPTED;
1248 goto done;
1249 }
1250 trace_xfs_rmap_delete(mp, cur->bc_ag.agno,
1251 RIGHT.rm_startblock, RIGHT.rm_blockcount,
1252 RIGHT.rm_owner, RIGHT.rm_offset,
1253 RIGHT.rm_flags);
1254 error = xfs_btree_delete(cur, &i);
1255 if (error)
1256 goto done;
1257 if (XFS_IS_CORRUPT(mp, i != 1)) {
1258 error = -EFSCORRUPTED;
1259 goto done;
1260 }
1261 error = xfs_btree_decrement(cur, 0, &i);
1262 if (error)
1263 goto done;
1264 if (XFS_IS_CORRUPT(mp, i != 1)) {
1265 error = -EFSCORRUPTED;
1266 goto done;
1267 }
1268 NEW = PREV;
1269 NEW.rm_blockcount = len + RIGHT.rm_blockcount;
1270 NEW.rm_flags = newext;
1271 error = xfs_rmap_update(cur, &NEW);
1272 if (error)
1273 goto done;
1274 break;
1275
1276 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
1277 /*
1278 * Setting all of a previous oldext extent to newext.
1279 * Neither the left nor right neighbors are contiguous with
1280 * the new one.
1281 */
1282 NEW = PREV;
1283 NEW.rm_flags = newext;
1284 error = xfs_rmap_update(cur, &NEW);
1285 if (error)
1286 goto done;
1287 break;
1288
1289 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
1290 /*
1291 * Setting the first part of a previous oldext extent to newext.
1292 * The left neighbor is contiguous.
1293 */
1294 NEW = PREV;
1295 NEW.rm_offset += len;
1296 NEW.rm_startblock += len;
1297 NEW.rm_blockcount -= len;
1298 error = xfs_rmap_update(cur, &NEW);
1299 if (error)
1300 goto done;
1301 error = xfs_btree_decrement(cur, 0, &i);
1302 if (error)
1303 goto done;
1304 NEW = LEFT;
1305 NEW.rm_blockcount += len;
1306 error = xfs_rmap_update(cur, &NEW);
1307 if (error)
1308 goto done;
1309 break;
1310
1311 case RMAP_LEFT_FILLING:
1312 /*
1313 * Setting the first part of a previous oldext extent to newext.
1314 * The left neighbor is not contiguous.
1315 */
1316 NEW = PREV;
1317 NEW.rm_startblock += len;
1318 NEW.rm_offset += len;
1319 NEW.rm_blockcount -= len;
1320 error = xfs_rmap_update(cur, &NEW);
1321 if (error)
1322 goto done;
1323 NEW.rm_startblock = bno;
1324 NEW.rm_owner = owner;
1325 NEW.rm_offset = offset;
1326 NEW.rm_blockcount = len;
1327 NEW.rm_flags = newext;
1328 cur->bc_rec.r = NEW;
1329 trace_xfs_rmap_insert(mp, cur->bc_ag.agno, bno,
1330 len, owner, offset, newext);
1331 error = xfs_btree_insert(cur, &i);
1332 if (error)
1333 goto done;
1334 if (XFS_IS_CORRUPT(mp, i != 1)) {
1335 error = -EFSCORRUPTED;
1336 goto done;
1337 }
1338 break;
1339
1340 case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1341 /*
1342 * Setting the last part of a previous oldext extent to newext.
1343 * The right neighbor is contiguous with the new allocation.
1344 */
1345 NEW = PREV;
1346 NEW.rm_blockcount -= len;
1347 error = xfs_rmap_update(cur, &NEW);
1348 if (error)
1349 goto done;
1350 error = xfs_btree_increment(cur, 0, &i);
1351 if (error)
1352 goto done;
1353 NEW = RIGHT;
1354 NEW.rm_offset = offset;
1355 NEW.rm_startblock = bno;
1356 NEW.rm_blockcount += len;
1357 error = xfs_rmap_update(cur, &NEW);
1358 if (error)
1359 goto done;
1360 break;
1361
1362 case RMAP_RIGHT_FILLING:
1363 /*
1364 * Setting the last part of a previous oldext extent to newext.
1365 * The right neighbor is not contiguous.
1366 */
1367 NEW = PREV;
1368 NEW.rm_blockcount -= len;
1369 error = xfs_rmap_update(cur, &NEW);
1370 if (error)
1371 goto done;
1372 error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
1373 oldext, &i);
1374 if (error)
1375 goto done;
1376 if (XFS_IS_CORRUPT(mp, i != 0)) {
1377 error = -EFSCORRUPTED;
1378 goto done;
1379 }
1380 NEW.rm_startblock = bno;
1381 NEW.rm_owner = owner;
1382 NEW.rm_offset = offset;
1383 NEW.rm_blockcount = len;
1384 NEW.rm_flags = newext;
1385 cur->bc_rec.r = NEW;
1386 trace_xfs_rmap_insert(mp, cur->bc_ag.agno, bno,
1387 len, owner, offset, newext);
1388 error = xfs_btree_insert(cur, &i);
1389 if (error)
1390 goto done;
1391 if (XFS_IS_CORRUPT(mp, i != 1)) {
1392 error = -EFSCORRUPTED;
1393 goto done;
1394 }
1395 break;
1396
1397 case 0:
1398 /*
1399 * Setting the middle part of a previous oldext extent to
1400 * newext. Contiguity is impossible here.
1401 * One extent becomes three extents.
1402 */
1403 /* new right extent - oldext */
1404 NEW.rm_startblock = bno + len;
1405 NEW.rm_owner = owner;
1406 NEW.rm_offset = new_endoff;
1407 NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
1408 new_endoff;
1409 NEW.rm_flags = PREV.rm_flags;
1410 error = xfs_rmap_update(cur, &NEW);
1411 if (error)
1412 goto done;
1413 /* new left extent - oldext */
1414 NEW = PREV;
1415 NEW.rm_blockcount = offset - PREV.rm_offset;
1416 cur->bc_rec.r = NEW;
1417 trace_xfs_rmap_insert(mp, cur->bc_ag.agno,
1418 NEW.rm_startblock, NEW.rm_blockcount,
1419 NEW.rm_owner, NEW.rm_offset,
1420 NEW.rm_flags);
1421 error = xfs_btree_insert(cur, &i);
1422 if (error)
1423 goto done;
1424 if (XFS_IS_CORRUPT(mp, i != 1)) {
1425 error = -EFSCORRUPTED;
1426 goto done;
1427 }
1428 /*
1429 * Reset the cursor to the position of the new extent
1430 * we are about to insert as we can't trust it after
1431 * the previous insert.
1432 */
1433 error = xfs_rmap_lookup_eq(cur, bno, len, owner, offset,
1434 oldext, &i);
1435 if (error)
1436 goto done;
1437 if (XFS_IS_CORRUPT(mp, i != 0)) {
1438 error = -EFSCORRUPTED;
1439 goto done;
1440 }
1441 /* new middle extent - newext */
1442 cur->bc_rec.r.rm_flags &= ~XFS_RMAP_UNWRITTEN;
1443 cur->bc_rec.r.rm_flags |= newext;
1444 trace_xfs_rmap_insert(mp, cur->bc_ag.agno, bno, len,
1445 owner, offset, newext);
1446 error = xfs_btree_insert(cur, &i);
1447 if (error)
1448 goto done;
1449 if (XFS_IS_CORRUPT(mp, i != 1)) {
1450 error = -EFSCORRUPTED;
1451 goto done;
1452 }
1453 break;
1454
1455 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1456 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1457 case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
1458 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1459 case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1460 case RMAP_LEFT_CONTIG:
1461 case RMAP_RIGHT_CONTIG:
1462 /*
1463 * These cases are all impossible.
1464 */
1465 ASSERT(0);
1466 }
1467
1468 trace_xfs_rmap_convert_done(mp, cur->bc_ag.agno, bno, len,
1469 unwritten, oinfo);
1470done:
1471 if (error)
1472 trace_xfs_rmap_convert_error(cur->bc_mp,
1473 cur->bc_ag.agno, error, _RET_IP_);
1474 return error;
1475}
1476
1477/*
1478 * Convert an unwritten extent to a real extent or vice versa. If there is no
1479 * possibility of overlapping extents, delegate to the simpler convert
1480 * function.
1481 */
1482STATIC int
1483xfs_rmap_convert_shared(
1484 struct xfs_btree_cur *cur,
1485 xfs_agblock_t bno,
1486 xfs_extlen_t len,
1487 bool unwritten,
1488 const struct xfs_owner_info *oinfo)
1489{
1490 struct xfs_mount *mp = cur->bc_mp;
1491 struct xfs_rmap_irec r[4]; /* neighbor extent entries */
1492 /* left is 0, right is 1, */
1493 /* prev is 2, new is 3 */
1494 uint64_t owner;
1495 uint64_t offset;
1496 uint64_t new_endoff;
1497 unsigned int oldext;
1498 unsigned int newext;
1499 unsigned int flags = 0;
1500 int i;
1501 int state = 0;
1502 int error;
1503
1504 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
1505 ASSERT(!(XFS_RMAP_NON_INODE_OWNER(owner) ||
1506 (flags & (XFS_RMAP_ATTR_FORK | XFS_RMAP_BMBT_BLOCK))));
1507 oldext = unwritten ? XFS_RMAP_UNWRITTEN : 0;
1508 new_endoff = offset + len;
1509 trace_xfs_rmap_convert(mp, cur->bc_ag.agno, bno, len,
1510 unwritten, oinfo);
1511
1512 /*
1513 * For the initial lookup, look for and exact match or the left-adjacent
1514 * record for our insertion point. This will also give us the record for
1515 * start block contiguity tests.
1516 */
1517 error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, flags,
1518 &PREV, &i);
1519 if (error)
1520 goto done;
1521 if (XFS_IS_CORRUPT(mp, i != 1)) {
1522 error = -EFSCORRUPTED;
1523 goto done;
1524 }
1525
1526 ASSERT(PREV.rm_offset <= offset);
1527 ASSERT(PREV.rm_offset + PREV.rm_blockcount >= new_endoff);
1528 ASSERT((PREV.rm_flags & XFS_RMAP_UNWRITTEN) == oldext);
1529 newext = ~oldext & XFS_RMAP_UNWRITTEN;
1530
1531 /*
1532 * Set flags determining what part of the previous oldext allocation
1533 * extent is being replaced by a newext allocation.
1534 */
1535 if (PREV.rm_offset == offset)
1536 state |= RMAP_LEFT_FILLING;
1537 if (PREV.rm_offset + PREV.rm_blockcount == new_endoff)
1538 state |= RMAP_RIGHT_FILLING;
1539
1540 /* Is there a left record that abuts our range? */
1541 error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, newext,
1542 &LEFT, &i);
1543 if (error)
1544 goto done;
1545 if (i) {
1546 state |= RMAP_LEFT_VALID;
1547 if (XFS_IS_CORRUPT(mp,
1548 LEFT.rm_startblock + LEFT.rm_blockcount >
1549 bno)) {
1550 error = -EFSCORRUPTED;
1551 goto done;
1552 }
1553 if (xfs_rmap_is_mergeable(&LEFT, owner, newext))
1554 state |= RMAP_LEFT_CONTIG;
1555 }
1556
1557 /* Is there a right record that abuts our range? */
1558 error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
1559 newext, &i);
1560 if (error)
1561 goto done;
1562 if (i) {
1563 state |= RMAP_RIGHT_VALID;
1564 error = xfs_rmap_get_rec(cur, &RIGHT, &i);
1565 if (error)
1566 goto done;
1567 if (XFS_IS_CORRUPT(mp, i != 1)) {
1568 error = -EFSCORRUPTED;
1569 goto done;
1570 }
1571 if (XFS_IS_CORRUPT(mp, bno + len > RIGHT.rm_startblock)) {
1572 error = -EFSCORRUPTED;
1573 goto done;
1574 }
1575 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
1576 cur->bc_ag.agno, RIGHT.rm_startblock,
1577 RIGHT.rm_blockcount, RIGHT.rm_owner,
1578 RIGHT.rm_offset, RIGHT.rm_flags);
1579 if (xfs_rmap_is_mergeable(&RIGHT, owner, newext))
1580 state |= RMAP_RIGHT_CONTIG;
1581 }
1582
1583 /* check that left + prev + right is not too long */
1584 if ((state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1585 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) ==
1586 (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1587 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG) &&
1588 (unsigned long)LEFT.rm_blockcount + len +
1589 RIGHT.rm_blockcount > XFS_RMAP_LEN_MAX)
1590 state &= ~RMAP_RIGHT_CONTIG;
1591
1592 trace_xfs_rmap_convert_state(mp, cur->bc_ag.agno, state,
1593 _RET_IP_);
1594 /*
1595 * Switch out based on the FILLING and CONTIG state bits.
1596 */
1597 switch (state & (RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1598 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG)) {
1599 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG |
1600 RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1601 /*
1602 * Setting all of a previous oldext extent to newext.
1603 * The left and right neighbors are both contiguous with new.
1604 */
1605 error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
1606 RIGHT.rm_blockcount, RIGHT.rm_owner,
1607 RIGHT.rm_offset, RIGHT.rm_flags);
1608 if (error)
1609 goto done;
1610 error = xfs_rmap_delete(cur, PREV.rm_startblock,
1611 PREV.rm_blockcount, PREV.rm_owner,
1612 PREV.rm_offset, PREV.rm_flags);
1613 if (error)
1614 goto done;
1615 NEW = LEFT;
1616 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1617 NEW.rm_blockcount, NEW.rm_owner,
1618 NEW.rm_offset, NEW.rm_flags, &i);
1619 if (error)
1620 goto done;
1621 if (XFS_IS_CORRUPT(mp, i != 1)) {
1622 error = -EFSCORRUPTED;
1623 goto done;
1624 }
1625 NEW.rm_blockcount += PREV.rm_blockcount + RIGHT.rm_blockcount;
1626 error = xfs_rmap_update(cur, &NEW);
1627 if (error)
1628 goto done;
1629 break;
1630
1631 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1632 /*
1633 * Setting all of a previous oldext extent to newext.
1634 * The left neighbor is contiguous, the right is not.
1635 */
1636 error = xfs_rmap_delete(cur, PREV.rm_startblock,
1637 PREV.rm_blockcount, PREV.rm_owner,
1638 PREV.rm_offset, PREV.rm_flags);
1639 if (error)
1640 goto done;
1641 NEW = LEFT;
1642 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1643 NEW.rm_blockcount, NEW.rm_owner,
1644 NEW.rm_offset, NEW.rm_flags, &i);
1645 if (error)
1646 goto done;
1647 if (XFS_IS_CORRUPT(mp, i != 1)) {
1648 error = -EFSCORRUPTED;
1649 goto done;
1650 }
1651 NEW.rm_blockcount += PREV.rm_blockcount;
1652 error = xfs_rmap_update(cur, &NEW);
1653 if (error)
1654 goto done;
1655 break;
1656
1657 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1658 /*
1659 * Setting all of a previous oldext extent to newext.
1660 * The right neighbor is contiguous, the left is not.
1661 */
1662 error = xfs_rmap_delete(cur, RIGHT.rm_startblock,
1663 RIGHT.rm_blockcount, RIGHT.rm_owner,
1664 RIGHT.rm_offset, RIGHT.rm_flags);
1665 if (error)
1666 goto done;
1667 NEW = PREV;
1668 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1669 NEW.rm_blockcount, NEW.rm_owner,
1670 NEW.rm_offset, NEW.rm_flags, &i);
1671 if (error)
1672 goto done;
1673 if (XFS_IS_CORRUPT(mp, i != 1)) {
1674 error = -EFSCORRUPTED;
1675 goto done;
1676 }
1677 NEW.rm_blockcount += RIGHT.rm_blockcount;
1678 NEW.rm_flags = RIGHT.rm_flags;
1679 error = xfs_rmap_update(cur, &NEW);
1680 if (error)
1681 goto done;
1682 break;
1683
1684 case RMAP_LEFT_FILLING | RMAP_RIGHT_FILLING:
1685 /*
1686 * Setting all of a previous oldext extent to newext.
1687 * Neither the left nor right neighbors are contiguous with
1688 * the new one.
1689 */
1690 NEW = PREV;
1691 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1692 NEW.rm_blockcount, NEW.rm_owner,
1693 NEW.rm_offset, NEW.rm_flags, &i);
1694 if (error)
1695 goto done;
1696 if (XFS_IS_CORRUPT(mp, i != 1)) {
1697 error = -EFSCORRUPTED;
1698 goto done;
1699 }
1700 NEW.rm_flags = newext;
1701 error = xfs_rmap_update(cur, &NEW);
1702 if (error)
1703 goto done;
1704 break;
1705
1706 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG:
1707 /*
1708 * Setting the first part of a previous oldext extent to newext.
1709 * The left neighbor is contiguous.
1710 */
1711 NEW = PREV;
1712 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1713 NEW.rm_blockcount, NEW.rm_owner,
1714 NEW.rm_offset, NEW.rm_flags);
1715 if (error)
1716 goto done;
1717 NEW.rm_offset += len;
1718 NEW.rm_startblock += len;
1719 NEW.rm_blockcount -= len;
1720 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1721 NEW.rm_blockcount, NEW.rm_owner,
1722 NEW.rm_offset, NEW.rm_flags);
1723 if (error)
1724 goto done;
1725 NEW = LEFT;
1726 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1727 NEW.rm_blockcount, NEW.rm_owner,
1728 NEW.rm_offset, NEW.rm_flags, &i);
1729 if (error)
1730 goto done;
1731 if (XFS_IS_CORRUPT(mp, i != 1)) {
1732 error = -EFSCORRUPTED;
1733 goto done;
1734 }
1735 NEW.rm_blockcount += len;
1736 error = xfs_rmap_update(cur, &NEW);
1737 if (error)
1738 goto done;
1739 break;
1740
1741 case RMAP_LEFT_FILLING:
1742 /*
1743 * Setting the first part of a previous oldext extent to newext.
1744 * The left neighbor is not contiguous.
1745 */
1746 NEW = PREV;
1747 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1748 NEW.rm_blockcount, NEW.rm_owner,
1749 NEW.rm_offset, NEW.rm_flags);
1750 if (error)
1751 goto done;
1752 NEW.rm_offset += len;
1753 NEW.rm_startblock += len;
1754 NEW.rm_blockcount -= len;
1755 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1756 NEW.rm_blockcount, NEW.rm_owner,
1757 NEW.rm_offset, NEW.rm_flags);
1758 if (error)
1759 goto done;
1760 error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
1761 if (error)
1762 goto done;
1763 break;
1764
1765 case RMAP_RIGHT_FILLING | RMAP_RIGHT_CONTIG:
1766 /*
1767 * Setting the last part of a previous oldext extent to newext.
1768 * The right neighbor is contiguous with the new allocation.
1769 */
1770 NEW = PREV;
1771 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1772 NEW.rm_blockcount, NEW.rm_owner,
1773 NEW.rm_offset, NEW.rm_flags, &i);
1774 if (error)
1775 goto done;
1776 if (XFS_IS_CORRUPT(mp, i != 1)) {
1777 error = -EFSCORRUPTED;
1778 goto done;
1779 }
1780 NEW.rm_blockcount = offset - NEW.rm_offset;
1781 error = xfs_rmap_update(cur, &NEW);
1782 if (error)
1783 goto done;
1784 NEW = RIGHT;
1785 error = xfs_rmap_delete(cur, NEW.rm_startblock,
1786 NEW.rm_blockcount, NEW.rm_owner,
1787 NEW.rm_offset, NEW.rm_flags);
1788 if (error)
1789 goto done;
1790 NEW.rm_offset = offset;
1791 NEW.rm_startblock = bno;
1792 NEW.rm_blockcount += len;
1793 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1794 NEW.rm_blockcount, NEW.rm_owner,
1795 NEW.rm_offset, NEW.rm_flags);
1796 if (error)
1797 goto done;
1798 break;
1799
1800 case RMAP_RIGHT_FILLING:
1801 /*
1802 * Setting the last part of a previous oldext extent to newext.
1803 * The right neighbor is not contiguous.
1804 */
1805 NEW = PREV;
1806 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1807 NEW.rm_blockcount, NEW.rm_owner,
1808 NEW.rm_offset, NEW.rm_flags, &i);
1809 if (error)
1810 goto done;
1811 if (XFS_IS_CORRUPT(mp, i != 1)) {
1812 error = -EFSCORRUPTED;
1813 goto done;
1814 }
1815 NEW.rm_blockcount -= len;
1816 error = xfs_rmap_update(cur, &NEW);
1817 if (error)
1818 goto done;
1819 error = xfs_rmap_insert(cur, bno, len, owner, offset, newext);
1820 if (error)
1821 goto done;
1822 break;
1823
1824 case 0:
1825 /*
1826 * Setting the middle part of a previous oldext extent to
1827 * newext. Contiguity is impossible here.
1828 * One extent becomes three extents.
1829 */
1830 /* new right extent - oldext */
1831 NEW.rm_startblock = bno + len;
1832 NEW.rm_owner = owner;
1833 NEW.rm_offset = new_endoff;
1834 NEW.rm_blockcount = PREV.rm_offset + PREV.rm_blockcount -
1835 new_endoff;
1836 NEW.rm_flags = PREV.rm_flags;
1837 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1838 NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
1839 NEW.rm_flags);
1840 if (error)
1841 goto done;
1842 /* new left extent - oldext */
1843 NEW = PREV;
1844 error = xfs_rmap_lookup_eq(cur, NEW.rm_startblock,
1845 NEW.rm_blockcount, NEW.rm_owner,
1846 NEW.rm_offset, NEW.rm_flags, &i);
1847 if (error)
1848 goto done;
1849 if (XFS_IS_CORRUPT(mp, i != 1)) {
1850 error = -EFSCORRUPTED;
1851 goto done;
1852 }
1853 NEW.rm_blockcount = offset - NEW.rm_offset;
1854 error = xfs_rmap_update(cur, &NEW);
1855 if (error)
1856 goto done;
1857 /* new middle extent - newext */
1858 NEW.rm_startblock = bno;
1859 NEW.rm_blockcount = len;
1860 NEW.rm_owner = owner;
1861 NEW.rm_offset = offset;
1862 NEW.rm_flags = newext;
1863 error = xfs_rmap_insert(cur, NEW.rm_startblock,
1864 NEW.rm_blockcount, NEW.rm_owner, NEW.rm_offset,
1865 NEW.rm_flags);
1866 if (error)
1867 goto done;
1868 break;
1869
1870 case RMAP_LEFT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1871 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1872 case RMAP_LEFT_FILLING | RMAP_RIGHT_CONTIG:
1873 case RMAP_RIGHT_FILLING | RMAP_LEFT_CONTIG:
1874 case RMAP_LEFT_CONTIG | RMAP_RIGHT_CONTIG:
1875 case RMAP_LEFT_CONTIG:
1876 case RMAP_RIGHT_CONTIG:
1877 /*
1878 * These cases are all impossible.
1879 */
1880 ASSERT(0);
1881 }
1882
1883 trace_xfs_rmap_convert_done(mp, cur->bc_ag.agno, bno, len,
1884 unwritten, oinfo);
1885done:
1886 if (error)
1887 trace_xfs_rmap_convert_error(cur->bc_mp,
1888 cur->bc_ag.agno, error, _RET_IP_);
1889 return error;
1890}
1891
1892#undef NEW
1893#undef LEFT
1894#undef RIGHT
1895#undef PREV
1896
1897/*
1898 * Find an extent in the rmap btree and unmap it. For rmap extent types that
1899 * can overlap (data fork rmaps on reflink filesystems) we must be careful
1900 * that the prev/next records in the btree might belong to another owner.
1901 * Therefore we must use delete+insert to alter any of the key fields.
1902 *
1903 * For every other situation there can only be one owner for a given extent,
1904 * so we can call the regular _free function.
1905 */
1906STATIC int
1907xfs_rmap_unmap_shared(
1908 struct xfs_btree_cur *cur,
1909 xfs_agblock_t bno,
1910 xfs_extlen_t len,
1911 bool unwritten,
1912 const struct xfs_owner_info *oinfo)
1913{
1914 struct xfs_mount *mp = cur->bc_mp;
1915 struct xfs_rmap_irec ltrec;
1916 uint64_t ltoff;
1917 int error = 0;
1918 int i;
1919 uint64_t owner;
1920 uint64_t offset;
1921 unsigned int flags;
1922
1923 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
1924 if (unwritten)
1925 flags |= XFS_RMAP_UNWRITTEN;
1926 trace_xfs_rmap_unmap(mp, cur->bc_ag.agno, bno, len,
1927 unwritten, oinfo);
1928
1929 /*
1930 * We should always have a left record because there's a static record
1931 * for the AG headers at rm_startblock == 0 created by mkfs/growfs that
1932 * will not ever be removed from the tree.
1933 */
1934 error = xfs_rmap_lookup_le_range(cur, bno, owner, offset, flags,
1935 <rec, &i);
1936 if (error)
1937 goto out_error;
1938 if (XFS_IS_CORRUPT(mp, i != 1)) {
1939 error = -EFSCORRUPTED;
1940 goto out_error;
1941 }
1942 ltoff = ltrec.rm_offset;
1943
1944 /* Make sure the extent we found covers the entire freeing range. */
1945 if (XFS_IS_CORRUPT(mp,
1946 ltrec.rm_startblock > bno ||
1947 ltrec.rm_startblock + ltrec.rm_blockcount <
1948 bno + len)) {
1949 error = -EFSCORRUPTED;
1950 goto out_error;
1951 }
1952
1953 /* Make sure the owner matches what we expect to find in the tree. */
1954 if (XFS_IS_CORRUPT(mp, owner != ltrec.rm_owner)) {
1955 error = -EFSCORRUPTED;
1956 goto out_error;
1957 }
1958
1959 /* Make sure the unwritten flag matches. */
1960 if (XFS_IS_CORRUPT(mp,
1961 (flags & XFS_RMAP_UNWRITTEN) !=
1962 (ltrec.rm_flags & XFS_RMAP_UNWRITTEN))) {
1963 error = -EFSCORRUPTED;
1964 goto out_error;
1965 }
1966
1967 /* Check the offset. */
1968 if (XFS_IS_CORRUPT(mp, ltrec.rm_offset > offset)) {
1969 error = -EFSCORRUPTED;
1970 goto out_error;
1971 }
1972 if (XFS_IS_CORRUPT(mp, offset > ltoff + ltrec.rm_blockcount)) {
1973 error = -EFSCORRUPTED;
1974 goto out_error;
1975 }
1976
1977 if (ltrec.rm_startblock == bno && ltrec.rm_blockcount == len) {
1978 /* Exact match, simply remove the record from rmap tree. */
1979 error = xfs_rmap_delete(cur, ltrec.rm_startblock,
1980 ltrec.rm_blockcount, ltrec.rm_owner,
1981 ltrec.rm_offset, ltrec.rm_flags);
1982 if (error)
1983 goto out_error;
1984 } else if (ltrec.rm_startblock == bno) {
1985 /*
1986 * Overlap left hand side of extent: move the start, trim the
1987 * length and update the current record.
1988 *
1989 * ltbno ltlen
1990 * Orig: |oooooooooooooooooooo|
1991 * Freeing: |fffffffff|
1992 * Result: |rrrrrrrrrr|
1993 * bno len
1994 */
1995
1996 /* Delete prev rmap. */
1997 error = xfs_rmap_delete(cur, ltrec.rm_startblock,
1998 ltrec.rm_blockcount, ltrec.rm_owner,
1999 ltrec.rm_offset, ltrec.rm_flags);
2000 if (error)
2001 goto out_error;
2002
2003 /* Add an rmap at the new offset. */
2004 ltrec.rm_startblock += len;
2005 ltrec.rm_blockcount -= len;
2006 ltrec.rm_offset += len;
2007 error = xfs_rmap_insert(cur, ltrec.rm_startblock,
2008 ltrec.rm_blockcount, ltrec.rm_owner,
2009 ltrec.rm_offset, ltrec.rm_flags);
2010 if (error)
2011 goto out_error;
2012 } else if (ltrec.rm_startblock + ltrec.rm_blockcount == bno + len) {
2013 /*
2014 * Overlap right hand side of extent: trim the length and
2015 * update the current record.
2016 *
2017 * ltbno ltlen
2018 * Orig: |oooooooooooooooooooo|
2019 * Freeing: |fffffffff|
2020 * Result: |rrrrrrrrrr|
2021 * bno len
2022 */
2023 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2024 ltrec.rm_blockcount, ltrec.rm_owner,
2025 ltrec.rm_offset, ltrec.rm_flags, &i);
2026 if (error)
2027 goto out_error;
2028 if (XFS_IS_CORRUPT(mp, i != 1)) {
2029 error = -EFSCORRUPTED;
2030 goto out_error;
2031 }
2032 ltrec.rm_blockcount -= len;
2033 error = xfs_rmap_update(cur, <rec);
2034 if (error)
2035 goto out_error;
2036 } else {
2037 /*
2038 * Overlap middle of extent: trim the length of the existing
2039 * record to the length of the new left-extent size, increment
2040 * the insertion position so we can insert a new record
2041 * containing the remaining right-extent space.
2042 *
2043 * ltbno ltlen
2044 * Orig: |oooooooooooooooooooo|
2045 * Freeing: |fffffffff|
2046 * Result: |rrrrr| |rrrr|
2047 * bno len
2048 */
2049 xfs_extlen_t orig_len = ltrec.rm_blockcount;
2050
2051 /* Shrink the left side of the rmap */
2052 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2053 ltrec.rm_blockcount, ltrec.rm_owner,
2054 ltrec.rm_offset, ltrec.rm_flags, &i);
2055 if (error)
2056 goto out_error;
2057 if (XFS_IS_CORRUPT(mp, i != 1)) {
2058 error = -EFSCORRUPTED;
2059 goto out_error;
2060 }
2061 ltrec.rm_blockcount = bno - ltrec.rm_startblock;
2062 error = xfs_rmap_update(cur, <rec);
2063 if (error)
2064 goto out_error;
2065
2066 /* Add an rmap at the new offset */
2067 error = xfs_rmap_insert(cur, bno + len,
2068 orig_len - len - ltrec.rm_blockcount,
2069 ltrec.rm_owner, offset + len,
2070 ltrec.rm_flags);
2071 if (error)
2072 goto out_error;
2073 }
2074
2075 trace_xfs_rmap_unmap_done(mp, cur->bc_ag.agno, bno, len,
2076 unwritten, oinfo);
2077out_error:
2078 if (error)
2079 trace_xfs_rmap_unmap_error(cur->bc_mp,
2080 cur->bc_ag.agno, error, _RET_IP_);
2081 return error;
2082}
2083
2084/*
2085 * Find an extent in the rmap btree and map it. For rmap extent types that
2086 * can overlap (data fork rmaps on reflink filesystems) we must be careful
2087 * that the prev/next records in the btree might belong to another owner.
2088 * Therefore we must use delete+insert to alter any of the key fields.
2089 *
2090 * For every other situation there can only be one owner for a given extent,
2091 * so we can call the regular _alloc function.
2092 */
2093STATIC int
2094xfs_rmap_map_shared(
2095 struct xfs_btree_cur *cur,
2096 xfs_agblock_t bno,
2097 xfs_extlen_t len,
2098 bool unwritten,
2099 const struct xfs_owner_info *oinfo)
2100{
2101 struct xfs_mount *mp = cur->bc_mp;
2102 struct xfs_rmap_irec ltrec;
2103 struct xfs_rmap_irec gtrec;
2104 int have_gt;
2105 int have_lt;
2106 int error = 0;
2107 int i;
2108 uint64_t owner;
2109 uint64_t offset;
2110 unsigned int flags = 0;
2111
2112 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
2113 if (unwritten)
2114 flags |= XFS_RMAP_UNWRITTEN;
2115 trace_xfs_rmap_map(mp, cur->bc_ag.agno, bno, len,
2116 unwritten, oinfo);
2117
2118 /* Is there a left record that abuts our range? */
2119 error = xfs_rmap_find_left_neighbor(cur, bno, owner, offset, flags,
2120 <rec, &have_lt);
2121 if (error)
2122 goto out_error;
2123 if (have_lt &&
2124 !xfs_rmap_is_mergeable(<rec, owner, flags))
2125 have_lt = 0;
2126
2127 /* Is there a right record that abuts our range? */
2128 error = xfs_rmap_lookup_eq(cur, bno + len, len, owner, offset + len,
2129 flags, &have_gt);
2130 if (error)
2131 goto out_error;
2132 if (have_gt) {
2133 error = xfs_rmap_get_rec(cur, >rec, &have_gt);
2134 if (error)
2135 goto out_error;
2136 if (XFS_IS_CORRUPT(mp, have_gt != 1)) {
2137 error = -EFSCORRUPTED;
2138 goto out_error;
2139 }
2140 trace_xfs_rmap_find_right_neighbor_result(cur->bc_mp,
2141 cur->bc_ag.agno, gtrec.rm_startblock,
2142 gtrec.rm_blockcount, gtrec.rm_owner,
2143 gtrec.rm_offset, gtrec.rm_flags);
2144
2145 if (!xfs_rmap_is_mergeable(>rec, owner, flags))
2146 have_gt = 0;
2147 }
2148
2149 if (have_lt &&
2150 ltrec.rm_startblock + ltrec.rm_blockcount == bno &&
2151 ltrec.rm_offset + ltrec.rm_blockcount == offset) {
2152 /*
2153 * Left edge contiguous, merge into left record.
2154 *
2155 * ltbno ltlen
2156 * orig: |ooooooooo|
2157 * adding: |aaaaaaaaa|
2158 * result: |rrrrrrrrrrrrrrrrrrr|
2159 * bno len
2160 */
2161 ltrec.rm_blockcount += len;
2162 if (have_gt &&
2163 bno + len == gtrec.rm_startblock &&
2164 offset + len == gtrec.rm_offset) {
2165 /*
2166 * Right edge also contiguous, delete right record
2167 * and merge into left record.
2168 *
2169 * ltbno ltlen gtbno gtlen
2170 * orig: |ooooooooo| |ooooooooo|
2171 * adding: |aaaaaaaaa|
2172 * result: |rrrrrrrrrrrrrrrrrrrrrrrrrrrrr|
2173 */
2174 ltrec.rm_blockcount += gtrec.rm_blockcount;
2175 error = xfs_rmap_delete(cur, gtrec.rm_startblock,
2176 gtrec.rm_blockcount, gtrec.rm_owner,
2177 gtrec.rm_offset, gtrec.rm_flags);
2178 if (error)
2179 goto out_error;
2180 }
2181
2182 /* Point the cursor back to the left record and update. */
2183 error = xfs_rmap_lookup_eq(cur, ltrec.rm_startblock,
2184 ltrec.rm_blockcount, ltrec.rm_owner,
2185 ltrec.rm_offset, ltrec.rm_flags, &i);
2186 if (error)
2187 goto out_error;
2188 if (XFS_IS_CORRUPT(mp, i != 1)) {
2189 error = -EFSCORRUPTED;
2190 goto out_error;
2191 }
2192
2193 error = xfs_rmap_update(cur, <rec);
2194 if (error)
2195 goto out_error;
2196 } else if (have_gt &&
2197 bno + len == gtrec.rm_startblock &&
2198 offset + len == gtrec.rm_offset) {
2199 /*
2200 * Right edge contiguous, merge into right record.
2201 *
2202 * gtbno gtlen
2203 * Orig: |ooooooooo|
2204 * adding: |aaaaaaaaa|
2205 * Result: |rrrrrrrrrrrrrrrrrrr|
2206 * bno len
2207 */
2208 /* Delete the old record. */
2209 error = xfs_rmap_delete(cur, gtrec.rm_startblock,
2210 gtrec.rm_blockcount, gtrec.rm_owner,
2211 gtrec.rm_offset, gtrec.rm_flags);
2212 if (error)
2213 goto out_error;
2214
2215 /* Move the start and re-add it. */
2216 gtrec.rm_startblock = bno;
2217 gtrec.rm_blockcount += len;
2218 gtrec.rm_offset = offset;
2219 error = xfs_rmap_insert(cur, gtrec.rm_startblock,
2220 gtrec.rm_blockcount, gtrec.rm_owner,
2221 gtrec.rm_offset, gtrec.rm_flags);
2222 if (error)
2223 goto out_error;
2224 } else {
2225 /*
2226 * No contiguous edge with identical owner, insert
2227 * new record at current cursor position.
2228 */
2229 error = xfs_rmap_insert(cur, bno, len, owner, offset, flags);
2230 if (error)
2231 goto out_error;
2232 }
2233
2234 trace_xfs_rmap_map_done(mp, cur->bc_ag.agno, bno, len,
2235 unwritten, oinfo);
2236out_error:
2237 if (error)
2238 trace_xfs_rmap_map_error(cur->bc_mp,
2239 cur->bc_ag.agno, error, _RET_IP_);
2240 return error;
2241}
2242
2243/* Insert a raw rmap into the rmapbt. */
2244int
2245xfs_rmap_map_raw(
2246 struct xfs_btree_cur *cur,
2247 struct xfs_rmap_irec *rmap)
2248{
2249 struct xfs_owner_info oinfo;
2250
2251 oinfo.oi_owner = rmap->rm_owner;
2252 oinfo.oi_offset = rmap->rm_offset;
2253 oinfo.oi_flags = 0;
2254 if (rmap->rm_flags & XFS_RMAP_ATTR_FORK)
2255 oinfo.oi_flags |= XFS_OWNER_INFO_ATTR_FORK;
2256 if (rmap->rm_flags & XFS_RMAP_BMBT_BLOCK)
2257 oinfo.oi_flags |= XFS_OWNER_INFO_BMBT_BLOCK;
2258
2259 if (rmap->rm_flags || XFS_RMAP_NON_INODE_OWNER(rmap->rm_owner))
2260 return xfs_rmap_map(cur, rmap->rm_startblock,
2261 rmap->rm_blockcount,
2262 rmap->rm_flags & XFS_RMAP_UNWRITTEN,
2263 &oinfo);
2264
2265 return xfs_rmap_map_shared(cur, rmap->rm_startblock,
2266 rmap->rm_blockcount,
2267 rmap->rm_flags & XFS_RMAP_UNWRITTEN,
2268 &oinfo);
2269}
2270
2271struct xfs_rmap_query_range_info {
2272 xfs_rmap_query_range_fn fn;
2273 void *priv;
2274};
2275
2276/* Format btree record and pass to our callback. */
2277STATIC int
2278xfs_rmap_query_range_helper(
2279 struct xfs_btree_cur *cur,
2280 union xfs_btree_rec *rec,
2281 void *priv)
2282{
2283 struct xfs_rmap_query_range_info *query = priv;
2284 struct xfs_rmap_irec irec;
2285 int error;
2286
2287 error = xfs_rmap_btrec_to_irec(rec, &irec);
2288 if (error)
2289 return error;
2290 return query->fn(cur, &irec, query->priv);
2291}
2292
2293/* Find all rmaps between two keys. */
2294int
2295xfs_rmap_query_range(
2296 struct xfs_btree_cur *cur,
2297 struct xfs_rmap_irec *low_rec,
2298 struct xfs_rmap_irec *high_rec,
2299 xfs_rmap_query_range_fn fn,
2300 void *priv)
2301{
2302 union xfs_btree_irec low_brec;
2303 union xfs_btree_irec high_brec;
2304 struct xfs_rmap_query_range_info query;
2305
2306 low_brec.r = *low_rec;
2307 high_brec.r = *high_rec;
2308 query.priv = priv;
2309 query.fn = fn;
2310 return xfs_btree_query_range(cur, &low_brec, &high_brec,
2311 xfs_rmap_query_range_helper, &query);
2312}
2313
2314/* Find all rmaps. */
2315int
2316xfs_rmap_query_all(
2317 struct xfs_btree_cur *cur,
2318 xfs_rmap_query_range_fn fn,
2319 void *priv)
2320{
2321 struct xfs_rmap_query_range_info query;
2322
2323 query.priv = priv;
2324 query.fn = fn;
2325 return xfs_btree_query_all(cur, xfs_rmap_query_range_helper, &query);
2326}
2327
2328/* Clean up after calling xfs_rmap_finish_one. */
2329void
2330xfs_rmap_finish_one_cleanup(
2331 struct xfs_trans *tp,
2332 struct xfs_btree_cur *rcur,
2333 int error)
2334{
2335 struct xfs_buf *agbp;
2336
2337 if (rcur == NULL)
2338 return;
2339 agbp = rcur->bc_ag.agbp;
2340 xfs_btree_del_cursor(rcur, error);
2341 if (error)
2342 xfs_trans_brelse(tp, agbp);
2343}
2344
2345/*
2346 * Process one of the deferred rmap operations. We pass back the
2347 * btree cursor to maintain our lock on the rmapbt between calls.
2348 * This saves time and eliminates a buffer deadlock between the
2349 * superblock and the AGF because we'll always grab them in the same
2350 * order.
2351 */
2352int
2353xfs_rmap_finish_one(
2354 struct xfs_trans *tp,
2355 enum xfs_rmap_intent_type type,
2356 uint64_t owner,
2357 int whichfork,
2358 xfs_fileoff_t startoff,
2359 xfs_fsblock_t startblock,
2360 xfs_filblks_t blockcount,
2361 xfs_exntst_t state,
2362 struct xfs_btree_cur **pcur)
2363{
2364 struct xfs_mount *mp = tp->t_mountp;
2365 struct xfs_btree_cur *rcur;
2366 struct xfs_buf *agbp = NULL;
2367 int error = 0;
2368 xfs_agnumber_t agno;
2369 struct xfs_owner_info oinfo;
2370 xfs_agblock_t bno;
2371 bool unwritten;
2372
2373 agno = XFS_FSB_TO_AGNO(mp, startblock);
2374 ASSERT(agno != NULLAGNUMBER);
2375 bno = XFS_FSB_TO_AGBNO(mp, startblock);
2376
2377 trace_xfs_rmap_deferred(mp, agno, type, bno, owner, whichfork,
2378 startoff, blockcount, state);
2379
2380 if (XFS_TEST_ERROR(false, mp,
2381 XFS_ERRTAG_RMAP_FINISH_ONE))
2382 return -EIO;
2383
2384 /*
2385 * If we haven't gotten a cursor or the cursor AG doesn't match
2386 * the startblock, get one now.
2387 */
2388 rcur = *pcur;
2389 if (rcur != NULL && rcur->bc_ag.agno != agno) {
2390 xfs_rmap_finish_one_cleanup(tp, rcur, 0);
2391 rcur = NULL;
2392 *pcur = NULL;
2393 }
2394 if (rcur == NULL) {
2395 /*
2396 * Refresh the freelist before we start changing the
2397 * rmapbt, because a shape change could cause us to
2398 * allocate blocks.
2399 */
2400 error = xfs_free_extent_fix_freelist(tp, agno, &agbp);
2401 if (error)
2402 return error;
2403 if (XFS_IS_CORRUPT(tp->t_mountp, !agbp))
2404 return -EFSCORRUPTED;
2405
2406 rcur = xfs_rmapbt_init_cursor(mp, tp, agbp, agno);
2407 if (!rcur) {
2408 error = -ENOMEM;
2409 goto out_cur;
2410 }
2411 }
2412 *pcur = rcur;
2413
2414 xfs_rmap_ino_owner(&oinfo, owner, whichfork, startoff);
2415 unwritten = state == XFS_EXT_UNWRITTEN;
2416 bno = XFS_FSB_TO_AGBNO(rcur->bc_mp, startblock);
2417
2418 switch (type) {
2419 case XFS_RMAP_ALLOC:
2420 case XFS_RMAP_MAP:
2421 error = xfs_rmap_map(rcur, bno, blockcount, unwritten, &oinfo);
2422 break;
2423 case XFS_RMAP_MAP_SHARED:
2424 error = xfs_rmap_map_shared(rcur, bno, blockcount, unwritten,
2425 &oinfo);
2426 break;
2427 case XFS_RMAP_FREE:
2428 case XFS_RMAP_UNMAP:
2429 error = xfs_rmap_unmap(rcur, bno, blockcount, unwritten,
2430 &oinfo);
2431 break;
2432 case XFS_RMAP_UNMAP_SHARED:
2433 error = xfs_rmap_unmap_shared(rcur, bno, blockcount, unwritten,
2434 &oinfo);
2435 break;
2436 case XFS_RMAP_CONVERT:
2437 error = xfs_rmap_convert(rcur, bno, blockcount, !unwritten,
2438 &oinfo);
2439 break;
2440 case XFS_RMAP_CONVERT_SHARED:
2441 error = xfs_rmap_convert_shared(rcur, bno, blockcount,
2442 !unwritten, &oinfo);
2443 break;
2444 default:
2445 ASSERT(0);
2446 error = -EFSCORRUPTED;
2447 }
2448 return error;
2449
2450out_cur:
2451 xfs_trans_brelse(tp, agbp);
2452
2453 return error;
2454}
2455
2456/*
2457 * Don't defer an rmap if we aren't an rmap filesystem.
2458 */
2459static bool
2460xfs_rmap_update_is_needed(
2461 struct xfs_mount *mp,
2462 int whichfork)
2463{
2464 return xfs_sb_version_hasrmapbt(&mp->m_sb) && whichfork != XFS_COW_FORK;
2465}
2466
2467/*
2468 * Record a rmap intent; the list is kept sorted first by AG and then by
2469 * increasing age.
2470 */
2471static void
2472__xfs_rmap_add(
2473 struct xfs_trans *tp,
2474 enum xfs_rmap_intent_type type,
2475 uint64_t owner,
2476 int whichfork,
2477 struct xfs_bmbt_irec *bmap)
2478{
2479 struct xfs_rmap_intent *ri;
2480
2481 trace_xfs_rmap_defer(tp->t_mountp,
2482 XFS_FSB_TO_AGNO(tp->t_mountp, bmap->br_startblock),
2483 type,
2484 XFS_FSB_TO_AGBNO(tp->t_mountp, bmap->br_startblock),
2485 owner, whichfork,
2486 bmap->br_startoff,
2487 bmap->br_blockcount,
2488 bmap->br_state);
2489
2490 ri = kmem_alloc(sizeof(struct xfs_rmap_intent), KM_NOFS);
2491 INIT_LIST_HEAD(&ri->ri_list);
2492 ri->ri_type = type;
2493 ri->ri_owner = owner;
2494 ri->ri_whichfork = whichfork;
2495 ri->ri_bmap = *bmap;
2496
2497 xfs_defer_add(tp, XFS_DEFER_OPS_TYPE_RMAP, &ri->ri_list);
2498}
2499
2500/* Map an extent into a file. */
2501void
2502xfs_rmap_map_extent(
2503 struct xfs_trans *tp,
2504 struct xfs_inode *ip,
2505 int whichfork,
2506 struct xfs_bmbt_irec *PREV)
2507{
2508 if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
2509 return;
2510
2511 __xfs_rmap_add(tp, xfs_is_reflink_inode(ip) ?
2512 XFS_RMAP_MAP_SHARED : XFS_RMAP_MAP, ip->i_ino,
2513 whichfork, PREV);
2514}
2515
2516/* Unmap an extent out of a file. */
2517void
2518xfs_rmap_unmap_extent(
2519 struct xfs_trans *tp,
2520 struct xfs_inode *ip,
2521 int whichfork,
2522 struct xfs_bmbt_irec *PREV)
2523{
2524 if (!xfs_rmap_update_is_needed(tp->t_mountp, whichfork))
2525 return;
2526
2527 __xfs_rmap_add(tp, xfs_is_reflink_inode(ip) ?
2528 XFS_RMAP_UNMAP_SHARED : XFS_RMAP_UNMAP, ip->i_ino,
2529 whichfork, PREV);
2530}
2531
2532/*
2533 * Convert a data fork extent from unwritten to real or vice versa.
2534 *
2535 * Note that tp can be NULL here as no transaction is used for COW fork
2536 * unwritten conversion.
2537 */
2538void
2539xfs_rmap_convert_extent(
2540 struct xfs_mount *mp,
2541 struct xfs_trans *tp,
2542 struct xfs_inode *ip,
2543 int whichfork,
2544 struct xfs_bmbt_irec *PREV)
2545{
2546 if (!xfs_rmap_update_is_needed(mp, whichfork))
2547 return;
2548
2549 __xfs_rmap_add(tp, xfs_is_reflink_inode(ip) ?
2550 XFS_RMAP_CONVERT_SHARED : XFS_RMAP_CONVERT, ip->i_ino,
2551 whichfork, PREV);
2552}
2553
2554/* Schedule the creation of an rmap for non-file data. */
2555void
2556xfs_rmap_alloc_extent(
2557 struct xfs_trans *tp,
2558 xfs_agnumber_t agno,
2559 xfs_agblock_t bno,
2560 xfs_extlen_t len,
2561 uint64_t owner)
2562{
2563 struct xfs_bmbt_irec bmap;
2564
2565 if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
2566 return;
2567
2568 bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
2569 bmap.br_blockcount = len;
2570 bmap.br_startoff = 0;
2571 bmap.br_state = XFS_EXT_NORM;
2572
2573 __xfs_rmap_add(tp, XFS_RMAP_ALLOC, owner, XFS_DATA_FORK, &bmap);
2574}
2575
2576/* Schedule the deletion of an rmap for non-file data. */
2577void
2578xfs_rmap_free_extent(
2579 struct xfs_trans *tp,
2580 xfs_agnumber_t agno,
2581 xfs_agblock_t bno,
2582 xfs_extlen_t len,
2583 uint64_t owner)
2584{
2585 struct xfs_bmbt_irec bmap;
2586
2587 if (!xfs_rmap_update_is_needed(tp->t_mountp, XFS_DATA_FORK))
2588 return;
2589
2590 bmap.br_startblock = XFS_AGB_TO_FSB(tp->t_mountp, agno, bno);
2591 bmap.br_blockcount = len;
2592 bmap.br_startoff = 0;
2593 bmap.br_state = XFS_EXT_NORM;
2594
2595 __xfs_rmap_add(tp, XFS_RMAP_FREE, owner, XFS_DATA_FORK, &bmap);
2596}
2597
2598/* Compare rmap records. Returns -1 if a < b, 1 if a > b, and 0 if equal. */
2599int
2600xfs_rmap_compare(
2601 const struct xfs_rmap_irec *a,
2602 const struct xfs_rmap_irec *b)
2603{
2604 __u64 oa;
2605 __u64 ob;
2606
2607 oa = xfs_rmap_irec_offset_pack(a);
2608 ob = xfs_rmap_irec_offset_pack(b);
2609
2610 if (a->rm_startblock < b->rm_startblock)
2611 return -1;
2612 else if (a->rm_startblock > b->rm_startblock)
2613 return 1;
2614 else if (a->rm_owner < b->rm_owner)
2615 return -1;
2616 else if (a->rm_owner > b->rm_owner)
2617 return 1;
2618 else if (oa < ob)
2619 return -1;
2620 else if (oa > ob)
2621 return 1;
2622 else
2623 return 0;
2624}
2625
2626/* Is there a record covering a given extent? */
2627int
2628xfs_rmap_has_record(
2629 struct xfs_btree_cur *cur,
2630 xfs_agblock_t bno,
2631 xfs_extlen_t len,
2632 bool *exists)
2633{
2634 union xfs_btree_irec low;
2635 union xfs_btree_irec high;
2636
2637 memset(&low, 0, sizeof(low));
2638 low.r.rm_startblock = bno;
2639 memset(&high, 0xFF, sizeof(high));
2640 high.r.rm_startblock = bno + len - 1;
2641
2642 return xfs_btree_has_record(cur, &low, &high, exists);
2643}
2644
2645/*
2646 * Is there a record for this owner completely covering a given physical
2647 * extent? If so, *has_rmap will be set to true. If there is no record
2648 * or the record only covers part of the range, we set *has_rmap to false.
2649 * This function doesn't perform range lookups or offset checks, so it is
2650 * not suitable for checking data fork blocks.
2651 */
2652int
2653xfs_rmap_record_exists(
2654 struct xfs_btree_cur *cur,
2655 xfs_agblock_t bno,
2656 xfs_extlen_t len,
2657 const struct xfs_owner_info *oinfo,
2658 bool *has_rmap)
2659{
2660 uint64_t owner;
2661 uint64_t offset;
2662 unsigned int flags;
2663 int has_record;
2664 struct xfs_rmap_irec irec;
2665 int error;
2666
2667 xfs_owner_info_unpack(oinfo, &owner, &offset, &flags);
2668 ASSERT(XFS_RMAP_NON_INODE_OWNER(owner) ||
2669 (flags & XFS_RMAP_BMBT_BLOCK));
2670
2671 error = xfs_rmap_lookup_le(cur, bno, len, owner, offset, flags,
2672 &has_record);
2673 if (error)
2674 return error;
2675 if (!has_record) {
2676 *has_rmap = false;
2677 return 0;
2678 }
2679
2680 error = xfs_rmap_get_rec(cur, &irec, &has_record);
2681 if (error)
2682 return error;
2683 if (!has_record) {
2684 *has_rmap = false;
2685 return 0;
2686 }
2687
2688 *has_rmap = (irec.rm_owner == owner && irec.rm_startblock <= bno &&
2689 irec.rm_startblock + irec.rm_blockcount >= bno + len);
2690 return 0;
2691}
2692
2693struct xfs_rmap_key_state {
2694 uint64_t owner;
2695 uint64_t offset;
2696 unsigned int flags;
2697};
2698
2699/* For each rmap given, figure out if it doesn't match the key we want. */
2700STATIC int
2701xfs_rmap_has_other_keys_helper(
2702 struct xfs_btree_cur *cur,
2703 struct xfs_rmap_irec *rec,
2704 void *priv)
2705{
2706 struct xfs_rmap_key_state *rks = priv;
2707
2708 if (rks->owner == rec->rm_owner && rks->offset == rec->rm_offset &&
2709 ((rks->flags & rec->rm_flags) & XFS_RMAP_KEY_FLAGS) == rks->flags)
2710 return 0;
2711 return -ECANCELED;
2712}
2713
2714/*
2715 * Given an extent and some owner info, can we find records overlapping
2716 * the extent whose owner info does not match the given owner?
2717 */
2718int
2719xfs_rmap_has_other_keys(
2720 struct xfs_btree_cur *cur,
2721 xfs_agblock_t bno,
2722 xfs_extlen_t len,
2723 const struct xfs_owner_info *oinfo,
2724 bool *has_rmap)
2725{
2726 struct xfs_rmap_irec low = {0};
2727 struct xfs_rmap_irec high;
2728 struct xfs_rmap_key_state rks;
2729 int error;
2730
2731 xfs_owner_info_unpack(oinfo, &rks.owner, &rks.offset, &rks.flags);
2732 *has_rmap = false;
2733
2734 low.rm_startblock = bno;
2735 memset(&high, 0xFF, sizeof(high));
2736 high.rm_startblock = bno + len - 1;
2737
2738 error = xfs_rmap_query_range(cur, &low, &high,
2739 xfs_rmap_has_other_keys_helper, &rks);
2740 if (error == -ECANCELED) {
2741 *has_rmap = true;
2742 return 0;
2743 }
2744
2745 return error;
2746}
2747
2748const struct xfs_owner_info XFS_RMAP_OINFO_SKIP_UPDATE = {
2749 .oi_owner = XFS_RMAP_OWN_NULL,
2750};
2751const struct xfs_owner_info XFS_RMAP_OINFO_ANY_OWNER = {
2752 .oi_owner = XFS_RMAP_OWN_UNKNOWN,
2753};
2754const struct xfs_owner_info XFS_RMAP_OINFO_FS = {
2755 .oi_owner = XFS_RMAP_OWN_FS,
2756};
2757const struct xfs_owner_info XFS_RMAP_OINFO_LOG = {
2758 .oi_owner = XFS_RMAP_OWN_LOG,
2759};
2760const struct xfs_owner_info XFS_RMAP_OINFO_AG = {
2761 .oi_owner = XFS_RMAP_OWN_AG,
2762};
2763const struct xfs_owner_info XFS_RMAP_OINFO_INOBT = {
2764 .oi_owner = XFS_RMAP_OWN_INOBT,
2765};
2766const struct xfs_owner_info XFS_RMAP_OINFO_INODES = {
2767 .oi_owner = XFS_RMAP_OWN_INODES,
2768};
2769const struct xfs_owner_info XFS_RMAP_OINFO_REFC = {
2770 .oi_owner = XFS_RMAP_OWN_REFC,
2771};
2772const struct xfs_owner_info XFS_RMAP_OINFO_COW = {
2773 .oi_owner = XFS_RMAP_OWN_COW,
2774};