Mike Frysinger | 1fd98e0 | 2005-05-09 22:10:42 +0000 | [diff] [blame] | 1 | /* |
| 2 | * bb_inode.c --- routines to update the bad block inode. |
| 3 | * |
| 4 | * WARNING: This routine modifies a lot of state in the filesystem; if |
| 5 | * this routine returns an error, the bad block inode may be in an |
| 6 | * inconsistent state. |
| 7 | * |
| 8 | * Copyright (C) 1994, 1995 Theodore Ts'o. |
| 9 | * |
| 10 | * %Begin-Header% |
| 11 | * This file may be redistributed under the terms of the GNU Public |
| 12 | * License. |
| 13 | * %End-Header% |
| 14 | */ |
| 15 | |
| 16 | #include <stdio.h> |
| 17 | #include <string.h> |
| 18 | #if HAVE_UNISTD_H |
| 19 | #include <unistd.h> |
| 20 | #endif |
| 21 | #include <fcntl.h> |
| 22 | #include <time.h> |
| 23 | #if HAVE_SYS_STAT_H |
| 24 | #include <sys/stat.h> |
| 25 | #endif |
| 26 | #if HAVE_SYS_TYPES_H |
| 27 | #include <sys/types.h> |
| 28 | #endif |
| 29 | |
| 30 | #include "ext2_fs.h" |
| 31 | #include "ext2fs.h" |
| 32 | |
| 33 | struct set_badblock_record { |
| 34 | ext2_badblocks_iterate bb_iter; |
| 35 | int bad_block_count; |
| 36 | blk_t *ind_blocks; |
| 37 | int max_ind_blocks; |
| 38 | int ind_blocks_size; |
| 39 | int ind_blocks_ptr; |
| 40 | char *block_buf; |
| 41 | errcode_t err; |
| 42 | }; |
| 43 | |
| 44 | static int set_bad_block_proc(ext2_filsys fs, blk_t *block_nr, |
| 45 | e2_blkcnt_t blockcnt, |
| 46 | blk_t ref_block, int ref_offset, |
| 47 | void *priv_data); |
| 48 | static int clear_bad_block_proc(ext2_filsys fs, blk_t *block_nr, |
| 49 | e2_blkcnt_t blockcnt, |
| 50 | blk_t ref_block, int ref_offset, |
| 51 | void *priv_data); |
| 52 | |
| 53 | /* |
| 54 | * Given a bad blocks bitmap, update the bad blocks inode to reflect |
| 55 | * the map. |
| 56 | */ |
| 57 | errcode_t ext2fs_update_bb_inode(ext2_filsys fs, ext2_badblocks_list bb_list) |
| 58 | { |
| 59 | errcode_t retval; |
| 60 | struct set_badblock_record rec; |
| 61 | struct ext2_inode inode; |
| 62 | |
| 63 | EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); |
| 64 | |
| 65 | if (!fs->block_map) |
| 66 | return EXT2_ET_NO_BLOCK_BITMAP; |
| 67 | |
| 68 | rec.bad_block_count = 0; |
| 69 | rec.ind_blocks_size = rec.ind_blocks_ptr = 0; |
| 70 | rec.max_ind_blocks = 10; |
| 71 | retval = ext2fs_get_mem(rec.max_ind_blocks * sizeof(blk_t), |
| 72 | &rec.ind_blocks); |
| 73 | if (retval) |
| 74 | return retval; |
| 75 | memset(rec.ind_blocks, 0, rec.max_ind_blocks * sizeof(blk_t)); |
| 76 | retval = ext2fs_get_mem(fs->blocksize, &rec.block_buf); |
| 77 | if (retval) |
| 78 | goto cleanup; |
| 79 | memset(rec.block_buf, 0, fs->blocksize); |
| 80 | rec.err = 0; |
| 81 | |
| 82 | /* |
| 83 | * First clear the old bad blocks (while saving the indirect blocks) |
| 84 | */ |
| 85 | retval = ext2fs_block_iterate2(fs, EXT2_BAD_INO, |
| 86 | BLOCK_FLAG_DEPTH_TRAVERSE, 0, |
| 87 | clear_bad_block_proc, &rec); |
| 88 | if (retval) |
| 89 | goto cleanup; |
| 90 | if (rec.err) { |
| 91 | retval = rec.err; |
| 92 | goto cleanup; |
| 93 | } |
| 94 | |
| 95 | /* |
| 96 | * Now set the bad blocks! |
| 97 | * |
| 98 | * First, mark the bad blocks as used. This prevents a bad |
| 99 | * block from being used as an indirecto block for the bad |
| 100 | * block inode (!). |
| 101 | */ |
| 102 | if (bb_list) { |
| 103 | retval = ext2fs_badblocks_list_iterate_begin(bb_list, |
| 104 | &rec.bb_iter); |
| 105 | if (retval) |
| 106 | goto cleanup; |
| 107 | retval = ext2fs_block_iterate2(fs, EXT2_BAD_INO, |
| 108 | BLOCK_FLAG_APPEND, 0, |
| 109 | set_bad_block_proc, &rec); |
| 110 | ext2fs_badblocks_list_iterate_end(rec.bb_iter); |
| 111 | if (retval) |
| 112 | goto cleanup; |
| 113 | if (rec.err) { |
| 114 | retval = rec.err; |
| 115 | goto cleanup; |
| 116 | } |
| 117 | } |
| 118 | |
| 119 | /* |
| 120 | * Update the bad block inode's mod time and block count |
| 121 | * field. |
| 122 | */ |
| 123 | retval = ext2fs_read_inode(fs, EXT2_BAD_INO, &inode); |
| 124 | if (retval) |
| 125 | goto cleanup; |
| 126 | |
| 127 | inode.i_atime = inode.i_mtime = time(0); |
| 128 | if (!inode.i_ctime) |
| 129 | inode.i_ctime = time(0); |
| 130 | inode.i_blocks = rec.bad_block_count * (fs->blocksize / 512); |
| 131 | inode.i_size = rec.bad_block_count * fs->blocksize; |
| 132 | |
| 133 | retval = ext2fs_write_inode(fs, EXT2_BAD_INO, &inode); |
| 134 | if (retval) |
| 135 | goto cleanup; |
| 136 | |
| 137 | cleanup: |
| 138 | ext2fs_free_mem(&rec.ind_blocks); |
| 139 | ext2fs_free_mem(&rec.block_buf); |
| 140 | return retval; |
| 141 | } |
| 142 | |
| 143 | /* |
| 144 | * Helper function for update_bb_inode() |
| 145 | * |
| 146 | * Clear the bad blocks in the bad block inode, while saving the |
| 147 | * indirect blocks. |
| 148 | */ |
| 149 | #ifdef __TURBOC__ |
| 150 | #pragma argsused |
| 151 | #endif |
| 152 | static int clear_bad_block_proc(ext2_filsys fs, blk_t *block_nr, |
| 153 | e2_blkcnt_t blockcnt, |
| 154 | blk_t ref_block EXT2FS_ATTR((unused)), |
| 155 | int ref_offset EXT2FS_ATTR((unused)), |
| 156 | void *priv_data) |
| 157 | { |
| 158 | struct set_badblock_record *rec = (struct set_badblock_record *) |
| 159 | priv_data; |
| 160 | errcode_t retval; |
| 161 | unsigned long old_size; |
| 162 | |
| 163 | if (!*block_nr) |
| 164 | return 0; |
| 165 | |
| 166 | /* |
| 167 | * If the block number is outrageous, clear it and ignore it. |
| 168 | */ |
| 169 | if (*block_nr >= fs->super->s_blocks_count || |
| 170 | *block_nr < fs->super->s_first_data_block) { |
| 171 | *block_nr = 0; |
| 172 | return BLOCK_CHANGED; |
| 173 | } |
| 174 | |
| 175 | if (blockcnt < 0) { |
| 176 | if (rec->ind_blocks_size >= rec->max_ind_blocks) { |
| 177 | old_size = rec->max_ind_blocks * sizeof(blk_t); |
| 178 | rec->max_ind_blocks += 10; |
| 179 | retval = ext2fs_resize_mem(old_size, |
| 180 | rec->max_ind_blocks * sizeof(blk_t), |
| 181 | &rec->ind_blocks); |
| 182 | if (retval) { |
| 183 | rec->max_ind_blocks -= 10; |
| 184 | rec->err = retval; |
| 185 | return BLOCK_ABORT; |
| 186 | } |
| 187 | } |
| 188 | rec->ind_blocks[rec->ind_blocks_size++] = *block_nr; |
| 189 | } |
| 190 | |
| 191 | /* |
| 192 | * Mark the block as unused, and update accounting information |
| 193 | */ |
| 194 | ext2fs_block_alloc_stats(fs, *block_nr, -1); |
| 195 | |
| 196 | *block_nr = 0; |
| 197 | return BLOCK_CHANGED; |
| 198 | } |
| 199 | |
| 200 | |
| 201 | /* |
| 202 | * Helper function for update_bb_inode() |
| 203 | * |
| 204 | * Set the block list in the bad block inode, using the supplied bitmap. |
| 205 | */ |
| 206 | #ifdef __TURBOC__ |
| 207 | #pragma argsused |
| 208 | #endif |
| 209 | static int set_bad_block_proc(ext2_filsys fs, blk_t *block_nr, |
| 210 | e2_blkcnt_t blockcnt, |
| 211 | blk_t ref_block EXT2FS_ATTR((unused)), |
| 212 | int ref_offset EXT2FS_ATTR((unused)), |
| 213 | void *priv_data) |
| 214 | { |
| 215 | struct set_badblock_record *rec = (struct set_badblock_record *) |
| 216 | priv_data; |
| 217 | errcode_t retval; |
| 218 | blk_t blk; |
| 219 | |
| 220 | if (blockcnt >= 0) { |
| 221 | /* |
| 222 | * Get the next bad block. |
| 223 | */ |
| 224 | if (!ext2fs_badblocks_list_iterate(rec->bb_iter, &blk)) |
| 225 | return BLOCK_ABORT; |
| 226 | rec->bad_block_count++; |
| 227 | } else { |
| 228 | /* |
| 229 | * An indirect block; fetch a block from the |
| 230 | * previously used indirect block list. The block |
| 231 | * most be not marked as used; if so, get another one. |
| 232 | * If we run out of reserved indirect blocks, allocate |
| 233 | * a new one. |
| 234 | */ |
| 235 | retry: |
| 236 | if (rec->ind_blocks_ptr < rec->ind_blocks_size) { |
| 237 | blk = rec->ind_blocks[rec->ind_blocks_ptr++]; |
| 238 | if (ext2fs_test_block_bitmap(fs->block_map, blk)) |
| 239 | goto retry; |
| 240 | } else { |
| 241 | retval = ext2fs_new_block(fs, 0, 0, &blk); |
| 242 | if (retval) { |
| 243 | rec->err = retval; |
| 244 | return BLOCK_ABORT; |
| 245 | } |
| 246 | } |
| 247 | retval = io_channel_write_blk(fs->io, blk, 1, rec->block_buf); |
| 248 | if (retval) { |
| 249 | rec->err = retval; |
| 250 | return BLOCK_ABORT; |
| 251 | } |
| 252 | } |
| 253 | |
| 254 | /* |
| 255 | * Update block counts |
| 256 | */ |
| 257 | ext2fs_block_alloc_stats(fs, blk, +1); |
| 258 | |
| 259 | *block_nr = blk; |
| 260 | return BLOCK_CHANGED; |
| 261 | } |
| 262 | |
| 263 | |
| 264 | |
| 265 | |
| 266 | |
| 267 | |