fs/jffs2/jffs2_1pass.c

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