dir.c 32 KB

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