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