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