1fe8c2806Swdenk /*
2fe8c2806Swdenk -------------------------------------------------------------------------
3fe8c2806Swdenk * Filename: jffs2.c
4fe8c2806Swdenk * Version: $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
5fe8c2806Swdenk * Copyright: Copyright (C) 2001, Russ Dill
6fe8c2806Swdenk * Author: Russ Dill <Russ.Dill@asu.edu>
7fe8c2806Swdenk * Description: Module to load kernel from jffs2
8fe8c2806Swdenk *-----------------------------------------------------------------------*/
9fe8c2806Swdenk /*
10fe8c2806Swdenk * some portions of this code are taken from jffs2, and as such, the
11fe8c2806Swdenk * following copyright notice is included.
12fe8c2806Swdenk *
13fe8c2806Swdenk * JFFS2 -- Journalling Flash File System, Version 2.
14fe8c2806Swdenk *
15fe8c2806Swdenk * Copyright (C) 2001 Red Hat, Inc.
16fe8c2806Swdenk *
17fe8c2806Swdenk * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
18fe8c2806Swdenk *
19fe8c2806Swdenk * The original JFFS, from which the design for JFFS2 was derived,
20fe8c2806Swdenk * was designed and implemented by Axis Communications AB.
21fe8c2806Swdenk *
22fe8c2806Swdenk * The contents of this file are subject to the Red Hat eCos Public
23fe8c2806Swdenk * License Version 1.1 (the "Licence"); you may not use this file
24fe8c2806Swdenk * except in compliance with the Licence. You may obtain a copy of
25fe8c2806Swdenk * the Licence at http://www.redhat.com/
26fe8c2806Swdenk *
27fe8c2806Swdenk * Software distributed under the Licence is distributed on an "AS IS"
28fe8c2806Swdenk * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
29fe8c2806Swdenk * See the Licence for the specific language governing rights and
30fe8c2806Swdenk * limitations under the Licence.
31fe8c2806Swdenk *
32fe8c2806Swdenk * The Original Code is JFFS2 - Journalling Flash File System, version 2
33fe8c2806Swdenk *
34fe8c2806Swdenk * Alternatively, the contents of this file may be used under the
35fe8c2806Swdenk * terms of the GNU General Public License version 2 (the "GPL"), in
36fe8c2806Swdenk * which case the provisions of the GPL are applicable instead of the
37fe8c2806Swdenk * above. If you wish to allow the use of your version of this file
38fe8c2806Swdenk * only under the terms of the GPL and not to allow others to use your
39fe8c2806Swdenk * version of this file under the RHEPL, indicate your decision by
40fe8c2806Swdenk * deleting the provisions above and replace them with the notice and
41fe8c2806Swdenk * other provisions required by the GPL. If you do not delete the
42fe8c2806Swdenk * provisions above, a recipient may use your version of this file
43fe8c2806Swdenk * under either the RHEPL or the GPL.
44fe8c2806Swdenk *
45fe8c2806Swdenk * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
46fe8c2806Swdenk *
47fe8c2806Swdenk */
48fe8c2806Swdenk
49fe8c2806Swdenk /* Ok, so anyone who knows the jffs2 code will probably want to get a papar
50fe8c2806Swdenk * bag to throw up into before reading this code. I looked through the jffs2
51fe8c2806Swdenk * code, the caching scheme is very elegant. I tried to keep the version
52fe8c2806Swdenk * for a bootloader as small and simple as possible. Instead of worring about
53fe8c2806Swdenk * unneccesary data copies, node scans, etc, I just optimized for the known
54fe8c2806Swdenk * common case, a kernel, which looks like:
55fe8c2806Swdenk * (1) most pages are 4096 bytes
56fe8c2806Swdenk * (2) version numbers are somewhat sorted in acsending order
57fe8c2806Swdenk * (3) multiple compressed blocks making up one page is uncommon
58fe8c2806Swdenk *
59fe8c2806Swdenk * So I create a linked list of decending version numbers (insertions at the
60fe8c2806Swdenk * head), and then for each page, walk down the list, until a matching page
61fe8c2806Swdenk * with 4096 bytes is found, and then decompress the watching pages in
62fe8c2806Swdenk * reverse order.
63fe8c2806Swdenk *
64fe8c2806Swdenk */
65fe8c2806Swdenk
66fe8c2806Swdenk /*
67fe8c2806Swdenk * Adapted by Nye Liu <nyet@zumanetworks.com> and
68fe8c2806Swdenk * Rex Feany <rfeany@zumanetworks.com>
69fe8c2806Swdenk * on Jan/2002 for U-Boot.
70fe8c2806Swdenk *
71fe8c2806Swdenk * Clipped out all the non-1pass functions, cleaned up warnings,
72fe8c2806Swdenk * wrappers, etc. No major changes to the code.
73fe8c2806Swdenk * Please, he really means it when he said have a paper bag
74fe8c2806Swdenk * handy. We needed it ;).
75fe8c2806Swdenk *
76fe8c2806Swdenk */
77fe8c2806Swdenk
7806d01dbeSwdenk /*
7906d01dbeSwdenk * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
8006d01dbeSwdenk *
8106d01dbeSwdenk * - overhaul of the memory management. Removed much of the "paper-bagging"
8206d01dbeSwdenk * in that part of the code, fixed several bugs, now frees memory when
8306d01dbeSwdenk * partition is changed.
8406d01dbeSwdenk * It's still ugly :-(
8506d01dbeSwdenk * - fixed a bug in jffs2_1pass_read_inode where the file length calculation
8606d01dbeSwdenk * was incorrect. Removed a bit of the paper-bagging as well.
8706d01dbeSwdenk * - removed double crc calculation for fragment headers in jffs2_private.h
8806d01dbeSwdenk * for speedup.
8906d01dbeSwdenk * - scan_empty rewritten in a more "standard" manner (non-paperbag, that is).
9006d01dbeSwdenk * - spinning wheel now spins depending on how much memory has been scanned
9106d01dbeSwdenk * - lots of small changes all over the place to "improve" readability.
9206d01dbeSwdenk * - implemented fragment sorting to ensure that the newest data is copied
9306d01dbeSwdenk * if there are multiple copies of fragments for a certain file offset.
9406d01dbeSwdenk *
956d0f6bcfSJean-Christophe PLAGNIOL-VILLARD * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS.
9606d01dbeSwdenk * Sorting is done while adding fragments to the lists, which is more or less a
9706d01dbeSwdenk * bubble sort. This takes a lot of time, and is most probably not an issue if
9806d01dbeSwdenk * the boot filesystem is always mounted readonly.
9906d01dbeSwdenk *
10006d01dbeSwdenk * You should define it if the boot filesystem is mounted writable, and updates
10106d01dbeSwdenk * to the boot files are done by copying files to that filesystem.
10206d01dbeSwdenk *
10306d01dbeSwdenk *
10406d01dbeSwdenk * There's a big issue left: endianess is completely ignored in this code. Duh!
10506d01dbeSwdenk *
10606d01dbeSwdenk *
10706d01dbeSwdenk * You still should have paper bags at hand :-(. The code lacks more or less
10806d01dbeSwdenk * any comment, and is still arcane and difficult to read in places. As this
109dd875c76Swdenk * might be incompatible with any new code from the jffs2 maintainers anyway,
110dd875c76Swdenk * it should probably be dumped and replaced by something like jffs2reader!
11106d01dbeSwdenk */
11206d01dbeSwdenk
11306d01dbeSwdenk
114fe8c2806Swdenk #include <common.h>
115fe8c2806Swdenk #include <config.h>
116fe8c2806Swdenk #include <malloc.h>
11718e86724STom Rini #include <div64.h>
1181c8fdf87STom Rini #include <linux/compiler.h>
119fe8c2806Swdenk #include <linux/stat.h>
120fe8c2806Swdenk #include <linux/time.h>
12186d3273eSStuart Wood #include <watchdog.h>
122fe8c2806Swdenk #include <jffs2/jffs2.h>
123fe8c2806Swdenk #include <jffs2/jffs2_1pass.h>
1247b15e2bbSMike Frysinger #include <linux/compat.h>
1251221ce45SMasahiro Yamada #include <linux/errno.h>
126fe8c2806Swdenk
127fe8c2806Swdenk #include "jffs2_private.h"
128fe8c2806Swdenk
12906d01dbeSwdenk
13006d01dbeSwdenk #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
131fc1cfcdbSwdenk #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
13206d01dbeSwdenk
13306d01dbeSwdenk /* Debugging switches */
13406d01dbeSwdenk #undef DEBUG_DIRENTS /* print directory entry list after scan */
13506d01dbeSwdenk #undef DEBUG_FRAGMENTS /* print fragment list after scan */
13606d01dbeSwdenk #undef DEBUG /* enable debugging messages */
13706d01dbeSwdenk
13806d01dbeSwdenk
13906d01dbeSwdenk #ifdef DEBUG
14006d01dbeSwdenk # define DEBUGF(fmt,args...) printf(fmt ,##args)
14106d01dbeSwdenk #else
14206d01dbeSwdenk # define DEBUGF(fmt,args...)
14306d01dbeSwdenk #endif
14406d01dbeSwdenk
1459b707622SIlya Yanok #include "summary.h"
1469b707622SIlya Yanok
147700a0c64SWolfgang Denk /* keeps pointer to currentlu processed partition */
148700a0c64SWolfgang Denk static struct part_info *current_part;
149998eaaecSwdenk
150e4dbe1b2SWolfgang Denk #if (defined(CONFIG_JFFS2_NAND) && \
151dd60d122SJon Loeliger defined(CONFIG_CMD_NAND) )
152addb2e16SBartlomiej Sieka #include <nand.h>
153998eaaecSwdenk /*
154998eaaecSwdenk * Support for jffs2 on top of NAND-flash
155998eaaecSwdenk *
156998eaaecSwdenk * NAND memory isn't mapped in processor's address space,
157998eaaecSwdenk * so data should be fetched from flash before
158998eaaecSwdenk * being processed. This is exactly what functions declared
159998eaaecSwdenk * here do.
160998eaaecSwdenk *
161998eaaecSwdenk */
162998eaaecSwdenk
163998eaaecSwdenk #define NAND_PAGE_SIZE 512
164998eaaecSwdenk #define NAND_PAGE_SHIFT 9
165998eaaecSwdenk #define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
166998eaaecSwdenk
167998eaaecSwdenk #ifndef NAND_CACHE_PAGES
168998eaaecSwdenk #define NAND_CACHE_PAGES 16
169998eaaecSwdenk #endif
170998eaaecSwdenk #define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
171998eaaecSwdenk
172998eaaecSwdenk static u8* nand_cache = NULL;
173998eaaecSwdenk static u32 nand_cache_off = (u32)-1;
174998eaaecSwdenk
read_nand_cached(u32 off,u32 size,u_char * buf)175998eaaecSwdenk static int read_nand_cached(u32 off, u32 size, u_char *buf)
176998eaaecSwdenk {
177700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id;
178eb6a5c3cSGrygorii Strashko struct mtd_info *mtd;
179998eaaecSwdenk u32 bytes_read = 0;
1806db39708SMarian Balakowicz size_t retlen;
181998eaaecSwdenk int cpy_bytes;
182998eaaecSwdenk
183eb6a5c3cSGrygorii Strashko mtd = get_nand_dev_by_index(id->num);
184eb6a5c3cSGrygorii Strashko if (!mtd)
185eb6a5c3cSGrygorii Strashko return -1;
186eb6a5c3cSGrygorii Strashko
187998eaaecSwdenk while (bytes_read < size) {
188998eaaecSwdenk if ((off + bytes_read < nand_cache_off) ||
189998eaaecSwdenk (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
190998eaaecSwdenk nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
191998eaaecSwdenk if (!nand_cache) {
192998eaaecSwdenk /* This memory never gets freed but 'cause
193998eaaecSwdenk it's a bootloader, nobody cares */
194998eaaecSwdenk nand_cache = malloc(NAND_CACHE_SIZE);
195998eaaecSwdenk if (!nand_cache) {
196998eaaecSwdenk printf("read_nand_cached: can't alloc cache size %d bytes\n",
197998eaaecSwdenk NAND_CACHE_SIZE);
198998eaaecSwdenk return -1;
199998eaaecSwdenk }
200998eaaecSwdenk }
201addb2e16SBartlomiej Sieka
202addb2e16SBartlomiej Sieka retlen = NAND_CACHE_SIZE;
203eb6a5c3cSGrygorii Strashko if (nand_read(mtd, nand_cache_off,
204*41ba7f52SEngling, Uwe &retlen, nand_cache) < 0 ||
205998eaaecSwdenk retlen != NAND_CACHE_SIZE) {
206998eaaecSwdenk printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
207998eaaecSwdenk nand_cache_off, NAND_CACHE_SIZE);
208998eaaecSwdenk return -1;
209998eaaecSwdenk }
210998eaaecSwdenk }
211998eaaecSwdenk cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
212998eaaecSwdenk if (cpy_bytes > size - bytes_read)
213998eaaecSwdenk cpy_bytes = size - bytes_read;
214998eaaecSwdenk memcpy(buf + bytes_read,
215998eaaecSwdenk nand_cache + off + bytes_read - nand_cache_off,
216998eaaecSwdenk cpy_bytes);
217998eaaecSwdenk bytes_read += cpy_bytes;
218998eaaecSwdenk }
219998eaaecSwdenk return bytes_read;
220998eaaecSwdenk }
221998eaaecSwdenk
get_fl_mem_nand(u32 off,u32 size,void * ext_buf)222700a0c64SWolfgang Denk static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
223998eaaecSwdenk {
224998eaaecSwdenk u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
225998eaaecSwdenk
226998eaaecSwdenk if (NULL == buf) {
227700a0c64SWolfgang Denk printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
228998eaaecSwdenk return NULL;
229998eaaecSwdenk }
230998eaaecSwdenk if (read_nand_cached(off, size, buf) < 0) {
23132877d66Swdenk if (!ext_buf)
232998eaaecSwdenk free(buf);
233998eaaecSwdenk return NULL;
234998eaaecSwdenk }
235998eaaecSwdenk
236998eaaecSwdenk return buf;
237998eaaecSwdenk }
238998eaaecSwdenk
get_node_mem_nand(u32 off,void * ext_buf)23970741004SIlya Yanok static void *get_node_mem_nand(u32 off, void *ext_buf)
240998eaaecSwdenk {
241998eaaecSwdenk struct jffs2_unknown_node node;
242998eaaecSwdenk void *ret = NULL;
243998eaaecSwdenk
244700a0c64SWolfgang Denk if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
245998eaaecSwdenk return NULL;
246998eaaecSwdenk
247700a0c64SWolfgang Denk if (!(ret = get_fl_mem_nand(off, node.magic ==
248998eaaecSwdenk JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
24970741004SIlya Yanok ext_buf))) {
250998eaaecSwdenk printf("off = %#x magic %#x type %#x node.totlen = %d\n",
251998eaaecSwdenk off, node.magic, node.nodetype, node.totlen);
252998eaaecSwdenk }
253998eaaecSwdenk return ret;
254998eaaecSwdenk }
255998eaaecSwdenk
put_fl_mem_nand(void * buf)256700a0c64SWolfgang Denk static void put_fl_mem_nand(void *buf)
257998eaaecSwdenk {
258998eaaecSwdenk free(buf);
259998eaaecSwdenk }
260dd60d122SJon Loeliger #endif
261998eaaecSwdenk
2621a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND)
2631a7f8cceSKyungmin Park
2641a7f8cceSKyungmin Park #include <linux/mtd/mtd.h>
2651a7f8cceSKyungmin Park #include <linux/mtd/onenand.h>
2661a7f8cceSKyungmin Park #include <onenand_uboot.h>
2671a7f8cceSKyungmin Park
2681a7f8cceSKyungmin Park #define ONENAND_PAGE_SIZE 2048
2691a7f8cceSKyungmin Park #define ONENAND_PAGE_SHIFT 11
2701a7f8cceSKyungmin Park #define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
2711a7f8cceSKyungmin Park
2721a7f8cceSKyungmin Park #ifndef ONENAND_CACHE_PAGES
2731a7f8cceSKyungmin Park #define ONENAND_CACHE_PAGES 4
2741a7f8cceSKyungmin Park #endif
2751a7f8cceSKyungmin Park #define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
2761a7f8cceSKyungmin Park
2771a7f8cceSKyungmin Park static u8* onenand_cache;
2781a7f8cceSKyungmin Park static u32 onenand_cache_off = (u32)-1;
2791a7f8cceSKyungmin Park
read_onenand_cached(u32 off,u32 size,u_char * buf)2801a7f8cceSKyungmin Park static int read_onenand_cached(u32 off, u32 size, u_char *buf)
2811a7f8cceSKyungmin Park {
2821a7f8cceSKyungmin Park u32 bytes_read = 0;
2831a7f8cceSKyungmin Park size_t retlen;
2841a7f8cceSKyungmin Park int cpy_bytes;
2851a7f8cceSKyungmin Park
2861a7f8cceSKyungmin Park while (bytes_read < size) {
2871a7f8cceSKyungmin Park if ((off + bytes_read < onenand_cache_off) ||
2881a7f8cceSKyungmin Park (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
2891a7f8cceSKyungmin Park onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
2901a7f8cceSKyungmin Park if (!onenand_cache) {
2911a7f8cceSKyungmin Park /* This memory never gets freed but 'cause
2921a7f8cceSKyungmin Park it's a bootloader, nobody cares */
2931a7f8cceSKyungmin Park onenand_cache = malloc(ONENAND_CACHE_SIZE);
2941a7f8cceSKyungmin Park if (!onenand_cache) {
2951a7f8cceSKyungmin Park printf("read_onenand_cached: can't alloc cache size %d bytes\n",
2961a7f8cceSKyungmin Park ONENAND_CACHE_SIZE);
2971a7f8cceSKyungmin Park return -1;
2981a7f8cceSKyungmin Park }
2991a7f8cceSKyungmin Park }
3001a7f8cceSKyungmin Park
3011a7f8cceSKyungmin Park retlen = ONENAND_CACHE_SIZE;
3021a7f8cceSKyungmin Park if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
303*41ba7f52SEngling, Uwe &retlen, onenand_cache) < 0 ||
3041a7f8cceSKyungmin Park retlen != ONENAND_CACHE_SIZE) {
3051a7f8cceSKyungmin Park printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
3061a7f8cceSKyungmin Park onenand_cache_off, ONENAND_CACHE_SIZE);
3071a7f8cceSKyungmin Park return -1;
3081a7f8cceSKyungmin Park }
3091a7f8cceSKyungmin Park }
3101a7f8cceSKyungmin Park cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
3111a7f8cceSKyungmin Park if (cpy_bytes > size - bytes_read)
3121a7f8cceSKyungmin Park cpy_bytes = size - bytes_read;
3131a7f8cceSKyungmin Park memcpy(buf + bytes_read,
3141a7f8cceSKyungmin Park onenand_cache + off + bytes_read - onenand_cache_off,
3151a7f8cceSKyungmin Park cpy_bytes);
3161a7f8cceSKyungmin Park bytes_read += cpy_bytes;
3171a7f8cceSKyungmin Park }
3181a7f8cceSKyungmin Park return bytes_read;
3191a7f8cceSKyungmin Park }
3201a7f8cceSKyungmin Park
get_fl_mem_onenand(u32 off,u32 size,void * ext_buf)3211a7f8cceSKyungmin Park static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
3221a7f8cceSKyungmin Park {
3231a7f8cceSKyungmin Park u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
3241a7f8cceSKyungmin Park
3251a7f8cceSKyungmin Park if (NULL == buf) {
3261a7f8cceSKyungmin Park printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
3271a7f8cceSKyungmin Park return NULL;
3281a7f8cceSKyungmin Park }
3291a7f8cceSKyungmin Park if (read_onenand_cached(off, size, buf) < 0) {
3301a7f8cceSKyungmin Park if (!ext_buf)
3311a7f8cceSKyungmin Park free(buf);
3321a7f8cceSKyungmin Park return NULL;
3331a7f8cceSKyungmin Park }
3341a7f8cceSKyungmin Park
3351a7f8cceSKyungmin Park return buf;
3361a7f8cceSKyungmin Park }
3371a7f8cceSKyungmin Park
get_node_mem_onenand(u32 off,void * ext_buf)33870741004SIlya Yanok static void *get_node_mem_onenand(u32 off, void *ext_buf)
3391a7f8cceSKyungmin Park {
3401a7f8cceSKyungmin Park struct jffs2_unknown_node node;
3411a7f8cceSKyungmin Park void *ret = NULL;
3421a7f8cceSKyungmin Park
3431a7f8cceSKyungmin Park if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
3441a7f8cceSKyungmin Park return NULL;
3451a7f8cceSKyungmin Park
3461a7f8cceSKyungmin Park ret = get_fl_mem_onenand(off, node.magic ==
3471a7f8cceSKyungmin Park JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
34870741004SIlya Yanok ext_buf);
3491a7f8cceSKyungmin Park if (!ret) {
3501a7f8cceSKyungmin Park printf("off = %#x magic %#x type %#x node.totlen = %d\n",
3511a7f8cceSKyungmin Park off, node.magic, node.nodetype, node.totlen);
3521a7f8cceSKyungmin Park }
3531a7f8cceSKyungmin Park return ret;
3541a7f8cceSKyungmin Park }
3551a7f8cceSKyungmin Park
3561a7f8cceSKyungmin Park
put_fl_mem_onenand(void * buf)3571a7f8cceSKyungmin Park static void put_fl_mem_onenand(void *buf)
3581a7f8cceSKyungmin Park {
3591a7f8cceSKyungmin Park free(buf);
3601a7f8cceSKyungmin Park }
3611a7f8cceSKyungmin Park #endif
3621a7f8cceSKyungmin Park
363998eaaecSwdenk
364dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH)
365700a0c64SWolfgang Denk /*
366700a0c64SWolfgang Denk * Support for jffs2 on top of NOR-flash
367700a0c64SWolfgang Denk *
368700a0c64SWolfgang Denk * NOR flash memory is mapped in processor's address space,
369700a0c64SWolfgang Denk * just return address.
370700a0c64SWolfgang Denk */
get_fl_mem_nor(u32 off,u32 size,void * ext_buf)37170741004SIlya Yanok static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
372700a0c64SWolfgang Denk {
373700a0c64SWolfgang Denk u32 addr = off;
374700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id;
375700a0c64SWolfgang Denk
376e6f2e902SMarian Balakowicz extern flash_info_t flash_info[];
377700a0c64SWolfgang Denk flash_info_t *flash = &flash_info[id->num];
378700a0c64SWolfgang Denk
379700a0c64SWolfgang Denk addr += flash->start[0];
38070741004SIlya Yanok if (ext_buf) {
38170741004SIlya Yanok memcpy(ext_buf, (void *)addr, size);
38270741004SIlya Yanok return ext_buf;
38370741004SIlya Yanok }
384700a0c64SWolfgang Denk return (void*)addr;
385700a0c64SWolfgang Denk }
386700a0c64SWolfgang Denk
get_node_mem_nor(u32 off,void * ext_buf)38770741004SIlya Yanok static inline void *get_node_mem_nor(u32 off, void *ext_buf)
3888a36d31fSIlya Yanok {
38970741004SIlya Yanok struct jffs2_unknown_node *pNode;
3908a36d31fSIlya Yanok
39170741004SIlya Yanok /* pNode will point directly to flash - don't provide external buffer
39270741004SIlya Yanok and don't care about size */
39370741004SIlya Yanok pNode = get_fl_mem_nor(off, 0, NULL);
39470741004SIlya Yanok return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
39570741004SIlya Yanok pNode->totlen : sizeof(*pNode), ext_buf);
396700a0c64SWolfgang Denk }
397dd60d122SJon Loeliger #endif
398700a0c64SWolfgang Denk
399700a0c64SWolfgang Denk
400700a0c64SWolfgang Denk /*
401700a0c64SWolfgang Denk * Generic jffs2 raw memory and node read routines.
402700a0c64SWolfgang Denk *
403700a0c64SWolfgang Denk */
get_fl_mem(u32 off,u32 size,void * ext_buf)404998eaaecSwdenk static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
405998eaaecSwdenk {
406700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id;
407700a0c64SWolfgang Denk
4082d2018f3SHeiko Schocher switch(id->type) {
409dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH)
4102d2018f3SHeiko Schocher case MTD_DEV_TYPE_NOR:
41170741004SIlya Yanok return get_fl_mem_nor(off, size, ext_buf);
4122d2018f3SHeiko Schocher break;
413700a0c64SWolfgang Denk #endif
414dd60d122SJon Loeliger #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
4152d2018f3SHeiko Schocher case MTD_DEV_TYPE_NAND:
416700a0c64SWolfgang Denk return get_fl_mem_nand(off, size, ext_buf);
4172d2018f3SHeiko Schocher break;
418700a0c64SWolfgang Denk #endif
4191a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND)
4202d2018f3SHeiko Schocher case MTD_DEV_TYPE_ONENAND:
4211a7f8cceSKyungmin Park return get_fl_mem_onenand(off, size, ext_buf);
4222d2018f3SHeiko Schocher break;
4231a7f8cceSKyungmin Park #endif
4242d2018f3SHeiko Schocher default:
4252d2018f3SHeiko Schocher printf("get_fl_mem: unknown device type, " \
4262d2018f3SHeiko Schocher "using raw offset!\n");
4272d2018f3SHeiko Schocher }
428998eaaecSwdenk return (void*)off;
429998eaaecSwdenk }
430998eaaecSwdenk
get_node_mem(u32 off,void * ext_buf)43170741004SIlya Yanok static inline void *get_node_mem(u32 off, void *ext_buf)
432998eaaecSwdenk {
433700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id;
434700a0c64SWolfgang Denk
4352d2018f3SHeiko Schocher switch(id->type) {
436dd60d122SJon Loeliger #if defined(CONFIG_CMD_FLASH)
4372d2018f3SHeiko Schocher case MTD_DEV_TYPE_NOR:
43870741004SIlya Yanok return get_node_mem_nor(off, ext_buf);
4392d2018f3SHeiko Schocher break;
440700a0c64SWolfgang Denk #endif
441e4dbe1b2SWolfgang Denk #if defined(CONFIG_JFFS2_NAND) && \
442dd60d122SJon Loeliger defined(CONFIG_CMD_NAND)
4432d2018f3SHeiko Schocher case MTD_DEV_TYPE_NAND:
44470741004SIlya Yanok return get_node_mem_nand(off, ext_buf);
4452d2018f3SHeiko Schocher break;
446700a0c64SWolfgang Denk #endif
4471a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND)
4482d2018f3SHeiko Schocher case MTD_DEV_TYPE_ONENAND:
44970741004SIlya Yanok return get_node_mem_onenand(off, ext_buf);
4502d2018f3SHeiko Schocher break;
4511a7f8cceSKyungmin Park #endif
4522d2018f3SHeiko Schocher default:
4532d2018f3SHeiko Schocher printf("get_fl_mem: unknown device type, " \
4542d2018f3SHeiko Schocher "using raw offset!\n");
4552d2018f3SHeiko Schocher }
456998eaaecSwdenk return (void*)off;
457998eaaecSwdenk }
458998eaaecSwdenk
put_fl_mem(void * buf,void * ext_buf)45970741004SIlya Yanok static inline void put_fl_mem(void *buf, void *ext_buf)
460998eaaecSwdenk {
461700a0c64SWolfgang Denk struct mtdids *id = current_part->dev->id;
462700a0c64SWolfgang Denk
46370741004SIlya Yanok /* If buf is the same as ext_buf, it was provided by the caller -
46470741004SIlya Yanok we shouldn't free it then. */
46570741004SIlya Yanok if (buf == ext_buf)
46670741004SIlya Yanok return;
4672f77c7f4SScott Wood switch (id->type) {
4682f77c7f4SScott Wood #if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
4692f77c7f4SScott Wood case MTD_DEV_TYPE_NAND:
470700a0c64SWolfgang Denk return put_fl_mem_nand(buf);
471700a0c64SWolfgang Denk #endif
4721a7f8cceSKyungmin Park #if defined(CONFIG_CMD_ONENAND)
4732f77c7f4SScott Wood case MTD_DEV_TYPE_ONENAND:
4741a7f8cceSKyungmin Park return put_fl_mem_onenand(buf);
4751a7f8cceSKyungmin Park #endif
476998eaaecSwdenk }
4772f77c7f4SScott Wood }
478998eaaecSwdenk
479fe8c2806Swdenk /* Compression names */
480fe8c2806Swdenk static char *compr_names[] = {
481fe8c2806Swdenk "NONE",
482fe8c2806Swdenk "ZERO",
483fe8c2806Swdenk "RTIME",
484fe8c2806Swdenk "RUBINMIPS",
485fe8c2806Swdenk "COPY",
486fe8c2806Swdenk "DYNRUBIN",
48707cc0999Swdenk "ZLIB",
488f0983371SWolfgang Denk #if defined(CONFIG_JFFS2_LZO)
48907cc0999Swdenk "LZO",
49007cc0999Swdenk #endif
49106d01dbeSwdenk };
492fe8c2806Swdenk
49306d01dbeSwdenk /* Memory management */
49406d01dbeSwdenk struct mem_block {
49506d01dbeSwdenk u32 index;
49606d01dbeSwdenk struct mem_block *next;
49706d01dbeSwdenk struct b_node nodes[NODE_CHUNK];
49806d01dbeSwdenk };
499fe8c2806Swdenk
500fe8c2806Swdenk
50106d01dbeSwdenk static void
free_nodes(struct b_list * list)50206d01dbeSwdenk free_nodes(struct b_list *list)
50306d01dbeSwdenk {
50406d01dbeSwdenk while (list->listMemBase != NULL) {
50506d01dbeSwdenk struct mem_block *next = list->listMemBase->next;
50606d01dbeSwdenk free( list->listMemBase );
50706d01dbeSwdenk list->listMemBase = next;
50806d01dbeSwdenk }
50906d01dbeSwdenk }
510fe8c2806Swdenk
511fe8c2806Swdenk static struct b_node *
add_node(struct b_list * list)51206d01dbeSwdenk add_node(struct b_list *list)
513fe8c2806Swdenk {
51406d01dbeSwdenk u32 index = 0;
51506d01dbeSwdenk struct mem_block *memBase;
516fe8c2806Swdenk struct b_node *b;
517fe8c2806Swdenk
51806d01dbeSwdenk memBase = list->listMemBase;
51906d01dbeSwdenk if (memBase != NULL)
52006d01dbeSwdenk index = memBase->index;
521fe8c2806Swdenk #if 0
522fe8c2806Swdenk putLabeledWord("add_node: index = ", index);
52306d01dbeSwdenk putLabeledWord("add_node: memBase = ", list->listMemBase);
524fe8c2806Swdenk #endif
525fe8c2806Swdenk
52606d01dbeSwdenk if (memBase == NULL || index >= NODE_CHUNK) {
52706d01dbeSwdenk /* we need more space before we continue */
52806d01dbeSwdenk memBase = mmalloc(sizeof(struct mem_block));
52906d01dbeSwdenk if (memBase == NULL) {
530fe8c2806Swdenk putstr("add_node: malloc failed\n");
531fe8c2806Swdenk return NULL;
532fe8c2806Swdenk }
53306d01dbeSwdenk memBase->next = list->listMemBase;
53406d01dbeSwdenk index = 0;
535fe8c2806Swdenk #if 0
536fe8c2806Swdenk putLabeledWord("add_node: alloced a new membase at ", *memBase);
537fe8c2806Swdenk #endif
538fe8c2806Swdenk
539fe8c2806Swdenk }
540fe8c2806Swdenk /* now we have room to add it. */
54106d01dbeSwdenk b = &memBase->nodes[index];
54206d01dbeSwdenk index ++;
543fe8c2806Swdenk
54406d01dbeSwdenk memBase->index = index;
54506d01dbeSwdenk list->listMemBase = memBase;
54606d01dbeSwdenk list->listCount++;
547fe8c2806Swdenk return b;
548fe8c2806Swdenk }
549fe8c2806Swdenk
55006d01dbeSwdenk static struct b_node *
insert_node(struct b_list * list,u32 offset)55106d01dbeSwdenk insert_node(struct b_list *list, u32 offset)
55206d01dbeSwdenk {
55306d01dbeSwdenk struct b_node *new;
55406d01dbeSwdenk
55506d01dbeSwdenk if (!(new = add_node(list))) {
55606d01dbeSwdenk putstr("add_node failed!\r\n");
55706d01dbeSwdenk return NULL;
55806d01dbeSwdenk }
55906d01dbeSwdenk new->offset = offset;
56010d3ac34SMark Tomlinson new->next = NULL;
56106d01dbeSwdenk
56210d3ac34SMark Tomlinson if (list->listTail != NULL)
56310d3ac34SMark Tomlinson list->listTail->next = new;
56406d01dbeSwdenk else
56506d01dbeSwdenk list->listHead = new;
56606d01dbeSwdenk list->listTail = new;
56706d01dbeSwdenk
56806d01dbeSwdenk return new;
56906d01dbeSwdenk }
57006d01dbeSwdenk
5716d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
5727205e407Swdenk /* Sort data entries with the latest version last, so that if there
5737205e407Swdenk * is overlapping data the latest version will be used.
5747205e407Swdenk */
compare_inodes(struct b_node * new,struct b_node * old)57506d01dbeSwdenk static int compare_inodes(struct b_node *new, struct b_node *old)
57606d01dbeSwdenk {
577225cf4cdSMark Tomlinson /*
578225cf4cdSMark Tomlinson * Only read in the version info from flash, not the entire inode.
579225cf4cdSMark Tomlinson * This can make a big difference to speed if flash is slow.
580225cf4cdSMark Tomlinson */
581225cf4cdSMark Tomlinson u32 new_version;
582225cf4cdSMark Tomlinson u32 old_version;
583225cf4cdSMark Tomlinson get_fl_mem(new->offset + offsetof(struct jffs2_raw_inode, version),
584225cf4cdSMark Tomlinson sizeof(new_version), &new_version);
585225cf4cdSMark Tomlinson get_fl_mem(old->offset + offsetof(struct jffs2_raw_inode, version),
586225cf4cdSMark Tomlinson sizeof(old_version), &old_version);
58706d01dbeSwdenk
588225cf4cdSMark Tomlinson return new_version > old_version;
58906d01dbeSwdenk }
59006d01dbeSwdenk
5917205e407Swdenk /* Sort directory entries so all entries in the same directory
5927205e407Swdenk * with the same name are grouped together, with the latest version
5937205e407Swdenk * last. This makes it easy to eliminate all but the latest version
5947205e407Swdenk * by marking the previous version dead by setting the inode to 0.
5957205e407Swdenk */
compare_dirents(struct b_node * new,struct b_node * old)59606d01dbeSwdenk static int compare_dirents(struct b_node *new, struct b_node *old)
59706d01dbeSwdenk {
598225cf4cdSMark Tomlinson /*
599225cf4cdSMark Tomlinson * Using NULL as the buffer for NOR flash prevents the entire node
600225cf4cdSMark Tomlinson * being read. This makes most comparisons much quicker as only one
601225cf4cdSMark Tomlinson * or two entries from the node will be used most of the time.
602225cf4cdSMark Tomlinson */
603225cf4cdSMark Tomlinson struct jffs2_raw_dirent *jNew = get_node_mem(new->offset, NULL);
604225cf4cdSMark Tomlinson struct jffs2_raw_dirent *jOld = get_node_mem(old->offset, NULL);
6057205e407Swdenk int cmp;
606225cf4cdSMark Tomlinson int ret;
60706d01dbeSwdenk
608225cf4cdSMark Tomlinson if (jNew->pino != jOld->pino) {
6097205e407Swdenk /* ascending sort by pino */
610225cf4cdSMark Tomlinson ret = jNew->pino > jOld->pino;
611225cf4cdSMark Tomlinson } else if (jNew->nsize != jOld->nsize) {
612225cf4cdSMark Tomlinson /*
613225cf4cdSMark Tomlinson * pino is the same, so use ascending sort by nsize,
614225cf4cdSMark Tomlinson * so we don't do strncmp unless we really must.
6157205e407Swdenk */
616225cf4cdSMark Tomlinson ret = jNew->nsize > jOld->nsize;
617225cf4cdSMark Tomlinson } else {
618225cf4cdSMark Tomlinson /*
619225cf4cdSMark Tomlinson * length is also the same, so use ascending sort by name
6207205e407Swdenk */
621225cf4cdSMark Tomlinson cmp = strncmp((char *)jNew->name, (char *)jOld->name,
622225cf4cdSMark Tomlinson jNew->nsize);
623225cf4cdSMark Tomlinson if (cmp != 0) {
624225cf4cdSMark Tomlinson ret = cmp > 0;
625225cf4cdSMark Tomlinson } else {
626225cf4cdSMark Tomlinson /*
627225cf4cdSMark Tomlinson * we have duplicate names in this directory,
628225cf4cdSMark Tomlinson * so use ascending sort by version
6297205e407Swdenk */
630225cf4cdSMark Tomlinson ret = jNew->version > jOld->version;
6317205e407Swdenk }
632225cf4cdSMark Tomlinson }
633225cf4cdSMark Tomlinson put_fl_mem(jNew, NULL);
634225cf4cdSMark Tomlinson put_fl_mem(jOld, NULL);
6357205e407Swdenk
636225cf4cdSMark Tomlinson return ret;
63706d01dbeSwdenk }
63806d01dbeSwdenk #endif
639fe8c2806Swdenk
640700a0c64SWolfgang Denk void
jffs2_free_cache(struct part_info * part)641700a0c64SWolfgang Denk jffs2_free_cache(struct part_info *part)
642fe8c2806Swdenk {
64306d01dbeSwdenk struct b_lists *pL;
644fe8c2806Swdenk
64506d01dbeSwdenk if (part->jffs2_priv != NULL) {
64606d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv;
64706d01dbeSwdenk free_nodes(&pL->frag);
64806d01dbeSwdenk free_nodes(&pL->dir);
64970741004SIlya Yanok free(pL->readbuf);
65006d01dbeSwdenk free(pL);
65106d01dbeSwdenk }
652700a0c64SWolfgang Denk }
653700a0c64SWolfgang Denk
654700a0c64SWolfgang Denk static u32
jffs_init_1pass_list(struct part_info * part)655700a0c64SWolfgang Denk jffs_init_1pass_list(struct part_info *part)
656700a0c64SWolfgang Denk {
657700a0c64SWolfgang Denk struct b_lists *pL;
658700a0c64SWolfgang Denk
659700a0c64SWolfgang Denk jffs2_free_cache(part);
660700a0c64SWolfgang Denk
66106d01dbeSwdenk if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
66206d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv;
66306d01dbeSwdenk
66406d01dbeSwdenk memset(pL, 0, sizeof(*pL));
6656d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
66606d01dbeSwdenk pL->dir.listCompare = compare_dirents;
66706d01dbeSwdenk pL->frag.listCompare = compare_inodes;
66806d01dbeSwdenk #endif
669fe8c2806Swdenk }
670fe8c2806Swdenk return 0;
671fe8c2806Swdenk }
672fe8c2806Swdenk
673fe8c2806Swdenk /* find the inode from the slashless name given a parent */
674fe8c2806Swdenk static long
jffs2_1pass_read_inode(struct b_lists * pL,u32 inode,char * dest)675fe8c2806Swdenk jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
676fe8c2806Swdenk {
677fe8c2806Swdenk struct b_node *b;
678fe8c2806Swdenk struct jffs2_raw_inode *jNode;
67906d01dbeSwdenk u32 totalSize = 0;
6807205e407Swdenk u32 latestVersion = 0;
68177ddac94SWolfgang Denk uchar *lDest;
68277ddac94SWolfgang Denk uchar *src;
683fe8c2806Swdenk int i;
684fe8c2806Swdenk u32 counter = 0;
6856d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
6867205e407Swdenk /* Find file size before loading any data, so fragments that
6877205e407Swdenk * start past the end of file can be ignored. A fragment
6887205e407Swdenk * that is partially in the file is loaded, so extra data may
6897205e407Swdenk * be loaded up to the next 4K boundary above the file size.
6907205e407Swdenk * This shouldn't cause trouble when loading kernel images, so
6917205e407Swdenk * we will live with it.
6927205e407Swdenk */
6937205e407Swdenk for (b = pL->frag.listHead; b != NULL; b = b->next) {
694998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
69570741004SIlya Yanok sizeof(struct jffs2_raw_inode), pL->readbuf);
6967205e407Swdenk if ((inode == jNode->ino)) {
6977205e407Swdenk /* get actual file length from the newest node */
6987205e407Swdenk if (jNode->version >= latestVersion) {
6997205e407Swdenk totalSize = jNode->isize;
7007205e407Swdenk latestVersion = jNode->version;
7017205e407Swdenk }
7027205e407Swdenk }
70370741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
7047205e407Swdenk }
7053799b3f4SMark Tomlinson /*
7063799b3f4SMark Tomlinson * If no destination is provided, we are done.
7073799b3f4SMark Tomlinson * Just return the total size.
7083799b3f4SMark Tomlinson */
7093799b3f4SMark Tomlinson if (!dest)
7103799b3f4SMark Tomlinson return totalSize;
7117205e407Swdenk #endif
712fe8c2806Swdenk
71306d01dbeSwdenk for (b = pL->frag.listHead; b != NULL; b = b->next) {
7142d6d93a2SMark Tomlinson /*
7152d6d93a2SMark Tomlinson * Copy just the node and not the data at this point,
7162d6d93a2SMark Tomlinson * since we don't yet know if we need this data.
7172d6d93a2SMark Tomlinson */
7182d6d93a2SMark Tomlinson jNode = (struct jffs2_raw_inode *)get_fl_mem(b->offset,
7192d6d93a2SMark Tomlinson sizeof(struct jffs2_raw_inode),
72070741004SIlya Yanok pL->readbuf);
72146f46fd4SJeroen Hofstee if (inode == jNode->ino) {
72206d01dbeSwdenk #if 0
723fe8c2806Swdenk putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
724fe8c2806Swdenk putLabeledWord("read_inode: inode = ", jNode->ino);
725fe8c2806Swdenk putLabeledWord("read_inode: version = ", jNode->version);
726fe8c2806Swdenk putLabeledWord("read_inode: isize = ", jNode->isize);
727fe8c2806Swdenk putLabeledWord("read_inode: offset = ", jNode->offset);
728fe8c2806Swdenk putLabeledWord("read_inode: csize = ", jNode->csize);
729fe8c2806Swdenk putLabeledWord("read_inode: dsize = ", jNode->dsize);
730fe8c2806Swdenk putLabeledWord("read_inode: compr = ", jNode->compr);
731fe8c2806Swdenk putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
732fe8c2806Swdenk putLabeledWord("read_inode: flags = ", jNode->flags);
733fe8c2806Swdenk #endif
7347205e407Swdenk
7356d0f6bcfSJean-Christophe PLAGNIOL-VILLARD #ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
73606d01dbeSwdenk /* get actual file length from the newest node */
73706d01dbeSwdenk if (jNode->version >= latestVersion) {
738fe8c2806Swdenk totalSize = jNode->isize;
73906d01dbeSwdenk latestVersion = jNode->version;
740fe8c2806Swdenk }
7417205e407Swdenk #endif
742fe8c2806Swdenk
743fe8c2806Swdenk if(dest) {
7442d6d93a2SMark Tomlinson /*
7452d6d93a2SMark Tomlinson * Now that the inode has been checked,
7462d6d93a2SMark Tomlinson * read the entire inode, including data.
7472d6d93a2SMark Tomlinson */
7482d6d93a2SMark Tomlinson put_fl_mem(jNode, pL->readbuf);
7492d6d93a2SMark Tomlinson jNode = (struct jffs2_raw_inode *)
7502d6d93a2SMark Tomlinson get_node_mem(b->offset, pL->readbuf);
7512d6d93a2SMark Tomlinson src = ((uchar *)jNode) +
7522d6d93a2SMark Tomlinson sizeof(struct jffs2_raw_inode);
75306d01dbeSwdenk /* ignore data behind latest known EOF */
754998eaaecSwdenk if (jNode->offset > totalSize) {
75570741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
75606d01dbeSwdenk continue;
757998eaaecSwdenk }
758142a80ffSIlya Yanok if (b->datacrc == CRC_UNKNOWN)
759142a80ffSIlya Yanok b->datacrc = data_crc(jNode) ?
760142a80ffSIlya Yanok CRC_OK : CRC_BAD;
761142a80ffSIlya Yanok if (b->datacrc == CRC_BAD) {
76270741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
7638a36d31fSIlya Yanok continue;
7648a36d31fSIlya Yanok }
76506d01dbeSwdenk
76677ddac94SWolfgang Denk lDest = (uchar *) (dest + jNode->offset);
767fe8c2806Swdenk #if 0
76806d01dbeSwdenk putLabeledWord("read_inode: src = ", src);
769fe8c2806Swdenk putLabeledWord("read_inode: dest = ", lDest);
770fe8c2806Swdenk #endif
771fe8c2806Swdenk switch (jNode->compr) {
772fe8c2806Swdenk case JFFS2_COMPR_NONE:
77316b9afd2SWolfgang Denk ldr_memcpy(lDest, src, jNode->dsize);
774fe8c2806Swdenk break;
775fe8c2806Swdenk case JFFS2_COMPR_ZERO:
776fe8c2806Swdenk for (i = 0; i < jNode->dsize; i++)
777fe8c2806Swdenk *(lDest++) = 0;
778fe8c2806Swdenk break;
779fe8c2806Swdenk case JFFS2_COMPR_RTIME:
780fe8c2806Swdenk rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
781fe8c2806Swdenk break;
782fe8c2806Swdenk case JFFS2_COMPR_DYNRUBIN:
783fe8c2806Swdenk /* this is slow but it works */
784fe8c2806Swdenk dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
785fe8c2806Swdenk break;
786fe8c2806Swdenk case JFFS2_COMPR_ZLIB:
78716b9afd2SWolfgang Denk zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
788fe8c2806Swdenk break;
789f0983371SWolfgang Denk #if defined(CONFIG_JFFS2_LZO)
79007cc0999Swdenk case JFFS2_COMPR_LZO:
79116b9afd2SWolfgang Denk lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
79207cc0999Swdenk break;
79307cc0999Swdenk #endif
794fe8c2806Swdenk default:
795fe8c2806Swdenk /* unknown */
7966052cbabSLoïc Minier putLabeledWord("UNKNOWN COMPRESSION METHOD = ", jNode->compr);
79770741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
798fe8c2806Swdenk return -1;
799fe8c2806Swdenk break;
800fe8c2806Swdenk }
801fe8c2806Swdenk }
802fe8c2806Swdenk
803fe8c2806Swdenk #if 0
804fe8c2806Swdenk putLabeledWord("read_inode: totalSize = ", totalSize);
805fe8c2806Swdenk #endif
806fe8c2806Swdenk }
807fe8c2806Swdenk counter++;
80870741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
809fe8c2806Swdenk }
810fe8c2806Swdenk
811fe8c2806Swdenk #if 0
81206d01dbeSwdenk putLabeledWord("read_inode: returning = ", totalSize);
813fe8c2806Swdenk #endif
81406d01dbeSwdenk return totalSize;
815fe8c2806Swdenk }
816fe8c2806Swdenk
817fe8c2806Swdenk /* find the inode from the slashless name given a parent */
818fe8c2806Swdenk static u32
jffs2_1pass_find_inode(struct b_lists * pL,const char * name,u32 pino)819fe8c2806Swdenk jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
820fe8c2806Swdenk {
821fe8c2806Swdenk struct b_node *b;
822fe8c2806Swdenk struct jffs2_raw_dirent *jDir;
823fe8c2806Swdenk int len;
824fe8c2806Swdenk u32 counter;
825fe8c2806Swdenk u32 version = 0;
826fe8c2806Swdenk u32 inode = 0;
827fe8c2806Swdenk
828fe8c2806Swdenk /* name is assumed slash free */
829fe8c2806Swdenk len = strlen(name);
830fe8c2806Swdenk
831fe8c2806Swdenk counter = 0;
832fe8c2806Swdenk /* we need to search all and return the inode with the highest version */
83306d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next, counter++) {
83470741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
83570741004SIlya Yanok pL->readbuf);
83606d01dbeSwdenk if ((pino == jDir->pino) && (len == jDir->nsize) &&
83777ddac94SWolfgang Denk (!strncmp((char *)jDir->name, name, len))) { /* a match */
838998eaaecSwdenk if (jDir->version < version) {
83970741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
8407205e407Swdenk continue;
841998eaaecSwdenk }
842fe8c2806Swdenk
8437205e407Swdenk if (jDir->version == version && inode != 0) {
8447205e407Swdenk /* I'm pretty sure this isn't legal */
845fe8c2806Swdenk putstr(" ** ERROR ** ");
846fe8c2806Swdenk putnstr(jDir->name, jDir->nsize);
847fe8c2806Swdenk putLabeledWord(" has dup version =", version);
848fe8c2806Swdenk }
849fe8c2806Swdenk inode = jDir->ino;
850fe8c2806Swdenk version = jDir->version;
851fe8c2806Swdenk }
852fe8c2806Swdenk #if 0
853fe8c2806Swdenk putstr("\r\nfind_inode:p&l ->");
854fe8c2806Swdenk putnstr(jDir->name, jDir->nsize);
855fe8c2806Swdenk putstr("\r\n");
856fe8c2806Swdenk putLabeledWord("pino = ", jDir->pino);
857fe8c2806Swdenk putLabeledWord("nsize = ", jDir->nsize);
858fe8c2806Swdenk putLabeledWord("b = ", (u32) b);
859fe8c2806Swdenk putLabeledWord("counter = ", counter);
860fe8c2806Swdenk #endif
86170741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
862fe8c2806Swdenk }
863fe8c2806Swdenk return inode;
864fe8c2806Swdenk }
865fe8c2806Swdenk
mkmodestr(unsigned long mode,char * str)866180d3f74Swdenk char *mkmodestr(unsigned long mode, char *str)
867fe8c2806Swdenk {
868fe8c2806Swdenk static const char *l = "xwr";
869fe8c2806Swdenk int mask = 1, i;
870fe8c2806Swdenk char c;
871fe8c2806Swdenk
872fe8c2806Swdenk switch (mode & S_IFMT) {
873fe8c2806Swdenk case S_IFDIR: str[0] = 'd'; break;
874fe8c2806Swdenk case S_IFBLK: str[0] = 'b'; break;
875fe8c2806Swdenk case S_IFCHR: str[0] = 'c'; break;
876fe8c2806Swdenk case S_IFIFO: str[0] = 'f'; break;
877fe8c2806Swdenk case S_IFLNK: str[0] = 'l'; break;
878fe8c2806Swdenk case S_IFSOCK: str[0] = 's'; break;
879fe8c2806Swdenk case S_IFREG: str[0] = '-'; break;
880fe8c2806Swdenk default: str[0] = '?';
881fe8c2806Swdenk }
882fe8c2806Swdenk
883fe8c2806Swdenk for(i = 0; i < 9; i++) {
884fe8c2806Swdenk c = l[i%3];
885fe8c2806Swdenk str[9-i] = (mode & mask)?c:'-';
886fe8c2806Swdenk mask = mask<<1;
887fe8c2806Swdenk }
888fe8c2806Swdenk
889fe8c2806Swdenk if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
890fe8c2806Swdenk if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
891fe8c2806Swdenk if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
892fe8c2806Swdenk str[10] = '\0';
893fe8c2806Swdenk return str;
894fe8c2806Swdenk }
895fe8c2806Swdenk
dump_stat(struct stat * st,const char * name)896fe8c2806Swdenk static inline void dump_stat(struct stat *st, const char *name)
897fe8c2806Swdenk {
898fe8c2806Swdenk char str[20];
899fe8c2806Swdenk char s[64], *p;
900fe8c2806Swdenk
901fe8c2806Swdenk if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
902fe8c2806Swdenk st->st_mtime = 1;
903fe8c2806Swdenk
90477ddac94SWolfgang Denk ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
905fe8c2806Swdenk
906fe8c2806Swdenk if ((p = strchr(s,'\n')) != NULL) *p = '\0';
907fe8c2806Swdenk if ((p = strchr(s,'\r')) != NULL) *p = '\0';
908fe8c2806Swdenk
909fe8c2806Swdenk /*
910fe8c2806Swdenk printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
911fe8c2806Swdenk st->st_size, s, name);
912fe8c2806Swdenk */
913fe8c2806Swdenk
914fe8c2806Swdenk printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
915fe8c2806Swdenk }
916fe8c2806Swdenk
dump_inode(struct b_lists * pL,struct jffs2_raw_dirent * d,struct jffs2_raw_inode * i)917fe8c2806Swdenk static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
918fe8c2806Swdenk {
919fe8c2806Swdenk char fname[256];
920fe8c2806Swdenk struct stat st;
921fe8c2806Swdenk
922fe8c2806Swdenk if(!d || !i) return -1;
923fe8c2806Swdenk
92477ddac94SWolfgang Denk strncpy(fname, (char *)d->name, d->nsize);
925fe8c2806Swdenk fname[d->nsize] = '\0';
926fe8c2806Swdenk
927fe8c2806Swdenk memset(&st,0,sizeof(st));
928fe8c2806Swdenk
929fe8c2806Swdenk st.st_mtime = i->mtime;
930fe8c2806Swdenk st.st_mode = i->mode;
931fe8c2806Swdenk st.st_ino = i->ino;
932f7384695SIlya Yanok st.st_size = i->isize;
933fe8c2806Swdenk
934fe8c2806Swdenk dump_stat(&st, fname);
935fe8c2806Swdenk
936fe8c2806Swdenk if (d->type == DT_LNK) {
937fe8c2806Swdenk unsigned char *src = (unsigned char *) (&i[1]);
938fe8c2806Swdenk putstr(" -> ");
939fe8c2806Swdenk putnstr(src, (int)i->dsize);
940fe8c2806Swdenk }
941fe8c2806Swdenk
942fe8c2806Swdenk putstr("\r\n");
943fe8c2806Swdenk
944fe8c2806Swdenk return 0;
945fe8c2806Swdenk }
946fe8c2806Swdenk
947fe8c2806Swdenk /* list inodes with the given pino */
948fe8c2806Swdenk static u32
jffs2_1pass_list_inodes(struct b_lists * pL,u32 pino)949fe8c2806Swdenk jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
950fe8c2806Swdenk {
951fe8c2806Swdenk struct b_node *b;
952fe8c2806Swdenk struct jffs2_raw_dirent *jDir;
953fe8c2806Swdenk
95406d01dbeSwdenk for (b = pL->dir.listHead; b; b = b->next) {
95570741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
95670741004SIlya Yanok pL->readbuf);
957891224a5SMark Tomlinson if (pino == jDir->pino) {
958fe8c2806Swdenk u32 i_version = 0;
959fe8c2806Swdenk struct jffs2_raw_inode *jNode, *i = NULL;
960891224a5SMark Tomlinson struct b_node *b2;
961fe8c2806Swdenk
962891224a5SMark Tomlinson #ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
963891224a5SMark Tomlinson /* Check for more recent versions of this file */
964891224a5SMark Tomlinson int match;
965891224a5SMark Tomlinson do {
966891224a5SMark Tomlinson struct b_node *next = b->next;
967891224a5SMark Tomlinson struct jffs2_raw_dirent *jDirNext;
968891224a5SMark Tomlinson if (!next)
969891224a5SMark Tomlinson break;
970891224a5SMark Tomlinson jDirNext = (struct jffs2_raw_dirent *)
971891224a5SMark Tomlinson get_node_mem(next->offset, NULL);
972891224a5SMark Tomlinson match = jDirNext->pino == jDir->pino &&
973891224a5SMark Tomlinson jDirNext->nsize == jDir->nsize &&
974891224a5SMark Tomlinson strncmp((char *)jDirNext->name,
975891224a5SMark Tomlinson (char *)jDir->name,
976891224a5SMark Tomlinson jDir->nsize) == 0;
977891224a5SMark Tomlinson if (match) {
978891224a5SMark Tomlinson /* Use next. It is more recent */
979891224a5SMark Tomlinson b = next;
980891224a5SMark Tomlinson /* Update buffer with the new info */
981891224a5SMark Tomlinson *jDir = *jDirNext;
982891224a5SMark Tomlinson }
983891224a5SMark Tomlinson put_fl_mem(jDirNext, NULL);
984891224a5SMark Tomlinson } while (match);
985891224a5SMark Tomlinson #endif
986891224a5SMark Tomlinson if (jDir->ino == 0) {
987891224a5SMark Tomlinson /* Deleted file */
988891224a5SMark Tomlinson put_fl_mem(jDir, pL->readbuf);
989891224a5SMark Tomlinson continue;
990891224a5SMark Tomlinson }
991891224a5SMark Tomlinson
992891224a5SMark Tomlinson for (b2 = pL->frag.listHead; b2; b2 = b2->next) {
993998eaaecSwdenk jNode = (struct jffs2_raw_inode *)
9942d6d93a2SMark Tomlinson get_fl_mem(b2->offset, sizeof(*jNode),
9952d6d93a2SMark Tomlinson NULL);
9962d6d93a2SMark Tomlinson if (jNode->ino == jDir->ino &&
9972d6d93a2SMark Tomlinson jNode->version >= i_version) {
998f7384695SIlya Yanok i_version = jNode->version;
99932877d66Swdenk if (i)
100070741004SIlya Yanok put_fl_mem(i, NULL);
1001cf8bc577Swdenk
1002cf8bc577Swdenk if (jDir->type == DT_LNK)
100370741004SIlya Yanok i = get_node_mem(b2->offset,
100470741004SIlya Yanok NULL);
1005cf8bc577Swdenk else
100670741004SIlya Yanok i = get_fl_mem(b2->offset,
100770741004SIlya Yanok sizeof(*i),
100870741004SIlya Yanok NULL);
100932877d66Swdenk }
10102d6d93a2SMark Tomlinson put_fl_mem(jNode, NULL);
1011fe8c2806Swdenk }
1012fe8c2806Swdenk
1013fe8c2806Swdenk dump_inode(pL, jDir, i);
101470741004SIlya Yanok put_fl_mem(i, NULL);
1015fe8c2806Swdenk }
101670741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
1017fe8c2806Swdenk }
1018fe8c2806Swdenk return pino;
1019fe8c2806Swdenk }
1020fe8c2806Swdenk
1021fe8c2806Swdenk static u32
jffs2_1pass_search_inode(struct b_lists * pL,const char * fname,u32 pino)1022fe8c2806Swdenk jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
1023fe8c2806Swdenk {
1024fe8c2806Swdenk int i;
1025fe8c2806Swdenk char tmp[256];
1026fe8c2806Swdenk char working_tmp[256];
1027fe8c2806Swdenk char *c;
1028fe8c2806Swdenk
1029fe8c2806Swdenk /* discard any leading slash */
1030fe8c2806Swdenk i = 0;
1031fe8c2806Swdenk while (fname[i] == '/')
1032fe8c2806Swdenk i++;
1033fe8c2806Swdenk strcpy(tmp, &fname[i]);
1034fe8c2806Swdenk
1035fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1036fe8c2806Swdenk {
1037fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp);
1038fe8c2806Swdenk working_tmp[c - tmp] = '\0';
1039fe8c2806Swdenk #if 0
1040fe8c2806Swdenk putstr("search_inode: tmp = ");
1041fe8c2806Swdenk putstr(tmp);
1042fe8c2806Swdenk putstr("\r\n");
1043fe8c2806Swdenk putstr("search_inode: wtmp = ");
1044fe8c2806Swdenk putstr(working_tmp);
1045fe8c2806Swdenk putstr("\r\n");
1046fe8c2806Swdenk putstr("search_inode: c = ");
1047fe8c2806Swdenk putstr(c);
1048fe8c2806Swdenk putstr("\r\n");
1049fe8c2806Swdenk #endif
1050fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++)
1051fe8c2806Swdenk tmp[i] = c[i + 1];
1052fe8c2806Swdenk tmp[i] = '\0';
1053fe8c2806Swdenk #if 0
1054fe8c2806Swdenk putstr("search_inode: post tmp = ");
1055fe8c2806Swdenk putstr(tmp);
1056fe8c2806Swdenk putstr("\r\n");
1057fe8c2806Swdenk #endif
1058fe8c2806Swdenk
1059fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1060fe8c2806Swdenk putstr("find_inode failed for name=");
1061fe8c2806Swdenk putstr(working_tmp);
1062fe8c2806Swdenk putstr("\r\n");
1063fe8c2806Swdenk return 0;
1064fe8c2806Swdenk }
1065fe8c2806Swdenk }
1066fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */
1067fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1068fe8c2806Swdenk putstr("find_inode failed for name=");
1069fe8c2806Swdenk putstr(tmp);
1070fe8c2806Swdenk putstr("\r\n");
1071fe8c2806Swdenk return 0;
1072fe8c2806Swdenk }
1073fe8c2806Swdenk return pino;
1074fe8c2806Swdenk
1075fe8c2806Swdenk }
1076fe8c2806Swdenk
1077fe8c2806Swdenk static u32
jffs2_1pass_resolve_inode(struct b_lists * pL,u32 ino)1078fe8c2806Swdenk jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1079fe8c2806Swdenk {
1080fe8c2806Swdenk struct b_node *b;
1081fe8c2806Swdenk struct b_node *b2;
1082fe8c2806Swdenk struct jffs2_raw_dirent *jDir;
1083fe8c2806Swdenk struct jffs2_raw_inode *jNode;
1084998eaaecSwdenk u8 jDirFoundType = 0;
1085998eaaecSwdenk u32 jDirFoundIno = 0;
1086998eaaecSwdenk u32 jDirFoundPino = 0;
1087fe8c2806Swdenk char tmp[256];
1088fe8c2806Swdenk u32 version = 0;
1089fe8c2806Swdenk u32 pino;
1090fe8c2806Swdenk unsigned char *src;
1091fe8c2806Swdenk
1092fe8c2806Swdenk /* we need to search all and return the inode with the highest version */
109306d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next) {
109470741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
109570741004SIlya Yanok pL->readbuf);
1096fe8c2806Swdenk if (ino == jDir->ino) {
1097998eaaecSwdenk if (jDir->version < version) {
109870741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
10997205e407Swdenk continue;
1100998eaaecSwdenk }
1101fe8c2806Swdenk
1102998eaaecSwdenk if (jDir->version == version && jDirFoundType) {
11037205e407Swdenk /* I'm pretty sure this isn't legal */
1104fe8c2806Swdenk putstr(" ** ERROR ** ");
1105fe8c2806Swdenk putnstr(jDir->name, jDir->nsize);
1106fe8c2806Swdenk putLabeledWord(" has dup version (resolve) = ",
1107fe8c2806Swdenk version);
1108fe8c2806Swdenk }
1109fe8c2806Swdenk
1110998eaaecSwdenk jDirFoundType = jDir->type;
1111998eaaecSwdenk jDirFoundIno = jDir->ino;
1112998eaaecSwdenk jDirFoundPino = jDir->pino;
1113fe8c2806Swdenk version = jDir->version;
1114fe8c2806Swdenk }
111570741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
1116fe8c2806Swdenk }
1117fe8c2806Swdenk /* now we found the right entry again. (shoulda returned inode*) */
1118998eaaecSwdenk if (jDirFoundType != DT_LNK)
1119998eaaecSwdenk return jDirFoundIno;
112006d01dbeSwdenk
112106d01dbeSwdenk /* it's a soft link so we follow it again. */
112206d01dbeSwdenk b2 = pL->frag.listHead;
1123fe8c2806Swdenk while (b2) {
112470741004SIlya Yanok jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
112570741004SIlya Yanok pL->readbuf);
1126998eaaecSwdenk if (jNode->ino == jDirFoundIno) {
11272729af9dSwdenk src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
1128fe8c2806Swdenk
1129fe8c2806Swdenk #if 0
1130fe8c2806Swdenk putLabeledWord("\t\t dsize = ", jNode->dsize);
1131fe8c2806Swdenk putstr("\t\t target = ");
1132fe8c2806Swdenk putnstr(src, jNode->dsize);
1133fe8c2806Swdenk putstr("\r\n");
1134fe8c2806Swdenk #endif
113577ddac94SWolfgang Denk strncpy(tmp, (char *)src, jNode->dsize);
1136fe8c2806Swdenk tmp[jNode->dsize] = '\0';
113770741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
1138fe8c2806Swdenk break;
1139fe8c2806Swdenk }
1140fe8c2806Swdenk b2 = b2->next;
114170741004SIlya Yanok put_fl_mem(jNode, pL->readbuf);
1142fe8c2806Swdenk }
1143fe8c2806Swdenk /* ok so the name of the new file to find is in tmp */
1144fe8c2806Swdenk /* if it starts with a slash it is root based else shared dirs */
1145fe8c2806Swdenk if (tmp[0] == '/')
1146fe8c2806Swdenk pino = 1;
1147fe8c2806Swdenk else
1148998eaaecSwdenk pino = jDirFoundPino;
1149fe8c2806Swdenk
1150fe8c2806Swdenk return jffs2_1pass_search_inode(pL, tmp, pino);
1151fe8c2806Swdenk }
1152fe8c2806Swdenk
1153fe8c2806Swdenk static u32
jffs2_1pass_search_list_inodes(struct b_lists * pL,const char * fname,u32 pino)1154fe8c2806Swdenk jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1155fe8c2806Swdenk {
1156fe8c2806Swdenk int i;
1157fe8c2806Swdenk char tmp[256];
1158fe8c2806Swdenk char working_tmp[256];
1159fe8c2806Swdenk char *c;
1160fe8c2806Swdenk
1161fe8c2806Swdenk /* discard any leading slash */
1162fe8c2806Swdenk i = 0;
1163fe8c2806Swdenk while (fname[i] == '/')
1164fe8c2806Swdenk i++;
1165fe8c2806Swdenk strcpy(tmp, &fname[i]);
1166fe8c2806Swdenk working_tmp[0] = '\0';
1167fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1168fe8c2806Swdenk {
1169fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp);
1170fe8c2806Swdenk working_tmp[c - tmp] = '\0';
1171fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++)
1172fe8c2806Swdenk tmp[i] = c[i + 1];
1173fe8c2806Swdenk tmp[i] = '\0';
1174fe8c2806Swdenk /* only a failure if we arent looking at top level */
117506d01dbeSwdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
117606d01dbeSwdenk (working_tmp[0])) {
1177fe8c2806Swdenk putstr("find_inode failed for name=");
1178fe8c2806Swdenk putstr(working_tmp);
1179fe8c2806Swdenk putstr("\r\n");
1180fe8c2806Swdenk return 0;
1181fe8c2806Swdenk }
1182fe8c2806Swdenk }
1183fe8c2806Swdenk
1184fe8c2806Swdenk if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1185fe8c2806Swdenk putstr("find_inode failed for name=");
1186fe8c2806Swdenk putstr(tmp);
1187fe8c2806Swdenk putstr("\r\n");
1188fe8c2806Swdenk return 0;
1189fe8c2806Swdenk }
1190fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */
1191fe8c2806Swdenk if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1192fe8c2806Swdenk putstr("find_inode failed for name=");
1193fe8c2806Swdenk putstr(tmp);
1194fe8c2806Swdenk putstr("\r\n");
1195fe8c2806Swdenk return 0;
1196fe8c2806Swdenk }
1197fe8c2806Swdenk return pino;
1198fe8c2806Swdenk
1199fe8c2806Swdenk }
1200fe8c2806Swdenk
1201fe8c2806Swdenk unsigned char
jffs2_1pass_rescan_needed(struct part_info * part)1202fe8c2806Swdenk jffs2_1pass_rescan_needed(struct part_info *part)
1203fe8c2806Swdenk {
1204fe8c2806Swdenk struct b_node *b;
1205998eaaecSwdenk struct jffs2_unknown_node onode;
1206fe8c2806Swdenk struct jffs2_unknown_node *node;
1207fe8c2806Swdenk struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
1208fe8c2806Swdenk
1209fe8c2806Swdenk if (part->jffs2_priv == 0){
1210fe8c2806Swdenk DEBUGF ("rescan: First time in use\n");
1211fe8c2806Swdenk return 1;
1212fe8c2806Swdenk }
1213700a0c64SWolfgang Denk
1214fe8c2806Swdenk /* if we have no list, we need to rescan */
121506d01dbeSwdenk if (pL->frag.listCount == 0) {
1216fe8c2806Swdenk DEBUGF ("rescan: fraglist zero\n");
1217fe8c2806Swdenk return 1;
1218fe8c2806Swdenk }
1219fe8c2806Swdenk
122006d01dbeSwdenk /* but suppose someone reflashed a partition at the same offset... */
122106d01dbeSwdenk b = pL->dir.listHead;
1222fe8c2806Swdenk while (b) {
1223998eaaecSwdenk node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1224998eaaecSwdenk sizeof(onode), &onode);
1225fe8c2806Swdenk if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
122606d01dbeSwdenk DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
122706d01dbeSwdenk (unsigned long) b->offset);
1228fe8c2806Swdenk return 1;
1229fe8c2806Swdenk }
1230fe8c2806Swdenk b = b->next;
1231fe8c2806Swdenk }
1232fe8c2806Swdenk return 0;
1233fe8c2806Swdenk }
1234fe8c2806Swdenk
12358cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY
sum_get_unaligned32(u32 * ptr)12368cf19b9fSIlya Yanok static u32 sum_get_unaligned32(u32 *ptr)
12378cf19b9fSIlya Yanok {
12388cf19b9fSIlya Yanok u32 val;
12398cf19b9fSIlya Yanok u8 *p = (u8 *)ptr;
12408cf19b9fSIlya Yanok
12418cf19b9fSIlya Yanok val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
12428cf19b9fSIlya Yanok
12438cf19b9fSIlya Yanok return __le32_to_cpu(val);
12448cf19b9fSIlya Yanok }
12458cf19b9fSIlya Yanok
sum_get_unaligned16(u16 * ptr)12468cf19b9fSIlya Yanok static u16 sum_get_unaligned16(u16 *ptr)
12478cf19b9fSIlya Yanok {
12488cf19b9fSIlya Yanok u16 val;
12498cf19b9fSIlya Yanok u8 *p = (u8 *)ptr;
12508cf19b9fSIlya Yanok
12518cf19b9fSIlya Yanok val = *p | (*(p + 1) << 8);
12528cf19b9fSIlya Yanok
12538cf19b9fSIlya Yanok return __le16_to_cpu(val);
12548cf19b9fSIlya Yanok }
12558cf19b9fSIlya Yanok
12569b707622SIlya Yanok #define dbg_summary(...) do {} while (0);
12578cf19b9fSIlya Yanok /*
12588cf19b9fSIlya Yanok * Process the stored summary information - helper function for
12599b707622SIlya Yanok * jffs2_sum_scan_sumnode()
12609b707622SIlya Yanok */
12619b707622SIlya Yanok
jffs2_sum_process_sum_data(struct part_info * part,uint32_t offset,struct jffs2_raw_summary * summary,struct b_lists * pL)12629b707622SIlya Yanok static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
12639b707622SIlya Yanok struct jffs2_raw_summary *summary,
12649b707622SIlya Yanok struct b_lists *pL)
12659b707622SIlya Yanok {
12669b707622SIlya Yanok void *sp;
12678cf19b9fSIlya Yanok int i, pass;
12688cf19b9fSIlya Yanok void *ret;
12699b707622SIlya Yanok
12708cf19b9fSIlya Yanok for (pass = 0; pass < 2; pass++) {
12719b707622SIlya Yanok sp = summary->sum;
12729b707622SIlya Yanok
12739b707622SIlya Yanok for (i = 0; i < summary->sum_num; i++) {
12748cf19b9fSIlya Yanok struct jffs2_sum_unknown_flash *spu = sp;
12759b707622SIlya Yanok dbg_summary("processing summary index %d\n", i);
12769b707622SIlya Yanok
12778cf19b9fSIlya Yanok switch (sum_get_unaligned16(&spu->nodetype)) {
12789b707622SIlya Yanok case JFFS2_NODETYPE_INODE: {
12799b707622SIlya Yanok struct jffs2_sum_inode_flash *spi;
12808cf19b9fSIlya Yanok if (pass) {
12819b707622SIlya Yanok spi = sp;
12829b707622SIlya Yanok
12838cf19b9fSIlya Yanok ret = insert_node(&pL->frag,
12848cf19b9fSIlya Yanok (u32)part->offset +
12858cf19b9fSIlya Yanok offset +
12868cf19b9fSIlya Yanok sum_get_unaligned32(
12878cf19b9fSIlya Yanok &spi->offset));
12888cf19b9fSIlya Yanok if (ret == NULL)
12899b707622SIlya Yanok return -1;
12908cf19b9fSIlya Yanok }
12919b707622SIlya Yanok
12929b707622SIlya Yanok sp += JFFS2_SUMMARY_INODE_SIZE;
12939b707622SIlya Yanok
12949b707622SIlya Yanok break;
12959b707622SIlya Yanok }
12969b707622SIlya Yanok case JFFS2_NODETYPE_DIRENT: {
12979b707622SIlya Yanok struct jffs2_sum_dirent_flash *spd;
12989b707622SIlya Yanok spd = sp;
12998cf19b9fSIlya Yanok if (pass) {
13008cf19b9fSIlya Yanok ret = insert_node(&pL->dir,
13018cf19b9fSIlya Yanok (u32) part->offset +
13028cf19b9fSIlya Yanok offset +
13038cf19b9fSIlya Yanok sum_get_unaligned32(
13048cf19b9fSIlya Yanok &spd->offset));
13058cf19b9fSIlya Yanok if (ret == NULL)
13069b707622SIlya Yanok return -1;
13078cf19b9fSIlya Yanok }
13089b707622SIlya Yanok
13098cf19b9fSIlya Yanok sp += JFFS2_SUMMARY_DIRENT_SIZE(
13108cf19b9fSIlya Yanok spd->nsize);
13119b707622SIlya Yanok
13129b707622SIlya Yanok break;
13139b707622SIlya Yanok }
13149b707622SIlya Yanok default : {
13158cf19b9fSIlya Yanok uint16_t nodetype = sum_get_unaligned16(
13168cf19b9fSIlya Yanok &spu->nodetype);
13178cf19b9fSIlya Yanok printf("Unsupported node type %x found"
13188cf19b9fSIlya Yanok " in summary!\n",
13198cf19b9fSIlya Yanok nodetype);
13208cf19b9fSIlya Yanok if ((nodetype & JFFS2_COMPAT_MASK) ==
13218cf19b9fSIlya Yanok JFFS2_FEATURE_INCOMPAT)
13228cf19b9fSIlya Yanok return -EIO;
13238cf19b9fSIlya Yanok return -EBADMSG;
13248cf19b9fSIlya Yanok }
13259b707622SIlya Yanok }
13269b707622SIlya Yanok }
13279b707622SIlya Yanok }
13289b707622SIlya Yanok return 0;
13299b707622SIlya Yanok }
13309b707622SIlya Yanok
13319b707622SIlya Yanok /* Process the summary node - called from jffs2_scan_eraseblock() */
jffs2_sum_scan_sumnode(struct part_info * part,uint32_t offset,struct jffs2_raw_summary * summary,uint32_t sumsize,struct b_lists * pL)13329b707622SIlya Yanok int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
13339b707622SIlya Yanok struct jffs2_raw_summary *summary, uint32_t sumsize,
13349b707622SIlya Yanok struct b_lists *pL)
13359b707622SIlya Yanok {
13369b707622SIlya Yanok struct jffs2_unknown_node crcnode;
13371c8fdf87STom Rini int ret, __maybe_unused ofs;
13389b707622SIlya Yanok uint32_t crc;
13399b707622SIlya Yanok
13409b707622SIlya Yanok ofs = part->sector_size - sumsize;
13419b707622SIlya Yanok
13429b707622SIlya Yanok dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
13439b707622SIlya Yanok offset, offset + ofs, sumsize);
13449b707622SIlya Yanok
13459b707622SIlya Yanok /* OK, now check for node validity and CRC */
13469b707622SIlya Yanok crcnode.magic = JFFS2_MAGIC_BITMASK;
13479b707622SIlya Yanok crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
13489b707622SIlya Yanok crcnode.totlen = summary->totlen;
13499b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
13509b707622SIlya Yanok
13519b707622SIlya Yanok if (summary->hdr_crc != crc) {
13529b707622SIlya Yanok dbg_summary("Summary node header is corrupt (bad CRC or "
13539b707622SIlya Yanok "no summary at all)\n");
13549b707622SIlya Yanok goto crc_err;
13559b707622SIlya Yanok }
13569b707622SIlya Yanok
13579b707622SIlya Yanok if (summary->totlen != sumsize) {
13589b707622SIlya Yanok dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
13599b707622SIlya Yanok goto crc_err;
13609b707622SIlya Yanok }
13619b707622SIlya Yanok
13629b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)summary,
13639b707622SIlya Yanok sizeof(struct jffs2_raw_summary)-8);
13649b707622SIlya Yanok
13659b707622SIlya Yanok if (summary->node_crc != crc) {
13669b707622SIlya Yanok dbg_summary("Summary node is corrupt (bad CRC)\n");
13679b707622SIlya Yanok goto crc_err;
13689b707622SIlya Yanok }
13699b707622SIlya Yanok
13709b707622SIlya Yanok crc = crc32_no_comp(0, (uchar *)summary->sum,
13719b707622SIlya Yanok sumsize - sizeof(struct jffs2_raw_summary));
13729b707622SIlya Yanok
13739b707622SIlya Yanok if (summary->sum_crc != crc) {
13749b707622SIlya Yanok dbg_summary("Summary node data is corrupt (bad CRC)\n");
13759b707622SIlya Yanok goto crc_err;
13769b707622SIlya Yanok }
13779b707622SIlya Yanok
13789b707622SIlya Yanok if (summary->cln_mkr)
13799b707622SIlya Yanok dbg_summary("Summary : CLEANMARKER node \n");
13809b707622SIlya Yanok
13819b707622SIlya Yanok ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
13828cf19b9fSIlya Yanok if (ret == -EBADMSG)
13838cf19b9fSIlya Yanok return 0;
13849b707622SIlya Yanok if (ret)
13859b707622SIlya Yanok return ret; /* real error */
13869b707622SIlya Yanok
13879b707622SIlya Yanok return 1;
13889b707622SIlya Yanok
13899b707622SIlya Yanok crc_err:
13909b707622SIlya Yanok putstr("Summary node crc error, skipping summary information.\n");
13919b707622SIlya Yanok
13929b707622SIlya Yanok return 0;
13939b707622SIlya Yanok }
13948cf19b9fSIlya Yanok #endif /* CONFIG_JFFS2_SUMMARY */
13959b707622SIlya Yanok
139606d01dbeSwdenk #ifdef DEBUG_FRAGMENTS
139706d01dbeSwdenk static void
dump_fragments(struct b_lists * pL)139806d01dbeSwdenk dump_fragments(struct b_lists *pL)
1399fe8c2806Swdenk {
1400fe8c2806Swdenk struct b_node *b;
1401998eaaecSwdenk struct jffs2_raw_inode ojNode;
1402fe8c2806Swdenk struct jffs2_raw_inode *jNode;
1403fe8c2806Swdenk
140406d01dbeSwdenk putstr("\r\n\r\n******The fragment Entries******\r\n");
140506d01dbeSwdenk b = pL->frag.listHead;
140606d01dbeSwdenk while (b) {
1407998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1408998eaaecSwdenk sizeof(ojNode), &ojNode);
140906d01dbeSwdenk putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
141006d01dbeSwdenk putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
141106d01dbeSwdenk putLabeledWord("\tbuild_list: inode = ", jNode->ino);
141206d01dbeSwdenk putLabeledWord("\tbuild_list: version = ", jNode->version);
141306d01dbeSwdenk putLabeledWord("\tbuild_list: isize = ", jNode->isize);
141406d01dbeSwdenk putLabeledWord("\tbuild_list: atime = ", jNode->atime);
141506d01dbeSwdenk putLabeledWord("\tbuild_list: offset = ", jNode->offset);
141606d01dbeSwdenk putLabeledWord("\tbuild_list: csize = ", jNode->csize);
141706d01dbeSwdenk putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
141806d01dbeSwdenk putLabeledWord("\tbuild_list: compr = ", jNode->compr);
141906d01dbeSwdenk putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
142006d01dbeSwdenk putLabeledWord("\tbuild_list: flags = ", jNode->flags);
14218bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
142206d01dbeSwdenk b = b->next;
142306d01dbeSwdenk }
142406d01dbeSwdenk }
142506d01dbeSwdenk #endif
142606d01dbeSwdenk
142706d01dbeSwdenk #ifdef DEBUG_DIRENTS
142806d01dbeSwdenk static void
dump_dirents(struct b_lists * pL)142906d01dbeSwdenk dump_dirents(struct b_lists *pL)
143006d01dbeSwdenk {
143106d01dbeSwdenk struct b_node *b;
143206d01dbeSwdenk struct jffs2_raw_dirent *jDir;
143306d01dbeSwdenk
1434fe8c2806Swdenk putstr("\r\n\r\n******The directory Entries******\r\n");
143506d01dbeSwdenk b = pL->dir.listHead;
1436fe8c2806Swdenk while (b) {
143770741004SIlya Yanok jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
143870741004SIlya Yanok pL->readbuf);
1439fe8c2806Swdenk putstr("\r\n");
1440fe8c2806Swdenk putnstr(jDir->name, jDir->nsize);
1441fe8c2806Swdenk putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1442fe8c2806Swdenk putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1443fe8c2806Swdenk putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1444fe8c2806Swdenk putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1445fe8c2806Swdenk putLabeledWord("\tbuild_list: version = ", jDir->version);
1446fe8c2806Swdenk putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1447fe8c2806Swdenk putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1448fe8c2806Swdenk putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1449fe8c2806Swdenk putLabeledWord("\tbuild_list: type = ", jDir->type);
1450fe8c2806Swdenk putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1451fe8c2806Swdenk putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
14528bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
1453fe8c2806Swdenk b = b->next;
145470741004SIlya Yanok put_fl_mem(jDir, pL->readbuf);
1455fe8c2806Swdenk }
1456fe8c2806Swdenk }
145706d01dbeSwdenk #endif
145806d01dbeSwdenk
1459081adef7SMark Tomlinson #define DEFAULT_EMPTY_SCAN_SIZE 256
14608a36d31fSIlya Yanok
EMPTY_SCAN_SIZE(uint32_t sector_size)14618a36d31fSIlya Yanok static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
14628a36d31fSIlya Yanok {
14638a36d31fSIlya Yanok if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
14648a36d31fSIlya Yanok return sector_size;
14658a36d31fSIlya Yanok else
14668a36d31fSIlya Yanok return DEFAULT_EMPTY_SCAN_SIZE;
14678a36d31fSIlya Yanok }
14688a36d31fSIlya Yanok
146906d01dbeSwdenk static u32
jffs2_1pass_build_lists(struct part_info * part)147006d01dbeSwdenk jffs2_1pass_build_lists(struct part_info * part)
147106d01dbeSwdenk {
147206d01dbeSwdenk struct b_lists *pL;
147306d01dbeSwdenk struct jffs2_unknown_node *node;
147418e86724STom Rini u32 nr_sectors;
14758a36d31fSIlya Yanok u32 i;
147606d01dbeSwdenk u32 counter4 = 0;
147706d01dbeSwdenk u32 counterF = 0;
147806d01dbeSwdenk u32 counterN = 0;
147970741004SIlya Yanok u32 max_totlen = 0;
1480c5b1940fSMark Tomlinson u32 buf_size;
14818a36d31fSIlya Yanok char *buf;
148206d01dbeSwdenk
148318e86724STom Rini nr_sectors = lldiv(part->size, part->sector_size);
148406d01dbeSwdenk /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
148506d01dbeSwdenk /* jffs2 list building enterprise nope. in newer versions the overhead is */
148606d01dbeSwdenk /* only about 5 %. not enough to inconvenience people for. */
148706d01dbeSwdenk /* lcd_off(); */
148806d01dbeSwdenk
148906d01dbeSwdenk /* if we are building a list we need to refresh the cache. */
149006d01dbeSwdenk jffs_init_1pass_list(part);
149106d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv;
1492c5b1940fSMark Tomlinson buf = malloc(DEFAULT_EMPTY_SCAN_SIZE);
14934b9206edSwdenk puts ("Scanning JFFS2 FS: ");
149406d01dbeSwdenk
149506d01dbeSwdenk /* start at the beginning of the partition */
14968a36d31fSIlya Yanok for (i = 0; i < nr_sectors; i++) {
14978a36d31fSIlya Yanok uint32_t sector_ofs = i * part->sector_size;
14988a36d31fSIlya Yanok uint32_t buf_ofs = sector_ofs;
14999b707622SIlya Yanok uint32_t buf_len;
15008a36d31fSIlya Yanok uint32_t ofs, prevofs;
15018cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY
15029b707622SIlya Yanok struct jffs2_sum_marker *sm;
15039b707622SIlya Yanok void *sumptr = NULL;
15049b707622SIlya Yanok uint32_t sumlen;
15059b707622SIlya Yanok int ret;
15068cf19b9fSIlya Yanok #endif
150754a88384SMark Tomlinson /* Indicates a sector with a CLEANMARKER was found */
150854a88384SMark Tomlinson int clean_sector = 0;
15090b8fa03bSwdenk
1510c5b1940fSMark Tomlinson /* Set buf_size to maximum length */
1511c5b1940fSMark Tomlinson buf_size = DEFAULT_EMPTY_SCAN_SIZE;
151286d3273eSStuart Wood WATCHDOG_RESET();
15139b707622SIlya Yanok
15148cf19b9fSIlya Yanok #ifdef CONFIG_JFFS2_SUMMARY
15159b707622SIlya Yanok buf_len = sizeof(*sm);
15169b707622SIlya Yanok
15179b707622SIlya Yanok /* Read as much as we want into the _end_ of the preallocated
15189b707622SIlya Yanok * buffer
15199b707622SIlya Yanok */
15209b707622SIlya Yanok get_fl_mem(part->offset + sector_ofs + part->sector_size -
15219b707622SIlya Yanok buf_len, buf_len, buf + buf_size - buf_len);
15229b707622SIlya Yanok
15239b707622SIlya Yanok sm = (void *)buf + buf_size - sizeof(*sm);
15249b707622SIlya Yanok if (sm->magic == JFFS2_SUM_MAGIC) {
15259b707622SIlya Yanok sumlen = part->sector_size - sm->offset;
15269b707622SIlya Yanok sumptr = buf + buf_size - sumlen;
15279b707622SIlya Yanok
15289b707622SIlya Yanok /* Now, make sure the summary itself is available */
15299b707622SIlya Yanok if (sumlen > buf_size) {
15309b707622SIlya Yanok /* Need to kmalloc for this. */
15319b707622SIlya Yanok sumptr = malloc(sumlen);
15329b707622SIlya Yanok if (!sumptr) {
15339b707622SIlya Yanok putstr("Can't get memory for summary "
15349b707622SIlya Yanok "node!\n");
1535b644006eSIlya Yanok free(buf);
1536b644006eSIlya Yanok jffs2_free_cache(part);
15379b707622SIlya Yanok return 0;
15389b707622SIlya Yanok }
15399b707622SIlya Yanok memcpy(sumptr + sumlen - buf_len, buf +
15409b707622SIlya Yanok buf_size - buf_len, buf_len);
15419b707622SIlya Yanok }
15429b707622SIlya Yanok if (buf_len < sumlen) {
15439b707622SIlya Yanok /* Need to read more so that the entire summary
15449b707622SIlya Yanok * node is present
15459b707622SIlya Yanok */
15469b707622SIlya Yanok get_fl_mem(part->offset + sector_ofs +
15479b707622SIlya Yanok part->sector_size - sumlen,
15489b707622SIlya Yanok sumlen - buf_len, sumptr);
15499b707622SIlya Yanok }
15509b707622SIlya Yanok }
15519b707622SIlya Yanok
15529b707622SIlya Yanok if (sumptr) {
15539b707622SIlya Yanok ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
15549b707622SIlya Yanok sumlen, pL);
15559b707622SIlya Yanok
15569b707622SIlya Yanok if (buf_size && sumlen > buf_size)
15579b707622SIlya Yanok free(sumptr);
1558b644006eSIlya Yanok if (ret < 0) {
1559b644006eSIlya Yanok free(buf);
1560b644006eSIlya Yanok jffs2_free_cache(part);
15619b707622SIlya Yanok return 0;
1562b644006eSIlya Yanok }
15639b707622SIlya Yanok if (ret)
15649b707622SIlya Yanok continue;
15659b707622SIlya Yanok
15669b707622SIlya Yanok }
15678cf19b9fSIlya Yanok #endif /* CONFIG_JFFS2_SUMMARY */
15689b707622SIlya Yanok
15699b707622SIlya Yanok buf_len = EMPTY_SCAN_SIZE(part->sector_size);
15709b707622SIlya Yanok
15718a36d31fSIlya Yanok get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
157286d3273eSStuart Wood
15738a36d31fSIlya Yanok /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
15748a36d31fSIlya Yanok ofs = 0;
15758a36d31fSIlya Yanok
15768a36d31fSIlya Yanok /* Scan only 4KiB of 0xFF before declaring it's empty */
15778a36d31fSIlya Yanok while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
15788a36d31fSIlya Yanok *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
15798a36d31fSIlya Yanok ofs += 4;
15808a36d31fSIlya Yanok
15818a36d31fSIlya Yanok if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
15828a36d31fSIlya Yanok continue;
15838a36d31fSIlya Yanok
15848a36d31fSIlya Yanok ofs += sector_ofs;
15858a36d31fSIlya Yanok prevofs = ofs - 1;
1586c5b1940fSMark Tomlinson /*
1587c5b1940fSMark Tomlinson * Set buf_size down to the minimum size required.
1588c5b1940fSMark Tomlinson * This prevents reading in chunks of flash data unnecessarily.
1589c5b1940fSMark Tomlinson */
1590c5b1940fSMark Tomlinson buf_size = sizeof(union jffs2_node_union);
15918a36d31fSIlya Yanok
15928a36d31fSIlya Yanok scan_more:
15938a36d31fSIlya Yanok while (ofs < sector_ofs + part->sector_size) {
15948a36d31fSIlya Yanok if (ofs == prevofs) {
15958a36d31fSIlya Yanok printf("offset %08x already seen, skip\n", ofs);
15968a36d31fSIlya Yanok ofs += 4;
15978a36d31fSIlya Yanok counter4++;
15988a36d31fSIlya Yanok continue;
1599998eaaecSwdenk }
16008a36d31fSIlya Yanok prevofs = ofs;
16018a36d31fSIlya Yanok if (sector_ofs + part->sector_size <
16028a36d31fSIlya Yanok ofs + sizeof(*node))
16038a36d31fSIlya Yanok break;
16048a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(*node)) {
16058a36d31fSIlya Yanok buf_len = min_t(uint32_t, buf_size, sector_ofs
16068a36d31fSIlya Yanok + part->sector_size - ofs);
16078a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, buf_len,
16088a36d31fSIlya Yanok buf);
16098a36d31fSIlya Yanok buf_ofs = ofs;
16108a36d31fSIlya Yanok }
16118a36d31fSIlya Yanok
16128a36d31fSIlya Yanok node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
16138a36d31fSIlya Yanok
16148a36d31fSIlya Yanok if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
16158a36d31fSIlya Yanok uint32_t inbuf_ofs;
161616b9afd2SWolfgang Denk uint32_t scan_end;
16178a36d31fSIlya Yanok
16188a36d31fSIlya Yanok ofs += 4;
16198a36d31fSIlya Yanok scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
16208a36d31fSIlya Yanok part->sector_size)/8,
16218a36d31fSIlya Yanok buf_len);
16228a36d31fSIlya Yanok more_empty:
16238a36d31fSIlya Yanok inbuf_ofs = ofs - buf_ofs;
16248a36d31fSIlya Yanok while (inbuf_ofs < scan_end) {
16258a36d31fSIlya Yanok if (*(uint32_t *)(&buf[inbuf_ofs]) !=
16268a36d31fSIlya Yanok 0xffffffff)
16278a36d31fSIlya Yanok goto scan_more;
16288a36d31fSIlya Yanok
16298a36d31fSIlya Yanok inbuf_ofs += 4;
16308a36d31fSIlya Yanok ofs += 4;
16318a36d31fSIlya Yanok }
16328a36d31fSIlya Yanok /* Ran off end. */
163354a88384SMark Tomlinson /*
163454a88384SMark Tomlinson * If this sector had a clean marker at the
163554a88384SMark Tomlinson * beginning, and immediately following this
163654a88384SMark Tomlinson * have been a bunch of FF bytes, treat the
163754a88384SMark Tomlinson * entire sector as empty.
163854a88384SMark Tomlinson */
163954a88384SMark Tomlinson if (clean_sector)
164054a88384SMark Tomlinson break;
16418a36d31fSIlya Yanok
16428a36d31fSIlya Yanok /* See how much more there is to read in this
16438a36d31fSIlya Yanok * eraseblock...
16448a36d31fSIlya Yanok */
16458a36d31fSIlya Yanok buf_len = min_t(uint32_t, buf_size,
16468a36d31fSIlya Yanok sector_ofs +
16478a36d31fSIlya Yanok part->sector_size - ofs);
16488a36d31fSIlya Yanok if (!buf_len) {
16498a36d31fSIlya Yanok /* No more to read. Break out of main
16508a36d31fSIlya Yanok * loop without marking this range of
16518a36d31fSIlya Yanok * empty space as dirty (because it's
16528a36d31fSIlya Yanok * not)
16538a36d31fSIlya Yanok */
16548a36d31fSIlya Yanok break;
16558a36d31fSIlya Yanok }
16568a36d31fSIlya Yanok scan_end = buf_len;
16578a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs, buf_len,
16588a36d31fSIlya Yanok buf);
16598a36d31fSIlya Yanok buf_ofs = ofs;
16608a36d31fSIlya Yanok goto more_empty;
16618a36d31fSIlya Yanok }
166254a88384SMark Tomlinson /*
166354a88384SMark Tomlinson * Found something not erased in the sector, so reset
166454a88384SMark Tomlinson * the 'clean_sector' flag.
166554a88384SMark Tomlinson */
166654a88384SMark Tomlinson clean_sector = 0;
16678a36d31fSIlya Yanok if (node->magic != JFFS2_MAGIC_BITMASK ||
16688a36d31fSIlya Yanok !hdr_crc(node)) {
16698a36d31fSIlya Yanok ofs += 4;
16708a36d31fSIlya Yanok counter4++;
16718a36d31fSIlya Yanok continue;
16728a36d31fSIlya Yanok }
16738a36d31fSIlya Yanok if (ofs + node->totlen >
16748a36d31fSIlya Yanok sector_ofs + part->sector_size) {
16758a36d31fSIlya Yanok ofs += 4;
16768a36d31fSIlya Yanok counter4++;
16778a36d31fSIlya Yanok continue;
16788a36d31fSIlya Yanok }
16798a36d31fSIlya Yanok /* if its a fragment add it */
16808a36d31fSIlya Yanok switch (node->nodetype) {
16818a36d31fSIlya Yanok case JFFS2_NODETYPE_INODE:
16828a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(struct
16838a36d31fSIlya Yanok jffs2_raw_inode)) {
1684c5b1940fSMark Tomlinson buf_len = min_t(uint32_t,
1685c5b1940fSMark Tomlinson sizeof(struct jffs2_raw_inode),
1686c5b1940fSMark Tomlinson sector_ofs +
1687c5b1940fSMark Tomlinson part->sector_size -
1688c5b1940fSMark Tomlinson ofs);
16898a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs,
16908a36d31fSIlya Yanok buf_len, buf);
16918a36d31fSIlya Yanok buf_ofs = ofs;
16928a36d31fSIlya Yanok node = (void *)buf;
16938a36d31fSIlya Yanok }
16948a36d31fSIlya Yanok if (!inode_crc((struct jffs2_raw_inode *)node))
16958a36d31fSIlya Yanok break;
16968a36d31fSIlya Yanok
16978a36d31fSIlya Yanok if (insert_node(&pL->frag, (u32) part->offset +
1698b644006eSIlya Yanok ofs) == NULL) {
1699b644006eSIlya Yanok free(buf);
1700b644006eSIlya Yanok jffs2_free_cache(part);
17018a36d31fSIlya Yanok return 0;
1702b644006eSIlya Yanok }
170370741004SIlya Yanok if (max_totlen < node->totlen)
170470741004SIlya Yanok max_totlen = node->totlen;
17058a36d31fSIlya Yanok break;
17068a36d31fSIlya Yanok case JFFS2_NODETYPE_DIRENT:
17078a36d31fSIlya Yanok if (buf_ofs + buf_len < ofs + sizeof(struct
17088a36d31fSIlya Yanok jffs2_raw_dirent) +
17098a36d31fSIlya Yanok ((struct
17108a36d31fSIlya Yanok jffs2_raw_dirent *)
17118a36d31fSIlya Yanok node)->nsize) {
1712c5b1940fSMark Tomlinson buf_len = min_t(uint32_t,
1713c5b1940fSMark Tomlinson node->totlen,
1714c5b1940fSMark Tomlinson sector_ofs +
1715c5b1940fSMark Tomlinson part->sector_size -
1716c5b1940fSMark Tomlinson ofs);
17178a36d31fSIlya Yanok get_fl_mem((u32)part->offset + ofs,
17188a36d31fSIlya Yanok buf_len, buf);
17198a36d31fSIlya Yanok buf_ofs = ofs;
17208a36d31fSIlya Yanok node = (void *)buf;
17218a36d31fSIlya Yanok }
17228a36d31fSIlya Yanok
17238a36d31fSIlya Yanok if (!dirent_crc((struct jffs2_raw_dirent *)
17248a36d31fSIlya Yanok node) ||
17258a36d31fSIlya Yanok !dirent_name_crc(
17268a36d31fSIlya Yanok (struct
17278a36d31fSIlya Yanok jffs2_raw_dirent *)
17288a36d31fSIlya Yanok node))
17298a36d31fSIlya Yanok break;
1730fc1cfcdbSwdenk if (! (counterN%100))
17314b9206edSwdenk puts ("\b\b. ");
173206d01dbeSwdenk if (insert_node(&pL->dir, (u32) part->offset +
1733b644006eSIlya Yanok ofs) == NULL) {
1734b644006eSIlya Yanok free(buf);
1735b644006eSIlya Yanok jffs2_free_cache(part);
173606d01dbeSwdenk return 0;
1737b644006eSIlya Yanok }
173870741004SIlya Yanok if (max_totlen < node->totlen)
173970741004SIlya Yanok max_totlen = node->totlen;
174006d01dbeSwdenk counterN++;
17418a36d31fSIlya Yanok break;
17428a36d31fSIlya Yanok case JFFS2_NODETYPE_CLEANMARKER:
174306d01dbeSwdenk if (node->totlen != sizeof(struct jffs2_unknown_node))
174406d01dbeSwdenk printf("OOPS Cleanmarker has bad size "
1745b64f190bSWolfgang Denk "%d != %zu\n",
1746b64f190bSWolfgang Denk node->totlen,
174706d01dbeSwdenk sizeof(struct jffs2_unknown_node));
174854a88384SMark Tomlinson if ((node->totlen ==
174954a88384SMark Tomlinson sizeof(struct jffs2_unknown_node)) &&
175054a88384SMark Tomlinson (ofs == sector_ofs)) {
175154a88384SMark Tomlinson /*
175254a88384SMark Tomlinson * Found a CLEANMARKER at the beginning
175354a88384SMark Tomlinson * of the sector. It's in the correct
175454a88384SMark Tomlinson * place with correct size and CRC.
175554a88384SMark Tomlinson */
175654a88384SMark Tomlinson clean_sector = 1;
175754a88384SMark Tomlinson }
17588a36d31fSIlya Yanok break;
17598a36d31fSIlya Yanok case JFFS2_NODETYPE_PADDING:
17607205e407Swdenk if (node->totlen < sizeof(struct jffs2_unknown_node))
17617205e407Swdenk printf("OOPS Padding has bad size "
1762b64f190bSWolfgang Denk "%d < %zu\n",
1763b64f190bSWolfgang Denk node->totlen,
17647205e407Swdenk sizeof(struct jffs2_unknown_node));
17658a36d31fSIlya Yanok break;
17669b707622SIlya Yanok case JFFS2_NODETYPE_SUMMARY:
17679b707622SIlya Yanok break;
17688a36d31fSIlya Yanok default:
1769b64f190bSWolfgang Denk printf("Unknown node type: %x len %d offset 0x%x\n",
1770b64f190bSWolfgang Denk node->nodetype,
17718a36d31fSIlya Yanok node->totlen, ofs);
177206d01dbeSwdenk }
17738a36d31fSIlya Yanok ofs += ((node->totlen + 3) & ~3);
177406d01dbeSwdenk counterF++;
177506d01dbeSwdenk }
177606d01dbeSwdenk }
177706d01dbeSwdenk
17788a36d31fSIlya Yanok free(buf);
177910d3ac34SMark Tomlinson #if defined(CONFIG_SYS_JFFS2_SORT_FRAGMENTS)
178010d3ac34SMark Tomlinson /*
178110d3ac34SMark Tomlinson * Sort the lists.
178210d3ac34SMark Tomlinson */
178310d3ac34SMark Tomlinson sort_list(&pL->frag);
178410d3ac34SMark Tomlinson sort_list(&pL->dir);
178510d3ac34SMark Tomlinson #endif
178606d01dbeSwdenk putstr("\b\b done.\r\n"); /* close off the dots */
178770741004SIlya Yanok
178870741004SIlya Yanok /* We don't care if malloc failed - then each read operation will
178970741004SIlya Yanok * allocate its own buffer as necessary (NAND) or will read directly
179070741004SIlya Yanok * from flash (NOR).
179170741004SIlya Yanok */
179270741004SIlya Yanok pL->readbuf = malloc(max_totlen);
179370741004SIlya Yanok
179406d01dbeSwdenk /* turn the lcd back on. */
179506d01dbeSwdenk /* splash(); */
179606d01dbeSwdenk
179706d01dbeSwdenk #if 0
179806d01dbeSwdenk putLabeledWord("dir entries = ", pL->dir.listCount);
179906d01dbeSwdenk putLabeledWord("frag entries = ", pL->frag.listCount);
180006d01dbeSwdenk putLabeledWord("+4 increments = ", counter4);
180106d01dbeSwdenk putLabeledWord("+file_offset increments = ", counterF);
180206d01dbeSwdenk
180306d01dbeSwdenk #endif
180406d01dbeSwdenk
180506d01dbeSwdenk #ifdef DEBUG_DIRENTS
180606d01dbeSwdenk dump_dirents(pL);
180706d01dbeSwdenk #endif
180806d01dbeSwdenk
180906d01dbeSwdenk #ifdef DEBUG_FRAGMENTS
181006d01dbeSwdenk dump_fragments(pL);
181106d01dbeSwdenk #endif
181206d01dbeSwdenk
1813fe8c2806Swdenk /* give visual feedback that we are done scanning the flash */
1814fe8c2806Swdenk led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1815fe8c2806Swdenk return 1;
1816fe8c2806Swdenk }
1817fe8c2806Swdenk
1818fe8c2806Swdenk
1819fe8c2806Swdenk static u32
jffs2_1pass_fill_info(struct b_lists * pL,struct b_jffs2_info * piL)1820fe8c2806Swdenk jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1821fe8c2806Swdenk {
1822fe8c2806Swdenk struct b_node *b;
1823998eaaecSwdenk struct jffs2_raw_inode ojNode;
1824fe8c2806Swdenk struct jffs2_raw_inode *jNode;
1825fe8c2806Swdenk int i;
1826fe8c2806Swdenk
1827fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1828fe8c2806Swdenk piL->compr_info[i].num_frags = 0;
1829fe8c2806Swdenk piL->compr_info[i].compr_sum = 0;
1830fe8c2806Swdenk piL->compr_info[i].decompr_sum = 0;
1831fe8c2806Swdenk }
1832fe8c2806Swdenk
183306d01dbeSwdenk b = pL->frag.listHead;
1834fe8c2806Swdenk while (b) {
1835998eaaecSwdenk jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1836998eaaecSwdenk sizeof(ojNode), &ojNode);
1837fe8c2806Swdenk if (jNode->compr < JFFS2_NUM_COMPR) {
1838fe8c2806Swdenk piL->compr_info[jNode->compr].num_frags++;
1839fe8c2806Swdenk piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1840fe8c2806Swdenk piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1841fe8c2806Swdenk }
1842fe8c2806Swdenk b = b->next;
1843fe8c2806Swdenk }
1844fe8c2806Swdenk return 0;
1845fe8c2806Swdenk }
1846fe8c2806Swdenk
1847fe8c2806Swdenk
1848fe8c2806Swdenk static struct b_lists *
jffs2_get_list(struct part_info * part,const char * who)1849fe8c2806Swdenk jffs2_get_list(struct part_info * part, const char *who)
1850fe8c2806Swdenk {
1851700a0c64SWolfgang Denk /* copy requested part_info struct pointer to global location */
1852700a0c64SWolfgang Denk current_part = part;
1853700a0c64SWolfgang Denk
1854fe8c2806Swdenk if (jffs2_1pass_rescan_needed(part)) {
1855fe8c2806Swdenk if (!jffs2_1pass_build_lists(part)) {
1856fe8c2806Swdenk printf("%s: Failed to scan JFFSv2 file structure\n", who);
1857fe8c2806Swdenk return NULL;
1858fe8c2806Swdenk }
1859fe8c2806Swdenk }
1860fe8c2806Swdenk return (struct b_lists *)part->jffs2_priv;
1861fe8c2806Swdenk }
1862fe8c2806Swdenk
1863fe8c2806Swdenk
1864fe8c2806Swdenk /* Print directory / file contents */
1865fe8c2806Swdenk u32
jffs2_1pass_ls(struct part_info * part,const char * fname)1866fe8c2806Swdenk jffs2_1pass_ls(struct part_info * part, const char *fname)
1867fe8c2806Swdenk {
1868fe8c2806Swdenk struct b_lists *pl;
186987b8bd5aSWolfgang Denk long ret = 1;
1870fe8c2806Swdenk u32 inode;
1871fe8c2806Swdenk
1872fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "ls")))
1873fe8c2806Swdenk return 0;
1874fe8c2806Swdenk
1875fe8c2806Swdenk if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1876fe8c2806Swdenk putstr("ls: Failed to scan jffs2 file structure\r\n");
1877fe8c2806Swdenk return 0;
1878fe8c2806Swdenk }
1879fc1cfcdbSwdenk
1880fc1cfcdbSwdenk
1881fe8c2806Swdenk #if 0
1882fe8c2806Swdenk putLabeledWord("found file at inode = ", inode);
1883fe8c2806Swdenk putLabeledWord("read_inode returns = ", ret);
1884fe8c2806Swdenk #endif
1885fc1cfcdbSwdenk
1886fc1cfcdbSwdenk return ret;
1887fe8c2806Swdenk }
1888fe8c2806Swdenk
1889fe8c2806Swdenk
1890fe8c2806Swdenk /* Load a file from flash into memory. fname can be a full path */
1891fe8c2806Swdenk u32
jffs2_1pass_load(char * dest,struct part_info * part,const char * fname)1892fe8c2806Swdenk jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1893fe8c2806Swdenk {
1894fe8c2806Swdenk
1895fe8c2806Swdenk struct b_lists *pl;
189687b8bd5aSWolfgang Denk long ret = 1;
1897fe8c2806Swdenk u32 inode;
1898fe8c2806Swdenk
1899fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "load")))
1900fe8c2806Swdenk return 0;
1901fe8c2806Swdenk
1902fe8c2806Swdenk if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1903fe8c2806Swdenk putstr("load: Failed to find inode\r\n");
1904fe8c2806Swdenk return 0;
1905fe8c2806Swdenk }
1906fe8c2806Swdenk
1907fe8c2806Swdenk /* Resolve symlinks */
1908fe8c2806Swdenk if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1909fe8c2806Swdenk putstr("load: Failed to resolve inode structure\r\n");
1910fe8c2806Swdenk return 0;
1911fe8c2806Swdenk }
1912fe8c2806Swdenk
1913fe8c2806Swdenk if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1914fe8c2806Swdenk putstr("load: Failed to read inode\r\n");
1915fe8c2806Swdenk return 0;
1916fe8c2806Swdenk }
1917fe8c2806Swdenk
1918fe8c2806Swdenk DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1919fe8c2806Swdenk (unsigned long) dest, ret);
1920fe8c2806Swdenk return ret;
1921fe8c2806Swdenk }
1922fe8c2806Swdenk
1923fe8c2806Swdenk /* Return information about the fs on this partition */
1924fe8c2806Swdenk u32
jffs2_1pass_info(struct part_info * part)1925fe8c2806Swdenk jffs2_1pass_info(struct part_info * part)
1926fe8c2806Swdenk {
1927fe8c2806Swdenk struct b_jffs2_info info;
1928fe8c2806Swdenk struct b_lists *pl;
1929fe8c2806Swdenk int i;
1930fe8c2806Swdenk
1931fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "info")))
1932fe8c2806Swdenk return 0;
1933fe8c2806Swdenk
1934fe8c2806Swdenk jffs2_1pass_fill_info(pl, &info);
1935fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) {
19364b9206edSwdenk printf ("Compression: %s\n"
19374b9206edSwdenk "\tfrag count: %d\n"
19384b9206edSwdenk "\tcompressed sum: %d\n"
19394b9206edSwdenk "\tuncompressed sum: %d\n",
19404b9206edSwdenk compr_names[i],
19414b9206edSwdenk info.compr_info[i].num_frags,
19424b9206edSwdenk info.compr_info[i].compr_sum,
19434b9206edSwdenk info.compr_info[i].decompr_sum);
1944fe8c2806Swdenk }
1945fe8c2806Swdenk return 1;
1946fe8c2806Swdenk }
1947