2 -------------------------------------------------------------------------
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 *-----------------------------------------------------------------------*/
10 * some portions of this code are taken from jffs2, and as such, the
11 * following copyright notice is included.
13 * JFFS2 -- Journalling Flash File System, Version 2.
15 * Copyright (C) 2001 Red Hat, Inc.
17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
19 * The original JFFS, from which the design for JFFS2 was derived,
20 * was designed and implemented by Axis Communications AB.
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/
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.
32 * The Original Code is JFFS2 - Journalling Flash File System, version 2
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.
45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
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
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
67 * Adapted by Nye Liu <nyet@zumanetworks.com> and
68 * Rex Feany <rfeany@zumanetworks.com>
69 * on Jan/2002 for U-Boot.
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 ;).
79 * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
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.
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
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.
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.
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.
104 * There's a big issue left: endianess is completely ignored in this code. Duh!
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!
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>
126 #include "jffs2_private.h"
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 */
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 */
139 # define DEBUGF(fmt,args...) printf(fmt ,##args)
141 # define DEBUGF(fmt,args...)
146 /* keeps pointer to currentlu processed partition */
147 static struct part_info *current_part;
149 #if (defined(CONFIG_JFFS2_NAND) && \
150 defined(CONFIG_CMD_NAND) )
153 * Support for jffs2 on top of NAND-flash
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
162 #define NAND_PAGE_SIZE 512
163 #define NAND_PAGE_SHIFT 9
164 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
166 #ifndef NAND_CACHE_PAGES
167 #define NAND_CACHE_PAGES 16
169 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
171 static u8* nand_cache = NULL;
172 static u32 nand_cache_off = (u32)-1;
174 static int read_nand_cached(u32 off, u32 size, u_char *buf)
176 struct mtdids *id = current_part->dev->id;
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;
186 /* This memory never gets freed but 'cause
187 it's a bootloader, nobody cares */
188 nand_cache = malloc(NAND_CACHE_SIZE);
190 printf("read_nand_cached: can't alloc cache size %d bytes\n",
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);
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,
211 bytes_read += cpy_bytes;
216 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
218 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
221 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
224 if (read_nand_cached(off, size, buf) < 0) {
233 static void *get_node_mem_nand(u32 off, void *ext_buf)
235 struct jffs2_unknown_node node;
238 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
241 if (!(ret = get_fl_mem_nand(off, node.magic ==
242 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
244 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
245 off, node.magic, node.nodetype, node.totlen);
250 static void put_fl_mem_nand(void *buf)
256 #if defined(CONFIG_CMD_ONENAND)
258 #include <linux/mtd/mtd.h>
259 #include <linux/mtd/onenand.h>
260 #include <onenand_uboot.h>
262 #define ONENAND_PAGE_SIZE 2048
263 #define ONENAND_PAGE_SHIFT 11
264 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
266 #ifndef ONENAND_CACHE_PAGES
267 #define ONENAND_CACHE_PAGES 4
269 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
271 static u8* onenand_cache;
272 static u32 onenand_cache_off = (u32)-1;
274 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
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",
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);
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,
310 bytes_read += cpy_bytes;
315 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
317 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
320 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
323 if (read_onenand_cached(off, size, buf) < 0) {
332 static void *get_node_mem_onenand(u32 off, void *ext_buf)
334 struct jffs2_unknown_node node;
337 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
340 ret = get_fl_mem_onenand(off, node.magic ==
341 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
344 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
345 off, node.magic, node.nodetype, node.totlen);
351 static void put_fl_mem_onenand(void *buf)
358 #if defined(CONFIG_CMD_FLASH)
360 * Support for jffs2 on top of NOR-flash
362 * NOR flash memory is mapped in processor's address space,
363 * just return address.
365 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
368 struct mtdids *id = current_part->dev->id;
370 extern flash_info_t flash_info[];
371 flash_info_t *flash = &flash_info[id->num];
373 addr += flash->start[0];
375 memcpy(ext_buf, (void *)addr, size);
381 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
383 struct jffs2_unknown_node *pNode;
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);
395 * Generic jffs2 raw memory and node read routines.
398 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
400 struct mtdids *id = current_part->dev->id;
403 #if defined(CONFIG_CMD_FLASH)
404 case MTD_DEV_TYPE_NOR:
405 return get_fl_mem_nor(off, size, ext_buf);
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);
413 #if defined(CONFIG_CMD_ONENAND)
414 case MTD_DEV_TYPE_ONENAND:
415 return get_fl_mem_onenand(off, size, ext_buf);
419 printf("get_fl_mem: unknown device type, " \
420 "using raw offset!\n");
425 static inline void *get_node_mem(u32 off, void *ext_buf)
427 struct mtdids *id = current_part->dev->id;
430 #if defined(CONFIG_CMD_FLASH)
431 case MTD_DEV_TYPE_NOR:
432 return get_node_mem_nor(off, ext_buf);
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);
441 #if defined(CONFIG_CMD_ONENAND)
442 case MTD_DEV_TYPE_ONENAND:
443 return get_node_mem_onenand(off, ext_buf);
447 printf("get_fl_mem: unknown device type, " \
448 "using raw offset!\n");
453 static inline void put_fl_mem(void *buf, void *ext_buf)
455 struct mtdids *id = current_part->dev->id;
457 /* If buf is the same as ext_buf, it was provided by the caller -
458 we shouldn't free it then. */
462 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
463 case MTD_DEV_TYPE_NAND:
464 return put_fl_mem_nand(buf);
466 #if defined(CONFIG_CMD_ONENAND)
467 case MTD_DEV_TYPE_ONENAND:
468 return put_fl_mem_onenand(buf);
473 /* Compression names */
474 static char *compr_names[] = {
482 #if defined(CONFIG_JFFS2_LZO)
487 /* Memory management */
490 struct mem_block *next;
491 struct b_node nodes[NODE_CHUNK];
496 free_nodes(struct b_list *list)
498 while (list->listMemBase != NULL) {
499 struct mem_block *next = list->listMemBase->next;
500 free( list->listMemBase );
501 list->listMemBase = next;
505 static struct b_node *
506 add_node(struct b_list *list)
509 struct mem_block *memBase;
512 memBase = list->listMemBase;
514 index = memBase->index;
516 putLabeledWord("add_node: index = ", index);
517 putLabeledWord("add_node: memBase = ", list->listMemBase);
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");
527 memBase->next = list->listMemBase;
530 putLabeledWord("add_node: alloced a new membase at ", *memBase);
534 /* now we have room to add it. */
535 b = &memBase->nodes[index];
538 memBase->index = index;
539 list->listMemBase = memBase;
544 static struct b_node *
545 insert_node(struct b_list *list, u32 offset)
548 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
549 struct b_node *b, *prev;
552 if (!(new = add_node(list))) {
553 putstr("add_node failed!\r\n");
556 new->offset = offset;
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;
566 for (b = (prev ? prev->next : list->listHead);
567 b != NULL && list->listCompare(new, b);
568 prev = b, b = b->next) {
572 list->listLast = prev;
579 list->listHead = new;
583 new->next = (struct b_node *) NULL;
584 if (list->listTail != NULL) {
585 list->listTail->next = new;
586 list->listTail = new;
588 list->listTail = list->listHead = new;
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.
599 static int compare_inodes(struct b_node *new, struct b_node *old)
602 * Only read in the version info from flash, not the entire inode.
603 * This can make a big difference to speed if flash is slow.
607 get_fl_mem(new->offset + offsetof(struct jffs2_raw_inode, version),
608 sizeof(new_version), &new_version);
609 get_fl_mem(old->offset + offsetof(struct jffs2_raw_inode, version),
610 sizeof(old_version), &old_version);
612 return new_version > old_version;
615 /* Sort directory entries so all entries in the same directory
616 * with the same name are grouped together, with the latest version
617 * last. This makes it easy to eliminate all but the latest version
618 * by marking the previous version dead by setting the inode to 0.
620 static int compare_dirents(struct b_node *new, struct b_node *old)
623 * Using NULL as the buffer for NOR flash prevents the entire node
624 * being read. This makes most comparisons much quicker as only one
625 * or two entries from the node will be used most of the time.
627 struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
628 struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
632 if (jNew->pino != jOld->pino) {
633 /* ascending sort by pino */
634 ret = jNew->pino > jOld->pino;
635 } else if (jNew->nsize != jOld->nsize) {
637 * pino is the same, so use ascending sort by nsize,
638 * so we don't do strncmp unless we really must.
640 ret = jNew->nsize > jOld->nsize;
643 * length is also the same, so use ascending sort by name
645 cmp = strncmp((char *)jNew->name, (char *)jOld->name,
651 * we have duplicate names in this directory,
652 * so use ascending sort by version
654 ret = jNew->version > jOld->version;
657 put_fl_mem(jNew, NULL);
658 put_fl_mem(jOld, NULL);
665 jffs2_free_cache(struct part_info *part)
669 if (part->jffs2_priv != NULL) {
670 pL = (struct b_lists *)part->jffs2_priv;
671 free_nodes(&pL->frag);
672 free_nodes(&pL->dir);
679 jffs_init_1pass_list(struct part_info *part)
683 jffs2_free_cache(part);
685 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
686 pL = (struct b_lists *)part->jffs2_priv;
688 memset(pL, 0, sizeof(*pL));
689 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
690 pL->dir.listCompare = compare_dirents;
691 pL->frag.listCompare = compare_inodes;
697 /* find the inode from the slashless name given a parent */
699 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
702 struct jffs2_raw_inode *jNode;
704 u32 latestVersion = 0;
709 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
710 /* Find file size before loading any data, so fragments that
711 * start past the end of file can be ignored. A fragment
712 * that is partially in the file is loaded, so extra data may
713 * be loaded up to the next 4K boundary above the file size.
714 * This shouldn't cause trouble when loading kernel images, so
715 * we will live with it.
717 for (b = pL->frag.listHead; b != NULL; b = b->next) {
718 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
719 sizeof(struct jffs2_raw_inode), pL->readbuf);
720 if ((inode == jNode->ino)) {
721 /* get actual file length from the newest node */
722 if (jNode->version >= latestVersion) {
723 totalSize = jNode->isize;
724 latestVersion = jNode->version;
727 put_fl_mem(jNode, pL->readbuf);
730 * If no destination is provided, we are done.
731 * Just return the total size.
737 for (b = pL->frag.listHead; b != NULL; b = b->next) {
738 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
740 if (inode == jNode->ino) {
742 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
743 putLabeledWord("read_inode: inode = ", jNode->ino);
744 putLabeledWord("read_inode: version = ", jNode->version);
745 putLabeledWord("read_inode: isize = ", jNode->isize);
746 putLabeledWord("read_inode: offset = ", jNode->offset);
747 putLabeledWord("read_inode: csize = ", jNode->csize);
748 putLabeledWord("read_inode: dsize = ", jNode->dsize);
749 putLabeledWord("read_inode: compr = ", jNode->compr);
750 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
751 putLabeledWord("read_inode: flags = ", jNode->flags);
754 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
755 /* get actual file length from the newest node */
756 if (jNode->version >= latestVersion) {
757 totalSize = jNode->isize;
758 latestVersion = jNode->version;
763 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
764 /* ignore data behind latest known EOF */
765 if (jNode->offset > totalSize) {
766 put_fl_mem(jNode, pL->readbuf);
769 if (b->datacrc == CRC_UNKNOWN)
770 b->datacrc = data_crc(jNode) ?
772 if (b->datacrc == CRC_BAD) {
773 put_fl_mem(jNode, pL->readbuf);
777 lDest = (uchar *) (dest + jNode->offset);
779 putLabeledWord("read_inode: src = ", src);
780 putLabeledWord("read_inode: dest = ", lDest);
782 switch (jNode->compr) {
783 case JFFS2_COMPR_NONE:
784 ldr_memcpy(lDest, src, jNode->dsize);
786 case JFFS2_COMPR_ZERO:
787 for (i = 0; i < jNode->dsize; i++)
790 case JFFS2_COMPR_RTIME:
791 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
793 case JFFS2_COMPR_DYNRUBIN:
794 /* this is slow but it works */
795 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
797 case JFFS2_COMPR_ZLIB:
798 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
800 #if defined(CONFIG_JFFS2_LZO)
801 case JFFS2_COMPR_LZO:
802 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
807 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
808 put_fl_mem(jNode, pL->readbuf);
815 putLabeledWord("read_inode: totalSize = ", totalSize);
819 put_fl_mem(jNode, pL->readbuf);
823 putLabeledWord("read_inode: returning = ", totalSize);
828 /* find the inode from the slashless name given a parent */
830 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
833 struct jffs2_raw_dirent *jDir;
839 /* name is assumed slash free */
843 /* we need to search all and return the inode with the highest version */
844 for(b = pL->dir.listHead; b; b = b->next, counter++) {
845 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
847 if ((pino == jDir->pino) && (len == jDir->nsize) &&
848 (!strncmp((char *)jDir->name, name, len))) { /* a match */
849 if (jDir->version < version) {
850 put_fl_mem(jDir, pL->readbuf);
854 if (jDir->version == version && inode != 0) {
855 /* I'm pretty sure this isn't legal */
856 putstr(" ** ERROR ** ");
857 putnstr(jDir->name, jDir->nsize);
858 putLabeledWord(" has dup version =", version);
861 version = jDir->version;
864 putstr("\r\nfind_inode:p&l ->");
865 putnstr(jDir->name, jDir->nsize);
867 putLabeledWord("pino = ", jDir->pino);
868 putLabeledWord("nsize = ", jDir->nsize);
869 putLabeledWord("b = ", (u32) b);
870 putLabeledWord("counter = ", counter);
872 put_fl_mem(jDir, pL->readbuf);
877 char *mkmodestr(unsigned long mode, char *str)
879 static const char *l = "xwr";
883 switch (mode & S_IFMT) {
884 case S_IFDIR: str[0] = 'd'; break;
885 case S_IFBLK: str[0] = 'b'; break;
886 case S_IFCHR: str[0] = 'c'; break;
887 case S_IFIFO: str[0] = 'f'; break;
888 case S_IFLNK: str[0] = 'l'; break;
889 case S_IFSOCK: str[0] = 's'; break;
890 case S_IFREG: str[0] = '-'; break;
891 default: str[0] = '?';
894 for(i = 0; i < 9; i++) {
896 str[9-i] = (mode & mask)?c:'-';
900 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
901 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
902 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
907 static inline void dump_stat(struct stat *st, const char *name)
912 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
915 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
917 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
918 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
921 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
922 st->st_size, s, name);
925 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
928 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
933 if(!d || !i) return -1;
935 strncpy(fname, (char *)d->name, d->nsize);
936 fname[d->nsize] = '\0';
938 memset(&st,0,sizeof(st));
940 st.st_mtime = i->mtime;
941 st.st_mode = i->mode;
943 st.st_size = i->isize;
945 dump_stat(&st, fname);
947 if (d->type == DT_LNK) {
948 unsigned char *src = (unsigned char *) (&i[1]);
950 putnstr(src, (int)i->dsize);
958 /* list inodes with the given pino */
960 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
963 struct jffs2_raw_dirent *jDir;
965 for (b = pL->dir.listHead; b; b = b->next) {
966 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
968 if (pino == jDir->pino) {
970 struct jffs2_raw_inode ojNode;
971 struct jffs2_raw_inode *jNode, *i = NULL;
974 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
975 /* Check for more recent versions of this file */
978 struct b_node *next = b->next;
979 struct jffs2_raw_dirent *jDirNext;
982 jDirNext = (struct jffs2_raw_dirent *)
983 get_node_mem(next->offset, NULL);
984 match = jDirNext->pino == jDir->pino &&
985 jDirNext->nsize == jDir->nsize &&
986 strncmp((char *)jDirNext->name,
990 /* Use next. It is more recent */
992 /* Update buffer with the new info */
995 put_fl_mem(jDirNext, NULL);
998 if (jDir->ino == 0) {
1000 put_fl_mem(jDir, pL->readbuf);
1004 for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
1005 jNode = (struct jffs2_raw_inode *)
1006 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
1007 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
1008 i_version = jNode->version;
1010 put_fl_mem(i, NULL);
1012 if (jDir->type == DT_LNK)
1013 i = get_node_mem(b2->offset,
1016 i = get_fl_mem(b2->offset,
1022 dump_inode(pL, jDir, i);
1023 put_fl_mem(i, NULL);
1025 put_fl_mem(jDir, pL->readbuf);
1031 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1035 char working_tmp[256];
1038 /* discard any leading slash */
1040 while (fname[i] == '/')
1042 strcpy(tmp, &fname[i]);
1044 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1046 strncpy(working_tmp, tmp, c - tmp);
1047 working_tmp[c - tmp] = '\0';
1049 putstr("search_inode: tmp = ");
1052 putstr("search_inode: wtmp = ");
1053 putstr(working_tmp);
1055 putstr("search_inode: c = ");
1059 for (i = 0; i < strlen(c) - 1; i++)
1063 putstr("search_inode: post tmp = ");
1068 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1069 putstr("find_inode failed for name=");
1070 putstr(working_tmp);
1075 /* this is for the bare filename, directories have already been mapped */
1076 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1077 putstr("find_inode failed for name=");
1087 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1091 struct jffs2_raw_dirent *jDir;
1092 struct jffs2_raw_inode *jNode;
1093 u8 jDirFoundType = 0;
1094 u32 jDirFoundIno = 0;
1095 u32 jDirFoundPino = 0;
1101 /* we need to search all and return the inode with the highest version */
1102 for(b = pL->dir.listHead; b; b = b->next) {
1103 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1105 if (ino == jDir->ino) {
1106 if (jDir->version < version) {
1107 put_fl_mem(jDir, pL->readbuf);
1111 if (jDir->version == version && jDirFoundType) {
1112 /* I'm pretty sure this isn't legal */
1113 putstr(" ** ERROR ** ");
1114 putnstr(jDir->name, jDir->nsize);
1115 putLabeledWord(" has dup version (resolve) = ",
1119 jDirFoundType = jDir->type;
1120 jDirFoundIno = jDir->ino;
1121 jDirFoundPino = jDir->pino;
1122 version = jDir->version;
1124 put_fl_mem(jDir, pL->readbuf);
1126 /* now we found the right entry again. (shoulda returned inode*) */
1127 if (jDirFoundType != DT_LNK)
1128 return jDirFoundIno;
1130 /* it's a soft link so we follow it again. */
1131 b2 = pL->frag.listHead;
1133 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1135 if (jNode->ino == jDirFoundIno) {
1136 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1139 putLabeledWord("\t\t dsize = ", jNode->dsize);
1140 putstr("\t\t target = ");
1141 putnstr(src, jNode->dsize);
1144 strncpy(tmp, (char *)src, jNode->dsize);
1145 tmp[jNode->dsize] = '\0';
1146 put_fl_mem(jNode, pL->readbuf);
1150 put_fl_mem(jNode, pL->readbuf);
1152 /* ok so the name of the new file to find is in tmp */
1153 /* if it starts with a slash it is root based else shared dirs */
1157 pino = jDirFoundPino;
1159 return jffs2_1pass_search_inode(pL, tmp, pino);
1163 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1167 char working_tmp[256];
1170 /* discard any leading slash */
1172 while (fname[i] == '/')
1174 strcpy(tmp, &fname[i]);
1175 working_tmp[0] = '\0';
1176 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1178 strncpy(working_tmp, tmp, c - tmp);
1179 working_tmp[c - tmp] = '\0';
1180 for (i = 0; i < strlen(c) - 1; i++)
1183 /* only a failure if we arent looking at top level */
1184 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1186 putstr("find_inode failed for name=");
1187 putstr(working_tmp);
1193 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1194 putstr("find_inode failed for name=");
1199 /* this is for the bare filename, directories have already been mapped */
1200 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1201 putstr("find_inode failed for name=");
1211 jffs2_1pass_rescan_needed(struct part_info *part)
1214 struct jffs2_unknown_node onode;
1215 struct jffs2_unknown_node *node;
1216 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1218 if (part->jffs2_priv == 0){
1219 DEBUGF ("rescan: First time in use\n");
1223 /* if we have no list, we need to rescan */
1224 if (pL->frag.listCount == 0) {
1225 DEBUGF ("rescan: fraglist zero\n");
1229 /* but suppose someone reflashed a partition at the same offset... */
1230 b = pL->dir.listHead;
1232 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1233 sizeof(onode), &onode);
1234 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1235 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1236 (unsigned long) b->offset);
1244 #ifdef CONFIG_JFFS2_SUMMARY
1245 static u32 sum_get_unaligned32(u32 *ptr)
1250 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1252 return __le32_to_cpu(val);
1255 static u16 sum_get_unaligned16(u16 *ptr)
1260 val = *p | (*(p + 1) << 8);
1262 return __le16_to_cpu(val);
1265 #define dbg_summary(...) do {} while (0);
1267 * Process the stored summary information - helper function for
1268 * jffs2_sum_scan_sumnode()
1271 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1272 struct jffs2_raw_summary *summary,
1279 for (pass = 0; pass < 2; pass++) {
1282 for (i = 0; i < summary->sum_num; i++) {
1283 struct jffs2_sum_unknown_flash *spu = sp;
1284 dbg_summary("processing summary index %d\n", i);
1286 switch (sum_get_unaligned16(&spu->nodetype)) {
1287 case JFFS2_NODETYPE_INODE: {
1288 struct jffs2_sum_inode_flash *spi;
1292 ret = insert_node(&pL->frag,
1295 sum_get_unaligned32(
1301 sp += JFFS2_SUMMARY_INODE_SIZE;
1305 case JFFS2_NODETYPE_DIRENT: {
1306 struct jffs2_sum_dirent_flash *spd;
1309 ret = insert_node(&pL->dir,
1310 (u32) part->offset +
1312 sum_get_unaligned32(
1318 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1324 uint16_t nodetype = sum_get_unaligned16(
1326 printf("Unsupported node type %x found"
1329 if ((nodetype & JFFS2_COMPAT_MASK) ==
1330 JFFS2_FEATURE_INCOMPAT)
1340 /* Process the summary node - called from jffs2_scan_eraseblock() */
1341 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1342 struct jffs2_raw_summary *summary, uint32_t sumsize,
1345 struct jffs2_unknown_node crcnode;
1349 ofs = part->sector_size - sumsize;
1351 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1352 offset, offset + ofs, sumsize);
1354 /* OK, now check for node validity and CRC */
1355 crcnode.magic = JFFS2_MAGIC_BITMASK;
1356 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1357 crcnode.totlen = summary->totlen;
1358 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1360 if (summary->hdr_crc != crc) {
1361 dbg_summary("Summary node header is corrupt (bad CRC or "
1362 "no summary at all)\n");
1366 if (summary->totlen != sumsize) {
1367 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1371 crc = crc32_no_comp(0, (uchar *)summary,
1372 sizeof(struct jffs2_raw_summary)-8);
1374 if (summary->node_crc != crc) {
1375 dbg_summary("Summary node is corrupt (bad CRC)\n");
1379 crc = crc32_no_comp(0, (uchar *)summary->sum,
1380 sumsize - sizeof(struct jffs2_raw_summary));
1382 if (summary->sum_crc != crc) {
1383 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1387 if (summary->cln_mkr)
1388 dbg_summary("Summary : CLEANMARKER node \n");
1390 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1391 if (ret == -EBADMSG)
1394 return ret; /* real error */
1399 putstr("Summary node crc error, skipping summary information.\n");
1403 #endif /* CONFIG_JFFS2_SUMMARY */
1405 #ifdef DEBUG_FRAGMENTS
1407 dump_fragments(struct b_lists *pL)
1410 struct jffs2_raw_inode ojNode;
1411 struct jffs2_raw_inode *jNode;
1413 putstr("\r\n\r\n******The fragment Entries******\r\n");
1414 b = pL->frag.listHead;
1416 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1417 sizeof(ojNode), &ojNode);
1418 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1419 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1420 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1421 putLabeledWord("\tbuild_list: version = ", jNode->version);
1422 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1423 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1424 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1425 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1426 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1427 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1428 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1429 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1430 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1436 #ifdef DEBUG_DIRENTS
1438 dump_dirents(struct b_lists *pL)
1441 struct jffs2_raw_dirent *jDir;
1443 putstr("\r\n\r\n******The directory Entries******\r\n");
1444 b = pL->dir.listHead;
1446 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1449 putnstr(jDir->name, jDir->nsize);
1450 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1451 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1452 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1453 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1454 putLabeledWord("\tbuild_list: version = ", jDir->version);
1455 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1456 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1457 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1458 putLabeledWord("\tbuild_list: type = ", jDir->type);
1459 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1460 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1461 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1463 put_fl_mem(jDir, pL->readbuf);
1468 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1470 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1472 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1475 return DEFAULT_EMPTY_SCAN_SIZE;
1479 jffs2_1pass_build_lists(struct part_info * part)
1482 struct jffs2_unknown_node *node;
1489 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1492 nr_sectors = lldiv(part->size, part->sector_size);
1493 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1494 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1495 /* only about 5 %. not enough to inconvenience people for. */
1498 /* if we are building a list we need to refresh the cache. */
1499 jffs_init_1pass_list(part);
1500 pL = (struct b_lists *)part->jffs2_priv;
1501 buf = malloc(buf_size);
1502 puts ("Scanning JFFS2 FS: ");
1504 /* start at the beginning of the partition */
1505 for (i = 0; i < nr_sectors; i++) {
1506 uint32_t sector_ofs = i * part->sector_size;
1507 uint32_t buf_ofs = sector_ofs;
1509 uint32_t ofs, prevofs;
1510 #ifdef CONFIG_JFFS2_SUMMARY
1511 struct jffs2_sum_marker *sm;
1512 void *sumptr = NULL;
1519 #ifdef CONFIG_JFFS2_SUMMARY
1520 buf_len = sizeof(*sm);
1522 /* Read as much as we want into the _end_ of the preallocated
1525 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1526 buf_len, buf_len, buf + buf_size - buf_len);
1528 sm = (void *)buf + buf_size - sizeof(*sm);
1529 if (sm->magic == JFFS2_SUM_MAGIC) {
1530 sumlen = part->sector_size - sm->offset;
1531 sumptr = buf + buf_size - sumlen;
1533 /* Now, make sure the summary itself is available */
1534 if (sumlen > buf_size) {
1535 /* Need to kmalloc for this. */
1536 sumptr = malloc(sumlen);
1538 putstr("Can't get memory for summary "
1541 jffs2_free_cache(part);
1544 memcpy(sumptr + sumlen - buf_len, buf +
1545 buf_size - buf_len, buf_len);
1547 if (buf_len < sumlen) {
1548 /* Need to read more so that the entire summary
1551 get_fl_mem(part->offset + sector_ofs +
1552 part->sector_size - sumlen,
1553 sumlen - buf_len, sumptr);
1558 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1561 if (buf_size && sumlen > buf_size)
1565 jffs2_free_cache(part);
1572 #endif /* CONFIG_JFFS2_SUMMARY */
1574 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1576 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1578 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1581 /* Scan only 4KiB of 0xFF before declaring it's empty */
1582 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1583 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1586 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1593 while (ofs < sector_ofs + part->sector_size) {
1594 if (ofs == prevofs) {
1595 printf("offset %08x already seen, skip\n", ofs);
1601 if (sector_ofs + part->sector_size <
1602 ofs + sizeof(*node))
1604 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1605 buf_len = min_t(uint32_t, buf_size, sector_ofs
1606 + part->sector_size - ofs);
1607 get_fl_mem((u32)part->offset + ofs, buf_len,
1612 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1614 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1619 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1620 part->sector_size)/8,
1623 inbuf_ofs = ofs - buf_ofs;
1624 while (inbuf_ofs < scan_end) {
1625 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1634 /* See how much more there is to read in this
1637 buf_len = min_t(uint32_t, buf_size,
1639 part->sector_size - ofs);
1641 /* No more to read. Break out of main
1642 * loop without marking this range of
1643 * empty space as dirty (because it's
1649 get_fl_mem((u32)part->offset + ofs, buf_len,
1654 if (node->magic != JFFS2_MAGIC_BITMASK ||
1660 if (ofs + node->totlen >
1661 sector_ofs + part->sector_size) {
1666 /* if its a fragment add it */
1667 switch (node->nodetype) {
1668 case JFFS2_NODETYPE_INODE:
1669 if (buf_ofs + buf_len < ofs + sizeof(struct
1671 get_fl_mem((u32)part->offset + ofs,
1676 if (!inode_crc((struct jffs2_raw_inode *) node))
1679 if (insert_node(&pL->frag, (u32) part->offset +
1682 jffs2_free_cache(part);
1685 if (max_totlen < node->totlen)
1686 max_totlen = node->totlen;
1688 case JFFS2_NODETYPE_DIRENT:
1689 if (buf_ofs + buf_len < ofs + sizeof(struct
1694 get_fl_mem((u32)part->offset + ofs,
1700 if (!dirent_crc((struct jffs2_raw_dirent *)
1707 if (! (counterN%100))
1709 if (insert_node(&pL->dir, (u32) part->offset +
1712 jffs2_free_cache(part);
1715 if (max_totlen < node->totlen)
1716 max_totlen = node->totlen;
1719 case JFFS2_NODETYPE_CLEANMARKER:
1720 if (node->totlen != sizeof(struct jffs2_unknown_node))
1721 printf("OOPS Cleanmarker has bad size "
1724 sizeof(struct jffs2_unknown_node));
1726 case JFFS2_NODETYPE_PADDING:
1727 if (node->totlen < sizeof(struct jffs2_unknown_node))
1728 printf("OOPS Padding has bad size "
1731 sizeof(struct jffs2_unknown_node));
1733 case JFFS2_NODETYPE_SUMMARY:
1736 printf("Unknown node type: %x len %d offset 0x%x\n",
1740 ofs += ((node->totlen + 3) & ~3);
1746 putstr("\b\b done.\r\n"); /* close off the dots */
1748 /* We don't care if malloc failed - then each read operation will
1749 * allocate its own buffer as necessary (NAND) or will read directly
1752 pL->readbuf = malloc(max_totlen);
1754 /* turn the lcd back on. */
1758 putLabeledWord("dir entries = ", pL->dir.listCount);
1759 putLabeledWord("frag entries = ", pL->frag.listCount);
1760 putLabeledWord("+4 increments = ", counter4);
1761 putLabeledWord("+file_offset increments = ", counterF);
1765 #ifdef DEBUG_DIRENTS
1769 #ifdef DEBUG_FRAGMENTS
1773 /* give visual feedback that we are done scanning the flash */
1774 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1780 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1783 struct jffs2_raw_inode ojNode;
1784 struct jffs2_raw_inode *jNode;
1787 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1788 piL->compr_info[i].num_frags = 0;
1789 piL->compr_info[i].compr_sum = 0;
1790 piL->compr_info[i].decompr_sum = 0;
1793 b = pL->frag.listHead;
1795 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1796 sizeof(ojNode), &ojNode);
1797 if (jNode->compr < JFFS2_NUM_COMPR) {
1798 piL->compr_info[jNode->compr].num_frags++;
1799 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1800 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1808 static struct b_lists *
1809 jffs2_get_list(struct part_info * part, const char *who)
1811 /* copy requested part_info struct pointer to global location */
1812 current_part = part;
1814 if (jffs2_1pass_rescan_needed(part)) {
1815 if (!jffs2_1pass_build_lists(part)) {
1816 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1820 return (struct b_lists *)part->jffs2_priv;
1824 /* Print directory / file contents */
1826 jffs2_1pass_ls(struct part_info * part, const char *fname)
1832 if (! (pl = jffs2_get_list(part, "ls")))
1835 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1836 putstr("ls: Failed to scan jffs2 file structure\r\n");
1842 putLabeledWord("found file at inode = ", inode);
1843 putLabeledWord("read_inode returns = ", ret);
1850 /* Load a file from flash into memory. fname can be a full path */
1852 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1859 if (! (pl = jffs2_get_list(part, "load")))
1862 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1863 putstr("load: Failed to find inode\r\n");
1867 /* Resolve symlinks */
1868 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1869 putstr("load: Failed to resolve inode structure\r\n");
1873 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1874 putstr("load: Failed to read inode\r\n");
1878 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1879 (unsigned long) dest, ret);
1883 /* Return information about the fs on this partition */
1885 jffs2_1pass_info(struct part_info * part)
1887 struct b_jffs2_info info;
1891 if (! (pl = jffs2_get_list(part, "info")))
1894 jffs2_1pass_fill_info(pl, &info);
1895 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1896 printf ("Compression: %s\n"
1897 "\tfrag count: %d\n"
1898 "\tcompressed sum: %d\n"
1899 "\tuncompressed sum: %d\n",
1901 info.compr_info[i].num_frags,
1902 info.compr_info[i].compr_sum,
1903 info.compr_info[i].decompr_sum);