Blame view
fs/reiserfs/prints.c
20.7 KB
1da177e4c
|
1 2 3 |
/* * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README */ |
1da177e4c
|
4 5 6 7 8 9 10 11 12 13 14 |
#include <linux/time.h> #include <linux/fs.h> #include <linux/reiserfs_fs.h> #include <linux/string.h> #include <linux/buffer_head.h> #include <stdarg.h> static char error_buf[1024]; static char fmt_buf[1024]; static char off_buf[80]; |
bd4c625c0
|
15 |
static char *reiserfs_cpu_offset(struct cpu_key *key) |
1da177e4c
|
16 |
{ |
bd4c625c0
|
17 18 19 20 21 22 23 24 25 26 |
if (cpu_key_k_type(key) == TYPE_DIRENTRY) sprintf(off_buf, "%Lu(%Lu)", (unsigned long long) GET_HASH_VALUE(cpu_key_k_offset(key)), (unsigned long long) GET_GENERATION_NUMBER(cpu_key_k_offset(key))); else sprintf(off_buf, "0x%Lx", (unsigned long long)cpu_key_k_offset(key)); return off_buf; |
1da177e4c
|
27 |
} |
bd4c625c0
|
28 |
static char *le_offset(struct reiserfs_key *key) |
1da177e4c
|
29 |
{ |
bd4c625c0
|
30 |
int version; |
1da177e4c
|
31 |
|
bd4c625c0
|
32 33 34 35 36 37 38 39 40 41 42 |
version = le_key_version(key); if (le_key_k_type(version, key) == TYPE_DIRENTRY) sprintf(off_buf, "%Lu(%Lu)", (unsigned long long) GET_HASH_VALUE(le_key_k_offset(version, key)), (unsigned long long) GET_GENERATION_NUMBER(le_key_k_offset(version, key))); else sprintf(off_buf, "0x%Lx", (unsigned long long)le_key_k_offset(version, key)); return off_buf; |
1da177e4c
|
43 |
} |
bd4c625c0
|
44 |
static char *cpu_type(struct cpu_key *key) |
1da177e4c
|
45 |
{ |
bd4c625c0
|
46 47 48 49 50 51 52 53 54 |
if (cpu_key_k_type(key) == TYPE_STAT_DATA) return "SD"; if (cpu_key_k_type(key) == TYPE_DIRENTRY) return "DIR"; if (cpu_key_k_type(key) == TYPE_DIRECT) return "DIRECT"; if (cpu_key_k_type(key) == TYPE_INDIRECT) return "IND"; return "UNKNOWN"; |
1da177e4c
|
55 |
} |
bd4c625c0
|
56 |
static char *le_type(struct reiserfs_key *key) |
1da177e4c
|
57 |
{ |
bd4c625c0
|
58 |
int version; |
1da177e4c
|
59 |
|
bd4c625c0
|
60 |
version = le_key_version(key); |
1da177e4c
|
61 |
|
bd4c625c0
|
62 63 64 65 66 67 68 69 70 71 |
if (le_key_k_type(version, key) == TYPE_STAT_DATA) return "SD"; if (le_key_k_type(version, key) == TYPE_DIRENTRY) return "DIR"; if (le_key_k_type(version, key) == TYPE_DIRECT) return "DIRECT"; if (le_key_k_type(version, key) == TYPE_INDIRECT) return "IND"; return "UNKNOWN"; } |
1da177e4c
|
72 73 |
/* %k */ |
bd4c625c0
|
74 |
static void sprintf_le_key(char *buf, struct reiserfs_key *key) |
1da177e4c
|
75 |
{ |
bd4c625c0
|
76 77 78 79 80 81 |
if (key) sprintf(buf, "[%d %d %s %s]", le32_to_cpu(key->k_dir_id), le32_to_cpu(key->k_objectid), le_offset(key), le_type(key)); else sprintf(buf, "[NULL]"); |
1da177e4c
|
82 |
} |
1da177e4c
|
83 |
/* %K */ |
bd4c625c0
|
84 |
static void sprintf_cpu_key(char *buf, struct cpu_key *key) |
1da177e4c
|
85 |
{ |
bd4c625c0
|
86 87 88 89 90 91 |
if (key) sprintf(buf, "[%d %d %s %s]", key->on_disk_key.k_dir_id, key->on_disk_key.k_objectid, reiserfs_cpu_offset(key), cpu_type(key)); else sprintf(buf, "[NULL]"); |
1da177e4c
|
92 |
} |
bd4c625c0
|
93 |
static void sprintf_de_head(char *buf, struct reiserfs_de_head *deh) |
1da177e4c
|
94 |
{ |
bd4c625c0
|
95 96 97 98 99 100 101 |
if (deh) sprintf(buf, "[offset=%d dir_id=%d objectid=%d location=%d state=%04x]", deh_offset(deh), deh_dir_id(deh), deh_objectid(deh), deh_location(deh), deh_state(deh)); else sprintf(buf, "[NULL]"); |
1da177e4c
|
102 103 |
} |
bd4c625c0
|
104 |
static void sprintf_item_head(char *buf, struct item_head *ih) |
1da177e4c
|
105 |
{ |
bd4c625c0
|
106 107 108 109 110 111 112 113 114 |
if (ih) { strcpy(buf, (ih_version(ih) == KEY_FORMAT_3_6) ? "*3.6* " : "*3.5*"); sprintf_le_key(buf + strlen(buf), &(ih->ih_key)); sprintf(buf + strlen(buf), ", item_len %d, item_location %d, " "free_space(entry_count) %d", ih_item_len(ih), ih_location(ih), ih_free_space(ih)); } else sprintf(buf, "[NULL]"); |
1da177e4c
|
115 |
} |
bd4c625c0
|
116 |
static void sprintf_direntry(char *buf, struct reiserfs_dir_entry *de) |
1da177e4c
|
117 |
{ |
bd4c625c0
|
118 |
char name[20]; |
1da177e4c
|
119 |
|
bd4c625c0
|
120 121 122 |
memcpy(name, de->de_name, de->de_namelen > 19 ? 19 : de->de_namelen); name[de->de_namelen > 19 ? 19 : de->de_namelen] = 0; sprintf(buf, "\"%s\"==>[%d %d]", name, de->de_dir_id, de->de_objectid); |
1da177e4c
|
123 |
} |
bd4c625c0
|
124 |
static void sprintf_block_head(char *buf, struct buffer_head *bh) |
1da177e4c
|
125 |
{ |
bd4c625c0
|
126 127 |
sprintf(buf, "level=%d, nr_items=%d, free_space=%d rdkey ", B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); |
1da177e4c
|
128 |
} |
bd4c625c0
|
129 |
static void sprintf_buffer_head(char *buf, struct buffer_head *bh) |
1da177e4c
|
130 |
{ |
bd4c625c0
|
131 |
char b[BDEVNAME_SIZE]; |
1da177e4c
|
132 |
|
bd4c625c0
|
133 |
sprintf(buf, |
205f87f6b
|
134 |
"dev %s, size %zd, blocknr %llu, count %d, state 0x%lx, page %p, (%s, %s, %s)", |
bd4c625c0
|
135 136 137 138 139 140 |
bdevname(bh->b_bdev, b), bh->b_size, (unsigned long long)bh->b_blocknr, atomic_read(&(bh->b_count)), bh->b_state, bh->b_page, buffer_uptodate(bh) ? "UPTODATE" : "!UPTODATE", buffer_dirty(bh) ? "DIRTY" : "CLEAN", buffer_locked(bh) ? "LOCKED" : "UNLOCKED"); |
1da177e4c
|
141 |
} |
bd4c625c0
|
142 |
static void sprintf_disk_child(char *buf, struct disk_child *dc) |
1da177e4c
|
143 |
{ |
bd4c625c0
|
144 145 |
sprintf(buf, "[dc_number=%d, dc_size=%u]", dc_block_number(dc), dc_size(dc)); |
1da177e4c
|
146 |
} |
cacbe3d7a
|
147 |
static char *is_there_reiserfs_struct(char *fmt, int *what) |
1da177e4c
|
148 |
{ |
bd4c625c0
|
149 |
char *k = fmt; |
1da177e4c
|
150 |
|
bd4c625c0
|
151 152 153 154 155 156 |
while ((k = strchr(k, '%')) != NULL) { if (k[1] == 'k' || k[1] == 'K' || k[1] == 'h' || k[1] == 't' || k[1] == 'z' || k[1] == 'b' || k[1] == 'y' || k[1] == 'a') { *what = k[1]; break; } |
bd4c625c0
|
157 158 159 160 |
k++; } return k; } |
1da177e4c
|
161 162 163 164 165 166 167 |
/* debugging reiserfs we used to print out a lot of different variables, like keys, item headers, buffer heads etc. Values of most fields matter. So it took a long time just to write appropriative printk. With this reiserfs_warning you can use format specification for complex structures like you used to do with printfs for integers, doubles and pointers. For instance, to print |
0222e6571
|
168 169 170 171 172 |
out key structure you have to write just: reiserfs_warning ("bad key %k", key); instead of printk ("bad key %lu %lu %lu %lu", key->k_dir_id, key->k_objectid, key->k_offset, key->k_uniqueness); |
1da177e4c
|
173 |
*/ |
78b6513d2
|
174 |
static DEFINE_SPINLOCK(error_lock); |
bd4c625c0
|
175 176 177 178 179 |
static void prepare_error_buf(const char *fmt, va_list args) { char *fmt1 = fmt_buf; char *k; char *p = error_buf; |
cacbe3d7a
|
180 |
int what; |
bd4c625c0
|
181 |
|
78b6513d2
|
182 |
spin_lock(&error_lock); |
bd4c625c0
|
183 |
strcpy(fmt1, fmt); |
cacbe3d7a
|
184 |
while ((k = is_there_reiserfs_struct(fmt1, &what)) != NULL) { |
bd4c625c0
|
185 186 187 |
*k = 0; p += vsprintf(p, fmt1, args); |
bd4c625c0
|
188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 |
switch (what) { case 'k': sprintf_le_key(p, va_arg(args, struct reiserfs_key *)); break; case 'K': sprintf_cpu_key(p, va_arg(args, struct cpu_key *)); break; case 'h': sprintf_item_head(p, va_arg(args, struct item_head *)); break; case 't': sprintf_direntry(p, va_arg(args, struct reiserfs_dir_entry *)); break; case 'y': sprintf_disk_child(p, va_arg(args, struct disk_child *)); break; case 'z': sprintf_block_head(p, va_arg(args, struct buffer_head *)); break; case 'b': sprintf_buffer_head(p, va_arg(args, struct buffer_head *)); break; case 'a': sprintf_de_head(p, va_arg(args, struct reiserfs_de_head *)); break; } p += strlen(p); fmt1 = k + 2; } vsprintf(p, fmt1, args); |
78b6513d2
|
226 |
spin_unlock(&error_lock); |
1da177e4c
|
227 228 |
} |
1da177e4c
|
229 |
/* in addition to usual conversion specifiers this accepts reiserfs |
0222e6571
|
230 231 232 |
specific conversion specifiers: %k to print little endian key, %K to print cpu key, |
1da177e4c
|
233 |
%h to print item_head, |
0222e6571
|
234 |
%t to print directory entry |
1da177e4c
|
235 236 237 238 239 240 241 242 243 244 245 |
%z to print block head (arg must be struct buffer_head * %b to print buffer_head */ #define do_reiserfs_warning(fmt)\ {\ va_list args;\ va_start( args, fmt );\ prepare_error_buf( fmt, args );\ va_end( args );\ } |
45b03d5e8
|
246 247 |
void __reiserfs_warning(struct super_block *sb, const char *id, const char *function, const char *fmt, ...) |
1da177e4c
|
248 |
{ |
bd4c625c0
|
249 250 |
do_reiserfs_warning(fmt); if (sb) |
45b03d5e8
|
251 252 253 254 |
printk(KERN_WARNING "REISERFS warning (device %s): %s%s%s: " "%s ", sb->s_id, id ? id : "", id ? " " : "", function, error_buf); |
bd4c625c0
|
255 |
else |
45b03d5e8
|
256 257 258 |
printk(KERN_WARNING "REISERFS warning: %s%s%s: %s ", id ? id : "", id ? " " : "", function, error_buf); |
1da177e4c
|
259 260 261 |
} /* No newline.. reiserfs_info calls can be followed by printk's */ |
bd4c625c0
|
262 |
void reiserfs_info(struct super_block *sb, const char *fmt, ...) |
1da177e4c
|
263 |
{ |
bd4c625c0
|
264 265 |
do_reiserfs_warning(fmt); if (sb) |
a5437152e
|
266 267 |
printk(KERN_NOTICE "REISERFS (device %s): %s", sb->s_id, error_buf); |
bd4c625c0
|
268 |
else |
a5437152e
|
269 |
printk(KERN_NOTICE "REISERFS %s:", error_buf); |
1da177e4c
|
270 271 272 |
} /* No newline.. reiserfs_printk calls can be followed by printk's */ |
bd4c625c0
|
273 |
static void reiserfs_printk(const char *fmt, ...) |
1da177e4c
|
274 |
{ |
bd4c625c0
|
275 276 |
do_reiserfs_warning(fmt); printk(error_buf); |
1da177e4c
|
277 |
} |
bd4c625c0
|
278 |
void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...) |
1da177e4c
|
279 280 |
{ #ifdef CONFIG_REISERFS_CHECK |
bd4c625c0
|
281 282 |
do_reiserfs_warning(fmt); if (s) |
a5437152e
|
283 284 285 |
printk(KERN_DEBUG "REISERFS debug (device %s): %s ", s->s_id, error_buf); |
bd4c625c0
|
286 |
else |
a5437152e
|
287 288 |
printk(KERN_DEBUG "REISERFS debug: %s ", error_buf); |
1da177e4c
|
289 290 291 292 293 294 295 296 297 298 299 300 |
#endif } /* The format: maintainer-errorid: [function-name:] message where errorid is unique to the maintainer and function-name is optional, is recommended, so that anyone can easily find the bug with a simple grep for the short to type string maintainer-errorid. Don't bother with reusing errorids, there are lots of numbers out there. |
0222e6571
|
301 |
Example: |
1da177e4c
|
302 303 304 |
reiserfs_panic( p_sb, "reiser-29: reiserfs_new_blocknrs: " "one of search_start or rn(%d) is equal to MAX_B_NUM," |
0222e6571
|
305 |
"which means that we are optimizing location based on the bogus location of a temp buffer (%p).", |
1da177e4c
|
306 307 308 309 |
rn, bh ); Regular panic()s sometimes clear the screen before the message can |
0222e6571
|
310 |
be read, thus the need for the while loop. |
1da177e4c
|
311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 |
Numbering scheme for panic used by Vladimir and Anatoly( Hans completely ignores this scheme, and considers it pointless complexity): panics in reiserfs_fs.h have numbers from 1000 to 1999 super.c 2000 to 2999 preserve.c (unused) 3000 to 3999 bitmap.c 4000 to 4999 stree.c 5000 to 5999 prints.c 6000 to 6999 namei.c 7000 to 7999 fix_nodes.c 8000 to 8999 dir.c 9000 to 9999 lbalance.c 10000 to 10999 ibalance.c 11000 to 11999 not ready do_balan.c 12000 to 12999 inode.c 13000 to 13999 file.c 14000 to 14999 objectid.c 15000 - 15999 buffer.c 16000 - 16999 symlink.c 17000 - 17999 . */ |
c3a9c2109
|
334 335 |
void __reiserfs_panic(struct super_block *sb, const char *id, const char *function, const char *fmt, ...) |
1da177e4c
|
336 |
{ |
bd4c625c0
|
337 |
do_reiserfs_warning(fmt); |
1da177e4c
|
338 |
|
c3a9c2109
|
339 |
#ifdef CONFIG_REISERFS_CHECK |
8e186e454
|
340 |
dump_stack(); |
c3a9c2109
|
341 342 343 344 345 346 347 348 349 350 |
#endif if (sb) panic(KERN_WARNING "REISERFS panic (device %s): %s%s%s: %s ", sb->s_id, id ? id : "", id ? " " : "", function, error_buf); else panic(KERN_WARNING "REISERFS panic: %s%s%s: %s ", id ? id : "", id ? " " : "", function, error_buf); |
1da177e4c
|
351 |
} |
1e5e59d43
|
352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 |
void __reiserfs_error(struct super_block *sb, const char *id, const char *function, const char *fmt, ...) { do_reiserfs_warning(fmt); BUG_ON(sb == NULL); if (reiserfs_error_panic(sb)) __reiserfs_panic(sb, id, function, error_buf); if (id && id[0]) printk(KERN_CRIT "REISERFS error (device %s): %s %s: %s ", sb->s_id, id, function, error_buf); else printk(KERN_CRIT "REISERFS error (device %s): %s: %s ", sb->s_id, function, error_buf); if (sb->s_flags & MS_RDONLY) return; reiserfs_info(sb, "Remounting filesystem read-only "); sb->s_flags |= MS_RDONLY; reiserfs_abort_journal(sb, -EIO); } |
bd4c625c0
|
379 |
void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...) |
1da177e4c
|
380 |
{ |
bd4c625c0
|
381 |
do_reiserfs_warning(fmt); |
1da177e4c
|
382 |
|
bd4c625c0
|
383 |
if (reiserfs_error_panic(sb)) { |
a5437152e
|
384 385 386 |
panic(KERN_CRIT "REISERFS panic (device %s): %s ", sb->s_id, error_buf); |
bd4c625c0
|
387 |
} |
1da177e4c
|
388 |
|
a5437152e
|
389 |
if (reiserfs_is_journal_aborted(SB_JOURNAL(sb))) |
bd4c625c0
|
390 |
return; |
1da177e4c
|
391 |
|
a5437152e
|
392 393 394 |
printk(KERN_CRIT "REISERFS abort (device %s): %s ", sb->s_id, error_buf); |
1da177e4c
|
395 |
|
bd4c625c0
|
396 |
sb->s_flags |= MS_RDONLY; |
32e8b1062
|
397 |
reiserfs_abort_journal(sb, errno); |
1da177e4c
|
398 399 400 401 402 |
} /* this prints internal nodes (4 keys/items in line) (dc_number, dc_size)[k_dirid, k_objectid, k_offset, k_uniqueness](dc_number, dc_size)...*/ |
bd4c625c0
|
403 |
static int print_internal(struct buffer_head *bh, int first, int last) |
1da177e4c
|
404 |
{ |
bd4c625c0
|
405 406 407 408 |
struct reiserfs_key *key; struct disk_child *dc; int i; int from, to; |
1da177e4c
|
409 |
|
bd4c625c0
|
410 411 |
if (!B_IS_KEYS_LEVEL(bh)) return 1; |
1da177e4c
|
412 |
|
bd4c625c0
|
413 |
check_internal(bh); |
1da177e4c
|
414 |
|
bd4c625c0
|
415 416 417 418 419 420 421 |
if (first == -1) { from = 0; to = B_NR_ITEMS(bh); } else { from = first; to = last < B_NR_ITEMS(bh) ? last : B_NR_ITEMS(bh); } |
1da177e4c
|
422 |
|
bd4c625c0
|
423 424 |
reiserfs_printk("INTERNAL NODE (%ld) contains %z ", bh->b_blocknr, bh); |
1da177e4c
|
425 |
|
bd4c625c0
|
426 427 |
dc = B_N_CHILD(bh, from); reiserfs_printk("PTR %d: %y ", from, dc); |
1da177e4c
|
428 |
|
bd4c625c0
|
429 430 431 432 433 434 435 436 437 438 439 |
for (i = from, key = B_N_PDELIM_KEY(bh, from), dc++; i < to; i++, key++, dc++) { reiserfs_printk("KEY %d: %k PTR %d: %y ", i, key, i + 1, dc); if (i && i % 4 == 0) printk(" "); } printk(" "); return 0; } |
1da177e4c
|
440 |
|
bd4c625c0
|
441 442 443 444 445 446 447 |
static int print_leaf(struct buffer_head *bh, int print_mode, int first, int last) { struct block_head *blkh; struct item_head *ih; int i, nr; int from, to; |
1da177e4c
|
448 |
|
bd4c625c0
|
449 450 |
if (!B_IS_ITEMS_LEVEL(bh)) return 1; |
1da177e4c
|
451 |
|
bd4c625c0
|
452 |
check_leaf(bh); |
1da177e4c
|
453 |
|
bd4c625c0
|
454 455 456 |
blkh = B_BLK_HEAD(bh); ih = B_N_PITEM_HEAD(bh, 0); nr = blkh_nr_item(blkh); |
1da177e4c
|
457 |
|
bd4c625c0
|
458 459 460 461 462 463 |
printk (" =================================================================== "); reiserfs_printk("LEAF NODE (%ld) contains %z ", bh->b_blocknr, bh); |
1da177e4c
|
464 |
|
bd4c625c0
|
465 466 467 468 469 470 |
if (!(print_mode & PRINT_LEAF_ITEMS)) { reiserfs_printk("FIRST ITEM_KEY: %k, LAST ITEM KEY: %k ", &(ih->ih_key), &((ih + nr - 1)->ih_key)); return 0; } |
1da177e4c
|
471 |
|
bd4c625c0
|
472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 |
if (first < 0 || first > nr - 1) from = 0; else from = first; if (last < 0 || last > nr) to = nr; else to = last; ih += from; printk ("------------------------------------------------------------------------------- "); printk ("|##| type | key | ilen | free_space | version | loc | "); for (i = from; i < to; i++, ih++) { printk ("------------------------------------------------------------------------------- "); reiserfs_printk("|%2d| %h | ", i, ih); if (print_mode & PRINT_LEAF_ITEMS) op_print_item(ih, B_I_PITEM(bh, ih)); } |
1da177e4c
|
498 |
|
bd4c625c0
|
499 500 501 |
printk ("=================================================================== "); |
1da177e4c
|
502 |
|
bd4c625c0
|
503 |
return 0; |
1da177e4c
|
504 |
} |
bd4c625c0
|
505 |
char *reiserfs_hashname(int code) |
1da177e4c
|
506 |
{ |
bd4c625c0
|
507 508 509 510 511 512 |
if (code == YURA_HASH) return "rupasov"; if (code == TEA_HASH) return "tea"; if (code == R5_HASH) return "r5"; |
1da177e4c
|
513 |
|
bd4c625c0
|
514 |
return "unknown"; |
1da177e4c
|
515 516 517 |
} /* return 1 if this is not super block */ |
bd4c625c0
|
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 |
static int print_super_block(struct buffer_head *bh) { struct reiserfs_super_block *rs = (struct reiserfs_super_block *)(bh->b_data); int skipped, data_blocks; char *version; char b[BDEVNAME_SIZE]; if (is_reiserfs_3_5(rs)) { version = "3.5"; } else if (is_reiserfs_3_6(rs)) { version = "3.6"; } else if (is_reiserfs_jr(rs)) { version = ((sb_version(rs) == REISERFS_VERSION_2) ? "3.6" : "3.5"); } else { return 1; } printk("%s\'s super block is in block %llu ", bdevname(bh->b_bdev, b), (unsigned long long)bh->b_blocknr); printk("Reiserfs version %s ", version); printk("Block count %u ", sb_block_count(rs)); printk("Blocksize %d ", sb_blocksize(rs)); printk("Free blocks %u ", sb_free_blocks(rs)); // FIXME: this would be confusing if // someone stores reiserfs super block in some data block ;) |
1da177e4c
|
550 |
// skipped = (bh->b_blocknr * bh->b_size) / sb_blocksize(rs); |
bd4c625c0
|
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 576 577 578 |
skipped = bh->b_blocknr; data_blocks = sb_block_count(rs) - skipped - 1 - sb_bmap_nr(rs) - (!is_reiserfs_jr(rs) ? sb_jp_journal_size(rs) + 1 : sb_reserved_for_journal(rs)) - sb_free_blocks(rs); printk ("Busy blocks (skipped %d, bitmaps - %d, journal (or reserved) blocks - %d " "1 super block, %d data blocks ", skipped, sb_bmap_nr(rs), (!is_reiserfs_jr(rs) ? (sb_jp_journal_size(rs) + 1) : sb_reserved_for_journal(rs)), data_blocks); printk("Root block %u ", sb_root_block(rs)); printk("Journal block (first) %d ", sb_jp_journal_1st_block(rs)); printk("Journal dev %d ", sb_jp_journal_dev(rs)); printk("Journal orig size %d ", sb_jp_journal_size(rs)); printk("FS state %d ", sb_fs_state(rs)); printk("Hash function \"%s\" ", reiserfs_hashname(sb_hash_function_code(rs))); printk("Tree height %d ", sb_tree_height(rs)); return 0; |
1da177e4c
|
579 |
} |
bd4c625c0
|
580 |
static int print_desc_block(struct buffer_head *bh) |
1da177e4c
|
581 |
{ |
bd4c625c0
|
582 |
struct reiserfs_journal_desc *desc; |
1da177e4c
|
583 |
|
bd4c625c0
|
584 585 |
if (memcmp(get_journal_desc_magic(bh), JOURNAL_DESC_MAGIC, 8)) return 1; |
1da177e4c
|
586 |
|
bd4c625c0
|
587 588 589 590 |
desc = (struct reiserfs_journal_desc *)(bh->b_data); printk("Desc block %llu (j_trans_id %d, j_mount_id %d, j_len %d)", (unsigned long long)bh->b_blocknr, get_desc_trans_id(desc), get_desc_mount_id(desc), get_desc_trans_len(desc)); |
1da177e4c
|
591 |
|
bd4c625c0
|
592 |
return 0; |
1da177e4c
|
593 |
} |
bd4c625c0
|
594 |
void print_block(struct buffer_head *bh, ...) //int print_mode, int first, int last) |
1da177e4c
|
595 |
{ |
bd4c625c0
|
596 597 |
va_list args; int mode, first, last; |
1da177e4c
|
598 |
|
bd4c625c0
|
599 600 601 602 603 |
if (!bh) { printk("print_block: buffer is NULL "); return; } |
1da177e4c
|
604 |
|
566538a6c
|
605 |
va_start(args, bh); |
bd4c625c0
|
606 607 608 609 610 611 612 613 614 615 616 |
mode = va_arg(args, int); first = va_arg(args, int); last = va_arg(args, int); if (print_leaf(bh, mode, first, last)) if (print_internal(bh, first, last)) if (print_super_block(bh)) if (print_desc_block(bh)) printk ("Block %llu contains unformatted data ", (unsigned long long)bh->b_blocknr); |
774ed22c2
|
617 618 |
va_end(args); |
1da177e4c
|
619 |
} |
1da177e4c
|
620 621 622 |
static char print_tb_buf[2048]; /* this stores initial state of tree balance in the print_tb_buf */ |
bd4c625c0
|
623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 |
void store_print_tb(struct tree_balance *tb) { int h = 0; int i; struct buffer_head *tbSh, *tbFh; if (!tb) return; sprintf(print_tb_buf, " " "BALANCING %d " "MODE=%c, ITEM_POS=%d POS_IN_ITEM=%d " "===================================================================== " "* h * S * L * R * F * FL * FR * CFL * CFR * ", REISERFS_SB(tb->tb_sb)->s_do_balance, tb->tb_mode, PATH_LAST_POSITION(tb->tb_path), tb->tb_path->pos_in_item); |
e8c96f8c2
|
645 |
for (h = 0; h < ARRAY_SIZE(tb->insert_size); h++) { |
bd4c625c0
|
646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 |
if (PATH_H_PATH_OFFSET(tb->tb_path, h) <= tb->tb_path->path_length && PATH_H_PATH_OFFSET(tb->tb_path, h) > ILLEGAL_PATH_ELEMENT_OFFSET) { tbSh = PATH_H_PBUFFER(tb->tb_path, h); tbFh = PATH_H_PPARENT(tb->tb_path, h); } else { tbSh = NULL; tbFh = NULL; } sprintf(print_tb_buf + strlen(print_tb_buf), "* %d * %3lld(%2d) * %3lld(%2d) * %3lld(%2d) * %5lld * %5lld * %5lld * %5lld * %5lld * ", h, (tbSh) ? (long long)(tbSh->b_blocknr) : (-1LL), (tbSh) ? atomic_read(&(tbSh->b_count)) : -1, (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr) : (-1LL), (tb->L[h]) ? atomic_read(&(tb->L[h]->b_count)) : -1, (tb->R[h]) ? (long long)(tb->R[h]->b_blocknr) : (-1LL), (tb->R[h]) ? atomic_read(&(tb->R[h]->b_count)) : -1, (tbFh) ? (long long)(tbFh->b_blocknr) : (-1LL), (tb->FL[h]) ? (long long)(tb->FL[h]-> b_blocknr) : (-1LL), (tb->FR[h]) ? (long long)(tb->FR[h]-> b_blocknr) : (-1LL), (tb->CFL[h]) ? (long long)(tb->CFL[h]-> b_blocknr) : (-1LL), (tb->CFR[h]) ? (long long)(tb->CFR[h]-> b_blocknr) : (-1LL)); |
1da177e4c
|
675 |
} |
1da177e4c
|
676 |
|
bd4c625c0
|
677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 |
sprintf(print_tb_buf + strlen(print_tb_buf), "===================================================================== " "* h * size * ln * lb * rn * rb * blkn * s0 * s1 * s1b * s2 * s2b * curb * lk * rk * " "* 0 * %4d * %2d * %2d * %2d * %2d * %4d * %2d * %2d * %3d * %2d * %3d * %4d * %2d * %2d * ", tb->insert_size[0], tb->lnum[0], tb->lbytes, tb->rnum[0], tb->rbytes, tb->blknum[0], tb->s0num, tb->s1num, tb->s1bytes, tb->s2num, tb->s2bytes, tb->cur_blknum, tb->lkey[0], tb->rkey[0]); /* this prints balance parameters for non-leaf levels */ h = 0; do { h++; sprintf(print_tb_buf + strlen(print_tb_buf), "* %d * %4d * %2d * * %2d * * %2d * ", h, tb->insert_size[h], tb->lnum[h], tb->rnum[h], tb->blknum[h]); } while (tb->insert_size[h]); |
1da177e4c
|
699 |
|
bd4c625c0
|
700 701 702 703 |
sprintf(print_tb_buf + strlen(print_tb_buf), "===================================================================== " "FEB list: "); |
1da177e4c
|
704 |
|
bd4c625c0
|
705 706 |
/* print FEB list (list of buffers in form (bh (b_blocknr, b_count), that will be used for new nodes) */ h = 0; |
e8c96f8c2
|
707 |
for (i = 0; i < ARRAY_SIZE(tb->FEB); i++) |
bd4c625c0
|
708 709 710 711 712 |
sprintf(print_tb_buf + strlen(print_tb_buf), "%p (%llu %d)%s", tb->FEB[i], tb->FEB[i] ? (unsigned long long)tb->FEB[i]-> b_blocknr : 0ULL, tb->FEB[i] ? atomic_read(&(tb->FEB[i]->b_count)) : 0, |
e8c96f8c2
|
713 714 |
(i == ARRAY_SIZE(tb->FEB) - 1) ? " " : ", "); |
1da177e4c
|
715 |
|
bd4c625c0
|
716 717 718 |
sprintf(print_tb_buf + strlen(print_tb_buf), "======================== the end ==================================== "); |
1da177e4c
|
719 |
} |
bd4c625c0
|
720 721 722 723 724 |
void print_cur_tb(char *mes) { printk("%s %s", mes, print_tb_buf); } |
1da177e4c
|
725 |
|
bd4c625c0
|
726 |
static void check_leaf_block_head(struct buffer_head *bh) |
1da177e4c
|
727 |
{ |
bd4c625c0
|
728 729 730 731 732 733 |
struct block_head *blkh; int nr; blkh = B_BLK_HEAD(bh); nr = blkh_nr_item(blkh); if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE) |
c3a9c2109
|
734 |
reiserfs_panic(NULL, "vs-6010", "invalid item number %z", |
bd4c625c0
|
735 736 |
bh); if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr) |
c3a9c2109
|
737 |
reiserfs_panic(NULL, "vs-6020", "invalid free space %z", |
bd4c625c0
|
738 |
bh); |
1da177e4c
|
739 |
|
1da177e4c
|
740 |
} |
bd4c625c0
|
741 742 743 744 745 746 |
static void check_internal_block_head(struct buffer_head *bh) { struct block_head *blkh; blkh = B_BLK_HEAD(bh); if (!(B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL(bh) <= MAX_HEIGHT)) |
c3a9c2109
|
747 |
reiserfs_panic(NULL, "vs-6025", "invalid level %z", bh); |
bd4c625c0
|
748 749 |
if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) |
c3a9c2109
|
750 |
reiserfs_panic(NULL, "vs-6030", "invalid item number %z", bh); |
bd4c625c0
|
751 752 753 754 |
if (B_FREE_SPACE(bh) != bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - DC_SIZE * (B_NR_ITEMS(bh) + 1)) |
c3a9c2109
|
755 |
reiserfs_panic(NULL, "vs-6040", "invalid free space %z", bh); |
bd4c625c0
|
756 757 |
} |
1da177e4c
|
758 |
|
bd4c625c0
|
759 |
void check_leaf(struct buffer_head *bh) |
1da177e4c
|
760 |
{ |
bd4c625c0
|
761 762 763 764 765 766 767 768 |
int i; struct item_head *ih; if (!bh) return; check_leaf_block_head(bh); for (i = 0, ih = B_N_PITEM_HEAD(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) op_check_item(ih, B_I_PITEM(bh, ih)); |
1da177e4c
|
769 |
} |
bd4c625c0
|
770 771 772 773 774 775 |
void check_internal(struct buffer_head *bh) { if (!bh) return; check_internal_block_head(bh); } |
1da177e4c
|
776 |
|
bd4c625c0
|
777 |
void print_statistics(struct super_block *s) |
1da177e4c
|
778 |
{ |
bd4c625c0
|
779 780 781 782 783 784 785 786 |
/* printk ("reiserfs_put_super: session statistics: balances %d, fix_nodes %d, \ bmap with search %d, without %d, dir2ind %d, ind2dir %d ", REISERFS_SB(s)->s_do_balance, REISERFS_SB(s)->s_fix_nodes, REISERFS_SB(s)->s_bmaps, REISERFS_SB(s)->s_bmaps_without_search, REISERFS_SB(s)->s_direct2indirect, REISERFS_SB(s)->s_indirect2direct); */ |
1da177e4c
|
787 788 |
} |