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 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
146 * Support for jffs2 on top of NAND-flash
148 * NAND memory isn't mapped in processor's address space,
149 * so data should be fetched from flash before
150 * being processed. This is exactly what functions declared
155 /* this one defined in cmd_nand.c */
156 int read_jffs2_nand(size_t start, size_t len,
157 size_t * retlen, u_char * buf, int nanddev);
159 #define NAND_PAGE_SIZE 512
160 #define NAND_PAGE_SHIFT 9
161 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
163 #ifndef NAND_CACHE_PAGES
164 #define NAND_CACHE_PAGES 16
166 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
168 static u8* nand_cache = NULL;
169 static u32 nand_cache_off = (u32)-1;
170 static int nanddev = 0; /* nand device of current partition */
172 static int read_nand_cached(u32 off, u32 size, u_char *buf)
178 while (bytes_read < size) {
179 if ((off + bytes_read < nand_cache_off) ||
180 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
181 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
183 /* This memory never gets freed but 'cause
184 it's a bootloader, nobody cares */
185 nand_cache = malloc(NAND_CACHE_SIZE);
187 printf("read_nand_cached: can't alloc cache size %d bytes\n",
192 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
193 &retlen, nand_cache, nanddev) < 0 ||
194 retlen != NAND_CACHE_SIZE) {
195 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
196 nand_cache_off, NAND_CACHE_SIZE);
200 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
201 if (cpy_bytes > size - bytes_read)
202 cpy_bytes = size - bytes_read;
203 memcpy(buf + bytes_read,
204 nand_cache + off + bytes_read - nand_cache_off,
206 bytes_read += cpy_bytes;
211 static void *get_fl_mem(u32 off, u32 size, void *ext_buf)
213 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
216 printf("get_fl_mem: can't alloc %d bytes\n", size);
219 if (read_nand_cached(off, size, buf) < 0) {
228 static void *get_node_mem(u32 off)
230 struct jffs2_unknown_node node;
233 if (NULL == get_fl_mem(off, sizeof(node), &node))
236 if (!(ret = get_fl_mem(off, node.magic ==
237 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
239 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
240 off, node.magic, node.nodetype, node.totlen);
245 static void put_fl_mem(void *buf)
250 #else /* defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
252 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
257 static inline void *get_node_mem(u32 off)
262 static inline void put_fl_mem(void *buf)
266 #endif /* defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
269 /* Compression names */
270 static char *compr_names[] = {
278 #if defined(CONFIG_JFFS2_LZO)
281 #if defined(CONFIG_JFFS2_LZARI)
287 static char spinner[] = { '|', '/', '-', '\\' };
289 /* Memory management */
292 struct mem_block *next;
293 struct b_node nodes[NODE_CHUNK];
298 free_nodes(struct b_list *list)
300 while (list->listMemBase != NULL) {
301 struct mem_block *next = list->listMemBase->next;
302 free( list->listMemBase );
303 list->listMemBase = next;
307 static struct b_node *
308 add_node(struct b_list *list)
311 struct mem_block *memBase;
314 memBase = list->listMemBase;
316 index = memBase->index;
318 putLabeledWord("add_node: index = ", index);
319 putLabeledWord("add_node: memBase = ", list->listMemBase);
322 if (memBase == NULL || index >= NODE_CHUNK) {
323 /* we need more space before we continue */
324 memBase = mmalloc(sizeof(struct mem_block));
325 if (memBase == NULL) {
326 putstr("add_node: malloc failed\n");
329 memBase->next = list->listMemBase;
332 putLabeledWord("add_node: alloced a new membase at ", *memBase);
336 /* now we have room to add it. */
337 b = &memBase->nodes[index];
340 memBase->index = index;
341 list->listMemBase = memBase;
346 static struct b_node *
347 insert_node(struct b_list *list, u32 offset)
350 #ifdef CFG_JFFS2_SORT_FRAGMENTS
351 struct b_node *b, *prev;
354 if (!(new = add_node(list))) {
355 putstr("add_node failed!\r\n");
358 new->offset = offset;
360 #ifdef CFG_JFFS2_SORT_FRAGMENTS
361 if (list->listTail != NULL && list->listCompare(new, list->listTail))
362 prev = list->listTail;
363 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
364 prev = list->listLast;
368 for (b = (prev ? prev->next : list->listHead);
369 b != NULL && list->listCompare(new, b);
370 prev = b, b = b->next) {
374 list->listLast = prev;
381 list->listHead = new;
385 new->next = (struct b_node *) NULL;
386 if (list->listTail != NULL) {
387 list->listTail->next = new;
388 list->listTail = new;
390 list->listTail = list->listHead = new;
397 #ifdef CFG_JFFS2_SORT_FRAGMENTS
398 /* Sort data entries with the latest version last, so that if there
399 * is overlapping data the latest version will be used.
401 static int compare_inodes(struct b_node *new, struct b_node *old)
403 struct jffs2_raw_inode ojNew;
404 struct jffs2_raw_inode ojOld;
405 struct jffs2_raw_inode *jNew =
406 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
407 struct jffs2_raw_inode *jOld =
408 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
410 return jNew->version > jOld->version;
413 /* Sort directory entries so all entries in the same directory
414 * with the same name are grouped together, with the latest version
415 * last. This makes it easy to eliminate all but the latest version
416 * by marking the previous version dead by setting the inode to 0.
418 static int compare_dirents(struct b_node *new, struct b_node *old)
420 struct jffs2_raw_dirent ojNew;
421 struct jffs2_raw_dirent ojOld;
422 struct jffs2_raw_dirent *jNew =
423 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
424 struct jffs2_raw_dirent *jOld =
425 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
428 /* ascending sort by pino */
429 if (jNew->pino != jOld->pino)
430 return jNew->pino > jOld->pino;
432 /* pino is the same, so use ascending sort by nsize, so
433 * we don't do strncmp unless we really must.
435 if (jNew->nsize != jOld->nsize)
436 return jNew->nsize > jOld->nsize;
438 /* length is also the same, so use ascending sort by name
440 cmp = strncmp(jNew->name, jOld->name, jNew->nsize);
444 /* we have duplicate names in this directory, so use ascending
447 if (jNew->version > jOld->version) {
448 /* since jNew is newer, we know jOld is not valid, so
449 * mark it with inode 0 and it will not be used
460 jffs2_scan_empty(u32 start_offset, struct part_info *part)
462 char *max = part->offset + part->size - sizeof(struct jffs2_raw_inode);
463 char *offset = part->offset + start_offset;
466 while (offset < max &&
467 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
468 offset += sizeof(u32);
469 /* return if spinning is due */
470 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
473 return offset - part->offset;
477 jffs_init_1pass_list(struct part_info *part)
481 if (part->jffs2_priv != NULL) {
482 pL = (struct b_lists *)part->jffs2_priv;
483 free_nodes(&pL->frag);
484 free_nodes(&pL->dir);
487 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
488 pL = (struct b_lists *)part->jffs2_priv;
490 memset(pL, 0, sizeof(*pL));
491 #ifdef CFG_JFFS2_SORT_FRAGMENTS
492 pL->dir.listCompare = compare_dirents;
493 pL->frag.listCompare = compare_inodes;
499 /* find the inode from the slashless name given a parent */
501 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
504 struct jffs2_raw_inode *jNode;
506 u32 latestVersion = 0;
512 #ifdef CFG_JFFS2_SORT_FRAGMENTS
513 /* Find file size before loading any data, so fragments that
514 * start past the end of file can be ignored. A fragment
515 * that is partially in the file is loaded, so extra data may
516 * be loaded up to the next 4K boundary above the file size.
517 * This shouldn't cause trouble when loading kernel images, so
518 * we will live with it.
520 for (b = pL->frag.listHead; b != NULL; b = b->next) {
521 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
522 sizeof(struct jffs2_raw_inode), NULL);
523 if ((inode == jNode->ino)) {
524 /* get actual file length from the newest node */
525 if (jNode->version >= latestVersion) {
526 totalSize = jNode->isize;
527 latestVersion = jNode->version;
534 for (b = pL->frag.listHead; b != NULL; b = b->next) {
535 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
536 if ((inode == jNode->ino)) {
538 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
539 putLabeledWord("read_inode: inode = ", jNode->ino);
540 putLabeledWord("read_inode: version = ", jNode->version);
541 putLabeledWord("read_inode: isize = ", jNode->isize);
542 putLabeledWord("read_inode: offset = ", jNode->offset);
543 putLabeledWord("read_inode: csize = ", jNode->csize);
544 putLabeledWord("read_inode: dsize = ", jNode->dsize);
545 putLabeledWord("read_inode: compr = ", jNode->compr);
546 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
547 putLabeledWord("read_inode: flags = ", jNode->flags);
550 #ifndef CFG_JFFS2_SORT_FRAGMENTS
551 /* get actual file length from the newest node */
552 if (jNode->version >= latestVersion) {
553 totalSize = jNode->isize;
554 latestVersion = jNode->version;
559 src = ((char *) jNode) + sizeof(struct jffs2_raw_inode);
560 /* ignore data behind latest known EOF */
561 if (jNode->offset > totalSize) {
566 lDest = (char *) (dest + jNode->offset);
568 putLabeledWord("read_inode: src = ", src);
569 putLabeledWord("read_inode: dest = ", lDest);
571 switch (jNode->compr) {
572 case JFFS2_COMPR_NONE:
573 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
575 case JFFS2_COMPR_ZERO:
577 for (i = 0; i < jNode->dsize; i++)
580 case JFFS2_COMPR_RTIME:
582 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
584 case JFFS2_COMPR_DYNRUBIN:
585 /* this is slow but it works */
587 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
589 case JFFS2_COMPR_ZLIB:
590 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
592 #if defined(CONFIG_JFFS2_LZARI)
593 case JFFS2_COMPR_LZARI:
594 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
597 #if defined(CONFIG_JFFS2_LZO)
598 case JFFS2_COMPR_LZO:
599 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
604 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
612 putLabeledWord("read_inode: totalSize = ", totalSize);
613 putLabeledWord("read_inode: compr ret = ", ret);
621 putLabeledWord("read_inode: returning = ", totalSize);
626 /* find the inode from the slashless name given a parent */
628 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
631 struct jffs2_raw_dirent *jDir;
637 /* name is assumed slash free */
641 /* we need to search all and return the inode with the highest version */
642 for(b = pL->dir.listHead; b; b = b->next, counter++) {
643 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
644 if ((pino == jDir->pino) && (len == jDir->nsize) &&
645 (jDir->ino) && /* 0 for unlink */
646 (!strncmp(jDir->name, name, len))) { /* a match */
647 if (jDir->version < version) {
652 if (jDir->version == version && inode != 0) {
653 /* I'm pretty sure this isn't legal */
654 putstr(" ** ERROR ** ");
655 putnstr(jDir->name, jDir->nsize);
656 putLabeledWord(" has dup version =", version);
659 version = jDir->version;
662 putstr("\r\nfind_inode:p&l ->");
663 putnstr(jDir->name, jDir->nsize);
665 putLabeledWord("pino = ", jDir->pino);
666 putLabeledWord("nsize = ", jDir->nsize);
667 putLabeledWord("b = ", (u32) b);
668 putLabeledWord("counter = ", counter);
675 char *mkmodestr(unsigned long mode, char *str)
677 static const char *l = "xwr";
681 switch (mode & S_IFMT) {
682 case S_IFDIR: str[0] = 'd'; break;
683 case S_IFBLK: str[0] = 'b'; break;
684 case S_IFCHR: str[0] = 'c'; break;
685 case S_IFIFO: str[0] = 'f'; break;
686 case S_IFLNK: str[0] = 'l'; break;
687 case S_IFSOCK: str[0] = 's'; break;
688 case S_IFREG: str[0] = '-'; break;
689 default: str[0] = '?';
692 for(i = 0; i < 9; i++) {
694 str[9-i] = (mode & mask)?c:'-';
698 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
699 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
700 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
705 static inline void dump_stat(struct stat *st, const char *name)
710 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
713 ctime_r(&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
715 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
716 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
719 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
720 st->st_size, s, name);
723 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
726 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
731 if(!d || !i) return -1;
733 strncpy(fname, d->name, d->nsize);
734 fname[d->nsize] = '\0';
736 memset(&st,0,sizeof(st));
738 st.st_mtime = i->mtime;
739 st.st_mode = i->mode;
742 /* neither dsize nor isize help us.. do it the long way */
743 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
745 dump_stat(&st, fname);
747 if (d->type == DT_LNK) {
748 unsigned char *src = (unsigned char *) (&i[1]);
750 putnstr(src, (int)i->dsize);
758 /* list inodes with the given pino */
760 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
763 struct jffs2_raw_dirent *jDir;
765 for (b = pL->dir.listHead; b; b = b->next) {
766 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
767 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
769 struct jffs2_raw_inode ojNode;
770 struct jffs2_raw_inode *jNode, *i = NULL;
771 struct b_node *b2 = pL->frag.listHead;
774 jNode = (struct jffs2_raw_inode *)
775 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
776 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
780 if (jDir->type == DT_LNK)
781 i = get_node_mem(b2->offset);
783 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
788 dump_inode(pL, jDir, i);
797 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
801 char working_tmp[256];
804 /* discard any leading slash */
806 while (fname[i] == '/')
808 strcpy(tmp, &fname[i]);
810 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
812 strncpy(working_tmp, tmp, c - tmp);
813 working_tmp[c - tmp] = '\0';
815 putstr("search_inode: tmp = ");
818 putstr("search_inode: wtmp = ");
821 putstr("search_inode: c = ");
825 for (i = 0; i < strlen(c) - 1; i++)
829 putstr("search_inode: post tmp = ");
834 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
835 putstr("find_inode failed for name=");
841 /* this is for the bare filename, directories have already been mapped */
842 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
843 putstr("find_inode failed for name=");
853 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
857 struct jffs2_raw_dirent *jDir;
858 struct jffs2_raw_inode *jNode;
859 u8 jDirFoundType = 0;
860 u32 jDirFoundIno = 0;
861 u32 jDirFoundPino = 0;
867 /* we need to search all and return the inode with the highest version */
868 for(b = pL->dir.listHead; b; b = b->next) {
869 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
870 if (ino == jDir->ino) {
871 if (jDir->version < version) {
876 if (jDir->version == version && jDirFoundType) {
877 /* I'm pretty sure this isn't legal */
878 putstr(" ** ERROR ** ");
879 putnstr(jDir->name, jDir->nsize);
880 putLabeledWord(" has dup version (resolve) = ",
884 jDirFoundType = jDir->type;
885 jDirFoundIno = jDir->ino;
886 jDirFoundPino = jDir->pino;
887 version = jDir->version;
891 /* now we found the right entry again. (shoulda returned inode*) */
892 if (jDirFoundType != DT_LNK)
895 /* it's a soft link so we follow it again. */
896 b2 = pL->frag.listHead;
898 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
899 if (jNode->ino == jDirFoundIno) {
900 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
903 putLabeledWord("\t\t dsize = ", jNode->dsize);
904 putstr("\t\t target = ");
905 putnstr(src, jNode->dsize);
908 strncpy(tmp, src, jNode->dsize);
909 tmp[jNode->dsize] = '\0';
916 /* ok so the name of the new file to find is in tmp */
917 /* if it starts with a slash it is root based else shared dirs */
921 pino = jDirFoundPino;
923 return jffs2_1pass_search_inode(pL, tmp, pino);
927 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
931 char working_tmp[256];
934 /* discard any leading slash */
936 while (fname[i] == '/')
938 strcpy(tmp, &fname[i]);
939 working_tmp[0] = '\0';
940 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
942 strncpy(working_tmp, tmp, c - tmp);
943 working_tmp[c - tmp] = '\0';
944 for (i = 0; i < strlen(c) - 1; i++)
947 /* only a failure if we arent looking at top level */
948 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
950 putstr("find_inode failed for name=");
957 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
958 putstr("find_inode failed for name=");
963 /* this is for the bare filename, directories have already been mapped */
964 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
965 putstr("find_inode failed for name=");
975 jffs2_1pass_rescan_needed(struct part_info *part)
978 struct jffs2_unknown_node onode;
979 struct jffs2_unknown_node *node;
980 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
982 if (part->jffs2_priv == 0){
983 DEBUGF ("rescan: First time in use\n");
986 /* if we have no list, we need to rescan */
987 if (pL->frag.listCount == 0) {
988 DEBUGF ("rescan: fraglist zero\n");
992 /* or if we are scanning a new partition */
993 if (pL->partOffset != part->offset) {
994 DEBUGF ("rescan: different partition\n");
998 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
999 if (nanddev != (int)part->usr_priv - 1) {
1000 DEBUGF ("rescan: nand device changed\n");
1003 #endif /* defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
1005 /* but suppose someone reflashed a partition at the same offset... */
1006 b = pL->dir.listHead;
1008 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1009 sizeof(onode), &onode);
1010 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1011 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1012 (unsigned long) b->offset);
1020 #ifdef DEBUG_FRAGMENTS
1022 dump_fragments(struct b_lists *pL)
1025 struct jffs2_raw_inode ojNode;
1026 struct jffs2_raw_inode *jNode;
1028 putstr("\r\n\r\n******The fragment Entries******\r\n");
1029 b = pL->frag.listHead;
1031 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1032 sizeof(ojNode), &ojNode);
1033 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1034 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1035 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1036 putLabeledWord("\tbuild_list: version = ", jNode->version);
1037 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1038 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1039 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1040 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1041 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1042 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1043 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1044 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1045 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1051 #ifdef DEBUG_DIRENTS
1053 dump_dirents(struct b_lists *pL)
1056 struct jffs2_raw_dirent *jDir;
1058 putstr("\r\n\r\n******The directory Entries******\r\n");
1059 b = pL->dir.listHead;
1061 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
1063 putnstr(jDir->name, jDir->nsize);
1064 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1065 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1066 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1067 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1068 putLabeledWord("\tbuild_list: version = ", jDir->version);
1069 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1070 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1071 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1072 putLabeledWord("\tbuild_list: type = ", jDir->type);
1073 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1074 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1075 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1083 jffs2_1pass_build_lists(struct part_info * part)
1086 struct jffs2_unknown_node *node;
1087 u32 offset, oldoffset = 0;
1088 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1094 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
1095 nanddev = (int)part->usr_priv - 1;
1096 #endif /* defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
1098 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1099 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1100 /* only about 5 %. not enough to inconvenience people for. */
1103 /* if we are building a list we need to refresh the cache. */
1104 jffs_init_1pass_list(part);
1105 pL = (struct b_lists *)part->jffs2_priv;
1106 pL->partOffset = part->offset;
1108 puts ("Scanning JFFS2 FS: ");
1110 /* start at the beginning of the partition */
1111 while (offset < max) {
1112 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1113 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1117 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1118 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1119 /* if its a fragment add it */
1120 if (node->nodetype == JFFS2_NODETYPE_INODE &&
1121 inode_crc((struct jffs2_raw_inode *) node)) {
1122 if (insert_node(&pL->frag, (u32) part->offset +
1127 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1128 dirent_crc((struct jffs2_raw_dirent *) node) &&
1129 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
1130 if (! (counterN%100))
1132 if (insert_node(&pL->dir, (u32) part->offset +
1138 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1139 if (node->totlen != sizeof(struct jffs2_unknown_node))
1140 printf("OOPS Cleanmarker has bad size "
1141 "%d != %d\n", node->totlen,
1142 sizeof(struct jffs2_unknown_node));
1143 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1144 if (node->totlen < sizeof(struct jffs2_unknown_node))
1145 printf("OOPS Padding has bad size "
1146 "%d < %d\n", node->totlen,
1147 sizeof(struct jffs2_unknown_node));
1149 printf("Unknown node type: %x len %d "
1150 "offset 0x%x\n", node->nodetype,
1151 node->totlen, offset);
1153 offset += ((node->totlen + 3) & ~3);
1155 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1156 node->nodetype == JFFS2_EMPTY_BITMASK) {
1157 offset = jffs2_scan_empty(offset, part);
1158 } else { /* if we know nothing, we just step and look. */
1162 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1166 putstr("\b\b done.\r\n"); /* close off the dots */
1167 /* turn the lcd back on. */
1171 putLabeledWord("dir entries = ", pL->dir.listCount);
1172 putLabeledWord("frag entries = ", pL->frag.listCount);
1173 putLabeledWord("+4 increments = ", counter4);
1174 putLabeledWord("+file_offset increments = ", counterF);
1178 #ifdef DEBUG_DIRENTS
1182 #ifdef DEBUG_FRAGMENTS
1186 /* give visual feedback that we are done scanning the flash */
1187 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1193 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1196 struct jffs2_raw_inode ojNode;
1197 struct jffs2_raw_inode *jNode;
1200 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1201 piL->compr_info[i].num_frags = 0;
1202 piL->compr_info[i].compr_sum = 0;
1203 piL->compr_info[i].decompr_sum = 0;
1206 b = pL->frag.listHead;
1208 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1209 sizeof(ojNode), &ojNode);
1210 if (jNode->compr < JFFS2_NUM_COMPR) {
1211 piL->compr_info[jNode->compr].num_frags++;
1212 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1213 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1221 static struct b_lists *
1222 jffs2_get_list(struct part_info * part, const char *who)
1224 if (jffs2_1pass_rescan_needed(part)) {
1225 if (!jffs2_1pass_build_lists(part)) {
1226 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1230 return (struct b_lists *)part->jffs2_priv;
1234 /* Print directory / file contents */
1236 jffs2_1pass_ls(struct part_info * part, const char *fname)
1242 if (! (pl = jffs2_get_list(part, "ls")))
1245 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1246 putstr("ls: Failed to scan jffs2 file structure\r\n");
1252 putLabeledWord("found file at inode = ", inode);
1253 putLabeledWord("read_inode returns = ", ret);
1260 /* Load a file from flash into memory. fname can be a full path */
1262 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1269 if (! (pl = jffs2_get_list(part, "load")))
1272 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1273 putstr("load: Failed to find inode\r\n");
1277 /* Resolve symlinks */
1278 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1279 putstr("load: Failed to resolve inode structure\r\n");
1283 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1284 putstr("load: Failed to read inode\r\n");
1288 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1289 (unsigned long) dest, ret);
1293 /* Return information about the fs on this partition */
1295 jffs2_1pass_info(struct part_info * part)
1297 struct b_jffs2_info info;
1301 if (! (pl = jffs2_get_list(part, "info")))
1304 jffs2_1pass_fill_info(pl, &info);
1305 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1306 printf ("Compression: %s\n"
1307 "\tfrag count: %d\n"
1308 "\tcompressed sum: %d\n"
1309 "\tuncompressed sum: %d\n",
1311 info.compr_info[i].num_frags,
1312 info.compr_info[i].compr_sum,
1313 info.compr_info[i].decompr_sum);
1318 #endif /* CFG_CMD_JFFS2 */