super.c 59 KB

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