blob: 667c72d8a5cc28b082312e6caea93efe3100697a [file] [log] [blame]
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001/*
2 * This file is part of UBIFS.
3 *
4 * Copyright (C) 2006-2008 Nokia Corporation.
5 *
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.
9 *
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
13 * more details.
14 *
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
18 *
19 * Authors: Artem Bityutskiy (Битюцкий Артём)
20 * Adrian Hunter
21 */
22
23/*
24 * This file implements UBIFS initialization and VFS superblock operations. Some
25 * initialization stuff which is rather large and complex is placed at
26 * corresponding subsystems, but most of it is here.
27 */
28
29#include <linux/init.h>
30#include <linux/slab.h>
31#include <linux/module.h>
32#include <linux/ctype.h>
Artem Bityutskiy1e517642008-07-14 19:08:37 +030033#include <linux/kthread.h>
34#include <linux/parser.h>
35#include <linux/seq_file.h>
36#include <linux/mount.h>
37#include "ubifs.h"
38
39/* Slab cache for UBIFS inodes */
40struct kmem_cache *ubifs_inode_slab;
41
42/* UBIFS TNC shrinker description */
43static struct shrinker ubifs_shrinker_info = {
44 .shrink = ubifs_shrinker,
45 .seeks = DEFAULT_SEEKS,
46};
47
48/**
49 * validate_inode - validate inode.
50 * @c: UBIFS file-system description object
51 * @inode: the inode to validate
52 *
53 * This is a helper function for 'ubifs_iget()' which validates various fields
54 * of a newly built inode to make sure they contain sane values and prevent
55 * possible vulnerabilities. Returns zero if the inode is all right and
56 * a non-zero error code if not.
57 */
58static int validate_inode(struct ubifs_info *c, const struct inode *inode)
59{
60 int err;
61 const struct ubifs_inode *ui = ubifs_inode(inode);
62
63 if (inode->i_size > c->max_inode_sz) {
64 ubifs_err("inode is too large (%lld)",
65 (long long)inode->i_size);
66 return 1;
67 }
68
69 if (ui->compr_type < 0 || ui->compr_type >= UBIFS_COMPR_TYPES_CNT) {
70 ubifs_err("unknown compression type %d", ui->compr_type);
71 return 2;
72 }
73
74 if (ui->xattr_names + ui->xattr_cnt > XATTR_LIST_MAX)
75 return 3;
76
77 if (ui->data_len < 0 || ui->data_len > UBIFS_MAX_INO_DATA)
78 return 4;
79
80 if (ui->xattr && (inode->i_mode & S_IFMT) != S_IFREG)
81 return 5;
82
83 if (!ubifs_compr_present(ui->compr_type)) {
84 ubifs_warn("inode %lu uses '%s' compression, but it was not "
85 "compiled in", inode->i_ino,
86 ubifs_compr_name(ui->compr_type));
87 }
88
89 err = dbg_check_dir_size(c, inode);
90 return err;
91}
92
93struct inode *ubifs_iget(struct super_block *sb, unsigned long inum)
94{
95 int err;
96 union ubifs_key key;
97 struct ubifs_ino_node *ino;
98 struct ubifs_info *c = sb->s_fs_info;
99 struct inode *inode;
100 struct ubifs_inode *ui;
101
102 dbg_gen("inode %lu", inum);
103
104 inode = iget_locked(sb, inum);
105 if (!inode)
106 return ERR_PTR(-ENOMEM);
107 if (!(inode->i_state & I_NEW))
108 return inode;
109 ui = ubifs_inode(inode);
110
111 ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
112 if (!ino) {
113 err = -ENOMEM;
114 goto out;
115 }
116
117 ino_key_init(c, &key, inode->i_ino);
118
119 err = ubifs_tnc_lookup(c, &key, ino);
120 if (err)
121 goto out_ino;
122
123 inode->i_flags |= (S_NOCMTIME | S_NOATIME);
124 inode->i_nlink = le32_to_cpu(ino->nlink);
125 inode->i_uid = le32_to_cpu(ino->uid);
126 inode->i_gid = le32_to_cpu(ino->gid);
127 inode->i_atime.tv_sec = (int64_t)le64_to_cpu(ino->atime_sec);
128 inode->i_atime.tv_nsec = le32_to_cpu(ino->atime_nsec);
129 inode->i_mtime.tv_sec = (int64_t)le64_to_cpu(ino->mtime_sec);
130 inode->i_mtime.tv_nsec = le32_to_cpu(ino->mtime_nsec);
131 inode->i_ctime.tv_sec = (int64_t)le64_to_cpu(ino->ctime_sec);
132 inode->i_ctime.tv_nsec = le32_to_cpu(ino->ctime_nsec);
133 inode->i_mode = le32_to_cpu(ino->mode);
134 inode->i_size = le64_to_cpu(ino->size);
135
136 ui->data_len = le32_to_cpu(ino->data_len);
137 ui->flags = le32_to_cpu(ino->flags);
138 ui->compr_type = le16_to_cpu(ino->compr_type);
139 ui->creat_sqnum = le64_to_cpu(ino->creat_sqnum);
140 ui->xattr_cnt = le32_to_cpu(ino->xattr_cnt);
141 ui->xattr_size = le32_to_cpu(ino->xattr_size);
142 ui->xattr_names = le32_to_cpu(ino->xattr_names);
143 ui->synced_i_size = ui->ui_size = inode->i_size;
144
145 ui->xattr = (ui->flags & UBIFS_XATTR_FL) ? 1 : 0;
146
147 err = validate_inode(c, inode);
148 if (err)
149 goto out_invalid;
150
Artem Bityutskiy0a883a02008-08-13 14:13:26 +0300151 /* Disable read-ahead */
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300152 inode->i_mapping->backing_dev_info = &c->bdi;
153
154 switch (inode->i_mode & S_IFMT) {
155 case S_IFREG:
156 inode->i_mapping->a_ops = &ubifs_file_address_operations;
157 inode->i_op = &ubifs_file_inode_operations;
158 inode->i_fop = &ubifs_file_operations;
159 if (ui->xattr) {
160 ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
161 if (!ui->data) {
162 err = -ENOMEM;
163 goto out_ino;
164 }
165 memcpy(ui->data, ino->data, ui->data_len);
166 ((char *)ui->data)[ui->data_len] = '\0';
167 } else if (ui->data_len != 0) {
168 err = 10;
169 goto out_invalid;
170 }
171 break;
172 case S_IFDIR:
173 inode->i_op = &ubifs_dir_inode_operations;
174 inode->i_fop = &ubifs_dir_operations;
175 if (ui->data_len != 0) {
176 err = 11;
177 goto out_invalid;
178 }
179 break;
180 case S_IFLNK:
181 inode->i_op = &ubifs_symlink_inode_operations;
182 if (ui->data_len <= 0 || ui->data_len > UBIFS_MAX_INO_DATA) {
183 err = 12;
184 goto out_invalid;
185 }
186 ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
187 if (!ui->data) {
188 err = -ENOMEM;
189 goto out_ino;
190 }
191 memcpy(ui->data, ino->data, ui->data_len);
192 ((char *)ui->data)[ui->data_len] = '\0';
193 break;
194 case S_IFBLK:
195 case S_IFCHR:
196 {
197 dev_t rdev;
198 union ubifs_dev_desc *dev;
199
200 ui->data = kmalloc(sizeof(union ubifs_dev_desc), GFP_NOFS);
201 if (!ui->data) {
202 err = -ENOMEM;
203 goto out_ino;
204 }
205
206 dev = (union ubifs_dev_desc *)ino->data;
207 if (ui->data_len == sizeof(dev->new))
208 rdev = new_decode_dev(le32_to_cpu(dev->new));
209 else if (ui->data_len == sizeof(dev->huge))
210 rdev = huge_decode_dev(le64_to_cpu(dev->huge));
211 else {
212 err = 13;
213 goto out_invalid;
214 }
215 memcpy(ui->data, ino->data, ui->data_len);
216 inode->i_op = &ubifs_file_inode_operations;
217 init_special_inode(inode, inode->i_mode, rdev);
218 break;
219 }
220 case S_IFSOCK:
221 case S_IFIFO:
222 inode->i_op = &ubifs_file_inode_operations;
223 init_special_inode(inode, inode->i_mode, 0);
224 if (ui->data_len != 0) {
225 err = 14;
226 goto out_invalid;
227 }
228 break;
229 default:
230 err = 15;
231 goto out_invalid;
232 }
233
234 kfree(ino);
235 ubifs_set_inode_flags(inode);
236 unlock_new_inode(inode);
237 return inode;
238
239out_invalid:
240 ubifs_err("inode %lu validation failed, error %d", inode->i_ino, err);
241 dbg_dump_node(c, ino);
242 dbg_dump_inode(c, inode);
243 err = -EINVAL;
244out_ino:
245 kfree(ino);
246out:
247 ubifs_err("failed to read inode %lu, error %d", inode->i_ino, err);
248 iget_failed(inode);
249 return ERR_PTR(err);
250}
251
252static struct inode *ubifs_alloc_inode(struct super_block *sb)
253{
254 struct ubifs_inode *ui;
255
256 ui = kmem_cache_alloc(ubifs_inode_slab, GFP_NOFS);
257 if (!ui)
258 return NULL;
259
260 memset((void *)ui + sizeof(struct inode), 0,
261 sizeof(struct ubifs_inode) - sizeof(struct inode));
262 mutex_init(&ui->ui_mutex);
263 spin_lock_init(&ui->ui_lock);
264 return &ui->vfs_inode;
265};
266
267static void ubifs_destroy_inode(struct inode *inode)
268{
269 struct ubifs_inode *ui = ubifs_inode(inode);
270
271 kfree(ui->data);
272 kmem_cache_free(ubifs_inode_slab, inode);
273}
274
275/*
276 * Note, Linux write-back code calls this without 'i_mutex'.
277 */
278static int ubifs_write_inode(struct inode *inode, int wait)
279{
Artem Bityutskiyfbfa6c82008-07-22 11:52:52 +0300280 int err = 0;
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300281 struct ubifs_info *c = inode->i_sb->s_fs_info;
282 struct ubifs_inode *ui = ubifs_inode(inode);
283
284 ubifs_assert(!ui->xattr);
285 if (is_bad_inode(inode))
286 return 0;
287
288 mutex_lock(&ui->ui_mutex);
289 /*
290 * Due to races between write-back forced by budgeting
291 * (see 'sync_some_inodes()') and pdflush write-back, the inode may
292 * have already been synchronized, do not do this again. This might
293 * also happen if it was synchronized in an VFS operation, e.g.
294 * 'ubifs_link()'.
295 */
296 if (!ui->dirty) {
297 mutex_unlock(&ui->ui_mutex);
298 return 0;
299 }
300
Artem Bityutskiyfbfa6c82008-07-22 11:52:52 +0300301 /*
302 * As an optimization, do not write orphan inodes to the media just
303 * because this is not needed.
304 */
305 dbg_gen("inode %lu, mode %#x, nlink %u",
306 inode->i_ino, (int)inode->i_mode, inode->i_nlink);
307 if (inode->i_nlink) {
Artem Bityutskiy1f286812008-07-22 12:06:13 +0300308 err = ubifs_jnl_write_inode(c, inode);
Artem Bityutskiyfbfa6c82008-07-22 11:52:52 +0300309 if (err)
310 ubifs_err("can't write inode %lu, error %d",
311 inode->i_ino, err);
312 }
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300313
314 ui->dirty = 0;
315 mutex_unlock(&ui->ui_mutex);
316 ubifs_release_dirty_inode_budget(c, ui);
317 return err;
318}
319
320static void ubifs_delete_inode(struct inode *inode)
321{
322 int err;
323 struct ubifs_info *c = inode->i_sb->s_fs_info;
Artem Bityutskiy1e0f3582008-07-21 10:59:53 +0300324 struct ubifs_inode *ui = ubifs_inode(inode);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300325
Artem Bityutskiy1e0f3582008-07-21 10:59:53 +0300326 if (ui->xattr)
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300327 /*
328 * Extended attribute inode deletions are fully handled in
329 * 'ubifs_removexattr()'. These inodes are special and have
330 * limited usage, so there is nothing to do here.
331 */
332 goto out;
333
Artem Bityutskiy7d32c2b2008-07-18 18:54:29 +0300334 dbg_gen("inode %lu, mode %#x", inode->i_ino, (int)inode->i_mode);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300335 ubifs_assert(!atomic_read(&inode->i_count));
336 ubifs_assert(inode->i_nlink == 0);
337
338 truncate_inode_pages(&inode->i_data, 0);
339 if (is_bad_inode(inode))
340 goto out;
341
Artem Bityutskiy1e0f3582008-07-21 10:59:53 +0300342 ui->ui_size = inode->i_size = 0;
Artem Bityutskiyde94eb52008-07-22 13:06:20 +0300343 err = ubifs_jnl_delete_inode(c, inode);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300344 if (err)
345 /*
346 * Worst case we have a lost orphan inode wasting space, so a
Artem Bityutskiy0a883a02008-08-13 14:13:26 +0300347 * simple error message is OK here.
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300348 */
Artem Bityutskiyde94eb52008-07-22 13:06:20 +0300349 ubifs_err("can't delete inode %lu, error %d",
350 inode->i_ino, err);
351
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300352out:
Artem Bityutskiy1e0f3582008-07-21 10:59:53 +0300353 if (ui->dirty)
354 ubifs_release_dirty_inode_budget(c, ui);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300355 clear_inode(inode);
356}
357
358static void ubifs_dirty_inode(struct inode *inode)
359{
360 struct ubifs_inode *ui = ubifs_inode(inode);
361
362 ubifs_assert(mutex_is_locked(&ui->ui_mutex));
363 if (!ui->dirty) {
364 ui->dirty = 1;
365 dbg_gen("inode %lu", inode->i_ino);
366 }
367}
368
369static int ubifs_statfs(struct dentry *dentry, struct kstatfs *buf)
370{
371 struct ubifs_info *c = dentry->d_sb->s_fs_info;
372 unsigned long long free;
Artem Bityutskiy7c7cbad2008-09-03 14:16:42 +0300373 __le32 *uuid = (__le32 *)c->uuid;
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300374
Artem Bityutskiy7dad1812008-08-25 18:58:19 +0300375 free = ubifs_get_free_space(c);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300376 dbg_gen("free space %lld bytes (%lld blocks)",
377 free, free >> UBIFS_BLOCK_SHIFT);
378
379 buf->f_type = UBIFS_SUPER_MAGIC;
380 buf->f_bsize = UBIFS_BLOCK_SIZE;
381 buf->f_blocks = c->block_cnt;
382 buf->f_bfree = free >> UBIFS_BLOCK_SHIFT;
383 if (free > c->report_rp_size)
384 buf->f_bavail = (free - c->report_rp_size) >> UBIFS_BLOCK_SHIFT;
385 else
386 buf->f_bavail = 0;
387 buf->f_files = 0;
388 buf->f_ffree = 0;
389 buf->f_namelen = UBIFS_MAX_NLEN;
Artem Bityutskiy7c7cbad2008-09-03 14:16:42 +0300390 buf->f_fsid.val[0] = le32_to_cpu(uuid[0]) ^ le32_to_cpu(uuid[2]);
391 buf->f_fsid.val[1] = le32_to_cpu(uuid[1]) ^ le32_to_cpu(uuid[3]);
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300392 return 0;
393}
394
395static int ubifs_show_options(struct seq_file *s, struct vfsmount *mnt)
396{
397 struct ubifs_info *c = mnt->mnt_sb->s_fs_info;
398
399 if (c->mount_opts.unmount_mode == 2)
400 seq_printf(s, ",fast_unmount");
401 else if (c->mount_opts.unmount_mode == 1)
402 seq_printf(s, ",norm_unmount");
403
404 return 0;
405}
406
407static int ubifs_sync_fs(struct super_block *sb, int wait)
408{
409 struct ubifs_info *c = sb->s_fs_info;
410 int i, ret = 0, err;
411
412 if (c->jheads)
413 for (i = 0; i < c->jhead_cnt; i++) {
414 err = ubifs_wbuf_sync(&c->jheads[i].wbuf);
415 if (err && !ret)
416 ret = err;
417 }
418 /*
419 * We ought to call sync for c->ubi but it does not have one. If it had
420 * it would in turn call mtd->sync, however mtd operations are
421 * synchronous anyway, so we don't lose any sleep here.
422 */
423 return ret;
424}
425
426/**
427 * init_constants_early - initialize UBIFS constants.
428 * @c: UBIFS file-system description object
429 *
430 * This function initialize UBIFS constants which do not need the superblock to
431 * be read. It also checks that the UBI volume satisfies basic UBIFS
432 * requirements. Returns zero in case of success and a negative error code in
433 * case of failure.
434 */
435static int init_constants_early(struct ubifs_info *c)
436{
437 if (c->vi.corrupted) {
438 ubifs_warn("UBI volume is corrupted - read-only mode");
439 c->ro_media = 1;
440 }
441
442 if (c->di.ro_mode) {
443 ubifs_msg("read-only UBI device");
444 c->ro_media = 1;
445 }
446
447 if (c->vi.vol_type == UBI_STATIC_VOLUME) {
448 ubifs_msg("static UBI volume - read-only mode");
449 c->ro_media = 1;
450 }
451
452 c->leb_cnt = c->vi.size;
453 c->leb_size = c->vi.usable_leb_size;
454 c->half_leb_size = c->leb_size / 2;
455 c->min_io_size = c->di.min_io_size;
456 c->min_io_shift = fls(c->min_io_size) - 1;
457
458 if (c->leb_size < UBIFS_MIN_LEB_SZ) {
459 ubifs_err("too small LEBs (%d bytes), min. is %d bytes",
460 c->leb_size, UBIFS_MIN_LEB_SZ);
461 return -EINVAL;
462 }
463
464 if (c->leb_cnt < UBIFS_MIN_LEB_CNT) {
465 ubifs_err("too few LEBs (%d), min. is %d",
466 c->leb_cnt, UBIFS_MIN_LEB_CNT);
467 return -EINVAL;
468 }
469
470 if (!is_power_of_2(c->min_io_size)) {
471 ubifs_err("bad min. I/O size %d", c->min_io_size);
472 return -EINVAL;
473 }
474
475 /*
476 * UBIFS aligns all node to 8-byte boundary, so to make function in
477 * io.c simpler, assume minimum I/O unit size to be 8 bytes if it is
478 * less than 8.
479 */
480 if (c->min_io_size < 8) {
481 c->min_io_size = 8;
482 c->min_io_shift = 3;
483 }
484
485 c->ref_node_alsz = ALIGN(UBIFS_REF_NODE_SZ, c->min_io_size);
486 c->mst_node_alsz = ALIGN(UBIFS_MST_NODE_SZ, c->min_io_size);
487
488 /*
489 * Initialize node length ranges which are mostly needed for node
490 * length validation.
491 */
492 c->ranges[UBIFS_PAD_NODE].len = UBIFS_PAD_NODE_SZ;
493 c->ranges[UBIFS_SB_NODE].len = UBIFS_SB_NODE_SZ;
494 c->ranges[UBIFS_MST_NODE].len = UBIFS_MST_NODE_SZ;
495 c->ranges[UBIFS_REF_NODE].len = UBIFS_REF_NODE_SZ;
496 c->ranges[UBIFS_TRUN_NODE].len = UBIFS_TRUN_NODE_SZ;
497 c->ranges[UBIFS_CS_NODE].len = UBIFS_CS_NODE_SZ;
498
499 c->ranges[UBIFS_INO_NODE].min_len = UBIFS_INO_NODE_SZ;
500 c->ranges[UBIFS_INO_NODE].max_len = UBIFS_MAX_INO_NODE_SZ;
501 c->ranges[UBIFS_ORPH_NODE].min_len =
502 UBIFS_ORPH_NODE_SZ + sizeof(__le64);
503 c->ranges[UBIFS_ORPH_NODE].max_len = c->leb_size;
504 c->ranges[UBIFS_DENT_NODE].min_len = UBIFS_DENT_NODE_SZ;
505 c->ranges[UBIFS_DENT_NODE].max_len = UBIFS_MAX_DENT_NODE_SZ;
506 c->ranges[UBIFS_XENT_NODE].min_len = UBIFS_XENT_NODE_SZ;
507 c->ranges[UBIFS_XENT_NODE].max_len = UBIFS_MAX_XENT_NODE_SZ;
508 c->ranges[UBIFS_DATA_NODE].min_len = UBIFS_DATA_NODE_SZ;
509 c->ranges[UBIFS_DATA_NODE].max_len = UBIFS_MAX_DATA_NODE_SZ;
510 /*
511 * Minimum indexing node size is amended later when superblock is
512 * read and the key length is known.
513 */
514 c->ranges[UBIFS_IDX_NODE].min_len = UBIFS_IDX_NODE_SZ + UBIFS_BRANCH_SZ;
515 /*
516 * Maximum indexing node size is amended later when superblock is
517 * read and the fanout is known.
518 */
519 c->ranges[UBIFS_IDX_NODE].max_len = INT_MAX;
520
521 /*
522 * Initialize dead and dark LEB space watermarks.
523 *
524 * Dead space is the space which cannot be used. Its watermark is
525 * equivalent to min. I/O unit or minimum node size if it is greater
526 * then min. I/O unit.
527 *
528 * Dark space is the space which might be used, or might not, depending
529 * on which node should be written to the LEB. Its watermark is
530 * equivalent to maximum UBIFS node size.
531 */
532 c->dead_wm = ALIGN(MIN_WRITE_SZ, c->min_io_size);
533 c->dark_wm = ALIGN(UBIFS_MAX_NODE_SZ, c->min_io_size);
534
Artem Bityutskiy9bbb5722008-08-22 18:23:22 +0300535 /*
536 * Calculate how many bytes would be wasted at the end of LEB if it was
537 * fully filled with data nodes of maximum size. This is used in
538 * calculations when reporting free space.
539 */
540 c->leb_overhead = c->leb_size % UBIFS_MAX_DATA_NODE_SZ;
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300541 return 0;
542}
543
544/**
545 * bud_wbuf_callback - bud LEB write-buffer synchronization call-back.
546 * @c: UBIFS file-system description object
547 * @lnum: LEB the write-buffer was synchronized to
548 * @free: how many free bytes left in this LEB
549 * @pad: how many bytes were padded
550 *
551 * This is a callback function which is called by the I/O unit when the
552 * write-buffer is synchronized. We need this to correctly maintain space
553 * accounting in bud logical eraseblocks. This function returns zero in case of
554 * success and a negative error code in case of failure.
555 *
556 * This function actually belongs to the journal, but we keep it here because
557 * we want to keep it static.
558 */
559static int bud_wbuf_callback(struct ubifs_info *c, int lnum, int free, int pad)
560{
561 return ubifs_update_one_lp(c, lnum, free, pad, 0, 0);
562}
563
564/*
565 * init_constants_late - initialize UBIFS constants.
566 * @c: UBIFS file-system description object
567 *
568 * This is a helper function which initializes various UBIFS constants after
569 * the superblock has been read. It also checks various UBIFS parameters and
570 * makes sure they are all right. Returns zero in case of success and a
571 * negative error code in case of failure.
572 */
573static int init_constants_late(struct ubifs_info *c)
574{
575 int tmp, err;
576 uint64_t tmp64;
577
578 c->main_bytes = (long long)c->main_lebs * c->leb_size;
579 c->max_znode_sz = sizeof(struct ubifs_znode) +
580 c->fanout * sizeof(struct ubifs_zbranch);
581
582 tmp = ubifs_idx_node_sz(c, 1);
583 c->ranges[UBIFS_IDX_NODE].min_len = tmp;
584 c->min_idx_node_sz = ALIGN(tmp, 8);
585
586 tmp = ubifs_idx_node_sz(c, c->fanout);
587 c->ranges[UBIFS_IDX_NODE].max_len = tmp;
588 c->max_idx_node_sz = ALIGN(tmp, 8);
589
590 /* Make sure LEB size is large enough to fit full commit */
591 tmp = UBIFS_CS_NODE_SZ + UBIFS_REF_NODE_SZ * c->jhead_cnt;
592 tmp = ALIGN(tmp, c->min_io_size);
593 if (tmp > c->leb_size) {
594 dbg_err("too small LEB size %d, at least %d needed",
595 c->leb_size, tmp);
596 return -EINVAL;
597 }
598
599 /*
600 * Make sure that the log is large enough to fit reference nodes for
601 * all buds plus one reserved LEB.
602 */
603 tmp64 = c->max_bud_bytes;
604 tmp = do_div(tmp64, c->leb_size);
605 c->max_bud_cnt = tmp64 + !!tmp;
606 tmp = (c->ref_node_alsz * c->max_bud_cnt + c->leb_size - 1);
607 tmp /= c->leb_size;
608 tmp += 1;
609 if (c->log_lebs < tmp) {
610 dbg_err("too small log %d LEBs, required min. %d LEBs",
611 c->log_lebs, tmp);
612 return -EINVAL;
613 }
614
615 /*
616 * When budgeting we assume worst-case scenarios when the pages are not
617 * be compressed and direntries are of the maximum size.
618 *
619 * Note, data, which may be stored in inodes is budgeted separately, so
620 * it is not included into 'c->inode_budget'.
621 */
622 c->page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE;
623 c->inode_budget = UBIFS_INO_NODE_SZ;
624 c->dent_budget = UBIFS_MAX_DENT_NODE_SZ;
625
626 /*
627 * When the amount of flash space used by buds becomes
628 * 'c->max_bud_bytes', UBIFS just blocks all writers and starts commit.
629 * The writers are unblocked when the commit is finished. To avoid
630 * writers to be blocked UBIFS initiates background commit in advance,
631 * when number of bud bytes becomes above the limit defined below.
632 */
633 c->bg_bud_bytes = (c->max_bud_bytes * 13) >> 4;
634
635 /*
636 * Ensure minimum journal size. All the bytes in the journal heads are
637 * considered to be used, when calculating the current journal usage.
638 * Consequently, if the journal is too small, UBIFS will treat it as
639 * always full.
640 */
641 tmp64 = (uint64_t)(c->jhead_cnt + 1) * c->leb_size + 1;
642 if (c->bg_bud_bytes < tmp64)
643 c->bg_bud_bytes = tmp64;
644 if (c->max_bud_bytes < tmp64 + c->leb_size)
645 c->max_bud_bytes = tmp64 + c->leb_size;
646
647 err = ubifs_calc_lpt_geom(c);
648 if (err)
649 return err;
650
651 c->min_idx_lebs = ubifs_calc_min_idx_lebs(c);
652
653 /*
654 * Calculate total amount of FS blocks. This number is not used
655 * internally because it does not make much sense for UBIFS, but it is
656 * necessary to report something for the 'statfs()' call.
657 *
Artem Bityutskiy7dad1812008-08-25 18:58:19 +0300658 * Subtract the LEB reserved for GC, the LEB which is reserved for
659 * deletions, and assume only one journal head is available.
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300660 */
Artem Bityutskiy7dad1812008-08-25 18:58:19 +0300661 tmp64 = c->main_lebs - 2 - c->jhead_cnt + 1;
662 tmp64 *= (uint64_t)c->leb_size - c->leb_overhead;
Artem Bityutskiy1e517642008-07-14 19:08:37 +0300663 tmp64 = ubifs_reported_space(c, tmp64);
664 c->block_cnt = tmp64 >> UBIFS_BLOCK_SHIFT;
665
666 return 0;
667}
668
669/**
670 * take_gc_lnum - reserve GC LEB.
671 * @c: UBIFS file-system description object
672 *
673 * This function ensures that the LEB reserved for garbage collection is
674 * unmapped and is marked as "taken" in lprops. We also have to set free space
675 * to LEB size and dirty space to zero, because lprops may contain out-of-date
676 * information if the file-system was un-mounted before it has been committed.
677 * This function returns zero in case of success and a negative error code in
678 * case of failure.
679 */
680static int take_gc_lnum(struct ubifs_info *c)
681{
682 int err;
683
684 if (c->gc_lnum == -1) {
685 ubifs_err("no LEB for GC");
686 return -EINVAL;
687 }
688
689 err = ubifs_leb_unmap(c, c->gc_lnum);
690 if (err)
691 return err;
692
693 /* And we have to tell lprops that this LEB is taken */
694 err = ubifs_change_one_lp(c, c->gc_lnum, c->leb_size, 0,
695 LPROPS_TAKEN, 0, 0);
696 return err;
697}
698
699/**
700 * alloc_wbufs - allocate write-buffers.
701 * @c: UBIFS file-system description object
702 *
703 * This helper function allocates and initializes UBIFS write-buffers. Returns
704 * zero in case of success and %-ENOMEM in case of failure.
705 */
706static int alloc_wbufs(struct ubifs_info *c)
707{
708 int i, err;
709
710 c->jheads = kzalloc(c->jhead_cnt * sizeof(struct ubifs_jhead),
711 GFP_KERNEL);
712 if (!c->jheads)
713 return -ENOMEM;
714
715 /* Initialize journal heads */
716 for (i = 0; i < c->jhead_cnt; i++) {
717 INIT_LIST_HEAD(&c->jheads[i].buds_list);
718 err = ubifs_wbuf_init(c, &c->jheads[i].wbuf);
719 if (err)
720 return err;
721
722 c->jheads[i].wbuf.sync_callback = &bud_wbuf_callback;
723 c->jheads[i].wbuf.jhead = i;
724 }
725
726 c->jheads[BASEHD].wbuf.dtype = UBI_SHORTTERM;
727 /*
728 * Garbage Collector head likely contains long-term data and
729 * does not need to be synchronized by timer.
730 */
731 c->jheads[GCHD].wbuf.dtype = UBI_LONGTERM;
732 c->jheads[GCHD].wbuf.timeout = 0;
733
734 return 0;
735}
736
737/**
738 * free_wbufs - free write-buffers.
739 * @c: UBIFS file-system description object
740 */
741static void free_wbufs(struct ubifs_info *c)
742{
743 int i;
744
745 if (c->jheads) {
746 for (i = 0; i < c->jhead_cnt; i++) {
747 kfree(c->jheads[i].wbuf.buf);
748 kfree(c->jheads[i].wbuf.inodes);
749 }
750 kfree(c->jheads);
751 c->jheads = NULL;
752 }
753}
754
755/**
756 * free_orphans - free orphans.
757 * @c: UBIFS file-system description object
758 */
759static void free_orphans(struct ubifs_info *c)
760{
761 struct ubifs_orphan *orph;
762
763 while (c->orph_dnext) {
764 orph = c->orph_dnext;
765 c->orph_dnext = orph->dnext;
766 list_del(&orph->list);
767 kfree(orph);
768 }
769
770 while (!list_empty(&c->orph_list)) {
771 orph = list_entry(c->orph_list.next, struct ubifs_orphan, list);
772 list_del(&orph->list);
773 kfree(orph);
774 dbg_err("orphan list not empty at unmount");
775 }
776
777 vfree(c->orph_buf);
778 c->orph_buf = NULL;
779}
780
781/**
782 * free_buds - free per-bud objects.
783 * @c: UBIFS file-system description object
784 */
785static void free_buds(struct ubifs_info *c)
786{
787 struct rb_node *this = c->buds.rb_node;
788 struct ubifs_bud *bud;
789
790 while (this) {
791 if (this->rb_left)
792 this = this->rb_left;
793 else if (this->rb_right)
794 this = this->rb_right;
795 else {
796 bud = rb_entry(this, struct ubifs_bud, rb);
797 this = rb_parent(this);
798 if (this) {
799 if (this->rb_left == &bud->rb)
800 this->rb_left = NULL;
801 else
802 this->rb_right = NULL;
803 }
804 kfree(bud);
805 }
806 }
807}
808
809/**
810 * check_volume_empty - check if the UBI volume is empty.
811 * @c: UBIFS file-system description object
812 *
813 * This function checks if the UBIFS volume is empty by looking if its LEBs are
814 * mapped or not. The result of checking is stored in the @c->empty variable.
815 * Returns zero in case of success and a negative error code in case of
816 * failure.
817 */
818static int check_volume_empty(struct ubifs_info *c)
819{
820 int lnum, err;
821
822 c->empty = 1;
823 for (lnum = 0; lnum < c->leb_cnt; lnum++) {
824 err = ubi_is_mapped(c->ubi, lnum);
825 if (unlikely(err < 0))
826 return err;
827 if (err == 1) {
828 c->empty = 0;
829 break;
830 }
831
832 cond_resched();
833 }
834
835 return 0;
836}
837
838/*
839 * UBIFS mount options.
840 *
841 * Opt_fast_unmount: do not run a journal commit before un-mounting
842 * Opt_norm_unmount: run a journal commit before un-mounting
843 * Opt_err: just end of array marker
844 */
845enum {
846 Opt_fast_unmount,
847 Opt_norm_unmount,
848 Opt_err,
849};
850
851static match_table_t tokens = {
852 {Opt_fast_unmount, "fast_unmount"},
853 {Opt_norm_unmount, "norm_unmount"},
854 {Opt_err, NULL},
855};
856
857/**
858 * ubifs_parse_options - parse mount parameters.
859 * @c: UBIFS file-system description object
860 * @options: parameters to parse
861 * @is_remount: non-zero if this is FS re-mount
862 *
863 * This function parses UBIFS mount options and returns zero in case success
864 * and a negative error code in case of failure.
865 */
866static int ubifs_parse_options(struct ubifs_info *c, char *options,
867 int is_remount)
868{
869 char *p;
870 substring_t args[MAX_OPT_ARGS];
871
872 if (!options)
873 return 0;
874
875 while ((p = strsep(&options, ","))) {
876 int token;
877
878 if (!*p)
879 continue;
880
881 token = match_token(p, tokens, args);
882 switch (token) {
883 case Opt_fast_unmount:
884 c->mount_opts.unmount_mode = 2;
885 c->fast_unmount = 1;
886 break;
887 case Opt_norm_unmount:
888 c->mount_opts.unmount_mode = 1;
889 c->fast_unmount = 0;
890 break;
891 default:
892 ubifs_err("unrecognized mount option \"%s\" "
893 "or missing value", p);
894 return -EINVAL;
895 }
896 }
897
898 return 0;
899}
900
901/**
902 * destroy_journal - destroy journal data structures.
903 * @c: UBIFS file-system description object
904 *
905 * This function destroys journal data structures including those that may have
906 * been created by recovery functions.
907 */
908static void destroy_journal(struct ubifs_info *c)
909{
910 while (!list_empty(&c->unclean_leb_list)) {
911 struct ubifs_unclean_leb *ucleb;
912
913 ucleb = list_entry(c->unclean_leb_list.next,
914 struct ubifs_unclean_leb, list);
915 list_del(&ucleb->list);
916 kfree(ucleb);
917 }
918 while (!list_empty(&c->old_buds)) {
919 struct ubifs_bud *bud;
920
921 bud = list_entry(c->old_buds.next, struct ubifs_bud, list);
922 list_del(&bud->list);
923 kfree(bud);
924 }
925 ubifs_destroy_idx_gc(c);
926 ubifs_destroy_size_tree(c);
927 ubifs_tnc_close(c);
928 free_buds(c);
929}
930
931/**
932 * mount_ubifs - mount UBIFS file-system.
933 * @c: UBIFS file-system description object
934 *
935 * This function mounts UBIFS file system. Returns zero in case of success and
936 * a negative error code in case of failure.
937 *
938 * Note, the function does not de-allocate resources it it fails half way
939 * through, and the caller has to do this instead.
940 */
941static int mount_ubifs(struct ubifs_info *c)
942{
943 struct super_block *sb = c->vfs_sb;
944 int err, mounted_read_only = (sb->s_flags & MS_RDONLY);
945 long long x;
946 size_t sz;
947
948 err = init_constants_early(c);
949 if (err)
950 return err;
951
952#ifdef CONFIG_UBIFS_FS_DEBUG
953 c->dbg_buf = vmalloc(c->leb_size);
954 if (!c->dbg_buf)
955 return -ENOMEM;
956#endif
957
958 err = check_volume_empty(c);
959 if (err)
960 goto out_free;
961
962 if (c->empty && (mounted_read_only || c->ro_media)) {
963 /*
964 * This UBI volume is empty, and read-only, or the file system
965 * is mounted read-only - we cannot format it.
966 */
967 ubifs_err("can't format empty UBI volume: read-only %s",
968 c->ro_media ? "UBI volume" : "mount");
969 err = -EROFS;
970 goto out_free;
971 }
972
973 if (c->ro_media && !mounted_read_only) {
974 ubifs_err("cannot mount read-write - read-only media");
975 err = -EROFS;
976 goto out_free;
977 }
978
979 /*
980 * The requirement for the buffer is that it should fit indexing B-tree
981 * height amount of integers. We assume the height if the TNC tree will
982 * never exceed 64.
983 */
984 err = -ENOMEM;
985 c->bottom_up_buf = kmalloc(BOTTOM_UP_HEIGHT * sizeof(int), GFP_KERNEL);
986 if (!c->bottom_up_buf)
987 goto out_free;
988
989 c->sbuf = vmalloc(c->leb_size);
990 if (!c->sbuf)
991 goto out_free;
992
993 if (!mounted_read_only) {
994 c->ileb_buf = vmalloc(c->leb_size);
995 if (!c->ileb_buf)
996 goto out_free;
997 }
998
999 err = ubifs_read_superblock(c);
1000 if (err)
1001 goto out_free;
1002
1003 /*
1004 * Make sure the compressor which is set as the default on in the
1005 * superblock was actually compiled in.
1006 */
1007 if (!ubifs_compr_present(c->default_compr)) {
1008 ubifs_warn("'%s' compressor is set by superblock, but not "
1009 "compiled in", ubifs_compr_name(c->default_compr));
1010 c->default_compr = UBIFS_COMPR_NONE;
1011 }
1012
1013 dbg_failure_mode_registration(c);
1014
1015 err = init_constants_late(c);
1016 if (err)
1017 goto out_dereg;
1018
1019 sz = ALIGN(c->max_idx_node_sz, c->min_io_size);
1020 sz = ALIGN(sz + c->max_idx_node_sz, c->min_io_size);
1021 c->cbuf = kmalloc(sz, GFP_NOFS);
1022 if (!c->cbuf) {
1023 err = -ENOMEM;
1024 goto out_dereg;
1025 }
1026
Sebastian Siewior0855f312008-09-09 11:17:29 +02001027 sprintf(c->bgt_name, BGT_NAME_PATTERN, c->vi.ubi_num, c->vi.vol_id);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001028 if (!mounted_read_only) {
1029 err = alloc_wbufs(c);
1030 if (err)
1031 goto out_cbuf;
1032
1033 /* Create background thread */
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001034 c->bgt = kthread_create(ubifs_bg_thread, c, c->bgt_name);
1035 if (!c->bgt)
1036 c->bgt = ERR_PTR(-EINVAL);
1037 if (IS_ERR(c->bgt)) {
1038 err = PTR_ERR(c->bgt);
1039 c->bgt = NULL;
1040 ubifs_err("cannot spawn \"%s\", error %d",
1041 c->bgt_name, err);
1042 goto out_wbufs;
1043 }
1044 wake_up_process(c->bgt);
1045 }
1046
1047 err = ubifs_read_master(c);
1048 if (err)
1049 goto out_master;
1050
1051 if ((c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY)) != 0) {
1052 ubifs_msg("recovery needed");
1053 c->need_recovery = 1;
1054 if (!mounted_read_only) {
1055 err = ubifs_recover_inl_heads(c, c->sbuf);
1056 if (err)
1057 goto out_master;
1058 }
1059 } else if (!mounted_read_only) {
1060 /*
1061 * Set the "dirty" flag so that if we reboot uncleanly we
1062 * will notice this immediately on the next mount.
1063 */
1064 c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
1065 err = ubifs_write_master(c);
1066 if (err)
1067 goto out_master;
1068 }
1069
1070 err = ubifs_lpt_init(c, 1, !mounted_read_only);
1071 if (err)
1072 goto out_lpt;
1073
1074 err = dbg_check_idx_size(c, c->old_idx_sz);
1075 if (err)
1076 goto out_lpt;
1077
1078 err = ubifs_replay_journal(c);
1079 if (err)
1080 goto out_journal;
1081
1082 err = ubifs_mount_orphans(c, c->need_recovery, mounted_read_only);
1083 if (err)
1084 goto out_orphans;
1085
1086 if (!mounted_read_only) {
1087 int lnum;
1088
1089 /* Check for enough free space */
1090 if (ubifs_calc_available(c, c->min_idx_lebs) <= 0) {
1091 ubifs_err("insufficient available space");
1092 err = -EINVAL;
1093 goto out_orphans;
1094 }
1095
1096 /* Check for enough log space */
1097 lnum = c->lhead_lnum + 1;
1098 if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
1099 lnum = UBIFS_LOG_LNUM;
1100 if (lnum == c->ltail_lnum) {
1101 err = ubifs_consolidate_log(c);
1102 if (err)
1103 goto out_orphans;
1104 }
1105
1106 if (c->need_recovery) {
1107 err = ubifs_recover_size(c);
1108 if (err)
1109 goto out_orphans;
1110 err = ubifs_rcvry_gc_commit(c);
1111 } else
1112 err = take_gc_lnum(c);
1113 if (err)
1114 goto out_orphans;
1115
1116 err = dbg_check_lprops(c);
1117 if (err)
1118 goto out_orphans;
1119 } else if (c->need_recovery) {
1120 err = ubifs_recover_size(c);
1121 if (err)
1122 goto out_orphans;
1123 }
1124
1125 spin_lock(&ubifs_infos_lock);
1126 list_add_tail(&c->infos_list, &ubifs_infos);
1127 spin_unlock(&ubifs_infos_lock);
1128
1129 if (c->need_recovery) {
1130 if (mounted_read_only)
1131 ubifs_msg("recovery deferred");
1132 else {
1133 c->need_recovery = 0;
1134 ubifs_msg("recovery completed");
1135 }
1136 }
1137
1138 err = dbg_check_filesystem(c);
1139 if (err)
1140 goto out_infos;
1141
Artem Bityutskiyce769ca2008-07-18 12:54:21 +03001142 ubifs_msg("mounted UBI device %d, volume %d, name \"%s\"",
1143 c->vi.ubi_num, c->vi.vol_id, c->vi.name);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001144 if (mounted_read_only)
1145 ubifs_msg("mounted read-only");
1146 x = (long long)c->main_lebs * c->leb_size;
Artem Bityutskiy948cfb22008-08-20 11:56:33 +03001147 ubifs_msg("file system size: %lld bytes (%lld KiB, %lld MiB, %d "
1148 "LEBs)", x, x >> 10, x >> 20, c->main_lebs);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001149 x = (long long)c->log_lebs * c->leb_size + c->max_bud_bytes;
Artem Bityutskiy948cfb22008-08-20 11:56:33 +03001150 ubifs_msg("journal size: %lld bytes (%lld KiB, %lld MiB, %d "
1151 "LEBs)", x, x >> 10, x >> 20, c->log_lebs + c->max_bud_cnt);
1152 ubifs_msg("media format: %d (latest is %d)",
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001153 c->fmt_version, UBIFS_FORMAT_VERSION);
Artem Bityutskiy948cfb22008-08-20 11:56:33 +03001154 ubifs_msg("default compressor: %s", ubifs_compr_name(c->default_compr));
1155 ubifs_msg("reserved pool size: %llu bytes (%llu KiB)",
1156 c->report_rp_size, c->report_rp_size >> 10);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001157
1158 dbg_msg("compiled on: " __DATE__ " at " __TIME__);
1159 dbg_msg("min. I/O unit size: %d bytes", c->min_io_size);
1160 dbg_msg("LEB size: %d bytes (%d KiB)",
Artem Bityutskiy948cfb22008-08-20 11:56:33 +03001161 c->leb_size, c->leb_size >> 10);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001162 dbg_msg("data journal heads: %d",
1163 c->jhead_cnt - NONDATA_JHEADS_CNT);
1164 dbg_msg("UUID: %02X%02X%02X%02X-%02X%02X"
1165 "-%02X%02X-%02X%02X-%02X%02X%02X%02X%02X%02X",
1166 c->uuid[0], c->uuid[1], c->uuid[2], c->uuid[3],
1167 c->uuid[4], c->uuid[5], c->uuid[6], c->uuid[7],
1168 c->uuid[8], c->uuid[9], c->uuid[10], c->uuid[11],
1169 c->uuid[12], c->uuid[13], c->uuid[14], c->uuid[15]);
1170 dbg_msg("fast unmount: %d", c->fast_unmount);
1171 dbg_msg("big_lpt %d", c->big_lpt);
1172 dbg_msg("log LEBs: %d (%d - %d)",
1173 c->log_lebs, UBIFS_LOG_LNUM, c->log_last);
1174 dbg_msg("LPT area LEBs: %d (%d - %d)",
1175 c->lpt_lebs, c->lpt_first, c->lpt_last);
1176 dbg_msg("orphan area LEBs: %d (%d - %d)",
1177 c->orph_lebs, c->orph_first, c->orph_last);
1178 dbg_msg("main area LEBs: %d (%d - %d)",
1179 c->main_lebs, c->main_first, c->leb_cnt - 1);
1180 dbg_msg("index LEBs: %d", c->lst.idx_lebs);
1181 dbg_msg("total index bytes: %lld (%lld KiB, %lld MiB)",
1182 c->old_idx_sz, c->old_idx_sz >> 10, c->old_idx_sz >> 20);
1183 dbg_msg("key hash type: %d", c->key_hash_type);
1184 dbg_msg("tree fanout: %d", c->fanout);
1185 dbg_msg("reserved GC LEB: %d", c->gc_lnum);
1186 dbg_msg("first main LEB: %d", c->main_first);
1187 dbg_msg("dead watermark: %d", c->dead_wm);
1188 dbg_msg("dark watermark: %d", c->dark_wm);
1189 x = (long long)c->main_lebs * c->dark_wm;
1190 dbg_msg("max. dark space: %lld (%lld KiB, %lld MiB)",
1191 x, x >> 10, x >> 20);
1192 dbg_msg("maximum bud bytes: %lld (%lld KiB, %lld MiB)",
1193 c->max_bud_bytes, c->max_bud_bytes >> 10,
1194 c->max_bud_bytes >> 20);
1195 dbg_msg("BG commit bud bytes: %lld (%lld KiB, %lld MiB)",
1196 c->bg_bud_bytes, c->bg_bud_bytes >> 10,
1197 c->bg_bud_bytes >> 20);
1198 dbg_msg("current bud bytes %lld (%lld KiB, %lld MiB)",
1199 c->bud_bytes, c->bud_bytes >> 10, c->bud_bytes >> 20);
1200 dbg_msg("max. seq. number: %llu", c->max_sqnum);
1201 dbg_msg("commit number: %llu", c->cmt_no);
1202
1203 return 0;
1204
1205out_infos:
1206 spin_lock(&ubifs_infos_lock);
1207 list_del(&c->infos_list);
1208 spin_unlock(&ubifs_infos_lock);
1209out_orphans:
1210 free_orphans(c);
1211out_journal:
1212 destroy_journal(c);
1213out_lpt:
1214 ubifs_lpt_free(c, 0);
1215out_master:
1216 kfree(c->mst_node);
1217 kfree(c->rcvrd_mst_node);
1218 if (c->bgt)
1219 kthread_stop(c->bgt);
1220out_wbufs:
1221 free_wbufs(c);
1222out_cbuf:
1223 kfree(c->cbuf);
1224out_dereg:
1225 dbg_failure_mode_deregistration(c);
1226out_free:
1227 vfree(c->ileb_buf);
1228 vfree(c->sbuf);
1229 kfree(c->bottom_up_buf);
1230 UBIFS_DBG(vfree(c->dbg_buf));
1231 return err;
1232}
1233
1234/**
1235 * ubifs_umount - un-mount UBIFS file-system.
1236 * @c: UBIFS file-system description object
1237 *
1238 * Note, this function is called to free allocated resourced when un-mounting,
1239 * as well as free resources when an error occurred while we were half way
1240 * through mounting (error path cleanup function). So it has to make sure the
1241 * resource was actually allocated before freeing it.
1242 */
1243static void ubifs_umount(struct ubifs_info *c)
1244{
1245 dbg_gen("un-mounting UBI device %d, volume %d", c->vi.ubi_num,
1246 c->vi.vol_id);
1247
1248 spin_lock(&ubifs_infos_lock);
1249 list_del(&c->infos_list);
1250 spin_unlock(&ubifs_infos_lock);
1251
1252 if (c->bgt)
1253 kthread_stop(c->bgt);
1254
1255 destroy_journal(c);
1256 free_wbufs(c);
1257 free_orphans(c);
1258 ubifs_lpt_free(c, 0);
1259
1260 kfree(c->cbuf);
1261 kfree(c->rcvrd_mst_node);
1262 kfree(c->mst_node);
1263 vfree(c->sbuf);
1264 kfree(c->bottom_up_buf);
1265 UBIFS_DBG(vfree(c->dbg_buf));
1266 vfree(c->ileb_buf);
1267 dbg_failure_mode_deregistration(c);
1268}
1269
1270/**
1271 * ubifs_remount_rw - re-mount in read-write mode.
1272 * @c: UBIFS file-system description object
1273 *
1274 * UBIFS avoids allocating many unnecessary resources when mounted in read-only
1275 * mode. This function allocates the needed resources and re-mounts UBIFS in
1276 * read-write mode.
1277 */
1278static int ubifs_remount_rw(struct ubifs_info *c)
1279{
1280 int err, lnum;
1281
1282 if (c->ro_media)
1283 return -EINVAL;
1284
1285 mutex_lock(&c->umount_mutex);
1286 c->remounting_rw = 1;
1287
1288 /* Check for enough free space */
1289 if (ubifs_calc_available(c, c->min_idx_lebs) <= 0) {
1290 ubifs_err("insufficient available space");
1291 err = -EINVAL;
1292 goto out;
1293 }
1294
1295 if (c->old_leb_cnt != c->leb_cnt) {
1296 struct ubifs_sb_node *sup;
1297
1298 sup = ubifs_read_sb_node(c);
1299 if (IS_ERR(sup)) {
1300 err = PTR_ERR(sup);
1301 goto out;
1302 }
1303 sup->leb_cnt = cpu_to_le32(c->leb_cnt);
1304 err = ubifs_write_sb_node(c, sup);
1305 if (err)
1306 goto out;
1307 }
1308
1309 if (c->need_recovery) {
1310 ubifs_msg("completing deferred recovery");
1311 err = ubifs_write_rcvrd_mst_node(c);
1312 if (err)
1313 goto out;
1314 err = ubifs_recover_size(c);
1315 if (err)
1316 goto out;
1317 err = ubifs_clean_lebs(c, c->sbuf);
1318 if (err)
1319 goto out;
1320 err = ubifs_recover_inl_heads(c, c->sbuf);
1321 if (err)
1322 goto out;
1323 }
1324
1325 if (!(c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY))) {
1326 c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
1327 err = ubifs_write_master(c);
1328 if (err)
1329 goto out;
1330 }
1331
1332 c->ileb_buf = vmalloc(c->leb_size);
1333 if (!c->ileb_buf) {
1334 err = -ENOMEM;
1335 goto out;
1336 }
1337
1338 err = ubifs_lpt_init(c, 0, 1);
1339 if (err)
1340 goto out;
1341
1342 err = alloc_wbufs(c);
1343 if (err)
1344 goto out;
1345
1346 ubifs_create_buds_lists(c);
1347
1348 /* Create background thread */
1349 c->bgt = kthread_create(ubifs_bg_thread, c, c->bgt_name);
1350 if (!c->bgt)
1351 c->bgt = ERR_PTR(-EINVAL);
1352 if (IS_ERR(c->bgt)) {
1353 err = PTR_ERR(c->bgt);
1354 c->bgt = NULL;
1355 ubifs_err("cannot spawn \"%s\", error %d",
1356 c->bgt_name, err);
1357 return err;
1358 }
1359 wake_up_process(c->bgt);
1360
1361 c->orph_buf = vmalloc(c->leb_size);
1362 if (!c->orph_buf)
1363 return -ENOMEM;
1364
1365 /* Check for enough log space */
1366 lnum = c->lhead_lnum + 1;
1367 if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
1368 lnum = UBIFS_LOG_LNUM;
1369 if (lnum == c->ltail_lnum) {
1370 err = ubifs_consolidate_log(c);
1371 if (err)
1372 goto out;
1373 }
1374
1375 if (c->need_recovery)
1376 err = ubifs_rcvry_gc_commit(c);
1377 else
1378 err = take_gc_lnum(c);
1379 if (err)
1380 goto out;
1381
1382 if (c->need_recovery) {
1383 c->need_recovery = 0;
1384 ubifs_msg("deferred recovery completed");
1385 }
1386
1387 dbg_gen("re-mounted read-write");
1388 c->vfs_sb->s_flags &= ~MS_RDONLY;
1389 c->remounting_rw = 0;
1390 mutex_unlock(&c->umount_mutex);
1391 return 0;
1392
1393out:
1394 vfree(c->orph_buf);
1395 c->orph_buf = NULL;
1396 if (c->bgt) {
1397 kthread_stop(c->bgt);
1398 c->bgt = NULL;
1399 }
1400 free_wbufs(c);
1401 vfree(c->ileb_buf);
1402 c->ileb_buf = NULL;
1403 ubifs_lpt_free(c, 1);
1404 c->remounting_rw = 0;
1405 mutex_unlock(&c->umount_mutex);
1406 return err;
1407}
1408
1409/**
1410 * commit_on_unmount - commit the journal when un-mounting.
1411 * @c: UBIFS file-system description object
1412 *
1413 * This function is called during un-mounting and it commits the journal unless
1414 * the "fast unmount" mode is enabled. It also avoids committing the journal if
1415 * it contains too few data.
1416 *
1417 * Sometimes recovery requires the journal to be committed at least once, and
1418 * this function takes care about this.
1419 */
1420static void commit_on_unmount(struct ubifs_info *c)
1421{
1422 if (!c->fast_unmount) {
1423 long long bud_bytes;
1424
1425 spin_lock(&c->buds_lock);
1426 bud_bytes = c->bud_bytes;
1427 spin_unlock(&c->buds_lock);
1428 if (bud_bytes > c->leb_size)
1429 ubifs_run_commit(c);
1430 }
1431}
1432
1433/**
1434 * ubifs_remount_ro - re-mount in read-only mode.
1435 * @c: UBIFS file-system description object
1436 *
1437 * We rely on VFS to have stopped writing. Possibly the background thread could
1438 * be running a commit, however kthread_stop will wait in that case.
1439 */
1440static void ubifs_remount_ro(struct ubifs_info *c)
1441{
1442 int i, err;
1443
1444 ubifs_assert(!c->need_recovery);
1445 commit_on_unmount(c);
1446
1447 mutex_lock(&c->umount_mutex);
1448 if (c->bgt) {
1449 kthread_stop(c->bgt);
1450 c->bgt = NULL;
1451 }
1452
1453 for (i = 0; i < c->jhead_cnt; i++) {
1454 ubifs_wbuf_sync(&c->jheads[i].wbuf);
1455 del_timer_sync(&c->jheads[i].wbuf.timer);
1456 }
1457
1458 if (!c->ro_media) {
1459 c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
1460 c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
1461 c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
1462 err = ubifs_write_master(c);
1463 if (err)
1464 ubifs_ro_mode(c, err);
1465 }
1466
1467 ubifs_destroy_idx_gc(c);
1468 free_wbufs(c);
1469 vfree(c->orph_buf);
1470 c->orph_buf = NULL;
1471 vfree(c->ileb_buf);
1472 c->ileb_buf = NULL;
1473 ubifs_lpt_free(c, 1);
1474 mutex_unlock(&c->umount_mutex);
1475}
1476
1477static void ubifs_put_super(struct super_block *sb)
1478{
1479 int i;
1480 struct ubifs_info *c = sb->s_fs_info;
1481
1482 ubifs_msg("un-mount UBI device %d, volume %d", c->vi.ubi_num,
1483 c->vi.vol_id);
1484 /*
1485 * The following asserts are only valid if there has not been a failure
1486 * of the media. For example, there will be dirty inodes if we failed
1487 * to write them back because of I/O errors.
1488 */
1489 ubifs_assert(atomic_long_read(&c->dirty_pg_cnt) == 0);
1490 ubifs_assert(c->budg_idx_growth == 0);
Artem Bityutskiy7d32c2b2008-07-18 18:54:29 +03001491 ubifs_assert(c->budg_dd_growth == 0);
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001492 ubifs_assert(c->budg_data_growth == 0);
1493
1494 /*
1495 * The 'c->umount_lock' prevents races between UBIFS memory shrinker
1496 * and file system un-mount. Namely, it prevents the shrinker from
1497 * picking this superblock for shrinking - it will be just skipped if
1498 * the mutex is locked.
1499 */
1500 mutex_lock(&c->umount_mutex);
1501 if (!(c->vfs_sb->s_flags & MS_RDONLY)) {
1502 /*
1503 * First of all kill the background thread to make sure it does
1504 * not interfere with un-mounting and freeing resources.
1505 */
1506 if (c->bgt) {
1507 kthread_stop(c->bgt);
1508 c->bgt = NULL;
1509 }
1510
1511 /* Synchronize write-buffers */
1512 if (c->jheads)
1513 for (i = 0; i < c->jhead_cnt; i++) {
1514 ubifs_wbuf_sync(&c->jheads[i].wbuf);
1515 del_timer_sync(&c->jheads[i].wbuf.timer);
1516 }
1517
1518 /*
1519 * On fatal errors c->ro_media is set to 1, in which case we do
1520 * not write the master node.
1521 */
1522 if (!c->ro_media) {
1523 /*
1524 * We are being cleanly unmounted which means the
1525 * orphans were killed - indicate this in the master
1526 * node. Also save the reserved GC LEB number.
1527 */
1528 int err;
1529
1530 c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
1531 c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
1532 c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
1533 err = ubifs_write_master(c);
1534 if (err)
1535 /*
1536 * Recovery will attempt to fix the master area
1537 * next mount, so we just print a message and
1538 * continue to unmount normally.
1539 */
1540 ubifs_err("failed to write master node, "
1541 "error %d", err);
1542 }
1543 }
1544
1545 ubifs_umount(c);
1546 bdi_destroy(&c->bdi);
1547 ubi_close_volume(c->ubi);
1548 mutex_unlock(&c->umount_mutex);
1549 kfree(c);
1550}
1551
1552static int ubifs_remount_fs(struct super_block *sb, int *flags, char *data)
1553{
1554 int err;
1555 struct ubifs_info *c = sb->s_fs_info;
1556
1557 dbg_gen("old flags %#lx, new flags %#x", sb->s_flags, *flags);
1558
1559 err = ubifs_parse_options(c, data, 1);
1560 if (err) {
1561 ubifs_err("invalid or unknown remount parameter");
1562 return err;
1563 }
1564 if ((sb->s_flags & MS_RDONLY) && !(*flags & MS_RDONLY)) {
1565 err = ubifs_remount_rw(c);
1566 if (err)
1567 return err;
1568 } else if (!(sb->s_flags & MS_RDONLY) && (*flags & MS_RDONLY))
1569 ubifs_remount_ro(c);
1570
1571 return 0;
1572}
1573
1574struct super_operations ubifs_super_operations = {
1575 .alloc_inode = ubifs_alloc_inode,
1576 .destroy_inode = ubifs_destroy_inode,
1577 .put_super = ubifs_put_super,
1578 .write_inode = ubifs_write_inode,
1579 .delete_inode = ubifs_delete_inode,
1580 .statfs = ubifs_statfs,
1581 .dirty_inode = ubifs_dirty_inode,
1582 .remount_fs = ubifs_remount_fs,
1583 .show_options = ubifs_show_options,
1584 .sync_fs = ubifs_sync_fs,
1585};
1586
1587/**
1588 * open_ubi - parse UBI device name string and open the UBI device.
1589 * @name: UBI volume name
1590 * @mode: UBI volume open mode
1591 *
1592 * There are several ways to specify UBI volumes when mounting UBIFS:
1593 * o ubiX_Y - UBI device number X, volume Y;
1594 * o ubiY - UBI device number 0, volume Y;
1595 * o ubiX:NAME - mount UBI device X, volume with name NAME;
1596 * o ubi:NAME - mount UBI device 0, volume with name NAME.
1597 *
1598 * Alternative '!' separator may be used instead of ':' (because some shells
1599 * like busybox may interpret ':' as an NFS host name separator). This function
1600 * returns ubi volume object in case of success and a negative error code in
1601 * case of failure.
1602 */
1603static struct ubi_volume_desc *open_ubi(const char *name, int mode)
1604{
1605 int dev, vol;
1606 char *endptr;
1607
1608 if (name[0] != 'u' || name[1] != 'b' || name[2] != 'i')
1609 return ERR_PTR(-EINVAL);
1610
1611 /* ubi:NAME method */
1612 if ((name[3] == ':' || name[3] == '!') && name[4] != '\0')
1613 return ubi_open_volume_nm(0, name + 4, mode);
1614
1615 if (!isdigit(name[3]))
1616 return ERR_PTR(-EINVAL);
1617
1618 dev = simple_strtoul(name + 3, &endptr, 0);
1619
1620 /* ubiY method */
1621 if (*endptr == '\0')
1622 return ubi_open_volume(0, dev, mode);
1623
1624 /* ubiX_Y method */
1625 if (*endptr == '_' && isdigit(endptr[1])) {
1626 vol = simple_strtoul(endptr + 1, &endptr, 0);
1627 if (*endptr != '\0')
1628 return ERR_PTR(-EINVAL);
1629 return ubi_open_volume(dev, vol, mode);
1630 }
1631
1632 /* ubiX:NAME method */
1633 if ((*endptr == ':' || *endptr == '!') && endptr[1] != '\0')
1634 return ubi_open_volume_nm(dev, ++endptr, mode);
1635
1636 return ERR_PTR(-EINVAL);
1637}
1638
1639static int ubifs_fill_super(struct super_block *sb, void *data, int silent)
1640{
1641 struct ubi_volume_desc *ubi = sb->s_fs_info;
1642 struct ubifs_info *c;
1643 struct inode *root;
1644 int err;
1645
1646 c = kzalloc(sizeof(struct ubifs_info), GFP_KERNEL);
1647 if (!c)
1648 return -ENOMEM;
1649
1650 spin_lock_init(&c->cnt_lock);
1651 spin_lock_init(&c->cs_lock);
1652 spin_lock_init(&c->buds_lock);
1653 spin_lock_init(&c->space_lock);
1654 spin_lock_init(&c->orphan_lock);
1655 init_rwsem(&c->commit_sem);
1656 mutex_init(&c->lp_mutex);
1657 mutex_init(&c->tnc_mutex);
1658 mutex_init(&c->log_mutex);
1659 mutex_init(&c->mst_mutex);
1660 mutex_init(&c->umount_mutex);
1661 init_waitqueue_head(&c->cmt_wq);
1662 c->buds = RB_ROOT;
1663 c->old_idx = RB_ROOT;
1664 c->size_tree = RB_ROOT;
1665 c->orph_tree = RB_ROOT;
1666 INIT_LIST_HEAD(&c->infos_list);
1667 INIT_LIST_HEAD(&c->idx_gc);
1668 INIT_LIST_HEAD(&c->replay_list);
1669 INIT_LIST_HEAD(&c->replay_buds);
1670 INIT_LIST_HEAD(&c->uncat_list);
1671 INIT_LIST_HEAD(&c->empty_list);
1672 INIT_LIST_HEAD(&c->freeable_list);
1673 INIT_LIST_HEAD(&c->frdi_idx_list);
1674 INIT_LIST_HEAD(&c->unclean_leb_list);
1675 INIT_LIST_HEAD(&c->old_buds);
1676 INIT_LIST_HEAD(&c->orph_list);
1677 INIT_LIST_HEAD(&c->orph_new);
1678
1679 c->highest_inum = UBIFS_FIRST_INO;
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001680 c->lhead_lnum = c->ltail_lnum = UBIFS_LOG_LNUM;
1681
1682 ubi_get_volume_info(ubi, &c->vi);
1683 ubi_get_device_info(c->vi.ubi_num, &c->di);
1684
1685 /* Re-open the UBI device in read-write mode */
1686 c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READWRITE);
1687 if (IS_ERR(c->ubi)) {
1688 err = PTR_ERR(c->ubi);
1689 goto out_free;
1690 }
1691
1692 /*
Artem Bityutskiy0a883a02008-08-13 14:13:26 +03001693 * UBIFS provides 'backing_dev_info' in order to disable read-ahead. For
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001694 * UBIFS, I/O is not deferred, it is done immediately in readpage,
1695 * which means the user would have to wait not just for their own I/O
Artem Bityutskiy0a883a02008-08-13 14:13:26 +03001696 * but the read-ahead I/O as well i.e. completely pointless.
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001697 *
1698 * Read-ahead will be disabled because @c->bdi.ra_pages is 0.
1699 */
1700 c->bdi.capabilities = BDI_CAP_MAP_COPY;
1701 c->bdi.unplug_io_fn = default_unplug_io_fn;
1702 err = bdi_init(&c->bdi);
1703 if (err)
1704 goto out_close;
1705
1706 err = ubifs_parse_options(c, data, 0);
1707 if (err)
1708 goto out_bdi;
1709
1710 c->vfs_sb = sb;
1711
1712 sb->s_fs_info = c;
1713 sb->s_magic = UBIFS_SUPER_MAGIC;
1714 sb->s_blocksize = UBIFS_BLOCK_SIZE;
1715 sb->s_blocksize_bits = UBIFS_BLOCK_SHIFT;
1716 sb->s_dev = c->vi.cdev;
1717 sb->s_maxbytes = c->max_inode_sz = key_max_inode_size(c);
1718 if (c->max_inode_sz > MAX_LFS_FILESIZE)
1719 sb->s_maxbytes = c->max_inode_sz = MAX_LFS_FILESIZE;
1720 sb->s_op = &ubifs_super_operations;
1721
1722 mutex_lock(&c->umount_mutex);
1723 err = mount_ubifs(c);
1724 if (err) {
1725 ubifs_assert(err < 0);
1726 goto out_unlock;
1727 }
1728
1729 /* Read the root inode */
1730 root = ubifs_iget(sb, UBIFS_ROOT_INO);
1731 if (IS_ERR(root)) {
1732 err = PTR_ERR(root);
1733 goto out_umount;
1734 }
1735
1736 sb->s_root = d_alloc_root(root);
1737 if (!sb->s_root)
1738 goto out_iput;
1739
1740 mutex_unlock(&c->umount_mutex);
1741
1742 return 0;
1743
1744out_iput:
1745 iput(root);
1746out_umount:
1747 ubifs_umount(c);
1748out_unlock:
1749 mutex_unlock(&c->umount_mutex);
1750out_bdi:
1751 bdi_destroy(&c->bdi);
1752out_close:
1753 ubi_close_volume(c->ubi);
1754out_free:
1755 kfree(c);
1756 return err;
1757}
1758
1759static int sb_test(struct super_block *sb, void *data)
1760{
1761 dev_t *dev = data;
1762
1763 return sb->s_dev == *dev;
1764}
1765
1766static int sb_set(struct super_block *sb, void *data)
1767{
1768 dev_t *dev = data;
1769
1770 sb->s_dev = *dev;
1771 return 0;
1772}
1773
1774static int ubifs_get_sb(struct file_system_type *fs_type, int flags,
1775 const char *name, void *data, struct vfsmount *mnt)
1776{
1777 struct ubi_volume_desc *ubi;
1778 struct ubi_volume_info vi;
1779 struct super_block *sb;
1780 int err;
1781
1782 dbg_gen("name %s, flags %#x", name, flags);
1783
1784 /*
1785 * Get UBI device number and volume ID. Mount it read-only so far
1786 * because this might be a new mount point, and UBI allows only one
1787 * read-write user at a time.
1788 */
1789 ubi = open_ubi(name, UBI_READONLY);
1790 if (IS_ERR(ubi)) {
1791 ubifs_err("cannot open \"%s\", error %d",
1792 name, (int)PTR_ERR(ubi));
1793 return PTR_ERR(ubi);
1794 }
1795 ubi_get_volume_info(ubi, &vi);
1796
1797 dbg_gen("opened ubi%d_%d", vi.ubi_num, vi.vol_id);
1798
1799 sb = sget(fs_type, &sb_test, &sb_set, &vi.cdev);
1800 if (IS_ERR(sb)) {
1801 err = PTR_ERR(sb);
1802 goto out_close;
1803 }
1804
1805 if (sb->s_root) {
1806 /* A new mount point for already mounted UBIFS */
1807 dbg_gen("this ubi volume is already mounted");
1808 if ((flags ^ sb->s_flags) & MS_RDONLY) {
1809 err = -EBUSY;
1810 goto out_deact;
1811 }
1812 } else {
1813 sb->s_flags = flags;
1814 /*
1815 * Pass 'ubi' to 'fill_super()' in sb->s_fs_info where it is
1816 * replaced by 'c'.
1817 */
1818 sb->s_fs_info = ubi;
1819 err = ubifs_fill_super(sb, data, flags & MS_SILENT ? 1 : 0);
1820 if (err)
1821 goto out_deact;
1822 /* We do not support atime */
1823 sb->s_flags |= MS_ACTIVE | MS_NOATIME;
1824 }
1825
1826 /* 'fill_super()' opens ubi again so we must close it here */
1827 ubi_close_volume(ubi);
1828
1829 return simple_set_mnt(mnt, sb);
1830
1831out_deact:
1832 up_write(&sb->s_umount);
1833 deactivate_super(sb);
1834out_close:
1835 ubi_close_volume(ubi);
1836 return err;
1837}
1838
1839static void ubifs_kill_sb(struct super_block *sb)
1840{
1841 struct ubifs_info *c = sb->s_fs_info;
1842
1843 /*
1844 * We do 'commit_on_unmount()' here instead of 'ubifs_put_super()'
1845 * in order to be outside BKL.
1846 */
1847 if (sb->s_root && !(sb->s_flags & MS_RDONLY))
1848 commit_on_unmount(c);
1849 /* The un-mount routine is actually done in put_super() */
1850 generic_shutdown_super(sb);
1851}
1852
1853static struct file_system_type ubifs_fs_type = {
1854 .name = "ubifs",
1855 .owner = THIS_MODULE,
1856 .get_sb = ubifs_get_sb,
1857 .kill_sb = ubifs_kill_sb
1858};
1859
1860/*
1861 * Inode slab cache constructor.
1862 */
Alexey Dobriyan51cc5062008-07-25 19:45:34 -07001863static void inode_slab_ctor(void *obj)
Artem Bityutskiy1e517642008-07-14 19:08:37 +03001864{
1865 struct ubifs_inode *ui = obj;
1866 inode_init_once(&ui->vfs_inode);
1867}
1868
1869static int __init ubifs_init(void)
1870{
1871 int err;
1872
1873 BUILD_BUG_ON(sizeof(struct ubifs_ch) != 24);
1874
1875 /* Make sure node sizes are 8-byte aligned */
1876 BUILD_BUG_ON(UBIFS_CH_SZ & 7);
1877 BUILD_BUG_ON(UBIFS_INO_NODE_SZ & 7);
1878 BUILD_BUG_ON(UBIFS_DENT_NODE_SZ & 7);
1879 BUILD_BUG_ON(UBIFS_XENT_NODE_SZ & 7);
1880 BUILD_BUG_ON(UBIFS_DATA_NODE_SZ & 7);
1881 BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ & 7);
1882 BUILD_BUG_ON(UBIFS_SB_NODE_SZ & 7);
1883 BUILD_BUG_ON(UBIFS_MST_NODE_SZ & 7);
1884 BUILD_BUG_ON(UBIFS_REF_NODE_SZ & 7);
1885 BUILD_BUG_ON(UBIFS_CS_NODE_SZ & 7);
1886 BUILD_BUG_ON(UBIFS_ORPH_NODE_SZ & 7);
1887
1888 BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ & 7);
1889 BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ & 7);
1890 BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ & 7);
1891 BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ & 7);
1892 BUILD_BUG_ON(UBIFS_MAX_NODE_SZ & 7);
1893 BUILD_BUG_ON(MIN_WRITE_SZ & 7);
1894
1895 /* Check min. node size */
1896 BUILD_BUG_ON(UBIFS_INO_NODE_SZ < MIN_WRITE_SZ);
1897 BUILD_BUG_ON(UBIFS_DENT_NODE_SZ < MIN_WRITE_SZ);
1898 BUILD_BUG_ON(UBIFS_XENT_NODE_SZ < MIN_WRITE_SZ);
1899 BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ < MIN_WRITE_SZ);
1900
1901 BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
1902 BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
1903 BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ > UBIFS_MAX_NODE_SZ);
1904 BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ > UBIFS_MAX_NODE_SZ);
1905
1906 /* Defined node sizes */
1907 BUILD_BUG_ON(UBIFS_SB_NODE_SZ != 4096);
1908 BUILD_BUG_ON(UBIFS_MST_NODE_SZ != 512);
1909 BUILD_BUG_ON(UBIFS_INO_NODE_SZ != 160);
1910 BUILD_BUG_ON(UBIFS_REF_NODE_SZ != 64);
1911
1912 /*
1913 * We require that PAGE_CACHE_SIZE is greater-than-or-equal-to
1914 * UBIFS_BLOCK_SIZE. It is assumed that both are powers of 2.
1915 */
1916 if (PAGE_CACHE_SIZE < UBIFS_BLOCK_SIZE) {
1917 ubifs_err("VFS page cache size is %u bytes, but UBIFS requires"
1918 " at least 4096 bytes",
1919 (unsigned int)PAGE_CACHE_SIZE);
1920 return -EINVAL;
1921 }
1922
1923 err = register_filesystem(&ubifs_fs_type);
1924 if (err) {
1925 ubifs_err("cannot register file system, error %d", err);
1926 return err;
1927 }
1928
1929 err = -ENOMEM;
1930 ubifs_inode_slab = kmem_cache_create("ubifs_inode_slab",
1931 sizeof(struct ubifs_inode), 0,
1932 SLAB_MEM_SPREAD | SLAB_RECLAIM_ACCOUNT,
1933 &inode_slab_ctor);
1934 if (!ubifs_inode_slab)
1935 goto out_reg;
1936
1937 register_shrinker(&ubifs_shrinker_info);
1938
1939 err = ubifs_compressors_init();
1940 if (err)
1941 goto out_compr;
1942
1943 return 0;
1944
1945out_compr:
1946 unregister_shrinker(&ubifs_shrinker_info);
1947 kmem_cache_destroy(ubifs_inode_slab);
1948out_reg:
1949 unregister_filesystem(&ubifs_fs_type);
1950 return err;
1951}
1952/* late_initcall to let compressors initialize first */
1953late_initcall(ubifs_init);
1954
1955static void __exit ubifs_exit(void)
1956{
1957 ubifs_assert(list_empty(&ubifs_infos));
1958 ubifs_assert(atomic_long_read(&ubifs_clean_zn_cnt) == 0);
1959
1960 ubifs_compressors_exit();
1961 unregister_shrinker(&ubifs_shrinker_info);
1962 kmem_cache_destroy(ubifs_inode_slab);
1963 unregister_filesystem(&ubifs_fs_type);
1964}
1965module_exit(ubifs_exit);
1966
1967MODULE_LICENSE("GPL");
1968MODULE_VERSION(__stringify(UBIFS_VERSION));
1969MODULE_AUTHOR("Artem Bityutskiy, Adrian Hunter");
1970MODULE_DESCRIPTION("UBIFS - UBI File System");