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;
184 mtd = get_nand_dev_by_index(id->num);
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 retlen = NAND_CACHE_SIZE;
204 if (nand_read(mtd, nand_cache_off,
205 &retlen, nand_cache) < 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 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
213 if (cpy_bytes > size - bytes_read)
214 cpy_bytes = size - bytes_read;
215 memcpy(buf + bytes_read,
216 nand_cache + off + bytes_read - nand_cache_off,
218 bytes_read += cpy_bytes;
223 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
225 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
228 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
231 if (read_nand_cached(off, size, buf) < 0) {
240 static void *get_node_mem_nand(u32 off, void *ext_buf)
242 struct jffs2_unknown_node node;
245 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
248 if (!(ret = get_fl_mem_nand(off, node.magic ==
249 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
251 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
252 off, node.magic, node.nodetype, node.totlen);
257 static void put_fl_mem_nand(void *buf)
263 #if defined(CONFIG_CMD_ONENAND)
265 #include <linux/mtd/mtd.h>
266 #include <linux/mtd/onenand.h>
267 #include <onenand_uboot.h>
269 #define ONENAND_PAGE_SIZE 2048
270 #define ONENAND_PAGE_SHIFT 11
271 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
273 #ifndef ONENAND_CACHE_PAGES
274 #define ONENAND_CACHE_PAGES 4
276 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
278 static u8* onenand_cache;
279 static u32 onenand_cache_off = (u32)-1;
281 static int read_onenand_cached(u32 off, u32 size, u_char *buf)
287 while (bytes_read < size) {
288 if ((off + bytes_read < onenand_cache_off) ||
289 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
290 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
291 if (!onenand_cache) {
292 /* This memory never gets freed but 'cause
293 it's a bootloader, nobody cares */
294 onenand_cache = malloc(ONENAND_CACHE_SIZE);
295 if (!onenand_cache) {
296 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
302 retlen = ONENAND_CACHE_SIZE;
303 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
304 &retlen, onenand_cache) < 0 ||
305 retlen != ONENAND_CACHE_SIZE) {
306 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
307 onenand_cache_off, ONENAND_CACHE_SIZE);
311 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
312 if (cpy_bytes > size - bytes_read)
313 cpy_bytes = size - bytes_read;
314 memcpy(buf + bytes_read,
315 onenand_cache + off + bytes_read - onenand_cache_off,
317 bytes_read += cpy_bytes;
322 static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
324 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
327 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
330 if (read_onenand_cached(off, size, buf) < 0) {
339 static void *get_node_mem_onenand(u32 off, void *ext_buf)
341 struct jffs2_unknown_node node;
344 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
347 ret = get_fl_mem_onenand(off, node.magic ==
348 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
351 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
352 off, node.magic, node.nodetype, node.totlen);
358 static void put_fl_mem_onenand(void *buf)
365 #if defined(CONFIG_CMD_FLASH)
367 * Support for jffs2 on top of NOR-flash
369 * NOR flash memory is mapped in processor's address space,
370 * just return address.
372 static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
375 struct mtdids *id = current_part->dev->id;
377 extern flash_info_t flash_info[];
378 flash_info_t *flash = &flash_info[id->num];
380 addr += flash->start[0];
382 memcpy(ext_buf, (void *)addr, size);
388 static inline void *get_node_mem_nor(u32 off, void *ext_buf)
390 struct jffs2_unknown_node *pNode;
392 /* pNode will point directly to flash - don't provide external buffer
393 and don't care about size */
394 pNode = get_fl_mem_nor(off, 0, NULL);
395 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
396 pNode->totlen : sizeof(*pNode), ext_buf);
402 * Generic jffs2 raw memory and node read routines.
405 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
407 struct mtdids *id = current_part->dev->id;
410 #if defined(CONFIG_CMD_FLASH)
411 case MTD_DEV_TYPE_NOR:
412 return get_fl_mem_nor(off, size, ext_buf);
415 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
416 case MTD_DEV_TYPE_NAND:
417 return get_fl_mem_nand(off, size, ext_buf);
420 #if defined(CONFIG_CMD_ONENAND)
421 case MTD_DEV_TYPE_ONENAND:
422 return get_fl_mem_onenand(off, size, ext_buf);
426 printf("get_fl_mem: unknown device type, " \
427 "using raw offset!\n");
432 static inline void *get_node_mem(u32 off, void *ext_buf)
434 struct mtdids *id = current_part->dev->id;
437 #if defined(CONFIG_CMD_FLASH)
438 case MTD_DEV_TYPE_NOR:
439 return get_node_mem_nor(off, ext_buf);
442 #if defined(CONFIG_JFFS2_NAND) && \
443 defined(CONFIG_CMD_NAND)
444 case MTD_DEV_TYPE_NAND:
445 return get_node_mem_nand(off, ext_buf);
448 #if defined(CONFIG_CMD_ONENAND)
449 case MTD_DEV_TYPE_ONENAND:
450 return get_node_mem_onenand(off, ext_buf);
454 printf("get_fl_mem: unknown device type, " \
455 "using raw offset!\n");
460 static inline void put_fl_mem(void *buf, void *ext_buf)
462 struct mtdids *id = current_part->dev->id;
464 /* If buf is the same as ext_buf, it was provided by the caller -
465 we shouldn't free it then. */
469 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
470 case MTD_DEV_TYPE_NAND:
471 return put_fl_mem_nand(buf);
473 #if defined(CONFIG_CMD_ONENAND)
474 case MTD_DEV_TYPE_ONENAND:
475 return put_fl_mem_onenand(buf);
480 /* Compression names */
481 static char *compr_names[] = {
489 #if defined(CONFIG_JFFS2_LZO)
494 /* Memory management */
497 struct mem_block *next;
498 struct b_node nodes[NODE_CHUNK];
503 free_nodes(struct b_list *list)
505 while (list->listMemBase != NULL) {
506 struct mem_block *next = list->listMemBase->next;
507 free( list->listMemBase );
508 list->listMemBase = next;
512 static struct b_node *
513 add_node(struct b_list *list)
516 struct mem_block *memBase;
519 memBase = list->listMemBase;
521 index = memBase->index;
523 putLabeledWord("add_node: index = ", index);
524 putLabeledWord("add_node: memBase = ", list->listMemBase);
527 if (memBase == NULL || index >= NODE_CHUNK) {
528 /* we need more space before we continue */
529 memBase = mmalloc(sizeof(struct mem_block));
530 if (memBase == NULL) {
531 putstr("add_node: malloc failed\n");
534 memBase->next = list->listMemBase;
537 putLabeledWord("add_node: alloced a new membase at ", *memBase);
541 /* now we have room to add it. */
542 b = &memBase->nodes[index];
545 memBase->index = index;
546 list->listMemBase = memBase;
551 static struct b_node *
552 insert_node(struct b_list *list)
556 if (!(new = add_node(list))) {
557 putstr("add_node failed!\r\n");
562 if (list->listTail != NULL)
563 list->listTail->next = new;
565 list->listHead = new;
566 list->listTail = new;
571 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
572 /* Sort data entries with the latest version last, so that if there
573 * is overlapping data the latest version will be used.
575 static int compare_inodes(struct b_node *new, struct b_node *old)
577 return new->version > old->version;
580 /* Sort directory entries so all entries in the same directory
581 * with the same name are grouped together, with the latest version
582 * last. This makes it easy to eliminate all but the latest version
583 * by marking the previous version dead by setting the inode to 0.
585 static int compare_dirents(struct b_node *new, struct b_node *old)
588 * Using NULL as the buffer for NOR flash prevents the entire node
589 * being read. This makes most comparisons much quicker as only one
590 * or two entries from the node will be used most of the time.
592 struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
593 struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
597 if (jNew->pino != jOld->pino) {
598 /* ascending sort by pino */
599 ret = jNew->pino > jOld->pino;
600 } else if (jNew->nsize != jOld->nsize) {
602 * pino is the same, so use ascending sort by nsize,
603 * so we don't do strncmp unless we really must.
605 ret = jNew->nsize > jOld->nsize;
608 * length is also the same, so use ascending sort by name
610 cmp = strncmp((char *)jNew->name, (char *)jOld->name,
616 * we have duplicate names in this directory,
617 * so use ascending sort by version
619 ret = jNew->version > jOld->version;
622 put_fl_mem(jNew, NULL);
623 put_fl_mem(jOld, NULL);
630 jffs2_free_cache(struct part_info *part)
634 if (part->jffs2_priv != NULL) {
635 pL = (struct b_lists *)part->jffs2_priv;
636 free_nodes(&pL->frag);
637 free_nodes(&pL->dir);
644 jffs_init_1pass_list(struct part_info *part)
648 jffs2_free_cache(part);
650 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
651 pL = (struct b_lists *)part->jffs2_priv;
653 memset(pL, 0, sizeof(*pL));
654 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
655 pL->dir.listCompare = compare_dirents;
656 pL->frag.listCompare = compare_inodes;
662 /* find the inode from the slashless name given a parent */
664 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
667 struct jffs2_raw_inode *jNode;
669 u32 latestVersion = 0;
675 /* Find file size before loading any data, so fragments that
676 * start past the end of file can be ignored. A fragment
677 * that is partially in the file is loaded, so extra data may
678 * be loaded up to the next 4K boundary above the file size.
679 * This shouldn't cause trouble when loading kernel images, so
680 * we will live with it.
682 int latestOffset = -1;
683 for (b = pL->frag.listHead; b != NULL; b = b->next) {
684 if (inode == b->ino) {
685 /* get actual file length from the newest node */
686 if (b->version >= latestVersion) {
687 latestVersion = b->version;
688 latestOffset = b->offset;
693 if (latestOffset >= 0) {
694 jNode = (struct jffs2_raw_inode *)get_fl_mem(latestOffset,
695 sizeof(struct jffs2_raw_inode), pL->readbuf);
696 totalSize = jNode->isize;
697 put_fl_mem(jNode, pL->readbuf);
701 * If no destination is provided, we are done.
702 * Just return the total size.
707 for (b = pL->frag.listHead; b != NULL; b = b->next) {
708 if (inode == b->ino) {
710 * Copy just the node and not the data at this point,
711 * since we don't yet know if we need this data.
713 jNode = (struct jffs2_raw_inode *)get_fl_mem(b->offset,
714 sizeof(struct jffs2_raw_inode),
717 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
718 putLabeledWord("read_inode: inode = ", jNode->ino);
719 putLabeledWord("read_inode: version = ", jNode->version);
720 putLabeledWord("read_inode: isize = ", jNode->isize);
721 putLabeledWord("read_inode: offset = ", jNode->offset);
722 putLabeledWord("read_inode: csize = ", jNode->csize);
723 putLabeledWord("read_inode: dsize = ", jNode->dsize);
724 putLabeledWord("read_inode: compr = ", jNode->compr);
725 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
726 putLabeledWord("read_inode: flags = ", jNode->flags);
731 * Now that the inode has been checked,
732 * read the entire inode, including data.
734 put_fl_mem(jNode, pL->readbuf);
735 jNode = (struct jffs2_raw_inode *)
736 get_node_mem(b->offset, pL->readbuf);
737 src = ((uchar *)jNode) +
738 sizeof(struct jffs2_raw_inode);
739 /* ignore data behind latest known EOF */
740 if (jNode->offset > totalSize) {
741 put_fl_mem(jNode, pL->readbuf);
744 if (b->datacrc == CRC_UNKNOWN)
745 b->datacrc = data_crc(jNode) ?
747 if (b->datacrc == CRC_BAD) {
748 put_fl_mem(jNode, pL->readbuf);
752 lDest = (uchar *) (dest + jNode->offset);
754 putLabeledWord("read_inode: src = ", src);
755 putLabeledWord("read_inode: dest = ", lDest);
757 switch (jNode->compr) {
758 case JFFS2_COMPR_NONE:
759 ldr_memcpy(lDest, src, jNode->dsize);
761 case JFFS2_COMPR_ZERO:
762 for (i = 0; i < jNode->dsize; i++)
765 case JFFS2_COMPR_RTIME:
766 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
768 case JFFS2_COMPR_DYNRUBIN:
769 /* this is slow but it works */
770 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
772 case JFFS2_COMPR_ZLIB:
773 zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
775 #if defined(CONFIG_JFFS2_LZO)
776 case JFFS2_COMPR_LZO:
777 lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
782 putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
783 put_fl_mem(jNode, pL->readbuf);
790 putLabeledWord("read_inode: totalSize = ", totalSize);
792 put_fl_mem(jNode, pL->readbuf);
798 putLabeledWord("read_inode: returning = ", totalSize);
803 /* find the inode from the slashless name given a parent */
805 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
808 struct jffs2_raw_dirent *jDir;
814 /* name is assumed slash free */
818 /* we need to search all and return the inode with the highest version */
819 for(b = pL->dir.listHead; b; b = b->next, counter++) {
820 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
822 if ((pino == jDir->pino) && (len == jDir->nsize) &&
823 (!strncmp((char *)jDir->name, name, len))) { /* a match */
824 if (jDir->version < version) {
825 put_fl_mem(jDir, pL->readbuf);
829 if (jDir->version == version && inode != 0) {
830 /* I'm pretty sure this isn't legal */
831 putstr(" ** ERROR ** ");
832 putnstr(jDir->name, jDir->nsize);
833 putLabeledWord(" has dup version =", version);
836 version = jDir->version;
839 putstr("\r\nfind_inode:p&l ->");
840 putnstr(jDir->name, jDir->nsize);
842 putLabeledWord("pino = ", jDir->pino);
843 putLabeledWord("nsize = ", jDir->nsize);
844 putLabeledWord("b = ", (u32) b);
845 putLabeledWord("counter = ", counter);
847 put_fl_mem(jDir, pL->readbuf);
852 char *mkmodestr(unsigned long mode, char *str)
854 static const char *l = "xwr";
858 switch (mode & S_IFMT) {
859 case S_IFDIR: str[0] = 'd'; break;
860 case S_IFBLK: str[0] = 'b'; break;
861 case S_IFCHR: str[0] = 'c'; break;
862 case S_IFIFO: str[0] = 'f'; break;
863 case S_IFLNK: str[0] = 'l'; break;
864 case S_IFSOCK: str[0] = 's'; break;
865 case S_IFREG: str[0] = '-'; break;
866 default: str[0] = '?';
869 for(i = 0; i < 9; i++) {
871 str[9-i] = (mode & mask)?c:'-';
875 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
876 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
877 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
882 static inline void dump_stat(struct stat *st, const char *name)
887 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
890 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
892 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
893 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
896 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
897 st->st_size, s, name);
900 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
903 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
908 if(!d || !i) return -1;
910 strncpy(fname, (char *)d->name, d->nsize);
911 fname[d->nsize] = '\0';
913 memset(&st,0,sizeof(st));
915 st.st_mtime = i->mtime;
916 st.st_mode = i->mode;
918 st.st_size = i->isize;
920 dump_stat(&st, fname);
922 if (d->type == DT_LNK) {
923 unsigned char *src = (unsigned char *) (&i[1]);
925 putnstr(src, (int)i->dsize);
933 /* list inodes with the given pino */
935 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
938 struct jffs2_raw_dirent *jDir;
940 for (b = pL->dir.listHead; b; b = b->next) {
941 if (pino == b->pino) {
944 struct jffs2_raw_inode *jNode = NULL;
947 jDir = (struct jffs2_raw_dirent *)
948 get_node_mem(b->offset, pL->readbuf);
949 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
950 /* Check for more recent versions of this file */
953 struct b_node *next = b->next;
954 struct jffs2_raw_dirent *jDirNext;
957 jDirNext = (struct jffs2_raw_dirent *)
958 get_node_mem(next->offset, NULL);
959 match = jDirNext->pino == jDir->pino &&
960 jDirNext->nsize == jDir->nsize &&
961 strncmp((char *)jDirNext->name,
965 /* Use next. It is more recent */
967 /* Update buffer with the new info */
970 put_fl_mem(jDirNext, NULL);
973 if (jDir->ino == 0) {
975 put_fl_mem(jDir, pL->readbuf);
979 for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
980 if (b2->ino == jDir->ino &&
981 b2->version >= i_version) {
982 i_version = b2->version;
983 i_offset = b2->offset;
987 if (i_version >= 0) {
988 if (jDir->type == DT_LNK)
989 jNode = get_node_mem(i_offset, NULL);
991 jNode = get_fl_mem(i_offset,
996 dump_inode(pL, jDir, jNode);
997 put_fl_mem(jNode, NULL);
999 put_fl_mem(jDir, pL->readbuf);
1006 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1010 char working_tmp[256];
1013 /* discard any leading slash */
1015 while (fname[i] == '/')
1017 strcpy(tmp, &fname[i]);
1019 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1021 strncpy(working_tmp, tmp, c - tmp);
1022 working_tmp[c - tmp] = '\0';
1024 putstr("search_inode: tmp = ");
1027 putstr("search_inode: wtmp = ");
1028 putstr(working_tmp);
1030 putstr("search_inode: c = ");
1034 for (i = 0; i < strlen(c) - 1; i++)
1038 putstr("search_inode: post tmp = ");
1043 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1044 putstr("find_inode failed for name=");
1045 putstr(working_tmp);
1050 /* this is for the bare filename, directories have already been mapped */
1051 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1052 putstr("find_inode failed for name=");
1062 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1066 struct jffs2_raw_dirent *jDir;
1067 struct jffs2_raw_inode *jNode;
1068 u8 jDirFoundType = 0;
1069 u32 jDirFoundIno = 0;
1070 u32 jDirFoundPino = 0;
1076 /* we need to search all and return the inode with the highest version */
1077 for(b = pL->dir.listHead; b; b = b->next) {
1078 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1080 if (ino == jDir->ino) {
1081 if (jDir->version < version) {
1082 put_fl_mem(jDir, pL->readbuf);
1086 if (jDir->version == version && jDirFoundType) {
1087 /* I'm pretty sure this isn't legal */
1088 putstr(" ** ERROR ** ");
1089 putnstr(jDir->name, jDir->nsize);
1090 putLabeledWord(" has dup version (resolve) = ",
1094 jDirFoundType = jDir->type;
1095 jDirFoundIno = jDir->ino;
1096 jDirFoundPino = jDir->pino;
1097 version = jDir->version;
1099 put_fl_mem(jDir, pL->readbuf);
1101 /* now we found the right entry again. (shoulda returned inode*) */
1102 if (jDirFoundType != DT_LNK)
1103 return jDirFoundIno;
1105 /* it's a soft link so we follow it again. */
1106 b2 = pL->frag.listHead;
1108 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1110 if (jNode->ino == jDirFoundIno) {
1111 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1114 putLabeledWord("\t\t dsize = ", jNode->dsize);
1115 putstr("\t\t target = ");
1116 putnstr(src, jNode->dsize);
1119 strncpy(tmp, (char *)src, jNode->dsize);
1120 tmp[jNode->dsize] = '\0';
1121 put_fl_mem(jNode, pL->readbuf);
1125 put_fl_mem(jNode, pL->readbuf);
1127 /* ok so the name of the new file to find is in tmp */
1128 /* if it starts with a slash it is root based else shared dirs */
1132 pino = jDirFoundPino;
1134 return jffs2_1pass_search_inode(pL, tmp, pino);
1138 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1142 char working_tmp[256];
1145 /* discard any leading slash */
1147 while (fname[i] == '/')
1149 strcpy(tmp, &fname[i]);
1150 working_tmp[0] = '\0';
1151 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1153 strncpy(working_tmp, tmp, c - tmp);
1154 working_tmp[c - tmp] = '\0';
1155 for (i = 0; i < strlen(c) - 1; i++)
1158 /* only a failure if we arent looking at top level */
1159 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1161 putstr("find_inode failed for name=");
1162 putstr(working_tmp);
1168 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1169 putstr("find_inode failed for name=");
1174 /* this is for the bare filename, directories have already been mapped */
1175 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1176 putstr("find_inode failed for name=");
1186 jffs2_1pass_rescan_needed(struct part_info *part)
1189 struct jffs2_unknown_node onode;
1190 struct jffs2_unknown_node *node;
1191 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1193 if (part->jffs2_priv == 0){
1194 DEBUGF ("rescan: First time in use\n");
1198 /* if we have no list, we need to rescan */
1199 if (pL->frag.listCount == 0) {
1200 DEBUGF ("rescan: fraglist zero\n");
1204 /* but suppose someone reflashed a partition at the same offset... */
1205 b = pL->dir.listHead;
1207 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1208 sizeof(onode), &onode);
1209 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1210 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1211 (unsigned long) b->offset);
1219 #ifdef CONFIG_JFFS2_SUMMARY
1220 static u32 sum_get_unaligned32(u32 *ptr)
1225 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1227 return __le32_to_cpu(val);
1230 static u16 sum_get_unaligned16(u16 *ptr)
1235 val = *p | (*(p + 1) << 8);
1237 return __le16_to_cpu(val);
1240 #define dbg_summary(...) do {} while (0);
1242 * Process the stored summary information - helper function for
1243 * jffs2_sum_scan_sumnode()
1246 static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1247 struct jffs2_raw_summary *summary,
1254 for (pass = 0; pass < 2; pass++) {
1257 for (i = 0; i < summary->sum_num; i++) {
1258 struct jffs2_sum_unknown_flash *spu = sp;
1259 dbg_summary("processing summary index %d\n", i);
1261 switch (sum_get_unaligned16(&spu->nodetype)) {
1262 case JFFS2_NODETYPE_INODE: {
1263 struct jffs2_sum_inode_flash *spi;
1267 b = insert_node(&pL->frag);
1270 b->offset = (u32)part->offset +
1272 sum_get_unaligned32(
1274 b->version = sum_get_unaligned32(
1276 b->ino = sum_get_unaligned32(
1280 sp += JFFS2_SUMMARY_INODE_SIZE;
1284 case JFFS2_NODETYPE_DIRENT: {
1285 struct jffs2_sum_dirent_flash *spd;
1288 b = insert_node(&pL->dir);
1291 b->offset = (u32)part->offset +
1293 sum_get_unaligned32(
1295 b->version = sum_get_unaligned32(
1297 b->pino = sum_get_unaligned32(
1301 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1307 uint16_t nodetype = sum_get_unaligned16(
1309 printf("Unsupported node type %x found"
1312 if ((nodetype & JFFS2_COMPAT_MASK) ==
1313 JFFS2_FEATURE_INCOMPAT)
1323 /* Process the summary node - called from jffs2_scan_eraseblock() */
1324 int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1325 struct jffs2_raw_summary *summary, uint32_t sumsize,
1328 struct jffs2_unknown_node crcnode;
1329 int ret, __maybe_unused ofs;
1332 ofs = part->sector_size - sumsize;
1334 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1335 offset, offset + ofs, sumsize);
1337 /* OK, now check for node validity and CRC */
1338 crcnode.magic = JFFS2_MAGIC_BITMASK;
1339 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1340 crcnode.totlen = summary->totlen;
1341 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1343 if (summary->hdr_crc != crc) {
1344 dbg_summary("Summary node header is corrupt (bad CRC or "
1345 "no summary at all)\n");
1349 if (summary->totlen != sumsize) {
1350 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1354 crc = crc32_no_comp(0, (uchar *)summary,
1355 sizeof(struct jffs2_raw_summary)-8);
1357 if (summary->node_crc != crc) {
1358 dbg_summary("Summary node is corrupt (bad CRC)\n");
1362 crc = crc32_no_comp(0, (uchar *)summary->sum,
1363 sumsize - sizeof(struct jffs2_raw_summary));
1365 if (summary->sum_crc != crc) {
1366 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1370 if (summary->cln_mkr)
1371 dbg_summary("Summary : CLEANMARKER node \n");
1373 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
1374 if (ret == -EBADMSG)
1377 return ret; /* real error */
1382 putstr("Summary node crc error, skipping summary information.\n");
1386 #endif /* CONFIG_JFFS2_SUMMARY */
1388 #ifdef DEBUG_FRAGMENTS
1390 dump_fragments(struct b_lists *pL)
1393 struct jffs2_raw_inode ojNode;
1394 struct jffs2_raw_inode *jNode;
1396 putstr("\r\n\r\n******The fragment Entries******\r\n");
1397 b = pL->frag.listHead;
1399 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1400 sizeof(ojNode), &ojNode);
1401 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1402 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1403 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1404 putLabeledWord("\tbuild_list: version = ", jNode->version);
1405 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1406 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1407 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1408 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1409 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1410 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1411 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1412 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1413 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1419 #ifdef DEBUG_DIRENTS
1421 dump_dirents(struct b_lists *pL)
1424 struct jffs2_raw_dirent *jDir;
1426 putstr("\r\n\r\n******The directory Entries******\r\n");
1427 b = pL->dir.listHead;
1429 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1432 putnstr(jDir->name, jDir->nsize);
1433 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1434 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1435 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1436 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1437 putLabeledWord("\tbuild_list: version = ", jDir->version);
1438 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1439 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1440 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1441 putLabeledWord("\tbuild_list: type = ", jDir->type);
1442 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1443 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1444 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1446 put_fl_mem(jDir, pL->readbuf);
1451 #define DEFAULT_EMPTY_SCAN_SIZE 256
1453 static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1455 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1458 return DEFAULT_EMPTY_SCAN_SIZE;
1462 jffs2_1pass_build_lists(struct part_info * part)
1465 union jffs2_node_union *node;
1475 nr_sectors = lldiv(part->size, part->sector_size);
1476 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1477 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1478 /* only about 5 %. not enough to inconvenience people for. */
1481 /* if we are building a list we need to refresh the cache. */
1482 jffs_init_1pass_list(part);
1483 pL = (struct b_lists *)part->jffs2_priv;
1484 buf = malloc(DEFAULT_EMPTY_SCAN_SIZE);
1485 puts ("Scanning JFFS2 FS: ");
1487 /* start at the beginning of the partition */
1488 for (i = 0; i < nr_sectors; i++) {
1489 uint32_t sector_ofs = i * part->sector_size;
1490 uint32_t buf_ofs = sector_ofs;
1492 uint32_t ofs, prevofs;
1493 #ifdef CONFIG_JFFS2_SUMMARY
1494 struct jffs2_sum_marker *sm;
1495 void *sumptr = NULL;
1499 /* Indicates a sector with a CLEANMARKER was found */
1500 int clean_sector = 0;
1501 struct jffs2_unknown_node crcnode;
1504 /* Set buf_size to maximum length */
1505 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1508 #ifdef CONFIG_JFFS2_SUMMARY
1509 buf_len = sizeof(*sm);
1511 /* Read as much as we want into the _end_ of the preallocated
1514 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1515 buf_len, buf_len, buf + buf_size - buf_len);
1517 sm = (void *)buf + buf_size - sizeof(*sm);
1518 if (sm->magic == JFFS2_SUM_MAGIC) {
1519 sumlen = part->sector_size - sm->offset;
1520 sumptr = buf + buf_size - sumlen;
1522 /* Now, make sure the summary itself is available */
1523 if (sumlen > buf_size) {
1524 /* Need to kmalloc for this. */
1525 sumptr = malloc(sumlen);
1527 putstr("Can't get memory for summary "
1530 jffs2_free_cache(part);
1533 memcpy(sumptr + sumlen - buf_len, buf +
1534 buf_size - buf_len, buf_len);
1536 if (buf_len < sumlen) {
1537 /* Need to read more so that the entire summary
1540 get_fl_mem(part->offset + sector_ofs +
1541 part->sector_size - sumlen,
1542 sumlen - buf_len, sumptr);
1547 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1550 if (buf_size && sumlen > buf_size)
1554 jffs2_free_cache(part);
1561 #endif /* CONFIG_JFFS2_SUMMARY */
1563 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1565 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
1567 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1570 /* Scan only 4KiB of 0xFF before declaring it's empty */
1571 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1572 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1575 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1581 * Set buf_size down to the minimum size required.
1582 * This prevents reading in chunks of flash data unnecessarily.
1584 buf_size = sizeof(union jffs2_node_union);
1587 while (ofs < sector_ofs + part->sector_size) {
1588 if (ofs == prevofs) {
1589 printf("offset %08x already seen, skip\n", ofs);
1595 if (sector_ofs + part->sector_size <
1596 ofs + sizeof(struct jffs2_unknown_node))
1598 if (buf_ofs + buf_len <
1599 ofs + sizeof(struct jffs2_unknown_node)) {
1600 buf_len = min_t(uint32_t, buf_size, sector_ofs
1601 + part->sector_size - ofs);
1602 get_fl_mem((u32)part->offset + ofs, buf_len,
1607 node = (union jffs2_node_union *)&buf[ofs - buf_ofs];
1609 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1614 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1615 part->sector_size)/8,
1618 inbuf_ofs = ofs - buf_ofs;
1619 while (inbuf_ofs < scan_end) {
1620 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1629 * If this sector had a clean marker at the
1630 * beginning, and immediately following this
1631 * have been a bunch of FF bytes, treat the
1632 * entire sector as empty.
1637 /* See how much more there is to read in this
1640 buf_len = min_t(uint32_t, buf_size,
1642 part->sector_size - ofs);
1644 /* No more to read. Break out of main
1645 * loop without marking this range of
1646 * empty space as dirty (because it's
1652 get_fl_mem((u32)part->offset + ofs, buf_len,
1658 * Found something not erased in the sector, so reset
1659 * the 'clean_sector' flag.
1662 if (node->u.magic != JFFS2_MAGIC_BITMASK) {
1668 crcnode.magic = node->u.magic;
1669 crcnode.nodetype = node->u.nodetype | JFFS2_NODE_ACCURATE;
1670 crcnode.totlen = node->u.totlen;
1671 crcnode.hdr_crc = node->u.hdr_crc;
1672 if (!hdr_crc(&crcnode)) {
1678 if (ofs + node->u.totlen > sector_ofs + part->sector_size) {
1684 if (!(node->u.nodetype & JFFS2_NODE_ACCURATE)) {
1685 DEBUGF("Obsolete node type: %x len %d offset 0x%x\n",
1686 node->u.nodetype, node->u.totlen, ofs);
1687 ofs += ((node->u.totlen + 3) & ~3);
1692 /* if its a fragment add it */
1693 switch (node->u.nodetype) {
1694 case JFFS2_NODETYPE_INODE:
1695 if (buf_ofs + buf_len <
1696 ofs + sizeof(struct jffs2_raw_inode)) {
1697 buf_len = min_t(uint32_t,
1698 sizeof(struct jffs2_raw_inode),
1702 get_fl_mem((u32)part->offset + ofs,
1707 if (!inode_crc((struct jffs2_raw_inode *)node))
1710 b = insert_node(&pL->frag);
1713 jffs2_free_cache(part);
1716 b->offset = (u32)part->offset + ofs;
1717 b->version = node->i.version;
1718 b->ino = node->i.ino;
1719 if (max_totlen < node->u.totlen)
1720 max_totlen = node->u.totlen;
1722 case JFFS2_NODETYPE_DIRENT:
1723 if (buf_ofs + buf_len < ofs + sizeof(struct
1728 buf_len = min_t(uint32_t,
1733 get_fl_mem((u32)part->offset + ofs,
1739 if (!dirent_crc((struct jffs2_raw_dirent *)
1746 if (! (counterN%100))
1748 b = insert_node(&pL->dir);
1751 jffs2_free_cache(part);
1754 b->offset = (u32)part->offset + ofs;
1755 b->version = node->d.version;
1756 b->pino = node->d.pino;
1757 if (max_totlen < node->u.totlen)
1758 max_totlen = node->u.totlen;
1761 case JFFS2_NODETYPE_CLEANMARKER:
1762 if (node->u.totlen != sizeof(struct jffs2_unknown_node))
1763 printf("OOPS Cleanmarker has bad size "
1766 sizeof(struct jffs2_unknown_node));
1767 if (node->u.totlen ==
1768 sizeof(struct jffs2_unknown_node) &&
1769 ofs == sector_ofs) {
1771 * Found a CLEANMARKER at the beginning
1772 * of the sector. It's in the correct
1773 * place with correct size and CRC.
1778 case JFFS2_NODETYPE_PADDING:
1779 if (node->u.totlen <
1780 sizeof(struct jffs2_unknown_node))
1781 printf("OOPS Padding has bad size "
1784 sizeof(struct jffs2_unknown_node));
1786 case JFFS2_NODETYPE_SUMMARY:
1789 printf("Unknown node type: %x len %d offset 0x%x\n",
1791 node->u.totlen, ofs);
1793 ofs += ((node->u.totlen + 3) & ~3);
1799 #if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
1803 sort_list(&pL->frag);
1804 sort_list(&pL->dir);
1806 putstr("\b\b done.\r\n"); /* close off the dots */
1808 /* We don't care if malloc failed - then each read operation will
1809 * allocate its own buffer as necessary (NAND) or will read directly
1812 pL->readbuf = malloc(max_totlen);
1814 /* turn the lcd back on. */
1818 putLabeledWord("dir entries = ", pL->dir.listCount);
1819 putLabeledWord("frag entries = ", pL->frag.listCount);
1820 putLabeledWord("+4 increments = ", counter4);
1821 putLabeledWord("+file_offset increments = ", counterF);
1825 #ifdef DEBUG_DIRENTS
1829 #ifdef DEBUG_FRAGMENTS
1833 /* give visual feedback that we are done scanning the flash */
1834 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1840 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1843 struct jffs2_raw_inode ojNode;
1844 struct jffs2_raw_inode *jNode;
1847 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1848 piL->compr_info[i].num_frags = 0;
1849 piL->compr_info[i].compr_sum = 0;
1850 piL->compr_info[i].decompr_sum = 0;
1853 b = pL->frag.listHead;
1855 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1856 sizeof(ojNode), &ojNode);
1857 if (jNode->compr < JFFS2_NUM_COMPR) {
1858 piL->compr_info[jNode->compr].num_frags++;
1859 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1860 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1868 static struct b_lists *
1869 jffs2_get_list(struct part_info * part, const char *who)
1871 /* copy requested part_info struct pointer to global location */
1872 current_part = part;
1874 if (jffs2_1pass_rescan_needed(part)) {
1875 if (!jffs2_1pass_build_lists(part)) {
1876 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1880 return (struct b_lists *)part->jffs2_priv;
1884 /* Print directory / file contents */
1886 jffs2_1pass_ls(struct part_info * part, const char *fname)
1892 if (! (pl = jffs2_get_list(part, "ls")))
1895 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1896 putstr("ls: Failed to scan jffs2 file structure\r\n");
1902 putLabeledWord("found file at inode = ", inode);
1903 putLabeledWord("read_inode returns = ", ret);
1910 /* Load a file from flash into memory. fname can be a full path */
1912 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1919 if (! (pl = jffs2_get_list(part, "load")))
1922 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1923 putstr("load: Failed to find inode\r\n");
1927 /* Resolve symlinks */
1928 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1929 putstr("load: Failed to resolve inode structure\r\n");
1933 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1934 putstr("load: Failed to read inode\r\n");
1938 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1939 (unsigned long) dest, ret);
1943 /* Return information about the fs on this partition */
1945 jffs2_1pass_info(struct part_info * part)
1947 struct b_jffs2_info info;
1951 if (! (pl = jffs2_get_list(part, "info")))
1954 jffs2_1pass_fill_info(pl, &info);
1955 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1956 printf ("Compression: %s\n"
1957 "\tfrag count: %d\n"
1958 "\tcompressed sum: %d\n"
1959 "\tuncompressed sum: %d\n",
1961 info.compr_info[i].num_frags,
1962 info.compr_info[i].compr_sum,
1963 info.compr_info[i].decompr_sum);