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>
119 #include <watchdog.h>
120 #include <jffs2/jffs2.h>
121 #include <jffs2/jffs2_1pass.h>
123 #include "jffs2_private.h"
126 #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
127 #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
129 /* Debugging switches */
130 #undef DEBUG_DIRENTS /* print directory entry list after scan */
131 #undef DEBUG_FRAGMENTS /* print fragment list after scan */
132 #undef DEBUG /* enable debugging messages */
136 # define DEBUGF(fmt,args...) printf(fmt ,##args)
138 # define DEBUGF(fmt,args...)
141 /* keeps pointer to currentlu processed partition */
142 static struct part_info *current_part;
144 #if (defined(CONFIG_JFFS2_NAND) && \
145 defined(CONFIG_CMD_NAND) )
146 #if defined(CONFIG_NAND_LEGACY)
147 #include <linux/mtd/nand_legacy.h>
152 * Support for jffs2 on top of NAND-flash
154 * NAND memory isn't mapped in processor's address space,
155 * so data should be fetched from flash before
156 * being processed. This is exactly what functions declared
161 #if defined(CONFIG_NAND_LEGACY)
162 /* this one defined in nand_legacy.c */
163 int read_jffs2_nand(size_t start, size_t len,
164 size_t * retlen, u_char * buf, int nanddev);
167 #define NAND_PAGE_SIZE 512
168 #define NAND_PAGE_SHIFT 9
169 #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
171 #ifndef NAND_CACHE_PAGES
172 #define NAND_CACHE_PAGES 16
174 #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
176 static u8* nand_cache = NULL;
177 static u32 nand_cache_off = (u32)-1;
179 static int read_nand_cached(u32 off, u32 size, u_char *buf)
181 struct mtdids *id = current_part->dev->id;
186 while (bytes_read < size) {
187 if ((off + bytes_read < nand_cache_off) ||
188 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
189 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
191 /* This memory never gets freed but 'cause
192 it's a bootloader, nobody cares */
193 nand_cache = malloc(NAND_CACHE_SIZE);
195 printf("read_nand_cached: can't alloc cache size %d bytes\n",
201 #if defined(CONFIG_NAND_LEGACY)
202 if (read_jffs2_nand(nand_cache_off, NAND_CACHE_SIZE,
203 &retlen, nand_cache, id->num) < 0 ||
204 retlen != NAND_CACHE_SIZE) {
205 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
206 nand_cache_off, NAND_CACHE_SIZE);
210 retlen = NAND_CACHE_SIZE;
211 if (nand_read(&nand_info[id->num], nand_cache_off,
212 &retlen, nand_cache) != 0 ||
213 retlen != NAND_CACHE_SIZE) {
214 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
215 nand_cache_off, NAND_CACHE_SIZE);
220 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
221 if (cpy_bytes > size - bytes_read)
222 cpy_bytes = size - bytes_read;
223 memcpy(buf + bytes_read,
224 nand_cache + off + bytes_read - nand_cache_off,
226 bytes_read += cpy_bytes;
231 static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
233 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
236 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
239 if (read_nand_cached(off, size, buf) < 0) {
248 static void *get_node_mem_nand(u32 off)
250 struct jffs2_unknown_node node;
253 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
256 if (!(ret = get_fl_mem_nand(off, node.magic ==
257 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
259 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
260 off, node.magic, node.nodetype, node.totlen);
265 static void put_fl_mem_nand(void *buf)
272 #if defined(CONFIG_CMD_FLASH)
274 * Support for jffs2 on top of NOR-flash
276 * NOR flash memory is mapped in processor's address space,
277 * just return address.
279 static inline void *get_fl_mem_nor(u32 off)
282 struct mtdids *id = current_part->dev->id;
284 extern flash_info_t flash_info[];
285 flash_info_t *flash = &flash_info[id->num];
287 addr += flash->start[0];
291 static inline void *get_node_mem_nor(u32 off)
293 return (void*)get_fl_mem_nor(off);
299 * Generic jffs2 raw memory and node read routines.
302 static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
304 struct mtdids *id = current_part->dev->id;
306 #if defined(CONFIG_CMD_FLASH)
307 if (id->type == MTD_DEV_TYPE_NOR)
308 return get_fl_mem_nor(off);
311 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
312 if (id->type == MTD_DEV_TYPE_NAND)
313 return get_fl_mem_nand(off, size, ext_buf);
316 printf("get_fl_mem: unknown device type, using raw offset!\n");
320 static inline void *get_node_mem(u32 off)
322 struct mtdids *id = current_part->dev->id;
324 #if defined(CONFIG_CMD_FLASH)
325 if (id->type == MTD_DEV_TYPE_NOR)
326 return get_node_mem_nor(off);
329 #if defined(CONFIG_JFFS2_NAND) && \
330 defined(CONFIG_CMD_NAND)
331 if (id->type == MTD_DEV_TYPE_NAND)
332 return get_node_mem_nand(off);
335 printf("get_node_mem: unknown device type, using raw offset!\n");
339 static inline void put_fl_mem(void *buf)
341 #if defined(CONFIG_JFFS2_NAND) && \
342 defined(CONFIG_CMD_NAND)
343 struct mtdids *id = current_part->dev->id;
345 if (id->type == MTD_DEV_TYPE_NAND)
346 return put_fl_mem_nand(buf);
350 /* Compression names */
351 static char *compr_names[] = {
359 #if defined(CONFIG_JFFS2_LZO_LZARI)
366 static char spinner[] = { '|', '/', '-', '\\' };
368 /* Memory management */
371 struct mem_block *next;
372 struct b_node nodes[NODE_CHUNK];
377 free_nodes(struct b_list *list)
379 while (list->listMemBase != NULL) {
380 struct mem_block *next = list->listMemBase->next;
381 free( list->listMemBase );
382 list->listMemBase = next;
386 static struct b_node *
387 add_node(struct b_list *list)
390 struct mem_block *memBase;
393 memBase = list->listMemBase;
395 index = memBase->index;
397 putLabeledWord("add_node: index = ", index);
398 putLabeledWord("add_node: memBase = ", list->listMemBase);
401 if (memBase == NULL || index >= NODE_CHUNK) {
402 /* we need more space before we continue */
403 memBase = mmalloc(sizeof(struct mem_block));
404 if (memBase == NULL) {
405 putstr("add_node: malloc failed\n");
408 memBase->next = list->listMemBase;
411 putLabeledWord("add_node: alloced a new membase at ", *memBase);
415 /* now we have room to add it. */
416 b = &memBase->nodes[index];
419 memBase->index = index;
420 list->listMemBase = memBase;
425 static struct b_node *
426 insert_node(struct b_list *list, u32 offset)
429 #ifdef CFG_JFFS2_SORT_FRAGMENTS
430 struct b_node *b, *prev;
433 if (!(new = add_node(list))) {
434 putstr("add_node failed!\r\n");
437 new->offset = offset;
439 #ifdef CFG_JFFS2_SORT_FRAGMENTS
440 if (list->listTail != NULL && list->listCompare(new, list->listTail))
441 prev = list->listTail;
442 else if (list->listLast != NULL && list->listCompare(new, list->listLast))
443 prev = list->listLast;
447 for (b = (prev ? prev->next : list->listHead);
448 b != NULL && list->listCompare(new, b);
449 prev = b, b = b->next) {
453 list->listLast = prev;
460 list->listHead = new;
464 new->next = (struct b_node *) NULL;
465 if (list->listTail != NULL) {
466 list->listTail->next = new;
467 list->listTail = new;
469 list->listTail = list->listHead = new;
476 #ifdef CFG_JFFS2_SORT_FRAGMENTS
477 /* Sort data entries with the latest version last, so that if there
478 * is overlapping data the latest version will be used.
480 static int compare_inodes(struct b_node *new, struct b_node *old)
482 struct jffs2_raw_inode ojNew;
483 struct jffs2_raw_inode ojOld;
484 struct jffs2_raw_inode *jNew =
485 (struct jffs2_raw_inode *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
486 struct jffs2_raw_inode *jOld =
487 (struct jffs2_raw_inode *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
489 return jNew->version > jOld->version;
492 /* Sort directory entries so all entries in the same directory
493 * with the same name are grouped together, with the latest version
494 * last. This makes it easy to eliminate all but the latest version
495 * by marking the previous version dead by setting the inode to 0.
497 static int compare_dirents(struct b_node *new, struct b_node *old)
499 struct jffs2_raw_dirent ojNew;
500 struct jffs2_raw_dirent ojOld;
501 struct jffs2_raw_dirent *jNew =
502 (struct jffs2_raw_dirent *)get_fl_mem(new->offset, sizeof(ojNew), &ojNew);
503 struct jffs2_raw_dirent *jOld =
504 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
507 /* ascending sort by pino */
508 if (jNew->pino != jOld->pino)
509 return jNew->pino > jOld->pino;
511 /* pino is the same, so use ascending sort by nsize, so
512 * we don't do strncmp unless we really must.
514 if (jNew->nsize != jOld->nsize)
515 return jNew->nsize > jOld->nsize;
517 /* length is also the same, so use ascending sort by name
519 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
523 /* we have duplicate names in this directory, so use ascending
526 if (jNew->version > jOld->version) {
527 /* since jNew is newer, we know jOld is not valid, so
528 * mark it with inode 0 and it will not be used
539 jffs2_scan_empty(u32 start_offset, struct part_info *part)
541 char *max = (char *)(part->offset + part->size - sizeof(struct jffs2_raw_inode));
542 char *offset = (char *)(part->offset + start_offset);
545 while (offset < max &&
546 *(u32*)get_fl_mem((u32)offset, sizeof(u32), &off) == 0xFFFFFFFF) {
547 offset += sizeof(u32);
548 /* return if spinning is due */
549 if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break;
552 return (u32)offset - part->offset;
556 jffs2_free_cache(struct part_info *part)
560 if (part->jffs2_priv != NULL) {
561 pL = (struct b_lists *)part->jffs2_priv;
562 free_nodes(&pL->frag);
563 free_nodes(&pL->dir);
569 jffs_init_1pass_list(struct part_info *part)
573 jffs2_free_cache(part);
575 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
576 pL = (struct b_lists *)part->jffs2_priv;
578 memset(pL, 0, sizeof(*pL));
579 #ifdef CFG_JFFS2_SORT_FRAGMENTS
580 pL->dir.listCompare = compare_dirents;
581 pL->frag.listCompare = compare_inodes;
587 /* find the inode from the slashless name given a parent */
589 jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
592 struct jffs2_raw_inode *jNode;
594 u32 latestVersion = 0;
600 #ifdef CFG_JFFS2_SORT_FRAGMENTS
601 /* Find file size before loading any data, so fragments that
602 * start past the end of file can be ignored. A fragment
603 * that is partially in the file is loaded, so extra data may
604 * be loaded up to the next 4K boundary above the file size.
605 * This shouldn't cause trouble when loading kernel images, so
606 * we will live with it.
608 for (b = pL->frag.listHead; b != NULL; b = b->next) {
609 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
610 sizeof(struct jffs2_raw_inode), NULL);
611 if ((inode == jNode->ino)) {
612 /* get actual file length from the newest node */
613 if (jNode->version >= latestVersion) {
614 totalSize = jNode->isize;
615 latestVersion = jNode->version;
622 for (b = pL->frag.listHead; b != NULL; b = b->next) {
623 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset);
624 if ((inode == jNode->ino)) {
626 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
627 putLabeledWord("read_inode: inode = ", jNode->ino);
628 putLabeledWord("read_inode: version = ", jNode->version);
629 putLabeledWord("read_inode: isize = ", jNode->isize);
630 putLabeledWord("read_inode: offset = ", jNode->offset);
631 putLabeledWord("read_inode: csize = ", jNode->csize);
632 putLabeledWord("read_inode: dsize = ", jNode->dsize);
633 putLabeledWord("read_inode: compr = ", jNode->compr);
634 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
635 putLabeledWord("read_inode: flags = ", jNode->flags);
638 #ifndef CFG_JFFS2_SORT_FRAGMENTS
639 /* get actual file length from the newest node */
640 if (jNode->version >= latestVersion) {
641 totalSize = jNode->isize;
642 latestVersion = jNode->version;
647 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
648 /* ignore data behind latest known EOF */
649 if (jNode->offset > totalSize) {
654 lDest = (uchar *) (dest + jNode->offset);
656 putLabeledWord("read_inode: src = ", src);
657 putLabeledWord("read_inode: dest = ", lDest);
659 switch (jNode->compr) {
660 case JFFS2_COMPR_NONE:
661 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
663 case JFFS2_COMPR_ZERO:
665 for (i = 0; i < jNode->dsize; i++)
668 case JFFS2_COMPR_RTIME:
670 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
672 case JFFS2_COMPR_DYNRUBIN:
673 /* this is slow but it works */
675 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
677 case JFFS2_COMPR_ZLIB:
678 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
680 #if defined(CONFIG_JFFS2_LZO_LZARI)
681 case JFFS2_COMPR_LZO:
682 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
684 case JFFS2_COMPR_LZARI:
685 ret = lzari_decompress(src, lDest, jNode->csize, jNode->dsize);
690 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
698 putLabeledWord("read_inode: totalSize = ", totalSize);
699 putLabeledWord("read_inode: compr ret = ", ret);
707 putLabeledWord("read_inode: returning = ", totalSize);
712 /* find the inode from the slashless name given a parent */
714 jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
717 struct jffs2_raw_dirent *jDir;
723 /* name is assumed slash free */
727 /* we need to search all and return the inode with the highest version */
728 for(b = pL->dir.listHead; b; b = b->next, counter++) {
729 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
730 if ((pino == jDir->pino) && (len == jDir->nsize) &&
731 (jDir->ino) && /* 0 for unlink */
732 (!strncmp((char *)jDir->name, name, len))) { /* a match */
733 if (jDir->version < version) {
738 if (jDir->version == version && inode != 0) {
739 /* I'm pretty sure this isn't legal */
740 putstr(" ** ERROR ** ");
741 putnstr(jDir->name, jDir->nsize);
742 putLabeledWord(" has dup version =", version);
745 version = jDir->version;
748 putstr("\r\nfind_inode:p&l ->");
749 putnstr(jDir->name, jDir->nsize);
751 putLabeledWord("pino = ", jDir->pino);
752 putLabeledWord("nsize = ", jDir->nsize);
753 putLabeledWord("b = ", (u32) b);
754 putLabeledWord("counter = ", counter);
761 char *mkmodestr(unsigned long mode, char *str)
763 static const char *l = "xwr";
767 switch (mode & S_IFMT) {
768 case S_IFDIR: str[0] = 'd'; break;
769 case S_IFBLK: str[0] = 'b'; break;
770 case S_IFCHR: str[0] = 'c'; break;
771 case S_IFIFO: str[0] = 'f'; break;
772 case S_IFLNK: str[0] = 'l'; break;
773 case S_IFSOCK: str[0] = 's'; break;
774 case S_IFREG: str[0] = '-'; break;
775 default: str[0] = '?';
778 for(i = 0; i < 9; i++) {
780 str[9-i] = (mode & mask)?c:'-';
784 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
785 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
786 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
791 static inline void dump_stat(struct stat *st, const char *name)
796 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
799 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
801 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
802 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
805 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
806 st->st_size, s, name);
809 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
812 static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
817 if(!d || !i) return -1;
819 strncpy(fname, (char *)d->name, d->nsize);
820 fname[d->nsize] = '\0';
822 memset(&st,0,sizeof(st));
824 st.st_mtime = i->mtime;
825 st.st_mode = i->mode;
828 /* neither dsize nor isize help us.. do it the long way */
829 st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL);
831 dump_stat(&st, fname);
833 if (d->type == DT_LNK) {
834 unsigned char *src = (unsigned char *) (&i[1]);
836 putnstr(src, (int)i->dsize);
844 /* list inodes with the given pino */
846 jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
849 struct jffs2_raw_dirent *jDir;
851 for (b = pL->dir.listHead; b; b = b->next) {
852 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
853 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
855 struct jffs2_raw_inode ojNode;
856 struct jffs2_raw_inode *jNode, *i = NULL;
857 struct b_node *b2 = pL->frag.listHead;
860 jNode = (struct jffs2_raw_inode *)
861 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
862 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
866 if (jDir->type == DT_LNK)
867 i = get_node_mem(b2->offset);
869 i = get_fl_mem(b2->offset, sizeof(*i), NULL);
874 dump_inode(pL, jDir, i);
883 jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
887 char working_tmp[256];
890 /* discard any leading slash */
892 while (fname[i] == '/')
894 strcpy(tmp, &fname[i]);
896 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
898 strncpy(working_tmp, tmp, c - tmp);
899 working_tmp[c - tmp] = '\0';
901 putstr("search_inode: tmp = ");
904 putstr("search_inode: wtmp = ");
907 putstr("search_inode: c = ");
911 for (i = 0; i < strlen(c) - 1; i++)
915 putstr("search_inode: post tmp = ");
920 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
921 putstr("find_inode failed for name=");
927 /* this is for the bare filename, directories have already been mapped */
928 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
929 putstr("find_inode failed for name=");
939 jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
943 struct jffs2_raw_dirent *jDir;
944 struct jffs2_raw_inode *jNode;
945 u8 jDirFoundType = 0;
946 u32 jDirFoundIno = 0;
947 u32 jDirFoundPino = 0;
953 /* we need to search all and return the inode with the highest version */
954 for(b = pL->dir.listHead; b; b = b->next) {
955 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
956 if (ino == jDir->ino) {
957 if (jDir->version < version) {
962 if (jDir->version == version && jDirFoundType) {
963 /* I'm pretty sure this isn't legal */
964 putstr(" ** ERROR ** ");
965 putnstr(jDir->name, jDir->nsize);
966 putLabeledWord(" has dup version (resolve) = ",
970 jDirFoundType = jDir->type;
971 jDirFoundIno = jDir->ino;
972 jDirFoundPino = jDir->pino;
973 version = jDir->version;
977 /* now we found the right entry again. (shoulda returned inode*) */
978 if (jDirFoundType != DT_LNK)
981 /* it's a soft link so we follow it again. */
982 b2 = pL->frag.listHead;
984 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset);
985 if (jNode->ino == jDirFoundIno) {
986 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
989 putLabeledWord("\t\t dsize = ", jNode->dsize);
990 putstr("\t\t target = ");
991 putnstr(src, jNode->dsize);
994 strncpy(tmp, (char *)src, jNode->dsize);
995 tmp[jNode->dsize] = '\0';
1002 /* ok so the name of the new file to find is in tmp */
1003 /* if it starts with a slash it is root based else shared dirs */
1007 pino = jDirFoundPino;
1009 return jffs2_1pass_search_inode(pL, tmp, pino);
1013 jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1017 char working_tmp[256];
1020 /* discard any leading slash */
1022 while (fname[i] == '/')
1024 strcpy(tmp, &fname[i]);
1025 working_tmp[0] = '\0';
1026 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1028 strncpy(working_tmp, tmp, c - tmp);
1029 working_tmp[c - tmp] = '\0';
1030 for (i = 0; i < strlen(c) - 1; i++)
1033 /* only a failure if we arent looking at top level */
1034 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1036 putstr("find_inode failed for name=");
1037 putstr(working_tmp);
1043 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1044 putstr("find_inode failed for name=");
1049 /* this is for the bare filename, directories have already been mapped */
1050 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1051 putstr("find_inode failed for name=");
1061 jffs2_1pass_rescan_needed(struct part_info *part)
1064 struct jffs2_unknown_node onode;
1065 struct jffs2_unknown_node *node;
1066 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1068 if (part->jffs2_priv == 0){
1069 DEBUGF ("rescan: First time in use\n");
1073 /* if we have no list, we need to rescan */
1074 if (pL->frag.listCount == 0) {
1075 DEBUGF ("rescan: fraglist zero\n");
1079 /* but suppose someone reflashed a partition at the same offset... */
1080 b = pL->dir.listHead;
1082 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1083 sizeof(onode), &onode);
1084 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
1085 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1086 (unsigned long) b->offset);
1094 #ifdef DEBUG_FRAGMENTS
1096 dump_fragments(struct b_lists *pL)
1099 struct jffs2_raw_inode ojNode;
1100 struct jffs2_raw_inode *jNode;
1102 putstr("\r\n\r\n******The fragment Entries******\r\n");
1103 b = pL->frag.listHead;
1105 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1106 sizeof(ojNode), &ojNode);
1107 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1108 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1109 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1110 putLabeledWord("\tbuild_list: version = ", jNode->version);
1111 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1112 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1113 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1114 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1115 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1116 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1117 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1118 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
1119 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1125 #ifdef DEBUG_DIRENTS
1127 dump_dirents(struct b_lists *pL)
1130 struct jffs2_raw_dirent *jDir;
1132 putstr("\r\n\r\n******The directory Entries******\r\n");
1133 b = pL->dir.listHead;
1135 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset);
1137 putnstr(jDir->name, jDir->nsize);
1138 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1139 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1140 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1141 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1142 putLabeledWord("\tbuild_list: version = ", jDir->version);
1143 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1144 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1145 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1146 putLabeledWord("\tbuild_list: type = ", jDir->type);
1147 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1148 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
1149 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1157 jffs2_1pass_build_lists(struct part_info * part)
1160 struct jffs2_unknown_node *node;
1161 u32 offset, oldoffset = 0;
1162 u32 max = part->size - sizeof(struct jffs2_raw_inode);
1168 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1169 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1170 /* only about 5 %. not enough to inconvenience people for. */
1173 /* if we are building a list we need to refresh the cache. */
1174 jffs_init_1pass_list(part);
1175 pL = (struct b_lists *)part->jffs2_priv;
1177 puts ("Scanning JFFS2 FS: ");
1179 /* start at the beginning of the partition */
1180 while (offset < max) {
1181 if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) {
1182 printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]);
1188 node = (struct jffs2_unknown_node *) get_node_mem((u32)part->offset + offset);
1189 if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) {
1190 /* if its a fragment add it */
1191 if (node->nodetype == JFFS2_NODETYPE_INODE &&
1192 inode_crc((struct jffs2_raw_inode *) node) &&
1193 data_crc((struct jffs2_raw_inode *) node)) {
1194 if (insert_node(&pL->frag, (u32) part->offset +
1199 } else if (node->nodetype == JFFS2_NODETYPE_DIRENT &&
1200 dirent_crc((struct jffs2_raw_dirent *) node) &&
1201 dirent_name_crc((struct jffs2_raw_dirent *) node)) {
1202 if (! (counterN%100))
1204 if (insert_node(&pL->dir, (u32) part->offset +
1210 } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) {
1211 if (node->totlen != sizeof(struct jffs2_unknown_node))
1212 printf("OOPS Cleanmarker has bad size "
1215 sizeof(struct jffs2_unknown_node));
1216 } else if (node->nodetype == JFFS2_NODETYPE_PADDING) {
1217 if (node->totlen < sizeof(struct jffs2_unknown_node))
1218 printf("OOPS Padding has bad size "
1221 sizeof(struct jffs2_unknown_node));
1223 printf("Unknown node type: %x len %d offset 0x%x\n",
1225 node->totlen, offset);
1227 offset += ((node->totlen + 3) & ~3);
1229 } else if (node->magic == JFFS2_EMPTY_BITMASK &&
1230 node->nodetype == JFFS2_EMPTY_BITMASK) {
1231 offset = jffs2_scan_empty(offset, part);
1232 } else { /* if we know nothing, we just step and look. */
1236 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1240 putstr("\b\b done.\r\n"); /* close off the dots */
1241 /* turn the lcd back on. */
1245 putLabeledWord("dir entries = ", pL->dir.listCount);
1246 putLabeledWord("frag entries = ", pL->frag.listCount);
1247 putLabeledWord("+4 increments = ", counter4);
1248 putLabeledWord("+file_offset increments = ", counterF);
1252 #ifdef DEBUG_DIRENTS
1256 #ifdef DEBUG_FRAGMENTS
1260 /* give visual feedback that we are done scanning the flash */
1261 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1267 jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1270 struct jffs2_raw_inode ojNode;
1271 struct jffs2_raw_inode *jNode;
1274 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1275 piL->compr_info[i].num_frags = 0;
1276 piL->compr_info[i].compr_sum = 0;
1277 piL->compr_info[i].decompr_sum = 0;
1280 b = pL->frag.listHead;
1282 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1283 sizeof(ojNode), &ojNode);
1284 if (jNode->compr < JFFS2_NUM_COMPR) {
1285 piL->compr_info[jNode->compr].num_frags++;
1286 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1287 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1295 static struct b_lists *
1296 jffs2_get_list(struct part_info * part, const char *who)
1298 /* copy requested part_info struct pointer to global location */
1299 current_part = part;
1301 if (jffs2_1pass_rescan_needed(part)) {
1302 if (!jffs2_1pass_build_lists(part)) {
1303 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1307 return (struct b_lists *)part->jffs2_priv;
1311 /* Print directory / file contents */
1313 jffs2_1pass_ls(struct part_info * part, const char *fname)
1319 if (! (pl = jffs2_get_list(part, "ls")))
1322 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1323 putstr("ls: Failed to scan jffs2 file structure\r\n");
1329 putLabeledWord("found file at inode = ", inode);
1330 putLabeledWord("read_inode returns = ", ret);
1337 /* Load a file from flash into memory. fname can be a full path */
1339 jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1346 if (! (pl = jffs2_get_list(part, "load")))
1349 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1350 putstr("load: Failed to find inode\r\n");
1354 /* Resolve symlinks */
1355 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1356 putstr("load: Failed to resolve inode structure\r\n");
1360 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1361 putstr("load: Failed to read inode\r\n");
1365 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1366 (unsigned long) dest, ret);
1370 /* Return information about the fs on this partition */
1372 jffs2_1pass_info(struct part_info * part)
1374 struct b_jffs2_info info;
1378 if (! (pl = jffs2_get_list(part, "info")))
1381 jffs2_1pass_fill_info(pl, &info);
1382 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1383 printf ("Compression: %s\n"
1384 "\tfrag count: %d\n"
1385 "\tcompressed sum: %d\n"
1386 "\tuncompressed sum: %d\n",
1388 info.compr_info[i].num_frags,
1389 info.compr_info[i].compr_sum,
1390 info.compr_info[i].decompr_sum);