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 CFG_JFFS2_SORT_FRAGMENTS. 96 * Sorting is done while adding fragments to the lists, which is more or less a 97 * bubble sort. This takes a lot of time, and is most probably not an issue if 98 * the boot filesystem is always mounted readonly. 99 * 100 * You should define it if the boot filesystem is mounted writable, and updates 101 * to the boot files are done by copying files to that filesystem. 102 * 103 * 104 * There's a big issue left: endianess is completely ignored in this code. Duh! 105 * 106 * 107 * You still should have paper bags at hand :-(. The code lacks more or less 108 * any comment, and is still arcane and difficult to read in places. As this 109 * might be incompatible with any new code from the jffs2 maintainers anyway, 110 * it should probably be dumped and replaced by something like jffs2reader! 111 */ 112 113 114 #include <common.h> 115 #include <config.h> 116 #include <malloc.h> 117 #include <linux/stat.h> 118 #include <linux/time.h> 119 #include <watchdog.h> 120 121 #if defined(CONFIG_CMD_JFFS2) 122 123 #include <jffs2/jffs2.h> 124 #include <jffs2/jffs2_1pass.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 /* keeps pointer to currentlu processed partition */ 145 static struct part_info *current_part; 146 147 #if (defined(CONFIG_JFFS2_NAND) && \ 148 defined(CONFIG_CMD_NAND) ) 149 #if defined(CFG_NAND_LEGACY) 150 #include <linux/mtd/nand_legacy.h> 151 #else 152 #include <nand.h> 153 #endif 154 /* 155 * Support for jffs2 on top of NAND-flash 156 * 157 * NAND memory isn't mapped in processor's address space, 158 * so data should be fetched from flash before 159 * being processed. This is exactly what functions declared 160 * here do. 161 * 162 */ 163 164 #if defined(CFG_NAND_LEGACY) 165 /* this one defined in nand_legacy.c */ 166 int read_jffs2_nand(size_t start, size_t len, 167 size_t * retlen, u_char * buf, int nanddev); 168 #endif 169 170 #define NAND_PAGE_SIZE 512 171 #define NAND_PAGE_SHIFT 9 172 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1)) 173 174 #ifndef NAND_CACHE_PAGES 175 #define NAND_CACHE_PAGES 16 176 #endif 177 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE) 178 179 static u8* nand_cache = NULL; 180 static u32 nand_cache_off = (u32)-1; 181 182 static int read_nand_cached(u32 off, u32 size, u_char *buf) 183 { 184 struct mtdids *id = current_part->dev->id; 185 u32 bytes_read = 0; 186 size_t retlen; 187 int cpy_bytes; 188 189 while (bytes_read < size) { 190 if ((off + bytes_read < nand_cache_off) || 191 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) { 192 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK; 193 if (!nand_cache) { 194 /* This memory never gets freed but 'cause 195 it's a bootloader, nobody cares */ 196 nand_cache = malloc(NAND_CACHE_SIZE); 197 if (!nand_cache) { 198 printf("read_nand_cached: can't alloc cache size %d bytes\n", 199 NAND_CACHE_SIZE); 200 return -1; 201 } 202 } 203 204 #if defined(CFG_NAND_LEGACY) 205 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE, 206 &retlen, nand_cache, id->num) < 0 || 207 retlen != NAND_CACHE_SIZE) { 208 printf("read_nand_cached: error reading nand off %#x size %d bytes\n", 209 nand_cache_off, NAND_CACHE_SIZE); 210 return -1; 211 } 212 #else 213 retlen = NAND_CACHE_SIZE; 214 if (nand_read(&nand_info[id->num], nand_cache_off, 215 &retlen, nand_cache) != 0 || 216 retlen != NAND_CACHE_SIZE) { 217 printf("read_nand_cached: error reading nand off %#x size %d bytes\n", 218 nand_cache_off, NAND_CACHE_SIZE); 219 return -1; 220 } 221 #endif 222 } 223 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read); 224 if (cpy_bytes > size - bytes_read) 225 cpy_bytes = size - bytes_read; 226 memcpy(buf + bytes_read, 227 nand_cache + off + bytes_read - nand_cache_off, 228 cpy_bytes); 229 bytes_read += cpy_bytes; 230 } 231 return bytes_read; 232 } 233 234 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf) 235 { 236 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size); 237 238 if (NULL == buf) { 239 printf("get_fl_mem_nand: can't alloc %d bytes\n", size); 240 return NULL; 241 } 242 if (read_nand_cached(off, size, buf) < 0) { 243 if (!ext_buf) 244 free(buf); 245 return NULL; 246 } 247 248 return buf; 249 } 250 251 static void *get_node_mem_nand(u32 off) 252 { 253 struct jffs2_unknown_node node; 254 void *ret = NULL; 255 256 if (NULL == get_fl_mem_nand(off, sizeof(node), &node)) 257 return NULL; 258 259 if (!(ret = get_fl_mem_nand(off, node.magic == 260 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), 261 NULL))) { 262 printf("off = %#x magic %#x type %#x node.totlen = %d\n", 263 off, node.magic, node.nodetype, node.totlen); 264 } 265 return ret; 266 } 267 268 static void put_fl_mem_nand(void *buf) 269 { 270 free(buf); 271 } 272 #endif 273 274 275 #if defined(CONFIG_CMD_FLASH) 276 /* 277 * Support for jffs2 on top of NOR-flash 278 * 279 * NOR flash memory is mapped in processor's address space, 280 * just return address. 281 */ 282 static inline void *get_fl_mem_nor(u32 off) 283 { 284 u32 addr = off; 285 struct mtdids *id = current_part->dev->id; 286 287 extern flash_info_t flash_info[]; 288 flash_info_t *flash = &flash_info[id->num]; 289 290 addr += flash->start[0]; 291 return (void*)addr; 292 } 293 294 static inline void *get_node_mem_nor(u32 off) 295 { 296 return (void*)get_fl_mem_nor(off); 297 } 298 #endif 299 300 301 /* 302 * Generic jffs2 raw memory and node read routines. 303 * 304 */ 305 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf) 306 { 307 struct mtdids *id = current_part->dev->id; 308 309 #if defined(CONFIG_CMD_FLASH) 310 if (id->type == MTD_DEV_TYPE_NOR) 311 return get_fl_mem_nor(off); 312 #endif 313 314 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND) 315 if (id->type == MTD_DEV_TYPE_NAND) 316 return get_fl_mem_nand(off, size, ext_buf); 317 #endif 318 319 printf("get_fl_mem: unknown device type, using raw offset!\n"); 320 return (void*)off; 321 } 322 323 static inline void *get_node_mem(u32 off) 324 { 325 struct mtdids *id = current_part->dev->id; 326 327 #if defined(CONFIG_CMD_FLASH) 328 if (id->type == MTD_DEV_TYPE_NOR) 329 return get_node_mem_nor(off); 330 #endif 331 332 #if defined(CONFIG_JFFS2_NAND) && \ 333 defined(CONFIG_CMD_NAND) 334 if (id->type == MTD_DEV_TYPE_NAND) 335 return get_node_mem_nand(off); 336 #endif 337 338 printf("get_node_mem: unknown device type, using raw offset!\n"); 339 return (void*)off; 340 } 341 342 static inline void put_fl_mem(void *buf) 343 { 344 #if defined(CONFIG_JFFS2_NAND) && \ 345 defined(CONFIG_CMD_NAND) 346 struct mtdids *id = current_part->dev->id; 347 348 if (id->type == MTD_DEV_TYPE_NAND) 349 return put_fl_mem_nand(buf); 350 #endif 351 } 352 353 /* Compression names */ 354 static char *compr_names[] = { 355 "NONE", 356 "ZERO", 357 "RTIME", 358 "RUBINMIPS", 359 "COPY", 360 "DYNRUBIN", 361 "ZLIB", 362 #if defined(CONFIG_JFFS2_LZO_LZARI) 363 "LZO", 364 "LZARI", 365 #endif 366 }; 367 368 /* Spinning wheel */ 369 static char spinner[] = { '|', '/', '-', '\\' }; 370 371 /* Memory management */ 372 struct mem_block { 373 u32 index; 374 struct mem_block *next; 375 struct b_node nodes[NODE_CHUNK]; 376 }; 377 378 379 static void 380 free_nodes(struct b_list *list) 381 { 382 while (list->listMemBase != NULL) { 383 struct mem_block *next = list->listMemBase->next; 384 free( list->listMemBase ); 385 list->listMemBase = next; 386 } 387 } 388 389 static struct b_node * 390 add_node(struct b_list *list) 391 { 392 u32 index = 0; 393 struct mem_block *memBase; 394 struct b_node *b; 395 396 memBase = list->listMemBase; 397 if (memBase != NULL) 398 index = memBase->index; 399 #if 0 400 putLabeledWord("add_node: index = ", index); 401 putLabeledWord("add_node: memBase = ", list->listMemBase); 402 #endif 403 404 if (memBase == NULL || index >= NODE_CHUNK) { 405 /* we need more space before we continue */ 406 memBase = mmalloc(sizeof(struct mem_block)); 407 if (memBase == NULL) { 408 putstr("add_node: malloc failed\n"); 409 return NULL; 410 } 411 memBase->next = list->listMemBase; 412 index = 0; 413 #if 0 414 putLabeledWord("add_node: alloced a new membase at ", *memBase); 415 #endif 416 417 } 418 /* now we have room to add it. */ 419 b = &memBase->nodes[index]; 420 index ++; 421 422 memBase->index = index; 423 list->listMemBase = memBase; 424 list->listCount++; 425 return b; 426 } 427 428 static struct b_node * 429 insert_node(struct b_list *list, u32 offset) 430 { 431 struct b_node *new; 432 #ifdef CFG_JFFS2_SORT_FRAGMENTS 433 struct b_node *b, *prev; 434 #endif 435 436 if (!(new = add_node(list))) { 437 putstr("add_node failed!\r\n"); 438 return NULL; 439 } 440 new->offset = offset; 441 442 #ifdef CFG_JFFS2_SORT_FRAGMENTS 443 if (list->listTail != NULL && list->listCompare(new, list->listTail)) 444 prev = list->listTail; 445 else if (list->listLast != NULL && list->listCompare(new, list->listLast)) 446 prev = list->listLast; 447 else 448 prev = NULL; 449 450 for (b = (prev ? prev->next : list->listHead); 451 b != NULL && list->listCompare(new, b); 452 prev = b, b = b->next) { 453 list->listLoops++; 454 } 455 if (b != NULL) 456 list->listLast = prev; 457 458 if (b != NULL) { 459 new->next = b; 460 if (prev != NULL) 461 prev->next = new; 462 else 463 list->listHead = new; 464 } else 465 #endif 466 { 467 new->next = (struct b_node *) NULL; 468 if (list->listTail != NULL) { 469 list->listTail->next = new; 470 list->listTail = new; 471 } else { 472 list->listTail = list->listHead = new; 473 } 474 } 475 476 return new; 477 } 478 479 #ifdef CFG_JFFS2_SORT_FRAGMENTS 480 /* Sort data entries with the latest version last, so that if there 481 * is overlapping data the latest version will be used. 482 */ 483 static int compare_inodes(struct b_node *new, struct b_node *old) 484 { 485 struct jffs2_raw_inode ojNew; 486 struct jffs2_raw_inode ojOld; 487 struct jffs2_raw_inode *jNew = 488 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 489 struct jffs2_raw_inode *jOld = 490 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 491 492 return jNew->version > jOld->version; 493 } 494 495 /* Sort directory entries so all entries in the same directory 496 * with the same name are grouped together, with the latest version 497 * last. This makes it easy to eliminate all but the latest version 498 * by marking the previous version dead by setting the inode to 0. 499 */ 500 static int compare_dirents(struct b_node *new, struct b_node *old) 501 { 502 struct jffs2_raw_dirent ojNew; 503 struct jffs2_raw_dirent ojOld; 504 struct jffs2_raw_dirent *jNew = 505 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 506 struct jffs2_raw_dirent *jOld = 507 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 508 int cmp; 509 510 /* ascending sort by pino */ 511 if (jNew->pino != jOld->pino) 512 return jNew->pino > jOld->pino; 513 514 /* pino is the same, so use ascending sort by nsize, so 515 * we don't do strncmp unless we really must. 516 */ 517 if (jNew->nsize != jOld->nsize) 518 return jNew->nsize > jOld->nsize; 519 520 /* length is also the same, so use ascending sort by name 521 */ 522 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize); 523 if (cmp != 0) 524 return cmp > 0; 525 526 /* we have duplicate names in this directory, so use ascending 527 * sort by version 528 */ 529 if (jNew->version > jOld->version) { 530 /* since jNew is newer, we know jOld is not valid, so 531 * mark it with inode 0 and it will not be used 532 */ 533 jOld->ino = 0; 534 return 1; 535 } 536 537 return 0; 538 } 539 #endif 540 541 static u32 542 jffs2_scan_empty(u32 start_offset, struct part_info *part) 543 { 544 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode)); 545 char *offset = (char *)(part->offset + start_offset); 546 u32 off; 547 548 while (offset < max && 549 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) { 550 offset += sizeof(u32); 551 /* return if spinning is due */ 552 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break; 553 } 554 555 return (u32)offset - part->offset; 556 } 557 558 void 559 jffs2_free_cache(struct part_info *part) 560 { 561 struct b_lists *pL; 562 563 if (part->jffs2_priv != NULL) { 564 pL = (struct b_lists *)part->jffs2_priv; 565 free_nodes(&pL->frag); 566 free_nodes(&pL->dir); 567 free(pL); 568 } 569 } 570 571 static u32 572 jffs_init_1pass_list(struct part_info *part) 573 { 574 struct b_lists *pL; 575 576 jffs2_free_cache(part); 577 578 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) { 579 pL = (struct b_lists *)part->jffs2_priv; 580 581 memset(pL, 0, sizeof(*pL)); 582 #ifdef CFG_JFFS2_SORT_FRAGMENTS 583 pL->dir.listCompare = compare_dirents; 584 pL->frag.listCompare = compare_inodes; 585 #endif 586 } 587 return 0; 588 } 589 590 /* find the inode from the slashless name given a parent */ 591 static long 592 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest) 593 { 594 struct b_node *b; 595 struct jffs2_raw_inode *jNode; 596 u32 totalSize = 0; 597 u32 latestVersion = 0; 598 uchar *lDest; 599 uchar *src; 600 long ret; 601 int i; 602 u32 counter = 0; 603 #ifdef CFG_JFFS2_SORT_FRAGMENTS 604 /* Find file size before loading any data, so fragments that 605 * start past the end of file can be ignored. A fragment 606 * that is partially in the file is loaded, so extra data may 607 * be loaded up to the next 4K boundary above the file size. 608 * This shouldn't cause trouble when loading kernel images, so 609 * we will live with it. 610 */ 611 for (b = pL->frag.listHead; b != NULL; b = b->next) { 612 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 613 sizeof(struct jffs2_raw_inode), NULL); 614 if ((inode == jNode->ino)) { 615 /* get actual file length from the newest node */ 616 if (jNode->version >= latestVersion) { 617 totalSize = jNode->isize; 618 latestVersion = jNode->version; 619 } 620 } 621 put_fl_mem(jNode); 622 } 623 #endif 624 625 for (b = pL->frag.listHead; b != NULL; b = b->next) { 626 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset); 627 if ((inode == jNode->ino)) { 628 #if 0 629 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen); 630 putLabeledWord("read_inode: inode = ", jNode->ino); 631 putLabeledWord("read_inode: version = ", jNode->version); 632 putLabeledWord("read_inode: isize = ", jNode->isize); 633 putLabeledWord("read_inode: offset = ", jNode->offset); 634 putLabeledWord("read_inode: csize = ", jNode->csize); 635 putLabeledWord("read_inode: dsize = ", jNode->dsize); 636 putLabeledWord("read_inode: compr = ", jNode->compr); 637 putLabeledWord("read_inode: usercompr = ", jNode->usercompr); 638 putLabeledWord("read_inode: flags = ", jNode->flags); 639 #endif 640 641 #ifndef CFG_JFFS2_SORT_FRAGMENTS 642 /* get actual file length from the newest node */ 643 if (jNode->version >= latestVersion) { 644 totalSize = jNode->isize; 645 latestVersion = jNode->version; 646 } 647 #endif 648 649 if(dest) { 650 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode); 651 /* ignore data behind latest known EOF */ 652 if (jNode->offset > totalSize) { 653 put_fl_mem(jNode); 654 continue; 655 } 656 657 lDest = (uchar *) (dest + jNode->offset); 658 #if 0 659 putLabeledWord("read_inode: src = ", src); 660 putLabeledWord("read_inode: dest = ", lDest); 661 #endif 662 switch (jNode->compr) { 663 case JFFS2_COMPR_NONE: 664 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize); 665 break; 666 case JFFS2_COMPR_ZERO: 667 ret = 0; 668 for (i = 0; i < jNode->dsize; i++) 669 *(lDest++) = 0; 670 break; 671 case JFFS2_COMPR_RTIME: 672 ret = 0; 673 rtime_decompress(src, lDest, jNode->csize, jNode->dsize); 674 break; 675 case JFFS2_COMPR_DYNRUBIN: 676 /* this is slow but it works */ 677 ret = 0; 678 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize); 679 break; 680 case JFFS2_COMPR_ZLIB: 681 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize); 682 break; 683 #if defined(CONFIG_JFFS2_LZO_LZARI) 684 case JFFS2_COMPR_LZO: 685 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize); 686 break; 687 case JFFS2_COMPR_LZARI: 688 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize); 689 break; 690 #endif 691 default: 692 /* unknown */ 693 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr); 694 put_fl_mem(jNode); 695 return -1; 696 break; 697 } 698 } 699 700 #if 0 701 putLabeledWord("read_inode: totalSize = ", totalSize); 702 putLabeledWord("read_inode: compr ret = ", ret); 703 #endif 704 } 705 counter++; 706 put_fl_mem(jNode); 707 } 708 709 #if 0 710 putLabeledWord("read_inode: returning = ", totalSize); 711 #endif 712 return totalSize; 713 } 714 715 /* find the inode from the slashless name given a parent */ 716 static u32 717 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino) 718 { 719 struct b_node *b; 720 struct jffs2_raw_dirent *jDir; 721 int len; 722 u32 counter; 723 u32 version = 0; 724 u32 inode = 0; 725 726 /* name is assumed slash free */ 727 len = strlen(name); 728 729 counter = 0; 730 /* we need to search all and return the inode with the highest version */ 731 for(b = pL->dir.listHead; b; b = b->next, counter++) { 732 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset); 733 if ((pino == jDir->pino) && (len == jDir->nsize) && 734 (jDir->ino) && /* 0 for unlink */ 735 (!strncmp((char *)jDir->name, name, len))) { /* a match */ 736 if (jDir->version < version) { 737 put_fl_mem(jDir); 738 continue; 739 } 740 741 if (jDir->version == version && inode != 0) { 742 /* I'm pretty sure this isn't legal */ 743 putstr(" ** ERROR ** "); 744 putnstr(jDir->name, jDir->nsize); 745 putLabeledWord(" has dup version =", version); 746 } 747 inode = jDir->ino; 748 version = jDir->version; 749 } 750 #if 0 751 putstr("\r\nfind_inode:p&l ->"); 752 putnstr(jDir->name, jDir->nsize); 753 putstr("\r\n"); 754 putLabeledWord("pino = ", jDir->pino); 755 putLabeledWord("nsize = ", jDir->nsize); 756 putLabeledWord("b = ", (u32) b); 757 putLabeledWord("counter = ", counter); 758 #endif 759 put_fl_mem(jDir); 760 } 761 return inode; 762 } 763 764 char *mkmodestr(unsigned long mode, char *str) 765 { 766 static const char *l = "xwr"; 767 int mask = 1, i; 768 char c; 769 770 switch (mode & S_IFMT) { 771 case S_IFDIR: str[0] = 'd'; break; 772 case S_IFBLK: str[0] = 'b'; break; 773 case S_IFCHR: str[0] = 'c'; break; 774 case S_IFIFO: str[0] = 'f'; break; 775 case S_IFLNK: str[0] = 'l'; break; 776 case S_IFSOCK: str[0] = 's'; break; 777 case S_IFREG: str[0] = '-'; break; 778 default: str[0] = '?'; 779 } 780 781 for(i = 0; i < 9; i++) { 782 c = l[i%3]; 783 str[9-i] = (mode & mask)?c:'-'; 784 mask = mask<<1; 785 } 786 787 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S'; 788 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S'; 789 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T'; 790 str[10] = '\0'; 791 return str; 792 } 793 794 static inline void dump_stat(struct stat *st, const char *name) 795 { 796 char str[20]; 797 char s[64], *p; 798 799 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */ 800 st->st_mtime = 1; 801 802 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */ 803 804 if ((p = strchr(s,'\n')) != NULL) *p = '\0'; 805 if ((p = strchr(s,'\r')) != NULL) *p = '\0'; 806 807 /* 808 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str), 809 st->st_size, s, name); 810 */ 811 812 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name); 813 } 814 815 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i) 816 { 817 char fname[256]; 818 struct stat st; 819 820 if(!d || !i) return -1; 821 822 strncpy(fname, (char *)d->name, d->nsize); 823 fname[d->nsize] = '\0'; 824 825 memset(&st,0,sizeof(st)); 826 827 st.st_mtime = i->mtime; 828 st.st_mode = i->mode; 829 st.st_ino = i->ino; 830 831 /* neither dsize nor isize help us.. do it the long way */ 832 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL); 833 834 dump_stat(&st, fname); 835 836 if (d->type == DT_LNK) { 837 unsigned char *src = (unsigned char *) (&i[1]); 838 putstr(" -> "); 839 putnstr(src, (int)i->dsize); 840 } 841 842 putstr("\r\n"); 843 844 return 0; 845 } 846 847 /* list inodes with the given pino */ 848 static u32 849 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino) 850 { 851 struct b_node *b; 852 struct jffs2_raw_dirent *jDir; 853 854 for (b = pL->dir.listHead; b; b = b->next) { 855 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset); 856 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */ 857 u32 i_version = 0; 858 struct jffs2_raw_inode ojNode; 859 struct jffs2_raw_inode *jNode, *i = NULL; 860 struct b_node *b2 = pL->frag.listHead; 861 862 while (b2) { 863 jNode = (struct jffs2_raw_inode *) 864 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode); 865 if (jNode->ino == jDir->ino && jNode->version >= i_version) { 866 if (i) 867 put_fl_mem(i); 868 869 if (jDir->type == DT_LNK) 870 i = get_node_mem(b2->offset); 871 else 872 i = get_fl_mem(b2->offset, sizeof(*i), NULL); 873 } 874 b2 = b2->next; 875 } 876 877 dump_inode(pL, jDir, i); 878 put_fl_mem(i); 879 } 880 put_fl_mem(jDir); 881 } 882 return pino; 883 } 884 885 static u32 886 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino) 887 { 888 int i; 889 char tmp[256]; 890 char working_tmp[256]; 891 char *c; 892 893 /* discard any leading slash */ 894 i = 0; 895 while (fname[i] == '/') 896 i++; 897 strcpy(tmp, &fname[i]); 898 899 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 900 { 901 strncpy(working_tmp, tmp, c - tmp); 902 working_tmp[c - tmp] = '\0'; 903 #if 0 904 putstr("search_inode: tmp = "); 905 putstr(tmp); 906 putstr("\r\n"); 907 putstr("search_inode: wtmp = "); 908 putstr(working_tmp); 909 putstr("\r\n"); 910 putstr("search_inode: c = "); 911 putstr(c); 912 putstr("\r\n"); 913 #endif 914 for (i = 0; i < strlen(c) - 1; i++) 915 tmp[i] = c[i + 1]; 916 tmp[i] = '\0'; 917 #if 0 918 putstr("search_inode: post tmp = "); 919 putstr(tmp); 920 putstr("\r\n"); 921 #endif 922 923 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) { 924 putstr("find_inode failed for name="); 925 putstr(working_tmp); 926 putstr("\r\n"); 927 return 0; 928 } 929 } 930 /* this is for the bare filename, directories have already been mapped */ 931 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 932 putstr("find_inode failed for name="); 933 putstr(tmp); 934 putstr("\r\n"); 935 return 0; 936 } 937 return pino; 938 939 } 940 941 static u32 942 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino) 943 { 944 struct b_node *b; 945 struct b_node *b2; 946 struct jffs2_raw_dirent *jDir; 947 struct jffs2_raw_inode *jNode; 948 u8 jDirFoundType = 0; 949 u32 jDirFoundIno = 0; 950 u32 jDirFoundPino = 0; 951 char tmp[256]; 952 u32 version = 0; 953 u32 pino; 954 unsigned char *src; 955 956 /* we need to search all and return the inode with the highest version */ 957 for(b = pL->dir.listHead; b; b = b->next) { 958 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset); 959 if (ino == jDir->ino) { 960 if (jDir->version < version) { 961 put_fl_mem(jDir); 962 continue; 963 } 964 965 if (jDir->version == version && jDirFoundType) { 966 /* I'm pretty sure this isn't legal */ 967 putstr(" ** ERROR ** "); 968 putnstr(jDir->name, jDir->nsize); 969 putLabeledWord(" has dup version (resolve) = ", 970 version); 971 } 972 973 jDirFoundType = jDir->type; 974 jDirFoundIno = jDir->ino; 975 jDirFoundPino = jDir->pino; 976 version = jDir->version; 977 } 978 put_fl_mem(jDir); 979 } 980 /* now we found the right entry again. (shoulda returned inode*) */ 981 if (jDirFoundType != DT_LNK) 982 return jDirFoundIno; 983 984 /* it's a soft link so we follow it again. */ 985 b2 = pL->frag.listHead; 986 while (b2) { 987 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset); 988 if (jNode->ino == jDirFoundIno) { 989 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode); 990 991 #if 0 992 putLabeledWord("\t\t dsize = ", jNode->dsize); 993 putstr("\t\t target = "); 994 putnstr(src, jNode->dsize); 995 putstr("\r\n"); 996 #endif 997 strncpy(tmp, (char *)src, jNode->dsize); 998 tmp[jNode->dsize] = '\0'; 999 put_fl_mem(jNode); 1000 break; 1001 } 1002 b2 = b2->next; 1003 put_fl_mem(jNode); 1004 } 1005 /* ok so the name of the new file to find is in tmp */ 1006 /* if it starts with a slash it is root based else shared dirs */ 1007 if (tmp[0] == '/') 1008 pino = 1; 1009 else 1010 pino = jDirFoundPino; 1011 1012 return jffs2_1pass_search_inode(pL, tmp, pino); 1013 } 1014 1015 static u32 1016 jffs2_1pass_search_list_inodes(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 working_tmp[0] = '\0'; 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 for (i = 0; i < strlen(c) - 1; i++) 1034 tmp[i] = c[i + 1]; 1035 tmp[i] = '\0'; 1036 /* only a failure if we arent looking at top level */ 1037 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) && 1038 (working_tmp[0])) { 1039 putstr("find_inode failed for name="); 1040 putstr(working_tmp); 1041 putstr("\r\n"); 1042 return 0; 1043 } 1044 } 1045 1046 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 1047 putstr("find_inode failed for name="); 1048 putstr(tmp); 1049 putstr("\r\n"); 1050 return 0; 1051 } 1052 /* this is for the bare filename, directories have already been mapped */ 1053 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) { 1054 putstr("find_inode failed for name="); 1055 putstr(tmp); 1056 putstr("\r\n"); 1057 return 0; 1058 } 1059 return pino; 1060 1061 } 1062 1063 unsigned char 1064 jffs2_1pass_rescan_needed(struct part_info *part) 1065 { 1066 struct b_node *b; 1067 struct jffs2_unknown_node onode; 1068 struct jffs2_unknown_node *node; 1069 struct b_lists *pL = (struct b_lists *)part->jffs2_priv; 1070 1071 if (part->jffs2_priv == 0){ 1072 DEBUGF ("rescan: First time in use\n"); 1073 return 1; 1074 } 1075 1076 /* if we have no list, we need to rescan */ 1077 if (pL->frag.listCount == 0) { 1078 DEBUGF ("rescan: fraglist zero\n"); 1079 return 1; 1080 } 1081 1082 /* but suppose someone reflashed a partition at the same offset... */ 1083 b = pL->dir.listHead; 1084 while (b) { 1085 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset, 1086 sizeof(onode), &onode); 1087 if (node->nodetype != JFFS2_NODETYPE_DIRENT) { 1088 DEBUGF ("rescan: fs changed beneath me? (%lx)\n", 1089 (unsigned long) b->offset); 1090 return 1; 1091 } 1092 b = b->next; 1093 } 1094 return 0; 1095 } 1096 1097 #ifdef DEBUG_FRAGMENTS 1098 static void 1099 dump_fragments(struct b_lists *pL) 1100 { 1101 struct b_node *b; 1102 struct jffs2_raw_inode ojNode; 1103 struct jffs2_raw_inode *jNode; 1104 1105 putstr("\r\n\r\n******The fragment Entries******\r\n"); 1106 b = pL->frag.listHead; 1107 while (b) { 1108 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1109 sizeof(ojNode), &ojNode); 1110 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset); 1111 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen); 1112 putLabeledWord("\tbuild_list: inode = ", jNode->ino); 1113 putLabeledWord("\tbuild_list: version = ", jNode->version); 1114 putLabeledWord("\tbuild_list: isize = ", jNode->isize); 1115 putLabeledWord("\tbuild_list: atime = ", jNode->atime); 1116 putLabeledWord("\tbuild_list: offset = ", jNode->offset); 1117 putLabeledWord("\tbuild_list: csize = ", jNode->csize); 1118 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize); 1119 putLabeledWord("\tbuild_list: compr = ", jNode->compr); 1120 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr); 1121 putLabeledWord("\tbuild_list: flags = ", jNode->flags); 1122 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 1123 b = b->next; 1124 } 1125 } 1126 #endif 1127 1128 #ifdef DEBUG_DIRENTS 1129 static void 1130 dump_dirents(struct b_lists *pL) 1131 { 1132 struct b_node *b; 1133 struct jffs2_raw_dirent *jDir; 1134 1135 putstr("\r\n\r\n******The directory Entries******\r\n"); 1136 b = pL->dir.listHead; 1137 while (b) { 1138 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset); 1139 putstr("\r\n"); 1140 putnstr(jDir->name, jDir->nsize); 1141 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic); 1142 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype); 1143 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc); 1144 putLabeledWord("\tbuild_list: pino = ", jDir->pino); 1145 putLabeledWord("\tbuild_list: version = ", jDir->version); 1146 putLabeledWord("\tbuild_list: ino = ", jDir->ino); 1147 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime); 1148 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize); 1149 putLabeledWord("\tbuild_list: type = ", jDir->type); 1150 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc); 1151 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc); 1152 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 1153 b = b->next; 1154 put_fl_mem(jDir); 1155 } 1156 } 1157 #endif 1158 1159 static u32 1160 jffs2_1pass_build_lists(struct part_info * part) 1161 { 1162 struct b_lists *pL; 1163 struct jffs2_unknown_node *node; 1164 u32 offset, oldoffset = 0; 1165 u32 max = part->size - sizeof(struct jffs2_raw_inode); 1166 u32 counter = 0; 1167 u32 counter4 = 0; 1168 u32 counterF = 0; 1169 u32 counterN = 0; 1170 1171 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */ 1172 /* jffs2 list building enterprise nope. in newer versions the overhead is */ 1173 /* only about 5 %. not enough to inconvenience people for. */ 1174 /* lcd_off(); */ 1175 1176 /* if we are building a list we need to refresh the cache. */ 1177 jffs_init_1pass_list(part); 1178 pL = (struct b_lists *)part->jffs2_priv; 1179 offset = 0; 1180 puts ("Scanning JFFS2 FS: "); 1181 1182 /* start at the beginning of the partition */ 1183 while (offset < max) { 1184 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) { 1185 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]); 1186 oldoffset = offset; 1187 } 1188 1189 WATCHDOG_RESET(); 1190 1191 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset); 1192 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) { 1193 /* if its a fragment add it */ 1194 if (node->nodetype == JFFS2_NODETYPE_INODE && 1195 inode_crc((struct jffs2_raw_inode *) node) && 1196 data_crc((struct jffs2_raw_inode *) node)) { 1197 if (insert_node(&pL->frag, (u32) part->offset + 1198 offset) == NULL) { 1199 put_fl_mem(node); 1200 return 0; 1201 } 1202 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT && 1203 dirent_crc((struct jffs2_raw_dirent *) node) && 1204 dirent_name_crc((struct jffs2_raw_dirent *) node)) { 1205 if (! (counterN%100)) 1206 puts ("\b\b. "); 1207 if (insert_node(&pL->dir, (u32) part->offset + 1208 offset) == NULL) { 1209 put_fl_mem(node); 1210 return 0; 1211 } 1212 counterN++; 1213 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) { 1214 if (node->totlen != sizeof(struct jffs2_unknown_node)) 1215 printf("OOPS Cleanmarker has bad size " 1216 "%d != %d\n", node->totlen, 1217 sizeof(struct jffs2_unknown_node)); 1218 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) { 1219 if (node->totlen < sizeof(struct jffs2_unknown_node)) 1220 printf("OOPS Padding has bad size " 1221 "%d < %d\n", node->totlen, 1222 sizeof(struct jffs2_unknown_node)); 1223 } else { 1224 printf("Unknown node type: %x len %d " 1225 "offset 0x%x\n", node->nodetype, 1226 node->totlen, offset); 1227 } 1228 offset += ((node->totlen + 3) & ~3); 1229 counterF++; 1230 } else if (node->magic == JFFS2_EMPTY_BITMASK && 1231 node->nodetype == JFFS2_EMPTY_BITMASK) { 1232 offset = jffs2_scan_empty(offset, part); 1233 } else { /* if we know nothing, we just step and look. */ 1234 offset += 4; 1235 counter4++; 1236 } 1237 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */ 1238 put_fl_mem(node); 1239 } 1240 1241 putstr("\b\b done.\r\n"); /* close off the dots */ 1242 /* turn the lcd back on. */ 1243 /* splash(); */ 1244 1245 #if 0 1246 putLabeledWord("dir entries = ", pL->dir.listCount); 1247 putLabeledWord("frag entries = ", pL->frag.listCount); 1248 putLabeledWord("+4 increments = ", counter4); 1249 putLabeledWord("+file_offset increments = ", counterF); 1250 1251 #endif 1252 1253 #ifdef DEBUG_DIRENTS 1254 dump_dirents(pL); 1255 #endif 1256 1257 #ifdef DEBUG_FRAGMENTS 1258 dump_fragments(pL); 1259 #endif 1260 1261 /* give visual feedback that we are done scanning the flash */ 1262 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */ 1263 return 1; 1264 } 1265 1266 1267 static u32 1268 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL) 1269 { 1270 struct b_node *b; 1271 struct jffs2_raw_inode ojNode; 1272 struct jffs2_raw_inode *jNode; 1273 int i; 1274 1275 for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1276 piL->compr_info[i].num_frags = 0; 1277 piL->compr_info[i].compr_sum = 0; 1278 piL->compr_info[i].decompr_sum = 0; 1279 } 1280 1281 b = pL->frag.listHead; 1282 while (b) { 1283 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1284 sizeof(ojNode), &ojNode); 1285 if (jNode->compr < JFFS2_NUM_COMPR) { 1286 piL->compr_info[jNode->compr].num_frags++; 1287 piL->compr_info[jNode->compr].compr_sum += jNode->csize; 1288 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize; 1289 } 1290 b = b->next; 1291 } 1292 return 0; 1293 } 1294 1295 1296 static struct b_lists * 1297 jffs2_get_list(struct part_info * part, const char *who) 1298 { 1299 /* copy requested part_info struct pointer to global location */ 1300 current_part = part; 1301 1302 if (jffs2_1pass_rescan_needed(part)) { 1303 if (!jffs2_1pass_build_lists(part)) { 1304 printf("%s: Failed to scan JFFSv2 file structure\n", who); 1305 return NULL; 1306 } 1307 } 1308 return (struct b_lists *)part->jffs2_priv; 1309 } 1310 1311 1312 /* Print directory / file contents */ 1313 u32 1314 jffs2_1pass_ls(struct part_info * part, const char *fname) 1315 { 1316 struct b_lists *pl; 1317 long ret = 1; 1318 u32 inode; 1319 1320 if (! (pl = jffs2_get_list(part, "ls"))) 1321 return 0; 1322 1323 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) { 1324 putstr("ls: Failed to scan jffs2 file structure\r\n"); 1325 return 0; 1326 } 1327 1328 1329 #if 0 1330 putLabeledWord("found file at inode = ", inode); 1331 putLabeledWord("read_inode returns = ", ret); 1332 #endif 1333 1334 return ret; 1335 } 1336 1337 1338 /* Load a file from flash into memory. fname can be a full path */ 1339 u32 1340 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname) 1341 { 1342 1343 struct b_lists *pl; 1344 long ret = 1; 1345 u32 inode; 1346 1347 if (! (pl = jffs2_get_list(part, "load"))) 1348 return 0; 1349 1350 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) { 1351 putstr("load: Failed to find inode\r\n"); 1352 return 0; 1353 } 1354 1355 /* Resolve symlinks */ 1356 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) { 1357 putstr("load: Failed to resolve inode structure\r\n"); 1358 return 0; 1359 } 1360 1361 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) { 1362 putstr("load: Failed to read inode\r\n"); 1363 return 0; 1364 } 1365 1366 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname, 1367 (unsigned long) dest, ret); 1368 return ret; 1369 } 1370 1371 /* Return information about the fs on this partition */ 1372 u32 1373 jffs2_1pass_info(struct part_info * part) 1374 { 1375 struct b_jffs2_info info; 1376 struct b_lists *pl; 1377 int i; 1378 1379 if (! (pl = jffs2_get_list(part, "info"))) 1380 return 0; 1381 1382 jffs2_1pass_fill_info(pl, &info); 1383 for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1384 printf ("Compression: %s\n" 1385 "\tfrag count: %d\n" 1386 "\tcompressed sum: %d\n" 1387 "\tuncompressed sum: %d\n", 1388 compr_names[i], 1389 info.compr_info[i].num_frags, 1390 info.compr_info[i].compr_sum, 1391 info.compr_info[i].decompr_sum); 1392 } 1393 return 1; 1394 } 1395 1396 #endif 1397