/*
|
/*
|
* JFFS -- Journalling Flash File System, Linux implementation.
|
* JFFS -- Journalling Flash File System, Linux implementation.
|
*
|
*
|
* Copyright (C) 1999, 2000 Finn Hakansson, Axis Communications, Inc.
|
* Copyright (C) 1999, 2000 Finn Hakansson, Axis Communications, Inc.
|
*
|
*
|
* This is free software; you can redistribute it and/or modify it
|
* This is free software; you can redistribute it and/or modify it
|
* under the terms of the GNU General Public License as published by
|
* under the terms of the GNU General Public License as published by
|
* the Free Software Foundation; either version 2 of the License, or
|
* the Free Software Foundation; either version 2 of the License, or
|
* (at your option) any later version.
|
* (at your option) any later version.
|
*
|
*
|
* $Id: intrep.c,v 1.1 2005-12-20 10:26:13 jcastillo Exp $
|
* $Id: intrep.c,v 1.1 2005-12-20 10:26:13 jcastillo Exp $
|
*
|
*
|
*/
|
*/
|
|
|
/* This file contains the code for the internal structure of the
|
/* This file contains the code for the internal structure of the
|
Journalling Flash File System, JFFS. */
|
Journalling Flash File System, JFFS. */
|
|
|
/*
|
/*
|
* Todo list:
|
* Todo list:
|
*
|
*
|
* memcpy_to_flash()- and memcpy_from_flash()-functions.
|
* memcpy_to_flash()- and memcpy_from_flash()-functions.
|
*
|
*
|
* Implementation of hard links.
|
* Implementation of hard links.
|
*
|
*
|
* Organize the source code in a better way. Against the VFS we could
|
* Organize the source code in a better way. Against the VFS we could
|
* have jffs_ext.c, and against the block device jffs_int.c.
|
* have jffs_ext.c, and against the block device jffs_int.c.
|
* A better file-internal organization too.
|
* A better file-internal organization too.
|
*
|
*
|
* A better checksum algorithm.
|
* A better checksum algorithm.
|
*
|
*
|
* Consider endianness stuff. ntohl() etc.
|
* Consider endianness stuff. ntohl() etc.
|
*
|
*
|
* Check all comments beginning with XXX.
|
* Check all comments beginning with XXX.
|
*
|
*
|
* Are we handling the atime, mtime, ctime members of the inode right?
|
* Are we handling the atime, mtime, ctime members of the inode right?
|
*
|
*
|
* Remove some duplicated code. Take a look at jffs_write_node() and
|
* Remove some duplicated code. Take a look at jffs_write_node() and
|
* jffs_rewrite_data() for instance.
|
* jffs_rewrite_data() for instance.
|
*
|
*
|
* Implement more meaning of the nlink member in various data structures.
|
* Implement more meaning of the nlink member in various data structures.
|
* nlink could be used in conjunction with hard links for instance.
|
* nlink could be used in conjunction with hard links for instance.
|
*
|
*
|
* Fix the rename stuff. (I.e. if we have two files `a' and `b' and we
|
* Fix the rename stuff. (I.e. if we have two files `a' and `b' and we
|
* do a `mv b a'.) Half of this is already implemented.
|
* do a `mv b a'.) Half of this is already implemented.
|
*
|
*
|
*/
|
*/
|
|
|
#include <linux/module.h>
|
#include <linux/module.h>
|
#include <linux/types.h>
|
#include <linux/types.h>
|
#include <linux/malloc.h>
|
#include <linux/malloc.h>
|
#include <linux/jffs.h>
|
#include <linux/jffs.h>
|
#include <linux/fs.h>
|
#include <linux/fs.h>
|
#include <linux/stat.h>
|
#include <linux/stat.h>
|
#include <linux/pagemap.h>
|
#include <linux/pagemap.h>
|
#include <linux/locks.h>
|
#include <linux/locks.h>
|
#include <asm/byteorder.h>
|
#include <asm/byteorder.h>
|
|
|
#include "intrep.h"
|
#include "intrep.h"
|
#include "jffs_fm.h"
|
#include "jffs_fm.h"
|
|
|
#if defined(CONFIG_JFFS_FS_VERBOSE) && CONFIG_JFFS_FS_VERBOSE
|
#if defined(CONFIG_JFFS_FS_VERBOSE) && CONFIG_JFFS_FS_VERBOSE
|
#define D(x) x
|
#define D(x) x
|
#else
|
#else
|
#define D(x)
|
#define D(x)
|
#endif
|
#endif
|
#define D1(x)
|
#define D1(x)
|
#define D2(x)
|
#define D2(x)
|
#define D3(x)
|
#define D3(x)
|
#define ASSERT(x) x
|
#define ASSERT(x) x
|
|
|
#if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
|
#if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
|
long no_jffs_file = 0;
|
long no_jffs_file = 0;
|
long no_jffs_node = 0;
|
long no_jffs_node = 0;
|
long no_jffs_control = 0;
|
long no_jffs_control = 0;
|
long no_jffs_raw_inode = 0;
|
long no_jffs_raw_inode = 0;
|
long no_jffs_node_ref = 0;
|
long no_jffs_node_ref = 0;
|
long no_jffs_fm = 0;
|
long no_jffs_fm = 0;
|
long no_jffs_fmcontrol = 0;
|
long no_jffs_fmcontrol = 0;
|
long no_hash = 0;
|
long no_hash = 0;
|
long no_name = 0;
|
long no_name = 0;
|
#endif
|
#endif
|
|
|
static int jffs_scan_flash(struct jffs_control *c);
|
static int jffs_scan_flash(struct jffs_control *c);
|
static int jffs_update_file(struct jffs_file *f, struct jffs_node *node);
|
static int jffs_update_file(struct jffs_file *f, struct jffs_node *node);
|
|
|
#if 0
|
#if 0
|
#define _U 01
|
#define _U 01
|
#define _L 02
|
#define _L 02
|
#define _N 04
|
#define _N 04
|
#define _S 010
|
#define _S 010
|
#define _P 020
|
#define _P 020
|
#define _C 040
|
#define _C 040
|
#define _X 0100
|
#define _X 0100
|
#define _B 0200
|
#define _B 0200
|
|
|
const unsigned char jffs_ctype_[1 + 256] = {
|
const unsigned char jffs_ctype_[1 + 256] = {
|
0,
|
0,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_C, _C|_S, _C|_S, _C|_S, _C|_S, _C|_S, _C, _C,
|
_C, _C|_S, _C|_S, _C|_S, _C|_S, _C|_S, _C, _C,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_C, _C, _C, _C, _C, _C, _C, _C,
|
_S|_B, _P, _P, _P, _P, _P, _P, _P,
|
_S|_B, _P, _P, _P, _P, _P, _P, _P,
|
_P, _P, _P, _P, _P, _P, _P, _P,
|
_P, _P, _P, _P, _P, _P, _P, _P,
|
_N, _N, _N, _N, _N, _N, _N, _N,
|
_N, _N, _N, _N, _N, _N, _N, _N,
|
_N, _N, _P, _P, _P, _P, _P, _P,
|
_N, _N, _P, _P, _P, _P, _P, _P,
|
_P, _U|_X, _U|_X, _U|_X, _U|_X, _U|_X, _U|_X, _U,
|
_P, _U|_X, _U|_X, _U|_X, _U|_X, _U|_X, _U|_X, _U,
|
_U, _U, _U, _U, _U, _U, _U, _U,
|
_U, _U, _U, _U, _U, _U, _U, _U,
|
_U, _U, _U, _U, _U, _U, _U, _U,
|
_U, _U, _U, _U, _U, _U, _U, _U,
|
_U, _U, _U, _P, _P, _P, _P, _P,
|
_U, _U, _U, _P, _P, _P, _P, _P,
|
_P, _L|_X, _L|_X, _L|_X, _L|_X, _L|_X, _L|_X, _L,
|
_P, _L|_X, _L|_X, _L|_X, _L|_X, _L|_X, _L|_X, _L,
|
_L, _L, _L, _L, _L, _L, _L, _L,
|
_L, _L, _L, _L, _L, _L, _L, _L,
|
_L, _L, _L, _L, _L, _L, _L, _L,
|
_L, _L, _L, _L, _L, _L, _L, _L,
|
_L, _L, _L, _P, _P, _P, _P, _C
|
_L, _L, _L, _P, _P, _P, _P, _C
|
};
|
};
|
|
|
#define jffs_isalpha(c) ((jffs_ctype_+1)[c]&(_U|_L))
|
#define jffs_isalpha(c) ((jffs_ctype_+1)[c]&(_U|_L))
|
#define jffs_isupper(c) ((jffs_ctype_+1)[c]&_U)
|
#define jffs_isupper(c) ((jffs_ctype_+1)[c]&_U)
|
#define jffs_islower(c) ((jffs_ctype_+1)[c]&_L)
|
#define jffs_islower(c) ((jffs_ctype_+1)[c]&_L)
|
#define jffs_isdigit(c) ((jffs_ctype_+1)[c]&_N)
|
#define jffs_isdigit(c) ((jffs_ctype_+1)[c]&_N)
|
#define jffs_isxdigit(c) ((jffs_ctype_+1)[c]&(_X|_N))
|
#define jffs_isxdigit(c) ((jffs_ctype_+1)[c]&(_X|_N))
|
#define jffs_isspace(c) ((jffs_ctype_+1)[c]&_S)
|
#define jffs_isspace(c) ((jffs_ctype_+1)[c]&_S)
|
#define jffs_ispunct(c) ((jffs_ctype_+1)[c]&_P)
|
#define jffs_ispunct(c) ((jffs_ctype_+1)[c]&_P)
|
#define jffs_isalnum(c) ((jffs_ctype_+1)[c]&(_U|_L|_N))
|
#define jffs_isalnum(c) ((jffs_ctype_+1)[c]&(_U|_L|_N))
|
#define jffs_isprint(c) ((jffs_ctype_+1)[c]&(_P|_U|_L|_N|_B))
|
#define jffs_isprint(c) ((jffs_ctype_+1)[c]&(_P|_U|_L|_N|_B))
|
#define jffs_isgraph(c) ((jffs_ctype_+1)[c]&(_P|_U|_L|_N))
|
#define jffs_isgraph(c) ((jffs_ctype_+1)[c]&(_P|_U|_L|_N))
|
#define jffs_iscntrl(c) ((jffs_ctype_+1)[c]&_C)
|
#define jffs_iscntrl(c) ((jffs_ctype_+1)[c]&_C)
|
|
|
void
|
void
|
jffs_hexdump(const unsigned char* ptr, int size)
|
jffs_hexdump(const unsigned char* ptr, int size)
|
{
|
{
|
char line[16];
|
char line[16];
|
int j = 0;
|
int j = 0;
|
|
|
while (size > 0) {
|
while (size > 0) {
|
int i;
|
int i;
|
|
|
printk("%p:", ptr);
|
printk("%p:", ptr);
|
for (j = 0; j < 16; j++) {
|
for (j = 0; j < 16; j++) {
|
line[j] = *ptr++;
|
line[j] = *ptr++;
|
}
|
}
|
for (i = 0; i < j; i++) {
|
for (i = 0; i < j; i++) {
|
if (!(i & 1)) {
|
if (!(i & 1)) {
|
printk(" %.2x", line[i] & 0xff);
|
printk(" %.2x", line[i] & 0xff);
|
}
|
}
|
else {
|
else {
|
printk("%.2x", line[i] & 0xff);
|
printk("%.2x", line[i] & 0xff);
|
}
|
}
|
}
|
}
|
|
|
/* Print empty space */
|
/* Print empty space */
|
for (; i < 16; i++) {
|
for (; i < 16; i++) {
|
if (!(i & 1)) {
|
if (!(i & 1)) {
|
printk(" ");
|
printk(" ");
|
}
|
}
|
else {
|
else {
|
printk(" ");
|
printk(" ");
|
}
|
}
|
}
|
}
|
printk(" ");
|
printk(" ");
|
|
|
for (i = 0; i < j; i++) {
|
for (i = 0; i < j; i++) {
|
if (jffs_isgraph(line[i])) {
|
if (jffs_isgraph(line[i])) {
|
printk("%c", line[i]);
|
printk("%c", line[i]);
|
}
|
}
|
else {
|
else {
|
printk(".");
|
printk(".");
|
}
|
}
|
}
|
}
|
printk("\n");
|
printk("\n");
|
size -= 16;
|
size -= 16;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
inline int
|
inline int
|
jffs_min(int a, int b)
|
jffs_min(int a, int b)
|
{
|
{
|
return (a < b ? a : b);
|
return (a < b ? a : b);
|
}
|
}
|
|
|
|
|
inline int
|
inline int
|
jffs_max(int a, int b)
|
jffs_max(int a, int b)
|
{
|
{
|
return (a > b ? a : b);
|
return (a > b ? a : b);
|
}
|
}
|
|
|
|
|
/* This routine calculates checksums in JFFS. */
|
/* This routine calculates checksums in JFFS. */
|
__u32
|
__u32
|
jffs_checksum(const void *data, int size)
|
jffs_checksum(const void *data, int size)
|
{
|
{
|
__u32 sum = 0;
|
__u32 sum = 0;
|
__u8 *ptr = (__u8 *)data;
|
__u8 *ptr = (__u8 *)data;
|
D3(printk("#csum at 0x%p, {0x%08lx, 0x%08lx, ... }, size: %d",
|
D3(printk("#csum at 0x%p, {0x%08lx, 0x%08lx, ... }, size: %d",
|
data, *(long *)data, *((long *)data + 1), size));
|
data, *(long *)data, *((long *)data + 1), size));
|
while (size-- > 0) {
|
while (size-- > 0) {
|
sum += *ptr++;
|
sum += *ptr++;
|
}
|
}
|
D3(printk(", result: 0x%08x\n", sum));
|
D3(printk(", result: 0x%08x\n", sum));
|
return sum;
|
return sum;
|
}
|
}
|
|
|
|
|
/* Create and initialize a new struct jffs_file. */
|
/* Create and initialize a new struct jffs_file. */
|
static struct jffs_file *
|
static struct jffs_file *
|
jffs_create_file(struct jffs_control *c,
|
jffs_create_file(struct jffs_control *c,
|
const struct jffs_raw_inode *raw_inode)
|
const struct jffs_raw_inode *raw_inode)
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
|
|
if (!(f = (struct jffs_file *)kmalloc(sizeof(struct jffs_file),
|
if (!(f = (struct jffs_file *)kmalloc(sizeof(struct jffs_file),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
D(printk("jffs_create_file(): Failed!\n"));
|
D(printk("jffs_create_file(): Failed!\n"));
|
return 0;
|
return 0;
|
}
|
}
|
DJM(no_jffs_file++);
|
DJM(no_jffs_file++);
|
memset(f, 0, sizeof(struct jffs_file));
|
memset(f, 0, sizeof(struct jffs_file));
|
f->ino = raw_inode->ino;
|
f->ino = raw_inode->ino;
|
f->pino = raw_inode->pino;
|
f->pino = raw_inode->pino;
|
f->nlink = raw_inode->nlink;
|
f->nlink = raw_inode->nlink;
|
f->deleted = raw_inode->deleted;
|
f->deleted = raw_inode->deleted;
|
f->c = c;
|
f->c = c;
|
|
|
return f;
|
return f;
|
}
|
}
|
|
|
|
|
/* Build a control block for the file system. */
|
/* Build a control block for the file system. */
|
static struct jffs_control *
|
static struct jffs_control *
|
jffs_create_control(kdev_t dev)
|
jffs_create_control(kdev_t dev)
|
{
|
{
|
struct jffs_control *c;
|
struct jffs_control *c;
|
register int s = sizeof(struct jffs_control);
|
register int s = sizeof(struct jffs_control);
|
D(char *t = 0);
|
D(char *t = 0);
|
|
|
D2(printk("jffs_create_control()\n"));
|
D2(printk("jffs_create_control()\n"));
|
|
|
if (!(c = (struct jffs_control *)kmalloc(s, GFP_KERNEL))) {
|
if (!(c = (struct jffs_control *)kmalloc(s, GFP_KERNEL))) {
|
goto fail_control;
|
goto fail_control;
|
}
|
}
|
DJM(no_jffs_control++);
|
DJM(no_jffs_control++);
|
c->root = 0;
|
c->root = 0;
|
c->hash_len = JFFS_HASH_SIZE;
|
c->hash_len = JFFS_HASH_SIZE;
|
s = sizeof(struct jffs_file *) * c->hash_len;
|
s = sizeof(struct jffs_file *) * c->hash_len;
|
if (!(c->hash = (struct jffs_file **)kmalloc(s, GFP_KERNEL))) {
|
if (!(c->hash = (struct jffs_file **)kmalloc(s, GFP_KERNEL))) {
|
goto fail_hash;
|
goto fail_hash;
|
}
|
}
|
DJM(no_hash++);
|
DJM(no_hash++);
|
memset(c->hash, 0, s);
|
memset(c->hash, 0, s);
|
if (!(c->fmc = jffs_build_begin(c, dev))) {
|
if (!(c->fmc = jffs_build_begin(c, dev))) {
|
goto fail_fminit;
|
goto fail_fminit;
|
}
|
}
|
c->next_ino = JFFS_MIN_INO + 1;
|
c->next_ino = JFFS_MIN_INO + 1;
|
c->rename_lock = 0;
|
c->rename_lock = 0;
|
c->rename_wait = (struct wait_queue *)0;
|
c->rename_wait = (struct wait_queue *)0;
|
return c;
|
return c;
|
|
|
fail_fminit:
|
fail_fminit:
|
D(t = "c->fmc");
|
D(t = "c->fmc");
|
fail_hash:
|
fail_hash:
|
kfree(c);
|
kfree(c);
|
DJM(no_jffs_control--);
|
DJM(no_jffs_control--);
|
D(t = t ? t : "c->hash");
|
D(t = t ? t : "c->hash");
|
fail_control:
|
fail_control:
|
D(t = t ? t : "control");
|
D(t = t ? t : "control");
|
D(printk("jffs_create_control(): Allocation failed: (%s)\n", t));
|
D(printk("jffs_create_control(): Allocation failed: (%s)\n", t));
|
return (struct jffs_control *)0;
|
return (struct jffs_control *)0;
|
}
|
}
|
|
|
|
|
/* Clean up all data structures associated with the file system. */
|
/* Clean up all data structures associated with the file system. */
|
void
|
void
|
jffs_cleanup_control(struct jffs_control *c)
|
jffs_cleanup_control(struct jffs_control *c)
|
{
|
{
|
D2(printk("jffs_cleanup_control()\n"));
|
D2(printk("jffs_cleanup_control()\n"));
|
|
|
if (!c) {
|
if (!c) {
|
D(printk("jffs_cleanup_control(): c == NULL !!!\n"));
|
D(printk("jffs_cleanup_control(): c == NULL !!!\n"));
|
return;
|
return;
|
}
|
}
|
|
|
/* Free all files and nodes. */
|
/* Free all files and nodes. */
|
if (c->hash) {
|
if (c->hash) {
|
jffs_foreach_file(c, jffs_free_node_list);
|
jffs_foreach_file(c, jffs_free_node_list);
|
kfree(c->hash);
|
kfree(c->hash);
|
DJM(no_hash--);
|
DJM(no_hash--);
|
}
|
}
|
jffs_cleanup_fmcontrol(c->fmc);
|
jffs_cleanup_fmcontrol(c->fmc);
|
kfree(c);
|
kfree(c);
|
DJM(no_jffs_control--);
|
DJM(no_jffs_control--);
|
D3(printk("jffs_cleanup_control(): Leaving...\n"));
|
D3(printk("jffs_cleanup_control(): Leaving...\n"));
|
}
|
}
|
|
|
|
|
/* This function adds a virtual root node to the in-RAM representation.
|
/* This function adds a virtual root node to the in-RAM representation.
|
Called by jffs_build_fs(). */
|
Called by jffs_build_fs(). */
|
static int
|
static int
|
jffs_add_virtual_root(struct jffs_control *c)
|
jffs_add_virtual_root(struct jffs_control *c)
|
{
|
{
|
struct jffs_file *root;
|
struct jffs_file *root;
|
struct jffs_node *node;
|
struct jffs_node *node;
|
|
|
D2(printk("jffs_add_virtual_root(): "
|
D2(printk("jffs_add_virtual_root(): "
|
"Creating a virtual root directory.\n"));
|
"Creating a virtual root directory.\n"));
|
|
|
if (!(root = (struct jffs_file *)kmalloc(sizeof(struct jffs_file),
|
if (!(root = (struct jffs_file *)kmalloc(sizeof(struct jffs_file),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_file++);
|
DJM(no_jffs_file++);
|
if (!(node = (struct jffs_node *)kmalloc(sizeof(struct jffs_node),
|
if (!(node = (struct jffs_node *)kmalloc(sizeof(struct jffs_node),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
kfree(root);
|
kfree(root);
|
DJM(no_jffs_file--);
|
DJM(no_jffs_file--);
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
memset(node, 0, sizeof(struct jffs_node));
|
memset(node, 0, sizeof(struct jffs_node));
|
node->ino = JFFS_MIN_INO;
|
node->ino = JFFS_MIN_INO;
|
memset(root, 0, sizeof(struct jffs_file));
|
memset(root, 0, sizeof(struct jffs_file));
|
root->ino = JFFS_MIN_INO;
|
root->ino = JFFS_MIN_INO;
|
root->mode = S_IFDIR | S_IRWXU | S_IRGRP
|
root->mode = S_IFDIR | S_IRWXU | S_IRGRP
|
| S_IXGRP | S_IROTH | S_IXOTH;
|
| S_IXGRP | S_IROTH | S_IXOTH;
|
root->atime = root->mtime = root->ctime = CURRENT_TIME;
|
root->atime = root->mtime = root->ctime = CURRENT_TIME;
|
root->nlink = 1;
|
root->nlink = 1;
|
root->c = c;
|
root->c = c;
|
root->version_head = root->version_tail = node;
|
root->version_head = root->version_tail = node;
|
jffs_insert_file_into_hash(root);
|
jffs_insert_file_into_hash(root);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* This is where the file system is built and initialized. */
|
/* This is where the file system is built and initialized. */
|
int
|
int
|
jffs_build_fs(struct super_block *sb)
|
jffs_build_fs(struct super_block *sb)
|
{
|
{
|
struct jffs_control *c;
|
struct jffs_control *c;
|
int err = 0;
|
int err = 0;
|
|
|
D2(printk("jffs_build_fs()\n"));
|
D2(printk("jffs_build_fs()\n"));
|
|
|
if (!(c = jffs_create_control(sb->s_dev))) {
|
if (!(c = jffs_create_control(sb->s_dev))) {
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
c->building_fs = 1;
|
c->building_fs = 1;
|
c->sb = sb;
|
c->sb = sb;
|
if ((err = jffs_scan_flash(c)) < 0) {
|
if ((err = jffs_scan_flash(c)) < 0) {
|
goto jffs_build_fs_fail;
|
goto jffs_build_fs_fail;
|
}
|
}
|
|
|
/* Add a virtual root node if no one exists. */
|
/* Add a virtual root node if no one exists. */
|
if (!jffs_find_file(c, JFFS_MIN_INO)) {
|
if (!jffs_find_file(c, JFFS_MIN_INO)) {
|
if ((err = jffs_add_virtual_root(c)) < 0) {
|
if ((err = jffs_add_virtual_root(c)) < 0) {
|
goto jffs_build_fs_fail;
|
goto jffs_build_fs_fail;
|
}
|
}
|
}
|
}
|
|
|
/* Remove deleted nodes. */
|
/* Remove deleted nodes. */
|
if ((err = jffs_foreach_file(c, jffs_possibly_delete_file)) < 0) {
|
if ((err = jffs_foreach_file(c, jffs_possibly_delete_file)) < 0) {
|
printk(KERN_ERR "JFFS: Failed to remove deleted nodes.\n");
|
printk(KERN_ERR "JFFS: Failed to remove deleted nodes.\n");
|
goto jffs_build_fs_fail;
|
goto jffs_build_fs_fail;
|
}
|
}
|
/* Remove redundant nodes. (We are not interested in the
|
/* Remove redundant nodes. (We are not interested in the
|
return value in this case.) */
|
return value in this case.) */
|
jffs_foreach_file(c, jffs_remove_redundant_nodes);
|
jffs_foreach_file(c, jffs_remove_redundant_nodes);
|
/* Try to build a tree from all the nodes. */
|
/* Try to build a tree from all the nodes. */
|
if ((err = jffs_foreach_file(c, jffs_insert_file_into_tree)) < 0) {
|
if ((err = jffs_foreach_file(c, jffs_insert_file_into_tree)) < 0) {
|
printk("JFFS: Failed to build tree.\n");
|
printk("JFFS: Failed to build tree.\n");
|
goto jffs_build_fs_fail;
|
goto jffs_build_fs_fail;
|
}
|
}
|
/* Compute the sizes of all files in the filesystem. Adjust if
|
/* Compute the sizes of all files in the filesystem. Adjust if
|
necessary. */
|
necessary. */
|
if ((err = jffs_foreach_file(c, jffs_build_file)) < 0) {
|
if ((err = jffs_foreach_file(c, jffs_build_file)) < 0) {
|
printk("JFFS: Failed to build file system.\n");
|
printk("JFFS: Failed to build file system.\n");
|
goto jffs_build_fs_fail;
|
goto jffs_build_fs_fail;
|
}
|
}
|
sb->u.generic_sbp = (void *)c;
|
sb->u.generic_sbp = (void *)c;
|
c->building_fs = 0;
|
c->building_fs = 0;
|
|
|
D1(jffs_print_hash_table(c));
|
D1(jffs_print_hash_table(c));
|
D1(jffs_print_tree(c->root, 0));
|
D1(jffs_print_tree(c->root, 0));
|
|
|
return 0;
|
return 0;
|
|
|
jffs_build_fs_fail:
|
jffs_build_fs_fail:
|
jffs_cleanup_control(c);
|
jffs_cleanup_control(c);
|
return err;
|
return err;
|
} /* jffs_build_fs() */
|
} /* jffs_build_fs() */
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* Scan the whole flash memory in order to find all nodes in the
|
/* Scan the whole flash memory in order to find all nodes in the
|
file systems. */
|
file systems. */
|
static int
|
static int
|
jffs_scan_flash(struct jffs_control *c)
|
jffs_scan_flash(struct jffs_control *c)
|
{
|
{
|
char name[JFFS_MAX_NAME_LEN + 2];
|
char name[JFFS_MAX_NAME_LEN + 2];
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
struct jffs_node *node = 0;
|
struct jffs_node *node = 0;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
__u32 checksum;
|
__u32 checksum;
|
__u8 tmp_accurate;
|
__u8 tmp_accurate;
|
__u16 tmp_chksum;
|
__u16 tmp_chksum;
|
unsigned char *pos = (unsigned char *) fmc->flash_start;
|
unsigned char *pos = (unsigned char *) fmc->flash_start;
|
unsigned char *start;
|
unsigned char *start;
|
unsigned char *end = (unsigned char *)
|
unsigned char *end = (unsigned char *)
|
(fmc->flash_start + fmc->flash_size);
|
(fmc->flash_start + fmc->flash_size);
|
|
|
D1(printk("jffs_scan_flash(): start pos = 0x%p, end = 0x%p\n",
|
D1(printk("jffs_scan_flash(): start pos = 0x%p, end = 0x%p\n",
|
pos, end));
|
pos, end));
|
|
|
flash_safe_acquire(fmc->flash_part);
|
flash_safe_acquire(fmc->flash_part);
|
|
|
/* Start the scan. */
|
/* Start the scan. */
|
while (pos < end) {
|
while (pos < end) {
|
|
|
/* Remember the position from where we started this scan. */
|
/* Remember the position from where we started this scan. */
|
start = pos;
|
start = pos;
|
|
|
switch (*(__u32 *)pos) {
|
switch (*(__u32 *)pos) {
|
case JFFS_EMPTY_BITMASK:
|
case JFFS_EMPTY_BITMASK:
|
/* We have found 0xff on this block. We have to
|
/* We have found 0xff on this block. We have to
|
scan the rest of the block to be sure it is
|
scan the rest of the block to be sure it is
|
filled with 0xff. */
|
filled with 0xff. */
|
D1(printk("jffs_scan_flash(): 0xff at pos 0x%p.\n",
|
D1(printk("jffs_scan_flash(): 0xff at pos 0x%p.\n",
|
pos));
|
pos));
|
for (; pos < end
|
for (; pos < end
|
&& JFFS_EMPTY_BITMASK == *(__u32 *)pos;
|
&& JFFS_EMPTY_BITMASK == *(__u32 *)pos;
|
pos += 4);
|
pos += 4);
|
D1(printk("jffs_scan_flash(): 0xff ended at "
|
D1(printk("jffs_scan_flash(): 0xff ended at "
|
"pos 0x%p.\n", pos));
|
"pos 0x%p.\n", pos));
|
continue;
|
continue;
|
|
|
case JFFS_DIRTY_BITMASK:
|
case JFFS_DIRTY_BITMASK:
|
/* We have found 0x00 on this block. We have to
|
/* We have found 0x00 on this block. We have to
|
scan as far as possible to find out how much
|
scan as far as possible to find out how much
|
is dirty. */
|
is dirty. */
|
D1(printk("jffs_scan_flash(): 0x00 at pos 0x%p.\n",
|
D1(printk("jffs_scan_flash(): 0x00 at pos 0x%p.\n",
|
pos));
|
pos));
|
for (; pos < end
|
for (; pos < end
|
&& JFFS_DIRTY_BITMASK == *(__u32 *)pos;
|
&& JFFS_DIRTY_BITMASK == *(__u32 *)pos;
|
pos += 4);
|
pos += 4);
|
D1(printk("jffs_scan_flash(): 0x00 ended at "
|
D1(printk("jffs_scan_flash(): 0x00 ended at "
|
"pos 0x%p.\n", pos));
|
"pos 0x%p.\n", pos));
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start), 0);
|
(__u32) (pos - start), 0);
|
continue;
|
continue;
|
|
|
case JFFS_MAGIC_BITMASK:
|
case JFFS_MAGIC_BITMASK:
|
/* We have probably found a new raw inode. */
|
/* We have probably found a new raw inode. */
|
break;
|
break;
|
|
|
default:
|
default:
|
bad_inode:
|
bad_inode:
|
/* We're f*cked. This is not solved yet. We have
|
/* We're f*cked. This is not solved yet. We have
|
to scan for the magic pattern. */
|
to scan for the magic pattern. */
|
D1(printk("*************** Dirty flash memory or bad inode: "
|
D1(printk("*************** Dirty flash memory or bad inode: "
|
"hexdump(pos = 0x%p, len = 128):\n",
|
"hexdump(pos = 0x%p, len = 128):\n",
|
pos));
|
pos));
|
D1(jffs_hexdump(pos, 128));
|
D1(jffs_hexdump(pos, 128));
|
for (pos += 4; pos < end; pos += 4) {
|
for (pos += 4; pos < end; pos += 4) {
|
switch (*(__u32 *)pos) {
|
switch (*(__u32 *)pos) {
|
case JFFS_MAGIC_BITMASK:
|
case JFFS_MAGIC_BITMASK:
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start),
|
(__u32) (pos - start),
|
0);
|
0);
|
goto cont_scan;
|
goto cont_scan;
|
default:
|
default:
|
break;
|
break;
|
}
|
}
|
}
|
}
|
cont_scan:
|
cont_scan:
|
continue;
|
continue;
|
}
|
}
|
|
|
/* We have found the beginning of an inode. Create a
|
/* We have found the beginning of an inode. Create a
|
node for it. */
|
node for it. */
|
if (!node) {
|
if (!node) {
|
if (!(node = (struct jffs_node *)
|
if (!(node = (struct jffs_node *)
|
kmalloc(sizeof(struct jffs_node),
|
kmalloc(sizeof(struct jffs_node),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
}
|
}
|
|
|
/* Read the next raw inode. */
|
/* Read the next raw inode. */
|
memcpy(&raw_inode, pos, sizeof(struct jffs_raw_inode));
|
memcpy(&raw_inode, pos, sizeof(struct jffs_raw_inode));
|
|
|
/* When we compute the checksum for the inode, we never
|
/* When we compute the checksum for the inode, we never
|
count the 'accurate' or the 'checksum' fields. */
|
count the 'accurate' or the 'checksum' fields. */
|
tmp_accurate = raw_inode.accurate;
|
tmp_accurate = raw_inode.accurate;
|
tmp_chksum = raw_inode.chksum;
|
tmp_chksum = raw_inode.chksum;
|
raw_inode.accurate = 0;
|
raw_inode.accurate = 0;
|
raw_inode.chksum = 0;
|
raw_inode.chksum = 0;
|
checksum = jffs_checksum(&raw_inode,
|
checksum = jffs_checksum(&raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
raw_inode.accurate = tmp_accurate;
|
raw_inode.accurate = tmp_accurate;
|
raw_inode.chksum = tmp_chksum;
|
raw_inode.chksum = tmp_chksum;
|
|
|
D3(printk("*** We have found this raw inode at pos 0x%p "
|
D3(printk("*** We have found this raw inode at pos 0x%p "
|
"on the flash:\n", pos));
|
"on the flash:\n", pos));
|
D3(jffs_print_raw_inode(&raw_inode));
|
D3(jffs_print_raw_inode(&raw_inode));
|
|
|
if (checksum != raw_inode.chksum) {
|
if (checksum != raw_inode.chksum) {
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
"checksum = %u, "
|
"checksum = %u, "
|
"raw_inode.chksum = %u\n",
|
"raw_inode.chksum = %u\n",
|
checksum, raw_inode.chksum));
|
checksum, raw_inode.chksum));
|
pos += sizeof(struct jffs_raw_inode);
|
pos += sizeof(struct jffs_raw_inode);
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start), 0);
|
(__u32) (pos - start), 0);
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
continue;
|
continue;
|
}
|
}
|
|
|
/* Check the raw inode read so far. Start with the
|
/* Check the raw inode read so far. Start with the
|
maximum length of the filename. */
|
maximum length of the filename. */
|
if (raw_inode.nsize > JFFS_MAX_NAME_LEN) {
|
if (raw_inode.nsize > JFFS_MAX_NAME_LEN) {
|
goto bad_inode;
|
goto bad_inode;
|
}
|
}
|
/* The node's data segment should not exceed a
|
/* The node's data segment should not exceed a
|
certain length. */
|
certain length. */
|
if (raw_inode.dsize > fmc->max_chunk_size) {
|
if (raw_inode.dsize > fmc->max_chunk_size) {
|
goto bad_inode;
|
goto bad_inode;
|
}
|
}
|
|
|
pos += sizeof(struct jffs_raw_inode);
|
pos += sizeof(struct jffs_raw_inode);
|
|
|
/* This shouldn't be necessary because a node that
|
/* This shouldn't be necessary because a node that
|
violates the flash boundaries shouldn't be written
|
violates the flash boundaries shouldn't be written
|
in the first place. */
|
in the first place. */
|
if (pos >= end) {
|
if (pos >= end) {
|
goto check_node;
|
goto check_node;
|
}
|
}
|
|
|
/* Read the name. */
|
/* Read the name. */
|
*name = 0;
|
*name = 0;
|
if (raw_inode.nsize) {
|
if (raw_inode.nsize) {
|
memcpy(name, pos, raw_inode.nsize);
|
memcpy(name, pos, raw_inode.nsize);
|
name[raw_inode.nsize] = '\0';
|
name[raw_inode.nsize] = '\0';
|
pos += raw_inode.nsize
|
pos += raw_inode.nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
D3(printk("name == \"%s\"\n", name));
|
D3(printk("name == \"%s\"\n", name));
|
checksum = jffs_checksum(name, raw_inode.nsize);
|
checksum = jffs_checksum(name, raw_inode.nsize);
|
if (checksum != raw_inode.nchksum) {
|
if (checksum != raw_inode.nchksum) {
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
"checksum = %u, "
|
"checksum = %u, "
|
"raw_inode.nchksum = %u\n",
|
"raw_inode.nchksum = %u\n",
|
checksum, raw_inode.nchksum));
|
checksum, raw_inode.nchksum));
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start), 0);
|
(__u32) (pos - start), 0);
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
continue;
|
continue;
|
}
|
}
|
if (pos >= end) {
|
if (pos >= end) {
|
goto check_node;
|
goto check_node;
|
}
|
}
|
}
|
}
|
|
|
/* Read the data in order to be sure it matches the
|
/* Read the data in order to be sure it matches the
|
checksum. */
|
checksum. */
|
checksum = jffs_checksum(pos, raw_inode.dsize);
|
checksum = jffs_checksum(pos, raw_inode.dsize);
|
pos += raw_inode.dsize + JFFS_GET_PAD_BYTES(raw_inode.dsize);
|
pos += raw_inode.dsize + JFFS_GET_PAD_BYTES(raw_inode.dsize);
|
|
|
if (checksum != raw_inode.dchksum) {
|
if (checksum != raw_inode.dchksum) {
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
D1(printk("jffs_scan_flash(): Bad checksum: "
|
"checksum = %u, "
|
"checksum = %u, "
|
"raw_inode.dchksum = %u\n",
|
"raw_inode.dchksum = %u\n",
|
checksum, raw_inode.dchksum));
|
checksum, raw_inode.dchksum));
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start), 0);
|
(__u32) (pos - start), 0);
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
continue;
|
continue;
|
}
|
}
|
|
|
check_node:
|
check_node:
|
|
|
/* Remember the highest inode number in the whole file
|
/* Remember the highest inode number in the whole file
|
system. This information will be used when assigning
|
system. This information will be used when assigning
|
new files new inode numbers. */
|
new files new inode numbers. */
|
if (c->next_ino <= raw_inode.ino) {
|
if (c->next_ino <= raw_inode.ino) {
|
c->next_ino = raw_inode.ino + 1;
|
c->next_ino = raw_inode.ino + 1;
|
}
|
}
|
|
|
if (raw_inode.accurate) {
|
if (raw_inode.accurate) {
|
int err;
|
int err;
|
node->data_offset = raw_inode.offset;
|
node->data_offset = raw_inode.offset;
|
node->data_size = raw_inode.dsize;
|
node->data_size = raw_inode.dsize;
|
node->removed_size = raw_inode.rsize;
|
node->removed_size = raw_inode.rsize;
|
/* Compute the offset to the actual data in the
|
/* Compute the offset to the actual data in the
|
on-flash node. */
|
on-flash node. */
|
node->fm_offset
|
node->fm_offset
|
= sizeof(struct jffs_raw_inode)
|
= sizeof(struct jffs_raw_inode)
|
+ raw_inode.nsize
|
+ raw_inode.nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
node->fm = jffs_fmalloced(fmc, (__u32) start,
|
node->fm = jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start),
|
(__u32) (pos - start),
|
node);
|
node);
|
if (!node->fm) {
|
if (!node->fm) {
|
D(printk("jffs_scan_flash(): !node->fm\n"));
|
D(printk("jffs_scan_flash(): !node->fm\n"));
|
kfree(node);
|
kfree(node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
if ((err = jffs_insert_node(c, 0, &raw_inode,
|
if ((err = jffs_insert_node(c, 0, &raw_inode,
|
name, node)) < 0) {
|
name, node)) < 0) {
|
printk("JFFS: Failed to handle raw inode. "
|
printk("JFFS: Failed to handle raw inode. "
|
"(err = %d)\n", err);
|
"(err = %d)\n", err);
|
break;
|
break;
|
}
|
}
|
D3(jffs_print_node(node));
|
D3(jffs_print_node(node));
|
node = 0; /* Don't free the node! */
|
node = 0; /* Don't free the node! */
|
}
|
}
|
else {
|
else {
|
jffs_fmalloced(fmc, (__u32) start,
|
jffs_fmalloced(fmc, (__u32) start,
|
(__u32) (pos - start), 0);
|
(__u32) (pos - start), 0);
|
D3(printk("jffs_scan_flash(): Just found an obsolete "
|
D3(printk("jffs_scan_flash(): Just found an obsolete "
|
"raw_inode. Continuing the scan...\n"));
|
"raw_inode. Continuing the scan...\n"));
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
}
|
}
|
}
|
}
|
|
|
if (node) {
|
if (node) {
|
kfree(node);
|
kfree(node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
}
|
}
|
jffs_build_end(fmc);
|
jffs_build_end(fmc);
|
D3(printk("jffs_scan_flash(): Leaving...\n"));
|
D3(printk("jffs_scan_flash(): Leaving...\n"));
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
return 0;
|
return 0;
|
} /* jffs_scan_flash() */
|
} /* jffs_scan_flash() */
|
|
|
#else
|
#else
|
|
|
/* Scan the whole flash memory in order to find all nodes in the
|
/* Scan the whole flash memory in order to find all nodes in the
|
file systems. */
|
file systems. */
|
int
|
int
|
jffs_scan_flash(struct jffs_control *c)
|
jffs_scan_flash(struct jffs_control *c)
|
{
|
{
|
char name[JFFS_MAX_NAME_LEN + 2];
|
char name[JFFS_MAX_NAME_LEN + 2];
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
struct jffs_node *node = 0;
|
struct jffs_node *node = 0;
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
kdev_t dev = c->sb->s_dev;
|
kdev_t dev = c->sb->s_dev;
|
__u32 block = 0;
|
__u32 block = 0;
|
__u32 last_block = c->fmc->flash_size / BLOCK_SIZE - 1;
|
__u32 last_block = c->fmc->flash_size / BLOCK_SIZE - 1;
|
__u32 block_offset = 0;
|
__u32 block_offset = 0;
|
__u32 read_size;
|
__u32 read_size;
|
__u32 checksum;
|
__u32 checksum;
|
__u32 offset; /* Offset relative to the start of the flash memory. */
|
__u32 offset; /* Offset relative to the start of the flash memory. */
|
__u8 tmp_accurate;
|
__u8 tmp_accurate;
|
__u32 tmp_chksum;
|
__u32 tmp_chksum;
|
__u32 size;
|
__u32 size;
|
|
|
D(printk("jffs_scan_flash()\n"));
|
D(printk("jffs_scan_flash()\n"));
|
|
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
D(printk("jffs_scan_flash(): First bread() failed.\n"));
|
D(printk("jffs_scan_flash(): First bread() failed.\n"));
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* Start the scan. */
|
/* Start the scan. */
|
while (block <= last_block) {
|
while (block <= last_block) {
|
if (block_offset >= BLOCK_SIZE) {
|
if (block_offset >= BLOCK_SIZE) {
|
brelse(bh);
|
brelse(bh);
|
if (block == last_block) {
|
if (block == last_block) {
|
bh = 0;
|
bh = 0;
|
goto end_of_scan;
|
goto end_of_scan;
|
}
|
}
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
offset = block * BLOCK_SIZE + block_offset;
|
offset = block * BLOCK_SIZE + block_offset;
|
D(printk("jffs_scan_flash(): offset = %u\n", offset));
|
D(printk("jffs_scan_flash(): offset = %u\n", offset));
|
|
|
switch (*(__u32 *)&bh->b_data[block_offset]) {
|
switch (*(__u32 *)&bh->b_data[block_offset]) {
|
case JFFS_EMPTY_BITMASK:
|
case JFFS_EMPTY_BITMASK:
|
/* We have found 0xff on this block. We have to
|
/* We have found 0xff on this block. We have to
|
scan the rest of the block to be sure it is
|
scan the rest of the block to be sure it is
|
filled with 0xff. */
|
filled with 0xff. */
|
D(printk("jffs_scan_flash(): 0xff on block %u, "
|
D(printk("jffs_scan_flash(): 0xff on block %u, "
|
"block_offset %u.\n", block, block_offset));
|
"block_offset %u.\n", block, block_offset));
|
block_offset += 4;
|
block_offset += 4;
|
while (block <= last_block) {
|
while (block <= last_block) {
|
for (; block_offset < BLOCK_SIZE;
|
for (; block_offset < BLOCK_SIZE;
|
block_offset += 4) {
|
block_offset += 4) {
|
if (JFFS_EMPTY_BITMASK
|
if (JFFS_EMPTY_BITMASK
|
!= *(__u32 *)&bh->b_data[block_offset]) {
|
!= *(__u32 *)&bh->b_data[block_offset]) {
|
goto ff_scan_end;
|
goto ff_scan_end;
|
}
|
}
|
}
|
}
|
brelse(bh);
|
brelse(bh);
|
block_offset = 0;
|
block_offset = 0;
|
if (block >= last_block) {
|
if (block >= last_block) {
|
bh = 0;
|
bh = 0;
|
D(printk("jffs_scan_flash(): "
|
D(printk("jffs_scan_flash(): "
|
"0xff size: %d\n",
|
"0xff size: %d\n",
|
(last_block + 1) * BLOCK_SIZE
|
(last_block + 1) * BLOCK_SIZE
|
- offset));
|
- offset));
|
goto end_of_scan;
|
goto end_of_scan;
|
}
|
}
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
}
|
}
|
ff_scan_end:
|
ff_scan_end:
|
D(printk("jffs_scan_flash(): 0xff size: %d\n",
|
D(printk("jffs_scan_flash(): 0xff size: %d\n",
|
block * BLOCK_SIZE + block_offset - offset));
|
block * BLOCK_SIZE + block_offset - offset));
|
continue;
|
continue;
|
case JFFS_DIRTY_BITMASK:
|
case JFFS_DIRTY_BITMASK:
|
/* We have found 0x00 on this block. We have to
|
/* We have found 0x00 on this block. We have to
|
scan as far as possible to find out how much
|
scan as far as possible to find out how much
|
is dirty. */
|
is dirty. */
|
D(printk("jffs_scan_flash(): 0x00 on block %u, "
|
D(printk("jffs_scan_flash(): 0x00 on block %u, "
|
"block_offset %u.\n",
|
"block_offset %u.\n",
|
block, block_offset));
|
block, block_offset));
|
block_offset += 4;
|
block_offset += 4;
|
while (block < last_block) {
|
while (block < last_block) {
|
for (; block_offset < BLOCK_SIZE;
|
for (; block_offset < BLOCK_SIZE;
|
block_offset += 4) {
|
block_offset += 4) {
|
if (*(__u32 *)&bh->b_data[block_offset]
|
if (*(__u32 *)&bh->b_data[block_offset]
|
!= JFFS_DIRTY_BITMASK) {
|
!= JFFS_DIRTY_BITMASK) {
|
goto zero_scan_end;
|
goto zero_scan_end;
|
}
|
}
|
}
|
}
|
brelse(bh);
|
brelse(bh);
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
zero_scan_end:
|
zero_scan_end:
|
D(printk("jffs_scan_flash(): 0x00 size: %d\n",
|
D(printk("jffs_scan_flash(): 0x00 size: %d\n",
|
block * BLOCK_SIZE + block_offset - offset));
|
block * BLOCK_SIZE + block_offset - offset));
|
jffs_fmalloced(c->fmc, offset,
|
jffs_fmalloced(c->fmc, offset,
|
block * BLOCK_SIZE + block_offset
|
block * BLOCK_SIZE + block_offset
|
- offset, 0);
|
- offset, 0);
|
continue;
|
continue;
|
case JFFS_MAGIC_BITMASK:
|
case JFFS_MAGIC_BITMASK:
|
/* We have probably found a new raw inode. */
|
/* We have probably found a new raw inode. */
|
break;
|
break;
|
default:
|
default:
|
/* We're f*cked. This is not solved yet. We have
|
/* We're f*cked. This is not solved yet. We have
|
to scan for the magic pattern. */
|
to scan for the magic pattern. */
|
D(printk("jffs_scan_flash(): Block #%u at "
|
D(printk("jffs_scan_flash(): Block #%u at "
|
"block_offset %u is dirty!\n",
|
"block_offset %u is dirty!\n",
|
block, block_offset));
|
block, block_offset));
|
D(printk(" offset: %u\n", offset));
|
D(printk(" offset: %u\n", offset));
|
D(printk(" data: %u\n",
|
D(printk(" data: %u\n",
|
*(__u32 *)&bh->b_data[block_offset]));
|
*(__u32 *)&bh->b_data[block_offset]));
|
jffs_fmalloced(c->fmc, offset,
|
jffs_fmalloced(c->fmc, offset,
|
BLOCK_SIZE - block_offset, 0);
|
BLOCK_SIZE - block_offset, 0);
|
block_offset = BLOCK_SIZE;
|
block_offset = BLOCK_SIZE;
|
continue;
|
continue;
|
}
|
}
|
|
|
/* We have found the beginning of an inode. Create a
|
/* We have found the beginning of an inode. Create a
|
node for it. */
|
node for it. */
|
if (!node) {
|
if (!node) {
|
if (!(node = (struct jffs_node *)
|
if (!(node = (struct jffs_node *)
|
kmalloc(sizeof(struct jffs_node),
|
kmalloc(sizeof(struct jffs_node),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
brelse(bh);
|
brelse(bh);
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
}
|
}
|
|
|
/* Read the next raw inode. */
|
/* Read the next raw inode. */
|
read_size = jffs_min(BLOCK_SIZE - block_offset,
|
read_size = jffs_min(BLOCK_SIZE - block_offset,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
memcpy(&raw_inode, &bh->b_data[block_offset], read_size);
|
memcpy(&raw_inode, &bh->b_data[block_offset], read_size);
|
D(printk("jffs_scan_flash(): block_offset: %u, "
|
D(printk("jffs_scan_flash(): block_offset: %u, "
|
"read_size: %u\n", block_offset, read_size));
|
"read_size: %u\n", block_offset, read_size));
|
block_offset += read_size;
|
block_offset += read_size;
|
if (read_size < sizeof(struct jffs_raw_inode)) {
|
if (read_size < sizeof(struct jffs_raw_inode)) {
|
brelse(bh);
|
brelse(bh);
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = sizeof(struct jffs_raw_inode) - read_size;
|
block_offset = sizeof(struct jffs_raw_inode) - read_size;
|
memcpy((void *)&raw_inode + read_size, bh->b_data,
|
memcpy((void *)&raw_inode + read_size, bh->b_data,
|
block_offset);
|
block_offset);
|
}
|
}
|
/* When we compute the checksum for the inode, we never count
|
/* When we compute the checksum for the inode, we never count
|
the 'accurate' or the 'checksum' fields. */
|
the 'accurate' or the 'checksum' fields. */
|
tmp_accurate = raw_inode.accurate;
|
tmp_accurate = raw_inode.accurate;
|
tmp_chksum = raw_inode.chksum;
|
tmp_chksum = raw_inode.chksum;
|
raw_inode.accurate = 0;
|
raw_inode.accurate = 0;
|
raw_inode.chksum = 0;
|
raw_inode.chksum = 0;
|
checksum = jffs_checksum(&raw_inode,
|
checksum = jffs_checksum(&raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
raw_inode.accurate = tmp_accurate;
|
raw_inode.accurate = tmp_accurate;
|
raw_inode.chksum = tmp_chksum;
|
raw_inode.chksum = tmp_chksum;
|
|
|
D(printk("*** We have found this raw inode at pos 0x%08x "
|
D(printk("*** We have found this raw inode at pos 0x%08x "
|
"on the flash:\n", offset));
|
"on the flash:\n", offset));
|
jffs_print_raw_inode(&raw_inode);
|
jffs_print_raw_inode(&raw_inode);
|
|
|
if (block_offset == BLOCK_SIZE) {
|
if (block_offset == BLOCK_SIZE) {
|
brelse(bh);
|
brelse(bh);
|
if (block == last_block) {
|
if (block == last_block) {
|
bh = 0;
|
bh = 0;
|
goto check_node;
|
goto check_node;
|
}
|
}
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
|
|
/* Read the name. */
|
/* Read the name. */
|
*name = 0;
|
*name = 0;
|
if (raw_inode.nsize) {
|
if (raw_inode.nsize) {
|
read_size = jffs_min(BLOCK_SIZE - block_offset,
|
read_size = jffs_min(BLOCK_SIZE - block_offset,
|
raw_inode.nsize);
|
raw_inode.nsize);
|
memcpy(name, &bh->b_data[block_offset], read_size);
|
memcpy(name, &bh->b_data[block_offset], read_size);
|
block_offset += read_size;
|
block_offset += read_size;
|
if (read_size < raw_inode.nsize) {
|
if (read_size < raw_inode.nsize) {
|
/* We haven't read the whole name. */
|
/* We haven't read the whole name. */
|
brelse(bh);
|
brelse(bh);
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = raw_inode.nsize - read_size;
|
block_offset = raw_inode.nsize - read_size;
|
memcpy(&name[read_size], bh->b_data, block_offset);
|
memcpy(&name[read_size], bh->b_data, block_offset);
|
}
|
}
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
name[raw_inode.nsize] = '\0';
|
name[raw_inode.nsize] = '\0';
|
checksum += jffs_checksum(name, raw_inode.nsize);
|
checksum += jffs_checksum(name, raw_inode.nsize);
|
}
|
}
|
|
|
if (block_offset == BLOCK_SIZE) {
|
if (block_offset == BLOCK_SIZE) {
|
brelse(bh);
|
brelse(bh);
|
if (block == last_block) {
|
if (block == last_block) {
|
bh = 0;
|
bh = 0;
|
goto check_node;
|
goto check_node;
|
}
|
}
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
|
|
/* Read the data in order to be sure it matches the
|
/* Read the data in order to be sure it matches the
|
checksum. */
|
checksum. */
|
if (raw_inode.dsize) {
|
if (raw_inode.dsize) {
|
__u32 chunk_size = jffs_min(BLOCK_SIZE - block_offset,
|
__u32 chunk_size = jffs_min(BLOCK_SIZE - block_offset,
|
raw_inode.dsize);
|
raw_inode.dsize);
|
__u32 data_read = chunk_size;
|
__u32 data_read = chunk_size;
|
checksum += jffs_checksum(&bh->b_data[block_offset],
|
checksum += jffs_checksum(&bh->b_data[block_offset],
|
data_read);
|
data_read);
|
block_offset += chunk_size;
|
block_offset += chunk_size;
|
while (data_read < raw_inode.dsize) {
|
while (data_read < raw_inode.dsize) {
|
brelse(bh);
|
brelse(bh);
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, ++block, BLOCK_SIZE))) {
|
return -1;
|
return -1;
|
}
|
}
|
chunk_size = jffs_min(BLOCK_SIZE,
|
chunk_size = jffs_min(BLOCK_SIZE,
|
raw_inode.dsize
|
raw_inode.dsize
|
- data_read);
|
- data_read);
|
data_read += chunk_size;
|
data_read += chunk_size;
|
checksum += jffs_checksum(bh->b_data,
|
checksum += jffs_checksum(bh->b_data,
|
chunk_size);
|
chunk_size);
|
block_offset = chunk_size;
|
block_offset = chunk_size;
|
}
|
}
|
}
|
}
|
size = sizeof(struct jffs_raw_inode) + raw_inode.nsize
|
size = sizeof(struct jffs_raw_inode) + raw_inode.nsize
|
+ raw_inode.dsize;
|
+ raw_inode.dsize;
|
|
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
|
|
/* Make sure the checksums are equal. */
|
/* Make sure the checksums are equal. */
|
if (checksum != raw_inode.chksum) {
|
if (checksum != raw_inode.chksum) {
|
/* Something was wrong with the node. The node
|
/* Something was wrong with the node. The node
|
has to be discarded. */
|
has to be discarded. */
|
D(printk("jffs_scan_flash(): checksum == %u, "
|
D(printk("jffs_scan_flash(): checksum == %u, "
|
"raw_inode.chksum == %u\n",
|
"raw_inode.chksum == %u\n",
|
checksum, raw_inode.chksum));
|
checksum, raw_inode.chksum));
|
jffs_fmalloced(c->fmc, offset, size, 0);
|
jffs_fmalloced(c->fmc, offset, size, 0);
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
continue;
|
continue;
|
}
|
}
|
|
|
/* Remember the highest inode number in the whole file
|
/* Remember the highest inode number in the whole file
|
system. This information will be used when assigning
|
system. This information will be used when assigning
|
new files new inode numbers. */
|
new files new inode numbers. */
|
if (c->next_ino <= raw_inode.ino) {
|
if (c->next_ino <= raw_inode.ino) {
|
c->next_ino = raw_inode.ino + 1;
|
c->next_ino = raw_inode.ino + 1;
|
}
|
}
|
|
|
check_node:
|
check_node:
|
if (raw_inode.accurate) {
|
if (raw_inode.accurate) {
|
node->data_offset = raw_inode.offset;
|
node->data_offset = raw_inode.offset;
|
node->data_size = raw_inode.dsize;
|
node->data_size = raw_inode.dsize;
|
node->removed_size = raw_inode.rsize;
|
node->removed_size = raw_inode.rsize;
|
node->fm_offset = sizeof(struct jffs_raw_inode)
|
node->fm_offset = sizeof(struct jffs_raw_inode)
|
+ raw_inode.nsize
|
+ raw_inode.nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode.nsize);
|
node->fm = jffs_fmalloced(c->fmc, offset, size, node);
|
node->fm = jffs_fmalloced(c->fmc, offset, size, node);
|
if (!node->fm) {
|
if (!node->fm) {
|
D(printk("jffs_scan_flash(): !node->fm\n"));
|
D(printk("jffs_scan_flash(): !node->fm\n"));
|
kfree(node);
|
kfree(node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
brelse(bh);
|
brelse(bh);
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
jffs_insert_node(c, 0, &raw_inode, name, node);
|
jffs_insert_node(c, 0, &raw_inode, name, node);
|
jffs_print_node(node);
|
jffs_print_node(node);
|
node = 0; /* Don't free the node! */
|
node = 0; /* Don't free the node! */
|
}
|
}
|
else {
|
else {
|
jffs_fmalloced(c->fmc, offset, size, 0);
|
jffs_fmalloced(c->fmc, offset, size, 0);
|
D(printk("jffs_scan_flash(): Just found an obsolete "
|
D(printk("jffs_scan_flash(): Just found an obsolete "
|
"raw_inode. Continuing the scan...\n"));
|
"raw_inode. Continuing the scan...\n"));
|
/* Reuse this unused struct jffs_node. */
|
/* Reuse this unused struct jffs_node. */
|
}
|
}
|
}
|
}
|
|
|
end_of_scan:
|
end_of_scan:
|
brelse(bh);
|
brelse(bh);
|
if (node) {
|
if (node) {
|
kfree(node);
|
kfree(node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
}
|
}
|
jffs_build_end(c->fmc);
|
jffs_build_end(c->fmc);
|
D(printk("jffs_scan_flash(): Leaving...\n"));
|
D(printk("jffs_scan_flash(): Leaving...\n"));
|
return 0;
|
return 0;
|
} /* jffs_scan_flash() */
|
} /* jffs_scan_flash() */
|
|
|
#endif
|
#endif
|
|
|
|
|
/* Insert any kind of node into the file system. Take care of data
|
/* Insert any kind of node into the file system. Take care of data
|
insertions and deletions. Also remove redundant information. The
|
insertions and deletions. Also remove redundant information. The
|
memory allocated for the `name' is regarded as "given away" in the
|
memory allocated for the `name' is regarded as "given away" in the
|
caller's perspective. */
|
caller's perspective. */
|
int
|
int
|
jffs_insert_node(struct jffs_control *c, struct jffs_file *f,
|
jffs_insert_node(struct jffs_control *c, struct jffs_file *f,
|
const struct jffs_raw_inode *raw_inode,
|
const struct jffs_raw_inode *raw_inode,
|
const char *name, struct jffs_node *node)
|
const char *name, struct jffs_node *node)
|
{
|
{
|
int update_name = 0;
|
int update_name = 0;
|
int insert_into_tree = 0;
|
int insert_into_tree = 0;
|
|
|
D2(printk("jffs_insert_node(): ino = %u, version = %u, name = \"%s\"\n",
|
D2(printk("jffs_insert_node(): ino = %u, version = %u, name = \"%s\"\n",
|
raw_inode->ino, raw_inode->version,
|
raw_inode->ino, raw_inode->version,
|
((name && *name) ? name : "")));
|
((name && *name) ? name : "")));
|
|
|
/* If there doesn't exist an associated jffs_file, then
|
/* If there doesn't exist an associated jffs_file, then
|
create, initialize and insert one into the file system. */
|
create, initialize and insert one into the file system. */
|
if (!f && !(f = jffs_find_file(c, raw_inode->ino))) {
|
if (!f && !(f = jffs_find_file(c, raw_inode->ino))) {
|
if (!(f = jffs_create_file(c, raw_inode))) {
|
if (!(f = jffs_create_file(c, raw_inode))) {
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
jffs_insert_file_into_hash(f);
|
jffs_insert_file_into_hash(f);
|
insert_into_tree = 1;
|
insert_into_tree = 1;
|
}
|
}
|
|
|
node->ino = raw_inode->ino;
|
node->ino = raw_inode->ino;
|
node->version = raw_inode->version;
|
node->version = raw_inode->version;
|
node->data_size = raw_inode->dsize;
|
node->data_size = raw_inode->dsize;
|
node->fm_offset = sizeof(struct jffs_raw_inode) + raw_inode->nsize
|
node->fm_offset = sizeof(struct jffs_raw_inode) + raw_inode->nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize);
|
node->name_size = raw_inode->nsize;
|
node->name_size = raw_inode->nsize;
|
|
|
/* Now insert the node at the correct position into the file's
|
/* Now insert the node at the correct position into the file's
|
version list. */
|
version list. */
|
if (!f->version_head) {
|
if (!f->version_head) {
|
/* This is the first node. */
|
/* This is the first node. */
|
f->version_head = node;
|
f->version_head = node;
|
f->version_tail = node;
|
f->version_tail = node;
|
node->version_prev = 0;
|
node->version_prev = 0;
|
node->version_next = 0;
|
node->version_next = 0;
|
f->highest_version = node->version;
|
f->highest_version = node->version;
|
update_name = 1;
|
update_name = 1;
|
f->mode = raw_inode->mode;
|
f->mode = raw_inode->mode;
|
f->uid = raw_inode->uid;
|
f->uid = raw_inode->uid;
|
f->gid = raw_inode->gid;
|
f->gid = raw_inode->gid;
|
f->atime = raw_inode->atime;
|
f->atime = raw_inode->atime;
|
f->mtime = raw_inode->mtime;
|
f->mtime = raw_inode->mtime;
|
f->ctime = raw_inode->ctime;
|
f->ctime = raw_inode->ctime;
|
f->deleted = raw_inode->deleted;
|
f->deleted = raw_inode->deleted;
|
}
|
}
|
else if ((f->highest_version < node->version)
|
else if ((f->highest_version < node->version)
|
|| (node->version == 0)) {
|
|| (node->version == 0)) {
|
/* Insert at the end of the list. I.e. this node is the
|
/* Insert at the end of the list. I.e. this node is the
|
oldest one so far. */
|
oldest one so far. */
|
node->version_prev = f->version_tail;
|
node->version_prev = f->version_tail;
|
node->version_next = 0;
|
node->version_next = 0;
|
f->version_tail->version_next = node;
|
f->version_tail->version_next = node;
|
f->version_tail = node;
|
f->version_tail = node;
|
f->highest_version = node->version;
|
f->highest_version = node->version;
|
update_name = 1;
|
update_name = 1;
|
f->pino = raw_inode->pino;
|
f->pino = raw_inode->pino;
|
f->mode = raw_inode->mode;
|
f->mode = raw_inode->mode;
|
f->uid = raw_inode->uid;
|
f->uid = raw_inode->uid;
|
f->gid = raw_inode->gid;
|
f->gid = raw_inode->gid;
|
f->atime = raw_inode->atime;
|
f->atime = raw_inode->atime;
|
f->mtime = raw_inode->mtime;
|
f->mtime = raw_inode->mtime;
|
f->ctime = raw_inode->ctime;
|
f->ctime = raw_inode->ctime;
|
f->deleted = raw_inode->deleted;
|
f->deleted = raw_inode->deleted;
|
}
|
}
|
else if (f->version_head->version > node->version) {
|
else if (f->version_head->version > node->version) {
|
/* Insert at the bottom of the list. */
|
/* Insert at the bottom of the list. */
|
node->version_prev = 0;
|
node->version_prev = 0;
|
node->version_next = f->version_head;
|
node->version_next = f->version_head;
|
f->version_head->version_prev = node;
|
f->version_head->version_prev = node;
|
f->version_head = node;
|
f->version_head = node;
|
if (!f->name) {
|
if (!f->name) {
|
update_name = 1;
|
update_name = 1;
|
}
|
}
|
if (raw_inode->deleted) {
|
if (raw_inode->deleted) {
|
f->deleted = raw_inode->deleted;
|
f->deleted = raw_inode->deleted;
|
}
|
}
|
}
|
}
|
else {
|
else {
|
struct jffs_node *n;
|
struct jffs_node *n;
|
int newer_name = 0;
|
int newer_name = 0;
|
/* Search for the insertion position starting from
|
/* Search for the insertion position starting from
|
the tail (newest node). */
|
the tail (newest node). */
|
for (n = f->version_tail; n; n = n->version_prev) {
|
for (n = f->version_tail; n; n = n->version_prev) {
|
if (n->version < node->version) {
|
if (n->version < node->version) {
|
node->version_prev = n;
|
node->version_prev = n;
|
node->version_next = n->version_next;
|
node->version_next = n->version_next;
|
node->version_next->version_prev = node;
|
node->version_next->version_prev = node;
|
n->version_next = node;
|
n->version_next = node;
|
if (!newer_name) {
|
if (!newer_name) {
|
update_name = 1;
|
update_name = 1;
|
}
|
}
|
break;
|
break;
|
}
|
}
|
if (n->name_size) {
|
if (n->name_size) {
|
newer_name = 1;
|
newer_name = 1;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Perhaps update the name. */
|
/* Perhaps update the name. */
|
if (raw_inode->nsize && update_name && name && *name) {
|
if (raw_inode->nsize && update_name && name && *name) {
|
if (f->name) {
|
if (f->name) {
|
kfree(f->name);
|
kfree(f->name);
|
DJM(no_name--);
|
DJM(no_name--);
|
}
|
}
|
if (!(f->name = (char *) kmalloc(raw_inode->nsize + 1,
|
if (!(f->name = (char *) kmalloc(raw_inode->nsize + 1,
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_name++);
|
DJM(no_name++);
|
memcpy(f->name, name, raw_inode->nsize);
|
memcpy(f->name, name, raw_inode->nsize);
|
f->name[raw_inode->nsize] = '\0';
|
f->name[raw_inode->nsize] = '\0';
|
f->nsize = raw_inode->nsize;
|
f->nsize = raw_inode->nsize;
|
D3(printk("jffs_insert_node(): Updated the name of "
|
D3(printk("jffs_insert_node(): Updated the name of "
|
"the file to \"%s\".\n", name));
|
"the file to \"%s\".\n", name));
|
}
|
}
|
|
|
if (!c->building_fs) {
|
if (!c->building_fs) {
|
D3(printk("jffs_insert_node(): ---------------------------"
|
D3(printk("jffs_insert_node(): ---------------------------"
|
"------------------------------------------- 1\n"));
|
"------------------------------------------- 1\n"));
|
if (insert_into_tree) {
|
if (insert_into_tree) {
|
jffs_insert_file_into_tree(f);
|
jffs_insert_file_into_tree(f);
|
}
|
}
|
if (f->deleted) {
|
if (f->deleted) {
|
/* Mark all versions of the node as obsolete. */
|
/* Mark all versions of the node as obsolete. */
|
jffs_possibly_delete_file(f);
|
jffs_possibly_delete_file(f);
|
}
|
}
|
else {
|
else {
|
if (node->data_size || node->removed_size) {
|
if (node->data_size || node->removed_size) {
|
jffs_update_file(f, node);
|
jffs_update_file(f, node);
|
}
|
}
|
jffs_remove_redundant_nodes(f);
|
jffs_remove_redundant_nodes(f);
|
}
|
}
|
#ifdef USE_GC
|
#ifdef USE_GC
|
if (!c->fmc->no_call_gc) {
|
if (!c->fmc->no_call_gc) {
|
jffs_garbage_collect(c);
|
jffs_garbage_collect(c);
|
}
|
}
|
#endif
|
#endif
|
D3(printk("jffs_insert_node(): ---------------------------"
|
D3(printk("jffs_insert_node(): ---------------------------"
|
"------------------------------------------- 2\n"));
|
"------------------------------------------- 2\n"));
|
}
|
}
|
|
|
return 0;
|
return 0;
|
} /* jffs_insert_node() */
|
} /* jffs_insert_node() */
|
|
|
|
|
/* Unlink a jffs_node from the version list it is in. */
|
/* Unlink a jffs_node from the version list it is in. */
|
static inline void
|
static inline void
|
jffs_unlink_node_from_version_list(struct jffs_file *f,
|
jffs_unlink_node_from_version_list(struct jffs_file *f,
|
struct jffs_node *node)
|
struct jffs_node *node)
|
{
|
{
|
if (node->version_prev) {
|
if (node->version_prev) {
|
node->version_prev->version_next = node->version_next;
|
node->version_prev->version_next = node->version_next;
|
} else {
|
} else {
|
f->version_head = node->version_next;
|
f->version_head = node->version_next;
|
}
|
}
|
if (node->version_next) {
|
if (node->version_next) {
|
node->version_next->version_prev = node->version_prev;
|
node->version_next->version_prev = node->version_prev;
|
} else {
|
} else {
|
f->version_tail = node->version_prev;
|
f->version_tail = node->version_prev;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Unlink a jffs_node from the range list it is in. */
|
/* Unlink a jffs_node from the range list it is in. */
|
static inline void
|
static inline void
|
jffs_unlink_node_from_range_list(struct jffs_file *f, struct jffs_node *node)
|
jffs_unlink_node_from_range_list(struct jffs_file *f, struct jffs_node *node)
|
{
|
{
|
if (node->range_prev) {
|
if (node->range_prev) {
|
node->range_prev->range_next = node->range_next;
|
node->range_prev->range_next = node->range_next;
|
}
|
}
|
else {
|
else {
|
f->range_head = node->range_next;
|
f->range_head = node->range_next;
|
}
|
}
|
if (node->range_next) {
|
if (node->range_next) {
|
node->range_next->range_prev = node->range_prev;
|
node->range_next->range_prev = node->range_prev;
|
}
|
}
|
else {
|
else {
|
f->range_tail = node->range_prev;
|
f->range_tail = node->range_prev;
|
}
|
}
|
}
|
}
|
|
|
|
|
/* Function used by jffs_remove_redundant_nodes() below. This function
|
/* Function used by jffs_remove_redundant_nodes() below. This function
|
classifies what kind of information a node adds to a file. */
|
classifies what kind of information a node adds to a file. */
|
static inline __u8
|
static inline __u8
|
jffs_classify_node(struct jffs_node *node)
|
jffs_classify_node(struct jffs_node *node)
|
{
|
{
|
__u8 mod_type = JFFS_MODIFY_INODE;
|
__u8 mod_type = JFFS_MODIFY_INODE;
|
|
|
if (node->name_size) {
|
if (node->name_size) {
|
mod_type |= JFFS_MODIFY_NAME;
|
mod_type |= JFFS_MODIFY_NAME;
|
}
|
}
|
if (node->data_size || node->removed_size) {
|
if (node->data_size || node->removed_size) {
|
mod_type |= JFFS_MODIFY_DATA;
|
mod_type |= JFFS_MODIFY_DATA;
|
}
|
}
|
return mod_type;
|
return mod_type;
|
}
|
}
|
|
|
|
|
/* Remove redundant nodes from a file. Mark the on-flash memory
|
/* Remove redundant nodes from a file. Mark the on-flash memory
|
as dirty. */
|
as dirty. */
|
int
|
int
|
jffs_remove_redundant_nodes(struct jffs_file *f)
|
jffs_remove_redundant_nodes(struct jffs_file *f)
|
{
|
{
|
struct jffs_node *newest_node;
|
struct jffs_node *newest_node;
|
struct jffs_node *cur;
|
struct jffs_node *cur;
|
struct jffs_node *prev;
|
struct jffs_node *prev;
|
__u8 newest_type;
|
__u8 newest_type;
|
__u8 mod_type;
|
__u8 mod_type;
|
__u8 node_with_name_later = 0;
|
__u8 node_with_name_later = 0;
|
|
|
if (!(newest_node = f->version_tail)) {
|
if (!(newest_node = f->version_tail)) {
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* What does the `newest_node' modify? */
|
/* What does the `newest_node' modify? */
|
newest_type = jffs_classify_node(newest_node);
|
newest_type = jffs_classify_node(newest_node);
|
node_with_name_later = newest_type & JFFS_MODIFY_NAME;
|
node_with_name_later = newest_type & JFFS_MODIFY_NAME;
|
|
|
D3(printk("jffs_remove_redundant_nodes(): ino: %u, name: \"%s\", "
|
D3(printk("jffs_remove_redundant_nodes(): ino: %u, name: \"%s\", "
|
"newest_type: %u\n", f->ino, (f->name ? f->name : ""),
|
"newest_type: %u\n", f->ino, (f->name ? f->name : ""),
|
newest_type));
|
newest_type));
|
|
|
/* Traverse the file's nodes and determine which of them that are
|
/* Traverse the file's nodes and determine which of them that are
|
superfluous. Yeah, this might look very complex at first
|
superfluous. Yeah, this might look very complex at first
|
glance but it is actually very simple. */
|
glance but it is actually very simple. */
|
for (cur = newest_node->version_prev; cur; cur = prev) {
|
for (cur = newest_node->version_prev; cur; cur = prev) {
|
prev = cur->version_prev;
|
prev = cur->version_prev;
|
mod_type = jffs_classify_node(cur);
|
mod_type = jffs_classify_node(cur);
|
if ((mod_type <= JFFS_MODIFY_INODE)
|
if ((mod_type <= JFFS_MODIFY_INODE)
|
|| ((newest_type & JFFS_MODIFY_NAME)
|
|| ((newest_type & JFFS_MODIFY_NAME)
|
&& (mod_type
|
&& (mod_type
|
<= (JFFS_MODIFY_INODE + JFFS_MODIFY_NAME)))
|
<= (JFFS_MODIFY_INODE + JFFS_MODIFY_NAME)))
|
|| (cur->data_size == 0 && cur->removed_size
|
|| (cur->data_size == 0 && cur->removed_size
|
&& !cur->version_prev && node_with_name_later)) {
|
&& !cur->version_prev && node_with_name_later)) {
|
/* Yes, this node is redundant. Remove it. */
|
/* Yes, this node is redundant. Remove it. */
|
D2(printk("jffs_remove_redundant_nodes(): "
|
D2(printk("jffs_remove_redundant_nodes(): "
|
"Removing node: ino: %u, version: %u, "
|
"Removing node: ino: %u, version: %u, "
|
"mod_type: %u\n", cur->ino, cur->version,
|
"mod_type: %u\n", cur->ino, cur->version,
|
mod_type));
|
mod_type));
|
jffs_unlink_node_from_version_list(f, cur);
|
jffs_unlink_node_from_version_list(f, cur);
|
jffs_fmfree(f->c->fmc, cur->fm, cur);
|
jffs_fmfree(f->c->fmc, cur->fm, cur);
|
kfree(cur);
|
kfree(cur);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
}
|
}
|
else {
|
else {
|
node_with_name_later |= (mod_type & JFFS_MODIFY_NAME);
|
node_with_name_later |= (mod_type & JFFS_MODIFY_NAME);
|
}
|
}
|
}
|
}
|
|
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Insert a file into the hash table. */
|
/* Insert a file into the hash table. */
|
int
|
int
|
jffs_insert_file_into_hash(struct jffs_file *f)
|
jffs_insert_file_into_hash(struct jffs_file *f)
|
{
|
{
|
int i = f->ino % f->c->hash_len;
|
int i = f->ino % f->c->hash_len;
|
|
|
D3(printk("jffs_insert_file_into_hash(): f->ino: %u\n", f->ino));
|
D3(printk("jffs_insert_file_into_hash(): f->ino: %u\n", f->ino));
|
|
|
f->hash_next = f->c->hash[i];
|
f->hash_next = f->c->hash[i];
|
if (f->hash_next) {
|
if (f->hash_next) {
|
f->hash_next->hash_prev = f;
|
f->hash_next->hash_prev = f;
|
}
|
}
|
f->hash_prev = 0;
|
f->hash_prev = 0;
|
f->c->hash[i] = f;
|
f->c->hash[i] = f;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Insert a file into the file system tree. */
|
/* Insert a file into the file system tree. */
|
int
|
int
|
jffs_insert_file_into_tree(struct jffs_file *f)
|
jffs_insert_file_into_tree(struct jffs_file *f)
|
{
|
{
|
struct jffs_file *parent;
|
struct jffs_file *parent;
|
|
|
D3(printk("jffs_insert_file_into_tree(): name: \"%s\"\n",
|
D3(printk("jffs_insert_file_into_tree(): name: \"%s\"\n",
|
(f->name ? f->name : "")));
|
(f->name ? f->name : "")));
|
|
|
if (!(parent = jffs_find_file(f->c, f->pino))) {
|
if (!(parent = jffs_find_file(f->c, f->pino))) {
|
if (f->pino == 0) {
|
if (f->pino == 0) {
|
f->c->root = f;
|
f->c->root = f;
|
f->parent = 0;
|
f->parent = 0;
|
f->sibling_prev = 0;
|
f->sibling_prev = 0;
|
f->sibling_next = 0;
|
f->sibling_next = 0;
|
return 0;
|
return 0;
|
}
|
}
|
else {
|
else {
|
D1(printk("jffs_insert_file_into_tree(): Found "
|
D1(printk("jffs_insert_file_into_tree(): Found "
|
"inode with no parent and pino == %u\n",
|
"inode with no parent and pino == %u\n",
|
f->pino));
|
f->pino));
|
return -1;
|
return -1;
|
}
|
}
|
}
|
}
|
f->parent = parent;
|
f->parent = parent;
|
f->sibling_next = parent->children;
|
f->sibling_next = parent->children;
|
if (f->sibling_next) {
|
if (f->sibling_next) {
|
f->sibling_next->sibling_prev = f;
|
f->sibling_next->sibling_prev = f;
|
}
|
}
|
f->sibling_prev = 0;
|
f->sibling_prev = 0;
|
parent->children = f;
|
parent->children = f;
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Remove a file from the hash table. */
|
/* Remove a file from the hash table. */
|
int
|
int
|
jffs_unlink_file_from_hash(struct jffs_file *f)
|
jffs_unlink_file_from_hash(struct jffs_file *f)
|
{
|
{
|
D3(printk("jffs_unlink_file_from_hash(): f: 0x%p, "
|
D3(printk("jffs_unlink_file_from_hash(): f: 0x%p, "
|
"ino %u\n", f, f->ino));
|
"ino %u\n", f, f->ino));
|
|
|
if (f->hash_next) {
|
if (f->hash_next) {
|
f->hash_next->hash_prev = f->hash_prev;
|
f->hash_next->hash_prev = f->hash_prev;
|
}
|
}
|
if (f->hash_prev) {
|
if (f->hash_prev) {
|
f->hash_prev->hash_next = f->hash_next;
|
f->hash_prev->hash_next = f->hash_next;
|
}
|
}
|
else {
|
else {
|
f->c->hash[f->ino % f->c->hash_len] = f->hash_next;
|
f->c->hash[f->ino % f->c->hash_len] = f->hash_next;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Just remove the file from the parent's children. Don't free
|
/* Just remove the file from the parent's children. Don't free
|
any memory. */
|
any memory. */
|
int
|
int
|
jffs_unlink_file_from_tree(struct jffs_file *f)
|
jffs_unlink_file_from_tree(struct jffs_file *f)
|
{
|
{
|
D3(printk("jffs_unlink_file_from_tree(): ino: %d, name: "
|
D3(printk("jffs_unlink_file_from_tree(): ino: %d, name: "
|
"\"%s\"\n", f->ino, (f->name ? f->name : "")));
|
"\"%s\"\n", f->ino, (f->name ? f->name : "")));
|
|
|
if (f->sibling_prev) {
|
if (f->sibling_prev) {
|
f->sibling_prev->sibling_next = f->sibling_next;
|
f->sibling_prev->sibling_next = f->sibling_next;
|
}
|
}
|
else {
|
else {
|
f->parent->children = f->sibling_next;
|
f->parent->children = f->sibling_next;
|
}
|
}
|
if (f->sibling_next) {
|
if (f->sibling_next) {
|
f->sibling_next->sibling_prev = f->sibling_prev;
|
f->sibling_next->sibling_prev = f->sibling_prev;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Find a file with its inode number. */
|
/* Find a file with its inode number. */
|
struct jffs_file *
|
struct jffs_file *
|
jffs_find_file(struct jffs_control *c, __u32 ino)
|
jffs_find_file(struct jffs_control *c, __u32 ino)
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
int i = ino % c->hash_len;
|
int i = ino % c->hash_len;
|
|
|
D3(printk("jffs_find_file(): ino: %u\n", ino));
|
D3(printk("jffs_find_file(): ino: %u\n", ino));
|
|
|
for (f = c->hash[i]; f && (ino != f->ino); f = f->hash_next);
|
for (f = c->hash[i]; f && (ino != f->ino); f = f->hash_next);
|
|
|
D3(if (f) {
|
D3(if (f) {
|
printk("jffs_find_file(): Found file with ino "
|
printk("jffs_find_file(): Found file with ino "
|
"%u. (name: \"%s\")\n",
|
"%u. (name: \"%s\")\n",
|
ino, (f->name ? f->name : ""));
|
ino, (f->name ? f->name : ""));
|
}
|
}
|
else {
|
else {
|
printk("jffs_find_file(): Didn't find file "
|
printk("jffs_find_file(): Didn't find file "
|
"with ino %u.\n", ino);
|
"with ino %u.\n", ino);
|
});
|
});
|
|
|
return f;
|
return f;
|
}
|
}
|
|
|
|
|
/* Find a file in a directory. We are comparing the names. */
|
/* Find a file in a directory. We are comparing the names. */
|
struct jffs_file *
|
struct jffs_file *
|
jffs_find_child(struct jffs_file *dir, const char *name, int len)
|
jffs_find_child(struct jffs_file *dir, const char *name, int len)
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
|
|
D3(printk("jffs_find_child()\n"));
|
D3(printk("jffs_find_child()\n"));
|
|
|
for (f = dir->children; f; f = f->sibling_next) {
|
for (f = dir->children; f; f = f->sibling_next) {
|
if (f->name
|
if (f->name
|
&& !strncmp(f->name, name, len)
|
&& !strncmp(f->name, name, len)
|
&& f->name[len] == '\0') {
|
&& f->name[len] == '\0') {
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
D3(if (f) {
|
D3(if (f) {
|
printk("jffs_find_child(): Found \"%s\".\n", f->name);
|
printk("jffs_find_child(): Found \"%s\".\n", f->name);
|
}
|
}
|
else {
|
else {
|
char *copy = (char *) kmalloc(len + 1, GFP_KERNEL);
|
char *copy = (char *) kmalloc(len + 1, GFP_KERNEL);
|
if (copy) {
|
if (copy) {
|
memcpy(copy, name, len);
|
memcpy(copy, name, len);
|
copy[len] = '\0';
|
copy[len] = '\0';
|
}
|
}
|
printk("jffs_find_child(): Didn't find the file \"%s\".\n",
|
printk("jffs_find_child(): Didn't find the file \"%s\".\n",
|
(copy ? copy : ""));
|
(copy ? copy : ""));
|
if (copy) {
|
if (copy) {
|
kfree(copy);
|
kfree(copy);
|
}
|
}
|
});
|
});
|
|
|
return f;
|
return f;
|
}
|
}
|
|
|
|
|
#if !defined(JFFS_FLASH_SHORTCUT) || ! JFFS_FLASH_SHORTCUT
|
#if !defined(JFFS_FLASH_SHORTCUT) || ! JFFS_FLASH_SHORTCUT
|
|
|
struct buffer_head *
|
struct buffer_head *
|
jffs_get_write_buffer(kdev_t dev, int block)
|
jffs_get_write_buffer(kdev_t dev, int block)
|
{
|
{
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
|
|
D3(printk("jffs_get_write_buffer(): block = %u\n", block));
|
D3(printk("jffs_get_write_buffer(): block = %u\n", block));
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
D(printk("jffs_get_write_buffer(): bread() failed. "
|
D(printk("jffs_get_write_buffer(): bread() failed. "
|
"(block == %u)\n", block));
|
"(block == %u)\n", block));
|
}
|
}
|
|
|
D3(printk("jffs_get_write_buffer(): bh = 0x%08x\n", bh));
|
D3(printk("jffs_get_write_buffer(): bh = 0x%08x\n", bh));
|
return bh;
|
return bh;
|
}
|
}
|
|
|
void
|
void
|
jffs_put_write_buffer(struct buffer_head *bh)
|
jffs_put_write_buffer(struct buffer_head *bh)
|
{
|
{
|
D3(printk("jffs_put_write_buffer(): bh = 0x%08x\n", bh));
|
D3(printk("jffs_put_write_buffer(): bh = 0x%08x\n", bh));
|
mark_buffer_dirty(bh, 1);
|
mark_buffer_dirty(bh, 1);
|
ll_rw_block(WRITE, 1, &bh);
|
ll_rw_block(WRITE, 1, &bh);
|
wait_on_buffer(bh);
|
wait_on_buffer(bh);
|
brelse(bh);
|
brelse(bh);
|
}
|
}
|
|
|
|
|
/* Structure used by jffs_write_chunk() and jffs_write_node(). */
|
/* Structure used by jffs_write_chunk() and jffs_write_node(). */
|
struct jffs_write_task
|
struct jffs_write_task
|
{
|
{
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
__u32 block;
|
__u32 block;
|
__u32 block_offset;
|
__u32 block_offset;
|
};
|
};
|
|
|
|
|
/* Write a chunk of data to the flash memory. This is a helper routine
|
/* Write a chunk of data to the flash memory. This is a helper routine
|
to jffs_write_node(). */
|
to jffs_write_node(). */
|
int
|
int
|
jffs_write_chunk(struct jffs_control *c, struct jffs_write_task *wt,
|
jffs_write_chunk(struct jffs_control *c, struct jffs_write_task *wt,
|
const unsigned char *data, __u32 size)
|
const unsigned char *data, __u32 size)
|
{
|
{
|
int write_len = 0;
|
int write_len = 0;
|
int len;
|
int len;
|
int buf_pos = 0;
|
int buf_pos = 0;
|
|
|
D3(printk("jffs_write_chunk(): size = %u\n", size));
|
D3(printk("jffs_write_chunk(): size = %u\n", size));
|
|
|
ASSERT(if (!wt) {
|
ASSERT(if (!wt) {
|
printk("jffs_write_chunk(): wt == NULL\n");
|
printk("jffs_write_chunk(): wt == NULL\n");
|
return -1;
|
return -1;
|
});
|
});
|
|
|
if (size == 0) {
|
if (size == 0) {
|
return 0;
|
return 0;
|
}
|
}
|
|
|
if (wt->block_offset == BLOCK_SIZE) {
|
if (wt->block_offset == BLOCK_SIZE) {
|
if (wt->bh) {
|
if (wt->bh) {
|
jffs_put_write_buffer(wt->bh);
|
jffs_put_write_buffer(wt->bh);
|
wt->bh = 0;
|
wt->bh = 0;
|
}
|
}
|
wt->block++;
|
wt->block++;
|
wt->block_offset = 0;
|
wt->block_offset = 0;
|
}
|
}
|
|
|
if (!wt->bh
|
if (!wt->bh
|
&& !(wt->bh = jffs_get_write_buffer(c->sb->s_dev, wt->block))) {
|
&& !(wt->bh = jffs_get_write_buffer(c->sb->s_dev, wt->block))) {
|
return -1;
|
return -1;
|
}
|
}
|
|
|
while (write_len < size) {
|
while (write_len < size) {
|
len = jffs_min(size - write_len,
|
len = jffs_min(size - write_len,
|
BLOCK_SIZE - wt->block_offset);
|
BLOCK_SIZE - wt->block_offset);
|
memcpy(&wt->bh->b_data[wt->block_offset],
|
memcpy(&wt->bh->b_data[wt->block_offset],
|
&data[buf_pos], len);
|
&data[buf_pos], len);
|
write_len += len;
|
write_len += len;
|
wt->block_offset += len;
|
wt->block_offset += len;
|
D3(printk(" write_len: %u\n", write_len));
|
D3(printk(" write_len: %u\n", write_len));
|
D3(printk(" len: %u\n", len));
|
D3(printk(" len: %u\n", len));
|
D3(printk(" size: %u\n", size));
|
D3(printk(" size: %u\n", size));
|
if (write_len < size) {
|
if (write_len < size) {
|
jffs_put_write_buffer(wt->bh);
|
jffs_put_write_buffer(wt->bh);
|
wt->block++;
|
wt->block++;
|
wt->block_offset = 0;
|
wt->block_offset = 0;
|
wt->bh = 0;
|
wt->bh = 0;
|
if (!(wt->bh = jffs_get_write_buffer(c->sb->s_dev,
|
if (!(wt->bh = jffs_get_write_buffer(c->sb->s_dev,
|
wt->block))) {
|
wt->block))) {
|
return write_len;
|
return write_len;
|
}
|
}
|
buf_pos += len;
|
buf_pos += len;
|
}
|
}
|
}
|
}
|
|
|
return write_len;
|
return write_len;
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* Write a raw inode that takes up a certain amount of space in the flash
|
/* Write a raw inode that takes up a certain amount of space in the flash
|
memory. At the end of the flash device, there is often space that is
|
memory. At the end of the flash device, there is often space that is
|
impossible to use. At these times we want to mark this space as not
|
impossible to use. At these times we want to mark this space as not
|
used. In the cases when the amount of space is greater or equal than
|
used. In the cases when the amount of space is greater or equal than
|
a struct jffs_raw_inode, we write a "dummy node" that takes up this
|
a struct jffs_raw_inode, we write a "dummy node" that takes up this
|
space. The space after the raw inode, if it exists, is left as it is.
|
space. The space after the raw inode, if it exists, is left as it is.
|
Since this space after the raw inode contains JFFS_EMPTY_BITMASK bytes,
|
Since this space after the raw inode contains JFFS_EMPTY_BITMASK bytes,
|
we can compute the checksum of it; we don't have to manipulate it any
|
we can compute the checksum of it; we don't have to manipulate it any
|
further.
|
further.
|
|
|
If the space left on the device is less than the size of a struct
|
If the space left on the device is less than the size of a struct
|
jffs_raw_inode, this space is filled with JFFS_DIRTY_BITMASK bytes.
|
jffs_raw_inode, this space is filled with JFFS_DIRTY_BITMASK bytes.
|
No raw inode is written this time. */
|
No raw inode is written this time. */
|
static int
|
static int
|
jffs_write_dummy_node(struct jffs_control *c, struct jffs_fm *dirty_fm)
|
jffs_write_dummy_node(struct jffs_control *c, struct jffs_fm *dirty_fm)
|
{
|
{
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
int err;
|
int err;
|
|
|
D1(printk("jffs_write_dummy_node(): dirty_fm->offset = 0x%08x, "
|
D1(printk("jffs_write_dummy_node(): dirty_fm->offset = 0x%08x, "
|
"dirty_fm->size = %u\n",
|
"dirty_fm->size = %u\n",
|
dirty_fm->offset, dirty_fm->size));
|
dirty_fm->offset, dirty_fm->size));
|
|
|
if (dirty_fm->size >= sizeof(struct jffs_raw_inode)) {
|
if (dirty_fm->size >= sizeof(struct jffs_raw_inode)) {
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
memset(&raw_inode, 0, sizeof(struct jffs_raw_inode));
|
memset(&raw_inode, 0, sizeof(struct jffs_raw_inode));
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.dsize = dirty_fm->size
|
raw_inode.dsize = dirty_fm->size
|
- sizeof(struct jffs_raw_inode);
|
- sizeof(struct jffs_raw_inode);
|
raw_inode.dchksum = raw_inode.dsize * 0xff;
|
raw_inode.dchksum = raw_inode.dsize * 0xff;
|
raw_inode.chksum
|
raw_inode.chksum
|
= jffs_checksum(&raw_inode, sizeof(struct jffs_raw_inode));
|
= jffs_checksum(&raw_inode, sizeof(struct jffs_raw_inode));
|
|
|
if ((err = flash_safe_write(fmc->flash_part,
|
if ((err = flash_safe_write(fmc->flash_part,
|
(unsigned char *)dirty_fm->offset,
|
(unsigned char *)dirty_fm->offset,
|
(unsigned char *)&raw_inode,
|
(unsigned char *)&raw_inode,
|
sizeof(struct jffs_raw_inode)))
|
sizeof(struct jffs_raw_inode)))
|
< 0) {
|
< 0) {
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
else {
|
else {
|
flash_safe_acquire(fmc->flash_part);
|
flash_safe_acquire(fmc->flash_part);
|
flash_memset((unsigned char *) dirty_fm->offset, 0,
|
flash_memset((unsigned char *) dirty_fm->offset, 0,
|
dirty_fm->size);
|
dirty_fm->size);
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
}
|
}
|
|
|
D3(printk("jffs_write_dummy_node(): Leaving...\n"));
|
D3(printk("jffs_write_dummy_node(): Leaving...\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
#else
|
#else
|
|
|
|
|
/* Write a raw inode that takes up a certain amount of space in the flash
|
/* Write a raw inode that takes up a certain amount of space in the flash
|
memory. */
|
memory. */
|
static int
|
static int
|
jffs_write_dummy_node(struct jffs_control *c, struct jffs_fm *dirty_fm)
|
jffs_write_dummy_node(struct jffs_control *c, struct jffs_fm *dirty_fm)
|
{
|
{
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
__u32 block = dirty_fm->offset / BLOCK_SIZE;
|
__u32 block = dirty_fm->offset / BLOCK_SIZE;
|
__u32 block_offset = dirty_fm->offset - block * BLOCK_SIZE;
|
__u32 block_offset = dirty_fm->offset - block * BLOCK_SIZE;
|
kdev_t dev = c->sb->s_dev;
|
kdev_t dev = c->sb->s_dev;
|
|
|
D1(printk("jffs_write_dummy_node(): dirty_fm->offset = %u, "
|
D1(printk("jffs_write_dummy_node(): dirty_fm->offset = %u, "
|
"dirty_fm->size = %u\n",
|
"dirty_fm->size = %u\n",
|
dirty_fm->offset, dirty_fm->size));
|
dirty_fm->offset, dirty_fm->size));
|
|
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
D(printk("jffs_write_dummy_node(): "
|
D(printk("jffs_write_dummy_node(): "
|
"Failed to read block.\n"));
|
"Failed to read block.\n"));
|
return -1;
|
return -1;
|
}
|
}
|
|
|
memset(&raw_inode, 0, sizeof(struct jffs_raw_inode));
|
memset(&raw_inode, 0, sizeof(struct jffs_raw_inode));
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.dsize = dirty_fm->size - sizeof(struct jffs_raw_inode);
|
raw_inode.dsize = dirty_fm->size - sizeof(struct jffs_raw_inode);
|
raw_inode.chksum = jffs_checksum(&raw_inode,
|
raw_inode.chksum = jffs_checksum(&raw_inode,
|
sizeof(struct jffs_raw_inode))
|
sizeof(struct jffs_raw_inode))
|
+ raw_inode.dsize * 0xff;
|
+ raw_inode.dsize * 0xff;
|
|
|
if (BLOCK_SIZE - block_offset < sizeof(struct jffs_raw_inode)) {
|
if (BLOCK_SIZE - block_offset < sizeof(struct jffs_raw_inode)) {
|
__u32 write_size = BLOCK_SIZE - block_offset;
|
__u32 write_size = BLOCK_SIZE - block_offset;
|
memcpy(&bh->b_data[block_offset], &raw_inode, write_size);
|
memcpy(&bh->b_data[block_offset], &raw_inode, write_size);
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
memcpy(bh->b_data, (void *)&raw_inode + write_size,
|
memcpy(bh->b_data, (void *)&raw_inode + write_size,
|
sizeof(struct jffs_raw_inode) - write_size);
|
sizeof(struct jffs_raw_inode) - write_size);
|
}
|
}
|
else {
|
else {
|
memcpy(&bh->b_data[block_offset], &raw_inode,
|
memcpy(&bh->b_data[block_offset], &raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
}
|
}
|
|
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
D3(printk("jffs_write_dummy_node(): Leaving...\n"));
|
D3(printk("jffs_write_dummy_node(): Leaving...\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* Write a raw inode, possibly its name and possibly some data. */
|
/* Write a raw inode, possibly its name and possibly some data. */
|
int
|
int
|
jffs_write_node(struct jffs_control *c, struct jffs_node *node,
|
jffs_write_node(struct jffs_control *c, struct jffs_node *node,
|
struct jffs_raw_inode *raw_inode,
|
struct jffs_raw_inode *raw_inode,
|
const char *name, const unsigned char *data)
|
const char *name, const unsigned char *data)
|
{
|
{
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
unsigned char *pos;
|
unsigned char *pos;
|
int err;
|
int err;
|
__u32 total_name_size = raw_inode->nsize
|
__u32 total_name_size = raw_inode->nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize);
|
__u32 total_data_size = raw_inode->dsize
|
__u32 total_data_size = raw_inode->dsize
|
+ JFFS_GET_PAD_BYTES(raw_inode->dsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode->dsize);
|
__u32 total_size = sizeof(struct jffs_raw_inode)
|
__u32 total_size = sizeof(struct jffs_raw_inode)
|
+ total_name_size + total_data_size;
|
+ total_name_size + total_data_size;
|
|
|
/* Fire the retrorockets and shoot the fruiton torpedoes, sir! */
|
/* Fire the retrorockets and shoot the fruiton torpedoes, sir! */
|
|
|
ASSERT(if (!node) {
|
ASSERT(if (!node) {
|
printk("jffs_write_node(): node == NULL\n");
|
printk("jffs_write_node(): node == NULL\n");
|
return -EINVAL;
|
return -EINVAL;
|
});
|
});
|
ASSERT(if (raw_inode && raw_inode->nsize && !name) {
|
ASSERT(if (raw_inode && raw_inode->nsize && !name) {
|
printk("*** jffs_write_node(): nsize = %u but name == NULL\n",
|
printk("*** jffs_write_node(): nsize = %u but name == NULL\n",
|
raw_inode->nsize);
|
raw_inode->nsize);
|
return -EINVAL;
|
return -EINVAL;
|
});
|
});
|
|
|
D1(printk("jffs_write_node(): filename = \"%s\", ino = %u, "
|
D1(printk("jffs_write_node(): filename = \"%s\", ino = %u, "
|
"version = %u, total_size = %u\n",
|
"version = %u, total_size = %u\n",
|
(name ? name : ""), raw_inode->ino,
|
(name ? name : ""), raw_inode->ino,
|
raw_inode->version, total_size));
|
raw_inode->version, total_size));
|
|
|
/* First try to allocate some flash memory. */
|
/* First try to allocate some flash memory. */
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
D(printk("jffs_write_node(): jffs_fmalloc(0x%p, %u) "
|
D(printk("jffs_write_node(): jffs_fmalloc(0x%p, %u) "
|
"failed!\n", fmc, total_size));
|
"failed!\n", fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
else if (!fm->nodes) {
|
else if (!fm->nodes) {
|
/* The jffs_fm struct that we got is not good enough.
|
/* The jffs_fm struct that we got is not good enough.
|
Make that space dirty. */
|
Make that space dirty. */
|
if ((err = jffs_write_dummy_node(c, fm)) < 0) {
|
if ((err = jffs_write_dummy_node(c, fm)) < 0) {
|
D(printk("jffs_write_node(): "
|
D(printk("jffs_write_node(): "
|
"jffs_write_dummy_node(): Failed!\n"));
|
"jffs_write_dummy_node(): Failed!\n"));
|
kfree(fm);
|
kfree(fm);
|
DJM(no_jffs_fm--);
|
DJM(no_jffs_fm--);
|
return err;
|
return err;
|
}
|
}
|
/* Get a new one. */
|
/* Get a new one. */
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
D(printk("jffs_write_node(): Second "
|
D(printk("jffs_write_node(): Second "
|
"jffs_fmalloc(0x%p, %u) failed!\n",
|
"jffs_fmalloc(0x%p, %u) failed!\n",
|
fmc, total_size));
|
fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
node->fm = fm;
|
node->fm = fm;
|
|
|
ASSERT(if (fm->nodes == 0) {
|
ASSERT(if (fm->nodes == 0) {
|
printk(KERN_ERR "jffs_write_node(): fm->nodes == 0\n");
|
printk(KERN_ERR "jffs_write_node(): fm->nodes == 0\n");
|
});
|
});
|
|
|
pos = (unsigned char *) node->fm->offset;
|
pos = (unsigned char *) node->fm->offset;
|
|
|
/* Compute the checksum for the data and name chunks. */
|
/* Compute the checksum for the data and name chunks. */
|
raw_inode->dchksum = jffs_checksum(data, raw_inode->dsize);
|
raw_inode->dchksum = jffs_checksum(data, raw_inode->dsize);
|
raw_inode->nchksum = jffs_checksum(name, raw_inode->nsize);
|
raw_inode->nchksum = jffs_checksum(name, raw_inode->nsize);
|
|
|
/* The checksum is calculated without the chksum and accurate
|
/* The checksum is calculated without the chksum and accurate
|
fields so set them to zero first. */
|
fields so set them to zero first. */
|
raw_inode->accurate = 0;
|
raw_inode->accurate = 0;
|
raw_inode->chksum = 0;
|
raw_inode->chksum = 0;
|
raw_inode->chksum = jffs_checksum(raw_inode,
|
raw_inode->chksum = jffs_checksum(raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
raw_inode->accurate = 0xff;
|
raw_inode->accurate = 0xff;
|
|
|
D3(printk("jffs_write_node(): About to write this raw inode to the "
|
D3(printk("jffs_write_node(): About to write this raw inode to the "
|
"flash at pos 0x%p:\n", pos));
|
"flash at pos 0x%p:\n", pos));
|
D3(jffs_print_raw_inode(raw_inode));
|
D3(jffs_print_raw_inode(raw_inode));
|
|
|
/* Step 1: Write the raw jffs inode to the flash. */
|
/* Step 1: Write the raw jffs inode to the flash. */
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
(unsigned char *)raw_inode,
|
(unsigned char *)raw_inode,
|
sizeof(struct jffs_raw_inode))) < 0) {
|
sizeof(struct jffs_raw_inode))) < 0) {
|
jffs_fmfree_partly(fmc, fm,
|
jffs_fmfree_partly(fmc, fm,
|
total_name_size + total_data_size);
|
total_name_size + total_data_size);
|
D1(printk("jffs_write_node(): Failed to write raw_inode.\n"));
|
D1(printk("jffs_write_node(): Failed to write raw_inode.\n"));
|
return err;
|
return err;
|
}
|
}
|
pos += sizeof(struct jffs_raw_inode);
|
pos += sizeof(struct jffs_raw_inode);
|
|
|
/* Step 2: Write the name, if there is any. */
|
/* Step 2: Write the name, if there is any. */
|
if (raw_inode->nsize) {
|
if (raw_inode->nsize) {
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
(unsigned char *)name,
|
(unsigned char *)name,
|
raw_inode->nsize)) < 0) {
|
raw_inode->nsize)) < 0) {
|
jffs_fmfree_partly(fmc, fm, total_data_size);
|
jffs_fmfree_partly(fmc, fm, total_data_size);
|
D1(printk("jffs_write_node(): Failed to write "
|
D1(printk("jffs_write_node(): Failed to write "
|
"the name.\n"));
|
"the name.\n"));
|
return err;
|
return err;
|
}
|
}
|
pos += total_name_size;
|
pos += total_name_size;
|
}
|
}
|
|
|
/* Step 3: Append the actual data, if any. */
|
/* Step 3: Append the actual data, if any. */
|
if (raw_inode->dsize) {
|
if (raw_inode->dsize) {
|
if ((err = flash_safe_write(fmc->flash_part, pos, data,
|
if ((err = flash_safe_write(fmc->flash_part, pos, data,
|
raw_inode->dsize)) < 0) {
|
raw_inode->dsize)) < 0) {
|
jffs_fmfree_partly(fmc, fm, 0);
|
jffs_fmfree_partly(fmc, fm, 0);
|
D1(printk("jffs_write_node(): Failed to write "
|
D1(printk("jffs_write_node(): Failed to write "
|
"the data.\n"));
|
"the data.\n"));
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
|
|
D3(printk("jffs_write_node(): Leaving...\n"));
|
D3(printk("jffs_write_node(): Leaving...\n"));
|
return raw_inode->dsize;
|
return raw_inode->dsize;
|
} /* jffs_write_node() */
|
} /* jffs_write_node() */
|
|
|
#else
|
#else
|
|
|
/* Write a raw inode, possibly its name and possibly some data. */
|
/* Write a raw inode, possibly its name and possibly some data. */
|
int
|
int
|
jffs_write_node(struct jffs_control *c, struct jffs_node *node,
|
jffs_write_node(struct jffs_control *c, struct jffs_node *node,
|
struct jffs_raw_inode *raw_inode,
|
struct jffs_raw_inode *raw_inode,
|
const char *name, const unsigned char *buf)
|
const char *name, const unsigned char *buf)
|
{
|
{
|
struct jffs_write_task wt;
|
struct jffs_write_task wt;
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
int err;
|
int err;
|
__u32 total_size = sizeof(struct jffs_raw_inode)
|
__u32 total_size = sizeof(struct jffs_raw_inode)
|
+ raw_inode->nsize
|
+ raw_inode->nsize
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize)
|
+ JFFS_GET_PAD_BYTES(raw_inode->nsize)
|
+ raw_inode->dsize
|
+ raw_inode->dsize
|
+ JFFS_GET_PAD_BYTES(raw_inode->dsize);
|
+ JFFS_GET_PAD_BYTES(raw_inode->dsize);
|
|
|
/* fire the retrorockets and shoot the fruiton torpedoes, sir! */
|
/* fire the retrorockets and shoot the fruiton torpedoes, sir! */
|
|
|
D1(printk("jffs_write_node(): ino: %u\n", raw_inode->ino));
|
D1(printk("jffs_write_node(): ino: %u\n", raw_inode->ino));
|
|
|
ASSERT(if (!node) {
|
ASSERT(if (!node) {
|
printk("jffs_write_node(): node == NULL\n");
|
printk("jffs_write_node(): node == NULL\n");
|
return -1;
|
return -1;
|
});
|
});
|
|
|
/* First try to allocate some flash memory. */
|
/* First try to allocate some flash memory. */
|
if ((err = jffs_fmalloc(c->fmc, total_size, node, &fm)) < 0 ) {
|
if ((err = jffs_fmalloc(c->fmc, total_size, node, &fm)) < 0 ) {
|
D(printk("jffs_write_node(): jffs_fmalloc(0x%08x, %u) "
|
D(printk("jffs_write_node(): jffs_fmalloc(0x%08x, %u) "
|
"failed!\n", c->fmc, total_size));
|
"failed!\n", c->fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
else if (!fm->nodes) {
|
else if (!fm->nodes) {
|
/* The jffs_fm struct that we got is not good enough. */
|
/* The jffs_fm struct that we got is not good enough. */
|
if (jffs_write_dummy_node(c, fm) < 0) {
|
if (jffs_write_dummy_node(c, fm) < 0) {
|
D(printk("jffs_write_node(): "
|
D(printk("jffs_write_node(): "
|
"jffs_write_dummy_node(): Failed!\n"));
|
"jffs_write_dummy_node(): Failed!\n"));
|
kfree(fm);
|
kfree(fm);
|
DJM(no_jffs_fm--);
|
DJM(no_jffs_fm--);
|
return -1;
|
return -1;
|
}
|
}
|
/* Get a new one. */
|
/* Get a new one. */
|
if ((err = jffs_fmalloc(c->fmc, total_size, node)) < 0) {
|
if ((err = jffs_fmalloc(c->fmc, total_size, node)) < 0) {
|
D(printk("jffs_write_node(): Second "
|
D(printk("jffs_write_node(): Second "
|
"jffs_fmalloc(0x%08x, %u) failed!\n",
|
"jffs_fmalloc(0x%08x, %u) failed!\n",
|
c->fmc, total_size));
|
c->fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
node->fm = fm;
|
node->fm = fm;
|
|
|
ASSERT(if (fm->nodes == 0) {
|
ASSERT(if (fm->nodes == 0) {
|
printk(KERN_ERR "jffs_write_node(): fm->nodes == 0\n");
|
printk(KERN_ERR "jffs_write_node(): fm->nodes == 0\n");
|
});
|
});
|
|
|
wt.bh = 0;
|
wt.bh = 0;
|
wt.block = node->fm->offset / BLOCK_SIZE;
|
wt.block = node->fm->offset / BLOCK_SIZE;
|
wt.block_offset = node->fm->offset % BLOCK_SIZE;
|
wt.block_offset = node->fm->offset % BLOCK_SIZE;
|
|
|
/* Calculate the checksum for this jffs_raw_node and its name
|
/* Calculate the checksum for this jffs_raw_node and its name
|
and data. The checksum is performed without the chksum and
|
and data. The checksum is performed without the chksum and
|
accurate fields so set them to zero first. */
|
accurate fields so set them to zero first. */
|
raw_inode->accurate = 0;
|
raw_inode->accurate = 0;
|
raw_inode->chksum = 0;
|
raw_inode->chksum = 0;
|
raw_inode->chksum = jffs_checksum(raw_inode,
|
raw_inode->chksum = jffs_checksum(raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
raw_inode->accurate = 0xff;
|
raw_inode->accurate = 0xff;
|
if (raw_inode->nsize) {
|
if (raw_inode->nsize) {
|
raw_inode->chksum += jffs_checksum(name, raw_inode->nsize);
|
raw_inode->chksum += jffs_checksum(name, raw_inode->nsize);
|
}
|
}
|
if (raw_inode->dsize) {
|
if (raw_inode->dsize) {
|
raw_inode->chksum += jffs_checksum((void *)buf,
|
raw_inode->chksum += jffs_checksum((void *)buf,
|
raw_inode->dsize);
|
raw_inode->dsize);
|
}
|
}
|
|
|
/* Step 1: Write the raw jffs inode to the flash. */
|
/* Step 1: Write the raw jffs inode to the flash. */
|
if (jffs_write_chunk(c, &wt, (unsigned char *)raw_inode,
|
if (jffs_write_chunk(c, &wt, (unsigned char *)raw_inode,
|
sizeof(struct jffs_raw_inode))
|
sizeof(struct jffs_raw_inode))
|
< sizeof(struct jffs_raw_inode)) {
|
< sizeof(struct jffs_raw_inode)) {
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* Step 2: Write the name, if there is any. */
|
/* Step 2: Write the name, if there is any. */
|
if (raw_inode->nsize && name) {
|
if (raw_inode->nsize && name) {
|
if (jffs_write_chunk(c, &wt, name, raw_inode->nsize)
|
if (jffs_write_chunk(c, &wt, name, raw_inode->nsize)
|
< raw_inode->nsize) {
|
< raw_inode->nsize) {
|
return -1;
|
return -1;
|
}
|
}
|
/* XXX: Hack! (I'm so lazy.) */
|
/* XXX: Hack! (I'm so lazy.) */
|
if (JFFS_GET_PAD_BYTES(wt.block_offset)) {
|
if (JFFS_GET_PAD_BYTES(wt.block_offset)) {
|
__u32 ff = 0xffffffff
|
__u32 ff = 0xffffffff
|
jffs_write_chunk(c, &wt, (unsigned char *)&ff,
|
jffs_write_chunk(c, &wt, (unsigned char *)&ff,
|
JFFS_GET_PAD_BYTES(wt.block_offset));
|
JFFS_GET_PAD_BYTES(wt.block_offset));
|
}
|
}
|
}
|
}
|
|
|
/* Step 3: Append the actual data, if any. */
|
/* Step 3: Append the actual data, if any. */
|
if (raw_inode->dsize && buf) {
|
if (raw_inode->dsize && buf) {
|
if (jffs_write_chunk(c, &wt, buf, raw_inode->dsize)
|
if (jffs_write_chunk(c, &wt, buf, raw_inode->dsize)
|
< raw_inode->dsize) {
|
< raw_inode->dsize) {
|
return -1;
|
return -1;
|
}
|
}
|
}
|
}
|
|
|
if (wt.bh) {
|
if (wt.bh) {
|
D3(printk("jffs_write_node(): wt.bh != NULL, Final write.\n"));
|
D3(printk("jffs_write_node(): wt.bh != NULL, Final write.\n"));
|
jffs_put_write_buffer(wt.bh);
|
jffs_put_write_buffer(wt.bh);
|
}
|
}
|
|
|
D3(printk("jffs_write_node(): Leaving...\n"));
|
D3(printk("jffs_write_node(): Leaving...\n"));
|
return raw_inode->dsize;
|
return raw_inode->dsize;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* Read data from the node and write it to the buffer. 'node_offset'
|
/* Read data from the node and write it to the buffer. 'node_offset'
|
is how much we have read from this particular node before and which
|
is how much we have read from this particular node before and which
|
shouldn't be read again. 'max_size' is how much space there is in
|
shouldn't be read again. 'max_size' is how much space there is in
|
the buffer. */
|
the buffer. */
|
static int
|
static int
|
jffs_get_node_data(struct jffs_file *f, struct jffs_node *node, char *buf,
|
jffs_get_node_data(struct jffs_file *f, struct jffs_node *node, char *buf,
|
__u32 node_offset, __u32 max_size, kdev_t dev)
|
__u32 node_offset, __u32 max_size, kdev_t dev)
|
{
|
{
|
struct jffs_fmcontrol *fmc = f->c->fmc;
|
struct jffs_fmcontrol *fmc = f->c->fmc;
|
__u32 pos = node->fm->offset + node->fm_offset + node_offset;
|
__u32 pos = node->fm->offset + node->fm_offset + node_offset;
|
__u32 avail = node->data_size - node_offset;
|
__u32 avail = node->data_size - node_offset;
|
__u32 r;
|
__u32 r;
|
|
|
D2(printk(" jffs_get_node_data(): file: \"%s\", ino: %u, "
|
D2(printk(" jffs_get_node_data(): file: \"%s\", ino: %u, "
|
"version: %u, node_offset: %u\n",
|
"version: %u, node_offset: %u\n",
|
f->name, node->ino, node->version, node_offset));
|
f->name, node->ino, node->version, node_offset));
|
|
|
r = jffs_min(avail, max_size);
|
r = jffs_min(avail, max_size);
|
flash_safe_read(fmc->flash_part, (unsigned char *) pos,
|
flash_safe_read(fmc->flash_part, (unsigned char *) pos,
|
(unsigned char *)buf, r);
|
(unsigned char *)buf, r);
|
|
|
D3(printk(" jffs_get_node_data(): Read %u byte%s.\n",
|
D3(printk(" jffs_get_node_data(): Read %u byte%s.\n",
|
r, (r == 1 ? "" : "s")));
|
r, (r == 1 ? "" : "s")));
|
|
|
return r;
|
return r;
|
}
|
}
|
|
|
#else
|
#else
|
|
|
/* Read data from the node and write it to the buffer. 'node_offset'
|
/* Read data from the node and write it to the buffer. 'node_offset'
|
is how much we have read from this particular node before and which
|
is how much we have read from this particular node before and which
|
shouldn't be read again. 'max_size' is how much space there is in
|
shouldn't be read again. 'max_size' is how much space there is in
|
the buffer. */
|
the buffer. */
|
static int
|
static int
|
jffs_get_node_data(struct jffs_file *f, struct jffs_node *node,
|
jffs_get_node_data(struct jffs_file *f, struct jffs_node *node,
|
char *buf, __u32 node_offset,
|
char *buf, __u32 node_offset,
|
__u32 max_size, kdev_t dev)
|
__u32 max_size, kdev_t dev)
|
{
|
{
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
__u32 first = node->fm->offset + node->fm_offset + node_offset;
|
__u32 first = node->fm->offset + node->fm_offset + node_offset;
|
__u32 block = first / BLOCK_SIZE;
|
__u32 block = first / BLOCK_SIZE;
|
__u32 block_offset = first - block * BLOCK_SIZE;
|
__u32 block_offset = first - block * BLOCK_SIZE;
|
__u32 read_len;
|
__u32 read_len;
|
__u32 total_read = 0;
|
__u32 total_read = 0;
|
__u32 avail = node->data_size - node_offset;
|
__u32 avail = node->data_size - node_offset;
|
|
|
D2(printk("jffs_get_node_data(): file: \"%s\", ino: %lu, "
|
D2(printk("jffs_get_node_data(): file: \"%s\", ino: %lu, "
|
"version: %lu, node_offset: %lu\n",
|
"version: %lu, node_offset: %lu\n",
|
f->name, node->ino, node->version, node_offset));
|
f->name, node->ino, node->version, node_offset));
|
|
|
while ((total_read < max_size) && (avail > 0)) {
|
while ((total_read < max_size) && (avail > 0)) {
|
read_len = jffs_min(avail, BLOCK_SIZE - block_offset);
|
read_len = jffs_min(avail, BLOCK_SIZE - block_offset);
|
read_len = jffs_min(read_len, max_size - total_read);
|
read_len = jffs_min(read_len, max_size - total_read);
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
if (!(bh = bread(dev, block, BLOCK_SIZE))) {
|
D(printk("jffs_get_node_data(): bread() failed. "
|
D(printk("jffs_get_node_data(): bread() failed. "
|
"(block == %u)\n", block));
|
"(block == %u)\n", block));
|
return -EIO;
|
return -EIO;
|
}
|
}
|
memcpy(&buf[total_read], &bh->b_data[block_offset], read_len);
|
memcpy(&buf[total_read], &bh->b_data[block_offset], read_len);
|
brelse(bh);
|
brelse(bh);
|
block++;
|
block++;
|
avail -= read_len;
|
avail -= read_len;
|
total_read += read_len;
|
total_read += read_len;
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
|
|
return total_read;
|
return total_read;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
|
|
/* Read data from the file's nodes. Write the data to the buffer
|
/* Read data from the file's nodes. Write the data to the buffer
|
'buf'. 'read_offset' tells how much data we should skip. */
|
'buf'. 'read_offset' tells how much data we should skip. */
|
int
|
int
|
jffs_read_data(struct jffs_file *f, char *buf, __u32 read_offset, __u32 size)
|
jffs_read_data(struct jffs_file *f, char *buf, __u32 read_offset, __u32 size)
|
{
|
{
|
struct jffs_node *node;
|
struct jffs_node *node;
|
__u32 read_data = 0; /* Total amount of read data. */
|
__u32 read_data = 0; /* Total amount of read data. */
|
__u32 node_offset = 0;
|
__u32 node_offset = 0;
|
__u32 pos = 0; /* Number of bytes traversed. */
|
__u32 pos = 0; /* Number of bytes traversed. */
|
|
|
D1(printk("jffs_read_data(): file = \"%s\", read_offset = %d, "
|
D1(printk("jffs_read_data(): file = \"%s\", read_offset = %d, "
|
"size = %u\n",
|
"size = %u\n",
|
(f->name ? f->name : ""), read_offset, size));
|
(f->name ? f->name : ""), read_offset, size));
|
|
|
if (read_offset >= f->size) {
|
if (read_offset >= f->size) {
|
D(printk(" f->size: %d\n", f->size));
|
D(printk(" f->size: %d\n", f->size));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* First find the node to read data from. */
|
/* First find the node to read data from. */
|
node = f->range_head;
|
node = f->range_head;
|
while (pos <= read_offset) {
|
while (pos <= read_offset) {
|
node_offset = read_offset - pos;
|
node_offset = read_offset - pos;
|
if (node_offset >= node->data_size) {
|
if (node_offset >= node->data_size) {
|
pos += node->data_size;
|
pos += node->data_size;
|
node = node->range_next;
|
node = node->range_next;
|
}
|
}
|
else {
|
else {
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
/* "Cats are living proof that not everything in nature
|
/* "Cats are living proof that not everything in nature
|
has to be useful."
|
has to be useful."
|
- Garrison Keilor ('97) */
|
- Garrison Keilor ('97) */
|
|
|
/* Fill the buffer. */
|
/* Fill the buffer. */
|
while (node && (read_data < size)) {
|
while (node && (read_data < size)) {
|
int r;
|
int r;
|
if (!node->fm) {
|
if (!node->fm) {
|
/* This node does not refer to real data. */
|
/* This node does not refer to real data. */
|
r = jffs_min(size - read_data,
|
r = jffs_min(size - read_data,
|
node->data_size - node_offset);
|
node->data_size - node_offset);
|
memset(&buf[read_data], 0, r);
|
memset(&buf[read_data], 0, r);
|
}
|
}
|
else if ((r = jffs_get_node_data(f, node, &buf[read_data],
|
else if ((r = jffs_get_node_data(f, node, &buf[read_data],
|
node_offset,
|
node_offset,
|
size - read_data,
|
size - read_data,
|
f->c->sb->s_dev)) < 0) {
|
f->c->sb->s_dev)) < 0) {
|
return r;
|
return r;
|
}
|
}
|
read_data += r;
|
read_data += r;
|
node_offset = 0;
|
node_offset = 0;
|
node = node->range_next;
|
node = node->range_next;
|
}
|
}
|
D3(printk(" jffs_read_data(): Read %u bytes.\n", read_data));
|
D3(printk(" jffs_read_data(): Read %u bytes.\n", read_data));
|
return read_data;
|
return read_data;
|
}
|
}
|
|
|
|
|
/* Used for traversing all nodes in the hash table. */
|
/* Used for traversing all nodes in the hash table. */
|
int
|
int
|
jffs_foreach_file(struct jffs_control *c, int (*func)(struct jffs_file *))
|
jffs_foreach_file(struct jffs_control *c, int (*func)(struct jffs_file *))
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
struct jffs_file *next_f;
|
struct jffs_file *next_f;
|
int pos;
|
int pos;
|
int r;
|
int r;
|
int result = 0;
|
int result = 0;
|
|
|
for (pos = 0; pos < c->hash_len; pos++) {
|
for (pos = 0; pos < c->hash_len; pos++) {
|
for (f = c->hash[pos]; f; f = next_f) {
|
for (f = c->hash[pos]; f; f = next_f) {
|
/* We need a reference to the next file in the
|
/* We need a reference to the next file in the
|
list because `func' might remove the current
|
list because `func' might remove the current
|
file `f'. */
|
file `f'. */
|
next_f = f->hash_next;
|
next_f = f->hash_next;
|
if ((r = func(f)) < 0) {
|
if ((r = func(f)) < 0) {
|
return r;
|
return r;
|
}
|
}
|
result += r;
|
result += r;
|
}
|
}
|
}
|
}
|
|
|
return result;
|
return result;
|
}
|
}
|
|
|
|
|
/* Free all memory associated with a file. */
|
/* Free all memory associated with a file. */
|
int
|
int
|
jffs_free_node_list(struct jffs_file *f)
|
jffs_free_node_list(struct jffs_file *f)
|
{
|
{
|
struct jffs_node *node;
|
struct jffs_node *node;
|
struct jffs_node *p;
|
struct jffs_node *p;
|
|
|
D3(printk("jffs_free_node_list(): f #%u, \"%s\"\n",
|
D3(printk("jffs_free_node_list(): f #%u, \"%s\"\n",
|
f->ino, (f->name ? f->name : "")));
|
f->ino, (f->name ? f->name : "")));
|
node = f->version_head;
|
node = f->version_head;
|
while (node) {
|
while (node) {
|
p = node;
|
p = node;
|
node = node->version_next;
|
node = node->version_next;
|
kfree(p);
|
kfree(p);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* See if a file is deleted. If so, mark that file's nodes as obsolete. */
|
/* See if a file is deleted. If so, mark that file's nodes as obsolete. */
|
int
|
int
|
jffs_possibly_delete_file(struct jffs_file *f)
|
jffs_possibly_delete_file(struct jffs_file *f)
|
{
|
{
|
struct jffs_node *n;
|
struct jffs_node *n;
|
|
|
D3(printk("jffs_possibly_delete_file(): ino: %u\n",
|
D3(printk("jffs_possibly_delete_file(): ino: %u\n",
|
f->ino));
|
f->ino));
|
|
|
ASSERT(if (!f) {
|
ASSERT(if (!f) {
|
printk(KERN_ERR "jffs_possibly_delete_file(): f == NULL\n");
|
printk(KERN_ERR "jffs_possibly_delete_file(): f == NULL\n");
|
return -1;
|
return -1;
|
});
|
});
|
|
|
if (f->deleted) {
|
if (f->deleted) {
|
/* First try to remove all older versions. */
|
/* First try to remove all older versions. */
|
for (n = f->version_head; n; n = n->version_next) {
|
for (n = f->version_head; n; n = n->version_next) {
|
if (!n->fm) {
|
if (!n->fm) {
|
continue;
|
continue;
|
}
|
}
|
if (jffs_fmfree(f->c->fmc, n->fm, n) < 0) {
|
if (jffs_fmfree(f->c->fmc, n->fm, n) < 0) {
|
break;
|
break;
|
}
|
}
|
}
|
}
|
/* Unlink the file from the filesystem. */
|
/* Unlink the file from the filesystem. */
|
jffs_unlink_file_from_tree(f);
|
jffs_unlink_file_from_tree(f);
|
jffs_unlink_file_from_hash(f);
|
jffs_unlink_file_from_hash(f);
|
jffs_free_node_list(f);
|
jffs_free_node_list(f);
|
if (f->name) {
|
if (f->name) {
|
kfree(f->name);
|
kfree(f->name);
|
DJM(no_name--);
|
DJM(no_name--);
|
}
|
}
|
kfree(f);
|
kfree(f);
|
DJM(no_jffs_file--);
|
DJM(no_jffs_file--);
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Used in conjunction with jffs_foreach_file() to count the number
|
/* Used in conjunction with jffs_foreach_file() to count the number
|
of files in the file system. */
|
of files in the file system. */
|
int
|
int
|
jffs_file_count(struct jffs_file *f)
|
jffs_file_count(struct jffs_file *f)
|
{
|
{
|
return 1;
|
return 1;
|
}
|
}
|
|
|
|
|
/* Build up a file's range list from scratch by going through the
|
/* Build up a file's range list from scratch by going through the
|
version list. */
|
version list. */
|
int
|
int
|
jffs_build_file(struct jffs_file *f)
|
jffs_build_file(struct jffs_file *f)
|
{
|
{
|
struct jffs_node *n;
|
struct jffs_node *n;
|
|
|
D3(printk("jffs_build_file(): ino: %u, name: \"%s\"\n",
|
D3(printk("jffs_build_file(): ino: %u, name: \"%s\"\n",
|
f->ino, (f->name ? f->name : "")));
|
f->ino, (f->name ? f->name : "")));
|
|
|
for (n = f->version_head; n; n = n->version_next) {
|
for (n = f->version_head; n; n = n->version_next) {
|
jffs_update_file(f, n);
|
jffs_update_file(f, n);
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Remove an amount of data from a file. If this amount of data is
|
/* Remove an amount of data from a file. If this amount of data is
|
zero, that could mean that a node should be split in two parts.
|
zero, that could mean that a node should be split in two parts.
|
We remove or change the appropriate nodes in the lists.
|
We remove or change the appropriate nodes in the lists.
|
|
|
Starting offset of area to be removed is node->data_offset,
|
Starting offset of area to be removed is node->data_offset,
|
and the length of the area is in node->removed_size. */
|
and the length of the area is in node->removed_size. */
|
static void
|
static void
|
jffs_delete_data(struct jffs_file *f, struct jffs_node *node)
|
jffs_delete_data(struct jffs_file *f, struct jffs_node *node)
|
{
|
{
|
struct jffs_node *n;
|
struct jffs_node *n;
|
__u32 offset = node->data_offset;
|
__u32 offset = node->data_offset;
|
__u32 remove_size = node->removed_size;
|
__u32 remove_size = node->removed_size;
|
|
|
D3(printk("jffs_delete_data(): offset = %u, remove_size = %u\n",
|
D3(printk("jffs_delete_data(): offset = %u, remove_size = %u\n",
|
offset, remove_size));
|
offset, remove_size));
|
|
|
if (remove_size == 0
|
if (remove_size == 0
|
&& f->range_tail
|
&& f->range_tail
|
&& f->range_tail->data_offset + f->range_tail->data_size
|
&& f->range_tail->data_offset + f->range_tail->data_size
|
== offset) {
|
== offset) {
|
/* A simple append; nothing to remove or no node to split. */
|
/* A simple append; nothing to remove or no node to split. */
|
return;
|
return;
|
}
|
}
|
|
|
/* Find the node where we should begin the removal. */
|
/* Find the node where we should begin the removal. */
|
for (n = f->range_head; n; n = n->range_next) {
|
for (n = f->range_head; n; n = n->range_next) {
|
if (n->data_offset + n->data_size > offset) {
|
if (n->data_offset + n->data_size > offset) {
|
break;
|
break;
|
}
|
}
|
}
|
}
|
if (!n) {
|
if (!n) {
|
/* If there's no data in the file there's no data to
|
/* If there's no data in the file there's no data to
|
remove either. */
|
remove either. */
|
return;
|
return;
|
}
|
}
|
|
|
if (n->data_offset > offset) {
|
if (n->data_offset > offset) {
|
/* XXX: Not implemented yet. */
|
/* XXX: Not implemented yet. */
|
printk(KERN_WARNING "JFFS: An unexpected situation "
|
printk(KERN_WARNING "JFFS: An unexpected situation "
|
"occurred in jffs_delete_data.\n");
|
"occurred in jffs_delete_data.\n");
|
}
|
}
|
else if (n->data_offset < offset) {
|
else if (n->data_offset < offset) {
|
/* See if the node has to be split into two parts. */
|
/* See if the node has to be split into two parts. */
|
if (n->data_offset + n->data_size < offset + remove_size) {
|
if (n->data_offset + n->data_size < offset + remove_size) {
|
/* Do the split. */
|
/* Do the split. */
|
struct jffs_node *new_node;
|
struct jffs_node *new_node;
|
D3(printk("jffs_delete_data(): Split node with "
|
D3(printk("jffs_delete_data(): Split node with "
|
"version number %u.\n", n->version));
|
"version number %u.\n", n->version));
|
|
|
if (!(new_node = (struct jffs_node *)
|
if (!(new_node = (struct jffs_node *)
|
kmalloc(sizeof(struct jffs_node),
|
kmalloc(sizeof(struct jffs_node),
|
GFP_KERNEL))) {
|
GFP_KERNEL))) {
|
D(printk("jffs_delete_data(): -ENOMEM\n"));
|
D(printk("jffs_delete_data(): -ENOMEM\n"));
|
return;
|
return;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
|
|
new_node->ino = n->ino;
|
new_node->ino = n->ino;
|
new_node->version = n->version;
|
new_node->version = n->version;
|
new_node->data_offset = offset;
|
new_node->data_offset = offset;
|
new_node->data_size = n->data_size
|
new_node->data_size = n->data_size
|
- (remove_size
|
- (remove_size
|
+ (offset - n->data_offset));
|
+ (offset - n->data_offset));
|
new_node->fm_offset = n->fm_offset + n->data_size
|
new_node->fm_offset = n->fm_offset + n->data_size
|
+ remove_size;
|
+ remove_size;
|
new_node->name_size = n->name_size;
|
new_node->name_size = n->name_size;
|
new_node->fm = n->fm;
|
new_node->fm = n->fm;
|
new_node->version_prev = n;
|
new_node->version_prev = n;
|
new_node->version_next = n->version_next;
|
new_node->version_next = n->version_next;
|
if (new_node->version_next) {
|
if (new_node->version_next) {
|
new_node->version_next->version_prev
|
new_node->version_next->version_prev
|
= new_node;
|
= new_node;
|
}
|
}
|
else {
|
else {
|
f->version_tail = new_node;
|
f->version_tail = new_node;
|
}
|
}
|
n->version_next = new_node;
|
n->version_next = new_node;
|
new_node->range_prev = n;
|
new_node->range_prev = n;
|
new_node->range_next = n->range_next;
|
new_node->range_next = n->range_next;
|
if (new_node->range_next) {
|
if (new_node->range_next) {
|
new_node->range_next->range_prev = new_node;
|
new_node->range_next->range_prev = new_node;
|
}
|
}
|
else {
|
else {
|
f->range_tail = new_node;
|
f->range_tail = new_node;
|
}
|
}
|
/* A very interesting can of worms. */
|
/* A very interesting can of worms. */
|
n->range_next = new_node;
|
n->range_next = new_node;
|
n->data_size = offset - n->data_offset;
|
n->data_size = offset - n->data_offset;
|
jffs_add_node(new_node);
|
jffs_add_node(new_node);
|
n = new_node->range_next;
|
n = new_node->range_next;
|
remove_size = 0;
|
remove_size = 0;
|
}
|
}
|
else {
|
else {
|
/* No. No need to split the node. Just remove
|
/* No. No need to split the node. Just remove
|
the end of the node. */
|
the end of the node. */
|
int r = jffs_min(n->data_offset + n->data_size
|
int r = jffs_min(n->data_offset + n->data_size
|
- offset, remove_size);
|
- offset, remove_size);
|
n->data_size -= r;
|
n->data_size -= r;
|
remove_size -= r;
|
remove_size -= r;
|
n = n->range_next;
|
n = n->range_next;
|
}
|
}
|
}
|
}
|
|
|
/* Remove as many nodes as necessary. */
|
/* Remove as many nodes as necessary. */
|
while (n && remove_size) {
|
while (n && remove_size) {
|
if (n->data_size <= remove_size) {
|
if (n->data_size <= remove_size) {
|
struct jffs_node *p = n;
|
struct jffs_node *p = n;
|
remove_size -= n->data_size;
|
remove_size -= n->data_size;
|
n = n->range_next;
|
n = n->range_next;
|
D3(printk("jffs_delete_data(): Removing node: "
|
D3(printk("jffs_delete_data(): Removing node: "
|
"ino: %u, version: %u\n",
|
"ino: %u, version: %u\n",
|
p->ino, p->version));
|
p->ino, p->version));
|
if (p->fm) {
|
if (p->fm) {
|
jffs_fmfree(f->c->fmc, p->fm, p);
|
jffs_fmfree(f->c->fmc, p->fm, p);
|
}
|
}
|
jffs_unlink_node_from_range_list(f, p);
|
jffs_unlink_node_from_range_list(f, p);
|
jffs_unlink_node_from_version_list(f, p);
|
jffs_unlink_node_from_version_list(f, p);
|
kfree(p);
|
kfree(p);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
}
|
}
|
else {
|
else {
|
n->data_size -= remove_size;
|
n->data_size -= remove_size;
|
n->fm_offset += remove_size;
|
n->fm_offset += remove_size;
|
n->data_offset -= (node->removed_size - remove_size);
|
n->data_offset -= (node->removed_size - remove_size);
|
n = n->range_next;
|
n = n->range_next;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
/* Adjust the following nodes' information about offsets etc. */
|
/* Adjust the following nodes' information about offsets etc. */
|
while (n && node->removed_size) {
|
while (n && node->removed_size) {
|
n->data_offset -= node->removed_size;
|
n->data_offset -= node->removed_size;
|
n = n->range_next;
|
n = n->range_next;
|
}
|
}
|
|
|
f->size -= node->removed_size;
|
f->size -= node->removed_size;
|
D3(printk("jffs_delete_data(): f->size = %d\n", f->size));
|
D3(printk("jffs_delete_data(): f->size = %d\n", f->size));
|
} /* jffs_delete_data() */
|
} /* jffs_delete_data() */
|
|
|
|
|
/* Insert some data into a file. Prior to the call to this function,
|
/* Insert some data into a file. Prior to the call to this function,
|
jffs_delete_data() should be called. */
|
jffs_delete_data() should be called. */
|
static void
|
static void
|
jffs_insert_data(struct jffs_file *f, struct jffs_node *node)
|
jffs_insert_data(struct jffs_file *f, struct jffs_node *node)
|
{
|
{
|
D3(printk("jffs_insert_data(): node->data_offset = %u, "
|
D3(printk("jffs_insert_data(): node->data_offset = %u, "
|
"node->data_size = %u, f->size = %u\n",
|
"node->data_size = %u, f->size = %u\n",
|
node->data_offset, node->data_size, f->size));
|
node->data_offset, node->data_size, f->size));
|
|
|
/* Find the position where we should insert data. */
|
/* Find the position where we should insert data. */
|
|
|
if (node->data_offset == f->size) {
|
if (node->data_offset == f->size) {
|
/* A simple append. This is the most common operation. */
|
/* A simple append. This is the most common operation. */
|
node->range_next = 0;
|
node->range_next = 0;
|
node->range_prev = f->range_tail;
|
node->range_prev = f->range_tail;
|
if (node->range_prev) {
|
if (node->range_prev) {
|
node->range_prev->range_next = node;
|
node->range_prev->range_next = node;
|
}
|
}
|
f->range_tail = node;
|
f->range_tail = node;
|
f->size += node->data_size;
|
f->size += node->data_size;
|
if (!f->range_head) {
|
if (!f->range_head) {
|
f->range_head = node;
|
f->range_head = node;
|
}
|
}
|
}
|
}
|
else if (node->data_offset < f->size) {
|
else if (node->data_offset < f->size) {
|
/* Trying to insert data into the middle of the file. This
|
/* Trying to insert data into the middle of the file. This
|
means no problem because jffs_delete_data() has already
|
means no problem because jffs_delete_data() has already
|
prepared the range list for us. */
|
prepared the range list for us. */
|
struct jffs_node *n;
|
struct jffs_node *n;
|
|
|
/* Find the correct place for the insertion and then insert
|
/* Find the correct place for the insertion and then insert
|
the node. */
|
the node. */
|
for (n = f->range_head; n; n = n->range_next) {
|
for (n = f->range_head; n; n = n->range_next) {
|
D1(printk("Cool stuff's happening!\n"));
|
D1(printk("Cool stuff's happening!\n"));
|
|
|
if (n->data_offset == node->data_offset) {
|
if (n->data_offset == node->data_offset) {
|
node->range_prev = n->range_prev;
|
node->range_prev = n->range_prev;
|
if (node->range_prev) {
|
if (node->range_prev) {
|
node->range_prev->range_next = node;
|
node->range_prev->range_next = node;
|
}
|
}
|
else {
|
else {
|
f->range_head = node;
|
f->range_head = node;
|
}
|
}
|
node->range_next = n;
|
node->range_next = n;
|
n->range_prev = node;
|
n->range_prev = node;
|
break;
|
break;
|
}
|
}
|
ASSERT(else if (n->data_offset + n->data_size >
|
ASSERT(else if (n->data_offset + n->data_size >
|
node->data_offset) {
|
node->data_offset) {
|
printk(KERN_ERR "jffs_insert_data(): "
|
printk(KERN_ERR "jffs_insert_data(): "
|
"Couldn't find a place to insert "
|
"Couldn't find a place to insert "
|
"the data!\n");
|
"the data!\n");
|
return;
|
return;
|
});
|
});
|
}
|
}
|
|
|
/* Adjust later nodes' offsets etc. */
|
/* Adjust later nodes' offsets etc. */
|
n = node->range_next;
|
n = node->range_next;
|
while (n) {
|
while (n) {
|
n->data_offset += node->data_size;
|
n->data_offset += node->data_size;
|
n = n->range_next;
|
n = n->range_next;
|
}
|
}
|
f->size += node->data_size;
|
f->size += node->data_size;
|
}
|
}
|
else if (node->data_offset > f->size) {
|
else if (node->data_offset > f->size) {
|
/* Not implemented yet. */
|
/* Not implemented yet. */
|
#if 0
|
#if 0
|
/* Below is some example code for future use if we decide
|
/* Below is some example code for future use if we decide
|
to implement it. */
|
to implement it. */
|
/* This is code that isn't supported by VFS. So there aren't
|
/* This is code that isn't supported by VFS. So there aren't
|
really any reasons to implement it yet. */
|
really any reasons to implement it yet. */
|
if (!f->range_head) {
|
if (!f->range_head) {
|
if (node->data_offset > f->size) {
|
if (node->data_offset > f->size) {
|
if (!(nn = jffs_alloc_node())) {
|
if (!(nn = jffs_alloc_node())) {
|
D(printk("jffs_insert_data(): "
|
D(printk("jffs_insert_data(): "
|
"Allocation failed.\n"));
|
"Allocation failed.\n"));
|
return;
|
return;
|
}
|
}
|
nn->version = JFFS_MAGIC_BITMASK;
|
nn->version = JFFS_MAGIC_BITMASK;
|
nn->data_offset = 0;
|
nn->data_offset = 0;
|
nn->data_size = node->data_offset;
|
nn->data_size = node->data_offset;
|
nn->removed_size = 0;
|
nn->removed_size = 0;
|
nn->fm_offset = 0;
|
nn->fm_offset = 0;
|
nn->name_size = 0;
|
nn->name_size = 0;
|
nn->fm = 0; /* This is a virtual data holder. */
|
nn->fm = 0; /* This is a virtual data holder. */
|
nn->version_prev = 0;
|
nn->version_prev = 0;
|
nn->version_next = 0;
|
nn->version_next = 0;
|
nn->range_prev = 0;
|
nn->range_prev = 0;
|
nn->range_next = 0;
|
nn->range_next = 0;
|
nh->range_head = nn;
|
nh->range_head = nn;
|
nh->range_tail = nn;
|
nh->range_tail = nn;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
}
|
}
|
|
|
D3(printk("jffs_insert_data(): f->size = %d\n", f->size));
|
D3(printk("jffs_insert_data(): f->size = %d\n", f->size));
|
}
|
}
|
|
|
|
|
/* A new node (with data) has been added to the file and now the range
|
/* A new node (with data) has been added to the file and now the range
|
list has to be modified. */
|
list has to be modified. */
|
static int
|
static int
|
jffs_update_file(struct jffs_file *f, struct jffs_node *node)
|
jffs_update_file(struct jffs_file *f, struct jffs_node *node)
|
{
|
{
|
D3(printk("jffs_update_file(): ino: %u, version: %u\n",
|
D3(printk("jffs_update_file(): ino: %u, version: %u\n",
|
f->ino, node->version));
|
f->ino, node->version));
|
|
|
if (node->data_size == 0) {
|
if (node->data_size == 0) {
|
if (node->removed_size == 0) {
|
if (node->removed_size == 0) {
|
/* data_offset == X */
|
/* data_offset == X */
|
/* data_size == 0 */
|
/* data_size == 0 */
|
/* remove_size == 0 */
|
/* remove_size == 0 */
|
}
|
}
|
else {
|
else {
|
/* data_offset == X */
|
/* data_offset == X */
|
/* data_size == 0 */
|
/* data_size == 0 */
|
/* remove_size != 0 */
|
/* remove_size != 0 */
|
jffs_delete_data(f, node);
|
jffs_delete_data(f, node);
|
}
|
}
|
}
|
}
|
else {
|
else {
|
/* data_offset == X */
|
/* data_offset == X */
|
/* data_size != 0 */
|
/* data_size != 0 */
|
/* remove_size == Y */
|
/* remove_size == Y */
|
jffs_delete_data(f, node);
|
jffs_delete_data(f, node);
|
jffs_insert_data(f, node);
|
jffs_insert_data(f, node);
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
/* Print the contents of a node. */
|
/* Print the contents of a node. */
|
void
|
void
|
jffs_print_node(struct jffs_node *n)
|
jffs_print_node(struct jffs_node *n)
|
{
|
{
|
D(printk("jffs_node: 0x%p\n", n));
|
D(printk("jffs_node: 0x%p\n", n));
|
D(printk("{\n"));
|
D(printk("{\n"));
|
D(printk(" 0x%08x, /* version */\n", n->version));
|
D(printk(" 0x%08x, /* version */\n", n->version));
|
D(printk(" 0x%08x, /* data_offset */\n", n->data_offset));
|
D(printk(" 0x%08x, /* data_offset */\n", n->data_offset));
|
D(printk(" 0x%08x, /* data_size */\n", n->data_size));
|
D(printk(" 0x%08x, /* data_size */\n", n->data_size));
|
D(printk(" 0x%08x, /* removed_size */\n", n->removed_size));
|
D(printk(" 0x%08x, /* removed_size */\n", n->removed_size));
|
D(printk(" 0x%08x, /* fm_offset */\n", n->fm_offset));
|
D(printk(" 0x%08x, /* fm_offset */\n", n->fm_offset));
|
D(printk(" 0x%02x, /* name_size */\n", n->name_size));
|
D(printk(" 0x%02x, /* name_size */\n", n->name_size));
|
D(printk(" 0x%p, /* fm, fm->offset: %u */\n",
|
D(printk(" 0x%p, /* fm, fm->offset: %u */\n",
|
n->fm, n->fm->offset));
|
n->fm, n->fm->offset));
|
D(printk(" 0x%p, /* version_prev */\n", n->version_prev));
|
D(printk(" 0x%p, /* version_prev */\n", n->version_prev));
|
D(printk(" 0x%p, /* version_next */\n", n->version_next));
|
D(printk(" 0x%p, /* version_next */\n", n->version_next));
|
D(printk(" 0x%p, /* range_prev */\n", n->range_prev));
|
D(printk(" 0x%p, /* range_prev */\n", n->range_prev));
|
D(printk(" 0x%p, /* range_next */\n", n->range_next));
|
D(printk(" 0x%p, /* range_next */\n", n->range_next));
|
D(printk("}\n"));
|
D(printk("}\n"));
|
}
|
}
|
|
|
|
|
/* Print the contents of a raw inode. */
|
/* Print the contents of a raw inode. */
|
void
|
void
|
jffs_print_raw_inode(struct jffs_raw_inode *raw_inode)
|
jffs_print_raw_inode(struct jffs_raw_inode *raw_inode)
|
{
|
{
|
D(printk("jffs_raw_inode: inode number: %u\n", raw_inode->ino));
|
D(printk("jffs_raw_inode: inode number: %u\n", raw_inode->ino));
|
D(printk("{\n"));
|
D(printk("{\n"));
|
D(printk(" 0x%08x, /* magic */\n", raw_inode->magic));
|
D(printk(" 0x%08x, /* magic */\n", raw_inode->magic));
|
D(printk(" 0x%08x, /* ino */\n", raw_inode->ino));
|
D(printk(" 0x%08x, /* ino */\n", raw_inode->ino));
|
D(printk(" 0x%08x, /* pino */\n", raw_inode->pino));
|
D(printk(" 0x%08x, /* pino */\n", raw_inode->pino));
|
D(printk(" 0x%08x, /* version */\n", raw_inode->version));
|
D(printk(" 0x%08x, /* version */\n", raw_inode->version));
|
D(printk(" 0x%08x, /* mode */\n", raw_inode->mode));
|
D(printk(" 0x%08x, /* mode */\n", raw_inode->mode));
|
D(printk(" 0x%04x, /* uid */\n", raw_inode->uid));
|
D(printk(" 0x%04x, /* uid */\n", raw_inode->uid));
|
D(printk(" 0x%04x, /* gid */\n", raw_inode->gid));
|
D(printk(" 0x%04x, /* gid */\n", raw_inode->gid));
|
D(printk(" 0x%08x, /* atime */\n", raw_inode->atime));
|
D(printk(" 0x%08x, /* atime */\n", raw_inode->atime));
|
D(printk(" 0x%08x, /* mtime */\n", raw_inode->mtime));
|
D(printk(" 0x%08x, /* mtime */\n", raw_inode->mtime));
|
D(printk(" 0x%08x, /* ctime */\n", raw_inode->ctime));
|
D(printk(" 0x%08x, /* ctime */\n", raw_inode->ctime));
|
D(printk(" 0x%08x, /* offset */\n", raw_inode->offset));
|
D(printk(" 0x%08x, /* offset */\n", raw_inode->offset));
|
D(printk(" 0x%08x, /* dsize */\n", raw_inode->dsize));
|
D(printk(" 0x%08x, /* dsize */\n", raw_inode->dsize));
|
D(printk(" 0x%08x, /* rsize */\n", raw_inode->rsize));
|
D(printk(" 0x%08x, /* rsize */\n", raw_inode->rsize));
|
D(printk(" 0x%02x, /* nsize */\n", raw_inode->nsize));
|
D(printk(" 0x%02x, /* nsize */\n", raw_inode->nsize));
|
D(printk(" 0x%02x, /* nlink */\n", raw_inode->nlink));
|
D(printk(" 0x%02x, /* nlink */\n", raw_inode->nlink));
|
D(printk(" 0x%02x, /* spare */\n",
|
D(printk(" 0x%02x, /* spare */\n",
|
raw_inode->spare));
|
raw_inode->spare));
|
D(printk(" %u, /* rename */\n",
|
D(printk(" %u, /* rename */\n",
|
raw_inode->rename));
|
raw_inode->rename));
|
D(printk(" %u, /* deleted */\n",
|
D(printk(" %u, /* deleted */\n",
|
raw_inode->deleted));
|
raw_inode->deleted));
|
D(printk(" 0x%02x, /* accurate */\n",
|
D(printk(" 0x%02x, /* accurate */\n",
|
raw_inode->accurate));
|
raw_inode->accurate));
|
D(printk(" 0x%08x, /* dchksum */\n", raw_inode->dchksum));
|
D(printk(" 0x%08x, /* dchksum */\n", raw_inode->dchksum));
|
D(printk(" 0x%04x, /* nchksum */\n", raw_inode->nchksum));
|
D(printk(" 0x%04x, /* nchksum */\n", raw_inode->nchksum));
|
D(printk(" 0x%04x, /* chksum */\n", raw_inode->chksum));
|
D(printk(" 0x%04x, /* chksum */\n", raw_inode->chksum));
|
D(printk("}\n"));
|
D(printk("}\n"));
|
}
|
}
|
|
|
|
|
/* Print the contents of a file. */
|
/* Print the contents of a file. */
|
int
|
int
|
jffs_print_file(struct jffs_file *f)
|
jffs_print_file(struct jffs_file *f)
|
{
|
{
|
D(int i);
|
D(int i);
|
D(printk("jffs_file: 0x%p\n", f));
|
D(printk("jffs_file: 0x%p\n", f));
|
D(printk("{\n"));
|
D(printk("{\n"));
|
D(printk(" 0x%08x, /* ino */\n", f->ino));
|
D(printk(" 0x%08x, /* ino */\n", f->ino));
|
D(printk(" 0x%08x, /* pino */\n", f->pino));
|
D(printk(" 0x%08x, /* pino */\n", f->pino));
|
D(printk(" 0x%08x, /* mode */\n", f->mode));
|
D(printk(" 0x%08x, /* mode */\n", f->mode));
|
D(printk(" 0x%04x, /* uid */\n", f->uid));
|
D(printk(" 0x%04x, /* uid */\n", f->uid));
|
D(printk(" 0x%04x, /* gid */\n", f->gid));
|
D(printk(" 0x%04x, /* gid */\n", f->gid));
|
D(printk(" 0x%08x, /* atime */\n", f->atime));
|
D(printk(" 0x%08x, /* atime */\n", f->atime));
|
D(printk(" 0x%08x, /* mtime */\n", f->mtime));
|
D(printk(" 0x%08x, /* mtime */\n", f->mtime));
|
D(printk(" 0x%08x, /* ctime */\n", f->ctime));
|
D(printk(" 0x%08x, /* ctime */\n", f->ctime));
|
D(printk(" 0x%02x, /* nsize */\n", f->nsize));
|
D(printk(" 0x%02x, /* nsize */\n", f->nsize));
|
D(printk(" 0x%02x, /* nlink */\n", f->nlink));
|
D(printk(" 0x%02x, /* nlink */\n", f->nlink));
|
D(printk(" 0x%02x, /* deleted */\n", f->deleted));
|
D(printk(" 0x%02x, /* deleted */\n", f->deleted));
|
D(printk(" \"%s\", ", (f->name ? f->name : "")));
|
D(printk(" \"%s\", ", (f->name ? f->name : "")));
|
D(for (i = strlen(f->name ? f->name : ""); i < 8; ++i) {
|
D(for (i = strlen(f->name ? f->name : ""); i < 8; ++i) {
|
printk(" ");
|
printk(" ");
|
});
|
});
|
D(printk("/* name */\n"));
|
D(printk("/* name */\n"));
|
D(printk(" 0x%08x, /* size */\n", f->size));
|
D(printk(" 0x%08x, /* size */\n", f->size));
|
D(printk(" 0x%08x, /* highest_version */\n",
|
D(printk(" 0x%08x, /* highest_version */\n",
|
f->highest_version));
|
f->highest_version));
|
D(printk(" 0x%p, /* c */\n", f->c));
|
D(printk(" 0x%p, /* c */\n", f->c));
|
D(printk(" 0x%p, /* parent */\n", f->parent));
|
D(printk(" 0x%p, /* parent */\n", f->parent));
|
D(printk(" 0x%p, /* children */\n", f->children));
|
D(printk(" 0x%p, /* children */\n", f->children));
|
D(printk(" 0x%p, /* sibling_prev */\n", f->sibling_prev));
|
D(printk(" 0x%p, /* sibling_prev */\n", f->sibling_prev));
|
D(printk(" 0x%p, /* sibling_next */\n", f->sibling_next));
|
D(printk(" 0x%p, /* sibling_next */\n", f->sibling_next));
|
D(printk(" 0x%p, /* hash_prev */\n", f->hash_prev));
|
D(printk(" 0x%p, /* hash_prev */\n", f->hash_prev));
|
D(printk(" 0x%p, /* hash_next */\n", f->hash_next));
|
D(printk(" 0x%p, /* hash_next */\n", f->hash_next));
|
D(printk(" 0x%p, /* range_head */\n", f->range_head));
|
D(printk(" 0x%p, /* range_head */\n", f->range_head));
|
D(printk(" 0x%p, /* range_tail */\n", f->range_tail));
|
D(printk(" 0x%p, /* range_tail */\n", f->range_tail));
|
D(printk(" 0x%p, /* version_head */\n", f->version_head));
|
D(printk(" 0x%p, /* version_head */\n", f->version_head));
|
D(printk(" 0x%p, /* version_tail */\n", f->version_tail));
|
D(printk(" 0x%p, /* version_tail */\n", f->version_tail));
|
D(printk("}\n"));
|
D(printk("}\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
void
|
void
|
jffs_print_hash_table(struct jffs_control *c)
|
jffs_print_hash_table(struct jffs_control *c)
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
int i;
|
int i;
|
|
|
printk("JFFS: Dumping the file system's hash table...\n");
|
printk("JFFS: Dumping the file system's hash table...\n");
|
for (i = 0; i < c->hash_len; i++) {
|
for (i = 0; i < c->hash_len; i++) {
|
for (f = c->hash[i]; f; f = f->hash_next) {
|
for (f = c->hash[i]; f; f = f->hash_next) {
|
printk("*** c->hash[%u]: \"%s\" "
|
printk("*** c->hash[%u]: \"%s\" "
|
"(ino: %u, pino: %u)\n",
|
"(ino: %u, pino: %u)\n",
|
i, (f->name ? f->name : ""),
|
i, (f->name ? f->name : ""),
|
f->ino, f->pino);
|
f->ino, f->pino);
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
|
|
void
|
void
|
jffs_print_tree(struct jffs_file *first_file, int indent)
|
jffs_print_tree(struct jffs_file *first_file, int indent)
|
{
|
{
|
struct jffs_file *f;
|
struct jffs_file *f;
|
char *space;
|
char *space;
|
|
|
if (!first_file) {
|
if (!first_file) {
|
return;
|
return;
|
}
|
}
|
|
|
if (!(space = (char *) kmalloc(indent + 1, GFP_KERNEL))) {
|
if (!(space = (char *) kmalloc(indent + 1, GFP_KERNEL))) {
|
printk("jffs_print_tree(): Out of memory!\n");
|
printk("jffs_print_tree(): Out of memory!\n");
|
return;
|
return;
|
}
|
}
|
|
|
memset(space, ' ', indent);
|
memset(space, ' ', indent);
|
space[indent] = '\0';
|
space[indent] = '\0';
|
|
|
for (f = first_file; f; f = f->sibling_next) {
|
for (f = first_file; f; f = f->sibling_next) {
|
printk("%s%s (ino: %u, highest_version: %u, size: %u)\n",
|
printk("%s%s (ino: %u, highest_version: %u, size: %u)\n",
|
space, (f->name ? f->name : "/"),
|
space, (f->name ? f->name : "/"),
|
f->ino, f->highest_version, f->size);
|
f->ino, f->highest_version, f->size);
|
if (S_ISDIR(f->mode)) {
|
if (S_ISDIR(f->mode)) {
|
jffs_print_tree(f->children, indent + 2);
|
jffs_print_tree(f->children, indent + 2);
|
}
|
}
|
}
|
}
|
|
|
kfree(space);
|
kfree(space);
|
}
|
}
|
|
|
|
|
#if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
|
#if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
|
void
|
void
|
jffs_print_memory_allocation_statistics(void)
|
jffs_print_memory_allocation_statistics(void)
|
{
|
{
|
static long printout = 0;
|
static long printout = 0;
|
printk("________ Memory printout #%ld ________\n", ++printout);
|
printk("________ Memory printout #%ld ________\n", ++printout);
|
printk("no_jffs_file = %ld\n", no_jffs_file);
|
printk("no_jffs_file = %ld\n", no_jffs_file);
|
printk("no_jffs_node = %ld\n", no_jffs_node);
|
printk("no_jffs_node = %ld\n", no_jffs_node);
|
printk("no_jffs_control = %ld\n", no_jffs_control);
|
printk("no_jffs_control = %ld\n", no_jffs_control);
|
printk("no_jffs_raw_inode = %ld\n", no_jffs_raw_inode);
|
printk("no_jffs_raw_inode = %ld\n", no_jffs_raw_inode);
|
printk("no_jffs_node_ref = %ld\n", no_jffs_node_ref);
|
printk("no_jffs_node_ref = %ld\n", no_jffs_node_ref);
|
printk("no_jffs_fm = %ld\n", no_jffs_fm);
|
printk("no_jffs_fm = %ld\n", no_jffs_fm);
|
printk("no_jffs_fmcontrol = %ld\n", no_jffs_fmcontrol);
|
printk("no_jffs_fmcontrol = %ld\n", no_jffs_fmcontrol);
|
printk("no_hash = %ld\n", no_hash);
|
printk("no_hash = %ld\n", no_hash);
|
printk("no_name = %ld\n", no_name);
|
printk("no_name = %ld\n", no_name);
|
printk("\n");
|
printk("\n");
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* Rewrite `size' bytes, and begin at `node'. */
|
/* Rewrite `size' bytes, and begin at `node'. */
|
int
|
int
|
jffs_rewrite_data(struct jffs_file *f, struct jffs_node *node, int size)
|
jffs_rewrite_data(struct jffs_file *f, struct jffs_node *node, int size)
|
{
|
{
|
struct jffs_control *c = f->c;
|
struct jffs_control *c = f->c;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
struct jffs_node *new_node;
|
struct jffs_node *new_node;
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
unsigned char *pos;
|
unsigned char *pos;
|
unsigned char *pos_dchksum;
|
unsigned char *pos_dchksum;
|
__u32 total_name_size;
|
__u32 total_name_size;
|
__u32 total_data_size;
|
__u32 total_data_size;
|
__u32 total_size;
|
__u32 total_size;
|
int err;
|
int err;
|
|
|
D1(printk("***jffs_rewrite_data(): node: %u, name: \"%s\", size: %u\n",
|
D1(printk("***jffs_rewrite_data(): node: %u, name: \"%s\", size: %u\n",
|
f->ino, (f->name ? f->name : ""), size));
|
f->ino, (f->name ? f->name : ""), size));
|
|
|
/* Create and initialize the new node. */
|
/* Create and initialize the new node. */
|
if (!(new_node = (struct jffs_node *)
|
if (!(new_node = (struct jffs_node *)
|
kmalloc(sizeof(struct jffs_node), GFP_KERNEL))) {
|
kmalloc(sizeof(struct jffs_node), GFP_KERNEL))) {
|
D(printk("jffs_rewrite_data(): "
|
D(printk("jffs_rewrite_data(): "
|
"Failed to allocate node.\n"));
|
"Failed to allocate node.\n"));
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
new_node->data_offset = node->data_offset;
|
new_node->data_offset = node->data_offset;
|
new_node->data_size = size;
|
new_node->data_size = size;
|
new_node->removed_size = size;
|
new_node->removed_size = size;
|
total_name_size = f->nsize + JFFS_GET_PAD_BYTES(f->nsize);
|
total_name_size = f->nsize + JFFS_GET_PAD_BYTES(f->nsize);
|
total_data_size = size + JFFS_GET_PAD_BYTES(size);
|
total_data_size = size + JFFS_GET_PAD_BYTES(size);
|
total_size = sizeof(struct jffs_raw_inode)
|
total_size = sizeof(struct jffs_raw_inode)
|
+ total_name_size + total_data_size;
|
+ total_name_size + total_data_size;
|
new_node->fm_offset = sizeof(struct jffs_raw_inode)
|
new_node->fm_offset = sizeof(struct jffs_raw_inode)
|
+ total_name_size;
|
+ total_name_size;
|
|
|
if ((err = jffs_fmalloc(fmc, total_size, new_node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(fmc, total_size, new_node, &fm)) < 0) {
|
D(printk("jffs_rewrite_data(): Failed to allocate fm.\n"));
|
D(printk("jffs_rewrite_data(): Failed to allocate fm.\n"));
|
kfree(new_node);
|
kfree(new_node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
return err;
|
return err;
|
}
|
}
|
else if (!fm->nodes) {
|
else if (!fm->nodes) {
|
/* The jffs_fm struct that we got is not good enough. */
|
/* The jffs_fm struct that we got is not good enough. */
|
if ((err = jffs_write_dummy_node(c, fm)) < 0) {
|
if ((err = jffs_write_dummy_node(c, fm)) < 0) {
|
D(printk("jffs_rewrite_data(): "
|
D(printk("jffs_rewrite_data(): "
|
"jffs_write_dummy_node() Failed!\n"));
|
"jffs_write_dummy_node() Failed!\n"));
|
kfree(fm);
|
kfree(fm);
|
DJM(no_jffs_fm--);
|
DJM(no_jffs_fm--);
|
return err;
|
return err;
|
}
|
}
|
/* Get a new one. */
|
/* Get a new one. */
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(fmc, total_size, node, &fm)) < 0) {
|
D(printk("jffs_rewrite_data(): Second "
|
D(printk("jffs_rewrite_data(): Second "
|
"jffs_fmalloc(0x%p, %u) failed!\n",
|
"jffs_fmalloc(0x%p, %u) failed!\n",
|
fmc, total_size));
|
fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
new_node->fm = fm;
|
new_node->fm = fm;
|
|
|
ASSERT(if (new_node->fm->nodes == 0) {
|
ASSERT(if (new_node->fm->nodes == 0) {
|
printk(KERN_ERR "jffs_rewrite_data(): "
|
printk(KERN_ERR "jffs_rewrite_data(): "
|
"new_node->fm->nodes == 0\n");
|
"new_node->fm->nodes == 0\n");
|
});
|
});
|
|
|
/* Initialize the raw inode. */
|
/* Initialize the raw inode. */
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.ino = f->ino;
|
raw_inode.ino = f->ino;
|
raw_inode.pino = f->pino;
|
raw_inode.pino = f->pino;
|
raw_inode.version = f->highest_version + 1;
|
raw_inode.version = f->highest_version + 1;
|
raw_inode.mode = f->mode;
|
raw_inode.mode = f->mode;
|
raw_inode.uid = f->uid;
|
raw_inode.uid = f->uid;
|
raw_inode.gid = f->gid;
|
raw_inode.gid = f->gid;
|
raw_inode.atime = f->atime;
|
raw_inode.atime = f->atime;
|
raw_inode.mtime = f->mtime;
|
raw_inode.mtime = f->mtime;
|
raw_inode.ctime = f->ctime;
|
raw_inode.ctime = f->ctime;
|
raw_inode.offset = node->data_offset;
|
raw_inode.offset = node->data_offset;
|
raw_inode.dsize = size;
|
raw_inode.dsize = size;
|
raw_inode.rsize = size;
|
raw_inode.rsize = size;
|
raw_inode.nsize = f->nsize;
|
raw_inode.nsize = f->nsize;
|
raw_inode.nlink = f->nlink;
|
raw_inode.nlink = f->nlink;
|
raw_inode.spare = 0;
|
raw_inode.spare = 0;
|
raw_inode.rename = 0;
|
raw_inode.rename = 0;
|
raw_inode.deleted = 0;
|
raw_inode.deleted = 0;
|
raw_inode.accurate = 0xff;
|
raw_inode.accurate = 0xff;
|
raw_inode.dchksum = 0;
|
raw_inode.dchksum = 0;
|
raw_inode.nchksum = 0;
|
raw_inode.nchksum = 0;
|
|
|
pos = (unsigned char *) new_node->fm->offset;
|
pos = (unsigned char *) new_node->fm->offset;
|
pos_dchksum = &pos[JFFS_RAW_INODE_DCHKSUM_OFFSET];
|
pos_dchksum = &pos[JFFS_RAW_INODE_DCHKSUM_OFFSET];
|
|
|
D3(printk("jffs_rewrite_data(): Writing this raw inode "
|
D3(printk("jffs_rewrite_data(): Writing this raw inode "
|
"to pos 0x%p.\n", pos));
|
"to pos 0x%p.\n", pos));
|
D3(jffs_print_raw_inode(&raw_inode));
|
D3(jffs_print_raw_inode(&raw_inode));
|
|
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
(unsigned char *) &raw_inode,
|
(unsigned char *) &raw_inode,
|
sizeof(struct jffs_raw_inode)
|
sizeof(struct jffs_raw_inode)
|
- sizeof(__u32)
|
- sizeof(__u32)
|
- sizeof(__u16) - sizeof(__u16))) < 0) {
|
- sizeof(__u16) - sizeof(__u16))) < 0) {
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
"rewrite. (raw inode)\n"));
|
"rewrite. (raw inode)\n"));
|
jffs_fmfree_partly(fmc, fm,
|
jffs_fmfree_partly(fmc, fm,
|
total_name_size + total_data_size);
|
total_name_size + total_data_size);
|
return err;
|
return err;
|
}
|
}
|
pos += sizeof(struct jffs_raw_inode);
|
pos += sizeof(struct jffs_raw_inode);
|
|
|
/* Write the name to the flash memory. */
|
/* Write the name to the flash memory. */
|
if (f->nsize) {
|
if (f->nsize) {
|
D3(printk("jffs_rewrite_data(): Writing name \"%s\" to "
|
D3(printk("jffs_rewrite_data(): Writing name \"%s\" to "
|
"pos 0x%p.\n", f->name, pos));
|
"pos 0x%p.\n", f->name, pos));
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
if ((err = flash_safe_write(fmc->flash_part, pos,
|
(unsigned char *)f->name,
|
(unsigned char *)f->name,
|
f->nsize)) < 0) {
|
f->nsize)) < 0) {
|
|
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
"rewrite. (name)\n"));
|
"rewrite. (name)\n"));
|
jffs_fmfree_partly(fmc, fm, total_data_size);
|
jffs_fmfree_partly(fmc, fm, total_data_size);
|
return err;
|
return err;
|
}
|
}
|
pos += total_name_size;
|
pos += total_name_size;
|
raw_inode.nchksum = jffs_checksum(f->name, f->nsize);
|
raw_inode.nchksum = jffs_checksum(f->name, f->nsize);
|
}
|
}
|
|
|
/* Write the data. */
|
/* Write the data. */
|
if (size) {
|
if (size) {
|
int r;
|
int r;
|
unsigned char *page;
|
unsigned char *page;
|
__u32 offset = node->data_offset;
|
__u32 offset = node->data_offset;
|
|
|
if (!(page = (unsigned char *)__get_free_page(GFP_KERNEL))) {
|
if (!(page = (unsigned char *)__get_free_page(GFP_KERNEL))) {
|
jffs_fmfree_partly(fmc, fm, 0);
|
jffs_fmfree_partly(fmc, fm, 0);
|
return -1;
|
return -1;
|
}
|
}
|
|
|
while (size) {
|
while (size) {
|
__u32 s = jffs_min(size, PAGE_SIZE);
|
__u32 s = jffs_min(size, PAGE_SIZE);
|
if ((r = jffs_read_data(f, (char *)page,
|
if ((r = jffs_read_data(f, (char *)page,
|
offset, s)) < s) {
|
offset, s)) < s) {
|
D(printk("jffs_rewrite_data(): "
|
D(printk("jffs_rewrite_data(): "
|
"jffs_read_data() "
|
"jffs_read_data() "
|
"failed! (r = %d)\n", r));
|
"failed! (r = %d)\n", r));
|
jffs_fmfree_partly(fmc, fm, 0);
|
jffs_fmfree_partly(fmc, fm, 0);
|
return -1;
|
return -1;
|
}
|
}
|
if ((err = flash_safe_write(fmc->flash_part,
|
if ((err = flash_safe_write(fmc->flash_part,
|
pos, page, r)) < 0) {
|
pos, page, r)) < 0) {
|
D(printk(KERN_WARNING "JFFS: Write error "
|
D(printk(KERN_WARNING "JFFS: Write error "
|
"during rewrite. (data)\n"));
|
"during rewrite. (data)\n"));
|
free_page((__u32)page);
|
free_page((__u32)page);
|
jffs_fmfree_partly(fmc, fm, 0);
|
jffs_fmfree_partly(fmc, fm, 0);
|
return err;
|
return err;
|
}
|
}
|
pos += r;
|
pos += r;
|
size -= r;
|
size -= r;
|
offset += r;
|
offset += r;
|
raw_inode.dchksum += jffs_checksum(page, r);
|
raw_inode.dchksum += jffs_checksum(page, r);
|
}
|
}
|
|
|
free_page((__u32)page);
|
free_page((__u32)page);
|
}
|
}
|
|
|
raw_inode.accurate = 0;
|
raw_inode.accurate = 0;
|
raw_inode.chksum = jffs_checksum(&raw_inode,
|
raw_inode.chksum = jffs_checksum(&raw_inode,
|
sizeof(struct jffs_raw_inode)
|
sizeof(struct jffs_raw_inode)
|
- sizeof(__u16));
|
- sizeof(__u16));
|
|
|
/* Add the checksum. */
|
/* Add the checksum. */
|
if ((err
|
if ((err
|
= flash_safe_write(fmc->flash_part, pos_dchksum,
|
= flash_safe_write(fmc->flash_part, pos_dchksum,
|
&((unsigned char *)
|
&((unsigned char *)
|
&raw_inode)[JFFS_RAW_INODE_DCHKSUM_OFFSET],
|
&raw_inode)[JFFS_RAW_INODE_DCHKSUM_OFFSET],
|
sizeof(__u32) + sizeof(__u16)
|
sizeof(__u32) + sizeof(__u16)
|
+ sizeof(__u16))) < 0) {
|
+ sizeof(__u16))) < 0) {
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
D(printk(KERN_WARNING "JFFS: Write error during "
|
"rewrite. (checksum)\n"));
|
"rewrite. (checksum)\n"));
|
jffs_fmfree_partly(fmc, fm, 0);
|
jffs_fmfree_partly(fmc, fm, 0);
|
return err;
|
return err;
|
}
|
}
|
|
|
/* Now make the file system aware of the newly written node. */
|
/* Now make the file system aware of the newly written node. */
|
jffs_insert_node(c, f, &raw_inode, f->name, new_node);
|
jffs_insert_node(c, f, &raw_inode, f->name, new_node);
|
|
|
D3(printk("jffs_rewrite_data(): Leaving...\n"));
|
D3(printk("jffs_rewrite_data(): Leaving...\n"));
|
return 0;
|
return 0;
|
} /* jffs_rewrite_data() */
|
} /* jffs_rewrite_data() */
|
|
|
#else
|
#else
|
|
|
/* Rewrite `size' bytes, and begin at `node'. */
|
/* Rewrite `size' bytes, and begin at `node'. */
|
int
|
int
|
jffs_rewrite_data(struct jffs_file *f, struct jffs_node *node, int size)
|
jffs_rewrite_data(struct jffs_file *f, struct jffs_node *node, int size)
|
{
|
{
|
struct jffs_raw_inode raw_inode;
|
struct jffs_raw_inode raw_inode;
|
struct jffs_node *new_node;
|
struct jffs_node *new_node;
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
__u32 chksum;
|
__u32 chksum;
|
__u32 write_size;
|
__u32 write_size;
|
__u32 block_offset;
|
__u32 block_offset;
|
__u32 block;
|
__u32 block;
|
__u32 copied_data = 0;
|
__u32 copied_data = 0;
|
__u32 pos_chksum;
|
__u32 pos_chksum;
|
__u32 block_chksum;
|
__u32 block_chksum;
|
__u32 total_size;
|
__u32 total_size;
|
kdev_t dev = f->c->sb->s_dev;
|
kdev_t dev = f->c->sb->s_dev;
|
int err;
|
int err;
|
|
|
D(printk("jffs_rewrite_data(): node: %u, name: \"%s\", size: %u\n",
|
D(printk("jffs_rewrite_data(): node: %u, name: \"%s\", size: %u\n",
|
f->ino, (f->name ? f->name : ""), size));
|
f->ino, (f->name ? f->name : ""), size));
|
|
|
/* Create and initialize the new node. */
|
/* Create and initialize the new node. */
|
if (!(new_node = (struct jffs_node *)
|
if (!(new_node = (struct jffs_node *)
|
kmalloc(sizeof(struct jffs_node), GFP_KERNEL))) {
|
kmalloc(sizeof(struct jffs_node), GFP_KERNEL))) {
|
D(printk("jffs_rewrite_data(): "
|
D(printk("jffs_rewrite_data(): "
|
"Failed to allocate node.\n"));
|
"Failed to allocate node.\n"));
|
return -ENOMEM;
|
return -ENOMEM;
|
}
|
}
|
DJM(no_jffs_node++);
|
DJM(no_jffs_node++);
|
new_node->data_offset = node->data_offset;
|
new_node->data_offset = node->data_offset;
|
new_node->data_size = size;
|
new_node->data_size = size;
|
new_node->removed_size = size;
|
new_node->removed_size = size;
|
total_size = sizeof(struct jffs_raw_inode)
|
total_size = sizeof(struct jffs_raw_inode)
|
+ f->nsize + JFFS_GET_PAD_BYTES(f->nsize)
|
+ f->nsize + JFFS_GET_PAD_BYTES(f->nsize)
|
+ size + JFFS_GET_PAD_BYTES(size);
|
+ size + JFFS_GET_PAD_BYTES(size);
|
new_node->fm_offset = sizeof(struct jffs_raw_inode)
|
new_node->fm_offset = sizeof(struct jffs_raw_inode)
|
+ f->nsize + JFFS_GET_PAD_BYTES(f->nsize);
|
+ f->nsize + JFFS_GET_PAD_BYTES(f->nsize);
|
|
|
if ((err = jffs_fmalloc(f->c->fmc, total_size, new_node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(f->c->fmc, total_size, new_node, &fm)) < 0) {
|
D(printk("jffs_rewrite_data(): Failed to allocate fm.\n"));
|
D(printk("jffs_rewrite_data(): Failed to allocate fm.\n"));
|
kfree(new_node);
|
kfree(new_node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
return err;
|
return err;
|
}
|
}
|
else if (!fm->nodes) {
|
else if (!fm->nodes) {
|
/* The jffs_fm struct that we got is not good enough. */
|
/* The jffs_fm struct that we got is not good enough. */
|
if ((err = jffs_write_dummy_node(f->c, fm)) < 0) {
|
if ((err = jffs_write_dummy_node(f->c, fm)) < 0) {
|
D(printk("jffs_rewrite_data(): "
|
D(printk("jffs_rewrite_data(): "
|
"jffs_write_dummy_node() Failed!\n"));
|
"jffs_write_dummy_node() Failed!\n"));
|
kfree(fm);
|
kfree(fm);
|
DJM(no_jffs_fm--);
|
DJM(no_jffs_fm--);
|
return err;
|
return err;
|
}
|
}
|
/* Get a new one. */
|
/* Get a new one. */
|
if ((err = jffs_fmalloc(f->c->fmc, total_size, node, &fm)) < 0) {
|
if ((err = jffs_fmalloc(f->c->fmc, total_size, node, &fm)) < 0) {
|
D(printk("jffs_rewrite_data(): Second "
|
D(printk("jffs_rewrite_data(): Second "
|
"jffs_fmalloc(0x%08x, %u) failed!\n",
|
"jffs_fmalloc(0x%08x, %u) failed!\n",
|
f->c->fmc, total_size));
|
f->c->fmc, total_size));
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
new_node->fm = fm;
|
new_node->fm = fm;
|
|
|
ASSERT(if (new_node->fm->nodes == 0) {
|
ASSERT(if (new_node->fm->nodes == 0) {
|
printk(KERN_ERR "jffs_rewrite_data(): "
|
printk(KERN_ERR "jffs_rewrite_data(): "
|
"new_node->fm->nodes == 0\n");
|
"new_node->fm->nodes == 0\n");
|
});
|
});
|
|
|
/* Initialize the raw inode. */
|
/* Initialize the raw inode. */
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.magic = JFFS_MAGIC_BITMASK;
|
raw_inode.ino = f->ino;
|
raw_inode.ino = f->ino;
|
raw_inode.pino = f->pino;
|
raw_inode.pino = f->pino;
|
raw_inode.version = f->highest_version + 1;
|
raw_inode.version = f->highest_version + 1;
|
raw_inode.mode = f->mode;
|
raw_inode.mode = f->mode;
|
raw_inode.uid = f->uid;
|
raw_inode.uid = f->uid;
|
raw_inode.gid = f->gid;
|
raw_inode.gid = f->gid;
|
raw_inode.atime = f->atime;
|
raw_inode.atime = f->atime;
|
raw_inode.mtime = f->mtime;
|
raw_inode.mtime = f->mtime;
|
raw_inode.ctime = f->ctime;
|
raw_inode.ctime = f->ctime;
|
raw_inode.offset = node->data_offset;
|
raw_inode.offset = node->data_offset;
|
raw_inode.dsize = size;
|
raw_inode.dsize = size;
|
raw_inode.rsize = size;
|
raw_inode.rsize = size;
|
raw_inode.nsize = f->nsize;
|
raw_inode.nsize = f->nsize;
|
raw_inode.nlink = f->nlink;
|
raw_inode.nlink = f->nlink;
|
raw_inode.deleted = 0;
|
raw_inode.deleted = 0;
|
raw_inode.accurate = 0;
|
raw_inode.accurate = 0;
|
raw_inode.chksum = 0;
|
raw_inode.chksum = 0;
|
chksum = jffs_checksum(&raw_inode, sizeof(struct jffs_raw_inode));
|
chksum = jffs_checksum(&raw_inode, sizeof(struct jffs_raw_inode));
|
raw_inode.accurate = 0xff;
|
raw_inode.accurate = 0xff;
|
raw_inode.chksum = JFFS_EMPTY_BITMASK;
|
raw_inode.chksum = JFFS_EMPTY_BITMASK;
|
|
|
/* Retrieve the first block to which the new node is going
|
/* Retrieve the first block to which the new node is going
|
to be written. */
|
to be written. */
|
block = new_node->fm->offset / BLOCK_SIZE;
|
block = new_node->fm->offset / BLOCK_SIZE;
|
block_offset = new_node->fm->offset - block * BLOCK_SIZE;
|
block_offset = new_node->fm->offset - block * BLOCK_SIZE;
|
|
|
D(printk("jffs_rewrite_data(): Writing to dev = 0x%04x, block = %u, "
|
D(printk("jffs_rewrite_data(): Writing to dev = 0x%04x, block = %u, "
|
"block_offset = %u, block * BLOCK_SIZE + offset = %u\n",
|
"block_offset = %u, block * BLOCK_SIZE + offset = %u\n",
|
dev, block, block_offset, new_node->fm->offset));
|
dev, block, block_offset, new_node->fm->offset));
|
|
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
D(printk("jffs_rewrite_data(): Failed to read block.\n"));
|
D(printk("jffs_rewrite_data(): Failed to read block.\n"));
|
kfree(new_node->fm);
|
kfree(new_node->fm);
|
DJM(no_jffs_fm--);
|
DJM(no_jffs_fm--);
|
kfree(new_node);
|
kfree(new_node);
|
DJM(no_jffs_node--);
|
DJM(no_jffs_node--);
|
return -1;
|
return -1;
|
}
|
}
|
|
|
/* Write the raw_inode to the flash. */
|
/* Write the raw_inode to the flash. */
|
if (BLOCK_SIZE - block_offset < sizeof(struct jffs_raw_inode)) {
|
if (BLOCK_SIZE - block_offset < sizeof(struct jffs_raw_inode)) {
|
/* Too little space left on this block. */
|
/* Too little space left on this block. */
|
write_size = BLOCK_SIZE - block_offset;
|
write_size = BLOCK_SIZE - block_offset;
|
memcpy(&bh->b_data[block_offset], &raw_inode, write_size);
|
memcpy(&bh->b_data[block_offset], &raw_inode, write_size);
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
memcpy(bh->b_data, (void *)&raw_inode + write_size,
|
memcpy(bh->b_data, (void *)&raw_inode + write_size,
|
sizeof(struct jffs_raw_inode) - write_size);
|
sizeof(struct jffs_raw_inode) - write_size);
|
block_offset = sizeof(struct jffs_raw_inode) - write_size;
|
block_offset = sizeof(struct jffs_raw_inode) - write_size;
|
pos_chksum = (block_offset - 4);
|
pos_chksum = (block_offset - 4);
|
block_chksum = block;
|
block_chksum = block;
|
}
|
}
|
else {
|
else {
|
memcpy(&bh->b_data[block_offset], &raw_inode,
|
memcpy(&bh->b_data[block_offset], &raw_inode,
|
sizeof(struct jffs_raw_inode));
|
sizeof(struct jffs_raw_inode));
|
block_offset += sizeof(struct jffs_raw_inode);
|
block_offset += sizeof(struct jffs_raw_inode);
|
pos_chksum = (block_offset - 4);
|
pos_chksum = (block_offset - 4);
|
block_chksum = block;
|
block_chksum = block;
|
if (block_offset == BLOCK_SIZE) {
|
if (block_offset == BLOCK_SIZE) {
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = 0;
|
bh = 0;
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
}
|
}
|
|
|
if (!bh && (f->nsize || size)) {
|
if (!bh && (f->nsize || size)) {
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
}
|
}
|
|
|
/* Write the name to the flash memory. */
|
/* Write the name to the flash memory. */
|
if (f->nsize) {
|
if (f->nsize) {
|
if (BLOCK_SIZE - block_offset < f->nsize) {
|
if (BLOCK_SIZE - block_offset < f->nsize) {
|
write_size = BLOCK_SIZE - block_offset;
|
write_size = BLOCK_SIZE - block_offset;
|
memcpy(&bh->b_data[block_offset], f->name, write_size);
|
memcpy(&bh->b_data[block_offset], f->name, write_size);
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
memcpy(bh->b_data, &f->name[write_size],
|
memcpy(bh->b_data, &f->name[write_size],
|
f->nsize - write_size);
|
f->nsize - write_size);
|
block_offset = f->nsize - write_size;
|
block_offset = f->nsize - write_size;
|
}
|
}
|
else {
|
else {
|
memcpy(&bh->b_data[block_offset], f->name, f->nsize);
|
memcpy(&bh->b_data[block_offset], f->name, f->nsize);
|
block_offset += f->nsize;
|
block_offset += f->nsize;
|
if (block_offset == BLOCK_SIZE) {
|
if (block_offset == BLOCK_SIZE) {
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = 0;
|
bh = 0;
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
}
|
}
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
block_offset += JFFS_GET_PAD_BYTES(block_offset);
|
chksum += jffs_checksum(f->name, f->nsize);
|
chksum += jffs_checksum(f->name, f->nsize);
|
}
|
}
|
|
|
if (!bh && size) {
|
if (!bh && size) {
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
}
|
}
|
|
|
/* Write the data. */
|
/* Write the data. */
|
while (copied_data < size) {
|
while (copied_data < size) {
|
int r;
|
int r;
|
D(printk("jffs_rewrite_data(): copied_data = %u, "
|
D(printk("jffs_rewrite_data(): copied_data = %u, "
|
"block_offset = %u\n",
|
"block_offset = %u\n",
|
copied_data, block_offset));
|
copied_data, block_offset));
|
if (block_offset == BLOCK_SIZE) {
|
if (block_offset == BLOCK_SIZE) {
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
bh = jffs_get_write_buffer(dev, ++block);
|
bh = jffs_get_write_buffer(dev, ++block);
|
block_offset = 0;
|
block_offset = 0;
|
}
|
}
|
write_size = jffs_min(size - copied_data,
|
write_size = jffs_min(size - copied_data,
|
BLOCK_SIZE - block_offset);
|
BLOCK_SIZE - block_offset);
|
if ((r = jffs_read_data(f, &bh->b_data[block_offset], copied_data,
|
if ((r = jffs_read_data(f, &bh->b_data[block_offset], copied_data,
|
write_size)) < write_size) {
|
write_size)) < write_size) {
|
D(printk("jffs_rewrite_data(): jffs_read_data() "
|
D(printk("jffs_rewrite_data(): jffs_read_data() "
|
"failed! (r = %d)\n", r));
|
"failed! (r = %d)\n", r));
|
brelse(bh);
|
brelse(bh);
|
return -1;
|
return -1;
|
}
|
}
|
chksum += jffs_checksum(&bh->b_data[block_offset], write_size);
|
chksum += jffs_checksum(&bh->b_data[block_offset], write_size);
|
block_offset += r;
|
block_offset += r;
|
copied_data += r;
|
copied_data += r;
|
}
|
}
|
|
|
if (bh) {
|
if (bh) {
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
}
|
}
|
|
|
/* Add the checksum. */
|
/* Add the checksum. */
|
if (!(bh = jffs_get_write_buffer(dev, block_chksum))) {
|
if (!(bh = jffs_get_write_buffer(dev, block_chksum))) {
|
D(printk("jffs_rewrite_data(): Failed to read "
|
D(printk("jffs_rewrite_data(): Failed to read "
|
"chksum block. (%u)\n", block_chksum));
|
"chksum block. (%u)\n", block_chksum));
|
return -1;
|
return -1;
|
}
|
}
|
*(__u32 *)&bh->b_data[pos_chksum] = chksum;
|
*(__u32 *)&bh->b_data[pos_chksum] = chksum;
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
D(printk("jffs_rewrite_data(): Added chksum 0x%08x.\n", chksum));
|
D(printk("jffs_rewrite_data(): Added chksum 0x%08x.\n", chksum));
|
|
|
/* Now make the file system aware of the newly written node. */
|
/* Now make the file system aware of the newly written node. */
|
jffs_insert_node(f->c, f, &raw_inode, 0, new_node);
|
jffs_insert_node(f->c, f, &raw_inode, 0, new_node);
|
|
|
D(printk("jffs_rewrite_data(): Leaving...\n"));
|
D(printk("jffs_rewrite_data(): Leaving...\n"));
|
return 0;
|
return 0;
|
} /* jffs_rewrite_data() */
|
} /* jffs_rewrite_data() */
|
|
|
#endif
|
#endif
|
|
|
|
|
int
|
int
|
jffs_garbage_collect_next(struct jffs_control *c)
|
jffs_garbage_collect_next(struct jffs_control *c)
|
{
|
{
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_node *node;
|
struct jffs_node *node;
|
struct jffs_file *f;
|
struct jffs_file *f;
|
int size;
|
int size;
|
int free_size = fmc->flash_size - (fmc->used_size + fmc->dirty_size);
|
int free_size = fmc->flash_size - (fmc->used_size + fmc->dirty_size);
|
__u32 free_chunk_size1 = jffs_free_size1(fmc);
|
__u32 free_chunk_size1 = jffs_free_size1(fmc);
|
D2(__u32 free_chunk_size2 = jffs_free_size2(fmc));
|
D2(__u32 free_chunk_size2 = jffs_free_size2(fmc));
|
|
|
/* Get the oldest node in the flash. */
|
/* Get the oldest node in the flash. */
|
node = jffs_get_oldest_node(fmc);
|
node = jffs_get_oldest_node(fmc);
|
ASSERT(if (!node) {
|
ASSERT(if (!node) {
|
printk(KERN_ERR "JFFS: No oldest node!\n");
|
printk(KERN_ERR "JFFS: No oldest node!\n");
|
return -1;
|
return -1;
|
});
|
});
|
|
|
/* Find its corresponding file too. */
|
/* Find its corresponding file too. */
|
f = jffs_find_file(c, node->ino);
|
f = jffs_find_file(c, node->ino);
|
ASSERT(if (!f) {
|
ASSERT(if (!f) {
|
printk(KERN_ERR "JFFS: No file to garbage collect! "
|
printk(KERN_ERR "JFFS: No file to garbage collect! "
|
"ino = 0x%08x\n", node->ino);
|
"ino = 0x%08x\n", node->ino);
|
return -1;
|
return -1;
|
});
|
});
|
|
|
D1(printk("jffs_garbage_collect_next(): \"%s\", "
|
D1(printk("jffs_garbage_collect_next(): \"%s\", "
|
"ino: %u, version: %u\n",
|
"ino: %u, version: %u\n",
|
(f->name ? f->name : ""), node->ino, node->version));
|
(f->name ? f->name : ""), node->ino, node->version));
|
|
|
/* Compute how much we want to rewrite at the moment. */
|
/* Compute how much we want to rewrite at the moment. */
|
size = sizeof(struct jffs_raw_inode) + f->nsize
|
size = sizeof(struct jffs_raw_inode) + f->nsize
|
+ f->size - node->data_offset;
|
+ f->size - node->data_offset;
|
D2(printk(" size: %u\n", size));
|
D2(printk(" size: %u\n", size));
|
D2(printk(" f->nsize: %u\n", f->nsize));
|
D2(printk(" f->nsize: %u\n", f->nsize));
|
D2(printk(" f->size: %u\n", f->size));
|
D2(printk(" f->size: %u\n", f->size));
|
D2(printk(" free_chunk_size1: %u\n", free_chunk_size1));
|
D2(printk(" free_chunk_size1: %u\n", free_chunk_size1));
|
D2(printk(" free_chunk_size2: %u\n", free_chunk_size2));
|
D2(printk(" free_chunk_size2: %u\n", free_chunk_size2));
|
if (size > fmc->max_chunk_size) {
|
if (size > fmc->max_chunk_size) {
|
size = fmc->max_chunk_size;
|
size = fmc->max_chunk_size;
|
}
|
}
|
if (size > free_chunk_size1) {
|
if (size > free_chunk_size1) {
|
|
|
if (free_chunk_size1 <
|
if (free_chunk_size1 <
|
(sizeof(struct jffs_raw_inode) + f->nsize + BLOCK_SIZE)) {
|
(sizeof(struct jffs_raw_inode) + f->nsize + BLOCK_SIZE)) {
|
/* The space left is too small to be of any
|
/* The space left is too small to be of any
|
use really. */
|
use really. */
|
struct jffs_fm *dirty_fm
|
struct jffs_fm *dirty_fm
|
= jffs_fmalloced(fmc,
|
= jffs_fmalloced(fmc,
|
fmc->tail->offset + fmc->tail->size,
|
fmc->tail->offset + fmc->tail->size,
|
free_chunk_size1, NULL);
|
free_chunk_size1, NULL);
|
if (dirty_fm) {
|
if (dirty_fm) {
|
return -1;
|
return -1;
|
}
|
}
|
jffs_write_dummy_node(c, dirty_fm);
|
jffs_write_dummy_node(c, dirty_fm);
|
goto jffs_garbage_collect_next_end;
|
goto jffs_garbage_collect_next_end;
|
}
|
}
|
|
|
size = free_chunk_size1;
|
size = free_chunk_size1;
|
}
|
}
|
|
|
D2(printk(" size: %u (again)\n", size));
|
D2(printk(" size: %u (again)\n", size));
|
|
|
if (free_size - size < fmc->sector_size) {
|
if (free_size - size < fmc->sector_size) {
|
/* Just rewrite that node (or even less). */
|
/* Just rewrite that node (or even less). */
|
size -= (sizeof(struct jffs_raw_inode) + f->nsize);
|
size -= (sizeof(struct jffs_raw_inode) + f->nsize);
|
jffs_rewrite_data(f, node, jffs_min(node->data_size, size));
|
jffs_rewrite_data(f, node, jffs_min(node->data_size, size));
|
}
|
}
|
else {
|
else {
|
size -= (sizeof(struct jffs_raw_inode) + f->nsize);
|
size -= (sizeof(struct jffs_raw_inode) + f->nsize);
|
jffs_rewrite_data(f, node, size);
|
jffs_rewrite_data(f, node, size);
|
}
|
}
|
|
|
jffs_garbage_collect_next_end:
|
jffs_garbage_collect_next_end:
|
D3(printk("jffs_garbage_collect_next(): Leaving...\n"));
|
D3(printk("jffs_garbage_collect_next(): Leaving...\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
|
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
#if defined(JFFS_FLASH_SHORTCUT) && JFFS_FLASH_SHORTCUT
|
|
|
/* If an obsolete node is partly going to be erased due to garbage
|
/* If an obsolete node is partly going to be erased due to garbage
|
collection, the part that isn't going to be erased must be filled
|
collection, the part that isn't going to be erased must be filled
|
with zeroes so that the scan of the flash will work smoothly next
|
with zeroes so that the scan of the flash will work smoothly next
|
time.
|
time.
|
There are two phases in this procedure: First, the clearing of
|
There are two phases in this procedure: First, the clearing of
|
the name and data parts of the node. Second, possibly also clearing
|
the name and data parts of the node. Second, possibly also clearing
|
a part of the raw inode as well. If the box is power cycled during
|
a part of the raw inode as well. If the box is power cycled during
|
the first phase, only the checksum of this node-to-be-cleared-at-
|
the first phase, only the checksum of this node-to-be-cleared-at-
|
the-end will be wrong. If the box is power cycled during, or after,
|
the-end will be wrong. If the box is power cycled during, or after,
|
the clearing of the raw inode, the information like the length of
|
the clearing of the raw inode, the information like the length of
|
the name and data parts are zeroed. The next time the box is
|
the name and data parts are zeroed. The next time the box is
|
powered up, the scanning algorithm manages this faulty data too
|
powered up, the scanning algorithm manages this faulty data too
|
because:
|
because:
|
|
|
- The checksum is invalid and thus the raw inode must be discarded
|
- The checksum is invalid and thus the raw inode must be discarded
|
in any case.
|
in any case.
|
- If the lengths of the data part or the name part are zeroed, the
|
- If the lengths of the data part or the name part are zeroed, the
|
scanning just continues after the raw inode. But after the inode
|
scanning just continues after the raw inode. But after the inode
|
the scanning procedure just finds zeroes which is the same as
|
the scanning procedure just finds zeroes which is the same as
|
dirt.
|
dirt.
|
|
|
So, in the end, this could never fail. :-) Even if it does fail,
|
So, in the end, this could never fail. :-) Even if it does fail,
|
the scanning algorithm should manage that too. */
|
the scanning algorithm should manage that too. */
|
|
|
static int
|
static int
|
jffs_clear_end_of_node(struct jffs_control *c, __u32 erase_size)
|
jffs_clear_end_of_node(struct jffs_control *c, __u32 erase_size)
|
{
|
{
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
__u32 zero_offset;
|
__u32 zero_offset;
|
__u32 zero_size;
|
__u32 zero_size;
|
__u32 zero_offset_data;
|
__u32 zero_offset_data;
|
__u32 zero_size_data;
|
__u32 zero_size_data;
|
__u32 cutting_raw_inode = 0;
|
__u32 cutting_raw_inode = 0;
|
|
|
if (!(fm = jffs_cut_node(fmc, erase_size))) {
|
if (!(fm = jffs_cut_node(fmc, erase_size))) {
|
D3(printk("jffs_clear_end_of_node(): fm == NULL\n"));
|
D3(printk("jffs_clear_end_of_node(): fm == NULL\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* Where and how much shall we clear? */
|
/* Where and how much shall we clear? */
|
zero_offset = fmc->head->offset + erase_size;
|
zero_offset = fmc->head->offset + erase_size;
|
zero_size = fm->offset + fm->size - zero_offset;
|
zero_size = fm->offset + fm->size - zero_offset;
|
|
|
/* Do we have to clear the raw_inode explicitly? */
|
/* Do we have to clear the raw_inode explicitly? */
|
if (fm->size - zero_size < sizeof(struct jffs_raw_inode)) {
|
if (fm->size - zero_size < sizeof(struct jffs_raw_inode)) {
|
cutting_raw_inode = sizeof(struct jffs_raw_inode)
|
cutting_raw_inode = sizeof(struct jffs_raw_inode)
|
- (fm->size - zero_size);
|
- (fm->size - zero_size);
|
}
|
}
|
|
|
/* First, clear the name and data fields. */
|
/* First, clear the name and data fields. */
|
zero_offset_data = zero_offset + cutting_raw_inode;
|
zero_offset_data = zero_offset + cutting_raw_inode;
|
zero_size_data = zero_size - cutting_raw_inode;
|
zero_size_data = zero_size - cutting_raw_inode;
|
flash_safe_acquire(fmc->flash_part);
|
flash_safe_acquire(fmc->flash_part);
|
flash_memset((unsigned char *) zero_offset_data, 0, zero_size_data);
|
flash_memset((unsigned char *) zero_offset_data, 0, zero_size_data);
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
|
|
/* Should we clear a part of the raw inode? */
|
/* Should we clear a part of the raw inode? */
|
if (cutting_raw_inode) {
|
if (cutting_raw_inode) {
|
/* I guess it is ok to clear the raw inode in this order. */
|
/* I guess it is ok to clear the raw inode in this order. */
|
flash_safe_acquire(fmc->flash_part);
|
flash_safe_acquire(fmc->flash_part);
|
flash_memset((unsigned char *) zero_offset, 0,
|
flash_memset((unsigned char *) zero_offset, 0,
|
cutting_raw_inode);
|
cutting_raw_inode);
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
}
|
}
|
|
|
return 0;
|
return 0;
|
} /* jffs_clear_end_of_node() */
|
} /* jffs_clear_end_of_node() */
|
|
|
#else
|
#else
|
|
|
static int
|
static int
|
jffs_clear_end_of_node(struct jffs_control *c, __u32 erase_size)
|
jffs_clear_end_of_node(struct jffs_control *c, __u32 erase_size)
|
{
|
{
|
struct jffs_fm *fm;
|
struct jffs_fm *fm;
|
__u32 zero_offset;
|
__u32 zero_offset;
|
__u32 zero_size;
|
__u32 zero_size;
|
__u32 first_block;
|
__u32 first_block;
|
__u32 last_block;
|
__u32 last_block;
|
__u32 block_offset;
|
__u32 block_offset;
|
__u32 block_clear_size;
|
__u32 block_clear_size;
|
__u32 block;
|
__u32 block;
|
int cutting_raw_inode = 0;
|
int cutting_raw_inode = 0;
|
struct buffer_head *bh;
|
struct buffer_head *bh;
|
kdev_t dev;
|
kdev_t dev;
|
|
|
if (!(fm = jffs_cut_node(c->fmc, erase_size))) {
|
if (!(fm = jffs_cut_node(c->fmc, erase_size))) {
|
D(printk("jffs_clear_end_of_node(): fm == NULL\n"));
|
D(printk("jffs_clear_end_of_node(): fm == NULL\n"));
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/* It is necessary to write zeroes to the flash.
|
/* It is necessary to write zeroes to the flash.
|
Find out where and how much to write. */
|
Find out where and how much to write. */
|
zero_offset = c->fmc->head->offset + erase_size;
|
zero_offset = c->fmc->head->offset + erase_size;
|
zero_size = fm->offset + fm->size - zero_offset;
|
zero_size = fm->offset + fm->size - zero_offset;
|
/* Do we have to clear the raw_inode explicitly? */
|
/* Do we have to clear the raw_inode explicitly? */
|
if (fm->size - zero_size < sizeof(struct jffs_raw_inode)) {
|
if (fm->size - zero_size < sizeof(struct jffs_raw_inode)) {
|
cutting_raw_inode = sizeof(struct jffs_raw_inode)
|
cutting_raw_inode = sizeof(struct jffs_raw_inode)
|
- (fm->size - zero_size);
|
- (fm->size - zero_size);
|
}
|
}
|
/* The last block of non-raw inode data should be
|
/* The last block of non-raw inode data should be
|
cleared first. */
|
cleared first. */
|
first_block = zero_offset / BLOCK_SIZE;
|
first_block = zero_offset / BLOCK_SIZE;
|
last_block = (zero_offset + zero_size) / BLOCK_SIZE;
|
last_block = (zero_offset + zero_size) / BLOCK_SIZE;
|
block_offset = 0;
|
block_offset = 0;
|
block_clear_size = (zero_offset + zero_size)
|
block_clear_size = (zero_offset + zero_size)
|
- last_block * BLOCK_SIZE;
|
- last_block * BLOCK_SIZE;
|
dev = c->sb->s_dev;
|
dev = c->sb->s_dev;
|
|
|
D3(printk("jffs_clear_end_of_node(): zero_offset: 0x%08x\n", zero_offset));
|
D3(printk("jffs_clear_end_of_node(): zero_offset: 0x%08x\n", zero_offset));
|
D3(printk("jffs_clear_end_of_node(): zero_size: 0x%08x\n", zero_size));
|
D3(printk("jffs_clear_end_of_node(): zero_size: 0x%08x\n", zero_size));
|
D3(printk("jffs_clear_end_of_node(): first_block: 0x%08x\n", first_block));
|
D3(printk("jffs_clear_end_of_node(): first_block: 0x%08x\n", first_block));
|
D3(printk("jffs_clear_end_of_node(): last_block: 0x%08x\n", last_block));
|
D3(printk("jffs_clear_end_of_node(): last_block: 0x%08x\n", last_block));
|
D3(printk("jffs_clear_end_of_node(): block_offset: 0x%08x\n", block_offset));
|
D3(printk("jffs_clear_end_of_node(): block_offset: 0x%08x\n", block_offset));
|
D3(printk("jffs_clear_end_of_node(): block_clear_size: 0x%08x\n", block_clear_size));
|
D3(printk("jffs_clear_end_of_node(): block_clear_size: 0x%08x\n", block_clear_size));
|
|
|
/* Fill the flash memory with zeroes. */
|
/* Fill the flash memory with zeroes. */
|
for (block = last_block;
|
for (block = last_block;
|
block >= first_block; block--) {
|
block >= first_block; block--) {
|
if (block == first_block) {
|
if (block == first_block) {
|
block_offset = cutting_raw_inode;
|
block_offset = cutting_raw_inode;
|
block_clear_size -= cutting_raw_inode;
|
block_clear_size -= cutting_raw_inode;
|
}
|
}
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
if (!(bh = jffs_get_write_buffer(dev, block))) {
|
D(printk("jffs_clear_end_of_node(): "
|
D(printk("jffs_clear_end_of_node(): "
|
"Failed to get buffer!\n"));
|
"Failed to get buffer!\n"));
|
return -1;
|
return -1;
|
}
|
}
|
memset(&bh->b_data[block_offset], 0, block_clear_size);
|
memset(&bh->b_data[block_offset], 0, block_clear_size);
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
block_clear_size = BLOCK_SIZE;
|
block_clear_size = BLOCK_SIZE;
|
}
|
}
|
|
|
if (cutting_raw_inode) {
|
if (cutting_raw_inode) {
|
if (!(bh = jffs_get_write_buffer(dev, first_block))) {
|
if (!(bh = jffs_get_write_buffer(dev, first_block))) {
|
D(printk("jffs_clear_end_of_node(): Failed to "
|
D(printk("jffs_clear_end_of_node(): Failed to "
|
"get first buffer!\n"));
|
"get first buffer!\n"));
|
return -1;
|
return -1;
|
}
|
}
|
memset(bh->b_data, 0, cutting_raw_inode);
|
memset(bh->b_data, 0, cutting_raw_inode);
|
jffs_put_write_buffer(bh);
|
jffs_put_write_buffer(bh);
|
}
|
}
|
|
|
return 0;
|
return 0;
|
} /* jffs_clear_end_of_node() */
|
} /* jffs_clear_end_of_node() */
|
|
|
#endif
|
#endif
|
|
|
|
|
/* Try to erase as much as possible of the dirt in the flash memory. */
|
/* Try to erase as much as possible of the dirt in the flash memory. */
|
long
|
long
|
jffs_try_to_erase(struct jffs_control *c)
|
jffs_try_to_erase(struct jffs_control *c)
|
{
|
{
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
long erase_size;
|
long erase_size;
|
int err;
|
int err;
|
__u32 offset;
|
__u32 offset;
|
|
|
D3(printk("jffs_try_to_erase()\n"));
|
D3(printk("jffs_try_to_erase()\n"));
|
|
|
erase_size = jffs_erasable_size(fmc);
|
erase_size = jffs_erasable_size(fmc);
|
|
|
D2(printk("jffs_try_to_erase(): erase_size = %ld\n", erase_size));
|
D2(printk("jffs_try_to_erase(): erase_size = %ld\n", erase_size));
|
|
|
if (erase_size <= 0) {
|
if (erase_size <= 0) {
|
return erase_size;
|
return erase_size;
|
}
|
}
|
|
|
if (jffs_clear_end_of_node(c, erase_size) < 0) {
|
if (jffs_clear_end_of_node(c, erase_size) < 0) {
|
printk(KERN_ERR "JFFS: Clearing of node failed.\n");
|
printk(KERN_ERR "JFFS: Clearing of node failed.\n");
|
return -1;
|
return -1;
|
}
|
}
|
|
|
offset = fmc->head->offset - fmc->flash_start;
|
offset = fmc->head->offset - fmc->flash_start;
|
|
|
/* Now, let's try to do the erase. */
|
/* Now, let's try to do the erase. */
|
if ((err = flash_erase_region(c->sb->s_dev,
|
if ((err = flash_erase_region(c->sb->s_dev,
|
offset, erase_size)) < 0) {
|
offset, erase_size)) < 0) {
|
printk(KERN_ERR "JFFS: Erase of flash failed. "
|
printk(KERN_ERR "JFFS: Erase of flash failed. "
|
"offset = %u, erase_size = %ld\n",
|
"offset = %u, erase_size = %ld\n",
|
offset, erase_size);
|
offset, erase_size);
|
/* XXX: Here we should allocate this area as dirty
|
/* XXX: Here we should allocate this area as dirty
|
with jffs_fmalloced or something similar. Now
|
with jffs_fmalloced or something similar. Now
|
we just report the error. */
|
we just report the error. */
|
return err;
|
return err;
|
}
|
}
|
|
|
#if 0
|
#if 0
|
/* Check if the erased sectors really got erased. */
|
/* Check if the erased sectors really got erased. */
|
{
|
{
|
__u32 pos;
|
__u32 pos;
|
__u32 end;
|
__u32 end;
|
|
|
pos = (__u32)flash_get_direct_pointer(c->sb->s_dev, offset);
|
pos = (__u32)flash_get_direct_pointer(c->sb->s_dev, offset);
|
end = pos + erase_size;
|
end = pos + erase_size;
|
|
|
D2(printk("JFFS: Checking erased sector(s)...\n"));
|
D2(printk("JFFS: Checking erased sector(s)...\n"));
|
|
|
flash_safe_acquire(fmc->flash_part);
|
flash_safe_acquire(fmc->flash_part);
|
|
|
for (; pos < end; pos += 4) {
|
for (; pos < end; pos += 4) {
|
if (*(__u32 *)pos != JFFS_EMPTY_BITMASK) {
|
if (*(__u32 *)pos != JFFS_EMPTY_BITMASK) {
|
printk("JFFS: Erase failed! pos = 0x%p\n",
|
printk("JFFS: Erase failed! pos = 0x%p\n",
|
(unsigned char *)pos);
|
(unsigned char *)pos);
|
jffs_hexdump((unsigned char *)pos,
|
jffs_hexdump((unsigned char *)pos,
|
jffs_min(256, end - pos));
|
jffs_min(256, end - pos));
|
err = -1;
|
err = -1;
|
break;
|
break;
|
}
|
}
|
}
|
}
|
|
|
flash_safe_release(fmc->flash_part);
|
flash_safe_release(fmc->flash_part);
|
|
|
if (!err) {
|
if (!err) {
|
D2(printk("JFFS: Erase succeeded.\n"));
|
D2(printk("JFFS: Erase succeeded.\n"));
|
}
|
}
|
else {
|
else {
|
/* XXX: Here we should allocate the memory
|
/* XXX: Here we should allocate the memory
|
with jffs_fmalloced() in order to prevent
|
with jffs_fmalloced() in order to prevent
|
JFFS from using this area accidentally. */
|
JFFS from using this area accidentally. */
|
return err;
|
return err;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Update the flash memory data structures. */
|
/* Update the flash memory data structures. */
|
jffs_sync_erase(fmc, erase_size);
|
jffs_sync_erase(fmc, erase_size);
|
|
|
return erase_size;
|
return erase_size;
|
}
|
}
|
|
|
|
|
/* There are different criteria that should trigger a garbage collect:
|
/* There are different criteria that should trigger a garbage collect:
|
1. There is too much dirt in the memory.
|
1. There is too much dirt in the memory.
|
2. The free space is becoming small.
|
2. The free space is becoming small.
|
3. There are many versions of a node.
|
3. There are many versions of a node.
|
|
|
The garbage collect should always be done in a manner that guarantees
|
The garbage collect should always be done in a manner that guarantees
|
that future garbage collects cannot be locked. E.g. Rewritten chunks
|
that future garbage collects cannot be locked. E.g. Rewritten chunks
|
should not be too large (span more than one sector in the flash memory
|
should not be too large (span more than one sector in the flash memory
|
for exemple). Of course there is a limit on how intelligent this garbage
|
for exemple). Of course there is a limit on how intelligent this garbage
|
collection can be. */
|
collection can be. */
|
int
|
int
|
jffs_garbage_collect(struct jffs_control *c)
|
jffs_garbage_collect(struct jffs_control *c)
|
{
|
{
|
struct jffs_fmcontrol *fmc = c->fmc;
|
struct jffs_fmcontrol *fmc = c->fmc;
|
long erased_total = 0;
|
long erased_total = 0;
|
long erased;
|
long erased;
|
int result = 0;
|
int result = 0;
|
D1(int i = 1);
|
D1(int i = 1);
|
|
|
D2(printk("***jffs_garbage_collect(): fmc->dirty_size = %u\n",
|
D2(printk("***jffs_garbage_collect(): fmc->dirty_size = %u\n",
|
fmc->dirty_size));
|
fmc->dirty_size));
|
D2(jffs_print_fmcontrol(fmc));
|
D2(jffs_print_fmcontrol(fmc));
|
|
|
c->fmc->no_call_gc = 1;
|
c->fmc->no_call_gc = 1;
|
|
|
/* While there is too much dirt left and it is possible
|
/* While there is too much dirt left and it is possible
|
to garbage collect, do so. */
|
to garbage collect, do so. */
|
|
|
while (fmc->dirty_size >= fmc->sector_size) {
|
while (fmc->dirty_size >= fmc->sector_size) {
|
|
|
D1(printk("***jffs_garbage_collect(): round #%u, "
|
D1(printk("***jffs_garbage_collect(): round #%u, "
|
"fmc->dirty_size = %u\n", i++, fmc->dirty_size));
|
"fmc->dirty_size = %u\n", i++, fmc->dirty_size));
|
D2(jffs_print_fmcontrol(fmc));
|
D2(jffs_print_fmcontrol(fmc));
|
|
|
/* At least one sector should be able to free now. */
|
/* At least one sector should be able to free now. */
|
if ((erased = jffs_try_to_erase(c)) < 0) {
|
if ((erased = jffs_try_to_erase(c)) < 0) {
|
printk(KERN_WARNING "JFFS: Error in "
|
printk(KERN_WARNING "JFFS: Error in "
|
"garbage collector.\n");
|
"garbage collector.\n");
|
result = erased;
|
result = erased;
|
goto gc_end;
|
goto gc_end;
|
}
|
}
|
else if (erased == 0) {
|
else if (erased == 0) {
|
__u32 free_size = fmc->flash_size
|
__u32 free_size = fmc->flash_size
|
- (fmc->used_size
|
- (fmc->used_size
|
+ fmc->dirty_size);
|
+ fmc->dirty_size);
|
|
|
if (free_size > 0) {
|
if (free_size > 0) {
|
/* Let's dare to make a garbage collect. */
|
/* Let's dare to make a garbage collect. */
|
if ((result = jffs_garbage_collect_next(c))
|
if ((result = jffs_garbage_collect_next(c))
|
< 0) {
|
< 0) {
|
printk(KERN_ERR "JFFS: Something "
|
printk(KERN_ERR "JFFS: Something "
|
"has gone seriously wrong "
|
"has gone seriously wrong "
|
"with a garbage collect.\n");
|
"with a garbage collect.\n");
|
goto gc_end;
|
goto gc_end;
|
}
|
}
|
}
|
}
|
else {
|
else {
|
/* What should we do here? */
|
/* What should we do here? */
|
D(printk(" jffs_garbage_collect(): "
|
D(printk(" jffs_garbage_collect(): "
|
"erased: %ld, free_size: %u\n",
|
"erased: %ld, free_size: %u\n",
|
erased, free_size));
|
erased, free_size));
|
result = -1;
|
result = -1;
|
goto gc_end;
|
goto gc_end;
|
}
|
}
|
}
|
}
|
|
|
D1(printk(" jffs_garbage_collect(): erased: %ld\n", erased));
|
D1(printk(" jffs_garbage_collect(): erased: %ld\n", erased));
|
erased_total += erased;
|
erased_total += erased;
|
DJM(jffs_print_memory_allocation_statistics());
|
DJM(jffs_print_memory_allocation_statistics());
|
}
|
}
|
|
|
|
|
gc_end:
|
gc_end:
|
c->fmc->no_call_gc = 0;
|
c->fmc->no_call_gc = 0;
|
|
|
D3(printk(" jffs_garbage_collect(): Leaving...\n"));
|
D3(printk(" jffs_garbage_collect(): Leaving...\n"));
|
D1(if (erased_total) {
|
D1(if (erased_total) {
|
printk("erased_total = %ld\n", erased_total);
|
printk("erased_total = %ld\n", erased_total);
|
jffs_print_fmcontrol(fmc);
|
jffs_print_fmcontrol(fmc);
|
});
|
});
|
return result;
|
return result;
|
}
|
}
|
|
|
