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