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