blob: b16c60bbcf6ed191d1ab2c08f75fe0b9dded1ec5 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * JFFS2 -- Journalling Flash File System, Version 2.
3 *
4 * Copyright (C) 2001-2003 Red Hat, Inc.
5 *
6 * Created by David Woodhouse <dwmw2@infradead.org>
7 *
8 * For licensing information, see the file 'LICENCE' in this directory.
9 *
Ferenc Havasie631ddb2005-09-07 09:35:26 +010010 * $Id: nodelist.h,v 1.140 2005/09/07 08:34:54 havasi Exp $
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 *
12 */
13
14#ifndef __JFFS2_NODELIST_H__
15#define __JFFS2_NODELIST_H__
16
17#include <linux/config.h>
18#include <linux/fs.h>
19#include <linux/types.h>
20#include <linux/jffs2.h>
David Woodhousecbb9a562006-05-03 13:07:27 +010021#include "jffs2_fs_sb.h"
22#include "jffs2_fs_i.h"
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +090023#include "xattr.h"
24#include "acl.h"
Ferenc Havasie631ddb2005-09-07 09:35:26 +010025#include "summary.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
27#ifdef __ECOS
28#include "os-ecos.h"
29#else
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +010030#include <linux/mtd/compatmac.h> /* For compatibility with older kernels */
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include "os-linux.h"
32#endif
33
Linus Torvalds1da177e2005-04-16 15:20:36 -070034#define JFFS2_NATIVE_ENDIAN
35
36/* Note we handle mode bits conversion from JFFS2 (i.e. Linux) to/from
37 whatever OS we're actually running on here too. */
38
39#if defined(JFFS2_NATIVE_ENDIAN)
40#define cpu_to_je16(x) ((jint16_t){x})
41#define cpu_to_je32(x) ((jint32_t){x})
42#define cpu_to_jemode(x) ((jmode_t){os_to_jffs2_mode(x)})
43
44#define je16_to_cpu(x) ((x).v16)
45#define je32_to_cpu(x) ((x).v32)
46#define jemode_to_cpu(x) (jffs2_to_os_mode((x).m))
47#elif defined(JFFS2_BIG_ENDIAN)
48#define cpu_to_je16(x) ((jint16_t){cpu_to_be16(x)})
49#define cpu_to_je32(x) ((jint32_t){cpu_to_be32(x)})
50#define cpu_to_jemode(x) ((jmode_t){cpu_to_be32(os_to_jffs2_mode(x))})
51
52#define je16_to_cpu(x) (be16_to_cpu(x.v16))
53#define je32_to_cpu(x) (be32_to_cpu(x.v32))
54#define jemode_to_cpu(x) (be32_to_cpu(jffs2_to_os_mode((x).m)))
55#elif defined(JFFS2_LITTLE_ENDIAN)
56#define cpu_to_je16(x) ((jint16_t){cpu_to_le16(x)})
57#define cpu_to_je32(x) ((jint32_t){cpu_to_le32(x)})
58#define cpu_to_jemode(x) ((jmode_t){cpu_to_le32(os_to_jffs2_mode(x))})
59
60#define je16_to_cpu(x) (le16_to_cpu(x.v16))
61#define je32_to_cpu(x) (le32_to_cpu(x.v32))
62#define jemode_to_cpu(x) (le32_to_cpu(jffs2_to_os_mode((x).m)))
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000063#else
Linus Torvalds1da177e2005-04-16 15:20:36 -070064#error wibble
65#endif
66
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +010067/* The minimal node header size */
68#define JFFS2_MIN_NODE_HEADER sizeof(struct jffs2_raw_dirent)
69
Linus Torvalds1da177e2005-04-16 15:20:36 -070070/*
71 This is all we need to keep in-core for each raw node during normal
72 operation. As and when we do read_inode on a particular inode, we can
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000073 scan the nodes which are listed for it and build up a proper map of
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 which nodes are currently valid. JFFSv1 always used to keep that whole
75 map in core for each inode.
76*/
77struct jffs2_raw_node_ref
78{
79 struct jffs2_raw_node_ref *next_in_ino; /* Points to the next raw_node_ref
David Woodhouse987d47b2006-05-22 16:32:05 +010080 for this object. If this _is_ the last, it points to the inode_cache,
81 xattr_ref or xattr_datum instead. The common part of those structures
82 has NULL in the first word. See jffs2_raw_ref_to_ic() below */
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 uint32_t flash_offset;
David Woodhouseca89a512006-05-21 13:29:11 +010084#define TEST_TOTLEN
85#ifdef TEST_TOTLEN
Linus Torvalds1da177e2005-04-16 15:20:36 -070086 uint32_t __totlen; /* This may die; use ref_totlen(c, jeb, ) below */
David Woodhouseca89a512006-05-21 13:29:11 +010087#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070088};
89
David Woodhouse9bfeb692006-05-26 21:19:05 +010090#define REF_LINK_NODE ((int32_t)-1)
91#define REF_EMPTY_NODE ((int32_t)-2)
92
93/* Use blocks of about 256 bytes */
94#define REFS_PER_BLOCK ((255/sizeof(struct jffs2_raw_node_ref))-1)
95
96static inline struct jffs2_raw_node_ref *ref_next(struct jffs2_raw_node_ref *ref)
97{
98 ref++;
99
100 /* Link to another block of refs */
101 if (ref->flash_offset == REF_LINK_NODE) {
102 ref = ref->next_in_ino;
103 if (!ref)
104 return ref;
105 }
106
107 /* End of chain */
108 if (ref->flash_offset == REF_EMPTY_NODE)
109 return NULL;
110
111 return ref;
112}
David Woodhouse99988f72006-05-24 09:04:17 +0100113
David Woodhouse987d47b2006-05-22 16:32:05 +0100114static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw)
115{
David Woodhouse99988f72006-05-24 09:04:17 +0100116 while(raw->next_in_ino)
David Woodhouse987d47b2006-05-22 16:32:05 +0100117 raw = raw->next_in_ino;
David Woodhouse987d47b2006-05-22 16:32:05 +0100118
119 /* NB. This can be a jffs2_xattr_datum or jffs2_xattr_ref and
120 not actually a jffs2_inode_cache. Check ->class */
121 return ((struct jffs2_inode_cache *)raw);
122}
123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 /* flash_offset & 3 always has to be zero, because nodes are
125 always aligned at 4 bytes. So we have a couple of extra bits
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000126 to play with, which indicate the node's status; see below: */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127#define REF_UNCHECKED 0 /* We haven't yet checked the CRC or built its inode */
128#define REF_OBSOLETE 1 /* Obsolete, can be completely ignored */
129#define REF_PRISTINE 2 /* Completely clean. GC without looking */
130#define REF_NORMAL 3 /* Possibly overlapped. Read the page and write again on GC */
131#define ref_flags(ref) ((ref)->flash_offset & 3)
132#define ref_offset(ref) ((ref)->flash_offset & ~3)
133#define ref_obsolete(ref) (((ref)->flash_offset & 3) == REF_OBSOLETE)
134#define mark_ref_normal(ref) do { (ref)->flash_offset = ref_offset(ref) | REF_NORMAL; } while(0)
135
David Woodhouse61715862006-05-21 00:02:06 +0100136/* NB: REF_PRISTINE for an inode-less node (ref->next_in_ino == NULL) indicates
137 it is an unknown node of type JFFS2_NODETYPE_RWCOMPAT_COPY, so it'll get
138 copied. If you need to do anything different to GC inode-less nodes, then
139 you need to modify gc.c accordingly. */
140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141/* For each inode in the filesystem, we need to keep a record of
142 nlink, because it would be a PITA to scan the whole directory tree
143 at read_inode() time to calculate it, and to keep sufficient information
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000144 in the raw_node_ref (basically both parent and child inode number for
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 dirent nodes) would take more space than this does. We also keep
146 a pointer to the first physical node which is part of this inode, too.
147*/
148struct jffs2_inode_cache {
David Woodhouse987d47b2006-05-22 16:32:05 +0100149 /* First part of structure is shared with other objects which
150 can terminate the raw node refs' next_in_ino list -- which
151 currently struct jffs2_xattr_datum and struct jffs2_xattr_ref. */
152
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153 struct jffs2_full_dirent *scan_dents; /* Used during scan to hold
154 temporary lists of dirents, and later must be set to
155 NULL to mark the end of the raw_node_ref->next_in_ino
156 chain. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 struct jffs2_raw_node_ref *nodes;
David Woodhouse987d47b2006-05-22 16:32:05 +0100158 uint8_t class; /* It's used for identification */
159
160 /* end of shared structure */
161
162 uint8_t flags;
163 uint16_t state;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 uint32_t ino;
David Woodhouse987d47b2006-05-22 16:32:05 +0100165 struct jffs2_inode_cache *next;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900166#ifdef CONFIG_JFFS2_FS_XATTR
KaiGai Kohei8f2b6f42006-05-13 15:15:07 +0900167 struct jffs2_xattr_ref *xref;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900168#endif
David Woodhouse987d47b2006-05-22 16:32:05 +0100169 int nlink;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170};
171
172/* Inode states for 'state' above. We need the 'GC' state to prevent
173 someone from doing a read_inode() while we're moving a 'REF_PRISTINE'
174 node without going through all the iget() nonsense */
175#define INO_STATE_UNCHECKED 0 /* CRC checks not yet done */
176#define INO_STATE_CHECKING 1 /* CRC checks in progress */
177#define INO_STATE_PRESENT 2 /* In core */
178#define INO_STATE_CHECKEDABSENT 3 /* Checked, cleared again */
179#define INO_STATE_GC 4 /* GCing a 'pristine' node */
180#define INO_STATE_READING 5 /* In read_inode() */
David Woodhouse67e345d2005-02-27 23:01:36 +0000181#define INO_STATE_CLEARING 6 /* In clear_inode() */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700182
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900183#define INO_FLAGS_XATTR_CHECKED 0x01 /* has no duplicate xattr_ref */
184
185#define RAWNODE_CLASS_INODE_CACHE 0
186#define RAWNODE_CLASS_XATTR_DATUM 1
187#define RAWNODE_CLASS_XATTR_REF 2
188
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189#define INOCACHE_HASHSIZE 128
190
David Woodhouse9fe48542006-05-23 00:38:06 +0100191#define write_ofs(c) ((c)->nextblock->offset + (c)->sector_size - (c)->nextblock->free_size)
192
Linus Torvalds1da177e2005-04-16 15:20:36 -0700193/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000194 Larger representation of a raw node, kept in-core only when the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 struct inode for this particular ino is instantiated.
196*/
197
198struct jffs2_full_dnode
199{
200 struct jffs2_raw_node_ref *raw;
201 uint32_t ofs; /* The offset to which the data of this node belongs */
202 uint32_t size;
203 uint32_t frags; /* Number of fragments which currently refer
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000204 to this node. When this reaches zero,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205 the node is obsolete. */
206};
207
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000208/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209 Even larger representation of a raw node, kept in-core only while
210 we're actually building up the original map of which nodes go where,
211 in read_inode()
212*/
213struct jffs2_tmp_dnode_info
214{
David Woodhouse9dee7502005-07-05 22:03:10 +0100215 struct rb_node rb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216 struct jffs2_full_dnode *fn;
217 uint32_t version;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100218 uint32_t data_crc;
219 uint32_t partial_crc;
220 uint32_t csize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000221};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700222
223struct jffs2_full_dirent
224{
225 struct jffs2_raw_node_ref *raw;
226 struct jffs2_full_dirent *next;
227 uint32_t version;
228 uint32_t ino; /* == zero for unlink */
229 unsigned int nhash;
230 unsigned char type;
231 unsigned char name[0];
232};
233
234/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000235 Fragments - used to build a map of which raw node to obtain
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 data from for each part of the ino
237*/
238struct jffs2_node_frag
239{
240 struct rb_node rb;
241 struct jffs2_full_dnode *node; /* NULL for holes */
242 uint32_t size;
243 uint32_t ofs; /* The offset to which this fragment belongs */
244};
245
246struct jffs2_eraseblock
247{
248 struct list_head list;
249 int bad_count;
250 uint32_t offset; /* of this block in the MTD */
251
252 uint32_t unchecked_size;
253 uint32_t used_size;
254 uint32_t dirty_size;
255 uint32_t wasted_size;
256 uint32_t free_size; /* Note that sector_size - free_size
257 is the address of the first free space */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100258 uint32_t allocated_refs;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 struct jffs2_raw_node_ref *first_node;
260 struct jffs2_raw_node_ref *last_node;
261
262 struct jffs2_raw_node_ref *gc_node; /* Next node to be garbage collected */
263};
264
Ferenc Havasi4ce1f562005-08-31 14:51:04 +0100265static inline int jffs2_blocks_use_vmalloc(struct jffs2_sb_info *c)
266{
267 return ((c->flash_size / c->sector_size) * sizeof (struct jffs2_eraseblock)) > (128 * 1024);
268}
269
David Woodhouseca89a512006-05-21 13:29:11 +0100270#define ref_totlen(a, b, c) __jffs2_ref_totlen((a), (b), (c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272#define ALLOC_NORMAL 0 /* Normal allocation */
273#define ALLOC_DELETION 1 /* Deletion node. Best to allow it */
274#define ALLOC_GC 2 /* Space requested for GC. Give it or die */
275#define ALLOC_NORETRY 3 /* For jffs2_write_dnode: On failure, return -EAGAIN instead of retrying */
276
277/* How much dirty space before it goes on the very_dirty_list */
278#define VERYDIRTY(c, size) ((size) >= ((c)->sector_size / 2))
279
280/* check if dirty space is more than 255 Byte */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000281#define ISDIRTY(size) ((size) > sizeof (struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282
283#define PAD(x) (((x)+3)&~3)
284
David Woodhouseaef9ab42006-05-19 00:28:49 +0100285static inline int jffs2_encode_dev(union jffs2_device_node *jdev, dev_t rdev)
286{
287 if (old_valid_dev(rdev)) {
288 jdev->old = cpu_to_je16(old_encode_dev(rdev));
289 return sizeof(jdev->old);
290 } else {
291 jdev->new = cpu_to_je32(new_encode_dev(rdev));
292 return sizeof(jdev->new);
293 }
294}
295
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296static inline struct jffs2_node_frag *frag_first(struct rb_root *root)
297{
298 struct rb_node *node = root->rb_node;
299
300 if (!node)
301 return NULL;
302 while(node->rb_left)
303 node = node->rb_left;
304 return rb_entry(node, struct jffs2_node_frag, rb);
305}
Artem B. Bityuckiy8557fd52005-04-09 11:47:03 +0100306
307static inline struct jffs2_node_frag *frag_last(struct rb_root *root)
308{
309 struct rb_node *node = root->rb_node;
310
311 if (!node)
312 return NULL;
313 while(node->rb_right)
314 node = node->rb_right;
315 return rb_entry(node, struct jffs2_node_frag, rb);
316}
317
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318#define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
319#define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
320#define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
321#define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
322#define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
323#define frag_erase(frag, list) rb_erase(&frag->rb, list);
324
325/* nodelist.c */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700327void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state);
328struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
329void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new);
330void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old);
331void jffs2_free_ino_caches(struct jffs2_sb_info *c);
332void jffs2_free_raw_node_refs(struct jffs2_sb_info *c);
333struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
334void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335struct rb_node *rb_next(struct rb_node *);
336struct rb_node *rb_prev(struct rb_node *);
337void rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100338void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this);
339int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn);
Artem B. Bityutskiy1e900972005-07-31 09:20:48 +0100340void jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100341int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn);
David Woodhouse2f785402006-05-24 02:04:45 +0100342struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c,
343 struct jffs2_eraseblock *jeb,
344 uint32_t ofs, uint32_t len,
345 struct jffs2_inode_cache *ic);
David Woodhouseca89a512006-05-21 13:29:11 +0100346extern uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c,
347 struct jffs2_eraseblock *jeb,
348 struct jffs2_raw_node_ref *ref);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700349
350/* nodemgmt.c */
351int jffs2_thread_should_wake(struct jffs2_sb_info *c);
David Woodhouse9fe48542006-05-23 00:38:06 +0100352int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100353 uint32_t *len, int prio, uint32_t sumsize);
David Woodhouse9fe48542006-05-23 00:38:06 +0100354int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize,
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100355 uint32_t *len, uint32_t sumsize);
David Woodhouse2f785402006-05-24 02:04:45 +0100356struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c,
357 uint32_t ofs, uint32_t len,
358 struct jffs2_inode_cache *ic);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359void jffs2_complete_reservation(struct jffs2_sb_info *c);
360void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
362/* write.c */
363int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri);
364
David Woodhouse9fe48542006-05-23 00:38:06 +0100365struct jffs2_full_dnode *jffs2_write_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
366 struct jffs2_raw_inode *ri, const unsigned char *data,
367 uint32_t datalen, int alloc_mode);
368struct jffs2_full_dirent *jffs2_write_dirent(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
369 struct jffs2_raw_dirent *rd, const unsigned char *name,
370 uint32_t namelen, int alloc_mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000372 struct jffs2_raw_inode *ri, unsigned char *buf,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373 uint32_t offset, uint32_t writelen, uint32_t *retlen);
David Woodhouse9fe48542006-05-23 00:38:06 +0100374int jffs2_do_create(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, struct jffs2_inode_info *f,
375 struct jffs2_raw_inode *ri, const char *name, int namelen);
376int jffs2_do_unlink(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, const char *name,
377 int namelen, struct jffs2_inode_info *dead_f, uint32_t time);
378int jffs2_do_link(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, uint32_t ino,
379 uint8_t type, const char *name, int namelen, uint32_t time);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380
381
382/* readinode.c */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000383int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384 uint32_t ino, struct jffs2_raw_inode *latest_node);
385int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic);
386void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
387
388/* malloc.c */
389int jffs2_create_slab_caches(void);
390void jffs2_destroy_slab_caches(void);
391
392struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize);
393void jffs2_free_full_dirent(struct jffs2_full_dirent *);
394struct jffs2_full_dnode *jffs2_alloc_full_dnode(void);
395void jffs2_free_full_dnode(struct jffs2_full_dnode *);
396struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void);
397void jffs2_free_raw_dirent(struct jffs2_raw_dirent *);
398struct jffs2_raw_inode *jffs2_alloc_raw_inode(void);
399void jffs2_free_raw_inode(struct jffs2_raw_inode *);
400struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void);
401void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100402int jffs2_prealloc_raw_node_refs(struct jffs2_sb_info *c,
David Woodhouse046b8b92006-05-25 01:50:35 +0100403 struct jffs2_eraseblock *jeb, int nr);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100404void jffs2_free_refblock(struct jffs2_raw_node_ref *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405struct jffs2_node_frag *jffs2_alloc_node_frag(void);
406void jffs2_free_node_frag(struct jffs2_node_frag *);
407struct jffs2_inode_cache *jffs2_alloc_inode_cache(void);
408void jffs2_free_inode_cache(struct jffs2_inode_cache *);
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900409#ifdef CONFIG_JFFS2_FS_XATTR
410struct jffs2_xattr_datum *jffs2_alloc_xattr_datum(void);
411void jffs2_free_xattr_datum(struct jffs2_xattr_datum *);
412struct jffs2_xattr_ref *jffs2_alloc_xattr_ref(void);
413void jffs2_free_xattr_ref(struct jffs2_xattr_ref *);
414#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415
416/* gc.c */
417int jffs2_garbage_collect_pass(struct jffs2_sb_info *c);
418
419/* read.c */
420int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
421 struct jffs2_full_dnode *fd, unsigned char *buf,
422 int ofs, int len);
423int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
424 unsigned char *buf, uint32_t offset, uint32_t len);
425char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
426
427/* scan.c */
428int jffs2_scan_medium(struct jffs2_sb_info *c);
429void jffs2_rotate_lists(struct jffs2_sb_info *c);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100430int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf,
431 uint32_t ofs, uint32_t len);
432struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
433int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
David Woodhouse68270992006-05-21 03:46:05 +0100434int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435
436/* build.c */
437int jffs2_do_mount_fs(struct jffs2_sb_info *c);
438
439/* erase.c */
440void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count);
David Woodhousec38c1b62006-05-25 01:38:27 +0100441void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442
Andrew Victor2f82ce12005-02-09 09:24:26 +0000443#ifdef CONFIG_JFFS2_FS_WRITEBUFFER
Linus Torvalds1da177e2005-04-16 15:20:36 -0700444/* wbuf.c */
445int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino);
446int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c);
447int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
448int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
449#endif
450
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100451#include "debug.h"
452
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453#endif /* __JFFS2_NODELIST_H__ */