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 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 549         struct b_node *b, *prev;
 550 #endif
 551
 552         if (!(new = add_node(list))) {
 553                 putstr("add_node failed!\r\n");
 554                 return NULL;
 555         }
 556         new->offset = offset;
 557
 558 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 559         if (list->listTail != NULL && list->listCompare(new, list->listTail))
 560                 prev = list->listTail;
 561         else if (list->listLast != NULL && list->listCompare(new, list->listLast))
 562                 prev = list->listLast;
 563         else
 564                 prev = NULL;
 565
 566         for (b = (prev ? prev->next : list->listHead);
 567              b != NULL && list->listCompare(new, b);
 568              prev = b, b = b->next) {
 569                 list->listLoops++;
 570         }
 571         if (b != NULL)
 572                 list->listLast = prev;
 573
 574         if (b != NULL) {
 575                 new->next = b;
 576                 if (prev != NULL)
 577                         prev->next = new;
 578                 else
 579                         list->listHead = new;
 580         } else
 581 #endif
 582         {
 583                 new->next = (struct b_node *) NULL;
 584                 if (list->listTail != NULL) {
 585                         list->listTail->next = new;
 586                         list->listTail = new;
 587                 } else {
 588                         list->listTail = list->listHead = new;
 589                 }
 590         }
 591
 592         return new;
 593 }
 594
 595 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 596 /* Sort data entries with the latest version last, so that if there
 597  * is overlapping data the latest version will be used.
 598  */
 599 static int compare_inodes(struct b_node *new, struct b_node *old)
 600 {
 601         /*
 602          * Only read in the version info from flash, not the entire inode.
 603          * This can make a big difference to speed if flash is slow.
 604          */
 605         u32 new_version;
 606         u32 old_version;
 607         get_fl_mem(new->offset + offsetof(struct jffs2_raw_inode, version),
 608                    sizeof(new_version), &new_version);
 609         get_fl_mem(old->offset + offsetof(struct jffs2_raw_inode, version),
 610                    sizeof(old_version), &old_version);
 611
 612         return new_version > old_version;
 613 }
 614
 615 /* Sort directory entries so all entries in the same directory
 616  * with the same name are grouped together, with the latest version
 617  * last. This makes it easy to eliminate all but the latest version
 618  * by marking the previous version dead by setting the inode to 0.
 619  */
 620 static int compare_dirents(struct b_node *new, struct b_node *old)
 621 {
 622         /*
 623          * Using NULL as the buffer for NOR flash prevents the entire node
 624          * being read. This makes most comparisons much quicker as only one
 625          * or two entries from the node will be used most of the time.
 626          */
 627         struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
 628         struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
 629         int cmp;
 630         int ret;
 631
 632         if (jNew->pino != jOld->pino) {
 633                 /* ascending sort by pino */
 634                 ret = jNew->pino > jOld->pino;
 635         } else if (jNew->nsize != jOld->nsize) {
 636                 /*
 637                  * pino is the same, so use ascending sort by nsize,
 638                  * so we don't do strncmp unless we really must.
 639                  */
 640                 ret = jNew->nsize > jOld->nsize;
 641         } else {
 642                 /*
 643                  * length is also the same, so use ascending sort by name
 644                  */
 645                 cmp = strncmp((char *)jNew->name, (char *)jOld->name,
 646                         jNew->nsize);
 647                 if (cmp != 0) {
 648                         ret = cmp > 0;
 649                 } else {
 650                         /*
 651                          * we have duplicate names in this directory,
 652                          * so use ascending sort by version
 653                          */
 654                         ret = jNew->version > jOld->version;
 655                 }
 656         }
 657         put_fl_mem(jNew, NULL);
 658         put_fl_mem(jOld, NULL);
 659
 660         return ret;
 661 }
 662 #endif
 663
 664 void
 665 jffs2_free_cache(struct part_info *part)
 666 {
 667         struct b_lists *pL;
 668
 669         if (part->jffs2_priv != NULL) {
 670                 pL = (struct b_lists *)part->jffs2_priv;
 671                 free_nodes(&pL->frag);
 672                 free_nodes(&pL->dir);
 673                 free(pL->readbuf);
 674                 free(pL);
 675         }
 676 }
 677
 678 static u32
 679 jffs_init_1pass_list(struct part_info *part)
 680 {
 681         struct b_lists *pL;
 682
 683         jffs2_free_cache(part);
 684
 685         if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
 686                 pL = (struct b_lists *)part->jffs2_priv;
 687
 688                 memset(pL, 0, sizeof(*pL));
 689 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 690                 pL->dir.listCompare = compare_dirents;
 691                 pL->frag.listCompare = compare_inodes;
 692 #endif
 693         }
 694         return 0;
 695 }
 696
 697 /* find the inode from the slashless name given a parent */
 698 static long
 699 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
 700 {
 701         struct b_node *b;
 702         struct jffs2_raw_inode *jNode;
 703         u32 totalSize = 0;
 704         u32 latestVersion = 0;
 705         uchar *lDest;
 706         uchar *src;
 707         int i;
 708         u32 counter = 0;
 709 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 710         /* Find file size before loading any data, so fragments that
 711          * start past the end of file can be ignored. A fragment
 712          * that is partially in the file is loaded, so extra data may
 713          * be loaded up to the next 4K boundary above the file size.
 714          * This shouldn't cause trouble when loading kernel images, so
 715          * we will live with it.
 716          */
 717         for (b = pL->frag.listHead; b != NULL; b = b->next) {
 718                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
 719                         sizeof(struct jffs2_raw_inode), pL->readbuf);
 720                 if ((inode == jNode->ino)) {
 721                         /* get actual file length from the newest node */
 722                         if (jNode->version >= latestVersion) {
 723                                 totalSize = jNode->isize;
 724                                 latestVersion = jNode->version;
 725                         }
 726                 }
 727                 put_fl_mem(jNode, pL->readbuf);
 728         }
 729         /*
 730          * If no destination is provided, we are done.
 731          * Just return the total size.
 732          */
 733         if (!dest)
 734                 return totalSize;
 735 #endif
 736
 737         for (b = pL->frag.listHead; b != NULL; b = b->next) {
 738                 /*
 739                  * Copy just the node and not the data at this point,
 740                  * since we don't yet know if we need this data.
 741                  */
 742                 jNode = (struct jffs2_raw_inode *)get_fl_mem(b->offset,
 743                                 sizeof(struct jffs2_raw_inode),
 744                                 pL->readbuf);
 745                 if (inode == jNode->ino) {
 746 #if 0
 747                         putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
 748                         putLabeledWord("read_inode: inode = ", jNode->ino);
 749                         putLabeledWord("read_inode: version = ", jNode->version);
 750                         putLabeledWord("read_inode: isize = ", jNode->isize);
 751                         putLabeledWord("read_inode: offset = ", jNode->offset);
 752                         putLabeledWord("read_inode: csize = ", jNode->csize);
 753                         putLabeledWord("read_inode: dsize = ", jNode->dsize);
 754                         putLabeledWord("read_inode: compr = ", jNode->compr);
 755                         putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
 756                         putLabeledWord("read_inode: flags = ", jNode->flags);
 757 #endif
 758
 759 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 760                         /* get actual file length from the newest node */
 761                         if (jNode->version >= latestVersion) {
 762                                 totalSize = jNode->isize;
 763                                 latestVersion = jNode->version;
 764                         }
 765 #endif
 766
 767                         if(dest) {
 768                                 /*
 769                                  * Now that the inode has been checked,
 770                                  * read the entire inode, including data.
 771                                  */
 772                                 put_fl_mem(jNode, pL->readbuf);
 773                                 jNode = (struct jffs2_raw_inode *)
 774                                         get_node_mem(b->offset, pL->readbuf);
 775                                 src = ((uchar *)jNode) +
 776                                         sizeof(struct jffs2_raw_inode);
 777                                 /* ignore data behind latest known EOF */
 778                                 if (jNode->offset > totalSize) {
 779                                         put_fl_mem(jNode, pL->readbuf);
 780                                         continue;
 781                                 }
 782                                 if (b->datacrc == CRC_UNKNOWN)
 783                                         b->datacrc = data_crc(jNode) ?
 784                                                 CRC_OK : CRC_BAD;
 785                                 if (b->datacrc == CRC_BAD) {
 786                                         put_fl_mem(jNode, pL->readbuf);
 787                                         continue;
 788                                 }
 789
 790                                 lDest = (uchar *) (dest + jNode->offset);
 791 #if 0
 792                                 putLabeledWord("read_inode: src = ", src);
 793                                 putLabeledWord("read_inode: dest = ", lDest);
 794 #endif
 795                                 switch (jNode->compr) {
 796                                 case JFFS2_COMPR_NONE:
 797                                         ldr_memcpy(lDest, src, jNode->dsize);
 798                                         break;
 799                                 case JFFS2_COMPR_ZERO:
 800                                         for (i = 0; i < jNode->dsize; i++)
 801                                                 *(lDest++) = 0;
 802                                         break;
 803                                 case JFFS2_COMPR_RTIME:
 804                                         rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
 805                                         break;
 806                                 case JFFS2_COMPR_DYNRUBIN:
 807                                         /* this is slow but it works */
 808                                         dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
 809                                         break;
 810                                 case JFFS2_COMPR_ZLIB:
 811                                         zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
 812                                         break;
 813 #if defined(CONFIG_JFFS2_LZO)
 814                                 case JFFS2_COMPR_LZO:
 815                                         lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
 816                                         break;
 817 #endif
 818                                 default:
 819                                         /* unknown */
 820                                         putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
 821                                         put_fl_mem(jNode, pL->readbuf);
 822                                         return -1;
 823                                         break;
 824                                 }
 825                         }
 826
 827 #if 0
 828                         putLabeledWord("read_inode: totalSize = ", totalSize);
 829 #endif
 830                 }
 831                 counter++;
 832                 put_fl_mem(jNode, pL->readbuf);
 833         }
 834
 835 #if 0
 836         putLabeledWord("read_inode: returning = ", totalSize);
 837 #endif
 838         return totalSize;
 839 }
 840
 841 /* find the inode from the slashless name given a parent */
 842 static u32
 843 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
 844 {
 845         struct b_node *b;
 846         struct jffs2_raw_dirent *jDir;
 847         int len;
 848         u32 counter;
 849         u32 version = 0;
 850         u32 inode = 0;
 851
 852         /* name is assumed slash free */
 853         len = strlen(name);
 854
 855         counter = 0;
 856         /* we need to search all and return the inode with the highest version */
 857         for(b = pL->dir.listHead; b; b = b->next, counter++) {
 858                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
 859                                                                 pL->readbuf);
 860                 if ((pino == jDir->pino) && (len == jDir->nsize) &&
 861                     (!strncmp((char *)jDir->name, name, len))) {        /* a match */
 862                         if (jDir->version < version) {
 863                                 put_fl_mem(jDir, pL->readbuf);
 864                                 continue;
 865                         }
 866
 867                         if (jDir->version == version && inode != 0) {
 868                                 /* I'm pretty sure this isn't legal */
 869                                 putstr(" ** ERROR ** ");
 870                                 putnstr(jDir->name, jDir->nsize);
 871                                 putLabeledWord(" has dup version =", version);
 872                         }
 873                         inode = jDir->ino;
 874                         version = jDir->version;
 875                 }
 876 #if 0
 877                 putstr("\r\nfind_inode:p&l ->");
 878                 putnstr(jDir->name, jDir->nsize);
 879                 putstr("\r\n");
 880                 putLabeledWord("pino = ", jDir->pino);
 881                 putLabeledWord("nsize = ", jDir->nsize);
 882                 putLabeledWord("b = ", (u32) b);
 883                 putLabeledWord("counter = ", counter);
 884 #endif
 885                 put_fl_mem(jDir, pL->readbuf);
 886         }
 887         return inode;
 888 }
 889
 890 char *mkmodestr(unsigned long mode, char *str)
 891 {
 892         static const char *l = "xwr";
 893         int mask = 1, i;
 894         char c;
 895
 896         switch (mode & S_IFMT) {
 897                 case S_IFDIR:    str[0] = 'd'; break;
 898                 case S_IFBLK:    str[0] = 'b'; break;
 899                 case S_IFCHR:    str[0] = 'c'; break;
 900                 case S_IFIFO:    str[0] = 'f'; break;
 901                 case S_IFLNK:    str[0] = 'l'; break;
 902                 case S_IFSOCK:   str[0] = 's'; break;
 903                 case S_IFREG:    str[0] = '-'; break;
 904                 default:         str[0] = '?';
 905         }
 906
 907         for(i = 0; i < 9; i++) {
 908                 c = l[i%3];
 909                 str[9-i] = (mode & mask)?c:'-';
 910                 mask = mask<<1;
 911         }
 912
 913         if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
 914         if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
 915         if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
 916         str[10] = '\0';
 917         return str;
 918 }
 919
 920 static inline void dump_stat(struct stat *st, const char *name)
 921 {
 922         char str[20];
 923         char s[64], *p;
 924
 925         if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
 926                 st->st_mtime = 1;
 927
 928         ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
 929
 930         if ((p = strchr(s,'\n')) != NULL) *p = '\0';
 931         if ((p = strchr(s,'\r')) != NULL) *p = '\0';
 932
 933 /*
 934         printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
 935                 st->st_size, s, name);
 936 */
 937
 938         printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
 939 }
 940
 941 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
 942 {
 943         char fname[256];
 944         struct stat st;
 945
 946         if(!d || !i) return -1;
 947
 948         strncpy(fname, (char *)d->name, d->nsize);
 949         fname[d->nsize] = '\0';
 950
 951         memset(&st,0,sizeof(st));
 952
 953         st.st_mtime = i->mtime;
 954         st.st_mode = i->mode;
 955         st.st_ino = i->ino;
 956         st.st_size = i->isize;
 957
 958         dump_stat(&st, fname);
 959
 960         if (d->type == DT_LNK) {
 961                 unsigned char *src = (unsigned char *) (&i[1]);
 962                 putstr(" -> ");
 963                 putnstr(src, (int)i->dsize);
 964         }
 965
 966         putstr("\r\n");
 967
 968         return 0;
 969 }
 970
 971 /* list inodes with the given pino */
 972 static u32
 973 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
 974 {
 975         struct b_node *b;
 976         struct jffs2_raw_dirent *jDir;
 977
 978         for (b = pL->dir.listHead; b; b = b->next) {
 979                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
 980                                                                 pL->readbuf);
 981                 if (pino == jDir->pino) {
 982                         u32 i_version = 0;
 983                         struct jffs2_raw_inode *jNode, *i = NULL;
 984                         struct b_node *b2;
 985
 986 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
 987                         /* Check for more recent versions of this file */
 988                         int match;
 989                         do {
 990                                 struct b_node *next = b->next;
 991                                 struct jffs2_raw_dirent *jDirNext;
 992                                 if (!next)
 993                                         break;
 994                                 jDirNext = (struct jffs2_raw_dirent *)
 995                                         get_node_mem(next->offset, NULL);
 996                                 match = jDirNext->pino == jDir->pino &&
 997                                         jDirNext->nsize == jDir->nsize &&
 998                                         strncmp((char *)jDirNext->name,
 999                                                 (char *)jDir->name,
1000                                                 jDir->nsize) == 0;
1001                                 if (match) {
1002                                         /* Use next. It is more recent */
1003                                         b = next;
1004                                         /* Update buffer with the new info */
1005                                         *jDir = *jDirNext;
1006                                 }
1007                                 put_fl_mem(jDirNext, NULL);
1008                         } while (match);
1009 #endif
1010                         if (jDir->ino == 0) {
1011                                 /* Deleted file */
1012                                 put_fl_mem(jDir, pL->readbuf);
1013                                 continue;
1014                         }
1015
1016                         for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
1017                                 jNode = (struct jffs2_raw_inode *)
1018                                         get_fl_mem(b2->offset, sizeof(*jNode),
1019                                                    NULL);
1020                                 if (jNode->ino == jDir->ino &&
1021                                     jNode->version >= i_version) {
1022                                         i_version = jNode->version;
1023                                         if (i)
1024                                                 put_fl_mem(i, NULL);
1025
1026                                         if (jDir->type == DT_LNK)
1027                                                 i = get_node_mem(b2->offset,
1028                                                                  NULL);
1029                                         else
1030                                                 i = get_fl_mem(b2->offset,
1031                                                                sizeof(*i),
1032                                                                NULL);
1033                                 }
1034                                 put_fl_mem(jNode, NULL);
1035                         }
1036
1037                         dump_inode(pL, jDir, i);
1038                         put_fl_mem(i, NULL);
1039                 }
1040                 put_fl_mem(jDir, pL->readbuf);
1041         }
1042         return pino;
1043 }
1044
1045 static u32
1046 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1047 {
1048         int i;
1049         char tmp[256];
1050         char working_tmp[256];
1051         char *c;
1052
1053         /* discard any leading slash */
1054         i = 0;
1055         while (fname[i] == '/')
1056                 i++;
1057         strcpy(tmp, &fname[i]);
1058
1059         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1060         {
1061                 strncpy(working_tmp, tmp, c - tmp);
1062                 working_tmp[c - tmp] = '\0';
1063 #if 0
1064                 putstr("search_inode: tmp = ");
1065                 putstr(tmp);
1066                 putstr("\r\n");
1067                 putstr("search_inode: wtmp = ");
1068                 putstr(working_tmp);
1069                 putstr("\r\n");
1070                 putstr("search_inode: c = ");
1071                 putstr(c);
1072                 putstr("\r\n");
1073 #endif
1074                 for (i = 0; i < strlen(c) - 1; i++)
1075                         tmp[i] = c[i + 1];
1076                 tmp[i] = '\0';
1077 #if 0
1078                 putstr("search_inode: post tmp = ");
1079                 putstr(tmp);
1080                 putstr("\r\n");
1081 #endif
1082
1083                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1084                         putstr("find_inode failed for name=");
1085                         putstr(working_tmp);
1086                         putstr("\r\n");
1087                         return 0;
1088                 }
1089         }
1090         /* this is for the bare filename, directories have already been mapped */
1091         if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1092                 putstr("find_inode failed for name=");
1093                 putstr(tmp);
1094                 putstr("\r\n");
1095                 return 0;
1096         }
1097         return pino;
1098
1099 }
1100
1101 static u32
1102 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1103 {
1104         struct b_node *b;
1105         struct b_node *b2;
1106         struct jffs2_raw_dirent *jDir;
1107         struct jffs2_raw_inode *jNode;
1108         u8 jDirFoundType = 0;
1109         u32 jDirFoundIno = 0;
1110         u32 jDirFoundPino = 0;
1111         char tmp[256];
1112         u32 version = 0;
1113         u32 pino;
1114         unsigned char *src;
1115
1116         /* we need to search all and return the inode with the highest version */
1117         for(b = pL->dir.listHead; b; b = b->next) {
1118                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1119                                                                 pL->readbuf);
1120                 if (ino == jDir->ino) {
1121                         if (jDir->version < version) {
1122                                 put_fl_mem(jDir, pL->readbuf);
1123                                 continue;
1124                         }
1125
1126                         if (jDir->version == version && jDirFoundType) {
1127                                 /* I'm pretty sure this isn't legal */
1128                                 putstr(" ** ERROR ** ");
1129                                 putnstr(jDir->name, jDir->nsize);
1130                                 putLabeledWord(" has dup version (resolve) = ",
1131                                         version);
1132                         }
1133
1134                         jDirFoundType = jDir->type;
1135                         jDirFoundIno = jDir->ino;
1136                         jDirFoundPino = jDir->pino;
1137                         version = jDir->version;
1138                 }
1139                 put_fl_mem(jDir, pL->readbuf);
1140         }
1141         /* now we found the right entry again. (shoulda returned inode*) */
1142         if (jDirFoundType != DT_LNK)
1143                 return jDirFoundIno;
1144
1145         /* it's a soft link so we follow it again. */
1146         b2 = pL->frag.listHead;
1147         while (b2) {
1148                 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1149                                                                 pL->readbuf);
1150                 if (jNode->ino == jDirFoundIno) {
1151                         src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1152
1153 #if 0
1154                         putLabeledWord("\t\t dsize = ", jNode->dsize);
1155                         putstr("\t\t target = ");
1156                         putnstr(src, jNode->dsize);
1157                         putstr("\r\n");
1158 #endif
1159                         strncpy(tmp, (char *)src, jNode->dsize);
1160                         tmp[jNode->dsize] = '\0';
1161                         put_fl_mem(jNode, pL->readbuf);
1162                         break;
1163                 }
1164                 b2 = b2->next;
1165                 put_fl_mem(jNode, pL->readbuf);
1166         }
1167         /* ok so the name of the new file to find is in tmp */
1168         /* if it starts with a slash it is root based else shared dirs */
1169         if (tmp[0] == '/')
1170                 pino = 1;
1171         else
1172                 pino = jDirFoundPino;
1173
1174         return jffs2_1pass_search_inode(pL, tmp, pino);
1175 }
1176
1177 static u32
1178 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1179 {
1180         int i;
1181         char tmp[256];
1182         char working_tmp[256];
1183         char *c;
1184
1185         /* discard any leading slash */
1186         i = 0;
1187         while (fname[i] == '/')
1188                 i++;
1189         strcpy(tmp, &fname[i]);
1190         working_tmp[0] = '\0';
1191         while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1192         {
1193                 strncpy(working_tmp, tmp, c - tmp);
1194                 working_tmp[c - tmp] = '\0';
1195                 for (i = 0; i < strlen(c) - 1; i++)
1196                         tmp[i] = c[i + 1];
1197                 tmp[i] = '\0';
1198                 /* only a failure if we arent looking at top level */
1199                 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1200                     (working_tmp[0])) {
1201                         putstr("find_inode failed for name=");
1202                         putstr(working_tmp);
1203                         putstr("\r\n");
1204                         return 0;
1205                 }
1206         }
1207
1208         if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1209                 putstr("find_inode failed for name=");
1210                 putstr(tmp);
1211                 putstr("\r\n");
1212                 return 0;
1213         }
1214         /* this is for the bare filename, directories have already been mapped */
1215         if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1216                 putstr("find_inode failed for name=");
1217                 putstr(tmp);
1218                 putstr("\r\n");
1219                 return 0;
1220         }
1221         return pino;
1222
1223 }
1224
1225 unsigned char
1226 jffs2_1pass_rescan_needed(struct part_info *part)
1227 {
1228         struct b_node *b;
1229         struct jffs2_unknown_node onode;
1230         struct jffs2_unknown_node *node;
1231         struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1232
1233         if (part->jffs2_priv == 0){
1234                 DEBUGF ("rescan: First time in use\n");
1235                 return 1;
1236         }
1237
1238         /* if we have no list, we need to rescan */
1239         if (pL->frag.listCount == 0) {
1240                 DEBUGF ("rescan: fraglist zero\n");
1241                 return 1;
1242         }
1243
1244         /* but suppose someone reflashed a partition at the same offset... */
1245         b = pL->dir.listHead;
1246         while (b) {
1247                 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1248                         sizeof(onode), &onode);
1249                 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1250                         DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1251                                         (unsigned long) b->offset);
1252                         return 1;
1253                 }
1254                 b = b->next;
1255         }
1256         return 0;
1257 }
1258
1259 #ifdef CONFIG_JFFS2_SUMMARY
1260 static u32 sum_get_unaligned32(u32 *ptr)
1261 {
1262         u32 val;
1263         u8 *p = (u8 *)ptr;
1264
1265         val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1266
1267         return __le32_to_cpu(val);
1268 }
1269
1270 static u16 sum_get_unaligned16(u16 *ptr)
1271 {
1272         u16 val;
1273         u8 *p = (u8 *)ptr;
1274
1275         val = *p | (*(p + 1) << 8);
1276
1277         return __le16_to_cpu(val);
1278 }
1279
1280 #define dbg_summary(...) do {} while (0);
1281 /*
1282  * Process the stored summary information - helper function for
1283  * jffs2_sum_scan_sumnode()
1284  */
1285
1286 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1287                                 struct jffs2_raw_summary *summary,
1288                                 struct b_lists *pL)
1289 {
1290         void *sp;
1291         int i, pass;
1292         void *ret;
1293
1294         for (pass = 0; pass < 2; pass++) {
1295                 sp = summary->sum;
1296
1297                 for (i = 0; i < summary->sum_num; i++) {
1298                         struct jffs2_sum_unknown_flash *spu = sp;
1299                         dbg_summary("processing summary index %d\n", i);
1300
1301                         switch (sum_get_unaligned16(&spu->nodetype)) {
1302                                 case JFFS2_NODETYPE_INODE: {
1303                                 struct jffs2_sum_inode_flash *spi;
1304                                         if (pass) {
1305                                                 spi = sp;
1306
1307                                                 ret = insert_node(&pL->frag,
1308                                                         (u32)part->offset +
1309                                                         offset +
1310                                                         sum_get_unaligned32(
1311                                                                 &spi->offset));
1312                                                 if (ret == NULL)
1313                                                         return -1;
1314                                         }
1315
1316                                         sp += JFFS2_SUMMARY_INODE_SIZE;
1317
1318                                         break;
1319                                 }
1320                                 case JFFS2_NODETYPE_DIRENT: {
1321                                         struct jffs2_sum_dirent_flash *spd;
1322                                         spd = sp;
1323                                         if (pass) {
1324                                                 ret = insert_node(&pL->dir,
1325                                                         (u32) part->offset +
1326                                                         offset +
1327                                                         sum_get_unaligned32(
1328                                                                 &spd->offset));
1329                                                 if (ret == NULL)
1330                                                         return -1;
1331                                         }
1332
1333                                         sp += JFFS2_SUMMARY_DIRENT_SIZE(
1334                                                         spd->nsize);
1335
1336                                         break;
1337                                 }
1338                                 default : {
1339                                         uint16_t nodetype = sum_get_unaligned16(
1340                                                                 &spu->nodetype);
1341                                         printf("Unsupported node type %x found"
1342                                                         " in summary!\n",
1343                                                         nodetype);
1344                                         if ((nodetype & JFFS2_COMPAT_MASK) ==
1345                                                         JFFS2_FEATURE_INCOMPAT)
1346                                                 return -EIO;
1347                                         return -EBADMSG;
1348                                 }
1349                         }
1350                 }
1351         }
1352         return 0;
1353 }
1354
1355 /* Process the summary node - called from jffs2_scan_eraseblock() */
1356 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1357                            struct jffs2_raw_summary *summary, uint32_t sumsize,
1358                            struct b_lists *pL)
1359 {
1360         struct jffs2_unknown_node crcnode;
1361         int ret, ofs;
1362         uint32_t crc;
1363
1364         ofs = part->sector_size - sumsize;
1365
1366         dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1367                     offset, offset + ofs, sumsize);
1368
1369         /* OK, now check for node validity and CRC */
1370         crcnode.magic = JFFS2_MAGIC_BITMASK;
1371         crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1372         crcnode.totlen = summary->totlen;
1373         crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1374
1375         if (summary->hdr_crc != crc) {
1376                 dbg_summary("Summary node header is corrupt (bad CRC or "
1377                                 "no summary at all)\n");
1378                 goto crc_err;
1379         }
1380
1381         if (summary->totlen != sumsize) {
1382                 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1383                 goto crc_err;
1384         }
1385
1386         crc = crc32_no_comp(0, (uchar *)summary,
1387                         sizeof(struct jffs2_raw_summary)-8);
1388
1389         if (summary->node_crc != crc) {
1390                 dbg_summary("Summary node is corrupt (bad CRC)\n");
1391                 goto crc_err;
1392         }
1393
1394         crc = crc32_no_comp(0, (uchar *)summary->sum,
1395                         sumsize - sizeof(struct jffs2_raw_summary));
1396
1397         if (summary->sum_crc != crc) {
1398                 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1399                 goto crc_err;
1400         }
1401
1402         if (summary->cln_mkr)
1403                 dbg_summary("Summary : CLEANMARKER node \n");
1404
1405         ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1406         if (ret == -EBADMSG)
1407                 return 0;
1408         if (ret)
1409                 return ret;             /* real error */
1410
1411         return 1;
1412
1413 crc_err:
1414         putstr("Summary node crc error, skipping summary information.\n");
1415
1416         return 0;
1417 }
1418 #endif /* CONFIG_JFFS2_SUMMARY */
1419
1420 #ifdef DEBUG_FRAGMENTS
1421 static void
1422 dump_fragments(struct b_lists *pL)
1423 {
1424         struct b_node *b;
1425         struct jffs2_raw_inode ojNode;
1426         struct jffs2_raw_inode *jNode;
1427
1428         putstr("\r\n\r\n******The fragment Entries******\r\n");
1429         b = pL->frag.listHead;
1430         while (b) {
1431                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1432                         sizeof(ojNode), &ojNode);
1433                 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1434                 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1435                 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1436                 putLabeledWord("\tbuild_list: version = ", jNode->version);
1437                 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1438                 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1439                 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1440                 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1441                 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1442                 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1443                 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1444                 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1445                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1446                 b = b->next;
1447         }
1448 }
1449 #endif
1450
1451 #ifdef DEBUG_DIRENTS
1452 static void
1453 dump_dirents(struct b_lists *pL)
1454 {
1455         struct b_node *b;
1456         struct jffs2_raw_dirent *jDir;
1457
1458         putstr("\r\n\r\n******The directory Entries******\r\n");
1459         b = pL->dir.listHead;
1460         while (b) {
1461                 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1462                                                                 pL->readbuf);
1463                 putstr("\r\n");
1464                 putnstr(jDir->name, jDir->nsize);
1465                 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1466                 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1467                 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1468                 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1469                 putLabeledWord("\tbuild_list: version = ", jDir->version);
1470                 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1471                 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1472                 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1473                 putLabeledWord("\tbuild_list: type = ", jDir->type);
1474                 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1475                 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1476                 putLabeledWord("\tbuild_list: offset = ", b->offset);   /* FIXME: ? [RS] */
1477                 b = b->next;
1478                 put_fl_mem(jDir, pL->readbuf);
1479         }
1480 }
1481 #endif
1482
1483 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1484
1485 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1486 {
1487         if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1488                 return sector_size;
1489         else
1490                 return DEFAULT_EMPTY_SCAN_SIZE;
1491 }
1492
1493 static u32
1494 jffs2_1pass_build_lists(struct part_info * part)
1495 {
1496         struct b_lists *pL;
1497         struct jffs2_unknown_node *node;
1498         u32 nr_sectors;
1499         u32 i;
1500         u32 counter4 = 0;
1501         u32 counterF = 0;
1502         u32 counterN = 0;
1503         u32 max_totlen = 0;
1504         u32 buf_size;
1505         char *buf;
1506
1507         nr_sectors = lldiv(part->size, part->sector_size);
1508         /* turn off the lcd.  Refreshing the lcd adds 50% overhead to the */
1509         /* jffs2 list building enterprise nope.  in newer versions the overhead is */
1510         /* only about 5 %.  not enough to inconvenience people for. */
1511         /* lcd_off(); */
1512
1513         /* if we are building a list we need to refresh the cache. */
1514         jffs_init_1pass_list(part);
1515         pL = (struct b_lists *)part->jffs2_priv;
1516         buf = malloc(DEFAULT_EMPTY_SCAN_SIZE);
1517         puts ("Scanning JFFS2 FS:   ");
1518
1519         /* start at the beginning of the partition */
1520         for (i = 0; i < nr_sectors; i++) {
1521                 uint32_t sector_ofs = i * part->sector_size;
1522                 uint32_t buf_ofs = sector_ofs;
1523                 uint32_t buf_len;
1524                 uint32_t ofs, prevofs;
1525 #ifdef CONFIG_JFFS2_SUMMARY
1526                 struct jffs2_sum_marker *sm;
1527                 void *sumptr = NULL;
1528                 uint32_t sumlen;
1529                 int ret;
1530 #endif
1531
1532                 /* Set buf_size to maximum length */
1533                 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1534                 WATCHDOG_RESET();
1535
1536 #ifdef CONFIG_JFFS2_SUMMARY
1537                 buf_len = sizeof(*sm);
1538
1539                 /* Read as much as we want into the _end_ of the preallocated
1540                  * buffer
1541                  */
1542                 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1543                                 buf_len, buf_len, buf + buf_size - buf_len);
1544
1545                 sm = (void *)buf + buf_size - sizeof(*sm);
1546                 if (sm->magic == JFFS2_SUM_MAGIC) {
1547                         sumlen = part->sector_size - sm->offset;
1548                         sumptr = buf + buf_size - sumlen;
1549
1550                         /* Now, make sure the summary itself is available */
1551                         if (sumlen > buf_size) {
1552                                 /* Need to kmalloc for this. */
1553                                 sumptr = malloc(sumlen);
1554                                 if (!sumptr) {
1555                                         putstr("Can't get memory for summary "
1556                                                         "node!\n");
1557                                         free(buf);
1558                                         jffs2_free_cache(part);
1559                                         return 0;
1560                                 }
1561                                 memcpy(sumptr + sumlen - buf_len, buf +
1562                                                 buf_size - buf_len, buf_len);
1563                         }
1564                         if (buf_len < sumlen) {
1565                                 /* Need to read more so that the entire summary
1566                                  * node is present
1567                                  */
1568                                 get_fl_mem(part->offset + sector_ofs +
1569                                                 part->sector_size - sumlen,
1570                                                 sumlen - buf_len, sumptr);
1571                         }
1572                 }
1573
1574                 if (sumptr) {
1575                         ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1576                                         sumlen, pL);
1577
1578                         if (buf_size && sumlen > buf_size)
1579                                 free(sumptr);
1580                         if (ret < 0) {
1581                                 free(buf);
1582                                 jffs2_free_cache(part);
1583                                 return 0;
1584                         }
1585                         if (ret)
1586                                 continue;
1587
1588                 }
1589 #endif /* CONFIG_JFFS2_SUMMARY */
1590
1591                 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1592
1593                 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1594
1595                 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1596                 ofs = 0;
1597
1598                 /* Scan only 4KiB of 0xFF before declaring it's empty */
1599                 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1600                                 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1601                         ofs += 4;
1602
1603                 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1604                         continue;
1605
1606                 ofs += sector_ofs;
1607                 prevofs = ofs - 1;
1608                 /*
1609                  * Set buf_size down to the minimum size required.
1610                  * This prevents reading in chunks of flash data unnecessarily.
1611                  */
1612                 buf_size = sizeof(union jffs2_node_union);
1613
1614         scan_more:
1615                 while (ofs < sector_ofs + part->sector_size) {
1616                         if (ofs == prevofs) {
1617                                 printf("offset %08x already seen, skip\n", ofs);
1618                                 ofs += 4;
1619                                 counter4++;
1620                                 continue;
1621                         }
1622                         prevofs = ofs;
1623                         if (sector_ofs + part->sector_size <
1624                                         ofs + sizeof(*node))
1625                                 break;
1626                         if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1627                                 buf_len = min_t(uint32_t, buf_size, sector_ofs
1628                                                 + part->sector_size - ofs);
1629                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1630                                            buf);
1631                                 buf_ofs = ofs;
1632                         }
1633
1634                         node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1635
1636                         if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1637                                 uint32_t inbuf_ofs;
1638                                 uint32_t scan_end;
1639
1640                                 ofs += 4;
1641                                 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1642                                                         part->sector_size)/8,
1643                                                         buf_len);
1644                         more_empty:
1645                                 inbuf_ofs = ofs - buf_ofs;
1646                                 while (inbuf_ofs < scan_end) {
1647                                         if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1648                                                         0xffffffff)
1649                                                 goto scan_more;
1650
1651                                         inbuf_ofs += 4;
1652                                         ofs += 4;
1653                                 }
1654                                 /* Ran off end. */
1655
1656                                 /* See how much more there is to read in this
1657                                  * eraseblock...
1658                                  */
1659                                 buf_len = min_t(uint32_t, buf_size,
1660                                                 sector_ofs +
1661                                                 part->sector_size - ofs);
1662                                 if (!buf_len) {
1663                                         /* No more to read. Break out of main
1664                                          * loop without marking this range of
1665                                          * empty space as dirty (because it's
1666                                          * not)
1667                                          */
1668                                         break;
1669                                 }
1670                                 scan_end = buf_len;
1671                                 get_fl_mem((u32)part->offset + ofs, buf_len,
1672                                            buf);
1673                                 buf_ofs = ofs;
1674                                 goto more_empty;
1675                         }
1676                         if (node->magic != JFFS2_MAGIC_BITMASK ||
1677                                         !hdr_crc(node)) {
1678                                 ofs += 4;
1679                                 counter4++;
1680                                 continue;
1681                         }
1682                         if (ofs + node->totlen >
1683                                         sector_ofs + part->sector_size) {
1684                                 ofs += 4;
1685                                 counter4++;
1686                                 continue;
1687                         }
1688                         /* if its a fragment add it */
1689                         switch (node->nodetype) {
1690                         case JFFS2_NODETYPE_INODE:
1691                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1692                                                         jffs2_raw_inode)) {
1693                                         buf_len = min_t(uint32_t,
1694                                                         sizeof(struct jffs2_raw_inode),
1695                                                         sector_ofs +
1696                                                         part->sector_size -
1697                                                         ofs);
1698                                         get_fl_mem((u32)part->offset + ofs,
1699                                                    buf_len, buf);
1700                                         buf_ofs = ofs;
1701                                         node = (void *)buf;
1702                                 }
1703                                 if (!inode_crc((struct jffs2_raw_inode *)node))
1704                                         break;
1705
1706                                 if (insert_node(&pL->frag, (u32) part->offset +
1707                                                 ofs) == NULL) {
1708                                         free(buf);
1709                                         jffs2_free_cache(part);
1710                                         return 0;
1711                                 }
1712                                 if (max_totlen < node->totlen)
1713                                         max_totlen = node->totlen;
1714                                 break;
1715                         case JFFS2_NODETYPE_DIRENT:
1716                                 if (buf_ofs + buf_len < ofs + sizeof(struct
1717                                                         jffs2_raw_dirent) +
1718                                                         ((struct
1719                                                          jffs2_raw_dirent *)
1720                                                         node)->nsize) {
1721                                         buf_len = min_t(uint32_t,
1722                                                         node->totlen,
1723                                                         sector_ofs +
1724                                                         part->sector_size -
1725                                                         ofs);
1726                                         get_fl_mem((u32)part->offset + ofs,
1727                                                    buf_len, buf);
1728                                         buf_ofs = ofs;
1729                                         node = (void *)buf;
1730                                 }
1731
1732                                 if (!dirent_crc((struct jffs2_raw_dirent *)
1733                                                         node) ||
1734                                                 !dirent_name_crc(
1735                                                         (struct
1736                                                          jffs2_raw_dirent *)
1737                                                         node))
1738                                         break;
1739                                 if (! (counterN%100))
1740                                         puts ("\b\b.  ");
1741                                 if (insert_node(&pL->dir, (u32) part->offset +
1742                                                 ofs) == NULL) {
1743                                         free(buf);
1744                                         jffs2_free_cache(part);
1745                                         return 0;
1746                                 }
1747                                 if (max_totlen < node->totlen)
1748                                         max_totlen = node->totlen;
1749                                 counterN++;
1750                                 break;
1751                         case JFFS2_NODETYPE_CLEANMARKER:
1752                                 if (node->totlen != sizeof(struct jffs2_unknown_node))
1753                                         printf("OOPS Cleanmarker has bad size "
1754                                                 "%d != %zu\n",
1755                                                 node->totlen,
1756                                                 sizeof(struct jffs2_unknown_node));
1757                                 break;
1758                         case JFFS2_NODETYPE_PADDING:
1759                                 if (node->totlen < sizeof(struct jffs2_unknown_node))
1760                                         printf("OOPS Padding has bad size "
1761                                                 "%d < %zu\n",
1762                                                 node->totlen,
1763                                                 sizeof(struct jffs2_unknown_node));
1764                                 break;
1765                         case JFFS2_NODETYPE_SUMMARY:
1766                                 break;
1767                         default:
1768                                 printf("Unknown node type: %x len %d offset 0x%x\n",
1769                                         node->nodetype,
1770                                         node->totlen, ofs);
1771                         }
1772                         ofs += ((node->totlen + 3) & ~3);
1773                         counterF++;
1774                 }
1775         }
1776
1777         free(buf);
1778         putstr("\b\b done.\r\n");               /* close off the dots */
1779
1780         /* We don't care if malloc failed - then each read operation will
1781          * allocate its own buffer as necessary (NAND) or will read directly
1782          * from flash (NOR).
1783          */
1784         pL->readbuf = malloc(max_totlen);
1785
1786         /* turn the lcd back on. */
1787         /* splash(); */
1788
1789 #if 0
1790         putLabeledWord("dir entries = ", pL->dir.listCount);
1791         putLabeledWord("frag entries = ", pL->frag.listCount);
1792         putLabeledWord("+4 increments = ", counter4);
1793         putLabeledWord("+file_offset increments = ", counterF);
1794
1795 #endif
1796
1797 #ifdef DEBUG_DIRENTS
1798         dump_dirents(pL);
1799 #endif
1800
1801 #ifdef DEBUG_FRAGMENTS
1802         dump_fragments(pL);
1803 #endif
1804
1805         /* give visual feedback that we are done scanning the flash */
1806         led_blink(0x0, 0x0, 0x1, 0x1);  /* off, forever, on 100ms, off 100ms */
1807         return 1;
1808 }
1809
1810
1811 static u32
1812 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1813 {
1814         struct b_node *b;
1815         struct jffs2_raw_inode ojNode;
1816         struct jffs2_raw_inode *jNode;
1817         int i;
1818
1819         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1820                 piL->compr_info[i].num_frags = 0;
1821                 piL->compr_info[i].compr_sum = 0;
1822                 piL->compr_info[i].decompr_sum = 0;
1823         }
1824
1825         b = pL->frag.listHead;
1826         while (b) {
1827                 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1828                         sizeof(ojNode), &ojNode);
1829                 if (jNode->compr < JFFS2_NUM_COMPR) {
1830                         piL->compr_info[jNode->compr].num_frags++;
1831                         piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1832                         piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1833                 }
1834                 b = b->next;
1835         }
1836         return 0;
1837 }
1838
1839
1840 static struct b_lists *
1841 jffs2_get_list(struct part_info * part, const char *who)
1842 {
1843         /* copy requested part_info struct pointer to global location */
1844         current_part = part;
1845
1846         if (jffs2_1pass_rescan_needed(part)) {
1847                 if (!jffs2_1pass_build_lists(part)) {
1848                         printf("%s: Failed to scan JFFSv2 file structure\n", who);
1849                         return NULL;
1850                 }
1851         }
1852         return (struct b_lists *)part->jffs2_priv;
1853 }
1854
1855
1856 /* Print directory / file contents */
1857 u32
1858 jffs2_1pass_ls(struct part_info * part, const char *fname)
1859 {
1860         struct b_lists *pl;
1861         long ret = 1;
1862         u32 inode;
1863
1864         if (! (pl = jffs2_get_list(part, "ls")))
1865                 return 0;
1866
1867         if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1868                 putstr("ls: Failed to scan jffs2 file structure\r\n");
1869                 return 0;
1870         }
1871
1872
1873 #if 0
1874         putLabeledWord("found file at inode = ", inode);
1875         putLabeledWord("read_inode returns = ", ret);
1876 #endif
1877
1878         return ret;
1879 }
1880
1881
1882 /* Load a file from flash into memory. fname can be a full path */
1883 u32
1884 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1885 {
1886
1887         struct b_lists *pl;
1888         long ret = 1;
1889         u32 inode;
1890
1891         if (! (pl  = jffs2_get_list(part, "load")))
1892                 return 0;
1893
1894         if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1895                 putstr("load: Failed to find inode\r\n");
1896                 return 0;
1897         }
1898
1899         /* Resolve symlinks */
1900         if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1901                 putstr("load: Failed to resolve inode structure\r\n");
1902                 return 0;
1903         }
1904
1905         if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1906                 putstr("load: Failed to read inode\r\n");
1907                 return 0;
1908         }
1909
1910         DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1911                                 (unsigned long) dest, ret);
1912         return ret;
1913 }
1914
1915 /* Return information about the fs on this partition */
1916 u32
1917 jffs2_1pass_info(struct part_info * part)
1918 {
1919         struct b_jffs2_info info;
1920         struct b_lists *pl;
1921         int i;
1922
1923         if (! (pl  = jffs2_get_list(part, "info")))
1924                 return 0;
1925
1926         jffs2_1pass_fill_info(pl, &info);
1927         for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1928                 printf ("Compression: %s\n"
1929                         "\tfrag count: %d\n"
1930                         "\tcompressed sum: %d\n"
1931                         "\tuncompressed sum: %d\n",
1932                         compr_names[i],
1933                         info.compr_info[i].num_frags,
1934                         info.compr_info[i].compr_sum,
1935                         info.compr_info[i].decompr_sum);
1936         }
1937         return 1;
1938 }