blob: 21b0b7b6c75fb689b3107f8e68f8ed2ea90cb06f [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 struct jffs2_raw_node_ref *next_phys;
84 uint32_t flash_offset;
David Woodhouseca89a512006-05-21 13:29:11 +010085#define TEST_TOTLEN
86#ifdef TEST_TOTLEN
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 uint32_t __totlen; /* This may die; use ref_totlen(c, jeb, ) below */
David Woodhouseca89a512006-05-21 13:29:11 +010088#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -070089};
90
David Woodhouse99988f72006-05-24 09:04:17 +010091#define ref_next(r) ((r)->next_phys)
92
David Woodhouse987d47b2006-05-22 16:32:05 +010093static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw)
94{
David Woodhouse99988f72006-05-24 09:04:17 +010095 while(raw->next_in_ino)
David Woodhouse987d47b2006-05-22 16:32:05 +010096 raw = raw->next_in_ino;
David Woodhouse987d47b2006-05-22 16:32:05 +010097
98 /* NB. This can be a jffs2_xattr_datum or jffs2_xattr_ref and
99 not actually a jffs2_inode_cache. Check ->class */
100 return ((struct jffs2_inode_cache *)raw);
101}
102
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103 /* flash_offset & 3 always has to be zero, because nodes are
104 always aligned at 4 bytes. So we have a couple of extra bits
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000105 to play with, which indicate the node's status; see below: */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106#define REF_UNCHECKED 0 /* We haven't yet checked the CRC or built its inode */
107#define REF_OBSOLETE 1 /* Obsolete, can be completely ignored */
108#define REF_PRISTINE 2 /* Completely clean. GC without looking */
109#define REF_NORMAL 3 /* Possibly overlapped. Read the page and write again on GC */
110#define ref_flags(ref) ((ref)->flash_offset & 3)
111#define ref_offset(ref) ((ref)->flash_offset & ~3)
112#define ref_obsolete(ref) (((ref)->flash_offset & 3) == REF_OBSOLETE)
113#define mark_ref_normal(ref) do { (ref)->flash_offset = ref_offset(ref) | REF_NORMAL; } while(0)
114
David Woodhouse61715862006-05-21 00:02:06 +0100115/* NB: REF_PRISTINE for an inode-less node (ref->next_in_ino == NULL) indicates
116 it is an unknown node of type JFFS2_NODETYPE_RWCOMPAT_COPY, so it'll get
117 copied. If you need to do anything different to GC inode-less nodes, then
118 you need to modify gc.c accordingly. */
119
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120/* For each inode in the filesystem, we need to keep a record of
121 nlink, because it would be a PITA to scan the whole directory tree
122 at read_inode() time to calculate it, and to keep sufficient information
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000123 in the raw_node_ref (basically both parent and child inode number for
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 dirent nodes) would take more space than this does. We also keep
125 a pointer to the first physical node which is part of this inode, too.
126*/
127struct jffs2_inode_cache {
David Woodhouse987d47b2006-05-22 16:32:05 +0100128 /* First part of structure is shared with other objects which
129 can terminate the raw node refs' next_in_ino list -- which
130 currently struct jffs2_xattr_datum and struct jffs2_xattr_ref. */
131
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 struct jffs2_full_dirent *scan_dents; /* Used during scan to hold
133 temporary lists of dirents, and later must be set to
134 NULL to mark the end of the raw_node_ref->next_in_ino
135 chain. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 struct jffs2_raw_node_ref *nodes;
David Woodhouse987d47b2006-05-22 16:32:05 +0100137 uint8_t class; /* It's used for identification */
138
139 /* end of shared structure */
140
141 uint8_t flags;
142 uint16_t state;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143 uint32_t ino;
David Woodhouse987d47b2006-05-22 16:32:05 +0100144 struct jffs2_inode_cache *next;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900145#ifdef CONFIG_JFFS2_FS_XATTR
KaiGai Kohei8f2b6f42006-05-13 15:15:07 +0900146 struct jffs2_xattr_ref *xref;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900147#endif
David Woodhouse987d47b2006-05-22 16:32:05 +0100148 int nlink;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149};
150
151/* Inode states for 'state' above. We need the 'GC' state to prevent
152 someone from doing a read_inode() while we're moving a 'REF_PRISTINE'
153 node without going through all the iget() nonsense */
154#define INO_STATE_UNCHECKED 0 /* CRC checks not yet done */
155#define INO_STATE_CHECKING 1 /* CRC checks in progress */
156#define INO_STATE_PRESENT 2 /* In core */
157#define INO_STATE_CHECKEDABSENT 3 /* Checked, cleared again */
158#define INO_STATE_GC 4 /* GCing a 'pristine' node */
159#define INO_STATE_READING 5 /* In read_inode() */
David Woodhouse67e345d2005-02-27 23:01:36 +0000160#define INO_STATE_CLEARING 6 /* In clear_inode() */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900162#define INO_FLAGS_XATTR_CHECKED 0x01 /* has no duplicate xattr_ref */
163
164#define RAWNODE_CLASS_INODE_CACHE 0
165#define RAWNODE_CLASS_XATTR_DATUM 1
166#define RAWNODE_CLASS_XATTR_REF 2
167
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168#define INOCACHE_HASHSIZE 128
169
David Woodhouse9fe48542006-05-23 00:38:06 +0100170#define write_ofs(c) ((c)->nextblock->offset + (c)->sector_size - (c)->nextblock->free_size)
171
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000173 Larger representation of a raw node, kept in-core only when the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 struct inode for this particular ino is instantiated.
175*/
176
177struct jffs2_full_dnode
178{
179 struct jffs2_raw_node_ref *raw;
180 uint32_t ofs; /* The offset to which the data of this node belongs */
181 uint32_t size;
182 uint32_t frags; /* Number of fragments which currently refer
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000183 to this node. When this reaches zero,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700184 the node is obsolete. */
185};
186
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000187/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 Even larger representation of a raw node, kept in-core only while
189 we're actually building up the original map of which nodes go where,
190 in read_inode()
191*/
192struct jffs2_tmp_dnode_info
193{
David Woodhouse9dee7502005-07-05 22:03:10 +0100194 struct rb_node rb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 struct jffs2_full_dnode *fn;
196 uint32_t version;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100197 uint32_t data_crc;
198 uint32_t partial_crc;
199 uint32_t csize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000200};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201
202struct jffs2_full_dirent
203{
204 struct jffs2_raw_node_ref *raw;
205 struct jffs2_full_dirent *next;
206 uint32_t version;
207 uint32_t ino; /* == zero for unlink */
208 unsigned int nhash;
209 unsigned char type;
210 unsigned char name[0];
211};
212
213/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000214 Fragments - used to build a map of which raw node to obtain
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 data from for each part of the ino
216*/
217struct jffs2_node_frag
218{
219 struct rb_node rb;
220 struct jffs2_full_dnode *node; /* NULL for holes */
221 uint32_t size;
222 uint32_t ofs; /* The offset to which this fragment belongs */
223};
224
225struct jffs2_eraseblock
226{
227 struct list_head list;
228 int bad_count;
229 uint32_t offset; /* of this block in the MTD */
230
231 uint32_t unchecked_size;
232 uint32_t used_size;
233 uint32_t dirty_size;
234 uint32_t wasted_size;
235 uint32_t free_size; /* Note that sector_size - free_size
236 is the address of the first free space */
237 struct jffs2_raw_node_ref *first_node;
238 struct jffs2_raw_node_ref *last_node;
239
240 struct jffs2_raw_node_ref *gc_node; /* Next node to be garbage collected */
241};
242
Ferenc Havasi4ce1f562005-08-31 14:51:04 +0100243static inline int jffs2_blocks_use_vmalloc(struct jffs2_sb_info *c)
244{
245 return ((c->flash_size / c->sector_size) * sizeof (struct jffs2_eraseblock)) > (128 * 1024);
246}
247
David Woodhouseca89a512006-05-21 13:29:11 +0100248#define ref_totlen(a, b, c) __jffs2_ref_totlen((a), (b), (c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250#define ALLOC_NORMAL 0 /* Normal allocation */
251#define ALLOC_DELETION 1 /* Deletion node. Best to allow it */
252#define ALLOC_GC 2 /* Space requested for GC. Give it or die */
253#define ALLOC_NORETRY 3 /* For jffs2_write_dnode: On failure, return -EAGAIN instead of retrying */
254
255/* How much dirty space before it goes on the very_dirty_list */
256#define VERYDIRTY(c, size) ((size) >= ((c)->sector_size / 2))
257
258/* check if dirty space is more than 255 Byte */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000259#define ISDIRTY(size) ((size) > sizeof (struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260
261#define PAD(x) (((x)+3)&~3)
262
David Woodhouseaef9ab42006-05-19 00:28:49 +0100263static inline int jffs2_encode_dev(union jffs2_device_node *jdev, dev_t rdev)
264{
265 if (old_valid_dev(rdev)) {
266 jdev->old = cpu_to_je16(old_encode_dev(rdev));
267 return sizeof(jdev->old);
268 } else {
269 jdev->new = cpu_to_je32(new_encode_dev(rdev));
270 return sizeof(jdev->new);
271 }
272}
273
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274static inline struct jffs2_node_frag *frag_first(struct rb_root *root)
275{
276 struct rb_node *node = root->rb_node;
277
278 if (!node)
279 return NULL;
280 while(node->rb_left)
281 node = node->rb_left;
282 return rb_entry(node, struct jffs2_node_frag, rb);
283}
Artem B. Bityuckiy8557fd52005-04-09 11:47:03 +0100284
285static inline struct jffs2_node_frag *frag_last(struct rb_root *root)
286{
287 struct rb_node *node = root->rb_node;
288
289 if (!node)
290 return NULL;
291 while(node->rb_right)
292 node = node->rb_right;
293 return rb_entry(node, struct jffs2_node_frag, rb);
294}
295
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296#define rb_parent(rb) ((rb)->rb_parent)
297#define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
298#define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
299#define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
300#define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
301#define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
302#define frag_erase(frag, list) rb_erase(&frag->rb, list);
303
304/* nodelist.c */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305void 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 -0700306void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state);
307struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
308void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new);
309void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old);
310void jffs2_free_ino_caches(struct jffs2_sb_info *c);
311void jffs2_free_raw_node_refs(struct jffs2_sb_info *c);
312struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
313void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314struct rb_node *rb_next(struct rb_node *);
315struct rb_node *rb_prev(struct rb_node *);
316void rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100317void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this);
318int 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 +0100319void jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100320int 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 +0100321struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c,
322 struct jffs2_eraseblock *jeb,
323 uint32_t ofs, uint32_t len,
324 struct jffs2_inode_cache *ic);
David Woodhouseca89a512006-05-21 13:29:11 +0100325extern uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c,
326 struct jffs2_eraseblock *jeb,
327 struct jffs2_raw_node_ref *ref);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328
329/* nodemgmt.c */
330int jffs2_thread_should_wake(struct jffs2_sb_info *c);
David Woodhouse9fe48542006-05-23 00:38:06 +0100331int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize,
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100332 uint32_t *len, int prio, uint32_t sumsize);
David Woodhouse9fe48542006-05-23 00:38:06 +0100333int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize,
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100334 uint32_t *len, uint32_t sumsize);
David Woodhouse2f785402006-05-24 02:04:45 +0100335struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c,
336 uint32_t ofs, uint32_t len,
337 struct jffs2_inode_cache *ic);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338void jffs2_complete_reservation(struct jffs2_sb_info *c);
339void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340
341/* write.c */
342int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri);
343
David Woodhouse9fe48542006-05-23 00:38:06 +0100344struct jffs2_full_dnode *jffs2_write_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
345 struct jffs2_raw_inode *ri, const unsigned char *data,
346 uint32_t datalen, int alloc_mode);
347struct jffs2_full_dirent *jffs2_write_dirent(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
348 struct jffs2_raw_dirent *rd, const unsigned char *name,
349 uint32_t namelen, int alloc_mode);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000351 struct jffs2_raw_inode *ri, unsigned char *buf,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352 uint32_t offset, uint32_t writelen, uint32_t *retlen);
David Woodhouse9fe48542006-05-23 00:38:06 +0100353int jffs2_do_create(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, struct jffs2_inode_info *f,
354 struct jffs2_raw_inode *ri, const char *name, int namelen);
355int jffs2_do_unlink(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, const char *name,
356 int namelen, struct jffs2_inode_info *dead_f, uint32_t time);
357int jffs2_do_link(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, uint32_t ino,
358 uint8_t type, const char *name, int namelen, uint32_t time);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
360
361/* readinode.c */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000362int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700363 uint32_t ino, struct jffs2_raw_inode *latest_node);
364int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic);
365void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
366
367/* malloc.c */
368int jffs2_create_slab_caches(void);
369void jffs2_destroy_slab_caches(void);
370
371struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize);
372void jffs2_free_full_dirent(struct jffs2_full_dirent *);
373struct jffs2_full_dnode *jffs2_alloc_full_dnode(void);
374void jffs2_free_full_dnode(struct jffs2_full_dnode *);
375struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void);
376void jffs2_free_raw_dirent(struct jffs2_raw_dirent *);
377struct jffs2_raw_inode *jffs2_alloc_raw_inode(void);
378void jffs2_free_raw_inode(struct jffs2_raw_inode *);
379struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void);
380void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *);
David Woodhouse2f785402006-05-24 02:04:45 +0100381int jffs2_prealloc_raw_node_refs(struct jffs2_sb_info *c, int nr);
382struct jffs2_raw_node_ref *__jffs2_alloc_raw_node_ref(void);
383void __jffs2_free_raw_node_ref(struct jffs2_raw_node_ref *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700384struct jffs2_node_frag *jffs2_alloc_node_frag(void);
385void jffs2_free_node_frag(struct jffs2_node_frag *);
386struct jffs2_inode_cache *jffs2_alloc_inode_cache(void);
387void jffs2_free_inode_cache(struct jffs2_inode_cache *);
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900388#ifdef CONFIG_JFFS2_FS_XATTR
389struct jffs2_xattr_datum *jffs2_alloc_xattr_datum(void);
390void jffs2_free_xattr_datum(struct jffs2_xattr_datum *);
391struct jffs2_xattr_ref *jffs2_alloc_xattr_ref(void);
392void jffs2_free_xattr_ref(struct jffs2_xattr_ref *);
393#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
395/* gc.c */
396int jffs2_garbage_collect_pass(struct jffs2_sb_info *c);
397
398/* read.c */
399int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
400 struct jffs2_full_dnode *fd, unsigned char *buf,
401 int ofs, int len);
402int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
403 unsigned char *buf, uint32_t offset, uint32_t len);
404char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
405
406/* scan.c */
407int jffs2_scan_medium(struct jffs2_sb_info *c);
408void jffs2_rotate_lists(struct jffs2_sb_info *c);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100409int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf,
410 uint32_t ofs, uint32_t len);
411struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
412int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
David Woodhouse68270992006-05-21 03:46:05 +0100413int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414
415/* build.c */
416int jffs2_do_mount_fs(struct jffs2_sb_info *c);
417
418/* erase.c */
419void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count);
David Woodhousec38c1b62006-05-25 01:38:27 +0100420void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421
Andrew Victor2f82ce12005-02-09 09:24:26 +0000422#ifdef CONFIG_JFFS2_FS_WRITEBUFFER
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423/* wbuf.c */
424int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino);
425int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c);
426int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
427int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
428#endif
429
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100430#include "debug.h"
431
Linus Torvalds1da177e2005-04-16 15:20:36 -0700432#endif /* __JFFS2_NODELIST_H__ */