fs/jffs2/jffs2_1pass.c

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