]>
git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blob - fs/ubifs/sb.c
2 * This file is part of UBIFS.
4 * Copyright (C) 2006-2008 Nokia Corporation.
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 as published by
8 * the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 51
17 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Authors: Artem Bityutskiy (Битюцкий Артём)
24 * This file implements UBIFS superblock. The superblock is stored at the first
25 * LEB of the volume and is never changed by UBIFS. Only user-space tools may
26 * change it. The superblock node mostly contains geometry information.
30 #include <linux/slab.h>
31 #include <linux/random.h>
32 #include <linux/math64.h>
35 * Default journal size in logical eraseblocks as a percent of total
38 #define DEFAULT_JNL_PERCENT 5
40 /* Default maximum journal size in bytes */
41 #define DEFAULT_MAX_JNL (32*1024*1024)
43 /* Default indexing tree fanout */
44 #define DEFAULT_FANOUT 8
46 /* Default number of data journal heads */
47 #define DEFAULT_JHEADS_CNT 1
49 /* Default positions of different LEBs in the main area */
50 #define DEFAULT_IDX_LEB 0
51 #define DEFAULT_DATA_LEB 1
52 #define DEFAULT_GC_LEB 2
54 /* Default number of LEB numbers in LPT's save table */
55 #define DEFAULT_LSAVE_CNT 256
57 /* Default reserved pool size as a percent of maximum free space */
58 #define DEFAULT_RP_PERCENT 5
60 /* The default maximum size of reserved pool in bytes */
61 #define DEFAULT_MAX_RP_SIZE (5*1024*1024)
63 /* Default time granularity in nanoseconds */
64 #define DEFAULT_TIME_GRAN 1000000000
67 * create_default_filesystem - format empty UBI volume.
68 * @c: UBIFS file-system description object
70 * This function creates default empty file-system. Returns zero in case of
71 * success and a negative error code in case of failure.
73 static int create_default_filesystem(struct ubifs_info
*c
)
75 struct ubifs_sb_node
*sup
;
76 struct ubifs_mst_node
*mst
;
77 struct ubifs_idx_node
*idx
;
78 struct ubifs_branch
*br
;
79 struct ubifs_ino_node
*ino
;
80 struct ubifs_cs_node
*cs
;
82 int err
, tmp
, jnl_lebs
, log_lebs
, max_buds
, main_lebs
, main_first
;
83 int lpt_lebs
, lpt_first
, orph_lebs
, big_lpt
, ino_waste
, sup_flags
= 0;
84 int min_leb_cnt
= UBIFS_MIN_LEB_CNT
;
85 long long tmp64
, main_bytes
;
88 /* Some functions called from here depend on the @c->key_len filed */
89 c
->key_len
= UBIFS_SK_LEN
;
92 * First of all, we have to calculate default file-system geometry -
93 * log size, journal size, etc.
95 if (c
->leb_cnt
< 0x7FFFFFFF / DEFAULT_JNL_PERCENT
)
96 /* We can first multiply then divide and have no overflow */
97 jnl_lebs
= c
->leb_cnt
* DEFAULT_JNL_PERCENT
/ 100;
99 jnl_lebs
= (c
->leb_cnt
/ 100) * DEFAULT_JNL_PERCENT
;
101 if (jnl_lebs
< UBIFS_MIN_JNL_LEBS
)
102 jnl_lebs
= UBIFS_MIN_JNL_LEBS
;
103 if (jnl_lebs
* c
->leb_size
> DEFAULT_MAX_JNL
)
104 jnl_lebs
= DEFAULT_MAX_JNL
/ c
->leb_size
;
107 * The log should be large enough to fit reference nodes for all bud
108 * LEBs. Because buds do not have to start from the beginning of LEBs
109 * (half of the LEB may contain committed data), the log should
110 * generally be larger, make it twice as large.
112 tmp
= 2 * (c
->ref_node_alsz
* jnl_lebs
) + c
->leb_size
- 1;
113 log_lebs
= tmp
/ c
->leb_size
;
114 /* Plus one LEB reserved for commit */
116 if (c
->leb_cnt
- min_leb_cnt
> 8) {
117 /* And some extra space to allow writes while committing */
122 max_buds
= jnl_lebs
- log_lebs
;
123 if (max_buds
< UBIFS_MIN_BUD_LEBS
)
124 max_buds
= UBIFS_MIN_BUD_LEBS
;
127 * Orphan nodes are stored in a separate area. One node can store a lot
128 * of orphan inode numbers, but when new orphan comes we just add a new
129 * orphan node. At some point the nodes are consolidated into one
132 orph_lebs
= UBIFS_MIN_ORPH_LEBS
;
133 if (c
->leb_cnt
- min_leb_cnt
> 1)
135 * For debugging purposes it is better to have at least 2
136 * orphan LEBs, because the orphan subsystem would need to do
137 * consolidations and would be stressed more.
141 main_lebs
= c
->leb_cnt
- UBIFS_SB_LEBS
- UBIFS_MST_LEBS
- log_lebs
;
142 main_lebs
-= orph_lebs
;
144 lpt_first
= UBIFS_LOG_LNUM
+ log_lebs
;
145 c
->lsave_cnt
= DEFAULT_LSAVE_CNT
;
146 c
->max_leb_cnt
= c
->leb_cnt
;
147 err
= ubifs_create_dflt_lpt(c
, &main_lebs
, lpt_first
, &lpt_lebs
,
152 dbg_gen("LEB Properties Tree created (LEBs %d-%d)", lpt_first
,
153 lpt_first
+ lpt_lebs
- 1);
155 main_first
= c
->leb_cnt
- main_lebs
;
157 /* Create default superblock */
158 tmp
= ALIGN(UBIFS_SB_NODE_SZ
, c
->min_io_size
);
159 sup
= kzalloc(tmp
, GFP_KERNEL
);
163 tmp64
= (long long)max_buds
* c
->leb_size
;
165 sup_flags
|= UBIFS_FLG_BIGLPT
;
167 sup
->ch
.node_type
= UBIFS_SB_NODE
;
168 sup
->key_hash
= UBIFS_KEY_HASH_R5
;
169 sup
->flags
= cpu_to_le32(sup_flags
);
170 sup
->min_io_size
= cpu_to_le32(c
->min_io_size
);
171 sup
->leb_size
= cpu_to_le32(c
->leb_size
);
172 sup
->leb_cnt
= cpu_to_le32(c
->leb_cnt
);
173 sup
->max_leb_cnt
= cpu_to_le32(c
->max_leb_cnt
);
174 sup
->max_bud_bytes
= cpu_to_le64(tmp64
);
175 sup
->log_lebs
= cpu_to_le32(log_lebs
);
176 sup
->lpt_lebs
= cpu_to_le32(lpt_lebs
);
177 sup
->orph_lebs
= cpu_to_le32(orph_lebs
);
178 sup
->jhead_cnt
= cpu_to_le32(DEFAULT_JHEADS_CNT
);
179 sup
->fanout
= cpu_to_le32(DEFAULT_FANOUT
);
180 sup
->lsave_cnt
= cpu_to_le32(c
->lsave_cnt
);
181 sup
->fmt_version
= cpu_to_le32(UBIFS_FORMAT_VERSION
);
182 sup
->time_gran
= cpu_to_le32(DEFAULT_TIME_GRAN
);
183 if (c
->mount_opts
.override_compr
)
184 sup
->default_compr
= cpu_to_le16(c
->mount_opts
.compr_type
);
186 sup
->default_compr
= cpu_to_le16(UBIFS_COMPR_LZO
);
188 generate_random_uuid(sup
->uuid
);
190 main_bytes
= (long long)main_lebs
* c
->leb_size
;
191 tmp64
= div_u64(main_bytes
* DEFAULT_RP_PERCENT
, 100);
192 if (tmp64
> DEFAULT_MAX_RP_SIZE
)
193 tmp64
= DEFAULT_MAX_RP_SIZE
;
194 sup
->rp_size
= cpu_to_le64(tmp64
);
195 sup
->ro_compat_version
= cpu_to_le32(UBIFS_RO_COMPAT_VERSION
);
197 err
= ubifs_write_node(c
, sup
, UBIFS_SB_NODE_SZ
, 0, 0);
202 dbg_gen("default superblock created at LEB 0:0");
204 /* Create default master node */
205 mst
= kzalloc(c
->mst_node_alsz
, GFP_KERNEL
);
209 mst
->ch
.node_type
= UBIFS_MST_NODE
;
210 mst
->log_lnum
= cpu_to_le32(UBIFS_LOG_LNUM
);
211 mst
->highest_inum
= cpu_to_le64(UBIFS_FIRST_INO
);
213 mst
->root_lnum
= cpu_to_le32(main_first
+ DEFAULT_IDX_LEB
);
215 tmp
= ubifs_idx_node_sz(c
, 1);
216 mst
->root_len
= cpu_to_le32(tmp
);
217 mst
->gc_lnum
= cpu_to_le32(main_first
+ DEFAULT_GC_LEB
);
218 mst
->ihead_lnum
= cpu_to_le32(main_first
+ DEFAULT_IDX_LEB
);
219 mst
->ihead_offs
= cpu_to_le32(ALIGN(tmp
, c
->min_io_size
));
220 mst
->index_size
= cpu_to_le64(ALIGN(tmp
, 8));
221 mst
->lpt_lnum
= cpu_to_le32(c
->lpt_lnum
);
222 mst
->lpt_offs
= cpu_to_le32(c
->lpt_offs
);
223 mst
->nhead_lnum
= cpu_to_le32(c
->nhead_lnum
);
224 mst
->nhead_offs
= cpu_to_le32(c
->nhead_offs
);
225 mst
->ltab_lnum
= cpu_to_le32(c
->ltab_lnum
);
226 mst
->ltab_offs
= cpu_to_le32(c
->ltab_offs
);
227 mst
->lsave_lnum
= cpu_to_le32(c
->lsave_lnum
);
228 mst
->lsave_offs
= cpu_to_le32(c
->lsave_offs
);
229 mst
->lscan_lnum
= cpu_to_le32(main_first
);
230 mst
->empty_lebs
= cpu_to_le32(main_lebs
- 2);
231 mst
->idx_lebs
= cpu_to_le32(1);
232 mst
->leb_cnt
= cpu_to_le32(c
->leb_cnt
);
234 /* Calculate lprops statistics */
236 tmp64
-= ALIGN(ubifs_idx_node_sz(c
, 1), c
->min_io_size
);
237 tmp64
-= ALIGN(UBIFS_INO_NODE_SZ
, c
->min_io_size
);
238 mst
->total_free
= cpu_to_le64(tmp64
);
240 tmp64
= ALIGN(ubifs_idx_node_sz(c
, 1), c
->min_io_size
);
241 ino_waste
= ALIGN(UBIFS_INO_NODE_SZ
, c
->min_io_size
) -
244 tmp64
-= ALIGN(ubifs_idx_node_sz(c
, 1), 8);
245 mst
->total_dirty
= cpu_to_le64(tmp64
);
247 /* The indexing LEB does not contribute to dark space */
248 tmp64
= ((long long)(c
->main_lebs
- 1) * c
->dark_wm
);
249 mst
->total_dark
= cpu_to_le64(tmp64
);
251 mst
->total_used
= cpu_to_le64(UBIFS_INO_NODE_SZ
);
253 err
= ubifs_write_node(c
, mst
, UBIFS_MST_NODE_SZ
, UBIFS_MST_LNUM
, 0);
258 err
= ubifs_write_node(c
, mst
, UBIFS_MST_NODE_SZ
, UBIFS_MST_LNUM
+ 1,
264 dbg_gen("default master node created at LEB %d:0", UBIFS_MST_LNUM
);
266 /* Create the root indexing node */
267 tmp
= ubifs_idx_node_sz(c
, 1);
268 idx
= kzalloc(ALIGN(tmp
, c
->min_io_size
), GFP_KERNEL
);
272 c
->key_fmt
= UBIFS_SIMPLE_KEY_FMT
;
273 c
->key_hash
= key_r5_hash
;
275 idx
->ch
.node_type
= UBIFS_IDX_NODE
;
276 idx
->child_cnt
= cpu_to_le16(1);
277 ino_key_init(c
, &key
, UBIFS_ROOT_INO
);
278 br
= ubifs_idx_branch(c
, idx
, 0);
279 key_write_idx(c
, &key
, &br
->key
);
280 br
->lnum
= cpu_to_le32(main_first
+ DEFAULT_DATA_LEB
);
281 br
->len
= cpu_to_le32(UBIFS_INO_NODE_SZ
);
282 err
= ubifs_write_node(c
, idx
, tmp
, main_first
+ DEFAULT_IDX_LEB
, 0);
287 dbg_gen("default root indexing node created LEB %d:0",
288 main_first
+ DEFAULT_IDX_LEB
);
290 /* Create default root inode */
291 tmp
= ALIGN(UBIFS_INO_NODE_SZ
, c
->min_io_size
);
292 ino
= kzalloc(tmp
, GFP_KERNEL
);
296 ino_key_init_flash(c
, &ino
->key
, UBIFS_ROOT_INO
);
297 ino
->ch
.node_type
= UBIFS_INO_NODE
;
298 ino
->creat_sqnum
= cpu_to_le64(++c
->max_sqnum
);
299 ino
->nlink
= cpu_to_le32(2);
300 tmp_le64
= cpu_to_le64(CURRENT_TIME_SEC
.tv_sec
);
301 ino
->atime_sec
= tmp_le64
;
302 ino
->ctime_sec
= tmp_le64
;
303 ino
->mtime_sec
= tmp_le64
;
307 ino
->mode
= cpu_to_le32(S_IFDIR
| S_IRUGO
| S_IWUSR
| S_IXUGO
);
308 ino
->size
= cpu_to_le64(UBIFS_INO_NODE_SZ
);
310 /* Set compression enabled by default */
311 ino
->flags
= cpu_to_le32(UBIFS_COMPR_FL
);
313 err
= ubifs_write_node(c
, ino
, UBIFS_INO_NODE_SZ
,
314 main_first
+ DEFAULT_DATA_LEB
, 0);
319 dbg_gen("root inode created at LEB %d:0",
320 main_first
+ DEFAULT_DATA_LEB
);
323 * The first node in the log has to be the commit start node. This is
324 * always the case during normal file-system operation. Write a fake
325 * commit start node to the log.
327 tmp
= ALIGN(UBIFS_CS_NODE_SZ
, c
->min_io_size
);
328 cs
= kzalloc(tmp
, GFP_KERNEL
);
332 cs
->ch
.node_type
= UBIFS_CS_NODE
;
333 err
= ubifs_write_node(c
, cs
, UBIFS_CS_NODE_SZ
, UBIFS_LOG_LNUM
, 0);
338 ubifs_msg(c
, "default file-system created");
343 * validate_sb - validate superblock node.
344 * @c: UBIFS file-system description object
345 * @sup: superblock node
347 * This function validates superblock node @sup. Since most of data was read
348 * from the superblock and stored in @c, the function validates fields in @c
349 * instead. Returns zero in case of success and %-EINVAL in case of validation
352 static int validate_sb(struct ubifs_info
*c
, struct ubifs_sb_node
*sup
)
355 int err
= 1, min_leb_cnt
;
362 if (sup
->key_fmt
!= UBIFS_SIMPLE_KEY_FMT
) {
367 if (le32_to_cpu(sup
->min_io_size
) != c
->min_io_size
) {
368 ubifs_err(c
, "min. I/O unit mismatch: %d in superblock, %d real",
369 le32_to_cpu(sup
->min_io_size
), c
->min_io_size
);
373 if (le32_to_cpu(sup
->leb_size
) != c
->leb_size
) {
374 ubifs_err(c
, "LEB size mismatch: %d in superblock, %d real",
375 le32_to_cpu(sup
->leb_size
), c
->leb_size
);
379 if (c
->log_lebs
< UBIFS_MIN_LOG_LEBS
||
380 c
->lpt_lebs
< UBIFS_MIN_LPT_LEBS
||
381 c
->orph_lebs
< UBIFS_MIN_ORPH_LEBS
||
382 c
->main_lebs
< UBIFS_MIN_MAIN_LEBS
) {
388 * Calculate minimum allowed amount of main area LEBs. This is very
389 * similar to %UBIFS_MIN_LEB_CNT, but we take into account real what we
390 * have just read from the superblock.
392 min_leb_cnt
= UBIFS_SB_LEBS
+ UBIFS_MST_LEBS
+ c
->log_lebs
;
393 min_leb_cnt
+= c
->lpt_lebs
+ c
->orph_lebs
+ c
->jhead_cnt
+ 6;
395 if (c
->leb_cnt
< min_leb_cnt
|| c
->leb_cnt
> c
->vi
.size
) {
396 ubifs_err(c
, "bad LEB count: %d in superblock, %d on UBI volume, %d minimum required",
397 c
->leb_cnt
, c
->vi
.size
, min_leb_cnt
);
401 if (c
->max_leb_cnt
< c
->leb_cnt
) {
402 ubifs_err(c
, "max. LEB count %d less than LEB count %d",
403 c
->max_leb_cnt
, c
->leb_cnt
);
407 if (c
->main_lebs
< UBIFS_MIN_MAIN_LEBS
) {
408 ubifs_err(c
, "too few main LEBs count %d, must be at least %d",
409 c
->main_lebs
, UBIFS_MIN_MAIN_LEBS
);
413 max_bytes
= (long long)c
->leb_size
* UBIFS_MIN_BUD_LEBS
;
414 if (c
->max_bud_bytes
< max_bytes
) {
415 ubifs_err(c
, "too small journal (%lld bytes), must be at least %lld bytes",
416 c
->max_bud_bytes
, max_bytes
);
420 max_bytes
= (long long)c
->leb_size
* c
->main_lebs
;
421 if (c
->max_bud_bytes
> max_bytes
) {
422 ubifs_err(c
, "too large journal size (%lld bytes), only %lld bytes available in the main area",
423 c
->max_bud_bytes
, max_bytes
);
427 if (c
->jhead_cnt
< NONDATA_JHEADS_CNT
+ 1 ||
428 c
->jhead_cnt
> NONDATA_JHEADS_CNT
+ UBIFS_MAX_JHEADS
) {
433 if (c
->fanout
< UBIFS_MIN_FANOUT
||
434 ubifs_idx_node_sz(c
, c
->fanout
) > c
->leb_size
) {
439 if (c
->lsave_cnt
< 0 || (c
->lsave_cnt
> DEFAULT_LSAVE_CNT
&&
440 c
->lsave_cnt
> c
->max_leb_cnt
- UBIFS_SB_LEBS
- UBIFS_MST_LEBS
-
441 c
->log_lebs
- c
->lpt_lebs
- c
->orph_lebs
)) {
446 if (UBIFS_SB_LEBS
+ UBIFS_MST_LEBS
+ c
->log_lebs
+ c
->lpt_lebs
+
447 c
->orph_lebs
+ c
->main_lebs
!= c
->leb_cnt
) {
452 if (c
->default_compr
>= UBIFS_COMPR_TYPES_CNT
) {
457 if (c
->rp_size
< 0 || max_bytes
< c
->rp_size
) {
462 if (le32_to_cpu(sup
->time_gran
) > 1000000000 ||
463 le32_to_cpu(sup
->time_gran
) < 1) {
471 ubifs_err(c
, "bad superblock, error %d", err
);
472 ubifs_dump_node(c
, sup
);
477 * ubifs_read_sb_node - read superblock node.
478 * @c: UBIFS file-system description object
480 * This function returns a pointer to the superblock node or a negative error
481 * code. Note, the user of this function is responsible of kfree()'ing the
482 * returned superblock buffer.
484 struct ubifs_sb_node
*ubifs_read_sb_node(struct ubifs_info
*c
)
486 struct ubifs_sb_node
*sup
;
489 sup
= kmalloc(ALIGN(UBIFS_SB_NODE_SZ
, c
->min_io_size
), GFP_NOFS
);
491 return ERR_PTR(-ENOMEM
);
493 err
= ubifs_read_node(c
, sup
, UBIFS_SB_NODE
, UBIFS_SB_NODE_SZ
,
504 * ubifs_write_sb_node - write superblock node.
505 * @c: UBIFS file-system description object
506 * @sup: superblock node read with 'ubifs_read_sb_node()'
508 * This function returns %0 on success and a negative error code on failure.
510 int ubifs_write_sb_node(struct ubifs_info
*c
, struct ubifs_sb_node
*sup
)
512 int len
= ALIGN(UBIFS_SB_NODE_SZ
, c
->min_io_size
);
514 ubifs_prepare_node(c
, sup
, UBIFS_SB_NODE_SZ
, 1);
515 return ubifs_leb_change(c
, UBIFS_SB_LNUM
, sup
, len
);
519 * ubifs_read_superblock - read superblock.
520 * @c: UBIFS file-system description object
522 * This function finds, reads and checks the superblock. If an empty UBI volume
523 * is being mounted, this function creates default superblock. Returns zero in
524 * case of success, and a negative error code in case of failure.
526 int ubifs_read_superblock(struct ubifs_info
*c
)
529 struct ubifs_sb_node
*sup
;
532 err
= create_default_filesystem(c
);
537 sup
= ubifs_read_sb_node(c
);
541 c
->fmt_version
= le32_to_cpu(sup
->fmt_version
);
542 c
->ro_compat_version
= le32_to_cpu(sup
->ro_compat_version
);
545 * The software supports all previous versions but not future versions,
546 * due to the unavailability of time-travelling equipment.
548 if (c
->fmt_version
> UBIFS_FORMAT_VERSION
) {
549 ubifs_assert(!c
->ro_media
|| c
->ro_mount
);
551 c
->ro_compat_version
> UBIFS_RO_COMPAT_VERSION
) {
552 ubifs_err(c
, "on-flash format version is w%d/r%d, but software only supports up to version w%d/r%d",
553 c
->fmt_version
, c
->ro_compat_version
,
554 UBIFS_FORMAT_VERSION
,
555 UBIFS_RO_COMPAT_VERSION
);
556 if (c
->ro_compat_version
<= UBIFS_RO_COMPAT_VERSION
) {
557 ubifs_msg(c
, "only R/O mounting is possible");
565 * The FS is mounted R/O, and the media format is
566 * R/O-compatible with the UBIFS implementation, so we can
572 if (c
->fmt_version
< 3) {
573 ubifs_err(c
, "on-flash format version %d is not supported",
579 switch (sup
->key_hash
) {
580 case UBIFS_KEY_HASH_R5
:
581 c
->key_hash
= key_r5_hash
;
582 c
->key_hash_type
= UBIFS_KEY_HASH_R5
;
585 case UBIFS_KEY_HASH_TEST
:
586 c
->key_hash
= key_test_hash
;
587 c
->key_hash_type
= UBIFS_KEY_HASH_TEST
;
591 c
->key_fmt
= sup
->key_fmt
;
593 switch (c
->key_fmt
) {
594 case UBIFS_SIMPLE_KEY_FMT
:
595 c
->key_len
= UBIFS_SK_LEN
;
598 ubifs_err(c
, "unsupported key format");
603 c
->leb_cnt
= le32_to_cpu(sup
->leb_cnt
);
604 c
->max_leb_cnt
= le32_to_cpu(sup
->max_leb_cnt
);
605 c
->max_bud_bytes
= le64_to_cpu(sup
->max_bud_bytes
);
606 c
->log_lebs
= le32_to_cpu(sup
->log_lebs
);
607 c
->lpt_lebs
= le32_to_cpu(sup
->lpt_lebs
);
608 c
->orph_lebs
= le32_to_cpu(sup
->orph_lebs
);
609 c
->jhead_cnt
= le32_to_cpu(sup
->jhead_cnt
) + NONDATA_JHEADS_CNT
;
610 c
->fanout
= le32_to_cpu(sup
->fanout
);
611 c
->lsave_cnt
= le32_to_cpu(sup
->lsave_cnt
);
612 c
->rp_size
= le64_to_cpu(sup
->rp_size
);
613 c
->rp_uid
= make_kuid(&init_user_ns
, le32_to_cpu(sup
->rp_uid
));
614 c
->rp_gid
= make_kgid(&init_user_ns
, le32_to_cpu(sup
->rp_gid
));
615 sup_flags
= le32_to_cpu(sup
->flags
);
616 if (!c
->mount_opts
.override_compr
)
617 c
->default_compr
= le16_to_cpu(sup
->default_compr
);
619 c
->vfs_sb
->s_time_gran
= le32_to_cpu(sup
->time_gran
);
620 memcpy(&c
->uuid
, &sup
->uuid
, 16);
621 c
->big_lpt
= !!(sup_flags
& UBIFS_FLG_BIGLPT
);
622 c
->space_fixup
= !!(sup_flags
& UBIFS_FLG_SPACE_FIXUP
);
624 /* Automatically increase file system size to the maximum size */
625 c
->old_leb_cnt
= c
->leb_cnt
;
626 if (c
->leb_cnt
< c
->vi
.size
&& c
->leb_cnt
< c
->max_leb_cnt
) {
627 c
->leb_cnt
= min_t(int, c
->max_leb_cnt
, c
->vi
.size
);
629 dbg_mnt("Auto resizing (ro) from %d LEBs to %d LEBs",
630 c
->old_leb_cnt
, c
->leb_cnt
);
632 dbg_mnt("Auto resizing (sb) from %d LEBs to %d LEBs",
633 c
->old_leb_cnt
, c
->leb_cnt
);
634 sup
->leb_cnt
= cpu_to_le32(c
->leb_cnt
);
635 err
= ubifs_write_sb_node(c
, sup
);
638 c
->old_leb_cnt
= c
->leb_cnt
;
642 c
->log_bytes
= (long long)c
->log_lebs
* c
->leb_size
;
643 c
->log_last
= UBIFS_LOG_LNUM
+ c
->log_lebs
- 1;
644 c
->lpt_first
= UBIFS_LOG_LNUM
+ c
->log_lebs
;
645 c
->lpt_last
= c
->lpt_first
+ c
->lpt_lebs
- 1;
646 c
->orph_first
= c
->lpt_last
+ 1;
647 c
->orph_last
= c
->orph_first
+ c
->orph_lebs
- 1;
648 c
->main_lebs
= c
->leb_cnt
- UBIFS_SB_LEBS
- UBIFS_MST_LEBS
;
649 c
->main_lebs
-= c
->log_lebs
+ c
->lpt_lebs
+ c
->orph_lebs
;
650 c
->main_first
= c
->leb_cnt
- c
->main_lebs
;
652 err
= validate_sb(c
, sup
);
659 * fixup_leb - fixup/unmap an LEB containing free space.
660 * @c: UBIFS file-system description object
661 * @lnum: the LEB number to fix up
662 * @len: number of used bytes in LEB (starting at offset 0)
664 * This function reads the contents of the given LEB number @lnum, then fixes
665 * it up, so that empty min. I/O units in the end of LEB are actually erased on
666 * flash (rather than being just all-0xff real data). If the LEB is completely
667 * empty, it is simply unmapped.
669 static int fixup_leb(struct ubifs_info
*c
, int lnum
, int len
)
673 ubifs_assert(len
>= 0);
674 ubifs_assert(len
% c
->min_io_size
== 0);
675 ubifs_assert(len
< c
->leb_size
);
678 dbg_mnt("unmap empty LEB %d", lnum
);
679 return ubifs_leb_unmap(c
, lnum
);
682 dbg_mnt("fixup LEB %d, data len %d", lnum
, len
);
683 err
= ubifs_leb_read(c
, lnum
, c
->sbuf
, 0, len
, 1);
687 return ubifs_leb_change(c
, lnum
, c
->sbuf
, len
);
691 * fixup_free_space - find & remap all LEBs containing free space.
692 * @c: UBIFS file-system description object
694 * This function walks through all LEBs in the filesystem and fiexes up those
695 * containing free/empty space.
697 static int fixup_free_space(struct ubifs_info
*c
)
700 struct ubifs_lprops
*lprops
;
704 /* Fixup LEBs in the master area */
705 for (lnum
= UBIFS_MST_LNUM
; lnum
< UBIFS_LOG_LNUM
; lnum
++) {
706 err
= fixup_leb(c
, lnum
, c
->mst_offs
+ c
->mst_node_alsz
);
711 /* Unmap unused log LEBs */
712 lnum
= ubifs_next_log_lnum(c
, c
->lhead_lnum
);
713 while (lnum
!= c
->ltail_lnum
) {
714 err
= fixup_leb(c
, lnum
, 0);
717 lnum
= ubifs_next_log_lnum(c
, lnum
);
721 * Fixup the log head which contains the only a CS node at the
724 err
= fixup_leb(c
, c
->lhead_lnum
,
725 ALIGN(UBIFS_CS_NODE_SZ
, c
->min_io_size
));
729 /* Fixup LEBs in the LPT area */
730 for (lnum
= c
->lpt_first
; lnum
<= c
->lpt_last
; lnum
++) {
731 int free
= c
->ltab
[lnum
- c
->lpt_first
].free
;
734 err
= fixup_leb(c
, lnum
, c
->leb_size
- free
);
740 /* Unmap LEBs in the orphans area */
741 for (lnum
= c
->orph_first
; lnum
<= c
->orph_last
; lnum
++) {
742 err
= fixup_leb(c
, lnum
, 0);
747 /* Fixup LEBs in the main area */
748 for (lnum
= c
->main_first
; lnum
< c
->leb_cnt
; lnum
++) {
749 lprops
= ubifs_lpt_lookup(c
, lnum
);
750 if (IS_ERR(lprops
)) {
751 err
= PTR_ERR(lprops
);
755 if (lprops
->free
> 0) {
756 err
= fixup_leb(c
, lnum
, c
->leb_size
- lprops
->free
);
763 ubifs_release_lprops(c
);
768 * ubifs_fixup_free_space - find & fix all LEBs with free space.
769 * @c: UBIFS file-system description object
771 * This function fixes up LEBs containing free space on first mount, if the
772 * appropriate flag was set when the FS was created. Each LEB with one or more
773 * empty min. I/O unit (i.e. free-space-count > 0) is re-written, to make sure
774 * the free space is actually erased. E.g., this is necessary for some NAND
775 * chips, since the free space may have been programmed like real "0xff" data
776 * (generating a non-0xff ECC), causing future writes to the not-really-erased
777 * NAND pages to behave badly. After the space is fixed up, the superblock flag
778 * is cleared, so that this is skipped for all future mounts.
780 int ubifs_fixup_free_space(struct ubifs_info
*c
)
783 struct ubifs_sb_node
*sup
;
785 ubifs_assert(c
->space_fixup
);
786 ubifs_assert(!c
->ro_mount
);
788 ubifs_msg(c
, "start fixing up free space");
790 err
= fixup_free_space(c
);
794 sup
= ubifs_read_sb_node(c
);
798 /* Free-space fixup is no longer required */
800 sup
->flags
&= cpu_to_le32(~UBIFS_FLG_SPACE_FIXUP
);
802 err
= ubifs_write_sb_node(c
, sup
);
807 ubifs_msg(c
, "free space fixup complete");