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