2 * JFFS2 -- Journalling Flash File System, Version 2.
4 * Copyright (C) 2001 Red Hat, Inc.
6 * Created by David Woodhouse <dwmw2@cambridge.redhat.com>
8 * The original JFFS, from which the design for JFFS2 was derived,
9 * was designed and implemented by Axis Communications AB.
11 * The contents of this file are subject to the Red Hat eCos Public
12 * License Version 1.1 (the "Licence"); you may not use this file
13 * except in compliance with the Licence. You may obtain a copy of
14 * the Licence at http://www.redhat.com/
16 * Software distributed under the Licence is distributed on an "AS IS"
17 * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied.
18 * See the Licence for the specific language governing rights and
19 * limitations under the Licence.
21 * The Original Code is JFFS2 - Journalling Flash File System, version 2
23 * Alternatively, the contents of this file may be used under the
24 * terms of the GNU General Public License version 2 (the "GPL"), in
25 * which case the provisions of the GPL are applicable instead of the
26 * above. If you wish to allow the use of your version of this file
27 * only under the terms of the GPL and not to allow others to use your
28 * version of this file under the RHEPL, indicate your decision by
29 * deleting the provisions above and replace them with the notice and
30 * other provisions required by the GPL. If you do not delete the
31 * provisions above, a recipient may use your version of this file
32 * under either the RHEPL or the GPL.
34 * $Id: gc.c,v 1.52.2.7 2003/11/02 13:54:20 dwmw2 Exp $
38 #include <linux/kernel.h>
39 #include <linux/mtd/mtd.h>
40 #include <linux/slab.h>
41 #include <linux/jffs2.h>
42 #include <linux/sched.h>
43 #include <linux/interrupt.h>
44 #include <linux/pagemap.h>
46 #include <linux/crc32.h>
48 static int jffs2_garbage_collect_metadata(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
49 struct inode *inode, struct jffs2_full_dnode *fd);
50 static int jffs2_garbage_collect_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
51 struct inode *inode, struct jffs2_full_dirent *fd);
52 static int jffs2_garbage_collect_deletion_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
53 struct inode *inode, struct jffs2_full_dirent *fd);
54 static int jffs2_garbage_collect_hole(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
55 struct inode *indeo, struct jffs2_full_dnode *fn,
56 __u32 start, __u32 end);
57 static int jffs2_garbage_collect_dnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
58 struct inode *inode, struct jffs2_full_dnode *fn,
59 __u32 start, __u32 end);
61 /* Called with erase_completion_lock held */
62 static struct jffs2_eraseblock *jffs2_find_gc_block(struct jffs2_sb_info *c)
64 struct jffs2_eraseblock *ret;
65 struct list_head *nextlist = NULL;
67 /* Pick an eraseblock to garbage collect next. This is where we'll
68 put the clever wear-levelling algorithms. Eventually. */
69 if (!list_empty(&c->bad_used_list) && c->nr_free_blocks > JFFS2_RESERVED_BLOCKS_GCBAD) {
70 D1(printk(KERN_DEBUG "Picking block from bad_used_list to GC next\n"));
71 nextlist = &c->bad_used_list;
72 } else if (jiffies % 100 && !list_empty(&c->dirty_list)) {
73 /* Most of the time, pick one off the dirty list */
74 D1(printk(KERN_DEBUG "Picking block from dirty_list to GC next\n"));
75 nextlist = &c->dirty_list;
76 } else if (!list_empty(&c->clean_list)) {
77 D1(printk(KERN_DEBUG "Picking block from clean_list to GC next\n"));
78 nextlist = &c->clean_list;
79 } else if (!list_empty(&c->dirty_list)) {
80 D1(printk(KERN_DEBUG "Picking block from dirty_list to GC next (clean_list was empty)\n"));
82 nextlist = &c->dirty_list;
84 /* Eep. Both were empty */
85 printk(KERN_NOTICE "jffs2: No clean _or_ dirty blocks to GC from! Where are they all?\n");
89 ret = list_entry(nextlist->next, struct jffs2_eraseblock, list);
92 ret->gc_node = ret->first_node;
94 printk(KERN_WARNING "Eep. ret->gc_node for block at 0x%08x is NULL\n", ret->offset);
100 /* jffs2_garbage_collect_pass
101 * Make a single attempt to progress GC. Move one node, and possibly
102 * start erasing one eraseblock.
104 int jffs2_garbage_collect_pass(struct jffs2_sb_info *c)
106 struct jffs2_eraseblock *jeb;
107 struct jffs2_inode_info *f;
108 struct jffs2_raw_node_ref *raw;
109 struct jffs2_node_frag *frag;
110 struct jffs2_full_dnode *fn = NULL;
111 struct jffs2_full_dirent *fd;
112 struct jffs2_inode_cache *ic;
113 __u32 start = 0, end = 0, nrfrags = 0;
117 if (down_interruptible(&c->alloc_sem))
120 spin_lock_bh(&c->erase_completion_lock);
122 /* First, work out which block we're garbage-collecting */
126 jeb = jffs2_find_gc_block(c);
129 printk(KERN_NOTICE "jffs2: Couldn't find erase block to garbage collect!\n");
130 spin_unlock_bh(&c->erase_completion_lock);
135 D1(printk(KERN_DEBUG "garbage collect from block at phys 0x%08x\n", jeb->offset));
137 if (!jeb->used_size) {
144 while(raw->flash_offset & 1) {
145 D1(printk(KERN_DEBUG "Node at 0x%08x is obsolete... skipping\n", raw->flash_offset &~3));
146 jeb->gc_node = raw = raw->next_phys;
148 printk(KERN_WARNING "eep. End of raw list while still supposedly nodes to GC\n");
149 printk(KERN_WARNING "erase block at 0x%08x. free_size 0x%08x, dirty_size 0x%08x, used_size 0x%08x\n",
150 jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size);
151 spin_unlock_bh(&c->erase_completion_lock);
156 D1(printk(KERN_DEBUG "Going to garbage collect node at 0x%08x\n", raw->flash_offset &~3));
157 if (!raw->next_in_ino) {
158 /* Inode-less node. Clean marker, snapshot or something like that */
159 spin_unlock_bh(&c->erase_completion_lock);
160 jffs2_mark_node_obsolete(c, raw);
165 ic = jffs2_raw_ref_to_ic(raw);
166 D1(printk(KERN_DEBUG "Inode number is #%u\n", ic->ino));
168 spin_unlock_bh(&c->erase_completion_lock);
170 D1(printk(KERN_DEBUG "jffs2_garbage_collect_pass collecting from block @0x%08x. Node @0x%08x, ino #%u\n", jeb->offset, raw->flash_offset&~3, ic->ino));
172 /* The inode has zero nlink but its nodes weren't yet marked
173 obsolete. This has to be because we're still waiting for
174 the final (close() and) iput() to happen.
176 There's a possibility that the final iput() could have
177 happened while we were contemplating. In order to ensure
178 that we don't cause a new read_inode() (which would fail)
179 for the inode in question, we use ilookup() in this case
182 The nlink can't _become_ zero at this point because we're
183 holding the alloc_sem, and jffs2_do_unlink() would also
184 need that while decrementing nlink on any inode.
186 inode = ilookup(OFNI_BS_2SFFJ(c), ic->ino);
188 D1(printk(KERN_DEBUG "ilookup() failed for ino #%u; inode is probably deleted.\n",
194 /* Inode has links to it still; they're not going away because
195 jffs2_do_unlink() would need the alloc_sem and we have it.
196 Just iget() it, and if read_inode() is necessary that's OK.
198 inode = iget(OFNI_BS_2SFFJ(c), ic->ino);
204 if (is_bad_inode(inode)) {
205 printk(KERN_NOTICE "Eep. read_inode() failed for ino #%u\n", ic->ino);
206 /* NB. This will happen again. We need to do something appropriate here. */
212 f = JFFS2_INODE_INFO(inode);
214 /* Now we have the lock for this inode. Check that it's still the one at the head
217 if (raw->flash_offset & 1) {
218 D1(printk(KERN_DEBUG "node to be GC'd was obsoleted in the meantime.\n"));
219 /* They'll call again */
222 /* OK. Looks safe. And nobody can get us now because we have the semaphore. Move the block */
223 if (f->metadata && f->metadata->raw == raw) {
225 ret = jffs2_garbage_collect_metadata(c, jeb, inode, fn);
229 for (frag = f->fraglist; frag; frag = frag->next) {
230 if (frag->node && frag->node->raw == raw) {
232 end = frag->ofs + frag->size;
235 if (nrfrags == frag->node->frags)
236 break; /* We've found them all */
240 /* We found a datanode. Do the GC */
241 if((start >> PAGE_CACHE_SHIFT) < ((end-1) >> PAGE_CACHE_SHIFT)) {
242 /* It crosses a page boundary. Therefore, it must be a hole. */
243 ret = jffs2_garbage_collect_hole(c, jeb, inode, fn, start, end);
245 /* It could still be a hole. But we GC the page this way anyway */
246 ret = jffs2_garbage_collect_dnode(c, jeb, inode, fn, start, end);
251 /* Wasn't a dnode. Try dirent */
252 for (fd = f->dents; fd; fd=fd->next) {
258 ret = jffs2_garbage_collect_dirent(c, jeb, inode, fd);
260 ret = jffs2_garbage_collect_deletion_dirent(c, jeb, inode, fd);
262 printk(KERN_WARNING "Raw node at 0x%08x wasn't in node lists for ino #%lu\n", raw->flash_offset&~3, inode->i_ino);
263 if (raw->flash_offset & 1) {
264 printk(KERN_WARNING "But it's obsolete so we don't mind too much\n");
275 /* If we've finished this block, start it erasing */
276 spin_lock_bh(&c->erase_completion_lock);
279 if (c->gcblock && !c->gcblock->used_size) {
280 D1(printk(KERN_DEBUG "Block at 0x%08x completely obsoleted by GC. Moving to erase_pending_list\n", c->gcblock->offset));
281 /* We're GC'ing an empty block? */
282 list_add_tail(&c->gcblock->list, &c->erase_pending_list);
284 c->nr_erasing_blocks++;
285 jffs2_erase_pending_trigger(c);
287 spin_unlock_bh(&c->erase_completion_lock);
292 static int jffs2_garbage_collect_metadata(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
293 struct inode *inode, struct jffs2_full_dnode *fn)
295 struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
296 struct jffs2_full_dnode *new_fn;
297 struct jffs2_raw_inode ri;
299 char *mdata = NULL, mdatalen = 0;
300 __u32 alloclen, phys_ofs;
303 if (S_ISBLK(inode->i_mode) || S_ISCHR(inode->i_mode)) {
304 /* For these, we don't actually need to read the old node */
305 dev = (MAJOR(to_kdev_t(inode->i_rdev)) << 8) |
306 MINOR(to_kdev_t(inode->i_rdev));
307 mdata = (char *)&dev;
308 mdatalen = sizeof(dev);
309 D1(printk(KERN_DEBUG "jffs2_garbage_collect_metadata(): Writing %d bytes of kdev_t\n", mdatalen));
310 } else if (S_ISLNK(inode->i_mode)) {
312 mdata = kmalloc(fn->size, GFP_KERNEL);
314 printk(KERN_WARNING "kmalloc of mdata failed in jffs2_garbage_collect_metadata()\n");
317 ret = jffs2_read_dnode(c, fn, mdata, 0, mdatalen);
319 printk(KERN_WARNING "read of old metadata failed in jffs2_garbage_collect_metadata(): %d\n", ret);
323 D1(printk(KERN_DEBUG "jffs2_garbage_collect_metadata(): Writing %d bites of symlink target\n", mdatalen));
327 ret = jffs2_reserve_space_gc(c, sizeof(ri) + mdatalen, &phys_ofs, &alloclen);
329 printk(KERN_WARNING "jffs2_reserve_space_gc of %d bytes for garbage_collect_metadata failed: %d\n",
330 sizeof(ri)+ mdatalen, ret);
334 memset(&ri, 0, sizeof(ri));
335 ri.magic = JFFS2_MAGIC_BITMASK;
336 ri.nodetype = JFFS2_NODETYPE_INODE;
337 ri.totlen = sizeof(ri) + mdatalen;
338 ri.hdr_crc = crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4);
340 ri.ino = inode->i_ino;
341 ri.version = ++f->highest_version;
342 ri.mode = inode->i_mode;
343 ri.uid = inode->i_uid;
344 ri.gid = inode->i_gid;
345 ri.isize = inode->i_size;
346 ri.atime = inode->i_atime;
347 ri.ctime = inode->i_ctime;
348 ri.mtime = inode->i_mtime;
352 ri.compr = JFFS2_COMPR_NONE;
353 ri.node_crc = crc32(0, &ri, sizeof(ri)-8);
354 ri.data_crc = crc32(0, mdata, mdatalen);
356 new_fn = jffs2_write_dnode(inode, &ri, mdata, mdatalen, phys_ofs, NULL);
358 if (IS_ERR(new_fn)) {
359 printk(KERN_WARNING "Error writing new dnode: %ld\n", PTR_ERR(new_fn));
360 ret = PTR_ERR(new_fn);
363 jffs2_mark_node_obsolete(c, fn->raw);
364 jffs2_free_full_dnode(fn);
365 f->metadata = new_fn;
367 if (S_ISLNK(inode->i_mode))
372 static int jffs2_garbage_collect_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
373 struct inode *inode, struct jffs2_full_dirent *fd)
375 struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
376 struct jffs2_full_dirent *new_fd;
377 struct jffs2_raw_dirent rd;
378 __u32 alloclen, phys_ofs;
381 rd.magic = JFFS2_MAGIC_BITMASK;
382 rd.nodetype = JFFS2_NODETYPE_DIRENT;
383 rd.nsize = strlen(fd->name);
384 rd.totlen = sizeof(rd) + rd.nsize;
385 rd.hdr_crc = crc32(0, &rd, sizeof(struct jffs2_unknown_node)-4);
387 rd.pino = inode->i_ino;
388 rd.version = ++f->highest_version;
390 rd.mctime = max(inode->i_mtime, inode->i_ctime);
392 rd.node_crc = crc32(0, &rd, sizeof(rd)-8);
393 rd.name_crc = crc32(0, fd->name, rd.nsize);
395 ret = jffs2_reserve_space_gc(c, sizeof(rd)+rd.nsize, &phys_ofs, &alloclen);
397 printk(KERN_WARNING "jffs2_reserve_space_gc of %d bytes for garbage_collect_dirent failed: %d\n",
398 sizeof(rd)+rd.nsize, ret);
401 new_fd = jffs2_write_dirent(inode, &rd, fd->name, rd.nsize, phys_ofs, NULL);
403 if (IS_ERR(new_fd)) {
404 printk(KERN_WARNING "jffs2_write_dirent in garbage_collect_dirent failed: %ld\n", PTR_ERR(new_fd));
405 return PTR_ERR(new_fd);
407 jffs2_add_fd_to_list(c, new_fd, &f->dents);
411 static int jffs2_garbage_collect_deletion_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
412 struct inode *inode, struct jffs2_full_dirent *fd)
414 struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
415 struct jffs2_full_dirent **fdp = &f->dents;
418 /* FIXME: When we run on NAND flash, we need to work out whether
419 this deletion dirent is still needed to actively delete a
420 'real' dirent with the same name that's still somewhere else
421 on the flash. For now, we know that we've actually obliterated
422 all the older dirents when they became obsolete, so we didn't
423 really need to write the deletion to flash in the first place.
434 printk(KERN_WARNING "Deletion dirent \"%s\" not found in list for ino #%lu\n", fd->name, inode->i_ino);
436 jffs2_mark_node_obsolete(c, fd->raw);
437 jffs2_free_full_dirent(fd);
441 static int jffs2_garbage_collect_hole(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
442 struct inode *inode, struct jffs2_full_dnode *fn,
443 __u32 start, __u32 end)
445 struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
446 struct jffs2_raw_inode ri;
447 struct jffs2_node_frag *frag;
448 struct jffs2_full_dnode *new_fn;
449 __u32 alloclen, phys_ofs;
452 D1(printk(KERN_DEBUG "Writing replacement hole node for ino #%lu from offset 0x%x to 0x%x\n",
453 inode->i_ino, start, end));
455 memset(&ri, 0, sizeof(ri));
460 /* It's partially obsoleted by a later write. So we have to
461 write it out again with the _same_ version as before */
462 ret = c->mtd->read(c->mtd, fn->raw->flash_offset & ~3, sizeof(ri), &readlen, (char *)&ri);
463 if (readlen != sizeof(ri) || ret) {
464 printk(KERN_WARNING "Node read failed in jffs2_garbage_collect_hole. Ret %d, retlen %d. Data will be lost by writing new hold node\n", ret, readlen);
467 if (ri.nodetype != JFFS2_NODETYPE_INODE) {
468 printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had node type 0x%04x instead of JFFS2_NODETYPE_INODE(0x%04x)\n",
469 fn->raw->flash_offset & ~3, ri.nodetype, JFFS2_NODETYPE_INODE);
472 if (ri.totlen != sizeof(ri)) {
473 printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had totlen 0x%x instead of expected 0x%x\n",
474 fn->raw->flash_offset & ~3, ri.totlen, sizeof(ri));
477 crc = crc32(0, &ri, sizeof(ri)-8);
478 if (crc != ri.node_crc) {
479 printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had CRC 0x%08x which doesn't match calculated CRC 0x%08x\n",
480 fn->raw->flash_offset & ~3, ri.node_crc, crc);
481 /* FIXME: We could possibly deal with this by writing new holes for each frag */
482 printk(KERN_WARNING "Data in the range 0x%08x to 0x%08x of inode #%lu will be lost\n",
483 start, end, inode->i_ino);
486 if (ri.compr != JFFS2_COMPR_ZERO) {
487 printk(KERN_WARNING "jffs2_garbage_collect_hole: Node 0x%08x wasn't a hole node!\n", fn->raw->flash_offset & ~3);
488 printk(KERN_WARNING "Data in the range 0x%08x to 0x%08x of inode #%lu will be lost\n",
489 start, end, inode->i_ino);
494 ri.magic = JFFS2_MAGIC_BITMASK;
495 ri.nodetype = JFFS2_NODETYPE_INODE;
496 ri.totlen = sizeof(ri);
497 ri.hdr_crc = crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4);
499 ri.ino = inode->i_ino;
500 ri.version = ++f->highest_version;
502 ri.dsize = end - start;
504 ri.compr = JFFS2_COMPR_ZERO;
506 ri.mode = inode->i_mode;
507 ri.uid = inode->i_uid;
508 ri.gid = inode->i_gid;
509 ri.isize = inode->i_size;
510 ri.atime = inode->i_atime;
511 ri.ctime = inode->i_ctime;
512 ri.mtime = inode->i_mtime;
514 ri.node_crc = crc32(0, &ri, sizeof(ri)-8);
516 ret = jffs2_reserve_space_gc(c, sizeof(ri), &phys_ofs, &alloclen);
518 printk(KERN_WARNING "jffs2_reserve_space_gc of %d bytes for garbage_collect_hole failed: %d\n",
522 new_fn = jffs2_write_dnode(inode, &ri, NULL, 0, phys_ofs, NULL);
524 if (IS_ERR(new_fn)) {
525 printk(KERN_WARNING "Error writing new hole node: %ld\n", PTR_ERR(new_fn));
526 return PTR_ERR(new_fn);
528 if (ri.version == f->highest_version) {
529 jffs2_add_full_dnode_to_inode(c, f, new_fn);
531 jffs2_mark_node_obsolete(c, f->metadata->raw);
532 jffs2_free_full_dnode(f->metadata);
539 * We should only get here in the case where the node we are
540 * replacing had more than one frag, so we kept the same version
541 * number as before. (Except in case of error -- see 'goto fill;'
544 D1(if(fn->frags <= 1) {
545 printk(KERN_WARNING "jffs2_garbage_collect_hole: Replacing fn with %d frag(s) but new ver %d != highest_version %d of ino #%d\n",
546 fn->frags, ri.version, f->highest_version, ri.ino);
549 for (frag = f->fraglist; frag; frag = frag->next) {
550 if (frag->ofs > fn->size + fn->ofs)
552 if (frag->node == fn) {
559 printk(KERN_WARNING "jffs2_garbage_collect_hole: Old node still has frags!\n");
562 if (!new_fn->frags) {
563 printk(KERN_WARNING "jffs2_garbage_collect_hole: New node has no frags!\n");
567 jffs2_mark_node_obsolete(c, fn->raw);
568 jffs2_free_full_dnode(fn);
573 static int jffs2_garbage_collect_dnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb,
574 struct inode *inode, struct jffs2_full_dnode *fn,
575 __u32 start, __u32 end)
577 struct jffs2_inode_info *f = JFFS2_INODE_INFO(inode);
578 struct jffs2_full_dnode *new_fn;
579 struct jffs2_raw_inode ri;
580 __u32 alloclen, phys_ofs, offset, orig_end;
582 unsigned char *comprbuf = NULL, *writebuf;
584 unsigned char *pg_ptr;
587 memset(&ri, 0, sizeof(ri));
589 D1(printk(KERN_DEBUG "Writing replacement dnode for ino #%lu from offset 0x%x to 0x%x\n",
590 inode->i_ino, start, end));
595 /* If we're looking at the last node in the block we're
596 garbage-collecting, we allow ourselves to merge as if the
597 block was already erasing. We're likely to be GC'ing a
598 partial page, and the next block we GC is likely to have
599 the other half of this page right at the beginning, which
600 means we'd expand it _then_, as nr_erasing_blocks would have
601 increased since we checked, and in doing so would obsolete
602 the partial node which we'd have written here. Meaning that
603 the GC would churn and churn, and just leave dirty blocks in
606 if(c->nr_free_blocks + c->nr_erasing_blocks > JFFS2_RESERVED_BLOCKS_GCMERGE - (fn->raw->next_phys?0:1)) {
607 /* Shitloads of space */
608 /* FIXME: Integrate this properly with GC calculations */
609 start &= ~(PAGE_CACHE_SIZE-1);
610 end = min_t(__u32, start + PAGE_CACHE_SIZE, inode->i_size);
611 D1(printk(KERN_DEBUG "Plenty of free space, so expanding to write from offset 0x%x to 0x%x\n",
613 if (end < orig_end) {
614 printk(KERN_WARNING "Eep. jffs2_garbage_collect_dnode extended node to write, but it got smaller: start 0x%x, orig_end 0x%x, end 0x%x\n", start, orig_end, end);
619 /* First, use readpage() to read the appropriate page into the page cache */
620 /* Q: What happens if we actually try to GC the _same_ page for which commit_write()
621 * triggered garbage collection in the first place?
622 * A: I _think_ it's OK. read_cache_page shouldn't deadlock, we'll write out the
623 * page OK. We'll actually write it out again in commit_write, which is a little
624 * suboptimal, but at least we're correct.
626 pg = read_cache_page(inode->i_mapping, start >> PAGE_CACHE_SHIFT, (void *)jffs2_do_readpage_unlock, inode);
629 printk(KERN_WARNING "read_cache_page() returned error: %ld\n", PTR_ERR(pg));
632 pg_ptr = (char *)kmap(pg);
633 comprbuf = kmalloc(end - start, GFP_KERNEL);
636 while(offset < orig_end) {
639 char comprtype = JFFS2_COMPR_NONE;
641 ret = jffs2_reserve_space_gc(c, sizeof(ri) + JFFS2_MIN_DATA_LEN, &phys_ofs, &alloclen);
644 printk(KERN_WARNING "jffs2_reserve_space_gc of %d bytes for garbage_collect_dnode failed: %d\n",
645 sizeof(ri)+ JFFS2_MIN_DATA_LEN, ret);
648 cdatalen = min(alloclen - sizeof(ri), end - offset);
649 datalen = end - offset;
651 writebuf = pg_ptr + (offset & (PAGE_CACHE_SIZE -1));
654 comprtype = jffs2_compress(writebuf, comprbuf, &datalen, &cdatalen);
661 ri.magic = JFFS2_MAGIC_BITMASK;
662 ri.nodetype = JFFS2_NODETYPE_INODE;
663 ri.totlen = sizeof(ri) + cdatalen;
664 ri.hdr_crc = crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4);
666 ri.ino = inode->i_ino;
667 ri.version = ++f->highest_version;
668 ri.mode = inode->i_mode;
669 ri.uid = inode->i_uid;
670 ri.gid = inode->i_gid;
671 ri.isize = inode->i_size;
672 ri.atime = inode->i_atime;
673 ri.ctime = inode->i_ctime;
674 ri.mtime = inode->i_mtime;
678 ri.compr = comprtype;
679 ri.node_crc = crc32(0, &ri, sizeof(ri)-8);
680 ri.data_crc = crc32(0, writebuf, cdatalen);
682 new_fn = jffs2_write_dnode(inode, &ri, writebuf, cdatalen, phys_ofs, NULL);
684 if (IS_ERR(new_fn)) {
685 printk(KERN_WARNING "Error writing new dnode: %ld\n", PTR_ERR(new_fn));
686 ret = PTR_ERR(new_fn);
689 ret = jffs2_add_full_dnode_to_inode(c, f, new_fn);
692 jffs2_mark_node_obsolete(c, f->metadata->raw);
693 jffs2_free_full_dnode(f->metadata);
697 if (comprbuf) kfree(comprbuf);
700 /* XXX: Does the page get freed automatically? */
701 /* AAA: Judging by the unmount getting stuck in __wait_on_page, nope. */
702 page_cache_release(pg);