Blame view
fs/hpfs/alloc.c
14.3 KB
1da177e4c
|
1 2 3 4 5 6 7 8 9 |
/* * linux/fs/hpfs/alloc.c * * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999 * * HPFS bitmap operations */ #include "hpfs_fn.h" |
2cbe5c76f
|
10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 |
static void hpfs_claim_alloc(struct super_block *s, secno sec) { struct hpfs_sb_info *sbi = hpfs_sb(s); if (sbi->sb_n_free != (unsigned)-1) { if (unlikely(!sbi->sb_n_free)) { hpfs_error(s, "free count underflow, allocating sector %08x", sec); sbi->sb_n_free = -1; return; } sbi->sb_n_free--; } } static void hpfs_claim_free(struct super_block *s, secno sec) { struct hpfs_sb_info *sbi = hpfs_sb(s); if (sbi->sb_n_free != (unsigned)-1) { if (unlikely(sbi->sb_n_free >= sbi->sb_fs_size)) { hpfs_error(s, "free count overflow, freeing sector %08x", sec); sbi->sb_n_free = -1; return; } sbi->sb_n_free++; } } static void hpfs_claim_dirband_alloc(struct super_block *s, secno sec) { struct hpfs_sb_info *sbi = hpfs_sb(s); if (sbi->sb_n_free_dnodes != (unsigned)-1) { if (unlikely(!sbi->sb_n_free_dnodes)) { hpfs_error(s, "dirband free count underflow, allocating sector %08x", sec); sbi->sb_n_free_dnodes = -1; return; } sbi->sb_n_free_dnodes--; } } static void hpfs_claim_dirband_free(struct super_block *s, secno sec) { struct hpfs_sb_info *sbi = hpfs_sb(s); if (sbi->sb_n_free_dnodes != (unsigned)-1) { if (unlikely(sbi->sb_n_free_dnodes >= sbi->sb_dirband_size / 4)) { hpfs_error(s, "dirband free count overflow, freeing sector %08x", sec); sbi->sb_n_free_dnodes = -1; return; } sbi->sb_n_free_dnodes++; } } |
1da177e4c
|
61 62 63 64 65 66 67 68 |
/* * Check if a sector is allocated in bitmap * This is really slow. Turned on only if chk==2 */ static int chk_if_allocated(struct super_block *s, secno sec, char *msg) { struct quad_buffer_head qbh; |
52576da35
|
69 |
__le32 *bmp; |
1da177e4c
|
70 |
if (!(bmp = hpfs_map_bitmap(s, sec >> 14, &qbh, "chk"))) goto fail; |
52576da35
|
71 |
if ((le32_to_cpu(bmp[(sec & 0x3fff) >> 5]) >> (sec & 0x1f)) & 1) { |
1da177e4c
|
72 73 74 75 76 77 78 |
hpfs_error(s, "sector '%s' - %08x not allocated in bitmap", msg, sec); goto fail1; } hpfs_brelse4(&qbh); if (sec >= hpfs_sb(s)->sb_dirband_start && sec < hpfs_sb(s)->sb_dirband_start + hpfs_sb(s)->sb_dirband_size) { unsigned ssec = (sec - hpfs_sb(s)->sb_dirband_start) / 4; if (!(bmp = hpfs_map_dnode_bitmap(s, &qbh))) goto fail; |
0b69760be
|
79 |
if ((le32_to_cpu(bmp[ssec >> 5]) >> (ssec & 0x1f)) & 1) { |
1da177e4c
|
80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 |
hpfs_error(s, "sector '%s' - %08x not allocated in directory bitmap", msg, sec); goto fail1; } hpfs_brelse4(&qbh); } return 0; fail1: hpfs_brelse4(&qbh); fail: return 1; } /* * Check if sector(s) have proper number and additionally check if they're * allocated in bitmap. */ int hpfs_chk_sectors(struct super_block *s, secno start, int len, char *msg) { if (start + len < start || start < 0x12 || start + len > hpfs_sb(s)->sb_fs_size) { hpfs_error(s, "sector(s) '%s' badly placed at %08x", msg, start); return 1; } if (hpfs_sb(s)->sb_chk>=2) { int i; for (i = 0; i < len; i++) if (chk_if_allocated(s, start + i, msg)) return 1; } return 0; } static secno alloc_in_bmp(struct super_block *s, secno near, unsigned n, unsigned forward) { struct quad_buffer_head qbh; |
52576da35
|
115 |
__le32 *bmp; |
1da177e4c
|
116 117 118 119 120 121 122 123 124 125 |
unsigned bs = near & ~0x3fff; unsigned nr = (near & 0x3fff) & ~(n - 1); /*unsigned mnr;*/ unsigned i, q; int a, b; secno ret = 0; if (n != 1 && n != 4) { hpfs_error(s, "Bad allocation size: %d", n); return 0; } |
1da177e4c
|
126 127 128 129 130 131 132 133 134 |
if (bs != ~0x3fff) { if (!(bmp = hpfs_map_bitmap(s, near >> 14, &qbh, "aib"))) goto uls; } else { if (!(bmp = hpfs_map_dnode_bitmap(s, &qbh))) goto uls; } if (!tstbits(bmp, nr, n + forward)) { ret = bs + nr; goto rt; } |
1da177e4c
|
135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 |
q = nr + n; b = 0; while ((a = tstbits(bmp, q, n + forward)) != 0) { q += a; if (n != 1) q = ((q-1)&~(n-1))+n; if (!b) { if (q>>5 != nr>>5) { b = 1; q = nr & 0x1f; } } else if (q > nr) break; } if (!a) { ret = bs + q; goto rt; } nr >>= 5; |
0b69760be
|
151 |
/*for (i = nr + 1; i != nr; i++, i &= 0x1ff) */ |
1da177e4c
|
152 153 |
i = nr; do { |
0b69760be
|
154 155 |
if (!le32_to_cpu(bmp[i])) goto cont; if (n + forward >= 0x3f && le32_to_cpu(bmp[i]) != 0xffffffff) goto cont; |
1da177e4c
|
156 157 |
q = i<<5; if (i > 0) { |
0b69760be
|
158 |
unsigned k = le32_to_cpu(bmp[i-1]); |
1da177e4c
|
159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 |
while (k & 0x80000000) { q--; k <<= 1; } } if (n != 1) q = ((q-1)&~(n-1))+n; while ((a = tstbits(bmp, q, n + forward)) != 0) { q += a; if (n != 1) q = ((q-1)&~(n-1))+n; if (q>>5 > i) break; } if (!a) { ret = bs + q; goto rt; } cont: i++, i &= 0x1ff; } while (i != nr); rt: if (ret) { |
0b69760be
|
178 |
if (hpfs_sb(s)->sb_chk && ((ret >> 14) != (bs >> 14) || (le32_to_cpu(bmp[(ret & 0x3fff) >> 5]) | ~(((1 << n) - 1) << (ret & 0x1f))) != 0xffffffff)) { |
1da177e4c
|
179 180 181 182 |
hpfs_error(s, "Allocation doesn't work! Wanted %d, allocated at %08x", n, ret); ret = 0; goto b; } |
0b69760be
|
183 |
bmp[(ret & 0x3fff) >> 5] &= cpu_to_le32(~(((1 << n) - 1) << (ret & 0x1f))); |
1da177e4c
|
184 185 186 187 188 |
hpfs_mark_4buffers_dirty(&qbh); } b: hpfs_brelse4(&qbh); uls: |
1da177e4c
|
189 190 191 192 193 194 195 196 197 198 |
return ret; } /* * Allocation strategy: 1) search place near the sector specified * 2) search bitmap where free sectors last found * 3) search all bitmaps * 4) search all bitmaps ignoring number of pre-allocated * sectors */ |
7d23ce36e
|
199 |
secno hpfs_alloc_sector(struct super_block *s, secno near, unsigned n, int forward) |
1da177e4c
|
200 201 202 203 204 205 206 207 208 209 210 |
{ secno sec; int i; unsigned n_bmps; struct hpfs_sb_info *sbi = hpfs_sb(s); int f_p = 0; int near_bmp; if (forward < 0) { forward = -forward; f_p = 1; } |
1da177e4c
|
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 |
n_bmps = (sbi->sb_fs_size + 0x4000 - 1) >> 14; if (near && near < sbi->sb_fs_size) { if ((sec = alloc_in_bmp(s, near, n, f_p ? forward : forward/4))) goto ret; near_bmp = near >> 14; } else near_bmp = n_bmps / 2; /* if (b != -1) { if ((sec = alloc_in_bmp(s, b<<14, n, f_p ? forward : forward/2))) { b &= 0x0fffffff; goto ret; } if (b > 0x10000000) if ((sec = alloc_in_bmp(s, (b&0xfffffff)<<14, n, f_p ? forward : 0))) goto ret; */ if (!f_p) if (forward > sbi->sb_max_fwd_alloc) forward = sbi->sb_max_fwd_alloc; less_fwd: for (i = 0; i < n_bmps; i++) { if (near_bmp+i < n_bmps && ((sec = alloc_in_bmp(s, (near_bmp+i) << 14, n, forward)))) { sbi->sb_c_bitmap = near_bmp+i; goto ret; } if (!forward) { if (near_bmp-i-1 >= 0 && ((sec = alloc_in_bmp(s, (near_bmp-i-1) << 14, n, forward)))) { sbi->sb_c_bitmap = near_bmp-i-1; goto ret; } } else { if (near_bmp+i >= n_bmps && ((sec = alloc_in_bmp(s, (near_bmp+i-n_bmps) << 14, n, forward)))) { sbi->sb_c_bitmap = near_bmp+i-n_bmps; goto ret; } } if (i == 1 && sbi->sb_c_bitmap != -1 && ((sec = alloc_in_bmp(s, (sbi->sb_c_bitmap) << 14, n, forward)))) { goto ret; } } if (!f_p) { if (forward) { sbi->sb_max_fwd_alloc = forward * 3 / 4; forward /= 2; goto less_fwd; } } sec = 0; ret: |
2cbe5c76f
|
255 256 257 258 259 260 |
if (sec) { i = 0; do hpfs_claim_alloc(s, sec + i); while (unlikely(++i < n)); } |
1da177e4c
|
261 262 |
if (sec && f_p) { for (i = 0; i < forward; i++) { |
2cbe5c76f
|
263 |
if (!hpfs_alloc_if_possible(s, sec + n + i)) { |
1da177e4c
|
264 265 266 267 268 269 |
hpfs_error(s, "Prealloc doesn't work! Wanted %d, allocated at %08x, can't allocate %d", forward, sec, i); sec = 0; break; } } } |
1da177e4c
|
270 271 |
return sec; } |
7d23ce36e
|
272 |
static secno alloc_in_dirband(struct super_block *s, secno near) |
1da177e4c
|
273 274 275 276 277 278 279 280 281 282 |
{ unsigned nr = near; secno sec; struct hpfs_sb_info *sbi = hpfs_sb(s); if (nr < sbi->sb_dirband_start) nr = sbi->sb_dirband_start; if (nr >= sbi->sb_dirband_start + sbi->sb_dirband_size) nr = sbi->sb_dirband_start + sbi->sb_dirband_size - 4; nr -= sbi->sb_dirband_start; nr >>= 2; |
1da177e4c
|
283 |
sec = alloc_in_bmp(s, (~0x3fff) | nr, 1, 0); |
1da177e4c
|
284 |
if (!sec) return 0; |
2cbe5c76f
|
285 |
hpfs_claim_dirband_alloc(s, sec); |
1da177e4c
|
286 287 288 289 |
return ((sec & 0x3fff) << 2) + sbi->sb_dirband_start; } /* Alloc sector if it's free */ |
7d23ce36e
|
290 |
int hpfs_alloc_if_possible(struct super_block *s, secno sec) |
1da177e4c
|
291 292 |
{ struct quad_buffer_head qbh; |
52576da35
|
293 |
__le32 *bmp; |
1da177e4c
|
294 |
if (!(bmp = hpfs_map_bitmap(s, sec >> 14, &qbh, "aip"))) goto end; |
0b69760be
|
295 296 |
if (le32_to_cpu(bmp[(sec & 0x3fff) >> 5]) & (1 << (sec & 0x1f))) { bmp[(sec & 0x3fff) >> 5] &= cpu_to_le32(~(1 << (sec & 0x1f))); |
1da177e4c
|
297 298 |
hpfs_mark_4buffers_dirty(&qbh); hpfs_brelse4(&qbh); |
2cbe5c76f
|
299 |
hpfs_claim_alloc(s, sec); |
1da177e4c
|
300 301 302 303 |
return 1; } hpfs_brelse4(&qbh); end: |
1da177e4c
|
304 305 |
return 0; } |
1da177e4c
|
306 307 308 309 310 |
/* Free sectors in bitmaps */ void hpfs_free_sectors(struct super_block *s, secno sec, unsigned n) { struct quad_buffer_head qbh; |
52576da35
|
311 |
__le32 *bmp; |
1da177e4c
|
312 |
struct hpfs_sb_info *sbi = hpfs_sb(s); |
b7cb1ce22
|
313 |
/*pr_info("2 - ");*/ |
1da177e4c
|
314 315 316 317 318 |
if (!n) return; if (sec < 0x12) { hpfs_error(s, "Trying to free reserved sector %08x", sec); return; } |
1da177e4c
|
319 320 321 322 |
sbi->sb_max_fwd_alloc += n > 0xffff ? 0xffff : n; if (sbi->sb_max_fwd_alloc > 0xffffff) sbi->sb_max_fwd_alloc = 0xffffff; new_map: if (!(bmp = hpfs_map_bitmap(s, sec >> 14, &qbh, "free"))) { |
1da177e4c
|
323 324 325 |
return; } new_tst: |
0b69760be
|
326 |
if ((le32_to_cpu(bmp[(sec & 0x3fff) >> 5]) >> (sec & 0x1f) & 1)) { |
1da177e4c
|
327 328 |
hpfs_error(s, "sector %08x not allocated", sec); hpfs_brelse4(&qbh); |
1da177e4c
|
329 330 |
return; } |
0b69760be
|
331 |
bmp[(sec & 0x3fff) >> 5] |= cpu_to_le32(1 << (sec & 0x1f)); |
2cbe5c76f
|
332 |
hpfs_claim_free(s, sec); |
1da177e4c
|
333 334 335 |
if (!--n) { hpfs_mark_4buffers_dirty(&qbh); hpfs_brelse4(&qbh); |
1da177e4c
|
336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 |
return; } if (!(++sec & 0x3fff)) { hpfs_mark_4buffers_dirty(&qbh); hpfs_brelse4(&qbh); goto new_map; } goto new_tst; } /* * Check if there are at least n free dnodes on the filesystem. * Called before adding to dnode. If we run out of space while * splitting dnodes, it would corrupt dnode tree. */ int hpfs_check_free_dnodes(struct super_block *s, int n) { int n_bmps = (hpfs_sb(s)->sb_fs_size + 0x4000 - 1) >> 14; int b = hpfs_sb(s)->sb_c_bitmap & 0x0fffffff; int i, j; |
52576da35
|
357 |
__le32 *bmp; |
1da177e4c
|
358 359 360 361 |
struct quad_buffer_head qbh; if ((bmp = hpfs_map_dnode_bitmap(s, &qbh))) { for (j = 0; j < 512; j++) { unsigned k; |
0b69760be
|
362 363 |
if (!le32_to_cpu(bmp[j])) continue; for (k = le32_to_cpu(bmp[j]); k; k >>= 1) if (k & 1) if (!--n) { |
1da177e4c
|
364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 |
hpfs_brelse4(&qbh); return 0; } } } hpfs_brelse4(&qbh); i = 0; if (hpfs_sb(s)->sb_c_bitmap != -1) { bmp = hpfs_map_bitmap(s, b, &qbh, "chkdn1"); goto chk_bmp; } chk_next: if (i == b) i++; if (i >= n_bmps) return 1; bmp = hpfs_map_bitmap(s, i, &qbh, "chkdn2"); chk_bmp: if (bmp) { for (j = 0; j < 512; j++) { |
0b69760be
|
382 383 |
u32 k; if (!le32_to_cpu(bmp[j])) continue; |
1da177e4c
|
384 |
for (k = 0xf; k; k <<= 4) |
0b69760be
|
385 |
if ((le32_to_cpu(bmp[j]) & k) == k) { |
1da177e4c
|
386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 |
if (!--n) { hpfs_brelse4(&qbh); return 0; } } } hpfs_brelse4(&qbh); } i++; goto chk_next; } void hpfs_free_dnode(struct super_block *s, dnode_secno dno) { if (hpfs_sb(s)->sb_chk) if (dno & 3) { hpfs_error(s, "hpfs_free_dnode: dnode %08x not aligned", dno); return; } if (dno < hpfs_sb(s)->sb_dirband_start || dno >= hpfs_sb(s)->sb_dirband_start + hpfs_sb(s)->sb_dirband_size) { hpfs_free_sectors(s, dno, 4); } else { struct quad_buffer_head qbh; |
52576da35
|
409 |
__le32 *bmp; |
1da177e4c
|
410 |
unsigned ssec = (dno - hpfs_sb(s)->sb_dirband_start) / 4; |
1da177e4c
|
411 |
if (!(bmp = hpfs_map_dnode_bitmap(s, &qbh))) { |
1da177e4c
|
412 413 |
return; } |
0b69760be
|
414 |
bmp[ssec >> 5] |= cpu_to_le32(1 << (ssec & 0x1f)); |
1da177e4c
|
415 416 |
hpfs_mark_4buffers_dirty(&qbh); hpfs_brelse4(&qbh); |
2cbe5c76f
|
417 |
hpfs_claim_dirband_free(s, dno); |
1da177e4c
|
418 419 420 421 |
} } struct dnode *hpfs_alloc_dnode(struct super_block *s, secno near, |
7d23ce36e
|
422 |
dnode_secno *dno, struct quad_buffer_head *qbh) |
1da177e4c
|
423 424 |
{ struct dnode *d; |
2cbe5c76f
|
425 |
if (hpfs_get_free_dnodes(s) > FREE_DNODES_ADD) { |
7d23ce36e
|
426 427 |
if (!(*dno = alloc_in_dirband(s, near))) if (!(*dno = hpfs_alloc_sector(s, near, 4, 0))) return NULL; |
1da177e4c
|
428 |
} else { |
7d23ce36e
|
429 430 |
if (!(*dno = hpfs_alloc_sector(s, near, 4, 0))) if (!(*dno = alloc_in_dirband(s, near))) return NULL; |
1da177e4c
|
431 432 433 434 435 436 |
} if (!(d = hpfs_get_4sectors(s, *dno, qbh))) { hpfs_free_dnode(s, *dno); return NULL; } memset(d, 0, 2048); |
0b69760be
|
437 438 |
d->magic = cpu_to_le32(DNODE_MAGIC); d->first_free = cpu_to_le32(52); |
1da177e4c
|
439 440 441 442 |
d->dirent[0] = 32; d->dirent[2] = 8; d->dirent[30] = 1; d->dirent[31] = 255; |
0b69760be
|
443 |
d->self = cpu_to_le32(*dno); |
1da177e4c
|
444 445 446 447 448 449 450 |
return d; } struct fnode *hpfs_alloc_fnode(struct super_block *s, secno near, fnode_secno *fno, struct buffer_head **bh) { struct fnode *f; |
7d23ce36e
|
451 |
if (!(*fno = hpfs_alloc_sector(s, near, 1, FNODE_ALLOC_FWD))) return NULL; |
1da177e4c
|
452 453 454 455 456 |
if (!(f = hpfs_get_sector(s, *fno, bh))) { hpfs_free_sectors(s, *fno, 1); return NULL; } memset(f, 0, 512); |
0b69760be
|
457 458 |
f->magic = cpu_to_le32(FNODE_MAGIC); f->ea_offs = cpu_to_le16(0xc4); |
1da177e4c
|
459 |
f->btree.n_free_nodes = 8; |
0b69760be
|
460 |
f->btree.first_free = cpu_to_le16(8); |
1da177e4c
|
461 462 463 464 465 466 467 |
return f; } struct anode *hpfs_alloc_anode(struct super_block *s, secno near, anode_secno *ano, struct buffer_head **bh) { struct anode *a; |
7d23ce36e
|
468 |
if (!(*ano = hpfs_alloc_sector(s, near, 1, ANODE_ALLOC_FWD))) return NULL; |
1da177e4c
|
469 470 471 472 473 |
if (!(a = hpfs_get_sector(s, *ano, bh))) { hpfs_free_sectors(s, *ano, 1); return NULL; } memset(a, 0, 512); |
0b69760be
|
474 475 |
a->magic = cpu_to_le32(ANODE_MAGIC); a->self = cpu_to_le32(*ano); |
1da177e4c
|
476 477 |
a->btree.n_free_nodes = 40; a->btree.n_used_nodes = 0; |
0b69760be
|
478 |
a->btree.first_free = cpu_to_le16(8); |
1da177e4c
|
479 480 |
return a; } |
a27b5b97d
|
481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 |
static unsigned find_run(__le32 *bmp, unsigned *idx) { unsigned len; while (tstbits(bmp, *idx, 1)) { (*idx)++; if (unlikely(*idx >= 0x4000)) return 0; } len = 1; while (!tstbits(bmp, *idx + len, 1)) len++; return len; } static int do_trim(struct super_block *s, secno start, unsigned len, secno limit_start, secno limit_end, unsigned minlen, unsigned *result) { int err; secno end; if (fatal_signal_pending(current)) return -EINTR; end = start + len; if (start < limit_start) start = limit_start; if (end > limit_end) end = limit_end; if (start >= end) return 0; if (end - start < minlen) return 0; err = sb_issue_discard(s, start, end - start, GFP_NOFS, 0); if (err) return err; *result += end - start; return 0; } int hpfs_trim_fs(struct super_block *s, u64 start, u64 end, u64 minlen, unsigned *result) { int err = 0; struct hpfs_sb_info *sbi = hpfs_sb(s); unsigned idx, len, start_bmp, end_bmp; __le32 *bmp; struct quad_buffer_head qbh; *result = 0; if (!end || end > sbi->sb_fs_size) end = sbi->sb_fs_size; if (start >= sbi->sb_fs_size) return 0; if (minlen > 0x4000) return 0; if (start < sbi->sb_dirband_start + sbi->sb_dirband_size && end > sbi->sb_dirband_start) { hpfs_lock(s); if (s->s_flags & MS_RDONLY) { err = -EROFS; goto unlock_1; } if (!(bmp = hpfs_map_dnode_bitmap(s, &qbh))) { err = -EIO; goto unlock_1; } idx = 0; while ((len = find_run(bmp, &idx)) && !err) { err = do_trim(s, sbi->sb_dirband_start + idx * 4, len * 4, start, end, minlen, result); idx += len; } hpfs_brelse4(&qbh); unlock_1: hpfs_unlock(s); } start_bmp = start >> 14; end_bmp = (end + 0x3fff) >> 14; while (start_bmp < end_bmp && !err) { hpfs_lock(s); if (s->s_flags & MS_RDONLY) { err = -EROFS; goto unlock_2; } if (!(bmp = hpfs_map_bitmap(s, start_bmp, &qbh, "trim"))) { err = -EIO; goto unlock_2; } idx = 0; while ((len = find_run(bmp, &idx)) && !err) { err = do_trim(s, (start_bmp << 14) + idx, len, start, end, minlen, result); idx += len; } hpfs_brelse4(&qbh); unlock_2: hpfs_unlock(s); start_bmp++; } return err; } |