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