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)
147 #if defined(CFG_NAND_LEGACY)
148 #include <linux/mtd/nand_legacy.h>
153 * Support for jffs2 on top of NAND-flash
155 * NAND memory isn't mapped in processor's address space,
156 * so data should be fetched from flash before
157 * being processed. This is exactly what functions declared
162 #if defined(CFG_NAND_LEGACY)
163 /* this one defined in nand_legacy.c */
164 int read_jffs2_nand(size_t start, size_t len,
165 size_t * retlen, u_char * buf, int nanddev);
167 /* info for NAND chips, defined in drivers/nand/nand.c */
168 extern nand_info_t nand_info[];
171 #define NAND_PAGE_SIZE 512
172 #define NAND_PAGE_SHIFT 9
173 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
175 #ifndef NAND_CACHE_PAGES
176 #define NAND_CACHE_PAGES 16
178 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
180 static u8* nand_cache = NULL;
181 static u32 nand_cache_off = (u32)-1;
183 static int read_nand_cached(u32 off, u32 size, u_char *buf)
185 struct mtdids *id = current_part->dev->id;
187 #if defined(CFG_NAND_LEGACY)
194 while (bytes_read < size) {
195 if ((off + bytes_read < nand_cache_off) ||
196 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
197 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
199 /* This memory never gets freed but 'cause
200 it's a bootloader, nobody cares */
201 nand_cache = malloc(NAND_CACHE_SIZE);
203 printf("read_nand_cached: can't alloc cache size %d bytes\n",
209 #if defined(CFG_NAND_LEGACY)
210 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
211 &retlen, nand_cache, id->num) < 0 ||
212 retlen != NAND_CACHE_SIZE) {
213 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
214 nand_cache_off, NAND_CACHE_SIZE);
218 retlen = NAND_CACHE_SIZE;
219 if (nand_read(&nand_info[id->num], nand_cache_off,
220 &retlen, nand_cache) != 0 ||
221 retlen != NAND_CACHE_SIZE) {
222 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
223 nand_cache_off, NAND_CACHE_SIZE);
228 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
229 if (cpy_bytes > size - bytes_read)
230 cpy_bytes = size - bytes_read;
231 memcpy(buf + bytes_read,
232 nand_cache + off + bytes_read - nand_cache_off,
234 bytes_read += cpy_bytes;
239 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
241 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
244 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
247 if (read_nand_cached(off, size, buf) < 0) {
256 static void *get_node_mem_nand(u32 off)
258 struct jffs2_unknown_node node;
261 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
264 if (!(ret = get_fl_mem_nand(off, node.magic ==
265 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
267 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
268 off, node.magic, node.nodetype, node.totlen);
273 static void put_fl_mem_nand(void *buf)
277 #endif /* #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND) */
280 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
282 * Support for jffs2 on top of NOR-flash
284 * NOR flash memory is mapped in processor's address space,
285 * just return address.
287 static inline void *get_fl_mem_nor(u32 off)
290 struct mtdids *id = current_part->dev->id;
292 extern flash_info_t flash_info[];
293 flash_info_t *flash = &flash_info[id->num];
295 addr += flash->start[0];
299 static inline void *get_node_mem_nor(u32 off)
301 return (void*)get_fl_mem_nor(off);
303 #endif /* #if (CONFIG_COMMANDS & CFG_CMD_FLASH) */
307 * Generic jffs2 raw memory and node read routines.
310 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
312 struct mtdids *id = current_part->dev->id;
314 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
315 if (id->type == MTD_DEV_TYPE_NOR)
316 return get_fl_mem_nor(off);
319 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
320 if (id->type == MTD_DEV_TYPE_NAND)
321 return get_fl_mem_nand(off, size, ext_buf);
324 printf("get_fl_mem: unknown device type, using raw offset!\n");
328 static inline void *get_node_mem(u32 off)
330 struct mtdids *id = current_part->dev->id;
332 #if (CONFIG_COMMANDS & CFG_CMD_FLASH)
333 if (id->type == MTD_DEV_TYPE_NOR)
334 return get_node_mem_nor(off);
337 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
338 if (id->type == MTD_DEV_TYPE_NAND)
339 return get_node_mem_nand(off);
342 printf("get_node_mem: unknown device type, using raw offset!\n");
346 static inline void put_fl_mem(void *buf)
348 #if defined(CONFIG_JFFS2_NAND) && (CONFIG_COMMANDS & CFG_CMD_NAND)
349 struct mtdids *id = current_part->dev->id;
351 if (id->type == MTD_DEV_TYPE_NAND)
352 return put_fl_mem_nand(buf);
356 /* Compression names */
357 static char *compr_names[] = {
365 #if defined(CONFIG_JFFS2_LZO_LZARI)
372 static char spinner[] = { '|', '/', '-', '\\' };
374 /* Memory management */
377 struct mem_block *next;
378 struct b_node nodes[NODE_CHUNK];
383 free_nodes(struct b_list *list)
385 while (list->listMemBase != NULL) {
386 struct mem_block *next = list->listMemBase->next;
387 free( list->listMemBase );
388 list->listMemBase = next;
392 static struct b_node *
393 add_node(struct b_list *list)
396 struct mem_block *memBase;
399 memBase = list->listMemBase;
401 index = memBase->index;
403 putLabeledWord("add_node: index = ", index);
404 putLabeledWord("add_node: memBase = ", list->listMemBase);
407 if (memBase == NULL || index >= NODE_CHUNK) {
408 /* we need more space before we continue */
409 memBase = mmalloc(sizeof(struct mem_block));
410 if (memBase == NULL) {
411 putstr("add_node: malloc failed\n");
414 memBase->next = list->listMemBase;
417 putLabeledWord("add_node: alloced a new membase at ", *memBase);
421 /* now we have room to add it. */
422 b = &memBase->nodes[index];
425 memBase->index = index;
426 list->listMemBase = memBase;
431 static struct b_node *
432 insert_node(struct b_list *list, u32 offset)
435 #ifdef CFG_JFFS2_SORT_FRAGMENTS
436 struct b_node *b, *prev;
439 if (!(new = add_node(list))) {
440 putstr("add_node failed!\r\n");
443 new->offset = offset;
445 #ifdef CFG_JFFS2_SORT_FRAGMENTS
446 if (list->listTail != NULL && list->listCompare(new, list->listTail))
447 prev = list->listTail;
448 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
449 prev = list->listLast;
453 for (b = (prev ? prev->next : list->listHead);
454 b != NULL && list->listCompare(new, b);
455 prev = b, b = b->next) {
459 list->listLast = prev;
466 list->listHead = new;
470 new->next = (struct b_node *) NULL;
471 if (list->listTail != NULL) {
472 list->listTail->next = new;
473 list->listTail = new;
475 list->listTail = list->listHead = new;
482 #ifdef CFG_JFFS2_SORT_FRAGMENTS
483 /* Sort data entries with the latest version last, so that if there
484 * is overlapping data the latest version will be used.
486 static int compare_inodes(struct b_node *new, struct b_node *old)
488 struct jffs2_raw_inode ojNew;
489 struct jffs2_raw_inode ojOld;
490 struct jffs2_raw_inode *jNew =
491 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
492 struct jffs2_raw_inode *jOld =
493 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
495 return jNew->version > jOld->version;
498 /* Sort directory entries so all entries in the same directory
499 * with the same name are grouped together, with the latest version
500 * last. This makes it easy to eliminate all but the latest version
501 * by marking the previous version dead by setting the inode to 0.
503 static int compare_dirents(struct b_node *new, struct b_node *old)
505 struct jffs2_raw_dirent ojNew;
506 struct jffs2_raw_dirent ojOld;
507 struct jffs2_raw_dirent *jNew =
508 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
509 struct jffs2_raw_dirent *jOld =
510 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
513 /* ascending sort by pino */
514 if (jNew->pino != jOld->pino)
515 return jNew->pino > jOld->pino;
517 /* pino is the same, so use ascending sort by nsize, so
518 * we don't do strncmp unless we really must.
520 if (jNew->nsize != jOld->nsize)
521 return jNew->nsize > jOld->nsize;
523 /* length is also the same, so use ascending sort by name
525 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
529 /* we have duplicate names in this directory, so use ascending
532 if (jNew->version > jOld->version) {
533 /* since jNew is newer, we know jOld is not valid, so
534 * mark it with inode 0 and it will not be used
545 jffs2_scan_empty(u32 start_offset, struct part_info *part)
547 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode));
548 char *offset = (char *)(part->offset + start_offset);
551 while (offset < max &&
552 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
553 offset += sizeof(u32);
554 /* return if spinning is due */
555 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
558 return (u32)offset - part->offset;
562 jffs2_free_cache(struct part_info *part)
566 if (part->jffs2_priv != NULL) {
567 pL = (struct b_lists *)part->jffs2_priv;
568 free_nodes(&pL->frag);
569 free_nodes(&pL->dir);
575 jffs_init_1pass_list(struct part_info *part)
579 jffs2_free_cache(part);
581 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
582 pL = (struct b_lists *)part->jffs2_priv;
584 memset(pL, 0, sizeof(*pL));
585 #ifdef CFG_JFFS2_SORT_FRAGMENTS
586 pL->dir.listCompare = compare_dirents;
587 pL->frag.listCompare = compare_inodes;
593 /* find the inode from the slashless name given a parent */
595 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
598 struct jffs2_raw_inode *jNode;
600 u32 latestVersion = 0;
606 #ifdef CFG_JFFS2_SORT_FRAGMENTS
607 /* Find file size before loading any data, so fragments that
608 * start past the end of file can be ignored. A fragment
609 * that is partially in the file is loaded, so extra data may
610 * be loaded up to the next 4K boundary above the file size.
611 * This shouldn't cause trouble when loading kernel images, so
612 * we will live with it.
614 for (b = pL->frag.listHead; b != NULL; b = b->next) {
615 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
616 sizeof(struct jffs2_raw_inode), NULL);
617 if ((inode == jNode->ino)) {
618 /* get actual file length from the newest node */
619 if (jNode->version >= latestVersion) {
620 totalSize = jNode->isize;
621 latestVersion = jNode->version;
628 for (b = pL->frag.listHead; b != NULL; b = b->next) {
629 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
630 if ((inode == jNode->ino)) {
632 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
633 putLabeledWord("read_inode: inode = ", jNode->ino);
634 putLabeledWord("read_inode: version = ", jNode->version);
635 putLabeledWord("read_inode: isize = ", jNode->isize);
636 putLabeledWord("read_inode: offset = ", jNode->offset);
637 putLabeledWord("read_inode: csize = ", jNode->csize);
638 putLabeledWord("read_inode: dsize = ", jNode->dsize);
639 putLabeledWord("read_inode: compr = ", jNode->compr);
640 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
641 putLabeledWord("read_inode: flags = ", jNode->flags);
644 #ifndef CFG_JFFS2_SORT_FRAGMENTS
645 /* get actual file length from the newest node */
646 if (jNode->version >= latestVersion) {
647 totalSize = jNode->isize;
648 latestVersion = jNode->version;
653 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
654 /* ignore data behind latest known EOF */
655 if (jNode->offset > totalSize) {
660 lDest = (uchar *) (dest + jNode->offset);
662 putLabeledWord("read_inode: src = ", src);
663 putLabeledWord("read_inode: dest = ", lDest);
665 switch (jNode->compr) {
666 case JFFS2_COMPR_NONE:
667 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
669 case JFFS2_COMPR_ZERO:
671 for (i = 0; i < jNode->dsize; i++)
674 case JFFS2_COMPR_RTIME:
676 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
678 case JFFS2_COMPR_DYNRUBIN:
679 /* this is slow but it works */
681 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
683 case JFFS2_COMPR_ZLIB:
684 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
686 #if defined(CONFIG_JFFS2_LZO_LZARI)
687 case JFFS2_COMPR_LZO:
688 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
690 case JFFS2_COMPR_LZARI:
691 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
696 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
704 putLabeledWord("read_inode: totalSize = ", totalSize);
705 putLabeledWord("read_inode: compr ret = ", ret);
713 putLabeledWord("read_inode: returning = ", totalSize);
718 /* find the inode from the slashless name given a parent */
720 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
723 struct jffs2_raw_dirent *jDir;
729 /* name is assumed slash free */
733 /* we need to search all and return the inode with the highest version */
734 for(b = pL->dir.listHead; b; b = b->next, counter++) {
735 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
736 if ((pino == jDir->pino) && (len == jDir->nsize) &&
737 (jDir->ino) && /* 0 for unlink */
738 (!strncmp((char *)jDir->name, name, len))) { /* a match */
739 if (jDir->version < version) {
744 if (jDir->version == version && inode != 0) {
745 /* I'm pretty sure this isn't legal */
746 putstr(" ** ERROR ** ");
747 putnstr(jDir->name, jDir->nsize);
748 putLabeledWord(" has dup version =", version);
751 version = jDir->version;
754 putstr("\r\nfind_inode:p&l ->");
755 putnstr(jDir->name, jDir->nsize);
757 putLabeledWord("pino = ", jDir->pino);
758 putLabeledWord("nsize = ", jDir->nsize);
759 putLabeledWord("b = ", (u32) b);
760 putLabeledWord("counter = ", counter);
767 char *mkmodestr(unsigned long mode, char *str)
769 static const char *l = "xwr";
773 switch (mode & S_IFMT) {
774 case S_IFDIR: str[0] = 'd'; break;
775 case S_IFBLK: str[0] = 'b'; break;
776 case S_IFCHR: str[0] = 'c'; break;
777 case S_IFIFO: str[0] = 'f'; break;
778 case S_IFLNK: str[0] = 'l'; break;
779 case S_IFSOCK: str[0] = 's'; break;
780 case S_IFREG: str[0] = '-'; break;
781 default: str[0] = '?';
784 for(i = 0; i < 9; i++) {
786 str[9-i] = (mode & mask)?c:'-';
790 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
791 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
792 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
797 static inline void dump_stat(struct stat *st, const char *name)
802 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
805 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
807 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
808 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
811 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
812 st->st_size, s, name);
815 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
818 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
823 if(!d || !i) return -1;
825 strncpy(fname, (char *)d->name, d->nsize);
826 fname[d->nsize] = '\0';
828 memset(&st,0,sizeof(st));
830 st.st_mtime = i->mtime;
831 st.st_mode = i->mode;
834 /* neither dsize nor isize help us.. do it the long way */
835 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
837 dump_stat(&st, fname);
839 if (d->type == DT_LNK) {
840 unsigned char *src = (unsigned char *) (&i[1]);
842 putnstr(src, (int)i->dsize);
850 /* list inodes with the given pino */
852 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
855 struct jffs2_raw_dirent *jDir;
857 for (b = pL->dir.listHead; b; b = b->next) {
858 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
859 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
861 struct jffs2_raw_inode ojNode;
862 struct jffs2_raw_inode *jNode, *i = NULL;
863 struct b_node *b2 = pL->frag.listHead;
866 jNode = (struct jffs2_raw_inode *)
867 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
868 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
872 if (jDir->type == DT_LNK)
873 i = get_node_mem(b2->offset);
875 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
880 dump_inode(pL, jDir, i);
889 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
893 char working_tmp[256];
896 /* discard any leading slash */
898 while (fname[i] == '/')
900 strcpy(tmp, &fname[i]);
902 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
904 strncpy(working_tmp, tmp, c - tmp);
905 working_tmp[c - tmp] = '\0';
907 putstr("search_inode: tmp = ");
910 putstr("search_inode: wtmp = ");
913 putstr("search_inode: c = ");
917 for (i = 0; i < strlen(c) - 1; i++)
921 putstr("search_inode: post tmp = ");
926 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
927 putstr("find_inode failed for name=");
933 /* this is for the bare filename, directories have already been mapped */
934 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
935 putstr("find_inode failed for name=");
945 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
949 struct jffs2_raw_dirent *jDir;
950 struct jffs2_raw_inode *jNode;
951 u8 jDirFoundType = 0;
952 u32 jDirFoundIno = 0;
953 u32 jDirFoundPino = 0;
959 /* we need to search all and return the inode with the highest version */
960 for(b = pL->dir.listHead; b; b = b->next) {
961 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
962 if (ino == jDir->ino) {
963 if (jDir->version < version) {
968 if (jDir->version == version && jDirFoundType) {
969 /* I'm pretty sure this isn't legal */
970 putstr(" ** ERROR ** ");
971 putnstr(jDir->name, jDir->nsize);
972 putLabeledWord(" has dup version (resolve) = ",
976 jDirFoundType = jDir->type;
977 jDirFoundIno = jDir->ino;
978 jDirFoundPino = jDir->pino;
979 version = jDir->version;
983 /* now we found the right entry again. (shoulda returned inode*) */
984 if (jDirFoundType != DT_LNK)
987 /* it's a soft link so we follow it again. */
988 b2 = pL->frag.listHead;
990 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
991 if (jNode->ino == jDirFoundIno) {
992 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
995 putLabeledWord("\t\t dsize = ", jNode->dsize);
996 putstr("\t\t target = ");
997 putnstr(src, jNode->dsize);
1000 strncpy(tmp, (char *)src, jNode->dsize);
1001 tmp[jNode->dsize] = '\0';
1008 /* ok so the name of the new file to find is in tmp */
1009 /* if it starts with a slash it is root based else shared dirs */
1013 pino = jDirFoundPino;
1015 return jffs2_1pass_search_inode(pL, tmp, pino);
1019 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1023 char working_tmp[256];
1026 /* discard any leading slash */
1028 while (fname[i] == '/')
1030 strcpy(tmp, &fname[i]);
1031 working_tmp[0] = '\0';
1032 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1034 strncpy(working_tmp, tmp, c - tmp);
1035 working_tmp[c - tmp] = '\0';
1036 for (i = 0; i < strlen(c) - 1; i++)
1039 /* only a failure if we arent looking at top level */
1040 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1042 putstr("find_inode failed for name=");
1043 putstr(working_tmp);
1049 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1050 putstr("find_inode failed for name=");
1055 /* this is for the bare filename, directories have already been mapped */
1056 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1057 putstr("find_inode failed for name=");
1067 jffs2_1pass_rescan_needed(struct part_info *part)
1070 struct jffs2_unknown_node onode;
1071 struct jffs2_unknown_node *node;
1072 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1074 if (part->jffs2_priv == 0){
1075 DEBUGF ("rescan: First time in use\n");
1079 /* if we have no list, we need to rescan */
1080 if (pL->frag.listCount == 0) {
1081 DEBUGF ("rescan: fraglist zero\n");
1085 /* but suppose someone reflashed a partition at the same offset... */
1086 b = pL->dir.listHead;
1088 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1089 sizeof(onode), &onode);
1090 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1091 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1092 (unsigned long) b->offset);
1100 #ifdef DEBUG_FRAGMENTS
1102 dump_fragments(struct b_lists *pL)
1105 struct jffs2_raw_inode ojNode;
1106 struct jffs2_raw_inode *jNode;
1108 putstr("\r\n\r\n******The fragment Entries******\r\n");
1109 b = pL->frag.listHead;
1111 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1112 sizeof(ojNode), &ojNode);
1113 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1114 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1115 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1116 putLabeledWord("\tbuild_list: version = ", jNode->version);
1117 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1118 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1119 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1120 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1121 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1122 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1123 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1124 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1125 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1131 #ifdef DEBUG_DIRENTS
1133 dump_dirents(struct b_lists *pL)
1136 struct jffs2_raw_dirent *jDir;
1138 putstr("\r\n\r\n******The directory Entries******\r\n");
1139 b = pL->dir.listHead;
1141 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
1143 putnstr(jDir->name, jDir->nsize);
1144 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1145 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1146 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1147 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1148 putLabeledWord("\tbuild_list: version = ", jDir->version);
1149 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1150 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1151 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1152 putLabeledWord("\tbuild_list: type = ", jDir->type);
1153 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1154 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1155 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1163 jffs2_1pass_build_lists(struct part_info * part)
1166 struct jffs2_unknown_node *node;
1167 u32 offset, oldoffset = 0;
1168 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1174 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1175 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1176 /* only about 5 %. not enough to inconvenience people for. */
1179 /* if we are building a list we need to refresh the cache. */
1180 jffs_init_1pass_list(part);
1181 pL = (struct b_lists *)part->jffs2_priv;
1183 puts ("Scanning JFFS2 FS: ");
1185 /* start at the beginning of the partition */
1186 while (offset < max) {
1187 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1188 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1192 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1193 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1194 /* if its a fragment add it */
1195 if (node->nodetype == JFFS2_NODETYPE_INODE &&
1196 inode_crc((struct jffs2_raw_inode *) node) &&
1197 data_crc((struct jffs2_raw_inode *) node)) {
1198 if (insert_node(&pL->frag, (u32) part->offset +
1203 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1204 dirent_crc((struct jffs2_raw_dirent *) node) &&
1205 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
1206 if (! (counterN%100))
1208 if (insert_node(&pL->dir, (u32) part->offset +
1214 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1215 if (node->totlen != sizeof(struct jffs2_unknown_node))
1216 printf("OOPS Cleanmarker has bad size "
1217 "%d != %d\n", node->totlen,
1218 sizeof(struct jffs2_unknown_node));
1219 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1220 if (node->totlen < sizeof(struct jffs2_unknown_node))
1221 printf("OOPS Padding has bad size "
1222 "%d < %d\n", node->totlen,
1223 sizeof(struct jffs2_unknown_node));
1225 printf("Unknown node type: %x len %d "
1226 "offset 0x%x\n", node->nodetype,
1227 node->totlen, offset);
1229 offset += ((node->totlen + 3) & ~3);
1231 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1232 node->nodetype == JFFS2_EMPTY_BITMASK) {
1233 offset = jffs2_scan_empty(offset, part);
1234 } else { /* if we know nothing, we just step and look. */
1238 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1242 putstr("\b\b done.\r\n"); /* close off the dots */
1243 /* turn the lcd back on. */
1247 putLabeledWord("dir entries = ", pL->dir.listCount);
1248 putLabeledWord("frag entries = ", pL->frag.listCount);
1249 putLabeledWord("+4 increments = ", counter4);
1250 putLabeledWord("+file_offset increments = ", counterF);
1254 #ifdef DEBUG_DIRENTS
1258 #ifdef DEBUG_FRAGMENTS
1262 /* give visual feedback that we are done scanning the flash */
1263 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1269 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1272 struct jffs2_raw_inode ojNode;
1273 struct jffs2_raw_inode *jNode;
1276 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1277 piL->compr_info[i].num_frags = 0;
1278 piL->compr_info[i].compr_sum = 0;
1279 piL->compr_info[i].decompr_sum = 0;
1282 b = pL->frag.listHead;
1284 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1285 sizeof(ojNode), &ojNode);
1286 if (jNode->compr < JFFS2_NUM_COMPR) {
1287 piL->compr_info[jNode->compr].num_frags++;
1288 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1289 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1297 static struct b_lists *
1298 jffs2_get_list(struct part_info * part, const char *who)
1300 /* copy requested part_info struct pointer to global location */
1301 current_part = part;
1303 if (jffs2_1pass_rescan_needed(part)) {
1304 if (!jffs2_1pass_build_lists(part)) {
1305 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1309 return (struct b_lists *)part->jffs2_priv;
1313 /* Print directory / file contents */
1315 jffs2_1pass_ls(struct part_info * part, const char *fname)
1321 if (! (pl = jffs2_get_list(part, "ls")))
1324 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1325 putstr("ls: Failed to scan jffs2 file structure\r\n");
1331 putLabeledWord("found file at inode = ", inode);
1332 putLabeledWord("read_inode returns = ", ret);
1339 /* Load a file from flash into memory. fname can be a full path */
1341 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1348 if (! (pl = jffs2_get_list(part, "load")))
1351 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1352 putstr("load: Failed to find inode\r\n");
1356 /* Resolve symlinks */
1357 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1358 putstr("load: Failed to resolve inode structure\r\n");
1362 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1363 putstr("load: Failed to read inode\r\n");
1367 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1368 (unsigned long) dest, ret);
1372 /* Return information about the fs on this partition */
1374 jffs2_1pass_info(struct part_info * part)
1376 struct b_jffs2_info info;
1380 if (! (pl = jffs2_get_list(part, "info")))
1383 jffs2_1pass_fill_info(pl, &info);
1384 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1385 printf ("Compression: %s\n"
1386 "\tfrag count: %d\n"
1387 "\tcompressed sum: %d\n"
1388 "\tuncompressed sum: %d\n",
1390 info.compr_info[i].num_frags,
1391 info.compr_info[i].compr_sum,
1392 info.compr_info[i].decompr_sum);
1397 #endif /* CFG_CMD_JFFS2 */