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                     (!strncmp((char *)jDir->name, name, len))) {        /* a match */
 849                         if (jDir->version < version) {
 850                                 put_fl_mem(jDir, pL->readbuf);
 851                                 continue;
 852                         }
 853
 854                         if (jDir->version == version && inode != 0) {
 855                                 /* I'm pretty sure this isn't legal */
 856                                 putstr(" ** ERROR ** ");
 857                                 putnstr(jDir->name, jDir->nsize);
 858                                 putLabeledWord(" has dup version =", version);
 859                         }
 860                         inode = jDir->ino;
 861                         version = jDir->version;
 862                 }
 863 #if 0
 864                 putstr("\r\nfind_inode:p&l ->");
 865                 putnstr(jDir->name, jDir->nsize);
 866                 putstr("\r\n");
 867                 putLabeledWord("pino = ", jDir->pino);
 868                 putLabeledWord("nsize = ", jDir->nsize);
 869                 putLabeledWord("b = ", (u32) b);
 870                 putLabeledWord("counter = ", counter);
 871 #endif
 872                 put_fl_mem(jDir, pL->readbuf);
 873         }
 874         return inode;
 875 }
 876
 877 char *mkmodestr(unsigned long mode, char *str)
 878 {
 879         static const char *l = "xwr";
 880         int mask = 1, i;
 881         char c;
 882
 883         switch (mode & S_IFMT) {
 884                 case S_IFDIR:    str[0] = 'd'; break;
 885                 case S_IFBLK:    str[0] = 'b'; break;
 886                 case S_IFCHR:    str[0] = 'c'; break;
 887                 case S_IFIFO:    str[0] = 'f'; break;
 888                 case S_IFLNK:    str[0] = 'l'; break;
 889                 case S_IFSOCK:   str[0] = 's'; break;
 890                 case S_IFREG:    str[0] = '-'; break;
 891                 default:         str[0] = '?';
 892         }
 893
 894         for(i = 0; i < 9; i++) {
 895                 c = l[i%3];
 896                 str[9-i] = (mode & mask)?c:'-';
 897                 mask = mask<<1;
 898         }
 899
 900         if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
 901         if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
 902         if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
 903         str[10] = '\0';
 904         return str;
 905 }
 906
 907 static inline void dump_stat(struct stat *st, const char *name)
 908 {
 909         char str[20];
 910         char s[64], *p;
 911
 912         if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
 913                 st->st_mtime = 1;
 914
 915         ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
 916
 917         if ((p = strchr(s,'\n')) != NULL) *p = '\0';
 918         if ((p = strchr(s,'\r')) != NULL) *p = '\0';
 919
 920 /*
 921         printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
 922                 st->st_size, s, name);
 923 */
 924
 925         printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
 926 }
 927
 928 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
 929 {
 930         char fname[256];
 931         struct stat st;
 932
 933         if(!d || !i) return -1;
 934
 935         strncpy(fname, (char *)d->name, d->nsize);
 936         fname[d->nsize] = '\0';
 937
 938         memset(&st,0,sizeof(st));
 939
 940         st.st_mtime = i->mtime;
 941         st.st_mode = i->mode;
 942         st.st_ino = i->ino;
 943         st.st_size = i->isize;
 944
 945         dump_stat(&st, fname);
 946
 947         if (d->type == DT_LNK) {
 948                 unsigned char *src = (unsigned char *) (&i[1]);
 949                 putstr(" -> ");
 950                 putnstr(src, (int)i->dsize);
 951         }
 952
 953         putstr("\r\n");
 954
 955         return 0;
 956 }
 957
 958 /* list inodes with the given pino */
 959 static u32
 960 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
 961 {
 962         struct b_node *b;
 963         struct jffs2_raw_dirent *jDir;
 964
 965         for (b = pL->dir.listHead; b; b = b->next) {
 966                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
 967                                                                 pL->readbuf);
 968                 if (pino == jDir->pino) {
 969                         u32 i_version = 0;
 970                         struct jffs2_raw_inode ojNode;
 971                         struct jffs2_raw_inode *jNode, *i = NULL;
 972                         struct b_node *b2;
 973
 974 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 975                         /* Check for more recent versions of this file */
 976                         int match;
 977                         do {
 978                                 struct b_node *next = b->next;
 979                                 struct jffs2_raw_dirent *jDirNext;
 980                                 if (!next)
 981                                         break;
 982                                 jDirNext = (struct jffs2_raw_dirent *)
 983                                         get_node_mem(next->offset, NULL);
 984                                 match = jDirNext->pino == jDir->pino &&
 985                                         jDirNext->nsize == jDir->nsize &&
 986                                         strncmp((char *)jDirNext->name,
 987                                                 (char *)jDir->name,
 988                                                 jDir->nsize) == 0;
 989                                 if (match) {
 990                                         /* Use next. It is more recent */
 991                                         b = next;
 992                                         /* Update buffer with the new info */
 993                                         *jDir = *jDirNext;
 994                                 }
 995                                 put_fl_mem(jDirNext, NULL);
 996                         } while (match);
 997 #endif
 998                         if (jDir->ino == 0) {
 999                                 /* Deleted file */
1000                                 put_fl_mem(jDir, pL->readbuf);
1001                                 continue;
1002                         }
1003
1004                         for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
1005                                 jNode = (struct jffs2_raw_inode *)
1006                                         get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
1007                                 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
1008                                         i_version = jNode->version;
1009                                         if (i)
1010                                                 put_fl_mem(i, NULL);
1011
1012                                         if (jDir->type == DT_LNK)
1013                                                 i = get_node_mem(b2->offset,
1014                                                                  NULL);
1015                                         else
1016                                                 i = get_fl_mem(b2->offset,
1017                                                                sizeof(*i),
1018                                                                NULL);
1019                                 }
1020                         }
1021
1022                         dump_inode(pL, jDir, i);
1023                         put_fl_mem(i, NULL);
1024                 }
1025                 put_fl_mem(jDir, pL->readbuf);
1026         }
1027         return pino;
1028 }
1029
1030 static u32
1031 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1032 {
1033         int i;
1034         char tmp[256];
1035         char working_tmp[256];
1036         char *c;
1037
1038         /* discard any leading slash */
1039         i = 0;
1040         while (fname[i] == '/')
1041                 i++;
1042         strcpy(tmp, &fname[i]);
1043
1044         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1045         {
1046                 strncpy(working_tmp, tmp, c - tmp);
1047                 working_tmp[c - tmp] = '\0';
1048 #if 0
1049                 putstr("search_inode: tmp = ");
1050                 putstr(tmp);
1051                 putstr("\r\n");
1052                 putstr("search_inode: wtmp = ");
1053                 putstr(working_tmp);
1054                 putstr("\r\n");
1055                 putstr("search_inode: c = ");
1056                 putstr(c);
1057                 putstr("\r\n");
1058 #endif
1059                 for (i = 0; i < strlen(c) - 1; i++)
1060                         tmp[i] = c[i + 1];
1061                 tmp[i] = '\0';
1062 #if 0
1063                 putstr("search_inode: post tmp = ");
1064                 putstr(tmp);
1065                 putstr("\r\n");
1066 #endif
1067
1068                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1069                         putstr("find_inode failed for name=");
1070                         putstr(working_tmp);
1071                         putstr("\r\n");
1072                         return 0;
1073                 }
1074         }
1075         /* this is for the bare filename, directories have already been mapped */
1076         if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1077                 putstr("find_inode failed for name=");
1078                 putstr(tmp);
1079                 putstr("\r\n");
1080                 return 0;
1081         }
1082         return pino;
1083
1084 }
1085
1086 static u32
1087 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1088 {
1089         struct b_node *b;
1090         struct b_node *b2;
1091         struct jffs2_raw_dirent *jDir;
1092         struct jffs2_raw_inode *jNode;
1093         u8 jDirFoundType = 0;
1094         u32 jDirFoundIno = 0;
1095         u32 jDirFoundPino = 0;
1096         char tmp[256];
1097         u32 version = 0;
1098         u32 pino;
1099         unsigned char *src;
1100
1101         /* we need to search all and return the inode with the highest version */
1102         for(b = pL->dir.listHead; b; b = b->next) {
1103                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1104                                                                 pL->readbuf);
1105                 if (ino == jDir->ino) {
1106                         if (jDir->version < version) {
1107                                 put_fl_mem(jDir, pL->readbuf);
1108                                 continue;
1109                         }
1110
1111                         if (jDir->version == version && jDirFoundType) {
1112                                 /* I'm pretty sure this isn't legal */
1113                                 putstr(" ** ERROR ** ");
1114                                 putnstr(jDir->name, jDir->nsize);
1115                                 putLabeledWord(" has dup version (resolve) = ",
1116                                         version);
1117                         }
1118
1119                         jDirFoundType = jDir->type;
1120                         jDirFoundIno = jDir->ino;
1121                         jDirFoundPino = jDir->pino;
1122                         version = jDir->version;
1123                 }
1124                 put_fl_mem(jDir, pL->readbuf);
1125         }
1126         /* now we found the right entry again. (shoulda returned inode*) */
1127         if (jDirFoundType != DT_LNK)
1128                 return jDirFoundIno;
1129
1130         /* it's a soft link so we follow it again. */
1131         b2 = pL->frag.listHead;
1132         while (b2) {
1133                 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1134                                                                 pL->readbuf);
1135                 if (jNode->ino == jDirFoundIno) {
1136                         src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1137
1138 #if 0
1139                         putLabeledWord("\t\t dsize = ", jNode->dsize);
1140                         putstr("\t\t target = ");
1141                         putnstr(src, jNode->dsize);
1142                         putstr("\r\n");
1143 #endif
1144                         strncpy(tmp, (char *)src, jNode->dsize);
1145                         tmp[jNode->dsize] = '\0';
1146                         put_fl_mem(jNode, pL->readbuf);
1147                         break;
1148                 }
1149                 b2 = b2->next;
1150                 put_fl_mem(jNode, pL->readbuf);
1151         }
1152         /* ok so the name of the new file to find is in tmp */
1153         /* if it starts with a slash it is root based else shared dirs */
1154         if (tmp[0] == '/')
1155                 pino = 1;
1156         else
1157                 pino = jDirFoundPino;
1158
1159         return jffs2_1pass_search_inode(pL, tmp, pino);
1160 }
1161
1162 static u32
1163 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1164 {
1165         int i;
1166         char tmp[256];
1167         char working_tmp[256];
1168         char *c;
1169
1170         /* discard any leading slash */
1171         i = 0;
1172         while (fname[i] == '/')
1173                 i++;
1174         strcpy(tmp, &fname[i]);
1175         working_tmp[0] = '\0';
1176         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1177         {
1178                 strncpy(working_tmp, tmp, c - tmp);
1179                 working_tmp[c - tmp] = '\0';
1180                 for (i = 0; i < strlen(c) - 1; i++)
1181                         tmp[i] = c[i + 1];
1182                 tmp[i] = '\0';
1183                 /* only a failure if we arent looking at top level */
1184                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1185                     (working_tmp[0])) {
1186                         putstr("find_inode failed for name=");
1187                         putstr(working_tmp);
1188                         putstr("\r\n");
1189                         return 0;
1190                 }
1191         }
1192
1193         if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1194                 putstr("find_inode failed for name=");
1195                 putstr(tmp);
1196                 putstr("\r\n");
1197                 return 0;
1198         }
1199         /* this is for the bare filename, directories have already been mapped */
1200         if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1201                 putstr("find_inode failed for name=");
1202                 putstr(tmp);
1203                 putstr("\r\n");
1204                 return 0;
1205         }
1206         return pino;
1207
1208 }
1209
1210 unsigned char
1211 jffs2_1pass_rescan_needed(struct part_info *part)
1212 {
1213         struct b_node *b;
1214         struct jffs2_unknown_node onode;
1215         struct jffs2_unknown_node *node;
1216         struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1217
1218         if (part->jffs2_priv == 0){
1219                 DEBUGF ("rescan: First time in use\n");
1220                 return 1;
1221         }
1222
1223         /* if we have no list, we need to rescan */
1224         if (pL->frag.listCount == 0) {
1225                 DEBUGF ("rescan: fraglist zero\n");
1226                 return 1;
1227         }
1228
1229         /* but suppose someone reflashed a partition at the same offset... */
1230         b = pL->dir.listHead;
1231         while (b) {
1232                 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1233                         sizeof(onode), &onode);
1234                 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1235                         DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1236                                         (unsigned long) b->offset);
1237                         return 1;
1238                 }
1239                 b = b->next;
1240         }
1241         return 0;
1242 }
1243
1244 #ifdef CONFIG_JFFS2_SUMMARY
1245 static u32 sum_get_unaligned32(u32 *ptr)
1246 {
1247         u32 val;
1248         u8 *p = (u8 *)ptr;
1249
1250         val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1251
1252         return __le32_to_cpu(val);
1253 }
1254
1255 static u16 sum_get_unaligned16(u16 *ptr)
1256 {
1257         u16 val;
1258         u8 *p = (u8 *)ptr;
1259
1260         val = *p | (*(p + 1) << 8);
1261
1262         return __le16_to_cpu(val);
1263 }
1264
1265 #define dbg_summary(...) do {} while (0);
1266 /*
1267  * Process the stored summary information - helper function for
1268  * jffs2_sum_scan_sumnode()
1269  */
1270
1271 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1272                                 struct jffs2_raw_summary *summary,
1273                                 struct b_lists *pL)
1274 {
1275         void *sp;
1276         int i, pass;
1277         void *ret;
1278
1279         for (pass = 0; pass < 2; pass++) {
1280                 sp = summary->sum;
1281
1282                 for (i = 0; i < summary->sum_num; i++) {
1283                         struct jffs2_sum_unknown_flash *spu = sp;
1284                         dbg_summary("processing summary index %d\n", i);
1285
1286                         switch (sum_get_unaligned16(&spu->nodetype)) {
1287                                 case JFFS2_NODETYPE_INODE: {
1288                                 struct jffs2_sum_inode_flash *spi;
1289                                         if (pass) {
1290                                                 spi = sp;
1291
1292                                                 ret = insert_node(&pL->frag,
1293                                                         (u32)part->offset +
1294                                                         offset +
1295                                                         sum_get_unaligned32(
1296                                                                 &spi->offset));
1297                                                 if (ret == NULL)
1298                                                         return -1;
1299                                         }
1300
1301                                         sp += JFFS2_SUMMARY_INODE_SIZE;
1302
1303                                         break;
1304                                 }
1305                                 case JFFS2_NODETYPE_DIRENT: {
1306                                         struct jffs2_sum_dirent_flash *spd;
1307                                         spd = sp;
1308                                         if (pass) {
1309                                                 ret = insert_node(&pL->dir,
1310                                                         (u32) part->offset +
1311                                                         offset +
1312                                                         sum_get_unaligned32(
1313                                                                 &spd->offset));
1314                                                 if (ret == NULL)
1315                                                         return -1;
1316                                         }
1317
1318                                         sp += JFFS2_SUMMARY_DIRENT_SIZE(
1319                                                         spd->nsize);
1320
1321                                         break;
1322                                 }
1323                                 default : {
1324                                         uint16_t nodetype = sum_get_unaligned16(
1325                                                                 &spu->nodetype);
1326                                         printf("Unsupported node type %x found"
1327                                                         " in summary!\n",
1328                                                         nodetype);
1329                                         if ((nodetype & JFFS2_COMPAT_MASK) ==
1330                                                         JFFS2_FEATURE_INCOMPAT)
1331                                                 return -EIO;
1332                                         return -EBADMSG;
1333                                 }
1334                         }
1335                 }
1336         }
1337         return 0;
1338 }
1339
1340 /* Process the summary node - called from jffs2_scan_eraseblock() */
1341 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1342                            struct jffs2_raw_summary *summary, uint32_t sumsize,
1343                            struct b_lists *pL)
1344 {
1345         struct jffs2_unknown_node crcnode;
1346         int ret, ofs;
1347         uint32_t crc;
1348
1349         ofs = part->sector_size - sumsize;
1350
1351         dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1352                     offset, offset + ofs, sumsize);
1353
1354         /* OK, now check for node validity and CRC */
1355         crcnode.magic = JFFS2_MAGIC_BITMASK;
1356         crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1357         crcnode.totlen = summary->totlen;
1358         crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1359
1360         if (summary->hdr_crc != crc) {
1361                 dbg_summary("Summary node header is corrupt (bad CRC or "
1362                                 "no summary at all)\n");
1363                 goto crc_err;
1364         }
1365
1366         if (summary->totlen != sumsize) {
1367                 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1368                 goto crc_err;
1369         }
1370
1371         crc = crc32_no_comp(0, (uchar *)summary,
1372                         sizeof(struct jffs2_raw_summary)-8);
1373
1374         if (summary->node_crc != crc) {
1375                 dbg_summary("Summary node is corrupt (bad CRC)\n");
1376                 goto crc_err;
1377         }
1378
1379         crc = crc32_no_comp(0, (uchar *)summary->sum,
1380                         sumsize - sizeof(struct jffs2_raw_summary));
1381
1382         if (summary->sum_crc != crc) {
1383                 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1384                 goto crc_err;
1385         }
1386
1387         if (summary->cln_mkr)
1388                 dbg_summary("Summary : CLEANMARKER node \n");
1389
1390         ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1391         if (ret == -EBADMSG)
1392                 return 0;
1393         if (ret)
1394                 return ret;             /* real error */
1395
1396         return 1;
1397
1398 crc_err:
1399         putstr("Summary node crc error, skipping summary information.\n");
1400
1401         return 0;
1402 }
1403 #endif /* CONFIG_JFFS2_SUMMARY */
1404
1405 #ifdef DEBUG_FRAGMENTS
1406 static void
1407 dump_fragments(struct b_lists *pL)
1408 {
1409         struct b_node *b;
1410         struct jffs2_raw_inode ojNode;
1411         struct jffs2_raw_inode *jNode;
1412
1413         putstr("\r\n\r\n******The fragment Entries******\r\n");
1414         b = pL->frag.listHead;
1415         while (b) {
1416                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1417                         sizeof(ojNode), &ojNode);
1418                 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1419                 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1420                 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1421                 putLabeledWord("\tbuild_list: version = ", jNode->version);
1422                 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1423                 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1424                 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1425                 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1426                 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1427                 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1428                 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1429                 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1430                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1431                 b = b->next;
1432         }
1433 }
1434 #endif
1435
1436 #ifdef DEBUG_DIRENTS
1437 static void
1438 dump_dirents(struct b_lists *pL)
1439 {
1440         struct b_node *b;
1441         struct jffs2_raw_dirent *jDir;
1442
1443         putstr("\r\n\r\n******The directory Entries******\r\n");
1444         b = pL->dir.listHead;
1445         while (b) {
1446                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1447                                                                 pL->readbuf);
1448                 putstr("\r\n");
1449                 putnstr(jDir->name, jDir->nsize);
1450                 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1451                 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1452                 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1453                 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1454                 putLabeledWord("\tbuild_list: version = ", jDir->version);
1455                 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1456                 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1457                 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1458                 putLabeledWord("\tbuild_list: type = ", jDir->type);
1459                 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1460                 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1461                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1462                 b = b->next;
1463                 put_fl_mem(jDir, pL->readbuf);
1464         }
1465 }
1466 #endif
1467
1468 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1469
1470 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1471 {
1472         if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1473                 return sector_size;
1474         else
1475                 return DEFAULT_EMPTY_SCAN_SIZE;
1476 }
1477
1478 static u32
1479 jffs2_1pass_build_lists(struct part_info * part)
1480 {
1481         struct b_lists *pL;
1482         struct jffs2_unknown_node *node;
1483         u32 nr_sectors;
1484         u32 i;
1485         u32 counter4 = 0;
1486         u32 counterF = 0;
1487         u32 counterN = 0;
1488         u32 max_totlen = 0;
1489         u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1490         char *buf;
1491
1492         nr_sectors = lldiv(part->size, part->sector_size);
1493         /* turn off the lcd.  Refreshing the lcd adds 50% overhead to the */
1494         /* jffs2 list building enterprise nope.  in newer versions the overhead is */
1495         /* only about 5 %.  not enough to inconvenience people for. */
1496         /* lcd_off(); */
1497
1498         /* if we are building a list we need to refresh the cache. */
1499         jffs_init_1pass_list(part);
1500         pL = (struct b_lists *)part->jffs2_priv;
1501         buf = malloc(buf_size);
1502         puts ("Scanning JFFS2 FS:   ");
1503
1504         /* start at the beginning of the partition */
1505         for (i = 0; i < nr_sectors; i++) {
1506                 uint32_t sector_ofs = i * part->sector_size;
1507                 uint32_t buf_ofs = sector_ofs;
1508                 uint32_t buf_len;
1509                 uint32_t ofs, prevofs;
1510 #ifdef CONFIG_JFFS2_SUMMARY
1511                 struct jffs2_sum_marker *sm;
1512                 void *sumptr = NULL;
1513                 uint32_t sumlen;
1514                 int ret;
1515 #endif
1516
1517                 WATCHDOG_RESET();
1518
1519 #ifdef CONFIG_JFFS2_SUMMARY
1520                 buf_len = sizeof(*sm);
1521
1522                 /* Read as much as we want into the _end_ of the preallocated
1523                  * buffer
1524                  */
1525                 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1526                                 buf_len, buf_len, buf + buf_size - buf_len);
1527
1528                 sm = (void *)buf + buf_size - sizeof(*sm);
1529                 if (sm->magic == JFFS2_SUM_MAGIC) {
1530                         sumlen = part->sector_size - sm->offset;
1531                         sumptr = buf + buf_size - sumlen;
1532
1533                         /* Now, make sure the summary itself is available */
1534                         if (sumlen > buf_size) {
1535                                 /* Need to kmalloc for this. */
1536                                 sumptr = malloc(sumlen);
1537                                 if (!sumptr) {
1538                                         putstr("Can't get memory for summary "
1539                                                         "node!\n");
1540                                         free(buf);
1541                                         jffs2_free_cache(part);
1542                                         return 0;
1543                                 }
1544                                 memcpy(sumptr + sumlen - buf_len, buf +
1545                                                 buf_size - buf_len, buf_len);
1546                         }
1547                         if (buf_len < sumlen) {
1548                                 /* Need to read more so that the entire summary
1549                                  * node is present
1550                                  */
1551                                 get_fl_mem(part->offset + sector_ofs +
1552                                                 part->sector_size - sumlen,
1553                                                 sumlen - buf_len, sumptr);
1554                         }
1555                 }
1556
1557                 if (sumptr) {
1558                         ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1559                                         sumlen, pL);
1560
1561                         if (buf_size && sumlen > buf_size)
1562                                 free(sumptr);
1563                         if (ret < 0) {
1564                                 free(buf);
1565                                 jffs2_free_cache(part);
1566                                 return 0;
1567                         }
1568                         if (ret)
1569                                 continue;
1570
1571                 }
1572 #endif /* CONFIG_JFFS2_SUMMARY */
1573
1574                 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1575
1576                 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1577
1578                 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1579                 ofs = 0;
1580
1581                 /* Scan only 4KiB of 0xFF before declaring it's empty */
1582                 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1583                                 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1584                         ofs += 4;
1585
1586                 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1587                         continue;
1588
1589                 ofs += sector_ofs;
1590                 prevofs = ofs - 1;
1591
1592         scan_more:
1593                 while (ofs < sector_ofs + part->sector_size) {
1594                         if (ofs == prevofs) {
1595                                 printf("offset %08x already seen, skip\n", ofs);
1596                                 ofs += 4;
1597                                 counter4++;
1598                                 continue;
1599                         }
1600                         prevofs = ofs;
1601                         if (sector_ofs + part->sector_size <
1602                                         ofs + sizeof(*node))
1603                                 break;
1604                         if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1605                                 buf_len = min_t(uint32_t, buf_size, sector_ofs
1606                                                 + part->sector_size - ofs);
1607                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1608                                            buf);
1609                                 buf_ofs = ofs;
1610                         }
1611
1612                         node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1613
1614                         if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1615                                 uint32_t inbuf_ofs;
1616                                 uint32_t scan_end;
1617
1618                                 ofs += 4;
1619                                 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1620                                                         part->sector_size)/8,
1621                                                         buf_len);
1622                         more_empty:
1623                                 inbuf_ofs = ofs - buf_ofs;
1624                                 while (inbuf_ofs < scan_end) {
1625                                         if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1626                                                         0xffffffff)
1627                                                 goto scan_more;
1628
1629                                         inbuf_ofs += 4;
1630                                         ofs += 4;
1631                                 }
1632                                 /* Ran off end. */
1633
1634                                 /* See how much more there is to read in this
1635                                  * eraseblock...
1636                                  */
1637                                 buf_len = min_t(uint32_t, buf_size,
1638                                                 sector_ofs +
1639                                                 part->sector_size - ofs);
1640                                 if (!buf_len) {
1641                                         /* No more to read. Break out of main
1642                                          * loop without marking this range of
1643                                          * empty space as dirty (because it's
1644                                          * not)
1645                                          */
1646                                         break;
1647                                 }
1648                                 scan_end = buf_len;
1649                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1650                                            buf);
1651                                 buf_ofs = ofs;
1652                                 goto more_empty;
1653                         }
1654                         if (node->magic != JFFS2_MAGIC_BITMASK ||
1655                                         !hdr_crc(node)) {
1656                                 ofs += 4;
1657                                 counter4++;
1658                                 continue;
1659                         }
1660                         if (ofs + node->totlen >
1661                                         sector_ofs + part->sector_size) {
1662                                 ofs += 4;
1663                                 counter4++;
1664                                 continue;
1665                         }
1666                         /* if its a fragment add it */
1667                         switch (node->nodetype) {
1668                         case JFFS2_NODETYPE_INODE:
1669                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1670                                                         jffs2_raw_inode)) {
1671                                         get_fl_mem((u32)part->offset + ofs,
1672                                                    buf_len, buf);
1673                                         buf_ofs = ofs;
1674                                         node = (void *)buf;
1675                                 }
1676                                 if (!inode_crc((struct jffs2_raw_inode *) node))
1677                                        break;
1678
1679                                 if (insert_node(&pL->frag, (u32) part->offset +
1680                                                 ofs) == NULL) {
1681                                         free(buf);
1682                                         jffs2_free_cache(part);
1683                                         return 0;
1684                                 }
1685                                 if (max_totlen < node->totlen)
1686                                         max_totlen = node->totlen;
1687                                 break;
1688                         case JFFS2_NODETYPE_DIRENT:
1689                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1690                                                         jffs2_raw_dirent) +
1691                                                         ((struct
1692                                                          jffs2_raw_dirent *)
1693                                                         node)->nsize) {
1694                                         get_fl_mem((u32)part->offset + ofs,
1695                                                    buf_len, buf);
1696                                         buf_ofs = ofs;
1697                                         node = (void *)buf;
1698                                 }
1699
1700                                 if (!dirent_crc((struct jffs2_raw_dirent *)
1701                                                         node) ||
1702                                                 !dirent_name_crc(
1703                                                         (struct
1704                                                          jffs2_raw_dirent *)
1705                                                         node))
1706                                         break;
1707                                 if (! (counterN%100))
1708                                         puts ("\b\b.  ");
1709                                 if (insert_node(&pL->dir, (u32) part->offset +
1710                                                 ofs) == NULL) {
1711                                         free(buf);
1712                                         jffs2_free_cache(part);
1713                                         return 0;
1714                                 }
1715                                 if (max_totlen < node->totlen)
1716                                         max_totlen = node->totlen;
1717                                 counterN++;
1718                                 break;
1719                         case JFFS2_NODETYPE_CLEANMARKER:
1720                                 if (node->totlen != sizeof(struct jffs2_unknown_node))
1721                                         printf("OOPS Cleanmarker has bad size "
1722                                                 "%d != %zu\n",
1723                                                 node->totlen,
1724                                                 sizeof(struct jffs2_unknown_node));
1725                                 break;
1726                         case JFFS2_NODETYPE_PADDING:
1727                                 if (node->totlen < sizeof(struct jffs2_unknown_node))
1728                                         printf("OOPS Padding has bad size "
1729                                                 "%d < %zu\n",
1730                                                 node->totlen,
1731                                                 sizeof(struct jffs2_unknown_node));
1732                                 break;
1733                         case JFFS2_NODETYPE_SUMMARY:
1734                                 break;
1735                         default:
1736                                 printf("Unknown node type: %x len %d offset 0x%x\n",
1737                                         node->nodetype,
1738                                         node->totlen, ofs);
1739                         }
1740                         ofs += ((node->totlen + 3) & ~3);
1741                         counterF++;
1742                 }
1743         }
1744
1745         free(buf);
1746         putstr("\b\b done.\r\n");               /* close off the dots */
1747
1748         /* We don't care if malloc failed - then each read operation will
1749          * allocate its own buffer as necessary (NAND) or will read directly
1750          * from flash (NOR).
1751          */
1752         pL->readbuf = malloc(max_totlen);
1753
1754         /* turn the lcd back on. */
1755         /* splash(); */
1756
1757 #if 0
1758         putLabeledWord("dir entries = ", pL->dir.listCount);
1759         putLabeledWord("frag entries = ", pL->frag.listCount);
1760         putLabeledWord("+4 increments = ", counter4);
1761         putLabeledWord("+file_offset increments = ", counterF);
1762
1763 #endif
1764
1765 #ifdef DEBUG_DIRENTS
1766         dump_dirents(pL);
1767 #endif
1768
1769 #ifdef DEBUG_FRAGMENTS
1770         dump_fragments(pL);
1771 #endif
1772
1773         /* give visual feedback that we are done scanning the flash */
1774         led_blink(0x0, 0x0, 0x1, 0x1);  /* off, forever, on 100ms, off 100ms */
1775         return 1;
1776 }
1777
1778
1779 static u32
1780 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1781 {
1782         struct b_node *b;
1783         struct jffs2_raw_inode ojNode;
1784         struct jffs2_raw_inode *jNode;
1785         int i;
1786
1787         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1788                 piL->compr_info[i].num_frags = 0;
1789                 piL->compr_info[i].compr_sum = 0;
1790                 piL->compr_info[i].decompr_sum = 0;
1791         }
1792
1793         b = pL->frag.listHead;
1794         while (b) {
1795                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1796                         sizeof(ojNode), &ojNode);
1797                 if (jNode->compr < JFFS2_NUM_COMPR) {
1798                         piL->compr_info[jNode->compr].num_frags++;
1799                         piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1800                         piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1801                 }
1802                 b = b->next;
1803         }
1804         return 0;
1805 }
1806
1807
1808 static struct b_lists *
1809 jffs2_get_list(struct part_info * part, const char *who)
1810 {
1811         /* copy requested part_info struct pointer to global location */
1812         current_part = part;
1813
1814         if (jffs2_1pass_rescan_needed(part)) {
1815                 if (!jffs2_1pass_build_lists(part)) {
1816                         printf("%s: Failed to scan JFFSv2 file structure\n", who);
1817                         return NULL;
1818                 }
1819         }
1820         return (struct b_lists *)part->jffs2_priv;
1821 }
1822
1823
1824 /* Print directory / file contents */
1825 u32
1826 jffs2_1pass_ls(struct part_info * part, const char *fname)
1827 {
1828         struct b_lists *pl;
1829         long ret = 1;
1830         u32 inode;
1831
1832         if (! (pl = jffs2_get_list(part, "ls")))
1833                 return 0;
1834
1835         if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1836                 putstr("ls: Failed to scan jffs2 file structure\r\n");
1837                 return 0;
1838         }
1839
1840
1841 #if 0
1842         putLabeledWord("found file at inode = ", inode);
1843         putLabeledWord("read_inode returns = ", ret);
1844 #endif
1845
1846         return ret;
1847 }
1848
1849
1850 /* Load a file from flash into memory. fname can be a full path */
1851 u32
1852 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1853 {
1854
1855         struct b_lists *pl;
1856         long ret = 1;
1857         u32 inode;
1858
1859         if (! (pl  = jffs2_get_list(part, "load")))
1860                 return 0;
1861
1862         if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1863                 putstr("load: Failed to find inode\r\n");
1864                 return 0;
1865         }
1866
1867         /* Resolve symlinks */
1868         if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1869                 putstr("load: Failed to resolve inode structure\r\n");
1870                 return 0;
1871         }
1872
1873         if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1874                 putstr("load: Failed to read inode\r\n");
1875                 return 0;
1876         }
1877
1878         DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1879                                 (unsigned long) dest, ret);
1880         return ret;
1881 }
1882
1883 /* Return information about the fs on this partition */
1884 u32
1885 jffs2_1pass_info(struct part_info * part)
1886 {
1887         struct b_jffs2_info info;
1888         struct b_lists *pl;
1889         int i;
1890
1891         if (! (pl  = jffs2_get_list(part, "info")))
1892                 return 0;
1893
1894         jffs2_1pass_fill_info(pl, &info);
1895         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1896                 printf ("Compression: %s\n"
1897                         "\tfrag count: %d\n"
1898                         "\tcompressed sum: %d\n"
1899                         "\tuncompressed sum: %d\n",
1900                         compr_names[i],
1901                         info.compr_info[i].num_frags,
1902                         info.compr_info[i].compr_sum,
1903                         info.compr_info[i].decompr_sum);
1904         }
1905         return 1;
1906 }