blob: 351d947c9375bb2876d444b907e4b1c90e2545be [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
80 for this inode. If this is the last, it points to the inode_cache
81 for this inode instead. The inode_cache will have NULL in the first
82 word so you know when you've got there :) */
83 struct jffs2_raw_node_ref *next_phys;
84 uint32_t flash_offset;
85 uint32_t __totlen; /* This may die; use ref_totlen(c, jeb, ) below */
86};
87
88 /* flash_offset & 3 always has to be zero, because nodes are
89 always aligned at 4 bytes. So we have a couple of extra bits
Thomas Gleixner182ec4e2005-11-07 11:16:07 +000090 to play with, which indicate the node's status; see below: */
Linus Torvalds1da177e2005-04-16 15:20:36 -070091#define REF_UNCHECKED 0 /* We haven't yet checked the CRC or built its inode */
92#define REF_OBSOLETE 1 /* Obsolete, can be completely ignored */
93#define REF_PRISTINE 2 /* Completely clean. GC without looking */
94#define REF_NORMAL 3 /* Possibly overlapped. Read the page and write again on GC */
95#define ref_flags(ref) ((ref)->flash_offset & 3)
96#define ref_offset(ref) ((ref)->flash_offset & ~3)
97#define ref_obsolete(ref) (((ref)->flash_offset & 3) == REF_OBSOLETE)
98#define mark_ref_normal(ref) do { (ref)->flash_offset = ref_offset(ref) | REF_NORMAL; } while(0)
99
100/* For each inode in the filesystem, we need to keep a record of
101 nlink, because it would be a PITA to scan the whole directory tree
102 at read_inode() time to calculate it, and to keep sufficient information
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000103 in the raw_node_ref (basically both parent and child inode number for
Linus Torvalds1da177e2005-04-16 15:20:36 -0700104 dirent nodes) would take more space than this does. We also keep
105 a pointer to the first physical node which is part of this inode, too.
106*/
107struct jffs2_inode_cache {
108 struct jffs2_full_dirent *scan_dents; /* Used during scan to hold
109 temporary lists of dirents, and later must be set to
110 NULL to mark the end of the raw_node_ref->next_in_ino
111 chain. */
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900112 u8 class; /* It's used for identification */
113 u8 flags;
114 uint16_t state;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115 struct jffs2_inode_cache *next;
116 struct jffs2_raw_node_ref *nodes;
117 uint32_t ino;
118 int nlink;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900119#ifdef CONFIG_JFFS2_FS_XATTR
KaiGai Kohei8f2b6f42006-05-13 15:15:07 +0900120 struct jffs2_xattr_ref *xref;
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900121#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122};
123
124/* Inode states for 'state' above. We need the 'GC' state to prevent
125 someone from doing a read_inode() while we're moving a 'REF_PRISTINE'
126 node without going through all the iget() nonsense */
127#define INO_STATE_UNCHECKED 0 /* CRC checks not yet done */
128#define INO_STATE_CHECKING 1 /* CRC checks in progress */
129#define INO_STATE_PRESENT 2 /* In core */
130#define INO_STATE_CHECKEDABSENT 3 /* Checked, cleared again */
131#define INO_STATE_GC 4 /* GCing a 'pristine' node */
132#define INO_STATE_READING 5 /* In read_inode() */
David Woodhouse67e345d2005-02-27 23:01:36 +0000133#define INO_STATE_CLEARING 6 /* In clear_inode() */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900135#define INO_FLAGS_XATTR_CHECKED 0x01 /* has no duplicate xattr_ref */
136
137#define RAWNODE_CLASS_INODE_CACHE 0
138#define RAWNODE_CLASS_XATTR_DATUM 1
139#define RAWNODE_CLASS_XATTR_REF 2
140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141#define INOCACHE_HASHSIZE 128
142
143/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000144 Larger representation of a raw node, kept in-core only when the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145 struct inode for this particular ino is instantiated.
146*/
147
148struct jffs2_full_dnode
149{
150 struct jffs2_raw_node_ref *raw;
151 uint32_t ofs; /* The offset to which the data of this node belongs */
152 uint32_t size;
153 uint32_t frags; /* Number of fragments which currently refer
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000154 to this node. When this reaches zero,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 the node is obsolete. */
156};
157
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000158/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700159 Even larger representation of a raw node, kept in-core only while
160 we're actually building up the original map of which nodes go where,
161 in read_inode()
162*/
163struct jffs2_tmp_dnode_info
164{
David Woodhouse9dee7502005-07-05 22:03:10 +0100165 struct rb_node rb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 struct jffs2_full_dnode *fn;
167 uint32_t version;
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100168 uint32_t data_crc;
169 uint32_t partial_crc;
170 uint32_t csize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000171};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172
173struct jffs2_full_dirent
174{
175 struct jffs2_raw_node_ref *raw;
176 struct jffs2_full_dirent *next;
177 uint32_t version;
178 uint32_t ino; /* == zero for unlink */
179 unsigned int nhash;
180 unsigned char type;
181 unsigned char name[0];
182};
183
184/*
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000185 Fragments - used to build a map of which raw node to obtain
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186 data from for each part of the ino
187*/
188struct jffs2_node_frag
189{
190 struct rb_node rb;
191 struct jffs2_full_dnode *node; /* NULL for holes */
192 uint32_t size;
193 uint32_t ofs; /* The offset to which this fragment belongs */
194};
195
196struct jffs2_eraseblock
197{
198 struct list_head list;
199 int bad_count;
200 uint32_t offset; /* of this block in the MTD */
201
202 uint32_t unchecked_size;
203 uint32_t used_size;
204 uint32_t dirty_size;
205 uint32_t wasted_size;
206 uint32_t free_size; /* Note that sector_size - free_size
207 is the address of the first free space */
208 struct jffs2_raw_node_ref *first_node;
209 struct jffs2_raw_node_ref *last_node;
210
211 struct jffs2_raw_node_ref *gc_node; /* Next node to be garbage collected */
212};
213
Ferenc Havasi4ce1f562005-08-31 14:51:04 +0100214static inline int jffs2_blocks_use_vmalloc(struct jffs2_sb_info *c)
215{
216 return ((c->flash_size / c->sector_size) * sizeof (struct jffs2_eraseblock)) > (128 * 1024);
217}
218
Linus Torvalds1da177e2005-04-16 15:20:36 -0700219/* Calculate totlen from surrounding nodes or eraseblock */
220static inline uint32_t __ref_totlen(struct jffs2_sb_info *c,
221 struct jffs2_eraseblock *jeb,
222 struct jffs2_raw_node_ref *ref)
223{
224 uint32_t ref_end;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000225
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 if (ref->next_phys)
227 ref_end = ref_offset(ref->next_phys);
228 else {
229 if (!jeb)
230 jeb = &c->blocks[ref->flash_offset / c->sector_size];
231
232 /* Last node in block. Use free_space */
233 BUG_ON(ref != jeb->last_node);
234 ref_end = jeb->offset + c->sector_size - jeb->free_size;
235 }
236 return ref_end - ref_offset(ref);
237}
238
239static inline uint32_t ref_totlen(struct jffs2_sb_info *c,
240 struct jffs2_eraseblock *jeb,
241 struct jffs2_raw_node_ref *ref)
242{
243 uint32_t ret;
244
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100245#if CONFIG_JFFS2_FS_DEBUG > 0
246 if (jeb && jeb != &c->blocks[ref->flash_offset / c->sector_size]) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 printk(KERN_CRIT "ref_totlen called with wrong block -- at 0x%08x instead of 0x%08x; ref 0x%08x\n",
248 jeb->offset, c->blocks[ref->flash_offset / c->sector_size].offset, ref_offset(ref));
249 BUG();
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100250 }
251#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252
253#if 1
254 ret = ref->__totlen;
255#else
256 /* This doesn't actually work yet */
257 ret = __ref_totlen(c, jeb, ref);
258 if (ret != ref->__totlen) {
259 printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n",
260 ref, ref_offset(ref), ref_offset(ref)+ref->__totlen,
261 ret, ref->__totlen);
262 if (!jeb)
263 jeb = &c->blocks[ref->flash_offset / c->sector_size];
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100264 jffs2_dbg_dump_node_refs_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 BUG();
266 }
267#endif
268 return ret;
269}
270
Linus Torvalds1da177e2005-04-16 15:20:36 -0700271#define ALLOC_NORMAL 0 /* Normal allocation */
272#define ALLOC_DELETION 1 /* Deletion node. Best to allow it */
273#define ALLOC_GC 2 /* Space requested for GC. Give it or die */
274#define ALLOC_NORETRY 3 /* For jffs2_write_dnode: On failure, return -EAGAIN instead of retrying */
275
276/* How much dirty space before it goes on the very_dirty_list */
277#define VERYDIRTY(c, size) ((size) >= ((c)->sector_size / 2))
278
279/* check if dirty space is more than 255 Byte */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000280#define ISDIRTY(size) ((size) > sizeof (struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281
282#define PAD(x) (((x)+3)&~3)
283
284static inline struct jffs2_inode_cache *jffs2_raw_ref_to_ic(struct jffs2_raw_node_ref *raw)
285{
286 while(raw->next_in_ino) {
287 raw = raw->next_in_ino;
288 }
289
290 return ((struct jffs2_inode_cache *)raw);
291}
292
293static inline struct jffs2_node_frag *frag_first(struct rb_root *root)
294{
295 struct rb_node *node = root->rb_node;
296
297 if (!node)
298 return NULL;
299 while(node->rb_left)
300 node = node->rb_left;
301 return rb_entry(node, struct jffs2_node_frag, rb);
302}
Artem B. Bityuckiy8557fd52005-04-09 11:47:03 +0100303
304static inline struct jffs2_node_frag *frag_last(struct rb_root *root)
305{
306 struct rb_node *node = root->rb_node;
307
308 if (!node)
309 return NULL;
310 while(node->rb_right)
311 node = node->rb_right;
312 return rb_entry(node, struct jffs2_node_frag, rb);
313}
314
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315#define rb_parent(rb) ((rb)->rb_parent)
316#define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
317#define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
318#define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
319#define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
320#define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
321#define frag_erase(frag, list) rb_erase(&frag->rb, list);
322
323/* nodelist.c */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324void 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 -0700325void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state);
326struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
327void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new);
328void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old);
329void jffs2_free_ino_caches(struct jffs2_sb_info *c);
330void jffs2_free_raw_node_refs(struct jffs2_sb_info *c);
331struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
332void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333struct rb_node *rb_next(struct rb_node *);
334struct rb_node *rb_prev(struct rb_node *);
335void rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root);
Artem B. Bityutskiyf97117d2005-07-27 15:46:14 +0100336void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this);
337int 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 +0100338void jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
Artem B. Bityutskiy1e0da3c2005-08-01 13:05:22 +0100339int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340
341/* nodemgmt.c */
342int jffs2_thread_should_wake(struct jffs2_sb_info *c);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100343int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs,
344 uint32_t *len, int prio, uint32_t sumsize);
345int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs,
346 uint32_t *len, uint32_t sumsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700347int jffs2_add_physical_node_ref(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *new);
348void jffs2_complete_reservation(struct jffs2_sb_info *c);
349void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *raw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350
351/* write.c */
352int jffs2_do_new_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, uint32_t mode, struct jffs2_raw_inode *ri);
353
354struct jffs2_full_dnode *jffs2_write_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_raw_inode *ri, const unsigned char *data, uint32_t datalen, uint32_t flash_ofs, int alloc_mode);
355struct jffs2_full_dirent *jffs2_write_dirent(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_raw_dirent *rd, const unsigned char *name, uint32_t namelen, uint32_t flash_ofs, int alloc_mode);
356int jffs2_write_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000357 struct jffs2_raw_inode *ri, unsigned char *buf,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358 uint32_t offset, uint32_t writelen, uint32_t *retlen);
359int jffs2_do_create(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, struct jffs2_inode_info *f, struct jffs2_raw_inode *ri, const char *name, int namelen);
Artem B. Bityutskiy3a69e0c2005-08-17 14:46:26 +0100360int jffs2_do_unlink(struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, const char *name, int namelen, struct jffs2_inode_info *dead_f, uint32_t time);
361int jffs2_do_link (struct jffs2_sb_info *c, struct jffs2_inode_info *dir_f, uint32_t ino, uint8_t type, const char *name, int namelen, uint32_t time);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362
363
364/* readinode.c */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000365int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366 uint32_t ino, struct jffs2_raw_inode *latest_node);
367int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic);
368void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
369
370/* malloc.c */
371int jffs2_create_slab_caches(void);
372void jffs2_destroy_slab_caches(void);
373
374struct jffs2_full_dirent *jffs2_alloc_full_dirent(int namesize);
375void jffs2_free_full_dirent(struct jffs2_full_dirent *);
376struct jffs2_full_dnode *jffs2_alloc_full_dnode(void);
377void jffs2_free_full_dnode(struct jffs2_full_dnode *);
378struct jffs2_raw_dirent *jffs2_alloc_raw_dirent(void);
379void jffs2_free_raw_dirent(struct jffs2_raw_dirent *);
380struct jffs2_raw_inode *jffs2_alloc_raw_inode(void);
381void jffs2_free_raw_inode(struct jffs2_raw_inode *);
382struct jffs2_tmp_dnode_info *jffs2_alloc_tmp_dnode_info(void);
383void jffs2_free_tmp_dnode_info(struct jffs2_tmp_dnode_info *);
384struct jffs2_raw_node_ref *jffs2_alloc_raw_node_ref(void);
385void jffs2_free_raw_node_ref(struct jffs2_raw_node_ref *);
386struct jffs2_node_frag *jffs2_alloc_node_frag(void);
387void jffs2_free_node_frag(struct jffs2_node_frag *);
388struct jffs2_inode_cache *jffs2_alloc_inode_cache(void);
389void jffs2_free_inode_cache(struct jffs2_inode_cache *);
KaiGai Koheiaa98d7c2006-05-13 15:09:47 +0900390#ifdef CONFIG_JFFS2_FS_XATTR
391struct jffs2_xattr_datum *jffs2_alloc_xattr_datum(void);
392void jffs2_free_xattr_datum(struct jffs2_xattr_datum *);
393struct jffs2_xattr_ref *jffs2_alloc_xattr_ref(void);
394void jffs2_free_xattr_ref(struct jffs2_xattr_ref *);
395#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396
397/* gc.c */
398int jffs2_garbage_collect_pass(struct jffs2_sb_info *c);
399
400/* read.c */
401int jffs2_read_dnode(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
402 struct jffs2_full_dnode *fd, unsigned char *buf,
403 int ofs, int len);
404int jffs2_read_inode_range(struct jffs2_sb_info *c, struct jffs2_inode_info *f,
405 unsigned char *buf, uint32_t offset, uint32_t len);
406char *jffs2_getlink(struct jffs2_sb_info *c, struct jffs2_inode_info *f);
407
408/* scan.c */
409int jffs2_scan_medium(struct jffs2_sb_info *c);
410void jffs2_rotate_lists(struct jffs2_sb_info *c);
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100411int jffs2_fill_scan_buf(struct jffs2_sb_info *c, void *buf,
412 uint32_t ofs, uint32_t len);
413struct jffs2_inode_cache *jffs2_scan_make_ino_cache(struct jffs2_sb_info *c, uint32_t ino);
414int jffs2_scan_classify_jeb(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415
416/* build.c */
417int jffs2_do_mount_fs(struct jffs2_sb_info *c);
418
419/* erase.c */
420void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count);
421
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__ */