super.c 57 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191
  1. /*
  2. * This file is part of UBIFS.
  3. *
  4. * Copyright (C) 2006-2008 Nokia Corporation.
  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. */
  22. /*
  23. * This file implements UBIFS initialization and VFS superblock operations. Some
  24. * initialization stuff which is rather large and complex is placed at
  25. * corresponding subsystems, but most of it is here.
  26. */
  27. #include <linux/init.h>
  28. #include <linux/slab.h>
  29. #include <linux/module.h>
  30. #include <linux/ctype.h>
  31. #include <linux/kthread.h>
  32. #include <linux/parser.h>
  33. #include <linux/seq_file.h>
  34. #include <linux/mount.h>
  35. #include <linux/math64.h>
  36. #include <linux/writeback.h>
  37. #include "ubifs.h"
  38. /*
  39. * Maximum amount of memory we may 'kmalloc()' without worrying that we are
  40. * allocating too much.
  41. */
  42. #define UBIFS_KMALLOC_OK (128*1024)
  43. /* Slab cache for UBIFS inodes */
  44. struct kmem_cache *ubifs_inode_slab;
  45. /* UBIFS TNC shrinker description */
  46. static struct shrinker ubifs_shrinker_info = {
  47. .shrink = ubifs_shrinker,
  48. .seeks = DEFAULT_SEEKS,
  49. };
  50. /**
  51. * validate_inode - validate inode.
  52. * @c: UBIFS file-system description object
  53. * @inode: the inode to validate
  54. *
  55. * This is a helper function for 'ubifs_iget()' which validates various fields
  56. * of a newly built inode to make sure they contain sane values and prevent
  57. * possible vulnerabilities. Returns zero if the inode is all right and
  58. * a non-zero error code if not.
  59. */
  60. static int validate_inode(struct ubifs_info *c, const struct inode *inode)
  61. {
  62. int err;
  63. const struct ubifs_inode *ui = ubifs_inode(inode);
  64. if (inode->i_size > c->max_inode_sz) {
  65. ubifs_err("inode is too large (%lld)",
  66. (long long)inode->i_size);
  67. return 1;
  68. }
  69. if (ui->compr_type < 0 || ui->compr_type >= UBIFS_COMPR_TYPES_CNT) {
  70. ubifs_err("unknown compression type %d", ui->compr_type);
  71. return 2;
  72. }
  73. if (ui->xattr_names + ui->xattr_cnt > XATTR_LIST_MAX)
  74. return 3;
  75. if (ui->data_len < 0 || ui->data_len > UBIFS_MAX_INO_DATA)
  76. return 4;
  77. if (ui->xattr && (inode->i_mode & S_IFMT) != S_IFREG)
  78. return 5;
  79. if (!ubifs_compr_present(ui->compr_type)) {
  80. ubifs_warn("inode %lu uses '%s' compression, but it was not "
  81. "compiled in", inode->i_ino,
  82. ubifs_compr_name(ui->compr_type));
  83. }
  84. err = dbg_check_dir_size(c, inode);
  85. return err;
  86. }
  87. struct inode *ubifs_iget(struct super_block *sb, unsigned long inum)
  88. {
  89. int err;
  90. union ubifs_key key;
  91. struct ubifs_ino_node *ino;
  92. struct ubifs_info *c = sb->s_fs_info;
  93. struct inode *inode;
  94. struct ubifs_inode *ui;
  95. dbg_gen("inode %lu", inum);
  96. inode = iget_locked(sb, inum);
  97. if (!inode)
  98. return ERR_PTR(-ENOMEM);
  99. if (!(inode->i_state & I_NEW))
  100. return inode;
  101. ui = ubifs_inode(inode);
  102. ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
  103. if (!ino) {
  104. err = -ENOMEM;
  105. goto out;
  106. }
  107. ino_key_init(c, &key, inode->i_ino);
  108. err = ubifs_tnc_lookup(c, &key, ino);
  109. if (err)
  110. goto out_ino;
  111. inode->i_flags |= (S_NOCMTIME | S_NOATIME);
  112. inode->i_nlink = le32_to_cpu(ino->nlink);
  113. inode->i_uid = le32_to_cpu(ino->uid);
  114. inode->i_gid = le32_to_cpu(ino->gid);
  115. inode->i_atime.tv_sec = (int64_t)le64_to_cpu(ino->atime_sec);
  116. inode->i_atime.tv_nsec = le32_to_cpu(ino->atime_nsec);
  117. inode->i_mtime.tv_sec = (int64_t)le64_to_cpu(ino->mtime_sec);
  118. inode->i_mtime.tv_nsec = le32_to_cpu(ino->mtime_nsec);
  119. inode->i_ctime.tv_sec = (int64_t)le64_to_cpu(ino->ctime_sec);
  120. inode->i_ctime.tv_nsec = le32_to_cpu(ino->ctime_nsec);
  121. inode->i_mode = le32_to_cpu(ino->mode);
  122. inode->i_size = le64_to_cpu(ino->size);
  123. ui->data_len = le32_to_cpu(ino->data_len);
  124. ui->flags = le32_to_cpu(ino->flags);
  125. ui->compr_type = le16_to_cpu(ino->compr_type);
  126. ui->creat_sqnum = le64_to_cpu(ino->creat_sqnum);
  127. ui->xattr_cnt = le32_to_cpu(ino->xattr_cnt);
  128. ui->xattr_size = le32_to_cpu(ino->xattr_size);
  129. ui->xattr_names = le32_to_cpu(ino->xattr_names);
  130. ui->synced_i_size = ui->ui_size = inode->i_size;
  131. ui->xattr = (ui->flags & UBIFS_XATTR_FL) ? 1 : 0;
  132. err = validate_inode(c, inode);
  133. if (err)
  134. goto out_invalid;
  135. /* Disable read-ahead */
  136. inode->i_mapping->backing_dev_info = &c->bdi;
  137. switch (inode->i_mode & S_IFMT) {
  138. case S_IFREG:
  139. inode->i_mapping->a_ops = &ubifs_file_address_operations;
  140. inode->i_op = &ubifs_file_inode_operations;
  141. inode->i_fop = &ubifs_file_operations;
  142. if (ui->xattr) {
  143. ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
  144. if (!ui->data) {
  145. err = -ENOMEM;
  146. goto out_ino;
  147. }
  148. memcpy(ui->data, ino->data, ui->data_len);
  149. ((char *)ui->data)[ui->data_len] = '\0';
  150. } else if (ui->data_len != 0) {
  151. err = 10;
  152. goto out_invalid;
  153. }
  154. break;
  155. case S_IFDIR:
  156. inode->i_op = &ubifs_dir_inode_operations;
  157. inode->i_fop = &ubifs_dir_operations;
  158. if (ui->data_len != 0) {
  159. err = 11;
  160. goto out_invalid;
  161. }
  162. break;
  163. case S_IFLNK:
  164. inode->i_op = &ubifs_symlink_inode_operations;
  165. if (ui->data_len <= 0 || ui->data_len > UBIFS_MAX_INO_DATA) {
  166. err = 12;
  167. goto out_invalid;
  168. }
  169. ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
  170. if (!ui->data) {
  171. err = -ENOMEM;
  172. goto out_ino;
  173. }
  174. memcpy(ui->data, ino->data, ui->data_len);
  175. ((char *)ui->data)[ui->data_len] = '\0';
  176. break;
  177. case S_IFBLK:
  178. case S_IFCHR:
  179. {
  180. dev_t rdev;
  181. union ubifs_dev_desc *dev;
  182. ui->data = kmalloc(sizeof(union ubifs_dev_desc), GFP_NOFS);
  183. if (!ui->data) {
  184. err = -ENOMEM;
  185. goto out_ino;
  186. }
  187. dev = (union ubifs_dev_desc *)ino->data;
  188. if (ui->data_len == sizeof(dev->new))
  189. rdev = new_decode_dev(le32_to_cpu(dev->new));
  190. else if (ui->data_len == sizeof(dev->huge))
  191. rdev = huge_decode_dev(le64_to_cpu(dev->huge));
  192. else {
  193. err = 13;
  194. goto out_invalid;
  195. }
  196. memcpy(ui->data, ino->data, ui->data_len);
  197. inode->i_op = &ubifs_file_inode_operations;
  198. init_special_inode(inode, inode->i_mode, rdev);
  199. break;
  200. }
  201. case S_IFSOCK:
  202. case S_IFIFO:
  203. inode->i_op = &ubifs_file_inode_operations;
  204. init_special_inode(inode, inode->i_mode, 0);
  205. if (ui->data_len != 0) {
  206. err = 14;
  207. goto out_invalid;
  208. }
  209. break;
  210. default:
  211. err = 15;
  212. goto out_invalid;
  213. }
  214. kfree(ino);
  215. ubifs_set_inode_flags(inode);
  216. unlock_new_inode(inode);
  217. return inode;
  218. out_invalid:
  219. ubifs_err("inode %lu validation failed, error %d", inode->i_ino, err);
  220. dbg_dump_node(c, ino);
  221. dbg_dump_inode(c, inode);
  222. err = -EINVAL;
  223. out_ino:
  224. kfree(ino);
  225. out:
  226. ubifs_err("failed to read inode %lu, error %d", inode->i_ino, err);
  227. iget_failed(inode);
  228. return ERR_PTR(err);
  229. }
  230. static struct inode *ubifs_alloc_inode(struct super_block *sb)
  231. {
  232. struct ubifs_inode *ui;
  233. ui = kmem_cache_alloc(ubifs_inode_slab, GFP_NOFS);
  234. if (!ui)
  235. return NULL;
  236. memset((void *)ui + sizeof(struct inode), 0,
  237. sizeof(struct ubifs_inode) - sizeof(struct inode));
  238. mutex_init(&ui->ui_mutex);
  239. spin_lock_init(&ui->ui_lock);
  240. return &ui->vfs_inode;
  241. };
  242. static void ubifs_destroy_inode(struct inode *inode)
  243. {
  244. struct ubifs_inode *ui = ubifs_inode(inode);
  245. kfree(ui->data);
  246. kmem_cache_free(ubifs_inode_slab, inode);
  247. }
  248. /*
  249. * Note, Linux write-back code calls this without 'i_mutex'.
  250. */
  251. static int ubifs_write_inode(struct inode *inode, int wait)
  252. {
  253. int err = 0;
  254. struct ubifs_info *c = inode->i_sb->s_fs_info;
  255. struct ubifs_inode *ui = ubifs_inode(inode);
  256. ubifs_assert(!ui->xattr);
  257. if (is_bad_inode(inode))
  258. return 0;
  259. mutex_lock(&ui->ui_mutex);
  260. /*
  261. * Due to races between write-back forced by budgeting
  262. * (see 'sync_some_inodes()') and pdflush write-back, the inode may
  263. * have already been synchronized, do not do this again. This might
  264. * also happen if it was synchronized in an VFS operation, e.g.
  265. * 'ubifs_link()'.
  266. */
  267. if (!ui->dirty) {
  268. mutex_unlock(&ui->ui_mutex);
  269. return 0;
  270. }
  271. /*
  272. * As an optimization, do not write orphan inodes to the media just
  273. * because this is not needed.
  274. */
  275. dbg_gen("inode %lu, mode %#x, nlink %u",
  276. inode->i_ino, (int)inode->i_mode, inode->i_nlink);
  277. if (inode->i_nlink) {
  278. err = ubifs_jnl_write_inode(c, inode);
  279. if (err)
  280. ubifs_err("can't write inode %lu, error %d",
  281. inode->i_ino, err);
  282. }
  283. ui->dirty = 0;
  284. mutex_unlock(&ui->ui_mutex);
  285. ubifs_release_dirty_inode_budget(c, ui);
  286. return err;
  287. }
  288. static void ubifs_delete_inode(struct inode *inode)
  289. {
  290. int err;
  291. struct ubifs_info *c = inode->i_sb->s_fs_info;
  292. struct ubifs_inode *ui = ubifs_inode(inode);
  293. if (ui->xattr)
  294. /*
  295. * Extended attribute inode deletions are fully handled in
  296. * 'ubifs_removexattr()'. These inodes are special and have
  297. * limited usage, so there is nothing to do here.
  298. */
  299. goto out;
  300. dbg_gen("inode %lu, mode %#x", inode->i_ino, (int)inode->i_mode);
  301. ubifs_assert(!atomic_read(&inode->i_count));
  302. ubifs_assert(inode->i_nlink == 0);
  303. truncate_inode_pages(&inode->i_data, 0);
  304. if (is_bad_inode(inode))
  305. goto out;
  306. ui->ui_size = inode->i_size = 0;
  307. err = ubifs_jnl_delete_inode(c, inode);
  308. if (err)
  309. /*
  310. * Worst case we have a lost orphan inode wasting space, so a
  311. * simple error message is OK here.
  312. */
  313. ubifs_err("can't delete inode %lu, error %d",
  314. inode->i_ino, err);
  315. out:
  316. if (ui->dirty)
  317. ubifs_release_dirty_inode_budget(c, ui);
  318. clear_inode(inode);
  319. }
  320. static void ubifs_dirty_inode(struct inode *inode)
  321. {
  322. struct ubifs_inode *ui = ubifs_inode(inode);
  323. ubifs_assert(mutex_is_locked(&ui->ui_mutex));
  324. if (!ui->dirty) {
  325. ui->dirty = 1;
  326. dbg_gen("inode %lu", inode->i_ino);
  327. }
  328. }
  329. static int ubifs_statfs(struct dentry *dentry, struct kstatfs *buf)
  330. {
  331. struct ubifs_info *c = dentry->d_sb->s_fs_info;
  332. unsigned long long free;
  333. __le32 *uuid = (__le32 *)c->uuid;
  334. free = ubifs_get_free_space(c);
  335. dbg_gen("free space %lld bytes (%lld blocks)",
  336. free, free >> UBIFS_BLOCK_SHIFT);
  337. buf->f_type = UBIFS_SUPER_MAGIC;
  338. buf->f_bsize = UBIFS_BLOCK_SIZE;
  339. buf->f_blocks = c->block_cnt;
  340. buf->f_bfree = free >> UBIFS_BLOCK_SHIFT;
  341. if (free > c->report_rp_size)
  342. buf->f_bavail = (free - c->report_rp_size) >> UBIFS_BLOCK_SHIFT;
  343. else
  344. buf->f_bavail = 0;
  345. buf->f_files = 0;
  346. buf->f_ffree = 0;
  347. buf->f_namelen = UBIFS_MAX_NLEN;
  348. buf->f_fsid.val[0] = le32_to_cpu(uuid[0]) ^ le32_to_cpu(uuid[2]);
  349. buf->f_fsid.val[1] = le32_to_cpu(uuid[1]) ^ le32_to_cpu(uuid[3]);
  350. return 0;
  351. }
  352. static int ubifs_show_options(struct seq_file *s, struct vfsmount *mnt)
  353. {
  354. struct ubifs_info *c = mnt->mnt_sb->s_fs_info;
  355. if (c->mount_opts.unmount_mode == 2)
  356. seq_printf(s, ",fast_unmount");
  357. else if (c->mount_opts.unmount_mode == 1)
  358. seq_printf(s, ",norm_unmount");
  359. if (c->mount_opts.bulk_read == 2)
  360. seq_printf(s, ",bulk_read");
  361. else if (c->mount_opts.bulk_read == 1)
  362. seq_printf(s, ",no_bulk_read");
  363. if (c->mount_opts.chk_data_crc == 2)
  364. seq_printf(s, ",chk_data_crc");
  365. else if (c->mount_opts.chk_data_crc == 1)
  366. seq_printf(s, ",no_chk_data_crc");
  367. if (c->mount_opts.override_compr) {
  368. seq_printf(s, ",compr=");
  369. seq_printf(s, ubifs_compr_name(c->mount_opts.compr_type));
  370. }
  371. return 0;
  372. }
  373. static int ubifs_sync_fs(struct super_block *sb, int wait)
  374. {
  375. int i, err;
  376. struct ubifs_info *c = sb->s_fs_info;
  377. struct writeback_control wbc = {
  378. .sync_mode = wait ? WB_SYNC_ALL : WB_SYNC_NONE,
  379. .range_start = 0,
  380. .range_end = LLONG_MAX,
  381. .nr_to_write = LONG_MAX,
  382. };
  383. /*
  384. * Note by akpm about WB_SYNC_NONE used above: zero @wait is just an
  385. * advisory thing to help the file system shove lots of data into the
  386. * queues. If some gets missed then it'll be picked up on the second
  387. * '->sync_fs()' call, with non-zero @wait.
  388. */
  389. if (sb->s_flags & MS_RDONLY)
  390. return 0;
  391. /*
  392. * Synchronize write buffers, because 'ubifs_run_commit()' does not
  393. * do this if it waits for an already running commit.
  394. */
  395. for (i = 0; i < c->jhead_cnt; i++) {
  396. err = ubifs_wbuf_sync(&c->jheads[i].wbuf);
  397. if (err)
  398. return err;
  399. }
  400. /*
  401. * VFS calls '->sync_fs()' before synchronizing all dirty inodes and
  402. * pages, so synchronize them first, then commit the journal. Strictly
  403. * speaking, it is not necessary to commit the journal here,
  404. * synchronizing write-buffers would be enough. But committing makes
  405. * UBIFS free space predictions much more accurate, so we want to let
  406. * the user be able to get more accurate results of 'statfs()' after
  407. * they synchronize the file system.
  408. */
  409. generic_sync_sb_inodes(sb, &wbc);
  410. err = ubifs_run_commit(c);
  411. if (err)
  412. return err;
  413. return ubi_sync(c->vi.ubi_num);
  414. }
  415. /**
  416. * init_constants_early - initialize UBIFS constants.
  417. * @c: UBIFS file-system description object
  418. *
  419. * This function initialize UBIFS constants which do not need the superblock to
  420. * be read. It also checks that the UBI volume satisfies basic UBIFS
  421. * requirements. Returns zero in case of success and a negative error code in
  422. * case of failure.
  423. */
  424. static int init_constants_early(struct ubifs_info *c)
  425. {
  426. if (c->vi.corrupted) {
  427. ubifs_warn("UBI volume is corrupted - read-only mode");
  428. c->ro_media = 1;
  429. }
  430. if (c->di.ro_mode) {
  431. ubifs_msg("read-only UBI device");
  432. c->ro_media = 1;
  433. }
  434. if (c->vi.vol_type == UBI_STATIC_VOLUME) {
  435. ubifs_msg("static UBI volume - read-only mode");
  436. c->ro_media = 1;
  437. }
  438. c->leb_cnt = c->vi.size;
  439. c->leb_size = c->vi.usable_leb_size;
  440. c->half_leb_size = c->leb_size / 2;
  441. c->min_io_size = c->di.min_io_size;
  442. c->min_io_shift = fls(c->min_io_size) - 1;
  443. if (c->leb_size < UBIFS_MIN_LEB_SZ) {
  444. ubifs_err("too small LEBs (%d bytes), min. is %d bytes",
  445. c->leb_size, UBIFS_MIN_LEB_SZ);
  446. return -EINVAL;
  447. }
  448. if (c->leb_cnt < UBIFS_MIN_LEB_CNT) {
  449. ubifs_err("too few LEBs (%d), min. is %d",
  450. c->leb_cnt, UBIFS_MIN_LEB_CNT);
  451. return -EINVAL;
  452. }
  453. if (!is_power_of_2(c->min_io_size)) {
  454. ubifs_err("bad min. I/O size %d", c->min_io_size);
  455. return -EINVAL;
  456. }
  457. /*
  458. * UBIFS aligns all node to 8-byte boundary, so to make function in
  459. * io.c simpler, assume minimum I/O unit size to be 8 bytes if it is
  460. * less than 8.
  461. */
  462. if (c->min_io_size < 8) {
  463. c->min_io_size = 8;
  464. c->min_io_shift = 3;
  465. }
  466. c->ref_node_alsz = ALIGN(UBIFS_REF_NODE_SZ, c->min_io_size);
  467. c->mst_node_alsz = ALIGN(UBIFS_MST_NODE_SZ, c->min_io_size);
  468. /*
  469. * Initialize node length ranges which are mostly needed for node
  470. * length validation.
  471. */
  472. c->ranges[UBIFS_PAD_NODE].len = UBIFS_PAD_NODE_SZ;
  473. c->ranges[UBIFS_SB_NODE].len = UBIFS_SB_NODE_SZ;
  474. c->ranges[UBIFS_MST_NODE].len = UBIFS_MST_NODE_SZ;
  475. c->ranges[UBIFS_REF_NODE].len = UBIFS_REF_NODE_SZ;
  476. c->ranges[UBIFS_TRUN_NODE].len = UBIFS_TRUN_NODE_SZ;
  477. c->ranges[UBIFS_CS_NODE].len = UBIFS_CS_NODE_SZ;
  478. c->ranges[UBIFS_INO_NODE].min_len = UBIFS_INO_NODE_SZ;
  479. c->ranges[UBIFS_INO_NODE].max_len = UBIFS_MAX_INO_NODE_SZ;
  480. c->ranges[UBIFS_ORPH_NODE].min_len =
  481. UBIFS_ORPH_NODE_SZ + sizeof(__le64);
  482. c->ranges[UBIFS_ORPH_NODE].max_len = c->leb_size;
  483. c->ranges[UBIFS_DENT_NODE].min_len = UBIFS_DENT_NODE_SZ;
  484. c->ranges[UBIFS_DENT_NODE].max_len = UBIFS_MAX_DENT_NODE_SZ;
  485. c->ranges[UBIFS_XENT_NODE].min_len = UBIFS_XENT_NODE_SZ;
  486. c->ranges[UBIFS_XENT_NODE].max_len = UBIFS_MAX_XENT_NODE_SZ;
  487. c->ranges[UBIFS_DATA_NODE].min_len = UBIFS_DATA_NODE_SZ;
  488. c->ranges[UBIFS_DATA_NODE].max_len = UBIFS_MAX_DATA_NODE_SZ;
  489. /*
  490. * Minimum indexing node size is amended later when superblock is
  491. * read and the key length is known.
  492. */
  493. c->ranges[UBIFS_IDX_NODE].min_len = UBIFS_IDX_NODE_SZ + UBIFS_BRANCH_SZ;
  494. /*
  495. * Maximum indexing node size is amended later when superblock is
  496. * read and the fanout is known.
  497. */
  498. c->ranges[UBIFS_IDX_NODE].max_len = INT_MAX;
  499. /*
  500. * Initialize dead and dark LEB space watermarks.
  501. *
  502. * Dead space is the space which cannot be used. Its watermark is
  503. * equivalent to min. I/O unit or minimum node size if it is greater
  504. * then min. I/O unit.
  505. *
  506. * Dark space is the space which might be used, or might not, depending
  507. * on which node should be written to the LEB. Its watermark is
  508. * equivalent to maximum UBIFS node size.
  509. */
  510. c->dead_wm = ALIGN(MIN_WRITE_SZ, c->min_io_size);
  511. c->dark_wm = ALIGN(UBIFS_MAX_NODE_SZ, c->min_io_size);
  512. /*
  513. * Calculate how many bytes would be wasted at the end of LEB if it was
  514. * fully filled with data nodes of maximum size. This is used in
  515. * calculations when reporting free space.
  516. */
  517. c->leb_overhead = c->leb_size % UBIFS_MAX_DATA_NODE_SZ;
  518. /* Buffer size for bulk-reads */
  519. c->max_bu_buf_len = UBIFS_MAX_BULK_READ * UBIFS_MAX_DATA_NODE_SZ;
  520. if (c->max_bu_buf_len > c->leb_size)
  521. c->max_bu_buf_len = c->leb_size;
  522. return 0;
  523. }
  524. /**
  525. * bud_wbuf_callback - bud LEB write-buffer synchronization call-back.
  526. * @c: UBIFS file-system description object
  527. * @lnum: LEB the write-buffer was synchronized to
  528. * @free: how many free bytes left in this LEB
  529. * @pad: how many bytes were padded
  530. *
  531. * This is a callback function which is called by the I/O unit when the
  532. * write-buffer is synchronized. We need this to correctly maintain space
  533. * accounting in bud logical eraseblocks. This function returns zero in case of
  534. * success and a negative error code in case of failure.
  535. *
  536. * This function actually belongs to the journal, but we keep it here because
  537. * we want to keep it static.
  538. */
  539. static int bud_wbuf_callback(struct ubifs_info *c, int lnum, int free, int pad)
  540. {
  541. return ubifs_update_one_lp(c, lnum, free, pad, 0, 0);
  542. }
  543. /*
  544. * init_constants_sb - initialize UBIFS constants.
  545. * @c: UBIFS file-system description object
  546. *
  547. * This is a helper function which initializes various UBIFS constants after
  548. * the superblock has been read. It also checks various UBIFS parameters and
  549. * makes sure they are all right. Returns zero in case of success and a
  550. * negative error code in case of failure.
  551. */
  552. static int init_constants_sb(struct ubifs_info *c)
  553. {
  554. int tmp, err;
  555. long long tmp64;
  556. c->main_bytes = (long long)c->main_lebs * c->leb_size;
  557. c->max_znode_sz = sizeof(struct ubifs_znode) +
  558. c->fanout * sizeof(struct ubifs_zbranch);
  559. tmp = ubifs_idx_node_sz(c, 1);
  560. c->ranges[UBIFS_IDX_NODE].min_len = tmp;
  561. c->min_idx_node_sz = ALIGN(tmp, 8);
  562. tmp = ubifs_idx_node_sz(c, c->fanout);
  563. c->ranges[UBIFS_IDX_NODE].max_len = tmp;
  564. c->max_idx_node_sz = ALIGN(tmp, 8);
  565. /* Make sure LEB size is large enough to fit full commit */
  566. tmp = UBIFS_CS_NODE_SZ + UBIFS_REF_NODE_SZ * c->jhead_cnt;
  567. tmp = ALIGN(tmp, c->min_io_size);
  568. if (tmp > c->leb_size) {
  569. dbg_err("too small LEB size %d, at least %d needed",
  570. c->leb_size, tmp);
  571. return -EINVAL;
  572. }
  573. /*
  574. * Make sure that the log is large enough to fit reference nodes for
  575. * all buds plus one reserved LEB.
  576. */
  577. tmp64 = c->max_bud_bytes + c->leb_size - 1;
  578. c->max_bud_cnt = div_u64(tmp64, c->leb_size);
  579. tmp = (c->ref_node_alsz * c->max_bud_cnt + c->leb_size - 1);
  580. tmp /= c->leb_size;
  581. tmp += 1;
  582. if (c->log_lebs < tmp) {
  583. dbg_err("too small log %d LEBs, required min. %d LEBs",
  584. c->log_lebs, tmp);
  585. return -EINVAL;
  586. }
  587. /*
  588. * When budgeting we assume worst-case scenarios when the pages are not
  589. * be compressed and direntries are of the maximum size.
  590. *
  591. * Note, data, which may be stored in inodes is budgeted separately, so
  592. * it is not included into 'c->inode_budget'.
  593. */
  594. c->page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE;
  595. c->inode_budget = UBIFS_INO_NODE_SZ;
  596. c->dent_budget = UBIFS_MAX_DENT_NODE_SZ;
  597. /*
  598. * When the amount of flash space used by buds becomes
  599. * 'c->max_bud_bytes', UBIFS just blocks all writers and starts commit.
  600. * The writers are unblocked when the commit is finished. To avoid
  601. * writers to be blocked UBIFS initiates background commit in advance,
  602. * when number of bud bytes becomes above the limit defined below.
  603. */
  604. c->bg_bud_bytes = (c->max_bud_bytes * 13) >> 4;
  605. /*
  606. * Ensure minimum journal size. All the bytes in the journal heads are
  607. * considered to be used, when calculating the current journal usage.
  608. * Consequently, if the journal is too small, UBIFS will treat it as
  609. * always full.
  610. */
  611. tmp64 = (long long)(c->jhead_cnt + 1) * c->leb_size + 1;
  612. if (c->bg_bud_bytes < tmp64)
  613. c->bg_bud_bytes = tmp64;
  614. if (c->max_bud_bytes < tmp64 + c->leb_size)
  615. c->max_bud_bytes = tmp64 + c->leb_size;
  616. err = ubifs_calc_lpt_geom(c);
  617. if (err)
  618. return err;
  619. return 0;
  620. }
  621. /*
  622. * init_constants_master - initialize UBIFS constants.
  623. * @c: UBIFS file-system description object
  624. *
  625. * This is a helper function which initializes various UBIFS constants after
  626. * the master node has been read. It also checks various UBIFS parameters and
  627. * makes sure they are all right.
  628. */
  629. static void init_constants_master(struct ubifs_info *c)
  630. {
  631. long long tmp64;
  632. c->min_idx_lebs = ubifs_calc_min_idx_lebs(c);
  633. /*
  634. * Calculate total amount of FS blocks. This number is not used
  635. * internally because it does not make much sense for UBIFS, but it is
  636. * necessary to report something for the 'statfs()' call.
  637. *
  638. * Subtract the LEB reserved for GC, the LEB which is reserved for
  639. * deletions, minimum LEBs for the index, and assume only one journal
  640. * head is available.
  641. */
  642. tmp64 = c->main_lebs - 1 - 1 - MIN_INDEX_LEBS - c->jhead_cnt + 1;
  643. tmp64 *= (long long)c->leb_size - c->leb_overhead;
  644. tmp64 = ubifs_reported_space(c, tmp64);
  645. c->block_cnt = tmp64 >> UBIFS_BLOCK_SHIFT;
  646. }
  647. /**
  648. * take_gc_lnum - reserve GC LEB.
  649. * @c: UBIFS file-system description object
  650. *
  651. * This function ensures that the LEB reserved for garbage collection is
  652. * unmapped and is marked as "taken" in lprops. We also have to set free space
  653. * to LEB size and dirty space to zero, because lprops may contain out-of-date
  654. * information if the file-system was un-mounted before it has been committed.
  655. * This function returns zero in case of success and a negative error code in
  656. * case of failure.
  657. */
  658. static int take_gc_lnum(struct ubifs_info *c)
  659. {
  660. int err;
  661. if (c->gc_lnum == -1) {
  662. ubifs_err("no LEB for GC");
  663. return -EINVAL;
  664. }
  665. err = ubifs_leb_unmap(c, c->gc_lnum);
  666. if (err)
  667. return err;
  668. /* And we have to tell lprops that this LEB is taken */
  669. err = ubifs_change_one_lp(c, c->gc_lnum, c->leb_size, 0,
  670. LPROPS_TAKEN, 0, 0);
  671. return err;
  672. }
  673. /**
  674. * alloc_wbufs - allocate write-buffers.
  675. * @c: UBIFS file-system description object
  676. *
  677. * This helper function allocates and initializes UBIFS write-buffers. Returns
  678. * zero in case of success and %-ENOMEM in case of failure.
  679. */
  680. static int alloc_wbufs(struct ubifs_info *c)
  681. {
  682. int i, err;
  683. c->jheads = kzalloc(c->jhead_cnt * sizeof(struct ubifs_jhead),
  684. GFP_KERNEL);
  685. if (!c->jheads)
  686. return -ENOMEM;
  687. /* Initialize journal heads */
  688. for (i = 0; i < c->jhead_cnt; i++) {
  689. INIT_LIST_HEAD(&c->jheads[i].buds_list);
  690. err = ubifs_wbuf_init(c, &c->jheads[i].wbuf);
  691. if (err)
  692. return err;
  693. c->jheads[i].wbuf.sync_callback = &bud_wbuf_callback;
  694. c->jheads[i].wbuf.jhead = i;
  695. }
  696. c->jheads[BASEHD].wbuf.dtype = UBI_SHORTTERM;
  697. /*
  698. * Garbage Collector head likely contains long-term data and
  699. * does not need to be synchronized by timer.
  700. */
  701. c->jheads[GCHD].wbuf.dtype = UBI_LONGTERM;
  702. c->jheads[GCHD].wbuf.timeout = 0;
  703. return 0;
  704. }
  705. /**
  706. * free_wbufs - free write-buffers.
  707. * @c: UBIFS file-system description object
  708. */
  709. static void free_wbufs(struct ubifs_info *c)
  710. {
  711. int i;
  712. if (c->jheads) {
  713. for (i = 0; i < c->jhead_cnt; i++) {
  714. kfree(c->jheads[i].wbuf.buf);
  715. kfree(c->jheads[i].wbuf.inodes);
  716. }
  717. kfree(c->jheads);
  718. c->jheads = NULL;
  719. }
  720. }
  721. /**
  722. * free_orphans - free orphans.
  723. * @c: UBIFS file-system description object
  724. */
  725. static void free_orphans(struct ubifs_info *c)
  726. {
  727. struct ubifs_orphan *orph;
  728. while (c->orph_dnext) {
  729. orph = c->orph_dnext;
  730. c->orph_dnext = orph->dnext;
  731. list_del(&orph->list);
  732. kfree(orph);
  733. }
  734. while (!list_empty(&c->orph_list)) {
  735. orph = list_entry(c->orph_list.next, struct ubifs_orphan, list);
  736. list_del(&orph->list);
  737. kfree(orph);
  738. dbg_err("orphan list not empty at unmount");
  739. }
  740. vfree(c->orph_buf);
  741. c->orph_buf = NULL;
  742. }
  743. /**
  744. * free_buds - free per-bud objects.
  745. * @c: UBIFS file-system description object
  746. */
  747. static void free_buds(struct ubifs_info *c)
  748. {
  749. struct rb_node *this = c->buds.rb_node;
  750. struct ubifs_bud *bud;
  751. while (this) {
  752. if (this->rb_left)
  753. this = this->rb_left;
  754. else if (this->rb_right)
  755. this = this->rb_right;
  756. else {
  757. bud = rb_entry(this, struct ubifs_bud, rb);
  758. this = rb_parent(this);
  759. if (this) {
  760. if (this->rb_left == &bud->rb)
  761. this->rb_left = NULL;
  762. else
  763. this->rb_right = NULL;
  764. }
  765. kfree(bud);
  766. }
  767. }
  768. }
  769. /**
  770. * check_volume_empty - check if the UBI volume is empty.
  771. * @c: UBIFS file-system description object
  772. *
  773. * This function checks if the UBIFS volume is empty by looking if its LEBs are
  774. * mapped or not. The result of checking is stored in the @c->empty variable.
  775. * Returns zero in case of success and a negative error code in case of
  776. * failure.
  777. */
  778. static int check_volume_empty(struct ubifs_info *c)
  779. {
  780. int lnum, err;
  781. c->empty = 1;
  782. for (lnum = 0; lnum < c->leb_cnt; lnum++) {
  783. err = ubi_is_mapped(c->ubi, lnum);
  784. if (unlikely(err < 0))
  785. return err;
  786. if (err == 1) {
  787. c->empty = 0;
  788. break;
  789. }
  790. cond_resched();
  791. }
  792. return 0;
  793. }
  794. /*
  795. * UBIFS mount options.
  796. *
  797. * Opt_fast_unmount: do not run a journal commit before un-mounting
  798. * Opt_norm_unmount: run a journal commit before un-mounting
  799. * Opt_bulk_read: enable bulk-reads
  800. * Opt_no_bulk_read: disable bulk-reads
  801. * Opt_chk_data_crc: check CRCs when reading data nodes
  802. * Opt_no_chk_data_crc: do not check CRCs when reading data nodes
  803. * Opt_override_compr: override default compressor
  804. * Opt_err: just end of array marker
  805. */
  806. enum {
  807. Opt_fast_unmount,
  808. Opt_norm_unmount,
  809. Opt_bulk_read,
  810. Opt_no_bulk_read,
  811. Opt_chk_data_crc,
  812. Opt_no_chk_data_crc,
  813. Opt_override_compr,
  814. Opt_err,
  815. };
  816. static const match_table_t tokens = {
  817. {Opt_fast_unmount, "fast_unmount"},
  818. {Opt_norm_unmount, "norm_unmount"},
  819. {Opt_bulk_read, "bulk_read"},
  820. {Opt_no_bulk_read, "no_bulk_read"},
  821. {Opt_chk_data_crc, "chk_data_crc"},
  822. {Opt_no_chk_data_crc, "no_chk_data_crc"},
  823. {Opt_override_compr, "compr=%s"},
  824. {Opt_err, NULL},
  825. };
  826. /**
  827. * ubifs_parse_options - parse mount parameters.
  828. * @c: UBIFS file-system description object
  829. * @options: parameters to parse
  830. * @is_remount: non-zero if this is FS re-mount
  831. *
  832. * This function parses UBIFS mount options and returns zero in case success
  833. * and a negative error code in case of failure.
  834. */
  835. static int ubifs_parse_options(struct ubifs_info *c, char *options,
  836. int is_remount)
  837. {
  838. char *p;
  839. substring_t args[MAX_OPT_ARGS];
  840. if (!options)
  841. return 0;
  842. while ((p = strsep(&options, ","))) {
  843. int token;
  844. if (!*p)
  845. continue;
  846. token = match_token(p, tokens, args);
  847. switch (token) {
  848. case Opt_fast_unmount:
  849. c->mount_opts.unmount_mode = 2;
  850. c->fast_unmount = 1;
  851. break;
  852. case Opt_norm_unmount:
  853. c->mount_opts.unmount_mode = 1;
  854. c->fast_unmount = 0;
  855. break;
  856. case Opt_bulk_read:
  857. c->mount_opts.bulk_read = 2;
  858. c->bulk_read = 1;
  859. break;
  860. case Opt_no_bulk_read:
  861. c->mount_opts.bulk_read = 1;
  862. c->bulk_read = 0;
  863. break;
  864. case Opt_chk_data_crc:
  865. c->mount_opts.chk_data_crc = 2;
  866. c->no_chk_data_crc = 0;
  867. break;
  868. case Opt_no_chk_data_crc:
  869. c->mount_opts.chk_data_crc = 1;
  870. c->no_chk_data_crc = 1;
  871. break;
  872. case Opt_override_compr:
  873. {
  874. char *name = match_strdup(&args[0]);
  875. if (!name)
  876. return -ENOMEM;
  877. if (!strcmp(name, "none"))
  878. c->mount_opts.compr_type = UBIFS_COMPR_NONE;
  879. else if (!strcmp(name, "lzo"))
  880. c->mount_opts.compr_type = UBIFS_COMPR_LZO;
  881. else if (!strcmp(name, "zlib"))
  882. c->mount_opts.compr_type = UBIFS_COMPR_ZLIB;
  883. else {
  884. ubifs_err("unknown compressor \"%s\"", name);
  885. kfree(name);
  886. return -EINVAL;
  887. }
  888. kfree(name);
  889. c->mount_opts.override_compr = 1;
  890. c->default_compr = c->mount_opts.compr_type;
  891. break;
  892. }
  893. default:
  894. ubifs_err("unrecognized mount option \"%s\" "
  895. "or missing value", p);
  896. return -EINVAL;
  897. }
  898. }
  899. return 0;
  900. }
  901. /**
  902. * destroy_journal - destroy journal data structures.
  903. * @c: UBIFS file-system description object
  904. *
  905. * This function destroys journal data structures including those that may have
  906. * been created by recovery functions.
  907. */
  908. static void destroy_journal(struct ubifs_info *c)
  909. {
  910. while (!list_empty(&c->unclean_leb_list)) {
  911. struct ubifs_unclean_leb *ucleb;
  912. ucleb = list_entry(c->unclean_leb_list.next,
  913. struct ubifs_unclean_leb, list);
  914. list_del(&ucleb->list);
  915. kfree(ucleb);
  916. }
  917. while (!list_empty(&c->old_buds)) {
  918. struct ubifs_bud *bud;
  919. bud = list_entry(c->old_buds.next, struct ubifs_bud, list);
  920. list_del(&bud->list);
  921. kfree(bud);
  922. }
  923. ubifs_destroy_idx_gc(c);
  924. ubifs_destroy_size_tree(c);
  925. ubifs_tnc_close(c);
  926. free_buds(c);
  927. }
  928. /**
  929. * bu_init - initialize bulk-read information.
  930. * @c: UBIFS file-system description object
  931. */
  932. static void bu_init(struct ubifs_info *c)
  933. {
  934. ubifs_assert(c->bulk_read == 1);
  935. if (c->bu.buf)
  936. return; /* Already initialized */
  937. again:
  938. c->bu.buf = kmalloc(c->max_bu_buf_len, GFP_KERNEL | __GFP_NOWARN);
  939. if (!c->bu.buf) {
  940. if (c->max_bu_buf_len > UBIFS_KMALLOC_OK) {
  941. c->max_bu_buf_len = UBIFS_KMALLOC_OK;
  942. goto again;
  943. }
  944. /* Just disable bulk-read */
  945. ubifs_warn("Cannot allocate %d bytes of memory for bulk-read, "
  946. "disabling it", c->max_bu_buf_len);
  947. c->mount_opts.bulk_read = 1;
  948. c->bulk_read = 0;
  949. return;
  950. }
  951. }
  952. /**
  953. * check_free_space - check if there is enough free space to mount.
  954. * @c: UBIFS file-system description object
  955. *
  956. * This function makes sure UBIFS has enough free space to be mounted in
  957. * read/write mode. UBIFS must always have some free space to allow deletions.
  958. */
  959. static int check_free_space(struct ubifs_info *c)
  960. {
  961. ubifs_assert(c->dark_wm > 0);
  962. if (c->lst.total_free + c->lst.total_dirty < c->dark_wm) {
  963. ubifs_err("insufficient free space to mount in read/write mode");
  964. dbg_dump_budg(c);
  965. dbg_dump_lprops(c);
  966. /*
  967. * We return %-EINVAL instead of %-ENOSPC because it seems to
  968. * be the closest error code mentioned in the mount function
  969. * documentation.
  970. */
  971. return -EINVAL;
  972. }
  973. return 0;
  974. }
  975. /**
  976. * mount_ubifs - mount UBIFS file-system.
  977. * @c: UBIFS file-system description object
  978. *
  979. * This function mounts UBIFS file system. Returns zero in case of success and
  980. * a negative error code in case of failure.
  981. *
  982. * Note, the function does not de-allocate resources it it fails half way
  983. * through, and the caller has to do this instead.
  984. */
  985. static int mount_ubifs(struct ubifs_info *c)
  986. {
  987. struct super_block *sb = c->vfs_sb;
  988. int err, mounted_read_only = (sb->s_flags & MS_RDONLY);
  989. long long x;
  990. size_t sz;
  991. err = init_constants_early(c);
  992. if (err)
  993. return err;
  994. err = ubifs_debugging_init(c);
  995. if (err)
  996. return err;
  997. err = check_volume_empty(c);
  998. if (err)
  999. goto out_free;
  1000. if (c->empty && (mounted_read_only || c->ro_media)) {
  1001. /*
  1002. * This UBI volume is empty, and read-only, or the file system
  1003. * is mounted read-only - we cannot format it.
  1004. */
  1005. ubifs_err("can't format empty UBI volume: read-only %s",
  1006. c->ro_media ? "UBI volume" : "mount");
  1007. err = -EROFS;
  1008. goto out_free;
  1009. }
  1010. if (c->ro_media && !mounted_read_only) {
  1011. ubifs_err("cannot mount read-write - read-only media");
  1012. err = -EROFS;
  1013. goto out_free;
  1014. }
  1015. /*
  1016. * The requirement for the buffer is that it should fit indexing B-tree
  1017. * height amount of integers. We assume the height if the TNC tree will
  1018. * never exceed 64.
  1019. */
  1020. err = -ENOMEM;
  1021. c->bottom_up_buf = kmalloc(BOTTOM_UP_HEIGHT * sizeof(int), GFP_KERNEL);
  1022. if (!c->bottom_up_buf)
  1023. goto out_free;
  1024. c->sbuf = vmalloc(c->leb_size);
  1025. if (!c->sbuf)
  1026. goto out_free;
  1027. if (!mounted_read_only) {
  1028. c->ileb_buf = vmalloc(c->leb_size);
  1029. if (!c->ileb_buf)
  1030. goto out_free;
  1031. }
  1032. if (c->bulk_read == 1)
  1033. bu_init(c);
  1034. /*
  1035. * We have to check all CRCs, even for data nodes, when we mount the FS
  1036. * (specifically, when we are replaying).
  1037. */
  1038. c->always_chk_crc = 1;
  1039. err = ubifs_read_superblock(c);
  1040. if (err)
  1041. goto out_free;
  1042. /*
  1043. * Make sure the compressor which is set as default in the superblock
  1044. * or overridden by mount options is actually compiled in.
  1045. */
  1046. if (!ubifs_compr_present(c->default_compr)) {
  1047. ubifs_err("'compressor \"%s\" is not compiled in",
  1048. ubifs_compr_name(c->default_compr));
  1049. goto out_free;
  1050. }
  1051. err = init_constants_sb(c);
  1052. if (err)
  1053. goto out_free;
  1054. sz = ALIGN(c->max_idx_node_sz, c->min_io_size);
  1055. sz = ALIGN(sz + c->max_idx_node_sz, c->min_io_size);
  1056. c->cbuf = kmalloc(sz, GFP_NOFS);
  1057. if (!c->cbuf) {
  1058. err = -ENOMEM;
  1059. goto out_free;
  1060. }
  1061. sprintf(c->bgt_name, BGT_NAME_PATTERN, c->vi.ubi_num, c->vi.vol_id);
  1062. if (!mounted_read_only) {
  1063. err = alloc_wbufs(c);
  1064. if (err)
  1065. goto out_cbuf;
  1066. /* Create background thread */
  1067. c->bgt = kthread_create(ubifs_bg_thread, c, c->bgt_name);
  1068. if (IS_ERR(c->bgt)) {
  1069. err = PTR_ERR(c->bgt);
  1070. c->bgt = NULL;
  1071. ubifs_err("cannot spawn \"%s\", error %d",
  1072. c->bgt_name, err);
  1073. goto out_wbufs;
  1074. }
  1075. wake_up_process(c->bgt);
  1076. }
  1077. err = ubifs_read_master(c);
  1078. if (err)
  1079. goto out_master;
  1080. init_constants_master(c);
  1081. if ((c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY)) != 0) {
  1082. ubifs_msg("recovery needed");
  1083. c->need_recovery = 1;
  1084. if (!mounted_read_only) {
  1085. err = ubifs_recover_inl_heads(c, c->sbuf);
  1086. if (err)
  1087. goto out_master;
  1088. }
  1089. } else if (!mounted_read_only) {
  1090. /*
  1091. * Set the "dirty" flag so that if we reboot uncleanly we
  1092. * will notice this immediately on the next mount.
  1093. */
  1094. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1095. err = ubifs_write_master(c);
  1096. if (err)
  1097. goto out_master;
  1098. }
  1099. err = ubifs_lpt_init(c, 1, !mounted_read_only);
  1100. if (err)
  1101. goto out_lpt;
  1102. err = dbg_check_idx_size(c, c->old_idx_sz);
  1103. if (err)
  1104. goto out_lpt;
  1105. err = ubifs_replay_journal(c);
  1106. if (err)
  1107. goto out_journal;
  1108. err = ubifs_mount_orphans(c, c->need_recovery, mounted_read_only);
  1109. if (err)
  1110. goto out_orphans;
  1111. if (!mounted_read_only) {
  1112. int lnum;
  1113. err = check_free_space(c);
  1114. if (err)
  1115. goto out_orphans;
  1116. /* Check for enough log space */
  1117. lnum = c->lhead_lnum + 1;
  1118. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1119. lnum = UBIFS_LOG_LNUM;
  1120. if (lnum == c->ltail_lnum) {
  1121. err = ubifs_consolidate_log(c);
  1122. if (err)
  1123. goto out_orphans;
  1124. }
  1125. if (c->need_recovery) {
  1126. err = ubifs_recover_size(c);
  1127. if (err)
  1128. goto out_orphans;
  1129. err = ubifs_rcvry_gc_commit(c);
  1130. } else
  1131. err = take_gc_lnum(c);
  1132. if (err)
  1133. goto out_orphans;
  1134. err = dbg_check_lprops(c);
  1135. if (err)
  1136. goto out_orphans;
  1137. } else if (c->need_recovery) {
  1138. err = ubifs_recover_size(c);
  1139. if (err)
  1140. goto out_orphans;
  1141. }
  1142. spin_lock(&ubifs_infos_lock);
  1143. list_add_tail(&c->infos_list, &ubifs_infos);
  1144. spin_unlock(&ubifs_infos_lock);
  1145. if (c->need_recovery) {
  1146. if (mounted_read_only)
  1147. ubifs_msg("recovery deferred");
  1148. else {
  1149. c->need_recovery = 0;
  1150. ubifs_msg("recovery completed");
  1151. }
  1152. }
  1153. err = dbg_debugfs_init_fs(c);
  1154. if (err)
  1155. goto out_infos;
  1156. err = dbg_check_filesystem(c);
  1157. if (err)
  1158. goto out_infos;
  1159. c->always_chk_crc = 0;
  1160. ubifs_msg("mounted UBI device %d, volume %d, name \"%s\"",
  1161. c->vi.ubi_num, c->vi.vol_id, c->vi.name);
  1162. if (mounted_read_only)
  1163. ubifs_msg("mounted read-only");
  1164. x = (long long)c->main_lebs * c->leb_size;
  1165. ubifs_msg("file system size: %lld bytes (%lld KiB, %lld MiB, %d "
  1166. "LEBs)", x, x >> 10, x >> 20, c->main_lebs);
  1167. x = (long long)c->log_lebs * c->leb_size + c->max_bud_bytes;
  1168. ubifs_msg("journal size: %lld bytes (%lld KiB, %lld MiB, %d "
  1169. "LEBs)", x, x >> 10, x >> 20, c->log_lebs + c->max_bud_cnt);
  1170. ubifs_msg("media format: %d (latest is %d)",
  1171. c->fmt_version, UBIFS_FORMAT_VERSION);
  1172. ubifs_msg("default compressor: %s", ubifs_compr_name(c->default_compr));
  1173. ubifs_msg("reserved for root: %llu bytes (%llu KiB)",
  1174. c->report_rp_size, c->report_rp_size >> 10);
  1175. dbg_msg("compiled on: " __DATE__ " at " __TIME__);
  1176. dbg_msg("min. I/O unit size: %d bytes", c->min_io_size);
  1177. dbg_msg("LEB size: %d bytes (%d KiB)",
  1178. c->leb_size, c->leb_size >> 10);
  1179. dbg_msg("data journal heads: %d",
  1180. c->jhead_cnt - NONDATA_JHEADS_CNT);
  1181. dbg_msg("UUID: %02X%02X%02X%02X-%02X%02X"
  1182. "-%02X%02X-%02X%02X-%02X%02X%02X%02X%02X%02X",
  1183. c->uuid[0], c->uuid[1], c->uuid[2], c->uuid[3],
  1184. c->uuid[4], c->uuid[5], c->uuid[6], c->uuid[7],
  1185. c->uuid[8], c->uuid[9], c->uuid[10], c->uuid[11],
  1186. c->uuid[12], c->uuid[13], c->uuid[14], c->uuid[15]);
  1187. dbg_msg("fast unmount: %d", c->fast_unmount);
  1188. dbg_msg("big_lpt %d", c->big_lpt);
  1189. dbg_msg("log LEBs: %d (%d - %d)",
  1190. c->log_lebs, UBIFS_LOG_LNUM, c->log_last);
  1191. dbg_msg("LPT area LEBs: %d (%d - %d)",
  1192. c->lpt_lebs, c->lpt_first, c->lpt_last);
  1193. dbg_msg("orphan area LEBs: %d (%d - %d)",
  1194. c->orph_lebs, c->orph_first, c->orph_last);
  1195. dbg_msg("main area LEBs: %d (%d - %d)",
  1196. c->main_lebs, c->main_first, c->leb_cnt - 1);
  1197. dbg_msg("index LEBs: %d", c->lst.idx_lebs);
  1198. dbg_msg("total index bytes: %lld (%lld KiB, %lld MiB)",
  1199. c->old_idx_sz, c->old_idx_sz >> 10, c->old_idx_sz >> 20);
  1200. dbg_msg("key hash type: %d", c->key_hash_type);
  1201. dbg_msg("tree fanout: %d", c->fanout);
  1202. dbg_msg("reserved GC LEB: %d", c->gc_lnum);
  1203. dbg_msg("first main LEB: %d", c->main_first);
  1204. dbg_msg("max. znode size %d", c->max_znode_sz);
  1205. dbg_msg("max. index node size %d", c->max_idx_node_sz);
  1206. dbg_msg("node sizes: data %zu, inode %zu, dentry %zu",
  1207. UBIFS_DATA_NODE_SZ, UBIFS_INO_NODE_SZ, UBIFS_DENT_NODE_SZ);
  1208. dbg_msg("node sizes: trun %zu, sb %zu, master %zu",
  1209. UBIFS_TRUN_NODE_SZ, UBIFS_SB_NODE_SZ, UBIFS_MST_NODE_SZ);
  1210. dbg_msg("node sizes: ref %zu, cmt. start %zu, orph %zu",
  1211. UBIFS_REF_NODE_SZ, UBIFS_CS_NODE_SZ, UBIFS_ORPH_NODE_SZ);
  1212. dbg_msg("max. node sizes: data %zu, inode %zu dentry %zu",
  1213. UBIFS_MAX_DATA_NODE_SZ, UBIFS_MAX_INO_NODE_SZ,
  1214. UBIFS_MAX_DENT_NODE_SZ);
  1215. dbg_msg("dead watermark: %d", c->dead_wm);
  1216. dbg_msg("dark watermark: %d", c->dark_wm);
  1217. dbg_msg("LEB overhead: %d", c->leb_overhead);
  1218. x = (long long)c->main_lebs * c->dark_wm;
  1219. dbg_msg("max. dark space: %lld (%lld KiB, %lld MiB)",
  1220. x, x >> 10, x >> 20);
  1221. dbg_msg("maximum bud bytes: %lld (%lld KiB, %lld MiB)",
  1222. c->max_bud_bytes, c->max_bud_bytes >> 10,
  1223. c->max_bud_bytes >> 20);
  1224. dbg_msg("BG commit bud bytes: %lld (%lld KiB, %lld MiB)",
  1225. c->bg_bud_bytes, c->bg_bud_bytes >> 10,
  1226. c->bg_bud_bytes >> 20);
  1227. dbg_msg("current bud bytes %lld (%lld KiB, %lld MiB)",
  1228. c->bud_bytes, c->bud_bytes >> 10, c->bud_bytes >> 20);
  1229. dbg_msg("max. seq. number: %llu", c->max_sqnum);
  1230. dbg_msg("commit number: %llu", c->cmt_no);
  1231. return 0;
  1232. out_infos:
  1233. spin_lock(&ubifs_infos_lock);
  1234. list_del(&c->infos_list);
  1235. spin_unlock(&ubifs_infos_lock);
  1236. out_orphans:
  1237. free_orphans(c);
  1238. out_journal:
  1239. destroy_journal(c);
  1240. out_lpt:
  1241. ubifs_lpt_free(c, 0);
  1242. out_master:
  1243. kfree(c->mst_node);
  1244. kfree(c->rcvrd_mst_node);
  1245. if (c->bgt)
  1246. kthread_stop(c->bgt);
  1247. out_wbufs:
  1248. free_wbufs(c);
  1249. out_cbuf:
  1250. kfree(c->cbuf);
  1251. out_free:
  1252. kfree(c->bu.buf);
  1253. vfree(c->ileb_buf);
  1254. vfree(c->sbuf);
  1255. kfree(c->bottom_up_buf);
  1256. ubifs_debugging_exit(c);
  1257. return err;
  1258. }
  1259. /**
  1260. * ubifs_umount - un-mount UBIFS file-system.
  1261. * @c: UBIFS file-system description object
  1262. *
  1263. * Note, this function is called to free allocated resourced when un-mounting,
  1264. * as well as free resources when an error occurred while we were half way
  1265. * through mounting (error path cleanup function). So it has to make sure the
  1266. * resource was actually allocated before freeing it.
  1267. */
  1268. static void ubifs_umount(struct ubifs_info *c)
  1269. {
  1270. dbg_gen("un-mounting UBI device %d, volume %d", c->vi.ubi_num,
  1271. c->vi.vol_id);
  1272. dbg_debugfs_exit_fs(c);
  1273. spin_lock(&ubifs_infos_lock);
  1274. list_del(&c->infos_list);
  1275. spin_unlock(&ubifs_infos_lock);
  1276. if (c->bgt)
  1277. kthread_stop(c->bgt);
  1278. destroy_journal(c);
  1279. free_wbufs(c);
  1280. free_orphans(c);
  1281. ubifs_lpt_free(c, 0);
  1282. kfree(c->cbuf);
  1283. kfree(c->rcvrd_mst_node);
  1284. kfree(c->mst_node);
  1285. kfree(c->bu.buf);
  1286. vfree(c->ileb_buf);
  1287. vfree(c->sbuf);
  1288. kfree(c->bottom_up_buf);
  1289. ubifs_debugging_exit(c);
  1290. }
  1291. /**
  1292. * ubifs_remount_rw - re-mount in read-write mode.
  1293. * @c: UBIFS file-system description object
  1294. *
  1295. * UBIFS avoids allocating many unnecessary resources when mounted in read-only
  1296. * mode. This function allocates the needed resources and re-mounts UBIFS in
  1297. * read-write mode.
  1298. */
  1299. static int ubifs_remount_rw(struct ubifs_info *c)
  1300. {
  1301. int err, lnum;
  1302. if (c->ro_media)
  1303. return -EINVAL;
  1304. mutex_lock(&c->umount_mutex);
  1305. c->remounting_rw = 1;
  1306. c->always_chk_crc = 1;
  1307. err = check_free_space(c);
  1308. if (err)
  1309. goto out;
  1310. if (c->old_leb_cnt != c->leb_cnt) {
  1311. struct ubifs_sb_node *sup;
  1312. sup = ubifs_read_sb_node(c);
  1313. if (IS_ERR(sup)) {
  1314. err = PTR_ERR(sup);
  1315. goto out;
  1316. }
  1317. sup->leb_cnt = cpu_to_le32(c->leb_cnt);
  1318. err = ubifs_write_sb_node(c, sup);
  1319. if (err)
  1320. goto out;
  1321. }
  1322. if (c->need_recovery) {
  1323. ubifs_msg("completing deferred recovery");
  1324. err = ubifs_write_rcvrd_mst_node(c);
  1325. if (err)
  1326. goto out;
  1327. err = ubifs_recover_size(c);
  1328. if (err)
  1329. goto out;
  1330. err = ubifs_clean_lebs(c, c->sbuf);
  1331. if (err)
  1332. goto out;
  1333. err = ubifs_recover_inl_heads(c, c->sbuf);
  1334. if (err)
  1335. goto out;
  1336. }
  1337. if (!(c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY))) {
  1338. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1339. err = ubifs_write_master(c);
  1340. if (err)
  1341. goto out;
  1342. }
  1343. c->ileb_buf = vmalloc(c->leb_size);
  1344. if (!c->ileb_buf) {
  1345. err = -ENOMEM;
  1346. goto out;
  1347. }
  1348. err = ubifs_lpt_init(c, 0, 1);
  1349. if (err)
  1350. goto out;
  1351. err = alloc_wbufs(c);
  1352. if (err)
  1353. goto out;
  1354. ubifs_create_buds_lists(c);
  1355. /* Create background thread */
  1356. c->bgt = kthread_create(ubifs_bg_thread, c, c->bgt_name);
  1357. if (IS_ERR(c->bgt)) {
  1358. err = PTR_ERR(c->bgt);
  1359. c->bgt = NULL;
  1360. ubifs_err("cannot spawn \"%s\", error %d",
  1361. c->bgt_name, err);
  1362. goto out;
  1363. }
  1364. wake_up_process(c->bgt);
  1365. c->orph_buf = vmalloc(c->leb_size);
  1366. if (!c->orph_buf) {
  1367. err = -ENOMEM;
  1368. goto out;
  1369. }
  1370. /* Check for enough log space */
  1371. lnum = c->lhead_lnum + 1;
  1372. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1373. lnum = UBIFS_LOG_LNUM;
  1374. if (lnum == c->ltail_lnum) {
  1375. err = ubifs_consolidate_log(c);
  1376. if (err)
  1377. goto out;
  1378. }
  1379. if (c->need_recovery)
  1380. err = ubifs_rcvry_gc_commit(c);
  1381. else
  1382. err = take_gc_lnum(c);
  1383. if (err)
  1384. goto out;
  1385. if (c->need_recovery) {
  1386. c->need_recovery = 0;
  1387. ubifs_msg("deferred recovery completed");
  1388. }
  1389. dbg_gen("re-mounted read-write");
  1390. c->vfs_sb->s_flags &= ~MS_RDONLY;
  1391. c->remounting_rw = 0;
  1392. c->always_chk_crc = 0;
  1393. mutex_unlock(&c->umount_mutex);
  1394. return 0;
  1395. out:
  1396. vfree(c->orph_buf);
  1397. c->orph_buf = NULL;
  1398. if (c->bgt) {
  1399. kthread_stop(c->bgt);
  1400. c->bgt = NULL;
  1401. }
  1402. free_wbufs(c);
  1403. vfree(c->ileb_buf);
  1404. c->ileb_buf = NULL;
  1405. ubifs_lpt_free(c, 1);
  1406. c->remounting_rw = 0;
  1407. c->always_chk_crc = 0;
  1408. mutex_unlock(&c->umount_mutex);
  1409. return err;
  1410. }
  1411. /**
  1412. * commit_on_unmount - commit the journal when un-mounting.
  1413. * @c: UBIFS file-system description object
  1414. *
  1415. * This function is called during un-mounting and re-mounting, and it commits
  1416. * the journal unless the "fast unmount" mode is enabled.
  1417. */
  1418. static void commit_on_unmount(struct ubifs_info *c)
  1419. {
  1420. struct super_block *sb = c->vfs_sb;
  1421. long long bud_bytes;
  1422. /*
  1423. * This function is called before the background thread is stopped, so
  1424. * we may race with ongoing commit, which means we have to take
  1425. * @c->bud_lock to access @c->bud_bytes.
  1426. */
  1427. spin_lock(&c->buds_lock);
  1428. bud_bytes = c->bud_bytes;
  1429. spin_unlock(&c->buds_lock);
  1430. if (!c->fast_unmount && !(sb->s_flags & MS_RDONLY) && bud_bytes)
  1431. ubifs_run_commit(c);
  1432. }
  1433. /**
  1434. * ubifs_remount_ro - re-mount in read-only mode.
  1435. * @c: UBIFS file-system description object
  1436. *
  1437. * We rely on VFS to have stopped writing. Possibly the background thread could
  1438. * be running a commit, however kthread_stop will wait in that case.
  1439. */
  1440. static void ubifs_remount_ro(struct ubifs_info *c)
  1441. {
  1442. int i, err;
  1443. ubifs_assert(!c->need_recovery);
  1444. commit_on_unmount(c);
  1445. mutex_lock(&c->umount_mutex);
  1446. if (c->bgt) {
  1447. kthread_stop(c->bgt);
  1448. c->bgt = NULL;
  1449. }
  1450. for (i = 0; i < c->jhead_cnt; i++) {
  1451. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1452. del_timer_sync(&c->jheads[i].wbuf.timer);
  1453. }
  1454. if (!c->ro_media) {
  1455. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1456. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1457. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1458. err = ubifs_write_master(c);
  1459. if (err)
  1460. ubifs_ro_mode(c, err);
  1461. }
  1462. ubifs_destroy_idx_gc(c);
  1463. free_wbufs(c);
  1464. vfree(c->orph_buf);
  1465. c->orph_buf = NULL;
  1466. vfree(c->ileb_buf);
  1467. c->ileb_buf = NULL;
  1468. ubifs_lpt_free(c, 1);
  1469. mutex_unlock(&c->umount_mutex);
  1470. }
  1471. static void ubifs_put_super(struct super_block *sb)
  1472. {
  1473. int i;
  1474. struct ubifs_info *c = sb->s_fs_info;
  1475. ubifs_msg("un-mount UBI device %d, volume %d", c->vi.ubi_num,
  1476. c->vi.vol_id);
  1477. /*
  1478. * The following asserts are only valid if there has not been a failure
  1479. * of the media. For example, there will be dirty inodes if we failed
  1480. * to write them back because of I/O errors.
  1481. */
  1482. ubifs_assert(atomic_long_read(&c->dirty_pg_cnt) == 0);
  1483. ubifs_assert(c->budg_idx_growth == 0);
  1484. ubifs_assert(c->budg_dd_growth == 0);
  1485. ubifs_assert(c->budg_data_growth == 0);
  1486. /*
  1487. * The 'c->umount_lock' prevents races between UBIFS memory shrinker
  1488. * and file system un-mount. Namely, it prevents the shrinker from
  1489. * picking this superblock for shrinking - it will be just skipped if
  1490. * the mutex is locked.
  1491. */
  1492. mutex_lock(&c->umount_mutex);
  1493. if (!(c->vfs_sb->s_flags & MS_RDONLY)) {
  1494. /*
  1495. * First of all kill the background thread to make sure it does
  1496. * not interfere with un-mounting and freeing resources.
  1497. */
  1498. if (c->bgt) {
  1499. kthread_stop(c->bgt);
  1500. c->bgt = NULL;
  1501. }
  1502. /* Synchronize write-buffers */
  1503. if (c->jheads)
  1504. for (i = 0; i < c->jhead_cnt; i++) {
  1505. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1506. del_timer_sync(&c->jheads[i].wbuf.timer);
  1507. }
  1508. /*
  1509. * On fatal errors c->ro_media is set to 1, in which case we do
  1510. * not write the master node.
  1511. */
  1512. if (!c->ro_media) {
  1513. /*
  1514. * We are being cleanly unmounted which means the
  1515. * orphans were killed - indicate this in the master
  1516. * node. Also save the reserved GC LEB number.
  1517. */
  1518. int err;
  1519. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1520. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1521. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1522. err = ubifs_write_master(c);
  1523. if (err)
  1524. /*
  1525. * Recovery will attempt to fix the master area
  1526. * next mount, so we just print a message and
  1527. * continue to unmount normally.
  1528. */
  1529. ubifs_err("failed to write master node, "
  1530. "error %d", err);
  1531. }
  1532. }
  1533. ubifs_umount(c);
  1534. bdi_destroy(&c->bdi);
  1535. ubi_close_volume(c->ubi);
  1536. mutex_unlock(&c->umount_mutex);
  1537. kfree(c);
  1538. }
  1539. static int ubifs_remount_fs(struct super_block *sb, int *flags, char *data)
  1540. {
  1541. int err;
  1542. struct ubifs_info *c = sb->s_fs_info;
  1543. dbg_gen("old flags %#lx, new flags %#x", sb->s_flags, *flags);
  1544. err = ubifs_parse_options(c, data, 1);
  1545. if (err) {
  1546. ubifs_err("invalid or unknown remount parameter");
  1547. return err;
  1548. }
  1549. if ((sb->s_flags & MS_RDONLY) && !(*flags & MS_RDONLY)) {
  1550. err = ubifs_remount_rw(c);
  1551. if (err)
  1552. return err;
  1553. } else if (!(sb->s_flags & MS_RDONLY) && (*flags & MS_RDONLY))
  1554. ubifs_remount_ro(c);
  1555. if (c->bulk_read == 1)
  1556. bu_init(c);
  1557. else {
  1558. dbg_gen("disable bulk-read");
  1559. kfree(c->bu.buf);
  1560. c->bu.buf = NULL;
  1561. }
  1562. return 0;
  1563. }
  1564. struct super_operations ubifs_super_operations = {
  1565. .alloc_inode = ubifs_alloc_inode,
  1566. .destroy_inode = ubifs_destroy_inode,
  1567. .put_super = ubifs_put_super,
  1568. .write_inode = ubifs_write_inode,
  1569. .delete_inode = ubifs_delete_inode,
  1570. .statfs = ubifs_statfs,
  1571. .dirty_inode = ubifs_dirty_inode,
  1572. .remount_fs = ubifs_remount_fs,
  1573. .show_options = ubifs_show_options,
  1574. .sync_fs = ubifs_sync_fs,
  1575. };
  1576. /**
  1577. * open_ubi - parse UBI device name string and open the UBI device.
  1578. * @name: UBI volume name
  1579. * @mode: UBI volume open mode
  1580. *
  1581. * There are several ways to specify UBI volumes when mounting UBIFS:
  1582. * o ubiX_Y - UBI device number X, volume Y;
  1583. * o ubiY - UBI device number 0, volume Y;
  1584. * o ubiX:NAME - mount UBI device X, volume with name NAME;
  1585. * o ubi:NAME - mount UBI device 0, volume with name NAME.
  1586. *
  1587. * Alternative '!' separator may be used instead of ':' (because some shells
  1588. * like busybox may interpret ':' as an NFS host name separator). This function
  1589. * returns ubi volume object in case of success and a negative error code in
  1590. * case of failure.
  1591. */
  1592. static struct ubi_volume_desc *open_ubi(const char *name, int mode)
  1593. {
  1594. int dev, vol;
  1595. char *endptr;
  1596. if (name[0] != 'u' || name[1] != 'b' || name[2] != 'i')
  1597. return ERR_PTR(-EINVAL);
  1598. /* ubi:NAME method */
  1599. if ((name[3] == ':' || name[3] == '!') && name[4] != '\0')
  1600. return ubi_open_volume_nm(0, name + 4, mode);
  1601. if (!isdigit(name[3]))
  1602. return ERR_PTR(-EINVAL);
  1603. dev = simple_strtoul(name + 3, &endptr, 0);
  1604. /* ubiY method */
  1605. if (*endptr == '\0')
  1606. return ubi_open_volume(0, dev, mode);
  1607. /* ubiX_Y method */
  1608. if (*endptr == '_' && isdigit(endptr[1])) {
  1609. vol = simple_strtoul(endptr + 1, &endptr, 0);
  1610. if (*endptr != '\0')
  1611. return ERR_PTR(-EINVAL);
  1612. return ubi_open_volume(dev, vol, mode);
  1613. }
  1614. /* ubiX:NAME method */
  1615. if ((*endptr == ':' || *endptr == '!') && endptr[1] != '\0')
  1616. return ubi_open_volume_nm(dev, ++endptr, mode);
  1617. return ERR_PTR(-EINVAL);
  1618. }
  1619. static int ubifs_fill_super(struct super_block *sb, void *data, int silent)
  1620. {
  1621. struct ubi_volume_desc *ubi = sb->s_fs_info;
  1622. struct ubifs_info *c;
  1623. struct inode *root;
  1624. int err;
  1625. c = kzalloc(sizeof(struct ubifs_info), GFP_KERNEL);
  1626. if (!c)
  1627. return -ENOMEM;
  1628. spin_lock_init(&c->cnt_lock);
  1629. spin_lock_init(&c->cs_lock);
  1630. spin_lock_init(&c->buds_lock);
  1631. spin_lock_init(&c->space_lock);
  1632. spin_lock_init(&c->orphan_lock);
  1633. init_rwsem(&c->commit_sem);
  1634. mutex_init(&c->lp_mutex);
  1635. mutex_init(&c->tnc_mutex);
  1636. mutex_init(&c->log_mutex);
  1637. mutex_init(&c->mst_mutex);
  1638. mutex_init(&c->umount_mutex);
  1639. mutex_init(&c->bu_mutex);
  1640. init_waitqueue_head(&c->cmt_wq);
  1641. c->buds = RB_ROOT;
  1642. c->old_idx = RB_ROOT;
  1643. c->size_tree = RB_ROOT;
  1644. c->orph_tree = RB_ROOT;
  1645. INIT_LIST_HEAD(&c->infos_list);
  1646. INIT_LIST_HEAD(&c->idx_gc);
  1647. INIT_LIST_HEAD(&c->replay_list);
  1648. INIT_LIST_HEAD(&c->replay_buds);
  1649. INIT_LIST_HEAD(&c->uncat_list);
  1650. INIT_LIST_HEAD(&c->empty_list);
  1651. INIT_LIST_HEAD(&c->freeable_list);
  1652. INIT_LIST_HEAD(&c->frdi_idx_list);
  1653. INIT_LIST_HEAD(&c->unclean_leb_list);
  1654. INIT_LIST_HEAD(&c->old_buds);
  1655. INIT_LIST_HEAD(&c->orph_list);
  1656. INIT_LIST_HEAD(&c->orph_new);
  1657. c->highest_inum = UBIFS_FIRST_INO;
  1658. c->lhead_lnum = c->ltail_lnum = UBIFS_LOG_LNUM;
  1659. ubi_get_volume_info(ubi, &c->vi);
  1660. ubi_get_device_info(c->vi.ubi_num, &c->di);
  1661. /* Re-open the UBI device in read-write mode */
  1662. c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READWRITE);
  1663. if (IS_ERR(c->ubi)) {
  1664. err = PTR_ERR(c->ubi);
  1665. goto out_free;
  1666. }
  1667. /*
  1668. * UBIFS provides 'backing_dev_info' in order to disable read-ahead. For
  1669. * UBIFS, I/O is not deferred, it is done immediately in readpage,
  1670. * which means the user would have to wait not just for their own I/O
  1671. * but the read-ahead I/O as well i.e. completely pointless.
  1672. *
  1673. * Read-ahead will be disabled because @c->bdi.ra_pages is 0.
  1674. */
  1675. c->bdi.capabilities = BDI_CAP_MAP_COPY;
  1676. c->bdi.unplug_io_fn = default_unplug_io_fn;
  1677. err = bdi_init(&c->bdi);
  1678. if (err)
  1679. goto out_close;
  1680. err = ubifs_parse_options(c, data, 0);
  1681. if (err)
  1682. goto out_bdi;
  1683. c->vfs_sb = sb;
  1684. sb->s_fs_info = c;
  1685. sb->s_magic = UBIFS_SUPER_MAGIC;
  1686. sb->s_blocksize = UBIFS_BLOCK_SIZE;
  1687. sb->s_blocksize_bits = UBIFS_BLOCK_SHIFT;
  1688. sb->s_dev = c->vi.cdev;
  1689. sb->s_maxbytes = c->max_inode_sz = key_max_inode_size(c);
  1690. if (c->max_inode_sz > MAX_LFS_FILESIZE)
  1691. sb->s_maxbytes = c->max_inode_sz = MAX_LFS_FILESIZE;
  1692. sb->s_op = &ubifs_super_operations;
  1693. mutex_lock(&c->umount_mutex);
  1694. err = mount_ubifs(c);
  1695. if (err) {
  1696. ubifs_assert(err < 0);
  1697. goto out_unlock;
  1698. }
  1699. /* Read the root inode */
  1700. root = ubifs_iget(sb, UBIFS_ROOT_INO);
  1701. if (IS_ERR(root)) {
  1702. err = PTR_ERR(root);
  1703. goto out_umount;
  1704. }
  1705. sb->s_root = d_alloc_root(root);
  1706. if (!sb->s_root)
  1707. goto out_iput;
  1708. mutex_unlock(&c->umount_mutex);
  1709. return 0;
  1710. out_iput:
  1711. iput(root);
  1712. out_umount:
  1713. ubifs_umount(c);
  1714. out_unlock:
  1715. mutex_unlock(&c->umount_mutex);
  1716. out_bdi:
  1717. bdi_destroy(&c->bdi);
  1718. out_close:
  1719. ubi_close_volume(c->ubi);
  1720. out_free:
  1721. kfree(c);
  1722. return err;
  1723. }
  1724. static int sb_test(struct super_block *sb, void *data)
  1725. {
  1726. dev_t *dev = data;
  1727. return sb->s_dev == *dev;
  1728. }
  1729. static int sb_set(struct super_block *sb, void *data)
  1730. {
  1731. dev_t *dev = data;
  1732. sb->s_dev = *dev;
  1733. return 0;
  1734. }
  1735. static int ubifs_get_sb(struct file_system_type *fs_type, int flags,
  1736. const char *name, void *data, struct vfsmount *mnt)
  1737. {
  1738. struct ubi_volume_desc *ubi;
  1739. struct ubi_volume_info vi;
  1740. struct super_block *sb;
  1741. int err;
  1742. dbg_gen("name %s, flags %#x", name, flags);
  1743. /*
  1744. * Get UBI device number and volume ID. Mount it read-only so far
  1745. * because this might be a new mount point, and UBI allows only one
  1746. * read-write user at a time.
  1747. */
  1748. ubi = open_ubi(name, UBI_READONLY);
  1749. if (IS_ERR(ubi)) {
  1750. ubifs_err("cannot open \"%s\", error %d",
  1751. name, (int)PTR_ERR(ubi));
  1752. return PTR_ERR(ubi);
  1753. }
  1754. ubi_get_volume_info(ubi, &vi);
  1755. dbg_gen("opened ubi%d_%d", vi.ubi_num, vi.vol_id);
  1756. sb = sget(fs_type, &sb_test, &sb_set, &vi.cdev);
  1757. if (IS_ERR(sb)) {
  1758. err = PTR_ERR(sb);
  1759. goto out_close;
  1760. }
  1761. if (sb->s_root) {
  1762. /* A new mount point for already mounted UBIFS */
  1763. dbg_gen("this ubi volume is already mounted");
  1764. if ((flags ^ sb->s_flags) & MS_RDONLY) {
  1765. err = -EBUSY;
  1766. goto out_deact;
  1767. }
  1768. } else {
  1769. sb->s_flags = flags;
  1770. /*
  1771. * Pass 'ubi' to 'fill_super()' in sb->s_fs_info where it is
  1772. * replaced by 'c'.
  1773. */
  1774. sb->s_fs_info = ubi;
  1775. err = ubifs_fill_super(sb, data, flags & MS_SILENT ? 1 : 0);
  1776. if (err)
  1777. goto out_deact;
  1778. /* We do not support atime */
  1779. sb->s_flags |= MS_ACTIVE | MS_NOATIME;
  1780. }
  1781. /* 'fill_super()' opens ubi again so we must close it here */
  1782. ubi_close_volume(ubi);
  1783. return simple_set_mnt(mnt, sb);
  1784. out_deact:
  1785. up_write(&sb->s_umount);
  1786. deactivate_super(sb);
  1787. out_close:
  1788. ubi_close_volume(ubi);
  1789. return err;
  1790. }
  1791. static void ubifs_kill_sb(struct super_block *sb)
  1792. {
  1793. struct ubifs_info *c = sb->s_fs_info;
  1794. /*
  1795. * We do 'commit_on_unmount()' here instead of 'ubifs_put_super()'
  1796. * in order to be outside BKL.
  1797. */
  1798. if (sb->s_root)
  1799. commit_on_unmount(c);
  1800. /* The un-mount routine is actually done in put_super() */
  1801. generic_shutdown_super(sb);
  1802. }
  1803. static struct file_system_type ubifs_fs_type = {
  1804. .name = "ubifs",
  1805. .owner = THIS_MODULE,
  1806. .get_sb = ubifs_get_sb,
  1807. .kill_sb = ubifs_kill_sb
  1808. };
  1809. /*
  1810. * Inode slab cache constructor.
  1811. */
  1812. static void inode_slab_ctor(void *obj)
  1813. {
  1814. struct ubifs_inode *ui = obj;
  1815. inode_init_once(&ui->vfs_inode);
  1816. }
  1817. static int __init ubifs_init(void)
  1818. {
  1819. int err;
  1820. BUILD_BUG_ON(sizeof(struct ubifs_ch) != 24);
  1821. /* Make sure node sizes are 8-byte aligned */
  1822. BUILD_BUG_ON(UBIFS_CH_SZ & 7);
  1823. BUILD_BUG_ON(UBIFS_INO_NODE_SZ & 7);
  1824. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ & 7);
  1825. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ & 7);
  1826. BUILD_BUG_ON(UBIFS_DATA_NODE_SZ & 7);
  1827. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ & 7);
  1828. BUILD_BUG_ON(UBIFS_SB_NODE_SZ & 7);
  1829. BUILD_BUG_ON(UBIFS_MST_NODE_SZ & 7);
  1830. BUILD_BUG_ON(UBIFS_REF_NODE_SZ & 7);
  1831. BUILD_BUG_ON(UBIFS_CS_NODE_SZ & 7);
  1832. BUILD_BUG_ON(UBIFS_ORPH_NODE_SZ & 7);
  1833. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ & 7);
  1834. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ & 7);
  1835. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ & 7);
  1836. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ & 7);
  1837. BUILD_BUG_ON(UBIFS_MAX_NODE_SZ & 7);
  1838. BUILD_BUG_ON(MIN_WRITE_SZ & 7);
  1839. /* Check min. node size */
  1840. BUILD_BUG_ON(UBIFS_INO_NODE_SZ < MIN_WRITE_SZ);
  1841. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ < MIN_WRITE_SZ);
  1842. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ < MIN_WRITE_SZ);
  1843. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ < MIN_WRITE_SZ);
  1844. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  1845. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  1846. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ > UBIFS_MAX_NODE_SZ);
  1847. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ > UBIFS_MAX_NODE_SZ);
  1848. /* Defined node sizes */
  1849. BUILD_BUG_ON(UBIFS_SB_NODE_SZ != 4096);
  1850. BUILD_BUG_ON(UBIFS_MST_NODE_SZ != 512);
  1851. BUILD_BUG_ON(UBIFS_INO_NODE_SZ != 160);
  1852. BUILD_BUG_ON(UBIFS_REF_NODE_SZ != 64);
  1853. /*
  1854. * We use 2 bit wide bit-fields to store compression type, which should
  1855. * be amended if more compressors are added. The bit-fields are:
  1856. * @compr_type in 'struct ubifs_inode', @default_compr in
  1857. * 'struct ubifs_info' and @compr_type in 'struct ubifs_mount_opts'.
  1858. */
  1859. BUILD_BUG_ON(UBIFS_COMPR_TYPES_CNT > 4);
  1860. /*
  1861. * We require that PAGE_CACHE_SIZE is greater-than-or-equal-to
  1862. * UBIFS_BLOCK_SIZE. It is assumed that both are powers of 2.
  1863. */
  1864. if (PAGE_CACHE_SIZE < UBIFS_BLOCK_SIZE) {
  1865. ubifs_err("VFS page cache size is %u bytes, but UBIFS requires"
  1866. " at least 4096 bytes",
  1867. (unsigned int)PAGE_CACHE_SIZE);
  1868. return -EINVAL;
  1869. }
  1870. err = register_filesystem(&ubifs_fs_type);
  1871. if (err) {
  1872. ubifs_err("cannot register file system, error %d", err);
  1873. return err;
  1874. }
  1875. err = -ENOMEM;
  1876. ubifs_inode_slab = kmem_cache_create("ubifs_inode_slab",
  1877. sizeof(struct ubifs_inode), 0,
  1878. SLAB_MEM_SPREAD | SLAB_RECLAIM_ACCOUNT,
  1879. &inode_slab_ctor);
  1880. if (!ubifs_inode_slab)
  1881. goto out_reg;
  1882. register_shrinker(&ubifs_shrinker_info);
  1883. err = ubifs_compressors_init();
  1884. if (err)
  1885. goto out_shrinker;
  1886. err = dbg_debugfs_init();
  1887. if (err)
  1888. goto out_compr;
  1889. return 0;
  1890. out_compr:
  1891. ubifs_compressors_exit();
  1892. out_shrinker:
  1893. unregister_shrinker(&ubifs_shrinker_info);
  1894. kmem_cache_destroy(ubifs_inode_slab);
  1895. out_reg:
  1896. unregister_filesystem(&ubifs_fs_type);
  1897. return err;
  1898. }
  1899. /* late_initcall to let compressors initialize first */
  1900. late_initcall(ubifs_init);
  1901. static void __exit ubifs_exit(void)
  1902. {
  1903. ubifs_assert(list_empty(&ubifs_infos));
  1904. ubifs_assert(atomic_long_read(&ubifs_clean_zn_cnt) == 0);
  1905. dbg_debugfs_exit();
  1906. ubifs_compressors_exit();
  1907. unregister_shrinker(&ubifs_shrinker_info);
  1908. kmem_cache_destroy(ubifs_inode_slab);
  1909. unregister_filesystem(&ubifs_fs_type);
  1910. }
  1911. module_exit(ubifs_exit);
  1912. MODULE_LICENSE("GPL");
  1913. MODULE_VERSION(__stringify(UBIFS_VERSION));
  1914. MODULE_AUTHOR("Artem Bityutskiy, Adrian Hunter");
  1915. MODULE_DESCRIPTION("UBIFS - UBI File System");