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)
148 * Support for jffs2 on top of NAND-flash
150 * NAND memory isn't mapped in processor's address space,
151 * so data should be fetched from flash before
152 * being processed. This is exactly what functions declared
157 /* this one defined in cmd_nand.c */
158 int read_jffs2_nand(size_t start, size_t len,
159 size_t * retlen, u_char * buf, int nanddev);
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 static u8* nand_cache = NULL;
171 static u32 nand_cache_off = (u32)-1;
173 static int read_nand_cached(u32 off, u32 size, u_char *buf)
175 struct mtdids *id = current_part->dev->id;
180 while (bytes_read < size) {
181 if ((off + bytes_read < nand_cache_off) ||
182 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
183 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
185 /* This memory never gets freed but 'cause
186 it's a bootloader, nobody cares */
187 nand_cache = malloc(NAND_CACHE_SIZE);
189 printf("read_nand_cached: can't alloc cache size %d bytes\n",
194 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
195 &retlen, nand_cache, id->num) < 0 ||
196 retlen != NAND_CACHE_SIZE) {
197 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
198 nand_cache_off, NAND_CACHE_SIZE);
202 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
203 if (cpy_bytes > size - bytes_read)
204 cpy_bytes = size - bytes_read;
205 memcpy(buf + bytes_read,
206 nand_cache + off + bytes_read - nand_cache_off,
208 bytes_read += cpy_bytes;
213 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
215 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
218 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
221 if (read_nand_cached(off, size, buf) < 0) {
230 static void *get_node_mem_nand(u32 off)
232 struct jffs2_unknown_node node;
235 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
238 if (!(ret = get_fl_mem_nand(off, node.magic ==
239 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
241 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
242 off, node.magic, node.nodetype, node.totlen);
247 static void put_fl_mem_nand(void *buf)
251 #endif /* #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
254 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
256 * Support for jffs2 on top of NOR-flash
258 * NOR flash memory is mapped in processor's address space,
259 * just return address.
261 static inline void *get_fl_mem_nor(u32 off)
264 struct mtdids *id = current_part->dev->id;
266 extern flash_info_t flash_info[CFG_MAX_FLASH_BANKS];
267 flash_info_t *flash = &flash_info[id->num];
269 addr += flash->start[0];
273 static inline void *get_node_mem_nor(u32 off)
275 return (void*)get_fl_mem_nor(off);
277 #endif /* #if (CONFIG_COMMANDS & CFG_CMD_FLASH) */
281 * Generic jffs2 raw memory and node read routines.
284 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
286 struct mtdids *id = current_part->dev->id;
288 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
289 if (id->type == MTD_DEV_TYPE_NOR)
290 return get_fl_mem_nor(off);
293 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
294 if (id->type == MTD_DEV_TYPE_NAND)
295 return get_fl_mem_nand(off, size, ext_buf);
298 printf("get_fl_mem: unknown device type, using raw offset!\n");
302 static inline void *get_node_mem(u32 off)
304 struct mtdids *id = current_part->dev->id;
306 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
307 if (id->type == MTD_DEV_TYPE_NOR)
308 return get_node_mem_nor(off);
311 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
312 if (id->type == MTD_DEV_TYPE_NAND)
313 return get_node_mem_nand(off);
316 printf("get_node_mem: unknown device type, using raw offset!\n");
320 static inline void put_fl_mem(void *buf)
322 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
323 struct mtdids *id = current_part->dev->id;
325 if (id->type == MTD_DEV_TYPE_NAND)
326 return put_fl_mem_nand(buf);
330 /* Compression names */
331 static char *compr_names[] = {
339 #if defined(CONFIG_JFFS2_LZO_LZARI)
346 static char spinner[] = { '|', '/', '-', '\\' };
348 /* Memory management */
351 struct mem_block *next;
352 struct b_node nodes[NODE_CHUNK];
357 free_nodes(struct b_list *list)
359 while (list->listMemBase != NULL) {
360 struct mem_block *next = list->listMemBase->next;
361 free( list->listMemBase );
362 list->listMemBase = next;
366 static struct b_node *
367 add_node(struct b_list *list)
370 struct mem_block *memBase;
373 memBase = list->listMemBase;
375 index = memBase->index;
377 putLabeledWord("add_node: index = ", index);
378 putLabeledWord("add_node: memBase = ", list->listMemBase);
381 if (memBase == NULL || index >= NODE_CHUNK) {
382 /* we need more space before we continue */
383 memBase = mmalloc(sizeof(struct mem_block));
384 if (memBase == NULL) {
385 putstr("add_node: malloc failed\n");
388 memBase->next = list->listMemBase;
391 putLabeledWord("add_node: alloced a new membase at ", *memBase);
395 /* now we have room to add it. */
396 b = &memBase->nodes[index];
399 memBase->index = index;
400 list->listMemBase = memBase;
405 static struct b_node *
406 insert_node(struct b_list *list, u32 offset)
409 #ifdef CFG_JFFS2_SORT_FRAGMENTS
410 struct b_node *b, *prev;
413 if (!(new = add_node(list))) {
414 putstr("add_node failed!\r\n");
417 new->offset = offset;
419 #ifdef CFG_JFFS2_SORT_FRAGMENTS
420 if (list->listTail != NULL && list->listCompare(new, list->listTail))
421 prev = list->listTail;
422 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
423 prev = list->listLast;
427 for (b = (prev ? prev->next : list->listHead);
428 b != NULL && list->listCompare(new, b);
429 prev = b, b = b->next) {
433 list->listLast = prev;
440 list->listHead = new;
444 new->next = (struct b_node *) NULL;
445 if (list->listTail != NULL) {
446 list->listTail->next = new;
447 list->listTail = new;
449 list->listTail = list->listHead = new;
456 #ifdef CFG_JFFS2_SORT_FRAGMENTS
457 /* Sort data entries with the latest version last, so that if there
458 * is overlapping data the latest version will be used.
460 static int compare_inodes(struct b_node *new, struct b_node *old)
462 struct jffs2_raw_inode ojNew;
463 struct jffs2_raw_inode ojOld;
464 struct jffs2_raw_inode *jNew =
465 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
466 struct jffs2_raw_inode *jOld =
467 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
469 return jNew->version > jOld->version;
472 /* Sort directory entries so all entries in the same directory
473 * with the same name are grouped together, with the latest version
474 * last. This makes it easy to eliminate all but the latest version
475 * by marking the previous version dead by setting the inode to 0.
477 static int compare_dirents(struct b_node *new, struct b_node *old)
479 struct jffs2_raw_dirent ojNew;
480 struct jffs2_raw_dirent ojOld;
481 struct jffs2_raw_dirent *jNew =
482 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
483 struct jffs2_raw_dirent *jOld =
484 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
487 /* ascending sort by pino */
488 if (jNew->pino != jOld->pino)
489 return jNew->pino > jOld->pino;
491 /* pino is the same, so use ascending sort by nsize, so
492 * we don't do strncmp unless we really must.
494 if (jNew->nsize != jOld->nsize)
495 return jNew->nsize > jOld->nsize;
497 /* length is also the same, so use ascending sort by name
499 cmp = strncmp(jNew->name, jOld->name, jNew->nsize);
503 /* we have duplicate names in this directory, so use ascending
506 if (jNew->version > jOld->version) {
507 /* since jNew is newer, we know jOld is not valid, so
508 * mark it with inode 0 and it will not be used
519 jffs2_scan_empty(u32 start_offset, struct part_info *part)
521 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode));
522 char *offset = (char *)(part->offset + start_offset);
525 while (offset < max &&
526 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
527 offset += sizeof(u32);
528 /* return if spinning is due */
529 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
532 return (u32)offset - part->offset;
536 jffs2_free_cache(struct part_info *part)
540 if (part->jffs2_priv != NULL) {
541 pL = (struct b_lists *)part->jffs2_priv;
542 free_nodes(&pL->frag);
543 free_nodes(&pL->dir);
549 jffs_init_1pass_list(struct part_info *part)
553 jffs2_free_cache(part);
555 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
556 pL = (struct b_lists *)part->jffs2_priv;
558 memset(pL, 0, sizeof(*pL));
559 #ifdef CFG_JFFS2_SORT_FRAGMENTS
560 pL->dir.listCompare = compare_dirents;
561 pL->frag.listCompare = compare_inodes;
567 /* find the inode from the slashless name given a parent */
569 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
572 struct jffs2_raw_inode *jNode;
574 u32 latestVersion = 0;
580 #ifdef CFG_JFFS2_SORT_FRAGMENTS
581 /* Find file size before loading any data, so fragments that
582 * start past the end of file can be ignored. A fragment
583 * that is partially in the file is loaded, so extra data may
584 * be loaded up to the next 4K boundary above the file size.
585 * This shouldn't cause trouble when loading kernel images, so
586 * we will live with it.
588 for (b = pL->frag.listHead; b != NULL; b = b->next) {
589 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
590 sizeof(struct jffs2_raw_inode), NULL);
591 if ((inode == jNode->ino)) {
592 /* get actual file length from the newest node */
593 if (jNode->version >= latestVersion) {
594 totalSize = jNode->isize;
595 latestVersion = jNode->version;
602 for (b = pL->frag.listHead; b != NULL; b = b->next) {
603 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
604 if ((inode == jNode->ino)) {
606 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
607 putLabeledWord("read_inode: inode = ", jNode->ino);
608 putLabeledWord("read_inode: version = ", jNode->version);
609 putLabeledWord("read_inode: isize = ", jNode->isize);
610 putLabeledWord("read_inode: offset = ", jNode->offset);
611 putLabeledWord("read_inode: csize = ", jNode->csize);
612 putLabeledWord("read_inode: dsize = ", jNode->dsize);
613 putLabeledWord("read_inode: compr = ", jNode->compr);
614 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
615 putLabeledWord("read_inode: flags = ", jNode->flags);
618 #ifndef CFG_JFFS2_SORT_FRAGMENTS
619 /* get actual file length from the newest node */
620 if (jNode->version >= latestVersion) {
621 totalSize = jNode->isize;
622 latestVersion = jNode->version;
627 src = ((char *) jNode) + sizeof(struct jffs2_raw_inode);
628 /* ignore data behind latest known EOF */
629 if (jNode->offset > totalSize) {
634 lDest = (char *) (dest + jNode->offset);
636 putLabeledWord("read_inode: src = ", src);
637 putLabeledWord("read_inode: dest = ", lDest);
639 switch (jNode->compr) {
640 case JFFS2_COMPR_NONE:
641 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
643 case JFFS2_COMPR_ZERO:
645 for (i = 0; i < jNode->dsize; i++)
648 case JFFS2_COMPR_RTIME:
650 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
652 case JFFS2_COMPR_DYNRUBIN:
653 /* this is slow but it works */
655 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
657 case JFFS2_COMPR_ZLIB:
658 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
660 #if defined(CONFIG_JFFS2_LZO_LZARI)
661 case JFFS2_COMPR_LZO:
662 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
664 case JFFS2_COMPR_LZARI:
665 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
670 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
678 putLabeledWord("read_inode: totalSize = ", totalSize);
679 putLabeledWord("read_inode: compr ret = ", ret);
687 putLabeledWord("read_inode: returning = ", totalSize);
692 /* find the inode from the slashless name given a parent */
694 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
697 struct jffs2_raw_dirent *jDir;
703 /* name is assumed slash free */
707 /* we need to search all and return the inode with the highest version */
708 for(b = pL->dir.listHead; b; b = b->next, counter++) {
709 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
710 if ((pino == jDir->pino) && (len == jDir->nsize) &&
711 (jDir->ino) && /* 0 for unlink */
712 (!strncmp(jDir->name, name, len))) { /* a match */
713 if (jDir->version < version) {
718 if (jDir->version == version && inode != 0) {
719 /* I'm pretty sure this isn't legal */
720 putstr(" ** ERROR ** ");
721 putnstr(jDir->name, jDir->nsize);
722 putLabeledWord(" has dup version =", version);
725 version = jDir->version;
728 putstr("\r\nfind_inode:p&l ->");
729 putnstr(jDir->name, jDir->nsize);
731 putLabeledWord("pino = ", jDir->pino);
732 putLabeledWord("nsize = ", jDir->nsize);
733 putLabeledWord("b = ", (u32) b);
734 putLabeledWord("counter = ", counter);
741 char *mkmodestr(unsigned long mode, char *str)
743 static const char *l = "xwr";
747 switch (mode & S_IFMT) {
748 case S_IFDIR: str[0] = 'd'; break;
749 case S_IFBLK: str[0] = 'b'; break;
750 case S_IFCHR: str[0] = 'c'; break;
751 case S_IFIFO: str[0] = 'f'; break;
752 case S_IFLNK: str[0] = 'l'; break;
753 case S_IFSOCK: str[0] = 's'; break;
754 case S_IFREG: str[0] = '-'; break;
755 default: str[0] = '?';
758 for(i = 0; i < 9; i++) {
760 str[9-i] = (mode & mask)?c:'-';
764 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
765 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
766 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
771 static inline void dump_stat(struct stat *st, const char *name)
776 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
779 ctime_r(&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
781 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
782 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
785 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
786 st->st_size, s, name);
789 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
792 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
797 if(!d || !i) return -1;
799 strncpy(fname, d->name, d->nsize);
800 fname[d->nsize] = '\0';
802 memset(&st,0,sizeof(st));
804 st.st_mtime = i->mtime;
805 st.st_mode = i->mode;
808 /* neither dsize nor isize help us.. do it the long way */
809 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
811 dump_stat(&st, fname);
813 if (d->type == DT_LNK) {
814 unsigned char *src = (unsigned char *) (&i[1]);
816 putnstr(src, (int)i->dsize);
824 /* list inodes with the given pino */
826 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
829 struct jffs2_raw_dirent *jDir;
831 for (b = pL->dir.listHead; b; b = b->next) {
832 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
833 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
835 struct jffs2_raw_inode ojNode;
836 struct jffs2_raw_inode *jNode, *i = NULL;
837 struct b_node *b2 = pL->frag.listHead;
840 jNode = (struct jffs2_raw_inode *)
841 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
842 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
846 if (jDir->type == DT_LNK)
847 i = get_node_mem(b2->offset);
849 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
854 dump_inode(pL, jDir, i);
863 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
867 char working_tmp[256];
870 /* discard any leading slash */
872 while (fname[i] == '/')
874 strcpy(tmp, &fname[i]);
876 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
878 strncpy(working_tmp, tmp, c - tmp);
879 working_tmp[c - tmp] = '\0';
881 putstr("search_inode: tmp = ");
884 putstr("search_inode: wtmp = ");
887 putstr("search_inode: c = ");
891 for (i = 0; i < strlen(c) - 1; i++)
895 putstr("search_inode: post tmp = ");
900 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
901 putstr("find_inode failed for name=");
907 /* this is for the bare filename, directories have already been mapped */
908 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
909 putstr("find_inode failed for name=");
919 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
923 struct jffs2_raw_dirent *jDir;
924 struct jffs2_raw_inode *jNode;
925 u8 jDirFoundType = 0;
926 u32 jDirFoundIno = 0;
927 u32 jDirFoundPino = 0;
933 /* we need to search all and return the inode with the highest version */
934 for(b = pL->dir.listHead; b; b = b->next) {
935 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
936 if (ino == jDir->ino) {
937 if (jDir->version < version) {
942 if (jDir->version == version && jDirFoundType) {
943 /* I'm pretty sure this isn't legal */
944 putstr(" ** ERROR ** ");
945 putnstr(jDir->name, jDir->nsize);
946 putLabeledWord(" has dup version (resolve) = ",
950 jDirFoundType = jDir->type;
951 jDirFoundIno = jDir->ino;
952 jDirFoundPino = jDir->pino;
953 version = jDir->version;
957 /* now we found the right entry again. (shoulda returned inode*) */
958 if (jDirFoundType != DT_LNK)
961 /* it's a soft link so we follow it again. */
962 b2 = pL->frag.listHead;
964 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
965 if (jNode->ino == jDirFoundIno) {
966 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
969 putLabeledWord("\t\t dsize = ", jNode->dsize);
970 putstr("\t\t target = ");
971 putnstr(src, jNode->dsize);
974 strncpy(tmp, src, jNode->dsize);
975 tmp[jNode->dsize] = '\0';
982 /* ok so the name of the new file to find is in tmp */
983 /* if it starts with a slash it is root based else shared dirs */
987 pino = jDirFoundPino;
989 return jffs2_1pass_search_inode(pL, tmp, pino);
993 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
997 char working_tmp[256];
1000 /* discard any leading slash */
1002 while (fname[i] == '/')
1004 strcpy(tmp, &fname[i]);
1005 working_tmp[0] = '\0';
1006 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1008 strncpy(working_tmp, tmp, c - tmp);
1009 working_tmp[c - tmp] = '\0';
1010 for (i = 0; i < strlen(c) - 1; i++)
1013 /* only a failure if we arent looking at top level */
1014 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1016 putstr("find_inode failed for name=");
1017 putstr(working_tmp);
1023 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1024 putstr("find_inode failed for name=");
1029 /* this is for the bare filename, directories have already been mapped */
1030 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1031 putstr("find_inode failed for name=");
1041 jffs2_1pass_rescan_needed(struct part_info *part)
1044 struct jffs2_unknown_node onode;
1045 struct jffs2_unknown_node *node;
1046 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1048 if (part->jffs2_priv == 0){
1049 DEBUGF ("rescan: First time in use\n");
1053 /* if we have no list, we need to rescan */
1054 if (pL->frag.listCount == 0) {
1055 DEBUGF ("rescan: fraglist zero\n");
1059 /* but suppose someone reflashed a partition at the same offset... */
1060 b = pL->dir.listHead;
1062 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1063 sizeof(onode), &onode);
1064 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1065 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1066 (unsigned long) b->offset);
1074 #ifdef DEBUG_FRAGMENTS
1076 dump_fragments(struct b_lists *pL)
1079 struct jffs2_raw_inode ojNode;
1080 struct jffs2_raw_inode *jNode;
1082 putstr("\r\n\r\n******The fragment Entries******\r\n");
1083 b = pL->frag.listHead;
1085 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1086 sizeof(ojNode), &ojNode);
1087 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1088 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1089 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1090 putLabeledWord("\tbuild_list: version = ", jNode->version);
1091 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1092 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1093 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1094 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1095 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1096 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1097 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1098 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1099 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1105 #ifdef DEBUG_DIRENTS
1107 dump_dirents(struct b_lists *pL)
1110 struct jffs2_raw_dirent *jDir;
1112 putstr("\r\n\r\n******The directory Entries******\r\n");
1113 b = pL->dir.listHead;
1115 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
1117 putnstr(jDir->name, jDir->nsize);
1118 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1119 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1120 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1121 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1122 putLabeledWord("\tbuild_list: version = ", jDir->version);
1123 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1124 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1125 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1126 putLabeledWord("\tbuild_list: type = ", jDir->type);
1127 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1128 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1129 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1137 jffs2_1pass_build_lists(struct part_info * part)
1140 struct jffs2_unknown_node *node;
1141 u32 offset, oldoffset = 0;
1142 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1148 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1149 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1150 /* only about 5 %. not enough to inconvenience people for. */
1153 /* if we are building a list we need to refresh the cache. */
1154 jffs_init_1pass_list(part);
1155 pL = (struct b_lists *)part->jffs2_priv;
1157 puts ("Scanning JFFS2 FS: ");
1159 /* start at the beginning of the partition */
1160 while (offset < max) {
1161 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1162 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1166 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1167 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1168 /* if its a fragment add it */
1169 if (node->nodetype == JFFS2_NODETYPE_INODE &&
1170 inode_crc((struct jffs2_raw_inode *) node)) {
1171 if (insert_node(&pL->frag, (u32) part->offset +
1176 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1177 dirent_crc((struct jffs2_raw_dirent *) node) &&
1178 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
1179 if (! (counterN%100))
1181 if (insert_node(&pL->dir, (u32) part->offset +
1187 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1188 if (node->totlen != sizeof(struct jffs2_unknown_node))
1189 printf("OOPS Cleanmarker has bad size "
1190 "%d != %d\n", node->totlen,
1191 sizeof(struct jffs2_unknown_node));
1192 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1193 if (node->totlen < sizeof(struct jffs2_unknown_node))
1194 printf("OOPS Padding has bad size "
1195 "%d < %d\n", node->totlen,
1196 sizeof(struct jffs2_unknown_node));
1198 printf("Unknown node type: %x len %d "
1199 "offset 0x%x\n", node->nodetype,
1200 node->totlen, offset);
1202 offset += ((node->totlen + 3) & ~3);
1204 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1205 node->nodetype == JFFS2_EMPTY_BITMASK) {
1206 offset = jffs2_scan_empty(offset, part);
1207 } else { /* if we know nothing, we just step and look. */
1211 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1215 putstr("\b\b done.\r\n"); /* close off the dots */
1216 /* turn the lcd back on. */
1220 putLabeledWord("dir entries = ", pL->dir.listCount);
1221 putLabeledWord("frag entries = ", pL->frag.listCount);
1222 putLabeledWord("+4 increments = ", counter4);
1223 putLabeledWord("+file_offset increments = ", counterF);
1227 #ifdef DEBUG_DIRENTS
1231 #ifdef DEBUG_FRAGMENTS
1235 /* give visual feedback that we are done scanning the flash */
1236 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1242 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1245 struct jffs2_raw_inode ojNode;
1246 struct jffs2_raw_inode *jNode;
1249 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1250 piL->compr_info[i].num_frags = 0;
1251 piL->compr_info[i].compr_sum = 0;
1252 piL->compr_info[i].decompr_sum = 0;
1255 b = pL->frag.listHead;
1257 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1258 sizeof(ojNode), &ojNode);
1259 if (jNode->compr < JFFS2_NUM_COMPR) {
1260 piL->compr_info[jNode->compr].num_frags++;
1261 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1262 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1270 static struct b_lists *
1271 jffs2_get_list(struct part_info * part, const char *who)
1273 /* copy requested part_info struct pointer to global location */
1274 current_part = part;
1276 if (jffs2_1pass_rescan_needed(part)) {
1277 if (!jffs2_1pass_build_lists(part)) {
1278 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1282 return (struct b_lists *)part->jffs2_priv;
1286 /* Print directory / file contents */
1288 jffs2_1pass_ls(struct part_info * part, const char *fname)
1294 if (! (pl = jffs2_get_list(part, "ls")))
1297 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1298 putstr("ls: Failed to scan jffs2 file structure\r\n");
1304 putLabeledWord("found file at inode = ", inode);
1305 putLabeledWord("read_inode returns = ", ret);
1312 /* Load a file from flash into memory. fname can be a full path */
1314 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1321 if (! (pl = jffs2_get_list(part, "load")))
1324 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1325 putstr("load: Failed to find inode\r\n");
1329 /* Resolve symlinks */
1330 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1331 putstr("load: Failed to resolve inode structure\r\n");
1335 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1336 putstr("load: Failed to read inode\r\n");
1340 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1341 (unsigned long) dest, ret);
1345 /* Return information about the fs on this partition */
1347 jffs2_1pass_info(struct part_info * part)
1349 struct b_jffs2_info info;
1353 if (! (pl = jffs2_get_list(part, "info")))
1356 jffs2_1pass_fill_info(pl, &info);
1357 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1358 printf ("Compression: %s\n"
1359 "\tfrag count: %d\n"
1360 "\tcompressed sum: %d\n"
1361 "\tuncompressed sum: %d\n",
1363 info.compr_info[i].num_frags,
1364 info.compr_info[i].compr_sum,
1365 info.compr_info[i].decompr_sum);
1370 #endif /* CFG_CMD_JFFS2 */