Commit db0f8969 authored by Artem Bityutskiy's avatar Artem Bityutskiy

UBIFS: always print full error reports

Even when we are emulating power cuts, otherwise it is difficult to investigate
failures during emulated power cuts testing.
Signed-off-by: default avatarArtem Bityutskiy <artem.bityutskiy@linux.intel.com>
parent c45640d8
...@@ -305,9 +305,6 @@ void ubifs_dump_node(const struct ubifs_info *c, const void *node) ...@@ -305,9 +305,6 @@ void ubifs_dump_node(const struct ubifs_info *c, const void *node)
const struct ubifs_ch *ch = node; const struct ubifs_ch *ch = node;
char key_buf[DBG_KEY_BUF_LEN]; char key_buf[DBG_KEY_BUF_LEN];
if (dbg_is_tst_rcvry(c))
return;
/* If the magic is incorrect, just hexdump the first bytes */ /* If the magic is incorrect, just hexdump the first bytes */
if (le32_to_cpu(ch->magic) != UBIFS_NODE_MAGIC) { if (le32_to_cpu(ch->magic) != UBIFS_NODE_MAGIC) {
printk(KERN_ERR "Not a node, first %zu bytes:", UBIFS_CH_SZ); printk(KERN_ERR "Not a node, first %zu bytes:", UBIFS_CH_SZ);
...@@ -882,9 +879,6 @@ void ubifs_dump_leb(const struct ubifs_info *c, int lnum) ...@@ -882,9 +879,6 @@ void ubifs_dump_leb(const struct ubifs_info *c, int lnum)
struct ubifs_scan_node *snod; struct ubifs_scan_node *snod;
void *buf; void *buf;
if (dbg_is_tst_rcvry(c))
return;
printk(KERN_ERR "(pid %d) start dumping LEB %d\n", printk(KERN_ERR "(pid %d) start dumping LEB %d\n",
current->pid, lnum); current->pid, lnum);
......
...@@ -240,8 +240,6 @@ void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs, ...@@ -240,8 +240,6 @@ void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs,
int len; int len;
ubifs_err("corruption at LEB %d:%d", lnum, offs); ubifs_err("corruption at LEB %d:%d", lnum, offs);
if (dbg_is_tst_rcvry(c))
return;
len = c->leb_size - offs; len = c->leb_size - offs;
if (len > 8192) if (len > 8192)
len = 8192; len = 8192;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment