super.c 67 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704
  1. /*
  2. * This file is part of UBIFS.
  3. *
  4. * Copyright (C) 2006-2008 Nokia Corporation.
  5. *
  6. * SPDX-License-Identifier: GPL-2.0+
  7. *
  8. * Authors: Artem Bityutskiy (Битюцкий Артём)
  9. * Adrian Hunter
  10. */
  11. /*
  12. * This file implements UBIFS initialization and VFS superblock operations. Some
  13. * initialization stuff which is rather large and complex is placed at
  14. * corresponding subsystems, but most of it is here.
  15. */
  16. #ifndef __UBOOT__
  17. #include <linux/init.h>
  18. #include <linux/slab.h>
  19. #include <linux/module.h>
  20. #include <linux/ctype.h>
  21. #include <linux/kthread.h>
  22. #include <linux/parser.h>
  23. #include <linux/seq_file.h>
  24. #include <linux/mount.h>
  25. #include <linux/math64.h>
  26. #include <linux/writeback.h>
  27. #else
  28. #include <common.h>
  29. #include <malloc.h>
  30. #include <memalign.h>
  31. #include <linux/bug.h>
  32. #include <linux/log2.h>
  33. #include <linux/stat.h>
  34. #include <linux/err.h>
  35. #include "ubifs.h"
  36. #include <ubi_uboot.h>
  37. #include <mtd/ubi-user.h>
  38. struct dentry;
  39. struct file;
  40. struct iattr;
  41. struct kstat;
  42. struct vfsmount;
  43. #define INODE_LOCKED_MAX 64
  44. struct super_block *ubifs_sb;
  45. static struct inode *inodes_locked_down[INODE_LOCKED_MAX];
  46. int set_anon_super(struct super_block *s, void *data)
  47. {
  48. return 0;
  49. }
  50. struct inode *iget_locked(struct super_block *sb, unsigned long ino)
  51. {
  52. struct inode *inode;
  53. inode = (struct inode *)malloc_cache_aligned(
  54. sizeof(struct ubifs_inode));
  55. if (inode) {
  56. inode->i_ino = ino;
  57. inode->i_sb = sb;
  58. list_add(&inode->i_sb_list, &sb->s_inodes);
  59. inode->i_state = I_LOCK | I_NEW;
  60. }
  61. return inode;
  62. }
  63. void iget_failed(struct inode *inode)
  64. {
  65. }
  66. int ubifs_iput(struct inode *inode)
  67. {
  68. list_del_init(&inode->i_sb_list);
  69. free(inode);
  70. return 0;
  71. }
  72. /*
  73. * Lock (save) inode in inode array for readback after recovery
  74. */
  75. void iput(struct inode *inode)
  76. {
  77. int i;
  78. struct inode *ino;
  79. /*
  80. * Search end of list
  81. */
  82. for (i = 0; i < INODE_LOCKED_MAX; i++) {
  83. if (inodes_locked_down[i] == NULL)
  84. break;
  85. }
  86. if (i >= INODE_LOCKED_MAX) {
  87. dbg_gen("Error, can't lock (save) more inodes while recovery!!!");
  88. return;
  89. }
  90. /*
  91. * Allocate and use new inode
  92. */
  93. ino = (struct inode *)malloc_cache_aligned(sizeof(struct ubifs_inode));
  94. memcpy(ino, inode, sizeof(struct ubifs_inode));
  95. /*
  96. * Finally save inode in array
  97. */
  98. inodes_locked_down[i] = ino;
  99. }
  100. /* from fs/inode.c */
  101. /**
  102. * clear_nlink - directly zero an inode's link count
  103. * @inode: inode
  104. *
  105. * This is a low-level filesystem helper to replace any
  106. * direct filesystem manipulation of i_nlink. See
  107. * drop_nlink() for why we care about i_nlink hitting zero.
  108. */
  109. void clear_nlink(struct inode *inode)
  110. {
  111. if (inode->i_nlink) {
  112. inode->__i_nlink = 0;
  113. atomic_long_inc(&inode->i_sb->s_remove_count);
  114. }
  115. }
  116. EXPORT_SYMBOL(clear_nlink);
  117. /**
  118. * set_nlink - directly set an inode's link count
  119. * @inode: inode
  120. * @nlink: new nlink (should be non-zero)
  121. *
  122. * This is a low-level filesystem helper to replace any
  123. * direct filesystem manipulation of i_nlink.
  124. */
  125. void set_nlink(struct inode *inode, unsigned int nlink)
  126. {
  127. if (!nlink) {
  128. clear_nlink(inode);
  129. } else {
  130. /* Yes, some filesystems do change nlink from zero to one */
  131. if (inode->i_nlink == 0)
  132. atomic_long_dec(&inode->i_sb->s_remove_count);
  133. inode->__i_nlink = nlink;
  134. }
  135. }
  136. EXPORT_SYMBOL(set_nlink);
  137. /* from include/linux/fs.h */
  138. static inline void i_uid_write(struct inode *inode, uid_t uid)
  139. {
  140. inode->i_uid.val = uid;
  141. }
  142. static inline void i_gid_write(struct inode *inode, gid_t gid)
  143. {
  144. inode->i_gid.val = gid;
  145. }
  146. void unlock_new_inode(struct inode *inode)
  147. {
  148. return;
  149. }
  150. #endif
  151. /*
  152. * Maximum amount of memory we may 'kmalloc()' without worrying that we are
  153. * allocating too much.
  154. */
  155. #define UBIFS_KMALLOC_OK (128*1024)
  156. /* Slab cache for UBIFS inodes */
  157. struct kmem_cache *ubifs_inode_slab;
  158. #ifndef __UBOOT__
  159. /* UBIFS TNC shrinker description */
  160. static struct shrinker ubifs_shrinker_info = {
  161. .scan_objects = ubifs_shrink_scan,
  162. .count_objects = ubifs_shrink_count,
  163. .seeks = DEFAULT_SEEKS,
  164. };
  165. #endif
  166. /**
  167. * validate_inode - validate inode.
  168. * @c: UBIFS file-system description object
  169. * @inode: the inode to validate
  170. *
  171. * This is a helper function for 'ubifs_iget()' which validates various fields
  172. * of a newly built inode to make sure they contain sane values and prevent
  173. * possible vulnerabilities. Returns zero if the inode is all right and
  174. * a non-zero error code if not.
  175. */
  176. static int validate_inode(struct ubifs_info *c, const struct inode *inode)
  177. {
  178. int err;
  179. const struct ubifs_inode *ui = ubifs_inode(inode);
  180. if (inode->i_size > c->max_inode_sz) {
  181. ubifs_err(c, "inode is too large (%lld)",
  182. (long long)inode->i_size);
  183. return 1;
  184. }
  185. if (ui->compr_type >= UBIFS_COMPR_TYPES_CNT) {
  186. ubifs_err(c, "unknown compression type %d", ui->compr_type);
  187. return 2;
  188. }
  189. if (ui->xattr_names + ui->xattr_cnt > XATTR_LIST_MAX)
  190. return 3;
  191. if (ui->data_len < 0 || ui->data_len > UBIFS_MAX_INO_DATA)
  192. return 4;
  193. if (ui->xattr && !S_ISREG(inode->i_mode))
  194. return 5;
  195. if (!ubifs_compr_present(ui->compr_type)) {
  196. ubifs_warn(c, "inode %lu uses '%s' compression, but it was not compiled in",
  197. inode->i_ino, ubifs_compr_name(ui->compr_type));
  198. }
  199. err = dbg_check_dir(c, inode);
  200. return err;
  201. }
  202. struct inode *ubifs_iget(struct super_block *sb, unsigned long inum)
  203. {
  204. int err;
  205. union ubifs_key key;
  206. struct ubifs_ino_node *ino;
  207. struct ubifs_info *c = sb->s_fs_info;
  208. struct inode *inode;
  209. struct ubifs_inode *ui;
  210. #ifdef __UBOOT__
  211. int i;
  212. #endif
  213. dbg_gen("inode %lu", inum);
  214. #ifdef __UBOOT__
  215. /*
  216. * U-Boot special handling of locked down inodes via recovery
  217. * e.g. ubifs_recover_size()
  218. */
  219. for (i = 0; i < INODE_LOCKED_MAX; i++) {
  220. /*
  221. * Exit on last entry (NULL), inode not found in list
  222. */
  223. if (inodes_locked_down[i] == NULL)
  224. break;
  225. if (inodes_locked_down[i]->i_ino == inum) {
  226. /*
  227. * We found the locked down inode in our array,
  228. * so just return this pointer instead of creating
  229. * a new one.
  230. */
  231. return inodes_locked_down[i];
  232. }
  233. }
  234. #endif
  235. inode = iget_locked(sb, inum);
  236. if (!inode)
  237. return ERR_PTR(-ENOMEM);
  238. if (!(inode->i_state & I_NEW))
  239. return inode;
  240. ui = ubifs_inode(inode);
  241. ino = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
  242. if (!ino) {
  243. err = -ENOMEM;
  244. goto out;
  245. }
  246. ino_key_init(c, &key, inode->i_ino);
  247. err = ubifs_tnc_lookup(c, &key, ino);
  248. if (err)
  249. goto out_ino;
  250. inode->i_flags |= (S_NOCMTIME | S_NOATIME);
  251. set_nlink(inode, le32_to_cpu(ino->nlink));
  252. i_uid_write(inode, le32_to_cpu(ino->uid));
  253. i_gid_write(inode, le32_to_cpu(ino->gid));
  254. inode->i_atime.tv_sec = (int64_t)le64_to_cpu(ino->atime_sec);
  255. inode->i_atime.tv_nsec = le32_to_cpu(ino->atime_nsec);
  256. inode->i_mtime.tv_sec = (int64_t)le64_to_cpu(ino->mtime_sec);
  257. inode->i_mtime.tv_nsec = le32_to_cpu(ino->mtime_nsec);
  258. inode->i_ctime.tv_sec = (int64_t)le64_to_cpu(ino->ctime_sec);
  259. inode->i_ctime.tv_nsec = le32_to_cpu(ino->ctime_nsec);
  260. inode->i_mode = le32_to_cpu(ino->mode);
  261. inode->i_size = le64_to_cpu(ino->size);
  262. ui->data_len = le32_to_cpu(ino->data_len);
  263. ui->flags = le32_to_cpu(ino->flags);
  264. ui->compr_type = le16_to_cpu(ino->compr_type);
  265. ui->creat_sqnum = le64_to_cpu(ino->creat_sqnum);
  266. ui->xattr_cnt = le32_to_cpu(ino->xattr_cnt);
  267. ui->xattr_size = le32_to_cpu(ino->xattr_size);
  268. ui->xattr_names = le32_to_cpu(ino->xattr_names);
  269. ui->synced_i_size = ui->ui_size = inode->i_size;
  270. ui->xattr = (ui->flags & UBIFS_XATTR_FL) ? 1 : 0;
  271. err = validate_inode(c, inode);
  272. if (err)
  273. goto out_invalid;
  274. #ifndef __UBOOT__
  275. switch (inode->i_mode & S_IFMT) {
  276. case S_IFREG:
  277. inode->i_mapping->a_ops = &ubifs_file_address_operations;
  278. inode->i_op = &ubifs_file_inode_operations;
  279. inode->i_fop = &ubifs_file_operations;
  280. if (ui->xattr) {
  281. ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
  282. if (!ui->data) {
  283. err = -ENOMEM;
  284. goto out_ino;
  285. }
  286. memcpy(ui->data, ino->data, ui->data_len);
  287. ((char *)ui->data)[ui->data_len] = '\0';
  288. } else if (ui->data_len != 0) {
  289. err = 10;
  290. goto out_invalid;
  291. }
  292. break;
  293. case S_IFDIR:
  294. inode->i_op = &ubifs_dir_inode_operations;
  295. inode->i_fop = &ubifs_dir_operations;
  296. if (ui->data_len != 0) {
  297. err = 11;
  298. goto out_invalid;
  299. }
  300. break;
  301. case S_IFLNK:
  302. inode->i_op = &ubifs_symlink_inode_operations;
  303. if (ui->data_len <= 0 || ui->data_len > UBIFS_MAX_INO_DATA) {
  304. err = 12;
  305. goto out_invalid;
  306. }
  307. ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
  308. if (!ui->data) {
  309. err = -ENOMEM;
  310. goto out_ino;
  311. }
  312. memcpy(ui->data, ino->data, ui->data_len);
  313. ((char *)ui->data)[ui->data_len] = '\0';
  314. inode->i_link = ui->data;
  315. break;
  316. case S_IFBLK:
  317. case S_IFCHR:
  318. {
  319. dev_t rdev;
  320. union ubifs_dev_desc *dev;
  321. ui->data = kmalloc(sizeof(union ubifs_dev_desc), GFP_NOFS);
  322. if (!ui->data) {
  323. err = -ENOMEM;
  324. goto out_ino;
  325. }
  326. dev = (union ubifs_dev_desc *)ino->data;
  327. if (ui->data_len == sizeof(dev->new))
  328. rdev = new_decode_dev(le32_to_cpu(dev->new));
  329. else if (ui->data_len == sizeof(dev->huge))
  330. rdev = huge_decode_dev(le64_to_cpu(dev->huge));
  331. else {
  332. err = 13;
  333. goto out_invalid;
  334. }
  335. memcpy(ui->data, ino->data, ui->data_len);
  336. inode->i_op = &ubifs_file_inode_operations;
  337. init_special_inode(inode, inode->i_mode, rdev);
  338. break;
  339. }
  340. case S_IFSOCK:
  341. case S_IFIFO:
  342. inode->i_op = &ubifs_file_inode_operations;
  343. init_special_inode(inode, inode->i_mode, 0);
  344. if (ui->data_len != 0) {
  345. err = 14;
  346. goto out_invalid;
  347. }
  348. break;
  349. default:
  350. err = 15;
  351. goto out_invalid;
  352. }
  353. #else
  354. if ((inode->i_mode & S_IFMT) == S_IFLNK) {
  355. if (ui->data_len <= 0 || ui->data_len > UBIFS_MAX_INO_DATA) {
  356. err = 12;
  357. goto out_invalid;
  358. }
  359. ui->data = kmalloc(ui->data_len + 1, GFP_NOFS);
  360. if (!ui->data) {
  361. err = -ENOMEM;
  362. goto out_ino;
  363. }
  364. memcpy(ui->data, ino->data, ui->data_len);
  365. ((char *)ui->data)[ui->data_len] = '\0';
  366. }
  367. #endif
  368. kfree(ino);
  369. #ifndef __UBOOT__
  370. ubifs_set_inode_flags(inode);
  371. #endif
  372. unlock_new_inode(inode);
  373. return inode;
  374. out_invalid:
  375. ubifs_err(c, "inode %lu validation failed, error %d", inode->i_ino, err);
  376. ubifs_dump_node(c, ino);
  377. ubifs_dump_inode(c, inode);
  378. err = -EINVAL;
  379. out_ino:
  380. kfree(ino);
  381. out:
  382. ubifs_err(c, "failed to read inode %lu, error %d", inode->i_ino, err);
  383. iget_failed(inode);
  384. return ERR_PTR(err);
  385. }
  386. static struct inode *ubifs_alloc_inode(struct super_block *sb)
  387. {
  388. struct ubifs_inode *ui;
  389. ui = kmem_cache_alloc(ubifs_inode_slab, GFP_NOFS);
  390. if (!ui)
  391. return NULL;
  392. memset((void *)ui + sizeof(struct inode), 0,
  393. sizeof(struct ubifs_inode) - sizeof(struct inode));
  394. mutex_init(&ui->ui_mutex);
  395. spin_lock_init(&ui->ui_lock);
  396. return &ui->vfs_inode;
  397. };
  398. #ifndef __UBOOT__
  399. static void ubifs_i_callback(struct rcu_head *head)
  400. {
  401. struct inode *inode = container_of(head, struct inode, i_rcu);
  402. struct ubifs_inode *ui = ubifs_inode(inode);
  403. kmem_cache_free(ubifs_inode_slab, ui);
  404. }
  405. static void ubifs_destroy_inode(struct inode *inode)
  406. {
  407. struct ubifs_inode *ui = ubifs_inode(inode);
  408. kfree(ui->data);
  409. call_rcu(&inode->i_rcu, ubifs_i_callback);
  410. }
  411. /*
  412. * Note, Linux write-back code calls this without 'i_mutex'.
  413. */
  414. static int ubifs_write_inode(struct inode *inode, struct writeback_control *wbc)
  415. {
  416. int err = 0;
  417. struct ubifs_info *c = inode->i_sb->s_fs_info;
  418. struct ubifs_inode *ui = ubifs_inode(inode);
  419. ubifs_assert(!ui->xattr);
  420. if (is_bad_inode(inode))
  421. return 0;
  422. mutex_lock(&ui->ui_mutex);
  423. /*
  424. * Due to races between write-back forced by budgeting
  425. * (see 'sync_some_inodes()') and background write-back, the inode may
  426. * have already been synchronized, do not do this again. This might
  427. * also happen if it was synchronized in an VFS operation, e.g.
  428. * 'ubifs_link()'.
  429. */
  430. if (!ui->dirty) {
  431. mutex_unlock(&ui->ui_mutex);
  432. return 0;
  433. }
  434. /*
  435. * As an optimization, do not write orphan inodes to the media just
  436. * because this is not needed.
  437. */
  438. dbg_gen("inode %lu, mode %#x, nlink %u",
  439. inode->i_ino, (int)inode->i_mode, inode->i_nlink);
  440. if (inode->i_nlink) {
  441. err = ubifs_jnl_write_inode(c, inode);
  442. if (err)
  443. ubifs_err(c, "can't write inode %lu, error %d",
  444. inode->i_ino, err);
  445. else
  446. err = dbg_check_inode_size(c, inode, ui->ui_size);
  447. }
  448. ui->dirty = 0;
  449. mutex_unlock(&ui->ui_mutex);
  450. ubifs_release_dirty_inode_budget(c, ui);
  451. return err;
  452. }
  453. static void ubifs_evict_inode(struct inode *inode)
  454. {
  455. int err;
  456. struct ubifs_info *c = inode->i_sb->s_fs_info;
  457. struct ubifs_inode *ui = ubifs_inode(inode);
  458. if (ui->xattr)
  459. /*
  460. * Extended attribute inode deletions are fully handled in
  461. * 'ubifs_removexattr()'. These inodes are special and have
  462. * limited usage, so there is nothing to do here.
  463. */
  464. goto out;
  465. dbg_gen("inode %lu, mode %#x", inode->i_ino, (int)inode->i_mode);
  466. ubifs_assert(!atomic_read(&inode->i_count));
  467. truncate_inode_pages_final(&inode->i_data);
  468. if (inode->i_nlink)
  469. goto done;
  470. if (is_bad_inode(inode))
  471. goto out;
  472. ui->ui_size = inode->i_size = 0;
  473. err = ubifs_jnl_delete_inode(c, inode);
  474. if (err)
  475. /*
  476. * Worst case we have a lost orphan inode wasting space, so a
  477. * simple error message is OK here.
  478. */
  479. ubifs_err(c, "can't delete inode %lu, error %d",
  480. inode->i_ino, err);
  481. out:
  482. if (ui->dirty)
  483. ubifs_release_dirty_inode_budget(c, ui);
  484. else {
  485. /* We've deleted something - clean the "no space" flags */
  486. c->bi.nospace = c->bi.nospace_rp = 0;
  487. smp_wmb();
  488. }
  489. done:
  490. clear_inode(inode);
  491. }
  492. #endif
  493. static void ubifs_dirty_inode(struct inode *inode, int flags)
  494. {
  495. struct ubifs_inode *ui = ubifs_inode(inode);
  496. ubifs_assert(mutex_is_locked(&ui->ui_mutex));
  497. if (!ui->dirty) {
  498. ui->dirty = 1;
  499. dbg_gen("inode %lu", inode->i_ino);
  500. }
  501. }
  502. #ifndef __UBOOT__
  503. static int ubifs_statfs(struct dentry *dentry, struct kstatfs *buf)
  504. {
  505. struct ubifs_info *c = dentry->d_sb->s_fs_info;
  506. unsigned long long free;
  507. __le32 *uuid = (__le32 *)c->uuid;
  508. free = ubifs_get_free_space(c);
  509. dbg_gen("free space %lld bytes (%lld blocks)",
  510. free, free >> UBIFS_BLOCK_SHIFT);
  511. buf->f_type = UBIFS_SUPER_MAGIC;
  512. buf->f_bsize = UBIFS_BLOCK_SIZE;
  513. buf->f_blocks = c->block_cnt;
  514. buf->f_bfree = free >> UBIFS_BLOCK_SHIFT;
  515. if (free > c->report_rp_size)
  516. buf->f_bavail = (free - c->report_rp_size) >> UBIFS_BLOCK_SHIFT;
  517. else
  518. buf->f_bavail = 0;
  519. buf->f_files = 0;
  520. buf->f_ffree = 0;
  521. buf->f_namelen = UBIFS_MAX_NLEN;
  522. buf->f_fsid.val[0] = le32_to_cpu(uuid[0]) ^ le32_to_cpu(uuid[2]);
  523. buf->f_fsid.val[1] = le32_to_cpu(uuid[1]) ^ le32_to_cpu(uuid[3]);
  524. ubifs_assert(buf->f_bfree <= c->block_cnt);
  525. return 0;
  526. }
  527. static int ubifs_show_options(struct seq_file *s, struct dentry *root)
  528. {
  529. struct ubifs_info *c = root->d_sb->s_fs_info;
  530. if (c->mount_opts.unmount_mode == 2)
  531. seq_puts(s, ",fast_unmount");
  532. else if (c->mount_opts.unmount_mode == 1)
  533. seq_puts(s, ",norm_unmount");
  534. if (c->mount_opts.bulk_read == 2)
  535. seq_puts(s, ",bulk_read");
  536. else if (c->mount_opts.bulk_read == 1)
  537. seq_puts(s, ",no_bulk_read");
  538. if (c->mount_opts.chk_data_crc == 2)
  539. seq_puts(s, ",chk_data_crc");
  540. else if (c->mount_opts.chk_data_crc == 1)
  541. seq_puts(s, ",no_chk_data_crc");
  542. if (c->mount_opts.override_compr) {
  543. seq_printf(s, ",compr=%s",
  544. ubifs_compr_name(c->mount_opts.compr_type));
  545. }
  546. return 0;
  547. }
  548. static int ubifs_sync_fs(struct super_block *sb, int wait)
  549. {
  550. int i, err;
  551. struct ubifs_info *c = sb->s_fs_info;
  552. /*
  553. * Zero @wait is just an advisory thing to help the file system shove
  554. * lots of data into the queues, and there will be the second
  555. * '->sync_fs()' call, with non-zero @wait.
  556. */
  557. if (!wait)
  558. return 0;
  559. /*
  560. * Synchronize write buffers, because 'ubifs_run_commit()' does not
  561. * do this if it waits for an already running commit.
  562. */
  563. for (i = 0; i < c->jhead_cnt; i++) {
  564. err = ubifs_wbuf_sync(&c->jheads[i].wbuf);
  565. if (err)
  566. return err;
  567. }
  568. /*
  569. * Strictly speaking, it is not necessary to commit the journal here,
  570. * synchronizing write-buffers would be enough. But committing makes
  571. * UBIFS free space predictions much more accurate, so we want to let
  572. * the user be able to get more accurate results of 'statfs()' after
  573. * they synchronize the file system.
  574. */
  575. err = ubifs_run_commit(c);
  576. if (err)
  577. return err;
  578. return ubi_sync(c->vi.ubi_num);
  579. }
  580. #endif
  581. /**
  582. * init_constants_early - initialize UBIFS constants.
  583. * @c: UBIFS file-system description object
  584. *
  585. * This function initialize UBIFS constants which do not need the superblock to
  586. * be read. It also checks that the UBI volume satisfies basic UBIFS
  587. * requirements. Returns zero in case of success and a negative error code in
  588. * case of failure.
  589. */
  590. static int init_constants_early(struct ubifs_info *c)
  591. {
  592. if (c->vi.corrupted) {
  593. ubifs_warn(c, "UBI volume is corrupted - read-only mode");
  594. c->ro_media = 1;
  595. }
  596. if (c->di.ro_mode) {
  597. ubifs_msg(c, "read-only UBI device");
  598. c->ro_media = 1;
  599. }
  600. if (c->vi.vol_type == UBI_STATIC_VOLUME) {
  601. ubifs_msg(c, "static UBI volume - read-only mode");
  602. c->ro_media = 1;
  603. }
  604. c->leb_cnt = c->vi.size;
  605. c->leb_size = c->vi.usable_leb_size;
  606. c->leb_start = c->di.leb_start;
  607. c->half_leb_size = c->leb_size / 2;
  608. c->min_io_size = c->di.min_io_size;
  609. c->min_io_shift = fls(c->min_io_size) - 1;
  610. c->max_write_size = c->di.max_write_size;
  611. c->max_write_shift = fls(c->max_write_size) - 1;
  612. if (c->leb_size < UBIFS_MIN_LEB_SZ) {
  613. ubifs_err(c, "too small LEBs (%d bytes), min. is %d bytes",
  614. c->leb_size, UBIFS_MIN_LEB_SZ);
  615. return -EINVAL;
  616. }
  617. if (c->leb_cnt < UBIFS_MIN_LEB_CNT) {
  618. ubifs_err(c, "too few LEBs (%d), min. is %d",
  619. c->leb_cnt, UBIFS_MIN_LEB_CNT);
  620. return -EINVAL;
  621. }
  622. if (!is_power_of_2(c->min_io_size)) {
  623. ubifs_err(c, "bad min. I/O size %d", c->min_io_size);
  624. return -EINVAL;
  625. }
  626. /*
  627. * Maximum write size has to be greater or equivalent to min. I/O
  628. * size, and be multiple of min. I/O size.
  629. */
  630. if (c->max_write_size < c->min_io_size ||
  631. c->max_write_size % c->min_io_size ||
  632. !is_power_of_2(c->max_write_size)) {
  633. ubifs_err(c, "bad write buffer size %d for %d min. I/O unit",
  634. c->max_write_size, c->min_io_size);
  635. return -EINVAL;
  636. }
  637. /*
  638. * UBIFS aligns all node to 8-byte boundary, so to make function in
  639. * io.c simpler, assume minimum I/O unit size to be 8 bytes if it is
  640. * less than 8.
  641. */
  642. if (c->min_io_size < 8) {
  643. c->min_io_size = 8;
  644. c->min_io_shift = 3;
  645. if (c->max_write_size < c->min_io_size) {
  646. c->max_write_size = c->min_io_size;
  647. c->max_write_shift = c->min_io_shift;
  648. }
  649. }
  650. c->ref_node_alsz = ALIGN(UBIFS_REF_NODE_SZ, c->min_io_size);
  651. c->mst_node_alsz = ALIGN(UBIFS_MST_NODE_SZ, c->min_io_size);
  652. /*
  653. * Initialize node length ranges which are mostly needed for node
  654. * length validation.
  655. */
  656. c->ranges[UBIFS_PAD_NODE].len = UBIFS_PAD_NODE_SZ;
  657. c->ranges[UBIFS_SB_NODE].len = UBIFS_SB_NODE_SZ;
  658. c->ranges[UBIFS_MST_NODE].len = UBIFS_MST_NODE_SZ;
  659. c->ranges[UBIFS_REF_NODE].len = UBIFS_REF_NODE_SZ;
  660. c->ranges[UBIFS_TRUN_NODE].len = UBIFS_TRUN_NODE_SZ;
  661. c->ranges[UBIFS_CS_NODE].len = UBIFS_CS_NODE_SZ;
  662. c->ranges[UBIFS_INO_NODE].min_len = UBIFS_INO_NODE_SZ;
  663. c->ranges[UBIFS_INO_NODE].max_len = UBIFS_MAX_INO_NODE_SZ;
  664. c->ranges[UBIFS_ORPH_NODE].min_len =
  665. UBIFS_ORPH_NODE_SZ + sizeof(__le64);
  666. c->ranges[UBIFS_ORPH_NODE].max_len = c->leb_size;
  667. c->ranges[UBIFS_DENT_NODE].min_len = UBIFS_DENT_NODE_SZ;
  668. c->ranges[UBIFS_DENT_NODE].max_len = UBIFS_MAX_DENT_NODE_SZ;
  669. c->ranges[UBIFS_XENT_NODE].min_len = UBIFS_XENT_NODE_SZ;
  670. c->ranges[UBIFS_XENT_NODE].max_len = UBIFS_MAX_XENT_NODE_SZ;
  671. c->ranges[UBIFS_DATA_NODE].min_len = UBIFS_DATA_NODE_SZ;
  672. c->ranges[UBIFS_DATA_NODE].max_len = UBIFS_MAX_DATA_NODE_SZ;
  673. /*
  674. * Minimum indexing node size is amended later when superblock is
  675. * read and the key length is known.
  676. */
  677. c->ranges[UBIFS_IDX_NODE].min_len = UBIFS_IDX_NODE_SZ + UBIFS_BRANCH_SZ;
  678. /*
  679. * Maximum indexing node size is amended later when superblock is
  680. * read and the fanout is known.
  681. */
  682. c->ranges[UBIFS_IDX_NODE].max_len = INT_MAX;
  683. /*
  684. * Initialize dead and dark LEB space watermarks. See gc.c for comments
  685. * about these values.
  686. */
  687. c->dead_wm = ALIGN(MIN_WRITE_SZ, c->min_io_size);
  688. c->dark_wm = ALIGN(UBIFS_MAX_NODE_SZ, c->min_io_size);
  689. /*
  690. * Calculate how many bytes would be wasted at the end of LEB if it was
  691. * fully filled with data nodes of maximum size. This is used in
  692. * calculations when reporting free space.
  693. */
  694. c->leb_overhead = c->leb_size % UBIFS_MAX_DATA_NODE_SZ;
  695. /* Buffer size for bulk-reads */
  696. c->max_bu_buf_len = UBIFS_MAX_BULK_READ * UBIFS_MAX_DATA_NODE_SZ;
  697. if (c->max_bu_buf_len > c->leb_size)
  698. c->max_bu_buf_len = c->leb_size;
  699. return 0;
  700. }
  701. /**
  702. * bud_wbuf_callback - bud LEB write-buffer synchronization call-back.
  703. * @c: UBIFS file-system description object
  704. * @lnum: LEB the write-buffer was synchronized to
  705. * @free: how many free bytes left in this LEB
  706. * @pad: how many bytes were padded
  707. *
  708. * This is a callback function which is called by the I/O unit when the
  709. * write-buffer is synchronized. We need this to correctly maintain space
  710. * accounting in bud logical eraseblocks. This function returns zero in case of
  711. * success and a negative error code in case of failure.
  712. *
  713. * This function actually belongs to the journal, but we keep it here because
  714. * we want to keep it static.
  715. */
  716. static int bud_wbuf_callback(struct ubifs_info *c, int lnum, int free, int pad)
  717. {
  718. return ubifs_update_one_lp(c, lnum, free, pad, 0, 0);
  719. }
  720. /*
  721. * init_constants_sb - initialize UBIFS constants.
  722. * @c: UBIFS file-system description object
  723. *
  724. * This is a helper function which initializes various UBIFS constants after
  725. * the superblock has been read. It also checks various UBIFS parameters and
  726. * makes sure they are all right. Returns zero in case of success and a
  727. * negative error code in case of failure.
  728. */
  729. static int init_constants_sb(struct ubifs_info *c)
  730. {
  731. int tmp, err;
  732. long long tmp64;
  733. c->main_bytes = (long long)c->main_lebs * c->leb_size;
  734. c->max_znode_sz = sizeof(struct ubifs_znode) +
  735. c->fanout * sizeof(struct ubifs_zbranch);
  736. tmp = ubifs_idx_node_sz(c, 1);
  737. c->ranges[UBIFS_IDX_NODE].min_len = tmp;
  738. c->min_idx_node_sz = ALIGN(tmp, 8);
  739. tmp = ubifs_idx_node_sz(c, c->fanout);
  740. c->ranges[UBIFS_IDX_NODE].max_len = tmp;
  741. c->max_idx_node_sz = ALIGN(tmp, 8);
  742. /* Make sure LEB size is large enough to fit full commit */
  743. tmp = UBIFS_CS_NODE_SZ + UBIFS_REF_NODE_SZ * c->jhead_cnt;
  744. tmp = ALIGN(tmp, c->min_io_size);
  745. if (tmp > c->leb_size) {
  746. ubifs_err(c, "too small LEB size %d, at least %d needed",
  747. c->leb_size, tmp);
  748. return -EINVAL;
  749. }
  750. /*
  751. * Make sure that the log is large enough to fit reference nodes for
  752. * all buds plus one reserved LEB.
  753. */
  754. tmp64 = c->max_bud_bytes + c->leb_size - 1;
  755. c->max_bud_cnt = div_u64(tmp64, c->leb_size);
  756. tmp = (c->ref_node_alsz * c->max_bud_cnt + c->leb_size - 1);
  757. tmp /= c->leb_size;
  758. tmp += 1;
  759. if (c->log_lebs < tmp) {
  760. ubifs_err(c, "too small log %d LEBs, required min. %d LEBs",
  761. c->log_lebs, tmp);
  762. return -EINVAL;
  763. }
  764. /*
  765. * When budgeting we assume worst-case scenarios when the pages are not
  766. * be compressed and direntries are of the maximum size.
  767. *
  768. * Note, data, which may be stored in inodes is budgeted separately, so
  769. * it is not included into 'c->bi.inode_budget'.
  770. */
  771. c->bi.page_budget = UBIFS_MAX_DATA_NODE_SZ * UBIFS_BLOCKS_PER_PAGE;
  772. c->bi.inode_budget = UBIFS_INO_NODE_SZ;
  773. c->bi.dent_budget = UBIFS_MAX_DENT_NODE_SZ;
  774. /*
  775. * When the amount of flash space used by buds becomes
  776. * 'c->max_bud_bytes', UBIFS just blocks all writers and starts commit.
  777. * The writers are unblocked when the commit is finished. To avoid
  778. * writers to be blocked UBIFS initiates background commit in advance,
  779. * when number of bud bytes becomes above the limit defined below.
  780. */
  781. c->bg_bud_bytes = (c->max_bud_bytes * 13) >> 4;
  782. /*
  783. * Ensure minimum journal size. All the bytes in the journal heads are
  784. * considered to be used, when calculating the current journal usage.
  785. * Consequently, if the journal is too small, UBIFS will treat it as
  786. * always full.
  787. */
  788. tmp64 = (long long)(c->jhead_cnt + 1) * c->leb_size + 1;
  789. if (c->bg_bud_bytes < tmp64)
  790. c->bg_bud_bytes = tmp64;
  791. if (c->max_bud_bytes < tmp64 + c->leb_size)
  792. c->max_bud_bytes = tmp64 + c->leb_size;
  793. err = ubifs_calc_lpt_geom(c);
  794. if (err)
  795. return err;
  796. /* Initialize effective LEB size used in budgeting calculations */
  797. c->idx_leb_size = c->leb_size - c->max_idx_node_sz;
  798. return 0;
  799. }
  800. /*
  801. * init_constants_master - initialize UBIFS constants.
  802. * @c: UBIFS file-system description object
  803. *
  804. * This is a helper function which initializes various UBIFS constants after
  805. * the master node has been read. It also checks various UBIFS parameters and
  806. * makes sure they are all right.
  807. */
  808. static void init_constants_master(struct ubifs_info *c)
  809. {
  810. long long tmp64;
  811. c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
  812. c->report_rp_size = ubifs_reported_space(c, c->rp_size);
  813. /*
  814. * Calculate total amount of FS blocks. This number is not used
  815. * internally because it does not make much sense for UBIFS, but it is
  816. * necessary to report something for the 'statfs()' call.
  817. *
  818. * Subtract the LEB reserved for GC, the LEB which is reserved for
  819. * deletions, minimum LEBs for the index, and assume only one journal
  820. * head is available.
  821. */
  822. tmp64 = c->main_lebs - 1 - 1 - MIN_INDEX_LEBS - c->jhead_cnt + 1;
  823. tmp64 *= (long long)c->leb_size - c->leb_overhead;
  824. tmp64 = ubifs_reported_space(c, tmp64);
  825. c->block_cnt = tmp64 >> UBIFS_BLOCK_SHIFT;
  826. }
  827. /**
  828. * take_gc_lnum - reserve GC LEB.
  829. * @c: UBIFS file-system description object
  830. *
  831. * This function ensures that the LEB reserved for garbage collection is marked
  832. * as "taken" in lprops. We also have to set free space to LEB size and dirty
  833. * space to zero, because lprops may contain out-of-date information if the
  834. * file-system was un-mounted before it has been committed. This function
  835. * returns zero in case of success and a negative error code in case of
  836. * failure.
  837. */
  838. static int take_gc_lnum(struct ubifs_info *c)
  839. {
  840. int err;
  841. if (c->gc_lnum == -1) {
  842. ubifs_err(c, "no LEB for GC");
  843. return -EINVAL;
  844. }
  845. /* And we have to tell lprops that this LEB is taken */
  846. err = ubifs_change_one_lp(c, c->gc_lnum, c->leb_size, 0,
  847. LPROPS_TAKEN, 0, 0);
  848. return err;
  849. }
  850. /**
  851. * alloc_wbufs - allocate write-buffers.
  852. * @c: UBIFS file-system description object
  853. *
  854. * This helper function allocates and initializes UBIFS write-buffers. Returns
  855. * zero in case of success and %-ENOMEM in case of failure.
  856. */
  857. static int alloc_wbufs(struct ubifs_info *c)
  858. {
  859. int i, err;
  860. c->jheads = kcalloc(c->jhead_cnt, sizeof(struct ubifs_jhead),
  861. GFP_KERNEL);
  862. if (!c->jheads)
  863. return -ENOMEM;
  864. /* Initialize journal heads */
  865. for (i = 0; i < c->jhead_cnt; i++) {
  866. INIT_LIST_HEAD(&c->jheads[i].buds_list);
  867. err = ubifs_wbuf_init(c, &c->jheads[i].wbuf);
  868. if (err)
  869. return err;
  870. c->jheads[i].wbuf.sync_callback = &bud_wbuf_callback;
  871. c->jheads[i].wbuf.jhead = i;
  872. c->jheads[i].grouped = 1;
  873. }
  874. /*
  875. * Garbage Collector head does not need to be synchronized by timer.
  876. * Also GC head nodes are not grouped.
  877. */
  878. c->jheads[GCHD].wbuf.no_timer = 1;
  879. c->jheads[GCHD].grouped = 0;
  880. return 0;
  881. }
  882. /**
  883. * free_wbufs - free write-buffers.
  884. * @c: UBIFS file-system description object
  885. */
  886. static void free_wbufs(struct ubifs_info *c)
  887. {
  888. int i;
  889. if (c->jheads) {
  890. for (i = 0; i < c->jhead_cnt; i++) {
  891. kfree(c->jheads[i].wbuf.buf);
  892. kfree(c->jheads[i].wbuf.inodes);
  893. }
  894. kfree(c->jheads);
  895. c->jheads = NULL;
  896. }
  897. }
  898. /**
  899. * free_orphans - free orphans.
  900. * @c: UBIFS file-system description object
  901. */
  902. static void free_orphans(struct ubifs_info *c)
  903. {
  904. struct ubifs_orphan *orph;
  905. while (c->orph_dnext) {
  906. orph = c->orph_dnext;
  907. c->orph_dnext = orph->dnext;
  908. list_del(&orph->list);
  909. kfree(orph);
  910. }
  911. while (!list_empty(&c->orph_list)) {
  912. orph = list_entry(c->orph_list.next, struct ubifs_orphan, list);
  913. list_del(&orph->list);
  914. kfree(orph);
  915. ubifs_err(c, "orphan list not empty at unmount");
  916. }
  917. vfree(c->orph_buf);
  918. c->orph_buf = NULL;
  919. }
  920. /**
  921. * free_buds - free per-bud objects.
  922. * @c: UBIFS file-system description object
  923. */
  924. static void free_buds(struct ubifs_info *c)
  925. {
  926. struct ubifs_bud *bud, *n;
  927. rbtree_postorder_for_each_entry_safe(bud, n, &c->buds, rb)
  928. kfree(bud);
  929. }
  930. /**
  931. * check_volume_empty - check if the UBI volume is empty.
  932. * @c: UBIFS file-system description object
  933. *
  934. * This function checks if the UBIFS volume is empty by looking if its LEBs are
  935. * mapped or not. The result of checking is stored in the @c->empty variable.
  936. * Returns zero in case of success and a negative error code in case of
  937. * failure.
  938. */
  939. static int check_volume_empty(struct ubifs_info *c)
  940. {
  941. int lnum, err;
  942. c->empty = 1;
  943. for (lnum = 0; lnum < c->leb_cnt; lnum++) {
  944. err = ubifs_is_mapped(c, lnum);
  945. if (unlikely(err < 0))
  946. return err;
  947. if (err == 1) {
  948. c->empty = 0;
  949. break;
  950. }
  951. cond_resched();
  952. }
  953. return 0;
  954. }
  955. /*
  956. * UBIFS mount options.
  957. *
  958. * Opt_fast_unmount: do not run a journal commit before un-mounting
  959. * Opt_norm_unmount: run a journal commit before un-mounting
  960. * Opt_bulk_read: enable bulk-reads
  961. * Opt_no_bulk_read: disable bulk-reads
  962. * Opt_chk_data_crc: check CRCs when reading data nodes
  963. * Opt_no_chk_data_crc: do not check CRCs when reading data nodes
  964. * Opt_override_compr: override default compressor
  965. * Opt_err: just end of array marker
  966. */
  967. enum {
  968. Opt_fast_unmount,
  969. Opt_norm_unmount,
  970. Opt_bulk_read,
  971. Opt_no_bulk_read,
  972. Opt_chk_data_crc,
  973. Opt_no_chk_data_crc,
  974. Opt_override_compr,
  975. Opt_err,
  976. };
  977. #ifndef __UBOOT__
  978. static const match_table_t tokens = {
  979. {Opt_fast_unmount, "fast_unmount"},
  980. {Opt_norm_unmount, "norm_unmount"},
  981. {Opt_bulk_read, "bulk_read"},
  982. {Opt_no_bulk_read, "no_bulk_read"},
  983. {Opt_chk_data_crc, "chk_data_crc"},
  984. {Opt_no_chk_data_crc, "no_chk_data_crc"},
  985. {Opt_override_compr, "compr=%s"},
  986. {Opt_err, NULL},
  987. };
  988. /**
  989. * parse_standard_option - parse a standard mount option.
  990. * @option: the option to parse
  991. *
  992. * Normally, standard mount options like "sync" are passed to file-systems as
  993. * flags. However, when a "rootflags=" kernel boot parameter is used, they may
  994. * be present in the options string. This function tries to deal with this
  995. * situation and parse standard options. Returns 0 if the option was not
  996. * recognized, and the corresponding integer flag if it was.
  997. *
  998. * UBIFS is only interested in the "sync" option, so do not check for anything
  999. * else.
  1000. */
  1001. static int parse_standard_option(const char *option)
  1002. {
  1003. pr_notice("UBIFS: parse %s\n", option);
  1004. if (!strcmp(option, "sync"))
  1005. return MS_SYNCHRONOUS;
  1006. return 0;
  1007. }
  1008. /**
  1009. * ubifs_parse_options - parse mount parameters.
  1010. * @c: UBIFS file-system description object
  1011. * @options: parameters to parse
  1012. * @is_remount: non-zero if this is FS re-mount
  1013. *
  1014. * This function parses UBIFS mount options and returns zero in case success
  1015. * and a negative error code in case of failure.
  1016. */
  1017. static int ubifs_parse_options(struct ubifs_info *c, char *options,
  1018. int is_remount)
  1019. {
  1020. char *p;
  1021. substring_t args[MAX_OPT_ARGS];
  1022. if (!options)
  1023. return 0;
  1024. while ((p = strsep(&options, ","))) {
  1025. int token;
  1026. if (!*p)
  1027. continue;
  1028. token = match_token(p, tokens, args);
  1029. switch (token) {
  1030. /*
  1031. * %Opt_fast_unmount and %Opt_norm_unmount options are ignored.
  1032. * We accept them in order to be backward-compatible. But this
  1033. * should be removed at some point.
  1034. */
  1035. case Opt_fast_unmount:
  1036. c->mount_opts.unmount_mode = 2;
  1037. break;
  1038. case Opt_norm_unmount:
  1039. c->mount_opts.unmount_mode = 1;
  1040. break;
  1041. case Opt_bulk_read:
  1042. c->mount_opts.bulk_read = 2;
  1043. c->bulk_read = 1;
  1044. break;
  1045. case Opt_no_bulk_read:
  1046. c->mount_opts.bulk_read = 1;
  1047. c->bulk_read = 0;
  1048. break;
  1049. case Opt_chk_data_crc:
  1050. c->mount_opts.chk_data_crc = 2;
  1051. c->no_chk_data_crc = 0;
  1052. break;
  1053. case Opt_no_chk_data_crc:
  1054. c->mount_opts.chk_data_crc = 1;
  1055. c->no_chk_data_crc = 1;
  1056. break;
  1057. case Opt_override_compr:
  1058. {
  1059. char *name = match_strdup(&args[0]);
  1060. if (!name)
  1061. return -ENOMEM;
  1062. if (!strcmp(name, "none"))
  1063. c->mount_opts.compr_type = UBIFS_COMPR_NONE;
  1064. else if (!strcmp(name, "lzo"))
  1065. c->mount_opts.compr_type = UBIFS_COMPR_LZO;
  1066. else if (!strcmp(name, "zlib"))
  1067. c->mount_opts.compr_type = UBIFS_COMPR_ZLIB;
  1068. else {
  1069. ubifs_err(c, "unknown compressor \"%s\"", name); //FIXME: is c ready?
  1070. kfree(name);
  1071. return -EINVAL;
  1072. }
  1073. kfree(name);
  1074. c->mount_opts.override_compr = 1;
  1075. c->default_compr = c->mount_opts.compr_type;
  1076. break;
  1077. }
  1078. default:
  1079. {
  1080. unsigned long flag;
  1081. struct super_block *sb = c->vfs_sb;
  1082. flag = parse_standard_option(p);
  1083. if (!flag) {
  1084. ubifs_err(c, "unrecognized mount option \"%s\" or missing value",
  1085. p);
  1086. return -EINVAL;
  1087. }
  1088. sb->s_flags |= flag;
  1089. break;
  1090. }
  1091. }
  1092. }
  1093. return 0;
  1094. }
  1095. #endif
  1096. /**
  1097. * destroy_journal - destroy journal data structures.
  1098. * @c: UBIFS file-system description object
  1099. *
  1100. * This function destroys journal data structures including those that may have
  1101. * been created by recovery functions.
  1102. */
  1103. static void destroy_journal(struct ubifs_info *c)
  1104. {
  1105. while (!list_empty(&c->unclean_leb_list)) {
  1106. struct ubifs_unclean_leb *ucleb;
  1107. ucleb = list_entry(c->unclean_leb_list.next,
  1108. struct ubifs_unclean_leb, list);
  1109. list_del(&ucleb->list);
  1110. kfree(ucleb);
  1111. }
  1112. while (!list_empty(&c->old_buds)) {
  1113. struct ubifs_bud *bud;
  1114. bud = list_entry(c->old_buds.next, struct ubifs_bud, list);
  1115. list_del(&bud->list);
  1116. kfree(bud);
  1117. }
  1118. ubifs_destroy_idx_gc(c);
  1119. ubifs_destroy_size_tree(c);
  1120. ubifs_tnc_close(c);
  1121. free_buds(c);
  1122. }
  1123. /**
  1124. * bu_init - initialize bulk-read information.
  1125. * @c: UBIFS file-system description object
  1126. */
  1127. static void bu_init(struct ubifs_info *c)
  1128. {
  1129. ubifs_assert(c->bulk_read == 1);
  1130. if (c->bu.buf)
  1131. return; /* Already initialized */
  1132. again:
  1133. c->bu.buf = kmalloc(c->max_bu_buf_len, GFP_KERNEL | __GFP_NOWARN);
  1134. if (!c->bu.buf) {
  1135. if (c->max_bu_buf_len > UBIFS_KMALLOC_OK) {
  1136. c->max_bu_buf_len = UBIFS_KMALLOC_OK;
  1137. goto again;
  1138. }
  1139. /* Just disable bulk-read */
  1140. ubifs_warn(c, "cannot allocate %d bytes of memory for bulk-read, disabling it",
  1141. c->max_bu_buf_len);
  1142. c->mount_opts.bulk_read = 1;
  1143. c->bulk_read = 0;
  1144. return;
  1145. }
  1146. }
  1147. #ifndef __UBOOT__
  1148. /**
  1149. * check_free_space - check if there is enough free space to mount.
  1150. * @c: UBIFS file-system description object
  1151. *
  1152. * This function makes sure UBIFS has enough free space to be mounted in
  1153. * read/write mode. UBIFS must always have some free space to allow deletions.
  1154. */
  1155. static int check_free_space(struct ubifs_info *c)
  1156. {
  1157. ubifs_assert(c->dark_wm > 0);
  1158. if (c->lst.total_free + c->lst.total_dirty < c->dark_wm) {
  1159. ubifs_err(c, "insufficient free space to mount in R/W mode");
  1160. ubifs_dump_budg(c, &c->bi);
  1161. ubifs_dump_lprops(c);
  1162. return -ENOSPC;
  1163. }
  1164. return 0;
  1165. }
  1166. #endif
  1167. /**
  1168. * mount_ubifs - mount UBIFS file-system.
  1169. * @c: UBIFS file-system description object
  1170. *
  1171. * This function mounts UBIFS file system. Returns zero in case of success and
  1172. * a negative error code in case of failure.
  1173. */
  1174. static int mount_ubifs(struct ubifs_info *c)
  1175. {
  1176. int err;
  1177. long long x, y;
  1178. size_t sz;
  1179. c->ro_mount = !!(c->vfs_sb->s_flags & MS_RDONLY);
  1180. /* Suppress error messages while probing if MS_SILENT is set */
  1181. c->probing = !!(c->vfs_sb->s_flags & MS_SILENT);
  1182. #ifdef __UBOOT__
  1183. if (!c->ro_mount) {
  1184. printf("UBIFS: only ro mode in U-Boot allowed.\n");
  1185. return -EACCES;
  1186. }
  1187. #endif
  1188. err = init_constants_early(c);
  1189. if (err)
  1190. return err;
  1191. err = ubifs_debugging_init(c);
  1192. if (err)
  1193. return err;
  1194. err = check_volume_empty(c);
  1195. if (err)
  1196. goto out_free;
  1197. if (c->empty && (c->ro_mount || c->ro_media)) {
  1198. /*
  1199. * This UBI volume is empty, and read-only, or the file system
  1200. * is mounted read-only - we cannot format it.
  1201. */
  1202. ubifs_err(c, "can't format empty UBI volume: read-only %s",
  1203. c->ro_media ? "UBI volume" : "mount");
  1204. err = -EROFS;
  1205. goto out_free;
  1206. }
  1207. if (c->ro_media && !c->ro_mount) {
  1208. ubifs_err(c, "cannot mount read-write - read-only media");
  1209. err = -EROFS;
  1210. goto out_free;
  1211. }
  1212. /*
  1213. * The requirement for the buffer is that it should fit indexing B-tree
  1214. * height amount of integers. We assume the height if the TNC tree will
  1215. * never exceed 64.
  1216. */
  1217. err = -ENOMEM;
  1218. c->bottom_up_buf = kmalloc(BOTTOM_UP_HEIGHT * sizeof(int), GFP_KERNEL);
  1219. if (!c->bottom_up_buf)
  1220. goto out_free;
  1221. c->sbuf = vmalloc(c->leb_size);
  1222. if (!c->sbuf)
  1223. goto out_free;
  1224. #ifndef __UBOOT__
  1225. if (!c->ro_mount) {
  1226. c->ileb_buf = vmalloc(c->leb_size);
  1227. if (!c->ileb_buf)
  1228. goto out_free;
  1229. }
  1230. #endif
  1231. if (c->bulk_read == 1)
  1232. bu_init(c);
  1233. #ifndef __UBOOT__
  1234. if (!c->ro_mount) {
  1235. c->write_reserve_buf = kmalloc(COMPRESSED_DATA_NODE_BUF_SZ,
  1236. GFP_KERNEL);
  1237. if (!c->write_reserve_buf)
  1238. goto out_free;
  1239. }
  1240. #endif
  1241. c->mounting = 1;
  1242. err = ubifs_read_superblock(c);
  1243. if (err)
  1244. goto out_free;
  1245. c->probing = 0;
  1246. /*
  1247. * Make sure the compressor which is set as default in the superblock
  1248. * or overridden by mount options is actually compiled in.
  1249. */
  1250. if (!ubifs_compr_present(c->default_compr)) {
  1251. ubifs_err(c, "'compressor \"%s\" is not compiled in",
  1252. ubifs_compr_name(c->default_compr));
  1253. err = -ENOTSUPP;
  1254. goto out_free;
  1255. }
  1256. err = init_constants_sb(c);
  1257. if (err)
  1258. goto out_free;
  1259. sz = ALIGN(c->max_idx_node_sz, c->min_io_size);
  1260. sz = ALIGN(sz + c->max_idx_node_sz, c->min_io_size);
  1261. c->cbuf = kmalloc(sz, GFP_NOFS);
  1262. if (!c->cbuf) {
  1263. err = -ENOMEM;
  1264. goto out_free;
  1265. }
  1266. err = alloc_wbufs(c);
  1267. if (err)
  1268. goto out_cbuf;
  1269. sprintf(c->bgt_name, BGT_NAME_PATTERN, c->vi.ubi_num, c->vi.vol_id);
  1270. #ifndef __UBOOT__
  1271. if (!c->ro_mount) {
  1272. /* Create background thread */
  1273. c->bgt = kthread_create(ubifs_bg_thread, c, "%s", c->bgt_name);
  1274. if (IS_ERR(c->bgt)) {
  1275. err = PTR_ERR(c->bgt);
  1276. c->bgt = NULL;
  1277. ubifs_err(c, "cannot spawn \"%s\", error %d",
  1278. c->bgt_name, err);
  1279. goto out_wbufs;
  1280. }
  1281. wake_up_process(c->bgt);
  1282. }
  1283. #endif
  1284. err = ubifs_read_master(c);
  1285. if (err)
  1286. goto out_master;
  1287. init_constants_master(c);
  1288. if ((c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY)) != 0) {
  1289. ubifs_msg(c, "recovery needed");
  1290. c->need_recovery = 1;
  1291. }
  1292. #ifndef __UBOOT__
  1293. if (c->need_recovery && !c->ro_mount) {
  1294. err = ubifs_recover_inl_heads(c, c->sbuf);
  1295. if (err)
  1296. goto out_master;
  1297. }
  1298. #endif
  1299. err = ubifs_lpt_init(c, 1, !c->ro_mount);
  1300. if (err)
  1301. goto out_master;
  1302. #ifndef __UBOOT__
  1303. if (!c->ro_mount && c->space_fixup) {
  1304. err = ubifs_fixup_free_space(c);
  1305. if (err)
  1306. goto out_lpt;
  1307. }
  1308. if (!c->ro_mount && !c->need_recovery) {
  1309. /*
  1310. * Set the "dirty" flag so that if we reboot uncleanly we
  1311. * will notice this immediately on the next mount.
  1312. */
  1313. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1314. err = ubifs_write_master(c);
  1315. if (err)
  1316. goto out_lpt;
  1317. }
  1318. #endif
  1319. err = dbg_check_idx_size(c, c->bi.old_idx_sz);
  1320. if (err)
  1321. goto out_lpt;
  1322. err = ubifs_replay_journal(c);
  1323. if (err)
  1324. goto out_journal;
  1325. /* Calculate 'min_idx_lebs' after journal replay */
  1326. c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
  1327. err = ubifs_mount_orphans(c, c->need_recovery, c->ro_mount);
  1328. if (err)
  1329. goto out_orphans;
  1330. if (!c->ro_mount) {
  1331. #ifndef __UBOOT__
  1332. int lnum;
  1333. err = check_free_space(c);
  1334. if (err)
  1335. goto out_orphans;
  1336. /* Check for enough log space */
  1337. lnum = c->lhead_lnum + 1;
  1338. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1339. lnum = UBIFS_LOG_LNUM;
  1340. if (lnum == c->ltail_lnum) {
  1341. err = ubifs_consolidate_log(c);
  1342. if (err)
  1343. goto out_orphans;
  1344. }
  1345. if (c->need_recovery) {
  1346. err = ubifs_recover_size(c);
  1347. if (err)
  1348. goto out_orphans;
  1349. err = ubifs_rcvry_gc_commit(c);
  1350. if (err)
  1351. goto out_orphans;
  1352. } else {
  1353. err = take_gc_lnum(c);
  1354. if (err)
  1355. goto out_orphans;
  1356. /*
  1357. * GC LEB may contain garbage if there was an unclean
  1358. * reboot, and it should be un-mapped.
  1359. */
  1360. err = ubifs_leb_unmap(c, c->gc_lnum);
  1361. if (err)
  1362. goto out_orphans;
  1363. }
  1364. err = dbg_check_lprops(c);
  1365. if (err)
  1366. goto out_orphans;
  1367. #endif
  1368. } else if (c->need_recovery) {
  1369. err = ubifs_recover_size(c);
  1370. if (err)
  1371. goto out_orphans;
  1372. } else {
  1373. /*
  1374. * Even if we mount read-only, we have to set space in GC LEB
  1375. * to proper value because this affects UBIFS free space
  1376. * reporting. We do not want to have a situation when
  1377. * re-mounting from R/O to R/W changes amount of free space.
  1378. */
  1379. err = take_gc_lnum(c);
  1380. if (err)
  1381. goto out_orphans;
  1382. }
  1383. #ifndef __UBOOT__
  1384. spin_lock(&ubifs_infos_lock);
  1385. list_add_tail(&c->infos_list, &ubifs_infos);
  1386. spin_unlock(&ubifs_infos_lock);
  1387. #endif
  1388. if (c->need_recovery) {
  1389. if (c->ro_mount)
  1390. ubifs_msg(c, "recovery deferred");
  1391. else {
  1392. c->need_recovery = 0;
  1393. ubifs_msg(c, "recovery completed");
  1394. /*
  1395. * GC LEB has to be empty and taken at this point. But
  1396. * the journal head LEBs may also be accounted as
  1397. * "empty taken" if they are empty.
  1398. */
  1399. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1400. }
  1401. } else
  1402. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1403. err = dbg_check_filesystem(c);
  1404. if (err)
  1405. goto out_infos;
  1406. err = dbg_debugfs_init_fs(c);
  1407. if (err)
  1408. goto out_infos;
  1409. c->mounting = 0;
  1410. ubifs_msg(c, "UBIFS: mounted UBI device %d, volume %d, name \"%s\"%s",
  1411. c->vi.ubi_num, c->vi.vol_id, c->vi.name,
  1412. c->ro_mount ? ", R/O mode" : "");
  1413. x = (long long)c->main_lebs * c->leb_size;
  1414. y = (long long)c->log_lebs * c->leb_size + c->max_bud_bytes;
  1415. ubifs_msg(c, "LEB size: %d bytes (%d KiB), min./max. I/O unit sizes: %d bytes/%d bytes",
  1416. c->leb_size, c->leb_size >> 10, c->min_io_size,
  1417. c->max_write_size);
  1418. ubifs_msg(c, "FS size: %lld bytes (%lld MiB, %d LEBs), journal size %lld bytes (%lld MiB, %d LEBs)",
  1419. x, x >> 20, c->main_lebs,
  1420. y, y >> 20, c->log_lebs + c->max_bud_cnt);
  1421. ubifs_msg(c, "reserved for root: %llu bytes (%llu KiB)",
  1422. c->report_rp_size, c->report_rp_size >> 10);
  1423. ubifs_msg(c, "media format: w%d/r%d (latest is w%d/r%d), UUID %pUB%s",
  1424. c->fmt_version, c->ro_compat_version,
  1425. UBIFS_FORMAT_VERSION, UBIFS_RO_COMPAT_VERSION, c->uuid,
  1426. c->big_lpt ? ", big LPT model" : ", small LPT model");
  1427. dbg_gen("default compressor: %s", ubifs_compr_name(c->default_compr));
  1428. dbg_gen("data journal heads: %d",
  1429. c->jhead_cnt - NONDATA_JHEADS_CNT);
  1430. dbg_gen("log LEBs: %d (%d - %d)",
  1431. c->log_lebs, UBIFS_LOG_LNUM, c->log_last);
  1432. dbg_gen("LPT area LEBs: %d (%d - %d)",
  1433. c->lpt_lebs, c->lpt_first, c->lpt_last);
  1434. dbg_gen("orphan area LEBs: %d (%d - %d)",
  1435. c->orph_lebs, c->orph_first, c->orph_last);
  1436. dbg_gen("main area LEBs: %d (%d - %d)",
  1437. c->main_lebs, c->main_first, c->leb_cnt - 1);
  1438. dbg_gen("index LEBs: %d", c->lst.idx_lebs);
  1439. dbg_gen("total index bytes: %lld (%lld KiB, %lld MiB)",
  1440. c->bi.old_idx_sz, c->bi.old_idx_sz >> 10,
  1441. c->bi.old_idx_sz >> 20);
  1442. dbg_gen("key hash type: %d", c->key_hash_type);
  1443. dbg_gen("tree fanout: %d", c->fanout);
  1444. dbg_gen("reserved GC LEB: %d", c->gc_lnum);
  1445. dbg_gen("max. znode size %d", c->max_znode_sz);
  1446. dbg_gen("max. index node size %d", c->max_idx_node_sz);
  1447. dbg_gen("node sizes: data %zu, inode %zu, dentry %zu",
  1448. UBIFS_DATA_NODE_SZ, UBIFS_INO_NODE_SZ, UBIFS_DENT_NODE_SZ);
  1449. dbg_gen("node sizes: trun %zu, sb %zu, master %zu",
  1450. UBIFS_TRUN_NODE_SZ, UBIFS_SB_NODE_SZ, UBIFS_MST_NODE_SZ);
  1451. dbg_gen("node sizes: ref %zu, cmt. start %zu, orph %zu",
  1452. UBIFS_REF_NODE_SZ, UBIFS_CS_NODE_SZ, UBIFS_ORPH_NODE_SZ);
  1453. dbg_gen("max. node sizes: data %zu, inode %zu dentry %zu, idx %d",
  1454. UBIFS_MAX_DATA_NODE_SZ, UBIFS_MAX_INO_NODE_SZ,
  1455. UBIFS_MAX_DENT_NODE_SZ, ubifs_idx_node_sz(c, c->fanout));
  1456. dbg_gen("dead watermark: %d", c->dead_wm);
  1457. dbg_gen("dark watermark: %d", c->dark_wm);
  1458. dbg_gen("LEB overhead: %d", c->leb_overhead);
  1459. x = (long long)c->main_lebs * c->dark_wm;
  1460. dbg_gen("max. dark space: %lld (%lld KiB, %lld MiB)",
  1461. x, x >> 10, x >> 20);
  1462. dbg_gen("maximum bud bytes: %lld (%lld KiB, %lld MiB)",
  1463. c->max_bud_bytes, c->max_bud_bytes >> 10,
  1464. c->max_bud_bytes >> 20);
  1465. dbg_gen("BG commit bud bytes: %lld (%lld KiB, %lld MiB)",
  1466. c->bg_bud_bytes, c->bg_bud_bytes >> 10,
  1467. c->bg_bud_bytes >> 20);
  1468. dbg_gen("current bud bytes %lld (%lld KiB, %lld MiB)",
  1469. c->bud_bytes, c->bud_bytes >> 10, c->bud_bytes >> 20);
  1470. dbg_gen("max. seq. number: %llu", c->max_sqnum);
  1471. dbg_gen("commit number: %llu", c->cmt_no);
  1472. return 0;
  1473. out_infos:
  1474. spin_lock(&ubifs_infos_lock);
  1475. list_del(&c->infos_list);
  1476. spin_unlock(&ubifs_infos_lock);
  1477. out_orphans:
  1478. free_orphans(c);
  1479. out_journal:
  1480. destroy_journal(c);
  1481. out_lpt:
  1482. ubifs_lpt_free(c, 0);
  1483. out_master:
  1484. kfree(c->mst_node);
  1485. kfree(c->rcvrd_mst_node);
  1486. if (c->bgt)
  1487. kthread_stop(c->bgt);
  1488. #ifndef __UBOOT__
  1489. out_wbufs:
  1490. #endif
  1491. free_wbufs(c);
  1492. out_cbuf:
  1493. kfree(c->cbuf);
  1494. out_free:
  1495. kfree(c->write_reserve_buf);
  1496. kfree(c->bu.buf);
  1497. vfree(c->ileb_buf);
  1498. vfree(c->sbuf);
  1499. kfree(c->bottom_up_buf);
  1500. ubifs_debugging_exit(c);
  1501. return err;
  1502. }
  1503. /**
  1504. * ubifs_umount - un-mount UBIFS file-system.
  1505. * @c: UBIFS file-system description object
  1506. *
  1507. * Note, this function is called to free allocated resourced when un-mounting,
  1508. * as well as free resources when an error occurred while we were half way
  1509. * through mounting (error path cleanup function). So it has to make sure the
  1510. * resource was actually allocated before freeing it.
  1511. */
  1512. #ifndef __UBOOT__
  1513. static void ubifs_umount(struct ubifs_info *c)
  1514. #else
  1515. void ubifs_umount(struct ubifs_info *c)
  1516. #endif
  1517. {
  1518. dbg_gen("un-mounting UBI device %d, volume %d", c->vi.ubi_num,
  1519. c->vi.vol_id);
  1520. dbg_debugfs_exit_fs(c);
  1521. spin_lock(&ubifs_infos_lock);
  1522. list_del(&c->infos_list);
  1523. spin_unlock(&ubifs_infos_lock);
  1524. #ifndef __UBOOT__
  1525. if (c->bgt)
  1526. kthread_stop(c->bgt);
  1527. destroy_journal(c);
  1528. #endif
  1529. free_wbufs(c);
  1530. free_orphans(c);
  1531. ubifs_lpt_free(c, 0);
  1532. kfree(c->cbuf);
  1533. kfree(c->rcvrd_mst_node);
  1534. kfree(c->mst_node);
  1535. kfree(c->write_reserve_buf);
  1536. kfree(c->bu.buf);
  1537. vfree(c->ileb_buf);
  1538. vfree(c->sbuf);
  1539. kfree(c->bottom_up_buf);
  1540. ubifs_debugging_exit(c);
  1541. #ifdef __UBOOT__
  1542. /* Finally free U-Boot's global copy of superblock */
  1543. if (ubifs_sb != NULL) {
  1544. free(ubifs_sb->s_fs_info);
  1545. free(ubifs_sb);
  1546. }
  1547. #endif
  1548. }
  1549. #ifndef __UBOOT__
  1550. /**
  1551. * ubifs_remount_rw - re-mount in read-write mode.
  1552. * @c: UBIFS file-system description object
  1553. *
  1554. * UBIFS avoids allocating many unnecessary resources when mounted in read-only
  1555. * mode. This function allocates the needed resources and re-mounts UBIFS in
  1556. * read-write mode.
  1557. */
  1558. static int ubifs_remount_rw(struct ubifs_info *c)
  1559. {
  1560. int err, lnum;
  1561. if (c->rw_incompat) {
  1562. ubifs_err(c, "the file-system is not R/W-compatible");
  1563. ubifs_msg(c, "on-flash format version is w%d/r%d, but software only supports up to version w%d/r%d",
  1564. c->fmt_version, c->ro_compat_version,
  1565. UBIFS_FORMAT_VERSION, UBIFS_RO_COMPAT_VERSION);
  1566. return -EROFS;
  1567. }
  1568. mutex_lock(&c->umount_mutex);
  1569. dbg_save_space_info(c);
  1570. c->remounting_rw = 1;
  1571. c->ro_mount = 0;
  1572. if (c->space_fixup) {
  1573. err = ubifs_fixup_free_space(c);
  1574. if (err)
  1575. goto out;
  1576. }
  1577. err = check_free_space(c);
  1578. if (err)
  1579. goto out;
  1580. if (c->old_leb_cnt != c->leb_cnt) {
  1581. struct ubifs_sb_node *sup;
  1582. sup = ubifs_read_sb_node(c);
  1583. if (IS_ERR(sup)) {
  1584. err = PTR_ERR(sup);
  1585. goto out;
  1586. }
  1587. sup->leb_cnt = cpu_to_le32(c->leb_cnt);
  1588. err = ubifs_write_sb_node(c, sup);
  1589. kfree(sup);
  1590. if (err)
  1591. goto out;
  1592. }
  1593. if (c->need_recovery) {
  1594. ubifs_msg(c, "completing deferred recovery");
  1595. err = ubifs_write_rcvrd_mst_node(c);
  1596. if (err)
  1597. goto out;
  1598. err = ubifs_recover_size(c);
  1599. if (err)
  1600. goto out;
  1601. err = ubifs_clean_lebs(c, c->sbuf);
  1602. if (err)
  1603. goto out;
  1604. err = ubifs_recover_inl_heads(c, c->sbuf);
  1605. if (err)
  1606. goto out;
  1607. } else {
  1608. /* A readonly mount is not allowed to have orphans */
  1609. ubifs_assert(c->tot_orphans == 0);
  1610. err = ubifs_clear_orphans(c);
  1611. if (err)
  1612. goto out;
  1613. }
  1614. if (!(c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY))) {
  1615. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1616. err = ubifs_write_master(c);
  1617. if (err)
  1618. goto out;
  1619. }
  1620. c->ileb_buf = vmalloc(c->leb_size);
  1621. if (!c->ileb_buf) {
  1622. err = -ENOMEM;
  1623. goto out;
  1624. }
  1625. c->write_reserve_buf = kmalloc(COMPRESSED_DATA_NODE_BUF_SZ, GFP_KERNEL);
  1626. if (!c->write_reserve_buf) {
  1627. err = -ENOMEM;
  1628. goto out;
  1629. }
  1630. err = ubifs_lpt_init(c, 0, 1);
  1631. if (err)
  1632. goto out;
  1633. /* Create background thread */
  1634. c->bgt = kthread_create(ubifs_bg_thread, c, "%s", c->bgt_name);
  1635. if (IS_ERR(c->bgt)) {
  1636. err = PTR_ERR(c->bgt);
  1637. c->bgt = NULL;
  1638. ubifs_err(c, "cannot spawn \"%s\", error %d",
  1639. c->bgt_name, err);
  1640. goto out;
  1641. }
  1642. wake_up_process(c->bgt);
  1643. c->orph_buf = vmalloc(c->leb_size);
  1644. if (!c->orph_buf) {
  1645. err = -ENOMEM;
  1646. goto out;
  1647. }
  1648. /* Check for enough log space */
  1649. lnum = c->lhead_lnum + 1;
  1650. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1651. lnum = UBIFS_LOG_LNUM;
  1652. if (lnum == c->ltail_lnum) {
  1653. err = ubifs_consolidate_log(c);
  1654. if (err)
  1655. goto out;
  1656. }
  1657. if (c->need_recovery)
  1658. err = ubifs_rcvry_gc_commit(c);
  1659. else
  1660. err = ubifs_leb_unmap(c, c->gc_lnum);
  1661. if (err)
  1662. goto out;
  1663. dbg_gen("re-mounted read-write");
  1664. c->remounting_rw = 0;
  1665. if (c->need_recovery) {
  1666. c->need_recovery = 0;
  1667. ubifs_msg(c, "deferred recovery completed");
  1668. } else {
  1669. /*
  1670. * Do not run the debugging space check if the were doing
  1671. * recovery, because when we saved the information we had the
  1672. * file-system in a state where the TNC and lprops has been
  1673. * modified in memory, but all the I/O operations (including a
  1674. * commit) were deferred. So the file-system was in
  1675. * "non-committed" state. Now the file-system is in committed
  1676. * state, and of course the amount of free space will change
  1677. * because, for example, the old index size was imprecise.
  1678. */
  1679. err = dbg_check_space_info(c);
  1680. }
  1681. mutex_unlock(&c->umount_mutex);
  1682. return err;
  1683. out:
  1684. c->ro_mount = 1;
  1685. vfree(c->orph_buf);
  1686. c->orph_buf = NULL;
  1687. if (c->bgt) {
  1688. kthread_stop(c->bgt);
  1689. c->bgt = NULL;
  1690. }
  1691. free_wbufs(c);
  1692. kfree(c->write_reserve_buf);
  1693. c->write_reserve_buf = NULL;
  1694. vfree(c->ileb_buf);
  1695. c->ileb_buf = NULL;
  1696. ubifs_lpt_free(c, 1);
  1697. c->remounting_rw = 0;
  1698. mutex_unlock(&c->umount_mutex);
  1699. return err;
  1700. }
  1701. /**
  1702. * ubifs_remount_ro - re-mount in read-only mode.
  1703. * @c: UBIFS file-system description object
  1704. *
  1705. * We assume VFS has stopped writing. Possibly the background thread could be
  1706. * running a commit, however kthread_stop will wait in that case.
  1707. */
  1708. static void ubifs_remount_ro(struct ubifs_info *c)
  1709. {
  1710. int i, err;
  1711. ubifs_assert(!c->need_recovery);
  1712. ubifs_assert(!c->ro_mount);
  1713. mutex_lock(&c->umount_mutex);
  1714. if (c->bgt) {
  1715. kthread_stop(c->bgt);
  1716. c->bgt = NULL;
  1717. }
  1718. dbg_save_space_info(c);
  1719. for (i = 0; i < c->jhead_cnt; i++)
  1720. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1721. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1722. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1723. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1724. err = ubifs_write_master(c);
  1725. if (err)
  1726. ubifs_ro_mode(c, err);
  1727. vfree(c->orph_buf);
  1728. c->orph_buf = NULL;
  1729. kfree(c->write_reserve_buf);
  1730. c->write_reserve_buf = NULL;
  1731. vfree(c->ileb_buf);
  1732. c->ileb_buf = NULL;
  1733. ubifs_lpt_free(c, 1);
  1734. c->ro_mount = 1;
  1735. err = dbg_check_space_info(c);
  1736. if (err)
  1737. ubifs_ro_mode(c, err);
  1738. mutex_unlock(&c->umount_mutex);
  1739. }
  1740. static void ubifs_put_super(struct super_block *sb)
  1741. {
  1742. int i;
  1743. struct ubifs_info *c = sb->s_fs_info;
  1744. ubifs_msg(c, "un-mount UBI device %d", c->vi.ubi_num);
  1745. /*
  1746. * The following asserts are only valid if there has not been a failure
  1747. * of the media. For example, there will be dirty inodes if we failed
  1748. * to write them back because of I/O errors.
  1749. */
  1750. if (!c->ro_error) {
  1751. ubifs_assert(c->bi.idx_growth == 0);
  1752. ubifs_assert(c->bi.dd_growth == 0);
  1753. ubifs_assert(c->bi.data_growth == 0);
  1754. }
  1755. /*
  1756. * The 'c->umount_lock' prevents races between UBIFS memory shrinker
  1757. * and file system un-mount. Namely, it prevents the shrinker from
  1758. * picking this superblock for shrinking - it will be just skipped if
  1759. * the mutex is locked.
  1760. */
  1761. mutex_lock(&c->umount_mutex);
  1762. if (!c->ro_mount) {
  1763. /*
  1764. * First of all kill the background thread to make sure it does
  1765. * not interfere with un-mounting and freeing resources.
  1766. */
  1767. if (c->bgt) {
  1768. kthread_stop(c->bgt);
  1769. c->bgt = NULL;
  1770. }
  1771. /*
  1772. * On fatal errors c->ro_error is set to 1, in which case we do
  1773. * not write the master node.
  1774. */
  1775. if (!c->ro_error) {
  1776. int err;
  1777. /* Synchronize write-buffers */
  1778. for (i = 0; i < c->jhead_cnt; i++)
  1779. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1780. /*
  1781. * We are being cleanly unmounted which means the
  1782. * orphans were killed - indicate this in the master
  1783. * node. Also save the reserved GC LEB number.
  1784. */
  1785. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1786. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1787. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1788. err = ubifs_write_master(c);
  1789. if (err)
  1790. /*
  1791. * Recovery will attempt to fix the master area
  1792. * next mount, so we just print a message and
  1793. * continue to unmount normally.
  1794. */
  1795. ubifs_err(c, "failed to write master node, error %d",
  1796. err);
  1797. } else {
  1798. #ifndef __UBOOT__
  1799. for (i = 0; i < c->jhead_cnt; i++)
  1800. /* Make sure write-buffer timers are canceled */
  1801. hrtimer_cancel(&c->jheads[i].wbuf.timer);
  1802. #endif
  1803. }
  1804. }
  1805. ubifs_umount(c);
  1806. #ifndef __UBOOT__
  1807. bdi_destroy(&c->bdi);
  1808. #endif
  1809. ubi_close_volume(c->ubi);
  1810. mutex_unlock(&c->umount_mutex);
  1811. }
  1812. #endif
  1813. #ifndef __UBOOT__
  1814. static int ubifs_remount_fs(struct super_block *sb, int *flags, char *data)
  1815. {
  1816. int err;
  1817. struct ubifs_info *c = sb->s_fs_info;
  1818. sync_filesystem(sb);
  1819. dbg_gen("old flags %#lx, new flags %#x", sb->s_flags, *flags);
  1820. err = ubifs_parse_options(c, data, 1);
  1821. if (err) {
  1822. ubifs_err(c, "invalid or unknown remount parameter");
  1823. return err;
  1824. }
  1825. if (c->ro_mount && !(*flags & MS_RDONLY)) {
  1826. if (c->ro_error) {
  1827. ubifs_msg(c, "cannot re-mount R/W due to prior errors");
  1828. return -EROFS;
  1829. }
  1830. if (c->ro_media) {
  1831. ubifs_msg(c, "cannot re-mount R/W - UBI volume is R/O");
  1832. return -EROFS;
  1833. }
  1834. err = ubifs_remount_rw(c);
  1835. if (err)
  1836. return err;
  1837. } else if (!c->ro_mount && (*flags & MS_RDONLY)) {
  1838. if (c->ro_error) {
  1839. ubifs_msg(c, "cannot re-mount R/O due to prior errors");
  1840. return -EROFS;
  1841. }
  1842. ubifs_remount_ro(c);
  1843. }
  1844. if (c->bulk_read == 1)
  1845. bu_init(c);
  1846. else {
  1847. dbg_gen("disable bulk-read");
  1848. kfree(c->bu.buf);
  1849. c->bu.buf = NULL;
  1850. }
  1851. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1852. return 0;
  1853. }
  1854. #endif
  1855. const struct super_operations ubifs_super_operations = {
  1856. .alloc_inode = ubifs_alloc_inode,
  1857. #ifndef __UBOOT__
  1858. .destroy_inode = ubifs_destroy_inode,
  1859. .put_super = ubifs_put_super,
  1860. .write_inode = ubifs_write_inode,
  1861. .evict_inode = ubifs_evict_inode,
  1862. .statfs = ubifs_statfs,
  1863. #endif
  1864. .dirty_inode = ubifs_dirty_inode,
  1865. #ifndef __UBOOT__
  1866. .remount_fs = ubifs_remount_fs,
  1867. .show_options = ubifs_show_options,
  1868. .sync_fs = ubifs_sync_fs,
  1869. #endif
  1870. };
  1871. /**
  1872. * open_ubi - parse UBI device name string and open the UBI device.
  1873. * @name: UBI volume name
  1874. * @mode: UBI volume open mode
  1875. *
  1876. * The primary method of mounting UBIFS is by specifying the UBI volume
  1877. * character device node path. However, UBIFS may also be mounted withoug any
  1878. * character device node using one of the following methods:
  1879. *
  1880. * o ubiX_Y - mount UBI device number X, volume Y;
  1881. * o ubiY - mount UBI device number 0, volume Y;
  1882. * o ubiX:NAME - mount UBI device X, volume with name NAME;
  1883. * o ubi:NAME - mount UBI device 0, volume with name NAME.
  1884. *
  1885. * Alternative '!' separator may be used instead of ':' (because some shells
  1886. * like busybox may interpret ':' as an NFS host name separator). This function
  1887. * returns UBI volume description object in case of success and a negative
  1888. * error code in case of failure.
  1889. */
  1890. static struct ubi_volume_desc *open_ubi(const char *name, int mode)
  1891. {
  1892. #ifndef __UBOOT__
  1893. struct ubi_volume_desc *ubi;
  1894. #endif
  1895. int dev, vol;
  1896. char *endptr;
  1897. #ifndef __UBOOT__
  1898. /* First, try to open using the device node path method */
  1899. ubi = ubi_open_volume_path(name, mode);
  1900. if (!IS_ERR(ubi))
  1901. return ubi;
  1902. #endif
  1903. /* Try the "nodev" method */
  1904. if (name[0] != 'u' || name[1] != 'b' || name[2] != 'i')
  1905. return ERR_PTR(-EINVAL);
  1906. /* ubi:NAME method */
  1907. if ((name[3] == ':' || name[3] == '!') && name[4] != '\0')
  1908. return ubi_open_volume_nm(0, name + 4, mode);
  1909. if (!isdigit(name[3]))
  1910. return ERR_PTR(-EINVAL);
  1911. dev = simple_strtoul(name + 3, &endptr, 0);
  1912. /* ubiY method */
  1913. if (*endptr == '\0')
  1914. return ubi_open_volume(0, dev, mode);
  1915. /* ubiX_Y method */
  1916. if (*endptr == '_' && isdigit(endptr[1])) {
  1917. vol = simple_strtoul(endptr + 1, &endptr, 0);
  1918. if (*endptr != '\0')
  1919. return ERR_PTR(-EINVAL);
  1920. return ubi_open_volume(dev, vol, mode);
  1921. }
  1922. /* ubiX:NAME method */
  1923. if ((*endptr == ':' || *endptr == '!') && endptr[1] != '\0')
  1924. return ubi_open_volume_nm(dev, ++endptr, mode);
  1925. return ERR_PTR(-EINVAL);
  1926. }
  1927. static struct ubifs_info *alloc_ubifs_info(struct ubi_volume_desc *ubi)
  1928. {
  1929. struct ubifs_info *c;
  1930. c = kzalloc(sizeof(struct ubifs_info), GFP_KERNEL);
  1931. if (c) {
  1932. spin_lock_init(&c->cnt_lock);
  1933. spin_lock_init(&c->cs_lock);
  1934. spin_lock_init(&c->buds_lock);
  1935. spin_lock_init(&c->space_lock);
  1936. spin_lock_init(&c->orphan_lock);
  1937. init_rwsem(&c->commit_sem);
  1938. mutex_init(&c->lp_mutex);
  1939. mutex_init(&c->tnc_mutex);
  1940. mutex_init(&c->log_mutex);
  1941. mutex_init(&c->umount_mutex);
  1942. mutex_init(&c->bu_mutex);
  1943. mutex_init(&c->write_reserve_mutex);
  1944. init_waitqueue_head(&c->cmt_wq);
  1945. c->buds = RB_ROOT;
  1946. c->old_idx = RB_ROOT;
  1947. c->size_tree = RB_ROOT;
  1948. c->orph_tree = RB_ROOT;
  1949. INIT_LIST_HEAD(&c->infos_list);
  1950. INIT_LIST_HEAD(&c->idx_gc);
  1951. INIT_LIST_HEAD(&c->replay_list);
  1952. INIT_LIST_HEAD(&c->replay_buds);
  1953. INIT_LIST_HEAD(&c->uncat_list);
  1954. INIT_LIST_HEAD(&c->empty_list);
  1955. INIT_LIST_HEAD(&c->freeable_list);
  1956. INIT_LIST_HEAD(&c->frdi_idx_list);
  1957. INIT_LIST_HEAD(&c->unclean_leb_list);
  1958. INIT_LIST_HEAD(&c->old_buds);
  1959. INIT_LIST_HEAD(&c->orph_list);
  1960. INIT_LIST_HEAD(&c->orph_new);
  1961. c->no_chk_data_crc = 1;
  1962. c->highest_inum = UBIFS_FIRST_INO;
  1963. c->lhead_lnum = c->ltail_lnum = UBIFS_LOG_LNUM;
  1964. ubi_get_volume_info(ubi, &c->vi);
  1965. ubi_get_device_info(c->vi.ubi_num, &c->di);
  1966. }
  1967. return c;
  1968. }
  1969. static int ubifs_fill_super(struct super_block *sb, void *data, int silent)
  1970. {
  1971. struct ubifs_info *c = sb->s_fs_info;
  1972. struct inode *root;
  1973. int err;
  1974. c->vfs_sb = sb;
  1975. #ifndef __UBOOT__
  1976. /* Re-open the UBI device in read-write mode */
  1977. c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READWRITE);
  1978. #else
  1979. /* U-Boot read only mode */
  1980. c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READONLY);
  1981. #endif
  1982. if (IS_ERR(c->ubi)) {
  1983. err = PTR_ERR(c->ubi);
  1984. goto out;
  1985. }
  1986. #ifndef __UBOOT__
  1987. /*
  1988. * UBIFS provides 'backing_dev_info' in order to disable read-ahead. For
  1989. * UBIFS, I/O is not deferred, it is done immediately in readpage,
  1990. * which means the user would have to wait not just for their own I/O
  1991. * but the read-ahead I/O as well i.e. completely pointless.
  1992. *
  1993. * Read-ahead will be disabled because @c->bdi.ra_pages is 0.
  1994. */
  1995. c->bdi.name = "ubifs",
  1996. c->bdi.capabilities = 0;
  1997. err = bdi_init(&c->bdi);
  1998. if (err)
  1999. goto out_close;
  2000. err = bdi_register(&c->bdi, NULL, "ubifs_%d_%d",
  2001. c->vi.ubi_num, c->vi.vol_id);
  2002. if (err)
  2003. goto out_bdi;
  2004. err = ubifs_parse_options(c, data, 0);
  2005. if (err)
  2006. goto out_bdi;
  2007. sb->s_bdi = &c->bdi;
  2008. #endif
  2009. sb->s_fs_info = c;
  2010. sb->s_magic = UBIFS_SUPER_MAGIC;
  2011. sb->s_blocksize = UBIFS_BLOCK_SIZE;
  2012. sb->s_blocksize_bits = UBIFS_BLOCK_SHIFT;
  2013. sb->s_maxbytes = c->max_inode_sz = key_max_inode_size(c);
  2014. if (c->max_inode_sz > MAX_LFS_FILESIZE)
  2015. sb->s_maxbytes = c->max_inode_sz = MAX_LFS_FILESIZE;
  2016. sb->s_op = &ubifs_super_operations;
  2017. #ifndef __UBOOT__
  2018. sb->s_xattr = ubifs_xattr_handlers;
  2019. #endif
  2020. mutex_lock(&c->umount_mutex);
  2021. err = mount_ubifs(c);
  2022. if (err) {
  2023. ubifs_assert(err < 0);
  2024. goto out_unlock;
  2025. }
  2026. /* Read the root inode */
  2027. root = ubifs_iget(sb, UBIFS_ROOT_INO);
  2028. if (IS_ERR(root)) {
  2029. err = PTR_ERR(root);
  2030. goto out_umount;
  2031. }
  2032. #ifndef __UBOOT__
  2033. sb->s_root = d_make_root(root);
  2034. if (!sb->s_root) {
  2035. err = -ENOMEM;
  2036. goto out_umount;
  2037. }
  2038. #else
  2039. sb->s_root = NULL;
  2040. #endif
  2041. mutex_unlock(&c->umount_mutex);
  2042. return 0;
  2043. out_umount:
  2044. ubifs_umount(c);
  2045. out_unlock:
  2046. mutex_unlock(&c->umount_mutex);
  2047. #ifndef __UBOOT__
  2048. out_bdi:
  2049. bdi_destroy(&c->bdi);
  2050. out_close:
  2051. #endif
  2052. ubi_close_volume(c->ubi);
  2053. out:
  2054. return err;
  2055. }
  2056. static int sb_test(struct super_block *sb, void *data)
  2057. {
  2058. struct ubifs_info *c1 = data;
  2059. struct ubifs_info *c = sb->s_fs_info;
  2060. return c->vi.cdev == c1->vi.cdev;
  2061. }
  2062. static int sb_set(struct super_block *sb, void *data)
  2063. {
  2064. sb->s_fs_info = data;
  2065. return set_anon_super(sb, NULL);
  2066. }
  2067. static struct super_block *alloc_super(struct file_system_type *type, int flags)
  2068. {
  2069. struct super_block *s;
  2070. int err;
  2071. s = kzalloc(sizeof(struct super_block), GFP_USER);
  2072. if (!s) {
  2073. err = -ENOMEM;
  2074. return ERR_PTR(err);
  2075. }
  2076. INIT_HLIST_NODE(&s->s_instances);
  2077. INIT_LIST_HEAD(&s->s_inodes);
  2078. s->s_time_gran = 1000000000;
  2079. s->s_flags = flags;
  2080. return s;
  2081. }
  2082. /**
  2083. * sget - find or create a superblock
  2084. * @type: filesystem type superblock should belong to
  2085. * @test: comparison callback
  2086. * @set: setup callback
  2087. * @flags: mount flags
  2088. * @data: argument to each of them
  2089. */
  2090. struct super_block *sget(struct file_system_type *type,
  2091. int (*test)(struct super_block *,void *),
  2092. int (*set)(struct super_block *,void *),
  2093. int flags,
  2094. void *data)
  2095. {
  2096. struct super_block *s = NULL;
  2097. #ifndef __UBOOT__
  2098. struct super_block *old;
  2099. #endif
  2100. int err;
  2101. #ifndef __UBOOT__
  2102. retry:
  2103. spin_lock(&sb_lock);
  2104. if (test) {
  2105. hlist_for_each_entry(old, &type->fs_supers, s_instances) {
  2106. if (!test(old, data))
  2107. continue;
  2108. if (!grab_super(old))
  2109. goto retry;
  2110. if (s) {
  2111. up_write(&s->s_umount);
  2112. destroy_super(s);
  2113. s = NULL;
  2114. }
  2115. return old;
  2116. }
  2117. }
  2118. #endif
  2119. if (!s) {
  2120. spin_unlock(&sb_lock);
  2121. s = alloc_super(type, flags);
  2122. if (!s)
  2123. return ERR_PTR(-ENOMEM);
  2124. #ifndef __UBOOT__
  2125. goto retry;
  2126. #endif
  2127. }
  2128. err = set(s, data);
  2129. if (err) {
  2130. #ifndef __UBOOT__
  2131. spin_unlock(&sb_lock);
  2132. up_write(&s->s_umount);
  2133. destroy_super(s);
  2134. #endif
  2135. return ERR_PTR(err);
  2136. }
  2137. s->s_type = type;
  2138. #ifndef __UBOOT__
  2139. strlcpy(s->s_id, type->name, sizeof(s->s_id));
  2140. list_add_tail(&s->s_list, &super_blocks);
  2141. #else
  2142. strncpy(s->s_id, type->name, sizeof(s->s_id));
  2143. #endif
  2144. hlist_add_head(&s->s_instances, &type->fs_supers);
  2145. #ifndef __UBOOT__
  2146. spin_unlock(&sb_lock);
  2147. get_filesystem(type);
  2148. register_shrinker(&s->s_shrink);
  2149. #endif
  2150. return s;
  2151. }
  2152. EXPORT_SYMBOL(sget);
  2153. static struct dentry *ubifs_mount(struct file_system_type *fs_type, int flags,
  2154. const char *name, void *data)
  2155. {
  2156. struct ubi_volume_desc *ubi;
  2157. struct ubifs_info *c;
  2158. struct super_block *sb;
  2159. int err;
  2160. dbg_gen("name %s, flags %#x", name, flags);
  2161. /*
  2162. * Get UBI device number and volume ID. Mount it read-only so far
  2163. * because this might be a new mount point, and UBI allows only one
  2164. * read-write user at a time.
  2165. */
  2166. ubi = open_ubi(name, UBI_READONLY);
  2167. if (IS_ERR(ubi)) {
  2168. pr_err("UBIFS error (pid: %d): cannot open \"%s\", error %d",
  2169. current->pid, name, (int)PTR_ERR(ubi));
  2170. return ERR_CAST(ubi);
  2171. }
  2172. c = alloc_ubifs_info(ubi);
  2173. if (!c) {
  2174. err = -ENOMEM;
  2175. goto out_close;
  2176. }
  2177. dbg_gen("opened ubi%d_%d", c->vi.ubi_num, c->vi.vol_id);
  2178. sb = sget(fs_type, sb_test, sb_set, flags, c);
  2179. if (IS_ERR(sb)) {
  2180. err = PTR_ERR(sb);
  2181. kfree(c);
  2182. goto out_close;
  2183. }
  2184. if (sb->s_root) {
  2185. struct ubifs_info *c1 = sb->s_fs_info;
  2186. kfree(c);
  2187. /* A new mount point for already mounted UBIFS */
  2188. dbg_gen("this ubi volume is already mounted");
  2189. if (!!(flags & MS_RDONLY) != c1->ro_mount) {
  2190. err = -EBUSY;
  2191. goto out_deact;
  2192. }
  2193. } else {
  2194. err = ubifs_fill_super(sb, data, flags & MS_SILENT ? 1 : 0);
  2195. if (err)
  2196. goto out_deact;
  2197. /* We do not support atime */
  2198. sb->s_flags |= MS_ACTIVE | MS_NOATIME;
  2199. }
  2200. /* 'fill_super()' opens ubi again so we must close it here */
  2201. ubi_close_volume(ubi);
  2202. #ifdef __UBOOT__
  2203. ubifs_sb = sb;
  2204. return 0;
  2205. #else
  2206. return dget(sb->s_root);
  2207. #endif
  2208. out_deact:
  2209. #ifndef __UBOOT__
  2210. deactivate_locked_super(sb);
  2211. #endif
  2212. out_close:
  2213. ubi_close_volume(ubi);
  2214. return ERR_PTR(err);
  2215. }
  2216. static void kill_ubifs_super(struct super_block *s)
  2217. {
  2218. struct ubifs_info *c = s->s_fs_info;
  2219. #ifndef __UBOOT__
  2220. kill_anon_super(s);
  2221. #endif
  2222. kfree(c);
  2223. }
  2224. static struct file_system_type ubifs_fs_type = {
  2225. .name = "ubifs",
  2226. .owner = THIS_MODULE,
  2227. .mount = ubifs_mount,
  2228. .kill_sb = kill_ubifs_super,
  2229. };
  2230. #ifndef __UBOOT__
  2231. MODULE_ALIAS_FS("ubifs");
  2232. /*
  2233. * Inode slab cache constructor.
  2234. */
  2235. static void inode_slab_ctor(void *obj)
  2236. {
  2237. struct ubifs_inode *ui = obj;
  2238. inode_init_once(&ui->vfs_inode);
  2239. }
  2240. static int __init ubifs_init(void)
  2241. #else
  2242. int ubifs_init(void)
  2243. #endif
  2244. {
  2245. int err;
  2246. BUILD_BUG_ON(sizeof(struct ubifs_ch) != 24);
  2247. /* Make sure node sizes are 8-byte aligned */
  2248. BUILD_BUG_ON(UBIFS_CH_SZ & 7);
  2249. BUILD_BUG_ON(UBIFS_INO_NODE_SZ & 7);
  2250. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ & 7);
  2251. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ & 7);
  2252. BUILD_BUG_ON(UBIFS_DATA_NODE_SZ & 7);
  2253. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ & 7);
  2254. BUILD_BUG_ON(UBIFS_SB_NODE_SZ & 7);
  2255. BUILD_BUG_ON(UBIFS_MST_NODE_SZ & 7);
  2256. BUILD_BUG_ON(UBIFS_REF_NODE_SZ & 7);
  2257. BUILD_BUG_ON(UBIFS_CS_NODE_SZ & 7);
  2258. BUILD_BUG_ON(UBIFS_ORPH_NODE_SZ & 7);
  2259. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ & 7);
  2260. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ & 7);
  2261. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ & 7);
  2262. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ & 7);
  2263. BUILD_BUG_ON(UBIFS_MAX_NODE_SZ & 7);
  2264. BUILD_BUG_ON(MIN_WRITE_SZ & 7);
  2265. /* Check min. node size */
  2266. BUILD_BUG_ON(UBIFS_INO_NODE_SZ < MIN_WRITE_SZ);
  2267. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ < MIN_WRITE_SZ);
  2268. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ < MIN_WRITE_SZ);
  2269. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ < MIN_WRITE_SZ);
  2270. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2271. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2272. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2273. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2274. /* Defined node sizes */
  2275. BUILD_BUG_ON(UBIFS_SB_NODE_SZ != 4096);
  2276. BUILD_BUG_ON(UBIFS_MST_NODE_SZ != 512);
  2277. BUILD_BUG_ON(UBIFS_INO_NODE_SZ != 160);
  2278. BUILD_BUG_ON(UBIFS_REF_NODE_SZ != 64);
  2279. /*
  2280. * We use 2 bit wide bit-fields to store compression type, which should
  2281. * be amended if more compressors are added. The bit-fields are:
  2282. * @compr_type in 'struct ubifs_inode', @default_compr in
  2283. * 'struct ubifs_info' and @compr_type in 'struct ubifs_mount_opts'.
  2284. */
  2285. BUILD_BUG_ON(UBIFS_COMPR_TYPES_CNT > 4);
  2286. /*
  2287. * We require that PAGE_CACHE_SIZE is greater-than-or-equal-to
  2288. * UBIFS_BLOCK_SIZE. It is assumed that both are powers of 2.
  2289. */
  2290. if (PAGE_CACHE_SIZE < UBIFS_BLOCK_SIZE) {
  2291. pr_err("UBIFS error (pid %d): VFS page cache size is %u bytes, but UBIFS requires at least 4096 bytes",
  2292. current->pid, (unsigned int)PAGE_CACHE_SIZE);
  2293. return -EINVAL;
  2294. }
  2295. #ifndef __UBOOT__
  2296. ubifs_inode_slab = kmem_cache_create("ubifs_inode_slab",
  2297. sizeof(struct ubifs_inode), 0,
  2298. SLAB_MEM_SPREAD | SLAB_RECLAIM_ACCOUNT,
  2299. &inode_slab_ctor);
  2300. if (!ubifs_inode_slab)
  2301. return -ENOMEM;
  2302. err = register_shrinker(&ubifs_shrinker_info);
  2303. if (err)
  2304. goto out_slab;
  2305. #endif
  2306. err = ubifs_compressors_init();
  2307. if (err)
  2308. goto out_shrinker;
  2309. #ifndef __UBOOT__
  2310. err = dbg_debugfs_init();
  2311. if (err)
  2312. goto out_compr;
  2313. err = register_filesystem(&ubifs_fs_type);
  2314. if (err) {
  2315. pr_err("UBIFS error (pid %d): cannot register file system, error %d",
  2316. current->pid, err);
  2317. goto out_dbg;
  2318. }
  2319. #endif
  2320. return 0;
  2321. #ifndef __UBOOT__
  2322. out_dbg:
  2323. dbg_debugfs_exit();
  2324. out_compr:
  2325. ubifs_compressors_exit();
  2326. #endif
  2327. out_shrinker:
  2328. #ifndef __UBOOT__
  2329. unregister_shrinker(&ubifs_shrinker_info);
  2330. out_slab:
  2331. #endif
  2332. kmem_cache_destroy(ubifs_inode_slab);
  2333. return err;
  2334. }
  2335. /* late_initcall to let compressors initialize first */
  2336. late_initcall(ubifs_init);
  2337. #ifndef __UBOOT__
  2338. static void __exit ubifs_exit(void)
  2339. {
  2340. ubifs_assert(list_empty(&ubifs_infos));
  2341. ubifs_assert(atomic_long_read(&ubifs_clean_zn_cnt) == 0);
  2342. dbg_debugfs_exit();
  2343. ubifs_compressors_exit();
  2344. unregister_shrinker(&ubifs_shrinker_info);
  2345. /*
  2346. * Make sure all delayed rcu free inodes are flushed before we
  2347. * destroy cache.
  2348. */
  2349. rcu_barrier();
  2350. kmem_cache_destroy(ubifs_inode_slab);
  2351. unregister_filesystem(&ubifs_fs_type);
  2352. }
  2353. module_exit(ubifs_exit);
  2354. MODULE_LICENSE("GPL");
  2355. MODULE_VERSION(__stringify(UBIFS_VERSION));
  2356. MODULE_AUTHOR("Artem Bityutskiy, Adrian Hunter");
  2357. MODULE_DESCRIPTION("UBIFS - UBI File System");
  2358. #else
  2359. int uboot_ubifs_mount(char *vol_name)
  2360. {
  2361. struct dentry *ret;
  2362. int flags;
  2363. /*
  2364. * First unmount if allready mounted
  2365. */
  2366. if (ubifs_sb)
  2367. ubifs_umount(ubifs_sb->s_fs_info);
  2368. /*
  2369. * Mount in read-only mode
  2370. */
  2371. flags = MS_RDONLY;
  2372. ret = ubifs_mount(&ubifs_fs_type, flags, vol_name, NULL);
  2373. if (IS_ERR(ret)) {
  2374. printf("Error reading superblock on volume '%s' " \
  2375. "errno=%d!\n", vol_name, (int)PTR_ERR(ret));
  2376. return -1;
  2377. }
  2378. return 0;
  2379. }
  2380. #endif