super.c 58 KB

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