11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 Red Hat, Inc. 51da177e4SLinus Torvalds * 61da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 71da177e4SLinus Torvalds * 81da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 91da177e4SLinus Torvalds * 10737b7661SAndrew Lunn * $Id: readinode.c,v 1.133 2005/07/30 15:28:24 lunn Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 15737b7661SAndrew Lunn #include <linux/sched.h> 161da177e4SLinus Torvalds #include <linux/slab.h> 171da177e4SLinus Torvalds #include <linux/fs.h> 181da177e4SLinus Torvalds #include <linux/crc32.h> 191da177e4SLinus Torvalds #include <linux/pagemap.h> 201da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 211da177e4SLinus Torvalds #include <linux/compiler.h> 221da177e4SLinus Torvalds #include "nodelist.h" 231da177e4SLinus Torvalds 24f302cd02SArtem B. Bityutskiy void jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) 251da177e4SLinus Torvalds { 261da177e4SLinus Torvalds struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size); 271da177e4SLinus Torvalds 28e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("truncating fragtree to 0x%08x bytes\n", size); 291da177e4SLinus Torvalds 301da177e4SLinus Torvalds /* We know frag->ofs <= size. That's what lookup does for us */ 311da177e4SLinus Torvalds if (frag && frag->ofs != size) { 321da177e4SLinus Torvalds if (frag->ofs+frag->size >= size) { 33e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("truncating frag 0x%08x-0x%08x\n", frag->ofs, frag->ofs+frag->size); 341da177e4SLinus Torvalds frag->size = size - frag->ofs; 351da177e4SLinus Torvalds } 361da177e4SLinus Torvalds frag = frag_next(frag); 371da177e4SLinus Torvalds } 381da177e4SLinus Torvalds while (frag && frag->ofs >= size) { 391da177e4SLinus Torvalds struct jffs2_node_frag *next = frag_next(frag); 401da177e4SLinus Torvalds 41e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("removing frag 0x%08x-0x%08x\n", frag->ofs, frag->ofs+frag->size); 421da177e4SLinus Torvalds frag_erase(frag, list); 431da177e4SLinus Torvalds jffs2_obsolete_node_frag(c, frag); 441da177e4SLinus Torvalds frag = next; 451da177e4SLinus Torvalds } 461da177e4SLinus Torvalds } 471da177e4SLinus Torvalds 48f97117d1SArtem B. Bityutskiy /* 49f97117d1SArtem B. Bityutskiy * Put a new tmp_dnode_info into the temporaty RB-tree, keeping the list in 50f97117d1SArtem B. Bityutskiy * order of increasing version. 51f97117d1SArtem B. Bityutskiy */ 52f97117d1SArtem B. Bityutskiy static void jffs2_add_tn_to_tree(struct jffs2_tmp_dnode_info *tn, struct rb_root *list) 531da177e4SLinus Torvalds { 54f97117d1SArtem B. Bityutskiy struct rb_node **p = &list->rb_node; 55f97117d1SArtem B. Bityutskiy struct rb_node * parent = NULL; 56f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *this; 571da177e4SLinus Torvalds 58f97117d1SArtem B. Bityutskiy while (*p) { 59f97117d1SArtem B. Bityutskiy parent = *p; 60f97117d1SArtem B. Bityutskiy this = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); 611da177e4SLinus Torvalds 62f97117d1SArtem B. Bityutskiy /* There may actually be a collision here, but it doesn't 63f97117d1SArtem B. Bityutskiy actually matter. As long as the two nodes with the same 64f97117d1SArtem B. Bityutskiy version are together, it's all fine. */ 65f97117d1SArtem B. Bityutskiy if (tn->version < this->version) 66f97117d1SArtem B. Bityutskiy p = &(*p)->rb_left; 67f97117d1SArtem B. Bityutskiy else 68f97117d1SArtem B. Bityutskiy p = &(*p)->rb_right; 69f97117d1SArtem B. Bityutskiy } 701da177e4SLinus Torvalds 71f97117d1SArtem B. Bityutskiy rb_link_node(&tn->rb, parent, p); 72f97117d1SArtem B. Bityutskiy rb_insert_color(&tn->rb, list); 73f97117d1SArtem B. Bityutskiy } 74f97117d1SArtem B. Bityutskiy 75f97117d1SArtem B. Bityutskiy static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) 76f97117d1SArtem B. Bityutskiy { 77f97117d1SArtem B. Bityutskiy struct rb_node *this; 78f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 79f97117d1SArtem B. Bityutskiy 80f97117d1SArtem B. Bityutskiy this = list->rb_node; 81f97117d1SArtem B. Bityutskiy 82f97117d1SArtem B. Bityutskiy /* Now at bottom of tree */ 83f97117d1SArtem B. Bityutskiy while (this) { 84f97117d1SArtem B. Bityutskiy if (this->rb_left) 85f97117d1SArtem B. Bityutskiy this = this->rb_left; 86f97117d1SArtem B. Bityutskiy else if (this->rb_right) 87f97117d1SArtem B. Bityutskiy this = this->rb_right; 88f97117d1SArtem B. Bityutskiy else { 89f97117d1SArtem B. Bityutskiy tn = rb_entry(this, struct jffs2_tmp_dnode_info, rb); 90f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(tn->fn); 91f97117d1SArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 92f97117d1SArtem B. Bityutskiy 93f97117d1SArtem B. Bityutskiy this = this->rb_parent; 94f97117d1SArtem B. Bityutskiy if (!this) 951da177e4SLinus Torvalds break; 961da177e4SLinus Torvalds 97f97117d1SArtem B. Bityutskiy if (this->rb_left == &tn->rb) 98f97117d1SArtem B. Bityutskiy this->rb_left = NULL; 99f97117d1SArtem B. Bityutskiy else if (this->rb_right == &tn->rb) 100f97117d1SArtem B. Bityutskiy this->rb_right = NULL; 101f97117d1SArtem B. Bityutskiy else BUG(); 102f97117d1SArtem B. Bityutskiy } 103f97117d1SArtem B. Bityutskiy } 104f97117d1SArtem B. Bityutskiy list->rb_node = NULL; 105f97117d1SArtem B. Bityutskiy } 1061da177e4SLinus Torvalds 107f97117d1SArtem B. Bityutskiy static void jffs2_free_full_dirent_list(struct jffs2_full_dirent *fd) 108f97117d1SArtem B. Bityutskiy { 109f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *next; 110f97117d1SArtem B. Bityutskiy 111f97117d1SArtem B. Bityutskiy while (fd) { 112f97117d1SArtem B. Bityutskiy next = fd->next; 113f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 114f97117d1SArtem B. Bityutskiy fd = next; 115f97117d1SArtem B. Bityutskiy } 116f97117d1SArtem B. Bityutskiy } 117f97117d1SArtem B. Bityutskiy 118f97117d1SArtem B. Bityutskiy /* Returns first valid node after 'ref'. May return 'ref' */ 119f97117d1SArtem B. Bityutskiy static struct jffs2_raw_node_ref *jffs2_first_valid_node(struct jffs2_raw_node_ref *ref) 120f97117d1SArtem B. Bityutskiy { 121f97117d1SArtem B. Bityutskiy while (ref && ref->next_in_ino) { 122f97117d1SArtem B. Bityutskiy if (!ref_obsolete(ref)) 123f97117d1SArtem B. Bityutskiy return ref; 124e0d60137SArtem B. Bityutskiy JFFS2_DBG_NODEREF("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref)); 125f97117d1SArtem B. Bityutskiy ref = ref->next_in_ino; 126f97117d1SArtem B. Bityutskiy } 127f97117d1SArtem B. Bityutskiy return NULL; 128f97117d1SArtem B. Bityutskiy } 129f97117d1SArtem B. Bityutskiy 130f97117d1SArtem B. Bityutskiy /* 131f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 132f97117d1SArtem B. Bityutskiy * It is called every time an directory entry node is found. 133f97117d1SArtem B. Bityutskiy * 134f97117d1SArtem B. Bityutskiy * Returns: 0 on succes; 135f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 136f97117d1SArtem B. Bityutskiy * negative error code on failure. 137f97117d1SArtem B. Bityutskiy */ 138f97117d1SArtem B. Bityutskiy static inline int 139f97117d1SArtem B. Bityutskiy read_direntry(struct jffs2_sb_info *c, 140f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, 141f97117d1SArtem B. Bityutskiy struct jffs2_raw_dirent *rd, 142f97117d1SArtem B. Bityutskiy uint32_t read, 143f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent **fdp, 144f97117d1SArtem B. Bityutskiy int32_t *latest_mctime, 145f97117d1SArtem B. Bityutskiy uint32_t *mctime_ver) 146f97117d1SArtem B. Bityutskiy { 147f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *fd; 148f97117d1SArtem B. Bityutskiy 149f97117d1SArtem B. Bityutskiy /* The direntry nodes are checked during the flash scanning */ 150f97117d1SArtem B. Bityutskiy BUG_ON(ref_flags(ref) == REF_UNCHECKED); 151f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 152f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 153f97117d1SArtem B. Bityutskiy 154f97117d1SArtem B. Bityutskiy /* Sanity check */ 155f97117d1SArtem B. Bityutskiy if (unlikely(PAD((rd->nsize + sizeof(*rd))) != PAD(je32_to_cpu(rd->totlen)))) { 156e0d60137SArtem B. Bityutskiy JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n", 157f97117d1SArtem B. Bityutskiy ref_offset(ref), rd->nsize, je32_to_cpu(rd->totlen)); 158f97117d1SArtem B. Bityutskiy return 1; 159f97117d1SArtem B. Bityutskiy } 160f97117d1SArtem B. Bityutskiy 161f97117d1SArtem B. Bityutskiy fd = jffs2_alloc_full_dirent(rd->nsize + 1); 162f97117d1SArtem B. Bityutskiy if (unlikely(!fd)) 163f97117d1SArtem B. Bityutskiy return -ENOMEM; 164f97117d1SArtem B. Bityutskiy 165f97117d1SArtem B. Bityutskiy fd->raw = ref; 166f97117d1SArtem B. Bityutskiy fd->version = je32_to_cpu(rd->version); 167f97117d1SArtem B. Bityutskiy fd->ino = je32_to_cpu(rd->ino); 168f97117d1SArtem B. Bityutskiy fd->type = rd->type; 169f97117d1SArtem B. Bityutskiy 170f97117d1SArtem B. Bityutskiy /* Pick out the mctime of the latest dirent */ 171f97117d1SArtem B. Bityutskiy if(fd->version > *mctime_ver) { 172f97117d1SArtem B. Bityutskiy *mctime_ver = fd->version; 173f97117d1SArtem B. Bityutskiy *latest_mctime = je32_to_cpu(rd->mctime); 174f97117d1SArtem B. Bityutskiy } 175f97117d1SArtem B. Bityutskiy 176f97117d1SArtem B. Bityutskiy /* 177f97117d1SArtem B. Bityutskiy * Copy as much of the name as possible from the raw 178f97117d1SArtem B. Bityutskiy * dirent we've already read from the flash. 179f97117d1SArtem B. Bityutskiy */ 180f97117d1SArtem B. Bityutskiy if (read > sizeof(*rd)) 181f97117d1SArtem B. Bityutskiy memcpy(&fd->name[0], &rd->name[0], 182f97117d1SArtem B. Bityutskiy min_t(uint32_t, rd->nsize, (read - sizeof(*rd)) )); 183f97117d1SArtem B. Bityutskiy 184f97117d1SArtem B. Bityutskiy /* Do we need to copy any more of the name directly from the flash? */ 185f97117d1SArtem B. Bityutskiy if (rd->nsize + sizeof(*rd) > read) { 186f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 187f97117d1SArtem B. Bityutskiy int err; 188f97117d1SArtem B. Bityutskiy int already = read - sizeof(*rd); 189f97117d1SArtem B. Bityutskiy 190f97117d1SArtem B. Bityutskiy err = jffs2_flash_read(c, (ref_offset(ref)) + read, 191f97117d1SArtem B. Bityutskiy rd->nsize - already, &read, &fd->name[already]); 192f97117d1SArtem B. Bityutskiy if (unlikely(read != rd->nsize - already) && likely(!err)) 193f97117d1SArtem B. Bityutskiy return -EIO; 194f97117d1SArtem B. Bityutskiy 195f97117d1SArtem B. Bityutskiy if (unlikely(err)) { 196e0d60137SArtem B. Bityutskiy JFFS2_ERROR("read remainder of name: error %d\n", err); 197f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 198f97117d1SArtem B. Bityutskiy return -EIO; 199f97117d1SArtem B. Bityutskiy } 200f97117d1SArtem B. Bityutskiy } 201f97117d1SArtem B. Bityutskiy 202f97117d1SArtem B. Bityutskiy fd->nhash = full_name_hash(fd->name, rd->nsize); 203f97117d1SArtem B. Bityutskiy fd->next = NULL; 204f97117d1SArtem B. Bityutskiy fd->name[rd->nsize] = '\0'; 205f97117d1SArtem B. Bityutskiy 206f97117d1SArtem B. Bityutskiy /* 207f97117d1SArtem B. Bityutskiy * Wheee. We now have a complete jffs2_full_dirent structure, with 208f97117d1SArtem B. Bityutskiy * the name in it and everything. Link it into the list 209f97117d1SArtem B. Bityutskiy */ 210f97117d1SArtem B. Bityutskiy jffs2_add_fd_to_list(c, fd, fdp); 211f97117d1SArtem B. Bityutskiy 212f97117d1SArtem B. Bityutskiy return 0; 213f97117d1SArtem B. Bityutskiy } 214f97117d1SArtem B. Bityutskiy 215f97117d1SArtem B. Bityutskiy /* 216f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 217f97117d1SArtem B. Bityutskiy * It is called every time an inode node is found. 218f97117d1SArtem B. Bityutskiy * 219f97117d1SArtem B. Bityutskiy * Returns: 0 on succes; 220f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 221f97117d1SArtem B. Bityutskiy * negative error code on failure. 222f97117d1SArtem B. Bityutskiy */ 223f97117d1SArtem B. Bityutskiy static inline int 224f97117d1SArtem B. Bityutskiy read_dnode(struct jffs2_sb_info *c, 225f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, 226f97117d1SArtem B. Bityutskiy struct jffs2_raw_inode *rd, 227f97117d1SArtem B. Bityutskiy uint32_t read, 228f97117d1SArtem B. Bityutskiy struct rb_root *tnp, 229f97117d1SArtem B. Bityutskiy int32_t *latest_mctime, 230f97117d1SArtem B. Bityutskiy uint32_t *mctime_ver) 231f97117d1SArtem B. Bityutskiy { 232f97117d1SArtem B. Bityutskiy struct jffs2_eraseblock *jeb; 233f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 234f97117d1SArtem B. Bityutskiy 235f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 236f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 237f97117d1SArtem B. Bityutskiy 238f97117d1SArtem B. Bityutskiy /* If we've never checked the CRCs on this node, check them now */ 239f97117d1SArtem B. Bityutskiy if (ref_flags(ref) == REF_UNCHECKED) { 240f97117d1SArtem B. Bityutskiy uint32_t crc, len; 241f97117d1SArtem B. Bityutskiy 242f97117d1SArtem B. Bityutskiy crc = crc32(0, rd, sizeof(*rd) - 8); 243f97117d1SArtem B. Bityutskiy if (unlikely(crc != je32_to_cpu(rd->node_crc))) { 244e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("header CRC failed on node at %#08x: read %#08x, calculated %#08x\n", 245f97117d1SArtem B. Bityutskiy ref_offset(ref), je32_to_cpu(rd->node_crc), crc); 246f97117d1SArtem B. Bityutskiy return 1; 247f97117d1SArtem B. Bityutskiy } 248f97117d1SArtem B. Bityutskiy 249f97117d1SArtem B. Bityutskiy /* Sanity checks */ 250f97117d1SArtem B. Bityutskiy if (unlikely(je32_to_cpu(rd->offset) > je32_to_cpu(rd->isize)) || 251f97117d1SArtem B. Bityutskiy unlikely(PAD(je32_to_cpu(rd->csize) + sizeof(*rd)) != PAD(je32_to_cpu(rd->totlen)))) { 252e0d60137SArtem B. Bityutskiy JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref)); 253737b7661SAndrew Lunn jffs2_dbg_dump_node(c, ref_offset(ref)); 254f97117d1SArtem B. Bityutskiy return 1; 255f97117d1SArtem B. Bityutskiy } 256f97117d1SArtem B. Bityutskiy 257f97117d1SArtem B. Bityutskiy if (rd->compr != JFFS2_COMPR_ZERO && je32_to_cpu(rd->csize)) { 258f97117d1SArtem B. Bityutskiy unsigned char *buf = NULL; 259f97117d1SArtem B. Bityutskiy uint32_t pointed = 0; 260f97117d1SArtem B. Bityutskiy int err; 261f97117d1SArtem B. Bityutskiy #ifndef __ECOS 262f97117d1SArtem B. Bityutskiy if (c->mtd->point) { 263f97117d1SArtem B. Bityutskiy err = c->mtd->point (c->mtd, ref_offset(ref) + sizeof(*rd), je32_to_cpu(rd->csize), 264f97117d1SArtem B. Bityutskiy &read, &buf); 265f97117d1SArtem B. Bityutskiy if (unlikely(read < je32_to_cpu(rd->csize)) && likely(!err)) { 266e0d60137SArtem B. Bityutskiy JFFS2_ERROR("MTD point returned len too short: 0x%zx\n", read); 267f97117d1SArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buf, ref_offset(ref) + sizeof(*rd), 268f97117d1SArtem B. Bityutskiy je32_to_cpu(rd->csize)); 269f97117d1SArtem B. Bityutskiy } else if (unlikely(err)){ 270e0d60137SArtem B. Bityutskiy JFFS2_ERROR("MTD point failed %d\n", err); 271f97117d1SArtem B. Bityutskiy } else 272f97117d1SArtem B. Bityutskiy pointed = 1; /* succefully pointed to device */ 273f97117d1SArtem B. Bityutskiy } 274f97117d1SArtem B. Bityutskiy #endif 275f97117d1SArtem B. Bityutskiy if(!pointed){ 276f97117d1SArtem B. Bityutskiy buf = kmalloc(je32_to_cpu(rd->csize), GFP_KERNEL); 277f97117d1SArtem B. Bityutskiy if (!buf) 278f97117d1SArtem B. Bityutskiy return -ENOMEM; 279f97117d1SArtem B. Bityutskiy 280f97117d1SArtem B. Bityutskiy err = jffs2_flash_read(c, ref_offset(ref) + sizeof(*rd), je32_to_cpu(rd->csize), 281f97117d1SArtem B. Bityutskiy &read, buf); 282f97117d1SArtem B. Bityutskiy if (unlikely(read != je32_to_cpu(rd->csize)) && likely(!err)) 283f97117d1SArtem B. Bityutskiy err = -EIO; 284f97117d1SArtem B. Bityutskiy if (err) { 285f97117d1SArtem B. Bityutskiy kfree(buf); 286f97117d1SArtem B. Bityutskiy return err; 287f97117d1SArtem B. Bityutskiy } 288f97117d1SArtem B. Bityutskiy } 289f97117d1SArtem B. Bityutskiy crc = crc32(0, buf, je32_to_cpu(rd->csize)); 290f97117d1SArtem B. Bityutskiy if(!pointed) 291f97117d1SArtem B. Bityutskiy kfree(buf); 292f97117d1SArtem B. Bityutskiy #ifndef __ECOS 293f97117d1SArtem B. Bityutskiy else 294f97117d1SArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buf, ref_offset(ref) + sizeof(*rd), je32_to_cpu(rd->csize)); 295f97117d1SArtem B. Bityutskiy #endif 296f97117d1SArtem B. Bityutskiy 297f97117d1SArtem B. Bityutskiy if (crc != je32_to_cpu(rd->data_crc)) { 298e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("data CRC failed on node at %#08x: read %#08x, calculated %#08x\n", 299f97117d1SArtem B. Bityutskiy ref_offset(ref), je32_to_cpu(rd->data_crc), crc); 300f97117d1SArtem B. Bityutskiy return 1; 301f97117d1SArtem B. Bityutskiy } 302f97117d1SArtem B. Bityutskiy 303f97117d1SArtem B. Bityutskiy } 304f97117d1SArtem B. Bityutskiy 305f97117d1SArtem B. Bityutskiy /* Mark the node as having been checked and fix the accounting accordingly */ 306f97117d1SArtem B. Bityutskiy jeb = &c->blocks[ref->flash_offset / c->sector_size]; 307f97117d1SArtem B. Bityutskiy len = ref_totlen(c, jeb, ref); 308f97117d1SArtem B. Bityutskiy 309f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 310f97117d1SArtem B. Bityutskiy jeb->used_size += len; 311f97117d1SArtem B. Bityutskiy jeb->unchecked_size -= len; 312f97117d1SArtem B. Bityutskiy c->used_size += len; 313f97117d1SArtem B. Bityutskiy c->unchecked_size -= len; 314f97117d1SArtem B. Bityutskiy 315f97117d1SArtem B. Bityutskiy /* If node covers at least a whole page, or if it starts at the 316f97117d1SArtem B. Bityutskiy beginning of a page and runs to the end of the file, or if 317f97117d1SArtem B. Bityutskiy it's a hole node, mark it REF_PRISTINE, else REF_NORMAL. 318f97117d1SArtem B. Bityutskiy 319f97117d1SArtem B. Bityutskiy If it's actually overlapped, it'll get made NORMAL (or OBSOLETE) 320f97117d1SArtem B. Bityutskiy when the overlapping node(s) get added to the tree anyway. 321f97117d1SArtem B. Bityutskiy */ 322f97117d1SArtem B. Bityutskiy if ((je32_to_cpu(rd->dsize) >= PAGE_CACHE_SIZE) || 323f97117d1SArtem B. Bityutskiy ( ((je32_to_cpu(rd->offset) & (PAGE_CACHE_SIZE-1))==0) && 324f97117d1SArtem B. Bityutskiy (je32_to_cpu(rd->dsize) + je32_to_cpu(rd->offset) == je32_to_cpu(rd->isize)))) { 325e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("marking node at %#08x REF_PRISTINE\n", ref_offset(ref)); 326f97117d1SArtem B. Bityutskiy ref->flash_offset = ref_offset(ref) | REF_PRISTINE; 327f97117d1SArtem B. Bityutskiy } else { 328e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("marking node at %#08x REF_NORMAL\n", ref_offset(ref)); 329f97117d1SArtem B. Bityutskiy ref->flash_offset = ref_offset(ref) | REF_NORMAL; 330f97117d1SArtem B. Bityutskiy } 331f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 332f97117d1SArtem B. Bityutskiy } 333f97117d1SArtem B. Bityutskiy 334f97117d1SArtem B. Bityutskiy tn = jffs2_alloc_tmp_dnode_info(); 335f97117d1SArtem B. Bityutskiy if (!tn) { 336e0d60137SArtem B. Bityutskiy JFFS2_ERROR("alloc tn failed\n"); 337f97117d1SArtem B. Bityutskiy return -ENOMEM; 338f97117d1SArtem B. Bityutskiy } 339f97117d1SArtem B. Bityutskiy 340f97117d1SArtem B. Bityutskiy tn->fn = jffs2_alloc_full_dnode(); 341f97117d1SArtem B. Bityutskiy if (!tn->fn) { 342e0d60137SArtem B. Bityutskiy JFFS2_ERROR("alloc fn failed\n"); 343f97117d1SArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 344f97117d1SArtem B. Bityutskiy return -ENOMEM; 345f97117d1SArtem B. Bityutskiy } 346f97117d1SArtem B. Bityutskiy 347f97117d1SArtem B. Bityutskiy tn->version = je32_to_cpu(rd->version); 348f97117d1SArtem B. Bityutskiy tn->fn->ofs = je32_to_cpu(rd->offset); 349f97117d1SArtem B. Bityutskiy tn->fn->raw = ref; 350f97117d1SArtem B. Bityutskiy 351f97117d1SArtem B. Bityutskiy /* There was a bug where we wrote hole nodes out with 352f97117d1SArtem B. Bityutskiy csize/dsize swapped. Deal with it */ 353f97117d1SArtem B. Bityutskiy if (rd->compr == JFFS2_COMPR_ZERO && !je32_to_cpu(rd->dsize) && je32_to_cpu(rd->csize)) 354f97117d1SArtem B. Bityutskiy tn->fn->size = je32_to_cpu(rd->csize); 355f97117d1SArtem B. Bityutskiy else // normal case... 356f97117d1SArtem B. Bityutskiy tn->fn->size = je32_to_cpu(rd->dsize); 357f97117d1SArtem B. Bityutskiy 358e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("dnode @%08x: ver %u, offset %#04x, dsize %#04x\n", 359e0d60137SArtem B. Bityutskiy ref_offset(ref), je32_to_cpu(rd->version), je32_to_cpu(rd->offset), je32_to_cpu(rd->dsize)); 360f97117d1SArtem B. Bityutskiy 361f97117d1SArtem B. Bityutskiy jffs2_add_tn_to_tree(tn, tnp); 362f97117d1SArtem B. Bityutskiy 363f97117d1SArtem B. Bityutskiy return 0; 364f97117d1SArtem B. Bityutskiy } 365f97117d1SArtem B. Bityutskiy 366f97117d1SArtem B. Bityutskiy /* 367f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 368f97117d1SArtem B. Bityutskiy * It is called every time an unknown node is found. 369f97117d1SArtem B. Bityutskiy * 370f97117d1SArtem B. Bityutskiy * Returns: 0 on succes; 371f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 372f97117d1SArtem B. Bityutskiy * negative error code on failure. 373f97117d1SArtem B. Bityutskiy */ 374f97117d1SArtem B. Bityutskiy static inline int 375f97117d1SArtem B. Bityutskiy read_unknown(struct jffs2_sb_info *c, 376f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, 377f97117d1SArtem B. Bityutskiy struct jffs2_unknown_node *un, 378f97117d1SArtem B. Bityutskiy uint32_t read) 379f97117d1SArtem B. Bityutskiy { 380f97117d1SArtem B. Bityutskiy /* We don't mark unknown nodes as REF_UNCHECKED */ 381f97117d1SArtem B. Bityutskiy BUG_ON(ref_flags(ref) == REF_UNCHECKED); 382f97117d1SArtem B. Bityutskiy 383f97117d1SArtem B. Bityutskiy un->nodetype = cpu_to_je16(JFFS2_NODE_ACCURATE | je16_to_cpu(un->nodetype)); 384f97117d1SArtem B. Bityutskiy 385f97117d1SArtem B. Bityutskiy if (crc32(0, un, sizeof(struct jffs2_unknown_node) - 4) != je32_to_cpu(un->hdr_crc)) { 386f97117d1SArtem B. Bityutskiy /* Hmmm. This should have been caught at scan time. */ 387e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("node header CRC failed at %#08x. But it must have been OK earlier.\n", ref_offset(ref)); 388737b7661SAndrew Lunn jffs2_dbg_dump_node(c, ref_offset(ref)); 389f97117d1SArtem B. Bityutskiy return 1; 390f97117d1SArtem B. Bityutskiy } else { 391f97117d1SArtem B. Bityutskiy switch(je16_to_cpu(un->nodetype) & JFFS2_COMPAT_MASK) { 392f97117d1SArtem B. Bityutskiy 393f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_INCOMPAT: 394e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown INCOMPAT nodetype %#04X at %#08x\n", 395f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 396f97117d1SArtem B. Bityutskiy /* EEP */ 397f97117d1SArtem B. Bityutskiy BUG(); 398f97117d1SArtem B. Bityutskiy break; 399f97117d1SArtem B. Bityutskiy 400f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_ROCOMPAT: 401e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown ROCOMPAT nodetype %#04X at %#08x\n", 402f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 403f97117d1SArtem B. Bityutskiy BUG_ON(!(c->flags & JFFS2_SB_FLAG_RO)); 404f97117d1SArtem B. Bityutskiy break; 405f97117d1SArtem B. Bityutskiy 406f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_COPY: 407e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_COPY nodetype %#04X at %#08x\n", 408f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 409f97117d1SArtem B. Bityutskiy break; 410f97117d1SArtem B. Bityutskiy 411f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_DELETE: 412e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_DELETE nodetype %#04X at %#08x\n", 413f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 414f97117d1SArtem B. Bityutskiy return 1; 415f97117d1SArtem B. Bityutskiy } 416f97117d1SArtem B. Bityutskiy } 417f97117d1SArtem B. Bityutskiy 418f97117d1SArtem B. Bityutskiy return 0; 419f97117d1SArtem B. Bityutskiy } 420f97117d1SArtem B. Bityutskiy 421f97117d1SArtem B. Bityutskiy /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated 422f97117d1SArtem B. Bityutskiy with this ino, returning the former in order of version */ 423f97117d1SArtem B. Bityutskiy 424f97117d1SArtem B. Bityutskiy static int jffs2_get_inode_nodes(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 425f97117d1SArtem B. Bityutskiy struct rb_root *tnp, struct jffs2_full_dirent **fdp, 426f97117d1SArtem B. Bityutskiy uint32_t *highest_version, uint32_t *latest_mctime, 427f97117d1SArtem B. Bityutskiy uint32_t *mctime_ver) 428f97117d1SArtem B. Bityutskiy { 429f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, *valid_ref; 430f97117d1SArtem B. Bityutskiy struct rb_root ret_tn = RB_ROOT; 431f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *ret_fd = NULL; 432f97117d1SArtem B. Bityutskiy union jffs2_node_union node; 433f97117d1SArtem B. Bityutskiy size_t retlen; 434f97117d1SArtem B. Bityutskiy int err; 435f97117d1SArtem B. Bityutskiy 436f97117d1SArtem B. Bityutskiy *mctime_ver = 0; 437f97117d1SArtem B. Bityutskiy 438e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("ino #%u\n", f->inocache->ino); 439f97117d1SArtem B. Bityutskiy 440f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 441f97117d1SArtem B. Bityutskiy 442f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(f->inocache->nodes); 443f97117d1SArtem B. Bityutskiy 444f97117d1SArtem B. Bityutskiy if (!valid_ref && (f->inocache->ino != 1)) 445e0d60137SArtem B. Bityutskiy JFFS2_WARNING("no valid nodes for ino #%u\n", f->inocache->ino); 446f97117d1SArtem B. Bityutskiy 447f97117d1SArtem B. Bityutskiy while (valid_ref) { 448f97117d1SArtem B. Bityutskiy /* We can hold a pointer to a non-obsolete node without the spinlock, 449f97117d1SArtem B. Bityutskiy but _obsolete_ nodes may disappear at any time, if the block 450f97117d1SArtem B. Bityutskiy they're in gets erased. So if we mark 'ref' obsolete while we're 451f97117d1SArtem B. Bityutskiy not holding the lock, it can go away immediately. For that reason, 452f97117d1SArtem B. Bityutskiy we find the next valid node first, before processing 'ref'. 453f97117d1SArtem B. Bityutskiy */ 454f97117d1SArtem B. Bityutskiy ref = valid_ref; 455f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(ref->next_in_ino); 456f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 457f97117d1SArtem B. Bityutskiy 458f97117d1SArtem B. Bityutskiy cond_resched(); 459f97117d1SArtem B. Bityutskiy 460f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 461f97117d1SArtem B. Bityutskiy err = jffs2_flash_read(c, (ref_offset(ref)), 462f97117d1SArtem B. Bityutskiy min_t(uint32_t, ref_totlen(c, NULL, ref), sizeof(node)), 463f97117d1SArtem B. Bityutskiy &retlen, (void *)&node); 464f97117d1SArtem B. Bityutskiy if (err) { 465e0d60137SArtem B. Bityutskiy JFFS2_ERROR("error %d reading node at 0x%08x in get_inode_nodes()\n", err, ref_offset(ref)); 466f97117d1SArtem B. Bityutskiy goto free_out; 467f97117d1SArtem B. Bityutskiy } 468f97117d1SArtem B. Bityutskiy 469f97117d1SArtem B. Bityutskiy switch (je16_to_cpu(node.u.nodetype)) { 470f97117d1SArtem B. Bityutskiy 471f97117d1SArtem B. Bityutskiy case JFFS2_NODETYPE_DIRENT: 472e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("node at %08x (%d) is a dirent node\n", ref_offset(ref), ref_flags(ref)); 473f97117d1SArtem B. Bityutskiy 474f97117d1SArtem B. Bityutskiy if (retlen < sizeof(node.d)) { 475e0d60137SArtem B. Bityutskiy JFFS2_ERROR("short read dirent at %#08x\n", ref_offset(ref)); 476f97117d1SArtem B. Bityutskiy err = -EIO; 477f97117d1SArtem B. Bityutskiy goto free_out; 478f97117d1SArtem B. Bityutskiy } 479f97117d1SArtem B. Bityutskiy 480f97117d1SArtem B. Bityutskiy err = read_direntry(c, ref, &node.d, retlen, &ret_fd, latest_mctime, mctime_ver); 481f97117d1SArtem B. Bityutskiy if (err == 1) { 482f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, ref); 483f97117d1SArtem B. Bityutskiy break; 484f97117d1SArtem B. Bityutskiy } else if (unlikely(err)) 485f97117d1SArtem B. Bityutskiy goto free_out; 486f97117d1SArtem B. Bityutskiy 487f97117d1SArtem B. Bityutskiy if (je32_to_cpu(node.d.version) > *highest_version) 488f97117d1SArtem B. Bityutskiy *highest_version = je32_to_cpu(node.d.version); 489f97117d1SArtem B. Bityutskiy 490f97117d1SArtem B. Bityutskiy break; 491f97117d1SArtem B. Bityutskiy 492f97117d1SArtem B. Bityutskiy case JFFS2_NODETYPE_INODE: 493e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("node at %08x (%d) is a data node\n", ref_offset(ref), ref_flags(ref)); 494f97117d1SArtem B. Bityutskiy 495f97117d1SArtem B. Bityutskiy if (retlen < sizeof(node.i)) { 496e0d60137SArtem B. Bityutskiy JFFS2_ERROR("short read dnode at %#08x\n", ref_offset(ref)); 497f97117d1SArtem B. Bityutskiy err = -EIO; 498f97117d1SArtem B. Bityutskiy goto free_out; 499f97117d1SArtem B. Bityutskiy } 500f97117d1SArtem B. Bityutskiy 501f97117d1SArtem B. Bityutskiy err = read_dnode(c, ref, &node.i, retlen, &ret_tn, latest_mctime, mctime_ver); 502f97117d1SArtem B. Bityutskiy if (err == 1) { 503f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, ref); 504f97117d1SArtem B. Bityutskiy break; 505f97117d1SArtem B. Bityutskiy } else if (unlikely(err)) 506f97117d1SArtem B. Bityutskiy goto free_out; 507f97117d1SArtem B. Bityutskiy 508f97117d1SArtem B. Bityutskiy if (je32_to_cpu(node.i.version) > *highest_version) 509f97117d1SArtem B. Bityutskiy *highest_version = je32_to_cpu(node.i.version); 510f97117d1SArtem B. Bityutskiy 511e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("version %d, highest_version now %d\n", 512e0d60137SArtem B. Bityutskiy je32_to_cpu(node.i.version), *highest_version); 513f97117d1SArtem B. Bityutskiy 5141da177e4SLinus Torvalds break; 5151da177e4SLinus Torvalds 5161da177e4SLinus Torvalds default: 517f97117d1SArtem B. Bityutskiy /* Check we've managed to read at least the common node header */ 518f97117d1SArtem B. Bityutskiy if (retlen < sizeof(struct jffs2_unknown_node)) { 519e0d60137SArtem B. Bityutskiy JFFS2_ERROR("short read unknown node at %#08x\n", ref_offset(ref)); 520f97117d1SArtem B. Bityutskiy return -EIO; 5211da177e4SLinus Torvalds } 5221da177e4SLinus Torvalds 523f97117d1SArtem B. Bityutskiy err = read_unknown(c, ref, &node.u, retlen); 524f97117d1SArtem B. Bityutskiy if (err == 1) { 525f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, ref); 526f97117d1SArtem B. Bityutskiy break; 527f97117d1SArtem B. Bityutskiy } else if (unlikely(err)) 528f97117d1SArtem B. Bityutskiy goto free_out; 529f97117d1SArtem B. Bityutskiy 5301da177e4SLinus Torvalds } 531f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 5321da177e4SLinus Torvalds 5331da177e4SLinus Torvalds } 534f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 535f97117d1SArtem B. Bityutskiy *tnp = ret_tn; 536f97117d1SArtem B. Bityutskiy *fdp = ret_fd; 537f97117d1SArtem B. Bityutskiy 538f97117d1SArtem B. Bityutskiy return 0; 539f97117d1SArtem B. Bityutskiy 540f97117d1SArtem B. Bityutskiy free_out: 541f97117d1SArtem B. Bityutskiy jffs2_free_tmp_dnode_info_list(&ret_tn); 542f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent_list(ret_fd); 543f97117d1SArtem B. Bityutskiy return err; 5441da177e4SLinus Torvalds } 5451da177e4SLinus Torvalds 5461da177e4SLinus Torvalds static int jffs2_do_read_inode_internal(struct jffs2_sb_info *c, 5471da177e4SLinus Torvalds struct jffs2_inode_info *f, 5481da177e4SLinus Torvalds struct jffs2_raw_inode *latest_node) 5491da177e4SLinus Torvalds { 5509dee7503SDavid Woodhouse struct jffs2_tmp_dnode_info *tn = NULL; 5519dee7503SDavid Woodhouse struct rb_root tn_list; 5529dee7503SDavid Woodhouse struct rb_node *rb, *repl_rb; 5531da177e4SLinus Torvalds struct jffs2_full_dirent *fd_list; 5541da177e4SLinus Torvalds struct jffs2_full_dnode *fn = NULL; 5551da177e4SLinus Torvalds uint32_t crc; 5561da177e4SLinus Torvalds uint32_t latest_mctime, mctime_ver; 5571da177e4SLinus Torvalds uint32_t mdata_ver = 0; 5581da177e4SLinus Torvalds size_t retlen; 5591da177e4SLinus Torvalds int ret; 5601da177e4SLinus Torvalds 561e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("ino #%u nlink is %d\n", f->inocache->ino, f->inocache->nlink); 5621da177e4SLinus Torvalds 5631da177e4SLinus Torvalds /* Grab all nodes relevant to this ino */ 5641da177e4SLinus Torvalds ret = jffs2_get_inode_nodes(c, f, &tn_list, &fd_list, &f->highest_version, &latest_mctime, &mctime_ver); 5651da177e4SLinus Torvalds 5661da177e4SLinus Torvalds if (ret) { 567e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret); 5681da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 5691da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 5701da177e4SLinus Torvalds return ret; 5711da177e4SLinus Torvalds } 5721da177e4SLinus Torvalds f->dents = fd_list; 5731da177e4SLinus Torvalds 5749dee7503SDavid Woodhouse rb = rb_first(&tn_list); 5751da177e4SLinus Torvalds 5769dee7503SDavid Woodhouse while (rb) { 5779dee7503SDavid Woodhouse tn = rb_entry(rb, struct jffs2_tmp_dnode_info, rb); 5781da177e4SLinus Torvalds fn = tn->fn; 5791da177e4SLinus Torvalds 5801da177e4SLinus Torvalds if (f->metadata) { 5811da177e4SLinus Torvalds if (likely(tn->version >= mdata_ver)) { 582e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("obsoleting old metadata at 0x%08x\n", ref_offset(f->metadata->raw)); 5831da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 5841da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 5851da177e4SLinus Torvalds f->metadata = NULL; 5861da177e4SLinus Torvalds 5871da177e4SLinus Torvalds mdata_ver = 0; 5881da177e4SLinus Torvalds } else { 5891da177e4SLinus Torvalds /* This should never happen. */ 590e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Er. New metadata at 0x%08x with ver %d is actually older than previous ver %d at 0x%08x\n", 5911da177e4SLinus Torvalds ref_offset(fn->raw), tn->version, mdata_ver, ref_offset(f->metadata->raw)); 5921da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, fn->raw); 5931da177e4SLinus Torvalds jffs2_free_full_dnode(fn); 5941da177e4SLinus Torvalds /* Fill in latest_node from the metadata, not this one we're about to free... */ 5951da177e4SLinus Torvalds fn = f->metadata; 5961da177e4SLinus Torvalds goto next_tn; 5971da177e4SLinus Torvalds } 5981da177e4SLinus Torvalds } 5991da177e4SLinus Torvalds 6001da177e4SLinus Torvalds if (fn->size) { 6011da177e4SLinus Torvalds jffs2_add_full_dnode_to_inode(c, f, fn); 6021da177e4SLinus Torvalds } else { 6031da177e4SLinus Torvalds /* Zero-sized node at end of version list. Just a metadata update */ 604e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("metadata @%08x: ver %d\n", ref_offset(fn->raw), tn->version); 6051da177e4SLinus Torvalds f->metadata = fn; 6061da177e4SLinus Torvalds mdata_ver = tn->version; 6071da177e4SLinus Torvalds } 6081da177e4SLinus Torvalds next_tn: 6099dee7503SDavid Woodhouse BUG_ON(rb->rb_left); 6109dee7503SDavid Woodhouse if (rb->rb_parent && rb->rb_parent->rb_left == rb) { 6119dee7503SDavid Woodhouse /* We were then left-hand child of our parent. We need 6129dee7503SDavid Woodhouse to move our own right-hand child into our place. */ 6139dee7503SDavid Woodhouse repl_rb = rb->rb_right; 6149dee7503SDavid Woodhouse if (repl_rb) 6159dee7503SDavid Woodhouse repl_rb->rb_parent = rb->rb_parent; 6169dee7503SDavid Woodhouse } else 6179dee7503SDavid Woodhouse repl_rb = NULL; 6189dee7503SDavid Woodhouse 6199dee7503SDavid Woodhouse rb = rb_next(rb); 6209dee7503SDavid Woodhouse 6219dee7503SDavid Woodhouse /* Remove the spent tn from the tree; don't bother rebalancing 6229dee7503SDavid Woodhouse but put our right-hand child in our own place. */ 6239dee7503SDavid Woodhouse if (tn->rb.rb_parent) { 6249dee7503SDavid Woodhouse if (tn->rb.rb_parent->rb_left == &tn->rb) 6259dee7503SDavid Woodhouse tn->rb.rb_parent->rb_left = repl_rb; 6269dee7503SDavid Woodhouse else if (tn->rb.rb_parent->rb_right == &tn->rb) 6279dee7503SDavid Woodhouse tn->rb.rb_parent->rb_right = repl_rb; 6289dee7503SDavid Woodhouse else BUG(); 6299dee7503SDavid Woodhouse } else if (tn->rb.rb_right) 6309dee7503SDavid Woodhouse tn->rb.rb_right->rb_parent = NULL; 6319dee7503SDavid Woodhouse 6321da177e4SLinus Torvalds jffs2_free_tmp_dnode_info(tn); 6331da177e4SLinus Torvalds } 634e0c8e42fSArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 6351da177e4SLinus Torvalds 6361da177e4SLinus Torvalds if (!fn) { 6371da177e4SLinus Torvalds /* No data nodes for this inode. */ 6381da177e4SLinus Torvalds if (f->inocache->ino != 1) { 639e0d60137SArtem B. Bityutskiy JFFS2_WARNING("no data nodes found for ino #%u\n", f->inocache->ino); 6401da177e4SLinus Torvalds if (!fd_list) { 6411da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 6421da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 6431da177e4SLinus Torvalds return -EIO; 6441da177e4SLinus Torvalds } 645e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("but it has children so we fake some modes for it\n"); 6461da177e4SLinus Torvalds } 6471da177e4SLinus Torvalds latest_node->mode = cpu_to_jemode(S_IFDIR|S_IRUGO|S_IWUSR|S_IXUGO); 6481da177e4SLinus Torvalds latest_node->version = cpu_to_je32(0); 6491da177e4SLinus Torvalds latest_node->atime = latest_node->ctime = latest_node->mtime = cpu_to_je32(0); 6501da177e4SLinus Torvalds latest_node->isize = cpu_to_je32(0); 6511da177e4SLinus Torvalds latest_node->gid = cpu_to_je16(0); 6521da177e4SLinus Torvalds latest_node->uid = cpu_to_je16(0); 6531da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 6541da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 6551da177e4SLinus Torvalds return 0; 6561da177e4SLinus Torvalds } 6571da177e4SLinus Torvalds 6581da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(fn->raw), sizeof(*latest_node), &retlen, (void *)latest_node); 6591da177e4SLinus Torvalds if (ret || retlen != sizeof(*latest_node)) { 660e0d60137SArtem B. Bityutskiy JFFS2_ERROR("failed to read from flash: error %d, %zd of %zd bytes read\n", 6611da177e4SLinus Torvalds ret, retlen, sizeof(*latest_node)); 6621da177e4SLinus Torvalds /* FIXME: If this fails, there seems to be a memory leak. Find it. */ 6631da177e4SLinus Torvalds up(&f->sem); 6641da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 6651da177e4SLinus Torvalds return ret?ret:-EIO; 6661da177e4SLinus Torvalds } 6671da177e4SLinus Torvalds 6681da177e4SLinus Torvalds crc = crc32(0, latest_node, sizeof(*latest_node)-8); 6691da177e4SLinus Torvalds if (crc != je32_to_cpu(latest_node->node_crc)) { 670e0d60137SArtem B. Bityutskiy JFFS2_ERROR("CRC failed for read_inode of inode %u at physical location 0x%x\n", 671e0d60137SArtem B. Bityutskiy f->inocache->ino, ref_offset(fn->raw)); 6721da177e4SLinus Torvalds up(&f->sem); 6731da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 6741da177e4SLinus Torvalds return -EIO; 6751da177e4SLinus Torvalds } 6761da177e4SLinus Torvalds 6771da177e4SLinus Torvalds switch(jemode_to_cpu(latest_node->mode) & S_IFMT) { 6781da177e4SLinus Torvalds case S_IFDIR: 6791da177e4SLinus Torvalds if (mctime_ver > je32_to_cpu(latest_node->version)) { 6801da177e4SLinus Torvalds /* The times in the latest_node are actually older than 6811da177e4SLinus Torvalds mctime in the latest dirent. Cheat. */ 6821da177e4SLinus Torvalds latest_node->ctime = latest_node->mtime = cpu_to_je32(latest_mctime); 6831da177e4SLinus Torvalds } 6841da177e4SLinus Torvalds break; 6851da177e4SLinus Torvalds 6861da177e4SLinus Torvalds 6871da177e4SLinus Torvalds case S_IFREG: 6881da177e4SLinus Torvalds /* If it was a regular file, truncate it to the latest node's isize */ 689f302cd02SArtem B. Bityutskiy jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); 6901da177e4SLinus Torvalds break; 6911da177e4SLinus Torvalds 6921da177e4SLinus Torvalds case S_IFLNK: 6931da177e4SLinus Torvalds /* Hack to work around broken isize in old symlink code. 6941da177e4SLinus Torvalds Remove this when dwmw2 comes to his senses and stops 6951da177e4SLinus Torvalds symlinks from being an entirely gratuitous special 6961da177e4SLinus Torvalds case. */ 6971da177e4SLinus Torvalds if (!je32_to_cpu(latest_node->isize)) 6981da177e4SLinus Torvalds latest_node->isize = latest_node->dsize; 69932f1a95dSArtem B. Bityuckiy 70032f1a95dSArtem B. Bityuckiy if (f->inocache->state != INO_STATE_CHECKING) { 70132f1a95dSArtem B. Bityuckiy /* Symlink's inode data is the target path. Read it and 7022b79adccSArtem B. Bityutskiy * keep in RAM to facilitate quick follow symlink 7032b79adccSArtem B. Bityutskiy * operation. */ 7042b79adccSArtem B. Bityutskiy f->target = kmalloc(je32_to_cpu(latest_node->csize) + 1, GFP_KERNEL); 7052b79adccSArtem B. Bityutskiy if (!f->target) { 706e0d60137SArtem B. Bityutskiy JFFS2_ERROR("can't allocate %d bytes of memory for the symlink target path cache\n", je32_to_cpu(latest_node->csize)); 70732f1a95dSArtem B. Bityuckiy up(&f->sem); 70832f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 70932f1a95dSArtem B. Bityuckiy return -ENOMEM; 71032f1a95dSArtem B. Bityuckiy } 71132f1a95dSArtem B. Bityuckiy 71232f1a95dSArtem B. Bityuckiy ret = jffs2_flash_read(c, ref_offset(fn->raw) + sizeof(*latest_node), 7132b79adccSArtem B. Bityutskiy je32_to_cpu(latest_node->csize), &retlen, (char *)f->target); 71432f1a95dSArtem B. Bityuckiy 71532f1a95dSArtem B. Bityuckiy if (ret || retlen != je32_to_cpu(latest_node->csize)) { 71632f1a95dSArtem B. Bityuckiy if (retlen != je32_to_cpu(latest_node->csize)) 71732f1a95dSArtem B. Bityuckiy ret = -EIO; 7182b79adccSArtem B. Bityutskiy kfree(f->target); 7192b79adccSArtem B. Bityutskiy f->target = NULL; 72032f1a95dSArtem B. Bityuckiy up(&f->sem); 72132f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 72232f1a95dSArtem B. Bityuckiy return -ret; 72332f1a95dSArtem B. Bityuckiy } 72432f1a95dSArtem B. Bityuckiy 7252b79adccSArtem B. Bityutskiy f->target[je32_to_cpu(latest_node->csize)] = '\0'; 726e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("symlink's target '%s' cached\n", f->target); 72732f1a95dSArtem B. Bityuckiy } 72832f1a95dSArtem B. Bityuckiy 7291da177e4SLinus Torvalds /* fall through... */ 7301da177e4SLinus Torvalds 7311da177e4SLinus Torvalds case S_IFBLK: 7321da177e4SLinus Torvalds case S_IFCHR: 7331da177e4SLinus Torvalds /* Certain inode types should have only one data node, and it's 7341da177e4SLinus Torvalds kept as the metadata node */ 7351da177e4SLinus Torvalds if (f->metadata) { 736e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o had metadata node\n", 7371da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 7381da177e4SLinus Torvalds up(&f->sem); 7391da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 7401da177e4SLinus Torvalds return -EIO; 7411da177e4SLinus Torvalds } 7421da177e4SLinus Torvalds if (!frag_first(&f->fragtree)) { 743e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o has no fragments\n", 7441da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 7451da177e4SLinus Torvalds up(&f->sem); 7461da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 7471da177e4SLinus Torvalds return -EIO; 7481da177e4SLinus Torvalds } 7491da177e4SLinus Torvalds /* ASSERT: f->fraglist != NULL */ 7501da177e4SLinus Torvalds if (frag_next(frag_first(&f->fragtree))) { 751e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0x%x had more than one node\n", 7521da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 7531da177e4SLinus Torvalds /* FIXME: Deal with it - check crc32, check for duplicate node, check times and discard the older one */ 7541da177e4SLinus Torvalds up(&f->sem); 7551da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 7561da177e4SLinus Torvalds return -EIO; 7571da177e4SLinus Torvalds } 7581da177e4SLinus Torvalds /* OK. We're happy */ 7591da177e4SLinus Torvalds f->metadata = frag_first(&f->fragtree)->node; 7601da177e4SLinus Torvalds jffs2_free_node_frag(frag_first(&f->fragtree)); 7611da177e4SLinus Torvalds f->fragtree = RB_ROOT; 7621da177e4SLinus Torvalds break; 7631da177e4SLinus Torvalds } 7641da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 7651da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 7661da177e4SLinus Torvalds 7671da177e4SLinus Torvalds return 0; 7681da177e4SLinus Torvalds } 7691da177e4SLinus Torvalds 770f97117d1SArtem B. Bityutskiy /* Scan the list of all nodes present for this ino, build map of versions, etc. */ 771f97117d1SArtem B. Bityutskiy int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 772f97117d1SArtem B. Bityutskiy uint32_t ino, struct jffs2_raw_inode *latest_node) 773f97117d1SArtem B. Bityutskiy { 774e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("read inode #%u\n", ino); 775f97117d1SArtem B. Bityutskiy 776f97117d1SArtem B. Bityutskiy retry_inocache: 777f97117d1SArtem B. Bityutskiy spin_lock(&c->inocache_lock); 778f97117d1SArtem B. Bityutskiy f->inocache = jffs2_get_ino_cache(c, ino); 779f97117d1SArtem B. Bityutskiy 780f97117d1SArtem B. Bityutskiy if (f->inocache) { 781f97117d1SArtem B. Bityutskiy /* Check its state. We may need to wait before we can use it */ 782f97117d1SArtem B. Bityutskiy switch(f->inocache->state) { 783f97117d1SArtem B. Bityutskiy case INO_STATE_UNCHECKED: 784f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKEDABSENT: 785f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 786f97117d1SArtem B. Bityutskiy break; 787f97117d1SArtem B. Bityutskiy 788f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKING: 789f97117d1SArtem B. Bityutskiy case INO_STATE_GC: 790f97117d1SArtem B. Bityutskiy /* If it's in either of these states, we need 791f97117d1SArtem B. Bityutskiy to wait for whoever's got it to finish and 792f97117d1SArtem B. Bityutskiy put it back. */ 793e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("waiting for ino #%u in state %d\n", ino, f->inocache->state); 794f97117d1SArtem B. Bityutskiy sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); 795f97117d1SArtem B. Bityutskiy goto retry_inocache; 796f97117d1SArtem B. Bityutskiy 797f97117d1SArtem B. Bityutskiy case INO_STATE_READING: 798f97117d1SArtem B. Bityutskiy case INO_STATE_PRESENT: 799f97117d1SArtem B. Bityutskiy /* Eep. This should never happen. It can 800f97117d1SArtem B. Bityutskiy happen if Linux calls read_inode() again 801f97117d1SArtem B. Bityutskiy before clear_inode() has finished though. */ 802e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Eep. Trying to read_inode #%u when it's already in state %d!\n", ino, f->inocache->state); 803f97117d1SArtem B. Bityutskiy /* Fail. That's probably better than allowing it to succeed */ 804f97117d1SArtem B. Bityutskiy f->inocache = NULL; 805f97117d1SArtem B. Bityutskiy break; 806f97117d1SArtem B. Bityutskiy 807f97117d1SArtem B. Bityutskiy default: 808f97117d1SArtem B. Bityutskiy BUG(); 809f97117d1SArtem B. Bityutskiy } 810f97117d1SArtem B. Bityutskiy } 811f97117d1SArtem B. Bityutskiy spin_unlock(&c->inocache_lock); 812f97117d1SArtem B. Bityutskiy 813f97117d1SArtem B. Bityutskiy if (!f->inocache && ino == 1) { 814f97117d1SArtem B. Bityutskiy /* Special case - no root inode on medium */ 815f97117d1SArtem B. Bityutskiy f->inocache = jffs2_alloc_inode_cache(); 816f97117d1SArtem B. Bityutskiy if (!f->inocache) { 817e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot allocate inocache for root inode\n"); 818f97117d1SArtem B. Bityutskiy return -ENOMEM; 819f97117d1SArtem B. Bityutskiy } 820e0d60137SArtem B. Bityutskiy JFFS2_DBG_READINODE("creating inocache for root inode\n"); 821f97117d1SArtem B. Bityutskiy memset(f->inocache, 0, sizeof(struct jffs2_inode_cache)); 822f97117d1SArtem B. Bityutskiy f->inocache->ino = f->inocache->nlink = 1; 823f97117d1SArtem B. Bityutskiy f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache; 824f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 825f97117d1SArtem B. Bityutskiy jffs2_add_ino_cache(c, f->inocache); 826f97117d1SArtem B. Bityutskiy } 827f97117d1SArtem B. Bityutskiy if (!f->inocache) { 828e0d60137SArtem B. Bityutskiy JFFS2_ERROR("requestied to read an nonexistent ino %u\n", ino); 829f97117d1SArtem B. Bityutskiy return -ENOENT; 830f97117d1SArtem B. Bityutskiy } 831f97117d1SArtem B. Bityutskiy 832f97117d1SArtem B. Bityutskiy return jffs2_do_read_inode_internal(c, f, latest_node); 833f97117d1SArtem B. Bityutskiy } 834f97117d1SArtem B. Bityutskiy 835f97117d1SArtem B. Bityutskiy int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic) 836f97117d1SArtem B. Bityutskiy { 837f97117d1SArtem B. Bityutskiy struct jffs2_raw_inode n; 838f97117d1SArtem B. Bityutskiy struct jffs2_inode_info *f = kmalloc(sizeof(*f), GFP_KERNEL); 839f97117d1SArtem B. Bityutskiy int ret; 840f97117d1SArtem B. Bityutskiy 841f97117d1SArtem B. Bityutskiy if (!f) 842f97117d1SArtem B. Bityutskiy return -ENOMEM; 843f97117d1SArtem B. Bityutskiy 844f97117d1SArtem B. Bityutskiy memset(f, 0, sizeof(*f)); 845f97117d1SArtem B. Bityutskiy init_MUTEX_LOCKED(&f->sem); 846f97117d1SArtem B. Bityutskiy f->inocache = ic; 847f97117d1SArtem B. Bityutskiy 848f97117d1SArtem B. Bityutskiy ret = jffs2_do_read_inode_internal(c, f, &n); 849f97117d1SArtem B. Bityutskiy if (!ret) { 850f97117d1SArtem B. Bityutskiy up(&f->sem); 851f97117d1SArtem B. Bityutskiy jffs2_do_clear_inode(c, f); 852f97117d1SArtem B. Bityutskiy } 853f97117d1SArtem B. Bityutskiy kfree (f); 854f97117d1SArtem B. Bityutskiy return ret; 855f97117d1SArtem B. Bityutskiy } 856f97117d1SArtem B. Bityutskiy 8571da177e4SLinus Torvalds void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f) 8581da177e4SLinus Torvalds { 8591da177e4SLinus Torvalds struct jffs2_full_dirent *fd, *fds; 8601da177e4SLinus Torvalds int deleted; 8611da177e4SLinus Torvalds 8621da177e4SLinus Torvalds down(&f->sem); 8631da177e4SLinus Torvalds deleted = f->inocache && !f->inocache->nlink; 8641da177e4SLinus Torvalds 86567e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) 86667e345d1SDavid Woodhouse jffs2_set_inocache_state(c, f->inocache, INO_STATE_CLEARING); 86767e345d1SDavid Woodhouse 8681da177e4SLinus Torvalds if (f->metadata) { 8691da177e4SLinus Torvalds if (deleted) 8701da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 8711da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 8721da177e4SLinus Torvalds } 8731da177e4SLinus Torvalds 8741da177e4SLinus Torvalds jffs2_kill_fragtree(&f->fragtree, deleted?c:NULL); 8751da177e4SLinus Torvalds 8762b79adccSArtem B. Bityutskiy if (f->target) { 8772b79adccSArtem B. Bityutskiy kfree(f->target); 8782b79adccSArtem B. Bityutskiy f->target = NULL; 87932f1a95dSArtem B. Bityuckiy } 8801da177e4SLinus Torvalds 8812b79adccSArtem B. Bityutskiy fds = f->dents; 8821da177e4SLinus Torvalds while(fds) { 8831da177e4SLinus Torvalds fd = fds; 8841da177e4SLinus Torvalds fds = fd->next; 8851da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8861da177e4SLinus Torvalds } 8871da177e4SLinus Torvalds 88867e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) { 8891da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 89067e345d1SDavid Woodhouse if (f->inocache->nodes == (void *)f->inocache) 89167e345d1SDavid Woodhouse jffs2_del_ino_cache(c, f->inocache); 89267e345d1SDavid Woodhouse } 8931da177e4SLinus Torvalds 8941da177e4SLinus Torvalds up(&f->sem); 8951da177e4SLinus Torvalds } 896