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/compiler.h>
119 #include <linux/stat.h>
120 #include <linux/time.h>
121 #include <u-boot/crc.h>
122 #include <watchdog.h>
123 #include <jffs2/jffs2.h>
124 #include <jffs2/jffs2_1pass.h>
125 #include <linux/compat.h>
126 #include <linux/errno.h>
128 #include "jffs2_private.h"
131 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
132 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
134 /* Debugging switches */
135 #undef DEBUG_DIRENTS /* print directory entry list after scan */
136 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
137 #undef DEBUG /* enable debugging messages */
141 # define DEBUGF(fmt,args...) printf(fmt ,##args)
143 # define DEBUGF(fmt,args...)
148 /* keeps pointer to currentlu processed partition */
149 static struct part_info *current_part;
151 #if (defined(CONFIG_JFFS2_NAND) && \
152 defined(CONFIG_CMD_NAND) )
155 * Support for jffs2 on top of NAND-flash
157 * NAND memory isn't mapped in processor's address space,
158 * so data should be fetched from flash before
159 * being processed. This is exactly what functions declared
164 #define NAND_PAGE_SIZE 512
165 #define NAND_PAGE_SHIFT 9
166 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
168 #ifndef NAND_CACHE_PAGES
169 #define NAND_CACHE_PAGES 16
171 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
173 static u8* nand_cache = NULL;
174 static u32 nand_cache_off = (u32)-1;
176 static int read_nand_cached(u32 off, u32 size, u_char *buf)
178 struct mtdids *id = current_part->dev->id;
179 struct mtd_info *mtd;
185 mtd = get_nand_dev_by_index(id->num);
189 while (bytes_read < size) {
190 retlen = NAND_CACHE_SIZE;
191 if( nand_cache_off + retlen > mtd->size )
192 retlen = mtd->size - nand_cache_off;
194 if ((off + bytes_read < nand_cache_off) ||
195 (off + bytes_read >= nand_cache_off + retlen)) {
196 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
198 /* This memory never gets freed but 'cause
199 it's a bootloader, nobody cares */
200 nand_cache = malloc(NAND_CACHE_SIZE);
202 printf("read_nand_cached: can't alloc cache size %d bytes\n",
208 toread = NAND_CACHE_SIZE;
209 if( nand_cache_off + toread > mtd->size )
210 toread = mtd->size - nand_cache_off;
213 if (nand_read(mtd, nand_cache_off,
214 &retlen, nand_cache) < 0 ||
216 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
217 nand_cache_off, toread);
221 cpy_bytes = nand_cache_off + retlen - (off + bytes_read);
222 if (cpy_bytes > size - bytes_read)
223 cpy_bytes = size - bytes_read;
224 memcpy(buf + bytes_read,
225 nand_cache + off + bytes_read - nand_cache_off,
227 bytes_read += cpy_bytes;
232 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
234 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
237 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
240 if (read_nand_cached(off, size, buf) < 0) {
249 static void *get_node_mem_nand(u32 off, void *ext_buf)
251 struct jffs2_unknown_node node;
254 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
257 if (!(ret = get_fl_mem_nand(off, node.magic ==
258 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
260 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
261 off, node.magic, node.nodetype, node.totlen);
266 static void put_fl_mem_nand(void *buf)
272 #if defined(CONFIG_CMD_ONENAND)
274 #include <linux/mtd/mtd.h>
275 #include <linux/mtd/onenand.h>
276 #include <onenand_uboot.h>
278 #define ONENAND_PAGE_SIZE 2048
279 #define ONENAND_PAGE_SHIFT 11
280 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
282 #ifndef ONENAND_CACHE_PAGES
283 #define ONENAND_CACHE_PAGES 4
285 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
287 static u8* onenand_cache;
288 static u32 onenand_cache_off = (u32)-1;
290 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
297 while (bytes_read < size) {
298 retlen = ONENAND_CACHE_SIZE;
299 if( onenand_cache_off + retlen > onenand_mtd.size )
300 retlen = onenand_mtd.size - onenand_cache_off;
302 if ((off + bytes_read < onenand_cache_off) ||
303 (off + bytes_read >= onenand_cache_off + retlen)) {
304 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
305 if (!onenand_cache) {
306 /* This memory never gets freed but 'cause
307 it's a bootloader, nobody cares */
308 onenand_cache = malloc(ONENAND_CACHE_SIZE);
309 if (!onenand_cache) {
310 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
316 toread = ONENAND_CACHE_SIZE;
317 if( onenand_cache_off + toread > onenand_mtd.size )
318 toread = onenand_mtd.size - onenand_cache_off;
320 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
321 &retlen, onenand_cache) < 0 ||
323 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
324 onenand_cache_off, toread);
328 cpy_bytes = onenand_cache_off + retlen - (off + bytes_read);
329 if (cpy_bytes > size - bytes_read)
330 cpy_bytes = size - bytes_read;
331 memcpy(buf + bytes_read,
332 onenand_cache + off + bytes_read - onenand_cache_off,
334 bytes_read += cpy_bytes;
339 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
341 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
344 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
347 if (read_onenand_cached(off, size, buf) < 0) {
356 static void *get_node_mem_onenand(u32 off, void *ext_buf)
358 struct jffs2_unknown_node node;
361 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
364 ret = get_fl_mem_onenand(off, node.magic ==
365 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
368 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
369 off, node.magic, node.nodetype, node.totlen);
375 static void put_fl_mem_onenand(void *buf)
382 #if defined(CONFIG_CMD_FLASH)
386 * Support for jffs2 on top of NOR-flash
388 * NOR flash memory is mapped in processor's address space,
389 * just return address.
391 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
394 struct mtdids *id = current_part->dev->id;
396 flash_info_t *flash = &flash_info[id->num];
398 addr += flash->start[0];
400 memcpy(ext_buf, (void *)addr, size);
406 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
408 struct jffs2_unknown_node *pNode;
410 /* pNode will point directly to flash - don't provide external buffer
411 and don't care about size */
412 pNode = get_fl_mem_nor(off, 0, NULL);
413 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
414 pNode->totlen : sizeof(*pNode), ext_buf);
420 * Generic jffs2 raw memory and node read routines.
423 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
425 struct mtdids *id = current_part->dev->id;
428 #if defined(CONFIG_CMD_FLASH)
429 case MTD_DEV_TYPE_NOR:
430 return get_fl_mem_nor(off, size, ext_buf);
433 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
434 case MTD_DEV_TYPE_NAND:
435 return get_fl_mem_nand(off, size, ext_buf);
438 #if defined(CONFIG_CMD_ONENAND)
439 case MTD_DEV_TYPE_ONENAND:
440 return get_fl_mem_onenand(off, size, ext_buf);
444 printf("get_fl_mem: unknown device type, " \
445 "using raw offset!\n");
450 static inline void *get_node_mem(u32 off, void *ext_buf)
452 struct mtdids *id = current_part->dev->id;
455 #if defined(CONFIG_CMD_FLASH)
456 case MTD_DEV_TYPE_NOR:
457 return get_node_mem_nor(off, ext_buf);
460 #if defined(CONFIG_JFFS2_NAND) && \
461 defined(CONFIG_CMD_NAND)
462 case MTD_DEV_TYPE_NAND:
463 return get_node_mem_nand(off, ext_buf);
466 #if defined(CONFIG_CMD_ONENAND)
467 case MTD_DEV_TYPE_ONENAND:
468 return get_node_mem_onenand(off, ext_buf);
472 printf("get_fl_mem: unknown device type, " \
473 "using raw offset!\n");
478 static inline void put_fl_mem(void *buf, void *ext_buf)
480 struct mtdids *id = current_part->dev->id;
482 /* If buf is the same as ext_buf, it was provided by the caller -
483 we shouldn't free it then. */
487 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
488 case MTD_DEV_TYPE_NAND:
489 return put_fl_mem_nand(buf);
491 #if defined(CONFIG_CMD_ONENAND)
492 case MTD_DEV_TYPE_ONENAND:
493 return put_fl_mem_onenand(buf);
498 /* Compression names */
499 static char *compr_names[] = {
507 #if defined(CONFIG_JFFS2_LZO)
512 /* Memory management */
515 struct mem_block *next;
516 struct b_node nodes[NODE_CHUNK];
521 free_nodes(struct b_list *list)
523 while (list->listMemBase != NULL) {
524 struct mem_block *next = list->listMemBase->next;
525 free( list->listMemBase );
526 list->listMemBase = next;
530 static struct b_node *
531 add_node(struct b_list *list)
534 struct mem_block *memBase;
537 memBase = list->listMemBase;
539 index = memBase->index;
541 putLabeledWord("add_node: index = ", index);
542 putLabeledWord("add_node: memBase = ", list->listMemBase);
545 if (memBase == NULL || index >= NODE_CHUNK) {
546 /* we need more space before we continue */
547 memBase = mmalloc(sizeof(struct mem_block));
548 if (memBase == NULL) {
549 putstr("add_node: malloc failed\n");
552 memBase->next = list->listMemBase;
555 putLabeledWord("add_node: alloced a new membase at ", *memBase);
559 /* now we have room to add it. */
560 b = &memBase->nodes[index];
563 memBase->index = index;
564 list->listMemBase = memBase;
569 static struct b_node *
570 insert_node(struct b_list *list)
574 if (!(new = add_node(list))) {
575 putstr("add_node failed!\r\n");
580 if (list->listTail != NULL)
581 list->listTail->next = new;
583 list->listHead = new;
584 list->listTail = new;
589 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
590 /* Sort data entries with the latest version last, so that if there
591 * is overlapping data the latest version will be used.
593 static int compare_inodes(struct b_node *new, struct b_node *old)
595 return new->version > old->version;
598 /* Sort directory entries so all entries in the same directory
599 * with the same name are grouped together, with the latest version
600 * last. This makes it easy to eliminate all but the latest version
601 * by marking the previous version dead by setting the inode to 0.
603 static int compare_dirents(struct b_node *new, struct b_node *old)
606 * Using NULL as the buffer for NOR flash prevents the entire node
607 * being read. This makes most comparisons much quicker as only one
608 * or two entries from the node will be used most of the time.
610 struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
611 struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
615 if (jNew->pino != jOld->pino) {
616 /* ascending sort by pino */
617 ret = jNew->pino > jOld->pino;
618 } else if (jNew->nsize != jOld->nsize) {
620 * pino is the same, so use ascending sort by nsize,
621 * so we don't do strncmp unless we really must.
623 ret = jNew->nsize > jOld->nsize;
626 * length is also the same, so use ascending sort by name
628 cmp = strncmp((char *)jNew->name, (char *)jOld->name,
634 * we have duplicate names in this directory,
635 * so use ascending sort by version
637 ret = jNew->version > jOld->version;
640 put_fl_mem(jNew, NULL);
641 put_fl_mem(jOld, NULL);
648 jffs2_free_cache(struct part_info *part)
652 if (part->jffs2_priv != NULL) {
653 pL = (struct b_lists *)part->jffs2_priv;
654 free_nodes(&pL->frag);
655 free_nodes(&pL->dir);
662 jffs_init_1pass_list(struct part_info *part)
666 jffs2_free_cache(part);
668 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
669 pL = (struct b_lists *)part->jffs2_priv;
671 memset(pL, 0, sizeof(*pL));
672 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
673 pL->dir.listCompare = compare_dirents;
674 pL->frag.listCompare = compare_inodes;
680 /* find the inode from the slashless name given a parent */
682 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
685 struct jffs2_raw_inode *jNode;
687 u32 latestVersion = 0;
693 /* Find file size before loading any data, so fragments that
694 * start past the end of file can be ignored. A fragment
695 * that is partially in the file is loaded, so extra data may
696 * be loaded up to the next 4K boundary above the file size.
697 * This shouldn't cause trouble when loading kernel images, so
698 * we will live with it.
700 int latestOffset = -1;
701 for (b = pL->frag.listHead; b != NULL; b = b->next) {
702 if (inode == b->ino) {
703 /* get actual file length from the newest node */
704 if (b->version >= latestVersion) {
705 latestVersion = b->version;
706 latestOffset = b->offset;
711 if (latestOffset >= 0) {
712 jNode = (struct jffs2_raw_inode *)get_fl_mem(latestOffset,
713 sizeof(struct jffs2_raw_inode), pL->readbuf);
714 totalSize = jNode->isize;
715 put_fl_mem(jNode, pL->readbuf);
719 * If no destination is provided, we are done.
720 * Just return the total size.
725 for (b = pL->frag.listHead; b != NULL; b = b->next) {
726 if (inode == b->ino) {
728 * Copy just the node and not the data at this point,
729 * since we don't yet know if we need this data.
731 jNode = (struct jffs2_raw_inode *)get_fl_mem(b->offset,
732 sizeof(struct jffs2_raw_inode),
735 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
736 putLabeledWord("read_inode: inode = ", jNode->ino);
737 putLabeledWord("read_inode: version = ", jNode->version);
738 putLabeledWord("read_inode: isize = ", jNode->isize);
739 putLabeledWord("read_inode: offset = ", jNode->offset);
740 putLabeledWord("read_inode: csize = ", jNode->csize);
741 putLabeledWord("read_inode: dsize = ", jNode->dsize);
742 putLabeledWord("read_inode: compr = ", jNode->compr);
743 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
744 putLabeledWord("read_inode: flags = ", jNode->flags);
749 * Now that the inode has been checked,
750 * read the entire inode, including data.
752 put_fl_mem(jNode, pL->readbuf);
753 jNode = (struct jffs2_raw_inode *)
754 get_node_mem(b->offset, pL->readbuf);
755 src = ((uchar *)jNode) +
756 sizeof(struct jffs2_raw_inode);
757 /* ignore data behind latest known EOF */
758 if (jNode->offset > totalSize) {
759 put_fl_mem(jNode, pL->readbuf);
762 if (b->datacrc == CRC_UNKNOWN)
763 b->datacrc = data_crc(jNode) ?
765 if (b->datacrc == CRC_BAD) {
766 put_fl_mem(jNode, pL->readbuf);
770 lDest = (uchar *) (dest + jNode->offset);
772 putLabeledWord("read_inode: src = ", src);
773 putLabeledWord("read_inode: dest = ", lDest);
775 switch (jNode->compr) {
776 case JFFS2_COMPR_NONE:
777 ldr_memcpy(lDest, src, jNode->dsize);
779 case JFFS2_COMPR_ZERO:
780 for (i = 0; i < jNode->dsize; i++)
783 case JFFS2_COMPR_RTIME:
784 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
786 case JFFS2_COMPR_DYNRUBIN:
787 /* this is slow but it works */
788 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
790 case JFFS2_COMPR_ZLIB:
791 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
793 #if defined(CONFIG_JFFS2_LZO)
794 case JFFS2_COMPR_LZO:
795 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
800 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
801 put_fl_mem(jNode, pL->readbuf);
808 putLabeledWord("read_inode: totalSize = ", totalSize);
810 put_fl_mem(jNode, pL->readbuf);
816 putLabeledWord("read_inode: returning = ", totalSize);
821 /* find the inode from the slashless name given a parent */
823 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
826 struct jffs2_raw_dirent *jDir;
832 /* name is assumed slash free */
836 /* we need to search all and return the inode with the highest version */
837 for(b = pL->dir.listHead; b; b = b->next, counter++) {
838 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
840 if ((pino == jDir->pino) && (len == jDir->nsize) &&
841 (!strncmp((char *)jDir->name, name, len))) { /* a match */
842 if (jDir->version < version) {
843 put_fl_mem(jDir, pL->readbuf);
847 if (jDir->version == version && inode != 0) {
848 /* I'm pretty sure this isn't legal */
849 putstr(" ** ERROR ** ");
850 putnstr(jDir->name, jDir->nsize);
851 putLabeledWord(" has dup version =", version);
854 version = jDir->version;
857 putstr("\r\nfind_inode:p&l ->");
858 putnstr(jDir->name, jDir->nsize);
860 putLabeledWord("pino = ", jDir->pino);
861 putLabeledWord("nsize = ", jDir->nsize);
862 putLabeledWord("b = ", (u32) b);
863 putLabeledWord("counter = ", counter);
865 put_fl_mem(jDir, pL->readbuf);
870 char *mkmodestr(unsigned long mode, char *str)
872 static const char *l = "xwr";
876 switch (mode & S_IFMT) {
877 case S_IFDIR: str[0] = 'd'; break;
878 case S_IFBLK: str[0] = 'b'; break;
879 case S_IFCHR: str[0] = 'c'; break;
880 case S_IFIFO: str[0] = 'f'; break;
881 case S_IFLNK: str[0] = 'l'; break;
882 case S_IFSOCK: str[0] = 's'; break;
883 case S_IFREG: str[0] = '-'; break;
884 default: str[0] = '?';
887 for(i = 0; i < 9; i++) {
889 str[9-i] = (mode & mask)?c:'-';
893 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
894 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
895 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
900 static inline void dump_stat(struct stat *st, const char *name)
905 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
908 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
910 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
911 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
914 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
915 st->st_size, s, name);
918 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
921 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
926 if(!d || !i) return -1;
928 strncpy(fname, (char *)d->name, d->nsize);
929 fname[d->nsize] = '\0';
931 memset(&st,0,sizeof(st));
933 st.st_mtime = i->mtime;
934 st.st_mode = i->mode;
936 st.st_size = i->isize;
938 dump_stat(&st, fname);
940 if (d->type == DT_LNK) {
941 unsigned char *src = (unsigned char *) (&i[1]);
943 putnstr(src, (int)i->dsize);
951 /* list inodes with the given pino */
953 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
956 struct jffs2_raw_dirent *jDir;
958 for (b = pL->dir.listHead; b; b = b->next) {
959 if (pino == b->pino) {
962 struct jffs2_raw_inode *jNode = NULL;
965 jDir = (struct jffs2_raw_dirent *)
966 get_node_mem(b->offset, pL->readbuf);
967 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
968 /* Check for more recent versions of this file */
971 struct b_node *next = b->next;
972 struct jffs2_raw_dirent *jDirNext;
975 jDirNext = (struct jffs2_raw_dirent *)
976 get_node_mem(next->offset, NULL);
977 match = jDirNext->pino == jDir->pino &&
978 jDirNext->nsize == jDir->nsize &&
979 strncmp((char *)jDirNext->name,
983 /* Use next. It is more recent */
985 /* Update buffer with the new info */
988 put_fl_mem(jDirNext, NULL);
991 if (jDir->ino == 0) {
993 put_fl_mem(jDir, pL->readbuf);
997 for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
998 if (b2->ino == jDir->ino &&
999 b2->version >= i_version) {
1000 i_version = b2->version;
1001 i_offset = b2->offset;
1005 if (i_version >= 0) {
1006 if (jDir->type == DT_LNK)
1007 jNode = get_node_mem(i_offset, NULL);
1009 jNode = get_fl_mem(i_offset,
1014 dump_inode(pL, jDir, jNode);
1015 put_fl_mem(jNode, NULL);
1017 put_fl_mem(jDir, pL->readbuf);
1024 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1028 char working_tmp[256];
1031 /* discard any leading slash */
1033 while (fname[i] == '/')
1035 strcpy(tmp, &fname[i]);
1037 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1039 strncpy(working_tmp, tmp, c - tmp);
1040 working_tmp[c - tmp] = '\0';
1042 putstr("search_inode: tmp = ");
1045 putstr("search_inode: wtmp = ");
1046 putstr(working_tmp);
1048 putstr("search_inode: c = ");
1052 for (i = 0; i < strlen(c) - 1; i++)
1056 putstr("search_inode: post tmp = ");
1061 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1062 putstr("find_inode failed for name=");
1063 putstr(working_tmp);
1068 /* this is for the bare filename, directories have already been mapped */
1069 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1070 putstr("find_inode failed for name=");
1080 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1084 struct jffs2_raw_dirent *jDir;
1085 struct jffs2_raw_inode *jNode;
1086 u8 jDirFoundType = 0;
1087 u32 jDirFoundIno = 0;
1088 u32 jDirFoundPino = 0;
1094 /* we need to search all and return the inode with the highest version */
1095 for(b = pL->dir.listHead; b; b = b->next) {
1096 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1098 if (ino == jDir->ino) {
1099 if (jDir->version < version) {
1100 put_fl_mem(jDir, pL->readbuf);
1104 if (jDir->version == version && jDirFoundType) {
1105 /* I'm pretty sure this isn't legal */
1106 putstr(" ** ERROR ** ");
1107 putnstr(jDir->name, jDir->nsize);
1108 putLabeledWord(" has dup version (resolve) = ",
1112 jDirFoundType = jDir->type;
1113 jDirFoundIno = jDir->ino;
1114 jDirFoundPino = jDir->pino;
1115 version = jDir->version;
1117 put_fl_mem(jDir, pL->readbuf);
1119 /* now we found the right entry again. (shoulda returned inode*) */
1120 if (jDirFoundType != DT_LNK)
1121 return jDirFoundIno;
1123 /* it's a soft link so we follow it again. */
1124 b2 = pL->frag.listHead;
1126 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1128 if (jNode->ino == jDirFoundIno) {
1129 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1132 putLabeledWord("\t\t dsize = ", jNode->dsize);
1133 putstr("\t\t target = ");
1134 putnstr(src, jNode->dsize);
1137 strncpy(tmp, (char *)src, jNode->dsize);
1138 tmp[jNode->dsize] = '\0';
1139 put_fl_mem(jNode, pL->readbuf);
1143 put_fl_mem(jNode, pL->readbuf);
1145 /* ok so the name of the new file to find is in tmp */
1146 /* if it starts with a slash it is root based else shared dirs */
1150 pino = jDirFoundPino;
1152 return jffs2_1pass_search_inode(pL, tmp, pino);
1156 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1160 char working_tmp[256];
1163 /* discard any leading slash */
1165 while (fname[i] == '/')
1167 strcpy(tmp, &fname[i]);
1168 working_tmp[0] = '\0';
1169 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1171 strncpy(working_tmp, tmp, c - tmp);
1172 working_tmp[c - tmp] = '\0';
1173 for (i = 0; i < strlen(c) - 1; i++)
1176 /* only a failure if we arent looking at top level */
1177 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1179 putstr("find_inode failed for name=");
1180 putstr(working_tmp);
1186 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1187 putstr("find_inode failed for name=");
1192 /* this is for the bare filename, directories have already been mapped */
1193 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1194 putstr("find_inode failed for name=");
1204 jffs2_1pass_rescan_needed(struct part_info *part)
1207 struct jffs2_unknown_node onode;
1208 struct jffs2_unknown_node *node;
1209 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1211 if (part->jffs2_priv == 0){
1212 DEBUGF ("rescan: First time in use\n");
1216 /* if we have no list, we need to rescan */
1217 if (pL->frag.listCount == 0) {
1218 DEBUGF ("rescan: fraglist zero\n");
1222 /* but suppose someone reflashed a partition at the same offset... */
1223 b = pL->dir.listHead;
1225 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1226 sizeof(onode), &onode);
1227 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1228 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1229 (unsigned long) b->offset);
1237 #ifdef CONFIG_JFFS2_SUMMARY
1238 static u32 sum_get_unaligned32(u32 *ptr)
1243 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1245 return __le32_to_cpu(val);
1248 static u16 sum_get_unaligned16(u16 *ptr)
1253 val = *p | (*(p + 1) << 8);
1255 return __le16_to_cpu(val);
1258 #define dbg_summary(...) do {} while (0);
1260 * Process the stored summary information - helper function for
1261 * jffs2_sum_scan_sumnode()
1264 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1265 struct jffs2_raw_summary *summary,
1272 for (pass = 0; pass < 2; pass++) {
1275 for (i = 0; i < summary->sum_num; i++) {
1276 struct jffs2_sum_unknown_flash *spu = sp;
1277 dbg_summary("processing summary index %d\n", i);
1279 switch (sum_get_unaligned16(&spu->nodetype)) {
1280 case JFFS2_NODETYPE_INODE: {
1281 struct jffs2_sum_inode_flash *spi;
1285 b = insert_node(&pL->frag);
1288 b->offset = (u32)part->offset +
1290 sum_get_unaligned32(
1292 b->version = sum_get_unaligned32(
1294 b->ino = sum_get_unaligned32(
1296 b->datacrc = CRC_UNKNOWN;
1299 sp += JFFS2_SUMMARY_INODE_SIZE;
1303 case JFFS2_NODETYPE_DIRENT: {
1304 struct jffs2_sum_dirent_flash *spd;
1307 b = insert_node(&pL->dir);
1310 b->offset = (u32)part->offset +
1312 sum_get_unaligned32(
1314 b->version = sum_get_unaligned32(
1316 b->pino = sum_get_unaligned32(
1318 b->datacrc = CRC_UNKNOWN;
1321 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1327 uint16_t nodetype = sum_get_unaligned16(
1329 printf("Unsupported node type %x found"
1332 if ((nodetype & JFFS2_COMPAT_MASK) ==
1333 JFFS2_FEATURE_INCOMPAT)
1343 /* Process the summary node - called from jffs2_scan_eraseblock() */
1344 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1345 struct jffs2_raw_summary *summary, uint32_t sumsize,
1348 struct jffs2_unknown_node crcnode;
1349 int ret, __maybe_unused ofs;
1352 ofs = part->sector_size - sumsize;
1354 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1355 offset, offset + ofs, sumsize);
1357 /* OK, now check for node validity and CRC */
1358 crcnode.magic = JFFS2_MAGIC_BITMASK;
1359 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1360 crcnode.totlen = summary->totlen;
1361 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1363 if (summary->hdr_crc != crc) {
1364 dbg_summary("Summary node header is corrupt (bad CRC or "
1365 "no summary at all)\n");
1369 if (summary->totlen != sumsize) {
1370 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1374 crc = crc32_no_comp(0, (uchar *)summary,
1375 sizeof(struct jffs2_raw_summary)-8);
1377 if (summary->node_crc != crc) {
1378 dbg_summary("Summary node is corrupt (bad CRC)\n");
1382 crc = crc32_no_comp(0, (uchar *)summary->sum,
1383 sumsize - sizeof(struct jffs2_raw_summary));
1385 if (summary->sum_crc != crc) {
1386 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1390 if (summary->cln_mkr)
1391 dbg_summary("Summary : CLEANMARKER node \n");
1393 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1394 if (ret == -EBADMSG)
1397 return ret; /* real error */
1402 putstr("Summary node crc error, skipping summary information.\n");
1406 #endif /* CONFIG_JFFS2_SUMMARY */
1408 #ifdef DEBUG_FRAGMENTS
1410 dump_fragments(struct b_lists *pL)
1413 struct jffs2_raw_inode ojNode;
1414 struct jffs2_raw_inode *jNode;
1416 putstr("\r\n\r\n******The fragment Entries******\r\n");
1417 b = pL->frag.listHead;
1419 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1420 sizeof(ojNode), &ojNode);
1421 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1422 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1423 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1424 putLabeledWord("\tbuild_list: version = ", jNode->version);
1425 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1426 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1427 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1428 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1429 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1430 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1431 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1432 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1433 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1439 #ifdef DEBUG_DIRENTS
1441 dump_dirents(struct b_lists *pL)
1444 struct jffs2_raw_dirent *jDir;
1446 putstr("\r\n\r\n******The directory Entries******\r\n");
1447 b = pL->dir.listHead;
1449 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1452 putnstr(jDir->name, jDir->nsize);
1453 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1454 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1455 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1456 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1457 putLabeledWord("\tbuild_list: version = ", jDir->version);
1458 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1459 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1460 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1461 putLabeledWord("\tbuild_list: type = ", jDir->type);
1462 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1463 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1464 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1466 put_fl_mem(jDir, pL->readbuf);
1471 #define DEFAULT_EMPTY_SCAN_SIZE 256
1473 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1475 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1478 return DEFAULT_EMPTY_SCAN_SIZE;
1482 jffs2_1pass_build_lists(struct part_info * part)
1485 union jffs2_node_union *node;
1495 nr_sectors = lldiv(part->size, part->sector_size);
1496 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1497 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1498 /* only about 5 %. not enough to inconvenience people for. */
1501 /* if we are building a list we need to refresh the cache. */
1502 jffs_init_1pass_list(part);
1503 pL = (struct b_lists *)part->jffs2_priv;
1504 buf = malloc(DEFAULT_EMPTY_SCAN_SIZE);
1505 puts ("Scanning JFFS2 FS: ");
1507 /* start at the beginning of the partition */
1508 for (i = 0; i < nr_sectors; i++) {
1509 uint32_t sector_ofs = i * part->sector_size;
1510 uint32_t buf_ofs = sector_ofs;
1512 uint32_t ofs, prevofs;
1513 #ifdef CONFIG_JFFS2_SUMMARY
1514 struct jffs2_sum_marker *sm;
1515 void *sumptr = NULL;
1519 /* Indicates a sector with a CLEANMARKER was found */
1520 int clean_sector = 0;
1521 struct jffs2_unknown_node crcnode;
1524 /* Set buf_size to maximum length */
1525 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1528 #ifdef CONFIG_JFFS2_SUMMARY
1529 buf_len = sizeof(*sm);
1531 /* Read as much as we want into the _end_ of the preallocated
1534 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1535 buf_len, buf_len, buf + buf_size - buf_len);
1537 sm = (void *)buf + buf_size - sizeof(*sm);
1538 if (sm->magic == JFFS2_SUM_MAGIC) {
1539 sumlen = part->sector_size - sm->offset;
1540 sumptr = buf + buf_size - sumlen;
1542 /* Now, make sure the summary itself is available */
1543 if (sumlen > buf_size) {
1544 /* Need to kmalloc for this. */
1545 sumptr = malloc(sumlen);
1547 putstr("Can't get memory for summary "
1550 jffs2_free_cache(part);
1553 memcpy(sumptr + sumlen - buf_len, buf +
1554 buf_size - buf_len, buf_len);
1556 if (buf_len < sumlen) {
1557 /* Need to read more so that the entire summary
1560 get_fl_mem(part->offset + sector_ofs +
1561 part->sector_size - sumlen,
1562 sumlen - buf_len, sumptr);
1567 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1570 if (buf_size && sumlen > buf_size)
1574 jffs2_free_cache(part);
1581 #endif /* CONFIG_JFFS2_SUMMARY */
1583 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1585 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1587 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1590 /* Scan only 4KiB of 0xFF before declaring it's empty */
1591 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1592 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1595 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1601 * Set buf_size down to the minimum size required.
1602 * This prevents reading in chunks of flash data unnecessarily.
1604 buf_size = sizeof(union jffs2_node_union);
1607 while (ofs < sector_ofs + part->sector_size) {
1608 if (ofs == prevofs) {
1609 printf("offset %08x already seen, skip\n", ofs);
1615 if (sector_ofs + part->sector_size <
1616 ofs + sizeof(struct jffs2_unknown_node))
1618 if (buf_ofs + buf_len <
1619 ofs + sizeof(struct jffs2_unknown_node)) {
1620 buf_len = min_t(uint32_t, buf_size, sector_ofs
1621 + part->sector_size - ofs);
1622 get_fl_mem((u32)part->offset + ofs, buf_len,
1627 node = (union jffs2_node_union *)&buf[ofs - buf_ofs];
1629 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1634 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1635 part->sector_size)/8,
1638 inbuf_ofs = ofs - buf_ofs;
1639 while (inbuf_ofs < scan_end) {
1640 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1649 * If this sector had a clean marker at the
1650 * beginning, and immediately following this
1651 * have been a bunch of FF bytes, treat the
1652 * entire sector as empty.
1657 /* See how much more there is to read in this
1660 buf_len = min_t(uint32_t, buf_size,
1662 part->sector_size - ofs);
1664 /* No more to read. Break out of main
1665 * loop without marking this range of
1666 * empty space as dirty (because it's
1672 get_fl_mem((u32)part->offset + ofs, buf_len,
1678 * Found something not erased in the sector, so reset
1679 * the 'clean_sector' flag.
1682 if (node->u.magic != JFFS2_MAGIC_BITMASK) {
1688 crcnode.magic = node->u.magic;
1689 crcnode.nodetype = node->u.nodetype | JFFS2_NODE_ACCURATE;
1690 crcnode.totlen = node->u.totlen;
1691 crcnode.hdr_crc = node->u.hdr_crc;
1692 if (!hdr_crc(&crcnode)) {
1698 if (ofs + node->u.totlen > sector_ofs + part->sector_size) {
1704 if (!(node->u.nodetype & JFFS2_NODE_ACCURATE)) {
1705 DEBUGF("Obsolete node type: %x len %d offset 0x%x\n",
1706 node->u.nodetype, node->u.totlen, ofs);
1707 ofs += ((node->u.totlen + 3) & ~3);
1712 /* if its a fragment add it */
1713 switch (node->u.nodetype) {
1714 case JFFS2_NODETYPE_INODE:
1715 if (buf_ofs + buf_len <
1716 ofs + sizeof(struct jffs2_raw_inode)) {
1717 buf_len = min_t(uint32_t,
1718 sizeof(struct jffs2_raw_inode),
1722 get_fl_mem((u32)part->offset + ofs,
1727 if (!inode_crc((struct jffs2_raw_inode *)node))
1730 b = insert_node(&pL->frag);
1733 jffs2_free_cache(part);
1736 b->offset = (u32)part->offset + ofs;
1737 b->version = node->i.version;
1738 b->ino = node->i.ino;
1739 if (max_totlen < node->u.totlen)
1740 max_totlen = node->u.totlen;
1742 case JFFS2_NODETYPE_DIRENT:
1743 if (buf_ofs + buf_len < ofs + sizeof(struct
1748 buf_len = min_t(uint32_t,
1753 get_fl_mem((u32)part->offset + ofs,
1759 if (!dirent_crc((struct jffs2_raw_dirent *)
1766 if (! (counterN%100))
1768 b = insert_node(&pL->dir);
1771 jffs2_free_cache(part);
1774 b->offset = (u32)part->offset + ofs;
1775 b->version = node->d.version;
1776 b->pino = node->d.pino;
1777 if (max_totlen < node->u.totlen)
1778 max_totlen = node->u.totlen;
1781 case JFFS2_NODETYPE_CLEANMARKER:
1782 if (node->u.totlen != sizeof(struct jffs2_unknown_node))
1783 printf("OOPS Cleanmarker has bad size "
1786 sizeof(struct jffs2_unknown_node));
1787 if (node->u.totlen ==
1788 sizeof(struct jffs2_unknown_node) &&
1789 ofs == sector_ofs) {
1791 * Found a CLEANMARKER at the beginning
1792 * of the sector. It's in the correct
1793 * place with correct size and CRC.
1798 case JFFS2_NODETYPE_PADDING:
1799 if (node->u.totlen <
1800 sizeof(struct jffs2_unknown_node))
1801 printf("OOPS Padding has bad size "
1804 sizeof(struct jffs2_unknown_node));
1806 case JFFS2_NODETYPE_SUMMARY:
1809 printf("Unknown node type: %x len %d offset 0x%x\n",
1811 node->u.totlen, ofs);
1813 ofs += ((node->u.totlen + 3) & ~3);
1819 #if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
1823 sort_list(&pL->frag);
1824 sort_list(&pL->dir);
1826 putstr("\b\b done.\r\n"); /* close off the dots */
1828 /* We don't care if malloc failed - then each read operation will
1829 * allocate its own buffer as necessary (NAND) or will read directly
1832 pL->readbuf = malloc(max_totlen);
1834 /* turn the lcd back on. */
1838 putLabeledWord("dir entries = ", pL->dir.listCount);
1839 putLabeledWord("frag entries = ", pL->frag.listCount);
1840 putLabeledWord("+4 increments = ", counter4);
1841 putLabeledWord("+file_offset increments = ", counterF);
1845 #ifdef DEBUG_DIRENTS
1849 #ifdef DEBUG_FRAGMENTS
1853 /* give visual feedback that we are done scanning the flash */
1854 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1860 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1863 struct jffs2_raw_inode ojNode;
1864 struct jffs2_raw_inode *jNode;
1867 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1868 piL->compr_info[i].num_frags = 0;
1869 piL->compr_info[i].compr_sum = 0;
1870 piL->compr_info[i].decompr_sum = 0;
1873 b = pL->frag.listHead;
1875 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1876 sizeof(ojNode), &ojNode);
1877 if (jNode->compr < JFFS2_NUM_COMPR) {
1878 piL->compr_info[jNode->compr].num_frags++;
1879 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1880 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1888 static struct b_lists *
1889 jffs2_get_list(struct part_info * part, const char *who)
1891 /* copy requested part_info struct pointer to global location */
1892 current_part = part;
1894 if (jffs2_1pass_rescan_needed(part)) {
1895 if (!jffs2_1pass_build_lists(part)) {
1896 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1900 return (struct b_lists *)part->jffs2_priv;
1904 /* Print directory / file contents */
1906 jffs2_1pass_ls(struct part_info * part, const char *fname)
1912 if (! (pl = jffs2_get_list(part, "ls")))
1915 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1916 putstr("ls: Failed to scan jffs2 file structure\r\n");
1922 putLabeledWord("found file at inode = ", inode);
1923 putLabeledWord("read_inode returns = ", ret);
1930 /* Load a file from flash into memory. fname can be a full path */
1932 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1939 if (! (pl = jffs2_get_list(part, "load")))
1942 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1943 putstr("load: Failed to find inode\r\n");
1947 /* Resolve symlinks */
1948 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1949 putstr("load: Failed to resolve inode structure\r\n");
1953 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1954 putstr("load: Failed to read inode\r\n");
1958 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1959 (unsigned long) dest, ret);
1963 /* Return information about the fs on this partition */
1965 jffs2_1pass_info(struct part_info * part)
1967 struct b_jffs2_info info;
1971 if (! (pl = jffs2_get_list(part, "info")))
1974 jffs2_1pass_fill_info(pl, &info);
1975 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1976 printf ("Compression: %s\n"
1977 "\tfrag count: %d\n"
1978 "\tcompressed sum: %d\n"
1979 "\tuncompressed sum: %d\n",
1981 info.compr_info[i].num_frags,
1982 info.compr_info[i].compr_sum,
1983 info.compr_info[i].decompr_sum);