super.c 60 KB

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