blob: c4f7445221dde92205ad574e1fdffbf709b48a9e [file] [log] [blame]
wdenkfe8c2802002-11-03 00:38:21 +00001/*
2-------------------------------------------------------------------------
3 * Filename: jffs2.c
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 *-----------------------------------------------------------------------*/
9/*
10 * some portions of this code are taken from jffs2, and as such, the
11 * following copyright notice is included.
12 *
13 * JFFS2 -- Journalling Flash File System, Version 2.
14 *
15 * Copyright (C) 2001 Red Hat, Inc.
16 *
17 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
18 *
19 * The original JFFS, from which the design for JFFS2 was derived,
20 * was designed and implemented by Axis Communications AB.
21 *
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/
26 *
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.
31 *
32 * The Original Code is JFFS2 - Journalling Flash File System, version 2
33 *
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.
44 *
45 * $Id: jffs2_1pass.c,v 1.7 2002/01/25 01:56:47 nyet Exp $
46 *
47 */
48
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:
Wolfgang Denk53677ef2008-05-20 16:00:29 +020055 * (1) most pages are 4096 bytes
wdenkfe8c2802002-11-03 00:38:21 +000056 * (2) version numbers are somewhat sorted in acsending order
57 * (3) multiple compressed blocks making up one page is uncommon
58 *
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
62 * reverse order.
63 *
64 */
65
66/*
67 * Adapted by Nye Liu <nyet@zumanetworks.com> and
68 * Rex Feany <rfeany@zumanetworks.com>
69 * on Jan/2002 for U-Boot.
70 *
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 ;).
75 *
76 */
77
wdenk06d01db2003-03-14 20:47:52 +000078/*
79 * Bugfixing by Kai-Uwe Bloem <kai-uwe.bloem@auerswald.de>, (C) Mar/2003
80 *
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.
84 * It's still ugly :-(
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
88 * for speedup.
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.
94 *
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +020095 * The fragment sorting feature must be enabled by CONFIG_SYS_JFFS2_SORT_FRAGMENTS.
wdenk06d01db2003-03-14 20:47:52 +000096 * 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.
99 *
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.
102 *
103 *
104 * There's a big issue left: endianess is completely ignored in this code. Duh!
105 *
106 *
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
wdenkdd875c72004-01-03 21:24:46 +0000109 * might be incompatible with any new code from the jffs2 maintainers anyway,
110 * it should probably be dumped and replaced by something like jffs2reader!
wdenk06d01db2003-03-14 20:47:52 +0000111 */
112
113
wdenkfe8c2802002-11-03 00:38:21 +0000114#include <common.h>
115#include <config.h>
116#include <malloc.h>
117#include <linux/stat.h>
118#include <linux/time.h>
Stuart Wood86d32732008-06-02 16:40:08 -0400119#include <watchdog.h>
wdenkfe8c2802002-11-03 00:38:21 +0000120#include <jffs2/jffs2.h>
121#include <jffs2/jffs2_1pass.h>
Ilya Yanok584eeda2008-12-11 05:51:57 +0300122#include <linux/mtd/compat.h>
Ilya Yanok8cf19b92009-07-17 15:02:42 +0400123#include <asm/errno.h>
wdenkfe8c2802002-11-03 00:38:21 +0000124
125#include "jffs2_private.h"
126
wdenkfe8c2802002-11-03 00:38:21 +0000127
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200128#define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */
129#define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */
wdenkfe8c2802002-11-03 00:38:21 +0000130
wdenk06d01db2003-03-14 20:47:52 +0000131/* Debugging switches */
132#undef DEBUG_DIRENTS /* print directory entry list after scan */
133#undef DEBUG_FRAGMENTS /* print fragment list after scan */
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200134#undef DEBUG /* enable debugging messages */
wdenk06d01db2003-03-14 20:47:52 +0000135
136
wdenkfe8c2802002-11-03 00:38:21 +0000137#ifdef DEBUG
138# define DEBUGF(fmt,args...) printf(fmt ,##args)
139#else
140# define DEBUGF(fmt,args...)
141#endif
142
Ilya Yanok9b707622008-11-13 19:49:35 +0300143#include "summary.h"
144
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200145/* keeps pointer to currentlu processed partition */
146static struct part_info *current_part;
wdenk998eaae2004-04-18 19:43:36 +0000147
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200148#if (defined(CONFIG_JFFS2_NAND) && \
Jon Loeligerdd60d122007-07-09 17:56:50 -0500149 defined(CONFIG_CMD_NAND) )
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100150#include <nand.h>
wdenk998eaae2004-04-18 19:43:36 +0000151/*
152 * Support for jffs2 on top of NAND-flash
153 *
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
157 * here do.
158 *
159 */
160
wdenk998eaae2004-04-18 19:43:36 +0000161#define NAND_PAGE_SIZE 512
162#define NAND_PAGE_SHIFT 9
163#define NAND_PAGE_MASK (~(NAND_PAGE_SIZE-1))
164
165#ifndef NAND_CACHE_PAGES
166#define NAND_CACHE_PAGES 16
167#endif
168#define NAND_CACHE_SIZE (NAND_CACHE_PAGES*NAND_PAGE_SIZE)
169
170static u8* nand_cache = NULL;
171static u32 nand_cache_off = (u32)-1;
wdenk998eaae2004-04-18 19:43:36 +0000172
173static int read_nand_cached(u32 off, u32 size, u_char *buf)
174{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200175 struct mtdids *id = current_part->dev->id;
wdenk998eaae2004-04-18 19:43:36 +0000176 u32 bytes_read = 0;
Marian Balakowicz6db39702006-04-08 19:08:06 +0200177 size_t retlen;
wdenk998eaae2004-04-18 19:43:36 +0000178 int cpy_bytes;
179
180 while (bytes_read < size) {
181 if ((off + bytes_read < nand_cache_off) ||
182 (off + bytes_read >= nand_cache_off+NAND_CACHE_SIZE)) {
183 nand_cache_off = (off + bytes_read) & NAND_PAGE_MASK;
184 if (!nand_cache) {
185 /* This memory never gets freed but 'cause
186 it's a bootloader, nobody cares */
wdenk507bbe32004-04-18 21:13:41 +0000187 nand_cache = malloc(NAND_CACHE_SIZE);
188 if (!nand_cache) {
wdenk998eaae2004-04-18 19:43:36 +0000189 printf("read_nand_cached: can't alloc cache size %d bytes\n",
190 NAND_CACHE_SIZE);
191 return -1;
192 }
193 }
Bartlomiej Siekaaddb2e12006-03-05 18:57:33 +0100194
Marian Balakowicz6db39702006-04-08 19:08:06 +0200195 retlen = NAND_CACHE_SIZE;
196 if (nand_read(&nand_info[id->num], nand_cache_off,
197 &retlen, nand_cache) != 0 ||
198 retlen != NAND_CACHE_SIZE) {
199 printf("read_nand_cached: error reading nand off %#x size %d bytes\n",
200 nand_cache_off, NAND_CACHE_SIZE);
201 return -1;
202 }
wdenk998eaae2004-04-18 19:43:36 +0000203 }
204 cpy_bytes = nand_cache_off + NAND_CACHE_SIZE - (off + bytes_read);
205 if (cpy_bytes > size - bytes_read)
206 cpy_bytes = size - bytes_read;
207 memcpy(buf + bytes_read,
208 nand_cache + off + bytes_read - nand_cache_off,
209 cpy_bytes);
210 bytes_read += cpy_bytes;
211 }
212 return bytes_read;
213}
214
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200215static void *get_fl_mem_nand(u32 off, u32 size, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000216{
217 u_char *buf = ext_buf ? (u_char*)ext_buf : (u_char*)malloc(size);
218
219 if (NULL == buf) {
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200220 printf("get_fl_mem_nand: can't alloc %d bytes\n", size);
wdenk998eaae2004-04-18 19:43:36 +0000221 return NULL;
222 }
223 if (read_nand_cached(off, size, buf) < 0) {
wdenk32877d62004-05-05 19:44:41 +0000224 if (!ext_buf)
225 free(buf);
wdenk998eaae2004-04-18 19:43:36 +0000226 return NULL;
227 }
228
229 return buf;
230}
231
Ilya Yanok70741002008-11-13 19:49:34 +0300232static void *get_node_mem_nand(u32 off, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000233{
234 struct jffs2_unknown_node node;
235 void *ret = NULL;
236
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200237 if (NULL == get_fl_mem_nand(off, sizeof(node), &node))
wdenk998eaae2004-04-18 19:43:36 +0000238 return NULL;
239
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200240 if (!(ret = get_fl_mem_nand(off, node.magic ==
wdenk998eaae2004-04-18 19:43:36 +0000241 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanok70741002008-11-13 19:49:34 +0300242 ext_buf))) {
wdenk998eaae2004-04-18 19:43:36 +0000243 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
244 off, node.magic, node.nodetype, node.totlen);
245 }
246 return ret;
247}
248
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200249static void put_fl_mem_nand(void *buf)
wdenk998eaae2004-04-18 19:43:36 +0000250{
251 free(buf);
252}
Jon Loeligerdd60d122007-07-09 17:56:50 -0500253#endif
wdenk998eaae2004-04-18 19:43:36 +0000254
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900255#if defined(CONFIG_CMD_ONENAND)
256
257#include <linux/mtd/mtd.h>
258#include <linux/mtd/onenand.h>
259#include <onenand_uboot.h>
260
261#define ONENAND_PAGE_SIZE 2048
262#define ONENAND_PAGE_SHIFT 11
263#define ONENAND_PAGE_MASK (~(ONENAND_PAGE_SIZE-1))
264
265#ifndef ONENAND_CACHE_PAGES
266#define ONENAND_CACHE_PAGES 4
267#endif
268#define ONENAND_CACHE_SIZE (ONENAND_CACHE_PAGES*ONENAND_PAGE_SIZE)
269
270static u8* onenand_cache;
271static u32 onenand_cache_off = (u32)-1;
272
273static int read_onenand_cached(u32 off, u32 size, u_char *buf)
274{
275 u32 bytes_read = 0;
276 size_t retlen;
277 int cpy_bytes;
278
279 while (bytes_read < size) {
280 if ((off + bytes_read < onenand_cache_off) ||
281 (off + bytes_read >= onenand_cache_off + ONENAND_CACHE_SIZE)) {
282 onenand_cache_off = (off + bytes_read) & ONENAND_PAGE_MASK;
283 if (!onenand_cache) {
284 /* This memory never gets freed but 'cause
285 it's a bootloader, nobody cares */
286 onenand_cache = malloc(ONENAND_CACHE_SIZE);
287 if (!onenand_cache) {
288 printf("read_onenand_cached: can't alloc cache size %d bytes\n",
289 ONENAND_CACHE_SIZE);
290 return -1;
291 }
292 }
293
294 retlen = ONENAND_CACHE_SIZE;
295 if (onenand_read(&onenand_mtd, onenand_cache_off, retlen,
296 &retlen, onenand_cache) != 0 ||
297 retlen != ONENAND_CACHE_SIZE) {
298 printf("read_onenand_cached: error reading nand off %#x size %d bytes\n",
299 onenand_cache_off, ONENAND_CACHE_SIZE);
300 return -1;
301 }
302 }
303 cpy_bytes = onenand_cache_off + ONENAND_CACHE_SIZE - (off + bytes_read);
304 if (cpy_bytes > size - bytes_read)
305 cpy_bytes = size - bytes_read;
306 memcpy(buf + bytes_read,
307 onenand_cache + off + bytes_read - onenand_cache_off,
308 cpy_bytes);
309 bytes_read += cpy_bytes;
310 }
311 return bytes_read;
312}
313
314static void *get_fl_mem_onenand(u32 off, u32 size, void *ext_buf)
315{
316 u_char *buf = ext_buf ? (u_char *)ext_buf : (u_char *)malloc(size);
317
318 if (NULL == buf) {
319 printf("get_fl_mem_onenand: can't alloc %d bytes\n", size);
320 return NULL;
321 }
322 if (read_onenand_cached(off, size, buf) < 0) {
323 if (!ext_buf)
324 free(buf);
325 return NULL;
326 }
327
328 return buf;
329}
330
Ilya Yanok70741002008-11-13 19:49:34 +0300331static void *get_node_mem_onenand(u32 off, void *ext_buf)
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900332{
333 struct jffs2_unknown_node node;
334 void *ret = NULL;
335
336 if (NULL == get_fl_mem_onenand(off, sizeof(node), &node))
337 return NULL;
338
339 ret = get_fl_mem_onenand(off, node.magic ==
340 JFFS2_MAGIC_BITMASK ? node.totlen : sizeof(node),
Ilya Yanok70741002008-11-13 19:49:34 +0300341 ext_buf);
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900342 if (!ret) {
343 printf("off = %#x magic %#x type %#x node.totlen = %d\n",
344 off, node.magic, node.nodetype, node.totlen);
345 }
346 return ret;
347}
348
349
350static void put_fl_mem_onenand(void *buf)
351{
352 free(buf);
353}
354#endif
355
wdenk998eaae2004-04-18 19:43:36 +0000356
Jon Loeligerdd60d122007-07-09 17:56:50 -0500357#if defined(CONFIG_CMD_FLASH)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200358/*
359 * Support for jffs2 on top of NOR-flash
360 *
361 * NOR flash memory is mapped in processor's address space,
362 * just return address.
363 */
Ilya Yanok70741002008-11-13 19:49:34 +0300364static inline void *get_fl_mem_nor(u32 off, u32 size, void *ext_buf)
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200365{
366 u32 addr = off;
367 struct mtdids *id = current_part->dev->id;
368
Marian Balakowicze6f2e902005-10-11 19:09:42 +0200369 extern flash_info_t flash_info[];
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200370 flash_info_t *flash = &flash_info[id->num];
371
372 addr += flash->start[0];
Ilya Yanok70741002008-11-13 19:49:34 +0300373 if (ext_buf) {
374 memcpy(ext_buf, (void *)addr, size);
375 return ext_buf;
376 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200377 return (void*)addr;
378}
379
Ilya Yanok70741002008-11-13 19:49:34 +0300380static inline void *get_node_mem_nor(u32 off, void *ext_buf)
Ilya Yanok8a36d312008-11-13 19:49:33 +0300381{
Ilya Yanok70741002008-11-13 19:49:34 +0300382 struct jffs2_unknown_node *pNode;
Ilya Yanok8a36d312008-11-13 19:49:33 +0300383
Ilya Yanok70741002008-11-13 19:49:34 +0300384 /* pNode will point directly to flash - don't provide external buffer
385 and don't care about size */
386 pNode = get_fl_mem_nor(off, 0, NULL);
387 return (void *)get_fl_mem_nor(off, pNode->magic == JFFS2_MAGIC_BITMASK ?
388 pNode->totlen : sizeof(*pNode), ext_buf);
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200389}
Jon Loeligerdd60d122007-07-09 17:56:50 -0500390#endif
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200391
392
393/*
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200394 * Generic jffs2 raw memory and node read routines.
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200395 *
396 */
wdenk998eaae2004-04-18 19:43:36 +0000397static inline void *get_fl_mem(u32 off, u32 size, void *ext_buf)
398{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200399 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200400
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100401 switch(id->type) {
Jon Loeligerdd60d122007-07-09 17:56:50 -0500402#if defined(CONFIG_CMD_FLASH)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100403 case MTD_DEV_TYPE_NOR:
Ilya Yanok70741002008-11-13 19:49:34 +0300404 return get_fl_mem_nor(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100405 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200406#endif
Jon Loeligerdd60d122007-07-09 17:56:50 -0500407#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100408 case MTD_DEV_TYPE_NAND:
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200409 return get_fl_mem_nand(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100410 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200411#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900412#if defined(CONFIG_CMD_ONENAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100413 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900414 return get_fl_mem_onenand(off, size, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100415 break;
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900416#endif
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100417 default:
418 printf("get_fl_mem: unknown device type, " \
419 "using raw offset!\n");
420 }
wdenk998eaae2004-04-18 19:43:36 +0000421 return (void*)off;
422}
423
Ilya Yanok70741002008-11-13 19:49:34 +0300424static inline void *get_node_mem(u32 off, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000425{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200426 struct mtdids *id = current_part->dev->id;
Wolfgang Denk8f79e4c2005-08-10 15:14:32 +0200427
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100428 switch(id->type) {
Jon Loeligerdd60d122007-07-09 17:56:50 -0500429#if defined(CONFIG_CMD_FLASH)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100430 case MTD_DEV_TYPE_NOR:
Ilya Yanok70741002008-11-13 19:49:34 +0300431 return get_node_mem_nor(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100432 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200433#endif
Wolfgang Denke4dbe1b2007-07-05 17:56:27 +0200434#if defined(CONFIG_JFFS2_NAND) && \
Jon Loeligerdd60d122007-07-09 17:56:50 -0500435 defined(CONFIG_CMD_NAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100436 case MTD_DEV_TYPE_NAND:
Ilya Yanok70741002008-11-13 19:49:34 +0300437 return get_node_mem_nand(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100438 break;
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200439#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900440#if defined(CONFIG_CMD_ONENAND)
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100441 case MTD_DEV_TYPE_ONENAND:
Ilya Yanok70741002008-11-13 19:49:34 +0300442 return get_node_mem_onenand(off, ext_buf);
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100443 break;
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900444#endif
Heiko Schocher2d2018f2010-03-24 13:22:50 +0100445 default:
446 printf("get_fl_mem: unknown device type, " \
447 "using raw offset!\n");
448 }
wdenk998eaae2004-04-18 19:43:36 +0000449 return (void*)off;
450}
451
Ilya Yanok70741002008-11-13 19:49:34 +0300452static inline void put_fl_mem(void *buf, void *ext_buf)
wdenk998eaae2004-04-18 19:43:36 +0000453{
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200454 struct mtdids *id = current_part->dev->id;
455
Ilya Yanok70741002008-11-13 19:49:34 +0300456 /* If buf is the same as ext_buf, it was provided by the caller -
457 we shouldn't free it then. */
458 if (buf == ext_buf)
459 return;
Scott Wood2f77c7f2008-10-31 13:51:12 -0500460 switch (id->type) {
461#if defined(CONFIG_JFFS2_NAND) && defined(CONFIG_CMD_NAND)
462 case MTD_DEV_TYPE_NAND:
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200463 return put_fl_mem_nand(buf);
464#endif
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900465#if defined(CONFIG_CMD_ONENAND)
Scott Wood2f77c7f2008-10-31 13:51:12 -0500466 case MTD_DEV_TYPE_ONENAND:
Kyungmin Park1a7f8cc2008-08-27 14:45:20 +0900467 return put_fl_mem_onenand(buf);
468#endif
Scott Wood2f77c7f2008-10-31 13:51:12 -0500469 }
wdenk998eaae2004-04-18 19:43:36 +0000470}
471
wdenk06d01db2003-03-14 20:47:52 +0000472/* Compression names */
473static char *compr_names[] = {
474 "NONE",
475 "ZERO",
476 "RTIME",
477 "RUBINMIPS",
478 "COPY",
479 "DYNRUBIN",
wdenk07cc0992005-05-05 00:04:14 +0000480 "ZLIB",
Wolfgang Denkf0983372010-01-15 11:10:33 +0100481#if defined(CONFIG_JFFS2_LZO)
wdenk07cc0992005-05-05 00:04:14 +0000482 "LZO",
wdenk07cc0992005-05-05 00:04:14 +0000483#endif
wdenk06d01db2003-03-14 20:47:52 +0000484};
485
wdenk06d01db2003-03-14 20:47:52 +0000486/* Memory management */
487struct mem_block {
488 u32 index;
489 struct mem_block *next;
490 struct b_node nodes[NODE_CHUNK];
491};
492
493
494static void
495free_nodes(struct b_list *list)
496{
497 while (list->listMemBase != NULL) {
498 struct mem_block *next = list->listMemBase->next;
499 free( list->listMemBase );
500 list->listMemBase = next;
501 }
502}
wdenkfe8c2802002-11-03 00:38:21 +0000503
504static struct b_node *
wdenk06d01db2003-03-14 20:47:52 +0000505add_node(struct b_list *list)
wdenkfe8c2802002-11-03 00:38:21 +0000506{
wdenk06d01db2003-03-14 20:47:52 +0000507 u32 index = 0;
508 struct mem_block *memBase;
wdenkfe8c2802002-11-03 00:38:21 +0000509 struct b_node *b;
510
wdenk06d01db2003-03-14 20:47:52 +0000511 memBase = list->listMemBase;
512 if (memBase != NULL)
513 index = memBase->index;
wdenkfe8c2802002-11-03 00:38:21 +0000514#if 0
515 putLabeledWord("add_node: index = ", index);
wdenk06d01db2003-03-14 20:47:52 +0000516 putLabeledWord("add_node: memBase = ", list->listMemBase);
wdenkfe8c2802002-11-03 00:38:21 +0000517#endif
518
wdenk06d01db2003-03-14 20:47:52 +0000519 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) {
wdenkfe8c2802002-11-03 00:38:21 +0000523 putstr("add_node: malloc failed\n");
524 return NULL;
525 }
wdenk06d01db2003-03-14 20:47:52 +0000526 memBase->next = list->listMemBase;
527 index = 0;
wdenkfe8c2802002-11-03 00:38:21 +0000528#if 0
529 putLabeledWord("add_node: alloced a new membase at ", *memBase);
530#endif
531
532 }
533 /* now we have room to add it. */
wdenk06d01db2003-03-14 20:47:52 +0000534 b = &memBase->nodes[index];
535 index ++;
wdenkfe8c2802002-11-03 00:38:21 +0000536
wdenk06d01db2003-03-14 20:47:52 +0000537 memBase->index = index;
538 list->listMemBase = memBase;
539 list->listCount++;
wdenkfe8c2802002-11-03 00:38:21 +0000540 return b;
wdenkfe8c2802002-11-03 00:38:21 +0000541}
542
wdenk06d01db2003-03-14 20:47:52 +0000543static struct b_node *
544insert_node(struct b_list *list, u32 offset)
545{
546 struct b_node *new;
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200547#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000548 struct b_node *b, *prev;
549#endif
550
551 if (!(new = add_node(list))) {
552 putstr("add_node failed!\r\n");
553 return NULL;
554 }
555 new->offset = offset;
556
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200557#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000558 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;
562 else
563 prev = NULL;
564
565 for (b = (prev ? prev->next : list->listHead);
566 b != NULL && list->listCompare(new, b);
567 prev = b, b = b->next) {
568 list->listLoops++;
569 }
570 if (b != NULL)
571 list->listLast = prev;
572
573 if (b != NULL) {
574 new->next = b;
575 if (prev != NULL)
576 prev->next = new;
577 else
578 list->listHead = new;
579 } else
580#endif
581 {
582 new->next = (struct b_node *) NULL;
583 if (list->listTail != NULL) {
584 list->listTail->next = new;
585 list->listTail = new;
586 } else {
587 list->listTail = list->listHead = new;
588 }
589 }
590
591 return new;
592}
593
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200594#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk7205e402003-09-10 22:30:53 +0000595/* Sort data entries with the latest version last, so that if there
596 * is overlapping data the latest version will be used.
597 */
wdenk06d01db2003-03-14 20:47:52 +0000598static int compare_inodes(struct b_node *new, struct b_node *old)
599{
wdenk998eaae2004-04-18 19:43:36 +0000600 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);
wdenk06d01db2003-03-14 20:47:52 +0000606
wdenk7205e402003-09-10 22:30:53 +0000607 return jNew->version > jOld->version;
wdenk06d01db2003-03-14 20:47:52 +0000608}
609
wdenk7205e402003-09-10 22:30:53 +0000610/* 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.
614 */
wdenk06d01db2003-03-14 20:47:52 +0000615static int compare_dirents(struct b_node *new, struct b_node *old)
616{
wdenk998eaae2004-04-18 19:43:36 +0000617 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);
wdenk507bbe32004-04-18 21:13:41 +0000621 struct jffs2_raw_dirent *jOld =
wdenk998eaae2004-04-18 19:43:36 +0000622 (struct jffs2_raw_dirent *)get_fl_mem(old->offset, sizeof(ojOld), &ojOld);
wdenk7205e402003-09-10 22:30:53 +0000623 int cmp;
wdenk06d01db2003-03-14 20:47:52 +0000624
wdenk7205e402003-09-10 22:30:53 +0000625 /* ascending sort by pino */
626 if (jNew->pino != jOld->pino)
627 return jNew->pino > jOld->pino;
628
629 /* pino is the same, so use ascending sort by nsize, so
630 * we don't do strncmp unless we really must.
631 */
632 if (jNew->nsize != jOld->nsize)
633 return jNew->nsize > jOld->nsize;
634
635 /* length is also the same, so use ascending sort by name
636 */
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200637 cmp = strncmp((char *)jNew->name, (char *)jOld->name, jNew->nsize);
wdenk7205e402003-09-10 22:30:53 +0000638 if (cmp != 0)
639 return cmp > 0;
640
641 /* we have duplicate names in this directory, so use ascending
642 * sort by version
643 */
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
647 */
648 jOld->ino = 0;
649 return 1;
650 }
wdenk42d1f032003-10-15 23:53:47 +0000651
wdenk7205e402003-09-10 22:30:53 +0000652 return 0;
wdenk06d01db2003-03-14 20:47:52 +0000653}
654#endif
wdenkfe8c2802002-11-03 00:38:21 +0000655
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200656void
657jffs2_free_cache(struct part_info *part)
wdenkfe8c2802002-11-03 00:38:21 +0000658{
wdenk06d01db2003-03-14 20:47:52 +0000659 struct b_lists *pL;
wdenkfe8c2802002-11-03 00:38:21 +0000660
wdenk06d01db2003-03-14 20:47:52 +0000661 if (part->jffs2_priv != NULL) {
662 pL = (struct b_lists *)part->jffs2_priv;
663 free_nodes(&pL->frag);
664 free_nodes(&pL->dir);
Ilya Yanok70741002008-11-13 19:49:34 +0300665 free(pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000666 free(pL);
667 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +0200668}
669
670static u32
671jffs_init_1pass_list(struct part_info *part)
672{
673 struct b_lists *pL;
674
675 jffs2_free_cache(part);
676
wdenk06d01db2003-03-14 20:47:52 +0000677 if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) {
678 pL = (struct b_lists *)part->jffs2_priv;
679
680 memset(pL, 0, sizeof(*pL));
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200681#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000682 pL->dir.listCompare = compare_dirents;
683 pL->frag.listCompare = compare_inodes;
684#endif
wdenkfe8c2802002-11-03 00:38:21 +0000685 }
686 return 0;
687}
688
689/* find the inode from the slashless name given a parent */
690static long
691jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest)
692{
693 struct b_node *b;
694 struct jffs2_raw_inode *jNode;
wdenk06d01db2003-03-14 20:47:52 +0000695 u32 totalSize = 0;
wdenk7205e402003-09-10 22:30:53 +0000696 u32 latestVersion = 0;
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200697 uchar *lDest;
698 uchar *src;
wdenkfe8c2802002-11-03 00:38:21 +0000699 long ret;
700 int i;
701 u32 counter = 0;
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200702#ifdef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk7205e402003-09-10 22:30:53 +0000703 /* Find file size before loading any data, so fragments that
704 * start past the end of file can be ignored. A fragment
705 * that is partially in the file is loaded, so extra data may
706 * be loaded up to the next 4K boundary above the file size.
707 * This shouldn't cause trouble when loading kernel images, so
708 * we will live with it.
709 */
710 for (b = pL->frag.listHead; b != NULL; b = b->next) {
wdenk507bbe32004-04-18 21:13:41 +0000711 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
Ilya Yanok70741002008-11-13 19:49:34 +0300712 sizeof(struct jffs2_raw_inode), pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000713 if ((inode == jNode->ino)) {
714 /* get actual file length from the newest node */
715 if (jNode->version >= latestVersion) {
716 totalSize = jNode->isize;
717 latestVersion = jNode->version;
718 }
719 }
Ilya Yanok70741002008-11-13 19:49:34 +0300720 put_fl_mem(jNode, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000721 }
722#endif
wdenkfe8c2802002-11-03 00:38:21 +0000723
wdenk06d01db2003-03-14 20:47:52 +0000724 for (b = pL->frag.listHead; b != NULL; b = b->next) {
Ilya Yanok70741002008-11-13 19:49:34 +0300725 jNode = (struct jffs2_raw_inode *) get_node_mem(b->offset,
726 pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000727 if ((inode == jNode->ino)) {
wdenk06d01db2003-03-14 20:47:52 +0000728#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000729 putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen);
730 putLabeledWord("read_inode: inode = ", jNode->ino);
731 putLabeledWord("read_inode: version = ", jNode->version);
732 putLabeledWord("read_inode: isize = ", jNode->isize);
733 putLabeledWord("read_inode: offset = ", jNode->offset);
734 putLabeledWord("read_inode: csize = ", jNode->csize);
735 putLabeledWord("read_inode: dsize = ", jNode->dsize);
736 putLabeledWord("read_inode: compr = ", jNode->compr);
737 putLabeledWord("read_inode: usercompr = ", jNode->usercompr);
738 putLabeledWord("read_inode: flags = ", jNode->flags);
wdenkfe8c2802002-11-03 00:38:21 +0000739#endif
wdenk7205e402003-09-10 22:30:53 +0000740
Jean-Christophe PLAGNIOL-VILLARD6d0f6bc2008-10-16 15:01:15 +0200741#ifndef CONFIG_SYS_JFFS2_SORT_FRAGMENTS
wdenk06d01db2003-03-14 20:47:52 +0000742 /* get actual file length from the newest node */
743 if (jNode->version >= latestVersion) {
wdenkfe8c2802002-11-03 00:38:21 +0000744 totalSize = jNode->isize;
wdenk06d01db2003-03-14 20:47:52 +0000745 latestVersion = jNode->version;
wdenkfe8c2802002-11-03 00:38:21 +0000746 }
wdenk7205e402003-09-10 22:30:53 +0000747#endif
wdenkfe8c2802002-11-03 00:38:21 +0000748
749 if(dest) {
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200750 src = ((uchar *) jNode) + sizeof(struct jffs2_raw_inode);
wdenk06d01db2003-03-14 20:47:52 +0000751 /* ignore data behind latest known EOF */
wdenk998eaae2004-04-18 19:43:36 +0000752 if (jNode->offset > totalSize) {
Ilya Yanok70741002008-11-13 19:49:34 +0300753 put_fl_mem(jNode, pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000754 continue;
wdenk998eaae2004-04-18 19:43:36 +0000755 }
Ilya Yanok142a80f2008-11-13 19:49:36 +0300756 if (b->datacrc == CRC_UNKNOWN)
757 b->datacrc = data_crc(jNode) ?
758 CRC_OK : CRC_BAD;
759 if (b->datacrc == CRC_BAD) {
Ilya Yanok70741002008-11-13 19:49:34 +0300760 put_fl_mem(jNode, pL->readbuf);
Ilya Yanok8a36d312008-11-13 19:49:33 +0300761 continue;
762 }
wdenk06d01db2003-03-14 20:47:52 +0000763
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200764 lDest = (uchar *) (dest + jNode->offset);
wdenkfe8c2802002-11-03 00:38:21 +0000765#if 0
wdenk06d01db2003-03-14 20:47:52 +0000766 putLabeledWord("read_inode: src = ", src);
wdenkfe8c2802002-11-03 00:38:21 +0000767 putLabeledWord("read_inode: dest = ", lDest);
wdenkfe8c2802002-11-03 00:38:21 +0000768#endif
769 switch (jNode->compr) {
770 case JFFS2_COMPR_NONE:
wdenkfe8c2802002-11-03 00:38:21 +0000771 ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize);
772 break;
773 case JFFS2_COMPR_ZERO:
774 ret = 0;
775 for (i = 0; i < jNode->dsize; i++)
776 *(lDest++) = 0;
777 break;
778 case JFFS2_COMPR_RTIME:
779 ret = 0;
780 rtime_decompress(src, lDest, jNode->csize, jNode->dsize);
781 break;
782 case JFFS2_COMPR_DYNRUBIN:
783 /* this is slow but it works */
784 ret = 0;
785 dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize);
786 break;
787 case JFFS2_COMPR_ZLIB:
788 ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize);
789 break;
Wolfgang Denkf0983372010-01-15 11:10:33 +0100790#if defined(CONFIG_JFFS2_LZO)
wdenk07cc0992005-05-05 00:04:14 +0000791 case JFFS2_COMPR_LZO:
792 ret = lzo_decompress(src, lDest, jNode->csize, jNode->dsize);
793 break;
794#endif
wdenkfe8c2802002-11-03 00:38:21 +0000795 default:
796 /* unknown */
797 putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr);
Ilya Yanok70741002008-11-13 19:49:34 +0300798 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000799 return -1;
800 break;
801 }
802 }
803
wdenkfe8c2802002-11-03 00:38:21 +0000804#if 0
wdenkfe8c2802002-11-03 00:38:21 +0000805 putLabeledWord("read_inode: totalSize = ", totalSize);
806 putLabeledWord("read_inode: compr ret = ", ret);
807#endif
808 }
wdenkfe8c2802002-11-03 00:38:21 +0000809 counter++;
Ilya Yanok70741002008-11-13 19:49:34 +0300810 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000811 }
wdenkfe8c2802002-11-03 00:38:21 +0000812
813#if 0
wdenk06d01db2003-03-14 20:47:52 +0000814 putLabeledWord("read_inode: returning = ", totalSize);
wdenkfe8c2802002-11-03 00:38:21 +0000815#endif
wdenk06d01db2003-03-14 20:47:52 +0000816 return totalSize;
wdenkfe8c2802002-11-03 00:38:21 +0000817}
818
819/* find the inode from the slashless name given a parent */
820static u32
821jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino)
822{
823 struct b_node *b;
824 struct jffs2_raw_dirent *jDir;
825 int len;
826 u32 counter;
827 u32 version = 0;
828 u32 inode = 0;
829
830 /* name is assumed slash free */
831 len = strlen(name);
832
833 counter = 0;
834 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +0000835 for(b = pL->dir.listHead; b; b = b->next, counter++) {
Ilya Yanok70741002008-11-13 19:49:34 +0300836 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
837 pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000838 if ((pino == jDir->pino) && (len == jDir->nsize) &&
839 (jDir->ino) && /* 0 for unlink */
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200840 (!strncmp((char *)jDir->name, name, len))) { /* a match */
wdenk998eaae2004-04-18 19:43:36 +0000841 if (jDir->version < version) {
Ilya Yanok70741002008-11-13 19:49:34 +0300842 put_fl_mem(jDir, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +0000843 continue;
wdenk998eaae2004-04-18 19:43:36 +0000844 }
wdenkfe8c2802002-11-03 00:38:21 +0000845
wdenk7205e402003-09-10 22:30:53 +0000846 if (jDir->version == version && inode != 0) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +0200847 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +0000848 putstr(" ** ERROR ** ");
849 putnstr(jDir->name, jDir->nsize);
850 putLabeledWord(" has dup version =", version);
851 }
852 inode = jDir->ino;
853 version = jDir->version;
854 }
855#if 0
856 putstr("\r\nfind_inode:p&l ->");
857 putnstr(jDir->name, jDir->nsize);
858 putstr("\r\n");
859 putLabeledWord("pino = ", jDir->pino);
860 putLabeledWord("nsize = ", jDir->nsize);
861 putLabeledWord("b = ", (u32) b);
862 putLabeledWord("counter = ", counter);
863#endif
Ilya Yanok70741002008-11-13 19:49:34 +0300864 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000865 }
866 return inode;
867}
868
wdenk180d3f72004-01-04 16:28:35 +0000869char *mkmodestr(unsigned long mode, char *str)
wdenkfe8c2802002-11-03 00:38:21 +0000870{
wdenk06d01db2003-03-14 20:47:52 +0000871 static const char *l = "xwr";
872 int mask = 1, i;
873 char c;
wdenkfe8c2802002-11-03 00:38:21 +0000874
wdenk06d01db2003-03-14 20:47:52 +0000875 switch (mode & S_IFMT) {
876 case S_IFDIR: str[0] = 'd'; break;
877 case S_IFBLK: str[0] = 'b'; break;
878 case S_IFCHR: str[0] = 'c'; break;
879 case S_IFIFO: str[0] = 'f'; break;
880 case S_IFLNK: str[0] = 'l'; break;
881 case S_IFSOCK: str[0] = 's'; break;
882 case S_IFREG: str[0] = '-'; break;
883 default: str[0] = '?';
884 }
wdenkfe8c2802002-11-03 00:38:21 +0000885
wdenk06d01db2003-03-14 20:47:52 +0000886 for(i = 0; i < 9; i++) {
887 c = l[i%3];
888 str[9-i] = (mode & mask)?c:'-';
889 mask = mask<<1;
890 }
wdenkfe8c2802002-11-03 00:38:21 +0000891
wdenk06d01db2003-03-14 20:47:52 +0000892 if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S';
893 if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S';
894 if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T';
895 str[10] = '\0';
896 return str;
wdenkfe8c2802002-11-03 00:38:21 +0000897}
898
899static inline void dump_stat(struct stat *st, const char *name)
900{
wdenk06d01db2003-03-14 20:47:52 +0000901 char str[20];
902 char s[64], *p;
wdenkfe8c2802002-11-03 00:38:21 +0000903
wdenk06d01db2003-03-14 20:47:52 +0000904 if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */
905 st->st_mtime = 1;
wdenkfe8c2802002-11-03 00:38:21 +0000906
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200907 ctime_r((time_t *)&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */
wdenkfe8c2802002-11-03 00:38:21 +0000908
wdenk06d01db2003-03-14 20:47:52 +0000909 if ((p = strchr(s,'\n')) != NULL) *p = '\0';
910 if ((p = strchr(s,'\r')) != NULL) *p = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000911
912/*
wdenk06d01db2003-03-14 20:47:52 +0000913 printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str),
914 st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000915*/
916
wdenk06d01db2003-03-14 20:47:52 +0000917 printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name);
wdenkfe8c2802002-11-03 00:38:21 +0000918}
919
920static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i)
921{
922 char fname[256];
923 struct stat st;
924
925 if(!d || !i) return -1;
926
Wolfgang Denk77ddac92005-10-13 16:45:02 +0200927 strncpy(fname, (char *)d->name, d->nsize);
wdenk06d01db2003-03-14 20:47:52 +0000928 fname[d->nsize] = '\0';
wdenkfe8c2802002-11-03 00:38:21 +0000929
930 memset(&st,0,sizeof(st));
931
wdenk06d01db2003-03-14 20:47:52 +0000932 st.st_mtime = i->mtime;
933 st.st_mode = i->mode;
934 st.st_ino = i->ino;
Ilya Yanokf7384692008-11-13 19:49:31 +0300935 st.st_size = i->isize;
wdenkfe8c2802002-11-03 00:38:21 +0000936
937 dump_stat(&st, fname);
938
939 if (d->type == DT_LNK) {
940 unsigned char *src = (unsigned char *) (&i[1]);
941 putstr(" -> ");
942 putnstr(src, (int)i->dsize);
943 }
944
945 putstr("\r\n");
946
947 return 0;
948}
949
950/* list inodes with the given pino */
951static u32
952jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino)
953{
954 struct b_node *b;
955 struct jffs2_raw_dirent *jDir;
956
wdenk06d01db2003-03-14 20:47:52 +0000957 for (b = pL->dir.listHead; b; b = b->next) {
Ilya Yanok70741002008-11-13 19:49:34 +0300958 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
959 pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +0000960 if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */
961 u32 i_version = 0;
wdenk998eaae2004-04-18 19:43:36 +0000962 struct jffs2_raw_inode ojNode;
wdenk06d01db2003-03-14 20:47:52 +0000963 struct jffs2_raw_inode *jNode, *i = NULL;
964 struct b_node *b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +0000965
966 while (b2) {
wdenk998eaae2004-04-18 19:43:36 +0000967 jNode = (struct jffs2_raw_inode *)
968 get_fl_mem(b2->offset, sizeof(ojNode), &ojNode);
wdenk32877d62004-05-05 19:44:41 +0000969 if (jNode->ino == jDir->ino && jNode->version >= i_version) {
Ilya Yanokf7384692008-11-13 19:49:31 +0300970 i_version = jNode->version;
wdenk32877d62004-05-05 19:44:41 +0000971 if (i)
Ilya Yanok70741002008-11-13 19:49:34 +0300972 put_fl_mem(i, NULL);
wdenkcf8bc572005-05-04 23:50:54 +0000973
974 if (jDir->type == DT_LNK)
Ilya Yanok70741002008-11-13 19:49:34 +0300975 i = get_node_mem(b2->offset,
976 NULL);
wdenkcf8bc572005-05-04 23:50:54 +0000977 else
Ilya Yanok70741002008-11-13 19:49:34 +0300978 i = get_fl_mem(b2->offset,
979 sizeof(*i),
980 NULL);
wdenk32877d62004-05-05 19:44:41 +0000981 }
wdenkfe8c2802002-11-03 00:38:21 +0000982 b2 = b2->next;
983 }
984
985 dump_inode(pL, jDir, i);
Ilya Yanok70741002008-11-13 19:49:34 +0300986 put_fl_mem(i, NULL);
wdenkfe8c2802002-11-03 00:38:21 +0000987 }
Ilya Yanok70741002008-11-13 19:49:34 +0300988 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +0000989 }
990 return pino;
991}
992
993static u32
994jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino)
995{
996 int i;
997 char tmp[256];
998 char working_tmp[256];
999 char *c;
1000
1001 /* discard any leading slash */
1002 i = 0;
1003 while (fname[i] == '/')
1004 i++;
1005 strcpy(tmp, &fname[i]);
1006
1007 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1008 {
1009 strncpy(working_tmp, tmp, c - tmp);
1010 working_tmp[c - tmp] = '\0';
1011#if 0
1012 putstr("search_inode: tmp = ");
1013 putstr(tmp);
1014 putstr("\r\n");
1015 putstr("search_inode: wtmp = ");
1016 putstr(working_tmp);
1017 putstr("\r\n");
1018 putstr("search_inode: c = ");
1019 putstr(c);
1020 putstr("\r\n");
1021#endif
1022 for (i = 0; i < strlen(c) - 1; i++)
1023 tmp[i] = c[i + 1];
1024 tmp[i] = '\0';
1025#if 0
1026 putstr("search_inode: post tmp = ");
1027 putstr(tmp);
1028 putstr("\r\n");
1029#endif
1030
1031 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) {
1032 putstr("find_inode failed for name=");
1033 putstr(working_tmp);
1034 putstr("\r\n");
1035 return 0;
1036 }
1037 }
1038 /* this is for the bare filename, directories have already been mapped */
1039 if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1040 putstr("find_inode failed for name=");
1041 putstr(tmp);
1042 putstr("\r\n");
1043 return 0;
1044 }
1045 return pino;
1046
1047}
1048
1049static u32
1050jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino)
1051{
1052 struct b_node *b;
1053 struct b_node *b2;
1054 struct jffs2_raw_dirent *jDir;
1055 struct jffs2_raw_inode *jNode;
wdenk998eaae2004-04-18 19:43:36 +00001056 u8 jDirFoundType = 0;
1057 u32 jDirFoundIno = 0;
1058 u32 jDirFoundPino = 0;
wdenkfe8c2802002-11-03 00:38:21 +00001059 char tmp[256];
1060 u32 version = 0;
1061 u32 pino;
1062 unsigned char *src;
1063
1064 /* we need to search all and return the inode with the highest version */
wdenk06d01db2003-03-14 20:47:52 +00001065 for(b = pL->dir.listHead; b; b = b->next) {
Ilya Yanok70741002008-11-13 19:49:34 +03001066 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1067 pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001068 if (ino == jDir->ino) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001069 if (jDir->version < version) {
Ilya Yanok70741002008-11-13 19:49:34 +03001070 put_fl_mem(jDir, pL->readbuf);
wdenk7205e402003-09-10 22:30:53 +00001071 continue;
wdenk998eaae2004-04-18 19:43:36 +00001072 }
wdenkfe8c2802002-11-03 00:38:21 +00001073
wdenk998eaae2004-04-18 19:43:36 +00001074 if (jDir->version == version && jDirFoundType) {
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001075 /* I'm pretty sure this isn't legal */
wdenkfe8c2802002-11-03 00:38:21 +00001076 putstr(" ** ERROR ** ");
1077 putnstr(jDir->name, jDir->nsize);
1078 putLabeledWord(" has dup version (resolve) = ",
1079 version);
1080 }
1081
wdenk998eaae2004-04-18 19:43:36 +00001082 jDirFoundType = jDir->type;
1083 jDirFoundIno = jDir->ino;
1084 jDirFoundPino = jDir->pino;
wdenkfe8c2802002-11-03 00:38:21 +00001085 version = jDir->version;
1086 }
Ilya Yanok70741002008-11-13 19:49:34 +03001087 put_fl_mem(jDir, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001088 }
1089 /* now we found the right entry again. (shoulda returned inode*) */
wdenk998eaae2004-04-18 19:43:36 +00001090 if (jDirFoundType != DT_LNK)
1091 return jDirFoundIno;
wdenk06d01db2003-03-14 20:47:52 +00001092
1093 /* it's a soft link so we follow it again. */
1094 b2 = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001095 while (b2) {
Ilya Yanok70741002008-11-13 19:49:34 +03001096 jNode = (struct jffs2_raw_inode *) get_node_mem(b2->offset,
1097 pL->readbuf);
wdenk998eaae2004-04-18 19:43:36 +00001098 if (jNode->ino == jDirFoundIno) {
wdenk2729af92004-05-03 20:45:30 +00001099 src = (unsigned char *)jNode + sizeof(struct jffs2_raw_inode);
wdenkfe8c2802002-11-03 00:38:21 +00001100
1101#if 0
1102 putLabeledWord("\t\t dsize = ", jNode->dsize);
1103 putstr("\t\t target = ");
1104 putnstr(src, jNode->dsize);
1105 putstr("\r\n");
1106#endif
Wolfgang Denk77ddac92005-10-13 16:45:02 +02001107 strncpy(tmp, (char *)src, jNode->dsize);
wdenkfe8c2802002-11-03 00:38:21 +00001108 tmp[jNode->dsize] = '\0';
Ilya Yanok70741002008-11-13 19:49:34 +03001109 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001110 break;
1111 }
1112 b2 = b2->next;
Ilya Yanok70741002008-11-13 19:49:34 +03001113 put_fl_mem(jNode, pL->readbuf);
wdenkfe8c2802002-11-03 00:38:21 +00001114 }
1115 /* ok so the name of the new file to find is in tmp */
1116 /* if it starts with a slash it is root based else shared dirs */
1117 if (tmp[0] == '/')
1118 pino = 1;
1119 else
wdenk998eaae2004-04-18 19:43:36 +00001120 pino = jDirFoundPino;
wdenkfe8c2802002-11-03 00:38:21 +00001121
1122 return jffs2_1pass_search_inode(pL, tmp, pino);
1123}
1124
1125static u32
1126jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino)
1127{
1128 int i;
1129 char tmp[256];
1130 char working_tmp[256];
1131 char *c;
1132
1133 /* discard any leading slash */
1134 i = 0;
1135 while (fname[i] == '/')
1136 i++;
1137 strcpy(tmp, &fname[i]);
1138 working_tmp[0] = '\0';
1139 while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */
1140 {
1141 strncpy(working_tmp, tmp, c - tmp);
1142 working_tmp[c - tmp] = '\0';
1143 for (i = 0; i < strlen(c) - 1; i++)
1144 tmp[i] = c[i + 1];
1145 tmp[i] = '\0';
1146 /* only a failure if we arent looking at top level */
wdenk06d01db2003-03-14 20:47:52 +00001147 if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) &&
1148 (working_tmp[0])) {
wdenkfe8c2802002-11-03 00:38:21 +00001149 putstr("find_inode failed for name=");
1150 putstr(working_tmp);
1151 putstr("\r\n");
1152 return 0;
1153 }
1154 }
1155
1156 if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) {
1157 putstr("find_inode failed for name=");
1158 putstr(tmp);
1159 putstr("\r\n");
1160 return 0;
1161 }
1162 /* this is for the bare filename, directories have already been mapped */
1163 if (!(pino = jffs2_1pass_list_inodes(pL, pino))) {
1164 putstr("find_inode failed for name=");
1165 putstr(tmp);
1166 putstr("\r\n");
1167 return 0;
1168 }
1169 return pino;
1170
1171}
1172
1173unsigned char
1174jffs2_1pass_rescan_needed(struct part_info *part)
1175{
1176 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001177 struct jffs2_unknown_node onode;
wdenkfe8c2802002-11-03 00:38:21 +00001178 struct jffs2_unknown_node *node;
wdenk06d01db2003-03-14 20:47:52 +00001179 struct b_lists *pL = (struct b_lists *)part->jffs2_priv;
wdenkfe8c2802002-11-03 00:38:21 +00001180
1181 if (part->jffs2_priv == 0){
1182 DEBUGF ("rescan: First time in use\n");
1183 return 1;
1184 }
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001185
wdenkfe8c2802002-11-03 00:38:21 +00001186 /* if we have no list, we need to rescan */
wdenk06d01db2003-03-14 20:47:52 +00001187 if (pL->frag.listCount == 0) {
wdenkfe8c2802002-11-03 00:38:21 +00001188 DEBUGF ("rescan: fraglist zero\n");
1189 return 1;
1190 }
1191
wdenk06d01db2003-03-14 20:47:52 +00001192 /* but suppose someone reflashed a partition at the same offset... */
1193 b = pL->dir.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001194 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001195 node = (struct jffs2_unknown_node *) get_fl_mem(b->offset,
1196 sizeof(onode), &onode);
wdenkfe8c2802002-11-03 00:38:21 +00001197 if (node->nodetype != JFFS2_NODETYPE_DIRENT) {
wdenk06d01db2003-03-14 20:47:52 +00001198 DEBUGF ("rescan: fs changed beneath me? (%lx)\n",
1199 (unsigned long) b->offset);
wdenkfe8c2802002-11-03 00:38:21 +00001200 return 1;
1201 }
1202 b = b->next;
1203 }
1204 return 0;
1205}
1206
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001207#ifdef CONFIG_JFFS2_SUMMARY
1208static u32 sum_get_unaligned32(u32 *ptr)
1209{
1210 u32 val;
1211 u8 *p = (u8 *)ptr;
1212
1213 val = *p | (*(p + 1) << 8) | (*(p + 2) << 16) | (*(p + 3) << 24);
1214
1215 return __le32_to_cpu(val);
1216}
1217
1218static u16 sum_get_unaligned16(u16 *ptr)
1219{
1220 u16 val;
1221 u8 *p = (u8 *)ptr;
1222
1223 val = *p | (*(p + 1) << 8);
1224
1225 return __le16_to_cpu(val);
1226}
1227
Ilya Yanok9b707622008-11-13 19:49:35 +03001228#define dbg_summary(...) do {} while (0);
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001229/*
1230 * Process the stored summary information - helper function for
Ilya Yanok9b707622008-11-13 19:49:35 +03001231 * jffs2_sum_scan_sumnode()
1232 */
1233
1234static int jffs2_sum_process_sum_data(struct part_info *part, uint32_t offset,
1235 struct jffs2_raw_summary *summary,
1236 struct b_lists *pL)
1237{
1238 void *sp;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001239 int i, pass;
1240 void *ret;
Ilya Yanok9b707622008-11-13 19:49:35 +03001241
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001242 for (pass = 0; pass < 2; pass++) {
1243 sp = summary->sum;
Ilya Yanok9b707622008-11-13 19:49:35 +03001244
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001245 for (i = 0; i < summary->sum_num; i++) {
1246 struct jffs2_sum_unknown_flash *spu = sp;
1247 dbg_summary("processing summary index %d\n", i);
Ilya Yanok9b707622008-11-13 19:49:35 +03001248
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001249 switch (sum_get_unaligned16(&spu->nodetype)) {
1250 case JFFS2_NODETYPE_INODE: {
Ilya Yanok9b707622008-11-13 19:49:35 +03001251 struct jffs2_sum_inode_flash *spi;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001252 if (pass) {
1253 spi = sp;
Ilya Yanok9b707622008-11-13 19:49:35 +03001254
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001255 ret = insert_node(&pL->frag,
1256 (u32)part->offset +
1257 offset +
1258 sum_get_unaligned32(
1259 &spi->offset));
1260 if (ret == NULL)
1261 return -1;
1262 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001263
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001264 sp += JFFS2_SUMMARY_INODE_SIZE;
Ilya Yanok9b707622008-11-13 19:49:35 +03001265
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001266 break;
1267 }
1268 case JFFS2_NODETYPE_DIRENT: {
1269 struct jffs2_sum_dirent_flash *spd;
1270 spd = sp;
1271 if (pass) {
1272 ret = insert_node(&pL->dir,
1273 (u32) part->offset +
1274 offset +
1275 sum_get_unaligned32(
1276 &spd->offset));
1277 if (ret == NULL)
1278 return -1;
1279 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001280
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001281 sp += JFFS2_SUMMARY_DIRENT_SIZE(
1282 spd->nsize);
Ilya Yanok9b707622008-11-13 19:49:35 +03001283
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001284 break;
1285 }
1286 default : {
1287 uint16_t nodetype = sum_get_unaligned16(
1288 &spu->nodetype);
1289 printf("Unsupported node type %x found"
1290 " in summary!\n",
1291 nodetype);
1292 if ((nodetype & JFFS2_COMPAT_MASK) ==
1293 JFFS2_FEATURE_INCOMPAT)
1294 return -EIO;
1295 return -EBADMSG;
1296 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001297 }
1298 }
1299 }
1300 return 0;
1301}
1302
1303/* Process the summary node - called from jffs2_scan_eraseblock() */
1304int jffs2_sum_scan_sumnode(struct part_info *part, uint32_t offset,
1305 struct jffs2_raw_summary *summary, uint32_t sumsize,
1306 struct b_lists *pL)
1307{
1308 struct jffs2_unknown_node crcnode;
1309 int ret, ofs;
1310 uint32_t crc;
1311
1312 ofs = part->sector_size - sumsize;
1313
1314 dbg_summary("summary found for 0x%08x at 0x%08x (0x%x bytes)\n",
1315 offset, offset + ofs, sumsize);
1316
1317 /* OK, now check for node validity and CRC */
1318 crcnode.magic = JFFS2_MAGIC_BITMASK;
1319 crcnode.nodetype = JFFS2_NODETYPE_SUMMARY;
1320 crcnode.totlen = summary->totlen;
1321 crc = crc32_no_comp(0, (uchar *)&crcnode, sizeof(crcnode)-4);
1322
1323 if (summary->hdr_crc != crc) {
1324 dbg_summary("Summary node header is corrupt (bad CRC or "
1325 "no summary at all)\n");
1326 goto crc_err;
1327 }
1328
1329 if (summary->totlen != sumsize) {
1330 dbg_summary("Summary node is corrupt (wrong erasesize?)\n");
1331 goto crc_err;
1332 }
1333
1334 crc = crc32_no_comp(0, (uchar *)summary,
1335 sizeof(struct jffs2_raw_summary)-8);
1336
1337 if (summary->node_crc != crc) {
1338 dbg_summary("Summary node is corrupt (bad CRC)\n");
1339 goto crc_err;
1340 }
1341
1342 crc = crc32_no_comp(0, (uchar *)summary->sum,
1343 sumsize - sizeof(struct jffs2_raw_summary));
1344
1345 if (summary->sum_crc != crc) {
1346 dbg_summary("Summary node data is corrupt (bad CRC)\n");
1347 goto crc_err;
1348 }
1349
1350 if (summary->cln_mkr)
1351 dbg_summary("Summary : CLEANMARKER node \n");
1352
1353 ret = jffs2_sum_process_sum_data(part, offset, summary, pL);
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001354 if (ret == -EBADMSG)
1355 return 0;
Ilya Yanok9b707622008-11-13 19:49:35 +03001356 if (ret)
1357 return ret; /* real error */
1358
1359 return 1;
1360
1361crc_err:
1362 putstr("Summary node crc error, skipping summary information.\n");
1363
1364 return 0;
1365}
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001366#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanok9b707622008-11-13 19:49:35 +03001367
wdenk06d01db2003-03-14 20:47:52 +00001368#ifdef DEBUG_FRAGMENTS
1369static void
1370dump_fragments(struct b_lists *pL)
1371{
1372 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001373 struct jffs2_raw_inode ojNode;
wdenk06d01db2003-03-14 20:47:52 +00001374 struct jffs2_raw_inode *jNode;
1375
1376 putstr("\r\n\r\n******The fragment Entries******\r\n");
1377 b = pL->frag.listHead;
1378 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001379 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1380 sizeof(ojNode), &ojNode);
wdenk06d01db2003-03-14 20:47:52 +00001381 putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset);
1382 putLabeledWord("\tbuild_list: totlen = ", jNode->totlen);
1383 putLabeledWord("\tbuild_list: inode = ", jNode->ino);
1384 putLabeledWord("\tbuild_list: version = ", jNode->version);
1385 putLabeledWord("\tbuild_list: isize = ", jNode->isize);
1386 putLabeledWord("\tbuild_list: atime = ", jNode->atime);
1387 putLabeledWord("\tbuild_list: offset = ", jNode->offset);
1388 putLabeledWord("\tbuild_list: csize = ", jNode->csize);
1389 putLabeledWord("\tbuild_list: dsize = ", jNode->dsize);
1390 putLabeledWord("\tbuild_list: compr = ", jNode->compr);
1391 putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr);
1392 putLabeledWord("\tbuild_list: flags = ", jNode->flags);
wdenk8bde7f72003-06-27 21:31:46 +00001393 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001394 b = b->next;
1395 }
1396}
1397#endif
1398
1399#ifdef DEBUG_DIRENTS
1400static void
1401dump_dirents(struct b_lists *pL)
1402{
1403 struct b_node *b;
1404 struct jffs2_raw_dirent *jDir;
1405
1406 putstr("\r\n\r\n******The directory Entries******\r\n");
1407 b = pL->dir.listHead;
1408 while (b) {
Ilya Yanok70741002008-11-13 19:49:34 +03001409 jDir = (struct jffs2_raw_dirent *) get_node_mem(b->offset,
1410 pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +00001411 putstr("\r\n");
1412 putnstr(jDir->name, jDir->nsize);
1413 putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic);
1414 putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype);
1415 putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc);
1416 putLabeledWord("\tbuild_list: pino = ", jDir->pino);
1417 putLabeledWord("\tbuild_list: version = ", jDir->version);
1418 putLabeledWord("\tbuild_list: ino = ", jDir->ino);
1419 putLabeledWord("\tbuild_list: mctime = ", jDir->mctime);
1420 putLabeledWord("\tbuild_list: nsize = ", jDir->nsize);
1421 putLabeledWord("\tbuild_list: type = ", jDir->type);
1422 putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc);
1423 putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc);
Wolfgang Denk53677ef2008-05-20 16:00:29 +02001424 putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */
wdenk06d01db2003-03-14 20:47:52 +00001425 b = b->next;
Ilya Yanok70741002008-11-13 19:49:34 +03001426 put_fl_mem(jDir, pL->readbuf);
wdenk06d01db2003-03-14 20:47:52 +00001427 }
1428}
1429#endif
1430
Ilya Yanok8a36d312008-11-13 19:49:33 +03001431#define DEFAULT_EMPTY_SCAN_SIZE 4096
1432
1433static inline uint32_t EMPTY_SCAN_SIZE(uint32_t sector_size)
1434{
1435 if (sector_size < DEFAULT_EMPTY_SCAN_SIZE)
1436 return sector_size;
1437 else
1438 return DEFAULT_EMPTY_SCAN_SIZE;
1439}
1440
wdenkfe8c2802002-11-03 00:38:21 +00001441static u32
1442jffs2_1pass_build_lists(struct part_info * part)
1443{
1444 struct b_lists *pL;
1445 struct jffs2_unknown_node *node;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001446 u32 nr_sectors = part->size/part->sector_size;
1447 u32 i;
wdenkfe8c2802002-11-03 00:38:21 +00001448 u32 counter4 = 0;
1449 u32 counterF = 0;
1450 u32 counterN = 0;
Ilya Yanok70741002008-11-13 19:49:34 +03001451 u32 max_totlen = 0;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001452 u32 buf_size = DEFAULT_EMPTY_SCAN_SIZE;
1453 char *buf;
wdenkfe8c2802002-11-03 00:38:21 +00001454
1455 /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */
1456 /* jffs2 list building enterprise nope. in newer versions the overhead is */
1457 /* only about 5 %. not enough to inconvenience people for. */
1458 /* lcd_off(); */
1459
1460 /* if we are building a list we need to refresh the cache. */
wdenkfe8c2802002-11-03 00:38:21 +00001461 jffs_init_1pass_list(part);
wdenk06d01db2003-03-14 20:47:52 +00001462 pL = (struct b_lists *)part->jffs2_priv;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001463 buf = malloc(buf_size);
wdenk4b9206e2004-03-23 22:14:11 +00001464 puts ("Scanning JFFS2 FS: ");
wdenkfe8c2802002-11-03 00:38:21 +00001465
1466 /* start at the beginning of the partition */
Ilya Yanok8a36d312008-11-13 19:49:33 +03001467 for (i = 0; i < nr_sectors; i++) {
1468 uint32_t sector_ofs = i * part->sector_size;
1469 uint32_t buf_ofs = sector_ofs;
Ilya Yanok9b707622008-11-13 19:49:35 +03001470 uint32_t buf_len;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001471 uint32_t ofs, prevofs;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001472#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanok9b707622008-11-13 19:49:35 +03001473 struct jffs2_sum_marker *sm;
1474 void *sumptr = NULL;
1475 uint32_t sumlen;
1476 int ret;
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001477#endif
wdenk0b8fa032004-04-25 14:37:29 +00001478
Stuart Wood86d32732008-06-02 16:40:08 -04001479 WATCHDOG_RESET();
Ilya Yanok9b707622008-11-13 19:49:35 +03001480
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001481#ifdef CONFIG_JFFS2_SUMMARY
Ilya Yanok9b707622008-11-13 19:49:35 +03001482 buf_len = sizeof(*sm);
1483
1484 /* Read as much as we want into the _end_ of the preallocated
1485 * buffer
1486 */
1487 get_fl_mem(part->offset + sector_ofs + part->sector_size -
1488 buf_len, buf_len, buf + buf_size - buf_len);
1489
1490 sm = (void *)buf + buf_size - sizeof(*sm);
1491 if (sm->magic == JFFS2_SUM_MAGIC) {
1492 sumlen = part->sector_size - sm->offset;
1493 sumptr = buf + buf_size - sumlen;
1494
1495 /* Now, make sure the summary itself is available */
1496 if (sumlen > buf_size) {
1497 /* Need to kmalloc for this. */
1498 sumptr = malloc(sumlen);
1499 if (!sumptr) {
1500 putstr("Can't get memory for summary "
1501 "node!\n");
Ilya Yanokb6440062009-08-12 16:42:48 +04001502 free(buf);
1503 jffs2_free_cache(part);
Ilya Yanok9b707622008-11-13 19:49:35 +03001504 return 0;
1505 }
1506 memcpy(sumptr + sumlen - buf_len, buf +
1507 buf_size - buf_len, buf_len);
1508 }
1509 if (buf_len < sumlen) {
1510 /* Need to read more so that the entire summary
1511 * node is present
1512 */
1513 get_fl_mem(part->offset + sector_ofs +
1514 part->sector_size - sumlen,
1515 sumlen - buf_len, sumptr);
1516 }
1517 }
1518
1519 if (sumptr) {
1520 ret = jffs2_sum_scan_sumnode(part, sector_ofs, sumptr,
1521 sumlen, pL);
1522
1523 if (buf_size && sumlen > buf_size)
1524 free(sumptr);
Ilya Yanokb6440062009-08-12 16:42:48 +04001525 if (ret < 0) {
1526 free(buf);
1527 jffs2_free_cache(part);
Ilya Yanok9b707622008-11-13 19:49:35 +03001528 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001529 }
Ilya Yanok9b707622008-11-13 19:49:35 +03001530 if (ret)
1531 continue;
1532
1533 }
Ilya Yanok8cf19b92009-07-17 15:02:42 +04001534#endif /* CONFIG_JFFS2_SUMMARY */
Ilya Yanok9b707622008-11-13 19:49:35 +03001535
1536 buf_len = EMPTY_SCAN_SIZE(part->sector_size);
1537
Ilya Yanok8a36d312008-11-13 19:49:33 +03001538 get_fl_mem((u32)part->offset + buf_ofs, buf_len, buf);
Stuart Wood86d32732008-06-02 16:40:08 -04001539
Ilya Yanok8a36d312008-11-13 19:49:33 +03001540 /* We temporarily use 'ofs' as a pointer into the buffer/jeb */
1541 ofs = 0;
1542
1543 /* Scan only 4KiB of 0xFF before declaring it's empty */
1544 while (ofs < EMPTY_SCAN_SIZE(part->sector_size) &&
1545 *(uint32_t *)(&buf[ofs]) == 0xFFFFFFFF)
1546 ofs += 4;
1547
1548 if (ofs == EMPTY_SCAN_SIZE(part->sector_size))
1549 continue;
1550
1551 ofs += sector_ofs;
1552 prevofs = ofs - 1;
1553
1554 scan_more:
1555 while (ofs < sector_ofs + part->sector_size) {
1556 if (ofs == prevofs) {
1557 printf("offset %08x already seen, skip\n", ofs);
1558 ofs += 4;
1559 counter4++;
1560 continue;
1561 }
1562 prevofs = ofs;
1563 if (sector_ofs + part->sector_size <
1564 ofs + sizeof(*node))
1565 break;
1566 if (buf_ofs + buf_len < ofs + sizeof(*node)) {
1567 buf_len = min_t(uint32_t, buf_size, sector_ofs
1568 + part->sector_size - ofs);
1569 get_fl_mem((u32)part->offset + ofs, buf_len,
1570 buf);
1571 buf_ofs = ofs;
1572 }
1573
1574 node = (struct jffs2_unknown_node *)&buf[ofs-buf_ofs];
1575
1576 if (*(uint32_t *)(&buf[ofs-buf_ofs]) == 0xffffffff) {
1577 uint32_t inbuf_ofs;
1578 uint32_t empty_start, scan_end;
1579
1580 empty_start = ofs;
1581 ofs += 4;
1582 scan_end = min_t(uint32_t, EMPTY_SCAN_SIZE(
1583 part->sector_size)/8,
1584 buf_len);
1585 more_empty:
1586 inbuf_ofs = ofs - buf_ofs;
1587 while (inbuf_ofs < scan_end) {
1588 if (*(uint32_t *)(&buf[inbuf_ofs]) !=
1589 0xffffffff)
1590 goto scan_more;
1591
1592 inbuf_ofs += 4;
1593 ofs += 4;
wdenk998eaae2004-04-18 19:43:36 +00001594 }
Ilya Yanok8a36d312008-11-13 19:49:33 +03001595 /* Ran off end. */
1596
1597 /* See how much more there is to read in this
1598 * eraseblock...
1599 */
1600 buf_len = min_t(uint32_t, buf_size,
1601 sector_ofs +
1602 part->sector_size - ofs);
1603 if (!buf_len) {
1604 /* No more to read. Break out of main
1605 * loop without marking this range of
1606 * empty space as dirty (because it's
1607 * not)
1608 */
1609 break;
1610 }
1611 scan_end = buf_len;
1612 get_fl_mem((u32)part->offset + ofs, buf_len,
1613 buf);
1614 buf_ofs = ofs;
1615 goto more_empty;
1616 }
1617 if (node->magic != JFFS2_MAGIC_BITMASK ||
1618 !hdr_crc(node)) {
1619 ofs += 4;
1620 counter4++;
1621 continue;
1622 }
1623 if (ofs + node->totlen >
1624 sector_ofs + part->sector_size) {
1625 ofs += 4;
1626 counter4++;
1627 continue;
1628 }
1629 /* if its a fragment add it */
1630 switch (node->nodetype) {
1631 case JFFS2_NODETYPE_INODE:
1632 if (buf_ofs + buf_len < ofs + sizeof(struct
1633 jffs2_raw_inode)) {
1634 get_fl_mem((u32)part->offset + ofs,
1635 buf_len, buf);
1636 buf_ofs = ofs;
1637 node = (void *)buf;
1638 }
1639 if (!inode_crc((struct jffs2_raw_inode *) node))
1640 break;
1641
1642 if (insert_node(&pL->frag, (u32) part->offset +
Ilya Yanokb6440062009-08-12 16:42:48 +04001643 ofs) == NULL) {
1644 free(buf);
1645 jffs2_free_cache(part);
Ilya Yanok8a36d312008-11-13 19:49:33 +03001646 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001647 }
Ilya Yanok70741002008-11-13 19:49:34 +03001648 if (max_totlen < node->totlen)
1649 max_totlen = node->totlen;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001650 break;
1651 case JFFS2_NODETYPE_DIRENT:
1652 if (buf_ofs + buf_len < ofs + sizeof(struct
1653 jffs2_raw_dirent) +
1654 ((struct
1655 jffs2_raw_dirent *)
1656 node)->nsize) {
1657 get_fl_mem((u32)part->offset + ofs,
1658 buf_len, buf);
1659 buf_ofs = ofs;
1660 node = (void *)buf;
1661 }
1662
1663 if (!dirent_crc((struct jffs2_raw_dirent *)
1664 node) ||
1665 !dirent_name_crc(
1666 (struct
1667 jffs2_raw_dirent *)
1668 node))
1669 break;
wdenkfc1cfcd2004-04-25 15:41:35 +00001670 if (! (counterN%100))
wdenk4b9206e2004-03-23 22:14:11 +00001671 puts ("\b\b. ");
wdenk06d01db2003-03-14 20:47:52 +00001672 if (insert_node(&pL->dir, (u32) part->offset +
Ilya Yanokb6440062009-08-12 16:42:48 +04001673 ofs) == NULL) {
1674 free(buf);
1675 jffs2_free_cache(part);
wdenkfe8c2802002-11-03 00:38:21 +00001676 return 0;
Ilya Yanokb6440062009-08-12 16:42:48 +04001677 }
Ilya Yanok70741002008-11-13 19:49:34 +03001678 if (max_totlen < node->totlen)
1679 max_totlen = node->totlen;
wdenkfe8c2802002-11-03 00:38:21 +00001680 counterN++;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001681 break;
1682 case JFFS2_NODETYPE_CLEANMARKER:
wdenkfe8c2802002-11-03 00:38:21 +00001683 if (node->totlen != sizeof(struct jffs2_unknown_node))
wdenk06d01db2003-03-14 20:47:52 +00001684 printf("OOPS Cleanmarker has bad size "
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001685 "%d != %zu\n",
1686 node->totlen,
wdenk06d01db2003-03-14 20:47:52 +00001687 sizeof(struct jffs2_unknown_node));
Ilya Yanok8a36d312008-11-13 19:49:33 +03001688 break;
1689 case JFFS2_NODETYPE_PADDING:
wdenk7205e402003-09-10 22:30:53 +00001690 if (node->totlen < sizeof(struct jffs2_unknown_node))
1691 printf("OOPS Padding has bad size "
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001692 "%d < %zu\n",
1693 node->totlen,
wdenk7205e402003-09-10 22:30:53 +00001694 sizeof(struct jffs2_unknown_node));
Ilya Yanok8a36d312008-11-13 19:49:33 +03001695 break;
Ilya Yanok9b707622008-11-13 19:49:35 +03001696 case JFFS2_NODETYPE_SUMMARY:
1697 break;
Ilya Yanok8a36d312008-11-13 19:49:33 +03001698 default:
Wolfgang Denkb64f1902008-07-14 15:06:35 +02001699 printf("Unknown node type: %x len %d offset 0x%x\n",
1700 node->nodetype,
Ilya Yanok8a36d312008-11-13 19:49:33 +03001701 node->totlen, ofs);
wdenkfe8c2802002-11-03 00:38:21 +00001702 }
Ilya Yanok8a36d312008-11-13 19:49:33 +03001703 ofs += ((node->totlen + 3) & ~3);
wdenkfe8c2802002-11-03 00:38:21 +00001704 counterF++;
wdenkfe8c2802002-11-03 00:38:21 +00001705 }
wdenkfe8c2802002-11-03 00:38:21 +00001706 }
1707
Ilya Yanok8a36d312008-11-13 19:49:33 +03001708 free(buf);
wdenkfe8c2802002-11-03 00:38:21 +00001709 putstr("\b\b done.\r\n"); /* close off the dots */
Ilya Yanok70741002008-11-13 19:49:34 +03001710
1711 /* We don't care if malloc failed - then each read operation will
1712 * allocate its own buffer as necessary (NAND) or will read directly
1713 * from flash (NOR).
1714 */
1715 pL->readbuf = malloc(max_totlen);
1716
wdenkfe8c2802002-11-03 00:38:21 +00001717 /* turn the lcd back on. */
1718 /* splash(); */
1719
1720#if 0
wdenk06d01db2003-03-14 20:47:52 +00001721 putLabeledWord("dir entries = ", pL->dir.listCount);
1722 putLabeledWord("frag entries = ", pL->frag.listCount);
wdenkfe8c2802002-11-03 00:38:21 +00001723 putLabeledWord("+4 increments = ", counter4);
1724 putLabeledWord("+file_offset increments = ", counterF);
1725
1726#endif
1727
wdenk06d01db2003-03-14 20:47:52 +00001728#ifdef DEBUG_DIRENTS
1729 dump_dirents(pL);
1730#endif
wdenkfe8c2802002-11-03 00:38:21 +00001731
wdenk06d01db2003-03-14 20:47:52 +00001732#ifdef DEBUG_FRAGMENTS
1733 dump_fragments(pL);
1734#endif
wdenkfe8c2802002-11-03 00:38:21 +00001735
wdenkfe8c2802002-11-03 00:38:21 +00001736 /* give visual feedback that we are done scanning the flash */
1737 led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */
1738 return 1;
1739}
1740
1741
wdenkfe8c2802002-11-03 00:38:21 +00001742static u32
1743jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL)
1744{
1745 struct b_node *b;
wdenk998eaae2004-04-18 19:43:36 +00001746 struct jffs2_raw_inode ojNode;
wdenkfe8c2802002-11-03 00:38:21 +00001747 struct jffs2_raw_inode *jNode;
1748 int i;
1749
wdenkfe8c2802002-11-03 00:38:21 +00001750 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
1751 piL->compr_info[i].num_frags = 0;
1752 piL->compr_info[i].compr_sum = 0;
1753 piL->compr_info[i].decompr_sum = 0;
1754 }
1755
wdenk06d01db2003-03-14 20:47:52 +00001756 b = pL->frag.listHead;
wdenkfe8c2802002-11-03 00:38:21 +00001757 while (b) {
wdenk998eaae2004-04-18 19:43:36 +00001758 jNode = (struct jffs2_raw_inode *) get_fl_mem(b->offset,
1759 sizeof(ojNode), &ojNode);
wdenkfe8c2802002-11-03 00:38:21 +00001760 if (jNode->compr < JFFS2_NUM_COMPR) {
1761 piL->compr_info[jNode->compr].num_frags++;
1762 piL->compr_info[jNode->compr].compr_sum += jNode->csize;
1763 piL->compr_info[jNode->compr].decompr_sum += jNode->dsize;
1764 }
1765 b = b->next;
1766 }
1767 return 0;
1768}
1769
1770
wdenkfe8c2802002-11-03 00:38:21 +00001771static struct b_lists *
1772jffs2_get_list(struct part_info * part, const char *who)
1773{
Wolfgang Denk700a0c62005-08-08 01:03:24 +02001774 /* copy requested part_info struct pointer to global location */
1775 current_part = part;
1776
wdenkfe8c2802002-11-03 00:38:21 +00001777 if (jffs2_1pass_rescan_needed(part)) {
1778 if (!jffs2_1pass_build_lists(part)) {
1779 printf("%s: Failed to scan JFFSv2 file structure\n", who);
1780 return NULL;
1781 }
1782 }
1783 return (struct b_lists *)part->jffs2_priv;
1784}
1785
1786
1787/* Print directory / file contents */
1788u32
1789jffs2_1pass_ls(struct part_info * part, const char *fname)
1790{
1791 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001792 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001793 u32 inode;
1794
wdenk06d01db2003-03-14 20:47:52 +00001795 if (! (pl = jffs2_get_list(part, "ls")))
wdenkfe8c2802002-11-03 00:38:21 +00001796 return 0;
1797
1798 if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) {
1799 putstr("ls: Failed to scan jffs2 file structure\r\n");
1800 return 0;
1801 }
wdenkfc1cfcd2004-04-25 15:41:35 +00001802
1803
wdenkfe8c2802002-11-03 00:38:21 +00001804#if 0
1805 putLabeledWord("found file at inode = ", inode);
1806 putLabeledWord("read_inode returns = ", ret);
1807#endif
wdenkfc1cfcd2004-04-25 15:41:35 +00001808
1809 return ret;
wdenkfe8c2802002-11-03 00:38:21 +00001810}
1811
1812
wdenkfe8c2802002-11-03 00:38:21 +00001813/* Load a file from flash into memory. fname can be a full path */
1814u32
1815jffs2_1pass_load(char *dest, struct part_info * part, const char *fname)
1816{
1817
1818 struct b_lists *pl;
Wolfgang Denk87b8bd52005-08-16 09:32:45 +02001819 long ret = 1;
wdenkfe8c2802002-11-03 00:38:21 +00001820 u32 inode;
1821
1822 if (! (pl = jffs2_get_list(part, "load")))
1823 return 0;
1824
1825 if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) {
1826 putstr("load: Failed to find inode\r\n");
1827 return 0;
1828 }
1829
1830 /* Resolve symlinks */
1831 if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) {
1832 putstr("load: Failed to resolve inode structure\r\n");
1833 return 0;
1834 }
1835
1836 if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) {
1837 putstr("load: Failed to read inode\r\n");
1838 return 0;
1839 }
1840
1841 DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname,
1842 (unsigned long) dest, ret);
1843 return ret;
1844}
1845
1846/* Return information about the fs on this partition */
1847u32
1848jffs2_1pass_info(struct part_info * part)
1849{
1850 struct b_jffs2_info info;
1851 struct b_lists *pl;
1852 int i;
1853
1854 if (! (pl = jffs2_get_list(part, "info")))
1855 return 0;
1856
1857 jffs2_1pass_fill_info(pl, &info);
wdenk06d01db2003-03-14 20:47:52 +00001858 for (i = 0; i < JFFS2_NUM_COMPR; i++) {
wdenk4b9206e2004-03-23 22:14:11 +00001859 printf ("Compression: %s\n"
1860 "\tfrag count: %d\n"
1861 "\tcompressed sum: %d\n"
1862 "\tuncompressed sum: %d\n",
1863 compr_names[i],
1864 info.compr_info[i].num_frags,
1865 info.compr_info[i].compr_sum,
1866 info.compr_info[i].decompr_sum);
wdenkfe8c2802002-11-03 00:38:21 +00001867 }
1868 return 1;
1869}