super.c 60 KB

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