dir.c 32 KB

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