2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
5 #include <linux/config.h>
6 #include <linux/time.h>
8 #include <linux/reiserfs_fs.h>
9 #include <linux/string.h>
10 #include <linux/buffer_head.h>
14 static char error_buf[1024];
15 static char fmt_buf[1024];
16 static char off_buf[80];
19 static char * reiserfs_cpu_offset (struct cpu_key * key)
21 if (cpu_key_k_type(key) == TYPE_DIRENTRY)
22 sprintf (off_buf, "%Lu(%Lu)",
23 (unsigned long long)GET_HASH_VALUE (cpu_key_k_offset (key)),
24 (unsigned long long)GET_GENERATION_NUMBER (cpu_key_k_offset (key)));
26 sprintf (off_buf, "0x%Lx", (unsigned long long)cpu_key_k_offset (key));
31 static char * le_offset (struct reiserfs_key * key)
35 version = le_key_version (key);
36 if (le_key_k_type (version, key) == TYPE_DIRENTRY)
37 sprintf (off_buf, "%Lu(%Lu)",
38 (unsigned long long)GET_HASH_VALUE (le_key_k_offset (version, key)),
39 (unsigned long long)GET_GENERATION_NUMBER (le_key_k_offset (version, key)));
41 sprintf (off_buf, "0x%Lx", (unsigned long long)le_key_k_offset (version, key));
46 static char * cpu_type (struct cpu_key * key)
48 if (cpu_key_k_type (key) == TYPE_STAT_DATA)
50 if (cpu_key_k_type (key) == TYPE_DIRENTRY)
52 if (cpu_key_k_type (key) == TYPE_DIRECT)
54 if (cpu_key_k_type (key) == TYPE_INDIRECT)
60 static char * le_type (struct reiserfs_key * key)
64 version = le_key_version (key);
66 if (le_key_k_type (version, key) == TYPE_STAT_DATA)
68 if (le_key_k_type (version, key) == TYPE_DIRENTRY)
70 if (le_key_k_type (version, key) == TYPE_DIRECT)
72 if (le_key_k_type (version, key) == TYPE_INDIRECT)
79 static void sprintf_le_key (char * buf, struct reiserfs_key * key)
82 sprintf (buf, "[%d %d %s %s]", le32_to_cpu (key->k_dir_id),
83 le32_to_cpu (key->k_objectid), le_offset (key), le_type (key));
85 sprintf (buf, "[NULL]");
90 static void sprintf_cpu_key (char * buf, struct cpu_key * key)
93 sprintf (buf, "[%d %d %s %s]", key->on_disk_key.k_dir_id,
94 key->on_disk_key.k_objectid, reiserfs_cpu_offset (key),
97 sprintf (buf, "[NULL]");
100 static void sprintf_de_head( char *buf, struct reiserfs_de_head *deh )
103 sprintf( buf, "[offset=%d dir_id=%d objectid=%d location=%d state=%04x]", deh_offset(deh), deh_dir_id(deh),
104 deh_objectid(deh), deh_location(deh), deh_state(deh) );
106 sprintf( buf, "[NULL]" );
110 static void sprintf_item_head (char * buf, struct item_head * ih)
113 strcpy (buf, (ih_version (ih) == KEY_FORMAT_3_6) ? "*3.6* " : "*3.5*");
114 sprintf_le_key (buf + strlen (buf), &(ih->ih_key));
115 sprintf (buf + strlen (buf), ", item_len %d, item_location %d, "
116 "free_space(entry_count) %d",
117 ih_item_len(ih), ih_location(ih), ih_free_space (ih));
119 sprintf (buf, "[NULL]");
123 static void sprintf_direntry (char * buf, struct reiserfs_dir_entry * de)
127 memcpy (name, de->de_name, de->de_namelen > 19 ? 19 : de->de_namelen);
128 name [de->de_namelen > 19 ? 19 : de->de_namelen] = 0;
129 sprintf (buf, "\"%s\"==>[%d %d]", name, de->de_dir_id, de->de_objectid);
133 static void sprintf_block_head (char * buf, struct buffer_head * bh)
135 sprintf (buf, "level=%d, nr_items=%d, free_space=%d rdkey ",
136 B_LEVEL (bh), B_NR_ITEMS (bh), B_FREE_SPACE (bh));
140 static void sprintf_buffer_head (char * buf, struct buffer_head * bh)
142 char b[BDEVNAME_SIZE];
144 sprintf (buf, "dev %s, size %d, blocknr %llu, count %d, state 0x%lx, page %p, (%s, %s, %s)",
145 bdevname (bh->b_bdev, b), bh->b_size,
146 (unsigned long long)bh->b_blocknr,
147 atomic_read (&(bh->b_count)),
148 bh->b_state, bh->b_page,
149 buffer_uptodate (bh) ? "UPTODATE" : "!UPTODATE",
150 buffer_dirty (bh) ? "DIRTY" : "CLEAN",
151 buffer_locked (bh) ? "LOCKED" : "UNLOCKED");
155 static void sprintf_disk_child (char * buf, struct disk_child * dc)
157 sprintf (buf, "[dc_number=%d, dc_size=%u]", dc_block_number(dc), dc_size(dc));
161 static char * is_there_reiserfs_struct (char * fmt, int * what, int * skip)
167 while ((k = strchr (k, '%')) != NULL)
169 if (k[1] == 'k' || k[1] == 'K' || k[1] == 'h' || k[1] == 't' ||
170 k[1] == 'z' || k[1] == 'b' || k[1] == 'y' || k[1] == 'a' ) {
181 /* debugging reiserfs we used to print out a lot of different
182 variables, like keys, item headers, buffer heads etc. Values of
183 most fields matter. So it took a long time just to write
184 appropriative printk. With this reiserfs_warning you can use format
185 specification for complex structures like you used to do with
186 printfs for integers, doubles and pointers. For instance, to print
187 out key structure you have to write just:
188 reiserfs_warning ("bad key %k", key);
190 printk ("bad key %lu %lu %lu %lu", key->k_dir_id, key->k_objectid,
191 key->k_offset, key->k_uniqueness);
196 prepare_error_buf( const char *fmt, va_list args )
198 char * fmt1 = fmt_buf;
200 char * p = error_buf;
201 int i, j, what, skip;
205 while( (k = is_there_reiserfs_struct( fmt1, &what, &skip )) != NULL )
209 p += vsprintf (p, fmt1, args);
211 for (i = 0; i < skip; i ++)
212 j = va_arg (args, int);
216 sprintf_le_key (p, va_arg(args, struct reiserfs_key *));
219 sprintf_cpu_key (p, va_arg(args, struct cpu_key *));
222 sprintf_item_head (p, va_arg(args, struct item_head *));
225 sprintf_direntry (p, va_arg(args, struct reiserfs_dir_entry *));
228 sprintf_disk_child (p, va_arg(args, struct disk_child *));
231 sprintf_block_head (p, va_arg(args, struct buffer_head *));
234 sprintf_buffer_head (p, va_arg(args, struct buffer_head *));
237 sprintf_de_head (p, va_arg(args, struct reiserfs_de_head *));
244 vsprintf (p, fmt1, args);
249 /* in addition to usual conversion specifiers this accepts reiserfs
250 specific conversion specifiers:
251 %k to print little endian key,
253 %h to print item_head,
254 %t to print directory entry
255 %z to print block head (arg must be struct buffer_head *
256 %b to print buffer_head
259 #define do_reiserfs_warning(fmt)\
262 va_start( args, fmt );\
263 prepare_error_buf( fmt, args );\
267 void reiserfs_warning (struct super_block *sb, const char * fmt, ...)
269 do_reiserfs_warning(fmt);
271 printk (KERN_WARNING "ReiserFS: %s: warning: %s\n",
272 reiserfs_bdevname (sb), error_buf);
274 printk (KERN_WARNING "ReiserFS: warning: %s\n", error_buf);
277 /* No newline.. reiserfs_info calls can be followed by printk's */
278 void reiserfs_info (struct super_block *sb, const char * fmt, ...)
280 do_reiserfs_warning(fmt);
282 printk (KERN_NOTICE "ReiserFS: %s: %s",
283 reiserfs_bdevname (sb), error_buf);
285 printk (KERN_NOTICE "ReiserFS: %s", error_buf);
288 /* No newline.. reiserfs_printk calls can be followed by printk's */
289 void reiserfs_printk (const char * fmt, ...)
291 do_reiserfs_warning(fmt);
295 void reiserfs_debug (struct super_block *s, int level, const char * fmt, ...)
297 #ifdef CONFIG_REISERFS_CHECK
298 do_reiserfs_warning(fmt);
300 printk (KERN_DEBUG "ReiserFS: %s: %s\n",
301 reiserfs_bdevname (s), error_buf);
303 printk (KERN_DEBUG "ReiserFS: %s\n", error_buf);
309 maintainer-errorid: [function-name:] message
311 where errorid is unique to the maintainer and function-name is
312 optional, is recommended, so that anyone can easily find the bug
313 with a simple grep for the short to type string
314 maintainer-errorid. Don't bother with reusing errorids, there are
315 lots of numbers out there.
320 p_sb, "reiser-29: reiserfs_new_blocknrs: "
321 "one of search_start or rn(%d) is equal to MAX_B_NUM,"
322 "which means that we are optimizing location based on the bogus location of a temp buffer (%p).",
326 Regular panic()s sometimes clear the screen before the message can
327 be read, thus the need for the while loop.
329 Numbering scheme for panic used by Vladimir and Anatoly( Hans completely ignores this scheme, and considers it
330 pointless complexity):
332 panics in reiserfs_fs.h have numbers from 1000 to 1999
334 preserve.c (unused) 3000 to 3999
335 bitmap.c 4000 to 4999
337 prints.c 6000 to 6999
339 fix_nodes.c 8000 to 8999
341 lbalance.c 10000 to 10999
342 ibalance.c 11000 to 11999 not ready
343 do_balan.c 12000 to 12999
344 inode.c 13000 to 13999
345 file.c 14000 to 14999
346 objectid.c 15000 - 15999
347 buffer.c 16000 - 16999
348 symlink.c 17000 - 17999
353 #ifdef CONFIG_REISERFS_CHECK
354 extern struct tree_balance * cur_tb;
357 void reiserfs_panic (struct super_block * sb, const char * fmt, ...)
359 do_reiserfs_warning(fmt);
360 printk (KERN_EMERG "REISERFS: panic (device %s): %s\n",
361 reiserfs_bdevname (sb), error_buf);
364 /* this is not actually called, but makes reiserfs_panic() "noreturn" */
365 panic ("REISERFS: panic (device %s): %s\n",
366 reiserfs_bdevname (sb), error_buf);
370 do_handle_error (struct super_block *sb, int errno)
372 if (reiserfs_error_panic (sb)) {
373 panic ("REISERFS: panic (device %s): Panic forced after error\n",
374 reiserfs_bdevname (sb));
377 if (reiserfs_error_ro (sb)) {
378 printk (KERN_CRIT "REISERFS: error (device %s): Re-mounting fs "
379 "readonly\n", reiserfs_bdevname (sb));
380 reiserfs_journal_abort (sb, errno);
385 reiserfs_error (struct super_block * sb, int errno, const char *fmt, ...)
387 do_reiserfs_warning (fmt);
388 printk (KERN_CRIT "REISERFS: error (device %s): %s\n",
389 reiserfs_bdevname (sb), error_buf);
390 do_handle_error (sb, errno);
394 reiserfs_abort (struct super_block *sb, int errno, const char *fmt, ...)
396 do_reiserfs_warning (fmt);
398 if (reiserfs_error_panic (sb)) {
399 panic (KERN_CRIT "REISERFS: panic (device %s): %s\n",
400 reiserfs_bdevname (sb), error_buf);
403 if (sb->s_flags & MS_RDONLY)
406 printk (KERN_CRIT "REISERFS: abort (device %s): %s\n",
407 reiserfs_bdevname (sb), error_buf);
409 sb->s_flags |= MS_RDONLY;
410 reiserfs_journal_abort (sb, errno);
413 void print_virtual_node (struct virtual_node * vn)
416 struct virtual_item * vi;
418 printk ("VIRTUAL NODE CONTAINS %d items, has size %d,%s,%s, ITEM_POS=%d POS_IN_ITEM=%d MODE=\'%c\'\n",
419 vn->vn_nr_item, vn->vn_size,
420 (vn->vn_vi[0].vi_type & VI_TYPE_LEFT_MERGEABLE )? "left mergeable" : "",
421 (vn->vn_vi[vn->vn_nr_item - 1].vi_type & VI_TYPE_RIGHT_MERGEABLE) ? "right mergeable" : "",
422 vn->vn_affected_item_num, vn->vn_pos_in_item, vn->vn_mode);
425 for (i = 0; i < vn->vn_nr_item; i ++, vi ++)
431 void print_path (struct tree_balance * tb, struct path * path)
434 struct buffer_head * bh;
437 while (tb->insert_size[h]) {
438 bh = PATH_H_PBUFFER (path, h);
439 printk ("block %llu (level=%d), position %d\n", bh ? (unsigned long long)bh->b_blocknr : 0LL,
440 bh ? B_LEVEL (bh) : 0, PATH_H_POSITION (path, h));
444 int offset = path->path_length;
445 struct buffer_head * bh;
446 printk ("Offset Bh (b_blocknr, b_count) Position Nr_item\n");
447 while ( offset > ILLEGAL_PATH_ELEMENT_OFFSET ) {
448 bh = PATH_OFFSET_PBUFFER (path, offset);
449 printk ("%6d %10p (%9llu, %7d) %8d %7d\n", offset,
450 bh, bh ? (unsigned long long)bh->b_blocknr : 0LL, bh ? atomic_read (&(bh->b_count)) : 0,
451 PATH_OFFSET_POSITION (path, offset), bh ? B_NR_ITEMS (bh) : -1);
460 /* this prints internal nodes (4 keys/items in line) (dc_number,
461 dc_size)[k_dirid, k_objectid, k_offset, k_uniqueness](dc_number,
463 static int print_internal (struct buffer_head * bh, int first, int last)
465 struct reiserfs_key * key;
466 struct disk_child * dc;
470 if (!B_IS_KEYS_LEVEL (bh))
477 to = B_NR_ITEMS (bh);
480 to = last < B_NR_ITEMS (bh) ? last : B_NR_ITEMS (bh);
483 reiserfs_printk ("INTERNAL NODE (%ld) contains %z\n", bh->b_blocknr, bh);
485 dc = B_N_CHILD (bh, from);
486 reiserfs_printk ("PTR %d: %y ", from, dc);
488 for (i = from, key = B_N_PDELIM_KEY (bh, from), dc ++; i < to; i ++, key ++, dc ++) {
489 reiserfs_printk ("KEY %d: %k PTR %d: %y ", i, key, i + 1, dc);
501 static int print_leaf (struct buffer_head * bh, int print_mode, int first, int last)
503 struct block_head * blkh;
504 struct item_head * ih;
508 if (!B_IS_ITEMS_LEVEL (bh))
513 blkh = B_BLK_HEAD (bh);
514 ih = B_N_PITEM_HEAD (bh,0);
515 nr = blkh_nr_item(blkh);
517 printk ("\n===================================================================\n");
518 reiserfs_printk ("LEAF NODE (%ld) contains %z\n", bh->b_blocknr, bh);
520 if (!(print_mode & PRINT_LEAF_ITEMS)) {
521 reiserfs_printk ("FIRST ITEM_KEY: %k, LAST ITEM KEY: %k\n",
522 &(ih->ih_key), &((ih + nr - 1)->ih_key));
526 if (first < 0 || first > nr - 1)
531 if (last < 0 || last > nr )
537 printk ("-------------------------------------------------------------------------------\n");
538 printk ("|##| type | key | ilen | free_space | version | loc |\n");
539 for (i = from; i < to; i++, ih ++) {
540 printk ("-------------------------------------------------------------------------------\n");
541 reiserfs_printk ("|%2d| %h |\n", i, ih);
542 if (print_mode & PRINT_LEAF_ITEMS)
543 op_print_item (ih, B_I_PITEM (bh, ih));
546 printk ("===================================================================\n");
551 char * reiserfs_hashname(int code)
553 if ( code == YURA_HASH)
555 if ( code == TEA_HASH)
557 if ( code == R5_HASH)
563 /* return 1 if this is not super block */
564 static int print_super_block (struct buffer_head * bh)
566 struct reiserfs_super_block * rs = (struct reiserfs_super_block *)(bh->b_data);
567 int skipped, data_blocks;
569 char b[BDEVNAME_SIZE];
571 if (is_reiserfs_3_5(rs)) {
573 } else if (is_reiserfs_3_6(rs)) {
575 } else if (is_reiserfs_jr(rs)) {
576 version = ((sb_version(rs) == REISERFS_VERSION_2) ?
582 printk ("%s\'s super block is in block %llu\n", bdevname (bh->b_bdev, b),
583 (unsigned long long)bh->b_blocknr);
584 printk ("Reiserfs version %s\n", version );
585 printk ("Block count %u\n", sb_block_count(rs));
586 printk ("Blocksize %d\n", sb_blocksize(rs));
587 printk ("Free blocks %u\n", sb_free_blocks(rs));
588 // FIXME: this would be confusing if
589 // someone stores reiserfs super block in some data block ;)
590 // skipped = (bh->b_blocknr * bh->b_size) / sb_blocksize(rs);
591 skipped = bh->b_blocknr;
592 data_blocks = sb_block_count(rs) - skipped - 1 - sb_bmap_nr(rs) -
593 (!is_reiserfs_jr(rs) ? sb_jp_journal_size(rs) + 1 : sb_reserved_for_journal(rs)) -
595 printk ("Busy blocks (skipped %d, bitmaps - %d, journal (or reserved) blocks - %d\n"
596 "1 super block, %d data blocks\n",
597 skipped, sb_bmap_nr(rs), (!is_reiserfs_jr(rs) ? (sb_jp_journal_size(rs) + 1) :
598 sb_reserved_for_journal(rs)) , data_blocks);
599 printk ("Root block %u\n", sb_root_block(rs));
600 printk ("Journal block (first) %d\n", sb_jp_journal_1st_block(rs));
601 printk ("Journal dev %d\n", sb_jp_journal_dev(rs));
602 printk ("Journal orig size %d\n", sb_jp_journal_size(rs));
603 printk ("FS state %d\n", sb_fs_state(rs));
604 printk ("Hash function \"%s\"\n",
605 reiserfs_hashname(sb_hash_function_code(rs)));
607 printk ("Tree height %d\n", sb_tree_height(rs));
611 static int print_desc_block (struct buffer_head * bh)
613 struct reiserfs_journal_desc * desc;
615 if (memcmp(get_journal_desc_magic (bh), JOURNAL_DESC_MAGIC, 8))
618 desc = (struct reiserfs_journal_desc *)(bh->b_data);
619 printk ("Desc block %llu (j_trans_id %d, j_mount_id %d, j_len %d)",
620 (unsigned long long)bh->b_blocknr, get_desc_trans_id (desc), get_desc_mount_id (desc),
621 get_desc_trans_len (desc));
627 void print_block (struct buffer_head * bh, ...)//int print_mode, int first, int last)
630 int mode, first, last;
635 printk("print_block: buffer is NULL\n");
639 mode = va_arg (args, int);
640 first = va_arg (args, int);
641 last = va_arg (args, int);
642 if (print_leaf (bh, mode, first, last))
643 if (print_internal (bh, first, last))
644 if (print_super_block (bh))
645 if (print_desc_block (bh))
646 printk ("Block %llu contains unformatted data\n", (unsigned long long)bh->b_blocknr);
651 char print_tb_buf[2048];
653 /* this stores initial state of tree balance in the print_tb_buf */
654 void store_print_tb (struct tree_balance * tb)
658 struct buffer_head * tbSh, * tbFh;
663 sprintf (print_tb_buf, "\n"
665 "MODE=%c, ITEM_POS=%d POS_IN_ITEM=%d\n"
666 "=====================================================================\n"
667 "* h * S * L * R * F * FL * FR * CFL * CFR *\n",
668 REISERFS_SB(tb->tb_sb)->s_do_balance,
669 tb->tb_mode, PATH_LAST_POSITION (tb->tb_path), tb->tb_path->pos_in_item);
671 for (h = 0; h < sizeof(tb->insert_size) / sizeof (tb->insert_size[0]); h ++) {
672 if (PATH_H_PATH_OFFSET (tb->tb_path, h) <= tb->tb_path->path_length &&
673 PATH_H_PATH_OFFSET (tb->tb_path, h) > ILLEGAL_PATH_ELEMENT_OFFSET) {
674 tbSh = PATH_H_PBUFFER (tb->tb_path, h);
675 tbFh = PATH_H_PPARENT (tb->tb_path, h);
680 sprintf (print_tb_buf + strlen (print_tb_buf),
681 "* %d * %3lld(%2d) * %3lld(%2d) * %3lld(%2d) * %5lld * %5lld * %5lld * %5lld * %5lld *\n",
683 (tbSh) ? (long long)(tbSh->b_blocknr):(-1LL),
684 (tbSh) ? atomic_read (&(tbSh->b_count)) : -1,
685 (tb->L[h]) ? (long long)(tb->L[h]->b_blocknr):(-1LL),
686 (tb->L[h]) ? atomic_read (&(tb->L[h]->b_count)) : -1,
687 (tb->R[h]) ? (long long)(tb->R[h]->b_blocknr):(-1LL),
688 (tb->R[h]) ? atomic_read (&(tb->R[h]->b_count)) : -1,
689 (tbFh) ? (long long)(tbFh->b_blocknr):(-1LL),
690 (tb->FL[h]) ? (long long)(tb->FL[h]->b_blocknr):(-1LL),
691 (tb->FR[h]) ? (long long)(tb->FR[h]->b_blocknr):(-1LL),
692 (tb->CFL[h]) ? (long long)(tb->CFL[h]->b_blocknr):(-1LL),
693 (tb->CFR[h]) ? (long long)(tb->CFR[h]->b_blocknr):(-1LL));
696 sprintf (print_tb_buf + strlen (print_tb_buf),
697 "=====================================================================\n"
698 "* h * size * ln * lb * rn * rb * blkn * s0 * s1 * s1b * s2 * s2b * curb * lk * rk *\n"
699 "* 0 * %4d * %2d * %2d * %2d * %2d * %4d * %2d * %2d * %3d * %2d * %3d * %4d * %2d * %2d *\n",
700 tb->insert_size[0], tb->lnum[0], tb->lbytes, tb->rnum[0],tb->rbytes, tb->blknum[0],
701 tb->s0num, tb->s1num,tb->s1bytes, tb->s2num, tb->s2bytes, tb->cur_blknum, tb->lkey[0], tb->rkey[0]);
703 /* this prints balance parameters for non-leaf levels */
707 sprintf (print_tb_buf + strlen (print_tb_buf),
708 "* %d * %4d * %2d * * %2d * * %2d *\n",
709 h, tb->insert_size[h], tb->lnum[h], tb->rnum[h], tb->blknum[h]);
710 } while (tb->insert_size[h]);
712 sprintf (print_tb_buf + strlen (print_tb_buf),
713 "=====================================================================\n"
716 /* print FEB list (list of buffers in form (bh (b_blocknr, b_count), that will be used for new nodes) */
718 for (i = 0; i < sizeof (tb->FEB) / sizeof (tb->FEB[0]); i ++)
719 sprintf (print_tb_buf + strlen (print_tb_buf),
720 "%p (%llu %d)%s", tb->FEB[i], tb->FEB[i] ? (unsigned long long)tb->FEB[i]->b_blocknr : 0ULL,
721 tb->FEB[i] ? atomic_read (&(tb->FEB[i]->b_count)) : 0,
722 (i == sizeof (tb->FEB) / sizeof (tb->FEB[0]) - 1) ? "\n" : ", ");
724 sprintf (print_tb_buf + strlen (print_tb_buf),
725 "======================== the end ====================================\n");
728 void print_cur_tb (char * mes)
730 printk ("%s\n%s", mes, print_tb_buf);
733 static void check_leaf_block_head (struct buffer_head * bh)
735 struct block_head * blkh;
738 blkh = B_BLK_HEAD (bh);
739 nr = blkh_nr_item(blkh);
740 if ( nr > (bh->b_size - BLKH_SIZE) / IH_SIZE)
741 reiserfs_panic (NULL, "vs-6010: check_leaf_block_head: invalid item number %z", bh);
742 if ( blkh_free_space(blkh) >
743 bh->b_size - BLKH_SIZE - IH_SIZE * nr )
744 reiserfs_panic (NULL, "vs-6020: check_leaf_block_head: invalid free space %z", bh);
748 static void check_internal_block_head (struct buffer_head * bh)
750 struct block_head * blkh;
752 blkh = B_BLK_HEAD (bh);
753 if (!(B_LEVEL (bh) > DISK_LEAF_NODE_LEVEL && B_LEVEL (bh) <= MAX_HEIGHT))
754 reiserfs_panic (NULL, "vs-6025: check_internal_block_head: invalid level %z", bh);
756 if (B_NR_ITEMS (bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE)
757 reiserfs_panic (NULL, "vs-6030: check_internal_block_head: invalid item number %z", bh);
759 if (B_FREE_SPACE (bh) !=
760 bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS (bh) - DC_SIZE * (B_NR_ITEMS (bh) + 1))
761 reiserfs_panic (NULL, "vs-6040: check_internal_block_head: invalid free space %z", bh);
766 void check_leaf (struct buffer_head * bh)
769 struct item_head * ih;
773 check_leaf_block_head (bh);
774 for (i = 0, ih = B_N_PITEM_HEAD (bh, 0); i < B_NR_ITEMS (bh); i ++, ih ++)
775 op_check_item (ih, B_I_PITEM (bh, ih));
779 void check_internal (struct buffer_head * bh)
783 check_internal_block_head (bh);
787 void print_statistics (struct super_block * s)
791 printk ("reiserfs_put_super: session statistics: balances %d, fix_nodes %d, \
792 bmap with search %d, without %d, dir2ind %d, ind2dir %d\n",
793 REISERFS_SB(s)->s_do_balance, REISERFS_SB(s)->s_fix_nodes,
794 REISERFS_SB(s)->s_bmaps, REISERFS_SB(s)->s_bmaps_without_search,
795 REISERFS_SB(s)->s_direct2indirect, REISERFS_SB(s)->s_indirect2direct);