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