dir.c 32 KB

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