fs/jffs2/scan.c

   1 /*
   2  * JFFS2 -- Journalling Flash File System, Version 2.
   3  *
   4  * Copyright © 2001-2007 Red Hat, Inc.
   5  *
   6  * Created by David Woodhouse <dwmw2@infradead.org>
   7  *
   8  * For licensing information, see the file 'LICENCE' in this directory.
   9  *
  10  */
  11
  12 #include <linux/kernel.h>
  13 #include <linux/sched.h>
  14 #include <linux/slab.h>
  15 #include <linux/mtd/mtd.h>
  16 #include <linux/pagemap.h>
  17 #include <linux/crc32.h>
  18 #include <linux/compiler.h>
  19 #include "nodelist.h"
  20 #include "summary.h"
  21 #include "debug.h"
  22
  23 #define DEFAULT_EMPTY_SCAN_SIZE 256
  24
  25 #define noisy_printk(noise, args...) do { \
  26         if (*(noise)) { \
  27                 printk(KERN_NOTICE args); \
  28                  (*(noise))--; \
  29                  if (!(*(noise))) { \
  30                          printk(KERN_NOTICE "Further such events for this erase block will not be printed\n"); \
  31                  } \
  32         } \
  33 } while(0)
  34
  35 static uint32_t pseudo_random;
  36
  37 static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  38                                   unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s);
  39
  40 /* These helper functions _must_ increase ofs and also do the dirty/used space accounting.
  41  * Returning an error will abort the mount - bad checksums etc. should just mark the space
  42  * as dirty.
  43  */
  44 static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  45                                  struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s);
  46 static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
  47                                  struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s);
  48
  49 static inline int min_free(struct jffs2_sb_info *c)
  50 {
  51         uint32_t min = 2 * sizeof(struct jffs2_raw_inode);
  52 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
  53         if (!jffs2_can_mark_obsolete(c) && min < c->wbuf_pagesize)
  54                 return c->wbuf_pagesize;
  55 #endif
  56         return min;
  57
  58 }
  59
  60 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) {
  61         if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
  62                 return sector_size;
  63         else
  64                 return DEFAULT_EMPTY_SCAN_SIZE;
  65 }
  66
  67 static int file_dirty(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
  68 {
  69         int ret;
  70
  71         if ((ret = jffs2_prealloc_raw_node_refs(c, jeb, 1)))
  72                 return ret;
  73         if ((ret = jffs2_scan_dirty_space(c, jeb, jeb->free_size)))
  74                 return ret;
  75         /* Turned wasted size into dirty, since we apparently
  76            think it's recoverable now. */
  77         jeb->dirty_size += jeb->wasted_size;
  78         c->dirty_size += jeb->wasted_size;
  79         c->wasted_size -= jeb->wasted_size;
  80         jeb->wasted_size = 0;
  81         if (VERYDIRTY(c, jeb->dirty_size)) {
  82                 list_add(&jeb->list, &c->very_dirty_list);
  83         } else {
  84                 list_add(&jeb->list, &c->dirty_list);
  85         }
  86         return 0;
  87 }
  88
  89 int jffs2_scan_medium(struct jffs2_sb_info *c)
  90 {
  91         int i, ret;
  92         uint32_t empty_blocks = 0, bad_blocks = 0;
  93         unsigned char *flashbuf = NULL;
  94         uint32_t buf_size = 0;
  95         struct jffs2_summary *s = NULL; /* summary info collected by the scan process */
  96 #ifndef __ECOS
  97         size_t pointlen, try_size;
  98
  99         if (c->mtd->point) {
 100                 ret = c->mtd->point(c->mtd, 0, c->mtd->size, &pointlen,
 101                                     (void **)&flashbuf, NULL);
 102                 if (!ret && pointlen < c->mtd->size) {
 103                         /* Don't muck about if it won't let us point to the whole flash */
 104                         D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", pointlen));
 105                         c->mtd->unpoint(c->mtd, 0, pointlen);
 106                         flashbuf = NULL;
 107                 }
 108                 if (ret)
 109                         D1(printk(KERN_DEBUG "MTD point failed %d\n", ret));
 110         }
 111 #endif
 112         if (!flashbuf) {
 113                 /* For NAND it's quicker to read a whole eraseblock at a time,
 114                    apparently */
 115                 if (jffs2_cleanmarker_oob(c))
 116                         try_size = c->sector_size;
 117                 else
 118                         try_size = PAGE_SIZE;
 119
 120                 D1(printk(KERN_DEBUG "Trying to allocate readbuf of %zu "
 121                         "bytes\n", try_size));
 122
 123                 flashbuf = mtd_kmalloc_up_to(c->mtd, &try_size);
 124                 if (!flashbuf)
 125                         return -ENOMEM;
 126
 127                 D1(printk(KERN_DEBUG "Allocated readbuf of %zu bytes\n",
 128                         try_size));
 129
 130                 buf_size = (uint32_t)try_size;
 131         }
 132
 133         if (jffs2_sum_active()) {
 134                 s = kzalloc(sizeof(struct jffs2_summary), GFP_KERNEL);
 135                 if (!s) {
 136                         JFFS2_WARNING("Can't allocate memory for summary\n");
 137                         ret = -ENOMEM;
 138                         goto out;
 139                 }
 140         }
 141
 142         for (i=0; i<c->nr_blocks; i++) {
 143                 struct jffs2_eraseblock *jeb = &c->blocks[i];
 144
 145                 cond_resched();
 146
 147                 /* reset summary info for next eraseblock scan */
 148                 jffs2_sum_reset_collected(s);
 149
 150                 ret = jffs2_scan_eraseblock(c, jeb, buf_size?flashbuf:(flashbuf+jeb->offset),
 151                                                 buf_size, s);
 152
 153                 if (ret < 0)
 154                         goto out;
 155
 156                 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
 157
 158                 /* Now decide which list to put it on */
 159                 switch(ret) {
 160                 case BLK_STATE_ALLFF:
 161                         /*
 162                          * Empty block.   Since we can't be sure it
 163                          * was entirely erased, we just queue it for erase
 164                          * again.  It will be marked as such when the erase
 165                          * is complete.  Meanwhile we still count it as empty
 166                          * for later checks.
 167                          */
 168                         empty_blocks++;
 169                         list_add(&jeb->list, &c->erase_pending_list);
 170                         c->nr_erasing_blocks++;
 171                         break;
 172
 173                 case BLK_STATE_CLEANMARKER:
 174                         /* Only a CLEANMARKER node is valid */
 175                         if (!jeb->dirty_size) {
 176                                 /* It's actually free */
 177                                 list_add(&jeb->list, &c->free_list);
 178                                 c->nr_free_blocks++;
 179                         } else {
 180                                 /* Dirt */
 181                                 D1(printk(KERN_DEBUG "Adding all-dirty block at 0x%08x to erase_pending_list\n", jeb->offset));
 182                                 list_add(&jeb->list, &c->erase_pending_list);
 183                                 c->nr_erasing_blocks++;
 184                         }
 185                         break;
 186
 187                 case BLK_STATE_CLEAN:
 188                         /* Full (or almost full) of clean data. Clean list */
 189                         list_add(&jeb->list, &c->clean_list);
 190                         break;
 191
 192                 case BLK_STATE_PARTDIRTY:
 193                         /* Some data, but not full. Dirty list. */
 194                         /* We want to remember the block with most free space
 195                         and stick it in the 'nextblock' position to start writing to it. */
 196                         if (jeb->free_size > min_free(c) &&
 197                                         (!c->nextblock || c->nextblock->free_size < jeb->free_size)) {
 198                                 /* Better candidate for the next writes to go to */
 199                                 if (c->nextblock) {
 200                                         ret = file_dirty(c, c->nextblock);
 201                                         if (ret)
 202                                                 goto out;
 203                                         /* deleting summary information of the old nextblock */
 204                                         jffs2_sum_reset_collected(c->summary);
 205                                 }
 206                                 /* update collected summary information for the current nextblock */
 207                                 jffs2_sum_move_collected(c, s);
 208                                 D1(printk(KERN_DEBUG "jffs2_scan_medium(): new nextblock = 0x%08x\n", jeb->offset));
 209                                 c->nextblock = jeb;
 210                         } else {
 211                                 ret = file_dirty(c, jeb);
 212                                 if (ret)
 213                                         goto out;
 214                         }
 215                         break;
 216
 217                 case BLK_STATE_ALLDIRTY:
 218                         /* Nothing valid - not even a clean marker. Needs erasing. */
 219                         /* For now we just put it on the erasing list. We'll start the erases later */
 220                         D1(printk(KERN_NOTICE "JFFS2: Erase block at 0x%08x is not formatted. It will be erased\n", jeb->offset));
 221                         list_add(&jeb->list, &c->erase_pending_list);
 222                         c->nr_erasing_blocks++;
 223                         break;
 224
 225                 case BLK_STATE_BADBLOCK:
 226                         D1(printk(KERN_NOTICE "JFFS2: Block at 0x%08x is bad\n", jeb->offset));
 227                         list_add(&jeb->list, &c->bad_list);
 228                         c->bad_size += c->sector_size;
 229                         c->free_size -= c->sector_size;
 230                         bad_blocks++;
 231                         break;
 232                 default:
 233                         printk(KERN_WARNING "jffs2_scan_medium(): unknown block state\n");
 234                         BUG();
 235                 }
 236         }
 237
 238         /* Nextblock dirty is always seen as wasted, because we cannot recycle it now */
 239         if (c->nextblock && (c->nextblock->dirty_size)) {
 240                 c->nextblock->wasted_size += c->nextblock->dirty_size;
 241                 c->wasted_size += c->nextblock->dirty_size;
 242                 c->dirty_size -= c->nextblock->dirty_size;
 243                 c->nextblock->dirty_size = 0;
 244         }
 245 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
 246         if (!jffs2_can_mark_obsolete(c) && c->wbuf_pagesize && c->nextblock && (c->nextblock->free_size % c->wbuf_pagesize)) {
 247                 /* If we're going to start writing into a block which already
 248                    contains data, and the end of the data isn't page-aligned,
 249                    skip a little and align it. */
 250
 251                 uint32_t skip = c->nextblock->free_size % c->wbuf_pagesize;
 252
 253                 D1(printk(KERN_DEBUG "jffs2_scan_medium(): Skipping %d bytes in nextblock to ensure page alignment\n",
 254                           skip));
 255                 jffs2_prealloc_raw_node_refs(c, c->nextblock, 1);
 256                 jffs2_scan_dirty_space(c, c->nextblock, skip);
 257         }
 258 #endif
 259         if (c->nr_erasing_blocks) {
 260                 if ( !c->used_size && ((c->nr_free_blocks+empty_blocks+bad_blocks)!= c->nr_blocks || bad_blocks == c->nr_blocks) ) {
 261                         printk(KERN_NOTICE "Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n");
 262                         printk(KERN_NOTICE "empty_blocks %d, bad_blocks %d, c->nr_blocks %d\n",empty_blocks,bad_blocks,c->nr_blocks);
 263                         ret = -EIO;
 264                         goto out;
 265                 }
 266                 spin_lock(&c->erase_completion_lock);
 267                 jffs2_garbage_collect_trigger(c);
 268                 spin_unlock(&c->erase_completion_lock);
 269         }
 270         ret = 0;
 271  out:
 272         if (buf_size)
 273                 kfree(flashbuf);
 274 #ifndef __ECOS
 275         else
 276                 c->mtd->unpoint(c->mtd, 0, c->mtd->size);
 277 #endif
 278         kfree(s);
 279         return ret;
 280 }
 281
 282 static int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf,
 283                                uint32_t ofs, uint32_t len)
 284 {
 285         int ret;
 286         size_t retlen;
 287
 288         ret = jffs2_flash_read(c, ofs, len, &retlen, buf);
 289         if (ret) {
 290                 D1(printk(KERN_WARNING "mtd->read(0x%x bytes from 0x%x) returned %d\n", len, ofs, ret));
 291                 return ret;
 292         }
 293         if (retlen < len) {
 294                 D1(printk(KERN_WARNING "Read at 0x%x gave only 0x%zx bytes\n", ofs, retlen));
 295                 return -EIO;
 296         }
 297         return 0;
 298 }
 299
 300 int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
 301 {
 302         if ((jeb->used_size + jeb->unchecked_size) == PAD(c->cleanmarker_size) && !jeb->dirty_size
 303             && (!jeb->first_node || !ref_next(jeb->first_node)) )
 304                 return BLK_STATE_CLEANMARKER;
 305
 306         /* move blocks with max 4 byte dirty space to cleanlist */
 307         else if (!ISDIRTY(c->sector_size - (jeb->used_size + jeb->unchecked_size))) {
 308                 c->dirty_size -= jeb->dirty_size;
 309                 c->wasted_size += jeb->dirty_size;
 310                 jeb->wasted_size += jeb->dirty_size;
 311                 jeb->dirty_size = 0;
 312                 return BLK_STATE_CLEAN;
 313         } else if (jeb->used_size || jeb->unchecked_size)
 314                 return BLK_STATE_PARTDIRTY;
 315         else
 316                 return BLK_STATE_ALLDIRTY;
 317 }
 318
 319 #ifdef CONFIG_JFFS2_FS_XATTR
 320 static int jffs2_scan_xattr_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
 321                                  struct jffs2_raw_xattr *rx, uint32_t ofs,
 322                                  struct jffs2_summary *s)
 323 {
 324         struct jffs2_xattr_datum *xd;
 325         uint32_t xid, version, totlen, crc;
 326         int err;
 327
 328         crc = crc32(0, rx, sizeof(struct jffs2_raw_xattr) - 4);
 329         if (crc != je32_to_cpu(rx->node_crc)) {
 330                 JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n",
 331                               ofs, je32_to_cpu(rx->node_crc), crc);
 332                 if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen))))
 333                         return err;
 334                 return 0;
 335         }
 336
 337         xid = je32_to_cpu(rx->xid);
 338         version = je32_to_cpu(rx->version);
 339
 340         totlen = PAD(sizeof(struct jffs2_raw_xattr)
 341                         + rx->name_len + 1 + je16_to_cpu(rx->value_len));
 342         if (totlen != je32_to_cpu(rx->totlen)) {
 343                 JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%u\n",
 344                               ofs, je32_to_cpu(rx->totlen), totlen);
 345                 if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rx->totlen))))
 346                         return err;
 347                 return 0;
 348         }
 349
 350         xd = jffs2_setup_xattr_datum(c, xid, version);
 351         if (IS_ERR(xd))
 352                 return PTR_ERR(xd);
 353
 354         if (xd->version > version) {
 355                 struct jffs2_raw_node_ref *raw
 356                         = jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, NULL);
 357                 raw->next_in_ino = xd->node->next_in_ino;
 358                 xd->node->next_in_ino = raw;
 359         } else {
 360                 xd->version = version;
 361                 xd->xprefix = rx->xprefix;
 362                 xd->name_len = rx->name_len;
 363                 xd->value_len = je16_to_cpu(rx->value_len);
 364                 xd->data_crc = je32_to_cpu(rx->data_crc);
 365
 366                 jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, totlen, (void *)xd);
 367         }
 368
 369         if (jffs2_sum_active())
 370                 jffs2_sum_add_xattr_mem(s, rx, ofs - jeb->offset);
 371         dbg_xattr("scaning xdatum at %#08x (xid=%u, version=%u)\n",
 372                   ofs, xd->xid, xd->version);
 373         return 0;
 374 }
 375
 376 static int jffs2_scan_xref_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
 377                                 struct jffs2_raw_xref *rr, uint32_t ofs,
 378                                 struct jffs2_summary *s)
 379 {
 380         struct jffs2_xattr_ref *ref;
 381         uint32_t crc;
 382         int err;
 383
 384         crc = crc32(0, rr, sizeof(*rr) - 4);
 385         if (crc != je32_to_cpu(rr->node_crc)) {
 386                 JFFS2_WARNING("node CRC failed at %#08x, read=%#08x, calc=%#08x\n",
 387                               ofs, je32_to_cpu(rr->node_crc), crc);
 388                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rr->totlen)))))
 389                         return err;
 390                 return 0;
 391         }
 392
 393         if (PAD(sizeof(struct jffs2_raw_xref)) != je32_to_cpu(rr->totlen)) {
 394                 JFFS2_WARNING("node length mismatch at %#08x, read=%u, calc=%zd\n",
 395                               ofs, je32_to_cpu(rr->totlen),
 396                               PAD(sizeof(struct jffs2_raw_xref)));
 397                 if ((err = jffs2_scan_dirty_space(c, jeb, je32_to_cpu(rr->totlen))))
 398                         return err;
 399                 return 0;
 400         }
 401
 402         ref = jffs2_alloc_xattr_ref();
 403         if (!ref)
 404                 return -ENOMEM;
 405
 406         /* BEFORE jffs2_build_xattr_subsystem() called,
 407          * and AFTER xattr_ref is marked as a dead xref,
 408          * ref->xid is used to store 32bit xid, xd is not used
 409          * ref->ino is used to store 32bit inode-number, ic is not used
 410          * Thoes variables are declared as union, thus using those
 411          * are exclusive. In a similar way, ref->next is temporarily
 412          * used to chain all xattr_ref object. It's re-chained to
 413          * jffs2_inode_cache in jffs2_build_xattr_subsystem() correctly.
 414          */
 415         ref->ino = je32_to_cpu(rr->ino);
 416         ref->xid = je32_to_cpu(rr->xid);
 417         ref->xseqno = je32_to_cpu(rr->xseqno);
 418         if (ref->xseqno > c->highest_xseqno)
 419                 c->highest_xseqno = (ref->xseqno & ~XREF_DELETE_MARKER);
 420         ref->next = c->xref_temp;
 421         c->xref_temp = ref;
 422
 423         jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(rr->totlen)), (void *)ref);
 424
 425         if (jffs2_sum_active())
 426                 jffs2_sum_add_xref_mem(s, rr, ofs - jeb->offset);
 427         dbg_xattr("scan xref at %#08x (xid=%u, ino=%u)\n",
 428                   ofs, ref->xid, ref->ino);
 429         return 0;
 430 }
 431 #endif
 432
 433 /* Called with 'buf_size == 0' if buf is in fact a pointer _directly_ into
 434    the flash, XIP-style */
 435 static int jffs2_scan_eraseblock (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
 436                                   unsigned char *buf, uint32_t buf_size, struct jffs2_summary *s) {
 437         struct jffs2_unknown_node *node;
 438         struct jffs2_unknown_node crcnode;
 439         uint32_t ofs, prevofs, max_ofs;
 440         uint32_t hdr_crc, buf_ofs, buf_len;
 441         int err;
 442         int noise = 0;
 443
 444
 445 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
 446         int cleanmarkerfound = 0;
 447 #endif
 448
 449         ofs = jeb->offset;
 450         prevofs = jeb->offset - 1;
 451
 452         D1(printk(KERN_DEBUG "jffs2_scan_eraseblock(): Scanning block at 0x%x\n", ofs));
 453
 454 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
 455         if (jffs2_cleanmarker_oob(c)) {
 456                 int ret;
 457
 458                 if (c->mtd->block_isbad(c->mtd, jeb->offset))
 459                         return BLK_STATE_BADBLOCK;
 460
 461                 ret = jffs2_check_nand_cleanmarker(c, jeb);
 462                 D2(printk(KERN_NOTICE "jffs_check_nand_cleanmarker returned %d\n",ret));
 463
 464                 /* Even if it's not found, we still scan to see
 465                    if the block is empty. We use this information
 466                    to decide whether to erase it or not. */
 467                 switch (ret) {
 468                 case 0:         cleanmarkerfound = 1; break;
 469                 case 1:         break;
 470                 default:        return ret;
 471                 }
 472         }
 473 #endif
 474
 475         if (jffs2_sum_active()) {
 476                 struct jffs2_sum_marker *sm;
 477                 void *sumptr = NULL;
 478                 uint32_t sumlen;
 479
 480                 if (!buf_size) {
 481                         /* XIP case. Just look, point at the summary if it's there */
 482                         sm = (void *)buf + c->sector_size - sizeof(*sm);
 483                         if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) {
 484                                 sumptr = buf + je32_to_cpu(sm->offset);
 485                                 sumlen = c->sector_size - je32_to_cpu(sm->offset);
 486                         }
 487                 } else {
 488                         /* If NAND flash, read a whole page of it. Else just the end */
 489                         if (c->wbuf_pagesize)
 490                                 buf_len = c->wbuf_pagesize;
 491                         else
 492                                 buf_len = sizeof(*sm);
 493
 494                         /* Read as much as we want into the _end_ of the preallocated buffer */
 495                         err = jffs2_fill_scan_buf(c, buf + buf_size - buf_len,
 496                                                   jeb->offset + c->sector_size - buf_len,
 497                                                   buf_len);
 498                         if (err)
 499                                 return err;
 500
 501                         sm = (void *)buf + buf_size - sizeof(*sm);
 502                         if (je32_to_cpu(sm->magic) == JFFS2_SUM_MAGIC) {
 503                                 sumlen = c->sector_size - je32_to_cpu(sm->offset);
 504                                 sumptr = buf + buf_size - sumlen;
 505
 506                                 /* sm->offset maybe wrong but MAGIC maybe right */
 507                                 if (sumlen > c->sector_size)
 508                                         goto full_scan;
 509
 510                                 /* Now, make sure the summary itself is available */
 511                                 if (sumlen > buf_size) {
 512                                         /* Need to kmalloc for this. */
 513                                         sumptr = kmalloc(sumlen, GFP_KERNEL);
 514                                         if (!sumptr)
 515                                                 return -ENOMEM;
 516                                         memcpy(sumptr + sumlen - buf_len, buf + buf_size - buf_len, buf_len);
 517                                 }
 518                                 if (buf_len < sumlen) {
 519                                         /* Need to read more so that the entire summary node is present */
 520                                         err = jffs2_fill_scan_buf(c, sumptr,
 521                                                                   jeb->offset + c->sector_size - sumlen,
 522                                                                   sumlen - buf_len);
 523                                         if (err)
 524                                                 return err;
 525                                 }
 526                         }
 527
 528                 }
 529
 530                 if (sumptr) {
 531                         err = jffs2_sum_scan_sumnode(c, jeb, sumptr, sumlen, &pseudo_random);
 532
 533                         if (buf_size && sumlen > buf_size)
 534                                 kfree(sumptr);
 535                         /* If it returns with a real error, bail.
 536                            If it returns positive, that's a block classification
 537                            (i.e. BLK_STATE_xxx) so return that too.
 538                            If it returns zero, fall through to full scan. */
 539                         if (err)
 540                                 return err;
 541                 }
 542         }
 543
 544 full_scan:
 545         buf_ofs = jeb->offset;
 546
 547         if (!buf_size) {
 548                 /* This is the XIP case -- we're reading _directly_ from the flash chip */
 549                 buf_len = c->sector_size;
 550         } else {
 551                 buf_len = EMPTY_SCAN_SIZE(c->sector_size);
 552                 err = jffs2_fill_scan_buf(c, buf, buf_ofs, buf_len);
 553                 if (err)
 554                         return err;
 555         }
 556
 557         /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
 558         ofs = 0;
 559         max_ofs = EMPTY_SCAN_SIZE(c->sector_size);
 560         /* Scan only EMPTY_SCAN_SIZE of 0xFF before declaring it's empty */
 561         while(ofs < max_ofs && *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
 562                 ofs += 4;
 563
 564         if (ofs == max_ofs) {
 565 #ifdef CONFIG_JFFS2_FS_WRITEBUFFER
 566                 if (jffs2_cleanmarker_oob(c)) {
 567                         /* scan oob, take care of cleanmarker */
 568                         int ret = jffs2_check_oob_empty(c, jeb, cleanmarkerfound);
 569                         D2(printk(KERN_NOTICE "jffs2_check_oob_empty returned %d\n",ret));
 570                         switch (ret) {
 571                         case 0:         return cleanmarkerfound ? BLK_STATE_CLEANMARKER : BLK_STATE_ALLFF;
 572                         case 1:         return BLK_STATE_ALLDIRTY;
 573                         default:        return ret;
 574                         }
 575                 }
 576 #endif
 577                 D1(printk(KERN_DEBUG "Block at 0x%08x is empty (erased)\n", jeb->offset));
 578                 if (c->cleanmarker_size == 0)
 579                         return BLK_STATE_CLEANMARKER;   /* don't bother with re-erase */
 580                 else
 581                         return BLK_STATE_ALLFF; /* OK to erase if all blocks are like this */
 582         }
 583         if (ofs) {
 584                 D1(printk(KERN_DEBUG "Free space at %08x ends at %08x\n", jeb->offset,
 585                           jeb->offset + ofs));
 586                 if ((err = jffs2_prealloc_raw_node_refs(c, jeb, 1)))
 587                         return err;
 588                 if ((err = jffs2_scan_dirty_space(c, jeb, ofs)))
 589                         return err;
 590         }
 591
 592         /* Now ofs is a complete physical flash offset as it always was... */
 593         ofs += jeb->offset;
 594
 595         noise = 10;
 596
 597         dbg_summary("no summary found in jeb 0x%08x. Apply original scan.\n",jeb->offset);
 598
 599 scan_more:
 600         while(ofs < jeb->offset + c->sector_size) {
 601
 602                 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
 603
 604                 /* Make sure there are node refs available for use */
 605                 err = jffs2_prealloc_raw_node_refs(c, jeb, 2);
 606                 if (err)
 607                         return err;
 608
 609                 cond_resched();
 610
 611                 if (ofs & 3) {
 612                         printk(KERN_WARNING "Eep. ofs 0x%08x not word-aligned!\n", ofs);
 613                         ofs = PAD(ofs);
 614                         continue;
 615                 }
 616                 if (ofs == prevofs) {
 617                         printk(KERN_WARNING "ofs 0x%08x has already been seen. Skipping\n", ofs);
 618                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 619                                 return err;
 620                         ofs += 4;
 621                         continue;
 622                 }
 623                 prevofs = ofs;
 624
 625                 if (jeb->offset + c->sector_size < ofs + sizeof(*node)) {
 626                         D1(printk(KERN_DEBUG "Fewer than %zd bytes left to end of block. (%x+%x<%x+%zx) Not reading\n", sizeof(struct jffs2_unknown_node),
 627                                   jeb->offset, c->sector_size, ofs, sizeof(*node)));
 628                         if ((err = jffs2_scan_dirty_space(c, jeb, (jeb->offset + c->sector_size)-ofs)))
 629                                 return err;
 630                         break;
 631                 }
 632
 633                 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
 634                         buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 635                         D1(printk(KERN_DEBUG "Fewer than %zd bytes (node header) left to end of buf. Reading 0x%x at 0x%08x\n",
 636                                   sizeof(struct jffs2_unknown_node), buf_len, ofs));
 637                         err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 638                         if (err)
 639                                 return err;
 640                         buf_ofs = ofs;
 641                 }
 642
 643                 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
 644
 645                 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
 646                         uint32_t inbuf_ofs;
 647                         uint32_t empty_start, scan_end;
 648
 649                         empty_start = ofs;
 650                         ofs += 4;
 651                         scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(c->sector_size)/8, buf_len);
 652
 653                         D1(printk(KERN_DEBUG "Found empty flash at 0x%08x\n", ofs));
 654                 more_empty:
 655                         inbuf_ofs = ofs - buf_ofs;
 656                         while (inbuf_ofs < scan_end) {
 657                                 if (unlikely(*(uint32_t *)(&buf[inbuf_ofs]) != 0xffffffff)) {
 658                                         printk(KERN_WARNING "Empty flash at 0x%08x ends at 0x%08x\n",
 659                                                empty_start, ofs);
 660                                         if ((err = jffs2_scan_dirty_space(c, jeb, ofs-empty_start)))
 661                                                 return err;
 662                                         goto scan_more;
 663                                 }
 664
 665                                 inbuf_ofs+=4;
 666                                 ofs += 4;
 667                         }
 668                         /* Ran off end. */
 669                         D1(printk(KERN_DEBUG "Empty flash to end of buffer at 0x%08x\n", ofs));
 670
 671                         /* If we're only checking the beginning of a block with a cleanmarker,
 672                            bail now */
 673                         if (buf_ofs == jeb->offset && jeb->used_size == PAD(c->cleanmarker_size) &&
 674                             c->cleanmarker_size && !jeb->dirty_size && !ref_next(jeb->first_node)) {
 675                                 D1(printk(KERN_DEBUG "%d bytes at start of block seems clean... assuming all clean\n", EMPTY_SCAN_SIZE(c->sector_size)));
 676                                 return BLK_STATE_CLEANMARKER;
 677                         }
 678                         if (!buf_size && (scan_end != buf_len)) {/* XIP/point case */
 679                                 scan_end = buf_len;
 680                                 goto more_empty;
 681                         }
 682
 683                         /* See how much more there is to read in this eraseblock... */
 684                         buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 685                         if (!buf_len) {
 686                                 /* No more to read. Break out of main loop without marking
 687                                    this range of empty space as dirty (because it's not) */
 688                                 D1(printk(KERN_DEBUG "Empty flash at %08x runs to end of block. Treating as free_space\n",
 689                                           empty_start));
 690                                 break;
 691                         }
 692                         /* point never reaches here */
 693                         scan_end = buf_len;
 694                         D1(printk(KERN_DEBUG "Reading another 0x%x at 0x%08x\n", buf_len, ofs));
 695                         err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 696                         if (err)
 697                                 return err;
 698                         buf_ofs = ofs;
 699                         goto more_empty;
 700                 }
 701
 702                 if (ofs == jeb->offset && je16_to_cpu(node->magic) == KSAMTIB_CIGAM_2SFFJ) {
 703                         printk(KERN_WARNING "Magic bitmask is backwards at offset 0x%08x. Wrong endian filesystem?\n", ofs);
 704                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 705                                 return err;
 706                         ofs += 4;
 707                         continue;
 708                 }
 709                 if (je16_to_cpu(node->magic) == JFFS2_DIRTY_BITMASK) {
 710                         D1(printk(KERN_DEBUG "Dirty bitmask at 0x%08x\n", ofs));
 711                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 712                                 return err;
 713                         ofs += 4;
 714                         continue;
 715                 }
 716                 if (je16_to_cpu(node->magic) == JFFS2_OLD_MAGIC_BITMASK) {
 717                         printk(KERN_WARNING "Old JFFS2 bitmask found at 0x%08x\n", ofs);
 718                         printk(KERN_WARNING "You cannot use older JFFS2 filesystems with newer kernels\n");
 719                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 720                                 return err;
 721                         ofs += 4;
 722                         continue;
 723                 }
 724                 if (je16_to_cpu(node->magic) != JFFS2_MAGIC_BITMASK) {
 725                         /* OK. We're out of possibilities. Whinge and move on */
 726                         noisy_printk(&noise, "jffs2_scan_eraseblock(): Magic bitmask 0x%04x not found at 0x%08x: 0x%04x instead\n",
 727                                      JFFS2_MAGIC_BITMASK, ofs,
 728                                      je16_to_cpu(node->magic));
 729                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 730                                 return err;
 731                         ofs += 4;
 732                         continue;
 733                 }
 734                 /* We seem to have a node of sorts. Check the CRC */
 735                 crcnode.magic = node->magic;
 736                 crcnode.nodetype = cpu_to_je16( je16_to_cpu(node->nodetype) | JFFS2_NODE_ACCURATE);
 737                 crcnode.totlen = node->totlen;
 738                 hdr_crc = crc32(0, &crcnode, sizeof(crcnode)-4);
 739
 740                 if (hdr_crc != je32_to_cpu(node->hdr_crc)) {
 741                         noisy_printk(&noise, "jffs2_scan_eraseblock(): Node at 0x%08x {0x%04x, 0x%04x, 0x%08x) has invalid CRC 0x%08x (calculated 0x%08x)\n",
 742                                      ofs, je16_to_cpu(node->magic),
 743                                      je16_to_cpu(node->nodetype),
 744                                      je32_to_cpu(node->totlen),
 745                                      je32_to_cpu(node->hdr_crc),
 746                                      hdr_crc);
 747                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 748                                 return err;
 749                         ofs += 4;
 750                         continue;
 751                 }
 752
 753                 if (ofs + je32_to_cpu(node->totlen) > jeb->offset + c->sector_size) {
 754                         /* Eep. Node goes over the end of the erase block. */
 755                         printk(KERN_WARNING "Node at 0x%08x with length 0x%08x would run over the end of the erase block\n",
 756                                ofs, je32_to_cpu(node->totlen));
 757                         printk(KERN_WARNING "Perhaps the file system was created with the wrong erase size?\n");
 758                         if ((err = jffs2_scan_dirty_space(c, jeb, 4)))
 759                                 return err;
 760                         ofs += 4;
 761                         continue;
 762                 }
 763
 764                 if (!(je16_to_cpu(node->nodetype) & JFFS2_NODE_ACCURATE)) {
 765                         /* Wheee. This is an obsoleted node */
 766                         D2(printk(KERN_DEBUG "Node at 0x%08x is obsolete. Skipping\n", ofs));
 767                         if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen)))))
 768                                 return err;
 769                         ofs += PAD(je32_to_cpu(node->totlen));
 770                         continue;
 771                 }
 772
 773                 switch(je16_to_cpu(node->nodetype)) {
 774                 case JFFS2_NODETYPE_INODE:
 775                         if (buf_ofs + buf_len < ofs + sizeof(struct jffs2_raw_inode)) {
 776                                 buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 777                                 D1(printk(KERN_DEBUG "Fewer than %zd bytes (inode node) left to end of buf. Reading 0x%x at 0x%08x\n",
 778                                           sizeof(struct jffs2_raw_inode), buf_len, ofs));
 779                                 err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 780                                 if (err)
 781                                         return err;
 782                                 buf_ofs = ofs;
 783                                 node = (void *)buf;
 784                         }
 785                         err = jffs2_scan_inode_node(c, jeb, (void *)node, ofs, s);
 786                         if (err) return err;
 787                         ofs += PAD(je32_to_cpu(node->totlen));
 788                         break;
 789
 790                 case JFFS2_NODETYPE_DIRENT:
 791                         if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) {
 792                                 buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 793                                 D1(printk(KERN_DEBUG "Fewer than %d bytes (dirent node) left to end of buf. Reading 0x%x at 0x%08x\n",
 794                                           je32_to_cpu(node->totlen), buf_len, ofs));
 795                                 err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 796                                 if (err)
 797                                         return err;
 798                                 buf_ofs = ofs;
 799                                 node = (void *)buf;
 800                         }
 801                         err = jffs2_scan_dirent_node(c, jeb, (void *)node, ofs, s);
 802                         if (err) return err;
 803                         ofs += PAD(je32_to_cpu(node->totlen));
 804                         break;
 805
 806 #ifdef CONFIG_JFFS2_FS_XATTR
 807                 case JFFS2_NODETYPE_XATTR:
 808                         if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) {
 809                                 buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 810                                 D1(printk(KERN_DEBUG "Fewer than %d bytes (xattr node)"
 811                                           " left to end of buf. Reading 0x%x at 0x%08x\n",
 812                                           je32_to_cpu(node->totlen), buf_len, ofs));
 813                                 err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 814                                 if (err)
 815                                         return err;
 816                                 buf_ofs = ofs;
 817                                 node = (void *)buf;
 818                         }
 819                         err = jffs2_scan_xattr_node(c, jeb, (void *)node, ofs, s);
 820                         if (err)
 821                                 return err;
 822                         ofs += PAD(je32_to_cpu(node->totlen));
 823                         break;
 824                 case JFFS2_NODETYPE_XREF:
 825                         if (buf_ofs + buf_len < ofs + je32_to_cpu(node->totlen)) {
 826                                 buf_len = min_t(uint32_t, buf_size, jeb->offset + c->sector_size - ofs);
 827                                 D1(printk(KERN_DEBUG "Fewer than %d bytes (xref node)"
 828                                           " left to end of buf. Reading 0x%x at 0x%08x\n",
 829                                           je32_to_cpu(node->totlen), buf_len, ofs));
 830                                 err = jffs2_fill_scan_buf(c, buf, ofs, buf_len);
 831                                 if (err)
 832                                         return err;
 833                                 buf_ofs = ofs;
 834                                 node = (void *)buf;
 835                         }
 836                         err = jffs2_scan_xref_node(c, jeb, (void *)node, ofs, s);
 837                         if (err)
 838                                 return err;
 839                         ofs += PAD(je32_to_cpu(node->totlen));
 840                         break;
 841 #endif  /* CONFIG_JFFS2_FS_XATTR */
 842
 843                 case JFFS2_NODETYPE_CLEANMARKER:
 844                         D1(printk(KERN_DEBUG "CLEANMARKER node found at 0x%08x\n", ofs));
 845                         if (je32_to_cpu(node->totlen) != c->cleanmarker_size) {
 846                                 printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x has totlen 0x%x != normal 0x%x\n",
 847                                        ofs, je32_to_cpu(node->totlen), c->cleanmarker_size);
 848                                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node)))))
 849                                         return err;
 850                                 ofs += PAD(sizeof(struct jffs2_unknown_node));
 851                         } else if (jeb->first_node) {
 852                                 printk(KERN_NOTICE "CLEANMARKER node found at 0x%08x, not first node in block (0x%08x)\n", ofs, jeb->offset);
 853                                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(sizeof(struct jffs2_unknown_node)))))
 854                                         return err;
 855                                 ofs += PAD(sizeof(struct jffs2_unknown_node));
 856                         } else {
 857                                 jffs2_link_node_ref(c, jeb, ofs | REF_NORMAL, c->cleanmarker_size, NULL);
 858
 859                                 ofs += PAD(c->cleanmarker_size);
 860                         }
 861                         break;
 862
 863                 case JFFS2_NODETYPE_PADDING:
 864                         if (jffs2_sum_active())
 865                                 jffs2_sum_add_padding_mem(s, je32_to_cpu(node->totlen));
 866                         if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen)))))
 867                                 return err;
 868                         ofs += PAD(je32_to_cpu(node->totlen));
 869                         break;
 870
 871                 default:
 872                         switch (je16_to_cpu(node->nodetype) & JFFS2_COMPAT_MASK) {
 873                         case JFFS2_FEATURE_ROCOMPAT:
 874                                 printk(KERN_NOTICE "Read-only compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs);
 875                                 c->flags |= JFFS2_SB_FLAG_RO;
 876                                 if (!(jffs2_is_readonly(c)))
 877                                         return -EROFS;
 878                                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen)))))
 879                                         return err;
 880                                 ofs += PAD(je32_to_cpu(node->totlen));
 881                                 break;
 882
 883                         case JFFS2_FEATURE_INCOMPAT:
 884                                 printk(KERN_NOTICE "Incompatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs);
 885                                 return -EINVAL;
 886
 887                         case JFFS2_FEATURE_RWCOMPAT_DELETE:
 888                                 D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs));
 889                                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(node->totlen)))))
 890                                         return err;
 891                                 ofs += PAD(je32_to_cpu(node->totlen));
 892                                 break;
 893
 894                         case JFFS2_FEATURE_RWCOMPAT_COPY: {
 895                                 D1(printk(KERN_NOTICE "Unknown but compatible feature node (0x%04x) found at offset 0x%08x\n", je16_to_cpu(node->nodetype), ofs));
 896
 897                                 jffs2_link_node_ref(c, jeb, ofs | REF_PRISTINE, PAD(je32_to_cpu(node->totlen)), NULL);
 898
 899                                 /* We can't summarise nodes we don't grok */
 900                                 jffs2_sum_disable_collecting(s);
 901                                 ofs += PAD(je32_to_cpu(node->totlen));
 902                                 break;
 903                                 }
 904                         }
 905                 }
 906         }
 907
 908         if (jffs2_sum_active()) {
 909                 if (PAD(s->sum_size + JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size) {
 910                         dbg_summary("There is not enough space for "
 911                                 "summary information, disabling for this jeb!\n");
 912                         jffs2_sum_disable_collecting(s);
 913                 }
 914         }
 915
 916         D1(printk(KERN_DEBUG "Block at 0x%08x: free 0x%08x, dirty 0x%08x, unchecked 0x%08x, used 0x%08x, wasted 0x%08x\n",
 917                   jeb->offset,jeb->free_size, jeb->dirty_size, jeb->unchecked_size, jeb->used_size, jeb->wasted_size));
 918
 919         /* mark_node_obsolete can add to wasted !! */
 920         if (jeb->wasted_size) {
 921                 jeb->dirty_size += jeb->wasted_size;
 922                 c->dirty_size += jeb->wasted_size;
 923                 c->wasted_size -= jeb->wasted_size;
 924                 jeb->wasted_size = 0;
 925         }
 926
 927         return jffs2_scan_classify_jeb(c, jeb);
 928 }
 929
 930 struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino)
 931 {
 932         struct jffs2_inode_cache *ic;
 933
 934         ic = jffs2_get_ino_cache(c, ino);
 935         if (ic)
 936                 return ic;
 937
 938         if (ino > c->highest_ino)
 939                 c->highest_ino = ino;
 940
 941         ic = jffs2_alloc_inode_cache();
 942         if (!ic) {
 943                 printk(KERN_NOTICE "jffs2_scan_make_inode_cache(): allocation of inode cache failed\n");
 944                 return NULL;
 945         }
 946         memset(ic, 0, sizeof(*ic));
 947
 948         ic->ino = ino;
 949         ic->nodes = (void *)ic;
 950         jffs2_add_ino_cache(c, ic);
 951         if (ino == 1)
 952                 ic->pino_nlink = 1;
 953         return ic;
 954 }
 955
 956 static int jffs2_scan_inode_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
 957                                  struct jffs2_raw_inode *ri, uint32_t ofs, struct jffs2_summary *s)
 958 {
 959         struct jffs2_inode_cache *ic;
 960         uint32_t crc, ino = je32_to_cpu(ri->ino);
 961
 962         D1(printk(KERN_DEBUG "jffs2_scan_inode_node(): Node at 0x%08x\n", ofs));
 963
 964         /* We do very little here now. Just check the ino# to which we should attribute
 965            this node; we can do all the CRC checking etc. later. There's a tradeoff here --
 966            we used to scan the flash once only, reading everything we want from it into
 967            memory, then building all our in-core data structures and freeing the extra
 968            information. Now we allow the first part of the mount to complete a lot quicker,
 969            but we have to go _back_ to the flash in order to finish the CRC checking, etc.
 970            Which means that the _full_ amount of time to get to proper write mode with GC
 971            operational may actually be _longer_ than before. Sucks to be me. */
 972
 973         /* Check the node CRC in any case. */
 974         crc = crc32(0, ri, sizeof(*ri)-8);
 975         if (crc != je32_to_cpu(ri->node_crc)) {
 976                 printk(KERN_NOTICE "jffs2_scan_inode_node(): CRC failed on "
 977                        "node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
 978                        ofs, je32_to_cpu(ri->node_crc), crc);
 979                 /*
 980                  * We believe totlen because the CRC on the node
 981                  * _header_ was OK, just the node itself failed.
 982                  */
 983                 return jffs2_scan_dirty_space(c, jeb,
 984                                               PAD(je32_to_cpu(ri->totlen)));
 985         }
 986
 987         ic = jffs2_get_ino_cache(c, ino);
 988         if (!ic) {
 989                 ic = jffs2_scan_make_ino_cache(c, ino);
 990                 if (!ic)
 991                         return -ENOMEM;
 992         }
 993
 994         /* Wheee. It worked */
 995         jffs2_link_node_ref(c, jeb, ofs | REF_UNCHECKED, PAD(je32_to_cpu(ri->totlen)), ic);
 996
 997         D1(printk(KERN_DEBUG "Node is ino #%u, version %d. Range 0x%x-0x%x\n",
 998                   je32_to_cpu(ri->ino), je32_to_cpu(ri->version),
 999                   je32_to_cpu(ri->offset),
1000                   je32_to_cpu(ri->offset)+je32_to_cpu(ri->dsize)));
1001
1002         pseudo_random += je32_to_cpu(ri->version);
1003
1004         if (jffs2_sum_active()) {
1005                 jffs2_sum_add_inode_mem(s, ri, ofs - jeb->offset);
1006         }
1007
1008         return 0;
1009 }
1010
1011 static int jffs2_scan_dirent_node(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
1012                                   struct jffs2_raw_dirent *rd, uint32_t ofs, struct jffs2_summary *s)
1013 {
1014         struct jffs2_full_dirent *fd;
1015         struct jffs2_inode_cache *ic;
1016         uint32_t checkedlen;
1017         uint32_t crc;
1018         int err;
1019
1020         D1(printk(KERN_DEBUG "jffs2_scan_dirent_node(): Node at 0x%08x\n", ofs));
1021
1022         /* We don't get here unless the node is still valid, so we don't have to
1023            mask in the ACCURATE bit any more. */
1024         crc = crc32(0, rd, sizeof(*rd)-8);
1025
1026         if (crc != je32_to_cpu(rd->node_crc)) {
1027                 printk(KERN_NOTICE "jffs2_scan_dirent_node(): Node CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
1028                        ofs, je32_to_cpu(rd->node_crc), crc);
1029                 /* We believe totlen because the CRC on the node _header_ was OK, just the node itself failed. */
1030                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen)))))
1031                         return err;
1032                 return 0;
1033         }
1034
1035         pseudo_random += je32_to_cpu(rd->version);
1036
1037         /* Should never happen. Did. (OLPC trac #4184)*/
1038         checkedlen = strnlen(rd->name, rd->nsize);
1039         if (checkedlen < rd->nsize) {
1040                 printk(KERN_ERR "Dirent at %08x has zeroes in name. Truncating to %d chars\n",
1041                        ofs, checkedlen);
1042         }
1043         fd = jffs2_alloc_full_dirent(checkedlen+1);
1044         if (!fd) {
1045                 return -ENOMEM;
1046         }
1047         memcpy(&fd->name, rd->name, checkedlen);
1048         fd->name[checkedlen] = 0;
1049
1050         crc = crc32(0, fd->name, rd->nsize);
1051         if (crc != je32_to_cpu(rd->name_crc)) {
1052                 printk(KERN_NOTICE "jffs2_scan_dirent_node(): Name CRC failed on node at 0x%08x: Read 0x%08x, calculated 0x%08x\n",
1053                        ofs, je32_to_cpu(rd->name_crc), crc);
1054                 D1(printk(KERN_NOTICE "Name for which CRC failed is (now) '%s', ino #%d\n", fd->name, je32_to_cpu(rd->ino)));
1055                 jffs2_free_full_dirent(fd);
1056                 /* FIXME: Why do we believe totlen? */
1057                 /* We believe totlen because the CRC on the node _header_ was OK, just the name failed. */
1058                 if ((err = jffs2_scan_dirty_space(c, jeb, PAD(je32_to_cpu(rd->totlen)))))
1059                         return err;
1060                 return 0;
1061         }
1062         ic = jffs2_scan_make_ino_cache(c, je32_to_cpu(rd->pino));
1063         if (!ic) {
1064                 jffs2_free_full_dirent(fd);
1065                 return -ENOMEM;
1066         }
1067
1068         fd->raw = jffs2_link_node_ref(c, jeb, ofs | dirent_node_state(rd),
1069                                       PAD(je32_to_cpu(rd->totlen)), ic);
1070
1071         fd->next = NULL;
1072         fd->version = je32_to_cpu(rd->version);
1073         fd->ino = je32_to_cpu(rd->ino);
1074         fd->nhash = full_name_hash(fd->name, checkedlen);
1075         fd->type = rd->type;
1076         jffs2_add_fd_to_list(c, fd, &ic->scan_dents);
1077
1078         if (jffs2_sum_active()) {
1079                 jffs2_sum_add_dirent_mem(s, rd, ofs - jeb->offset);
1080         }
1081
1082         return 0;
1083 }
1084
1085 static int count_list(struct list_head *l)
1086 {
1087         uint32_t count = 0;
1088         struct list_head *tmp;
1089
1090         list_for_each(tmp, l) {
1091                 count++;
1092         }
1093         return count;
1094 }
1095
1096 /* Note: This breaks if list_empty(head). I don't care. You
1097    might, if you copy this code and use it elsewhere :) */
1098 static void rotate_list(struct list_head *head, uint32_t count)
1099 {
1100         struct list_head *n = head->next;
1101
1102         list_del(head);
1103         while(count--) {
1104                 n = n->next;
1105         }
1106         list_add(head, n);
1107 }
1108
1109 void jffs2_rotate_lists(struct jffs2_sb_info *c)
1110 {
1111         uint32_t x;
1112         uint32_t rotateby;
1113
1114         x = count_list(&c->clean_list);
1115         if (x) {
1116                 rotateby = pseudo_random % x;
1117                 rotate_list((&c->clean_list), rotateby);
1118         }
1119
1120         x = count_list(&c->very_dirty_list);
1121         if (x) {
1122                 rotateby = pseudo_random % x;
1123                 rotate_list((&c->very_dirty_list), rotateby);
1124         }
1125
1126         x = count_list(&c->dirty_list);
1127         if (x) {
1128                 rotateby = pseudo_random % x;
1129                 rotate_list((&c->dirty_list), rotateby);
1130         }
1131
1132         x = count_list(&c->erasable_list);
1133         if (x) {
1134                 rotateby = pseudo_random % x;
1135                 rotate_list((&c->erasable_list), rotateby);
1136         }
1137
1138         if (c->nr_erasing_blocks) {
1139                 rotateby = pseudo_random % c->nr_erasing_blocks;
1140                 rotate_list((&c->erase_pending_list), rotateby);
1141         }
1142
1143         if (c->nr_free_blocks) {
1144                 rotateby = pseudo_random % c->nr_free_blocks;
1145                 rotate_list((&c->free_list), rotateby);
1146         }
1147 }