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