Loading fs/ubifs/debug.c +2 −2 Original line number Diff line number Diff line Loading @@ -479,9 +479,9 @@ void dbg_dump_node(const struct ubifs_info *c, const void *node) "bad or corrupted node)"); else { for (i = 0; i < nlen && dent->name[i]; i++) printk("%c", dent->name[i]); printk(KERN_CONT "%c", dent->name[i]); } printk("\n"); printk(KERN_CONT "\n"); break; } Loading fs/ubifs/lpt_commit.c +4 −4 Original line number Diff line number Diff line Loading @@ -1921,12 +1921,12 @@ static void dump_lpt_leb(const struct ubifs_info *c, int lnum) lnum, offs); err = ubifs_unpack_nnode(c, buf, &nnode); for (i = 0; i < UBIFS_LPT_FANOUT; i++) { printk("%d:%d", nnode.nbranch[i].lnum, printk(KERN_CONT "%d:%d", nnode.nbranch[i].lnum, nnode.nbranch[i].offs); if (i != UBIFS_LPT_FANOUT - 1) printk(", "); printk(KERN_CONT ", "); } printk("\n"); printk(KERN_CONT "\n"); break; } case UBIFS_LPT_LTAB: Loading Loading
fs/ubifs/debug.c +2 −2 Original line number Diff line number Diff line Loading @@ -479,9 +479,9 @@ void dbg_dump_node(const struct ubifs_info *c, const void *node) "bad or corrupted node)"); else { for (i = 0; i < nlen && dent->name[i]; i++) printk("%c", dent->name[i]); printk(KERN_CONT "%c", dent->name[i]); } printk("\n"); printk(KERN_CONT "\n"); break; } Loading
fs/ubifs/lpt_commit.c +4 −4 Original line number Diff line number Diff line Loading @@ -1921,12 +1921,12 @@ static void dump_lpt_leb(const struct ubifs_info *c, int lnum) lnum, offs); err = ubifs_unpack_nnode(c, buf, &nnode); for (i = 0; i < UBIFS_LPT_FANOUT; i++) { printk("%d:%d", nnode.nbranch[i].lnum, printk(KERN_CONT "%d:%d", nnode.nbranch[i].lnum, nnode.nbranch[i].offs); if (i != UBIFS_LPT_FANOUT - 1) printk(", "); printk(KERN_CONT ", "); } printk("\n"); printk(KERN_CONT "\n"); break; } case UBIFS_LPT_LTAB: Loading