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 CFG_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>
120 #if (CONFIG_COMMANDS & CFG_CMD_JFFS2)
122 #include <jffs2/jffs2.h>
123 #include <jffs2/jffs2_1pass.h>
125 #include "jffs2_private.h"
128 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
129 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
131 /* Debugging switches */
132 #undef DEBUG_DIRENTS /* print directory entry list after scan */
133 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
134 #undef DEBUG /* enable debugging messages */
138 # define DEBUGF(fmt,args...) printf(fmt ,##args)
140 # define DEBUGF(fmt,args...)
143 /* keeps pointer to currentlu processed partition */
144 static struct part_info *current_part;
146 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
149 * Support for jffs2 on top of NAND-flash
151 * NAND memory isn't mapped in processor's address space,
152 * so data should be fetched from flash before
153 * being processed. This is exactly what functions declared
158 /* info for NAND chips, defined in drivers/nand/nand.c */
159 extern nand_info_t nand_info[];
161 #define NAND_PAGE_SIZE 512
162 #define NAND_PAGE_SHIFT 9
163 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
165 #ifndef NAND_CACHE_PAGES
166 #define NAND_CACHE_PAGES 16
168 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
170 #ifdef CFG_NAND_LEGACY
171 static u8* nand_cache = NULL;
172 static u32 nand_cache_off = (u32)-1;
174 static int read_nand_cached(u32 off, u32 size, u_char *buf)
176 struct mtdids *id = current_part->dev->id;
181 while (bytes_read < size) {
182 if ((off + bytes_read < nand_cache_off) ||
183 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
184 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
186 /* This memory never gets freed but 'cause
187 it's a bootloader, nobody cares */
188 nand_cache = malloc(NAND_CACHE_SIZE);
190 printf("read_nand_cached: can't alloc cache size %d bytes\n",
196 retlen = NAND_CACHE_SIZE;
197 if (nand_read(&nand_info[id->num], nand_cache_off,
198 &retlen, nand_cache) != 0 ||
199 retlen != NAND_CACHE_SIZE) {
200 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
201 nand_cache_off, NAND_CACHE_SIZE);
205 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
206 if (cpy_bytes > size - bytes_read)
207 cpy_bytes = size - bytes_read;
208 memcpy(buf + bytes_read,
209 nand_cache + off + bytes_read - nand_cache_off,
211 bytes_read += cpy_bytes;
216 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
218 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
221 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
224 if (read_nand_cached(off, size, buf) < 0) {
233 static void *get_node_mem_nand(u32 off)
235 struct jffs2_unknown_node node;
238 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
241 if (!(ret = get_fl_mem_nand(off, node.magic ==
242 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
244 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
245 off, node.magic, node.nodetype, node.totlen);
250 static void put_fl_mem_nand(void *buf)
254 #endif /* CFG_NAND_LEGACY */
255 #endif /* #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
258 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
260 * Support for jffs2 on top of NOR-flash
262 * NOR flash memory is mapped in processor's address space,
263 * just return address.
265 static inline void *get_fl_mem_nor(u32 off)
268 struct mtdids *id = current_part->dev->id;
270 extern flash_info_t flash_info[];
271 flash_info_t *flash = &flash_info[id->num];
273 addr += flash->start[0];
277 static inline void *get_node_mem_nor(u32 off)
279 return (void*)get_fl_mem_nor(off);
281 #endif /* #if (CONFIG_COMMANDS & CFG_CMD_FLASH) */
285 * Generic jffs2 raw memory and node read routines.
288 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
290 struct mtdids *id = current_part->dev->id;
292 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
293 if (id->type == MTD_DEV_TYPE_NOR)
294 return get_fl_mem_nor(off);
297 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) && defined(CFG_NAND_LEGACY)
298 if (id->type == MTD_DEV_TYPE_NAND)
299 return get_fl_mem_nand(off, size, ext_buf);
302 printf("get_fl_mem: unknown device type, using raw offset!\n");
306 static inline void *get_node_mem(u32 off)
308 struct mtdids *id = current_part->dev->id;
310 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
311 if (id->type == MTD_DEV_TYPE_NOR)
312 return get_node_mem_nor(off);
315 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) && defined(CFG_NAND_LEGACY)
316 if (id->type == MTD_DEV_TYPE_NAND)
317 return get_node_mem_nand(off);
320 printf("get_node_mem: unknown device type, using raw offset!\n");
324 static inline void put_fl_mem(void *buf)
326 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) && defined(CFG_NAND_LEGACY)
327 struct mtdids *id = current_part->dev->id;
329 if (id->type == MTD_DEV_TYPE_NAND)
330 return put_fl_mem_nand(buf);
334 /* Compression names */
335 static char *compr_names[] = {
343 #if defined(CONFIG_JFFS2_LZO_LZARI)
350 static char spinner[] = { '|', '/', '-', '\\' };
352 /* Memory management */
355 struct mem_block *next;
356 struct b_node nodes[NODE_CHUNK];
361 free_nodes(struct b_list *list)
363 while (list->listMemBase != NULL) {
364 struct mem_block *next = list->listMemBase->next;
365 free( list->listMemBase );
366 list->listMemBase = next;
370 static struct b_node *
371 add_node(struct b_list *list)
374 struct mem_block *memBase;
377 memBase = list->listMemBase;
379 index = memBase->index;
381 putLabeledWord("add_node: index = ", index);
382 putLabeledWord("add_node: memBase = ", list->listMemBase);
385 if (memBase == NULL || index >= NODE_CHUNK) {
386 /* we need more space before we continue */
387 memBase = mmalloc(sizeof(struct mem_block));
388 if (memBase == NULL) {
389 putstr("add_node: malloc failed\n");
392 memBase->next = list->listMemBase;
395 putLabeledWord("add_node: alloced a new membase at ", *memBase);
399 /* now we have room to add it. */
400 b = &memBase->nodes[index];
403 memBase->index = index;
404 list->listMemBase = memBase;
409 static struct b_node *
410 insert_node(struct b_list *list, u32 offset)
413 #ifdef CFG_JFFS2_SORT_FRAGMENTS
414 struct b_node *b, *prev;
417 if (!(new = add_node(list))) {
418 putstr("add_node failed!\r\n");
421 new->offset = offset;
423 #ifdef CFG_JFFS2_SORT_FRAGMENTS
424 if (list->listTail != NULL && list->listCompare(new, list->listTail))
425 prev = list->listTail;
426 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
427 prev = list->listLast;
431 for (b = (prev ? prev->next : list->listHead);
432 b != NULL && list->listCompare(new, b);
433 prev = b, b = b->next) {
437 list->listLast = prev;
444 list->listHead = new;
448 new->next = (struct b_node *) NULL;
449 if (list->listTail != NULL) {
450 list->listTail->next = new;
451 list->listTail = new;
453 list->listTail = list->listHead = new;
460 #ifdef CFG_JFFS2_SORT_FRAGMENTS
461 /* Sort data entries with the latest version last, so that if there
462 * is overlapping data the latest version will be used.
464 static int compare_inodes(struct b_node *new, struct b_node *old)
466 struct jffs2_raw_inode ojNew;
467 struct jffs2_raw_inode ojOld;
468 struct jffs2_raw_inode *jNew =
469 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
470 struct jffs2_raw_inode *jOld =
471 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
473 return jNew->version > jOld->version;
476 /* Sort directory entries so all entries in the same directory
477 * with the same name are grouped together, with the latest version
478 * last. This makes it easy to eliminate all but the latest version
479 * by marking the previous version dead by setting the inode to 0.
481 static int compare_dirents(struct b_node *new, struct b_node *old)
483 struct jffs2_raw_dirent ojNew;
484 struct jffs2_raw_dirent ojOld;
485 struct jffs2_raw_dirent *jNew =
486 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
487 struct jffs2_raw_dirent *jOld =
488 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
491 /* ascending sort by pino */
492 if (jNew->pino != jOld->pino)
493 return jNew->pino > jOld->pino;
495 /* pino is the same, so use ascending sort by nsize, so
496 * we don't do strncmp unless we really must.
498 if (jNew->nsize != jOld->nsize)
499 return jNew->nsize > jOld->nsize;
501 /* length is also the same, so use ascending sort by name
503 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
507 /* we have duplicate names in this directory, so use ascending
510 if (jNew->version > jOld->version) {
511 /* since jNew is newer, we know jOld is not valid, so
512 * mark it with inode 0 and it will not be used
523 jffs2_scan_empty(u32 start_offset, struct part_info *part)
525 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode));
526 char *offset = (char *)(part->offset + start_offset);
529 while (offset < max &&
530 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
531 offset += sizeof(u32);
532 /* return if spinning is due */
533 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
536 return (u32)offset - part->offset;
540 jffs2_free_cache(struct part_info *part)
544 if (part->jffs2_priv != NULL) {
545 pL = (struct b_lists *)part->jffs2_priv;
546 free_nodes(&pL->frag);
547 free_nodes(&pL->dir);
553 jffs_init_1pass_list(struct part_info *part)
557 jffs2_free_cache(part);
559 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
560 pL = (struct b_lists *)part->jffs2_priv;
562 memset(pL, 0, sizeof(*pL));
563 #ifdef CFG_JFFS2_SORT_FRAGMENTS
564 pL->dir.listCompare = compare_dirents;
565 pL->frag.listCompare = compare_inodes;
571 /* find the inode from the slashless name given a parent */
573 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
576 struct jffs2_raw_inode *jNode;
578 u32 latestVersion = 0;
584 #ifdef CFG_JFFS2_SORT_FRAGMENTS
585 /* Find file size before loading any data, so fragments that
586 * start past the end of file can be ignored. A fragment
587 * that is partially in the file is loaded, so extra data may
588 * be loaded up to the next 4K boundary above the file size.
589 * This shouldn't cause trouble when loading kernel images, so
590 * we will live with it.
592 for (b = pL->frag.listHead; b != NULL; b = b->next) {
593 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
594 sizeof(struct jffs2_raw_inode), NULL);
595 if ((inode == jNode->ino)) {
596 /* get actual file length from the newest node */
597 if (jNode->version >= latestVersion) {
598 totalSize = jNode->isize;
599 latestVersion = jNode->version;
606 for (b = pL->frag.listHead; b != NULL; b = b->next) {
607 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
608 if ((inode == jNode->ino)) {
610 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
611 putLabeledWord("read_inode: inode = ", jNode->ino);
612 putLabeledWord("read_inode: version = ", jNode->version);
613 putLabeledWord("read_inode: isize = ", jNode->isize);
614 putLabeledWord("read_inode: offset = ", jNode->offset);
615 putLabeledWord("read_inode: csize = ", jNode->csize);
616 putLabeledWord("read_inode: dsize = ", jNode->dsize);
617 putLabeledWord("read_inode: compr = ", jNode->compr);
618 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
619 putLabeledWord("read_inode: flags = ", jNode->flags);
622 #ifndef CFG_JFFS2_SORT_FRAGMENTS
623 /* get actual file length from the newest node */
624 if (jNode->version >= latestVersion) {
625 totalSize = jNode->isize;
626 latestVersion = jNode->version;
631 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
632 /* ignore data behind latest known EOF */
633 if (jNode->offset > totalSize) {
638 lDest = (uchar *) (dest + jNode->offset);
640 putLabeledWord("read_inode: src = ", src);
641 putLabeledWord("read_inode: dest = ", lDest);
643 switch (jNode->compr) {
644 case JFFS2_COMPR_NONE:
645 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
647 case JFFS2_COMPR_ZERO:
649 for (i = 0; i < jNode->dsize; i++)
652 case JFFS2_COMPR_RTIME:
654 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
656 case JFFS2_COMPR_DYNRUBIN:
657 /* this is slow but it works */
659 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
661 case JFFS2_COMPR_ZLIB:
662 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
664 #if defined(CONFIG_JFFS2_LZO_LZARI)
665 case JFFS2_COMPR_LZO:
666 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
668 case JFFS2_COMPR_LZARI:
669 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
674 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
682 putLabeledWord("read_inode: totalSize = ", totalSize);
683 putLabeledWord("read_inode: compr ret = ", ret);
691 putLabeledWord("read_inode: returning = ", totalSize);
696 /* find the inode from the slashless name given a parent */
698 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
701 struct jffs2_raw_dirent *jDir;
707 /* name is assumed slash free */
711 /* we need to search all and return the inode with the highest version */
712 for(b = pL->dir.listHead; b; b = b->next, counter++) {
713 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
714 if ((pino == jDir->pino) && (len == jDir->nsize) &&
715 (jDir->ino) && /* 0 for unlink */
716 (!strncmp((char *)jDir->name, name, len))) { /* a match */
717 if (jDir->version < version) {
722 if (jDir->version == version && inode != 0) {
723 /* I'm pretty sure this isn't legal */
724 putstr(" ** ERROR ** ");
725 putnstr(jDir->name, jDir->nsize);
726 putLabeledWord(" has dup version =", version);
729 version = jDir->version;
732 putstr("\r\nfind_inode:p&l ->");
733 putnstr(jDir->name, jDir->nsize);
735 putLabeledWord("pino = ", jDir->pino);
736 putLabeledWord("nsize = ", jDir->nsize);
737 putLabeledWord("b = ", (u32) b);
738 putLabeledWord("counter = ", counter);
745 char *mkmodestr(unsigned long mode, char *str)
747 static const char *l = "xwr";
751 switch (mode & S_IFMT) {
752 case S_IFDIR: str[0] = 'd'; break;
753 case S_IFBLK: str[0] = 'b'; break;
754 case S_IFCHR: str[0] = 'c'; break;
755 case S_IFIFO: str[0] = 'f'; break;
756 case S_IFLNK: str[0] = 'l'; break;
757 case S_IFSOCK: str[0] = 's'; break;
758 case S_IFREG: str[0] = '-'; break;
759 default: str[0] = '?';
762 for(i = 0; i < 9; i++) {
764 str[9-i] = (mode & mask)?c:'-';
768 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
769 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
770 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
775 static inline void dump_stat(struct stat *st, const char *name)
780 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
783 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
785 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
786 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
789 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
790 st->st_size, s, name);
793 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
796 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
801 if(!d || !i) return -1;
803 strncpy(fname, (char *)d->name, d->nsize);
804 fname[d->nsize] = '\0';
806 memset(&st,0,sizeof(st));
808 st.st_mtime = i->mtime;
809 st.st_mode = i->mode;
812 /* neither dsize nor isize help us.. do it the long way */
813 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
815 dump_stat(&st, fname);
817 if (d->type == DT_LNK) {
818 unsigned char *src = (unsigned char *) (&i[1]);
820 putnstr(src, (int)i->dsize);
828 /* list inodes with the given pino */
830 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
833 struct jffs2_raw_dirent *jDir;
835 for (b = pL->dir.listHead; b; b = b->next) {
836 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
837 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
839 struct jffs2_raw_inode ojNode;
840 struct jffs2_raw_inode *jNode, *i = NULL;
841 struct b_node *b2 = pL->frag.listHead;
844 jNode = (struct jffs2_raw_inode *)
845 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
846 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
850 if (jDir->type == DT_LNK)
851 i = get_node_mem(b2->offset);
853 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
858 dump_inode(pL, jDir, i);
867 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
871 char working_tmp[256];
874 /* discard any leading slash */
876 while (fname[i] == '/')
878 strcpy(tmp, &fname[i]);
880 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
882 strncpy(working_tmp, tmp, c - tmp);
883 working_tmp[c - tmp] = '\0';
885 putstr("search_inode: tmp = ");
888 putstr("search_inode: wtmp = ");
891 putstr("search_inode: c = ");
895 for (i = 0; i < strlen(c) - 1; i++)
899 putstr("search_inode: post tmp = ");
904 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
905 putstr("find_inode failed for name=");
911 /* this is for the bare filename, directories have already been mapped */
912 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
913 putstr("find_inode failed for name=");
923 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
927 struct jffs2_raw_dirent *jDir;
928 struct jffs2_raw_inode *jNode;
929 u8 jDirFoundType = 0;
930 u32 jDirFoundIno = 0;
931 u32 jDirFoundPino = 0;
937 /* we need to search all and return the inode with the highest version */
938 for(b = pL->dir.listHead; b; b = b->next) {
939 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
940 if (ino == jDir->ino) {
941 if (jDir->version < version) {
946 if (jDir->version == version && jDirFoundType) {
947 /* I'm pretty sure this isn't legal */
948 putstr(" ** ERROR ** ");
949 putnstr(jDir->name, jDir->nsize);
950 putLabeledWord(" has dup version (resolve) = ",
954 jDirFoundType = jDir->type;
955 jDirFoundIno = jDir->ino;
956 jDirFoundPino = jDir->pino;
957 version = jDir->version;
961 /* now we found the right entry again. (shoulda returned inode*) */
962 if (jDirFoundType != DT_LNK)
965 /* it's a soft link so we follow it again. */
966 b2 = pL->frag.listHead;
968 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
969 if (jNode->ino == jDirFoundIno) {
970 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
973 putLabeledWord("\t\t dsize = ", jNode->dsize);
974 putstr("\t\t target = ");
975 putnstr(src, jNode->dsize);
978 strncpy(tmp, (char *)src, jNode->dsize);
979 tmp[jNode->dsize] = '\0';
986 /* ok so the name of the new file to find is in tmp */
987 /* if it starts with a slash it is root based else shared dirs */
991 pino = jDirFoundPino;
993 return jffs2_1pass_search_inode(pL, tmp, pino);
997 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1001 char working_tmp[256];
1004 /* discard any leading slash */
1006 while (fname[i] == '/')
1008 strcpy(tmp, &fname[i]);
1009 working_tmp[0] = '\0';
1010 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1012 strncpy(working_tmp, tmp, c - tmp);
1013 working_tmp[c - tmp] = '\0';
1014 for (i = 0; i < strlen(c) - 1; i++)
1017 /* only a failure if we arent looking at top level */
1018 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1020 putstr("find_inode failed for name=");
1021 putstr(working_tmp);
1027 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1028 putstr("find_inode failed for name=");
1033 /* this is for the bare filename, directories have already been mapped */
1034 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1035 putstr("find_inode failed for name=");
1045 jffs2_1pass_rescan_needed(struct part_info *part)
1048 struct jffs2_unknown_node onode;
1049 struct jffs2_unknown_node *node;
1050 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1052 if (part->jffs2_priv == 0){
1053 DEBUGF ("rescan: First time in use\n");
1057 /* if we have no list, we need to rescan */
1058 if (pL->frag.listCount == 0) {
1059 DEBUGF ("rescan: fraglist zero\n");
1063 /* but suppose someone reflashed a partition at the same offset... */
1064 b = pL->dir.listHead;
1066 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1067 sizeof(onode), &onode);
1068 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1069 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1070 (unsigned long) b->offset);
1078 #ifdef DEBUG_FRAGMENTS
1080 dump_fragments(struct b_lists *pL)
1083 struct jffs2_raw_inode ojNode;
1084 struct jffs2_raw_inode *jNode;
1086 putstr("\r\n\r\n******The fragment Entries******\r\n");
1087 b = pL->frag.listHead;
1089 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1090 sizeof(ojNode), &ojNode);
1091 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1092 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1093 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1094 putLabeledWord("\tbuild_list: version = ", jNode->version);
1095 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1096 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1097 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1098 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1099 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1100 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1101 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1102 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1103 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1109 #ifdef DEBUG_DIRENTS
1111 dump_dirents(struct b_lists *pL)
1114 struct jffs2_raw_dirent *jDir;
1116 putstr("\r\n\r\n******The directory Entries******\r\n");
1117 b = pL->dir.listHead;
1119 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
1121 putnstr(jDir->name, jDir->nsize);
1122 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1123 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1124 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1125 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1126 putLabeledWord("\tbuild_list: version = ", jDir->version);
1127 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1128 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1129 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1130 putLabeledWord("\tbuild_list: type = ", jDir->type);
1131 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1132 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1133 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1141 jffs2_1pass_build_lists(struct part_info * part)
1144 struct jffs2_unknown_node *node;
1145 u32 offset, oldoffset = 0;
1146 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1152 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1153 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1154 /* only about 5 %. not enough to inconvenience people for. */
1157 /* if we are building a list we need to refresh the cache. */
1158 jffs_init_1pass_list(part);
1159 pL = (struct b_lists *)part->jffs2_priv;
1161 puts ("Scanning JFFS2 FS: ");
1163 /* start at the beginning of the partition */
1164 while (offset < max) {
1165 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1166 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1170 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1171 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1172 /* if its a fragment add it */
1173 if (node->nodetype == JFFS2_NODETYPE_INODE &&
1174 inode_crc((struct jffs2_raw_inode *) node) &&
1175 data_crc((struct jffs2_raw_inode *) node)) {
1176 if (insert_node(&pL->frag, (u32) part->offset +
1181 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1182 dirent_crc((struct jffs2_raw_dirent *) node) &&
1183 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
1184 if (! (counterN%100))
1186 if (insert_node(&pL->dir, (u32) part->offset +
1192 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1193 if (node->totlen != sizeof(struct jffs2_unknown_node))
1194 printf("OOPS Cleanmarker has bad size "
1195 "%d != %d\n", node->totlen,
1196 sizeof(struct jffs2_unknown_node));
1197 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1198 if (node->totlen < sizeof(struct jffs2_unknown_node))
1199 printf("OOPS Padding has bad size "
1200 "%d < %d\n", node->totlen,
1201 sizeof(struct jffs2_unknown_node));
1203 printf("Unknown node type: %x len %d "
1204 "offset 0x%x\n", node->nodetype,
1205 node->totlen, offset);
1207 offset += ((node->totlen + 3) & ~3);
1209 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1210 node->nodetype == JFFS2_EMPTY_BITMASK) {
1211 offset = jffs2_scan_empty(offset, part);
1212 } else { /* if we know nothing, we just step and look. */
1216 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1220 putstr("\b\b done.\r\n"); /* close off the dots */
1221 /* turn the lcd back on. */
1225 putLabeledWord("dir entries = ", pL->dir.listCount);
1226 putLabeledWord("frag entries = ", pL->frag.listCount);
1227 putLabeledWord("+4 increments = ", counter4);
1228 putLabeledWord("+file_offset increments = ", counterF);
1232 #ifdef DEBUG_DIRENTS
1236 #ifdef DEBUG_FRAGMENTS
1240 /* give visual feedback that we are done scanning the flash */
1241 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1247 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1250 struct jffs2_raw_inode ojNode;
1251 struct jffs2_raw_inode *jNode;
1254 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1255 piL->compr_info[i].num_frags = 0;
1256 piL->compr_info[i].compr_sum = 0;
1257 piL->compr_info[i].decompr_sum = 0;
1260 b = pL->frag.listHead;
1262 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1263 sizeof(ojNode), &ojNode);
1264 if (jNode->compr < JFFS2_NUM_COMPR) {
1265 piL->compr_info[jNode->compr].num_frags++;
1266 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1267 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1275 static struct b_lists *
1276 jffs2_get_list(struct part_info * part, const char *who)
1278 /* copy requested part_info struct pointer to global location */
1279 current_part = part;
1281 if (jffs2_1pass_rescan_needed(part)) {
1282 if (!jffs2_1pass_build_lists(part)) {
1283 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1287 return (struct b_lists *)part->jffs2_priv;
1291 /* Print directory / file contents */
1293 jffs2_1pass_ls(struct part_info * part, const char *fname)
1299 if (! (pl = jffs2_get_list(part, "ls")))
1302 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1303 putstr("ls: Failed to scan jffs2 file structure\r\n");
1309 putLabeledWord("found file at inode = ", inode);
1310 putLabeledWord("read_inode returns = ", ret);
1317 /* Load a file from flash into memory. fname can be a full path */
1319 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1326 if (! (pl = jffs2_get_list(part, "load")))
1329 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1330 putstr("load: Failed to find inode\r\n");
1334 /* Resolve symlinks */
1335 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1336 putstr("load: Failed to resolve inode structure\r\n");
1340 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1341 putstr("load: Failed to read inode\r\n");
1345 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1346 (unsigned long) dest, ret);
1350 /* Return information about the fs on this partition */
1352 jffs2_1pass_info(struct part_info * part)
1354 struct b_jffs2_info info;
1358 if (! (pl = jffs2_get_list(part, "info")))
1361 jffs2_1pass_fill_info(pl, &info);
1362 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1363 printf ("Compression: %s\n"
1364 "\tfrag count: %d\n"
1365 "\tcompressed sum: %d\n"
1366 "\tuncompressed sum: %d\n",
1368 info.compr_info[i].num_frags,
1369 info.compr_info[i].compr_sum,
1370 info.compr_info[i].decompr_sum);
1375 #endif /* CFG_CMD_JFFS2 */