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!
117 #include <linux/stat.h>
118 #include <linux/time.h>
119 #include <watchdog.h>
120 #include <jffs2/jffs2.h>
121 #include <jffs2/jffs2_1pass.h>
122 #include <linux/compat.h>
123 #include <asm/errno.h>
125 #include "jffs2_private.h"
128 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
129 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
131 /* Debugging switches */
132 #undef DEBUG_DIRENTS /* print directory entry list after scan */
133 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
134 #undef DEBUG /* enable debugging messages */
138 # define DEBUGF(fmt,args...) printf(fmt ,##args)
140 # define DEBUGF(fmt,args...)
145 /* keeps pointer to currentlu processed partition */
146 static struct part_info *current_part;
148 #if (defined(CONFIG_JFFS2_NAND) && \
149 defined(CONFIG_CMD_NAND) )
152 * Support for jffs2 on top of NAND-flash
154 * NAND memory isn't mapped in processor's address space,
155 * so data should be fetched from flash before
156 * being processed. This is exactly what functions declared
161 #define NAND_PAGE_SIZE 512
162 #define NAND_PAGE_SHIFT 9
163 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
165 #ifndef NAND_CACHE_PAGES
166 #define NAND_CACHE_PAGES 16
168 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
170 static u8* nand_cache = NULL;
171 static u32 nand_cache_off = (u32)-1;
173 static int read_nand_cached(u32 off, u32 size, u_char *buf)
175 struct mtdids *id = current_part->dev->id;
180 while (bytes_read < size) {
181 if ((off + bytes_read < nand_cache_off) ||
182 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
183 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
185 /* This memory never gets freed but 'cause
186 it's a bootloader, nobody cares */
187 nand_cache = malloc(NAND_CACHE_SIZE);
189 printf("read_nand_cached: can't alloc cache size %d bytes\n",
195 retlen = NAND_CACHE_SIZE;
196 if (nand_read(&nand_info[id->num], nand_cache_off,
197 &retlen, nand_cache) != 0 ||
198 retlen != NAND_CACHE_SIZE) {
199 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
200 nand_cache_off, NAND_CACHE_SIZE);
204 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
205 if (cpy_bytes > size - bytes_read)
206 cpy_bytes = size - bytes_read;
207 memcpy(buf + bytes_read,
208 nand_cache + off + bytes_read - nand_cache_off,
210 bytes_read += cpy_bytes;
215 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
217 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
220 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
223 if (read_nand_cached(off, size, buf) < 0) {
232 static void *get_node_mem_nand(u32 off, void *ext_buf)
234 struct jffs2_unknown_node node;
237 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
240 if (!(ret = get_fl_mem_nand(off, node.magic ==
241 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
243 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
244 off, node.magic, node.nodetype, node.totlen);
249 static void put_fl_mem_nand(void *buf)
255 #if defined(CONFIG_CMD_ONENAND)
257 #include <linux/mtd/mtd.h>
258 #include <linux/mtd/onenand.h>
259 #include <onenand_uboot.h>
261 #define ONENAND_PAGE_SIZE 2048
262 #define ONENAND_PAGE_SHIFT 11
263 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
265 #ifndef ONENAND_CACHE_PAGES
266 #define ONENAND_CACHE_PAGES 4
268 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
270 static u8* onenand_cache;
271 static u32 onenand_cache_off = (u32)-1;
273 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
279 while (bytes_read < size) {
280 if ((off + bytes_read < onenand_cache_off) ||
281 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
282 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
283 if (!onenand_cache) {
284 /* This memory never gets freed but 'cause
285 it's a bootloader, nobody cares */
286 onenand_cache = malloc(ONENAND_CACHE_SIZE);
287 if (!onenand_cache) {
288 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
294 retlen = ONENAND_CACHE_SIZE;
295 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
296 &retlen, onenand_cache) != 0 ||
297 retlen != ONENAND_CACHE_SIZE) {
298 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
299 onenand_cache_off, ONENAND_CACHE_SIZE);
303 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
304 if (cpy_bytes > size - bytes_read)
305 cpy_bytes = size - bytes_read;
306 memcpy(buf + bytes_read,
307 onenand_cache + off + bytes_read - onenand_cache_off,
309 bytes_read += cpy_bytes;
314 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
316 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
319 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
322 if (read_onenand_cached(off, size, buf) < 0) {
331 static void *get_node_mem_onenand(u32 off, void *ext_buf)
333 struct jffs2_unknown_node node;
336 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
339 ret = get_fl_mem_onenand(off, node.magic ==
340 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
343 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
344 off, node.magic, node.nodetype, node.totlen);
350 static void put_fl_mem_onenand(void *buf)
357 #if defined(CONFIG_CMD_FLASH)
359 * Support for jffs2 on top of NOR-flash
361 * NOR flash memory is mapped in processor's address space,
362 * just return address.
364 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
367 struct mtdids *id = current_part->dev->id;
369 extern flash_info_t flash_info[];
370 flash_info_t *flash = &flash_info[id->num];
372 addr += flash->start[0];
374 memcpy(ext_buf, (void *)addr, size);
380 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
382 struct jffs2_unknown_node *pNode;
384 /* pNode will point directly to flash - don't provide external buffer
385 and don't care about size */
386 pNode = get_fl_mem_nor(off, 0, NULL);
387 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
388 pNode->totlen : sizeof(*pNode), ext_buf);
394 * Generic jffs2 raw memory and node read routines.
397 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
399 struct mtdids *id = current_part->dev->id;
402 #if defined(CONFIG_CMD_FLASH)
403 case MTD_DEV_TYPE_NOR:
404 return get_fl_mem_nor(off, size, ext_buf);
407 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
408 case MTD_DEV_TYPE_NAND:
409 return get_fl_mem_nand(off, size, ext_buf);
412 #if defined(CONFIG_CMD_ONENAND)
413 case MTD_DEV_TYPE_ONENAND:
414 return get_fl_mem_onenand(off, size, ext_buf);
418 printf("get_fl_mem: unknown device type, " \
419 "using raw offset!\n");
424 static inline void *get_node_mem(u32 off, void *ext_buf)
426 struct mtdids *id = current_part->dev->id;
429 #if defined(CONFIG_CMD_FLASH)
430 case MTD_DEV_TYPE_NOR:
431 return get_node_mem_nor(off, ext_buf);
434 #if defined(CONFIG_JFFS2_NAND) && \
435 defined(CONFIG_CMD_NAND)
436 case MTD_DEV_TYPE_NAND:
437 return get_node_mem_nand(off, ext_buf);
440 #if defined(CONFIG_CMD_ONENAND)
441 case MTD_DEV_TYPE_ONENAND:
442 return get_node_mem_onenand(off, ext_buf);
446 printf("get_fl_mem: unknown device type, " \
447 "using raw offset!\n");
452 static inline void put_fl_mem(void *buf, void *ext_buf)
454 struct mtdids *id = current_part->dev->id;
456 /* If buf is the same as ext_buf, it was provided by the caller -
457 we shouldn't free it then. */
461 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
462 case MTD_DEV_TYPE_NAND:
463 return put_fl_mem_nand(buf);
465 #if defined(CONFIG_CMD_ONENAND)
466 case MTD_DEV_TYPE_ONENAND:
467 return put_fl_mem_onenand(buf);
472 /* Compression names */
473 static char *compr_names[] = {
481 #if defined(CONFIG_JFFS2_LZO)
486 /* Memory management */
489 struct mem_block *next;
490 struct b_node nodes[NODE_CHUNK];
495 free_nodes(struct b_list *list)
497 while (list->listMemBase != NULL) {
498 struct mem_block *next = list->listMemBase->next;
499 free( list->listMemBase );
500 list->listMemBase = next;
504 static struct b_node *
505 add_node(struct b_list *list)
508 struct mem_block *memBase;
511 memBase = list->listMemBase;
513 index = memBase->index;
515 putLabeledWord("add_node: index = ", index);
516 putLabeledWord("add_node: memBase = ", list->listMemBase);
519 if (memBase == NULL || index >= NODE_CHUNK) {
520 /* we need more space before we continue */
521 memBase = mmalloc(sizeof(struct mem_block));
522 if (memBase == NULL) {
523 putstr("add_node: malloc failed\n");
526 memBase->next = list->listMemBase;
529 putLabeledWord("add_node: alloced a new membase at ", *memBase);
533 /* now we have room to add it. */
534 b = &memBase->nodes[index];
537 memBase->index = index;
538 list->listMemBase = memBase;
543 static struct b_node *
544 insert_node(struct b_list *list, u32 offset)
547 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
548 struct b_node *b, *prev;
551 if (!(new = add_node(list))) {
552 putstr("add_node failed!\r\n");
555 new->offset = offset;
557 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
558 if (list->listTail != NULL && list->listCompare(new, list->listTail))
559 prev = list->listTail;
560 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
561 prev = list->listLast;
565 for (b = (prev ? prev->next : list->listHead);
566 b != NULL && list->listCompare(new, b);
567 prev = b, b = b->next) {
571 list->listLast = prev;
578 list->listHead = new;
582 new->next = (struct b_node *) NULL;
583 if (list->listTail != NULL) {
584 list->listTail->next = new;
585 list->listTail = new;
587 list->listTail = list->listHead = new;
594 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
595 /* Sort data entries with the latest version last, so that if there
596 * is overlapping data the latest version will be used.
598 static int compare_inodes(struct b_node *new, struct b_node *old)
600 struct jffs2_raw_inode ojNew;
601 struct jffs2_raw_inode ojOld;
602 struct jffs2_raw_inode *jNew =
603 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
604 struct jffs2_raw_inode *jOld =
605 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
607 return jNew->version > jOld->version;
610 /* Sort directory entries so all entries in the same directory
611 * with the same name are grouped together, with the latest version
612 * last. This makes it easy to eliminate all but the latest version
613 * by marking the previous version dead by setting the inode to 0.
615 static int compare_dirents(struct b_node *new, struct b_node *old)
617 struct jffs2_raw_dirent ojNew;
618 struct jffs2_raw_dirent ojOld;
619 struct jffs2_raw_dirent *jNew =
620 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
621 struct jffs2_raw_dirent *jOld =
622 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
625 /* ascending sort by pino */
626 if (jNew->pino != jOld->pino)
627 return jNew->pino > jOld->pino;
629 /* pino is the same, so use ascending sort by nsize, so
630 * we don't do strncmp unless we really must.
632 if (jNew->nsize != jOld->nsize)
633 return jNew->nsize > jOld->nsize;
635 /* length is also the same, so use ascending sort by name
637 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
641 /* we have duplicate names in this directory, so use ascending
644 if (jNew->version > jOld->version) {
645 /* since jNew is newer, we know jOld is not valid, so
646 * mark it with inode 0 and it will not be used
657 jffs2_free_cache(struct part_info *part)
661 if (part->jffs2_priv != NULL) {
662 pL = (struct b_lists *)part->jffs2_priv;
663 free_nodes(&pL->frag);
664 free_nodes(&pL->dir);
671 jffs_init_1pass_list(struct part_info *part)
675 jffs2_free_cache(part);
677 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
678 pL = (struct b_lists *)part->jffs2_priv;
680 memset(pL, 0, sizeof(*pL));
681 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
682 pL->dir.listCompare = compare_dirents;
683 pL->frag.listCompare = compare_inodes;
689 /* find the inode from the slashless name given a parent */
691 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
694 struct jffs2_raw_inode *jNode;
696 u32 latestVersion = 0;
701 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
702 /* Find file size before loading any data, so fragments that
703 * start past the end of file can be ignored. A fragment
704 * that is partially in the file is loaded, so extra data may
705 * be loaded up to the next 4K boundary above the file size.
706 * This shouldn't cause trouble when loading kernel images, so
707 * we will live with it.
709 for (b = pL->frag.listHead; b != NULL; b = b->next) {
710 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
711 sizeof(struct jffs2_raw_inode), pL->readbuf);
712 if ((inode == jNode->ino)) {
713 /* get actual file length from the newest node */
714 if (jNode->version >= latestVersion) {
715 totalSize = jNode->isize;
716 latestVersion = jNode->version;
719 put_fl_mem(jNode, pL->readbuf);
723 for (b = pL->frag.listHead; b != NULL; b = b->next) {
724 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
726 if ((inode == jNode->ino)) {
728 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
729 putLabeledWord("read_inode: inode = ", jNode->ino);
730 putLabeledWord("read_inode: version = ", jNode->version);
731 putLabeledWord("read_inode: isize = ", jNode->isize);
732 putLabeledWord("read_inode: offset = ", jNode->offset);
733 putLabeledWord("read_inode: csize = ", jNode->csize);
734 putLabeledWord("read_inode: dsize = ", jNode->dsize);
735 putLabeledWord("read_inode: compr = ", jNode->compr);
736 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
737 putLabeledWord("read_inode: flags = ", jNode->flags);
740 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
741 /* get actual file length from the newest node */
742 if (jNode->version >= latestVersion) {
743 totalSize = jNode->isize;
744 latestVersion = jNode->version;
749 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
750 /* ignore data behind latest known EOF */
751 if (jNode->offset > totalSize) {
752 put_fl_mem(jNode, pL->readbuf);
755 if (b->datacrc == CRC_UNKNOWN)
756 b->datacrc = data_crc(jNode) ?
758 if (b->datacrc == CRC_BAD) {
759 put_fl_mem(jNode, pL->readbuf);
763 lDest = (uchar *) (dest + jNode->offset);
765 putLabeledWord("read_inode: src = ", src);
766 putLabeledWord("read_inode: dest = ", lDest);
768 switch (jNode->compr) {
769 case JFFS2_COMPR_NONE:
770 ldr_memcpy(lDest, src, jNode->dsize);
772 case JFFS2_COMPR_ZERO:
773 for (i = 0; i < jNode->dsize; i++)
776 case JFFS2_COMPR_RTIME:
777 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
779 case JFFS2_COMPR_DYNRUBIN:
780 /* this is slow but it works */
781 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
783 case JFFS2_COMPR_ZLIB:
784 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
786 #if defined(CONFIG_JFFS2_LZO)
787 case JFFS2_COMPR_LZO:
788 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
793 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
794 put_fl_mem(jNode, pL->readbuf);
801 putLabeledWord("read_inode: totalSize = ", totalSize);
805 put_fl_mem(jNode, pL->readbuf);
809 putLabeledWord("read_inode: returning = ", totalSize);
814 /* find the inode from the slashless name given a parent */
816 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
819 struct jffs2_raw_dirent *jDir;
825 /* name is assumed slash free */
829 /* we need to search all and return the inode with the highest version */
830 for(b = pL->dir.listHead; b; b = b->next, counter++) {
831 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
833 if ((pino == jDir->pino) && (len == jDir->nsize) &&
834 (jDir->ino) && /* 0 for unlink */
835 (!strncmp((char *)jDir->name, name, len))) { /* a match */
836 if (jDir->version < version) {
837 put_fl_mem(jDir, pL->readbuf);
841 if (jDir->version == version && inode != 0) {
842 /* I'm pretty sure this isn't legal */
843 putstr(" ** ERROR ** ");
844 putnstr(jDir->name, jDir->nsize);
845 putLabeledWord(" has dup version =", version);
848 version = jDir->version;
851 putstr("\r\nfind_inode:p&l ->");
852 putnstr(jDir->name, jDir->nsize);
854 putLabeledWord("pino = ", jDir->pino);
855 putLabeledWord("nsize = ", jDir->nsize);
856 putLabeledWord("b = ", (u32) b);
857 putLabeledWord("counter = ", counter);
859 put_fl_mem(jDir, pL->readbuf);
864 char *mkmodestr(unsigned long mode, char *str)
866 static const char *l = "xwr";
870 switch (mode & S_IFMT) {
871 case S_IFDIR: str[0] = 'd'; break;
872 case S_IFBLK: str[0] = 'b'; break;
873 case S_IFCHR: str[0] = 'c'; break;
874 case S_IFIFO: str[0] = 'f'; break;
875 case S_IFLNK: str[0] = 'l'; break;
876 case S_IFSOCK: str[0] = 's'; break;
877 case S_IFREG: str[0] = '-'; break;
878 default: str[0] = '?';
881 for(i = 0; i < 9; i++) {
883 str[9-i] = (mode & mask)?c:'-';
887 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
888 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
889 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
894 static inline void dump_stat(struct stat *st, const char *name)
899 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
902 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
904 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
905 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
908 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
909 st->st_size, s, name);
912 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
915 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
920 if(!d || !i) return -1;
922 strncpy(fname, (char *)d->name, d->nsize);
923 fname[d->nsize] = '\0';
925 memset(&st,0,sizeof(st));
927 st.st_mtime = i->mtime;
928 st.st_mode = i->mode;
930 st.st_size = i->isize;
932 dump_stat(&st, fname);
934 if (d->type == DT_LNK) {
935 unsigned char *src = (unsigned char *) (&i[1]);
937 putnstr(src, (int)i->dsize);
945 /* list inodes with the given pino */
947 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
950 struct jffs2_raw_dirent *jDir;
952 for (b = pL->dir.listHead; b; b = b->next) {
953 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
955 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
957 struct jffs2_raw_inode ojNode;
958 struct jffs2_raw_inode *jNode, *i = NULL;
959 struct b_node *b2 = pL->frag.listHead;
962 jNode = (struct jffs2_raw_inode *)
963 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
964 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
965 i_version = jNode->version;
969 if (jDir->type == DT_LNK)
970 i = get_node_mem(b2->offset,
973 i = get_fl_mem(b2->offset,
980 dump_inode(pL, jDir, i);
983 put_fl_mem(jDir, pL->readbuf);
989 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
993 char working_tmp[256];
996 /* discard any leading slash */
998 while (fname[i] == '/')
1000 strcpy(tmp, &fname[i]);
1002 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1004 strncpy(working_tmp, tmp, c - tmp);
1005 working_tmp[c - tmp] = '\0';
1007 putstr("search_inode: tmp = ");
1010 putstr("search_inode: wtmp = ");
1011 putstr(working_tmp);
1013 putstr("search_inode: c = ");
1017 for (i = 0; i < strlen(c) - 1; i++)
1021 putstr("search_inode: post tmp = ");
1026 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1027 putstr("find_inode failed for name=");
1028 putstr(working_tmp);
1033 /* this is for the bare filename, directories have already been mapped */
1034 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1035 putstr("find_inode failed for name=");
1045 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1049 struct jffs2_raw_dirent *jDir;
1050 struct jffs2_raw_inode *jNode;
1051 u8 jDirFoundType = 0;
1052 u32 jDirFoundIno = 0;
1053 u32 jDirFoundPino = 0;
1059 /* we need to search all and return the inode with the highest version */
1060 for(b = pL->dir.listHead; b; b = b->next) {
1061 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1063 if (ino == jDir->ino) {
1064 if (jDir->version < version) {
1065 put_fl_mem(jDir, pL->readbuf);
1069 if (jDir->version == version && jDirFoundType) {
1070 /* I'm pretty sure this isn't legal */
1071 putstr(" ** ERROR ** ");
1072 putnstr(jDir->name, jDir->nsize);
1073 putLabeledWord(" has dup version (resolve) = ",
1077 jDirFoundType = jDir->type;
1078 jDirFoundIno = jDir->ino;
1079 jDirFoundPino = jDir->pino;
1080 version = jDir->version;
1082 put_fl_mem(jDir, pL->readbuf);
1084 /* now we found the right entry again. (shoulda returned inode*) */
1085 if (jDirFoundType != DT_LNK)
1086 return jDirFoundIno;
1088 /* it's a soft link so we follow it again. */
1089 b2 = pL->frag.listHead;
1091 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1093 if (jNode->ino == jDirFoundIno) {
1094 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1097 putLabeledWord("\t\t dsize = ", jNode->dsize);
1098 putstr("\t\t target = ");
1099 putnstr(src, jNode->dsize);
1102 strncpy(tmp, (char *)src, jNode->dsize);
1103 tmp[jNode->dsize] = '\0';
1104 put_fl_mem(jNode, pL->readbuf);
1108 put_fl_mem(jNode, pL->readbuf);
1110 /* ok so the name of the new file to find is in tmp */
1111 /* if it starts with a slash it is root based else shared dirs */
1115 pino = jDirFoundPino;
1117 return jffs2_1pass_search_inode(pL, tmp, pino);
1121 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1125 char working_tmp[256];
1128 /* discard any leading slash */
1130 while (fname[i] == '/')
1132 strcpy(tmp, &fname[i]);
1133 working_tmp[0] = '\0';
1134 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1136 strncpy(working_tmp, tmp, c - tmp);
1137 working_tmp[c - tmp] = '\0';
1138 for (i = 0; i < strlen(c) - 1; i++)
1141 /* only a failure if we arent looking at top level */
1142 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1144 putstr("find_inode failed for name=");
1145 putstr(working_tmp);
1151 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1152 putstr("find_inode failed for name=");
1157 /* this is for the bare filename, directories have already been mapped */
1158 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1159 putstr("find_inode failed for name=");
1169 jffs2_1pass_rescan_needed(struct part_info *part)
1172 struct jffs2_unknown_node onode;
1173 struct jffs2_unknown_node *node;
1174 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1176 if (part->jffs2_priv == 0){
1177 DEBUGF ("rescan: First time in use\n");
1181 /* if we have no list, we need to rescan */
1182 if (pL->frag.listCount == 0) {
1183 DEBUGF ("rescan: fraglist zero\n");
1187 /* but suppose someone reflashed a partition at the same offset... */
1188 b = pL->dir.listHead;
1190 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1191 sizeof(onode), &onode);
1192 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1193 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1194 (unsigned long) b->offset);
1202 #ifdef CONFIG_JFFS2_SUMMARY
1203 static u32 sum_get_unaligned32(u32 *ptr)
1208 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1210 return __le32_to_cpu(val);
1213 static u16 sum_get_unaligned16(u16 *ptr)
1218 val = *p | (*(p + 1) << 8);
1220 return __le16_to_cpu(val);
1223 #define dbg_summary(...) do {} while (0);
1225 * Process the stored summary information - helper function for
1226 * jffs2_sum_scan_sumnode()
1229 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1230 struct jffs2_raw_summary *summary,
1237 for (pass = 0; pass < 2; pass++) {
1240 for (i = 0; i < summary->sum_num; i++) {
1241 struct jffs2_sum_unknown_flash *spu = sp;
1242 dbg_summary("processing summary index %d\n", i);
1244 switch (sum_get_unaligned16(&spu->nodetype)) {
1245 case JFFS2_NODETYPE_INODE: {
1246 struct jffs2_sum_inode_flash *spi;
1250 ret = insert_node(&pL->frag,
1253 sum_get_unaligned32(
1259 sp += JFFS2_SUMMARY_INODE_SIZE;
1263 case JFFS2_NODETYPE_DIRENT: {
1264 struct jffs2_sum_dirent_flash *spd;
1267 ret = insert_node(&pL->dir,
1268 (u32) part->offset +
1270 sum_get_unaligned32(
1276 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1282 uint16_t nodetype = sum_get_unaligned16(
1284 printf("Unsupported node type %x found"
1287 if ((nodetype & JFFS2_COMPAT_MASK) ==
1288 JFFS2_FEATURE_INCOMPAT)
1298 /* Process the summary node - called from jffs2_scan_eraseblock() */
1299 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1300 struct jffs2_raw_summary *summary, uint32_t sumsize,
1303 struct jffs2_unknown_node crcnode;
1307 ofs = part->sector_size - sumsize;
1309 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1310 offset, offset + ofs, sumsize);
1312 /* OK, now check for node validity and CRC */
1313 crcnode.magic = JFFS2_MAGIC_BITMASK;
1314 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1315 crcnode.totlen = summary->totlen;
1316 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1318 if (summary->hdr_crc != crc) {
1319 dbg_summary("Summary node header is corrupt (bad CRC or "
1320 "no summary at all)\n");
1324 if (summary->totlen != sumsize) {
1325 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1329 crc = crc32_no_comp(0, (uchar *)summary,
1330 sizeof(struct jffs2_raw_summary)-8);
1332 if (summary->node_crc != crc) {
1333 dbg_summary("Summary node is corrupt (bad CRC)\n");
1337 crc = crc32_no_comp(0, (uchar *)summary->sum,
1338 sumsize - sizeof(struct jffs2_raw_summary));
1340 if (summary->sum_crc != crc) {
1341 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1345 if (summary->cln_mkr)
1346 dbg_summary("Summary : CLEANMARKER node \n");
1348 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1349 if (ret == -EBADMSG)
1352 return ret; /* real error */
1357 putstr("Summary node crc error, skipping summary information.\n");
1361 #endif /* CONFIG_JFFS2_SUMMARY */
1363 #ifdef DEBUG_FRAGMENTS
1365 dump_fragments(struct b_lists *pL)
1368 struct jffs2_raw_inode ojNode;
1369 struct jffs2_raw_inode *jNode;
1371 putstr("\r\n\r\n******The fragment Entries******\r\n");
1372 b = pL->frag.listHead;
1374 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1375 sizeof(ojNode), &ojNode);
1376 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1377 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1378 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1379 putLabeledWord("\tbuild_list: version = ", jNode->version);
1380 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1381 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1382 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1383 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1384 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1385 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1386 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1387 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1388 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1394 #ifdef DEBUG_DIRENTS
1396 dump_dirents(struct b_lists *pL)
1399 struct jffs2_raw_dirent *jDir;
1401 putstr("\r\n\r\n******The directory Entries******\r\n");
1402 b = pL->dir.listHead;
1404 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1407 putnstr(jDir->name, jDir->nsize);
1408 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1409 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1410 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1411 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1412 putLabeledWord("\tbuild_list: version = ", jDir->version);
1413 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1414 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1415 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1416 putLabeledWord("\tbuild_list: type = ", jDir->type);
1417 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1418 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1419 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1421 put_fl_mem(jDir, pL->readbuf);
1426 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1428 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1430 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1433 return DEFAULT_EMPTY_SCAN_SIZE;
1437 jffs2_1pass_build_lists(struct part_info * part)
1440 struct jffs2_unknown_node *node;
1441 u32 nr_sectors = part->size/part->sector_size;
1447 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1450 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1451 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1452 /* only about 5 %. not enough to inconvenience people for. */
1455 /* if we are building a list we need to refresh the cache. */
1456 jffs_init_1pass_list(part);
1457 pL = (struct b_lists *)part->jffs2_priv;
1458 buf = malloc(buf_size);
1459 puts ("Scanning JFFS2 FS: ");
1461 /* start at the beginning of the partition */
1462 for (i = 0; i < nr_sectors; i++) {
1463 uint32_t sector_ofs = i * part->sector_size;
1464 uint32_t buf_ofs = sector_ofs;
1466 uint32_t ofs, prevofs;
1467 #ifdef CONFIG_JFFS2_SUMMARY
1468 struct jffs2_sum_marker *sm;
1469 void *sumptr = NULL;
1476 #ifdef CONFIG_JFFS2_SUMMARY
1477 buf_len = sizeof(*sm);
1479 /* Read as much as we want into the _end_ of the preallocated
1482 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1483 buf_len, buf_len, buf + buf_size - buf_len);
1485 sm = (void *)buf + buf_size - sizeof(*sm);
1486 if (sm->magic == JFFS2_SUM_MAGIC) {
1487 sumlen = part->sector_size - sm->offset;
1488 sumptr = buf + buf_size - sumlen;
1490 /* Now, make sure the summary itself is available */
1491 if (sumlen > buf_size) {
1492 /* Need to kmalloc for this. */
1493 sumptr = malloc(sumlen);
1495 putstr("Can't get memory for summary "
1498 jffs2_free_cache(part);
1501 memcpy(sumptr + sumlen - buf_len, buf +
1502 buf_size - buf_len, buf_len);
1504 if (buf_len < sumlen) {
1505 /* Need to read more so that the entire summary
1508 get_fl_mem(part->offset + sector_ofs +
1509 part->sector_size - sumlen,
1510 sumlen - buf_len, sumptr);
1515 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1518 if (buf_size && sumlen > buf_size)
1522 jffs2_free_cache(part);
1529 #endif /* CONFIG_JFFS2_SUMMARY */
1531 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1533 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1535 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1538 /* Scan only 4KiB of 0xFF before declaring it's empty */
1539 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1540 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1543 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1550 while (ofs < sector_ofs + part->sector_size) {
1551 if (ofs == prevofs) {
1552 printf("offset %08x already seen, skip\n", ofs);
1558 if (sector_ofs + part->sector_size <
1559 ofs + sizeof(*node))
1561 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1562 buf_len = min_t(uint32_t, buf_size, sector_ofs
1563 + part->sector_size - ofs);
1564 get_fl_mem((u32)part->offset + ofs, buf_len,
1569 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1571 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1576 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1577 part->sector_size)/8,
1580 inbuf_ofs = ofs - buf_ofs;
1581 while (inbuf_ofs < scan_end) {
1582 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1591 /* See how much more there is to read in this
1594 buf_len = min_t(uint32_t, buf_size,
1596 part->sector_size - ofs);
1598 /* No more to read. Break out of main
1599 * loop without marking this range of
1600 * empty space as dirty (because it's
1606 get_fl_mem((u32)part->offset + ofs, buf_len,
1611 if (node->magic != JFFS2_MAGIC_BITMASK ||
1617 if (ofs + node->totlen >
1618 sector_ofs + part->sector_size) {
1623 /* if its a fragment add it */
1624 switch (node->nodetype) {
1625 case JFFS2_NODETYPE_INODE:
1626 if (buf_ofs + buf_len < ofs + sizeof(struct
1628 get_fl_mem((u32)part->offset + ofs,
1633 if (!inode_crc((struct jffs2_raw_inode *) node))
1636 if (insert_node(&pL->frag, (u32) part->offset +
1639 jffs2_free_cache(part);
1642 if (max_totlen < node->totlen)
1643 max_totlen = node->totlen;
1645 case JFFS2_NODETYPE_DIRENT:
1646 if (buf_ofs + buf_len < ofs + sizeof(struct
1651 get_fl_mem((u32)part->offset + ofs,
1657 if (!dirent_crc((struct jffs2_raw_dirent *)
1664 if (! (counterN%100))
1666 if (insert_node(&pL->dir, (u32) part->offset +
1669 jffs2_free_cache(part);
1672 if (max_totlen < node->totlen)
1673 max_totlen = node->totlen;
1676 case JFFS2_NODETYPE_CLEANMARKER:
1677 if (node->totlen != sizeof(struct jffs2_unknown_node))
1678 printf("OOPS Cleanmarker has bad size "
1681 sizeof(struct jffs2_unknown_node));
1683 case JFFS2_NODETYPE_PADDING:
1684 if (node->totlen < sizeof(struct jffs2_unknown_node))
1685 printf("OOPS Padding has bad size "
1688 sizeof(struct jffs2_unknown_node));
1690 case JFFS2_NODETYPE_SUMMARY:
1693 printf("Unknown node type: %x len %d offset 0x%x\n",
1697 ofs += ((node->totlen + 3) & ~3);
1703 putstr("\b\b done.\r\n"); /* close off the dots */
1705 /* We don't care if malloc failed - then each read operation will
1706 * allocate its own buffer as necessary (NAND) or will read directly
1709 pL->readbuf = malloc(max_totlen);
1711 /* turn the lcd back on. */
1715 putLabeledWord("dir entries = ", pL->dir.listCount);
1716 putLabeledWord("frag entries = ", pL->frag.listCount);
1717 putLabeledWord("+4 increments = ", counter4);
1718 putLabeledWord("+file_offset increments = ", counterF);
1722 #ifdef DEBUG_DIRENTS
1726 #ifdef DEBUG_FRAGMENTS
1730 /* give visual feedback that we are done scanning the flash */
1731 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1737 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1740 struct jffs2_raw_inode ojNode;
1741 struct jffs2_raw_inode *jNode;
1744 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1745 piL->compr_info[i].num_frags = 0;
1746 piL->compr_info[i].compr_sum = 0;
1747 piL->compr_info[i].decompr_sum = 0;
1750 b = pL->frag.listHead;
1752 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1753 sizeof(ojNode), &ojNode);
1754 if (jNode->compr < JFFS2_NUM_COMPR) {
1755 piL->compr_info[jNode->compr].num_frags++;
1756 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1757 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1765 static struct b_lists *
1766 jffs2_get_list(struct part_info * part, const char *who)
1768 /* copy requested part_info struct pointer to global location */
1769 current_part = part;
1771 if (jffs2_1pass_rescan_needed(part)) {
1772 if (!jffs2_1pass_build_lists(part)) {
1773 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1777 return (struct b_lists *)part->jffs2_priv;
1781 /* Print directory / file contents */
1783 jffs2_1pass_ls(struct part_info * part, const char *fname)
1789 if (! (pl = jffs2_get_list(part, "ls")))
1792 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1793 putstr("ls: Failed to scan jffs2 file structure\r\n");
1799 putLabeledWord("found file at inode = ", inode);
1800 putLabeledWord("read_inode returns = ", ret);
1807 /* Load a file from flash into memory. fname can be a full path */
1809 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1816 if (! (pl = jffs2_get_list(part, "load")))
1819 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1820 putstr("load: Failed to find inode\r\n");
1824 /* Resolve symlinks */
1825 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1826 putstr("load: Failed to resolve inode structure\r\n");
1830 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1831 putstr("load: Failed to read inode\r\n");
1835 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1836 (unsigned long) dest, ret);
1840 /* Return information about the fs on this partition */
1842 jffs2_1pass_info(struct part_info * part)
1844 struct b_jffs2_info info;
1848 if (! (pl = jffs2_get_list(part, "info")))
1851 jffs2_1pass_fill_info(pl, &info);
1852 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1853 printf ("Compression: %s\n"
1854 "\tfrag count: %d\n"
1855 "\tcompressed sum: %d\n"
1856 "\tuncompressed sum: %d\n",
1858 info.compr_info[i].num_frags,
1859 info.compr_info[i].compr_sum,
1860 info.compr_info[i].decompr_sum);