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 CONFIG_SYS_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
)
271 #if defined(CONFIG_CMD_ONENAND)
273 #include <linux/mtd/mtd.h>
274 #include <linux/mtd/onenand.h>
275 #include <onenand_uboot.h>
277 #define ONENAND_PAGE_SIZE 2048
278 #define ONENAND_PAGE_SHIFT 11
279 #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
281 #ifndef ONENAND_CACHE_PAGES
282 #define ONENAND_CACHE_PAGES 4
284 #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
286 static u8
* onenand_cache
;
287 static u32 onenand_cache_off
= (u32
)-1;
289 static int read_onenand_cached(u32 off
, u32 size
, u_char
*buf
)
295 while (bytes_read
< size
) {
296 if ((off
+ bytes_read
< onenand_cache_off
) ||
297 (off
+ bytes_read
>= onenand_cache_off
+ ONENAND_CACHE_SIZE
)) {
298 onenand_cache_off
= (off
+ bytes_read
) & ONENAND_PAGE_MASK
;
299 if (!onenand_cache
) {
300 /* This memory never gets freed but 'cause
301 it's a bootloader, nobody cares */
302 onenand_cache
= malloc(ONENAND_CACHE_SIZE
);
303 if (!onenand_cache
) {
304 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
310 retlen
= ONENAND_CACHE_SIZE
;
311 if (onenand_read(&onenand_mtd
, onenand_cache_off
, retlen
,
312 &retlen
, onenand_cache
) != 0 ||
313 retlen
!= ONENAND_CACHE_SIZE
) {
314 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
315 onenand_cache_off
, ONENAND_CACHE_SIZE
);
319 cpy_bytes
= onenand_cache_off
+ ONENAND_CACHE_SIZE
- (off
+ bytes_read
);
320 if (cpy_bytes
> size
- bytes_read
)
321 cpy_bytes
= size
- bytes_read
;
322 memcpy(buf
+ bytes_read
,
323 onenand_cache
+ off
+ bytes_read
- onenand_cache_off
,
325 bytes_read
+= cpy_bytes
;
330 static void *get_fl_mem_onenand(u32 off
, u32 size
, void *ext_buf
)
332 u_char
*buf
= ext_buf
? (u_char
*)ext_buf
: (u_char
*)malloc(size
);
335 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size
);
338 if (read_onenand_cached(off
, size
, buf
) < 0) {
347 static void *get_node_mem_onenand(u32 off
)
349 struct jffs2_unknown_node node
;
352 if (NULL
== get_fl_mem_onenand(off
, sizeof(node
), &node
))
355 ret
= get_fl_mem_onenand(off
, node
.magic
==
356 JFFS2_MAGIC_BITMASK
? node
.totlen
: sizeof(node
),
359 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
360 off
, node
.magic
, node
.nodetype
, node
.totlen
);
366 static void put_fl_mem_onenand(void *buf
)
373 #if defined(CONFIG_CMD_FLASH)
375 * Support for jffs2 on top of NOR-flash
377 * NOR flash memory is mapped in processor's address space,
378 * just return address.
380 static inline void *get_fl_mem_nor(u32 off
)
383 struct mtdids
*id
= current_part
->dev
->id
;
385 extern flash_info_t flash_info
[];
386 flash_info_t
*flash
= &flash_info
[id
->num
];
388 addr
+= flash
->start
[0];
392 static inline void *get_node_mem_nor(u32 off
)
394 return (void*)get_fl_mem_nor(off
);
400 * Generic jffs2 raw memory and node read routines.
403 static inline void *get_fl_mem(u32 off
, u32 size
, void *ext_buf
)
405 struct mtdids
*id
= current_part
->dev
->id
;
407 #if defined(CONFIG_CMD_FLASH)
408 if (id
->type
== MTD_DEV_TYPE_NOR
)
409 return get_fl_mem_nor(off
);
412 #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
413 if (id
->type
== MTD_DEV_TYPE_NAND
)
414 return get_fl_mem_nand(off
, size
, ext_buf
);
417 #if defined(CONFIG_CMD_ONENAND)
418 if (id
->type
== MTD_DEV_TYPE_ONENAND
)
419 return get_fl_mem_onenand(off
, size
, ext_buf
);
422 printf("get_fl_mem: unknown device type, using raw offset!\n");
426 static inline void *get_node_mem(u32 off
)
428 struct mtdids
*id
= current_part
->dev
->id
;
430 #if defined(CONFIG_CMD_FLASH)
431 if (id
->type
== MTD_DEV_TYPE_NOR
)
432 return get_node_mem_nor(off
);
435 #if defined(CONFIG_JFFS2_NAND) && \
436 defined(CONFIG_CMD_NAND)
437 if (id
->type
== MTD_DEV_TYPE_NAND
)
438 return get_node_mem_nand(off
);
441 #if defined(CONFIG_CMD_ONENAND)
442 if (id
->type
== MTD_DEV_TYPE_ONENAND
)
443 return get_node_mem_onenand(off
);
446 printf("get_node_mem: unknown device type, using raw offset!\n");
450 static inline void put_fl_mem(void *buf
)
452 #if defined(CONFIG_JFFS2_NAND) && \
453 defined(CONFIG_CMD_NAND)
454 struct mtdids
*id
= current_part
->dev
->id
;
456 if (id
->type
== MTD_DEV_TYPE_NAND
)
457 return put_fl_mem_nand(buf
);
460 #if defined(CONFIG_CMD_ONENAND)
461 struct mtdids
*id
= current_part
->dev
->id
;
463 if (id
->type
== MTD_DEV_TYPE_ONENAND
)
464 return put_fl_mem_onenand(buf
);
468 /* Compression names */
469 static char *compr_names
[] = {
477 #if defined(CONFIG_JFFS2_LZO_LZARI)
484 static char spinner
[] = { '|', '/', '-', '\\' };
486 /* Memory management */
489 struct mem_block
*next
;
490 struct b_node nodes
[NODE_CHUNK
];
495 free_nodes(struct b_list
*list
)
497 while (list
->listMemBase
!= NULL
) {
498 struct mem_block
*next
= list
->listMemBase
->next
;
499 free( list
->listMemBase
);
500 list
->listMemBase
= next
;
504 static struct b_node
*
505 add_node(struct b_list
*list
)
508 struct mem_block
*memBase
;
511 memBase
= list
->listMemBase
;
513 index
= memBase
->index
;
515 putLabeledWord("add_node: index = ", index
);
516 putLabeledWord("add_node: memBase = ", list
->listMemBase
);
519 if (memBase
== NULL
|| index
>= NODE_CHUNK
) {
520 /* we need more space before we continue */
521 memBase
= mmalloc(sizeof(struct mem_block
));
522 if (memBase
== NULL
) {
523 putstr("add_node: malloc failed\n");
526 memBase
->next
= list
->listMemBase
;
529 putLabeledWord("add_node: alloced a new membase at ", *memBase
);
533 /* now we have room to add it. */
534 b
= &memBase
->nodes
[index
];
537 memBase
->index
= index
;
538 list
->listMemBase
= memBase
;
543 static struct b_node
*
544 insert_node(struct b_list
*list
, u32 offset
)
547 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
548 struct b_node
*b
, *prev
;
551 if (!(new = add_node(list
))) {
552 putstr("add_node failed!\r\n");
555 new->offset
= offset
;
557 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
558 if (list
->listTail
!= NULL
&& list
->listCompare(new, list
->listTail
))
559 prev
= list
->listTail
;
560 else if (list
->listLast
!= NULL
&& list
->listCompare(new, list
->listLast
))
561 prev
= list
->listLast
;
565 for (b
= (prev
? prev
->next
: list
->listHead
);
566 b
!= NULL
&& list
->listCompare(new, b
);
567 prev
= b
, b
= b
->next
) {
571 list
->listLast
= prev
;
578 list
->listHead
= new;
582 new->next
= (struct b_node
*) NULL
;
583 if (list
->listTail
!= NULL
) {
584 list
->listTail
->next
= new;
585 list
->listTail
= new;
587 list
->listTail
= list
->listHead
= new;
594 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
595 /* Sort data entries with the latest version last, so that if there
596 * is overlapping data the latest version will be used.
598 static int compare_inodes(struct b_node
*new, struct b_node
*old
)
600 struct jffs2_raw_inode ojNew
;
601 struct jffs2_raw_inode ojOld
;
602 struct jffs2_raw_inode
*jNew
=
603 (struct jffs2_raw_inode
*)get_fl_mem(new->offset
, sizeof(ojNew
), &ojNew
);
604 struct jffs2_raw_inode
*jOld
=
605 (struct jffs2_raw_inode
*)get_fl_mem(old
->offset
, sizeof(ojOld
), &ojOld
);
607 return jNew
->version
> jOld
->version
;
610 /* Sort directory entries so all entries in the same directory
611 * with the same name are grouped together, with the latest version
612 * last. This makes it easy to eliminate all but the latest version
613 * by marking the previous version dead by setting the inode to 0.
615 static int compare_dirents(struct b_node
*new, struct b_node
*old
)
617 struct jffs2_raw_dirent ojNew
;
618 struct jffs2_raw_dirent ojOld
;
619 struct jffs2_raw_dirent
*jNew
=
620 (struct jffs2_raw_dirent
*)get_fl_mem(new->offset
, sizeof(ojNew
), &ojNew
);
621 struct jffs2_raw_dirent
*jOld
=
622 (struct jffs2_raw_dirent
*)get_fl_mem(old
->offset
, sizeof(ojOld
), &ojOld
);
625 /* ascending sort by pino */
626 if (jNew
->pino
!= jOld
->pino
)
627 return jNew
->pino
> jOld
->pino
;
629 /* pino is the same, so use ascending sort by nsize, so
630 * we don't do strncmp unless we really must.
632 if (jNew
->nsize
!= jOld
->nsize
)
633 return jNew
->nsize
> jOld
->nsize
;
635 /* length is also the same, so use ascending sort by name
637 cmp
= strncmp((char *)jNew
->name
, (char *)jOld
->name
, jNew
->nsize
);
641 /* we have duplicate names in this directory, so use ascending
644 if (jNew
->version
> jOld
->version
) {
645 /* since jNew is newer, we know jOld is not valid, so
646 * mark it with inode 0 and it will not be used
657 jffs2_scan_empty(u32 start_offset
, struct part_info
*part
)
659 char *max
= (char *)(part
->offset
+ part
->size
- sizeof(struct jffs2_raw_inode
));
660 char *offset
= (char *)(part
->offset
+ start_offset
);
663 while (offset
< max
&&
664 *(u32
*)get_fl_mem((u32
)offset
, sizeof(u32
), &off
) == 0xFFFFFFFF) {
665 offset
+= sizeof(u32
);
666 /* return if spinning is due */
667 if (((u32
)offset
& ((1 << SPIN_BLKSIZE
)-1)) == 0) break;
670 return (u32
)offset
- part
->offset
;
674 jffs2_free_cache(struct part_info
*part
)
678 if (part
->jffs2_priv
!= NULL
) {
679 pL
= (struct b_lists
*)part
->jffs2_priv
;
680 free_nodes(&pL
->frag
);
681 free_nodes(&pL
->dir
);
687 jffs_init_1pass_list(struct part_info
*part
)
691 jffs2_free_cache(part
);
693 if (NULL
!= (part
->jffs2_priv
= malloc(sizeof(struct b_lists
)))) {
694 pL
= (struct b_lists
*)part
->jffs2_priv
;
696 memset(pL
, 0, sizeof(*pL
));
697 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
698 pL
->dir
.listCompare
= compare_dirents
;
699 pL
->frag
.listCompare
= compare_inodes
;
705 /* find the inode from the slashless name given a parent */
707 jffs2_1pass_read_inode(struct b_lists
*pL
, u32 inode
, char *dest
)
710 struct jffs2_raw_inode
*jNode
;
712 u32 latestVersion
= 0;
718 #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
719 /* Find file size before loading any data, so fragments that
720 * start past the end of file can be ignored. A fragment
721 * that is partially in the file is loaded, so extra data may
722 * be loaded up to the next 4K boundary above the file size.
723 * This shouldn't cause trouble when loading kernel images, so
724 * we will live with it.
726 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
727 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
728 sizeof(struct jffs2_raw_inode
), NULL
);
729 if ((inode
== jNode
->ino
)) {
730 /* get actual file length from the newest node */
731 if (jNode
->version
>= latestVersion
) {
732 totalSize
= jNode
->isize
;
733 latestVersion
= jNode
->version
;
740 for (b
= pL
->frag
.listHead
; b
!= NULL
; b
= b
->next
) {
741 jNode
= (struct jffs2_raw_inode
*) get_node_mem(b
->offset
);
742 if ((inode
== jNode
->ino
)) {
744 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode
->totlen
);
745 putLabeledWord("read_inode: inode = ", jNode
->ino
);
746 putLabeledWord("read_inode: version = ", jNode
->version
);
747 putLabeledWord("read_inode: isize = ", jNode
->isize
);
748 putLabeledWord("read_inode: offset = ", jNode
->offset
);
749 putLabeledWord("read_inode: csize = ", jNode
->csize
);
750 putLabeledWord("read_inode: dsize = ", jNode
->dsize
);
751 putLabeledWord("read_inode: compr = ", jNode
->compr
);
752 putLabeledWord("read_inode: usercompr = ", jNode
->usercompr
);
753 putLabeledWord("read_inode: flags = ", jNode
->flags
);
756 #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
757 /* get actual file length from the newest node */
758 if (jNode
->version
>= latestVersion
) {
759 totalSize
= jNode
->isize
;
760 latestVersion
= jNode
->version
;
765 src
= ((uchar
*) jNode
) + sizeof(struct jffs2_raw_inode
);
766 /* ignore data behind latest known EOF */
767 if (jNode
->offset
> totalSize
) {
772 lDest
= (uchar
*) (dest
+ jNode
->offset
);
774 putLabeledWord("read_inode: src = ", src
);
775 putLabeledWord("read_inode: dest = ", lDest
);
777 switch (jNode
->compr
) {
778 case JFFS2_COMPR_NONE
:
779 ret
= (unsigned long) ldr_memcpy(lDest
, src
, jNode
->dsize
);
781 case JFFS2_COMPR_ZERO
:
783 for (i
= 0; i
< jNode
->dsize
; i
++)
786 case JFFS2_COMPR_RTIME
:
788 rtime_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
790 case JFFS2_COMPR_DYNRUBIN
:
791 /* this is slow but it works */
793 dynrubin_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
795 case JFFS2_COMPR_ZLIB
:
796 ret
= zlib_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
798 #if defined(CONFIG_JFFS2_LZO_LZARI)
799 case JFFS2_COMPR_LZO
:
800 ret
= lzo_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
802 case JFFS2_COMPR_LZARI
:
803 ret
= lzari_decompress(src
, lDest
, jNode
->csize
, jNode
->dsize
);
808 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode
->compr
);
816 putLabeledWord("read_inode: totalSize = ", totalSize
);
817 putLabeledWord("read_inode: compr ret = ", ret
);
825 putLabeledWord("read_inode: returning = ", totalSize
);
830 /* find the inode from the slashless name given a parent */
832 jffs2_1pass_find_inode(struct b_lists
* pL
, const char *name
, u32 pino
)
835 struct jffs2_raw_dirent
*jDir
;
841 /* name is assumed slash free */
845 /* we need to search all and return the inode with the highest version */
846 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
, counter
++) {
847 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
848 if ((pino
== jDir
->pino
) && (len
== jDir
->nsize
) &&
849 (jDir
->ino
) && /* 0 for unlink */
850 (!strncmp((char *)jDir
->name
, name
, len
))) { /* a match */
851 if (jDir
->version
< version
) {
856 if (jDir
->version
== version
&& inode
!= 0) {
857 /* I'm pretty sure this isn't legal */
858 putstr(" ** ERROR ** ");
859 putnstr(jDir
->name
, jDir
->nsize
);
860 putLabeledWord(" has dup version =", version
);
863 version
= jDir
->version
;
866 putstr("\r\nfind_inode:p&l ->");
867 putnstr(jDir
->name
, jDir
->nsize
);
869 putLabeledWord("pino = ", jDir
->pino
);
870 putLabeledWord("nsize = ", jDir
->nsize
);
871 putLabeledWord("b = ", (u32
) b
);
872 putLabeledWord("counter = ", counter
);
879 char *mkmodestr(unsigned long mode
, char *str
)
881 static const char *l
= "xwr";
885 switch (mode
& S_IFMT
) {
886 case S_IFDIR
: str
[0] = 'd'; break;
887 case S_IFBLK
: str
[0] = 'b'; break;
888 case S_IFCHR
: str
[0] = 'c'; break;
889 case S_IFIFO
: str
[0] = 'f'; break;
890 case S_IFLNK
: str
[0] = 'l'; break;
891 case S_IFSOCK
: str
[0] = 's'; break;
892 case S_IFREG
: str
[0] = '-'; break;
893 default: str
[0] = '?';
896 for(i
= 0; i
< 9; i
++) {
898 str
[9-i
] = (mode
& mask
)?c
:'-';
902 if(mode
& S_ISUID
) str
[3] = (mode
& S_IXUSR
)?'s':'S';
903 if(mode
& S_ISGID
) str
[6] = (mode
& S_IXGRP
)?'s':'S';
904 if(mode
& S_ISVTX
) str
[9] = (mode
& S_IXOTH
)?'t':'T';
909 static inline void dump_stat(struct stat
*st
, const char *name
)
914 if (st
->st_mtime
== (time_t)(-1)) /* some ctimes really hate -1 */
917 ctime_r((time_t *)&st
->st_mtime
, s
/*,64*/); /* newlib ctime doesn't have buflen */
919 if ((p
= strchr(s
,'\n')) != NULL
) *p
= '\0';
920 if ((p
= strchr(s
,'\r')) != NULL
) *p
= '\0';
923 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
924 st->st_size, s, name);
927 printf(" %s %8ld %s %s", mkmodestr(st
->st_mode
,str
), st
->st_size
, s
, name
);
930 static inline u32
dump_inode(struct b_lists
* pL
, struct jffs2_raw_dirent
*d
, struct jffs2_raw_inode
*i
)
935 if(!d
|| !i
) return -1;
937 strncpy(fname
, (char *)d
->name
, d
->nsize
);
938 fname
[d
->nsize
] = '\0';
940 memset(&st
,0,sizeof(st
));
942 st
.st_mtime
= i
->mtime
;
943 st
.st_mode
= i
->mode
;
946 /* neither dsize nor isize help us.. do it the long way */
947 st
.st_size
= jffs2_1pass_read_inode(pL
, i
->ino
, NULL
);
949 dump_stat(&st
, fname
);
951 if (d
->type
== DT_LNK
) {
952 unsigned char *src
= (unsigned char *) (&i
[1]);
954 putnstr(src
, (int)i
->dsize
);
962 /* list inodes with the given pino */
964 jffs2_1pass_list_inodes(struct b_lists
* pL
, u32 pino
)
967 struct jffs2_raw_dirent
*jDir
;
969 for (b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
970 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
971 if ((pino
== jDir
->pino
) && (jDir
->ino
)) { /* ino=0 -> unlink */
973 struct jffs2_raw_inode ojNode
;
974 struct jffs2_raw_inode
*jNode
, *i
= NULL
;
975 struct b_node
*b2
= pL
->frag
.listHead
;
978 jNode
= (struct jffs2_raw_inode
*)
979 get_fl_mem(b2
->offset
, sizeof(ojNode
), &ojNode
);
980 if (jNode
->ino
== jDir
->ino
&& jNode
->version
>= i_version
) {
984 if (jDir
->type
== DT_LNK
)
985 i
= get_node_mem(b2
->offset
);
987 i
= get_fl_mem(b2
->offset
, sizeof(*i
), NULL
);
992 dump_inode(pL
, jDir
, i
);
1001 jffs2_1pass_search_inode(struct b_lists
* pL
, const char *fname
, u32 pino
)
1005 char working_tmp
[256];
1008 /* discard any leading slash */
1010 while (fname
[i
] == '/')
1012 strcpy(tmp
, &fname
[i
]);
1014 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
1016 strncpy(working_tmp
, tmp
, c
- tmp
);
1017 working_tmp
[c
- tmp
] = '\0';
1019 putstr("search_inode: tmp = ");
1022 putstr("search_inode: wtmp = ");
1023 putstr(working_tmp
);
1025 putstr("search_inode: c = ");
1029 for (i
= 0; i
< strlen(c
) - 1; i
++)
1033 putstr("search_inode: post tmp = ");
1038 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
))) {
1039 putstr("find_inode failed for name=");
1040 putstr(working_tmp
);
1045 /* this is for the bare filename, directories have already been mapped */
1046 if (!(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
1047 putstr("find_inode failed for name=");
1057 jffs2_1pass_resolve_inode(struct b_lists
* pL
, u32 ino
)
1061 struct jffs2_raw_dirent
*jDir
;
1062 struct jffs2_raw_inode
*jNode
;
1063 u8 jDirFoundType
= 0;
1064 u32 jDirFoundIno
= 0;
1065 u32 jDirFoundPino
= 0;
1071 /* we need to search all and return the inode with the highest version */
1072 for(b
= pL
->dir
.listHead
; b
; b
= b
->next
) {
1073 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
1074 if (ino
== jDir
->ino
) {
1075 if (jDir
->version
< version
) {
1080 if (jDir
->version
== version
&& jDirFoundType
) {
1081 /* I'm pretty sure this isn't legal */
1082 putstr(" ** ERROR ** ");
1083 putnstr(jDir
->name
, jDir
->nsize
);
1084 putLabeledWord(" has dup version (resolve) = ",
1088 jDirFoundType
= jDir
->type
;
1089 jDirFoundIno
= jDir
->ino
;
1090 jDirFoundPino
= jDir
->pino
;
1091 version
= jDir
->version
;
1095 /* now we found the right entry again. (shoulda returned inode*) */
1096 if (jDirFoundType
!= DT_LNK
)
1097 return jDirFoundIno
;
1099 /* it's a soft link so we follow it again. */
1100 b2
= pL
->frag
.listHead
;
1102 jNode
= (struct jffs2_raw_inode
*) get_node_mem(b2
->offset
);
1103 if (jNode
->ino
== jDirFoundIno
) {
1104 src
= (unsigned char *)jNode
+ sizeof(struct jffs2_raw_inode
);
1107 putLabeledWord("\t\t dsize = ", jNode
->dsize
);
1108 putstr("\t\t target = ");
1109 putnstr(src
, jNode
->dsize
);
1112 strncpy(tmp
, (char *)src
, jNode
->dsize
);
1113 tmp
[jNode
->dsize
] = '\0';
1120 /* ok so the name of the new file to find is in tmp */
1121 /* if it starts with a slash it is root based else shared dirs */
1125 pino
= jDirFoundPino
;
1127 return jffs2_1pass_search_inode(pL
, tmp
, pino
);
1131 jffs2_1pass_search_list_inodes(struct b_lists
* pL
, const char *fname
, u32 pino
)
1135 char working_tmp
[256];
1138 /* discard any leading slash */
1140 while (fname
[i
] == '/')
1142 strcpy(tmp
, &fname
[i
]);
1143 working_tmp
[0] = '\0';
1144 while ((c
= (char *) strchr(tmp
, '/'))) /* we are still dired searching */
1146 strncpy(working_tmp
, tmp
, c
- tmp
);
1147 working_tmp
[c
- tmp
] = '\0';
1148 for (i
= 0; i
< strlen(c
) - 1; i
++)
1151 /* only a failure if we arent looking at top level */
1152 if (!(pino
= jffs2_1pass_find_inode(pL
, working_tmp
, pino
)) &&
1154 putstr("find_inode failed for name=");
1155 putstr(working_tmp
);
1161 if (tmp
[0] && !(pino
= jffs2_1pass_find_inode(pL
, tmp
, pino
))) {
1162 putstr("find_inode failed for name=");
1167 /* this is for the bare filename, directories have already been mapped */
1168 if (!(pino
= jffs2_1pass_list_inodes(pL
, pino
))) {
1169 putstr("find_inode failed for name=");
1179 jffs2_1pass_rescan_needed(struct part_info
*part
)
1182 struct jffs2_unknown_node onode
;
1183 struct jffs2_unknown_node
*node
;
1184 struct b_lists
*pL
= (struct b_lists
*)part
->jffs2_priv
;
1186 if (part
->jffs2_priv
== 0){
1187 DEBUGF ("rescan: First time in use\n");
1191 /* if we have no list, we need to rescan */
1192 if (pL
->frag
.listCount
== 0) {
1193 DEBUGF ("rescan: fraglist zero\n");
1197 /* but suppose someone reflashed a partition at the same offset... */
1198 b
= pL
->dir
.listHead
;
1200 node
= (struct jffs2_unknown_node
*) get_fl_mem(b
->offset
,
1201 sizeof(onode
), &onode
);
1202 if (node
->nodetype
!= JFFS2_NODETYPE_DIRENT
) {
1203 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1204 (unsigned long) b
->offset
);
1212 #ifdef DEBUG_FRAGMENTS
1214 dump_fragments(struct b_lists
*pL
)
1217 struct jffs2_raw_inode ojNode
;
1218 struct jffs2_raw_inode
*jNode
;
1220 putstr("\r\n\r\n******The fragment Entries******\r\n");
1221 b
= pL
->frag
.listHead
;
1223 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1224 sizeof(ojNode
), &ojNode
);
1225 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b
->offset
);
1226 putLabeledWord("\tbuild_list: totlen = ", jNode
->totlen
);
1227 putLabeledWord("\tbuild_list: inode = ", jNode
->ino
);
1228 putLabeledWord("\tbuild_list: version = ", jNode
->version
);
1229 putLabeledWord("\tbuild_list: isize = ", jNode
->isize
);
1230 putLabeledWord("\tbuild_list: atime = ", jNode
->atime
);
1231 putLabeledWord("\tbuild_list: offset = ", jNode
->offset
);
1232 putLabeledWord("\tbuild_list: csize = ", jNode
->csize
);
1233 putLabeledWord("\tbuild_list: dsize = ", jNode
->dsize
);
1234 putLabeledWord("\tbuild_list: compr = ", jNode
->compr
);
1235 putLabeledWord("\tbuild_list: usercompr = ", jNode
->usercompr
);
1236 putLabeledWord("\tbuild_list: flags = ", jNode
->flags
);
1237 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1243 #ifdef DEBUG_DIRENTS
1245 dump_dirents(struct b_lists
*pL
)
1248 struct jffs2_raw_dirent
*jDir
;
1250 putstr("\r\n\r\n******The directory Entries******\r\n");
1251 b
= pL
->dir
.listHead
;
1253 jDir
= (struct jffs2_raw_dirent
*) get_node_mem(b
->offset
);
1255 putnstr(jDir
->name
, jDir
->nsize
);
1256 putLabeledWord("\r\n\tbuild_list: magic = ", jDir
->magic
);
1257 putLabeledWord("\tbuild_list: nodetype = ", jDir
->nodetype
);
1258 putLabeledWord("\tbuild_list: hdr_crc = ", jDir
->hdr_crc
);
1259 putLabeledWord("\tbuild_list: pino = ", jDir
->pino
);
1260 putLabeledWord("\tbuild_list: version = ", jDir
->version
);
1261 putLabeledWord("\tbuild_list: ino = ", jDir
->ino
);
1262 putLabeledWord("\tbuild_list: mctime = ", jDir
->mctime
);
1263 putLabeledWord("\tbuild_list: nsize = ", jDir
->nsize
);
1264 putLabeledWord("\tbuild_list: type = ", jDir
->type
);
1265 putLabeledWord("\tbuild_list: node_crc = ", jDir
->node_crc
);
1266 putLabeledWord("\tbuild_list: name_crc = ", jDir
->name_crc
);
1267 putLabeledWord("\tbuild_list: offset = ", b
->offset
); /* FIXME: ? [RS] */
1275 jffs2_1pass_build_lists(struct part_info
* part
)
1278 struct jffs2_unknown_node
*node
;
1279 u32 offset
, oldoffset
= 0;
1280 u32 max
= part
->size
- sizeof(struct jffs2_raw_inode
);
1286 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1287 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1288 /* only about 5 %. not enough to inconvenience people for. */
1291 /* if we are building a list we need to refresh the cache. */
1292 jffs_init_1pass_list(part
);
1293 pL
= (struct b_lists
*)part
->jffs2_priv
;
1295 puts ("Scanning JFFS2 FS: ");
1297 /* start at the beginning of the partition */
1298 while (offset
< max
) {
1299 if ((oldoffset
>> SPIN_BLKSIZE
) != (offset
>> SPIN_BLKSIZE
)) {
1300 printf("\b\b%c ", spinner
[counter
++ % sizeof(spinner
)]);
1306 node
= (struct jffs2_unknown_node
*) get_node_mem((u32
)part
->offset
+ offset
);
1307 if (node
->magic
== JFFS2_MAGIC_BITMASK
&& hdr_crc(node
)) {
1308 /* if its a fragment add it */
1309 if (node
->nodetype
== JFFS2_NODETYPE_INODE
&&
1310 inode_crc((struct jffs2_raw_inode
*) node
) &&
1311 data_crc((struct jffs2_raw_inode
*) node
)) {
1312 if (insert_node(&pL
->frag
, (u32
) part
->offset
+
1317 } else if (node
->nodetype
== JFFS2_NODETYPE_DIRENT
&&
1318 dirent_crc((struct jffs2_raw_dirent
*) node
) &&
1319 dirent_name_crc((struct jffs2_raw_dirent
*) node
)) {
1320 if (! (counterN
%100))
1322 if (insert_node(&pL
->dir
, (u32
) part
->offset
+
1328 } else if (node
->nodetype
== JFFS2_NODETYPE_CLEANMARKER
) {
1329 if (node
->totlen
!= sizeof(struct jffs2_unknown_node
))
1330 printf("OOPS Cleanmarker has bad size "
1333 sizeof(struct jffs2_unknown_node
));
1334 } else if (node
->nodetype
== JFFS2_NODETYPE_PADDING
) {
1335 if (node
->totlen
< sizeof(struct jffs2_unknown_node
))
1336 printf("OOPS Padding has bad size "
1339 sizeof(struct jffs2_unknown_node
));
1341 printf("Unknown node type: %x len %d offset 0x%x\n",
1343 node
->totlen
, offset
);
1345 offset
+= ((node
->totlen
+ 3) & ~3);
1347 } else if (node
->magic
== JFFS2_EMPTY_BITMASK
&&
1348 node
->nodetype
== JFFS2_EMPTY_BITMASK
) {
1349 offset
= jffs2_scan_empty(offset
, part
);
1350 } else { /* if we know nothing, we just step and look. */
1354 /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */
1358 putstr("\b\b done.\r\n"); /* close off the dots */
1359 /* turn the lcd back on. */
1363 putLabeledWord("dir entries = ", pL
->dir
.listCount
);
1364 putLabeledWord("frag entries = ", pL
->frag
.listCount
);
1365 putLabeledWord("+4 increments = ", counter4
);
1366 putLabeledWord("+file_offset increments = ", counterF
);
1370 #ifdef DEBUG_DIRENTS
1374 #ifdef DEBUG_FRAGMENTS
1378 /* give visual feedback that we are done scanning the flash */
1379 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1385 jffs2_1pass_fill_info(struct b_lists
* pL
, struct b_jffs2_info
* piL
)
1388 struct jffs2_raw_inode ojNode
;
1389 struct jffs2_raw_inode
*jNode
;
1392 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1393 piL
->compr_info
[i
].num_frags
= 0;
1394 piL
->compr_info
[i
].compr_sum
= 0;
1395 piL
->compr_info
[i
].decompr_sum
= 0;
1398 b
= pL
->frag
.listHead
;
1400 jNode
= (struct jffs2_raw_inode
*) get_fl_mem(b
->offset
,
1401 sizeof(ojNode
), &ojNode
);
1402 if (jNode
->compr
< JFFS2_NUM_COMPR
) {
1403 piL
->compr_info
[jNode
->compr
].num_frags
++;
1404 piL
->compr_info
[jNode
->compr
].compr_sum
+= jNode
->csize
;
1405 piL
->compr_info
[jNode
->compr
].decompr_sum
+= jNode
->dsize
;
1413 static struct b_lists
*
1414 jffs2_get_list(struct part_info
* part
, const char *who
)
1416 /* copy requested part_info struct pointer to global location */
1417 current_part
= part
;
1419 if (jffs2_1pass_rescan_needed(part
)) {
1420 if (!jffs2_1pass_build_lists(part
)) {
1421 printf("%s: Failed to scan JFFSv2 file structure\n", who
);
1425 return (struct b_lists
*)part
->jffs2_priv
;
1429 /* Print directory / file contents */
1431 jffs2_1pass_ls(struct part_info
* part
, const char *fname
)
1437 if (! (pl
= jffs2_get_list(part
, "ls")))
1440 if (! (inode
= jffs2_1pass_search_list_inodes(pl
, fname
, 1))) {
1441 putstr("ls: Failed to scan jffs2 file structure\r\n");
1447 putLabeledWord("found file at inode = ", inode
);
1448 putLabeledWord("read_inode returns = ", ret
);
1455 /* Load a file from flash into memory. fname can be a full path */
1457 jffs2_1pass_load(char *dest
, struct part_info
* part
, const char *fname
)
1464 if (! (pl
= jffs2_get_list(part
, "load")))
1467 if (! (inode
= jffs2_1pass_search_inode(pl
, fname
, 1))) {
1468 putstr("load: Failed to find inode\r\n");
1472 /* Resolve symlinks */
1473 if (! (inode
= jffs2_1pass_resolve_inode(pl
, inode
))) {
1474 putstr("load: Failed to resolve inode structure\r\n");
1478 if ((ret
= jffs2_1pass_read_inode(pl
, inode
, dest
)) < 0) {
1479 putstr("load: Failed to read inode\r\n");
1483 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname
,
1484 (unsigned long) dest
, ret
);
1488 /* Return information about the fs on this partition */
1490 jffs2_1pass_info(struct part_info
* part
)
1492 struct b_jffs2_info info
;
1496 if (! (pl
= jffs2_get_list(part
, "info")))
1499 jffs2_1pass_fill_info(pl
, &info
);
1500 for (i
= 0; i
< JFFS2_NUM_COMPR
; i
++) {
1501 printf ("Compression: %s\n"
1502 "\tfrag count: %d\n"
1503 "\tcompressed sum: %d\n"
1504 "\tuncompressed sum: %d\n",
1506 info
.compr_info
[i
].num_frags
,
1507 info
.compr_info
[i
].compr_sum
,
1508 info
.compr_info
[i
].decompr_sum
);