^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) * JFFS2 -- Journalling Flash File System, Version 2.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * Copyright © 2001-2007 Red Hat, Inc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * Copyright © 2004-2010 David Woodhouse <dwmw2@infradead.org>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) * Created by David Woodhouse <dwmw2@infradead.org>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) * For licensing information, see the file 'LICENCE' in this directory.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/kernel.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/types.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include <linux/pagemap.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) #include <linux/crc32.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) #include <linux/jffs2.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) #include <linux/mtd/mtd.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) #include "nodelist.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) #include "debug.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) #ifdef JFFS2_DBG_SANITY_CHECKS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) __jffs2_dbg_acct_sanity_check_nolock(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) if (unlikely(jeb && jeb->used_size + jeb->dirty_size +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) jeb->free_size + jeb->wasted_size +
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) jeb->unchecked_size != c->sector_size)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) JFFS2_ERROR("eeep, space accounting for block at 0x%08x is screwed.\n", jeb->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) JFFS2_ERROR("free %#08x + dirty %#08x + used %#08x + wasted %#08x + unchecked %#08x != total %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) jeb->free_size, jeb->dirty_size, jeb->used_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) jeb->wasted_size, jeb->unchecked_size, c->sector_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) if (unlikely(c->used_size + c->dirty_size + c->free_size + c->erasing_size + c->bad_size
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) + c->wasted_size + c->unchecked_size != c->flash_size)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) JFFS2_ERROR("eeep, space accounting superblock info is screwed.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) JFFS2_ERROR("free %#08x + dirty %#08x + used %#08x + erasing %#08x + bad %#08x + wasted %#08x + unchecked %#08x != total %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) c->free_size, c->dirty_size, c->used_size, c->erasing_size, c->bad_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) c->wasted_size, c->unchecked_size, c->flash_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) __jffs2_dbg_acct_sanity_check(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) jffs2_dbg_acct_sanity_check_nolock(c, jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) #endif /* JFFS2_DBG_SANITY_CHECKS */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) #ifdef JFFS2_DBG_PARANOIA_CHECKS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) * Check the fragtree.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) __jffs2_dbg_fragtree_paranoia_check(struct jffs2_inode_info *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) mutex_lock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) __jffs2_dbg_fragtree_paranoia_check_nolock(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) mutex_unlock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) __jffs2_dbg_fragtree_paranoia_check_nolock(struct jffs2_inode_info *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) struct jffs2_node_frag *frag;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) int bitched = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) struct jffs2_full_dnode *fn = frag->node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) if (!fn || !fn->raw)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) if (ref_flags(fn->raw) == REF_PRISTINE) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) if (fn->frags > 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) JFFS2_ERROR("REF_PRISTINE node at 0x%08x had %d frags. Tell dwmw2.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) ref_offset(fn->raw), fn->frags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) bitched = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) /* A hole node which isn't multi-page should be garbage-collected
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) and merged anyway, so we just check for the frag size here,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) rather than mucking around with actually reading the node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) and checking the compression type, which is the real way
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) to tell a hole node. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) if (frag->ofs & (PAGE_SIZE-1) && frag_prev(frag)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) && frag_prev(frag)->size < PAGE_SIZE && frag_prev(frag)->node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) JFFS2_ERROR("REF_PRISTINE node at 0x%08x had a previous non-hole frag in the same page. Tell dwmw2.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) ref_offset(fn->raw));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) bitched = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) if ((frag->ofs+frag->size) & (PAGE_SIZE-1) && frag_next(frag)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) && frag_next(frag)->size < PAGE_SIZE && frag_next(frag)->node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) JFFS2_ERROR("REF_PRISTINE node at 0x%08x (%08x-%08x) had a following non-hole frag in the same page. Tell dwmw2.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) ref_offset(fn->raw), frag->ofs, frag->ofs+frag->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) bitched = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) if (bitched) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) JFFS2_ERROR("fragtree is corrupted.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) __jffs2_dbg_dump_fragtree_nolock(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) * Check if the flash contains all 0xFF before we start writing.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) __jffs2_dbg_prewrite_paranoia_check(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) uint32_t ofs, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) int ret, i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) unsigned char *buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) buf = kmalloc(len, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) if (!buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) ret = jffs2_flash_read(c, ofs, len, &retlen, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) if (ret || (retlen != len)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) JFFS2_WARNING("read %d bytes failed or short. ret %d, retlen %zd.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) len, ret, retlen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) for (i = 0; i < len; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) if (buf[i] != 0xff)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) ret = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) JFFS2_ERROR("argh, about to write node to %#08x on flash, but there are data already there. The first corrupted byte is at %#08x offset.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) ofs, ofs + i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) __jffs2_dbg_dump_buffer(buf, len, ofs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) void __jffs2_dbg_superblock_counts(struct jffs2_sb_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) struct jffs2_eraseblock *jeb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) uint32_t free = 0, dirty = 0, used = 0, wasted = 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) erasing = 0, bad = 0, unchecked = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) int nr_counted = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) int dump = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) if (c->gcblock) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) free += c->gcblock->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) dirty += c->gcblock->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) used += c->gcblock->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) wasted += c->gcblock->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) unchecked += c->gcblock->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) if (c->nextblock) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) free += c->nextblock->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) dirty += c->nextblock->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) used += c->nextblock->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) wasted += c->nextblock->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) unchecked += c->nextblock->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) list_for_each_entry(jeb, &c->clean_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) list_for_each_entry(jeb, &c->very_dirty_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) list_for_each_entry(jeb, &c->dirty_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) list_for_each_entry(jeb, &c->erasable_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) list_for_each_entry(jeb, &c->erasable_pending_wbuf_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) list_for_each_entry(jeb, &c->erase_pending_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) list_for_each_entry(jeb, &c->free_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) list_for_each_entry(jeb, &c->bad_used_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) free += jeb->free_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) used += jeb->used_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) wasted += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) unchecked += jeb->unchecked_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) list_for_each_entry(jeb, &c->erasing_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) erasing += c->sector_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) list_for_each_entry(jeb, &c->erase_checking_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) erasing += c->sector_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) list_for_each_entry(jeb, &c->erase_complete_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) erasing += c->sector_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) list_for_each_entry(jeb, &c->bad_list, list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) nr_counted++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) bad += c->sector_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) #define check(sz) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) do { \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) if (sz != c->sz##_size) { \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) pr_warn("%s_size mismatch counted 0x%x, c->%s_size 0x%x\n", \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) #sz, sz, #sz, c->sz##_size); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) dump = 1; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) } \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) check(free);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) check(dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) check(used);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) check(wasted);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) check(unchecked);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) check(bad);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) check(erasing);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) #undef check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) if (nr_counted != c->nr_blocks) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) pr_warn("%s counted only 0x%x blocks of 0x%x. Where are the others?\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) __func__, nr_counted, c->nr_blocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) dump = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) if (dump) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) __jffs2_dbg_dump_block_lists_nolock(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) * Check the space accounting and node_ref list correctness for the JFFS2 erasable block 'jeb'.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) __jffs2_dbg_acct_paranoia_check(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) __jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) __jffs2_dbg_acct_paranoia_check_nolock(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) uint32_t my_used_size = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) uint32_t my_unchecked_size = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) uint32_t my_dirty_size = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) struct jffs2_raw_node_ref *ref2 = jeb->first_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) while (ref2) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) uint32_t totlen = ref_totlen(c, jeb, ref2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) if (ref_offset(ref2) < jeb->offset ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) ref_offset(ref2) > jeb->offset + c->sector_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) JFFS2_ERROR("node_ref %#08x shouldn't be in block at %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) ref_offset(ref2), jeb->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) if (ref_flags(ref2) == REF_UNCHECKED)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) my_unchecked_size += totlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) else if (!ref_obsolete(ref2))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) my_used_size += totlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) my_dirty_size += totlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) if ((!ref_next(ref2)) != (ref2 == jeb->last_node)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) JFFS2_ERROR("node_ref for node at %#08x (mem %p) has next at %#08x (mem %p), last_node is at %#08x (mem %p).\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) ref_offset(ref2), ref2, ref_offset(ref_next(ref2)), ref_next(ref2),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) ref_offset(jeb->last_node), jeb->last_node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) ref2 = ref_next(ref2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) if (my_used_size != jeb->used_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) JFFS2_ERROR("Calculated used size %#08x != stored used size %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) my_used_size, jeb->used_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) if (my_unchecked_size != jeb->unchecked_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) JFFS2_ERROR("Calculated unchecked size %#08x != stored unchecked size %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) my_unchecked_size, jeb->unchecked_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) #if 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) /* This should work when we implement ref->__totlen elemination */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) if (my_dirty_size != jeb->dirty_size + jeb->wasted_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) JFFS2_ERROR("Calculated dirty+wasted size %#08x != stored dirty + wasted size %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) my_dirty_size, jeb->dirty_size + jeb->wasted_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) if (jeb->free_size == 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) && my_used_size + my_unchecked_size + my_dirty_size != c->sector_size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) JFFS2_ERROR("The sum of all nodes in block (%#x) != size of block (%#x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) my_used_size + my_unchecked_size + my_dirty_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) c->sector_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) goto error;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) if (!(c->flags & (JFFS2_SB_FLAG_BUILDING|JFFS2_SB_FLAG_SCANNING)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) __jffs2_dbg_superblock_counts(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) error:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) __jffs2_dbg_dump_node_refs_nolock(c, jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) __jffs2_dbg_dump_jeb_nolock(jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) __jffs2_dbg_dump_block_lists_nolock(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) #endif /* JFFS2_DBG_PARANOIA_CHECKS */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) #if defined(JFFS2_DBG_DUMPS) || defined(JFFS2_DBG_PARANOIA_CHECKS)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) * Dump the node_refs of the 'jeb' JFFS2 eraseblock.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) __jffs2_dbg_dump_node_refs(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) __jffs2_dbg_dump_node_refs_nolock(c, jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) __jffs2_dbg_dump_node_refs_nolock(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) struct jffs2_raw_node_ref *ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) int i = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) printk(JFFS2_DBG_MSG_PREFIX " Dump node_refs of the eraseblock %#08x\n", jeb->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) if (!jeb->first_node) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) printk(JFFS2_DBG_MSG_PREFIX " no nodes in the eraseblock %#08x\n", jeb->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) printk(JFFS2_DBG);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) for (ref = jeb->first_node; ; ref = ref_next(ref)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) printk("%#08x", ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) #ifdef TEST_TOTLEN
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) printk("(%x)", ref->__totlen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) if (ref_next(ref))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) printk("->");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) if (++i == 4) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) i = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) printk("\n" JFFS2_DBG);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) printk("\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) * Dump an eraseblock's space accounting.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) __jffs2_dbg_dump_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) __jffs2_dbg_dump_jeb_nolock(jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) __jffs2_dbg_dump_jeb_nolock(struct jffs2_eraseblock *jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) if (!jeb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) printk(JFFS2_DBG_MSG_PREFIX " dump space accounting for the eraseblock at %#08x:\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) jeb->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) printk(JFFS2_DBG "used_size: %#08x\n", jeb->used_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) printk(JFFS2_DBG "dirty_size: %#08x\n", jeb->dirty_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) printk(JFFS2_DBG "wasted_size: %#08x\n", jeb->wasted_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) printk(JFFS2_DBG "unchecked_size: %#08x\n", jeb->unchecked_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) printk(JFFS2_DBG "free_size: %#08x\n", jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) __jffs2_dbg_dump_block_lists(struct jffs2_sb_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) __jffs2_dbg_dump_block_lists_nolock(c);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) __jffs2_dbg_dump_block_lists_nolock(struct jffs2_sb_info *c)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) printk(JFFS2_DBG_MSG_PREFIX " dump JFFS2 blocks lists:\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) printk(JFFS2_DBG "flash_size: %#08x\n", c->flash_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) printk(JFFS2_DBG "used_size: %#08x\n", c->used_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) printk(JFFS2_DBG "dirty_size: %#08x\n", c->dirty_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) printk(JFFS2_DBG "wasted_size: %#08x\n", c->wasted_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) printk(JFFS2_DBG "unchecked_size: %#08x\n", c->unchecked_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) printk(JFFS2_DBG "free_size: %#08x\n", c->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) printk(JFFS2_DBG "erasing_size: %#08x\n", c->erasing_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) printk(JFFS2_DBG "bad_size: %#08x\n", c->bad_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) printk(JFFS2_DBG "sector_size: %#08x\n", c->sector_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) printk(JFFS2_DBG "jffs2_reserved_blocks size: %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) c->sector_size * c->resv_blocks_write);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) if (c->nextblock)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) printk(JFFS2_DBG "nextblock: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) c->nextblock->offset, c->nextblock->used_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) c->nextblock->dirty_size, c->nextblock->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) c->nextblock->unchecked_size, c->nextblock->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) printk(JFFS2_DBG "nextblock: NULL\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) if (c->gcblock)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) printk(JFFS2_DBG "gcblock: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) c->gcblock->offset, c->gcblock->used_size, c->gcblock->dirty_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) c->gcblock->wasted_size, c->gcblock->unchecked_size, c->gcblock->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) printk(JFFS2_DBG "gcblock: NULL\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) if (list_empty(&c->clean_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) printk(JFFS2_DBG "clean_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) int numblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) uint32_t dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) list_for_each(this, &c->clean_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) numblocks ++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) dirty += jeb->wasted_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) printk(JFFS2_DBG "clean_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) printk (JFFS2_DBG "Contains %d blocks with total wasted size %u, average wasted size: %u\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) numblocks, dirty, dirty / numblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) if (list_empty(&c->very_dirty_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) printk(JFFS2_DBG "very_dirty_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) int numblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) uint32_t dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) list_for_each(this, &c->very_dirty_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) numblocks ++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) printk(JFFS2_DBG "very_dirty_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) printk (JFFS2_DBG "Contains %d blocks with total dirty size %u, average dirty size: %u\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) numblocks, dirty, dirty / numblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) if (list_empty(&c->dirty_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544) printk(JFFS2_DBG "dirty_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) int numblocks = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) uint32_t dirty = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) list_for_each(this, &c->dirty_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) numblocks ++;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) dirty += jeb->dirty_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) printk(JFFS2_DBG "dirty_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) printk (JFFS2_DBG "contains %d blocks with total dirty size %u, average dirty size: %u\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) numblocks, dirty, dirty / numblocks);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566) if (list_empty(&c->erasable_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) printk(JFFS2_DBG "erasable_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) list_for_each(this, &c->erasable_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) printk(JFFS2_DBG "erasable_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) if (list_empty(&c->erasing_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) printk(JFFS2_DBG "erasing_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) list_for_each(this, &c->erasing_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) printk(JFFS2_DBG "erasing_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) if (list_empty(&c->erase_checking_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) printk(JFFS2_DBG "erase_checking_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) list_for_each(this, &c->erase_checking_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) printk(JFFS2_DBG "erase_checking_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) if (list_empty(&c->erase_pending_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) printk(JFFS2_DBG "erase_pending_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) list_for_each(this, &c->erase_pending_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) printk(JFFS2_DBG "erase_pending_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) if (list_empty(&c->erasable_pending_wbuf_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) printk(JFFS2_DBG "erasable_pending_wbuf_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) list_for_each(this, &c->erasable_pending_wbuf_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) printk(JFFS2_DBG "erasable_pending_wbuf_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) if (list_empty(&c->free_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646) printk(JFFS2_DBG "free_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) list_for_each(this, &c->free_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) printk(JFFS2_DBG "free_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) if (list_empty(&c->bad_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) printk(JFFS2_DBG "bad_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) list_for_each(this, &c->bad_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) printk(JFFS2_DBG "bad_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) if (list_empty(&c->bad_used_list)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) printk(JFFS2_DBG "bad_used_list: empty\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) struct list_head *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) list_for_each(this, &c->bad_used_list) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683) struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685) if (!(jeb->used_size == 0 && jeb->dirty_size == 0 && jeb->wasted_size == 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) printk(JFFS2_DBG "bad_used_list: %#08x (used %#08x, dirty %#08x, wasted %#08x, unchecked %#08x, free %#08x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) jeb->offset, jeb->used_size, jeb->dirty_size, jeb->wasted_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) jeb->unchecked_size, jeb->free_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) __jffs2_dbg_dump_fragtree(struct jffs2_inode_info *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) mutex_lock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) jffs2_dbg_dump_fragtree_nolock(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) mutex_unlock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703) __jffs2_dbg_dump_fragtree_nolock(struct jffs2_inode_info *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) struct jffs2_node_frag *this = frag_first(&f->fragtree);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) uint32_t lastofs = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) int buggy = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709) printk(JFFS2_DBG_MSG_PREFIX " dump fragtree of ino #%u\n", f->inocache->ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) while(this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711) if (this->node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) printk(JFFS2_DBG "frag %#04x-%#04x: %#08x(%d) on flash (*%p), left (%p), right (%p), parent (%p)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) this->ofs, this->ofs+this->size, ref_offset(this->node->raw),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) ref_flags(this->node->raw), this, frag_left(this), frag_right(this),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 715) frag_parent(this));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 716) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 717) printk(JFFS2_DBG "frag %#04x-%#04x: hole (*%p). left (%p), right (%p), parent (%p)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 718) this->ofs, this->ofs+this->size, this, frag_left(this),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 719) frag_right(this), frag_parent(this));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 720) if (this->ofs != lastofs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 721) buggy = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 722) lastofs = this->ofs + this->size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 723) this = frag_next(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 724) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 725)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 726) if (f->metadata)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 727) printk(JFFS2_DBG "metadata at 0x%08x\n", ref_offset(f->metadata->raw));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 728)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 729) if (buggy) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 730) JFFS2_ERROR("frag tree got a hole in it.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 731) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 732) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 733) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 734)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 735) #define JFFS2_BUFDUMP_BYTES_PER_LINE 32
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 736) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 737) __jffs2_dbg_dump_buffer(unsigned char *buf, int len, uint32_t offs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 738) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 739) int skip;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 740) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 741)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 742) printk(JFFS2_DBG_MSG_PREFIX " dump from offset %#08x to offset %#08x (%x bytes).\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 743) offs, offs + len, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 744) i = skip = offs % JFFS2_BUFDUMP_BYTES_PER_LINE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 745) offs = offs & ~(JFFS2_BUFDUMP_BYTES_PER_LINE - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 746)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 747) if (skip != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 748) printk(JFFS2_DBG "%#08x: ", offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 749)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 750) while (skip--)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 751) printk(" ");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 752)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 753) while (i < len) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 754) if ((i % JFFS2_BUFDUMP_BYTES_PER_LINE) == 0 && i != len -1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 755) if (i != 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 756) printk("\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 757) offs += JFFS2_BUFDUMP_BYTES_PER_LINE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 758) printk(JFFS2_DBG "%0#8x: ", offs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 759) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 760)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 761) printk("%02x ", buf[i]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 762)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 763) i += 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 764) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 765)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 766) printk("\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 767) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 768)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 769) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 770) * Dump a JFFS2 node.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 771) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 772) void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 773) __jffs2_dbg_dump_node(struct jffs2_sb_info *c, uint32_t ofs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 774) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 775) union jffs2_node_union node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 776) int len = sizeof(union jffs2_node_union);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 777) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 778) uint32_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 779) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 780)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 781) printk(JFFS2_DBG_MSG_PREFIX " dump node at offset %#08x.\n", ofs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 782)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 783) ret = jffs2_flash_read(c, ofs, len, &retlen, (unsigned char *)&node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 784) if (ret || (retlen != len)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 785) JFFS2_ERROR("read %d bytes failed or short. ret %d, retlen %zd.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 786) len, ret, retlen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 787) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 788) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 789)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 790) printk(JFFS2_DBG "magic:\t%#04x\n", je16_to_cpu(node.u.magic));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 791) printk(JFFS2_DBG "nodetype:\t%#04x\n", je16_to_cpu(node.u.nodetype));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 792) printk(JFFS2_DBG "totlen:\t%#08x\n", je32_to_cpu(node.u.totlen));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 793) printk(JFFS2_DBG "hdr_crc:\t%#08x\n", je32_to_cpu(node.u.hdr_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 794)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 795) crc = crc32(0, &node.u, sizeof(node.u) - 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 796) if (crc != je32_to_cpu(node.u.hdr_crc)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 797) JFFS2_ERROR("wrong common header CRC.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 798) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 799) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 800)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 801) if (je16_to_cpu(node.u.magic) != JFFS2_MAGIC_BITMASK &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 802) je16_to_cpu(node.u.magic) != JFFS2_OLD_MAGIC_BITMASK)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 803) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 804) JFFS2_ERROR("wrong node magic: %#04x instead of %#04x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 805) je16_to_cpu(node.u.magic), JFFS2_MAGIC_BITMASK);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 806) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 807) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 808)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 809) switch(je16_to_cpu(node.u.nodetype)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 810)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 811) case JFFS2_NODETYPE_INODE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 812)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 813) printk(JFFS2_DBG "the node is inode node\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 814) printk(JFFS2_DBG "ino:\t%#08x\n", je32_to_cpu(node.i.ino));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 815) printk(JFFS2_DBG "version:\t%#08x\n", je32_to_cpu(node.i.version));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 816) printk(JFFS2_DBG "mode:\t%#08x\n", node.i.mode.m);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 817) printk(JFFS2_DBG "uid:\t%#04x\n", je16_to_cpu(node.i.uid));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 818) printk(JFFS2_DBG "gid:\t%#04x\n", je16_to_cpu(node.i.gid));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 819) printk(JFFS2_DBG "isize:\t%#08x\n", je32_to_cpu(node.i.isize));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 820) printk(JFFS2_DBG "atime:\t%#08x\n", je32_to_cpu(node.i.atime));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 821) printk(JFFS2_DBG "mtime:\t%#08x\n", je32_to_cpu(node.i.mtime));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 822) printk(JFFS2_DBG "ctime:\t%#08x\n", je32_to_cpu(node.i.ctime));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 823) printk(JFFS2_DBG "offset:\t%#08x\n", je32_to_cpu(node.i.offset));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 824) printk(JFFS2_DBG "csize:\t%#08x\n", je32_to_cpu(node.i.csize));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 825) printk(JFFS2_DBG "dsize:\t%#08x\n", je32_to_cpu(node.i.dsize));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 826) printk(JFFS2_DBG "compr:\t%#02x\n", node.i.compr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 827) printk(JFFS2_DBG "usercompr:\t%#02x\n", node.i.usercompr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 828) printk(JFFS2_DBG "flags:\t%#04x\n", je16_to_cpu(node.i.flags));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 829) printk(JFFS2_DBG "data_crc:\t%#08x\n", je32_to_cpu(node.i.data_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 830) printk(JFFS2_DBG "node_crc:\t%#08x\n", je32_to_cpu(node.i.node_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 831)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 832) crc = crc32(0, &node.i, sizeof(node.i) - 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 833) if (crc != je32_to_cpu(node.i.node_crc)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 834) JFFS2_ERROR("wrong node header CRC.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 835) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 836) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 837) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 838)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 839) case JFFS2_NODETYPE_DIRENT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 840)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 841) printk(JFFS2_DBG "the node is dirent node\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 842) printk(JFFS2_DBG "pino:\t%#08x\n", je32_to_cpu(node.d.pino));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 843) printk(JFFS2_DBG "version:\t%#08x\n", je32_to_cpu(node.d.version));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 844) printk(JFFS2_DBG "ino:\t%#08x\n", je32_to_cpu(node.d.ino));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 845) printk(JFFS2_DBG "mctime:\t%#08x\n", je32_to_cpu(node.d.mctime));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 846) printk(JFFS2_DBG "nsize:\t%#02x\n", node.d.nsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 847) printk(JFFS2_DBG "type:\t%#02x\n", node.d.type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 848) printk(JFFS2_DBG "node_crc:\t%#08x\n", je32_to_cpu(node.d.node_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 849) printk(JFFS2_DBG "name_crc:\t%#08x\n", je32_to_cpu(node.d.name_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 850)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 851) node.d.name[node.d.nsize] = '\0';
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 852) printk(JFFS2_DBG "name:\t\"%s\"\n", node.d.name);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 853)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 854) crc = crc32(0, &node.d, sizeof(node.d) - 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 855) if (crc != je32_to_cpu(node.d.node_crc)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 856) JFFS2_ERROR("wrong node header CRC.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 857) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 858) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 859) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 860)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 861) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 862) printk(JFFS2_DBG "node type is unknown\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 863) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 864) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 865) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 866) #endif /* JFFS2_DBG_DUMPS || JFFS2_DBG_PARANOIA_CHECKS */
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags