| blob | 9000f1effedf9523991c5692f0c61238e1645809 |
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>
75 #if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
83 #endif
94 /* Is there enough space on the flash? */
96 {
103 }
110 }
111 }
112 }
114 #if CONFIG_JFFS_FS_VERBOSE > 0
115 static __u8
117 {
119 __u8 ret;
126 }
129 }
131 static void
133 {
143 }
147 }
150 }
151 }
153 /* Print empty space */
157 }
160 }
161 }
167 }
170 }
171 }
174 }
175 }
177 /* Print the contents of a node. */
178 static void
180 {
196 }
198 #endif
200 /* Print the contents of a raw inode. */
201 static void
203 {
233 }
235 #define flash_safe_acquire(arg)
236 #define flash_safe_release(arg)
239 static int
242 {
252 }
254 }
257 static __u32
259 {
261 __u32 ret;
268 }
271 }
274 static int
277 {
287 }
289 }
292 static int
295 {
306 }
307 /* Not implemented writev. Repeatedly use write - on the not so
308 unreasonable assumption that the mtd driver doesn't care how
309 many write cycles we use. */
320 }
321 /* If res is non-zero, retlen_a is undefined, but we don't
322 care because in that case it's not going to be
323 returned anyway.
324 */
327 }
329 }
332 static int
335 {
339 /* fill up pattern */
344 /* write as many 64-byte chunks as we can */
350 }
352 /* and the rest */
358 }
361 static void
363 {
369 }
372 static int
375 {
378 wait_queue_head_t wait_q;
392 /* FIXME: Use TASK_INTERRUPTIBLE and deal with being interrupted */
405 }
413 }
415 /* This routine calculates checksums in JFFS. */
416 static __u32
418 {
423 }
426 }
429 static int
431 {
437 /* Allocate read buffer */
442 }
443 /* Loop until checksum done */
445 /* Get amount of data to read */
448 else
451 /* Perform flash read */
455 /* Compute checksum */
459 /* Update pointer and size */
462 }
464 /* Free read buffer */
467 /* Return result */
471 }
474 {
475 // down(&fmc->wlock);
476 }
479 {
480 // up(&fmc->wlock);
481 }
484 /* Create and initialize a new struct jffs_file. */
488 {
492 GFP_KERNEL))) {
495 }
496 no_jffs_file++;
505 }
508 /* Build a control block for the file system. */
511 {
521 }
529 }
535 }
540 fail_fminit:
542 fail_hash:
546 fail_control:
550 }
553 /* Clean up all data structures associated with the file system. */
554 void
556 {
562 }
569 }
571 /* Free all files and nodes. */
577 }
582 }
585 /* This function adds a virtual root node to the in-RAM representation.
586 Called by jffs_build_fs(). */
587 static int
589 {
597 GFP_KERNEL))) {
599 }
600 no_jffs_file++;
603 no_jffs_file--;
605 }
619 }
622 /* This is where the file system is built and initialized. */
623 int
625 {
633 }
638 /* scan_flash() wants us to try once more. A flipping
639 bits sector was detect in the middle of the scan flash.
640 Clean up old allocated memory before going in.
641 */
647 }
653 }
656 }
657 }
659 /* Add a virtual root node if no one exists. */
663 }
664 }
672 }
676 }
678 /* Remove deleted nodes. */
682 }
683 /* Remove redundant nodes. (We are not interested in the
684 return value in this case.) */
686 /* Try to build a tree from all the nodes. */
690 }
691 /* Compute the sizes of all files in the filesystem. Adjust if
692 necessary. */
696 }
705 jffs_build_fs_fail:
711 /*
712 This checks for sectors that were being erased in their previous
713 lifetimes and for some reason or the other (power fail etc.),
714 the erase cycles never completed.
715 As the flash array would have reverted back to read status,
716 these sectors are detected by the symptom of the "flipping bits",
717 i.e. bits being read back differently from the same location in
718 flash if read multiple times.
719 The only solution to this is to re-erase the entire
720 sector.
721 Unfortunately detecting "flipping bits" is not a simple exercise
722 as a bit may be read back at 1 or 0 depending on the alignment
723 of the stars in the universe.
724 The level of confidence is in direct proportion to the number of
725 scans done. By power fail testing I (Vipin) have been able to
726 proove that reading twice is not enough.
727 Maybe 4 times? Change NUM_REREADS to a higher number if you want
728 a (even) higher degree of confidence in your mount process.
729 A higher number would of course slow down your mount.
730 */
735 usually set to kernel page size */
744 __u32 offset;
749 /* Allocate read buffers */
758 }
760 CHECK_NEXT:
775 /* buffers MUST match, double word for word! */
778 ){
779 /* flipping bits detected, time to erase sector */
780 /* This will help us log some statistics etc. */
788 /* calculate start of present sector */
792 offset));
805 offset));
806 /* skip ahead to the next sector */
810 }
811 }
812 }
813 }
815 }
817 returnBack:
821 D2(printk("check_partly_erased_sector():Done checking all sectors till offset 0x%x for flipping bits.\n",
830 /* Scan the whole flash memory in order to find all nodes in the
831 file systems. */
832 static int
834 {
839 __u32 checksum;
840 __u8 tmp_accurate;
841 __u16 tmp_chksum;
842 __u32 deleted_file;
844 loff_t start;
845 loff_t test_start;
849 __u32 offset;
851 __u32 free_chunk_size1;
852 __u32 free_chunk_size2;
857 free blocks found. This is NOT allowed
858 by the current jffs design.
859 */
861 of how much free space was rejected and
862 marked dirty
863 */
870 /*
871 check and make sure that any sector does not suffer
872 from the "partly erased, bit flipping syndrome" (TM Vipin :)
873 If so, offending sectors will be erased.
874 */
879 }
881 /* Allocate read buffer */
886 }
888 /* Start the scan. */
892 /* Remember the position from where we started this scan. */
897 /* We have found 0xffffffff at this position. We have to
898 scan the rest of the flash till the end or till
899 something else than 0xffffffff is found.
900 Keep going till we do not find JFFS_EMPTY_BITMASK
901 anymore */
917 JFFS_EMPTY_BITMASK)
919 }
922 else
924 }
929 /* If some free space ends in the middle of a sector,
930 treat it as dirty rather than clean.
931 This is to handle the case where one thread
932 allocated space for a node, but didn't get to
933 actually _write_ it before power was lost, leaving
934 a gap in the log. Shifting all node writes into
935 a single kernel thread will fix the original problem.
936 */
938 /* If there was free space in previous
939 sectors, don't mark that dirty too -
940 only from the beginning of this sector
941 (or from start)
942 */
948 /* free space started in the previous sector! */
953 /*
954 Count it in if we are still under NUMFREEALLOWED *and* it is
955 at least 1 erase sector in length. This will keep us from
956 picking any little ole' space as "free".
957 */
966 /* below, space from "start" to "pos" will be marked dirty. */
969 /* Being in here means that we have found at least an entire
970 erase sector size of free space ending on a sector boundary.
971 Keep track of free spaces accepted.
972 */
973 num_free_space++;
975 num_free_spc_not_accp++;
981 }
983 }
991 /* "Flipping bits" detected. This means that our scan for them
992 did not catch this offset. See check_partly_erased_sectors() for
993 more info.
994 */
1001 /* calculate start of present sector */
1005 offset));
1017 }
1022 }
1024 /* Being in here means that we have found free space that ends on an erase sector
1025 boundary.
1026 Count it in if we are still under NUMFREEALLOWED *and* it is at least 1 erase
1027 sector in length. This will keep us from picking any little ole' space as "free".
1028 */
1031 /* We really don't do anything to mark space as free, except *not*
1032 mark it dirty and just advance the "pos" location pointer.
1033 It will automatically be picked up as free space.
1034 */
1035 num_free_space++;
1039 num_free_spc_not_accp++;
1045 /* Mark this space as dirty. We already have our free space. */
1050 }
1052 }
1057 }
1061 /* We have found 0x00000000 at this position. Scan as far
1062 as possible to find out how much is dirty. */
1075 /* We have probably found a new raw inode. */
1079 bad_inode:
1080 /* We're f*cked. This is not solved yet. We have
1081 to scan for the magic pattern. */
1083 "bad inode: "
1092 /* handle these in the main switch() loop */
1097 }
1098 }
1100 cont_scan:
1101 /* First, mark as dirty the region
1102 which really does contain crap. */
1105 NULL);
1110 /* We have found the beginning of an inode. Create a
1111 node for it unless there already is one available. */
1114 /* Free read buffer */
1117 /* Release the flash device */
1121 }
1123 }
1125 /* Read the next raw inode. */
1130 /* When we compute the checksum for the inode, we never
1131 count the 'accurate' or the 'checksum' fields. */
1147 "checksum = %u, "
1153 /* Reuse this unused struct jffs_node. */
1155 }
1157 /* Check the raw inode read so far. Start with the
1158 maximum length of the filename. */
1163 }
1171 }
1173 /* The node's data segment should not exceed a
1174 certain length. */
1180 }
1184 /* This shouldn't be necessary because a node that
1185 violates the flash boundaries shouldn't be written
1186 in the first place. */
1189 }
1191 /* Read the name. */
1202 "checksum = %u, "
1207 /* Reuse this unused struct jffs_node. */
1209 }
1212 }
1213 }
1215 /* Read the data, if it exists, in order to be sure it
1216 matches the checksum. */
1220 }
1225 /* Reuse this unused struct jffs_node. */
1227 }
1233 "checksum = %u, "
1238 /* Reuse this unused struct jffs_node. */
1240 }
1241 }
1243 check_node:
1245 /* Remember the highest inode number in the whole file
1246 system. This information will be used when assigning
1247 new files new inode numbers. */
1250 }
1257 /* Compute the offset to the actual data in the
1258 on-flash node. */
1259 node->fm_offset
1265 node);
1271 /* Free read buffer */
1274 /* Release the flash device */
1278 }
1284 }
1289 GFP_KERNEL);
1295 /* Release the flash device */
1298 /* Free read buffer */
1302 }
1307 }
1310 }
1316 /* Reuse this unused struct jffs_node. */
1317 }
1318 }
1323 }
1326 /* Free read buffer */
1332 }
1334 /* Return happy */
1338 /* This is to trap the "free size accounting screwed error. */
1350 Mounting this screwed up f/s will screw us up anyway.
1351 */
1352 }
1358 /* Insert any kind of node into the file system. Take care of data
1359 insertions and deletions. Also remove redundant information. The
1360 memory allocated for the `name' is regarded as "given away" in the
1361 caller's perspective. */
1362 int
1366 {
1375 /* If there doesn't exist an associated jffs_file, then
1376 create, initialize and insert one into the file system. */
1380 }
1383 }
1391 /* Now insert the node at the correct position into the file's
1392 version list. */
1394 /* This is the first node. */
1407 }
1410 /* Insert at the end of the list. I.e. this node is the
1411 newest one so far. */
1425 }
1427 /* Insert at the bottom of the list. */
1434 }
1435 }
1439 /* Search for the insertion position starting from
1440 the tail (newest node). */
1449 }
1451 }
1454 }
1455 }
1456 }
1458 /* Deletion is irreversible. If any 'deleted' node is ever
1459 written, the file is deleted */
1463 /* Perhaps update the name. */
1468 }
1470 GFP_KERNEL))) {
1472 }
1479 }
1486 }
1487 /* Once upon a time, we would call jffs_possibly_delete_file()
1488 here. That causes an oops if someone's still got the file
1489 open, so now we only do it in jffs_delete_inode()
1490 -- dwmw2
1491 */
1494 }
1501 }
1507 /* Unlink a jffs_node from the version list it is in. */
1511 {
1516 }
1521 }
1522 }
1525 /* Unlink a jffs_node from the range list it is in. */
1528 {
1531 }
1534 }
1537 }
1540 }
1541 }
1544 /* Function used by jffs_remove_redundant_nodes() below. This function
1545 classifies what kind of information a node adds to a file. */
1548 {
1553 }
1556 }
1558 }
1561 /* Remove redundant nodes from a file. Mark the on-flash memory
1562 as dirty. */
1563 static int
1565 {
1569 __u8 newest_type;
1570 __u8 mod_type;
1575 }
1577 /* What does the `newest_node' modify? */
1583 newest_type));
1585 /* Traverse the file's nodes and determine which of them that are
1586 superfluous. Yeah, this might look very complex at first
1587 glance but it is actually very simple. */
1593 && (mod_type
1597 /* Yes, this node is redundant. Remove it. */
1599 "Removing node: ino: %u, version: %u, "
1601 mod_type));
1606 }
1609 }
1610 }
1613 }
1616 /* Insert a file into the hash table. */
1617 static int
1619 {
1626 }
1629 /* Insert a file into the file system tree. */
1630 int
1632 {
1645 }
1651 }
1652 }
1657 }
1661 }
1664 /* Remove a file from the hash table. */
1665 static int
1667 {
1673 }
1676 /* Just remove the file from the parent's children. Don't free
1677 any memory. */
1678 int
1680 {
1686 }
1690 }
1693 }
1695 }
1698 /* Find a file with its inode number. */
1701 {
1713 );
1715 }
1718 );
1720 }
1723 /* Find a file in a directory. We are comparing the names. */
1726 {
1736 }
1737 }
1741 }
1747 }
1751 });
1754 }
1757 /* Write a raw inode that takes up a certain amount of space in the flash
1758 memory. At the end of the flash device, there is often space that is
1759 impossible to use. At these times we want to mark this space as not
1760 used. In the cases when the amount of space is greater or equal than
1761 a struct jffs_raw_inode, we write a "dummy node" that takes up this
1762 space. The space after the raw inode, if it exists, is left as it is.
1763 Since this space after the raw inode contains JFFS_EMPTY_BITMASK bytes,
1764 we can compute the checksum of it; we don't have to manipulate it any
1765 further.
1767 If the space left on the device is less than the size of a struct
1768 jffs_raw_inode, this space is filled with JFFS_DIRTY_BITMASK bytes.
1769 No raw inode is written this time. */
1770 static int
1772 {
1787 raw_inode.chksum
1798 }
1799 }
1804 }
1808 }
1811 /* Write a raw inode, possibly its name and possibly some data. */
1812 int
1818 {
1824 __u32 pos;
1835 /* If this node isn't something that will eventually let
1836 GC free even more space, then don't allow it unless
1837 there's at least max_chunk_size space still available
1838 */
1843 /* Fire the retrorockets and shoot the fruiton torpedoes, sir! */
1848 });
1853 });
1858 total_size));
1862 retry:
1867 /* Deadlocks suck. */
1873 }
1875 /* First try to allocate some flash memory. */
1879 /* Just out of space. GC and try again */
1883 total_size));
1885 }
1892 }
1895 }
1903 }
1906 /* The jffs_fm struct that we got is not good enough.
1907 Make that space dirty and try again */
1915 }
1917 }
1923 });
1927 /* Increment the version number here. We can't let the caller
1928 set it beforehand, because we might have had to do GC on a node
1929 of this file - and we'd end up reusing version numbers.
1930 */
1933 D1(printk (KERN_NOTICE "jffs_write_node(): setting version of %s to %d\n", f->name, raw_inode->version));
1935 /* if the file was deleted, set the deleted bit in the raw inode */
1938 }
1940 /* Compute the checksum for the data and name chunks. */
1944 /* The checksum is calculated without the chksum and accurate
1945 fields so set them to zero first. */
1956 /* The actual raw JFFS node */
1961 /* Get name and size if there is one */
1965 iovec_cnt++;
1969 /* Add some extra padding if necessary */
1973 iovec_cnt++;
1974 }
1975 }
1977 /* Get data and size if there is any */
1981 iovec_cnt++;
1982 /* No need to pad this because we're not actually putting
1983 anything after it.
1984 */
1985 }
1994 }
2004 /* Read data from the node and write it to the buffer. 'node_offset'
2005 is how much we have read from this particular node before and which
2006 shouldn't be read again. 'max_size' is how much space there is in
2007 the buffer. */
2008 static int
2011 {
2015 __u32 r;
2029 }
2032 /* Read data from the file's nodes. Write the data to the buffer
2033 'buf'. 'read_offset' tells how much data we should skip. */
2034 int
2036 __u32 size)
2037 {
2050 }
2052 /* First find the node to read data from. */
2059 }
2062 }
2063 }
2065 /* "Cats are living proof that not everything in nature
2066 has to be useful."
2067 - Garrison Keilor ('97) */
2069 /* Fill the buffer. */
2073 /* This node does not refer to real data. */
2077 }
2079 node_offset,
2082 }
2086 }
2089 }
2092 /* Used for traversing all nodes in the hash table. */
2093 int
2095 {
2103 /* We must do _safe, because 'func' might remove the
2104 current file 'f' from the list. */
2110 }
2111 }
2114 }
2117 /* Free all nodes associated with a file. */
2118 static int
2120 {
2132 }
2134 }
2137 /* Free a file and its name. */
2138 static int
2140 {
2147 }
2149 no_jffs_file--;
2151 }
2153 static long
2155 {
2157 }
2159 /* See if a file is deleted. If so, mark that file's nodes as obsolete. */
2160 int
2162 {
2171 });
2174 /* First try to remove all older versions. Commence with
2175 the oldest node. */
2179 }
2182 }
2183 }
2184 /* Unlink the file from the filesystem. */
2187 }
2191 }
2193 }
2196 /* Used in conjunction with jffs_foreach_file() to count the number
2197 of files in the file system. */
2198 int
2200 {
2202 }
2205 /* Build up a file's range list from scratch by going through the
2206 version list. */
2207 static int
2209 {
2217 }
2219 }
2222 /* Remove an amount of data from a file. If this amount of data is
2223 zero, that could mean that a node should be split in two parts.
2224 We remove or change the appropriate nodes in the lists.
2226 Starting offset of area to be removed is node->data_offset,
2227 and the length of the area is in node->removed_size. */
2228 static int
2230 {
2242 /* A simple append; nothing to remove or no node to split. */
2244 }
2246 /* Find the node where we should begin the removal. */
2250 }
2251 }
2253 /* If there's no data in the file there's no data to
2254 remove either. */
2256 }
2259 /* XXX: Not implemented yet. */
2262 }
2264 /* See if the node has to be split into two parts. */
2266 /* Do the split. */
2274 }
2289 }
2292 }
2298 }
2301 }
2302 /* A very interesting can of worms. */
2310 }
2313 }
2315 /* No. No need to split the node. Just remove
2316 the end of the node. */
2322 }
2323 }
2325 /* Remove as many nodes as necessary. */
2337 }
2342 }
2349 }
2350 }
2352 /* Adjust the following nodes' information about offsets etc. */
2356 }
2359 /* It's possible that the removed_size is in fact
2360 * greater than the amount of data we actually thought
2361 * were present in the first place - some of the nodes
2362 * which this node originally obsoleted may already have
2363 * been deleted from the flash by subsequent garbage
2364 * collection.
2365 *
2366 * If this is the case, don't let f->size go negative.
2367 * Bad things would happen :)
2368 */
2372 }
2378 /* Insert some data into a file. Prior to the call to this function,
2379 jffs_delete_data should be called. */
2380 static int
2382 {
2387 /* Find the position where we should insert data. */
2388 retry:
2390 /* A simple append. This is the most common operation. */
2395 }
2400 }
2401 }
2403 /* Trying to insert data into the middle of the file. This
2404 means no problem because jffs_delete_data() has already
2405 prepared the range list for us. */
2408 /* Find the correct place for the insertion and then insert
2409 the node. */
2417 }
2420 }
2424 }
2428 "Couldn't find a place to insert "
2431 });
2432 }
2434 /* Adjust later nodes' offsets etc. */
2439 }
2441 }
2443 /* Okay. This is tricky. This means that we want to insert
2444 data at a place that is beyond the limits of the file as
2445 it is constructed right now. This is actually a common
2446 event that for instance could occur during the mounting
2447 of the file system if a large file have been truncated,
2448 rewritten and then only partially garbage collected. */
2452 /* We need a place holder for the data that is missing in
2453 front of this insertion. This "virtual node" will not
2454 be associated with any space on the flash device. */
2458 }
2474 /* Are there any data at all in the file yet? */
2476 virtual_node->data_offset
2479 virtual_node->data_size
2483 }
2489 }
2494 /* Insert this virtual node in the version list as well. */
2500 virtual_node->version_prev
2502 }
2505 }
2508 }
2509 }
2513 /* Make a new try to insert the node. */
2515 }
2519 }
2522 /* A new node (with data) has been added to the file and now the range
2523 list has to be modified. */
2524 static int
2526 {
2534 /* data_offset == X */
2535 /* data_size == 0 */
2536 /* remove_size == 0 */
2537 }
2539 /* data_offset == X */
2540 /* data_size == 0 */
2541 /* remove_size != 0 */
2544 }
2545 }
2546 }
2548 /* data_offset == X */
2549 /* data_size != 0 */
2550 /* remove_size == Y */
2553 }
2556 }
2557 }
2559 }
2561 /* Print the contents of a file. */
2562 #if 0
2563 int
2565 {
2583 });
2601 }
2604 void
2606 {
2617 }
2618 }
2619 }
2622 void
2624 {
2631 }
2636 }
2648 }
2649 }
2652 }
2655 #if defined(JFFS_MEMORY_DEBUG) && JFFS_MEMORY_DEBUG
2656 void
2658 {
2671 }
2672 #endif
2675 /* Rewrite `size' bytes, and begin at `node'. */
2676 static int
2678 {
2684 __u32 pos;
2685 __u32 pos_dchksum;
2686 __u32 total_name_size;
2687 __u32 total_data_size;
2688 __u32 total_size;
2694 /* Create and initialize the new node. */
2699 }
2710 retry:
2720 }
2722 /* The jffs_fm struct that we got is not big enough. */
2723 /* This should never happen, because we deal with this case
2724 in jffs_garbage_collect_next().*/
2725 printk(KERN_WARNING "jffs_rewrite_data(): Allocated node is too small (%d bytes of %d)\n", fm->size, total_size);
2731 }
2737 }
2740 /* Initialize the raw inode. */
2783 }
2786 /* Write the name to the flash memory. */
2800 }
2803 }
2805 /* Write the data. */
2814 }
2824 "jffs_read_data() "
2827 }
2834 "Write error during rewrite. "
2837 }
2842 }
2845 }
2852 /* Add the checksum. */
2864 }
2866 /* Now make the file system aware of the newly written node. */
2875 /* jffs_garbage_collect_next implements one step in the garbage collect
2876 process and is often called multiple times at each occasion of a
2877 garbage collect. */
2879 static int
2881 {
2886 __u32 size;
2887 __u32 data_size;
2888 __u32 total_name_size;
2889 __u32 extra_available;
2890 __u32 space_needed;
2894 /* Get the oldest node in the flash. */
2903 });
2905 /* Find its corresponding file too. */
2910 "No file to garbage collect! "
2912 /* FIXME: Free the offending node and recover. */
2915 }
2917 /* We always write out the name. Theoretically, we don't need
2918 to, but for now it's easier - because otherwise we'd have
2919 to keep track of how many times the current name exists on
2920 the flash and make sure it never reaches zero.
2922 The current approach means that would be possible to cause
2923 the GC to end up eating its tail by writing lots of nodes
2924 with no name for it to garbage-collect. Hence the change in
2925 inode.c to write names with _every_ node.
2927 It sucks, but it _should_ work.
2928 */
2936 /* Compute how many data it's possible to rewrite at the moment. */
2939 /* And from that, the total size of the chunk we want to write */
2943 /* If that's more than max_chunk_size, reduce it accordingly */
2948 }
2950 /* If we're asking to take up more space than free_chunk_size1
2951 but we _could_ fit in it, shrink accordingly.
2952 */
2957 /* The space left is too small to be of any
2958 use really. */
2965 "jffs_garbage_collect_next: "
2966 "Failed to allocate `dirty' "
2970 }
2975 }
2983 }
2986 /* Calculate the amount of space needed to hold the nodes
2987 which are remaining in the tail */
2990 /* From that, calculate how much 'extra' space we can use to
2991 increase the size of the node we're writing from the size
2992 of the node we're obsoleting
2993 */
2995 /* If we've gone below min_free_size for some reason,
2996 don't fuck up. This is why we have
2997 min_free_size > sector_size. Whinge about it though,
2998 just so I can convince myself my maths is right.
2999 */
3006 }
3008 /* Check that we don't use up any more 'extra' space than
3009 what's available */
3023 };
3038 }
3040 jffs_garbage_collect_next_end:
3046 /* If an obsolete node is partly going to be erased due to garbage
3047 collection, the part that isn't going to be erased must be filled
3048 with zeroes so that the scan of the flash will work smoothly next
3049 time. (The data in the file could for instance be a JFFS image
3050 which could cause enormous confusion during a scan of the flash
3051 device if we didn't do this.)
3052 There are two phases in this procedure: First, the clearing of
3053 the name and data parts of the node. Second, possibly also clearing
3054 a part of the raw inode as well. If the box is power cycled during
3055 the first phase, only the checksum of this node-to-be-cleared-at-
3056 the-end will be wrong. If the box is power cycled during, or after,
3057 the clearing of the raw inode, the information like the length of
3058 the name and data parts are zeroed. The next time the box is
3059 powered up, the scanning algorithm manages this faulty data too
3060 because:
3062 - The checksum is invalid and thus the raw inode must be discarded
3063 in any case.
3064 - If the lengths of the data part or the name part are zeroed, the
3065 scanning just continues after the raw inode. But after the inode
3066 the scanning procedure just finds zeroes which is the same as
3067 dirt.
3069 So, in the end, this could never fail. :-) Even if it does fail,
3070 the scanning algorithm should manage that too. */
3072 static int
3074 {
3077 __u32 zero_offset;
3078 __u32 zero_size;
3079 __u32 zero_offset_data;
3080 __u32 zero_size_data;
3086 }
3088 /* Where and how much shall we clear? */
3092 /* Do we have to clear the raw_inode explicitly? */
3096 }
3098 /* First, clear the name and data fields. */
3105 /* Should we clear a part of the raw inode? */
3107 /* I guess it is ok to clear the raw inode in this order. */
3110 cutting_raw_inode);
3112 }
3117 /* Try to erase as much as possible of the dirt in the flash memory. */
3118 static long
3120 {
3124 __u32 offset;
3134 }
3139 }
3145 }
3149 /* Now, let's try to do the erase. */
3155 /* XXX: Here we should allocate this area as dirty
3156 with jffs_fmalloced or something similar. Now
3157 we just report the error. */
3159 }
3161 #if 0
3162 /* Check if the erased sectors really got erased. */
3163 {
3164 __u32 pos;
3165 __u32 end;
3182 }
3183 }
3189 }
3191 /* XXX: Here we should allocate the memory
3192 with jffs_fmalloced() in order to prevent
3193 JFFS from using this area accidentally. */
3195 }
3196 }
3197 #endif
3199 /* Update the flash memory data structures. */
3203 }
3206 /* There are different criteria that should trigger a garbage collect:
3208 1. There is too much dirt in the memory.
3209 2. The free space is becoming small.
3210 3. There are many versions of a node.
3212 The garbage collect should always be done in a manner that guarantees
3213 that future garbage collects cannot be locked. E.g. Rewritten chunks
3214 should not be too large (span more than one sector in the flash memory
3215 for exemple). Of course there is a limit on how intelligent this garbage
3216 collection can be. */
3219 static int
3221 {
3226 D2(printk("***jffs_garbage_collect_now(): fmc->dirty_size = %u, fmc->free_size = 0x%x\n, fcs1=0x%x, fcs2=0x%x",
3230 // down(&fmc->gclock);
3232 /* If it is possible to garbage collect, do so. */
3244 }
3249 /* Argh */
3253 }
3256 /* Actually, we _may_ have been able to free some,
3257 * if there are many overlapping nodes which aren't
3258 * actually marked dirty because they still have
3259 * some valid data in each.
3260 */
3263 }
3265 /* Let's dare to make a garbage collect. */
3268 "has gone seriously wrong "
3271 }
3275 }
3277 gc_end:
3278 // up(&fmc->gclock);
3284 });
3293 /* Determine if it is reasonable to start garbage collection.
3294 We start a gc pass if either:
3295 - The number of free bytes < MIN_FREE_BYTES && at least one
3296 block is dirty, OR
3297 - The number of dirty bytes > MAX_DIRTY_BYTES
3298 */
3300 {
3304 /* If there's not enough dirty space to free a block, there's no point. */
3308 }
3309 #if 1
3310 /* If there is too much RAM used by the various structures, GC */
3311 if (jffs_get_node_inuse() > (c->fmc->used_size/c->fmc->max_chunk_size * 5 + jffs_get_file_count() * 2 + 50)) {
3312 /* FIXME: Provide proof that this test can be satisfied. We
3313 don't want a filesystem doing endless GC just because this
3314 condition cannot ever be false.
3315 */
3318 }
3319 #endif
3320 /* If there are fewer free bytes than the threshold, GC */
3324 }
3325 /* If there are more dirty bytes than the threshold, GC */
3329 }
3330 /* FIXME: What about the "There are many versions of a node" condition? */
3333 }
3337 {
3338 /* NOTE: We rely on the fact that we have the BKL here.
3339 * Otherwise, the gc_task could go away between the check
3340 * and the wake_up_process()
3341 */
3344 }
3347 /* Kernel threads take (void *) as arguments. Thus we pass
3348 the jffs_control data as a (void *) and then cast it. */
3349 int
3351 {
3365 siginitsetinv (¤t->blocked, sigmask(SIGHUP) | sigmask(SIGKILL) | sigmask(SIGSTOP) | sigmask(SIGCONT));
3373 /* See if we need to start gc. If we don't, go to sleep.
3375 Current implementation is a BAD THING(tm). If we try
3376 to unmount the FS, the unmount operation will sleep waiting
3377 for this thread to exit. We need to arrange to send it a
3378 sig before the umount process sleeps.
3379 */
3385 on immediately - we're a low priority
3386 background task. */
3388 /* Put_super will send a SIGKILL and then wait on the sem.
3389 */
3391 siginfo_t info;
3412 }
3413 }
3428 }
3434 /* Argh. Might as well commit suicide. */
3437 // panic()
3439 }
3441 /* Let's dare to make a garbage collect. */
3444 "has gone seriously wrong "
3446 }
3448 gc_end: