Commit c38e5e84 authored by Christoph Hellwig's avatar Christoph Hellwig Committed by Tim Shimmin

[XFS] remove left over INT_ comments in *alloc*.c We can verify endianess

handling with sparse now, no need for comments.

SGI-PV: 954580
SGI-Modid: xfs-linux-melb:xfs-kern:26557a
Signed-off-by: default avatarChristoph Hellwig <hch@lst.de>
Signed-off-by: default avatarNathan Scott <nathans@sgi.com>
Signed-off-by: default avatarTim Shimmin <tes@sgi.com>
parent 61a25848
...@@ -774,7 +774,7 @@ xfs_alloc_insrec( ...@@ -774,7 +774,7 @@ xfs_alloc_insrec(
* Now stuff the new record in, bump numrecs * Now stuff the new record in, bump numrecs
* and log the new data. * and log the new data.
*/ */
rp[ptr - 1] = *recp; /* INT_: struct copy */ rp[ptr - 1] = *recp;
be16_add(&block->bb_numrecs, 1); be16_add(&block->bb_numrecs, 1);
xfs_alloc_log_recs(cur, bp, ptr, be16_to_cpu(block->bb_numrecs)); xfs_alloc_log_recs(cur, bp, ptr, be16_to_cpu(block->bb_numrecs));
#ifdef DEBUG #ifdef DEBUG
...@@ -819,8 +819,8 @@ xfs_alloc_insrec( ...@@ -819,8 +819,8 @@ xfs_alloc_insrec(
*/ */
*bnop = nbno; *bnop = nbno;
if (nbno != NULLAGBLOCK) { if (nbno != NULLAGBLOCK) {
*recp = nrec; /* INT_: struct copy */ *recp = nrec;
*curp = ncur; /* INT_: struct copy */ *curp = ncur;
} }
*stat = 1; *stat = 1;
return 0; return 0;
...@@ -1229,7 +1229,7 @@ xfs_alloc_lshift( ...@@ -1229,7 +1229,7 @@ xfs_alloc_lshift(
if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*rpp), level))) if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*rpp), level)))
return error; return error;
#endif #endif
*lpp = *rpp; /* INT_: copy */ *lpp = *rpp;
xfs_alloc_log_ptrs(cur, lbp, nrec, nrec); xfs_alloc_log_ptrs(cur, lbp, nrec, nrec);
xfs_btree_check_key(cur->bc_btnum, lkp - 1, lkp); xfs_btree_check_key(cur->bc_btnum, lkp - 1, lkp);
} }
...@@ -1406,8 +1406,8 @@ xfs_alloc_newroot( ...@@ -1406,8 +1406,8 @@ xfs_alloc_newroot(
kp = XFS_ALLOC_KEY_ADDR(new, 1, cur); kp = XFS_ALLOC_KEY_ADDR(new, 1, cur);
if (be16_to_cpu(left->bb_level) > 0) { if (be16_to_cpu(left->bb_level) > 0) {
kp[0] = *XFS_ALLOC_KEY_ADDR(left, 1, cur); /* INT_: structure copy */ kp[0] = *XFS_ALLOC_KEY_ADDR(left, 1, cur);
kp[1] = *XFS_ALLOC_KEY_ADDR(right, 1, cur);/* INT_: structure copy */ kp[1] = *XFS_ALLOC_KEY_ADDR(right, 1, cur);
} else { } else {
xfs_alloc_rec_t *rp; /* btree record pointer */ xfs_alloc_rec_t *rp; /* btree record pointer */
...@@ -1527,8 +1527,8 @@ xfs_alloc_rshift( ...@@ -1527,8 +1527,8 @@ xfs_alloc_rshift(
if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*lpp), level))) if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*lpp), level)))
return error; return error;
#endif #endif
*rkp = *lkp; /* INT_: copy */ *rkp = *lkp;
*rpp = *lpp; /* INT_: copy */ *rpp = *lpp;
xfs_alloc_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1); xfs_alloc_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
xfs_alloc_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1); xfs_alloc_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
xfs_btree_check_key(cur->bc_btnum, rkp, rkp + 1); xfs_btree_check_key(cur->bc_btnum, rkp, rkp + 1);
......
...@@ -681,7 +681,7 @@ xfs_inobt_insrec( ...@@ -681,7 +681,7 @@ xfs_inobt_insrec(
if ((error = xfs_btree_check_sptr(cur, *bnop, level))) if ((error = xfs_btree_check_sptr(cur, *bnop, level)))
return error; return error;
#endif #endif
kp[ptr - 1] = key; /* INT_: struct copy */ kp[ptr - 1] = key;
pp[ptr - 1] = cpu_to_be32(*bnop); pp[ptr - 1] = cpu_to_be32(*bnop);
numrecs++; numrecs++;
block->bb_numrecs = cpu_to_be16(numrecs); block->bb_numrecs = cpu_to_be16(numrecs);
...@@ -698,7 +698,7 @@ xfs_inobt_insrec( ...@@ -698,7 +698,7 @@ xfs_inobt_insrec(
* Now stuff the new record in, bump numrecs * Now stuff the new record in, bump numrecs
* and log the new data. * and log the new data.
*/ */
rp[ptr - 1] = *recp; /* INT_: struct copy */ rp[ptr - 1] = *recp;
numrecs++; numrecs++;
block->bb_numrecs = cpu_to_be16(numrecs); block->bb_numrecs = cpu_to_be16(numrecs);
xfs_inobt_log_recs(cur, bp, ptr, numrecs); xfs_inobt_log_recs(cur, bp, ptr, numrecs);
...@@ -731,7 +731,7 @@ xfs_inobt_insrec( ...@@ -731,7 +731,7 @@ xfs_inobt_insrec(
*/ */
*bnop = nbno; *bnop = nbno;
if (nbno != NULLAGBLOCK) { if (nbno != NULLAGBLOCK) {
*recp = nrec; /* INT_: struct copy */ *recp = nrec;
*curp = ncur; *curp = ncur;
} }
*stat = 1; *stat = 1;
...@@ -1117,7 +1117,7 @@ xfs_inobt_lshift( ...@@ -1117,7 +1117,7 @@ xfs_inobt_lshift(
if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*rpp), level))) if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*rpp), level)))
return error; return error;
#endif #endif
*lpp = *rpp; /* INT_: no-change copy */ *lpp = *rpp;
xfs_inobt_log_ptrs(cur, lbp, nrec, nrec); xfs_inobt_log_ptrs(cur, lbp, nrec, nrec);
} }
/* /*
...@@ -1297,8 +1297,8 @@ xfs_inobt_newroot( ...@@ -1297,8 +1297,8 @@ xfs_inobt_newroot(
*/ */
kp = XFS_INOBT_KEY_ADDR(new, 1, cur); kp = XFS_INOBT_KEY_ADDR(new, 1, cur);
if (be16_to_cpu(left->bb_level) > 0) { if (be16_to_cpu(left->bb_level) > 0) {
kp[0] = *XFS_INOBT_KEY_ADDR(left, 1, cur); /* INT_: struct copy */ kp[0] = *XFS_INOBT_KEY_ADDR(left, 1, cur);
kp[1] = *XFS_INOBT_KEY_ADDR(right, 1, cur); /* INT_: struct copy */ kp[1] = *XFS_INOBT_KEY_ADDR(right, 1, cur);
} else { } else {
rp = XFS_INOBT_REC_ADDR(left, 1, cur); rp = XFS_INOBT_REC_ADDR(left, 1, cur);
kp[0].ir_startino = rp->ir_startino; kp[0].ir_startino = rp->ir_startino;
...@@ -1410,8 +1410,8 @@ xfs_inobt_rshift( ...@@ -1410,8 +1410,8 @@ xfs_inobt_rshift(
if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*lpp), level))) if ((error = xfs_btree_check_sptr(cur, be32_to_cpu(*lpp), level)))
return error; return error;
#endif #endif
*rkp = *lkp; /* INT_: no change copy */ *rkp = *lkp;
*rpp = *lpp; /* INT_: no change copy */ *rpp = *lpp;
xfs_inobt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1); xfs_inobt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
xfs_inobt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1); xfs_inobt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
} else { } else {
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment