MIPS: KVM: Add MSA exception handling
[deliverable/linux.git] / fs / ubifs / dir.c
1 /* * This file is part of UBIFS.
2 *
3 * Copyright (C) 2006-2008 Nokia Corporation.
4 * Copyright (C) 2006, 2007 University of Szeged, Hungary
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 * Zoltan Sogor
22 */
23
24 /*
25 * This file implements directory operations.
26 *
27 * All FS operations in this file allocate budget before writing anything to the
28 * media. If they fail to allocate it, the error is returned. The only
29 * exceptions are 'ubifs_unlink()' and 'ubifs_rmdir()' which keep working even
30 * if they unable to allocate the budget, because deletion %-ENOSPC failure is
31 * not what users are usually ready to get. UBIFS budgeting subsystem has some
32 * space reserved for these purposes.
33 *
34 * All operations in this file write all inodes which they change straight
35 * away, instead of marking them dirty. For example, 'ubifs_link()' changes
36 * @i_size of the parent inode and writes the parent inode together with the
37 * target inode. This was done to simplify file-system recovery which would
38 * otherwise be very difficult to do. The only exception is rename which marks
39 * the re-named inode dirty (because its @i_ctime is updated) but does not
40 * write it, but just marks it as dirty.
41 */
42
43 #include "ubifs.h"
44
45 /**
46 * inherit_flags - inherit flags of the parent inode.
47 * @dir: parent inode
48 * @mode: new inode mode flags
49 *
50 * This is a helper function for 'ubifs_new_inode()' which inherits flag of the
51 * parent directory inode @dir. UBIFS inodes inherit the following flags:
52 * o %UBIFS_COMPR_FL, which is useful to switch compression on/of on
53 * sub-directory basis;
54 * o %UBIFS_SYNC_FL - useful for the same reasons;
55 * o %UBIFS_DIRSYNC_FL - similar, but relevant only to directories.
56 *
57 * This function returns the inherited flags.
58 */
59 static int inherit_flags(const struct inode *dir, umode_t mode)
60 {
61 int flags;
62 const struct ubifs_inode *ui = ubifs_inode(dir);
63
64 if (!S_ISDIR(dir->i_mode))
65 /*
66 * The parent is not a directory, which means that an extended
67 * attribute inode is being created. No flags.
68 */
69 return 0;
70
71 flags = ui->flags & (UBIFS_COMPR_FL | UBIFS_SYNC_FL | UBIFS_DIRSYNC_FL);
72 if (!S_ISDIR(mode))
73 /* The "DIRSYNC" flag only applies to directories */
74 flags &= ~UBIFS_DIRSYNC_FL;
75 return flags;
76 }
77
78 /**
79 * ubifs_new_inode - allocate new UBIFS inode object.
80 * @c: UBIFS file-system description object
81 * @dir: parent directory inode
82 * @mode: inode mode flags
83 *
84 * This function finds an unused inode number, allocates new inode and
85 * initializes it. Returns new inode in case of success and an error code in
86 * case of failure.
87 */
88 struct inode *ubifs_new_inode(struct ubifs_info *c, const struct inode *dir,
89 umode_t mode)
90 {
91 struct inode *inode;
92 struct ubifs_inode *ui;
93
94 inode = new_inode(c->vfs_sb);
95 ui = ubifs_inode(inode);
96 if (!inode)
97 return ERR_PTR(-ENOMEM);
98
99 /*
100 * Set 'S_NOCMTIME' to prevent VFS form updating [mc]time of inodes and
101 * marking them dirty in file write path (see 'file_update_time()').
102 * UBIFS has to fully control "clean <-> dirty" transitions of inodes
103 * to make budgeting work.
104 */
105 inode->i_flags |= S_NOCMTIME;
106
107 inode_init_owner(inode, dir, mode);
108 inode->i_mtime = inode->i_atime = inode->i_ctime =
109 ubifs_current_time(inode);
110 inode->i_mapping->nrpages = 0;
111
112 switch (mode & S_IFMT) {
113 case S_IFREG:
114 inode->i_mapping->a_ops = &ubifs_file_address_operations;
115 inode->i_op = &ubifs_file_inode_operations;
116 inode->i_fop = &ubifs_file_operations;
117 break;
118 case S_IFDIR:
119 inode->i_op = &ubifs_dir_inode_operations;
120 inode->i_fop = &ubifs_dir_operations;
121 inode->i_size = ui->ui_size = UBIFS_INO_NODE_SZ;
122 break;
123 case S_IFLNK:
124 inode->i_op = &ubifs_symlink_inode_operations;
125 break;
126 case S_IFSOCK:
127 case S_IFIFO:
128 case S_IFBLK:
129 case S_IFCHR:
130 inode->i_op = &ubifs_file_inode_operations;
131 break;
132 default:
133 BUG();
134 }
135
136 ui->flags = inherit_flags(dir, mode);
137 ubifs_set_inode_flags(inode);
138 if (S_ISREG(mode))
139 ui->compr_type = c->default_compr;
140 else
141 ui->compr_type = UBIFS_COMPR_NONE;
142 ui->synced_i_size = 0;
143
144 spin_lock(&c->cnt_lock);
145 /* Inode number overflow is currently not supported */
146 if (c->highest_inum >= INUM_WARN_WATERMARK) {
147 if (c->highest_inum >= INUM_WATERMARK) {
148 spin_unlock(&c->cnt_lock);
149 ubifs_err("out of inode numbers");
150 make_bad_inode(inode);
151 iput(inode);
152 return ERR_PTR(-EINVAL);
153 }
154 ubifs_warn("running out of inode numbers (current %lu, max %d)",
155 (unsigned long)c->highest_inum, INUM_WATERMARK);
156 }
157
158 inode->i_ino = ++c->highest_inum;
159 /*
160 * The creation sequence number remains with this inode for its
161 * lifetime. All nodes for this inode have a greater sequence number,
162 * and so it is possible to distinguish obsolete nodes belonging to a
163 * previous incarnation of the same inode number - for example, for the
164 * purpose of rebuilding the index.
165 */
166 ui->creat_sqnum = ++c->max_sqnum;
167 spin_unlock(&c->cnt_lock);
168 return inode;
169 }
170
171 static int dbg_check_name(const struct ubifs_info *c,
172 const struct ubifs_dent_node *dent,
173 const struct qstr *nm)
174 {
175 if (!dbg_is_chk_gen(c))
176 return 0;
177 if (le16_to_cpu(dent->nlen) != nm->len)
178 return -EINVAL;
179 if (memcmp(dent->name, nm->name, nm->len))
180 return -EINVAL;
181 return 0;
182 }
183
184 static struct dentry *ubifs_lookup(struct inode *dir, struct dentry *dentry,
185 unsigned int flags)
186 {
187 int err;
188 union ubifs_key key;
189 struct inode *inode = NULL;
190 struct ubifs_dent_node *dent;
191 struct ubifs_info *c = dir->i_sb->s_fs_info;
192
193 dbg_gen("'%pd' in dir ino %lu", dentry, dir->i_ino);
194
195 if (dentry->d_name.len > UBIFS_MAX_NLEN)
196 return ERR_PTR(-ENAMETOOLONG);
197
198 dent = kmalloc(UBIFS_MAX_DENT_NODE_SZ, GFP_NOFS);
199 if (!dent)
200 return ERR_PTR(-ENOMEM);
201
202 dent_key_init(c, &key, dir->i_ino, &dentry->d_name);
203
204 err = ubifs_tnc_lookup_nm(c, &key, dent, &dentry->d_name);
205 if (err) {
206 if (err == -ENOENT) {
207 dbg_gen("not found");
208 goto done;
209 }
210 goto out;
211 }
212
213 if (dbg_check_name(c, dent, &dentry->d_name)) {
214 err = -EINVAL;
215 goto out;
216 }
217
218 inode = ubifs_iget(dir->i_sb, le64_to_cpu(dent->inum));
219 if (IS_ERR(inode)) {
220 /*
221 * This should not happen. Probably the file-system needs
222 * checking.
223 */
224 err = PTR_ERR(inode);
225 ubifs_err("dead directory entry '%pd', error %d",
226 dentry, err);
227 ubifs_ro_mode(c, err);
228 goto out;
229 }
230
231 done:
232 kfree(dent);
233 /*
234 * Note, d_splice_alias() would be required instead if we supported
235 * NFS.
236 */
237 d_add(dentry, inode);
238 return NULL;
239
240 out:
241 kfree(dent);
242 return ERR_PTR(err);
243 }
244
245 static int ubifs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
246 bool excl)
247 {
248 struct inode *inode;
249 struct ubifs_info *c = dir->i_sb->s_fs_info;
250 int err, sz_change = CALC_DENT_SIZE(dentry->d_name.len);
251 struct ubifs_budget_req req = { .new_ino = 1, .new_dent = 1,
252 .dirtied_ino = 1 };
253 struct ubifs_inode *dir_ui = ubifs_inode(dir);
254
255 /*
256 * Budget request settings: new inode, new direntry, changing the
257 * parent directory inode.
258 */
259
260 dbg_gen("dent '%pd', mode %#hx in dir ino %lu",
261 dentry, mode, dir->i_ino);
262
263 err = ubifs_budget_space(c, &req);
264 if (err)
265 return err;
266
267 inode = ubifs_new_inode(c, dir, mode);
268 if (IS_ERR(inode)) {
269 err = PTR_ERR(inode);
270 goto out_budg;
271 }
272
273 err = ubifs_init_security(dir, inode, &dentry->d_name);
274 if (err)
275 goto out_cancel;
276
277 mutex_lock(&dir_ui->ui_mutex);
278 dir->i_size += sz_change;
279 dir_ui->ui_size = dir->i_size;
280 dir->i_mtime = dir->i_ctime = inode->i_ctime;
281 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 0, 0);
282 if (err)
283 goto out_cancel;
284 mutex_unlock(&dir_ui->ui_mutex);
285
286 ubifs_release_budget(c, &req);
287 insert_inode_hash(inode);
288 d_instantiate(dentry, inode);
289 return 0;
290
291 out_cancel:
292 dir->i_size -= sz_change;
293 dir_ui->ui_size = dir->i_size;
294 mutex_unlock(&dir_ui->ui_mutex);
295 make_bad_inode(inode);
296 iput(inode);
297 out_budg:
298 ubifs_release_budget(c, &req);
299 ubifs_err("cannot create regular file, error %d", err);
300 return err;
301 }
302
303 /**
304 * vfs_dent_type - get VFS directory entry type.
305 * @type: UBIFS directory entry type
306 *
307 * This function converts UBIFS directory entry type into VFS directory entry
308 * type.
309 */
310 static unsigned int vfs_dent_type(uint8_t type)
311 {
312 switch (type) {
313 case UBIFS_ITYPE_REG:
314 return DT_REG;
315 case UBIFS_ITYPE_DIR:
316 return DT_DIR;
317 case UBIFS_ITYPE_LNK:
318 return DT_LNK;
319 case UBIFS_ITYPE_BLK:
320 return DT_BLK;
321 case UBIFS_ITYPE_CHR:
322 return DT_CHR;
323 case UBIFS_ITYPE_FIFO:
324 return DT_FIFO;
325 case UBIFS_ITYPE_SOCK:
326 return DT_SOCK;
327 default:
328 BUG();
329 }
330 return 0;
331 }
332
333 /*
334 * The classical Unix view for directory is that it is a linear array of
335 * (name, inode number) entries. Linux/VFS assumes this model as well.
336 * Particularly, 'readdir()' call wants us to return a directory entry offset
337 * which later may be used to continue 'readdir()'ing the directory or to
338 * 'seek()' to that specific direntry. Obviously UBIFS does not really fit this
339 * model because directory entries are identified by keys, which may collide.
340 *
341 * UBIFS uses directory entry hash value for directory offsets, so
342 * 'seekdir()'/'telldir()' may not always work because of possible key
343 * collisions. But UBIFS guarantees that consecutive 'readdir()' calls work
344 * properly by means of saving full directory entry name in the private field
345 * of the file description object.
346 *
347 * This means that UBIFS cannot support NFS which requires full
348 * 'seekdir()'/'telldir()' support.
349 */
350 static int ubifs_readdir(struct file *file, struct dir_context *ctx)
351 {
352 int err;
353 struct qstr nm;
354 union ubifs_key key;
355 struct ubifs_dent_node *dent;
356 struct inode *dir = file_inode(file);
357 struct ubifs_info *c = dir->i_sb->s_fs_info;
358
359 dbg_gen("dir ino %lu, f_pos %#llx", dir->i_ino, ctx->pos);
360
361 if (ctx->pos > UBIFS_S_KEY_HASH_MASK || ctx->pos == 2)
362 /*
363 * The directory was seek'ed to a senseless position or there
364 * are no more entries.
365 */
366 return 0;
367
368 if (file->f_version == 0) {
369 /*
370 * The file was seek'ed, which means that @file->private_data
371 * is now invalid. This may also be just the first
372 * 'ubifs_readdir()' invocation, in which case
373 * @file->private_data is NULL, and the below code is
374 * basically a no-op.
375 */
376 kfree(file->private_data);
377 file->private_data = NULL;
378 }
379
380 /*
381 * 'generic_file_llseek()' unconditionally sets @file->f_version to
382 * zero, and we use this for detecting whether the file was seek'ed.
383 */
384 file->f_version = 1;
385
386 /* File positions 0 and 1 correspond to "." and ".." */
387 if (ctx->pos < 2) {
388 ubifs_assert(!file->private_data);
389 if (!dir_emit_dots(file, ctx))
390 return 0;
391
392 /* Find the first entry in TNC and save it */
393 lowest_dent_key(c, &key, dir->i_ino);
394 nm.name = NULL;
395 dent = ubifs_tnc_next_ent(c, &key, &nm);
396 if (IS_ERR(dent)) {
397 err = PTR_ERR(dent);
398 goto out;
399 }
400
401 ctx->pos = key_hash_flash(c, &dent->key);
402 file->private_data = dent;
403 }
404
405 dent = file->private_data;
406 if (!dent) {
407 /*
408 * The directory was seek'ed to and is now readdir'ed.
409 * Find the entry corresponding to @ctx->pos or the closest one.
410 */
411 dent_key_init_hash(c, &key, dir->i_ino, ctx->pos);
412 nm.name = NULL;
413 dent = ubifs_tnc_next_ent(c, &key, &nm);
414 if (IS_ERR(dent)) {
415 err = PTR_ERR(dent);
416 goto out;
417 }
418 ctx->pos = key_hash_flash(c, &dent->key);
419 file->private_data = dent;
420 }
421
422 while (1) {
423 dbg_gen("feed '%s', ino %llu, new f_pos %#x",
424 dent->name, (unsigned long long)le64_to_cpu(dent->inum),
425 key_hash_flash(c, &dent->key));
426 ubifs_assert(le64_to_cpu(dent->ch.sqnum) >
427 ubifs_inode(dir)->creat_sqnum);
428
429 nm.len = le16_to_cpu(dent->nlen);
430 if (!dir_emit(ctx, dent->name, nm.len,
431 le64_to_cpu(dent->inum),
432 vfs_dent_type(dent->type)))
433 return 0;
434
435 /* Switch to the next entry */
436 key_read(c, &dent->key, &key);
437 nm.name = dent->name;
438 dent = ubifs_tnc_next_ent(c, &key, &nm);
439 if (IS_ERR(dent)) {
440 err = PTR_ERR(dent);
441 goto out;
442 }
443
444 kfree(file->private_data);
445 ctx->pos = key_hash_flash(c, &dent->key);
446 file->private_data = dent;
447 cond_resched();
448 }
449
450 out:
451 if (err != -ENOENT) {
452 ubifs_err("cannot find next direntry, error %d", err);
453 return err;
454 }
455
456 kfree(file->private_data);
457 file->private_data = NULL;
458 /* 2 is a special value indicating that there are no more direntries */
459 ctx->pos = 2;
460 return 0;
461 }
462
463 /* Free saved readdir() state when the directory is closed */
464 static int ubifs_dir_release(struct inode *dir, struct file *file)
465 {
466 kfree(file->private_data);
467 file->private_data = NULL;
468 return 0;
469 }
470
471 /**
472 * lock_2_inodes - a wrapper for locking two UBIFS inodes.
473 * @inode1: first inode
474 * @inode2: second inode
475 *
476 * We do not implement any tricks to guarantee strict lock ordering, because
477 * VFS has already done it for us on the @i_mutex. So this is just a simple
478 * wrapper function.
479 */
480 static void lock_2_inodes(struct inode *inode1, struct inode *inode2)
481 {
482 mutex_lock_nested(&ubifs_inode(inode1)->ui_mutex, WB_MUTEX_1);
483 mutex_lock_nested(&ubifs_inode(inode2)->ui_mutex, WB_MUTEX_2);
484 }
485
486 /**
487 * unlock_2_inodes - a wrapper for unlocking two UBIFS inodes.
488 * @inode1: first inode
489 * @inode2: second inode
490 */
491 static void unlock_2_inodes(struct inode *inode1, struct inode *inode2)
492 {
493 mutex_unlock(&ubifs_inode(inode2)->ui_mutex);
494 mutex_unlock(&ubifs_inode(inode1)->ui_mutex);
495 }
496
497 static int ubifs_link(struct dentry *old_dentry, struct inode *dir,
498 struct dentry *dentry)
499 {
500 struct ubifs_info *c = dir->i_sb->s_fs_info;
501 struct inode *inode = old_dentry->d_inode;
502 struct ubifs_inode *ui = ubifs_inode(inode);
503 struct ubifs_inode *dir_ui = ubifs_inode(dir);
504 int err, sz_change = CALC_DENT_SIZE(dentry->d_name.len);
505 struct ubifs_budget_req req = { .new_dent = 1, .dirtied_ino = 2,
506 .dirtied_ino_d = ALIGN(ui->data_len, 8) };
507
508 /*
509 * Budget request settings: new direntry, changing the target inode,
510 * changing the parent inode.
511 */
512
513 dbg_gen("dent '%pd' to ino %lu (nlink %d) in dir ino %lu",
514 dentry, inode->i_ino,
515 inode->i_nlink, dir->i_ino);
516 ubifs_assert(mutex_is_locked(&dir->i_mutex));
517 ubifs_assert(mutex_is_locked(&inode->i_mutex));
518
519 err = dbg_check_synced_i_size(c, inode);
520 if (err)
521 return err;
522
523 err = ubifs_budget_space(c, &req);
524 if (err)
525 return err;
526
527 lock_2_inodes(dir, inode);
528 inc_nlink(inode);
529 ihold(inode);
530 inode->i_ctime = ubifs_current_time(inode);
531 dir->i_size += sz_change;
532 dir_ui->ui_size = dir->i_size;
533 dir->i_mtime = dir->i_ctime = inode->i_ctime;
534 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 0, 0);
535 if (err)
536 goto out_cancel;
537 unlock_2_inodes(dir, inode);
538
539 ubifs_release_budget(c, &req);
540 d_instantiate(dentry, inode);
541 return 0;
542
543 out_cancel:
544 dir->i_size -= sz_change;
545 dir_ui->ui_size = dir->i_size;
546 drop_nlink(inode);
547 unlock_2_inodes(dir, inode);
548 ubifs_release_budget(c, &req);
549 iput(inode);
550 return err;
551 }
552
553 static int ubifs_unlink(struct inode *dir, struct dentry *dentry)
554 {
555 struct ubifs_info *c = dir->i_sb->s_fs_info;
556 struct inode *inode = dentry->d_inode;
557 struct ubifs_inode *dir_ui = ubifs_inode(dir);
558 int sz_change = CALC_DENT_SIZE(dentry->d_name.len);
559 int err, budgeted = 1;
560 struct ubifs_budget_req req = { .mod_dent = 1, .dirtied_ino = 2 };
561 unsigned int saved_nlink = inode->i_nlink;
562
563 /*
564 * Budget request settings: deletion direntry, deletion inode (+1 for
565 * @dirtied_ino), changing the parent directory inode. If budgeting
566 * fails, go ahead anyway because we have extra space reserved for
567 * deletions.
568 */
569
570 dbg_gen("dent '%pd' from ino %lu (nlink %d) in dir ino %lu",
571 dentry, inode->i_ino,
572 inode->i_nlink, dir->i_ino);
573 ubifs_assert(mutex_is_locked(&dir->i_mutex));
574 ubifs_assert(mutex_is_locked(&inode->i_mutex));
575 err = dbg_check_synced_i_size(c, inode);
576 if (err)
577 return err;
578
579 err = ubifs_budget_space(c, &req);
580 if (err) {
581 if (err != -ENOSPC)
582 return err;
583 budgeted = 0;
584 }
585
586 lock_2_inodes(dir, inode);
587 inode->i_ctime = ubifs_current_time(dir);
588 drop_nlink(inode);
589 dir->i_size -= sz_change;
590 dir_ui->ui_size = dir->i_size;
591 dir->i_mtime = dir->i_ctime = inode->i_ctime;
592 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 1, 0);
593 if (err)
594 goto out_cancel;
595 unlock_2_inodes(dir, inode);
596
597 if (budgeted)
598 ubifs_release_budget(c, &req);
599 else {
600 /* We've deleted something - clean the "no space" flags */
601 c->bi.nospace = c->bi.nospace_rp = 0;
602 smp_wmb();
603 }
604 return 0;
605
606 out_cancel:
607 dir->i_size += sz_change;
608 dir_ui->ui_size = dir->i_size;
609 set_nlink(inode, saved_nlink);
610 unlock_2_inodes(dir, inode);
611 if (budgeted)
612 ubifs_release_budget(c, &req);
613 return err;
614 }
615
616 /**
617 * check_dir_empty - check if a directory is empty or not.
618 * @c: UBIFS file-system description object
619 * @dir: VFS inode object of the directory to check
620 *
621 * This function checks if directory @dir is empty. Returns zero if the
622 * directory is empty, %-ENOTEMPTY if it is not, and other negative error codes
623 * in case of of errors.
624 */
625 static int check_dir_empty(struct ubifs_info *c, struct inode *dir)
626 {
627 struct qstr nm = { .name = NULL };
628 struct ubifs_dent_node *dent;
629 union ubifs_key key;
630 int err;
631
632 lowest_dent_key(c, &key, dir->i_ino);
633 dent = ubifs_tnc_next_ent(c, &key, &nm);
634 if (IS_ERR(dent)) {
635 err = PTR_ERR(dent);
636 if (err == -ENOENT)
637 err = 0;
638 } else {
639 kfree(dent);
640 err = -ENOTEMPTY;
641 }
642 return err;
643 }
644
645 static int ubifs_rmdir(struct inode *dir, struct dentry *dentry)
646 {
647 struct ubifs_info *c = dir->i_sb->s_fs_info;
648 struct inode *inode = dentry->d_inode;
649 int sz_change = CALC_DENT_SIZE(dentry->d_name.len);
650 int err, budgeted = 1;
651 struct ubifs_inode *dir_ui = ubifs_inode(dir);
652 struct ubifs_budget_req req = { .mod_dent = 1, .dirtied_ino = 2 };
653
654 /*
655 * Budget request settings: deletion direntry, deletion inode and
656 * changing the parent inode. If budgeting fails, go ahead anyway
657 * because we have extra space reserved for deletions.
658 */
659
660 dbg_gen("directory '%pd', ino %lu in dir ino %lu", dentry,
661 inode->i_ino, dir->i_ino);
662 ubifs_assert(mutex_is_locked(&dir->i_mutex));
663 ubifs_assert(mutex_is_locked(&inode->i_mutex));
664 err = check_dir_empty(c, dentry->d_inode);
665 if (err)
666 return err;
667
668 err = ubifs_budget_space(c, &req);
669 if (err) {
670 if (err != -ENOSPC)
671 return err;
672 budgeted = 0;
673 }
674
675 lock_2_inodes(dir, inode);
676 inode->i_ctime = ubifs_current_time(dir);
677 clear_nlink(inode);
678 drop_nlink(dir);
679 dir->i_size -= sz_change;
680 dir_ui->ui_size = dir->i_size;
681 dir->i_mtime = dir->i_ctime = inode->i_ctime;
682 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 1, 0);
683 if (err)
684 goto out_cancel;
685 unlock_2_inodes(dir, inode);
686
687 if (budgeted)
688 ubifs_release_budget(c, &req);
689 else {
690 /* We've deleted something - clean the "no space" flags */
691 c->bi.nospace = c->bi.nospace_rp = 0;
692 smp_wmb();
693 }
694 return 0;
695
696 out_cancel:
697 dir->i_size += sz_change;
698 dir_ui->ui_size = dir->i_size;
699 inc_nlink(dir);
700 set_nlink(inode, 2);
701 unlock_2_inodes(dir, inode);
702 if (budgeted)
703 ubifs_release_budget(c, &req);
704 return err;
705 }
706
707 static int ubifs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
708 {
709 struct inode *inode;
710 struct ubifs_inode *dir_ui = ubifs_inode(dir);
711 struct ubifs_info *c = dir->i_sb->s_fs_info;
712 int err, sz_change = CALC_DENT_SIZE(dentry->d_name.len);
713 struct ubifs_budget_req req = { .new_ino = 1, .new_dent = 1 };
714
715 /*
716 * Budget request settings: new inode, new direntry and changing parent
717 * directory inode.
718 */
719
720 dbg_gen("dent '%pd', mode %#hx in dir ino %lu",
721 dentry, mode, dir->i_ino);
722
723 err = ubifs_budget_space(c, &req);
724 if (err)
725 return err;
726
727 inode = ubifs_new_inode(c, dir, S_IFDIR | mode);
728 if (IS_ERR(inode)) {
729 err = PTR_ERR(inode);
730 goto out_budg;
731 }
732
733 err = ubifs_init_security(dir, inode, &dentry->d_name);
734 if (err)
735 goto out_cancel;
736
737 mutex_lock(&dir_ui->ui_mutex);
738 insert_inode_hash(inode);
739 inc_nlink(inode);
740 inc_nlink(dir);
741 dir->i_size += sz_change;
742 dir_ui->ui_size = dir->i_size;
743 dir->i_mtime = dir->i_ctime = inode->i_ctime;
744 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 0, 0);
745 if (err) {
746 ubifs_err("cannot create directory, error %d", err);
747 goto out_cancel;
748 }
749 mutex_unlock(&dir_ui->ui_mutex);
750
751 ubifs_release_budget(c, &req);
752 d_instantiate(dentry, inode);
753 return 0;
754
755 out_cancel:
756 dir->i_size -= sz_change;
757 dir_ui->ui_size = dir->i_size;
758 drop_nlink(dir);
759 mutex_unlock(&dir_ui->ui_mutex);
760 make_bad_inode(inode);
761 iput(inode);
762 out_budg:
763 ubifs_release_budget(c, &req);
764 return err;
765 }
766
767 static int ubifs_mknod(struct inode *dir, struct dentry *dentry,
768 umode_t mode, dev_t rdev)
769 {
770 struct inode *inode;
771 struct ubifs_inode *ui;
772 struct ubifs_inode *dir_ui = ubifs_inode(dir);
773 struct ubifs_info *c = dir->i_sb->s_fs_info;
774 union ubifs_dev_desc *dev = NULL;
775 int sz_change = CALC_DENT_SIZE(dentry->d_name.len);
776 int err, devlen = 0;
777 struct ubifs_budget_req req = { .new_ino = 1, .new_dent = 1,
778 .new_ino_d = ALIGN(devlen, 8),
779 .dirtied_ino = 1 };
780
781 /*
782 * Budget request settings: new inode, new direntry and changing parent
783 * directory inode.
784 */
785
786 dbg_gen("dent '%pd' in dir ino %lu", dentry, dir->i_ino);
787
788 if (!new_valid_dev(rdev))
789 return -EINVAL;
790
791 if (S_ISBLK(mode) || S_ISCHR(mode)) {
792 dev = kmalloc(sizeof(union ubifs_dev_desc), GFP_NOFS);
793 if (!dev)
794 return -ENOMEM;
795 devlen = ubifs_encode_dev(dev, rdev);
796 }
797
798 err = ubifs_budget_space(c, &req);
799 if (err) {
800 kfree(dev);
801 return err;
802 }
803
804 inode = ubifs_new_inode(c, dir, mode);
805 if (IS_ERR(inode)) {
806 kfree(dev);
807 err = PTR_ERR(inode);
808 goto out_budg;
809 }
810
811 init_special_inode(inode, inode->i_mode, rdev);
812 inode->i_size = ubifs_inode(inode)->ui_size = devlen;
813 ui = ubifs_inode(inode);
814 ui->data = dev;
815 ui->data_len = devlen;
816
817 err = ubifs_init_security(dir, inode, &dentry->d_name);
818 if (err)
819 goto out_cancel;
820
821 mutex_lock(&dir_ui->ui_mutex);
822 dir->i_size += sz_change;
823 dir_ui->ui_size = dir->i_size;
824 dir->i_mtime = dir->i_ctime = inode->i_ctime;
825 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 0, 0);
826 if (err)
827 goto out_cancel;
828 mutex_unlock(&dir_ui->ui_mutex);
829
830 ubifs_release_budget(c, &req);
831 insert_inode_hash(inode);
832 d_instantiate(dentry, inode);
833 return 0;
834
835 out_cancel:
836 dir->i_size -= sz_change;
837 dir_ui->ui_size = dir->i_size;
838 mutex_unlock(&dir_ui->ui_mutex);
839 make_bad_inode(inode);
840 iput(inode);
841 out_budg:
842 ubifs_release_budget(c, &req);
843 return err;
844 }
845
846 static int ubifs_symlink(struct inode *dir, struct dentry *dentry,
847 const char *symname)
848 {
849 struct inode *inode;
850 struct ubifs_inode *ui;
851 struct ubifs_inode *dir_ui = ubifs_inode(dir);
852 struct ubifs_info *c = dir->i_sb->s_fs_info;
853 int err, len = strlen(symname);
854 int sz_change = CALC_DENT_SIZE(dentry->d_name.len);
855 struct ubifs_budget_req req = { .new_ino = 1, .new_dent = 1,
856 .new_ino_d = ALIGN(len, 8),
857 .dirtied_ino = 1 };
858
859 /*
860 * Budget request settings: new inode, new direntry and changing parent
861 * directory inode.
862 */
863
864 dbg_gen("dent '%pd', target '%s' in dir ino %lu", dentry,
865 symname, dir->i_ino);
866
867 if (len > UBIFS_MAX_INO_DATA)
868 return -ENAMETOOLONG;
869
870 err = ubifs_budget_space(c, &req);
871 if (err)
872 return err;
873
874 inode = ubifs_new_inode(c, dir, S_IFLNK | S_IRWXUGO);
875 if (IS_ERR(inode)) {
876 err = PTR_ERR(inode);
877 goto out_budg;
878 }
879
880 ui = ubifs_inode(inode);
881 ui->data = kmalloc(len + 1, GFP_NOFS);
882 if (!ui->data) {
883 err = -ENOMEM;
884 goto out_inode;
885 }
886
887 memcpy(ui->data, symname, len);
888 ((char *)ui->data)[len] = '\0';
889 /*
890 * The terminating zero byte is not written to the flash media and it
891 * is put just to make later in-memory string processing simpler. Thus,
892 * data length is @len, not @len + %1.
893 */
894 ui->data_len = len;
895 inode->i_size = ubifs_inode(inode)->ui_size = len;
896
897 err = ubifs_init_security(dir, inode, &dentry->d_name);
898 if (err)
899 goto out_cancel;
900
901 mutex_lock(&dir_ui->ui_mutex);
902 dir->i_size += sz_change;
903 dir_ui->ui_size = dir->i_size;
904 dir->i_mtime = dir->i_ctime = inode->i_ctime;
905 err = ubifs_jnl_update(c, dir, &dentry->d_name, inode, 0, 0);
906 if (err)
907 goto out_cancel;
908 mutex_unlock(&dir_ui->ui_mutex);
909
910 ubifs_release_budget(c, &req);
911 insert_inode_hash(inode);
912 d_instantiate(dentry, inode);
913 return 0;
914
915 out_cancel:
916 dir->i_size -= sz_change;
917 dir_ui->ui_size = dir->i_size;
918 mutex_unlock(&dir_ui->ui_mutex);
919 out_inode:
920 make_bad_inode(inode);
921 iput(inode);
922 out_budg:
923 ubifs_release_budget(c, &req);
924 return err;
925 }
926
927 /**
928 * lock_3_inodes - a wrapper for locking three UBIFS inodes.
929 * @inode1: first inode
930 * @inode2: second inode
931 * @inode3: third inode
932 *
933 * This function is used for 'ubifs_rename()' and @inode1 may be the same as
934 * @inode2 whereas @inode3 may be %NULL.
935 *
936 * We do not implement any tricks to guarantee strict lock ordering, because
937 * VFS has already done it for us on the @i_mutex. So this is just a simple
938 * wrapper function.
939 */
940 static void lock_3_inodes(struct inode *inode1, struct inode *inode2,
941 struct inode *inode3)
942 {
943 mutex_lock_nested(&ubifs_inode(inode1)->ui_mutex, WB_MUTEX_1);
944 if (inode2 != inode1)
945 mutex_lock_nested(&ubifs_inode(inode2)->ui_mutex, WB_MUTEX_2);
946 if (inode3)
947 mutex_lock_nested(&ubifs_inode(inode3)->ui_mutex, WB_MUTEX_3);
948 }
949
950 /**
951 * unlock_3_inodes - a wrapper for unlocking three UBIFS inodes for rename.
952 * @inode1: first inode
953 * @inode2: second inode
954 * @inode3: third inode
955 */
956 static void unlock_3_inodes(struct inode *inode1, struct inode *inode2,
957 struct inode *inode3)
958 {
959 if (inode3)
960 mutex_unlock(&ubifs_inode(inode3)->ui_mutex);
961 if (inode1 != inode2)
962 mutex_unlock(&ubifs_inode(inode2)->ui_mutex);
963 mutex_unlock(&ubifs_inode(inode1)->ui_mutex);
964 }
965
966 static int ubifs_rename(struct inode *old_dir, struct dentry *old_dentry,
967 struct inode *new_dir, struct dentry *new_dentry)
968 {
969 struct ubifs_info *c = old_dir->i_sb->s_fs_info;
970 struct inode *old_inode = old_dentry->d_inode;
971 struct inode *new_inode = new_dentry->d_inode;
972 struct ubifs_inode *old_inode_ui = ubifs_inode(old_inode);
973 int err, release, sync = 0, move = (new_dir != old_dir);
974 int is_dir = S_ISDIR(old_inode->i_mode);
975 int unlink = !!new_inode;
976 int new_sz = CALC_DENT_SIZE(new_dentry->d_name.len);
977 int old_sz = CALC_DENT_SIZE(old_dentry->d_name.len);
978 struct ubifs_budget_req req = { .new_dent = 1, .mod_dent = 1,
979 .dirtied_ino = 3 };
980 struct ubifs_budget_req ino_req = { .dirtied_ino = 1,
981 .dirtied_ino_d = ALIGN(old_inode_ui->data_len, 8) };
982 struct timespec time;
983 unsigned int uninitialized_var(saved_nlink);
984
985 /*
986 * Budget request settings: deletion direntry, new direntry, removing
987 * the old inode, and changing old and new parent directory inodes.
988 *
989 * However, this operation also marks the target inode as dirty and
990 * does not write it, so we allocate budget for the target inode
991 * separately.
992 */
993
994 dbg_gen("dent '%pd' ino %lu in dir ino %lu to dent '%pd' in dir ino %lu",
995 old_dentry, old_inode->i_ino, old_dir->i_ino,
996 new_dentry, new_dir->i_ino);
997 ubifs_assert(mutex_is_locked(&old_dir->i_mutex));
998 ubifs_assert(mutex_is_locked(&new_dir->i_mutex));
999 if (unlink)
1000 ubifs_assert(mutex_is_locked(&new_inode->i_mutex));
1001
1002
1003 if (unlink && is_dir) {
1004 err = check_dir_empty(c, new_inode);
1005 if (err)
1006 return err;
1007 }
1008
1009 err = ubifs_budget_space(c, &req);
1010 if (err)
1011 return err;
1012 err = ubifs_budget_space(c, &ino_req);
1013 if (err) {
1014 ubifs_release_budget(c, &req);
1015 return err;
1016 }
1017
1018 lock_3_inodes(old_dir, new_dir, new_inode);
1019
1020 /*
1021 * Like most other Unix systems, set the @i_ctime for inodes on a
1022 * rename.
1023 */
1024 time = ubifs_current_time(old_dir);
1025 old_inode->i_ctime = time;
1026
1027 /* We must adjust parent link count when renaming directories */
1028 if (is_dir) {
1029 if (move) {
1030 /*
1031 * @old_dir loses a link because we are moving
1032 * @old_inode to a different directory.
1033 */
1034 drop_nlink(old_dir);
1035 /*
1036 * @new_dir only gains a link if we are not also
1037 * overwriting an existing directory.
1038 */
1039 if (!unlink)
1040 inc_nlink(new_dir);
1041 } else {
1042 /*
1043 * @old_inode is not moving to a different directory,
1044 * but @old_dir still loses a link if we are
1045 * overwriting an existing directory.
1046 */
1047 if (unlink)
1048 drop_nlink(old_dir);
1049 }
1050 }
1051
1052 old_dir->i_size -= old_sz;
1053 ubifs_inode(old_dir)->ui_size = old_dir->i_size;
1054 old_dir->i_mtime = old_dir->i_ctime = time;
1055 new_dir->i_mtime = new_dir->i_ctime = time;
1056
1057 /*
1058 * And finally, if we unlinked a direntry which happened to have the
1059 * same name as the moved direntry, we have to decrement @i_nlink of
1060 * the unlinked inode and change its ctime.
1061 */
1062 if (unlink) {
1063 /*
1064 * Directories cannot have hard-links, so if this is a
1065 * directory, just clear @i_nlink.
1066 */
1067 saved_nlink = new_inode->i_nlink;
1068 if (is_dir)
1069 clear_nlink(new_inode);
1070 else
1071 drop_nlink(new_inode);
1072 new_inode->i_ctime = time;
1073 } else {
1074 new_dir->i_size += new_sz;
1075 ubifs_inode(new_dir)->ui_size = new_dir->i_size;
1076 }
1077
1078 /*
1079 * Do not ask 'ubifs_jnl_rename()' to flush write-buffer if @old_inode
1080 * is dirty, because this will be done later on at the end of
1081 * 'ubifs_rename()'.
1082 */
1083 if (IS_SYNC(old_inode)) {
1084 sync = IS_DIRSYNC(old_dir) || IS_DIRSYNC(new_dir);
1085 if (unlink && IS_SYNC(new_inode))
1086 sync = 1;
1087 }
1088 err = ubifs_jnl_rename(c, old_dir, old_dentry, new_dir, new_dentry,
1089 sync);
1090 if (err)
1091 goto out_cancel;
1092
1093 unlock_3_inodes(old_dir, new_dir, new_inode);
1094 ubifs_release_budget(c, &req);
1095
1096 mutex_lock(&old_inode_ui->ui_mutex);
1097 release = old_inode_ui->dirty;
1098 mark_inode_dirty_sync(old_inode);
1099 mutex_unlock(&old_inode_ui->ui_mutex);
1100
1101 if (release)
1102 ubifs_release_budget(c, &ino_req);
1103 if (IS_SYNC(old_inode))
1104 err = old_inode->i_sb->s_op->write_inode(old_inode, NULL);
1105 return err;
1106
1107 out_cancel:
1108 if (unlink) {
1109 set_nlink(new_inode, saved_nlink);
1110 } else {
1111 new_dir->i_size -= new_sz;
1112 ubifs_inode(new_dir)->ui_size = new_dir->i_size;
1113 }
1114 old_dir->i_size += old_sz;
1115 ubifs_inode(old_dir)->ui_size = old_dir->i_size;
1116 if (is_dir) {
1117 if (move) {
1118 inc_nlink(old_dir);
1119 if (!unlink)
1120 drop_nlink(new_dir);
1121 } else {
1122 if (unlink)
1123 inc_nlink(old_dir);
1124 }
1125 }
1126 unlock_3_inodes(old_dir, new_dir, new_inode);
1127 ubifs_release_budget(c, &ino_req);
1128 ubifs_release_budget(c, &req);
1129 return err;
1130 }
1131
1132 int ubifs_getattr(struct vfsmount *mnt, struct dentry *dentry,
1133 struct kstat *stat)
1134 {
1135 loff_t size;
1136 struct inode *inode = dentry->d_inode;
1137 struct ubifs_inode *ui = ubifs_inode(inode);
1138
1139 mutex_lock(&ui->ui_mutex);
1140 generic_fillattr(inode, stat);
1141 stat->blksize = UBIFS_BLOCK_SIZE;
1142 stat->size = ui->ui_size;
1143
1144 /*
1145 * Unfortunately, the 'stat()' system call was designed for block
1146 * device based file systems, and it is not appropriate for UBIFS,
1147 * because UBIFS does not have notion of "block". For example, it is
1148 * difficult to tell how many block a directory takes - it actually
1149 * takes less than 300 bytes, but we have to round it to block size,
1150 * which introduces large mistake. This makes utilities like 'du' to
1151 * report completely senseless numbers. This is the reason why UBIFS
1152 * goes the same way as JFFS2 - it reports zero blocks for everything
1153 * but regular files, which makes more sense than reporting completely
1154 * wrong sizes.
1155 */
1156 if (S_ISREG(inode->i_mode)) {
1157 size = ui->xattr_size;
1158 size += stat->size;
1159 size = ALIGN(size, UBIFS_BLOCK_SIZE);
1160 /*
1161 * Note, user-space expects 512-byte blocks count irrespectively
1162 * of what was reported in @stat->size.
1163 */
1164 stat->blocks = size >> 9;
1165 } else
1166 stat->blocks = 0;
1167 mutex_unlock(&ui->ui_mutex);
1168 return 0;
1169 }
1170
1171 const struct inode_operations ubifs_dir_inode_operations = {
1172 .lookup = ubifs_lookup,
1173 .create = ubifs_create,
1174 .link = ubifs_link,
1175 .symlink = ubifs_symlink,
1176 .unlink = ubifs_unlink,
1177 .mkdir = ubifs_mkdir,
1178 .rmdir = ubifs_rmdir,
1179 .mknod = ubifs_mknod,
1180 .rename = ubifs_rename,
1181 .setattr = ubifs_setattr,
1182 .getattr = ubifs_getattr,
1183 .setxattr = ubifs_setxattr,
1184 .getxattr = ubifs_getxattr,
1185 .listxattr = ubifs_listxattr,
1186 .removexattr = ubifs_removexattr,
1187 };
1188
1189 const struct file_operations ubifs_dir_operations = {
1190 .llseek = generic_file_llseek,
1191 .release = ubifs_dir_release,
1192 .read = generic_read_dir,
1193 .iterate = ubifs_readdir,
1194 .fsync = ubifs_fsync,
1195 .unlocked_ioctl = ubifs_ioctl,
1196 #ifdef CONFIG_COMPAT
1197 .compat_ioctl = ubifs_compat_ioctl,
1198 #endif
1199 };
This page took 0.056072 seconds and 5 git commands to generate.