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