aboutsummaryrefslogtreecommitdiff
path: root/e2fsprogs/ext2fs/badblocks.c
diff options
context:
space:
mode:
Diffstat (limited to 'e2fsprogs/ext2fs/badblocks.c')
-rw-r--r--e2fsprogs/ext2fs/badblocks.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/e2fsprogs/ext2fs/badblocks.c b/e2fsprogs/ext2fs/badblocks.c
index 4b76ef032..d82041126 100644
--- a/e2fsprogs/ext2fs/badblocks.c
+++ b/e2fsprogs/ext2fs/badblocks.c
@@ -1,6 +1,6 @@
1/* 1/*
2 * badblocks.c --- routines to manipulate the bad block structure 2 * badblocks.c --- routines to manipulate the bad block structure
3 * 3 *
4 * Copyright (C) 1994, 1995, 1996 Theodore Ts'o. 4 * Copyright (C) 1994, 1995, 1996 Theodore Ts'o.
5 * 5 *
6 * %Begin-Header% 6 * %Begin-Header%
@@ -34,7 +34,7 @@ static errcode_t make_u32_list(int size, int num, __u32 *list,
34{ 34{
35 ext2_u32_list bb; 35 ext2_u32_list bb;
36 errcode_t retval; 36 errcode_t retval;
37 37
38 retval = ext2fs_get_mem(sizeof(struct ext2_struct_u32_list), &bb); 38 retval = ext2fs_get_mem(sizeof(struct ext2_struct_u32_list), &bb);
39 if (retval) 39 if (retval)
40 return retval; 40 return retval;
@@ -54,7 +54,7 @@ static errcode_t make_u32_list(int size, int num, __u32 *list,
54 *ret = bb; 54 *ret = bb;
55 return 0; 55 return 0;
56} 56}
57 57
58 58
59/* 59/*
60 * This procedure creates an empty u32 list. 60 * This procedure creates an empty u32 list.
@@ -79,7 +79,7 @@ errcode_t ext2fs_badblocks_list_create(ext2_badblocks_list *ret, int size)
79errcode_t ext2fs_u32_copy(ext2_u32_list src, ext2_u32_list *dest) 79errcode_t ext2fs_u32_copy(ext2_u32_list src, ext2_u32_list *dest)
80{ 80{
81 errcode_t retval; 81 errcode_t retval;
82 82
83 retval = make_u32_list(src->size, src->num, src->list, dest); 83 retval = make_u32_list(src->size, src->num, src->list, dest);
84 if (retval) 84 if (retval)
85 return retval; 85 return retval;
@@ -271,11 +271,11 @@ int ext2fs_u32_list_iterate(ext2_u32_iterate iter, __u32 *blk)
271 271
272 if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST) 272 if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST)
273 return 0; 273 return 0;
274 274
275 if (iter->ptr < bb->num) { 275 if (iter->ptr < bb->num) {
276 *blk = bb->list[iter->ptr++]; 276 *blk = bb->list[iter->ptr++];
277 return 1; 277 return 1;
278 } 278 }
279 *blk = 0; 279 *blk = 0;
280 return 0; 280 return 0;
281} 281}