aboutsummaryrefslogtreecommitdiffstats
path: root/fs/xfs/xfs_alloc_btree.c
diff options
context:
space:
mode:
authorNathan Scott <nathans@sgi.com>2006-09-27 20:58:40 -0400
committerTim Shimmin <tes@sgi.com>2006-09-27 20:58:40 -0400
commit1121b219bf3fe6d1bd1d1f7618cc5e0c409fabb4 (patch)
treee4fa877ce76e9d8aca0addf38611c882ff5d726a /fs/xfs/xfs_alloc_btree.c
parent8801bb99e4425b9a778b355153ab3254bb431d92 (diff)
[XFS] use NULL for pointer initialisation instead of zero-cast-to-ptr
SGI-PV: 954580 SGI-Modid: xfs-linux-melb:xfs-kern:26562a Signed-off-by: Nathan Scott <nathans@sgi.com> Signed-off-by: Tim Shimmin <tes@sgi.com>
Diffstat (limited to 'fs/xfs/xfs_alloc_btree.c')
-rw-r--r--fs/xfs/xfs_alloc_btree.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/fs/xfs/xfs_alloc_btree.c b/fs/xfs/xfs_alloc_btree.c
index ec0bbd4140e4..500a1d75403a 100644
--- a/fs/xfs/xfs_alloc_btree.c
+++ b/fs/xfs/xfs_alloc_btree.c
@@ -670,7 +670,7 @@ xfs_alloc_insrec(
670 } 670 }
671#endif 671#endif
672 nbno = NULLAGBLOCK; 672 nbno = NULLAGBLOCK;
673 ncur = (xfs_btree_cur_t *)0; 673 ncur = NULL;
674 /* 674 /*
675 * If the block is full, we can't insert the new entry until we 675 * If the block is full, we can't insert the new entry until we
676 * make the block un-full. 676 * make the block un-full.
@@ -981,7 +981,7 @@ xfs_alloc_lookup(
981 */ 981 */
982 bp = cur->bc_bufs[level]; 982 bp = cur->bc_bufs[level];
983 if (bp && XFS_BUF_ADDR(bp) != d) 983 if (bp && XFS_BUF_ADDR(bp) != d)
984 bp = (xfs_buf_t *)0; 984 bp = NULL;
985 if (!bp) { 985 if (!bp) {
986 /* 986 /*
987 * Need to get a new buffer. Read it, then 987 * Need to get a new buffer. Read it, then
@@ -2044,7 +2044,7 @@ xfs_alloc_insert(
2044 nbno = NULLAGBLOCK; 2044 nbno = NULLAGBLOCK;
2045 nrec.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock); 2045 nrec.ar_startblock = cpu_to_be32(cur->bc_rec.a.ar_startblock);
2046 nrec.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount); 2046 nrec.ar_blockcount = cpu_to_be32(cur->bc_rec.a.ar_blockcount);
2047 ncur = (xfs_btree_cur_t *)0; 2047 ncur = NULL;
2048 pcur = cur; 2048 pcur = cur;
2049 /* 2049 /*
2050 * Loop going up the tree, starting at the leaf level. 2050 * Loop going up the tree, starting at the leaf level.
@@ -2076,7 +2076,7 @@ xfs_alloc_insert(
2076 */ 2076 */
2077 if (ncur) { 2077 if (ncur) {
2078 pcur = ncur; 2078 pcur = ncur;
2079 ncur = (xfs_btree_cur_t *)0; 2079 ncur = NULL;
2080 } 2080 }
2081 } while (nbno != NULLAGBLOCK); 2081 } while (nbno != NULLAGBLOCK);
2082 *stat = i; 2082 *stat = i;