^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) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) * Created by David Woodhouse <dwmw2@infradead.org>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) * For licensing information, see the file 'LICENCE' in this directory.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) *
^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) #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <linux/kernel.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/sched.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include <linux/fs.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/pagemap.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/compiler.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) #include "nodelist.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) * Check the data CRC of the node.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) * Returns: 0 if the data CRC is correct;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) * 1 - if incorrect;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) * error code if an error occurred.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) struct jffs2_raw_node_ref *ref = tn->fn->raw;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) int err = 0, pointed = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) struct jffs2_eraseblock *jeb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) unsigned char *buffer;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) uint32_t crc, ofs, len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) BUG_ON(tn->csize == 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) /* Calculate how many bytes were already checked */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) len = tn->csize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) if (jffs2_is_writebuffered(c)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) int adj = ofs % c->wbuf_pagesize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) if (likely(adj))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) adj = c->wbuf_pagesize - adj;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) if (adj >= tn->csize) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) dbg_readinode("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) ref_offset(ref), tn->csize, ofs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) goto adj_acc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) ofs += adj;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) len -= adj;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) dbg_readinode("check node at %#08x, data length %u, partial CRC %#08x, correct CRC %#08x, data starts at %#08x, start checking from %#08x - %u bytes.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) #ifndef __ECOS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) * adding and jffs2_flash_read_end() interface. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) err = mtd_point(c->mtd, ofs, len, &retlen, (void **)&buffer, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) if (!err && retlen < len) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) mtd_unpoint(c->mtd, ofs, retlen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) } else if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) if (err != -EOPNOTSUPP)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) JFFS2_WARNING("MTD point failed: error code %d.\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) } else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) pointed = 1; /* succefully pointed to device */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) if (!pointed) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) buffer = kmalloc(len, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) if (unlikely(!buffer))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) /* TODO: this is very frequent pattern, make it a separate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) * routine */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) err = jffs2_flash_read(c, ofs, len, &retlen, buffer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) if (retlen != len) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) err = -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) /* Continue calculating CRC */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) crc = crc32(tn->partial_crc, buffer, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) if(!pointed)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) kfree(buffer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) #ifndef __ECOS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) mtd_unpoint(c->mtd, ofs, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) if (crc != tn->data_crc) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) ref_offset(ref), tn->data_crc, crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) return 1;
^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) adj_acc:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) jeb = &c->blocks[ref->flash_offset / c->sector_size];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) len = ref_totlen(c, jeb, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) /* If it should be REF_NORMAL, it'll get marked as such when
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) we build the fragtree, shortly. No need to worry about GC
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) moving it while it's marked REF_PRISTINE -- GC won't happen
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) till we've finished checking every inode anyway. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) ref->flash_offset |= REF_PRISTINE;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) * Mark the node as having been checked and fix the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) * accounting accordingly.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) jeb->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) jeb->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) c->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) c->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) free_out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) if(!pointed)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) kfree(buffer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) #ifndef __ECOS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) mtd_unpoint(c->mtd, ofs, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) * Helper function for jffs2_add_older_frag_to_fragtree().
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) * Checks the node if we are in the checking stage.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) static int check_tn_node(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) BUG_ON(ref_obsolete(tn->fn->raw));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) /* We only check the data CRC of unchecked nodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) if (ref_flags(tn->fn->raw) != REF_UNCHECKED)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) dbg_readinode("check node %#04x-%#04x, phys offs %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) ret = check_node_data(c, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) if (unlikely(ret < 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) JFFS2_ERROR("check_node_data() returned error: %d.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) ret);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) } else if (unlikely(ret > 0)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) dbg_readinode("CRC error, mark it obsolete.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) jffs2_mark_node_obsolete(c, tn->fn->raw);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) struct rb_node *next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) struct jffs2_tmp_dnode_info *tn = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) dbg_readinode("root %p, offset %d\n", tn_root, offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) next = tn_root->rb_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) while (next) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) if (tn->fn->ofs < offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) next = tn->rb.rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) else if (tn->fn->ofs >= offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) next = tn->rb.rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) return tn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) static void jffs2_kill_tn(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) jffs2_mark_node_obsolete(c, tn->fn->raw);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) jffs2_free_full_dnode(tn->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) jffs2_free_tmp_dnode_info(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) * This function is used when we read an inode. Data nodes arrive in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) * arbitrary order -- they may be older or newer than the nodes which
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) * are already in the tree. Where overlaps occur, the older node can
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) * be discarded as long as the newer passes the CRC check. We don't
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) * bother to keep track of holes in this rbtree, and neither do we deal
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) * with frags -- we can have multiple entries starting at the same
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) * offset, and the one with the smallest length will come first in the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) * ordering.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) * Returns 0 if the node was handled (including marking it obsolete)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) * < 0 an if error occurred
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) static int jffs2_add_tn_to_tree(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) struct jffs2_readinode_info *rii,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) struct jffs2_tmp_dnode_info *tn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) uint32_t fn_end = tn->fn->ofs + tn->fn->size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) struct jffs2_tmp_dnode_info *this, *ptn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) dbg_readinode("insert fragment %#04x-%#04x, ver %u at %08x\n", tn->fn->ofs, fn_end, tn->version, ref_offset(tn->fn->raw));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) /* If a node has zero dsize, we only have to keep it if it might be the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) node with highest version -- i.e. the one which will end up as f->metadata.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) Note that such nodes won't be REF_UNCHECKED since there are no data to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) check anyway. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) if (!tn->fn->size) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) if (rii->mdata_tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) if (rii->mdata_tn->version < tn->version) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) /* We had a candidate mdata node already */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) dbg_readinode("kill old mdata with ver %d\n", rii->mdata_tn->version);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) jffs2_kill_tn(c, rii->mdata_tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) dbg_readinode("kill new mdata with ver %d (older than existing %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) tn->version, rii->mdata_tn->version);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) jffs2_kill_tn(c, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) rii->mdata_tn = tn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) dbg_readinode("keep new mdata with ver %d\n", tn->version);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) return 0;
^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) /* Find the earliest node which _may_ be relevant to this one */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) this = jffs2_lookup_tn(&rii->tn_root, tn->fn->ofs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) if (this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) /* If the node is coincident with another at a lower address,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) back up until the other node is found. It may be relevant */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) while (this->overlapped) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) ptn = tn_prev(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) if (!ptn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) * We killed a node which set the overlapped
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) * flags during the scan. Fix it up.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) this->overlapped = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) this = ptn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) dbg_readinode("'this' found %#04x-%#04x (%s)\n", this->fn->ofs, this->fn->ofs + this->fn->size, this->fn ? "data" : "hole");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) while (this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) if (this->fn->ofs > fn_end)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) dbg_readinode("Ponder this ver %d, 0x%x-0x%x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) this->version, this->fn->ofs, this->fn->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) if (this->version == tn->version) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) /* Version number collision means REF_PRISTINE GC. Accept either of them
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) as long as the CRC is correct. Check the one we have already... */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) if (!check_tn_node(c, this)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) /* The one we already had was OK. Keep it and throw away the new one */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) dbg_readinode("Like old node. Throw away new\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) jffs2_kill_tn(c, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) /* Who cares if the new one is good; keep it for now anyway. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) dbg_readinode("Like new node. Throw away old\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) rb_replace_node(&this->rb, &tn->rb, &rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) jffs2_kill_tn(c, this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) /* Same overlapping from in front and behind */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) if (this->version < tn->version &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) this->fn->ofs >= tn->fn->ofs &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) this->fn->ofs + this->fn->size <= fn_end) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) /* New node entirely overlaps 'this' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) if (check_tn_node(c, tn)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) dbg_readinode("new node bad CRC\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) jffs2_kill_tn(c, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) while (this && this->fn->ofs + this->fn->size <= fn_end) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) struct jffs2_tmp_dnode_info *next = tn_next(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) if (this->version < tn->version) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) tn_erase(this, &rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) dbg_readinode("Kill overlapped ver %d, 0x%x-0x%x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) this->fn->ofs+this->fn->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) jffs2_kill_tn(c, this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) this = next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) dbg_readinode("Done killing overlapped nodes\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) if (this->version > tn->version &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317) this->fn->ofs <= tn->fn->ofs &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) this->fn->ofs+this->fn->size >= fn_end) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) /* New node entirely overlapped by 'this' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) if (!check_tn_node(c, this)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) dbg_readinode("Good CRC on old node. Kill new\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) jffs2_kill_tn(c, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) /* ... but 'this' was bad. Replace it... */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) dbg_readinode("Bad CRC on old overlapping node. Kill it\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) tn_erase(this, &rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) jffs2_kill_tn(c, this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) this = tn_next(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) /* We neither completely obsoleted nor were completely
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) obsoleted by an earlier node. Insert into the tree */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) struct rb_node *parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) struct rb_node **link = &rii->tn_root.rb_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) struct jffs2_tmp_dnode_info *insert_point = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) while (*link) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) parent = *link;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) if (tn->fn->ofs > insert_point->fn->ofs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) link = &insert_point->rb.rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) else if (tn->fn->ofs < insert_point->fn->ofs ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) tn->fn->size < insert_point->fn->size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) link = &insert_point->rb.rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) link = &insert_point->rb.rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) rb_link_node(&tn->rb, &insert_point->rb, link);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) rb_insert_color(&tn->rb, &rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) /* If there's anything behind that overlaps us, note it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358) this = tn_prev(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) if (this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) while (1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) if (this->fn->ofs + this->fn->size > tn->fn->ofs) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) dbg_readinode("Node is overlapped by %p (v %d, 0x%x-0x%x)\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) this, this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) this->fn->ofs+this->fn->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) tn->overlapped = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) if (!this->overlapped)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) ptn = tn_prev(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) if (!ptn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) * We killed a node which set the overlapped
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) * flags during the scan. Fix it up.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) this->overlapped = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) this = ptn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) /* If the new node overlaps anything ahead, note it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) this = tn_next(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) while (this && this->fn->ofs < fn_end) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) this->overlapped = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) dbg_readinode("Node ver %d, 0x%x-0x%x is overlapped\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) this->fn->ofs+this->fn->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) this = tn_next(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) /* Trivial function to remove the last node in the tree. Which by definition
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) has no right-hand child — so can be removed just by making its left-hand
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) child (if any) take its place under its parent. Since this is only done
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) when we're consuming the whole tree, there's no need to use rb_erase()
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) and let it worry about adjusting colours and balancing the tree. That
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) would just be a waste of time. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) static void eat_last(struct rb_root *root, struct rb_node *node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) struct rb_node *parent = rb_parent(node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) struct rb_node **link;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) /* LAST! */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) BUG_ON(node->rb_right);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) if (!parent)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) link = &root->rb_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) else if (node == parent->rb_left)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) link = &parent->rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) link = &parent->rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) *link = node->rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) if (node->rb_left)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) node->rb_left->__rb_parent_color = node->__rb_parent_color;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) /* We put the version tree in reverse order, so we can use the same eat_last()
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) function that we use to consume the tmpnode tree (tn_root). */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) struct rb_node **link = &ver_root->rb_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) struct rb_node *parent = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) struct jffs2_tmp_dnode_info *this_tn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) while (*link) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) parent = *link;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) this_tn = rb_entry(parent, struct jffs2_tmp_dnode_info, rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) if (tn->version > this_tn->version)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) link = &parent->rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) link = &parent->rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) dbg_readinode("Link new node at %p (root is %p)\n", link, ver_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) rb_link_node(&tn->rb, parent, link);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) rb_insert_color(&tn->rb, ver_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) /* Build final, normal fragtree from tn tree. It doesn't matter which order
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) we add nodes to the real fragtree, as long as they don't overlap. And
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) having thrown away the majority of overlapped nodes as we went, there
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) really shouldn't be many sets of nodes which do overlap. If we start at
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) the end, we can use the overlap markers -- we can just eat nodes which
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) aren't overlapped, and when we encounter nodes which _do_ overlap we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) sort them all into a temporary tree in version order before replaying them. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451) static int jffs2_build_inode_fragtree(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) struct jffs2_inode_info *f,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) struct jffs2_readinode_info *rii)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) struct jffs2_tmp_dnode_info *pen, *last, *this;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) struct rb_root ver_root = RB_ROOT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) uint32_t high_ver = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) if (rii->mdata_tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) dbg_readinode("potential mdata is ver %d at %p\n", rii->mdata_tn->version, rii->mdata_tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) high_ver = rii->mdata_tn->version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) rii->latest_ref = rii->mdata_tn->fn->raw;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) #ifdef JFFS2_DBG_READINODE_MESSAGES
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) this = tn_last(&rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) while (this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) dbg_readinode("tn %p ver %d range 0x%x-0x%x ov %d\n", this, this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) this->fn->ofs+this->fn->size, this->overlapped);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) this = tn_prev(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) pen = tn_last(&rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) while ((last = pen)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) pen = tn_prev(last);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) eat_last(&rii->tn_root, &last->rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) ver_insert(&ver_root, last);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) if (unlikely(last->overlapped)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) if (pen)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) continue;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) * We killed a node which set the overlapped
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) * flags during the scan. Fix it up.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) last->overlapped = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) /* Now we have a bunch of nodes in reverse version
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) order, in the tree at ver_root. Most of the time,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) there'll actually be only one node in the 'tree',
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) in fact. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) this = tn_last(&ver_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) while (this) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) struct jffs2_tmp_dnode_info *vers_next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) vers_next = tn_prev(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) eat_last(&ver_root, &this->rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) if (check_tn_node(c, this)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) dbg_readinode("node ver %d, 0x%x-0x%x failed CRC\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) this->fn->ofs+this->fn->size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) jffs2_kill_tn(c, this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506) if (this->version > high_ver) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) /* Note that this is different from the other
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) highest_version, because this one is only
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) counting _valid_ nodes which could give the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) latest inode metadata */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) high_ver = this->version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) rii->latest_ref = this->fn->raw;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) dbg_readinode("Add %p (v %d, 0x%x-0x%x, ov %d) to fragtree\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) this, this->version, this->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516) this->fn->ofs+this->fn->size, this->overlapped);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) ret = jffs2_add_full_dnode_to_inode(c, f, this->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) /* Free the nodes in vers_root; let the caller
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521) deal with the rest */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) JFFS2_ERROR("Add node to tree failed %d\n", ret);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) while (1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) vers_next = tn_prev(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525) if (check_tn_node(c, this))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) jffs2_mark_node_obsolete(c, this->fn->raw);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) jffs2_free_full_dnode(this->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528) jffs2_free_tmp_dnode_info(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) this = vers_next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530) if (!this)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) eat_last(&ver_root, &vers_next->rb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536) jffs2_free_tmp_dnode_info(this);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538) this = vers_next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544) static void jffs2_free_tmp_dnode_info_list(struct rb_root *list)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) struct jffs2_tmp_dnode_info *tn, *next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) rbtree_postorder_for_each_entry_safe(tn, next, list, rb) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) jffs2_free_full_dnode(tn->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550) jffs2_free_tmp_dnode_info(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553) *list = RB_ROOT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) static void jffs2_free_full_dirent_list(struct jffs2_full_dirent *fd)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558) struct jffs2_full_dirent *next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) while (fd) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) next = fd->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) jffs2_free_full_dirent(fd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) fd = next;
^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)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) /* Returns first valid node after 'ref'. May return 'ref' */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) static struct jffs2_raw_node_ref *jffs2_first_valid_node(struct jffs2_raw_node_ref *ref)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) while (ref && ref->next_in_ino) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) if (!ref_obsolete(ref))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572) return ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) dbg_noderef("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) ref = ref->next_in_ino;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577) }
^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) * Helper function for jffs2_get_inode_nodes().
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) * It is called every time an directory entry node is found.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) * Returns: 0 on success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586) static inline int read_direntry(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) struct jffs2_raw_dirent *rd, size_t read,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588) struct jffs2_readinode_info *rii)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) struct jffs2_full_dirent *fd;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) uint32_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) BUG_ON(ref_obsolete(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) crc = crc32(0, rd, sizeof(*rd) - 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) if (unlikely(crc != je32_to_cpu(rd->node_crc))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) JFFS2_NOTICE("header CRC failed on dirent node at %#08x: read %#08x, calculated %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) ref_offset(ref), je32_to_cpu(rd->node_crc), crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604) /* If we've never checked the CRCs on this node, check them now */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) if (ref_flags(ref) == REF_UNCHECKED) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) struct jffs2_eraseblock *jeb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607) int len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) /* Sanity check */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610) if (unlikely(PAD((rd->nsize + sizeof(*rd))) != PAD(je32_to_cpu(rd->totlen)))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612) ref_offset(ref), rd->nsize, je32_to_cpu(rd->totlen));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) jeb = &c->blocks[ref->flash_offset / c->sector_size];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) len = ref_totlen(c, jeb, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) jeb->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) jeb->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) c->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624) c->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) ref->flash_offset = ref_offset(ref) | dirent_node_state(rd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626) spin_unlock(&c->erase_completion_lock);
^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) fd = jffs2_alloc_full_dirent(rd->nsize + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) if (unlikely(!fd))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) fd->raw = ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) fd->version = je32_to_cpu(rd->version);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635) fd->ino = je32_to_cpu(rd->ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) fd->type = rd->type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) if (fd->version > rii->highest_version)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) rii->highest_version = fd->version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641) /* Pick out the mctime of the latest dirent */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) if(fd->version > rii->mctime_ver && je32_to_cpu(rd->mctime)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) rii->mctime_ver = fd->version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644) rii->latest_mctime = je32_to_cpu(rd->mctime);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) * Copy as much of the name as possible from the raw
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649) * dirent we've already read from the flash.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) if (read > sizeof(*rd))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) memcpy(&fd->name[0], &rd->name[0],
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653) min_t(uint32_t, rd->nsize, (read - sizeof(*rd)) ));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) /* Do we need to copy any more of the name directly from the flash? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656) if (rd->nsize + sizeof(*rd) > read) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) /* FIXME: point() */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) int err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659) int already = read - sizeof(*rd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) err = jffs2_flash_read(c, (ref_offset(ref)) + read,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) rd->nsize - already, &read, &fd->name[already]);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663) if (unlikely(read != rd->nsize - already) && likely(!err)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) jffs2_free_full_dirent(fd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) JFFS2_ERROR("short read: wanted %d bytes, got %zd\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666) rd->nsize - already, read);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) if (unlikely(err)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) JFFS2_ERROR("read remainder of name: error %d\n", err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672) jffs2_free_full_dirent(fd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) return -EIO;
^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) #ifdef CONFIG_JFFS2_SUMMARY
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) * we use CONFIG_JFFS2_SUMMARY because without it, we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) * have checked it while mounting
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681) crc = crc32(0, fd->name, rd->nsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) if (unlikely(crc != je32_to_cpu(rd->name_crc))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683) JFFS2_NOTICE("name CRC failed on dirent node at"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) "%#08x: read %#08x,calculated %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685) ref_offset(ref), je32_to_cpu(rd->node_crc), crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) jffs2_free_full_dirent(fd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) #endif
^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) fd->nhash = full_name_hash(NULL, fd->name, rd->nsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) fd->next = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) fd->name[rd->nsize] = '\0';
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) * Wheee. We now have a complete jffs2_full_dirent structure, with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) * the name in it and everything. Link it into the list
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701) jffs2_add_fd_to_list(c, fd, &rii->fds);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) * Helper function for jffs2_get_inode_nodes().
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) * It is called every time an inode node is found.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) * Returns: 0 on success (possibly after marking a bad node obsolete);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) static inline int read_dnode(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) struct jffs2_raw_inode *rd, int rdlen,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 715) struct jffs2_readinode_info *rii)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 716) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 717) struct jffs2_tmp_dnode_info *tn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 718) uint32_t len, csize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 719) int ret = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 720) uint32_t crc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 721)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 722) /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 723) BUG_ON(ref_obsolete(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 724)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 725) crc = crc32(0, rd, sizeof(*rd) - 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 726) if (unlikely(crc != je32_to_cpu(rd->node_crc))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 727) JFFS2_NOTICE("node CRC failed on dnode at %#08x: read %#08x, calculated %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 728) ref_offset(ref), je32_to_cpu(rd->node_crc), crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 729) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 730) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 731) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 732)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 733) tn = jffs2_alloc_tmp_dnode_info();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 734) if (!tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 735) JFFS2_ERROR("failed to allocate tn (%zu bytes).\n", sizeof(*tn));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 736) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 737) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 738)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 739) tn->partial_crc = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 740) csize = je32_to_cpu(rd->csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 741)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 742) /* If we've never checked the CRCs on this node, check them now */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 743) if (ref_flags(ref) == REF_UNCHECKED) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 744)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 745) /* Sanity checks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 746) if (unlikely(je32_to_cpu(rd->offset) > je32_to_cpu(rd->isize)) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 747) unlikely(PAD(je32_to_cpu(rd->csize) + sizeof(*rd)) != PAD(je32_to_cpu(rd->totlen)))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 748) JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 749) jffs2_dbg_dump_node(c, ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 750) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 751) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 752) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 753)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 754) if (jffs2_is_writebuffered(c) && csize != 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 755) /* At this point we are supposed to check the data CRC
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 756) * of our unchecked node. But thus far, we do not
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 757) * know whether the node is valid or obsolete. To
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 758) * figure this out, we need to walk all the nodes of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 759) * the inode and build the inode fragtree. We don't
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 760) * want to spend time checking data of nodes which may
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 761) * later be found to be obsolete. So we put off the full
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 762) * data CRC checking until we have read all the inode
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 763) * nodes and have started building the fragtree.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 764) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 765) * The fragtree is being built starting with nodes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 766) * having the highest version number, so we'll be able
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 767) * to detect whether a node is valid (i.e., it is not
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 768) * overlapped by a node with higher version) or not.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 769) * And we'll be able to check only those nodes, which
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 770) * are not obsolete.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 771) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 772) * Of course, this optimization only makes sense in case
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 773) * of NAND flashes (or other flashes with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 774) * !jffs2_can_mark_obsolete()), since on NOR flashes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 775) * nodes are marked obsolete physically.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 776) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 777) * Since NAND flashes (or other flashes with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 778) * jffs2_is_writebuffered(c)) are anyway read by
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 779) * fractions of c->wbuf_pagesize, and we have just read
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 780) * the node header, it is likely that the starting part
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 781) * of the node data is also read when we read the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 782) * header. So we don't mind to check the CRC of the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 783) * starting part of the data of the node now, and check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 784) * the second part later (in jffs2_check_node_data()).
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 785) * Of course, we will not need to re-read and re-check
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 786) * the NAND page which we have just read. This is why we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 787) * read the whole NAND page at jffs2_get_inode_nodes(),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 788) * while we needed only the node header.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 789) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 790) unsigned char *buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 791)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 792) /* 'buf' will point to the start of data */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 793) buf = (unsigned char *)rd + sizeof(*rd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 794) /* len will be the read data length */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 795) len = min_t(uint32_t, rdlen - sizeof(*rd), csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 796) tn->partial_crc = crc32(0, buf, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 797)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 798) dbg_readinode("Calculates CRC (%#08x) for %d bytes, csize %d\n", tn->partial_crc, len, csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 799)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 800) /* If we actually calculated the whole data CRC
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 801) * and it is wrong, drop the node. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 802) if (len >= csize && unlikely(tn->partial_crc != je32_to_cpu(rd->data_crc))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 803) JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 804) ref_offset(ref), tn->partial_crc, je32_to_cpu(rd->data_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 805) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 806) goto free_out;
^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) } else if (csize == 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 810) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 811) * We checked the header CRC. If the node has no data, adjust
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 812) * the space accounting now. For other nodes this will be done
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 813) * later either when the node is marked obsolete or when its
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 814) * data is checked.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 815) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 816) struct jffs2_eraseblock *jeb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 817)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 818) dbg_readinode("the node has no data.\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 819) jeb = &c->blocks[ref->flash_offset / c->sector_size];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 820) len = ref_totlen(c, jeb, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 821)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 822) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 823) jeb->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 824) jeb->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 825) c->used_size += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 826) c->unchecked_size -= len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 827) ref->flash_offset = ref_offset(ref) | REF_NORMAL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 828) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 829) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 830) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 831)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 832) tn->fn = jffs2_alloc_full_dnode();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 833) if (!tn->fn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 834) JFFS2_ERROR("alloc fn failed\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 835) ret = -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 836) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 837) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 838)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 839) tn->version = je32_to_cpu(rd->version);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 840) tn->fn->ofs = je32_to_cpu(rd->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 841) tn->data_crc = je32_to_cpu(rd->data_crc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 842) tn->csize = csize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 843) tn->fn->raw = ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 844) tn->overlapped = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 845)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 846) if (tn->version > rii->highest_version)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 847) rii->highest_version = tn->version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 848)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 849) /* There was a bug where we wrote hole nodes out with
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 850) csize/dsize swapped. Deal with it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 851) if (rd->compr == JFFS2_COMPR_ZERO && !je32_to_cpu(rd->dsize) && csize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 852) tn->fn->size = csize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 853) else // normal case...
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 854) tn->fn->size = je32_to_cpu(rd->dsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 855)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 856) dbg_readinode2("dnode @%08x: ver %u, offset %#04x, dsize %#04x, csize %#04x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 857) ref_offset(ref), je32_to_cpu(rd->version),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 858) je32_to_cpu(rd->offset), je32_to_cpu(rd->dsize), csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 859)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 860) ret = jffs2_add_tn_to_tree(c, rii, tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 861)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 862) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 863) jffs2_free_full_dnode(tn->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 864) free_out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 865) jffs2_free_tmp_dnode_info(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 866) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 867) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 868) #ifdef JFFS2_DBG_READINODE2_MESSAGES
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 869) dbg_readinode2("After adding ver %d:\n", je32_to_cpu(rd->version));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 870) tn = tn_first(&rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 871) while (tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 872) dbg_readinode2("%p: v %d r 0x%x-0x%x ov %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 873) tn, tn->version, tn->fn->ofs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 874) tn->fn->ofs+tn->fn->size, tn->overlapped);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 875) tn = tn_next(tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 876) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 877) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 878) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 879) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 880)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 881) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 882) * Helper function for jffs2_get_inode_nodes().
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 883) * It is called every time an unknown node is found.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 884) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 885) * Returns: 0 on success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 886) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 887) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 888) static inline int read_unknown(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, struct jffs2_unknown_node *un)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 889) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 890) /* We don't mark unknown nodes as REF_UNCHECKED */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 891) if (ref_flags(ref) == REF_UNCHECKED) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 892) JFFS2_ERROR("REF_UNCHECKED but unknown node at %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 893) ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 894) JFFS2_ERROR("Node is {%04x,%04x,%08x,%08x}. Please report this error.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 895) je16_to_cpu(un->magic), je16_to_cpu(un->nodetype),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 896) je32_to_cpu(un->totlen), je32_to_cpu(un->hdr_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 897) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 898) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 899) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 900)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 901) un->nodetype = cpu_to_je16(JFFS2_NODE_ACCURATE | je16_to_cpu(un->nodetype));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 902)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 903) switch(je16_to_cpu(un->nodetype) & JFFS2_COMPAT_MASK) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 904)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 905) case JFFS2_FEATURE_INCOMPAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 906) JFFS2_ERROR("unknown INCOMPAT nodetype %#04X at %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 907) je16_to_cpu(un->nodetype), ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 908) /* EEP */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 909) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 910) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 911)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 912) case JFFS2_FEATURE_ROCOMPAT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 913) JFFS2_ERROR("unknown ROCOMPAT nodetype %#04X at %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 914) je16_to_cpu(un->nodetype), ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 915) BUG_ON(!(c->flags & JFFS2_SB_FLAG_RO));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 916) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 917)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 918) case JFFS2_FEATURE_RWCOMPAT_COPY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 919) JFFS2_NOTICE("unknown RWCOMPAT_COPY nodetype %#04X at %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 920) je16_to_cpu(un->nodetype), ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 921) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 922)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 923) case JFFS2_FEATURE_RWCOMPAT_DELETE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 924) JFFS2_NOTICE("unknown RWCOMPAT_DELETE nodetype %#04X at %#08x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 925) je16_to_cpu(un->nodetype), ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 926) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 927) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 928) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 929)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 930) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 931) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 932)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 933) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 934) * Helper function for jffs2_get_inode_nodes().
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 935) * The function detects whether more data should be read and reads it if yes.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 936) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 937) * Returns: 0 on success;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 938) * negative error code on failure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 939) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 940) static int read_more(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 941) int needed_len, int *rdlen, unsigned char *buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 942) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 943) int err, to_read = needed_len - *rdlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 944) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 945) uint32_t offs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 946)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 947) if (jffs2_is_writebuffered(c)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 948) int rem = to_read % c->wbuf_pagesize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 949)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 950) if (rem)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 951) to_read += c->wbuf_pagesize - rem;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 952) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 953)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 954) /* We need to read more data */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 955) offs = ref_offset(ref) + *rdlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 956)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 957) dbg_readinode("read more %d bytes\n", to_read);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 958)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 959) err = jffs2_flash_read(c, offs, to_read, &retlen, buf + *rdlen);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 960) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 961) JFFS2_ERROR("can not read %d bytes from 0x%08x, "
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 962) "error code: %d.\n", to_read, offs, err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 963) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 964) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 965)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 966) if (retlen < to_read) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 967) JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 968) offs, retlen, to_read);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 969) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 970) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 971)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 972) *rdlen += to_read;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 973) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 974) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 975)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 976) /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 977) with this ino. Perform a preliminary ordering on data nodes, throwing away
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 978) those which are completely obsoleted by newer ones. The naïve approach we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 979) use to take of just returning them _all_ in version order will cause us to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 980) run out of memory in certain degenerate cases. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 981) static int jffs2_get_inode_nodes(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 982) struct jffs2_readinode_info *rii)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 983) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 984) struct jffs2_raw_node_ref *ref, *valid_ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 985) unsigned char *buf = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 986) union jffs2_node_union *node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 987) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 988) int len, err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 989)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 990) rii->mctime_ver = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 991)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 992) dbg_readinode("ino #%u\n", f->inocache->ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 993)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 994) /* FIXME: in case of NOR and available ->point() this
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 995) * needs to be fixed. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 996) len = sizeof(union jffs2_node_union) + c->wbuf_pagesize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 997) buf = kmalloc(len, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 998) if (!buf)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 999) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1000)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1001) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1002) valid_ref = jffs2_first_valid_node(f->inocache->nodes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1003) if (!valid_ref && f->inocache->ino != 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1004) JFFS2_WARNING("Eep. No valid nodes for ino #%u.\n", f->inocache->ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1005) while (valid_ref) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1006) /* We can hold a pointer to a non-obsolete node without the spinlock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1007) but _obsolete_ nodes may disappear at any time, if the block
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1008) they're in gets erased. So if we mark 'ref' obsolete while we're
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1009) not holding the lock, it can go away immediately. For that reason,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1010) we find the next valid node first, before processing 'ref'.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1011) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1012) ref = valid_ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1013) valid_ref = jffs2_first_valid_node(ref->next_in_ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1014) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1015)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1016) cond_resched();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1017)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1018) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1019) * At this point we don't know the type of the node we're going
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1020) * to read, so we do not know the size of its header. In order
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1021) * to minimize the amount of flash IO we assume the header is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1022) * of size = JFFS2_MIN_NODE_HEADER.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1023) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1024) len = JFFS2_MIN_NODE_HEADER;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1025) if (jffs2_is_writebuffered(c)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1026) int end, rem;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1027)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1028) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1029) * We are about to read JFFS2_MIN_NODE_HEADER bytes,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1030) * but this flash has some minimal I/O unit. It is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1031) * possible that we'll need to read more soon, so read
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1032) * up to the next min. I/O unit, in order not to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1033) * re-read the same min. I/O unit twice.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1034) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1035) end = ref_offset(ref) + len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1036) rem = end % c->wbuf_pagesize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1037) if (rem)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1038) end += c->wbuf_pagesize - rem;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1039) len = end - ref_offset(ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1040) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1041)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1042) dbg_readinode("read %d bytes at %#08x(%d).\n", len, ref_offset(ref), ref_flags(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1043)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1044) /* FIXME: point() */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1045) err = jffs2_flash_read(c, ref_offset(ref), len, &retlen, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1046) if (err) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1047) JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ref_offset(ref), err);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1048) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1049) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1050)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1051) if (retlen < len) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1052) JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", ref_offset(ref), retlen, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1053) err = -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1054) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1055) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1056)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1057) node = (union jffs2_node_union *)buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1058)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1059) /* No need to mask in the valid bit; it shouldn't be invalid */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1060) if (je32_to_cpu(node->u.hdr_crc) != crc32(0, node, sizeof(node->u)-4)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1061) JFFS2_NOTICE("Node header CRC failed at %#08x. {%04x,%04x,%08x,%08x}\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1062) ref_offset(ref), je16_to_cpu(node->u.magic),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1063) je16_to_cpu(node->u.nodetype),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1064) je32_to_cpu(node->u.totlen),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1065) je32_to_cpu(node->u.hdr_crc));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1066) jffs2_dbg_dump_node(c, ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1067) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1068) goto cont;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1069) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1070) if (je16_to_cpu(node->u.magic) != JFFS2_MAGIC_BITMASK) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1071) /* Not a JFFS2 node, whinge and move on */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1072) JFFS2_NOTICE("Wrong magic bitmask 0x%04x in node header at %#08x.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1073) je16_to_cpu(node->u.magic), ref_offset(ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1074) jffs2_mark_node_obsolete(c, ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1075) goto cont;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1076) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1077)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1078) switch (je16_to_cpu(node->u.nodetype)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1079)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1080) case JFFS2_NODETYPE_DIRENT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1081)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1082) if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_dirent) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1083) len < sizeof(struct jffs2_raw_dirent)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1084) err = read_more(c, ref, sizeof(struct jffs2_raw_dirent), &len, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1085) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1086) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1087) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1088)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1089) err = read_direntry(c, ref, &node->d, retlen, rii);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1090) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1091) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1092)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1093) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1094)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1095) case JFFS2_NODETYPE_INODE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1096)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1097) if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_inode) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1098) len < sizeof(struct jffs2_raw_inode)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1099) err = read_more(c, ref, sizeof(struct jffs2_raw_inode), &len, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1100) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1101) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1102) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1103)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1104) err = read_dnode(c, ref, &node->i, len, rii);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1105) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1106) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1107)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1108) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1109)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1110) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1111) if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_unknown_node) &&
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1112) len < sizeof(struct jffs2_unknown_node)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1113) err = read_more(c, ref, sizeof(struct jffs2_unknown_node), &len, buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1114) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1115) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1116) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1117)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1118) err = read_unknown(c, ref, &node->u);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1119) if (unlikely(err))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1120) goto free_out;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1121)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1122) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1123) cont:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1124) spin_lock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1125) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1126)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1127) spin_unlock(&c->erase_completion_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1128) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1130) f->highest_version = rii->highest_version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1131)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1132) dbg_readinode("nodes of inode #%u were read, the highest version is %u, latest_mctime %u, mctime_ver %u.\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1133) f->inocache->ino, rii->highest_version, rii->latest_mctime,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1134) rii->mctime_ver);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1135) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1136)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1137) free_out:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1138) jffs2_free_tmp_dnode_info_list(&rii->tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1139) jffs2_free_full_dirent_list(rii->fds);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1140) rii->fds = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1141) kfree(buf);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1142) return err;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1143) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1144)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1145) static int jffs2_do_read_inode_internal(struct jffs2_sb_info *c,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1146) struct jffs2_inode_info *f,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1147) struct jffs2_raw_inode *latest_node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1148) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1149) struct jffs2_readinode_info rii;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1150) uint32_t crc, new_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1151) size_t retlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1152) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1153)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1154) dbg_readinode("ino #%u pino/nlink is %d\n", f->inocache->ino,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1155) f->inocache->pino_nlink);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1156)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1157) memset(&rii, 0, sizeof(rii));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1158)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1159) /* Grab all nodes relevant to this ino */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1160) ret = jffs2_get_inode_nodes(c, f, &rii);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1161)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1162) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1163) JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1164) if (f->inocache->state == INO_STATE_READING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1165) jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1166) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1167) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1168)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1169) ret = jffs2_build_inode_fragtree(c, f, &rii);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1170) if (ret) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1171) JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1172) f->inocache->ino, ret);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1173) if (f->inocache->state == INO_STATE_READING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1174) jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1175) jffs2_free_tmp_dnode_info_list(&rii.tn_root);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1176) /* FIXME: We could at least crc-check them all */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1177) if (rii.mdata_tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1178) jffs2_free_full_dnode(rii.mdata_tn->fn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1179) jffs2_free_tmp_dnode_info(rii.mdata_tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1180) rii.mdata_tn = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1181) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1182) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1183) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1184)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1185) if (rii.mdata_tn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1186) if (rii.mdata_tn->fn->raw == rii.latest_ref) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1187) f->metadata = rii.mdata_tn->fn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1188) jffs2_free_tmp_dnode_info(rii.mdata_tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1189) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1190) jffs2_kill_tn(c, rii.mdata_tn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1191) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1192) rii.mdata_tn = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1193) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1195) f->dents = rii.fds;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1196)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1197) jffs2_dbg_fragtree_paranoia_check_nolock(f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1198)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1199) if (unlikely(!rii.latest_ref)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1200) /* No data nodes for this inode. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1201) if (f->inocache->ino != 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1202) JFFS2_WARNING("no data nodes found for ino #%u\n", f->inocache->ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1203) if (!rii.fds) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1204) if (f->inocache->state == INO_STATE_READING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1205) jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1206) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1207) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1208) JFFS2_NOTICE("but it has children so we fake some modes for it\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1209) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1210) latest_node->mode = cpu_to_jemode(S_IFDIR|S_IRUGO|S_IWUSR|S_IXUGO);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1211) latest_node->version = cpu_to_je32(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1212) latest_node->atime = latest_node->ctime = latest_node->mtime = cpu_to_je32(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1213) latest_node->isize = cpu_to_je32(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1214) latest_node->gid = cpu_to_je16(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1215) latest_node->uid = cpu_to_je16(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1216) if (f->inocache->state == INO_STATE_READING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1217) jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1218) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1219) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1220)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1221) ret = jffs2_flash_read(c, ref_offset(rii.latest_ref), sizeof(*latest_node), &retlen, (void *)latest_node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1222) if (ret || retlen != sizeof(*latest_node)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1223) JFFS2_ERROR("failed to read from flash: error %d, %zd of %zd bytes read\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1224) ret, retlen, sizeof(*latest_node));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1225) /* FIXME: If this fails, there seems to be a memory leak. Find it. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1226) return ret ? ret : -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1227) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1228)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1229) crc = crc32(0, latest_node, sizeof(*latest_node)-8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1230) if (crc != je32_to_cpu(latest_node->node_crc)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1231) JFFS2_ERROR("CRC failed for read_inode of inode %u at physical location 0x%x\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1232) f->inocache->ino, ref_offset(rii.latest_ref));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1233) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1234) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1235)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1236) switch(jemode_to_cpu(latest_node->mode) & S_IFMT) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1237) case S_IFDIR:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1238) if (rii.mctime_ver > je32_to_cpu(latest_node->version)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1239) /* The times in the latest_node are actually older than
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1240) mctime in the latest dirent. Cheat. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1241) latest_node->ctime = latest_node->mtime = cpu_to_je32(rii.latest_mctime);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1242) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1243) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1244)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1245)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1246) case S_IFREG:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1247) /* If it was a regular file, truncate it to the latest node's isize */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1248) new_size = jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1249) if (new_size != je32_to_cpu(latest_node->isize)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1250) JFFS2_WARNING("Truncating ino #%u to %d bytes failed because it only had %d bytes to start with!\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1251) f->inocache->ino, je32_to_cpu(latest_node->isize), new_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1252) latest_node->isize = cpu_to_je32(new_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1253) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1254) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1255)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1256) case S_IFLNK:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1257) /* Hack to work around broken isize in old symlink code.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1258) Remove this when dwmw2 comes to his senses and stops
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1259) symlinks from being an entirely gratuitous special
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1260) case. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1261) if (!je32_to_cpu(latest_node->isize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1262) latest_node->isize = latest_node->dsize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1263)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1264) if (f->inocache->state != INO_STATE_CHECKING) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1265) /* Symlink's inode data is the target path. Read it and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1266) * keep in RAM to facilitate quick follow symlink
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1267) * operation. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1268) uint32_t csize = je32_to_cpu(latest_node->csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1269) if (csize > JFFS2_MAX_NAME_LEN)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1270) return -ENAMETOOLONG;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1271) f->target = kmalloc(csize + 1, GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1272) if (!f->target) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1273) JFFS2_ERROR("can't allocate %u bytes of memory for the symlink target path cache\n", csize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1274) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1275) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1276)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1277) ret = jffs2_flash_read(c, ref_offset(rii.latest_ref) + sizeof(*latest_node),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1278) csize, &retlen, (char *)f->target);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1280) if (ret || retlen != csize) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1281) if (retlen != csize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1282) ret = -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1283) kfree(f->target);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1284) f->target = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1285) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1286) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1287)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1288) f->target[csize] = '\0';
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1289) dbg_readinode("symlink's target '%s' cached\n", f->target);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1290) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1291)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1292) fallthrough;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1293)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1294) case S_IFBLK:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1295) case S_IFCHR:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1296) /* Certain inode types should have only one data node, and it's
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1297) kept as the metadata node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1298) if (f->metadata) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1299) JFFS2_ERROR("Argh. Special inode #%u with mode 0%o had metadata node\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1300) f->inocache->ino, jemode_to_cpu(latest_node->mode));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1301) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1302) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1303) if (!frag_first(&f->fragtree)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1304) JFFS2_ERROR("Argh. Special inode #%u with mode 0%o has no fragments\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1305) f->inocache->ino, jemode_to_cpu(latest_node->mode));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1306) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1307) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1308) /* ASSERT: f->fraglist != NULL */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1309) if (frag_next(frag_first(&f->fragtree))) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1310) JFFS2_ERROR("Argh. Special inode #%u with mode 0x%x had more than one node\n",
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1311) f->inocache->ino, jemode_to_cpu(latest_node->mode));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1312) /* FIXME: Deal with it - check crc32, check for duplicate node, check times and discard the older one */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1313) return -EIO;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1314) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1315) /* OK. We're happy */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1316) f->metadata = frag_first(&f->fragtree)->node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1317) jffs2_free_node_frag(frag_first(&f->fragtree));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1318) f->fragtree = RB_ROOT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1319) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1320) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1321) if (f->inocache->state == INO_STATE_READING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1322) jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1323)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1324) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1325) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1326)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1327) /* Scan the list of all nodes present for this ino, build map of versions, etc. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1328) int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1329) uint32_t ino, struct jffs2_raw_inode *latest_node)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1330) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1331) dbg_readinode("read inode #%u\n", ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1332)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1333) retry_inocache:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1334) spin_lock(&c->inocache_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1335) f->inocache = jffs2_get_ino_cache(c, ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1336)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1337) if (f->inocache) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1338) /* Check its state. We may need to wait before we can use it */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1339) switch(f->inocache->state) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1340) case INO_STATE_UNCHECKED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1341) case INO_STATE_CHECKEDABSENT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1342) f->inocache->state = INO_STATE_READING;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1343) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1345) case INO_STATE_CHECKING:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1346) case INO_STATE_GC:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1347) /* If it's in either of these states, we need
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1348) to wait for whoever's got it to finish and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1349) put it back. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1350) dbg_readinode("waiting for ino #%u in state %d\n", ino, f->inocache->state);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1351) sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1352) goto retry_inocache;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1353)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1354) case INO_STATE_READING:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1355) case INO_STATE_PRESENT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1356) /* Eep. This should never happen. It can
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1357) happen if Linux calls read_inode() again
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1358) before clear_inode() has finished though. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1359) JFFS2_ERROR("Eep. Trying to read_inode #%u when it's already in state %d!\n", ino, f->inocache->state);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1360) /* Fail. That's probably better than allowing it to succeed */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1361) f->inocache = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1362) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1363)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1364) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1365) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1366) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1367) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1368) spin_unlock(&c->inocache_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1369)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1370) if (!f->inocache && ino == 1) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1371) /* Special case - no root inode on medium */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1372) f->inocache = jffs2_alloc_inode_cache();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1373) if (!f->inocache) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1374) JFFS2_ERROR("cannot allocate inocache for root inode\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1375) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1376) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1377) dbg_readinode("creating inocache for root inode\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1378) memset(f->inocache, 0, sizeof(struct jffs2_inode_cache));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1379) f->inocache->ino = f->inocache->pino_nlink = 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1380) f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1381) f->inocache->state = INO_STATE_READING;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1382) jffs2_add_ino_cache(c, f->inocache);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1383) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1384) if (!f->inocache) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1385) JFFS2_ERROR("requested to read a nonexistent ino %u\n", ino);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1386) return -ENOENT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1387) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1388)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1389) return jffs2_do_read_inode_internal(c, f, latest_node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1390) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1391)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1392) int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1393) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1394) struct jffs2_raw_inode n;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1395) struct jffs2_inode_info *f = kzalloc(sizeof(*f), GFP_KERNEL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1396) int ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1398) if (!f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1399) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1400)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1401) mutex_init(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1402) mutex_lock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1403) f->inocache = ic;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1404)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1405) ret = jffs2_do_read_inode_internal(c, f, &n);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1406) mutex_unlock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1407) jffs2_do_clear_inode(c, f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1408) jffs2_xattr_do_crccheck_inode(c, ic);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1409) kfree (f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1410) return ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1411) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1412)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1413) void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1414) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1415) struct jffs2_full_dirent *fd, *fds;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1416) int deleted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1417)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1418) jffs2_xattr_delete_inode(c, f->inocache);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1419) mutex_lock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1420) deleted = f->inocache && !f->inocache->pino_nlink;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1422) if (f->inocache && f->inocache->state != INO_STATE_CHECKING)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1423) jffs2_set_inocache_state(c, f->inocache, INO_STATE_CLEARING);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1424)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1425) if (f->metadata) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1426) if (deleted)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1427) jffs2_mark_node_obsolete(c, f->metadata->raw);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1428) jffs2_free_full_dnode(f->metadata);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1429) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1430)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1431) jffs2_kill_fragtree(&f->fragtree, deleted?c:NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1432)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1433) fds = f->dents;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1434) while(fds) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1435) fd = fds;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1436) fds = fd->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1437) jffs2_free_full_dirent(fd);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1438) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1439)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1440) if (f->inocache && f->inocache->state != INO_STATE_CHECKING) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1441) jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1442) if (f->inocache->nodes == (void *)f->inocache)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1443) jffs2_del_ino_cache(c, f->inocache);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1444) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1445)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1446) mutex_unlock(&f->sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1447) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags