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