|
@@ -624,6 +624,8 @@ xfs_iext_insert(
|
|
struct xfs_iext_leaf *new = NULL;
|
|
struct xfs_iext_leaf *new = NULL;
|
|
int nr_entries, i;
|
|
int nr_entries, i;
|
|
|
|
|
|
|
|
+ ifp->if_seq++;
|
|
|
|
+
|
|
if (ifp->if_height == 0)
|
|
if (ifp->if_height == 0)
|
|
xfs_iext_alloc_root(ifp, cur);
|
|
xfs_iext_alloc_root(ifp, cur);
|
|
else if (ifp->if_height == 1)
|
|
else if (ifp->if_height == 1)
|
|
@@ -864,6 +866,8 @@ xfs_iext_remove(
|
|
ASSERT(ifp->if_u1.if_root != NULL);
|
|
ASSERT(ifp->if_u1.if_root != NULL);
|
|
ASSERT(xfs_iext_valid(ifp, cur));
|
|
ASSERT(xfs_iext_valid(ifp, cur));
|
|
|
|
|
|
|
|
+ ifp->if_seq++;
|
|
|
|
+
|
|
nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;
|
|
nr_entries = xfs_iext_leaf_nr_entries(ifp, leaf, cur->pos) - 1;
|
|
for (i = cur->pos; i < nr_entries; i++)
|
|
for (i = cur->pos; i < nr_entries; i++)
|
|
leaf->recs[i] = leaf->recs[i + 1];
|
|
leaf->recs[i] = leaf->recs[i + 1];
|
|
@@ -970,6 +974,8 @@ xfs_iext_update_extent(
|
|
{
|
|
{
|
|
struct xfs_ifork *ifp = xfs_iext_state_to_fork(ip, state);
|
|
struct xfs_ifork *ifp = xfs_iext_state_to_fork(ip, state);
|
|
|
|
|
|
|
|
+ ifp->if_seq++;
|
|
|
|
+
|
|
if (cur->pos == 0) {
|
|
if (cur->pos == 0) {
|
|
struct xfs_bmbt_irec old;
|
|
struct xfs_bmbt_irec old;
|
|
|
|
|