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>
123 #include "jffs2_private.h"
126 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
127 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
129 /* Debugging switches */
130 #undef DEBUG_DIRENTS /* print directory entry list after scan */
131 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
132 #undef DEBUG /* enable debugging messages */
136 # define DEBUGF(fmt,args...) printf(fmt ,##args)
138 # define DEBUGF(fmt,args...)
143 /* keeps pointer to currentlu processed partition */
144 static struct part_info *current_part;
146 #if (defined(CONFIG_JFFS2_NAND) && \
147 defined(CONFIG_CMD_NAND) )
148 #if defined(CONFIG_NAND_LEGACY)
149 #include <linux/mtd/nand_legacy.h>
154 * Support for jffs2 on top of NAND-flash
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
163 #if defined(CONFIG_NAND_LEGACY)
164 /* this one defined in nand_legacy.c */
165 int read_jffs2_nand(size_t start, size_t len,
166 size_t * retlen, u_char * buf, int nanddev);
169 #define NAND_PAGE_SIZE 512
170 #define NAND_PAGE_SHIFT 9
171 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
173 #ifndef NAND_CACHE_PAGES
174 #define NAND_CACHE_PAGES 16
176 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
178 static u8* nand_cache = NULL;
179 static u32 nand_cache_off = (u32)-1;
181 static int read_nand_cached(u32 off, u32 size, u_char *buf)
183 struct mtdids *id = current_part->dev->id;
188 while (bytes_read < size) {
189 if ((off + bytes_read < nand_cache_off) ||
190 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
191 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
193 /* This memory never gets freed but 'cause
194 it's a bootloader, nobody cares */
195 nand_cache = malloc(NAND_CACHE_SIZE);
197 printf("read_nand_cached: can't alloc cache size %d bytes\n",
203 #if defined(CONFIG_NAND_LEGACY)
204 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
205 &retlen, nand_cache, id->num) < 0 ||
206 retlen != NAND_CACHE_SIZE) {
207 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
208 nand_cache_off, NAND_CACHE_SIZE);
212 retlen = NAND_CACHE_SIZE;
213 if (nand_read(&nand_info[id->num], nand_cache_off,
214 &retlen, nand_cache) != 0 ||
215 retlen != NAND_CACHE_SIZE) {
216 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
217 nand_cache_off, NAND_CACHE_SIZE);
222 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
223 if (cpy_bytes > size - bytes_read)
224 cpy_bytes = size - bytes_read;
225 memcpy(buf + bytes_read,
226 nand_cache + off + bytes_read - nand_cache_off,
228 bytes_read += cpy_bytes;
233 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
235 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
238 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
241 if (read_nand_cached(off, size, buf) < 0) {
250 static void *get_node_mem_nand(u32 off, void *ext_buf)
252 struct jffs2_unknown_node node;
255 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
258 if (!(ret = get_fl_mem_nand(off, node.magic ==
259 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
261 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
262 off, node.magic, node.nodetype, node.totlen);
267 static void put_fl_mem_nand(void *buf)
273 #if defined(CONFIG_CMD_ONENAND)
275 #include <linux/mtd/mtd.h>
276 #include <linux/mtd/onenand.h>
277 #include <onenand_uboot.h>
279 #define ONENAND_PAGE_SIZE 2048
280 #define ONENAND_PAGE_SHIFT 11
281 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
283 #ifndef ONENAND_CACHE_PAGES
284 #define ONENAND_CACHE_PAGES 4
286 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
288 static u8* onenand_cache;
289 static u32 onenand_cache_off = (u32)-1;
291 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
297 while (bytes_read < size) {
298 if ((off + bytes_read < onenand_cache_off) ||
299 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
300 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
301 if (!onenand_cache) {
302 /* This memory never gets freed but 'cause
303 it's a bootloader, nobody cares */
304 onenand_cache = malloc(ONENAND_CACHE_SIZE);
305 if (!onenand_cache) {
306 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
312 retlen = ONENAND_CACHE_SIZE;
313 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
314 &retlen, onenand_cache) != 0 ||
315 retlen != ONENAND_CACHE_SIZE) {
316 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
317 onenand_cache_off, ONENAND_CACHE_SIZE);
321 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
322 if (cpy_bytes > size - bytes_read)
323 cpy_bytes = size - bytes_read;
324 memcpy(buf + bytes_read,
325 onenand_cache + off + bytes_read - onenand_cache_off,
327 bytes_read += cpy_bytes;
332 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
334 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
337 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
340 if (read_onenand_cached(off, size, buf) < 0) {
349 static void *get_node_mem_onenand(u32 off, void *ext_buf)
351 struct jffs2_unknown_node node;
354 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
357 ret = get_fl_mem_onenand(off, node.magic ==
358 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
361 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
362 off, node.magic, node.nodetype, node.totlen);
368 static void put_fl_mem_onenand(void *buf)
375 #if defined(CONFIG_CMD_FLASH)
377 * Support for jffs2 on top of NOR-flash
379 * NOR flash memory is mapped in processor's address space,
380 * just return address.
382 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
385 struct mtdids *id = current_part->dev->id;
387 extern flash_info_t flash_info[];
388 flash_info_t *flash = &flash_info[id->num];
390 addr += flash->start[0];
392 memcpy(ext_buf, (void *)addr, size);
398 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
400 struct jffs2_unknown_node *pNode;
402 /* pNode will point directly to flash - don't provide external buffer
403 and don't care about size */
404 pNode = get_fl_mem_nor(off, 0, NULL);
405 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
406 pNode->totlen : sizeof(*pNode), ext_buf);
412 * Generic jffs2 raw memory and node read routines.
415 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
417 struct mtdids *id = current_part->dev->id;
419 #if defined(CONFIG_CMD_FLASH)
420 if (id->type == MTD_DEV_TYPE_NOR) {
421 return get_fl_mem_nor(off, size, ext_buf);
425 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
426 if (id->type == MTD_DEV_TYPE_NAND)
427 return get_fl_mem_nand(off, size, ext_buf);
430 #if defined(CONFIG_CMD_ONENAND)
431 if (id->type == MTD_DEV_TYPE_ONENAND)
432 return get_fl_mem_onenand(off, size, ext_buf);
435 printf("get_fl_mem: unknown device type, using raw offset!\n");
439 static inline void *get_node_mem(u32 off, void *ext_buf)
441 struct mtdids *id = current_part->dev->id;
443 #if defined(CONFIG_CMD_FLASH)
444 if (id->type == MTD_DEV_TYPE_NOR)
445 return get_node_mem_nor(off, ext_buf);
448 #if defined(CONFIG_JFFS2_NAND) && \
449 defined(CONFIG_CMD_NAND)
450 if (id->type == MTD_DEV_TYPE_NAND)
451 return get_node_mem_nand(off, ext_buf);
454 #if defined(CONFIG_CMD_ONENAND)
455 if (id->type == MTD_DEV_TYPE_ONENAND)
456 return get_node_mem_onenand(off, ext_buf);
459 printf("get_node_mem: unknown device type, using raw offset!\n");
463 static inline void put_fl_mem(void *buf, void *ext_buf)
465 struct mtdids *id = current_part->dev->id;
467 /* If buf is the same as ext_buf, it was provided by the caller -
468 we shouldn't free it then. */
472 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
473 case MTD_DEV_TYPE_NAND:
474 return put_fl_mem_nand(buf);
476 #if defined(CONFIG_CMD_ONENAND)
477 case MTD_DEV_TYPE_ONENAND:
478 return put_fl_mem_onenand(buf);
483 /* Compression names */
484 static char *compr_names[] = {
492 #if defined(CONFIG_JFFS2_LZO_LZARI)
498 /* Memory management */
501 struct mem_block *next;
502 struct b_node nodes[NODE_CHUNK];
507 free_nodes(struct b_list *list)
509 while (list->listMemBase != NULL) {
510 struct mem_block *next = list->listMemBase->next;
511 free( list->listMemBase );
512 list->listMemBase = next;
516 static struct b_node *
517 add_node(struct b_list *list)
520 struct mem_block *memBase;
523 memBase = list->listMemBase;
525 index = memBase->index;
527 putLabeledWord("add_node: index = ", index);
528 putLabeledWord("add_node: memBase = ", list->listMemBase);
531 if (memBase == NULL || index >= NODE_CHUNK) {
532 /* we need more space before we continue */
533 memBase = mmalloc(sizeof(struct mem_block));
534 if (memBase == NULL) {
535 putstr("add_node: malloc failed\n");
538 memBase->next = list->listMemBase;
541 putLabeledWord("add_node: alloced a new membase at ", *memBase);
545 /* now we have room to add it. */
546 b = &memBase->nodes[index];
549 memBase->index = index;
550 list->listMemBase = memBase;
555 static struct b_node *
556 insert_node(struct b_list *list, u32 offset)
559 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
560 struct b_node *b, *prev;
563 if (!(new = add_node(list))) {
564 putstr("add_node failed!\r\n");
567 new->offset = offset;
569 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
570 if (list->listTail != NULL && list->listCompare(new, list->listTail))
571 prev = list->listTail;
572 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
573 prev = list->listLast;
577 for (b = (prev ? prev->next : list->listHead);
578 b != NULL && list->listCompare(new, b);
579 prev = b, b = b->next) {
583 list->listLast = prev;
590 list->listHead = new;
594 new->next = (struct b_node *) NULL;
595 if (list->listTail != NULL) {
596 list->listTail->next = new;
597 list->listTail = new;
599 list->listTail = list->listHead = new;
606 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
607 /* Sort data entries with the latest version last, so that if there
608 * is overlapping data the latest version will be used.
610 static int compare_inodes(struct b_node *new, struct b_node *old)
612 struct jffs2_raw_inode ojNew;
613 struct jffs2_raw_inode ojOld;
614 struct jffs2_raw_inode *jNew =
615 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
616 struct jffs2_raw_inode *jOld =
617 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
619 return jNew->version > jOld->version;
622 /* Sort directory entries so all entries in the same directory
623 * with the same name are grouped together, with the latest version
624 * last. This makes it easy to eliminate all but the latest version
625 * by marking the previous version dead by setting the inode to 0.
627 static int compare_dirents(struct b_node *new, struct b_node *old)
629 struct jffs2_raw_dirent ojNew;
630 struct jffs2_raw_dirent ojOld;
631 struct jffs2_raw_dirent *jNew =
632 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
633 struct jffs2_raw_dirent *jOld =
634 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
637 /* ascending sort by pino */
638 if (jNew->pino != jOld->pino)
639 return jNew->pino > jOld->pino;
641 /* pino is the same, so use ascending sort by nsize, so
642 * we don't do strncmp unless we really must.
644 if (jNew->nsize != jOld->nsize)
645 return jNew->nsize > jOld->nsize;
647 /* length is also the same, so use ascending sort by name
649 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
653 /* we have duplicate names in this directory, so use ascending
656 if (jNew->version > jOld->version) {
657 /* since jNew is newer, we know jOld is not valid, so
658 * mark it with inode 0 and it will not be used
669 jffs2_free_cache(struct part_info *part)
673 if (part->jffs2_priv != NULL) {
674 pL = (struct b_lists *)part->jffs2_priv;
675 free_nodes(&pL->frag);
676 free_nodes(&pL->dir);
683 jffs_init_1pass_list(struct part_info *part)
687 jffs2_free_cache(part);
689 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
690 pL = (struct b_lists *)part->jffs2_priv;
692 memset(pL, 0, sizeof(*pL));
693 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
694 pL->dir.listCompare = compare_dirents;
695 pL->frag.listCompare = compare_inodes;
701 /* find the inode from the slashless name given a parent */
703 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
706 struct jffs2_raw_inode *jNode;
708 u32 latestVersion = 0;
714 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
715 /* Find file size before loading any data, so fragments that
716 * start past the end of file can be ignored. A fragment
717 * that is partially in the file is loaded, so extra data may
718 * be loaded up to the next 4K boundary above the file size.
719 * This shouldn't cause trouble when loading kernel images, so
720 * we will live with it.
722 for (b = pL->frag.listHead; b != NULL; b = b->next) {
723 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
724 sizeof(struct jffs2_raw_inode), pL->readbuf);
725 if ((inode == jNode->ino)) {
726 /* get actual file length from the newest node */
727 if (jNode->version >= latestVersion) {
728 totalSize = jNode->isize;
729 latestVersion = jNode->version;
732 put_fl_mem(jNode, pL->readbuf);
736 for (b = pL->frag.listHead; b != NULL; b = b->next) {
737 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
739 if ((inode == jNode->ino)) {
741 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
742 putLabeledWord("read_inode: inode = ", jNode->ino);
743 putLabeledWord("read_inode: version = ", jNode->version);
744 putLabeledWord("read_inode: isize = ", jNode->isize);
745 putLabeledWord("read_inode: offset = ", jNode->offset);
746 putLabeledWord("read_inode: csize = ", jNode->csize);
747 putLabeledWord("read_inode: dsize = ", jNode->dsize);
748 putLabeledWord("read_inode: compr = ", jNode->compr);
749 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
750 putLabeledWord("read_inode: flags = ", jNode->flags);
753 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
754 /* get actual file length from the newest node */
755 if (jNode->version >= latestVersion) {
756 totalSize = jNode->isize;
757 latestVersion = jNode->version;
762 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
763 /* ignore data behind latest known EOF */
764 if (jNode->offset > totalSize) {
765 put_fl_mem(jNode, pL->readbuf);
768 if (b->datacrc == CRC_UNKNOWN)
769 b->datacrc = data_crc(jNode) ?
771 if (b->datacrc == CRC_BAD) {
772 put_fl_mem(jNode, pL->readbuf);
776 lDest = (uchar *) (dest + jNode->offset);
778 putLabeledWord("read_inode: src = ", src);
779 putLabeledWord("read_inode: dest = ", lDest);
781 switch (jNode->compr) {
782 case JFFS2_COMPR_NONE:
783 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
785 case JFFS2_COMPR_ZERO:
787 for (i = 0; i < jNode->dsize; i++)
790 case JFFS2_COMPR_RTIME:
792 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
794 case JFFS2_COMPR_DYNRUBIN:
795 /* this is slow but it works */
797 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
799 case JFFS2_COMPR_ZLIB:
800 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
802 #if defined(CONFIG_JFFS2_LZO_LZARI)
803 case JFFS2_COMPR_LZO:
804 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
806 case JFFS2_COMPR_LZARI:
807 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
812 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
813 put_fl_mem(jNode, pL->readbuf);
820 putLabeledWord("read_inode: totalSize = ", totalSize);
821 putLabeledWord("read_inode: compr ret = ", ret);
825 put_fl_mem(jNode, pL->readbuf);
829 putLabeledWord("read_inode: returning = ", totalSize);
834 /* find the inode from the slashless name given a parent */
836 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
839 struct jffs2_raw_dirent *jDir;
845 /* name is assumed slash free */
849 /* we need to search all and return the inode with the highest version */
850 for(b = pL->dir.listHead; b; b = b->next, counter++) {
851 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
853 if ((pino == jDir->pino) && (len == jDir->nsize) &&
854 (jDir->ino) && /* 0 for unlink */
855 (!strncmp((char *)jDir->name, name, len))) { /* a match */
856 if (jDir->version < version) {
857 put_fl_mem(jDir, pL->readbuf);
861 if (jDir->version == version && inode != 0) {
862 /* I'm pretty sure this isn't legal */
863 putstr(" ** ERROR ** ");
864 putnstr(jDir->name, jDir->nsize);
865 putLabeledWord(" has dup version =", version);
868 version = jDir->version;
871 putstr("\r\nfind_inode:p&l ->");
872 putnstr(jDir->name, jDir->nsize);
874 putLabeledWord("pino = ", jDir->pino);
875 putLabeledWord("nsize = ", jDir->nsize);
876 putLabeledWord("b = ", (u32) b);
877 putLabeledWord("counter = ", counter);
879 put_fl_mem(jDir, pL->readbuf);
884 char *mkmodestr(unsigned long mode, char *str)
886 static const char *l = "xwr";
890 switch (mode & S_IFMT) {
891 case S_IFDIR: str[0] = 'd'; break;
892 case S_IFBLK: str[0] = 'b'; break;
893 case S_IFCHR: str[0] = 'c'; break;
894 case S_IFIFO: str[0] = 'f'; break;
895 case S_IFLNK: str[0] = 'l'; break;
896 case S_IFSOCK: str[0] = 's'; break;
897 case S_IFREG: str[0] = '-'; break;
898 default: str[0] = '?';
901 for(i = 0; i < 9; i++) {
903 str[9-i] = (mode & mask)?c:'-';
907 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
908 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
909 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
914 static inline void dump_stat(struct stat *st, const char *name)
919 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
922 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
924 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
925 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
928 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
929 st->st_size, s, name);
932 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
935 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
940 if(!d || !i) return -1;
942 strncpy(fname, (char *)d->name, d->nsize);
943 fname[d->nsize] = '\0';
945 memset(&st,0,sizeof(st));
947 st.st_mtime = i->mtime;
948 st.st_mode = i->mode;
950 st.st_size = i->isize;
952 dump_stat(&st, fname);
954 if (d->type == DT_LNK) {
955 unsigned char *src = (unsigned char *) (&i[1]);
957 putnstr(src, (int)i->dsize);
965 /* list inodes with the given pino */
967 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
970 struct jffs2_raw_dirent *jDir;
972 for (b = pL->dir.listHead; b; b = b->next) {
973 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
975 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
977 struct jffs2_raw_inode ojNode;
978 struct jffs2_raw_inode *jNode, *i = NULL;
979 struct b_node *b2 = pL->frag.listHead;
982 jNode = (struct jffs2_raw_inode *)
983 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
984 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
985 i_version = jNode->version;
989 if (jDir->type == DT_LNK)
990 i = get_node_mem(b2->offset,
993 i = get_fl_mem(b2->offset,
1000 dump_inode(pL, jDir, i);
1001 put_fl_mem(i, NULL);
1003 put_fl_mem(jDir, pL->readbuf);
1009 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1013 char working_tmp[256];
1016 /* discard any leading slash */
1018 while (fname[i] == '/')
1020 strcpy(tmp, &fname[i]);
1022 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1024 strncpy(working_tmp, tmp, c - tmp);
1025 working_tmp[c - tmp] = '\0';
1027 putstr("search_inode: tmp = ");
1030 putstr("search_inode: wtmp = ");
1031 putstr(working_tmp);
1033 putstr("search_inode: c = ");
1037 for (i = 0; i < strlen(c) - 1; i++)
1041 putstr("search_inode: post tmp = ");
1046 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1047 putstr("find_inode failed for name=");
1048 putstr(working_tmp);
1053 /* this is for the bare filename, directories have already been mapped */
1054 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1055 putstr("find_inode failed for name=");
1065 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1069 struct jffs2_raw_dirent *jDir;
1070 struct jffs2_raw_inode *jNode;
1071 u8 jDirFoundType = 0;
1072 u32 jDirFoundIno = 0;
1073 u32 jDirFoundPino = 0;
1079 /* we need to search all and return the inode with the highest version */
1080 for(b = pL->dir.listHead; b; b = b->next) {
1081 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1083 if (ino == jDir->ino) {
1084 if (jDir->version < version) {
1085 put_fl_mem(jDir, pL->readbuf);
1089 if (jDir->version == version && jDirFoundType) {
1090 /* I'm pretty sure this isn't legal */
1091 putstr(" ** ERROR ** ");
1092 putnstr(jDir->name, jDir->nsize);
1093 putLabeledWord(" has dup version (resolve) = ",
1097 jDirFoundType = jDir->type;
1098 jDirFoundIno = jDir->ino;
1099 jDirFoundPino = jDir->pino;
1100 version = jDir->version;
1102 put_fl_mem(jDir, pL->readbuf);
1104 /* now we found the right entry again. (shoulda returned inode*) */
1105 if (jDirFoundType != DT_LNK)
1106 return jDirFoundIno;
1108 /* it's a soft link so we follow it again. */
1109 b2 = pL->frag.listHead;
1111 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1113 if (jNode->ino == jDirFoundIno) {
1114 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1117 putLabeledWord("\t\t dsize = ", jNode->dsize);
1118 putstr("\t\t target = ");
1119 putnstr(src, jNode->dsize);
1122 strncpy(tmp, (char *)src, jNode->dsize);
1123 tmp[jNode->dsize] = '\0';
1124 put_fl_mem(jNode, pL->readbuf);
1128 put_fl_mem(jNode, pL->readbuf);
1130 /* ok so the name of the new file to find is in tmp */
1131 /* if it starts with a slash it is root based else shared dirs */
1135 pino = jDirFoundPino;
1137 return jffs2_1pass_search_inode(pL, tmp, pino);
1141 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1145 char working_tmp[256];
1148 /* discard any leading slash */
1150 while (fname[i] == '/')
1152 strcpy(tmp, &fname[i]);
1153 working_tmp[0] = '\0';
1154 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1156 strncpy(working_tmp, tmp, c - tmp);
1157 working_tmp[c - tmp] = '\0';
1158 for (i = 0; i < strlen(c) - 1; i++)
1161 /* only a failure if we arent looking at top level */
1162 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1164 putstr("find_inode failed for name=");
1165 putstr(working_tmp);
1171 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1172 putstr("find_inode failed for name=");
1177 /* this is for the bare filename, directories have already been mapped */
1178 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1179 putstr("find_inode failed for name=");
1189 jffs2_1pass_rescan_needed(struct part_info *part)
1192 struct jffs2_unknown_node onode;
1193 struct jffs2_unknown_node *node;
1194 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1196 if (part->jffs2_priv == 0){
1197 DEBUGF ("rescan: First time in use\n");
1201 /* if we have no list, we need to rescan */
1202 if (pL->frag.listCount == 0) {
1203 DEBUGF ("rescan: fraglist zero\n");
1207 /* but suppose someone reflashed a partition at the same offset... */
1208 b = pL->dir.listHead;
1210 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1211 sizeof(onode), &onode);
1212 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1213 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1214 (unsigned long) b->offset);
1222 #define dbg_summary(...) do {} while (0);
1223 /* Process the stored summary information - helper function for
1224 * jffs2_sum_scan_sumnode()
1227 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1228 struct jffs2_raw_summary *summary,
1236 for (i = 0; i < summary->sum_num; i++) {
1237 dbg_summary("processing summary index %d\n", i);
1239 switch (((struct jffs2_sum_unknown_flash *)sp)->nodetype) {
1240 case JFFS2_NODETYPE_INODE: {
1241 struct jffs2_sum_inode_flash *spi;
1244 dbg_summary("Inode at 0x%08x-0x%08x\n",
1245 offset + spi->offset,
1246 offset + spi->offset + spi->totlen);
1248 if (insert_node(&pL->frag, (u32) part->offset +
1249 offset + spi->offset) == NULL)
1252 sp += JFFS2_SUMMARY_INODE_SIZE;
1257 case JFFS2_NODETYPE_DIRENT: {
1258 struct jffs2_sum_dirent_flash *spd;
1261 dbg_summary("Dirent at 0x%08x-0x%08x\n",
1262 offset + spd->offset,
1263 offset + spd->offset + spd->totlen);
1265 if (insert_node(&pL->dir, (u32) part->offset +
1266 offset + spd->offset) == NULL)
1269 sp += JFFS2_SUMMARY_DIRENT_SIZE(spd->nsize);
1275 ((struct jffs2_sum_unknown_flash *)
1277 printf("Unsupported node type %x found in "
1278 "summary!\n", nodetype);
1286 /* Process the summary node - called from jffs2_scan_eraseblock() */
1287 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1288 struct jffs2_raw_summary *summary, uint32_t sumsize,
1291 struct jffs2_unknown_node crcnode;
1295 ofs = part->sector_size - sumsize;
1297 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1298 offset, offset + ofs, sumsize);
1300 /* OK, now check for node validity and CRC */
1301 crcnode.magic = JFFS2_MAGIC_BITMASK;
1302 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1303 crcnode.totlen = summary->totlen;
1304 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1306 if (summary->hdr_crc != crc) {
1307 dbg_summary("Summary node header is corrupt (bad CRC or "
1308 "no summary at all)\n");
1312 if (summary->totlen != sumsize) {
1313 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1317 crc = crc32_no_comp(0, (uchar *)summary,
1318 sizeof(struct jffs2_raw_summary)-8);
1320 if (summary->node_crc != crc) {
1321 dbg_summary("Summary node is corrupt (bad CRC)\n");
1325 crc = crc32_no_comp(0, (uchar *)summary->sum,
1326 sumsize - sizeof(struct jffs2_raw_summary));
1328 if (summary->sum_crc != crc) {
1329 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1333 if (summary->cln_mkr)
1334 dbg_summary("Summary : CLEANMARKER node \n");
1336 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1338 return ret; /* real error */
1343 putstr("Summary node crc error, skipping summary information.\n");
1348 #ifdef DEBUG_FRAGMENTS
1350 dump_fragments(struct b_lists *pL)
1353 struct jffs2_raw_inode ojNode;
1354 struct jffs2_raw_inode *jNode;
1356 putstr("\r\n\r\n******The fragment Entries******\r\n");
1357 b = pL->frag.listHead;
1359 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1360 sizeof(ojNode), &ojNode);
1361 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1362 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1363 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1364 putLabeledWord("\tbuild_list: version = ", jNode->version);
1365 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1366 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1367 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1368 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1369 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1370 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1371 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1372 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1373 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1379 #ifdef DEBUG_DIRENTS
1381 dump_dirents(struct b_lists *pL)
1384 struct jffs2_raw_dirent *jDir;
1386 putstr("\r\n\r\n******The directory Entries******\r\n");
1387 b = pL->dir.listHead;
1389 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1392 putnstr(jDir->name, jDir->nsize);
1393 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1394 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1395 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1396 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1397 putLabeledWord("\tbuild_list: version = ", jDir->version);
1398 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1399 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1400 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1401 putLabeledWord("\tbuild_list: type = ", jDir->type);
1402 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1403 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1404 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1406 put_fl_mem(jDir, pL->readbuf);
1411 #define min_t(type, x, y) ({ \
1412 type __min1 = (x); \
1413 type __min2 = (y); \
1414 __min1 < __min2 ? __min1: __min2; })
1416 #define DEFAULT_EMPTY_SCAN_SIZE 4096
1418 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1420 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1423 return DEFAULT_EMPTY_SCAN_SIZE;
1427 jffs2_1pass_build_lists(struct part_info * part)
1430 struct jffs2_unknown_node *node;
1431 u32 nr_sectors = part->size/part->sector_size;
1437 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1440 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1441 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1442 /* only about 5 %. not enough to inconvenience people for. */
1445 /* if we are building a list we need to refresh the cache. */
1446 jffs_init_1pass_list(part);
1447 pL = (struct b_lists *)part->jffs2_priv;
1448 buf = malloc(buf_size);
1449 puts ("Scanning JFFS2 FS: ");
1451 /* start at the beginning of the partition */
1452 for (i = 0; i < nr_sectors; i++) {
1453 uint32_t sector_ofs = i * part->sector_size;
1454 uint32_t buf_ofs = sector_ofs;
1456 uint32_t ofs, prevofs;
1457 struct jffs2_sum_marker *sm;
1458 void *sumptr = NULL;
1464 buf_len = sizeof(*sm);
1466 /* Read as much as we want into the _end_ of the preallocated
1469 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1470 buf_len, buf_len, buf + buf_size - buf_len);
1472 sm = (void *)buf + buf_size - sizeof(*sm);
1473 if (sm->magic == JFFS2_SUM_MAGIC) {
1474 sumlen = part->sector_size - sm->offset;
1475 sumptr = buf + buf_size - sumlen;
1477 /* Now, make sure the summary itself is available */
1478 if (sumlen > buf_size) {
1479 /* Need to kmalloc for this. */
1480 sumptr = malloc(sumlen);
1482 putstr("Can't get memory for summary "
1486 memcpy(sumptr + sumlen - buf_len, buf +
1487 buf_size - buf_len, buf_len);
1489 if (buf_len < sumlen) {
1490 /* Need to read more so that the entire summary
1493 get_fl_mem(part->offset + sector_ofs +
1494 part->sector_size - sumlen,
1495 sumlen - buf_len, sumptr);
1500 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1503 if (buf_size && sumlen > buf_size)
1512 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1514 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1516 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1519 /* Scan only 4KiB of 0xFF before declaring it's empty */
1520 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1521 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1524 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1531 while (ofs < sector_ofs + part->sector_size) {
1532 if (ofs == prevofs) {
1533 printf("offset %08x already seen, skip\n", ofs);
1539 if (sector_ofs + part->sector_size <
1540 ofs + sizeof(*node))
1542 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1543 buf_len = min_t(uint32_t, buf_size, sector_ofs
1544 + part->sector_size - ofs);
1545 get_fl_mem((u32)part->offset + ofs, buf_len,
1550 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1552 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1554 uint32_t empty_start, scan_end;
1558 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1559 part->sector_size)/8,
1562 inbuf_ofs = ofs - buf_ofs;
1563 while (inbuf_ofs < scan_end) {
1564 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1573 /* See how much more there is to read in this
1576 buf_len = min_t(uint32_t, buf_size,
1578 part->sector_size - ofs);
1580 /* No more to read. Break out of main
1581 * loop without marking this range of
1582 * empty space as dirty (because it's
1588 get_fl_mem((u32)part->offset + ofs, buf_len,
1593 if (node->magic != JFFS2_MAGIC_BITMASK ||
1599 if (ofs + node->totlen >
1600 sector_ofs + part->sector_size) {
1605 /* if its a fragment add it */
1606 switch (node->nodetype) {
1607 case JFFS2_NODETYPE_INODE:
1608 if (buf_ofs + buf_len < ofs + sizeof(struct
1610 get_fl_mem((u32)part->offset + ofs,
1615 if (!inode_crc((struct jffs2_raw_inode *) node))
1618 if (insert_node(&pL->frag, (u32) part->offset +
1621 if (max_totlen < node->totlen)
1622 max_totlen = node->totlen;
1624 case JFFS2_NODETYPE_DIRENT:
1625 if (buf_ofs + buf_len < ofs + sizeof(struct
1630 get_fl_mem((u32)part->offset + ofs,
1636 if (!dirent_crc((struct jffs2_raw_dirent *)
1643 if (! (counterN%100))
1645 if (insert_node(&pL->dir, (u32) part->offset +
1648 if (max_totlen < node->totlen)
1649 max_totlen = node->totlen;
1652 case JFFS2_NODETYPE_CLEANMARKER:
1653 if (node->totlen != sizeof(struct jffs2_unknown_node))
1654 printf("OOPS Cleanmarker has bad size "
1657 sizeof(struct jffs2_unknown_node));
1659 case JFFS2_NODETYPE_PADDING:
1660 if (node->totlen < sizeof(struct jffs2_unknown_node))
1661 printf("OOPS Padding has bad size "
1664 sizeof(struct jffs2_unknown_node));
1666 case JFFS2_NODETYPE_SUMMARY:
1669 printf("Unknown node type: %x len %d offset 0x%x\n",
1673 ofs += ((node->totlen + 3) & ~3);
1679 putstr("\b\b done.\r\n"); /* close off the dots */
1681 /* We don't care if malloc failed - then each read operation will
1682 * allocate its own buffer as necessary (NAND) or will read directly
1685 pL->readbuf = malloc(max_totlen);
1687 /* turn the lcd back on. */
1691 putLabeledWord("dir entries = ", pL->dir.listCount);
1692 putLabeledWord("frag entries = ", pL->frag.listCount);
1693 putLabeledWord("+4 increments = ", counter4);
1694 putLabeledWord("+file_offset increments = ", counterF);
1698 #ifdef DEBUG_DIRENTS
1702 #ifdef DEBUG_FRAGMENTS
1706 /* give visual feedback that we are done scanning the flash */
1707 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1713 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1716 struct jffs2_raw_inode ojNode;
1717 struct jffs2_raw_inode *jNode;
1720 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1721 piL->compr_info[i].num_frags = 0;
1722 piL->compr_info[i].compr_sum = 0;
1723 piL->compr_info[i].decompr_sum = 0;
1726 b = pL->frag.listHead;
1728 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1729 sizeof(ojNode), &ojNode);
1730 if (jNode->compr < JFFS2_NUM_COMPR) {
1731 piL->compr_info[jNode->compr].num_frags++;
1732 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1733 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1741 static struct b_lists *
1742 jffs2_get_list(struct part_info * part, const char *who)
1744 /* copy requested part_info struct pointer to global location */
1745 current_part = part;
1747 if (jffs2_1pass_rescan_needed(part)) {
1748 if (!jffs2_1pass_build_lists(part)) {
1749 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1753 return (struct b_lists *)part->jffs2_priv;
1757 /* Print directory / file contents */
1759 jffs2_1pass_ls(struct part_info * part, const char *fname)
1765 if (! (pl = jffs2_get_list(part, "ls")))
1768 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1769 putstr("ls: Failed to scan jffs2 file structure\r\n");
1775 putLabeledWord("found file at inode = ", inode);
1776 putLabeledWord("read_inode returns = ", ret);
1783 /* Load a file from flash into memory. fname can be a full path */
1785 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1792 if (! (pl = jffs2_get_list(part, "load")))
1795 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1796 putstr("load: Failed to find inode\r\n");
1800 /* Resolve symlinks */
1801 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1802 putstr("load: Failed to resolve inode structure\r\n");
1806 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1807 putstr("load: Failed to read inode\r\n");
1811 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1812 (unsigned long) dest, ret);
1816 /* Return information about the fs on this partition */
1818 jffs2_1pass_info(struct part_info * part)
1820 struct b_jffs2_info info;
1824 if (! (pl = jffs2_get_list(part, "info")))
1827 jffs2_1pass_fill_info(pl, &info);
1828 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1829 printf ("Compression: %s\n"
1830 "\tfrag count: %d\n"
1831 "\tcompressed sum: %d\n"
1832 "\tuncompressed sum: %d\n",
1834 info.compr_info[i].num_frags,
1835 info.compr_info[i].compr_sum,
1836 info.compr_info[i].decompr_sum);