1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (c) 2017 Christoph Hellwig.
7 #include "xfs_shared.h"
8 #include "xfs_format.h"
10 #include "xfs_log_format.h"
11 #include "xfs_trans_resv.h"
12 #include "xfs_mount.h"
13 #include "xfs_inode.h"
14 #include "xfs_trace.h"
17 * In-core extent record layout:
19 * +-------+----------------------------+
20 * | 00:53 | all 54 bits of startoff |
21 * | 54:63 | low 10 bits of startblock |
22 * +-------+----------------------------+
23 * | 00:20 | all 21 bits of length |
24 * | 21 | unwritten extent bit |
25 * | 22:63 | high 42 bits of startblock |
26 * +-------+----------------------------+
28 #define XFS_IEXT_STARTOFF_MASK xfs_mask64lo(BMBT_STARTOFF_BITLEN)
29 #define XFS_IEXT_LENGTH_MASK xfs_mask64lo(BMBT_BLOCKCOUNT_BITLEN)
30 #define XFS_IEXT_STARTBLOCK_MASK xfs_mask64lo(BMBT_STARTBLOCK_BITLEN)
38 * Given that the length can't be a zero, only an empty hi value indicates an
41 static bool xfs_iext_rec_is_empty(struct xfs_iext_rec *rec)
46 static inline void xfs_iext_rec_clear(struct xfs_iext_rec *rec)
54 struct xfs_iext_rec *rec,
55 struct xfs_bmbt_irec *irec)
57 ASSERT((irec->br_startoff & ~XFS_IEXT_STARTOFF_MASK) == 0);
58 ASSERT((irec->br_blockcount & ~XFS_IEXT_LENGTH_MASK) == 0);
59 ASSERT((irec->br_startblock & ~XFS_IEXT_STARTBLOCK_MASK) == 0);
61 rec->lo = irec->br_startoff & XFS_IEXT_STARTOFF_MASK;
62 rec->hi = irec->br_blockcount & XFS_IEXT_LENGTH_MASK;
64 rec->lo |= (irec->br_startblock << 54);
65 rec->hi |= ((irec->br_startblock & ~xfs_mask64lo(10)) << (22 - 10));
67 if (irec->br_state == XFS_EXT_UNWRITTEN)
73 struct xfs_bmbt_irec *irec,
74 struct xfs_iext_rec *rec)
76 irec->br_startoff = rec->lo & XFS_IEXT_STARTOFF_MASK;
77 irec->br_blockcount = rec->hi & XFS_IEXT_LENGTH_MASK;
79 irec->br_startblock = rec->lo >> 54;
80 irec->br_startblock |= (rec->hi & xfs_mask64hi(42)) >> (22 - 10);
82 if (rec->hi & (1 << 21))
83 irec->br_state = XFS_EXT_UNWRITTEN;
85 irec->br_state = XFS_EXT_NORM;
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),
91 RECS_PER_LEAF = (NODE_SIZE - (2 * sizeof(struct xfs_iext_leaf *))) /
92 sizeof(struct xfs_iext_rec),
96 * In-core extent btree block layout:
98 * There are two types of blocks in the btree: leaf and inner (non-leaf) blocks.
100 * The leaf blocks are made up by %KEYS_PER_NODE extent records, which each
101 * contain the startoffset, blockcount, startblock and unwritten extent flag.
102 * See above for the exact format, followed by pointers to the previous and next
103 * leaf blocks (if there are any).
105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
106 * by an equal number of pointers to the btree blocks at the next lower level.
108 * +-------+-------+-------+-------+-------+----------+----------+
109 * Leaf: | rec 1 | rec 2 | rec 3 | rec 4 | rec N | prev-ptr | next-ptr |
110 * +-------+-------+-------+-------+-------+----------+----------+
112 * +-------+-------+-------+-------+-------+-------+------+-------+
113 * Inner: | key 1 | key 2 | key 3 | key N | ptr 1 | ptr 2 | ptr3 | ptr N |
114 * +-------+-------+-------+-------+-------+-------+------+-------+
116 struct xfs_iext_node {
117 uint64_t keys[KEYS_PER_NODE];
118 #define XFS_IEXT_KEY_INVALID (1ULL << 63)
119 void *ptrs[KEYS_PER_NODE];
122 struct xfs_iext_leaf {
123 struct xfs_iext_rec recs[RECS_PER_LEAF];
124 struct xfs_iext_leaf *prev;
125 struct xfs_iext_leaf *next;
128 inline xfs_extnum_t xfs_iext_count(struct xfs_ifork *ifp)
130 return ifp->if_bytes / sizeof(struct xfs_iext_rec);
133 static inline int xfs_iext_max_recs(struct xfs_ifork *ifp)
135 if (ifp->if_height == 1)
136 return xfs_iext_count(ifp);
137 return RECS_PER_LEAF;
140 static inline struct xfs_iext_rec *cur_rec(struct xfs_iext_cursor *cur)
142 return &cur->leaf->recs[cur->pos];
145 static inline bool xfs_iext_valid(struct xfs_ifork *ifp,
146 struct xfs_iext_cursor *cur)
150 if (cur->pos < 0 || cur->pos >= xfs_iext_max_recs(ifp))
152 if (xfs_iext_rec_is_empty(cur_rec(cur)))
158 xfs_iext_find_first_leaf(
159 struct xfs_ifork *ifp)
161 struct xfs_iext_node *node = ifp->if_data;
167 for (height = ifp->if_height; height > 1; height--) {
168 node = node->ptrs[0];
176 xfs_iext_find_last_leaf(
177 struct xfs_ifork *ifp)
179 struct xfs_iext_node *node = ifp->if_data;
185 for (height = ifp->if_height; height > 1; height--) {
186 for (i = 1; i < KEYS_PER_NODE; i++)
189 node = node->ptrs[i - 1];
198 struct xfs_ifork *ifp,
199 struct xfs_iext_cursor *cur)
202 cur->leaf = xfs_iext_find_first_leaf(ifp);
207 struct xfs_ifork *ifp,
208 struct xfs_iext_cursor *cur)
212 cur->leaf = xfs_iext_find_last_leaf(ifp);
218 for (i = 1; i < xfs_iext_max_recs(ifp); i++) {
219 if (xfs_iext_rec_is_empty(&cur->leaf->recs[i]))
227 struct xfs_ifork *ifp,
228 struct xfs_iext_cursor *cur)
231 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);
232 xfs_iext_first(ifp, cur);
236 ASSERT(cur->pos >= 0);
237 ASSERT(cur->pos < xfs_iext_max_recs(ifp));
240 if (ifp->if_height > 1 && !xfs_iext_valid(ifp, cur) &&
242 cur->leaf = cur->leaf->next;
249 struct xfs_ifork *ifp,
250 struct xfs_iext_cursor *cur)
253 ASSERT(cur->pos <= 0 || cur->pos >= RECS_PER_LEAF);
254 xfs_iext_last(ifp, cur);
258 ASSERT(cur->pos >= 0);
259 ASSERT(cur->pos <= RECS_PER_LEAF);
264 if (xfs_iext_valid(ifp, cur))
266 } while (cur->pos > 0);
268 if (ifp->if_height > 1 && cur->leaf->prev) {
269 cur->leaf = cur->leaf->prev;
270 cur->pos = RECS_PER_LEAF;
277 struct xfs_iext_node *node,
279 xfs_fileoff_t offset)
281 if (node->keys[n] > offset)
283 if (node->keys[n] < offset)
290 struct xfs_iext_rec *rec,
291 xfs_fileoff_t offset)
293 uint64_t rec_offset = rec->lo & XFS_IEXT_STARTOFF_MASK;
294 uint32_t rec_len = rec->hi & XFS_IEXT_LENGTH_MASK;
296 if (rec_offset > offset)
298 if (rec_offset + rec_len <= offset)
305 struct xfs_ifork *ifp,
306 xfs_fileoff_t offset,
309 struct xfs_iext_node *node = ifp->if_data;
315 for (height = ifp->if_height; height > level; height--) {
316 for (i = 1; i < KEYS_PER_NODE; i++)
317 if (xfs_iext_key_cmp(node, i, offset) > 0)
320 node = node->ptrs[i - 1];
330 struct xfs_iext_node *node,
331 xfs_fileoff_t offset)
335 for (i = 1; i < KEYS_PER_NODE; i++) {
336 if (xfs_iext_key_cmp(node, i, offset) > 0)
344 xfs_iext_node_insert_pos(
345 struct xfs_iext_node *node,
346 xfs_fileoff_t offset)
350 for (i = 0; i < KEYS_PER_NODE; i++) {
351 if (xfs_iext_key_cmp(node, i, offset) > 0)
355 return KEYS_PER_NODE;
359 xfs_iext_node_nr_entries(
360 struct xfs_iext_node *node,
365 for (i = start; i < KEYS_PER_NODE; i++) {
366 if (node->keys[i] == XFS_IEXT_KEY_INVALID)
374 xfs_iext_leaf_nr_entries(
375 struct xfs_ifork *ifp,
376 struct xfs_iext_leaf *leaf,
381 for (i = start; i < xfs_iext_max_recs(ifp); i++) {
382 if (xfs_iext_rec_is_empty(&leaf->recs[i]))
389 static inline uint64_t
391 struct xfs_iext_leaf *leaf,
394 return leaf->recs[n].lo & XFS_IEXT_STARTOFF_MASK;
401 return kzalloc(size, GFP_KERNEL | __GFP_NOLOCKDEP | __GFP_NOFAIL);
406 struct xfs_ifork *ifp)
408 struct xfs_iext_node *node = xfs_iext_alloc_node(NODE_SIZE);
411 if (ifp->if_height == 1) {
412 struct xfs_iext_leaf *prev = ifp->if_data;
414 node->keys[0] = xfs_iext_leaf_key(prev, 0);
415 node->ptrs[0] = prev;
417 struct xfs_iext_node *prev = ifp->if_data;
419 ASSERT(ifp->if_height > 1);
421 node->keys[0] = prev->keys[0];
422 node->ptrs[0] = prev;
425 for (i = 1; i < KEYS_PER_NODE; i++)
426 node->keys[i] = XFS_IEXT_KEY_INVALID;
433 xfs_iext_update_node(
434 struct xfs_ifork *ifp,
435 xfs_fileoff_t old_offset,
436 xfs_fileoff_t new_offset,
440 struct xfs_iext_node *node = ifp->if_data;
443 for (height = ifp->if_height; height > level; height--) {
444 for (i = 0; i < KEYS_PER_NODE; i++) {
445 if (i > 0 && xfs_iext_key_cmp(node, i, old_offset) > 0)
447 if (node->keys[i] == old_offset)
448 node->keys[i] = new_offset;
450 node = node->ptrs[i - 1];
457 static struct xfs_iext_node *
459 struct xfs_iext_node **nodep,
463 struct xfs_iext_node *node = *nodep;
464 struct xfs_iext_node *new = xfs_iext_alloc_node(NODE_SIZE);
465 const int nr_move = KEYS_PER_NODE / 2;
466 int nr_keep = nr_move + (KEYS_PER_NODE & 1);
469 /* for sequential append operations just spill over into the new node */
470 if (*pos == KEYS_PER_NODE) {
478 for (i = 0; i < nr_move; i++) {
479 new->keys[i] = node->keys[nr_keep + i];
480 new->ptrs[i] = node->ptrs[nr_keep + i];
482 node->keys[nr_keep + i] = XFS_IEXT_KEY_INVALID;
483 node->ptrs[nr_keep + i] = NULL;
486 if (*pos >= nr_keep) {
489 *nr_entries = nr_move;
491 *nr_entries = nr_keep;
494 for (; i < KEYS_PER_NODE; i++)
495 new->keys[i] = XFS_IEXT_KEY_INVALID;
500 xfs_iext_insert_node(
501 struct xfs_ifork *ifp,
506 struct xfs_iext_node *node, *new;
507 int i, pos, nr_entries;
510 if (ifp->if_height < level)
514 node = xfs_iext_find_level(ifp, offset, level);
515 pos = xfs_iext_node_insert_pos(node, offset);
516 nr_entries = xfs_iext_node_nr_entries(node, pos);
518 ASSERT(pos >= nr_entries || xfs_iext_key_cmp(node, pos, offset) != 0);
519 ASSERT(nr_entries <= KEYS_PER_NODE);
521 if (nr_entries == KEYS_PER_NODE)
522 new = xfs_iext_split_node(&node, &pos, &nr_entries);
525 * Update the pointers in higher levels if the first entry changes
526 * in an existing node.
528 if (node != new && pos == 0 && nr_entries > 0)
529 xfs_iext_update_node(ifp, node->keys[0], offset, level, node);
531 for (i = nr_entries; i > pos; i--) {
532 node->keys[i] = node->keys[i - 1];
533 node->ptrs[i] = node->ptrs[i - 1];
535 node->keys[pos] = offset;
536 node->ptrs[pos] = ptr;
539 offset = new->keys[0];
546 static struct xfs_iext_leaf *
548 struct xfs_iext_cursor *cur,
551 struct xfs_iext_leaf *leaf = cur->leaf;
552 struct xfs_iext_leaf *new = xfs_iext_alloc_node(NODE_SIZE);
553 const int nr_move = RECS_PER_LEAF / 2;
554 int nr_keep = nr_move + (RECS_PER_LEAF & 1);
557 /* for sequential append operations just spill over into the new node */
558 if (cur->pos == RECS_PER_LEAF) {
565 for (i = 0; i < nr_move; i++) {
566 new->recs[i] = leaf->recs[nr_keep + i];
567 xfs_iext_rec_clear(&leaf->recs[nr_keep + i]);
570 if (cur->pos >= nr_keep) {
573 *nr_entries = nr_move;
575 *nr_entries = nr_keep;
579 leaf->next->prev = new;
580 new->next = leaf->next;
588 struct xfs_ifork *ifp,
589 struct xfs_iext_cursor *cur)
591 ASSERT(ifp->if_bytes == 0);
593 ifp->if_data = xfs_iext_alloc_node(sizeof(struct xfs_iext_rec));
596 /* now that we have a node step into it */
597 cur->leaf = ifp->if_data;
602 xfs_iext_realloc_root(
603 struct xfs_ifork *ifp,
604 struct xfs_iext_cursor *cur)
606 int64_t new_size = ifp->if_bytes + sizeof(struct xfs_iext_rec);
609 /* account for the prev/next pointers */
610 if (new_size / sizeof(struct xfs_iext_rec) == RECS_PER_LEAF)
611 new_size = NODE_SIZE;
613 new = krealloc(ifp->if_data, new_size,
614 GFP_KERNEL | __GFP_NOLOCKDEP | __GFP_NOFAIL);
615 memset(new + ifp->if_bytes, 0, new_size - ifp->if_bytes);
621 * Increment the sequence counter on extent tree changes. If we are on a COW
622 * fork, this allows the writeback code to skip looking for a COW extent if the
623 * COW fork hasn't changed. We use WRITE_ONCE here to ensure the update to the
624 * sequence counter is seen before the modifications to the extent tree itself
627 static inline void xfs_iext_inc_seq(struct xfs_ifork *ifp)
629 WRITE_ONCE(ifp->if_seq, READ_ONCE(ifp->if_seq) + 1);
634 struct xfs_ifork *ifp,
635 struct xfs_iext_cursor *cur,
636 struct xfs_bmbt_irec *irec)
638 xfs_fileoff_t offset = irec->br_startoff;
639 struct xfs_iext_leaf *new = NULL;
642 xfs_iext_inc_seq(ifp);
644 if (ifp->if_height == 0)
645 xfs_iext_alloc_root(ifp, cur);
646 else if (ifp->if_height == 1)
647 xfs_iext_realloc_root(ifp, cur);
649 nr_entries = xfs_iext_leaf_nr_entries(ifp, cur->leaf, cur->pos);
650 ASSERT(nr_entries <= RECS_PER_LEAF);
651 ASSERT(cur->pos >= nr_entries ||
652 xfs_iext_rec_cmp(cur_rec(cur), irec->br_startoff) != 0);
654 if (nr_entries == RECS_PER_LEAF)
655 new = xfs_iext_split_leaf(cur, &nr_entries);
658 * Update the pointers in higher levels if the first entry changes
659 * in an existing node.
661 if (cur->leaf != new && cur->pos == 0 && nr_entries > 0) {
662 xfs_iext_update_node(ifp, xfs_iext_leaf_key(cur->leaf, 0),
663 offset, 1, cur->leaf);
666 for (i = nr_entries; i > cur->pos; i--)
667 cur->leaf->recs[i] = cur->leaf->recs[i - 1];
668 xfs_iext_set(cur_rec(cur), irec);
669 ifp->if_bytes += sizeof(struct xfs_iext_rec);
672 xfs_iext_insert_node(ifp, xfs_iext_leaf_key(new, 0), new, 2);
677 struct xfs_inode *ip,
678 struct xfs_iext_cursor *cur,
679 struct xfs_bmbt_irec *irec,
682 struct xfs_ifork *ifp = xfs_iext_state_to_fork(ip, state);
684 xfs_iext_insert_raw(ifp, cur, irec);
685 trace_xfs_iext_insert(ip, cur, state, _RET_IP_);
688 static struct xfs_iext_node *
689 xfs_iext_rebalance_node(
690 struct xfs_iext_node *parent,
692 struct xfs_iext_node *node,
696 * If the neighbouring nodes are completely full, or have different
697 * parents, we might never be able to merge our node, and will only
698 * delete it once the number of entries hits zero.
704 struct xfs_iext_node *prev = parent->ptrs[*pos - 1];
705 int nr_prev = xfs_iext_node_nr_entries(prev, 0), i;
707 if (nr_prev + nr_entries <= KEYS_PER_NODE) {
708 for (i = 0; i < nr_entries; i++) {
709 prev->keys[nr_prev + i] = node->keys[i];
710 prev->ptrs[nr_prev + i] = node->ptrs[i];
716 if (*pos + 1 < xfs_iext_node_nr_entries(parent, *pos)) {
717 struct xfs_iext_node *next = parent->ptrs[*pos + 1];
718 int nr_next = xfs_iext_node_nr_entries(next, 0), i;
720 if (nr_entries + nr_next <= KEYS_PER_NODE) {
722 * Merge the next node into this node so that we don't
723 * have to do an additional update of the keys in the
726 for (i = 0; i < nr_next; i++) {
727 node->keys[nr_entries + i] = next->keys[i];
728 node->ptrs[nr_entries + i] = next->ptrs[i];
740 xfs_iext_remove_node(
741 struct xfs_ifork *ifp,
742 xfs_fileoff_t offset,
745 struct xfs_iext_node *node, *parent;
746 int level = 2, pos, nr_entries, i;
748 ASSERT(level <= ifp->if_height);
749 node = xfs_iext_find_level(ifp, offset, level);
750 pos = xfs_iext_node_pos(node, offset);
752 ASSERT(node->ptrs[pos]);
753 ASSERT(node->ptrs[pos] == victim);
756 nr_entries = xfs_iext_node_nr_entries(node, pos) - 1;
757 offset = node->keys[0];
758 for (i = pos; i < nr_entries; i++) {
759 node->keys[i] = node->keys[i + 1];
760 node->ptrs[i] = node->ptrs[i + 1];
762 node->keys[nr_entries] = XFS_IEXT_KEY_INVALID;
763 node->ptrs[nr_entries] = NULL;
765 if (pos == 0 && nr_entries > 0) {
766 xfs_iext_update_node(ifp, offset, node->keys[0], level, node);
767 offset = node->keys[0];
770 if (nr_entries >= KEYS_PER_NODE / 2)
773 if (level < ifp->if_height) {
775 * If we aren't at the root yet try to find a neighbour node to
776 * merge with (or delete the node if it is empty), and then
777 * recurse up to the next level.
780 parent = xfs_iext_find_level(ifp, offset, level);
781 pos = xfs_iext_node_pos(parent, offset);
783 ASSERT(pos != KEYS_PER_NODE);
784 ASSERT(parent->ptrs[pos] == node);
786 node = xfs_iext_rebalance_node(parent, &pos, node, nr_entries);
792 } else if (nr_entries == 1) {
794 * If we are at the root and only one entry is left we can just
795 * free this node and update the root pointer.
797 ASSERT(node == ifp->if_data);
798 ifp->if_data = node->ptrs[0];
805 xfs_iext_rebalance_leaf(
806 struct xfs_ifork *ifp,
807 struct xfs_iext_cursor *cur,
808 struct xfs_iext_leaf *leaf,
809 xfs_fileoff_t offset,
813 * If the neighbouring nodes are completely full we might never be able
814 * to merge our node, and will only delete it once the number of
821 int nr_prev = xfs_iext_leaf_nr_entries(ifp, leaf->prev, 0), i;
823 if (nr_prev + nr_entries <= RECS_PER_LEAF) {
824 for (i = 0; i < nr_entries; i++)
825 leaf->prev->recs[nr_prev + i] = leaf->recs[i];
827 if (cur->leaf == leaf) {
828 cur->leaf = leaf->prev;
836 int nr_next = xfs_iext_leaf_nr_entries(ifp, leaf->next, 0), i;
838 if (nr_entries + nr_next <= RECS_PER_LEAF) {
840 * Merge the next node into this node so that we don't
841 * have to do an additional update of the keys in the
844 for (i = 0; i < nr_next; i++) {
845 leaf->recs[nr_entries + i] =
849 if (cur->leaf == leaf->next) {
851 cur->pos += nr_entries;
854 offset = xfs_iext_leaf_key(leaf->next, 0);
863 leaf->prev->next = leaf->next;
865 leaf->next->prev = leaf->prev;
866 xfs_iext_remove_node(ifp, offset, leaf);
870 xfs_iext_free_last_leaf(
871 struct xfs_ifork *ifp)
880 struct xfs_inode *ip,
881 struct xfs_iext_cursor *cur,
884 struct xfs_ifork *ifp = xfs_iext_state_to_fork(ip, state);
885 struct xfs_iext_leaf *leaf = cur->leaf;
886 xfs_fileoff_t offset = xfs_iext_leaf_key(leaf, 0);
889 trace_xfs_iext_remove(ip, cur, state, _RET_IP_);
891 ASSERT(ifp->if_height > 0);
892 ASSERT(ifp->if_data != NULL);
893 ASSERT(xfs_iext_valid(ifp, cur));
895 xfs_iext_inc_seq(ifp);
897 nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;
898 for (i = cur->pos; i < nr_entries; i++)
899 leaf->recs[i] = leaf->recs[i + 1];
900 xfs_iext_rec_clear(&leaf->recs[nr_entries]);
901 ifp->if_bytes -= sizeof(struct xfs_iext_rec);
903 if (cur->pos == 0 && nr_entries > 0) {
904 xfs_iext_update_node(ifp, offset, xfs_iext_leaf_key(leaf, 0), 1,
906 offset = xfs_iext_leaf_key(leaf, 0);
907 } else if (cur->pos == nr_entries) {
908 if (ifp->if_height > 1 && leaf->next)
909 cur->leaf = leaf->next;
915 if (nr_entries >= RECS_PER_LEAF / 2)
918 if (ifp->if_height > 1)
919 xfs_iext_rebalance_leaf(ifp, cur, leaf, offset, nr_entries);
920 else if (nr_entries == 0)
921 xfs_iext_free_last_leaf(ifp);
925 * Lookup the extent covering bno.
927 * If there is an extent covering bno return the extent index, and store the
928 * expanded extent structure in *gotp, and the extent cursor in *cur.
929 * If there is no extent covering bno, but there is an extent after it (e.g.
930 * it lies in a hole) return that extent in *gotp and its cursor in *cur
932 * If bno is beyond the last extent return false, and return an invalid
936 xfs_iext_lookup_extent(
937 struct xfs_inode *ip,
938 struct xfs_ifork *ifp,
939 xfs_fileoff_t offset,
940 struct xfs_iext_cursor *cur,
941 struct xfs_bmbt_irec *gotp)
943 XFS_STATS_INC(ip->i_mount, xs_look_exlist);
945 cur->leaf = xfs_iext_find_level(ifp, offset, 1);
951 for (cur->pos = 0; cur->pos < xfs_iext_max_recs(ifp); cur->pos++) {
952 struct xfs_iext_rec *rec = cur_rec(cur);
954 if (xfs_iext_rec_is_empty(rec))
956 if (xfs_iext_rec_cmp(rec, offset) >= 0)
960 /* Try looking in the next node for an entry > offset */
961 if (ifp->if_height == 1 || !cur->leaf->next)
963 cur->leaf = cur->leaf->next;
965 if (!xfs_iext_valid(ifp, cur))
968 xfs_iext_get(gotp, cur_rec(cur));
973 * Returns the last extent before end, and if this extent doesn't cover
974 * end, update end to the end of the extent.
977 xfs_iext_lookup_extent_before(
978 struct xfs_inode *ip,
979 struct xfs_ifork *ifp,
981 struct xfs_iext_cursor *cur,
982 struct xfs_bmbt_irec *gotp)
984 /* could be optimized to not even look up the next on a match.. */
985 if (xfs_iext_lookup_extent(ip, ifp, *end - 1, cur, gotp) &&
986 gotp->br_startoff <= *end - 1)
988 if (!xfs_iext_prev_extent(ifp, cur, gotp))
990 *end = gotp->br_startoff + gotp->br_blockcount;
995 xfs_iext_update_extent(
996 struct xfs_inode *ip,
998 struct xfs_iext_cursor *cur,
999 struct xfs_bmbt_irec *new)
1001 struct xfs_ifork *ifp = xfs_iext_state_to_fork(ip, state);
1003 xfs_iext_inc_seq(ifp);
1005 if (cur->pos == 0) {
1006 struct xfs_bmbt_irec old;
1008 xfs_iext_get(&old, cur_rec(cur));
1009 if (new->br_startoff != old.br_startoff) {
1010 xfs_iext_update_node(ifp, old.br_startoff,
1011 new->br_startoff, 1, cur->leaf);
1015 trace_xfs_bmap_pre_update(ip, cur, state, _RET_IP_);
1016 xfs_iext_set(cur_rec(cur), new);
1017 trace_xfs_bmap_post_update(ip, cur, state, _RET_IP_);
1021 * Return true if the cursor points at an extent and return the extent structure
1022 * in gotp. Else return false.
1025 xfs_iext_get_extent(
1026 struct xfs_ifork *ifp,
1027 struct xfs_iext_cursor *cur,
1028 struct xfs_bmbt_irec *gotp)
1030 if (!xfs_iext_valid(ifp, cur))
1032 xfs_iext_get(gotp, cur_rec(cur));
1037 * This is a recursive function, because of that we need to be extremely
1038 * careful with stack usage.
1041 xfs_iext_destroy_node(
1042 struct xfs_iext_node *node,
1048 for (i = 0; i < KEYS_PER_NODE; i++) {
1049 if (node->keys[i] == XFS_IEXT_KEY_INVALID)
1051 xfs_iext_destroy_node(node->ptrs[i], level - 1);
1060 struct xfs_ifork *ifp)
1062 xfs_iext_destroy_node(ifp->if_data, ifp->if_height);
1066 ifp->if_data = NULL;