fs/jffs2/jffs2_1pass.c

   1 /*
   2 -------------------------------------------------------------------------
   3  * Filename:      jffs2.c
   4  * Version:       $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
   5  * Copyright:     Copyright (C) 2001, Russ Dill
   6  * Author:        Russ Dill <Russ.Dill@asu.edu>
   7  * Description:   Module to load kernel from jffs2
   8  *-----------------------------------------------------------------------*/
   9 /*
  10  * some portions of this code are taken from jffs2, and as such, the
  11  * following copyright notice is included.
  12  *
  13  * JFFS2 -- Journalling Flash File System, Version 2.
  14  *
  15  * Copyright (C) 2001 Red Hat, Inc.
  16  *
  17  * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
  18  *
  19  * The original JFFS, from which the design for JFFS2 was derived,
  20  * was designed and implemented by Axis Communications AB.
  21  *
  22  * The contents of this file are subject to the Red Hat eCos Public
  23  * License Version 1.1 (the "Licence"); you may not use this file
  24  * except in compliance with the Licence.  You may obtain a copy of
  25  * the Licence at http://www.redhat.com/
  26  *
  27  * Software distributed under the Licence is distributed on an "AS IS"
  28  * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
  29  * See the Licence for the specific language governing rights and
  30  * limitations under the Licence.
  31  *
  32  * The Original Code is JFFS2 - Journalling Flash File System, version 2
  33  *
  34  * Alternatively, the contents of this file may be used under the
  35  * terms of the GNU General Public License version 2 (the "GPL"), in
  36  * which case the provisions of the GPL are applicable instead of the
  37  * above.  If you wish to allow the use of your version of this file
  38  * only under the terms of the GPL and not to allow others to use your
  39  * version of this file under the RHEPL, indicate your decision by
  40  * deleting the provisions above and replace them with the notice and
  41  * other provisions required by the GPL.  If you do not delete the
  42  * provisions above, a recipient may use your version of this file
  43  * under either the RHEPL or the GPL.
  44  *
  45  * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
  46  *
  47  */
  48
  49 /* Ok, so anyone who knows the jffs2 code will probably want to get a papar
  50  * bag to throw up into before reading this code. I looked through the jffs2
  51  * code, the caching scheme is very elegant. I tried to keep the version
  52  * for a bootloader as small and simple as possible. Instead of worring about
  53  * unneccesary data copies, node scans, etc, I just optimized for the known
  54  * common case, a kernel, which looks like:
  55  *      (1) most pages are 4096 bytes
  56  *      (2) version numbers are somewhat sorted in acsending order
  57  *      (3) multiple compressed blocks making up one page is uncommon
  58  *
  59  * So I create a linked list of decending version numbers (insertions at the
  60  * head), and then for each page, walk down the list, until a matching page
  61  * with 4096 bytes is found, and then decompress the watching pages in
  62  * reverse order.
  63  *
  64  */
  65
  66 /*
  67  * Adapted by Nye Liu <nyet@zumanetworks.com> and
  68  * Rex Feany <rfeany@zumanetworks.com>
  69  * on Jan/2002 for U-Boot.
  70  *
  71  * Clipped out all the non-1pass functions, cleaned up warnings,
  72  * wrappers, etc. No major changes to the code.
  73  * Please, he really means it when he said have a paper bag
  74  * handy. We needed it ;).
  75  *
  76  */
  77
  78 /*
  79  * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
  80  *
  81  * - overhaul of the memory management. Removed much of the "paper-bagging"
  82  *   in that part of the code, fixed several bugs, now frees memory when
  83  *   partition is changed.
  84  *   It's still ugly :-(
  85  * - fixed a bug in jffs2_1pass_read_inode where the file length calculation
  86  *   was incorrect. Removed a bit of the paper-bagging as well.
  87  * - removed double crc calculation for fragment headers in jffs2_private.h
  88  *   for speedup.
  89  * - scan_empty rewritten in a more "standard" manner (non-paperbag, that is).
  90  * - spinning wheel now spins depending on how much memory has been scanned
  91  * - lots of small changes all over the place to "improve" readability.
  92  * - implemented fragment sorting to ensure that the newest data is copied
  93  *   if there are multiple copies of fragments for a certain file offset.
  94  *
  95  * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS.
  96  * Sorting is done while adding fragments to the lists, which is more or less a
  97  * bubble sort. This takes a lot of time, and is most probably not an issue if
  98  * the boot filesystem is always mounted readonly.
  99  *
 100  * You should define it if the boot filesystem is mounted writable, and updates
 101  * to the boot files are done by copying files to that filesystem.
 102  *
 103  *
 104  * There's a big issue left: endianess is completely ignored in this code. Duh!
 105  *
 106  *
 107  * You still should have paper bags at hand :-(. The code lacks more or less
 108  * any comment, and is still arcane and difficult to read in places. As this
 109  * might be incompatible with any new code from the jffs2 maintainers anyway,
 110  * it should probably be dumped and replaced by something like jffs2reader!
 111  */
 112
 113
 114 #include <common.h>
 115 #include <config.h>
 116 #include <malloc.h>
 117 #include <linux/stat.h>
 118 #include <linux/time.h>
 119 #include <watchdog.h>
 120 #include <jffs2/jffs2.h>
 121 #include <jffs2/jffs2_1pass.h>
 122 #include <linux/mtd/compat.h>
 123 #include <asm/errno.h>
 124
 125 #include "jffs2_private.h"
 126
 127
 128 #define NODE_CHUNK      1024    /* size of memory allocation chunk in b_nodes */
 129 #define SPIN_BLKSIZE    18      /* spin after having scanned 1<<BLKSIZE bytes */
 130
 131 /* Debugging switches */
 132 #undef  DEBUG_DIRENTS           /* print directory entry list after scan */
 133 #undef  DEBUG_FRAGMENTS         /* print fragment list after scan */
 134 #undef  DEBUG                   /* enable debugging messages */
 135
 136
 137 #ifdef  DEBUG
 138 # define DEBUGF(fmt,args...)    printf(fmt ,##args)
 139 #else
 140 # define DEBUGF(fmt,args...)
 141 #endif
 142
 143 #include "summary.h"
 144
 145 /* keeps pointer to currentlu processed partition */
 146 static struct part_info *current_part;
 147
 148 #if (defined(CONFIG_JFFS2_NAND) && \
 149      defined(CONFIG_CMD_NAND) )
 150 #include <nand.h>
 151 /*
 152  * Support for jffs2 on top of NAND-flash
 153  *
 154  * NAND memory isn't mapped in processor's address space,
 155  * so data should be fetched from flash before
 156  * being processed. This is exactly what functions declared
 157  * here do.
 158  *
 159  */
 160
 161 #define NAND_PAGE_SIZE 512
 162 #define NAND_PAGE_SHIFT 9
 163 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
 164
 165 #ifndef NAND_CACHE_PAGES
 166 #define NAND_CACHE_PAGES 16
 167 #endif
 168 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
 169
 170 static u8* nand_cache = NULL;
 171 static u32 nand_cache_off = (u32)-1;
 172
 173 static int read_nand_cached(u32 off, u32 size, u_char *buf)
 174 {
 175         struct mtdids *id = current_part->dev->id;
 176         u32 bytes_read = 0;
 177         size_t retlen;
 178         int cpy_bytes;
 179
 180         while (bytes_read < size) {
 181                 if ((off + bytes_read < nand_cache_off) ||
 182                     (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
 183                         nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
 184                         if (!nand_cache) {
 185                                 /* This memory never gets freed but 'cause
 186                                    it's a bootloader, nobody cares */
 187                                 nand_cache = malloc(NAND_CACHE_SIZE);
 188                                 if (!nand_cache) {
 189                                         printf("read_nand_cached: can't alloc cache size %d bytes\n",
 190                                                NAND_CACHE_SIZE);
 191                                         return -1;
 192                                 }
 193                         }
 194
 195                         retlen = NAND_CACHE_SIZE;
 196                         if (nand_read(&nand_info[id->num], nand_cache_off,
 197                                                 &retlen, nand_cache) != 0 ||
 198                                         retlen != NAND_CACHE_SIZE) {
 199                                 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
 200                                                 nand_cache_off, NAND_CACHE_SIZE);
 201                                 return -1;
 202                         }
 203                 }
 204                 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
 205                 if (cpy_bytes > size - bytes_read)
 206                         cpy_bytes = size - bytes_read;
 207                 memcpy(buf + bytes_read,
 208                        nand_cache + off + bytes_read - nand_cache_off,
 209                        cpy_bytes);
 210                 bytes_read += cpy_bytes;
 211         }
 212         return bytes_read;
 213 }
 214
 215 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
 216 {
 217         u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
 218
 219         if (NULL == buf) {
 220                 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
 221                 return NULL;
 222         }
 223         if (read_nand_cached(off, size, buf) < 0) {
 224                 if (!ext_buf)
 225                         free(buf);
 226                 return NULL;
 227         }
 228
 229         return buf;
 230 }
 231
 232 static void *get_node_mem_nand(u32 off, void *ext_buf)
 233 {
 234         struct jffs2_unknown_node node;
 235         void *ret = NULL;
 236
 237         if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
 238                 return NULL;
 239
 240         if (!(ret = get_fl_mem_nand(off, node.magic ==
 241                                JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
 242                                ext_buf))) {
 243                 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
 244                        off, node.magic, node.nodetype, node.totlen);
 245         }
 246         return ret;
 247 }
 248
 249 static void put_fl_mem_nand(void *buf)
 250 {
 251         free(buf);
 252 }
 253 #endif
 254
 255 #if defined(CONFIG_CMD_ONENAND)
 256
 257 #include <linux/mtd/mtd.h>
 258 #include <linux/mtd/onenand.h>
 259 #include <onenand_uboot.h>
 260
 261 #define ONENAND_PAGE_SIZE 2048
 262 #define ONENAND_PAGE_SHIFT 11
 263 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
 264
 265 #ifndef ONENAND_CACHE_PAGES
 266 #define ONENAND_CACHE_PAGES 4
 267 #endif
 268 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
 269
 270 static u8* onenand_cache;
 271 static u32 onenand_cache_off = (u32)-1;
 272
 273 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
 274 {
 275         u32 bytes_read = 0;
 276         size_t retlen;
 277         int cpy_bytes;
 278
 279         while (bytes_read < size) {
 280                 if ((off + bytes_read < onenand_cache_off) ||
 281                     (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
 282                         onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
 283                         if (!onenand_cache) {
 284                                 /* This memory never gets freed but 'cause
 285                                    it's a bootloader, nobody cares */
 286                                 onenand_cache = malloc(ONENAND_CACHE_SIZE);
 287                                 if (!onenand_cache) {
 288                                         printf("read_onenand_cached: can't alloc cache size %d bytes\n",
 289                                                ONENAND_CACHE_SIZE);
 290                                         return -1;
 291                                 }
 292                         }
 293
 294                         retlen = ONENAND_CACHE_SIZE;
 295                         if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
 296                                                 &retlen, onenand_cache) != 0 ||
 297                                         retlen != ONENAND_CACHE_SIZE) {
 298                                 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
 299                                         onenand_cache_off, ONENAND_CACHE_SIZE);
 300                                 return -1;
 301                         }
 302                 }
 303                 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
 304                 if (cpy_bytes > size - bytes_read)
 305                         cpy_bytes = size - bytes_read;
 306                 memcpy(buf + bytes_read,
 307                        onenand_cache + off + bytes_read - onenand_cache_off,
 308                        cpy_bytes);
 309                 bytes_read += cpy_bytes;
 310         }
 311         return bytes_read;
 312 }
 313
 314 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
 315 {
 316         u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
 317
 318         if (NULL == buf) {
 319                 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
 320                 return NULL;
 321         }
 322         if (read_onenand_cached(off, size, buf) < 0) {
 323                 if (!ext_buf)
 324                         free(buf);
 325                 return NULL;
 326         }
 327
 328         return buf;
 329 }
 330
 331 static void *get_node_mem_onenand(u32 off, void *ext_buf)
 332 {
 333         struct jffs2_unknown_node node;
 334         void *ret = NULL;
 335
 336         if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
 337                 return NULL;
 338
 339         ret = get_fl_mem_onenand(off, node.magic ==
 340                         JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
 341                         ext_buf);
 342         if (!ret) {
 343                 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
 344                        off, node.magic, node.nodetype, node.totlen);
 345         }
 346         return ret;
 347 }
 348
 349
 350 static void put_fl_mem_onenand(void *buf)
 351 {
 352         free(buf);
 353 }
 354 #endif
 355
 356
 357 #if defined(CONFIG_CMD_FLASH)
 358 /*
 359  * Support for jffs2 on top of NOR-flash
 360  *
 361  * NOR flash memory is mapped in processor's address space,
 362  * just return address.
 363  */
 364 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
 365 {
 366         u32 addr = off;
 367         struct mtdids *id = current_part->dev->id;
 368
 369         extern flash_info_t flash_info[];
 370         flash_info_t *flash = &flash_info[id->num];
 371
 372         addr += flash->start[0];
 373         if (ext_buf) {
 374                 memcpy(ext_buf, (void *)addr, size);
 375                 return ext_buf;
 376         }
 377         return (void*)addr;
 378 }
 379
 380 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
 381 {
 382         struct jffs2_unknown_node *pNode;
 383
 384         /* pNode will point directly to flash - don't provide external buffer
 385            and don't care about size */
 386         pNode = get_fl_mem_nor(off, 0, NULL);
 387         return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
 388                         pNode->totlen : sizeof(*pNode), ext_buf);
 389 }
 390 #endif
 391
 392
 393 /*
 394  * Generic jffs2 raw memory and node read routines.
 395  *
 396  */
 397 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
 398 {
 399         struct mtdids *id = current_part->dev->id;
 400
 401 #if defined(CONFIG_CMD_FLASH)
 402         if (id->type == MTD_DEV_TYPE_NOR) {
 403                 return get_fl_mem_nor(off, size, ext_buf);
 404         }
 405 #endif
 406
 407 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
 408         if (id->type == MTD_DEV_TYPE_NAND)
 409                 return get_fl_mem_nand(off, size, ext_buf);
 410 #endif
 411
 412 #if defined(CONFIG_CMD_ONENAND)
 413         if (id->type == MTD_DEV_TYPE_ONENAND)
 414                 return get_fl_mem_onenand(off, size, ext_buf);
 415 #endif
 416
 417         printf("get_fl_mem: unknown device type, using raw offset!\n");
 418         return (void*)off;
 419 }
 420
 421 static inline void *get_node_mem(u32 off, void *ext_buf)
 422 {
 423         struct mtdids *id = current_part->dev->id;
 424
 425 #if defined(CONFIG_CMD_FLASH)
 426         if (id->type == MTD_DEV_TYPE_NOR)
 427                 return get_node_mem_nor(off, ext_buf);
 428 #endif
 429
 430 #if defined(CONFIG_JFFS2_NAND) && \
 431     defined(CONFIG_CMD_NAND)
 432         if (id->type == MTD_DEV_TYPE_NAND)
 433                 return get_node_mem_nand(off, ext_buf);
 434 #endif
 435
 436 #if defined(CONFIG_CMD_ONENAND)
 437         if (id->type == MTD_DEV_TYPE_ONENAND)
 438                 return get_node_mem_onenand(off, ext_buf);
 439 #endif
 440
 441         printf("get_node_mem: unknown device type, using raw offset!\n");
 442         return (void*)off;
 443 }
 444
 445 static inline void put_fl_mem(void *buf, void *ext_buf)
 446 {
 447         struct mtdids *id = current_part->dev->id;
 448
 449         /* If buf is the same as ext_buf, it was provided by the caller -
 450            we shouldn't free it then. */
 451         if (buf == ext_buf)
 452                 return;
 453         switch (id->type) {
 454 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
 455         case MTD_DEV_TYPE_NAND:
 456                 return put_fl_mem_nand(buf);
 457 #endif
 458 #if defined(CONFIG_CMD_ONENAND)
 459         case MTD_DEV_TYPE_ONENAND:
 460                 return put_fl_mem_onenand(buf);
 461 #endif
 462         }
 463 }
 464
 465 /* Compression names */
 466 static char *compr_names[] = {
 467         "NONE",
 468         "ZERO",
 469         "RTIME",
 470         "RUBINMIPS",
 471         "COPY",
 472         "DYNRUBIN",
 473         "ZLIB",
 474 #if defined(CONFIG_JFFS2_LZO_LZARI)
 475         "LZO",
 476         "LZARI",
 477 #endif
 478 };
 479
 480 /* Memory management */
 481 struct mem_block {
 482         u32     index;
 483         struct mem_block *next;
 484         struct b_node nodes[NODE_CHUNK];
 485 };
 486
 487
 488 static void
 489 free_nodes(struct b_list *list)
 490 {
 491         while (list->listMemBase != NULL) {
 492                 struct mem_block *next = list->listMemBase->next;
 493                 free( list->listMemBase );
 494                 list->listMemBase = next;
 495         }
 496 }
 497
 498 static struct b_node *
 499 add_node(struct b_list *list)
 500 {
 501         u32 index = 0;
 502         struct mem_block *memBase;
 503         struct b_node *b;
 504
 505         memBase = list->listMemBase;
 506         if (memBase != NULL)
 507                 index = memBase->index;
 508 #if 0
 509         putLabeledWord("add_node: index = ", index);
 510         putLabeledWord("add_node: memBase = ", list->listMemBase);
 511 #endif
 512
 513         if (memBase == NULL || index >= NODE_CHUNK) {
 514                 /* we need more space before we continue */
 515                 memBase = mmalloc(sizeof(struct mem_block));
 516                 if (memBase == NULL) {
 517                         putstr("add_node: malloc failed\n");
 518                         return NULL;
 519                 }
 520                 memBase->next = list->listMemBase;
 521                 index = 0;
 522 #if 0
 523                 putLabeledWord("add_node: alloced a new membase at ", *memBase);
 524 #endif
 525
 526         }
 527         /* now we have room to add it. */
 528         b = &memBase->nodes[index];
 529         index ++;
 530
 531         memBase->index = index;
 532         list->listMemBase = memBase;
 533         list->listCount++;
 534         return b;
 535 }
 536
 537 static struct b_node *
 538 insert_node(struct b_list *list, u32 offset)
 539 {
 540         struct b_node *new;
 541 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 542         struct b_node *b, *prev;
 543 #endif
 544
 545         if (!(new = add_node(list))) {
 546                 putstr("add_node failed!\r\n");
 547                 return NULL;
 548         }
 549         new->offset = offset;
 550
 551 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 552         if (list->listTail != NULL && list->listCompare(new, list->listTail))
 553                 prev = list->listTail;
 554         else if (list->listLast != NULL && list->listCompare(new, list->listLast))
 555                 prev = list->listLast;
 556         else
 557                 prev = NULL;
 558
 559         for (b = (prev ? prev->next : list->listHead);
 560              b != NULL && list->listCompare(new, b);
 561              prev = b, b = b->next) {
 562                 list->listLoops++;
 563         }
 564         if (b != NULL)
 565                 list->listLast = prev;
 566
 567         if (b != NULL) {
 568                 new->next = b;
 569                 if (prev != NULL)
 570                         prev->next = new;
 571                 else
 572                         list->listHead = new;
 573         } else
 574 #endif
 575         {
 576                 new->next = (struct b_node *) NULL;
 577                 if (list->listTail != NULL) {
 578                         list->listTail->next = new;
 579                         list->listTail = new;
 580                 } else {
 581                         list->listTail = list->listHead = new;
 582                 }
 583         }
 584
 585         return new;
 586 }
 587
 588 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 589 /* Sort data entries with the latest version last, so that if there
 590  * is overlapping data the latest version will be used.
 591  */
 592 static int compare_inodes(struct b_node *new, struct b_node *old)
 593 {
 594         struct jffs2_raw_inode ojNew;
 595         struct jffs2_raw_inode ojOld;
 596         struct jffs2_raw_inode *jNew =
 597                 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
 598         struct jffs2_raw_inode *jOld =
 599                 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
 600
 601         return jNew->version > jOld->version;
 602 }
 603
 604 /* Sort directory entries so all entries in the same directory
 605  * with the same name are grouped together, with the latest version
 606  * last. This makes it easy to eliminate all but the latest version
 607  * by marking the previous version dead by setting the inode to 0.
 608  */
 609 static int compare_dirents(struct b_node *new, struct b_node *old)
 610 {
 611         struct jffs2_raw_dirent ojNew;
 612         struct jffs2_raw_dirent ojOld;
 613         struct jffs2_raw_dirent *jNew =
 614                 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
 615         struct jffs2_raw_dirent *jOld =
 616                 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
 617         int cmp;
 618
 619         /* ascending sort by pino */
 620         if (jNew->pino != jOld->pino)
 621                 return jNew->pino > jOld->pino;
 622
 623         /* pino is the same, so use ascending sort by nsize, so
 624          * we don't do strncmp unless we really must.
 625          */
 626         if (jNew->nsize != jOld->nsize)
 627                 return jNew->nsize > jOld->nsize;
 628
 629         /* length is also the same, so use ascending sort by name
 630          */
 631         cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
 632         if (cmp != 0)
 633                 return cmp > 0;
 634
 635         /* we have duplicate names in this directory, so use ascending
 636          * sort by version
 637          */
 638         if (jNew->version > jOld->version) {
 639                 /* since jNew is newer, we know jOld is not valid, so
 640                  * mark it with inode 0 and it will not be used
 641                  */
 642                 jOld->ino = 0;
 643                 return 1;
 644         }
 645
 646         return 0;
 647 }
 648 #endif
 649
 650 void
 651 jffs2_free_cache(struct part_info *part)
 652 {
 653         struct b_lists *pL;
 654
 655         if (part->jffs2_priv != NULL) {
 656                 pL = (struct b_lists *)part->jffs2_priv;
 657                 free_nodes(&pL->frag);
 658                 free_nodes(&pL->dir);
 659                 free(pL->readbuf);
 660                 free(pL);
 661         }
 662 }
 663
 664 static u32
 665 jffs_init_1pass_list(struct part_info *part)
 666 {
 667         struct b_lists *pL;
 668
 669         jffs2_free_cache(part);
 670
 671         if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
 672                 pL = (struct b_lists *)part->jffs2_priv;
 673
 674                 memset(pL, 0, sizeof(*pL));
 675 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 676                 pL->dir.listCompare = compare_dirents;
 677                 pL->frag.listCompare = compare_inodes;
 678 #endif
 679         }
 680         return 0;
 681 }
 682
 683 /* find the inode from the slashless name given a parent */
 684 static long
 685 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
 686 {
 687         struct b_node *b;
 688         struct jffs2_raw_inode *jNode;
 689         u32 totalSize = 0;
 690         u32 latestVersion = 0;
 691         uchar *lDest;
 692         uchar *src;
 693         long ret;
 694         int i;
 695         u32 counter = 0;
 696 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 697         /* Find file size before loading any data, so fragments that
 698          * start past the end of file can be ignored. A fragment
 699          * that is partially in the file is loaded, so extra data may
 700          * be loaded up to the next 4K boundary above the file size.
 701          * This shouldn't cause trouble when loading kernel images, so
 702          * we will live with it.
 703          */
 704         for (b = pL->frag.listHead; b != NULL; b = b->next) {
 705                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
 706                         sizeof(struct jffs2_raw_inode), pL->readbuf);
 707                 if ((inode == jNode->ino)) {
 708                         /* get actual file length from the newest node */
 709                         if (jNode->version >= latestVersion) {
 710                                 totalSize = jNode->isize;
 711                                 latestVersion = jNode->version;
 712                         }
 713                 }
 714                 put_fl_mem(jNode, pL->readbuf);
 715         }
 716 #endif
 717
 718         for (b = pL->frag.listHead; b != NULL; b = b->next) {
 719                 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
 720                                                                 pL->readbuf);
 721                 if ((inode == jNode->ino)) {
 722 #if 0
 723                         putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
 724                         putLabeledWord("read_inode: inode = ", jNode->ino);
 725                         putLabeledWord("read_inode: version = ", jNode->version);
 726                         putLabeledWord("read_inode: isize = ", jNode->isize);
 727                         putLabeledWord("read_inode: offset = ", jNode->offset);
 728                         putLabeledWord("read_inode: csize = ", jNode->csize);
 729                         putLabeledWord("read_inode: dsize = ", jNode->dsize);
 730                         putLabeledWord("read_inode: compr = ", jNode->compr);
 731                         putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
 732                         putLabeledWord("read_inode: flags = ", jNode->flags);
 733 #endif
 734
 735 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 736                         /* get actual file length from the newest node */
 737                         if (jNode->version >= latestVersion) {
 738                                 totalSize = jNode->isize;
 739                                 latestVersion = jNode->version;
 740                         }
 741 #endif
 742
 743                         if(dest) {
 744                                 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
 745                                 /* ignore data behind latest known EOF */
 746                                 if (jNode->offset > totalSize) {
 747                                         put_fl_mem(jNode, pL->readbuf);
 748                                         continue;
 749                                 }
 750                                 if (b->datacrc == CRC_UNKNOWN)
 751                                         b->datacrc = data_crc(jNode) ?
 752                                                 CRC_OK : CRC_BAD;
 753                                 if (b->datacrc == CRC_BAD) {
 754                                         put_fl_mem(jNode, pL->readbuf);
 755                                         continue;
 756                                 }
 757
 758                                 lDest = (uchar *) (dest + jNode->offset);
 759 #if 0
 760                                 putLabeledWord("read_inode: src = ", src);
 761                                 putLabeledWord("read_inode: dest = ", lDest);
 762 #endif
 763                                 switch (jNode->compr) {
 764                                 case JFFS2_COMPR_NONE:
 765                                         ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
 766                                         break;
 767                                 case JFFS2_COMPR_ZERO:
 768                                         ret = 0;
 769                                         for (i = 0; i < jNode->dsize; i++)
 770                                                 *(lDest++) = 0;
 771                                         break;
 772                                 case JFFS2_COMPR_RTIME:
 773                                         ret = 0;
 774                                         rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
 775                                         break;
 776                                 case JFFS2_COMPR_DYNRUBIN:
 777                                         /* this is slow but it works */
 778                                         ret = 0;
 779                                         dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
 780                                         break;
 781                                 case JFFS2_COMPR_ZLIB:
 782                                         ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
 783                                         break;
 784 #if defined(CONFIG_JFFS2_LZO_LZARI)
 785                                 case JFFS2_COMPR_LZO:
 786                                         ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
 787                                         break;
 788                                 case JFFS2_COMPR_LZARI:
 789                                         ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
 790                                         break;
 791 #endif
 792                                 default:
 793                                         /* unknown */
 794                                         putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
 795                                         put_fl_mem(jNode, pL->readbuf);
 796                                         return -1;
 797                                         break;
 798                                 }
 799                         }
 800
 801 #if 0
 802                         putLabeledWord("read_inode: totalSize = ", totalSize);
 803                         putLabeledWord("read_inode: compr ret = ", ret);
 804 #endif
 805                 }
 806                 counter++;
 807                 put_fl_mem(jNode, pL->readbuf);
 808         }
 809
 810 #if 0
 811         putLabeledWord("read_inode: returning = ", totalSize);
 812 #endif
 813         return totalSize;
 814 }
 815
 816 /* find the inode from the slashless name given a parent */
 817 static u32
 818 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
 819 {
 820         struct b_node *b;
 821         struct jffs2_raw_dirent *jDir;
 822         int len;
 823         u32 counter;
 824         u32 version = 0;
 825         u32 inode = 0;
 826
 827         /* name is assumed slash free */
 828         len = strlen(name);
 829
 830         counter = 0;
 831         /* we need to search all and return the inode with the highest version */
 832         for(b = pL->dir.listHead; b; b = b->next, counter++) {
 833                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
 834                                                                 pL->readbuf);
 835                 if ((pino == jDir->pino) && (len == jDir->nsize) &&
 836                     (jDir->ino) &&      /* 0 for unlink */
 837                     (!strncmp((char *)jDir->name, name, len))) {        /* a match */
 838                         if (jDir->version < version) {
 839                                 put_fl_mem(jDir, pL->readbuf);
 840                                 continue;
 841                         }
 842
 843                         if (jDir->version == version && inode != 0) {
 844                                 /* I'm pretty sure this isn't legal */
 845                                 putstr(" ** ERROR ** ");
 846                                 putnstr(jDir->name, jDir->nsize);
 847                                 putLabeledWord(" has dup version =", version);
 848                         }
 849                         inode = jDir->ino;
 850                         version = jDir->version;
 851                 }
 852 #if 0
 853                 putstr("\r\nfind_inode:p&l ->");
 854                 putnstr(jDir->name, jDir->nsize);
 855                 putstr("\r\n");
 856                 putLabeledWord("pino = ", jDir->pino);
 857                 putLabeledWord("nsize = ", jDir->nsize);
 858                 putLabeledWord("b = ", (u32) b);
 859                 putLabeledWord("counter = ", counter);
 860 #endif
 861                 put_fl_mem(jDir, pL->readbuf);
 862         }
 863         return inode;
 864 }
 865
 866 char *mkmodestr(unsigned long mode, char *str)
 867 {
 868         static const char *l = "xwr";
 869         int mask = 1, i;
 870         char c;
 871
 872         switch (mode & S_IFMT) {
 873                 case S_IFDIR:    str[0] = 'd'; break;
 874                 case S_IFBLK:    str[0] = 'b'; break;
 875                 case S_IFCHR:    str[0] = 'c'; break;
 876                 case S_IFIFO:    str[0] = 'f'; break;
 877                 case S_IFLNK:    str[0] = 'l'; break;
 878                 case S_IFSOCK:   str[0] = 's'; break;
 879                 case S_IFREG:    str[0] = '-'; break;
 880                 default:         str[0] = '?';
 881         }
 882
 883         for(i = 0; i < 9; i++) {
 884                 c = l[i%3];
 885                 str[9-i] = (mode & mask)?c:'-';
 886                 mask = mask<<1;
 887         }
 888
 889         if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
 890         if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
 891         if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
 892         str[10] = '\0';
 893         return str;
 894 }
 895
 896 static inline void dump_stat(struct stat *st, const char *name)
 897 {
 898         char str[20];
 899         char s[64], *p;
 900
 901         if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
 902                 st->st_mtime = 1;
 903
 904         ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
 905
 906         if ((p = strchr(s,'\n')) != NULL) *p = '\0';
 907         if ((p = strchr(s,'\r')) != NULL) *p = '\0';
 908
 909 /*
 910         printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
 911                 st->st_size, s, name);
 912 */
 913
 914         printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
 915 }
 916
 917 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
 918 {
 919         char fname[256];
 920         struct stat st;
 921
 922         if(!d || !i) return -1;
 923
 924         strncpy(fname, (char *)d->name, d->nsize);
 925         fname[d->nsize] = '\0';
 926
 927         memset(&st,0,sizeof(st));
 928
 929         st.st_mtime = i->mtime;
 930         st.st_mode = i->mode;
 931         st.st_ino = i->ino;
 932         st.st_size = i->isize;
 933
 934         dump_stat(&st, fname);
 935
 936         if (d->type == DT_LNK) {
 937                 unsigned char *src = (unsigned char *) (&i[1]);
 938                 putstr(" -> ");
 939                 putnstr(src, (int)i->dsize);
 940         }
 941
 942         putstr("\r\n");
 943
 944         return 0;
 945 }
 946
 947 /* list inodes with the given pino */
 948 static u32
 949 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
 950 {
 951         struct b_node *b;
 952         struct jffs2_raw_dirent *jDir;
 953
 954         for (b = pL->dir.listHead; b; b = b->next) {
 955                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
 956                                                                 pL->readbuf);
 957                 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
 958                         u32 i_version = 0;
 959                         struct jffs2_raw_inode ojNode;
 960                         struct jffs2_raw_inode *jNode, *i = NULL;
 961                         struct b_node *b2 = pL->frag.listHead;
 962
 963                         while (b2) {
 964                                 jNode = (struct jffs2_raw_inode *)
 965                                         get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
 966                                 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
 967                                         i_version = jNode->version;
 968                                         if (i)
 969                                                 put_fl_mem(i, NULL);
 970
 971                                         if (jDir->type == DT_LNK)
 972                                                 i = get_node_mem(b2->offset,
 973                                                                  NULL);
 974                                         else
 975                                                 i = get_fl_mem(b2->offset,
 976                                                                sizeof(*i),
 977                                                                NULL);
 978                                 }
 979                                 b2 = b2->next;
 980                         }
 981
 982                         dump_inode(pL, jDir, i);
 983                         put_fl_mem(i, NULL);
 984                 }
 985                 put_fl_mem(jDir, pL->readbuf);
 986         }
 987         return pino;
 988 }
 989
 990 static u32
 991 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
 992 {
 993         int i;
 994         char tmp[256];
 995         char working_tmp[256];
 996         char *c;
 997
 998         /* discard any leading slash */
 999         i = 0;
1000         while (fname[i] == '/')
1001                 i++;
1002         strcpy(tmp, &fname[i]);
1003
1004         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1005         {
1006                 strncpy(working_tmp, tmp, c - tmp);
1007                 working_tmp[c - tmp] = '\0';
1008 #if 0
1009                 putstr("search_inode: tmp = ");
1010                 putstr(tmp);
1011                 putstr("\r\n");
1012                 putstr("search_inode: wtmp = ");
1013                 putstr(working_tmp);
1014                 putstr("\r\n");
1015                 putstr("search_inode: c = ");
1016                 putstr(c);
1017                 putstr("\r\n");
1018 #endif
1019                 for (i = 0; i < strlen(c) - 1; i++)
1020                         tmp[i] = c[i + 1];
1021                 tmp[i] = '\0';
1022 #if 0
1023                 putstr("search_inode: post tmp = ");
1024                 putstr(tmp);
1025                 putstr("\r\n");
1026 #endif
1027
1028                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1029                         putstr("find_inode failed for name=");
1030                         putstr(working_tmp);
1031                         putstr("\r\n");
1032                         return 0;
1033                 }
1034         }
1035         /* this is for the bare filename, directories have already been mapped */
1036         if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1037                 putstr("find_inode failed for name=");
1038                 putstr(tmp);
1039                 putstr("\r\n");
1040                 return 0;
1041         }
1042         return pino;
1043
1044 }
1045
1046 static u32
1047 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1048 {
1049         struct b_node *b;
1050         struct b_node *b2;
1051         struct jffs2_raw_dirent *jDir;
1052         struct jffs2_raw_inode *jNode;
1053         u8 jDirFoundType = 0;
1054         u32 jDirFoundIno = 0;
1055         u32 jDirFoundPino = 0;
1056         char tmp[256];
1057         u32 version = 0;
1058         u32 pino;
1059         unsigned char *src;
1060
1061         /* we need to search all and return the inode with the highest version */
1062         for(b = pL->dir.listHead; b; b = b->next) {
1063                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1064                                                                 pL->readbuf);
1065                 if (ino == jDir->ino) {
1066                         if (jDir->version < version) {
1067                                 put_fl_mem(jDir, pL->readbuf);
1068                                 continue;
1069                         }
1070
1071                         if (jDir->version == version && jDirFoundType) {
1072                                 /* I'm pretty sure this isn't legal */
1073                                 putstr(" ** ERROR ** ");
1074                                 putnstr(jDir->name, jDir->nsize);
1075                                 putLabeledWord(" has dup version (resolve) = ",
1076                                         version);
1077                         }
1078
1079                         jDirFoundType = jDir->type;
1080                         jDirFoundIno = jDir->ino;
1081                         jDirFoundPino = jDir->pino;
1082                         version = jDir->version;
1083                 }
1084                 put_fl_mem(jDir, pL->readbuf);
1085         }
1086         /* now we found the right entry again. (shoulda returned inode*) */
1087         if (jDirFoundType != DT_LNK)
1088                 return jDirFoundIno;
1089
1090         /* it's a soft link so we follow it again. */
1091         b2 = pL->frag.listHead;
1092         while (b2) {
1093                 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1094                                                                 pL->readbuf);
1095                 if (jNode->ino == jDirFoundIno) {
1096                         src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1097
1098 #if 0
1099                         putLabeledWord("\t\t dsize = ", jNode->dsize);
1100                         putstr("\t\t target = ");
1101                         putnstr(src, jNode->dsize);
1102                         putstr("\r\n");
1103 #endif
1104                         strncpy(tmp, (char *)src, jNode->dsize);
1105                         tmp[jNode->dsize] = '\0';
1106                         put_fl_mem(jNode, pL->readbuf);
1107                         break;
1108                 }
1109                 b2 = b2->next;
1110                 put_fl_mem(jNode, pL->readbuf);
1111         }
1112         /* ok so the name of the new file to find is in tmp */
1113         /* if it starts with a slash it is root based else shared dirs */
1114         if (tmp[0] == '/')
1115                 pino = 1;
1116         else
1117                 pino = jDirFoundPino;
1118
1119         return jffs2_1pass_search_inode(pL, tmp, pino);
1120 }
1121
1122 static u32
1123 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1124 {
1125         int i;
1126         char tmp[256];
1127         char working_tmp[256];
1128         char *c;
1129
1130         /* discard any leading slash */
1131         i = 0;
1132         while (fname[i] == '/')
1133                 i++;
1134         strcpy(tmp, &fname[i]);
1135         working_tmp[0] = '\0';
1136         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1137         {
1138                 strncpy(working_tmp, tmp, c - tmp);
1139                 working_tmp[c - tmp] = '\0';
1140                 for (i = 0; i < strlen(c) - 1; i++)
1141                         tmp[i] = c[i + 1];
1142                 tmp[i] = '\0';
1143                 /* only a failure if we arent looking at top level */
1144                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1145                     (working_tmp[0])) {
1146                         putstr("find_inode failed for name=");
1147                         putstr(working_tmp);
1148                         putstr("\r\n");
1149                         return 0;
1150                 }
1151         }
1152
1153         if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1154                 putstr("find_inode failed for name=");
1155                 putstr(tmp);
1156                 putstr("\r\n");
1157                 return 0;
1158         }
1159         /* this is for the bare filename, directories have already been mapped */
1160         if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1161                 putstr("find_inode failed for name=");
1162                 putstr(tmp);
1163                 putstr("\r\n");
1164                 return 0;
1165         }
1166         return pino;
1167
1168 }
1169
1170 unsigned char
1171 jffs2_1pass_rescan_needed(struct part_info *part)
1172 {
1173         struct b_node *b;
1174         struct jffs2_unknown_node onode;
1175         struct jffs2_unknown_node *node;
1176         struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1177
1178         if (part->jffs2_priv == 0){
1179                 DEBUGF ("rescan: First time in use\n");
1180                 return 1;
1181         }
1182
1183         /* if we have no list, we need to rescan */
1184         if (pL->frag.listCount == 0) {
1185                 DEBUGF ("rescan: fraglist zero\n");
1186                 return 1;
1187         }
1188
1189         /* but suppose someone reflashed a partition at the same offset... */
1190         b = pL->dir.listHead;
1191         while (b) {
1192                 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1193                         sizeof(onode), &onode);
1194                 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1195                         DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1196                                         (unsigned long) b->offset);
1197                         return 1;
1198                 }
1199                 b = b->next;
1200         }
1201         return 0;
1202 }
1203
1204 #ifdef CONFIG_JFFS2_SUMMARY
1205 static u32 sum_get_unaligned32(u32 *ptr)
1206 {
1207         u32 val;
1208         u8 *p = (u8 *)ptr;
1209
1210         val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1211
1212         return __le32_to_cpu(val);
1213 }
1214
1215 static u16 sum_get_unaligned16(u16 *ptr)
1216 {
1217         u16 val;
1218         u8 *p = (u8 *)ptr;
1219
1220         val = *p | (*(p + 1) << 8);
1221
1222         return __le16_to_cpu(val);
1223 }
1224
1225 #define dbg_summary(...) do {} while (0);
1226 /*
1227  * Process the stored summary information - helper function for
1228  * jffs2_sum_scan_sumnode()
1229  */
1230
1231 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1232                                 struct jffs2_raw_summary *summary,
1233                                 struct b_lists *pL)
1234 {
1235         void *sp;
1236         int i, pass;
1237         void *ret;
1238
1239         for (pass = 0; pass < 2; pass++) {
1240                 sp = summary->sum;
1241
1242                 for (i = 0; i < summary->sum_num; i++) {
1243                         struct jffs2_sum_unknown_flash *spu = sp;
1244                         dbg_summary("processing summary index %d\n", i);
1245
1246                         switch (sum_get_unaligned16(&spu->nodetype)) {
1247                                 case JFFS2_NODETYPE_INODE: {
1248                                 struct jffs2_sum_inode_flash *spi;
1249                                         if (pass) {
1250                                                 spi = sp;
1251
1252                                                 ret = insert_node(&pL->frag,
1253                                                         (u32)part->offset +
1254                                                         offset +
1255                                                         sum_get_unaligned32(
1256                                                                 &spi->offset));
1257                                                 if (ret == NULL)
1258                                                         return -1;
1259                                         }
1260
1261                                         sp += JFFS2_SUMMARY_INODE_SIZE;
1262
1263                                         break;
1264                                 }
1265                                 case JFFS2_NODETYPE_DIRENT: {
1266                                         struct jffs2_sum_dirent_flash *spd;
1267                                         spd = sp;
1268                                         if (pass) {
1269                                                 ret = insert_node(&pL->dir,
1270                                                         (u32) part->offset +
1271                                                         offset +
1272                                                         sum_get_unaligned32(
1273                                                                 &spd->offset));
1274                                                 if (ret == NULL)
1275                                                         return -1;
1276                                         }
1277
1278                                         sp += JFFS2_SUMMARY_DIRENT_SIZE(
1279                                                         spd->nsize);
1280
1281                                         break;
1282                                 }
1283                                 default : {
1284                                         uint16_t nodetype = sum_get_unaligned16(
1285                                                                 &spu->nodetype);
1286                                         printf("Unsupported node type %x found"
1287                                                         " in summary!\n",
1288                                                         nodetype);
1289                                         if ((nodetype & JFFS2_COMPAT_MASK) ==
1290                                                         JFFS2_FEATURE_INCOMPAT)
1291                                                 return -EIO;
1292                                         return -EBADMSG;
1293                                 }
1294                         }
1295                 }
1296         }
1297         return 0;
1298 }
1299
1300 /* Process the summary node - called from jffs2_scan_eraseblock() */
1301 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1302                            struct jffs2_raw_summary *summary, uint32_t sumsize,
1303                            struct b_lists *pL)
1304 {
1305         struct jffs2_unknown_node crcnode;
1306         int ret, ofs;
1307         uint32_t crc;
1308
1309         ofs = part->sector_size - sumsize;
1310
1311         dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1312                     offset, offset + ofs, sumsize);
1313
1314         /* OK, now check for node validity and CRC */
1315         crcnode.magic = JFFS2_MAGIC_BITMASK;
1316         crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1317         crcnode.totlen = summary->totlen;
1318         crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1319
1320         if (summary->hdr_crc != crc) {
1321                 dbg_summary("Summary node header is corrupt (bad CRC or "
1322                                 "no summary at all)\n");
1323                 goto crc_err;
1324         }
1325
1326         if (summary->totlen != sumsize) {
1327                 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1328                 goto crc_err;
1329         }
1330
1331         crc = crc32_no_comp(0, (uchar *)summary,
1332                         sizeof(struct jffs2_raw_summary)-8);
1333
1334         if (summary->node_crc != crc) {
1335                 dbg_summary("Summary node is corrupt (bad CRC)\n");
1336                 goto crc_err;
1337         }
1338
1339         crc = crc32_no_comp(0, (uchar *)summary->sum,
1340                         sumsize - sizeof(struct jffs2_raw_summary));
1341
1342         if (summary->sum_crc != crc) {
1343                 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1344                 goto crc_err;
1345         }
1346
1347         if (summary->cln_mkr)
1348                 dbg_summary("Summary : CLEANMARKER node \n");
1349
1350         ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1351         if (ret == -EBADMSG)
1352                 return 0;
1353         if (ret)
1354                 return ret;             /* real error */
1355
1356         return 1;
1357
1358 crc_err:
1359         putstr("Summary node crc error, skipping summary information.\n");
1360
1361         return 0;
1362 }
1363 #endif /* CONFIG_JFFS2_SUMMARY */
1364
1365 #ifdef DEBUG_FRAGMENTS
1366 static void
1367 dump_fragments(struct b_lists *pL)
1368 {
1369         struct b_node *b;
1370         struct jffs2_raw_inode ojNode;
1371         struct jffs2_raw_inode *jNode;
1372
1373         putstr("\r\n\r\n******The fragment Entries******\r\n");
1374         b = pL->frag.listHead;
1375         while (b) {
1376                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1377                         sizeof(ojNode), &ojNode);
1378                 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1379                 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1380                 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1381                 putLabeledWord("\tbuild_list: version = ", jNode->version);
1382                 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1383                 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1384                 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1385                 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1386                 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1387                 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1388                 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1389                 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1390                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1391                 b = b->next;
1392         }
1393 }
1394 #endif
1395
1396 #ifdef DEBUG_DIRENTS
1397 static void
1398 dump_dirents(struct b_lists *pL)
1399 {
1400         struct b_node *b;
1401         struct jffs2_raw_dirent *jDir;
1402
1403         putstr("\r\n\r\n******The directory Entries******\r\n");
1404         b = pL->dir.listHead;
1405         while (b) {
1406                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1407                                                                 pL->readbuf);
1408                 putstr("\r\n");
1409                 putnstr(jDir->name, jDir->nsize);
1410                 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1411                 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1412                 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1413                 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1414                 putLabeledWord("\tbuild_list: version = ", jDir->version);
1415                 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1416                 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1417                 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1418                 putLabeledWord("\tbuild_list: type = ", jDir->type);
1419                 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1420                 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1421                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1422                 b = b->next;
1423                 put_fl_mem(jDir, pL->readbuf);
1424         }
1425 }
1426 #endif
1427
1428 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1429
1430 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1431 {
1432         if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1433                 return sector_size;
1434         else
1435                 return DEFAULT_EMPTY_SCAN_SIZE;
1436 }
1437
1438 static u32
1439 jffs2_1pass_build_lists(struct part_info * part)
1440 {
1441         struct b_lists *pL;
1442         struct jffs2_unknown_node *node;
1443         u32 nr_sectors = part->size/part->sector_size;
1444         u32 i;
1445         u32 counter4 = 0;
1446         u32 counterF = 0;
1447         u32 counterN = 0;
1448         u32 max_totlen = 0;
1449         u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1450         char *buf;
1451
1452         /* turn off the lcd.  Refreshing the lcd adds 50% overhead to the */
1453         /* jffs2 list building enterprise nope.  in newer versions the overhead is */
1454         /* only about 5 %.  not enough to inconvenience people for. */
1455         /* lcd_off(); */
1456
1457         /* if we are building a list we need to refresh the cache. */
1458         jffs_init_1pass_list(part);
1459         pL = (struct b_lists *)part->jffs2_priv;
1460         buf = malloc(buf_size);
1461         puts ("Scanning JFFS2 FS:   ");
1462
1463         /* start at the beginning of the partition */
1464         for (i = 0; i < nr_sectors; i++) {
1465                 uint32_t sector_ofs = i * part->sector_size;
1466                 uint32_t buf_ofs = sector_ofs;
1467                 uint32_t buf_len;
1468                 uint32_t ofs, prevofs;
1469 #ifdef CONFIG_JFFS2_SUMMARY
1470                 struct jffs2_sum_marker *sm;
1471                 void *sumptr = NULL;
1472                 uint32_t sumlen;
1473                 int ret;
1474 #endif
1475
1476                 WATCHDOG_RESET();
1477
1478 #ifdef CONFIG_JFFS2_SUMMARY
1479                 buf_len = sizeof(*sm);
1480
1481                 /* Read as much as we want into the _end_ of the preallocated
1482                  * buffer
1483                  */
1484                 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1485                                 buf_len, buf_len, buf + buf_size - buf_len);
1486
1487                 sm = (void *)buf + buf_size - sizeof(*sm);
1488                 if (sm->magic == JFFS2_SUM_MAGIC) {
1489                         sumlen = part->sector_size - sm->offset;
1490                         sumptr = buf + buf_size - sumlen;
1491
1492                         /* Now, make sure the summary itself is available */
1493                         if (sumlen > buf_size) {
1494                                 /* Need to kmalloc for this. */
1495                                 sumptr = malloc(sumlen);
1496                                 if (!sumptr) {
1497                                         putstr("Can't get memory for summary "
1498                                                         "node!\n");
1499                                         free(buf);
1500                                         jffs2_free_cache(part);
1501                                         return 0;
1502                                 }
1503                                 memcpy(sumptr + sumlen - buf_len, buf +
1504                                                 buf_size - buf_len, buf_len);
1505                         }
1506                         if (buf_len < sumlen) {
1507                                 /* Need to read more so that the entire summary
1508                                  * node is present
1509                                  */
1510                                 get_fl_mem(part->offset + sector_ofs +
1511                                                 part->sector_size - sumlen,
1512                                                 sumlen - buf_len, sumptr);
1513                         }
1514                 }
1515
1516                 if (sumptr) {
1517                         ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1518                                         sumlen, pL);
1519
1520                         if (buf_size && sumlen > buf_size)
1521                                 free(sumptr);
1522                         if (ret < 0) {
1523                                 free(buf);
1524                                 jffs2_free_cache(part);
1525                                 return 0;
1526                         }
1527                         if (ret)
1528                                 continue;
1529
1530                 }
1531 #endif /* CONFIG_JFFS2_SUMMARY */
1532
1533                 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1534
1535                 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1536
1537                 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1538                 ofs = 0;
1539
1540                 /* Scan only 4KiB of 0xFF before declaring it's empty */
1541                 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1542                                 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1543                         ofs += 4;
1544
1545                 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1546                         continue;
1547
1548                 ofs += sector_ofs;
1549                 prevofs = ofs - 1;
1550
1551         scan_more:
1552                 while (ofs < sector_ofs + part->sector_size) {
1553                         if (ofs == prevofs) {
1554                                 printf("offset %08x already seen, skip\n", ofs);
1555                                 ofs += 4;
1556                                 counter4++;
1557                                 continue;
1558                         }
1559                         prevofs = ofs;
1560                         if (sector_ofs + part->sector_size <
1561                                         ofs + sizeof(*node))
1562                                 break;
1563                         if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1564                                 buf_len = min_t(uint32_t, buf_size, sector_ofs
1565                                                 + part->sector_size - ofs);
1566                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1567                                            buf);
1568                                 buf_ofs = ofs;
1569                         }
1570
1571                         node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1572
1573                         if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1574                                 uint32_t inbuf_ofs;
1575                                 uint32_t empty_start, scan_end;
1576
1577                                 empty_start = ofs;
1578                                 ofs += 4;
1579                                 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1580                                                         part->sector_size)/8,
1581                                                         buf_len);
1582                         more_empty:
1583                                 inbuf_ofs = ofs - buf_ofs;
1584                                 while (inbuf_ofs < scan_end) {
1585                                         if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1586                                                         0xffffffff)
1587                                                 goto scan_more;
1588
1589                                         inbuf_ofs += 4;
1590                                         ofs += 4;
1591                                 }
1592                                 /* Ran off end. */
1593
1594                                 /* See how much more there is to read in this
1595                                  * eraseblock...
1596                                  */
1597                                 buf_len = min_t(uint32_t, buf_size,
1598                                                 sector_ofs +
1599                                                 part->sector_size - ofs);
1600                                 if (!buf_len) {
1601                                         /* No more to read. Break out of main
1602                                          * loop without marking this range of
1603                                          * empty space as dirty (because it's
1604                                          * not)
1605                                          */
1606                                         break;
1607                                 }
1608                                 scan_end = buf_len;
1609                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1610                                            buf);
1611                                 buf_ofs = ofs;
1612                                 goto more_empty;
1613                         }
1614                         if (node->magic != JFFS2_MAGIC_BITMASK ||
1615                                         !hdr_crc(node)) {
1616                                 ofs += 4;
1617                                 counter4++;
1618                                 continue;
1619                         }
1620                         if (ofs + node->totlen >
1621                                         sector_ofs + part->sector_size) {
1622                                 ofs += 4;
1623                                 counter4++;
1624                                 continue;
1625                         }
1626                         /* if its a fragment add it */
1627                         switch (node->nodetype) {
1628                         case JFFS2_NODETYPE_INODE:
1629                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1630                                                         jffs2_raw_inode)) {
1631                                         get_fl_mem((u32)part->offset + ofs,
1632                                                    buf_len, buf);
1633                                         buf_ofs = ofs;
1634                                         node = (void *)buf;
1635                                 }
1636                                 if (!inode_crc((struct jffs2_raw_inode *) node))
1637                                        break;
1638
1639                                 if (insert_node(&pL->frag, (u32) part->offset +
1640                                                 ofs) == NULL) {
1641                                         free(buf);
1642                                         jffs2_free_cache(part);
1643                                         return 0;
1644                                 }
1645                                 if (max_totlen < node->totlen)
1646                                         max_totlen = node->totlen;
1647                                 break;
1648                         case JFFS2_NODETYPE_DIRENT:
1649                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1650                                                         jffs2_raw_dirent) +
1651                                                         ((struct
1652                                                          jffs2_raw_dirent *)
1653                                                         node)->nsize) {
1654                                         get_fl_mem((u32)part->offset + ofs,
1655                                                    buf_len, buf);
1656                                         buf_ofs = ofs;
1657                                         node = (void *)buf;
1658                                 }
1659
1660                                 if (!dirent_crc((struct jffs2_raw_dirent *)
1661                                                         node) ||
1662                                                 !dirent_name_crc(
1663                                                         (struct
1664                                                          jffs2_raw_dirent *)
1665                                                         node))
1666                                         break;
1667                                 if (! (counterN%100))
1668                                         puts ("\b\b.  ");
1669                                 if (insert_node(&pL->dir, (u32) part->offset +
1670                                                 ofs) == NULL) {
1671                                         free(buf);
1672                                         jffs2_free_cache(part);
1673                                         return 0;
1674                                 }
1675                                 if (max_totlen < node->totlen)
1676                                         max_totlen = node->totlen;
1677                                 counterN++;
1678                                 break;
1679                         case JFFS2_NODETYPE_CLEANMARKER:
1680                                 if (node->totlen != sizeof(struct jffs2_unknown_node))
1681                                         printf("OOPS Cleanmarker has bad size "
1682                                                 "%d != %zu\n",
1683                                                 node->totlen,
1684                                                 sizeof(struct jffs2_unknown_node));
1685                                 break;
1686                         case JFFS2_NODETYPE_PADDING:
1687                                 if (node->totlen < sizeof(struct jffs2_unknown_node))
1688                                         printf("OOPS Padding has bad size "
1689                                                 "%d < %zu\n",
1690                                                 node->totlen,
1691                                                 sizeof(struct jffs2_unknown_node));
1692                                 break;
1693                         case JFFS2_NODETYPE_SUMMARY:
1694                                 break;
1695                         default:
1696                                 printf("Unknown node type: %x len %d offset 0x%x\n",
1697                                         node->nodetype,
1698                                         node->totlen, ofs);
1699                         }
1700                         ofs += ((node->totlen + 3) & ~3);
1701                         counterF++;
1702                 }
1703         }
1704
1705         free(buf);
1706         putstr("\b\b done.\r\n");               /* close off the dots */
1707
1708         /* We don't care if malloc failed - then each read operation will
1709          * allocate its own buffer as necessary (NAND) or will read directly
1710          * from flash (NOR).
1711          */
1712         pL->readbuf = malloc(max_totlen);
1713
1714         /* turn the lcd back on. */
1715         /* splash(); */
1716
1717 #if 0
1718         putLabeledWord("dir entries = ", pL->dir.listCount);
1719         putLabeledWord("frag entries = ", pL->frag.listCount);
1720         putLabeledWord("+4 increments = ", counter4);
1721         putLabeledWord("+file_offset increments = ", counterF);
1722
1723 #endif
1724
1725 #ifdef DEBUG_DIRENTS
1726         dump_dirents(pL);
1727 #endif
1728
1729 #ifdef DEBUG_FRAGMENTS
1730         dump_fragments(pL);
1731 #endif
1732
1733         /* give visual feedback that we are done scanning the flash */
1734         led_blink(0x0, 0x0, 0x1, 0x1);  /* off, forever, on 100ms, off 100ms */
1735         return 1;
1736 }
1737
1738
1739 static u32
1740 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1741 {
1742         struct b_node *b;
1743         struct jffs2_raw_inode ojNode;
1744         struct jffs2_raw_inode *jNode;
1745         int i;
1746
1747         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1748                 piL->compr_info[i].num_frags = 0;
1749                 piL->compr_info[i].compr_sum = 0;
1750                 piL->compr_info[i].decompr_sum = 0;
1751         }
1752
1753         b = pL->frag.listHead;
1754         while (b) {
1755                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1756                         sizeof(ojNode), &ojNode);
1757                 if (jNode->compr < JFFS2_NUM_COMPR) {
1758                         piL->compr_info[jNode->compr].num_frags++;
1759                         piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1760                         piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1761                 }
1762                 b = b->next;
1763         }
1764         return 0;
1765 }
1766
1767
1768 static struct b_lists *
1769 jffs2_get_list(struct part_info * part, const char *who)
1770 {
1771         /* copy requested part_info struct pointer to global location */
1772         current_part = part;
1773
1774         if (jffs2_1pass_rescan_needed(part)) {
1775                 if (!jffs2_1pass_build_lists(part)) {
1776                         printf("%s: Failed to scan JFFSv2 file structure\n", who);
1777                         return NULL;
1778                 }
1779         }
1780         return (struct b_lists *)part->jffs2_priv;
1781 }
1782
1783
1784 /* Print directory / file contents */
1785 u32
1786 jffs2_1pass_ls(struct part_info * part, const char *fname)
1787 {
1788         struct b_lists *pl;
1789         long ret = 1;
1790         u32 inode;
1791
1792         if (! (pl = jffs2_get_list(part, "ls")))
1793                 return 0;
1794
1795         if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1796                 putstr("ls: Failed to scan jffs2 file structure\r\n");
1797                 return 0;
1798         }
1799
1800
1801 #if 0
1802         putLabeledWord("found file at inode = ", inode);
1803         putLabeledWord("read_inode returns = ", ret);
1804 #endif
1805
1806         return ret;
1807 }
1808
1809
1810 /* Load a file from flash into memory. fname can be a full path */
1811 u32
1812 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1813 {
1814
1815         struct b_lists *pl;
1816         long ret = 1;
1817         u32 inode;
1818
1819         if (! (pl  = jffs2_get_list(part, "load")))
1820                 return 0;
1821
1822         if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1823                 putstr("load: Failed to find inode\r\n");
1824                 return 0;
1825         }
1826
1827         /* Resolve symlinks */
1828         if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1829                 putstr("load: Failed to resolve inode structure\r\n");
1830                 return 0;
1831         }
1832
1833         if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1834                 putstr("load: Failed to read inode\r\n");
1835                 return 0;
1836         }
1837
1838         DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1839                                 (unsigned long) dest, ret);
1840         return ret;
1841 }
1842
1843 /* Return information about the fs on this partition */
1844 u32
1845 jffs2_1pass_info(struct part_info * part)
1846 {
1847         struct b_jffs2_info info;
1848         struct b_lists *pl;
1849         int i;
1850
1851         if (! (pl  = jffs2_get_list(part, "info")))
1852                 return 0;
1853
1854         jffs2_1pass_fill_info(pl, &info);
1855         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1856                 printf ("Compression: %s\n"
1857                         "\tfrag count: %d\n"
1858                         "\tcompressed sum: %d\n"
1859                         "\tuncompressed sum: %d\n",
1860                         compr_names[i],
1861                         info.compr_info[i].num_frags,
1862                         info.compr_info[i].compr_sum,
1863                         info.compr_info[i].decompr_sum);
1864         }
1865         return 1;
1866 }