diff options
author | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2008-10-31 05:42:18 -0400 |
---|---|---|
committer | Artem Bityutskiy <Artem.Bityutskiy@nokia.com> | 2008-12-03 06:14:34 -0500 |
commit | 45e12d901fee57bccf90f6940155724954e1aac7 (patch) | |
tree | 7b42cbfdbe35455871a412aab535f481fb2c1c44 /fs/ubifs/lpt.c | |
parent | 552ff3179d1e93a3e982357544c059f3e9a5516e (diff) |
UBIFS: run debugging checks only if they are enabled
Do not forget to check whether lpt debugging is enabled before
running the check functions. This commit also makes some spelling
fixes.
Signed-off-by: Artem Bityutskiy <Artem.Bityutskiy@nokia.com>
Diffstat (limited to 'fs/ubifs/lpt.c')
-rw-r--r-- | fs/ubifs/lpt.c | 3 |
1 files changed, 1 insertions, 2 deletions
diff --git a/fs/ubifs/lpt.c b/fs/ubifs/lpt.c index db8bd0e518b2..93c181c742f2 100644 --- a/fs/ubifs/lpt.c +++ b/fs/ubifs/lpt.c | |||
@@ -36,7 +36,7 @@ | |||
36 | * can be written into a single eraseblock. In that case, garbage collection | 36 | * can be written into a single eraseblock. In that case, garbage collection |
37 | * consists of just writing the whole table, which therefore makes all other | 37 | * consists of just writing the whole table, which therefore makes all other |
38 | * eraseblocks reusable. In the case of the big model, dirty eraseblocks are | 38 | * eraseblocks reusable. In the case of the big model, dirty eraseblocks are |
39 | * selected for garbage collection, which consists are marking the nodes in | 39 | * selected for garbage collection, which consists of marking the clean nodes in |
40 | * that LEB as dirty, and then only the dirty nodes are written out. Also, in | 40 | * that LEB as dirty, and then only the dirty nodes are written out. Also, in |
41 | * the case of the big model, a table of LEB numbers is saved so that the entire | 41 | * the case of the big model, a table of LEB numbers is saved so that the entire |
42 | * LPT does not to be scanned looking for empty eraseblocks when UBIFS is first | 42 | * LPT does not to be scanned looking for empty eraseblocks when UBIFS is first |
@@ -156,7 +156,6 @@ int ubifs_calc_lpt_geom(struct ubifs_info *c) | |||
156 | } | 156 | } |
157 | 157 | ||
158 | c->check_lpt_free = c->big_lpt; | 158 | c->check_lpt_free = c->big_lpt; |
159 | |||
160 | return 0; | 159 | return 0; |
161 | } | 160 | } |
162 | 161 | ||