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 * 9506d01dbeSwdenk * The fragment sorting feature must be enabled by CFG_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> 117fe8c2806Swdenk #include <linux/stat.h> 118fe8c2806Swdenk #include <linux/time.h> 119fe8c2806Swdenk 120fe8c2806Swdenk #if (CONFIG_COMMANDS & CFG_CMD_JFFS2) 121fe8c2806Swdenk 122fe8c2806Swdenk #include <jffs2/jffs2.h> 123fe8c2806Swdenk #include <jffs2/jffs2_1pass.h> 124fe8c2806Swdenk 125fe8c2806Swdenk #include "jffs2_private.h" 126fe8c2806Swdenk 12706d01dbeSwdenk 12806d01dbeSwdenk #define NODE_CHUNK 1024 /* size of memory allocation chunk in b_nodes */ 12906d01dbeSwdenk #define SPIN_BLKSIZE 18 /* spin after having scanned 1<<BLKSIZE bytes */ 13006d01dbeSwdenk 13106d01dbeSwdenk /* Debugging switches */ 13206d01dbeSwdenk #undef DEBUG_DIRENTS /* print directory entry list after scan */ 13306d01dbeSwdenk #undef DEBUG_FRAGMENTS /* print fragment list after scan */ 13406d01dbeSwdenk #undef DEBUG /* enable debugging messages */ 13506d01dbeSwdenk 13606d01dbeSwdenk 13706d01dbeSwdenk #ifdef DEBUG 13806d01dbeSwdenk # define DEBUGF(fmt,args...) printf(fmt ,##args) 13906d01dbeSwdenk #else 14006d01dbeSwdenk # define DEBUGF(fmt,args...) 14106d01dbeSwdenk #endif 14206d01dbeSwdenk 14306d01dbeSwdenk 144fe8c2806Swdenk /* Compression names */ 145fe8c2806Swdenk static char *compr_names[] = { 146fe8c2806Swdenk "NONE", 147fe8c2806Swdenk "ZERO", 148fe8c2806Swdenk "RTIME", 149fe8c2806Swdenk "RUBINMIPS", 150fe8c2806Swdenk "COPY", 151fe8c2806Swdenk "DYNRUBIN", 15206d01dbeSwdenk "ZLIB" 15306d01dbeSwdenk }; 154fe8c2806Swdenk 15506d01dbeSwdenk /* Spinning wheel */ 15606d01dbeSwdenk static char spinner[] = { '|', '/', '-', '\\' }; 157fe8c2806Swdenk 15806d01dbeSwdenk /* Memory management */ 15906d01dbeSwdenk struct mem_block { 16006d01dbeSwdenk u32 index; 16106d01dbeSwdenk struct mem_block *next; 16206d01dbeSwdenk struct b_node nodes[NODE_CHUNK]; 16306d01dbeSwdenk }; 164fe8c2806Swdenk 165fe8c2806Swdenk 16606d01dbeSwdenk static void 16706d01dbeSwdenk free_nodes(struct b_list *list) 16806d01dbeSwdenk { 16906d01dbeSwdenk while (list->listMemBase != NULL) { 17006d01dbeSwdenk struct mem_block *next = list->listMemBase->next; 17106d01dbeSwdenk free( list->listMemBase ); 17206d01dbeSwdenk list->listMemBase = next; 17306d01dbeSwdenk } 17406d01dbeSwdenk } 175fe8c2806Swdenk 176fe8c2806Swdenk static struct b_node * 17706d01dbeSwdenk add_node(struct b_list *list) 178fe8c2806Swdenk { 17906d01dbeSwdenk u32 index = 0; 18006d01dbeSwdenk struct mem_block *memBase; 181fe8c2806Swdenk struct b_node *b; 182fe8c2806Swdenk 18306d01dbeSwdenk memBase = list->listMemBase; 18406d01dbeSwdenk if (memBase != NULL) 18506d01dbeSwdenk index = memBase->index; 186fe8c2806Swdenk #if 0 187fe8c2806Swdenk putLabeledWord("add_node: index = ", index); 18806d01dbeSwdenk putLabeledWord("add_node: memBase = ", list->listMemBase); 189fe8c2806Swdenk #endif 190fe8c2806Swdenk 19106d01dbeSwdenk if (memBase == NULL || index >= NODE_CHUNK) { 19206d01dbeSwdenk /* we need more space before we continue */ 19306d01dbeSwdenk memBase = mmalloc(sizeof(struct mem_block)); 19406d01dbeSwdenk if (memBase == NULL) { 195fe8c2806Swdenk putstr("add_node: malloc failed\n"); 196fe8c2806Swdenk return NULL; 197fe8c2806Swdenk } 19806d01dbeSwdenk memBase->next = list->listMemBase; 19906d01dbeSwdenk index = 0; 200fe8c2806Swdenk #if 0 201fe8c2806Swdenk putLabeledWord("add_node: alloced a new membase at ", *memBase); 202fe8c2806Swdenk #endif 203fe8c2806Swdenk 204fe8c2806Swdenk } 205fe8c2806Swdenk /* now we have room to add it. */ 20606d01dbeSwdenk b = &memBase->nodes[index]; 20706d01dbeSwdenk index ++; 208fe8c2806Swdenk 20906d01dbeSwdenk memBase->index = index; 21006d01dbeSwdenk list->listMemBase = memBase; 21106d01dbeSwdenk list->listCount++; 212fe8c2806Swdenk return b; 213fe8c2806Swdenk } 214fe8c2806Swdenk 21506d01dbeSwdenk static struct b_node * 21606d01dbeSwdenk insert_node(struct b_list *list, u32 offset) 21706d01dbeSwdenk { 21806d01dbeSwdenk struct b_node *new; 21906d01dbeSwdenk #ifdef CFG_JFFS2_SORT_FRAGMENTS 22006d01dbeSwdenk struct b_node *b, *prev; 22106d01dbeSwdenk #endif 22206d01dbeSwdenk 22306d01dbeSwdenk if (!(new = add_node(list))) { 22406d01dbeSwdenk putstr("add_node failed!\r\n"); 22506d01dbeSwdenk return NULL; 22606d01dbeSwdenk } 22706d01dbeSwdenk new->offset = offset; 22806d01dbeSwdenk 22906d01dbeSwdenk #ifdef CFG_JFFS2_SORT_FRAGMENTS 23006d01dbeSwdenk if (list->listTail != NULL && list->listCompare(new, list->listTail)) 23106d01dbeSwdenk prev = list->listTail; 23206d01dbeSwdenk else if (list->listLast != NULL && list->listCompare(new, list->listLast)) 23306d01dbeSwdenk prev = list->listLast; 23406d01dbeSwdenk else 23506d01dbeSwdenk prev = NULL; 23606d01dbeSwdenk 23706d01dbeSwdenk for (b = (prev ? prev->next : list->listHead); 23806d01dbeSwdenk b != NULL && list->listCompare(new, b); 23906d01dbeSwdenk prev = b, b = b->next) { 24006d01dbeSwdenk list->listLoops++; 24106d01dbeSwdenk } 24206d01dbeSwdenk if (b != NULL) 24306d01dbeSwdenk list->listLast = prev; 24406d01dbeSwdenk 24506d01dbeSwdenk if (b != NULL) { 24606d01dbeSwdenk new->next = b; 24706d01dbeSwdenk if (prev != NULL) 24806d01dbeSwdenk prev->next = new; 24906d01dbeSwdenk else 25006d01dbeSwdenk list->listHead = new; 25106d01dbeSwdenk } else 25206d01dbeSwdenk #endif 25306d01dbeSwdenk { 25406d01dbeSwdenk new->next = (struct b_node *) NULL; 25506d01dbeSwdenk if (list->listTail != NULL) { 25606d01dbeSwdenk list->listTail->next = new; 25706d01dbeSwdenk list->listTail = new; 25806d01dbeSwdenk } else { 25906d01dbeSwdenk list->listTail = list->listHead = new; 26006d01dbeSwdenk } 26106d01dbeSwdenk } 26206d01dbeSwdenk 26306d01dbeSwdenk return new; 26406d01dbeSwdenk } 26506d01dbeSwdenk 26606d01dbeSwdenk #ifdef CFG_JFFS2_SORT_FRAGMENTS 2677205e407Swdenk /* Sort data entries with the latest version last, so that if there 2687205e407Swdenk * is overlapping data the latest version will be used. 2697205e407Swdenk */ 27006d01dbeSwdenk static int compare_inodes(struct b_node *new, struct b_node *old) 27106d01dbeSwdenk { 27206d01dbeSwdenk struct jffs2_raw_inode *jNew = (struct jffs2_raw_inode *)new->offset; 27306d01dbeSwdenk struct jffs2_raw_inode *jOld = (struct jffs2_raw_inode *)old->offset; 27406d01dbeSwdenk 2757205e407Swdenk return jNew->version > jOld->version; 27606d01dbeSwdenk } 27706d01dbeSwdenk 2787205e407Swdenk /* Sort directory entries so all entries in the same directory 2797205e407Swdenk * with the same name are grouped together, with the latest version 2807205e407Swdenk * last. This makes it easy to eliminate all but the latest version 2817205e407Swdenk * by marking the previous version dead by setting the inode to 0. 2827205e407Swdenk */ 28306d01dbeSwdenk static int compare_dirents(struct b_node *new, struct b_node *old) 28406d01dbeSwdenk { 28506d01dbeSwdenk struct jffs2_raw_dirent *jNew = (struct jffs2_raw_dirent *)new->offset; 28606d01dbeSwdenk struct jffs2_raw_dirent *jOld = (struct jffs2_raw_dirent *)old->offset; 2877205e407Swdenk int cmp; 28806d01dbeSwdenk 2897205e407Swdenk /* ascending sort by pino */ 2907205e407Swdenk if (jNew->pino != jOld->pino) 2917205e407Swdenk return jNew->pino > jOld->pino; 2927205e407Swdenk 2937205e407Swdenk /* pino is the same, so use ascending sort by nsize, so 2947205e407Swdenk * we don't do strncmp unless we really must. 2957205e407Swdenk */ 2967205e407Swdenk if (jNew->nsize != jOld->nsize) 2977205e407Swdenk return jNew->nsize > jOld->nsize; 2987205e407Swdenk 2997205e407Swdenk /* length is also the same, so use ascending sort by name 3007205e407Swdenk */ 3017205e407Swdenk cmp = strncmp(jNew->name, jOld->name, jNew->nsize); 3027205e407Swdenk if (cmp != 0) 3037205e407Swdenk return cmp > 0; 3047205e407Swdenk 3057205e407Swdenk /* we have duplicate names in this directory, so use ascending 3067205e407Swdenk * sort by version 3077205e407Swdenk */ 3087205e407Swdenk if (jNew->version > jOld->version) { 3097205e407Swdenk /* since jNew is newer, we know jOld is not valid, so 3107205e407Swdenk * mark it with inode 0 and it will not be used 3117205e407Swdenk */ 3127205e407Swdenk jOld->ino = 0; 3137205e407Swdenk return 1; 3147205e407Swdenk } 3157205e407Swdenk 3167205e407Swdenk return 0; 31706d01dbeSwdenk } 31806d01dbeSwdenk #endif 319fe8c2806Swdenk 320fe8c2806Swdenk static u32 321fe8c2806Swdenk jffs2_scan_empty(u32 start_offset, struct part_info *part) 322fe8c2806Swdenk { 32306d01dbeSwdenk char *max = part->offset + part->size - sizeof(struct jffs2_raw_inode); 32406d01dbeSwdenk char *offset = part->offset + start_offset; 325fe8c2806Swdenk 32606d01dbeSwdenk while (offset < max && *(u32 *)offset == 0xFFFFFFFF) { 32706d01dbeSwdenk offset += sizeof(u32); 32806d01dbeSwdenk /* return if spinning is due */ 32906d01dbeSwdenk if (((u32)offset & ((1 << SPIN_BLKSIZE)-1)) == 0) break; 33006d01dbeSwdenk } 331fe8c2806Swdenk 33206d01dbeSwdenk return offset - part->offset; 333fe8c2806Swdenk } 334fe8c2806Swdenk 335fe8c2806Swdenk static u32 336fe8c2806Swdenk jffs_init_1pass_list(struct part_info *part) 337fe8c2806Swdenk { 33806d01dbeSwdenk struct b_lists *pL; 339fe8c2806Swdenk 34006d01dbeSwdenk if (part->jffs2_priv != NULL) { 34106d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 34206d01dbeSwdenk free_nodes(&pL->frag); 34306d01dbeSwdenk free_nodes(&pL->dir); 34406d01dbeSwdenk free(pL); 34506d01dbeSwdenk } 34606d01dbeSwdenk if (NULL != (part->jffs2_priv = malloc(sizeof(struct b_lists)))) { 34706d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 34806d01dbeSwdenk 34906d01dbeSwdenk memset(pL, 0, sizeof(*pL)); 35006d01dbeSwdenk #ifdef CFG_JFFS2_SORT_FRAGMENTS 35106d01dbeSwdenk pL->dir.listCompare = compare_dirents; 35206d01dbeSwdenk pL->frag.listCompare = compare_inodes; 35306d01dbeSwdenk #endif 354fe8c2806Swdenk } 355fe8c2806Swdenk return 0; 356fe8c2806Swdenk } 357fe8c2806Swdenk 358fe8c2806Swdenk /* find the inode from the slashless name given a parent */ 359fe8c2806Swdenk static long 360fe8c2806Swdenk jffs2_1pass_read_inode(struct b_lists *pL, u32 inode, char *dest) 361fe8c2806Swdenk { 362fe8c2806Swdenk struct b_node *b; 363fe8c2806Swdenk struct jffs2_raw_inode *jNode; 36406d01dbeSwdenk u32 totalSize = 0; 3657205e407Swdenk u32 latestVersion = 0; 36606d01dbeSwdenk char *lDest; 367fe8c2806Swdenk char *src; 368fe8c2806Swdenk long ret; 369fe8c2806Swdenk int i; 370fe8c2806Swdenk u32 counter = 0; 3717205e407Swdenk #ifdef CFG_JFFS2_SORT_FRAGMENTS 3727205e407Swdenk /* Find file size before loading any data, so fragments that 3737205e407Swdenk * start past the end of file can be ignored. A fragment 3747205e407Swdenk * that is partially in the file is loaded, so extra data may 3757205e407Swdenk * be loaded up to the next 4K boundary above the file size. 3767205e407Swdenk * This shouldn't cause trouble when loading kernel images, so 3777205e407Swdenk * we will live with it. 3787205e407Swdenk */ 3797205e407Swdenk for (b = pL->frag.listHead; b != NULL; b = b->next) { 3807205e407Swdenk jNode = (struct jffs2_raw_inode *) (b->offset); 3817205e407Swdenk if ((inode == jNode->ino)) { 3827205e407Swdenk /* get actual file length from the newest node */ 3837205e407Swdenk if (jNode->version >= latestVersion) { 3847205e407Swdenk totalSize = jNode->isize; 3857205e407Swdenk latestVersion = jNode->version; 3867205e407Swdenk } 3877205e407Swdenk } 3887205e407Swdenk } 3897205e407Swdenk #endif 390fe8c2806Swdenk 39106d01dbeSwdenk for (b = pL->frag.listHead; b != NULL; b = b->next) { 392fe8c2806Swdenk jNode = (struct jffs2_raw_inode *) (b->offset); 393fe8c2806Swdenk if ((inode == jNode->ino)) { 39406d01dbeSwdenk #if 0 395fe8c2806Swdenk putLabeledWord("\r\n\r\nread_inode: totlen = ", jNode->totlen); 396fe8c2806Swdenk putLabeledWord("read_inode: inode = ", jNode->ino); 397fe8c2806Swdenk putLabeledWord("read_inode: version = ", jNode->version); 398fe8c2806Swdenk putLabeledWord("read_inode: isize = ", jNode->isize); 399fe8c2806Swdenk putLabeledWord("read_inode: offset = ", jNode->offset); 400fe8c2806Swdenk putLabeledWord("read_inode: csize = ", jNode->csize); 401fe8c2806Swdenk putLabeledWord("read_inode: dsize = ", jNode->dsize); 402fe8c2806Swdenk putLabeledWord("read_inode: compr = ", jNode->compr); 403fe8c2806Swdenk putLabeledWord("read_inode: usercompr = ", jNode->usercompr); 404fe8c2806Swdenk putLabeledWord("read_inode: flags = ", jNode->flags); 405fe8c2806Swdenk #endif 4067205e407Swdenk 4077205e407Swdenk #ifndef CFG_JFFS2_SORT_FRAGMENTS 40806d01dbeSwdenk /* get actual file length from the newest node */ 40906d01dbeSwdenk if (jNode->version >= latestVersion) { 410fe8c2806Swdenk totalSize = jNode->isize; 41106d01dbeSwdenk latestVersion = jNode->version; 412fe8c2806Swdenk } 4137205e407Swdenk #endif 414fe8c2806Swdenk 415fe8c2806Swdenk if(dest) { 416fe8c2806Swdenk src = ((char *) jNode) + sizeof(struct jffs2_raw_inode); 41706d01dbeSwdenk /* ignore data behind latest known EOF */ 41806d01dbeSwdenk if (jNode->offset > totalSize) 41906d01dbeSwdenk continue; 42006d01dbeSwdenk 421fe8c2806Swdenk lDest = (char *) (dest + jNode->offset); 422fe8c2806Swdenk #if 0 42306d01dbeSwdenk putLabeledWord("read_inode: src = ", src); 424fe8c2806Swdenk putLabeledWord("read_inode: dest = ", lDest); 425fe8c2806Swdenk #endif 426fe8c2806Swdenk switch (jNode->compr) { 427fe8c2806Swdenk case JFFS2_COMPR_NONE: 428fe8c2806Swdenk ret = (unsigned long) ldr_memcpy(lDest, src, jNode->dsize); 429fe8c2806Swdenk break; 430fe8c2806Swdenk case JFFS2_COMPR_ZERO: 431fe8c2806Swdenk ret = 0; 432fe8c2806Swdenk for (i = 0; i < jNode->dsize; i++) 433fe8c2806Swdenk *(lDest++) = 0; 434fe8c2806Swdenk break; 435fe8c2806Swdenk case JFFS2_COMPR_RTIME: 436fe8c2806Swdenk ret = 0; 437fe8c2806Swdenk rtime_decompress(src, lDest, jNode->csize, jNode->dsize); 438fe8c2806Swdenk break; 439fe8c2806Swdenk case JFFS2_COMPR_DYNRUBIN: 440fe8c2806Swdenk /* this is slow but it works */ 441fe8c2806Swdenk ret = 0; 442fe8c2806Swdenk dynrubin_decompress(src, lDest, jNode->csize, jNode->dsize); 443fe8c2806Swdenk break; 444fe8c2806Swdenk case JFFS2_COMPR_ZLIB: 445fe8c2806Swdenk ret = zlib_decompress(src, lDest, jNode->csize, jNode->dsize); 446fe8c2806Swdenk break; 447fe8c2806Swdenk default: 448fe8c2806Swdenk /* unknown */ 449fe8c2806Swdenk putLabeledWord("UNKOWN COMPRESSION METHOD = ", jNode->compr); 450fe8c2806Swdenk return -1; 451fe8c2806Swdenk break; 452fe8c2806Swdenk } 453fe8c2806Swdenk } 454fe8c2806Swdenk 455fe8c2806Swdenk #if 0 456fe8c2806Swdenk putLabeledWord("read_inode: totalSize = ", totalSize); 457fe8c2806Swdenk putLabeledWord("read_inode: compr ret = ", ret); 458fe8c2806Swdenk #endif 459fe8c2806Swdenk } 460fe8c2806Swdenk counter++; 461fe8c2806Swdenk } 462fe8c2806Swdenk 463fe8c2806Swdenk #if 0 46406d01dbeSwdenk putLabeledWord("read_inode: returning = ", totalSize); 465fe8c2806Swdenk #endif 46606d01dbeSwdenk return totalSize; 467fe8c2806Swdenk } 468fe8c2806Swdenk 469fe8c2806Swdenk /* find the inode from the slashless name given a parent */ 470fe8c2806Swdenk static u32 471fe8c2806Swdenk jffs2_1pass_find_inode(struct b_lists * pL, const char *name, u32 pino) 472fe8c2806Swdenk { 473fe8c2806Swdenk struct b_node *b; 474fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 475fe8c2806Swdenk int len; 476fe8c2806Swdenk u32 counter; 477fe8c2806Swdenk u32 version = 0; 478fe8c2806Swdenk u32 inode = 0; 479fe8c2806Swdenk 480fe8c2806Swdenk /* name is assumed slash free */ 481fe8c2806Swdenk len = strlen(name); 482fe8c2806Swdenk 483fe8c2806Swdenk counter = 0; 484fe8c2806Swdenk /* we need to search all and return the inode with the highest version */ 48506d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next, counter++) { 486fe8c2806Swdenk jDir = (struct jffs2_raw_dirent *) (b->offset); 48706d01dbeSwdenk if ((pino == jDir->pino) && (len == jDir->nsize) && 48806d01dbeSwdenk (jDir->ino) && /* 0 for unlink */ 489fe8c2806Swdenk (!strncmp(jDir->name, name, len))) { /* a match */ 4907205e407Swdenk if (jDir->version < version) 4917205e407Swdenk continue; 492fe8c2806Swdenk 4937205e407Swdenk if (jDir->version == version && inode != 0) { 4947205e407Swdenk /* I'm pretty sure this isn't legal */ 495fe8c2806Swdenk putstr(" ** ERROR ** "); 496fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 497fe8c2806Swdenk putLabeledWord(" has dup version =", version); 498fe8c2806Swdenk } 499fe8c2806Swdenk inode = jDir->ino; 500fe8c2806Swdenk version = jDir->version; 501fe8c2806Swdenk } 502fe8c2806Swdenk #if 0 503fe8c2806Swdenk putstr("\r\nfind_inode:p&l ->"); 504fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 505fe8c2806Swdenk putstr("\r\n"); 506fe8c2806Swdenk putLabeledWord("pino = ", jDir->pino); 507fe8c2806Swdenk putLabeledWord("nsize = ", jDir->nsize); 508fe8c2806Swdenk putLabeledWord("b = ", (u32) b); 509fe8c2806Swdenk putLabeledWord("counter = ", counter); 510fe8c2806Swdenk #endif 511fe8c2806Swdenk } 512fe8c2806Swdenk return inode; 513fe8c2806Swdenk } 514fe8c2806Swdenk 515*180d3f74Swdenk char *mkmodestr(unsigned long mode, char *str) 516fe8c2806Swdenk { 517fe8c2806Swdenk static const char *l = "xwr"; 518fe8c2806Swdenk int mask = 1, i; 519fe8c2806Swdenk char c; 520fe8c2806Swdenk 521fe8c2806Swdenk switch (mode & S_IFMT) { 522fe8c2806Swdenk case S_IFDIR: str[0] = 'd'; break; 523fe8c2806Swdenk case S_IFBLK: str[0] = 'b'; break; 524fe8c2806Swdenk case S_IFCHR: str[0] = 'c'; break; 525fe8c2806Swdenk case S_IFIFO: str[0] = 'f'; break; 526fe8c2806Swdenk case S_IFLNK: str[0] = 'l'; break; 527fe8c2806Swdenk case S_IFSOCK: str[0] = 's'; break; 528fe8c2806Swdenk case S_IFREG: str[0] = '-'; break; 529fe8c2806Swdenk default: str[0] = '?'; 530fe8c2806Swdenk } 531fe8c2806Swdenk 532fe8c2806Swdenk for(i = 0; i < 9; i++) { 533fe8c2806Swdenk c = l[i%3]; 534fe8c2806Swdenk str[9-i] = (mode & mask)?c:'-'; 535fe8c2806Swdenk mask = mask<<1; 536fe8c2806Swdenk } 537fe8c2806Swdenk 538fe8c2806Swdenk if(mode & S_ISUID) str[3] = (mode & S_IXUSR)?'s':'S'; 539fe8c2806Swdenk if(mode & S_ISGID) str[6] = (mode & S_IXGRP)?'s':'S'; 540fe8c2806Swdenk if(mode & S_ISVTX) str[9] = (mode & S_IXOTH)?'t':'T'; 541fe8c2806Swdenk str[10] = '\0'; 542fe8c2806Swdenk return str; 543fe8c2806Swdenk } 544fe8c2806Swdenk 545fe8c2806Swdenk static inline void dump_stat(struct stat *st, const char *name) 546fe8c2806Swdenk { 547fe8c2806Swdenk char str[20]; 548fe8c2806Swdenk char s[64], *p; 549fe8c2806Swdenk 550fe8c2806Swdenk if (st->st_mtime == (time_t)(-1)) /* some ctimes really hate -1 */ 551fe8c2806Swdenk st->st_mtime = 1; 552fe8c2806Swdenk 553fe8c2806Swdenk ctime_r(&st->st_mtime, s/*,64*/); /* newlib ctime doesn't have buflen */ 554fe8c2806Swdenk 555fe8c2806Swdenk if ((p = strchr(s,'\n')) != NULL) *p = '\0'; 556fe8c2806Swdenk if ((p = strchr(s,'\r')) != NULL) *p = '\0'; 557fe8c2806Swdenk 558fe8c2806Swdenk /* 559fe8c2806Swdenk printf("%6lo %s %8ld %s %s\n", st->st_mode, mkmodestr(st->st_mode, str), 560fe8c2806Swdenk st->st_size, s, name); 561fe8c2806Swdenk */ 562fe8c2806Swdenk 563fe8c2806Swdenk printf(" %s %8ld %s %s", mkmodestr(st->st_mode,str), st->st_size, s, name); 564fe8c2806Swdenk } 565fe8c2806Swdenk 566fe8c2806Swdenk static inline u32 dump_inode(struct b_lists * pL, struct jffs2_raw_dirent *d, struct jffs2_raw_inode *i) 567fe8c2806Swdenk { 568fe8c2806Swdenk char fname[256]; 569fe8c2806Swdenk struct stat st; 570fe8c2806Swdenk 571fe8c2806Swdenk if(!d || !i) return -1; 572fe8c2806Swdenk 573fe8c2806Swdenk strncpy(fname, d->name, d->nsize); 574fe8c2806Swdenk fname[d->nsize] = '\0'; 575fe8c2806Swdenk 576fe8c2806Swdenk memset(&st,0,sizeof(st)); 577fe8c2806Swdenk 578fe8c2806Swdenk st.st_mtime = i->mtime; 579fe8c2806Swdenk st.st_mode = i->mode; 580fe8c2806Swdenk st.st_ino = i->ino; 581fe8c2806Swdenk 582fe8c2806Swdenk /* neither dsize nor isize help us.. do it the long way */ 583fe8c2806Swdenk st.st_size = jffs2_1pass_read_inode(pL, i->ino, NULL); 584fe8c2806Swdenk 585fe8c2806Swdenk dump_stat(&st, fname); 586fe8c2806Swdenk 587fe8c2806Swdenk if (d->type == DT_LNK) { 588fe8c2806Swdenk unsigned char *src = (unsigned char *) (&i[1]); 589fe8c2806Swdenk putstr(" -> "); 590fe8c2806Swdenk putnstr(src, (int)i->dsize); 591fe8c2806Swdenk } 592fe8c2806Swdenk 593fe8c2806Swdenk putstr("\r\n"); 594fe8c2806Swdenk 595fe8c2806Swdenk return 0; 596fe8c2806Swdenk } 597fe8c2806Swdenk 598fe8c2806Swdenk /* list inodes with the given pino */ 599fe8c2806Swdenk static u32 600fe8c2806Swdenk jffs2_1pass_list_inodes(struct b_lists * pL, u32 pino) 601fe8c2806Swdenk { 602fe8c2806Swdenk struct b_node *b; 603fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 604fe8c2806Swdenk 60506d01dbeSwdenk for (b = pL->dir.listHead; b; b = b->next) { 606fe8c2806Swdenk jDir = (struct jffs2_raw_dirent *) (b->offset); 60706d01dbeSwdenk if ((pino == jDir->pino) && (jDir->ino)) { /* ino=0 -> unlink */ 608fe8c2806Swdenk u32 i_version = 0; 609fe8c2806Swdenk struct jffs2_raw_inode *jNode, *i = NULL; 61006d01dbeSwdenk struct b_node *b2 = pL->frag.listHead; 611fe8c2806Swdenk 612fe8c2806Swdenk while (b2) { 613fe8c2806Swdenk jNode = (struct jffs2_raw_inode *) (b2->offset); 614fe8c2806Swdenk if (jNode->ino == jDir->ino 615fe8c2806Swdenk && jNode->version >= i_version) 616fe8c2806Swdenk i = jNode; 617fe8c2806Swdenk b2 = b2->next; 618fe8c2806Swdenk } 619fe8c2806Swdenk 620fe8c2806Swdenk dump_inode(pL, jDir, i); 621fe8c2806Swdenk } 622fe8c2806Swdenk } 623fe8c2806Swdenk return pino; 624fe8c2806Swdenk } 625fe8c2806Swdenk 626fe8c2806Swdenk static u32 627fe8c2806Swdenk jffs2_1pass_search_inode(struct b_lists * pL, const char *fname, u32 pino) 628fe8c2806Swdenk { 629fe8c2806Swdenk int i; 630fe8c2806Swdenk char tmp[256]; 631fe8c2806Swdenk char working_tmp[256]; 632fe8c2806Swdenk char *c; 633fe8c2806Swdenk 634fe8c2806Swdenk /* discard any leading slash */ 635fe8c2806Swdenk i = 0; 636fe8c2806Swdenk while (fname[i] == '/') 637fe8c2806Swdenk i++; 638fe8c2806Swdenk strcpy(tmp, &fname[i]); 639fe8c2806Swdenk 640fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 641fe8c2806Swdenk { 642fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp); 643fe8c2806Swdenk working_tmp[c - tmp] = '\0'; 644fe8c2806Swdenk #if 0 645fe8c2806Swdenk putstr("search_inode: tmp = "); 646fe8c2806Swdenk putstr(tmp); 647fe8c2806Swdenk putstr("\r\n"); 648fe8c2806Swdenk putstr("search_inode: wtmp = "); 649fe8c2806Swdenk putstr(working_tmp); 650fe8c2806Swdenk putstr("\r\n"); 651fe8c2806Swdenk putstr("search_inode: c = "); 652fe8c2806Swdenk putstr(c); 653fe8c2806Swdenk putstr("\r\n"); 654fe8c2806Swdenk #endif 655fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++) 656fe8c2806Swdenk tmp[i] = c[i + 1]; 657fe8c2806Swdenk tmp[i] = '\0'; 658fe8c2806Swdenk #if 0 659fe8c2806Swdenk putstr("search_inode: post tmp = "); 660fe8c2806Swdenk putstr(tmp); 661fe8c2806Swdenk putstr("\r\n"); 662fe8c2806Swdenk #endif 663fe8c2806Swdenk 664fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino))) { 665fe8c2806Swdenk putstr("find_inode failed for name="); 666fe8c2806Swdenk putstr(working_tmp); 667fe8c2806Swdenk putstr("\r\n"); 668fe8c2806Swdenk return 0; 669fe8c2806Swdenk } 670fe8c2806Swdenk } 671fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */ 672fe8c2806Swdenk if (!(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 673fe8c2806Swdenk putstr("find_inode failed for name="); 674fe8c2806Swdenk putstr(tmp); 675fe8c2806Swdenk putstr("\r\n"); 676fe8c2806Swdenk return 0; 677fe8c2806Swdenk } 678fe8c2806Swdenk return pino; 679fe8c2806Swdenk 680fe8c2806Swdenk } 681fe8c2806Swdenk 682fe8c2806Swdenk static u32 683fe8c2806Swdenk jffs2_1pass_resolve_inode(struct b_lists * pL, u32 ino) 684fe8c2806Swdenk { 685fe8c2806Swdenk struct b_node *b; 686fe8c2806Swdenk struct b_node *b2; 687fe8c2806Swdenk struct jffs2_raw_dirent *jDir; 688fe8c2806Swdenk struct jffs2_raw_inode *jNode; 689fe8c2806Swdenk struct jffs2_raw_dirent *jDirFound = NULL; 690fe8c2806Swdenk char tmp[256]; 691fe8c2806Swdenk u32 version = 0; 692fe8c2806Swdenk u32 pino; 693fe8c2806Swdenk unsigned char *src; 694fe8c2806Swdenk 695fe8c2806Swdenk /* we need to search all and return the inode with the highest version */ 69606d01dbeSwdenk for(b = pL->dir.listHead; b; b = b->next) { 697fe8c2806Swdenk jDir = (struct jffs2_raw_dirent *) (b->offset); 698fe8c2806Swdenk if (ino == jDir->ino) { 6997205e407Swdenk if (jDir->version < version) 7007205e407Swdenk continue; 701fe8c2806Swdenk 7027205e407Swdenk if (jDir->version == version && jDirFound) { 7037205e407Swdenk /* I'm pretty sure this isn't legal */ 704fe8c2806Swdenk putstr(" ** ERROR ** "); 705fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 706fe8c2806Swdenk putLabeledWord(" has dup version (resolve) = ", 707fe8c2806Swdenk version); 708fe8c2806Swdenk } 709fe8c2806Swdenk 710fe8c2806Swdenk jDirFound = jDir; 711fe8c2806Swdenk version = jDir->version; 712fe8c2806Swdenk } 713fe8c2806Swdenk } 714fe8c2806Swdenk /* now we found the right entry again. (shoulda returned inode*) */ 715fe8c2806Swdenk if (jDirFound->type != DT_LNK) 716fe8c2806Swdenk return jDirFound->ino; 71706d01dbeSwdenk 71806d01dbeSwdenk /* it's a soft link so we follow it again. */ 71906d01dbeSwdenk b2 = pL->frag.listHead; 720fe8c2806Swdenk while (b2) { 721fe8c2806Swdenk jNode = (struct jffs2_raw_inode *) (b2->offset); 722fe8c2806Swdenk if (jNode->ino == jDirFound->ino) { 723fe8c2806Swdenk src = (unsigned char *) (b2->offset + sizeof(struct jffs2_raw_inode)); 724fe8c2806Swdenk 725fe8c2806Swdenk #if 0 726fe8c2806Swdenk putLabeledWord("\t\t dsize = ", jNode->dsize); 727fe8c2806Swdenk putstr("\t\t target = "); 728fe8c2806Swdenk putnstr(src, jNode->dsize); 729fe8c2806Swdenk putstr("\r\n"); 730fe8c2806Swdenk #endif 731fe8c2806Swdenk strncpy(tmp, src, jNode->dsize); 732fe8c2806Swdenk tmp[jNode->dsize] = '\0'; 733fe8c2806Swdenk break; 734fe8c2806Swdenk } 735fe8c2806Swdenk b2 = b2->next; 736fe8c2806Swdenk } 737fe8c2806Swdenk /* ok so the name of the new file to find is in tmp */ 738fe8c2806Swdenk /* if it starts with a slash it is root based else shared dirs */ 739fe8c2806Swdenk if (tmp[0] == '/') 740fe8c2806Swdenk pino = 1; 741fe8c2806Swdenk else 742fe8c2806Swdenk pino = jDirFound->pino; 743fe8c2806Swdenk 744fe8c2806Swdenk return jffs2_1pass_search_inode(pL, tmp, pino); 745fe8c2806Swdenk } 746fe8c2806Swdenk 747fe8c2806Swdenk static u32 748fe8c2806Swdenk jffs2_1pass_search_list_inodes(struct b_lists * pL, const char *fname, u32 pino) 749fe8c2806Swdenk { 750fe8c2806Swdenk int i; 751fe8c2806Swdenk char tmp[256]; 752fe8c2806Swdenk char working_tmp[256]; 753fe8c2806Swdenk char *c; 754fe8c2806Swdenk 755fe8c2806Swdenk /* discard any leading slash */ 756fe8c2806Swdenk i = 0; 757fe8c2806Swdenk while (fname[i] == '/') 758fe8c2806Swdenk i++; 759fe8c2806Swdenk strcpy(tmp, &fname[i]); 760fe8c2806Swdenk working_tmp[0] = '\0'; 761fe8c2806Swdenk while ((c = (char *) strchr(tmp, '/'))) /* we are still dired searching */ 762fe8c2806Swdenk { 763fe8c2806Swdenk strncpy(working_tmp, tmp, c - tmp); 764fe8c2806Swdenk working_tmp[c - tmp] = '\0'; 765fe8c2806Swdenk for (i = 0; i < strlen(c) - 1; i++) 766fe8c2806Swdenk tmp[i] = c[i + 1]; 767fe8c2806Swdenk tmp[i] = '\0'; 768fe8c2806Swdenk /* only a failure if we arent looking at top level */ 76906d01dbeSwdenk if (!(pino = jffs2_1pass_find_inode(pL, working_tmp, pino)) && 77006d01dbeSwdenk (working_tmp[0])) { 771fe8c2806Swdenk putstr("find_inode failed for name="); 772fe8c2806Swdenk putstr(working_tmp); 773fe8c2806Swdenk putstr("\r\n"); 774fe8c2806Swdenk return 0; 775fe8c2806Swdenk } 776fe8c2806Swdenk } 777fe8c2806Swdenk 778fe8c2806Swdenk if (tmp[0] && !(pino = jffs2_1pass_find_inode(pL, tmp, pino))) { 779fe8c2806Swdenk putstr("find_inode failed for name="); 780fe8c2806Swdenk putstr(tmp); 781fe8c2806Swdenk putstr("\r\n"); 782fe8c2806Swdenk return 0; 783fe8c2806Swdenk } 784fe8c2806Swdenk /* this is for the bare filename, directories have already been mapped */ 785fe8c2806Swdenk if (!(pino = jffs2_1pass_list_inodes(pL, pino))) { 786fe8c2806Swdenk putstr("find_inode failed for name="); 787fe8c2806Swdenk putstr(tmp); 788fe8c2806Swdenk putstr("\r\n"); 789fe8c2806Swdenk return 0; 790fe8c2806Swdenk } 791fe8c2806Swdenk return pino; 792fe8c2806Swdenk 793fe8c2806Swdenk } 794fe8c2806Swdenk 795fe8c2806Swdenk unsigned char 796fe8c2806Swdenk jffs2_1pass_rescan_needed(struct part_info *part) 797fe8c2806Swdenk { 798fe8c2806Swdenk struct b_node *b; 799fe8c2806Swdenk struct jffs2_unknown_node *node; 800fe8c2806Swdenk struct b_lists *pL = (struct b_lists *)part->jffs2_priv; 801fe8c2806Swdenk 802fe8c2806Swdenk if (part->jffs2_priv == 0){ 803fe8c2806Swdenk DEBUGF ("rescan: First time in use\n"); 804fe8c2806Swdenk return 1; 805fe8c2806Swdenk } 806fe8c2806Swdenk /* if we have no list, we need to rescan */ 80706d01dbeSwdenk if (pL->frag.listCount == 0) { 808fe8c2806Swdenk DEBUGF ("rescan: fraglist zero\n"); 809fe8c2806Swdenk return 1; 810fe8c2806Swdenk } 811fe8c2806Swdenk 812fe8c2806Swdenk /* or if we are scanning a new partition */ 813fe8c2806Swdenk if (pL->partOffset != part->offset) { 814fe8c2806Swdenk DEBUGF ("rescan: different partition\n"); 815fe8c2806Swdenk return 1; 816fe8c2806Swdenk } 81706d01dbeSwdenk /* but suppose someone reflashed a partition at the same offset... */ 81806d01dbeSwdenk b = pL->dir.listHead; 819fe8c2806Swdenk while (b) { 820fe8c2806Swdenk node = (struct jffs2_unknown_node *) (b->offset); 821fe8c2806Swdenk if (node->nodetype != JFFS2_NODETYPE_DIRENT) { 82206d01dbeSwdenk DEBUGF ("rescan: fs changed beneath me? (%lx)\n", 82306d01dbeSwdenk (unsigned long) b->offset); 824fe8c2806Swdenk return 1; 825fe8c2806Swdenk } 826fe8c2806Swdenk b = b->next; 827fe8c2806Swdenk } 828fe8c2806Swdenk return 0; 829fe8c2806Swdenk } 830fe8c2806Swdenk 83106d01dbeSwdenk #ifdef DEBUG_FRAGMENTS 83206d01dbeSwdenk static void 83306d01dbeSwdenk dump_fragments(struct b_lists *pL) 834fe8c2806Swdenk { 835fe8c2806Swdenk struct b_node *b; 836fe8c2806Swdenk struct jffs2_raw_inode *jNode; 837fe8c2806Swdenk 83806d01dbeSwdenk putstr("\r\n\r\n******The fragment Entries******\r\n"); 83906d01dbeSwdenk b = pL->frag.listHead; 84006d01dbeSwdenk while (b) { 84106d01dbeSwdenk jNode = (struct jffs2_raw_inode *) (b->offset); 84206d01dbeSwdenk putLabeledWord("\r\n\tbuild_list: FLASH_OFFSET = ", b->offset); 84306d01dbeSwdenk putLabeledWord("\tbuild_list: totlen = ", jNode->totlen); 84406d01dbeSwdenk putLabeledWord("\tbuild_list: inode = ", jNode->ino); 84506d01dbeSwdenk putLabeledWord("\tbuild_list: version = ", jNode->version); 84606d01dbeSwdenk putLabeledWord("\tbuild_list: isize = ", jNode->isize); 84706d01dbeSwdenk putLabeledWord("\tbuild_list: atime = ", jNode->atime); 84806d01dbeSwdenk putLabeledWord("\tbuild_list: offset = ", jNode->offset); 84906d01dbeSwdenk putLabeledWord("\tbuild_list: csize = ", jNode->csize); 85006d01dbeSwdenk putLabeledWord("\tbuild_list: dsize = ", jNode->dsize); 85106d01dbeSwdenk putLabeledWord("\tbuild_list: compr = ", jNode->compr); 85206d01dbeSwdenk putLabeledWord("\tbuild_list: usercompr = ", jNode->usercompr); 85306d01dbeSwdenk putLabeledWord("\tbuild_list: flags = ", jNode->flags); 8548bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 85506d01dbeSwdenk b = b->next; 85606d01dbeSwdenk } 85706d01dbeSwdenk } 85806d01dbeSwdenk #endif 85906d01dbeSwdenk 86006d01dbeSwdenk #ifdef DEBUG_DIRENTS 86106d01dbeSwdenk static void 86206d01dbeSwdenk dump_dirents(struct b_lists *pL) 86306d01dbeSwdenk { 86406d01dbeSwdenk struct b_node *b; 86506d01dbeSwdenk struct jffs2_raw_dirent *jDir; 86606d01dbeSwdenk 867fe8c2806Swdenk putstr("\r\n\r\n******The directory Entries******\r\n"); 86806d01dbeSwdenk b = pL->dir.listHead; 869fe8c2806Swdenk while (b) { 870fe8c2806Swdenk jDir = (struct jffs2_raw_dirent *) (b->offset); 871fe8c2806Swdenk putstr("\r\n"); 872fe8c2806Swdenk putnstr(jDir->name, jDir->nsize); 873fe8c2806Swdenk putLabeledWord("\r\n\tbuild_list: magic = ", jDir->magic); 874fe8c2806Swdenk putLabeledWord("\tbuild_list: nodetype = ", jDir->nodetype); 875fe8c2806Swdenk putLabeledWord("\tbuild_list: hdr_crc = ", jDir->hdr_crc); 876fe8c2806Swdenk putLabeledWord("\tbuild_list: pino = ", jDir->pino); 877fe8c2806Swdenk putLabeledWord("\tbuild_list: version = ", jDir->version); 878fe8c2806Swdenk putLabeledWord("\tbuild_list: ino = ", jDir->ino); 879fe8c2806Swdenk putLabeledWord("\tbuild_list: mctime = ", jDir->mctime); 880fe8c2806Swdenk putLabeledWord("\tbuild_list: nsize = ", jDir->nsize); 881fe8c2806Swdenk putLabeledWord("\tbuild_list: type = ", jDir->type); 882fe8c2806Swdenk putLabeledWord("\tbuild_list: node_crc = ", jDir->node_crc); 883fe8c2806Swdenk putLabeledWord("\tbuild_list: name_crc = ", jDir->name_crc); 8848bde7f77Swdenk putLabeledWord("\tbuild_list: offset = ", b->offset); /* FIXME: ? [RS] */ 885fe8c2806Swdenk b = b->next; 886fe8c2806Swdenk } 887fe8c2806Swdenk } 88806d01dbeSwdenk #endif 88906d01dbeSwdenk 89006d01dbeSwdenk static u32 89106d01dbeSwdenk jffs2_1pass_build_lists(struct part_info * part) 89206d01dbeSwdenk { 89306d01dbeSwdenk struct b_lists *pL; 89406d01dbeSwdenk struct jffs2_unknown_node *node; 89506d01dbeSwdenk u32 offset, oldoffset = 0; 89606d01dbeSwdenk u32 max = part->size - sizeof(struct jffs2_raw_inode); 89706d01dbeSwdenk u32 counter = 0; 89806d01dbeSwdenk u32 counter4 = 0; 89906d01dbeSwdenk u32 counterF = 0; 90006d01dbeSwdenk u32 counterN = 0; 90106d01dbeSwdenk 90206d01dbeSwdenk /* turn off the lcd. Refreshing the lcd adds 50% overhead to the */ 90306d01dbeSwdenk /* jffs2 list building enterprise nope. in newer versions the overhead is */ 90406d01dbeSwdenk /* only about 5 %. not enough to inconvenience people for. */ 90506d01dbeSwdenk /* lcd_off(); */ 90606d01dbeSwdenk 90706d01dbeSwdenk /* if we are building a list we need to refresh the cache. */ 90806d01dbeSwdenk jffs_init_1pass_list(part); 90906d01dbeSwdenk pL = (struct b_lists *)part->jffs2_priv; 91006d01dbeSwdenk pL->partOffset = part->offset; 91106d01dbeSwdenk offset = 0; 91206d01dbeSwdenk printf("Scanning JFFS2 FS: "); 91306d01dbeSwdenk 91406d01dbeSwdenk /* start at the beginning of the partition */ 91506d01dbeSwdenk while (offset < max) { 91606d01dbeSwdenk if ((oldoffset >> SPIN_BLKSIZE) != (offset >> SPIN_BLKSIZE)) { 91706d01dbeSwdenk printf("\b\b%c ", spinner[counter++ % sizeof(spinner)]); 91806d01dbeSwdenk oldoffset = offset; 919fe8c2806Swdenk } 920fe8c2806Swdenk 92106d01dbeSwdenk node = (struct jffs2_unknown_node *) (part->offset + offset); 92206d01dbeSwdenk if (node->magic == JFFS2_MAGIC_BITMASK && hdr_crc(node)) { 92306d01dbeSwdenk /* if its a fragment add it */ 92406d01dbeSwdenk if (node->nodetype == JFFS2_NODETYPE_INODE && 92506d01dbeSwdenk inode_crc((struct jffs2_raw_inode *) node)) { 92606d01dbeSwdenk if (insert_node(&pL->frag, (u32) part->offset + 92706d01dbeSwdenk offset) == NULL) 92806d01dbeSwdenk return 0; 92906d01dbeSwdenk } else if (node->nodetype == JFFS2_NODETYPE_DIRENT && 93006d01dbeSwdenk dirent_crc((struct jffs2_raw_dirent *) node) && 93106d01dbeSwdenk dirent_name_crc((struct jffs2_raw_dirent *) node)) { 93206d01dbeSwdenk if (! (counterN%100)) 93306d01dbeSwdenk printf("\b\b. "); 93406d01dbeSwdenk if (insert_node(&pL->dir, (u32) part->offset + 93506d01dbeSwdenk offset) == NULL) 93606d01dbeSwdenk return 0; 93706d01dbeSwdenk counterN++; 93806d01dbeSwdenk } else if (node->nodetype == JFFS2_NODETYPE_CLEANMARKER) { 93906d01dbeSwdenk if (node->totlen != sizeof(struct jffs2_unknown_node)) 94006d01dbeSwdenk printf("OOPS Cleanmarker has bad size " 94106d01dbeSwdenk "%d != %d\n", node->totlen, 94206d01dbeSwdenk sizeof(struct jffs2_unknown_node)); 9437205e407Swdenk } else if (node->nodetype == JFFS2_NODETYPE_PADDING) { 9447205e407Swdenk if (node->totlen < sizeof(struct jffs2_unknown_node)) 9457205e407Swdenk printf("OOPS Padding has bad size " 9467205e407Swdenk "%d < %d\n", node->totlen, 9477205e407Swdenk sizeof(struct jffs2_unknown_node)); 94806d01dbeSwdenk } else { 94906d01dbeSwdenk printf("Unknown node type: %x len %d " 95006d01dbeSwdenk "offset 0x%x\n", node->nodetype, 95106d01dbeSwdenk node->totlen, offset); 95206d01dbeSwdenk } 95306d01dbeSwdenk offset += ((node->totlen + 3) & ~3); 95406d01dbeSwdenk counterF++; 95506d01dbeSwdenk } else if (node->magic == JFFS2_EMPTY_BITMASK && 95606d01dbeSwdenk node->nodetype == JFFS2_EMPTY_BITMASK) { 95706d01dbeSwdenk offset = jffs2_scan_empty(offset, part); 95806d01dbeSwdenk } else { /* if we know nothing, we just step and look. */ 95906d01dbeSwdenk offset += 4; 96006d01dbeSwdenk counter4++; 96106d01dbeSwdenk } 96206d01dbeSwdenk /* printf("unknown node magic %4.4x %4.4x @ %lx\n", node->magic, node->nodetype, (unsigned long)node); */ 96306d01dbeSwdenk 96406d01dbeSwdenk } 96506d01dbeSwdenk 96606d01dbeSwdenk putstr("\b\b done.\r\n"); /* close off the dots */ 96706d01dbeSwdenk /* turn the lcd back on. */ 96806d01dbeSwdenk /* splash(); */ 96906d01dbeSwdenk 97006d01dbeSwdenk #if 0 97106d01dbeSwdenk putLabeledWord("dir entries = ", pL->dir.listCount); 97206d01dbeSwdenk putLabeledWord("frag entries = ", pL->frag.listCount); 97306d01dbeSwdenk putLabeledWord("+4 increments = ", counter4); 97406d01dbeSwdenk putLabeledWord("+file_offset increments = ", counterF); 97506d01dbeSwdenk 97606d01dbeSwdenk #endif 97706d01dbeSwdenk 97806d01dbeSwdenk #ifdef DEBUG_DIRENTS 97906d01dbeSwdenk dump_dirents(pL); 98006d01dbeSwdenk #endif 98106d01dbeSwdenk 98206d01dbeSwdenk #ifdef DEBUG_FRAGMENTS 98306d01dbeSwdenk dump_fragments(pL); 98406d01dbeSwdenk #endif 98506d01dbeSwdenk 986fe8c2806Swdenk /* give visual feedback that we are done scanning the flash */ 987fe8c2806Swdenk led_blink(0x0, 0x0, 0x1, 0x1); /* off, forever, on 100ms, off 100ms */ 988fe8c2806Swdenk return 1; 989fe8c2806Swdenk } 990fe8c2806Swdenk 991fe8c2806Swdenk 992fe8c2806Swdenk static u32 993fe8c2806Swdenk jffs2_1pass_fill_info(struct b_lists * pL, struct b_jffs2_info * piL) 994fe8c2806Swdenk { 995fe8c2806Swdenk struct b_node *b; 996fe8c2806Swdenk struct jffs2_raw_inode *jNode; 997fe8c2806Swdenk int i; 998fe8c2806Swdenk 999fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1000fe8c2806Swdenk piL->compr_info[i].num_frags = 0; 1001fe8c2806Swdenk piL->compr_info[i].compr_sum = 0; 1002fe8c2806Swdenk piL->compr_info[i].decompr_sum = 0; 1003fe8c2806Swdenk } 1004fe8c2806Swdenk 100506d01dbeSwdenk b = pL->frag.listHead; 1006fe8c2806Swdenk while (b) { 1007fe8c2806Swdenk jNode = (struct jffs2_raw_inode *) (b->offset); 1008fe8c2806Swdenk if (jNode->compr < JFFS2_NUM_COMPR) { 1009fe8c2806Swdenk piL->compr_info[jNode->compr].num_frags++; 1010fe8c2806Swdenk piL->compr_info[jNode->compr].compr_sum += jNode->csize; 1011fe8c2806Swdenk piL->compr_info[jNode->compr].decompr_sum += jNode->dsize; 1012fe8c2806Swdenk } 1013fe8c2806Swdenk b = b->next; 1014fe8c2806Swdenk } 1015fe8c2806Swdenk return 0; 1016fe8c2806Swdenk } 1017fe8c2806Swdenk 1018fe8c2806Swdenk 1019fe8c2806Swdenk static struct b_lists * 1020fe8c2806Swdenk jffs2_get_list(struct part_info * part, const char *who) 1021fe8c2806Swdenk { 1022fe8c2806Swdenk if (jffs2_1pass_rescan_needed(part)) { 1023fe8c2806Swdenk if (!jffs2_1pass_build_lists(part)) { 1024fe8c2806Swdenk printf("%s: Failed to scan JFFSv2 file structure\n", who); 1025fe8c2806Swdenk return NULL; 1026fe8c2806Swdenk } 1027fe8c2806Swdenk } 1028fe8c2806Swdenk return (struct b_lists *)part->jffs2_priv; 1029fe8c2806Swdenk } 1030fe8c2806Swdenk 1031fe8c2806Swdenk 1032fe8c2806Swdenk /* Print directory / file contents */ 1033fe8c2806Swdenk u32 1034fe8c2806Swdenk jffs2_1pass_ls(struct part_info * part, const char *fname) 1035fe8c2806Swdenk { 1036fe8c2806Swdenk struct b_lists *pl; 1037fe8c2806Swdenk long ret = 0; 1038fe8c2806Swdenk u32 inode; 1039fe8c2806Swdenk 1040fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "ls"))) 1041fe8c2806Swdenk return 0; 1042fe8c2806Swdenk 1043fe8c2806Swdenk if (! (inode = jffs2_1pass_search_list_inodes(pl, fname, 1))) { 1044fe8c2806Swdenk putstr("ls: Failed to scan jffs2 file structure\r\n"); 1045fe8c2806Swdenk return 0; 1046fe8c2806Swdenk } 1047fe8c2806Swdenk 1048fe8c2806Swdenk 1049fe8c2806Swdenk #if 0 1050fe8c2806Swdenk putLabeledWord("found file at inode = ", inode); 1051fe8c2806Swdenk putLabeledWord("read_inode returns = ", ret); 1052fe8c2806Swdenk #endif 1053fe8c2806Swdenk 1054fe8c2806Swdenk return ret; 1055fe8c2806Swdenk } 1056fe8c2806Swdenk 1057fe8c2806Swdenk 1058fe8c2806Swdenk /* Load a file from flash into memory. fname can be a full path */ 1059fe8c2806Swdenk u32 1060fe8c2806Swdenk jffs2_1pass_load(char *dest, struct part_info * part, const char *fname) 1061fe8c2806Swdenk { 1062fe8c2806Swdenk 1063fe8c2806Swdenk struct b_lists *pl; 1064fe8c2806Swdenk long ret = 0; 1065fe8c2806Swdenk u32 inode; 1066fe8c2806Swdenk 1067fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "load"))) 1068fe8c2806Swdenk return 0; 1069fe8c2806Swdenk 1070fe8c2806Swdenk if (! (inode = jffs2_1pass_search_inode(pl, fname, 1))) { 1071fe8c2806Swdenk putstr("load: Failed to find inode\r\n"); 1072fe8c2806Swdenk return 0; 1073fe8c2806Swdenk } 1074fe8c2806Swdenk 1075fe8c2806Swdenk /* Resolve symlinks */ 1076fe8c2806Swdenk if (! (inode = jffs2_1pass_resolve_inode(pl, inode))) { 1077fe8c2806Swdenk putstr("load: Failed to resolve inode structure\r\n"); 1078fe8c2806Swdenk return 0; 1079fe8c2806Swdenk } 1080fe8c2806Swdenk 1081fe8c2806Swdenk if ((ret = jffs2_1pass_read_inode(pl, inode, dest)) < 0) { 1082fe8c2806Swdenk putstr("load: Failed to read inode\r\n"); 1083fe8c2806Swdenk return 0; 1084fe8c2806Swdenk } 1085fe8c2806Swdenk 1086fe8c2806Swdenk DEBUGF ("load: loaded '%s' to 0x%lx (%ld bytes)\n", fname, 1087fe8c2806Swdenk (unsigned long) dest, ret); 1088fe8c2806Swdenk return ret; 1089fe8c2806Swdenk } 1090fe8c2806Swdenk 1091fe8c2806Swdenk /* Return information about the fs on this partition */ 1092fe8c2806Swdenk u32 1093fe8c2806Swdenk jffs2_1pass_info(struct part_info * part) 1094fe8c2806Swdenk { 1095fe8c2806Swdenk struct b_jffs2_info info; 1096fe8c2806Swdenk struct b_lists *pl; 1097fe8c2806Swdenk int i; 1098fe8c2806Swdenk 1099fe8c2806Swdenk if (! (pl = jffs2_get_list(part, "info"))) 1100fe8c2806Swdenk return 0; 1101fe8c2806Swdenk 1102fe8c2806Swdenk jffs2_1pass_fill_info(pl, &info); 1103fe8c2806Swdenk for (i = 0; i < JFFS2_NUM_COMPR; i++) { 1104fe8c2806Swdenk printf("Compression: %s\n", compr_names[i]); 1105fe8c2806Swdenk printf("\tfrag count: %d\n", info.compr_info[i].num_frags); 1106fe8c2806Swdenk printf("\tcompressed sum: %d\n", info.compr_info[i].compr_sum); 1107fe8c2806Swdenk printf("\tuncompressed sum: %d\n", info.compr_info[i].decompr_sum); 1108fe8c2806Swdenk } 1109fe8c2806Swdenk return 1; 1110fe8c2806Swdenk } 1111fe8c2806Swdenk 1112fe8c2806Swdenk #endif /* CFG_CMD_JFFS2 */ 1113