1 /* 2 ------------------------------------------------------------------------- 3 * Filename: jffs2.c 4 * Version: $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $ 5 * Copyright: Copyright (C) 2001, Russ Dill 6 * Author: Russ Dill <Russ.Dill@asu.edu> 7 * Description: Module to load kernel from jffs2 8 *-----------------------------------------------------------------------*/ 9 /* 10 * some portions of this code are taken from jffs2, and as such, the 11 * following copyright notice is included. 12 * 13 * JFFS2 -- Journalling Flash File System, Version 2. 14 * 15 * Copyright (C) 2001 Red Hat, Inc. 16 * 17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com> 18 * 19 * The original JFFS, from which the design for JFFS2 was derived, 20 * was designed and implemented by Axis Communications AB. 21 * 22 * The contents of this file are subject to the Red Hat eCos Public 23 * License Version 1.1 (the "Licence"); you may not use this file 24 * except in compliance with the Licence. You may obtain a copy of 25 * the Licence at http://www.redhat.com/ 26 * 27 * Software distributed under the Licence is distributed on an "AS IS" 28 * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. 29 * See the Licence for the specific language governing rights and 30 * limitations under the Licence. 31 * 32 * The Original Code is JFFS2 - Journalling Flash File System, version 2 33 * 34 * Alternatively, the contents of this file may be used under the 35 * terms of the GNU General Public License version 2 (the "GPL"), in 36 * which case the provisions of the GPL are applicable instead of the 37 * above. If you wish to allow the use of your version of this file 38 * only under the terms of the GPL and not to allow others to use your 39 * version of this file under the RHEPL, indicate your decision by 40 * deleting the provisions above and replace them with the notice and 41 * other provisions required by the GPL. If you do not delete the 42 * provisions above, a recipient may use your version of this file 43 * under either the RHEPL or the GPL. 44 * 45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $ 46 * 47 */ 48 49 /* Ok, so anyone who knows the jffs2 code will probably want to get a papar 50 * bag to throw up into before reading this code. I looked through the jffs2 51 * code, the caching scheme is very elegant. I tried to keep the version 52 * for a bootloader as small and simple as possible. Instead of worring about 53 * unneccesary data copies, node scans, etc, I just optimized for the known 54 * common case, a kernel, which looks like: 55 * (1) most pages are 4096 bytes 56 * (2) version numbers are somewhat sorted in acsending order 57 * (3) multiple compressed blocks making up one page is uncommon 58 * 59 * So I create a linked list of decending version numbers (insertions at the 60 * head), and then for each page, walk down the list, until a matching page 61 * with 4096 bytes is found, and then decompress the watching pages in 62 * reverse order. 63 * 64 */ 65 66 /* 67 * Adapted by Nye Liu <nyet@zumanetworks.com> and 68 * Rex Feany <rfeany@zumanetworks.com> 69 * on Jan/2002 for U-Boot. 70 * 71 * Clipped out all the non-1pass functions, cleaned up warnings, 72 * wrappers, etc. No major changes to the code. 73 * Please, he really means it when he said have a paper bag 74 * handy. We needed it ;). 75 * 76 */ 77 78 /* 79 * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003 80 * 81 * - overhaul of the memory management. Removed much of the "paper-bagging" 82 * in that part of the code, fixed several bugs, now frees memory when 83 * partition is changed. 84 * It's still ugly :-( 85 * - fixed a bug in jffs2_1pass_read_inode where the file length calculation 86 * was incorrect. Removed a bit of the paper-bagging as well. 87 * - removed double crc calculation for fragment headers in jffs2_private.h 88 * for speedup. 89 * - scan_empty rewritten in a more "standard" manner (non-paperbag, that is). 90 * - spinning wheel now spins depending on how much memory has been scanned 91 * - lots of small changes all over the place to "improve" readability. 92 * - implemented fragment sorting to ensure that the newest data is copied 93 * if there are multiple copies of fragments for a certain file offset. 94 * 95 * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS. 96 * Sorting is done while adding fragments to the lists, which is more or less a 97 * bubble sort. This takes a lot of time, and is most probably not an issue if 98 * the boot filesystem is always mounted readonly. 99 * 100 * You should define it if the boot filesystem is mounted writable, and updates 101 * to the boot files are done by copying files to that filesystem. 102 * 103 * 104 * There's a big issue left: endianess is completely ignored in this code. Duh! 105 * 106 * 107 * You still should have paper bags at hand :-(. The code lacks more or less 108 * any comment, and is still arcane and difficult to read in places. As this 109 * might be incompatible with any new code from the jffs2 maintainers anyway, 110 * it should probably be dumped and replaced by something like jffs2reader! 111 */ 112 113 114 #include <common.h> 115 #include <config.h> 116 #include <malloc.h> 117 #include <linux/stat.h> 118 #include <linux/time.h> 119 #include <watchdog.h> 120 #include <jffs2/jffs2.h> 121 #include <jffs2/jffs2_1pass.h> 122 #include <linux/mtd/compat.h> 123 124 #include "jffs2_private.h" 125 126 127 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */ 128 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */ 129 130 /* Debugging switches */ 131 #undef DEBUG_DIRENTS /* print directory entry list after scan */ 132 #undef DEBUG_FRAGMENTS /* print fragment list after scan */ 133 #undef DEBUG /* enable debugging messages */ 134 135 136 #ifdef DEBUG 137 # define DEBUGF(fmt,args...) printf(fmt ,##args) 138 #else 139 # define DEBUGF(fmt,args...) 140 #endif 141 142 #include "summary.h" 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(CONFIG_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(CONFIG_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(CONFIG_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, void *ext_buf) 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 ext_buf))) { 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 #if defined(CONFIG_CMD_ONENAND) 275 276 #include <linux/mtd/mtd.h> 277 #include <linux/mtd/onenand.h> 278 #include <onenand_uboot.h> 279 280 #define ONENAND_PAGE_SIZE 2048 281 #define ONENAND_PAGE_SHIFT 11 282 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1)) 283 284 #ifndef ONENAND_CACHE_PAGES 285 #define ONENAND_CACHE_PAGES 4 286 #endif 287 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE) 288 289 static u8* onenand_cache; 290 static u32 onenand_cache_off = (u32)-1; 291 292 static int read_onenand_cached(u32 off, u32 size, u_char *buf) 293 { 294 u32 bytes_read = 0; 295 size_t retlen; 296 int cpy_bytes; 297 298 while (bytes_read < size) { 299 if ((off + bytes_read < onenand_cache_off) || 300 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) { 301 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK; 302 if (!onenand_cache) { 303 /* This memory never gets freed but 'cause 304 it's a bootloader, nobody cares */ 305 onenand_cache = malloc(ONENAND_CACHE_SIZE); 306 if (!onenand_cache) { 307 printf("read_onenand_cached: can't alloc cache size %d bytes\n", 308 ONENAND_CACHE_SIZE); 309 return -1; 310 } 311 } 312 313 retlen = ONENAND_CACHE_SIZE; 314 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen, 315 &retlen, onenand_cache) != 0 || 316 retlen != ONENAND_CACHE_SIZE) { 317 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n", 318 onenand_cache_off, ONENAND_CACHE_SIZE); 319 return -1; 320 } 321 } 322 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read); 323 if (cpy_bytes > size - bytes_read) 324 cpy_bytes = size - bytes_read; 325 memcpy(buf + bytes_read, 326 onenand_cache + off + bytes_read - onenand_cache_off, 327 cpy_bytes); 328 bytes_read += cpy_bytes; 329 } 330 return bytes_read; 331 } 332 333 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf) 334 { 335 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size); 336 337 if (NULL == buf) { 338 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size); 339 return NULL; 340 } 341 if (read_onenand_cached(off, size, buf) < 0) { 342 if (!ext_buf) 343 free(buf); 344 return NULL; 345 } 346 347 return buf; 348 } 349 350 static void *get_node_mem_onenand(u32 off, void *ext_buf) 351 { 352 struct jffs2_unknown_node node; 353 void *ret = NULL; 354 355 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node)) 356 return NULL; 357 358 ret = get_fl_mem_onenand(off, node.magic == 359 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node), 360 ext_buf); 361 if (!ret) { 362 printf("off = %#x magic %#x type %#x node.totlen = %d\n", 363 off, node.magic, node.nodetype, node.totlen); 364 } 365 return ret; 366 } 367 368 369 static void put_fl_mem_onenand(void *buf) 370 { 371 free(buf); 372 } 373 #endif 374 375 376 #if defined(CONFIG_CMD_FLASH) 377 /* 378 * Support for jffs2 on top of NOR-flash 379 * 380 * NOR flash memory is mapped in processor's address space, 381 * just return address. 382 */ 383 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf) 384 { 385 u32 addr = off; 386 struct mtdids *id = current_part->dev->id; 387 388 extern flash_info_t flash_info[]; 389 flash_info_t *flash = &flash_info[id->num]; 390 391 addr += flash->start[0]; 392 if (ext_buf) { 393 memcpy(ext_buf, (void *)addr, size); 394 return ext_buf; 395 } 396 return (void*)addr; 397 } 398 399 static inline void *get_node_mem_nor(u32 off, void *ext_buf) 400 { 401 struct jffs2_unknown_node *pNode; 402 403 /* pNode will point directly to flash - don't provide external buffer 404 and don't care about size */ 405 pNode = get_fl_mem_nor(off, 0, NULL); 406 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ? 407 pNode->totlen : sizeof(*pNode), ext_buf); 408 } 409 #endif 410 411 412 /* 413 * Generic jffs2 raw memory and node read routines. 414 * 415 */ 416 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf) 417 { 418 struct mtdids *id = current_part->dev->id; 419 420 #if defined(CONFIG_CMD_FLASH) 421 if (id->type == MTD_DEV_TYPE_NOR) { 422 return get_fl_mem_nor(off, size, ext_buf); 423 } 424 #endif 425 426 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND) 427 if (id->type == MTD_DEV_TYPE_NAND) 428 return get_fl_mem_nand(off, size, ext_buf); 429 #endif 430 431 #if defined(CONFIG_CMD_ONENAND) 432 if (id->type == MTD_DEV_TYPE_ONENAND) 433 return get_fl_mem_onenand(off, size, ext_buf); 434 #endif 435 436 printf("get_fl_mem: unknown device type, using raw offset!\n"); 437 return (void*)off; 438 } 439 440 static inline void *get_node_mem(u32 off, void *ext_buf) 441 { 442 struct mtdids *id = current_part->dev->id; 443 444 #if defined(CONFIG_CMD_FLASH) 445 if (id->type == MTD_DEV_TYPE_NOR) 446 return get_node_mem_nor(off, ext_buf); 447 #endif 448 449 #if defined(CONFIG_JFFS2_NAND) && \ 450 defined(CONFIG_CMD_NAND) 451 if (id->type == MTD_DEV_TYPE_NAND) 452 return get_node_mem_nand(off, ext_buf); 453 #endif 454 455 #if defined(CONFIG_CMD_ONENAND) 456 if (id->type == MTD_DEV_TYPE_ONENAND) 457 return get_node_mem_onenand(off, ext_buf); 458 #endif 459 460 printf("get_node_mem: unknown device type, using raw offset!\n"); 461 return (void*)off; 462 } 463 464 static inline void put_fl_mem(void *buf, void *ext_buf) 465 { 466 struct mtdids *id = current_part->dev->id; 467 468 /* If buf is the same as ext_buf, it was provided by the caller - 469 we shouldn't free it then. */ 470 if (buf == ext_buf) 471 return; 472 switch (id->type) { 473 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND) 474 case MTD_DEV_TYPE_NAND: 475 return put_fl_mem_nand(buf); 476 #endif 477 #if defined(CONFIG_CMD_ONENAND) 478 case MTD_DEV_TYPE_ONENAND: 479 return put_fl_mem_onenand(buf); 480 #endif 481 } 482 } 483 484 /* Compression names */ 485 static char *compr_names[] = { 486 "NONE", 487 "ZERO", 488 "RTIME", 489 "RUBINMIPS", 490 "COPY", 491 "DYNRUBIN", 492 "ZLIB", 493 #if defined(CONFIG_JFFS2_LZO_LZARI) 494 "LZO", 495 "LZARI", 496 #endif 497 }; 498 499 /* Memory management */ 500 struct mem_block { 501 u32 index; 502 struct mem_block *next; 503 struct b_node nodes[NODE_CHUNK]; 504 }; 505 506 507 static void 508 free_nodes(struct b_list *list) 509 { 510 while (list->listMemBase != NULL) { 511 struct mem_block *next = list->listMemBase->next; 512 free( list->listMemBase ); 513 list->listMemBase = next; 514 } 515 } 516 517 static struct b_node * 518 add_node(struct b_list *list) 519 { 520 u32 index = 0; 521 struct mem_block *memBase; 522 struct b_node *b; 523 524 memBase = list->listMemBase; 525 if (memBase != NULL) 526 index = memBase->index; 527 #if 0 528 putLabeledWord("add_node: index = ", index); 529 putLabeledWord("add_node: memBase = ", list->listMemBase); 530 #endif 531 532 if (memBase == NULL || index >= NODE_CHUNK) { 533 /* we need more space before we continue */ 534 memBase = mmalloc(sizeof(struct mem_block)); 535 if (memBase == NULL) { 536 putstr("add_node: malloc failed\n"); 537 return NULL; 538 } 539 memBase->next = list->listMemBase; 540 index = 0; 541 #if 0 542 putLabeledWord("add_node: alloced a new membase at ", *memBase); 543 #endif 544 545 } 546 /* now we have room to add it. */ 547 b = &memBase->nodes[index]; 548 index ++; 549 550 memBase->index = index; 551 list->listMemBase = memBase; 552 list->listCount++; 553 return b; 554 } 555 556 static struct b_node * 557 insert_node(struct b_list *list, u32 offset) 558 { 559 struct b_node *new; 560 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 561 struct b_node *b, *prev; 562 #endif 563 564 if (!(new = add_node(list))) { 565 putstr("add_node failed!\r\n"); 566 return NULL; 567 } 568 new->offset = offset; 569 570 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 571 if (list->listTail != NULL && list->listCompare(new, list->listTail)) 572 prev = list->listTail; 573 else if (list->listLast != NULL && list->listCompare(new, list->listLast)) 574 prev = list->listLast; 575 else 576 prev = NULL; 577 578 for (b = (prev ? prev->next : list->listHead); 579 b != NULL && list->listCompare(new, b); 580 prev = b, b = b->next) { 581 list->listLoops++; 582 } 583 if (b != NULL) 584 list->listLast = prev; 585 586 if (b != NULL) { 587 new->next = b; 588 if (prev != NULL) 589 prev->next = new; 590 else 591 list->listHead = new; 592 } else 593 #endif 594 { 595 new->next = (struct b_node *) NULL; 596 if (list->listTail != NULL) { 597 list->listTail->next = new; 598 list->listTail = new; 599 } else { 600 list->listTail = list->listHead = new; 601 } 602 } 603 604 return new; 605 } 606 607 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 608 /* Sort data entries with the latest version last, so that if there 609 * is overlapping data the latest version will be used. 610 */ 611 static int compare_inodes(struct b_node *new, struct b_node *old) 612 { 613 struct jffs2_raw_inode ojNew; 614 struct jffs2_raw_inode ojOld; 615 struct jffs2_raw_inode *jNew = 616 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 617 struct jffs2_raw_inode *jOld = 618 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 619 620 return jNew->version > jOld->version; 621 } 622 623 /* Sort directory entries so all entries in the same directory 624 * with the same name are grouped together, with the latest version 625 * last. This makes it easy to eliminate all but the latest version 626 * by marking the previous version dead by setting the inode to 0. 627 */ 628 static int compare_dirents(struct b_node *new, struct b_node *old) 629 { 630 struct jffs2_raw_dirent ojNew; 631 struct jffs2_raw_dirent ojOld; 632 struct jffs2_raw_dirent *jNew = 633 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew); 634 struct jffs2_raw_dirent *jOld = 635 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld); 636 int cmp; 637 638 /* ascending sort by pino */ 639 if (jNew->pino != jOld->pino) 640 return jNew->pino > jOld->pino; 641 642 /* pino is the same, so use ascending sort by nsize, so 643 * we don't do strncmp unless we really must. 644 */ 645 if (jNew->nsize != jOld->nsize) 646 return jNew->nsize > jOld->nsize; 647 648 /* length is also the same, so use ascending sort by name 649 */ 650 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize); 651 if (cmp != 0) 652 return cmp > 0; 653 654 /* we have duplicate names in this directory, so use ascending 655 * sort by version 656 */ 657 if (jNew->version > jOld->version) { 658 /* since jNew is newer, we know jOld is not valid, so 659 * mark it with inode 0 and it will not be used 660 */ 661 jOld->ino = 0; 662 return 1; 663 } 664 665 return 0; 666 } 667 #endif 668 669 void 670 jffs2_free_cache(struct part_info *part) 671 { 672 struct b_lists *pL; 673 674 if (part->jffs2_priv != NULL) { 675 pL = (struct b_lists *)part->jffs2_priv; 676 free_nodes(&pL->frag); 677 free_nodes(&pL->dir); 678 free(pL->readbuf); 679 free(pL); 680 } 681 } 682 683 static u32 684 jffs_init_1pass_list(struct part_info *part) 685 { 686 struct b_lists *pL; 687 688 jffs2_free_cache(part); 689 690 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) { 691 pL = (struct b_lists *)part->jffs2_priv; 692 693 memset(pL, 0, sizeof(*pL)); 694 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 695 pL->dir.listCompare = compare_dirents; 696 pL->frag.listCompare = compare_inodes; 697 #endif 698 } 699 return 0; 700 } 701 702 /* find the inode from the slashless name given a parent */ 703 static long 704 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest) 705 { 706 struct b_node *b; 707 struct jffs2_raw_inode *jNode; 708 u32 totalSize = 0; 709 u32 latestVersion = 0; 710 uchar *lDest; 711 uchar *src; 712 long ret; 713 int i; 714 u32 counter = 0; 715 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 716 /* Find file size before loading any data, so fragments that 717 * start past the end of file can be ignored. A fragment 718 * that is partially in the file is loaded, so extra data may 719 * be loaded up to the next 4K boundary above the file size. 720 * This shouldn't cause trouble when loading kernel images, so 721 * we will live with it. 722 */ 723 for (b = pL->frag.listHead; b != NULL; b = b->next) { 724 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 725 sizeof(struct jffs2_raw_inode), pL->readbuf); 726 if ((inode == jNode->ino)) { 727 /* get actual file length from the newest node */ 728 if (jNode->version >= latestVersion) { 729 totalSize = jNode->isize; 730 latestVersion = jNode->version; 731 } 732 } 733 put_fl_mem(jNode, pL->readbuf); 734 } 735 #endif 736 737 for (b = pL->frag.listHead; b != NULL; b = b->next) { 738 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset, 739 pL->readbuf); 740 if ((inode == jNode->ino)) { 741 #if 0 742 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen); 743 putLabeledWord("read_inode: inode = ", jNode->ino); 744 putLabeledWord("read_inode: version = ", jNode->version); 745 putLabeledWord("read_inode: isize = ", jNode->isize); 746 putLabeledWord("read_inode: offset = ", jNode->offset); 747 putLabeledWord("read_inode: csize = ", jNode->csize); 748 putLabeledWord("read_inode: dsize = ", jNode->dsize); 749 putLabeledWord("read_inode: compr = ", jNode->compr); 750 putLabeledWord("read_inode: usercompr = ", jNode->usercompr); 751 putLabeledWord("read_inode: flags = ", jNode->flags); 752 #endif 753 754 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS 755 /* get actual file length from the newest node */ 756 if (jNode->version >= latestVersion) { 757 totalSize = jNode->isize; 758 latestVersion = jNode->version; 759 } 760 #endif 761 762 if(dest) { 763 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode); 764 /* ignore data behind latest known EOF */ 765 if (jNode->offset > totalSize) { 766 put_fl_mem(jNode, pL->readbuf); 767 continue; 768 } 769 if (b->datacrc == CRC_UNKNOWN) 770 b->datacrc = data_crc(jNode) ? 771 CRC_OK : CRC_BAD; 772 if (b->datacrc == CRC_BAD) { 773 put_fl_mem(jNode, pL->readbuf); 774 continue; 775 } 776 777 lDest = (uchar *) (dest + jNode->offset); 778 #if 0 779 putLabeledWord("read_inode: src = ", src); 780 putLabeledWord("read_inode: dest = ", lDest); 781 #endif 782 switch (jNode->compr) { 783 case JFFS2_COMPR_NONE: 784 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize); 785 break; 786 case JFFS2_COMPR_ZERO: 787 ret = 0; 788 for (i = 0; i < jNode->dsize; i++) 789 *(lDest++) = 0; 790 break; 791 case JFFS2_COMPR_RTIME: 792 ret = 0; 793 rtime_decompress(src, lDest, jNode->csize, jNode->dsize); 794 break; 795 case JFFS2_COMPR_DYNRUBIN: 796 /* this is slow but it works */ 797 ret = 0; 798 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize); 799 break; 800 case JFFS2_COMPR_ZLIB: 801 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize); 802 break; 803 #if defined(CONFIG_JFFS2_LZO_LZARI) 804 case JFFS2_COMPR_LZO: 805 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize); 806 break; 807 case JFFS2_COMPR_LZARI: 808 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize); 809 break; 810 #endif 811 default: 812 /* unknown */ 813 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr); 814 put_fl_mem(jNode, pL->readbuf); 815 return -1; 816 break; 817 } 818 } 819 820 #if 0 821 putLabeledWord("read_inode: totalSize = ", totalSize); 822 putLabeledWord("read_inode: compr ret = ", ret); 823 #endif 824 } 825 counter++; 826 put_fl_mem(jNode, pL->readbuf); 827 } 828 829 #if 0 830 putLabeledWord("read_inode: returning = ", totalSize); 831 #endif 832 return totalSize; 833 } 834 835 /* find the inode from the slashless name given a parent */ 836 static u32 837 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino) 838 { 839 struct b_node *b; 840 struct jffs2_raw_dirent *jDir; 841 int len; 842 u32 counter; 843 u32 version = 0; 844 u32 inode = 0; 845 846 /* name is assumed slash free */ 847 len = strlen(name); 848 849 counter = 0; 850 /* we need to search all and return the inode with the highest version */ 851 for(b = pL->dir.listHead; b; b = b->next, counter++) { 852 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 853 pL->readbuf); 854 if ((pino == jDir->pino) && (len == jDir->nsize) && 855 (jDir->ino) && /* 0 for unlink */ 856 (!strncmp((char *)jDir->name, name, len))) { /* a match */ 857 if (jDir->version < version) { 858 put_fl_mem(jDir, pL->readbuf); 859 continue; 860 } 861 862 if (jDir->version == version && inode != 0) { 863 /* I'm pretty sure this isn't legal */ 864 putstr(" ** ERROR ** "); 865 putnstr(jDir->name, jDir->nsize); 866 putLabeledWord(" has dup version =", version); 867 } 868 inode = jDir->ino; 869 version = jDir->version; 870 } 871 #if 0 872 putstr("\r\nfind_inode:p&l ->"); 873 putnstr(jDir->name, jDir->nsize); 874 putstr("\r\n"); 875 putLabeledWord("pino = ", jDir->pino); 876 putLabeledWord("nsize = ", jDir->nsize); 877 putLabeledWord("b = ", (u32) b); 878 putLabeledWord("counter = ", counter); 879 #endif 880 put_fl_mem(jDir, pL->readbuf); 881 } 882 return inode; 883 } 884 885 char *mkmodestr(unsigned long mode, char *str) 886 { 887 static const char *l = "xwr"; 888 int mask = 1, i; 889 char c; 890 891 switch (mode & S_IFMT) { 892 case S_IFDIR: str[0] = 'd'; break; 893 case S_IFBLK: str[0] = 'b'; break; 894 case S_IFCHR: str[0] = 'c'; break; 895 case S_IFIFO: str[0] = 'f'; break; 896 case S_IFLNK: str[0] = 'l'; break; 897 case S_IFSOCK: str[0] = 's'; break; 898 case S_IFREG: str[0] = '-'; break; 899 default: str[0] = '?'; 900 } 901 902 for(i = 0; i < 9; i++) { 903 c = l[i%3]; 904 str[9-i] = (mode & mask)?c:'-'; 905 mask = mask<<1; 906 } 907 908 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S'; 909 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S'; 910 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T'; 911 str[10] = '\0'; 912 return str; 913 } 914 915 static inline void dump_stat(struct stat *st, const char *name) 916 { 917 char str[20]; 918 char s[64], *p; 919 920 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */ 921 st->st_mtime = 1; 922 923 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */ 924 925 if ((p = strchr(s,'\n')) != NULL) *p = '\0'; 926 if ((p = strchr(s,'\r')) != NULL) *p = '\0'; 927 928 /* 929 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str), 930 st->st_size, s, name); 931 */ 932 933 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name); 934 } 935 936 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i) 937 { 938 char fname[256]; 939 struct stat st; 940 941 if(!d || !i) return -1; 942 943 strncpy(fname, (char *)d->name, d->nsize); 944 fname[d->nsize] = '\0'; 945 946 memset(&st,0,sizeof(st)); 947 948 st.st_mtime = i->mtime; 949 st.st_mode = i->mode; 950 st.st_ino = i->ino; 951 st.st_size = i->isize; 952 953 dump_stat(&st, fname); 954 955 if (d->type == DT_LNK) { 956 unsigned char *src = (unsigned char *) (&i[1]); 957 putstr(" -> "); 958 putnstr(src, (int)i->dsize); 959 } 960 961 putstr("\r\n"); 962 963 return 0; 964 } 965 966 /* list inodes with the given pino */ 967 static u32 968 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino) 969 { 970 struct b_node *b; 971 struct jffs2_raw_dirent *jDir; 972 973 for (b = pL->dir.listHead; b; b = b->next) { 974 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 975 pL->readbuf); 976 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */ 977 u32 i_version = 0; 978 struct jffs2_raw_inode ojNode; 979 struct jffs2_raw_inode *jNode, *i = NULL; 980 struct b_node *b2 = pL->frag.listHead; 981 982 while (b2) { 983 jNode = (struct jffs2_raw_inode *) 984 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode); 985 if (jNode->ino == jDir->ino && jNode->version >= i_version) { 986 i_version = jNode->version; 987 if (i) 988 put_fl_mem(i, NULL); 989 990 if (jDir->type == DT_LNK) 991 i = get_node_mem(b2->offset, 992 NULL); 993 else 994 i = get_fl_mem(b2->offset, 995 sizeof(*i), 996 NULL); 997 } 998 b2 = b2->next; 999 } 1000 1001 dump_inode(pL, jDir, i); 1002 put_fl_mem(i, NULL); 1003 } 1004 put_fl_mem(jDir, pL->readbuf); 1005 } 1006 return pino; 1007 } 1008 1009 static u32 1010 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino) 1011 { 1012 int i; 1013 char tmp[256]; 1014 char working_tmp[256]; 1015 char *c; 1016 1017 /* discard any leading slash */ 1018 i = 0; 1019 while (fname[i] == '/') 1020 i++; 1021 strcpy(tmp, &fname[i]); 1022 1023 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 1024 { 1025 strncpy(working_tmp, tmp, c - tmp); 1026 working_tmp[c - tmp] = '\0'; 1027 #if 0 1028 putstr("search_inode: tmp = "); 1029 putstr(tmp); 1030 putstr("\r\n"); 1031 putstr("search_inode: wtmp = "); 1032 putstr(working_tmp); 1033 putstr("\r\n"); 1034 putstr("search_inode: c = "); 1035 putstr(c); 1036 putstr("\r\n"); 1037 #endif 1038 for (i = 0; i < strlen(c) - 1; i++) 1039 tmp[i] = c[i + 1]; 1040 tmp[i] = '\0'; 1041 #if 0 1042 putstr("search_inode: post tmp = "); 1043 putstr(tmp); 1044 putstr("\r\n"); 1045 #endif 1046 1047 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) { 1048 putstr("find_inode failed for name="); 1049 putstr(working_tmp); 1050 putstr("\r\n"); 1051 return 0; 1052 } 1053 } 1054 /* this is for the bare filename, directories have already been mapped */ 1055 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 1056 putstr("find_inode failed for name="); 1057 putstr(tmp); 1058 putstr("\r\n"); 1059 return 0; 1060 } 1061 return pino; 1062 1063 } 1064 1065 static u32 1066 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino) 1067 { 1068 struct b_node *b; 1069 struct b_node *b2; 1070 struct jffs2_raw_dirent *jDir; 1071 struct jffs2_raw_inode *jNode; 1072 u8 jDirFoundType = 0; 1073 u32 jDirFoundIno = 0; 1074 u32 jDirFoundPino = 0; 1075 char tmp[256]; 1076 u32 version = 0; 1077 u32 pino; 1078 unsigned char *src; 1079 1080 /* we need to search all and return the inode with the highest version */ 1081 for(b = pL->dir.listHead; b; b = b->next) { 1082 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 1083 pL->readbuf); 1084 if (ino == jDir->ino) { 1085 if (jDir->version < version) { 1086 put_fl_mem(jDir, pL->readbuf); 1087 continue; 1088 } 1089 1090 if (jDir->version == version && jDirFoundType) { 1091 /* I'm pretty sure this isn't legal */ 1092 putstr(" ** ERROR ** "); 1093 putnstr(jDir->name, jDir->nsize); 1094 putLabeledWord(" has dup version (resolve) = ", 1095 version); 1096 } 1097 1098 jDirFoundType = jDir->type; 1099 jDirFoundIno = jDir->ino; 1100 jDirFoundPino = jDir->pino; 1101 version = jDir->version; 1102 } 1103 put_fl_mem(jDir, pL->readbuf); 1104 } 1105 /* now we found the right entry again. (shoulda returned inode*) */ 1106 if (jDirFoundType != DT_LNK) 1107 return jDirFoundIno; 1108 1109 /* it's a soft link so we follow it again. */ 1110 b2 = pL->frag.listHead; 1111 while (b2) { 1112 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset, 1113 pL->readbuf); 1114 if (jNode->ino == jDirFoundIno) { 1115 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode); 1116 1117 #if 0 1118 putLabeledWord("\t\t dsize = ", jNode->dsize); 1119 putstr("\t\t target = "); 1120 putnstr(src, jNode->dsize); 1121 putstr("\r\n"); 1122 #endif 1123 strncpy(tmp, (char *)src, jNode->dsize); 1124 tmp[jNode->dsize] = '\0'; 1125 put_fl_mem(jNode, pL->readbuf); 1126 break; 1127 } 1128 b2 = b2->next; 1129 put_fl_mem(jNode, pL->readbuf); 1130 } 1131 /* ok so the name of the new file to find is in tmp */ 1132 /* if it starts with a slash it is root based else shared dirs */ 1133 if (tmp[0] == '/') 1134 pino = 1; 1135 else 1136 pino = jDirFoundPino; 1137 1138 return jffs2_1pass_search_inode(pL, tmp, pino); 1139 } 1140 1141 static u32 1142 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino) 1143 { 1144 int i; 1145 char tmp[256]; 1146 char working_tmp[256]; 1147 char *c; 1148 1149 /* discard any leading slash */ 1150 i = 0; 1151 while (fname[i] == '/') 1152 i++; 1153 strcpy(tmp, &fname[i]); 1154 working_tmp[0] = '\0'; 1155 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 1156 { 1157 strncpy(working_tmp, tmp, c - tmp); 1158 working_tmp[c - tmp] = '\0'; 1159 for (i = 0; i < strlen(c) - 1; i++) 1160 tmp[i] = c[i + 1]; 1161 tmp[i] = '\0'; 1162 /* only a failure if we arent looking at top level */ 1163 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) && 1164 (working_tmp[0])) { 1165 putstr("find_inode failed for name="); 1166 putstr(working_tmp); 1167 putstr("\r\n"); 1168 return 0; 1169 } 1170 } 1171 1172 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 1173 putstr("find_inode failed for name="); 1174 putstr(tmp); 1175 putstr("\r\n"); 1176 return 0; 1177 } 1178 /* this is for the bare filename, directories have already been mapped */ 1179 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) { 1180 putstr("find_inode failed for name="); 1181 putstr(tmp); 1182 putstr("\r\n"); 1183 return 0; 1184 } 1185 return pino; 1186 1187 } 1188 1189 unsigned char 1190 jffs2_1pass_rescan_needed(struct part_info *part) 1191 { 1192 struct b_node *b; 1193 struct jffs2_unknown_node onode; 1194 struct jffs2_unknown_node *node; 1195 struct b_lists *pL = (struct b_lists *)part->jffs2_priv; 1196 1197 if (part->jffs2_priv == 0){ 1198 DEBUGF ("rescan: First time in use\n"); 1199 return 1; 1200 } 1201 1202 /* if we have no list, we need to rescan */ 1203 if (pL->frag.listCount == 0) { 1204 DEBUGF ("rescan: fraglist zero\n"); 1205 return 1; 1206 } 1207 1208 /* but suppose someone reflashed a partition at the same offset... */ 1209 b = pL->dir.listHead; 1210 while (b) { 1211 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset, 1212 sizeof(onode), &onode); 1213 if (node->nodetype != JFFS2_NODETYPE_DIRENT) { 1214 DEBUGF ("rescan: fs changed beneath me? (%lx)\n", 1215 (unsigned long) b->offset); 1216 return 1; 1217 } 1218 b = b->next; 1219 } 1220 return 0; 1221 } 1222 1223 #define dbg_summary(...) do {} while (0); 1224 /* Process the stored summary information - helper function for 1225 * jffs2_sum_scan_sumnode() 1226 */ 1227 1228 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset, 1229 struct jffs2_raw_summary *summary, 1230 struct b_lists *pL) 1231 { 1232 void *sp; 1233 int i; 1234 1235 sp = summary->sum; 1236 1237 for (i = 0; i < summary->sum_num; i++) { 1238 dbg_summary("processing summary index %d\n", i); 1239 1240 switch (((struct jffs2_sum_unknown_flash *)sp)->nodetype) { 1241 case JFFS2_NODETYPE_INODE: { 1242 struct jffs2_sum_inode_flash *spi; 1243 spi = sp; 1244 1245 dbg_summary("Inode at 0x%08x-0x%08x\n", 1246 offset + spi->offset, 1247 offset + spi->offset + spi->totlen); 1248 1249 if (insert_node(&pL->frag, (u32) part->offset + 1250 offset + spi->offset) == NULL) 1251 return -1; 1252 1253 sp += JFFS2_SUMMARY_INODE_SIZE; 1254 1255 break; 1256 } 1257 1258 case JFFS2_NODETYPE_DIRENT: { 1259 struct jffs2_sum_dirent_flash *spd; 1260 spd = sp; 1261 1262 dbg_summary("Dirent at 0x%08x-0x%08x\n", 1263 offset + spd->offset, 1264 offset + spd->offset + spd->totlen); 1265 1266 if (insert_node(&pL->dir, (u32) part->offset + 1267 offset + spd->offset) == NULL) 1268 return -1; 1269 1270 sp += JFFS2_SUMMARY_DIRENT_SIZE(spd->nsize); 1271 1272 break; 1273 } 1274 default : { 1275 uint16_t nodetype = 1276 ((struct jffs2_sum_unknown_flash *) 1277 sp)->nodetype; 1278 printf("Unsupported node type %x found in " 1279 "summary!\n", nodetype); 1280 break; 1281 } 1282 } 1283 } 1284 return 0; 1285 } 1286 1287 /* Process the summary node - called from jffs2_scan_eraseblock() */ 1288 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset, 1289 struct jffs2_raw_summary *summary, uint32_t sumsize, 1290 struct b_lists *pL) 1291 { 1292 struct jffs2_unknown_node crcnode; 1293 int ret, ofs; 1294 uint32_t crc; 1295 1296 ofs = part->sector_size - sumsize; 1297 1298 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n", 1299 offset, offset + ofs, sumsize); 1300 1301 /* OK, now check for node validity and CRC */ 1302 crcnode.magic = JFFS2_MAGIC_BITMASK; 1303 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY; 1304 crcnode.totlen = summary->totlen; 1305 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4); 1306 1307 if (summary->hdr_crc != crc) { 1308 dbg_summary("Summary node header is corrupt (bad CRC or " 1309 "no summary at all)\n"); 1310 goto crc_err; 1311 } 1312 1313 if (summary->totlen != sumsize) { 1314 dbg_summary("Summary node is corrupt (wrong erasesize?)\n"); 1315 goto crc_err; 1316 } 1317 1318 crc = crc32_no_comp(0, (uchar *)summary, 1319 sizeof(struct jffs2_raw_summary)-8); 1320 1321 if (summary->node_crc != crc) { 1322 dbg_summary("Summary node is corrupt (bad CRC)\n"); 1323 goto crc_err; 1324 } 1325 1326 crc = crc32_no_comp(0, (uchar *)summary->sum, 1327 sumsize - sizeof(struct jffs2_raw_summary)); 1328 1329 if (summary->sum_crc != crc) { 1330 dbg_summary("Summary node data is corrupt (bad CRC)\n"); 1331 goto crc_err; 1332 } 1333 1334 if (summary->cln_mkr) 1335 dbg_summary("Summary : CLEANMARKER node \n"); 1336 1337 ret = jffs2_sum_process_sum_data(part, offset, summary, pL); 1338 if (ret) 1339 return ret; /* real error */ 1340 1341 return 1; 1342 1343 crc_err: 1344 putstr("Summary node crc error, skipping summary information.\n"); 1345 1346 return 0; 1347 } 1348 1349 #ifdef DEBUG_FRAGMENTS 1350 static void 1351 dump_fragments(struct b_lists *pL) 1352 { 1353 struct b_node *b; 1354 struct jffs2_raw_inode ojNode; 1355 struct jffs2_raw_inode *jNode; 1356 1357 putstr("\r\n\r\n******The fragment Entries******\r\n"); 1358 b = pL->frag.listHead; 1359 while (b) { 1360 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1361 sizeof(ojNode), &ojNode); 1362 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset); 1363 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen); 1364 putLabeledWord("\tbuild_list: inode = ", jNode->ino); 1365 putLabeledWord("\tbuild_list: version = ", jNode->version); 1366 putLabeledWord("\tbuild_list: isize = ", jNode->isize); 1367 putLabeledWord("\tbuild_list: atime = ", jNode->atime); 1368 putLabeledWord("\tbuild_list: offset = ", jNode->offset); 1369 putLabeledWord("\tbuild_list: csize = ", jNode->csize); 1370 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize); 1371 putLabeledWord("\tbuild_list: compr = ", jNode->compr); 1372 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr); 1373 putLabeledWord("\tbuild_list: flags = ", jNode->flags); 1374 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 1375 b = b->next; 1376 } 1377 } 1378 #endif 1379 1380 #ifdef DEBUG_DIRENTS 1381 static void 1382 dump_dirents(struct b_lists *pL) 1383 { 1384 struct b_node *b; 1385 struct jffs2_raw_dirent *jDir; 1386 1387 putstr("\r\n\r\n******The directory Entries******\r\n"); 1388 b = pL->dir.listHead; 1389 while (b) { 1390 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset, 1391 pL->readbuf); 1392 putstr("\r\n"); 1393 putnstr(jDir->name, jDir->nsize); 1394 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic); 1395 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype); 1396 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc); 1397 putLabeledWord("\tbuild_list: pino = ", jDir->pino); 1398 putLabeledWord("\tbuild_list: version = ", jDir->version); 1399 putLabeledWord("\tbuild_list: ino = ", jDir->ino); 1400 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime); 1401 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize); 1402 putLabeledWord("\tbuild_list: type = ", jDir->type); 1403 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc); 1404 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc); 1405 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 1406 b = b->next; 1407 put_fl_mem(jDir, pL->readbuf); 1408 } 1409 } 1410 #endif 1411 1412 #define DEFAULT_EMPTY_SCAN_SIZE 4096 1413 1414 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size) 1415 { 1416 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE) 1417 return sector_size; 1418 else 1419 return DEFAULT_EMPTY_SCAN_SIZE; 1420 } 1421 1422 static u32 1423 jffs2_1pass_build_lists(struct part_info * part) 1424 { 1425 struct b_lists *pL; 1426 struct jffs2_unknown_node *node; 1427 u32 nr_sectors = part->size/part->sector_size; 1428 u32 i; 1429 u32 counter4 = 0; 1430 u32 counterF = 0; 1431 u32 counterN = 0; 1432 u32 max_totlen = 0; 1433 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE; 1434 char *buf; 1435 1436 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */ 1437 /* jffs2 list building enterprise nope. in newer versions the overhead is */ 1438 /* only about 5 %. not enough to inconvenience people for. */ 1439 /* lcd_off(); */ 1440 1441 /* if we are building a list we need to refresh the cache. */ 1442 jffs_init_1pass_list(part); 1443 pL = (struct b_lists *)part->jffs2_priv; 1444 buf = malloc(buf_size); 1445 puts ("Scanning JFFS2 FS: "); 1446 1447 /* start at the beginning of the partition */ 1448 for (i = 0; i < nr_sectors; i++) { 1449 uint32_t sector_ofs = i * part->sector_size; 1450 uint32_t buf_ofs = sector_ofs; 1451 uint32_t buf_len; 1452 uint32_t ofs, prevofs; 1453 struct jffs2_sum_marker *sm; 1454 void *sumptr = NULL; 1455 uint32_t sumlen; 1456 int ret; 1457 1458 WATCHDOG_RESET(); 1459 1460 buf_len = sizeof(*sm); 1461 1462 /* Read as much as we want into the _end_ of the preallocated 1463 * buffer 1464 */ 1465 get_fl_mem(part->offset + sector_ofs + part->sector_size - 1466 buf_len, buf_len, buf + buf_size - buf_len); 1467 1468 sm = (void *)buf + buf_size - sizeof(*sm); 1469 if (sm->magic == JFFS2_SUM_MAGIC) { 1470 sumlen = part->sector_size - sm->offset; 1471 sumptr = buf + buf_size - sumlen; 1472 1473 /* Now, make sure the summary itself is available */ 1474 if (sumlen > buf_size) { 1475 /* Need to kmalloc for this. */ 1476 sumptr = malloc(sumlen); 1477 if (!sumptr) { 1478 putstr("Can't get memory for summary " 1479 "node!\n"); 1480 return 0; 1481 } 1482 memcpy(sumptr + sumlen - buf_len, buf + 1483 buf_size - buf_len, buf_len); 1484 } 1485 if (buf_len < sumlen) { 1486 /* Need to read more so that the entire summary 1487 * node is present 1488 */ 1489 get_fl_mem(part->offset + sector_ofs + 1490 part->sector_size - sumlen, 1491 sumlen - buf_len, sumptr); 1492 } 1493 } 1494 1495 if (sumptr) { 1496 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr, 1497 sumlen, pL); 1498 1499 if (buf_size && sumlen > buf_size) 1500 free(sumptr); 1501 if (ret < 0) 1502 return 0; 1503 if (ret) 1504 continue; 1505 1506 } 1507 1508 buf_len = EMPTY_SCAN_SIZE(part->sector_size); 1509 1510 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf); 1511 1512 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */ 1513 ofs = 0; 1514 1515 /* Scan only 4KiB of 0xFF before declaring it's empty */ 1516 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) && 1517 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF) 1518 ofs += 4; 1519 1520 if (ofs == EMPTY_SCAN_SIZE(part->sector_size)) 1521 continue; 1522 1523 ofs += sector_ofs; 1524 prevofs = ofs - 1; 1525 1526 scan_more: 1527 while (ofs < sector_ofs + part->sector_size) { 1528 if (ofs == prevofs) { 1529 printf("offset %08x already seen, skip\n", ofs); 1530 ofs += 4; 1531 counter4++; 1532 continue; 1533 } 1534 prevofs = ofs; 1535 if (sector_ofs + part->sector_size < 1536 ofs + sizeof(*node)) 1537 break; 1538 if (buf_ofs + buf_len < ofs + sizeof(*node)) { 1539 buf_len = min_t(uint32_t, buf_size, sector_ofs 1540 + part->sector_size - ofs); 1541 get_fl_mem((u32)part->offset + ofs, buf_len, 1542 buf); 1543 buf_ofs = ofs; 1544 } 1545 1546 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs]; 1547 1548 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) { 1549 uint32_t inbuf_ofs; 1550 uint32_t empty_start, scan_end; 1551 1552 empty_start = ofs; 1553 ofs += 4; 1554 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE( 1555 part->sector_size)/8, 1556 buf_len); 1557 more_empty: 1558 inbuf_ofs = ofs - buf_ofs; 1559 while (inbuf_ofs < scan_end) { 1560 if (*(uint32_t *)(&buf[inbuf_ofs]) != 1561 0xffffffff) 1562 goto scan_more; 1563 1564 inbuf_ofs += 4; 1565 ofs += 4; 1566 } 1567 /* Ran off end. */ 1568 1569 /* See how much more there is to read in this 1570 * eraseblock... 1571 */ 1572 buf_len = min_t(uint32_t, buf_size, 1573 sector_ofs + 1574 part->sector_size - ofs); 1575 if (!buf_len) { 1576 /* No more to read. Break out of main 1577 * loop without marking this range of 1578 * empty space as dirty (because it's 1579 * not) 1580 */ 1581 break; 1582 } 1583 scan_end = buf_len; 1584 get_fl_mem((u32)part->offset + ofs, buf_len, 1585 buf); 1586 buf_ofs = ofs; 1587 goto more_empty; 1588 } 1589 if (node->magic != JFFS2_MAGIC_BITMASK || 1590 !hdr_crc(node)) { 1591 ofs += 4; 1592 counter4++; 1593 continue; 1594 } 1595 if (ofs + node->totlen > 1596 sector_ofs + part->sector_size) { 1597 ofs += 4; 1598 counter4++; 1599 continue; 1600 } 1601 /* if its a fragment add it */ 1602 switch (node->nodetype) { 1603 case JFFS2_NODETYPE_INODE: 1604 if (buf_ofs + buf_len < ofs + sizeof(struct 1605 jffs2_raw_inode)) { 1606 get_fl_mem((u32)part->offset + ofs, 1607 buf_len, buf); 1608 buf_ofs = ofs; 1609 node = (void *)buf; 1610 } 1611 if (!inode_crc((struct jffs2_raw_inode *) node)) 1612 break; 1613 1614 if (insert_node(&pL->frag, (u32) part->offset + 1615 ofs) == NULL) 1616 return 0; 1617 if (max_totlen < node->totlen) 1618 max_totlen = node->totlen; 1619 break; 1620 case JFFS2_NODETYPE_DIRENT: 1621 if (buf_ofs + buf_len < ofs + sizeof(struct 1622 jffs2_raw_dirent) + 1623 ((struct 1624 jffs2_raw_dirent *) 1625 node)->nsize) { 1626 get_fl_mem((u32)part->offset + ofs, 1627 buf_len, buf); 1628 buf_ofs = ofs; 1629 node = (void *)buf; 1630 } 1631 1632 if (!dirent_crc((struct jffs2_raw_dirent *) 1633 node) || 1634 !dirent_name_crc( 1635 (struct 1636 jffs2_raw_dirent *) 1637 node)) 1638 break; 1639 if (! (counterN%100)) 1640 puts ("\b\b. "); 1641 if (insert_node(&pL->dir, (u32) part->offset + 1642 ofs) == NULL) 1643 return 0; 1644 if (max_totlen < node->totlen) 1645 max_totlen = node->totlen; 1646 counterN++; 1647 break; 1648 case JFFS2_NODETYPE_CLEANMARKER: 1649 if (node->totlen != sizeof(struct jffs2_unknown_node)) 1650 printf("OOPS Cleanmarker has bad size " 1651 "%d != %zu\n", 1652 node->totlen, 1653 sizeof(struct jffs2_unknown_node)); 1654 break; 1655 case JFFS2_NODETYPE_PADDING: 1656 if (node->totlen < sizeof(struct jffs2_unknown_node)) 1657 printf("OOPS Padding has bad size " 1658 "%d < %zu\n", 1659 node->totlen, 1660 sizeof(struct jffs2_unknown_node)); 1661 break; 1662 case JFFS2_NODETYPE_SUMMARY: 1663 break; 1664 default: 1665 printf("Unknown node type: %x len %d offset 0x%x\n", 1666 node->nodetype, 1667 node->totlen, ofs); 1668 } 1669 ofs += ((node->totlen + 3) & ~3); 1670 counterF++; 1671 } 1672 } 1673 1674 free(buf); 1675 putstr("\b\b done.\r\n"); /* close off the dots */ 1676 1677 /* We don't care if malloc failed - then each read operation will 1678 * allocate its own buffer as necessary (NAND) or will read directly 1679 * from flash (NOR). 1680 */ 1681 pL->readbuf = malloc(max_totlen); 1682 1683 /* turn the lcd back on. */ 1684 /* splash(); */ 1685 1686 #if 0 1687 putLabeledWord("dir entries = ", pL->dir.listCount); 1688 putLabeledWord("frag entries = ", pL->frag.listCount); 1689 putLabeledWord("+4 increments = ", counter4); 1690 putLabeledWord("+file_offset increments = ", counterF); 1691 1692 #endif 1693 1694 #ifdef DEBUG_DIRENTS 1695 dump_dirents(pL); 1696 #endif 1697 1698 #ifdef DEBUG_FRAGMENTS 1699 dump_fragments(pL); 1700 #endif 1701 1702 /* give visual feedback that we are done scanning the flash */ 1703 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */ 1704 return 1; 1705 } 1706 1707 1708 static u32 1709 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL) 1710 { 1711 struct b_node *b; 1712 struct jffs2_raw_inode ojNode; 1713 struct jffs2_raw_inode *jNode; 1714 int i; 1715 1716 for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1717 piL->compr_info[i].num_frags = 0; 1718 piL->compr_info[i].compr_sum = 0; 1719 piL->compr_info[i].decompr_sum = 0; 1720 } 1721 1722 b = pL->frag.listHead; 1723 while (b) { 1724 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset, 1725 sizeof(ojNode), &ojNode); 1726 if (jNode->compr < JFFS2_NUM_COMPR) { 1727 piL->compr_info[jNode->compr].num_frags++; 1728 piL->compr_info[jNode->compr].compr_sum += jNode->csize; 1729 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize; 1730 } 1731 b = b->next; 1732 } 1733 return 0; 1734 } 1735 1736 1737 static struct b_lists * 1738 jffs2_get_list(struct part_info * part, const char *who) 1739 { 1740 /* copy requested part_info struct pointer to global location */ 1741 current_part = part; 1742 1743 if (jffs2_1pass_rescan_needed(part)) { 1744 if (!jffs2_1pass_build_lists(part)) { 1745 printf("%s: Failed to scan JFFSv2 file structure\n", who); 1746 return NULL; 1747 } 1748 } 1749 return (struct b_lists *)part->jffs2_priv; 1750 } 1751 1752 1753 /* Print directory / file contents */ 1754 u32 1755 jffs2_1pass_ls(struct part_info * part, const char *fname) 1756 { 1757 struct b_lists *pl; 1758 long ret = 1; 1759 u32 inode; 1760 1761 if (! (pl = jffs2_get_list(part, "ls"))) 1762 return 0; 1763 1764 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) { 1765 putstr("ls: Failed to scan jffs2 file structure\r\n"); 1766 return 0; 1767 } 1768 1769 1770 #if 0 1771 putLabeledWord("found file at inode = ", inode); 1772 putLabeledWord("read_inode returns = ", ret); 1773 #endif 1774 1775 return ret; 1776 } 1777 1778 1779 /* Load a file from flash into memory. fname can be a full path */ 1780 u32 1781 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname) 1782 { 1783 1784 struct b_lists *pl; 1785 long ret = 1; 1786 u32 inode; 1787 1788 if (! (pl = jffs2_get_list(part, "load"))) 1789 return 0; 1790 1791 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) { 1792 putstr("load: Failed to find inode\r\n"); 1793 return 0; 1794 } 1795 1796 /* Resolve symlinks */ 1797 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) { 1798 putstr("load: Failed to resolve inode structure\r\n"); 1799 return 0; 1800 } 1801 1802 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) { 1803 putstr("load: Failed to read inode\r\n"); 1804 return 0; 1805 } 1806 1807 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname, 1808 (unsigned long) dest, ret); 1809 return ret; 1810 } 1811 1812 /* Return information about the fs on this partition */ 1813 u32 1814 jffs2_1pass_info(struct part_info * part) 1815 { 1816 struct b_jffs2_info info; 1817 struct b_lists *pl; 1818 int i; 1819 1820 if (! (pl = jffs2_get_list(part, "info"))) 1821 return 0; 1822 1823 jffs2_1pass_fill_info(pl, &info); 1824 for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1825 printf ("Compression: %s\n" 1826 "\tfrag count: %d\n" 1827 "\tcompressed sum: %d\n" 1828 "\tuncompressed sum: %d\n", 1829 compr_names[i], 1830 info.compr_info[i].num_frags, 1831 info.compr_info[i].compr_sum, 1832 info.compr_info[i].decompr_sum); 1833 } 1834 return 1; 1835 } 1836