fs/jffs2/jffs2_1pass.c

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