| blob | 478a74e2e9d58537c6b5d385a3174f6238d33b03 |
1 /*
2 * JFFS -- Journaling Flash File System, Linux implementation.
3 *
4 * Copyright (C) 1999, 2000 Axis Communications, Inc.
5 *
6 * Created by Finn Hakansson <finn@axis.com>.
7 *
8 * This is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * $Id: intrep.c,v 1.102 2001/09/23 23:28:36 dwmw2 Exp $
14 *
15 * Ported to Linux 2.3.x and MTD:
16 * Copyright (C) 2000 Alexander Larsson (alex@cendio.se), Cendio Systems AB
17 *
18 */
20 /* This file contains the code for the internal structure of the
21 Journaling Flash File System, JFFS. */
23 /*
24 * Todo list:
25 *
26 * memcpy_to_flash() and memcpy_from_flash() functions.
27 *
28 * Implementation of hard links.
29 *
30 * Organize the source code in a better way. Against the VFS we could
31 * have jffs_ext.c, and against the block device jffs_int.c.
32 * A better file-internal organization too.
33 *
34 * A better checksum algorithm.
35 *
36 * Consider endianness stuff. ntohl() etc.
37 *
38 * Are we handling the atime, mtime, ctime members of the inode right?
39 *
40 * Remove some duplicated code. Take a look at jffs_write_node() and
41 * jffs_rewrite_data() for instance.
42 *
43 * Implement more meaning of the nlink member in various data structures.
44 * nlink could be used in conjunction with hard links for instance.
45 *
46 * Better memory management. Allocate data structures in larger chunks
47 * if possible.
48 *
49 * If too much meta data is stored, a garbage collect should be issued.
50 * We have experienced problems with too much meta data with for instance
51 * log files.
52 *
53 * Improve the calls to jffs_ioctl(). We would like to retrieve more
54 * information to be able to debug (or to supervise) JFFS during run-time.
55 *
56 */
58 #include <linux/types.h>
59 #include <linux/slab.h>
60 #include <linux/jffs.h>
61 #include <linux/fs.h>
62 #include <linux/stat.h>
63 #include <linux/pagemap.h>
64 #include <linux/mutex.h>
65 #include <asm/byteorder.h>
66 #include <linux/smp_lock.h>
67 #include <linux/time.h>
68 #include <linux/ctype.h>
69 #include <linux/freezer.h>
76 #if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
84 #endif
95 /* Is there enough space on the flash? */
97 {
104 }
111 }
112 }
113 }
115 #if CONFIG_JFFS_FS_VERBOSE > 0
116 static __u8
118 {
120 __u8 ret;
127 }
130 }
132 static void
134 {
144 }
148 }
151 }
152 }
154 /* Print empty space */
158 }
161 }
162 }
168 }
171 }
172 }
175 }
176 }
178 /* Print the contents of a node. */
179 static void
181 {
197 }
199 #endif
201 /* Print the contents of a raw inode. */
202 static void
204 {
234 }
236 #define flash_safe_acquire(arg)
237 #define flash_safe_release(arg)
240 static int
243 {
253 }
255 }
258 static __u32
260 {
262 __u32 ret;
269 }
272 }
275 static int
278 {
288 }
290 }
293 static int
296 {
307 }
308 /* Not implemented writev. Repeatedly use write - on the not so
309 unreasonable assumption that the mtd driver doesn't care how
310 many write cycles we use. */
321 }
322 /* If res is non-zero, retlen_a is undefined, but we don't
323 care because in that case it's not going to be
324 returned anyway.
325 */
328 }
330 }
333 static int
336 {
340 /* fill up pattern */
345 /* write as many 64-byte chunks as we can */
351 }
353 /* and the rest */
359 }
362 static void
364 {
370 }
373 static int
376 {
379 wait_queue_head_t wait_q;
393 /* FIXME: Use TASK_INTERRUPTIBLE and deal with being interrupted */
406 }
414 }
416 /* This routine calculates checksums in JFFS. */
417 static __u32
419 {
424 }
427 }
430 static int
432 {
438 /* Allocate read buffer */
443 }
444 /* Loop until checksum done */
446 /* Get amount of data to read */
449 else
452 /* Perform flash read */
456 /* Compute checksum */
460 /* Update pointer and size */
463 }
465 /* Free read buffer */
468 /* Return result */
472 }
475 {
476 // down(&fmc->wlock);
477 }
480 {
481 // up(&fmc->wlock);
482 }
485 /* Create and initialize a new struct jffs_file. */
489 {
495 }
496 no_jffs_file++;
504 }
507 /* Build a control block for the file system. */
510 {
520 }
528 }
534 }
539 fail_fminit:
541 fail_hash:
545 fail_control:
549 }
552 /* Clean up all data structures associated with the file system. */
553 void
555 {
561 }
568 }
570 /* Free all files and nodes. */
576 }
581 }
584 /* This function adds a virtual root node to the in-RAM representation.
585 Called by jffs_build_fs(). */
586 static int
588 {
597 }
598 no_jffs_file++;
601 no_jffs_file--;
603 }
617 }
620 /* This is where the file system is built and initialized. */
621 int
623 {
631 }
636 /* scan_flash() wants us to try once more. A flipping
637 bits sector was detect in the middle of the scan flash.
638 Clean up old allocated memory before going in.
639 */
645 }
651 }
654 }
655 }
657 /* Add a virtual root node if no one exists. */
661 }
662 }
670 }
674 }
676 /* Remove deleted nodes. */
680 }
681 /* Remove redundant nodes. (We are not interested in the
682 return value in this case.) */
684 /* Try to build a tree from all the nodes. */
688 }
689 /* Compute the sizes of all files in the filesystem. Adjust if
690 necessary. */
694 }
703 jffs_build_fs_fail:
709 /*
710 This checks for sectors that were being erased in their previous
711 lifetimes and for some reason or the other (power fail etc.),
712 the erase cycles never completed.
713 As the flash array would have reverted back to read status,
714 these sectors are detected by the symptom of the "flipping bits",
715 i.e. bits being read back differently from the same location in
716 flash if read multiple times.
717 The only solution to this is to re-erase the entire
718 sector.
719 Unfortunately detecting "flipping bits" is not a simple exercise
720 as a bit may be read back at 1 or 0 depending on the alignment
721 of the stars in the universe.
722 The level of confidence is in direct proportion to the number of
723 scans done. By power fail testing I (Vipin) have been able to
724 proove that reading twice is not enough.
725 Maybe 4 times? Change NUM_REREADS to a higher number if you want
726 a (even) higher degree of confidence in your mount process.
727 A higher number would of course slow down your mount.
728 */
733 usually set to kernel page size */
742 __u32 offset;
747 /* Allocate read buffers */
756 }
758 CHECK_NEXT:
773 /* buffers MUST match, double word for word! */
776 ){
777 /* flipping bits detected, time to erase sector */
778 /* This will help us log some statistics etc. */
786 /* calculate start of present sector */
790 offset));
803 offset));
804 /* skip ahead to the next sector */
808 }
809 }
810 }
811 }
813 }
815 returnBack:
819 D2(printk("check_partly_erased_sector():Done checking all sectors till offset 0x%x for flipping bits.\n",
828 /* Scan the whole flash memory in order to find all nodes in the
829 file systems. */
830 static int
832 {
837 __u32 checksum;
838 __u8 tmp_accurate;
839 __u16 tmp_chksum;
840 __u32 deleted_file;
842 loff_t start;
843 loff_t test_start;
847 __u32 offset;
849 __u32 free_chunk_size1;
850 __u32 free_chunk_size2;
855 free blocks found. This is NOT allowed
856 by the current jffs design.
857 */
859 of how much free space was rejected and
860 marked dirty
861 */
868 /*
869 check and make sure that any sector does not suffer
870 from the "partly erased, bit flipping syndrome" (TM Vipin :)
871 If so, offending sectors will be erased.
872 */
877 }
879 /* Allocate read buffer */
884 }
886 /* Start the scan. */
890 /* Remember the position from where we started this scan. */
895 /* We have found 0xffffffff at this position. We have to
896 scan the rest of the flash till the end or till
897 something else than 0xffffffff is found.
898 Keep going till we do not find JFFS_EMPTY_BITMASK
899 anymore */
915 JFFS_EMPTY_BITMASK)
917 }
920 else
922 }
927 /* If some free space ends in the middle of a sector,
928 treat it as dirty rather than clean.
929 This is to handle the case where one thread
930 allocated space for a node, but didn't get to
931 actually _write_ it before power was lost, leaving
932 a gap in the log. Shifting all node writes into
933 a single kernel thread will fix the original problem.
934 */
936 /* If there was free space in previous
937 sectors, don't mark that dirty too -
938 only from the beginning of this sector
939 (or from start)
940 */
946 /* free space started in the previous sector! */
951 /*
952 Count it in if we are still under NUMFREEALLOWED *and* it is
953 at least 1 erase sector in length. This will keep us from
954 picking any little ole' space as "free".
955 */
964 /* below, space from "start" to "pos" will be marked dirty. */
967 /* Being in here means that we have found at least an entire
968 erase sector size of free space ending on a sector boundary.
969 Keep track of free spaces accepted.
970 */
971 num_free_space++;
973 num_free_spc_not_accp++;
979 }
981 }
989 /* "Flipping bits" detected. This means that our scan for them
990 did not catch this offset. See check_partly_erased_sectors() for
991 more info.
992 */
999 /* calculate start of present sector */
1003 offset));
1015 }
1020 }
1022 /* Being in here means that we have found free space that ends on an erase sector
1023 boundary.
1024 Count it in if we are still under NUMFREEALLOWED *and* it is at least 1 erase
1025 sector in length. This will keep us from picking any little ole' space as "free".
1026 */
1029 /* We really don't do anything to mark space as free, except *not*
1030 mark it dirty and just advance the "pos" location pointer.
1031 It will automatically be picked up as free space.
1032 */
1033 num_free_space++;
1037 num_free_spc_not_accp++;
1043 /* Mark this space as dirty. We already have our free space. */
1048 }
1050 }
1055 }
1059 /* We have found 0x00000000 at this position. Scan as far
1060 as possible to find out how much is dirty. */
1073 /* We have probably found a new raw inode. */
1077 bad_inode:
1078 /* We're f*cked. This is not solved yet. We have
1079 to scan for the magic pattern. */
1081 "bad inode: "
1090 /* handle these in the main switch() loop */
1095 }
1096 }
1098 cont_scan:
1099 /* First, mark as dirty the region
1100 which really does contain crap. */
1103 NULL);
1108 /* We have found the beginning of an inode. Create a
1109 node for it unless there already is one available. */
1112 /* Free read buffer */
1115 /* Release the flash device */
1119 }
1121 }
1123 /* Read the next raw inode. */
1128 /* When we compute the checksum for the inode, we never
1129 count the 'accurate' or the 'checksum' fields. */
1145 "checksum = %u, "
1151 /* Reuse this unused struct jffs_node. */
1153 }
1155 /* Check the raw inode read so far. Start with the
1156 maximum length of the filename. */
1161 }
1169 }
1171 /* The node's data segment should not exceed a
1172 certain length. */
1178 }
1182 /* This shouldn't be necessary because a node that
1183 violates the flash boundaries shouldn't be written
1184 in the first place. */
1187 }
1189 /* Read the name. */
1200 "checksum = %u, "
1205 /* Reuse this unused struct jffs_node. */
1207 }
1210 }
1211 }
1213 /* Read the data, if it exists, in order to be sure it
1214 matches the checksum. */
1218 }
1223 /* Reuse this unused struct jffs_node. */
1225 }
1231 "checksum = %u, "
1236 /* Reuse this unused struct jffs_node. */
1238 }
1239 }
1241 check_node:
1243 /* Remember the highest inode number in the whole file
1244 system. This information will be used when assigning
1245 new files new inode numbers. */
1248 }
1255 /* Compute the offset to the actual data in the
1256 on-flash node. */
1257 node->fm_offset
1263 node);
1269 /* Free read buffer */
1272 /* Release the flash device */
1276 }
1282 }
1287 GFP_KERNEL);
1293 /* Release the flash device */
1296 /* Free read buffer */
1300 }
1305 }
1308 }
1314 /* Reuse this unused struct jffs_node. */
1315 }
1316 }
1321 }
1324 /* Free read buffer */
1330 }
1332 /* Return happy */
1336 /* This is to trap the "free size accounting screwed error. */
1348 Mounting this screwed up f/s will screw us up anyway.
1349 */
1350 }
1356 /* Insert any kind of node into the file system. Take care of data
1357 insertions and deletions. Also remove redundant information. The
1358 memory allocated for the `name' is regarded as "given away" in the
1359 caller's perspective. */
1360 int
1364 {
1373 /* If there doesn't exist an associated jffs_file, then
1374 create, initialize and insert one into the file system. */
1378 }
1381 }
1389 /* Now insert the node at the correct position into the file's
1390 version list. */
1392 /* This is the first node. */
1405 }
1408 /* Insert at the end of the list. I.e. this node is the
1409 newest one so far. */
1423 }
1425 /* Insert at the bottom of the list. */
1432 }
1433 }
1437 /* Search for the insertion position starting from
1438 the tail (newest node). */
1447 }
1449 }
1452 }
1453 }
1454 }
1456 /* Deletion is irreversible. If any 'deleted' node is ever
1457 written, the file is deleted */
1461 /* Perhaps update the name. */
1466 }
1468 GFP_KERNEL))) {
1470 }
1477 }
1484 }
1485 /* Once upon a time, we would call jffs_possibly_delete_file()
1486 here. That causes an oops if someone's still got the file
1487 open, so now we only do it in jffs_delete_inode()
1488 -- dwmw2
1489 */
1492 }
1499 }
1505 /* Unlink a jffs_node from the version list it is in. */
1509 {
1514 }
1519 }
1520 }
1523 /* Unlink a jffs_node from the range list it is in. */
1526 {
1529 }
1532 }
1535 }
1538 }
1539 }
1542 /* Function used by jffs_remove_redundant_nodes() below. This function
1543 classifies what kind of information a node adds to a file. */
1546 {
1551 }
1554 }
1556 }
1559 /* Remove redundant nodes from a file. Mark the on-flash memory
1560 as dirty. */
1561 static int
1563 {
1567 __u8 newest_type;
1568 __u8 mod_type;
1573 }
1575 /* What does the `newest_node' modify? */
1581 newest_type));
1583 /* Traverse the file's nodes and determine which of them that are
1584 superfluous. Yeah, this might look very complex at first
1585 glance but it is actually very simple. */
1591 && (mod_type
1595 /* Yes, this node is redundant. Remove it. */
1597 "Removing node: ino: %u, version: %u, "
1599 mod_type));
1604 }
1607 }
1608 }
1611 }
1614 /* Insert a file into the hash table. */
1615 static int
1617 {
1624 }
1627 /* Insert a file into the file system tree. */
1628 int
1630 {
1643 }
1649 }
1650 }
1655 }
1659 }
1662 /* Remove a file from the hash table. */
1663 static int
1665 {
1671 }
1674 /* Just remove the file from the parent's children. Don't free
1675 any memory. */
1676 int
1678 {
1684 }
1688 }
1691 }
1693 }
1696 /* Find a file with its inode number. */
1699 {
1711 );
1713 }
1716 );
1718 }
1721 /* Find a file in a directory. We are comparing the names. */
1724 {
1734 }
1735 }
1739 }
1745 }
1749 });
1752 }
1755 /* Write a raw inode that takes up a certain amount of space in the flash
1756 memory. At the end of the flash device, there is often space that is
1757 impossible to use. At these times we want to mark this space as not
1758 used. In the cases when the amount of space is greater or equal than
1759 a struct jffs_raw_inode, we write a "dummy node" that takes up this
1760 space. The space after the raw inode, if it exists, is left as it is.
1761 Since this space after the raw inode contains JFFS_EMPTY_BITMASK bytes,
1762 we can compute the checksum of it; we don't have to manipulate it any
1763 further.
1765 If the space left on the device is less than the size of a struct
1766 jffs_raw_inode, this space is filled with JFFS_DIRTY_BITMASK bytes.
1767 No raw inode is written this time. */
1768 static int
1770 {
1785 raw_inode.chksum
1796 }
1797 }
1802 }
1806 }
1809 /* Write a raw inode, possibly its name and possibly some data. */
1810 int
1816 {
1822 __u32 pos;
1833 /* If this node isn't something that will eventually let
1834 GC free even more space, then don't allow it unless
1835 there's at least max_chunk_size space still available
1836 */
1841 /* Fire the retrorockets and shoot the fruiton torpedoes, sir! */
1846 });
1851 });
1856 total_size));
1860 retry:
1865 /* Deadlocks suck. */
1871 }
1873 /* First try to allocate some flash memory. */
1877 /* Just out of space. GC and try again */
1881 total_size));
1883 }
1890 }
1893 }
1901 }
1904 /* The jffs_fm struct that we got is not good enough.
1905 Make that space dirty and try again */
1913 }
1915 }
1921 });
1925 /* Increment the version number here. We can't let the caller
1926 set it beforehand, because we might have had to do GC on a node
1927 of this file - and we'd end up reusing version numbers.
1928 */
1931 D1(printk (KERN_NOTICE "jffs_write_node(): setting version of %s to %d\n", f->name, raw_inode->version));
1933 /* if the file was deleted, set the deleted bit in the raw inode */
1936 }
1938 /* Compute the checksum for the data and name chunks. */
1942 /* The checksum is calculated without the chksum and accurate
1943 fields so set them to zero first. */
1954 /* The actual raw JFFS node */
1959 /* Get name and size if there is one */
1963 iovec_cnt++;
1967 /* Add some extra padding if necessary */
1971 iovec_cnt++;
1972 }
1973 }
1975 /* Get data and size if there is any */
1979 iovec_cnt++;
1980 /* No need to pad this because we're not actually putting
1981 anything after it.
1982 */
1983 }
1992 }
2002 /* Read data from the node and write it to the buffer. 'node_offset'
2003 is how much we have read from this particular node before and which
2004 shouldn't be read again. 'max_size' is how much space there is in
2005 the buffer. */
2006 static int
2009 {
2013 __u32 r;
2027 }
2030 /* Read data from the file's nodes. Write the data to the buffer
2031 'buf'. 'read_offset' tells how much data we should skip. */
2032 int
2034 __u32 size)
2035 {
2048 }
2050 /* First find the node to read data from. */
2057 }
2060 }
2061 }
2063 /* "Cats are living proof that not everything in nature
2064 has to be useful."
2065 - Garrison Keilor ('97) */
2067 /* Fill the buffer. */
2071 /* This node does not refer to real data. */
2075 }
2077 node_offset,
2080 }
2084 }
2087 }
2090 /* Used for traversing all nodes in the hash table. */
2091 int
2093 {
2101 /* We must do _safe, because 'func' might remove the
2102 current file 'f' from the list. */
2108 }
2109 }
2112 }
2115 /* Free all nodes associated with a file. */
2116 static int
2118 {
2130 }
2132 }
2135 /* Free a file and its name. */
2136 static int
2138 {
2145 }
2147 no_jffs_file--;
2149 }
2151 static long
2153 {
2155 }
2157 /* See if a file is deleted. If so, mark that file's nodes as obsolete. */
2158 int
2160 {
2169 });
2172 /* First try to remove all older versions. Commence with
2173 the oldest node. */
2177 }
2180 }
2181 }
2182 /* Unlink the file from the filesystem. */
2185 }
2189 }
2191 }
2194 /* Used in conjunction with jffs_foreach_file() to count the number
2195 of files in the file system. */
2196 int
2198 {
2200 }
2203 /* Build up a file's range list from scratch by going through the
2204 version list. */
2205 static int
2207 {
2215 }
2217 }
2220 /* Remove an amount of data from a file. If this amount of data is
2221 zero, that could mean that a node should be split in two parts.
2222 We remove or change the appropriate nodes in the lists.
2224 Starting offset of area to be removed is node->data_offset,
2225 and the length of the area is in node->removed_size. */
2226 static int
2228 {
2240 /* A simple append; nothing to remove or no node to split. */
2242 }
2244 /* Find the node where we should begin the removal. */
2248 }
2249 }
2251 /* If there's no data in the file there's no data to
2252 remove either. */
2254 }
2257 /* XXX: Not implemented yet. */
2260 }
2262 /* See if the node has to be split into two parts. */
2264 /* Do the split. */
2272 }
2287 }
2290 }
2296 }
2299 }
2300 /* A very interesting can of worms. */
2308 }
2311 }
2313 /* No. No need to split the node. Just remove
2314 the end of the node. */
2320 }
2321 }
2323 /* Remove as many nodes as necessary. */
2335 }
2340 }
2347 }
2348 }
2350 /* Adjust the following nodes' information about offsets etc. */
2354 }
2357 /* It's possible that the removed_size is in fact
2358 * greater than the amount of data we actually thought
2359 * were present in the first place - some of the nodes
2360 * which this node originally obsoleted may already have
2361 * been deleted from the flash by subsequent garbage
2362 * collection.
2363 *
2364 * If this is the case, don't let f->size go negative.
2365 * Bad things would happen :)
2366 */
2370 }
2376 /* Insert some data into a file. Prior to the call to this function,
2377 jffs_delete_data should be called. */
2378 static int
2380 {
2385 /* Find the position where we should insert data. */
2386 retry:
2388 /* A simple append. This is the most common operation. */
2393 }
2398 }
2399 }
2401 /* Trying to insert data into the middle of the file. This
2402 means no problem because jffs_delete_data() has already
2403 prepared the range list for us. */
2406 /* Find the correct place for the insertion and then insert
2407 the node. */
2415 }
2418 }
2422 }
2426 "Couldn't find a place to insert "
2429 });
2430 }
2432 /* Adjust later nodes' offsets etc. */
2437 }
2439 }
2441 /* Okay. This is tricky. This means that we want to insert
2442 data at a place that is beyond the limits of the file as
2443 it is constructed right now. This is actually a common
2444 event that for instance could occur during the mounting
2445 of the file system if a large file have been truncated,
2446 rewritten and then only partially garbage collected. */
2450 /* We need a place holder for the data that is missing in
2451 front of this insertion. This "virtual node" will not
2452 be associated with any space on the flash device. */
2456 }
2472 /* Are there any data at all in the file yet? */
2474 virtual_node->data_offset
2477 virtual_node->data_size
2481 }
2487 }
2492 /* Insert this virtual node in the version list as well. */
2498 virtual_node->version_prev
2500 }
2503 }
2506 }
2507 }
2511 /* Make a new try to insert the node. */
2513 }
2517 }
2520 /* A new node (with data) has been added to the file and now the range
2521 list has to be modified. */
2522 static int
2524 {
2532 /* data_offset == X */
2533 /* data_size == 0 */
2534 /* remove_size == 0 */
2535 }
2537 /* data_offset == X */
2538 /* data_size == 0 */
2539 /* remove_size != 0 */
2542 }
2543 }
2544 }
2546 /* data_offset == X */
2547 /* data_size != 0 */
2548 /* remove_size == Y */
2551 }
2554 }
2555 }
2557 }
2559 /* Print the contents of a file. */
2560 #if 0
2561 int
2563 {
2581 });
2599 }
2602 void
2604 {
2615 }
2616 }
2617 }
2620 void
2622 {
2629 }
2634 }
2646 }
2647 }
2650 }
2653 #if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
2654 void
2656 {
2669 }
2670 #endif
2673 /* Rewrite `size' bytes, and begin at `node'. */
2674 static int
2676 {
2682 __u32 pos;
2683 __u32 pos_dchksum;
2684 __u32 total_name_size;
2685 __u32 total_data_size;
2686 __u32 total_size;
2692 /* Create and initialize the new node. */
2697 }
2708 retry:
2718 }
2720 /* The jffs_fm struct that we got is not big enough. */
2721 /* This should never happen, because we deal with this case
2722 in jffs_garbage_collect_next().*/
2723 printk(KERN_WARNING "jffs_rewrite_data(): Allocated node is too small (%d bytes of %d)\n", fm->size, total_size);
2729 }
2735 }
2738 /* Initialize the raw inode. */
2781 }
2784 /* Write the name to the flash memory. */
2798 }
2801 }
2803 /* Write the data. */
2812 }
2822 "jffs_read_data() "
2825 }
2832 "Write error during rewrite. "
2835 }
2840 }
2843 }
2850 /* Add the checksum. */
2862 }
2864 /* Now make the file system aware of the newly written node. */
2873 /* jffs_garbage_collect_next implements one step in the garbage collect
2874 process and is often called multiple times at each occasion of a
2875 garbage collect. */
2877 static int
2879 {
2884 __u32 size;
2885 __u32 data_size;
2886 __u32 total_name_size;
2887 __u32 extra_available;
2888 __u32 space_needed;
2892 /* Get the oldest node in the flash. */
2901 });
2903 /* Find its corresponding file too. */
2908 "No file to garbage collect! "
2910 /* FIXME: Free the offending node and recover. */
2913 }
2915 /* We always write out the name. Theoretically, we don't need
2916 to, but for now it's easier - because otherwise we'd have
2917 to keep track of how many times the current name exists on
2918 the flash and make sure it never reaches zero.
2920 The current approach means that would be possible to cause
2921 the GC to end up eating its tail by writing lots of nodes
2922 with no name for it to garbage-collect. Hence the change in
2923 inode.c to write names with _every_ node.
2925 It sucks, but it _should_ work.
2926 */
2934 /* Compute how many data it's possible to rewrite at the moment. */
2937 /* And from that, the total size of the chunk we want to write */
2941 /* If that's more than max_chunk_size, reduce it accordingly */
2946 }
2948 /* If we're asking to take up more space than free_chunk_size1
2949 but we _could_ fit in it, shrink accordingly.
2950 */
2955 /* The space left is too small to be of any
2956 use really. */
2963 "jffs_garbage_collect_next: "
2964 "Failed to allocate `dirty' "
2968 }
2973 }
2981 }
2984 /* Calculate the amount of space needed to hold the nodes
2985 which are remaining in the tail */
2988 /* From that, calculate how much 'extra' space we can use to
2989 increase the size of the node we're writing from the size
2990 of the node we're obsoleting
2991 */
2993 /* If we've gone below min_free_size for some reason,
2994 don't fuck up. This is why we have
2995 min_free_size > sector_size. Whinge about it though,
2996 just so I can convince myself my maths is right.
2997 */
3004 }
3006 /* Check that we don't use up any more 'extra' space than
3007 what's available */
3021 };
3036 }
3038 jffs_garbage_collect_next_end:
3044 /* If an obsolete node is partly going to be erased due to garbage
3045 collection, the part that isn't going to be erased must be filled
3046 with zeroes so that the scan of the flash will work smoothly next
3047 time. (The data in the file could for instance be a JFFS image
3048 which could cause enormous confusion during a scan of the flash
3049 device if we didn't do this.)
3050 There are two phases in this procedure: First, the clearing of
3051 the name and data parts of the node. Second, possibly also clearing
3052 a part of the raw inode as well. If the box is power cycled during
3053 the first phase, only the checksum of this node-to-be-cleared-at-
3054 the-end will be wrong. If the box is power cycled during, or after,
3055 the clearing of the raw inode, the information like the length of
3056 the name and data parts are zeroed. The next time the box is
3057 powered up, the scanning algorithm manages this faulty data too
3058 because:
3060 - The checksum is invalid and thus the raw inode must be discarded
3061 in any case.
3062 - If the lengths of the data part or the name part are zeroed, the
3063 scanning just continues after the raw inode. But after the inode
3064 the scanning procedure just finds zeroes which is the same as
3065 dirt.
3067 So, in the end, this could never fail. :-) Even if it does fail,
3068 the scanning algorithm should manage that too. */
3070 static int
3072 {
3075 __u32 zero_offset;
3076 __u32 zero_size;
3077 __u32 zero_offset_data;
3078 __u32 zero_size_data;
3084 }
3086 /* Where and how much shall we clear? */
3090 /* Do we have to clear the raw_inode explicitly? */
3094 }
3096 /* First, clear the name and data fields. */
3103 /* Should we clear a part of the raw inode? */
3105 /* I guess it is ok to clear the raw inode in this order. */
3108 cutting_raw_inode);
3110 }
3115 /* Try to erase as much as possible of the dirt in the flash memory. */
3116 static long
3118 {
3122 __u32 offset;
3132 }
3137 }
3143 }
3147 /* Now, let's try to do the erase. */
3153 /* XXX: Here we should allocate this area as dirty
3154 with jffs_fmalloced or something similar. Now
3155 we just report the error. */
3157 }
3159 #if 0
3160 /* Check if the erased sectors really got erased. */
3161 {
3162 __u32 pos;
3163 __u32 end;
3180 }
3181 }
3187 }
3189 /* XXX: Here we should allocate the memory
3190 with jffs_fmalloced() in order to prevent
3191 JFFS from using this area accidentally. */
3193 }
3194 }
3195 #endif
3197 /* Update the flash memory data structures. */
3201 }
3204 /* There are different criteria that should trigger a garbage collect:
3206 1. There is too much dirt in the memory.
3207 2. The free space is becoming small.
3208 3. There are many versions of a node.
3210 The garbage collect should always be done in a manner that guarantees
3211 that future garbage collects cannot be locked. E.g. Rewritten chunks
3212 should not be too large (span more than one sector in the flash memory
3213 for exemple). Of course there is a limit on how intelligent this garbage
3214 collection can be. */
3217 static int
3219 {
3224 D2(printk("***jffs_garbage_collect_now(): fmc->dirty_size = %u, fmc->free_size = 0x%x\n, fcs1=0x%x, fcs2=0x%x",
3228 // down(&fmc->gclock);
3230 /* If it is possible to garbage collect, do so. */
3242 }
3247 /* Argh */
3251 }
3254 /* Actually, we _may_ have been able to free some,
3255 * if there are many overlapping nodes which aren't
3256 * actually marked dirty because they still have
3257 * some valid data in each.
3258 */
3261 }
3263 /* Let's dare to make a garbage collect. */
3266 "has gone seriously wrong "
3269 }
3273 }
3275 gc_end:
3276 // up(&fmc->gclock);
3282 });
3291 /* Determine if it is reasonable to start garbage collection.
3292 We start a gc pass if either:
3293 - The number of free bytes < MIN_FREE_BYTES && at least one
3294 block is dirty, OR
3295 - The number of dirty bytes > MAX_DIRTY_BYTES
3296 */
3298 {
3302 /* If there's not enough dirty space to free a block, there's no point. */
3306 }
3307 #if 1
3308 /* If there is too much RAM used by the various structures, GC */
3309 if (jffs_get_node_inuse() > (c->fmc->used_size/c->fmc->max_chunk_size * 5 + jffs_get_file_count() * 2 + 50)) {
3310 /* FIXME: Provide proof that this test can be satisfied. We
3311 don't want a filesystem doing endless GC just because this
3312 condition cannot ever be false.
3313 */
3316 }
3317 #endif
3318 /* If there are fewer free bytes than the threshold, GC */
3322 }
3323 /* If there are more dirty bytes than the threshold, GC */
3327 }
3328 /* FIXME: What about the "There are many versions of a node" condition? */
3331 }
3335 {
3336 /* NOTE: We rely on the fact that we have the BKL here.
3337 * Otherwise, the gc_task could go away between the check
3338 * and the wake_up_process()
3339 */
3342 }
3345 /* Kernel threads take (void *) as arguments. Thus we pass
3346 the jffs_control data as a (void *) and then cast it. */
3347 int
3349 {
3363 siginitsetinv (¤t->blocked, sigmask(SIGHUP) | sigmask(SIGKILL) | sigmask(SIGSTOP) | sigmask(SIGCONT));
3371 /* See if we need to start gc. If we don't, go to sleep.
3373 Current implementation is a BAD THING(tm). If we try
3374 to unmount the FS, the unmount operation will sleep waiting
3375 for this thread to exit. We need to arrange to send it a
3376 sig before the umount process sleeps.
3377 */
3383 on immediately - we're a low priority
3384 background task. */
3386 /* Put_super will send a SIGKILL and then wait on the sem.
3387 */
3389 siginfo_t info;
3410 }
3411 }
3426 }
3432 /* Argh. Might as well commit suicide. */
3435 // panic()
3437 }
3439 /* Let's dare to make a garbage collect. */
3442 "has gone seriously wrong "
3444 }
3446 gc_end: