Commit dac52fc1 authored by Fabian Frederick's avatar Fabian Frederick Committed by Linus Torvalds
Browse files

BEFS: logging cleanup 



Summary:
 - all printk(KERN_foo converted to pr_foo()
 - add pr_fmt and remove redundant prefixes
 - convert befs_() to va_format (based on patch by Joe Perches)
 - remove non standard %Lu
 - use __func__ for all debugging

[akpm@linux-foundation.org: fix printk warnings, reported by Fengguang]
Signed-off-by: default avatarFabian Frederick <fabf@skynet.be>
Cc: Joe Perches <joe@perches.com>
Cc: Fengguang Wu <fengguang.wu@gmail.com>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Signed-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent 91a52ab7

fs/befs/Makefile

+1 −1
Original line number Diff line number Diff line
@@ -3,5 +3,5 @@ 
#

 

obj-$(CONFIG_BEFS_FS) += befs.o



ccflags-$(CONFIG_BEFS_DEBUG)    += -DDEBUG

befs-objs := datastream.o btree.o super.o inode.o debug.o io.o linuxvfs.o

fs/befs/befs.h

+3 −0
Original line number Diff line number Diff line
@@ -88,8 +88,11 @@ enum befs_err { 


/****************************/

/* debug.c */

__printf(2, 3)

void befs_error(const struct super_block *sb, const char *fmt, ...);

__printf(2, 3)

void befs_warning(const struct super_block *sb, const char *fmt, ...);

__printf(2, 3)

void befs_debug(const struct super_block *sb, const char *fmt, ...);



void befs_dump_super_block(const struct super_block *sb, befs_super_block *);

fs/befs/btree.c

+48 −45
Original line number Diff line number Diff line
@@ -137,7 +137,7 @@ befs_bt_read_super(struct super_block *sb, befs_data_stream * ds, 
	struct buffer_head *bh = NULL;

	befs_disk_btree_super *od_sup = NULL;



	befs_debug(sb, "---> befs_btree_read_super()");

	befs_debug(sb, "---> %s", __func__);



	bh = befs_read_datastream(sb, ds, 0, NULL);
@@ -162,11 +162,11 @@ befs_bt_read_super(struct super_block *sb, befs_data_stream * ds, 
		goto error;

	}



	befs_debug(sb, "<--- befs_btree_read_super()");

	befs_debug(sb, "<--- %s", __func__);

	return BEFS_OK;



      error:

	befs_debug(sb, "<--- befs_btree_read_super() ERROR");

	befs_debug(sb, "<--- %s ERROR", __func__);

	return BEFS_ERR;

}
@@ -195,16 +195,16 @@ befs_bt_read_node(struct super_block *sb, befs_data_stream * ds, 
{

	uint off = 0;



	befs_debug(sb, "---> befs_bt_read_node()");

	befs_debug(sb, "---> %s", __func__);



	if (node->bh)

		brelse(node->bh);



	node->bh = befs_read_datastream(sb, ds, node_off, &off);

	if (!node->bh) {

		befs_error(sb, "befs_bt_read_node() failed to read "

			   "node at %Lu", node_off);

		befs_debug(sb, "<--- befs_bt_read_node() ERROR");

		befs_error(sb, "%s failed to read "

			   "node at %llu", __func__, node_off);

		befs_debug(sb, "<--- %s ERROR", __func__);



		return BEFS_ERR;

	}
@@ -221,7 +221,7 @@ befs_bt_read_node(struct super_block *sb, befs_data_stream * ds, 
	node->head.all_key_length =

	    fs16_to_cpu(sb, node->od_node->all_key_length);



	befs_debug(sb, "<--- befs_btree_read_node()");

	befs_debug(sb, "<--- %s", __func__);

	return BEFS_OK;

}
@@ -252,7 +252,7 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
	befs_off_t node_off;

	int res;



	befs_debug(sb, "---> befs_btree_find() Key: %s", key);

	befs_debug(sb, "---> %s Key: %s", __func__, key);



	if (befs_bt_read_super(sb, ds, &bt_super) != BEFS_OK) {

		befs_error(sb,
@@ -263,7 +263,7 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
	this_node = kmalloc(sizeof (befs_btree_node),

						GFP_NOFS);

	if (!this_node) {

		befs_error(sb, "befs_btree_find() failed to allocate %u "

		befs_error(sb, "befs_btree_find() failed to allocate %zu "

			   "bytes of memory", sizeof (befs_btree_node));

		goto error;

	}
@@ -274,7 +274,7 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
	node_off = bt_super.root_node_ptr;

	if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {

		befs_error(sb, "befs_btree_find() failed to read "

			   "node at %Lu", node_off);

			   "node at %llu", node_off);

		goto error_alloc;

	}
@@ -285,7 +285,7 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
		/* if no match, go to overflow node */

		if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {

			befs_error(sb, "befs_btree_find() failed to read "

				   "node at %Lu", node_off);

				   "node at %llu", node_off);

			goto error_alloc;

		}

	}
@@ -298,11 +298,11 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
	kfree(this_node);



	if (res != BEFS_BT_MATCH) {

		befs_debug(sb, "<--- befs_btree_find() Key %s not found", key);

		befs_debug(sb, "<--- %s Key %s not found", __func__, key);

		*value = 0;

		return BEFS_BT_NOT_FOUND;

	}

	befs_debug(sb, "<--- befs_btree_find() Found key %s, value %Lu",

	befs_debug(sb, "<--- %s Found key %s, value %llu", __func__,

		   key, *value);

	return BEFS_OK;
@@ -310,7 +310,7 @@ befs_btree_find(struct super_block *sb, befs_data_stream * ds, 
	kfree(this_node);

      error:

	*value = 0;

	befs_debug(sb, "<--- befs_btree_find() ERROR");

	befs_debug(sb, "<--- %s ERROR", __func__);

	return BEFS_ERR;

}
@@ -343,7 +343,7 @@ befs_find_key(struct super_block *sb, befs_btree_node * node, 
	char *thiskey;

	fs64 *valarray;



	befs_debug(sb, "---> befs_find_key() %s", findkey);

	befs_debug(sb, "---> %s %s", __func__, findkey);



	*value = 0;
@@ -355,7 +355,7 @@ befs_find_key(struct super_block *sb, befs_btree_node * node, 


	eq = befs_compare_strings(thiskey, keylen, findkey, findkey_len);

	if (eq < 0) {

		befs_debug(sb, "<--- befs_find_key() %s not found", findkey);

		befs_debug(sb, "<--- %s %s not found", __func__, findkey);

		return BEFS_BT_NOT_FOUND;

	}
@@ -373,8 +373,8 @@ befs_find_key(struct super_block *sb, befs_btree_node * node, 
					  findkey_len);



		if (eq == 0) {

			befs_debug(sb, "<--- befs_find_key() found %s at %d",

				   thiskey, mid);

			befs_debug(sb, "<--- %s found %s at %d",

				   __func__, thiskey, mid);



			*value = fs64_to_cpu(sb, valarray[mid]);

			return BEFS_BT_MATCH;
@@ -388,7 +388,7 @@ befs_find_key(struct super_block *sb, befs_btree_node * node, 
		*value = fs64_to_cpu(sb, valarray[mid + 1]);

	else

		*value = fs64_to_cpu(sb, valarray[mid]);

	befs_debug(sb, "<--- befs_find_key() found %s at %d", thiskey, mid);

	befs_debug(sb, "<--- %s found %s at %d", __func__, thiskey, mid);

	return BEFS_BT_PARMATCH;

}
@@ -428,7 +428,7 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 


	uint key_sum = 0;



	befs_debug(sb, "---> befs_btree_read()");

	befs_debug(sb, "---> %s", __func__);



	if (befs_bt_read_super(sb, ds, &bt_super) != BEFS_OK) {

		befs_error(sb,
@@ -437,7 +437,7 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
	}



	if ((this_node = kmalloc(sizeof (befs_btree_node), GFP_NOFS)) == NULL) {

		befs_error(sb, "befs_btree_read() failed to allocate %u "

		befs_error(sb, "befs_btree_read() failed to allocate %zu "

			   "bytes of memory", sizeof (befs_btree_node));

		goto error;

	}
@@ -452,7 +452,7 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
		kfree(this_node);

		*value = 0;

		*keysize = 0;

		befs_debug(sb, "<--- befs_btree_read() Tree is EMPTY");

		befs_debug(sb, "<--- %s Tree is EMPTY", __func__);

		return BEFS_BT_EMPTY;

	} else if (res == BEFS_ERR) {

		goto error_alloc;
@@ -467,7 +467,8 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
			*keysize = 0;

			*value = 0;

			befs_debug(sb,

				   "<--- befs_btree_read() END of keys at %Lu",

				   "<--- %s END of keys at %llu", __func__,

				   (unsigned long long)

				   key_sum + this_node->head.all_key_count);

			brelse(this_node->bh);

			kfree(this_node);
@@ -478,8 +479,8 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
		node_off = this_node->head.right;



		if (befs_bt_read_node(sb, ds, this_node, node_off) != BEFS_OK) {

			befs_error(sb, "befs_btree_read() failed to read "

				   "node at %Lu", node_off);

			befs_error(sb, "%s failed to read node at %llu",

				  __func__, (unsigned long long)node_off);

			goto error_alloc;

		}

	}
@@ -492,11 +493,13 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 


	keystart = befs_bt_get_key(sb, this_node, cur_key, &keylen);



	befs_debug(sb, "Read [%Lu,%d]: keysize %d", node_off, cur_key, keylen);

	befs_debug(sb, "Read [%llu,%d]: keysize %d",

		   (long long unsigned int)node_off, (int)cur_key,

		   (int)keylen);



	if (bufsize < keylen + 1) {

		befs_error(sb, "befs_btree_read() keybuf too small (%u) "

			   "for key of size %d", bufsize, keylen);

		befs_error(sb, "%s keybuf too small (%zu) "

			   "for key of size %d", __func__, bufsize, keylen);

		brelse(this_node->bh);

		goto error_alloc;

	};
@@ -506,13 +509,13 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
	*keysize = keylen;

	keybuf[keylen] = '\0';



	befs_debug(sb, "Read [%Lu,%d]: Key \"%.*s\", Value %Lu", node_off,

	befs_debug(sb, "Read [%llu,%d]: Key \"%.*s\", Value %llu", node_off,

		   cur_key, keylen, keybuf, *value);



	brelse(this_node->bh);

	kfree(this_node);



	befs_debug(sb, "<--- befs_btree_read()");

	befs_debug(sb, "<--- %s", __func__);



	return BEFS_OK;
@@ -522,7 +525,7 @@ befs_btree_read(struct super_block *sb, befs_data_stream * ds, 
      error:

	*keysize = 0;

	*value = 0;

	befs_debug(sb, "<--- befs_btree_read() ERROR");

	befs_debug(sb, "<--- %s ERROR", __func__);

	return BEFS_ERR;

}
@@ -547,26 +550,26 @@ befs_btree_seekleaf(struct super_block *sb, befs_data_stream * ds, 
		    befs_off_t * node_off)

{



	befs_debug(sb, "---> befs_btree_seekleaf()");

	befs_debug(sb, "---> %s", __func__);



	if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) {

		befs_error(sb, "befs_btree_seekleaf() failed to read "

			   "node at %Lu", *node_off);

		befs_error(sb, "%s failed to read "

			   "node at %llu", __func__, *node_off);

		goto error;

	}

	befs_debug(sb, "Seekleaf to root node %Lu", *node_off);

	befs_debug(sb, "Seekleaf to root node %llu", *node_off);



	if (this_node->head.all_key_count == 0 && befs_leafnode(this_node)) {

		befs_debug(sb, "<--- befs_btree_seekleaf() Tree is EMPTY");

		befs_debug(sb, "<--- %s Tree is EMPTY", __func__);

		return BEFS_BT_EMPTY;

	}



	while (!befs_leafnode(this_node)) {



		if (this_node->head.all_key_count == 0) {

			befs_debug(sb, "befs_btree_seekleaf() encountered "

				   "an empty interior node: %Lu. Using Overflow "

				   "node: %Lu", *node_off,

			befs_debug(sb, "%s encountered "

				   "an empty interior node: %llu. Using Overflow "

				   "node: %llu", __func__, *node_off,

				   this_node->head.overflow);

			*node_off = this_node->head.overflow;

		} else {
@@ -574,19 +577,19 @@ befs_btree_seekleaf(struct super_block *sb, befs_data_stream * ds, 
			*node_off = fs64_to_cpu(sb, valarray[0]);

		}

		if (befs_bt_read_node(sb, ds, this_node, *node_off) != BEFS_OK) {

			befs_error(sb, "befs_btree_seekleaf() failed to read "

				   "node at %Lu", *node_off);

			befs_error(sb, "%s failed to read "

				   "node at %llu", __func__, *node_off);

			goto error;

		}



		befs_debug(sb, "Seekleaf to child node %Lu", *node_off);

		befs_debug(sb, "Seekleaf to child node %llu", *node_off);

	}

	befs_debug(sb, "Node %Lu is a leaf node", *node_off);

	befs_debug(sb, "Node %llu is a leaf node", *node_off);



	return BEFS_OK;



      error:

	befs_debug(sb, "<--- befs_btree_seekleaf() ERROR");

	befs_debug(sb, "<--- %s ERROR", __func__);

	return BEFS_ERR;

}

fs/befs/datastream.c

+45 −42
Original line number Diff line number Diff line
@@ -52,26 +52,25 @@ befs_read_datastream(struct super_block *sb, befs_data_stream * ds, 
	befs_block_run run;

	befs_blocknr_t block;	/* block coresponding to pos */



	befs_debug(sb, "---> befs_read_datastream() %Lu", pos);

	befs_debug(sb, "---> %s %llu", __func__, pos);

	block = pos >> BEFS_SB(sb)->block_shift;

	if (off)

		*off = pos - (block << BEFS_SB(sb)->block_shift);



	if (befs_fblock2brun(sb, ds, block, &run) != BEFS_OK) {

		befs_error(sb, "BeFS: Error finding disk addr of block %lu",

			   block);

		befs_debug(sb, "<--- befs_read_datastream() ERROR");

			   (unsigned long)block);

		befs_debug(sb, "<--- %s ERROR", __func__);

		return NULL;

	}

	bh = befs_bread_iaddr(sb, run);

	if (!bh) {

		befs_error(sb, "BeFS: Error reading block %lu from datastream",

			   block);

			   (unsigned long)block);

		return NULL;

	}



	befs_debug(sb, "<--- befs_read_datastream() read data, starting at %Lu",

		   pos);

	befs_debug(sb, "<--- %s read data, starting at %llu", __func__, pos);



	return bh;

}
@@ -106,7 +105,8 @@ befs_fblock2brun(struct super_block *sb, befs_data_stream * data, 
	} else {

		befs_error(sb,

			   "befs_fblock2brun() was asked to find block %lu, "

			   "which is not mapped by the datastream\n", fblock);

			   "which is not mapped by the datastream\n",

			   (unsigned long)fblock);

		err = BEFS_ERR;

	}

	return err;
@@ -128,14 +128,14 @@ befs_read_lsymlink(struct super_block * sb, befs_data_stream * ds, void *buff, 
	befs_off_t bytes_read = 0;	/* bytes readed */

	u16 plen;

	struct buffer_head *bh = NULL;

	befs_debug(sb, "---> befs_read_lsymlink() length: %Lu", len);

	befs_debug(sb, "---> %s length: %llu", __func__, len);



	while (bytes_read < len) {

		bh = befs_read_datastream(sb, ds, bytes_read, NULL);

		if (!bh) {

			befs_error(sb, "BeFS: Error reading datastream block "

				   "starting from %Lu", bytes_read);

			befs_debug(sb, "<--- befs_read_lsymlink() ERROR");

				   "starting from %llu", bytes_read);

			befs_debug(sb, "<--- %s ERROR", __func__);

			return bytes_read;



		}
@@ -146,7 +146,8 @@ befs_read_lsymlink(struct super_block * sb, befs_data_stream * ds, void *buff, 
		bytes_read += plen;

	}



	befs_debug(sb, "<--- befs_read_lsymlink() read %u bytes", bytes_read);

	befs_debug(sb, "<--- %s read %u bytes", __func__, (unsigned int)

		   bytes_read);

	return bytes_read;

}
@@ -169,7 +170,7 @@ befs_count_blocks(struct super_block * sb, befs_data_stream * ds) 
	befs_blocknr_t metablocks;	/* FS metadata blocks */

	befs_sb_info *befs_sb = BEFS_SB(sb);



	befs_debug(sb, "---> befs_count_blocks()");

	befs_debug(sb, "---> %s", __func__);



	datablocks = ds->size >> befs_sb->block_shift;

	if (ds->size & (befs_sb->block_size - 1))
@@ -206,7 +207,7 @@ befs_count_blocks(struct super_block * sb, befs_data_stream * ds) 
	}



	blocks = datablocks + metablocks;

	befs_debug(sb, "<--- befs_count_blocks() %u blocks", blocks);

	befs_debug(sb, "<--- %s %u blocks", __func__, (unsigned int)blocks);



	return blocks;

}
@@ -251,11 +252,11 @@ befs_find_brun_direct(struct super_block *sb, befs_data_stream * data, 
	befs_blocknr_t max_block =

	    data->max_direct_range >> BEFS_SB(sb)->block_shift;



	befs_debug(sb, "---> befs_find_brun_direct(), find %lu", blockno);

	befs_debug(sb, "---> %s, find %lu", __func__, (unsigned long)blockno);



	if (blockno > max_block) {

		befs_error(sb, "befs_find_brun_direct() passed block outside of"

			   "direct region");

		befs_error(sb, "%s passed block outside of direct region",

			   __func__);

		return BEFS_ERR;

	}
@@ -267,13 +268,14 @@ befs_find_brun_direct(struct super_block *sb, befs_data_stream * data, 
			run->start = array[i].start + offset;

			run->len = array[i].len - offset;



			befs_debug(sb, "---> befs_find_brun_direct(), "

				   "found %lu at direct[%d]", blockno, i);

			befs_debug(sb, "---> %s, "

				   "found %lu at direct[%d]", __func__,

				   (unsigned long)blockno, i);

			return BEFS_OK;

		}

	}



	befs_debug(sb, "---> befs_find_brun_direct() ERROR");

	befs_debug(sb, "---> %s ERROR", __func__);

	return BEFS_ERR;

}
@@ -316,7 +318,7 @@ befs_find_brun_indirect(struct super_block *sb, 
	befs_blocknr_t indirblockno = iaddr2blockno(sb, &indirect);

	int arraylen = befs_iaddrs_per_block(sb);



	befs_debug(sb, "---> befs_find_brun_indirect(), find %lu", blockno);

	befs_debug(sb, "---> %s, find %lu", __func__, (unsigned long)blockno);



	indir_start_blk = data->max_direct_range >> BEFS_SB(sb)->block_shift;

	search_blk = blockno - indir_start_blk;
@@ -325,10 +327,9 @@ befs_find_brun_indirect(struct super_block *sb, 
	for (i = 0; i < indirect.len; i++) {

		indirblock = befs_bread(sb, indirblockno + i);

		if (indirblock == NULL) {

			befs_debug(sb,

				   "---> befs_find_brun_indirect() failed to "

				   "read disk block %lu from the indirect brun",

				   indirblockno + i);

			befs_debug(sb, "---> %s failed to read "

				   "disk block %lu from the indirect brun",

				   __func__, (unsigned long)indirblockno + i);

			return BEFS_ERR;

		}
@@ -348,9 +349,10 @@ befs_find_brun_indirect(struct super_block *sb, 


				brelse(indirblock);

				befs_debug(sb,

					   "<--- befs_find_brun_indirect() found "

					   "file block %lu at indirect[%d]",

					   blockno, j + (i * arraylen));

					   "<--- %s found file block "

					   "%lu at indirect[%d]", __func__,

					   (unsigned long)blockno,

					   j + (i * arraylen));

				return BEFS_OK;

			}

			sum += len;
@@ -360,10 +362,10 @@ befs_find_brun_indirect(struct super_block *sb, 
	}



	/* Only fallthrough is an error */

	befs_error(sb, "BeFS: befs_find_brun_indirect() failed to find "

		   "file block %lu", blockno);

	befs_error(sb, "BeFS: %s failed to find "

		   "file block %lu", __func__, (unsigned long)blockno);



	befs_debug(sb, "<--- befs_find_brun_indirect() ERROR");

	befs_debug(sb, "<--- %s ERROR", __func__);

	return BEFS_ERR;

}
@@ -444,7 +446,7 @@ befs_find_brun_dblindirect(struct super_block *sb, 
	size_t diblklen = iblklen * befs_iaddrs_per_block(sb)

	    * BEFS_DBLINDIR_BRUN_LEN;



	befs_debug(sb, "---> befs_find_brun_dblindirect() find %lu", blockno);

	befs_debug(sb, "---> %s find %lu", __func__, (unsigned long)blockno);



	/* First, discover which of the double_indir->indir blocks

	 * contains pos. Then figure out how much of pos that
@@ -460,8 +462,9 @@ befs_find_brun_dblindirect(struct super_block *sb, 
	dbl_which_block = dblindir_indx / befs_iaddrs_per_block(sb);

	if (dbl_which_block > data->double_indirect.len) {

		befs_error(sb, "The double-indirect index calculated by "

			   "befs_read_brun_dblindirect(), %d, is outside the range "

			   "of the double-indirect block", dblindir_indx);

			   "%s, %d, is outside the range "

			   "of the double-indirect block", __func__,

			   dblindir_indx);

		return BEFS_ERR;

	}
@@ -469,10 +472,10 @@ befs_find_brun_dblindirect(struct super_block *sb, 
	    befs_bread(sb, iaddr2blockno(sb, &data->double_indirect) +

					dbl_which_block);

	if (dbl_indir_block == NULL) {

		befs_error(sb, "befs_read_brun_dblindirect() couldn't read the "

			   "double-indirect block at blockno %lu",

			   iaddr2blockno(sb,

					 &data->double_indirect) +

		befs_error(sb, "%s couldn't read the "

			   "double-indirect block at blockno %lu", __func__,

			   (unsigned long)

			   iaddr2blockno(sb, &data->double_indirect) +

			   dbl_which_block);

		brelse(dbl_indir_block);

		return BEFS_ERR;
@@ -489,16 +492,16 @@ befs_find_brun_dblindirect(struct super_block *sb, 
	which_block = indir_indx / befs_iaddrs_per_block(sb);

	if (which_block > indir_run.len) {

		befs_error(sb, "The indirect index calculated by "

			   "befs_read_brun_dblindirect(), %d, is outside the range "

			   "of the indirect block", indir_indx);

			   "%s, %d, is outside the range "

			   "of the indirect block", __func__, indir_indx);

		return BEFS_ERR;

	}



	indir_block =

	    befs_bread(sb, iaddr2blockno(sb, &indir_run) + which_block);

	if (indir_block == NULL) {

		befs_error(sb, "befs_read_brun_dblindirect() couldn't read the "

			   "indirect block at blockno %lu",

		befs_error(sb, "%s couldn't read the indirect block "

			   "at blockno %lu", __func__, (unsigned long)

			   iaddr2blockno(sb, &indir_run) + which_block);

		brelse(indir_block);

		return BEFS_ERR;
@@ -519,7 +522,7 @@ befs_find_brun_dblindirect(struct super_block *sb, 
	run->len -= offset;



	befs_debug(sb, "Found file block %lu in double_indirect[%d][%d],"

		   " double_indirect_leftover = %lu",

		   " double_indirect_leftover = %lu", (unsigned long)

		   blockno, dblindir_indx, indir_indx, dblindir_leftover);



	return BEFS_OK;

fs/befs/debug.c

+25 −49
Original line number Diff line number Diff line
@@ -10,6 +10,7 @@ 
 * debug functions

 */



#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

#ifdef __KERNEL__



#include <stdarg.h>
@@ -23,43 +24,30 @@ 


#include "befs.h"



#define ERRBUFSIZE 1024



void

befs_error(const struct super_block *sb, const char *fmt, ...)

{

	struct va_format vaf;

	va_list args;

	char *err_buf = kmalloc(ERRBUFSIZE, GFP_KERNEL);

	if (err_buf == NULL) {

		printk(KERN_ERR "could not allocate %d bytes\n", ERRBUFSIZE);

		return;

	}



	va_start(args, fmt);

	vsnprintf(err_buf, ERRBUFSIZE, fmt, args);

	vaf.fmt = fmt;

	vaf.va = &args;

	pr_err("(%s): %pV\n", sb->s_id, &vaf);

	va_end(args);



	printk(KERN_ERR "BeFS(%s): %s\n", sb->s_id, err_buf);

	kfree(err_buf);

}



void

befs_warning(const struct super_block *sb, const char *fmt, ...)

{

	struct va_format vaf;

	va_list args;

	char *err_buf = kmalloc(ERRBUFSIZE, GFP_KERNEL);

	if (err_buf == NULL) {

		printk(KERN_ERR "could not allocate %d bytes\n", ERRBUFSIZE);

		return;

	}



	va_start(args, fmt);

	vsnprintf(err_buf, ERRBUFSIZE, fmt, args);

	vaf.fmt = fmt;

	vaf.va = &args;

	pr_warn("(%s): %pV\n", sb->s_id, &vaf);

	va_end(args);



	printk(KERN_WARNING "BeFS(%s): %s\n", sb->s_id, err_buf);



	kfree(err_buf);

}



void
@@ -67,26 +55,14 @@ befs_debug(const struct super_block *sb, const char *fmt, ...) 
{

#ifdef CONFIG_BEFS_DEBUG



	struct va_format vaf;

	va_list args;

	char *err_buf = NULL;



	if (BEFS_SB(sb)->mount_opts.debug) {

		err_buf = kmalloc(ERRBUFSIZE, GFP_KERNEL);

		if (err_buf == NULL) {

			printk(KERN_ERR "could not allocate %d bytes\n",

				ERRBUFSIZE);

			return;

		}



	va_start(args, fmt);

		vsnprintf(err_buf, ERRBUFSIZE, fmt, args);

	vaf.fmt = fmt;

	vaf.va = &args;

	pr_debug("(%s): %pV\n", sb->s_id, &vaf);

	va_end(args);



		printk(KERN_DEBUG "BeFS(%s): %s\n", sb->s_id, err_buf);



		kfree(err_buf);

	}



#endif				//CONFIG_BEFS_DEBUG

}
@@ -109,9 +85,9 @@ befs_dump_inode(const struct super_block *sb, befs_inode * inode) 
	befs_debug(sb, "  gid %u", fs32_to_cpu(sb, inode->gid));

	befs_debug(sb, "  mode %08x", fs32_to_cpu(sb, inode->mode));

	befs_debug(sb, "  flags %08x", fs32_to_cpu(sb, inode->flags));

	befs_debug(sb, "  create_time %Lu",

	befs_debug(sb, "  create_time %llu",

		   fs64_to_cpu(sb, inode->create_time));

	befs_debug(sb, "  last_modified_time %Lu",

	befs_debug(sb, "  last_modified_time %llu",

		   fs64_to_cpu(sb, inode->last_modified_time));



	tmp_run = fsrun_to_cpu(sb, inode->parent);
@@ -137,7 +113,7 @@ befs_dump_inode(const struct super_block *sb, befs_inode * inode) 
				   tmp_run.allocation_group, tmp_run.start,

				   tmp_run.len);

		}

		befs_debug(sb, "  max_direct_range %Lu",

		befs_debug(sb, "  max_direct_range %llu",

			   fs64_to_cpu(sb,

				       inode->data.datastream.

				       max_direct_range));
@@ -147,7 +123,7 @@ befs_dump_inode(const struct super_block *sb, befs_inode * inode) 
			   tmp_run.allocation_group,

			   tmp_run.start, tmp_run.len);



		befs_debug(sb, "  max_indirect_range %Lu",

		befs_debug(sb, "  max_indirect_range %llu",

			   fs64_to_cpu(sb,

				       inode->data.datastream.

				       max_indirect_range));
@@ -158,12 +134,12 @@ befs_dump_inode(const struct super_block *sb, befs_inode * inode) 
			   tmp_run.allocation_group, tmp_run.start,

			   tmp_run.len);



		befs_debug(sb, "  max_double_indirect_range %Lu",

		befs_debug(sb, "  max_double_indirect_range %llu",

			   fs64_to_cpu(sb,

				       inode->data.datastream.

				       max_double_indirect_range));



		befs_debug(sb, "  size %Lu",

		befs_debug(sb, "  size %llu",

			   fs64_to_cpu(sb, inode->data.datastream.size));

	}
@@ -191,8 +167,8 @@ befs_dump_super_block(const struct super_block *sb, befs_super_block * sup) 
	befs_debug(sb, "  block_size %u", fs32_to_cpu(sb, sup->block_size));

	befs_debug(sb, "  block_shift %u", fs32_to_cpu(sb, sup->block_shift));



	befs_debug(sb, "  num_blocks %Lu", fs64_to_cpu(sb, sup->num_blocks));

	befs_debug(sb, "  used_blocks %Lu", fs64_to_cpu(sb, sup->used_blocks));

	befs_debug(sb, "  num_blocks %llu", fs64_to_cpu(sb, sup->num_blocks));

	befs_debug(sb, "  used_blocks %llu", fs64_to_cpu(sb, sup->used_blocks));



	befs_debug(sb, "  magic2 %08x", fs32_to_cpu(sb, sup->magic2));

	befs_debug(sb, "  blocks_per_ag %u",
@@ -206,8 +182,8 @@ befs_dump_super_block(const struct super_block *sb, befs_super_block * sup) 
	befs_debug(sb, "  log_blocks %u, %hu, %hu",

		   tmp_run.allocation_group, tmp_run.start, tmp_run.len);



	befs_debug(sb, "  log_start %Ld", fs64_to_cpu(sb, sup->log_start));

	befs_debug(sb, "  log_end %Ld", fs64_to_cpu(sb, sup->log_end));

	befs_debug(sb, "  log_start %lld", fs64_to_cpu(sb, sup->log_start));

	befs_debug(sb, "  log_end %lld", fs64_to_cpu(sb, sup->log_end));



	befs_debug(sb, "  magic3 %08x", fs32_to_cpu(sb, sup->magic3));

CRA Git | Maintained and supported by SUSTech CRA and CCSE