super.c 57 KB

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