super.c 67 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709
  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;
  1178. #ifndef CONFIG_UBIFS_SILENCE_MSG
  1179. long long y;
  1180. #endif
  1181. size_t sz;
  1182. c->ro_mount = !!(c->vfs_sb->s_flags & MS_RDONLY);
  1183. /* Suppress error messages while probing if MS_SILENT is set */
  1184. c->probing = !!(c->vfs_sb->s_flags & MS_SILENT);
  1185. #ifdef __UBOOT__
  1186. if (!c->ro_mount) {
  1187. printf("UBIFS: only ro mode in U-Boot allowed.\n");
  1188. return -EACCES;
  1189. }
  1190. #endif
  1191. err = init_constants_early(c);
  1192. if (err)
  1193. return err;
  1194. err = ubifs_debugging_init(c);
  1195. if (err)
  1196. return err;
  1197. err = check_volume_empty(c);
  1198. if (err)
  1199. goto out_free;
  1200. if (c->empty && (c->ro_mount || c->ro_media)) {
  1201. /*
  1202. * This UBI volume is empty, and read-only, or the file system
  1203. * is mounted read-only - we cannot format it.
  1204. */
  1205. ubifs_err(c, "can't format empty UBI volume: read-only %s",
  1206. c->ro_media ? "UBI volume" : "mount");
  1207. err = -EROFS;
  1208. goto out_free;
  1209. }
  1210. if (c->ro_media && !c->ro_mount) {
  1211. ubifs_err(c, "cannot mount read-write - read-only media");
  1212. err = -EROFS;
  1213. goto out_free;
  1214. }
  1215. /*
  1216. * The requirement for the buffer is that it should fit indexing B-tree
  1217. * height amount of integers. We assume the height if the TNC tree will
  1218. * never exceed 64.
  1219. */
  1220. err = -ENOMEM;
  1221. c->bottom_up_buf = kmalloc(BOTTOM_UP_HEIGHT * sizeof(int), GFP_KERNEL);
  1222. if (!c->bottom_up_buf)
  1223. goto out_free;
  1224. c->sbuf = vmalloc(c->leb_size);
  1225. if (!c->sbuf)
  1226. goto out_free;
  1227. #ifndef __UBOOT__
  1228. if (!c->ro_mount) {
  1229. c->ileb_buf = vmalloc(c->leb_size);
  1230. if (!c->ileb_buf)
  1231. goto out_free;
  1232. }
  1233. #endif
  1234. if (c->bulk_read == 1)
  1235. bu_init(c);
  1236. #ifndef __UBOOT__
  1237. if (!c->ro_mount) {
  1238. c->write_reserve_buf = kmalloc(COMPRESSED_DATA_NODE_BUF_SZ,
  1239. GFP_KERNEL);
  1240. if (!c->write_reserve_buf)
  1241. goto out_free;
  1242. }
  1243. #endif
  1244. c->mounting = 1;
  1245. err = ubifs_read_superblock(c);
  1246. if (err)
  1247. goto out_free;
  1248. c->probing = 0;
  1249. /*
  1250. * Make sure the compressor which is set as default in the superblock
  1251. * or overridden by mount options is actually compiled in.
  1252. */
  1253. if (!ubifs_compr_present(c->default_compr)) {
  1254. ubifs_err(c, "'compressor \"%s\" is not compiled in",
  1255. ubifs_compr_name(c->default_compr));
  1256. err = -ENOTSUPP;
  1257. goto out_free;
  1258. }
  1259. err = init_constants_sb(c);
  1260. if (err)
  1261. goto out_free;
  1262. sz = ALIGN(c->max_idx_node_sz, c->min_io_size);
  1263. sz = ALIGN(sz + c->max_idx_node_sz, c->min_io_size);
  1264. c->cbuf = kmalloc(sz, GFP_NOFS);
  1265. if (!c->cbuf) {
  1266. err = -ENOMEM;
  1267. goto out_free;
  1268. }
  1269. err = alloc_wbufs(c);
  1270. if (err)
  1271. goto out_cbuf;
  1272. sprintf(c->bgt_name, BGT_NAME_PATTERN, c->vi.ubi_num, c->vi.vol_id);
  1273. #ifndef __UBOOT__
  1274. if (!c->ro_mount) {
  1275. /* Create background thread */
  1276. c->bgt = kthread_create(ubifs_bg_thread, c, "%s", c->bgt_name);
  1277. if (IS_ERR(c->bgt)) {
  1278. err = PTR_ERR(c->bgt);
  1279. c->bgt = NULL;
  1280. ubifs_err(c, "cannot spawn \"%s\", error %d",
  1281. c->bgt_name, err);
  1282. goto out_wbufs;
  1283. }
  1284. wake_up_process(c->bgt);
  1285. }
  1286. #endif
  1287. err = ubifs_read_master(c);
  1288. if (err)
  1289. goto out_master;
  1290. init_constants_master(c);
  1291. if ((c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY)) != 0) {
  1292. ubifs_msg(c, "recovery needed");
  1293. c->need_recovery = 1;
  1294. }
  1295. #ifndef __UBOOT__
  1296. if (c->need_recovery && !c->ro_mount) {
  1297. err = ubifs_recover_inl_heads(c, c->sbuf);
  1298. if (err)
  1299. goto out_master;
  1300. }
  1301. #endif
  1302. err = ubifs_lpt_init(c, 1, !c->ro_mount);
  1303. if (err)
  1304. goto out_master;
  1305. #ifndef __UBOOT__
  1306. if (!c->ro_mount && c->space_fixup) {
  1307. err = ubifs_fixup_free_space(c);
  1308. if (err)
  1309. goto out_lpt;
  1310. }
  1311. if (!c->ro_mount && !c->need_recovery) {
  1312. /*
  1313. * Set the "dirty" flag so that if we reboot uncleanly we
  1314. * will notice this immediately on the next mount.
  1315. */
  1316. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1317. err = ubifs_write_master(c);
  1318. if (err)
  1319. goto out_lpt;
  1320. }
  1321. #endif
  1322. err = dbg_check_idx_size(c, c->bi.old_idx_sz);
  1323. if (err)
  1324. goto out_lpt;
  1325. err = ubifs_replay_journal(c);
  1326. if (err)
  1327. goto out_journal;
  1328. /* Calculate 'min_idx_lebs' after journal replay */
  1329. c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);
  1330. err = ubifs_mount_orphans(c, c->need_recovery, c->ro_mount);
  1331. if (err)
  1332. goto out_orphans;
  1333. if (!c->ro_mount) {
  1334. #ifndef __UBOOT__
  1335. int lnum;
  1336. err = check_free_space(c);
  1337. if (err)
  1338. goto out_orphans;
  1339. /* Check for enough log space */
  1340. lnum = c->lhead_lnum + 1;
  1341. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1342. lnum = UBIFS_LOG_LNUM;
  1343. if (lnum == c->ltail_lnum) {
  1344. err = ubifs_consolidate_log(c);
  1345. if (err)
  1346. goto out_orphans;
  1347. }
  1348. if (c->need_recovery) {
  1349. err = ubifs_recover_size(c);
  1350. if (err)
  1351. goto out_orphans;
  1352. err = ubifs_rcvry_gc_commit(c);
  1353. if (err)
  1354. goto out_orphans;
  1355. } else {
  1356. err = take_gc_lnum(c);
  1357. if (err)
  1358. goto out_orphans;
  1359. /*
  1360. * GC LEB may contain garbage if there was an unclean
  1361. * reboot, and it should be un-mapped.
  1362. */
  1363. err = ubifs_leb_unmap(c, c->gc_lnum);
  1364. if (err)
  1365. goto out_orphans;
  1366. }
  1367. err = dbg_check_lprops(c);
  1368. if (err)
  1369. goto out_orphans;
  1370. #endif
  1371. } else if (c->need_recovery) {
  1372. err = ubifs_recover_size(c);
  1373. if (err)
  1374. goto out_orphans;
  1375. } else {
  1376. /*
  1377. * Even if we mount read-only, we have to set space in GC LEB
  1378. * to proper value because this affects UBIFS free space
  1379. * reporting. We do not want to have a situation when
  1380. * re-mounting from R/O to R/W changes amount of free space.
  1381. */
  1382. err = take_gc_lnum(c);
  1383. if (err)
  1384. goto out_orphans;
  1385. }
  1386. #ifndef __UBOOT__
  1387. spin_lock(&ubifs_infos_lock);
  1388. list_add_tail(&c->infos_list, &ubifs_infos);
  1389. spin_unlock(&ubifs_infos_lock);
  1390. #endif
  1391. if (c->need_recovery) {
  1392. if (c->ro_mount)
  1393. ubifs_msg(c, "recovery deferred");
  1394. else {
  1395. c->need_recovery = 0;
  1396. ubifs_msg(c, "recovery completed");
  1397. /*
  1398. * GC LEB has to be empty and taken at this point. But
  1399. * the journal head LEBs may also be accounted as
  1400. * "empty taken" if they are empty.
  1401. */
  1402. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1403. }
  1404. } else
  1405. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1406. err = dbg_check_filesystem(c);
  1407. if (err)
  1408. goto out_infos;
  1409. err = dbg_debugfs_init_fs(c);
  1410. if (err)
  1411. goto out_infos;
  1412. c->mounting = 0;
  1413. ubifs_msg(c, "UBIFS: mounted UBI device %d, volume %d, name \"%s\"%s",
  1414. c->vi.ubi_num, c->vi.vol_id, c->vi.name,
  1415. c->ro_mount ? ", R/O mode" : "");
  1416. x = (long long)c->main_lebs * c->leb_size;
  1417. #ifndef CONFIG_UBIFS_SILENCE_MSG
  1418. y = (long long)c->log_lebs * c->leb_size + c->max_bud_bytes;
  1419. #endif
  1420. ubifs_msg(c, "LEB size: %d bytes (%d KiB), min./max. I/O unit sizes: %d bytes/%d bytes",
  1421. c->leb_size, c->leb_size >> 10, c->min_io_size,
  1422. c->max_write_size);
  1423. ubifs_msg(c, "FS size: %lld bytes (%lld MiB, %d LEBs), journal size %lld bytes (%lld MiB, %d LEBs)",
  1424. x, x >> 20, c->main_lebs,
  1425. y, y >> 20, c->log_lebs + c->max_bud_cnt);
  1426. ubifs_msg(c, "reserved for root: %llu bytes (%llu KiB)",
  1427. c->report_rp_size, c->report_rp_size >> 10);
  1428. ubifs_msg(c, "media format: w%d/r%d (latest is w%d/r%d), UUID %pUB%s",
  1429. c->fmt_version, c->ro_compat_version,
  1430. UBIFS_FORMAT_VERSION, UBIFS_RO_COMPAT_VERSION, c->uuid,
  1431. c->big_lpt ? ", big LPT model" : ", small LPT model");
  1432. dbg_gen("default compressor: %s", ubifs_compr_name(c->default_compr));
  1433. dbg_gen("data journal heads: %d",
  1434. c->jhead_cnt - NONDATA_JHEADS_CNT);
  1435. dbg_gen("log LEBs: %d (%d - %d)",
  1436. c->log_lebs, UBIFS_LOG_LNUM, c->log_last);
  1437. dbg_gen("LPT area LEBs: %d (%d - %d)",
  1438. c->lpt_lebs, c->lpt_first, c->lpt_last);
  1439. dbg_gen("orphan area LEBs: %d (%d - %d)",
  1440. c->orph_lebs, c->orph_first, c->orph_last);
  1441. dbg_gen("main area LEBs: %d (%d - %d)",
  1442. c->main_lebs, c->main_first, c->leb_cnt - 1);
  1443. dbg_gen("index LEBs: %d", c->lst.idx_lebs);
  1444. dbg_gen("total index bytes: %lld (%lld KiB, %lld MiB)",
  1445. c->bi.old_idx_sz, c->bi.old_idx_sz >> 10,
  1446. c->bi.old_idx_sz >> 20);
  1447. dbg_gen("key hash type: %d", c->key_hash_type);
  1448. dbg_gen("tree fanout: %d", c->fanout);
  1449. dbg_gen("reserved GC LEB: %d", c->gc_lnum);
  1450. dbg_gen("max. znode size %d", c->max_znode_sz);
  1451. dbg_gen("max. index node size %d", c->max_idx_node_sz);
  1452. dbg_gen("node sizes: data %zu, inode %zu, dentry %zu",
  1453. UBIFS_DATA_NODE_SZ, UBIFS_INO_NODE_SZ, UBIFS_DENT_NODE_SZ);
  1454. dbg_gen("node sizes: trun %zu, sb %zu, master %zu",
  1455. UBIFS_TRUN_NODE_SZ, UBIFS_SB_NODE_SZ, UBIFS_MST_NODE_SZ);
  1456. dbg_gen("node sizes: ref %zu, cmt. start %zu, orph %zu",
  1457. UBIFS_REF_NODE_SZ, UBIFS_CS_NODE_SZ, UBIFS_ORPH_NODE_SZ);
  1458. dbg_gen("max. node sizes: data %zu, inode %zu dentry %zu, idx %d",
  1459. UBIFS_MAX_DATA_NODE_SZ, UBIFS_MAX_INO_NODE_SZ,
  1460. UBIFS_MAX_DENT_NODE_SZ, ubifs_idx_node_sz(c, c->fanout));
  1461. dbg_gen("dead watermark: %d", c->dead_wm);
  1462. dbg_gen("dark watermark: %d", c->dark_wm);
  1463. dbg_gen("LEB overhead: %d", c->leb_overhead);
  1464. x = (long long)c->main_lebs * c->dark_wm;
  1465. dbg_gen("max. dark space: %lld (%lld KiB, %lld MiB)",
  1466. x, x >> 10, x >> 20);
  1467. dbg_gen("maximum bud bytes: %lld (%lld KiB, %lld MiB)",
  1468. c->max_bud_bytes, c->max_bud_bytes >> 10,
  1469. c->max_bud_bytes >> 20);
  1470. dbg_gen("BG commit bud bytes: %lld (%lld KiB, %lld MiB)",
  1471. c->bg_bud_bytes, c->bg_bud_bytes >> 10,
  1472. c->bg_bud_bytes >> 20);
  1473. dbg_gen("current bud bytes %lld (%lld KiB, %lld MiB)",
  1474. c->bud_bytes, c->bud_bytes >> 10, c->bud_bytes >> 20);
  1475. dbg_gen("max. seq. number: %llu", c->max_sqnum);
  1476. dbg_gen("commit number: %llu", c->cmt_no);
  1477. return 0;
  1478. out_infos:
  1479. spin_lock(&ubifs_infos_lock);
  1480. list_del(&c->infos_list);
  1481. spin_unlock(&ubifs_infos_lock);
  1482. out_orphans:
  1483. free_orphans(c);
  1484. out_journal:
  1485. destroy_journal(c);
  1486. out_lpt:
  1487. ubifs_lpt_free(c, 0);
  1488. out_master:
  1489. kfree(c->mst_node);
  1490. kfree(c->rcvrd_mst_node);
  1491. if (c->bgt)
  1492. kthread_stop(c->bgt);
  1493. #ifndef __UBOOT__
  1494. out_wbufs:
  1495. #endif
  1496. free_wbufs(c);
  1497. out_cbuf:
  1498. kfree(c->cbuf);
  1499. out_free:
  1500. kfree(c->write_reserve_buf);
  1501. kfree(c->bu.buf);
  1502. vfree(c->ileb_buf);
  1503. vfree(c->sbuf);
  1504. kfree(c->bottom_up_buf);
  1505. ubifs_debugging_exit(c);
  1506. return err;
  1507. }
  1508. /**
  1509. * ubifs_umount - un-mount UBIFS file-system.
  1510. * @c: UBIFS file-system description object
  1511. *
  1512. * Note, this function is called to free allocated resourced when un-mounting,
  1513. * as well as free resources when an error occurred while we were half way
  1514. * through mounting (error path cleanup function). So it has to make sure the
  1515. * resource was actually allocated before freeing it.
  1516. */
  1517. #ifndef __UBOOT__
  1518. static void ubifs_umount(struct ubifs_info *c)
  1519. #else
  1520. void ubifs_umount(struct ubifs_info *c)
  1521. #endif
  1522. {
  1523. dbg_gen("un-mounting UBI device %d, volume %d", c->vi.ubi_num,
  1524. c->vi.vol_id);
  1525. dbg_debugfs_exit_fs(c);
  1526. spin_lock(&ubifs_infos_lock);
  1527. list_del(&c->infos_list);
  1528. spin_unlock(&ubifs_infos_lock);
  1529. #ifndef __UBOOT__
  1530. if (c->bgt)
  1531. kthread_stop(c->bgt);
  1532. destroy_journal(c);
  1533. #endif
  1534. free_wbufs(c);
  1535. free_orphans(c);
  1536. ubifs_lpt_free(c, 0);
  1537. kfree(c->cbuf);
  1538. kfree(c->rcvrd_mst_node);
  1539. kfree(c->mst_node);
  1540. kfree(c->write_reserve_buf);
  1541. kfree(c->bu.buf);
  1542. vfree(c->ileb_buf);
  1543. vfree(c->sbuf);
  1544. kfree(c->bottom_up_buf);
  1545. ubifs_debugging_exit(c);
  1546. #ifdef __UBOOT__
  1547. /* Finally free U-Boot's global copy of superblock */
  1548. if (ubifs_sb != NULL) {
  1549. free(ubifs_sb->s_fs_info);
  1550. free(ubifs_sb);
  1551. }
  1552. #endif
  1553. }
  1554. #ifndef __UBOOT__
  1555. /**
  1556. * ubifs_remount_rw - re-mount in read-write mode.
  1557. * @c: UBIFS file-system description object
  1558. *
  1559. * UBIFS avoids allocating many unnecessary resources when mounted in read-only
  1560. * mode. This function allocates the needed resources and re-mounts UBIFS in
  1561. * read-write mode.
  1562. */
  1563. static int ubifs_remount_rw(struct ubifs_info *c)
  1564. {
  1565. int err, lnum;
  1566. if (c->rw_incompat) {
  1567. ubifs_err(c, "the file-system is not R/W-compatible");
  1568. ubifs_msg(c, "on-flash format version is w%d/r%d, but software only supports up to version w%d/r%d",
  1569. c->fmt_version, c->ro_compat_version,
  1570. UBIFS_FORMAT_VERSION, UBIFS_RO_COMPAT_VERSION);
  1571. return -EROFS;
  1572. }
  1573. mutex_lock(&c->umount_mutex);
  1574. dbg_save_space_info(c);
  1575. c->remounting_rw = 1;
  1576. c->ro_mount = 0;
  1577. if (c->space_fixup) {
  1578. err = ubifs_fixup_free_space(c);
  1579. if (err)
  1580. goto out;
  1581. }
  1582. err = check_free_space(c);
  1583. if (err)
  1584. goto out;
  1585. if (c->old_leb_cnt != c->leb_cnt) {
  1586. struct ubifs_sb_node *sup;
  1587. sup = ubifs_read_sb_node(c);
  1588. if (IS_ERR(sup)) {
  1589. err = PTR_ERR(sup);
  1590. goto out;
  1591. }
  1592. sup->leb_cnt = cpu_to_le32(c->leb_cnt);
  1593. err = ubifs_write_sb_node(c, sup);
  1594. kfree(sup);
  1595. if (err)
  1596. goto out;
  1597. }
  1598. if (c->need_recovery) {
  1599. ubifs_msg(c, "completing deferred recovery");
  1600. err = ubifs_write_rcvrd_mst_node(c);
  1601. if (err)
  1602. goto out;
  1603. err = ubifs_recover_size(c);
  1604. if (err)
  1605. goto out;
  1606. err = ubifs_clean_lebs(c, c->sbuf);
  1607. if (err)
  1608. goto out;
  1609. err = ubifs_recover_inl_heads(c, c->sbuf);
  1610. if (err)
  1611. goto out;
  1612. } else {
  1613. /* A readonly mount is not allowed to have orphans */
  1614. ubifs_assert(c->tot_orphans == 0);
  1615. err = ubifs_clear_orphans(c);
  1616. if (err)
  1617. goto out;
  1618. }
  1619. if (!(c->mst_node->flags & cpu_to_le32(UBIFS_MST_DIRTY))) {
  1620. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_DIRTY);
  1621. err = ubifs_write_master(c);
  1622. if (err)
  1623. goto out;
  1624. }
  1625. c->ileb_buf = vmalloc(c->leb_size);
  1626. if (!c->ileb_buf) {
  1627. err = -ENOMEM;
  1628. goto out;
  1629. }
  1630. c->write_reserve_buf = kmalloc(COMPRESSED_DATA_NODE_BUF_SZ, GFP_KERNEL);
  1631. if (!c->write_reserve_buf) {
  1632. err = -ENOMEM;
  1633. goto out;
  1634. }
  1635. err = ubifs_lpt_init(c, 0, 1);
  1636. if (err)
  1637. goto out;
  1638. /* Create background thread */
  1639. c->bgt = kthread_create(ubifs_bg_thread, c, "%s", c->bgt_name);
  1640. if (IS_ERR(c->bgt)) {
  1641. err = PTR_ERR(c->bgt);
  1642. c->bgt = NULL;
  1643. ubifs_err(c, "cannot spawn \"%s\", error %d",
  1644. c->bgt_name, err);
  1645. goto out;
  1646. }
  1647. wake_up_process(c->bgt);
  1648. c->orph_buf = vmalloc(c->leb_size);
  1649. if (!c->orph_buf) {
  1650. err = -ENOMEM;
  1651. goto out;
  1652. }
  1653. /* Check for enough log space */
  1654. lnum = c->lhead_lnum + 1;
  1655. if (lnum >= UBIFS_LOG_LNUM + c->log_lebs)
  1656. lnum = UBIFS_LOG_LNUM;
  1657. if (lnum == c->ltail_lnum) {
  1658. err = ubifs_consolidate_log(c);
  1659. if (err)
  1660. goto out;
  1661. }
  1662. if (c->need_recovery)
  1663. err = ubifs_rcvry_gc_commit(c);
  1664. else
  1665. err = ubifs_leb_unmap(c, c->gc_lnum);
  1666. if (err)
  1667. goto out;
  1668. dbg_gen("re-mounted read-write");
  1669. c->remounting_rw = 0;
  1670. if (c->need_recovery) {
  1671. c->need_recovery = 0;
  1672. ubifs_msg(c, "deferred recovery completed");
  1673. } else {
  1674. /*
  1675. * Do not run the debugging space check if the were doing
  1676. * recovery, because when we saved the information we had the
  1677. * file-system in a state where the TNC and lprops has been
  1678. * modified in memory, but all the I/O operations (including a
  1679. * commit) were deferred. So the file-system was in
  1680. * "non-committed" state. Now the file-system is in committed
  1681. * state, and of course the amount of free space will change
  1682. * because, for example, the old index size was imprecise.
  1683. */
  1684. err = dbg_check_space_info(c);
  1685. }
  1686. mutex_unlock(&c->umount_mutex);
  1687. return err;
  1688. out:
  1689. c->ro_mount = 1;
  1690. vfree(c->orph_buf);
  1691. c->orph_buf = NULL;
  1692. if (c->bgt) {
  1693. kthread_stop(c->bgt);
  1694. c->bgt = NULL;
  1695. }
  1696. free_wbufs(c);
  1697. kfree(c->write_reserve_buf);
  1698. c->write_reserve_buf = NULL;
  1699. vfree(c->ileb_buf);
  1700. c->ileb_buf = NULL;
  1701. ubifs_lpt_free(c, 1);
  1702. c->remounting_rw = 0;
  1703. mutex_unlock(&c->umount_mutex);
  1704. return err;
  1705. }
  1706. /**
  1707. * ubifs_remount_ro - re-mount in read-only mode.
  1708. * @c: UBIFS file-system description object
  1709. *
  1710. * We assume VFS has stopped writing. Possibly the background thread could be
  1711. * running a commit, however kthread_stop will wait in that case.
  1712. */
  1713. static void ubifs_remount_ro(struct ubifs_info *c)
  1714. {
  1715. int i, err;
  1716. ubifs_assert(!c->need_recovery);
  1717. ubifs_assert(!c->ro_mount);
  1718. mutex_lock(&c->umount_mutex);
  1719. if (c->bgt) {
  1720. kthread_stop(c->bgt);
  1721. c->bgt = NULL;
  1722. }
  1723. dbg_save_space_info(c);
  1724. for (i = 0; i < c->jhead_cnt; i++)
  1725. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1726. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1727. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1728. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1729. err = ubifs_write_master(c);
  1730. if (err)
  1731. ubifs_ro_mode(c, err);
  1732. vfree(c->orph_buf);
  1733. c->orph_buf = NULL;
  1734. kfree(c->write_reserve_buf);
  1735. c->write_reserve_buf = NULL;
  1736. vfree(c->ileb_buf);
  1737. c->ileb_buf = NULL;
  1738. ubifs_lpt_free(c, 1);
  1739. c->ro_mount = 1;
  1740. err = dbg_check_space_info(c);
  1741. if (err)
  1742. ubifs_ro_mode(c, err);
  1743. mutex_unlock(&c->umount_mutex);
  1744. }
  1745. static void ubifs_put_super(struct super_block *sb)
  1746. {
  1747. int i;
  1748. struct ubifs_info *c = sb->s_fs_info;
  1749. ubifs_msg(c, "un-mount UBI device %d", c->vi.ubi_num);
  1750. /*
  1751. * The following asserts are only valid if there has not been a failure
  1752. * of the media. For example, there will be dirty inodes if we failed
  1753. * to write them back because of I/O errors.
  1754. */
  1755. if (!c->ro_error) {
  1756. ubifs_assert(c->bi.idx_growth == 0);
  1757. ubifs_assert(c->bi.dd_growth == 0);
  1758. ubifs_assert(c->bi.data_growth == 0);
  1759. }
  1760. /*
  1761. * The 'c->umount_lock' prevents races between UBIFS memory shrinker
  1762. * and file system un-mount. Namely, it prevents the shrinker from
  1763. * picking this superblock for shrinking - it will be just skipped if
  1764. * the mutex is locked.
  1765. */
  1766. mutex_lock(&c->umount_mutex);
  1767. if (!c->ro_mount) {
  1768. /*
  1769. * First of all kill the background thread to make sure it does
  1770. * not interfere with un-mounting and freeing resources.
  1771. */
  1772. if (c->bgt) {
  1773. kthread_stop(c->bgt);
  1774. c->bgt = NULL;
  1775. }
  1776. /*
  1777. * On fatal errors c->ro_error is set to 1, in which case we do
  1778. * not write the master node.
  1779. */
  1780. if (!c->ro_error) {
  1781. int err;
  1782. /* Synchronize write-buffers */
  1783. for (i = 0; i < c->jhead_cnt; i++)
  1784. ubifs_wbuf_sync(&c->jheads[i].wbuf);
  1785. /*
  1786. * We are being cleanly unmounted which means the
  1787. * orphans were killed - indicate this in the master
  1788. * node. Also save the reserved GC LEB number.
  1789. */
  1790. c->mst_node->flags &= ~cpu_to_le32(UBIFS_MST_DIRTY);
  1791. c->mst_node->flags |= cpu_to_le32(UBIFS_MST_NO_ORPHS);
  1792. c->mst_node->gc_lnum = cpu_to_le32(c->gc_lnum);
  1793. err = ubifs_write_master(c);
  1794. if (err)
  1795. /*
  1796. * Recovery will attempt to fix the master area
  1797. * next mount, so we just print a message and
  1798. * continue to unmount normally.
  1799. */
  1800. ubifs_err(c, "failed to write master node, error %d",
  1801. err);
  1802. } else {
  1803. #ifndef __UBOOT__
  1804. for (i = 0; i < c->jhead_cnt; i++)
  1805. /* Make sure write-buffer timers are canceled */
  1806. hrtimer_cancel(&c->jheads[i].wbuf.timer);
  1807. #endif
  1808. }
  1809. }
  1810. ubifs_umount(c);
  1811. #ifndef __UBOOT__
  1812. bdi_destroy(&c->bdi);
  1813. #endif
  1814. ubi_close_volume(c->ubi);
  1815. mutex_unlock(&c->umount_mutex);
  1816. }
  1817. #endif
  1818. #ifndef __UBOOT__
  1819. static int ubifs_remount_fs(struct super_block *sb, int *flags, char *data)
  1820. {
  1821. int err;
  1822. struct ubifs_info *c = sb->s_fs_info;
  1823. sync_filesystem(sb);
  1824. dbg_gen("old flags %#lx, new flags %#x", sb->s_flags, *flags);
  1825. err = ubifs_parse_options(c, data, 1);
  1826. if (err) {
  1827. ubifs_err(c, "invalid or unknown remount parameter");
  1828. return err;
  1829. }
  1830. if (c->ro_mount && !(*flags & MS_RDONLY)) {
  1831. if (c->ro_error) {
  1832. ubifs_msg(c, "cannot re-mount R/W due to prior errors");
  1833. return -EROFS;
  1834. }
  1835. if (c->ro_media) {
  1836. ubifs_msg(c, "cannot re-mount R/W - UBI volume is R/O");
  1837. return -EROFS;
  1838. }
  1839. err = ubifs_remount_rw(c);
  1840. if (err)
  1841. return err;
  1842. } else if (!c->ro_mount && (*flags & MS_RDONLY)) {
  1843. if (c->ro_error) {
  1844. ubifs_msg(c, "cannot re-mount R/O due to prior errors");
  1845. return -EROFS;
  1846. }
  1847. ubifs_remount_ro(c);
  1848. }
  1849. if (c->bulk_read == 1)
  1850. bu_init(c);
  1851. else {
  1852. dbg_gen("disable bulk-read");
  1853. kfree(c->bu.buf);
  1854. c->bu.buf = NULL;
  1855. }
  1856. ubifs_assert(c->lst.taken_empty_lebs > 0);
  1857. return 0;
  1858. }
  1859. #endif
  1860. const struct super_operations ubifs_super_operations = {
  1861. .alloc_inode = ubifs_alloc_inode,
  1862. #ifndef __UBOOT__
  1863. .destroy_inode = ubifs_destroy_inode,
  1864. .put_super = ubifs_put_super,
  1865. .write_inode = ubifs_write_inode,
  1866. .evict_inode = ubifs_evict_inode,
  1867. .statfs = ubifs_statfs,
  1868. #endif
  1869. .dirty_inode = ubifs_dirty_inode,
  1870. #ifndef __UBOOT__
  1871. .remount_fs = ubifs_remount_fs,
  1872. .show_options = ubifs_show_options,
  1873. .sync_fs = ubifs_sync_fs,
  1874. #endif
  1875. };
  1876. /**
  1877. * open_ubi - parse UBI device name string and open the UBI device.
  1878. * @name: UBI volume name
  1879. * @mode: UBI volume open mode
  1880. *
  1881. * The primary method of mounting UBIFS is by specifying the UBI volume
  1882. * character device node path. However, UBIFS may also be mounted withoug any
  1883. * character device node using one of the following methods:
  1884. *
  1885. * o ubiX_Y - mount UBI device number X, volume Y;
  1886. * o ubiY - mount UBI device number 0, volume Y;
  1887. * o ubiX:NAME - mount UBI device X, volume with name NAME;
  1888. * o ubi:NAME - mount UBI device 0, volume with name NAME.
  1889. *
  1890. * Alternative '!' separator may be used instead of ':' (because some shells
  1891. * like busybox may interpret ':' as an NFS host name separator). This function
  1892. * returns UBI volume description object in case of success and a negative
  1893. * error code in case of failure.
  1894. */
  1895. static struct ubi_volume_desc *open_ubi(const char *name, int mode)
  1896. {
  1897. #ifndef __UBOOT__
  1898. struct ubi_volume_desc *ubi;
  1899. #endif
  1900. int dev, vol;
  1901. char *endptr;
  1902. #ifndef __UBOOT__
  1903. /* First, try to open using the device node path method */
  1904. ubi = ubi_open_volume_path(name, mode);
  1905. if (!IS_ERR(ubi))
  1906. return ubi;
  1907. #endif
  1908. /* Try the "nodev" method */
  1909. if (name[0] != 'u' || name[1] != 'b' || name[2] != 'i')
  1910. return ERR_PTR(-EINVAL);
  1911. /* ubi:NAME method */
  1912. if ((name[3] == ':' || name[3] == '!') && name[4] != '\0')
  1913. return ubi_open_volume_nm(0, name + 4, mode);
  1914. if (!isdigit(name[3]))
  1915. return ERR_PTR(-EINVAL);
  1916. dev = simple_strtoul(name + 3, &endptr, 0);
  1917. /* ubiY method */
  1918. if (*endptr == '\0')
  1919. return ubi_open_volume(0, dev, mode);
  1920. /* ubiX_Y method */
  1921. if (*endptr == '_' && isdigit(endptr[1])) {
  1922. vol = simple_strtoul(endptr + 1, &endptr, 0);
  1923. if (*endptr != '\0')
  1924. return ERR_PTR(-EINVAL);
  1925. return ubi_open_volume(dev, vol, mode);
  1926. }
  1927. /* ubiX:NAME method */
  1928. if ((*endptr == ':' || *endptr == '!') && endptr[1] != '\0')
  1929. return ubi_open_volume_nm(dev, ++endptr, mode);
  1930. return ERR_PTR(-EINVAL);
  1931. }
  1932. static struct ubifs_info *alloc_ubifs_info(struct ubi_volume_desc *ubi)
  1933. {
  1934. struct ubifs_info *c;
  1935. c = kzalloc(sizeof(struct ubifs_info), GFP_KERNEL);
  1936. if (c) {
  1937. spin_lock_init(&c->cnt_lock);
  1938. spin_lock_init(&c->cs_lock);
  1939. spin_lock_init(&c->buds_lock);
  1940. spin_lock_init(&c->space_lock);
  1941. spin_lock_init(&c->orphan_lock);
  1942. init_rwsem(&c->commit_sem);
  1943. mutex_init(&c->lp_mutex);
  1944. mutex_init(&c->tnc_mutex);
  1945. mutex_init(&c->log_mutex);
  1946. mutex_init(&c->umount_mutex);
  1947. mutex_init(&c->bu_mutex);
  1948. mutex_init(&c->write_reserve_mutex);
  1949. init_waitqueue_head(&c->cmt_wq);
  1950. c->buds = RB_ROOT;
  1951. c->old_idx = RB_ROOT;
  1952. c->size_tree = RB_ROOT;
  1953. c->orph_tree = RB_ROOT;
  1954. INIT_LIST_HEAD(&c->infos_list);
  1955. INIT_LIST_HEAD(&c->idx_gc);
  1956. INIT_LIST_HEAD(&c->replay_list);
  1957. INIT_LIST_HEAD(&c->replay_buds);
  1958. INIT_LIST_HEAD(&c->uncat_list);
  1959. INIT_LIST_HEAD(&c->empty_list);
  1960. INIT_LIST_HEAD(&c->freeable_list);
  1961. INIT_LIST_HEAD(&c->frdi_idx_list);
  1962. INIT_LIST_HEAD(&c->unclean_leb_list);
  1963. INIT_LIST_HEAD(&c->old_buds);
  1964. INIT_LIST_HEAD(&c->orph_list);
  1965. INIT_LIST_HEAD(&c->orph_new);
  1966. c->no_chk_data_crc = 1;
  1967. c->highest_inum = UBIFS_FIRST_INO;
  1968. c->lhead_lnum = c->ltail_lnum = UBIFS_LOG_LNUM;
  1969. ubi_get_volume_info(ubi, &c->vi);
  1970. ubi_get_device_info(c->vi.ubi_num, &c->di);
  1971. }
  1972. return c;
  1973. }
  1974. static int ubifs_fill_super(struct super_block *sb, void *data, int silent)
  1975. {
  1976. struct ubifs_info *c = sb->s_fs_info;
  1977. struct inode *root;
  1978. int err;
  1979. c->vfs_sb = sb;
  1980. #ifndef __UBOOT__
  1981. /* Re-open the UBI device in read-write mode */
  1982. c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READWRITE);
  1983. #else
  1984. /* U-Boot read only mode */
  1985. c->ubi = ubi_open_volume(c->vi.ubi_num, c->vi.vol_id, UBI_READONLY);
  1986. #endif
  1987. if (IS_ERR(c->ubi)) {
  1988. err = PTR_ERR(c->ubi);
  1989. goto out;
  1990. }
  1991. #ifndef __UBOOT__
  1992. /*
  1993. * UBIFS provides 'backing_dev_info' in order to disable read-ahead. For
  1994. * UBIFS, I/O is not deferred, it is done immediately in readpage,
  1995. * which means the user would have to wait not just for their own I/O
  1996. * but the read-ahead I/O as well i.e. completely pointless.
  1997. *
  1998. * Read-ahead will be disabled because @c->bdi.ra_pages is 0.
  1999. */
  2000. c->bdi.name = "ubifs",
  2001. c->bdi.capabilities = 0;
  2002. err = bdi_init(&c->bdi);
  2003. if (err)
  2004. goto out_close;
  2005. err = bdi_register(&c->bdi, NULL, "ubifs_%d_%d",
  2006. c->vi.ubi_num, c->vi.vol_id);
  2007. if (err)
  2008. goto out_bdi;
  2009. err = ubifs_parse_options(c, data, 0);
  2010. if (err)
  2011. goto out_bdi;
  2012. sb->s_bdi = &c->bdi;
  2013. #endif
  2014. sb->s_fs_info = c;
  2015. sb->s_magic = UBIFS_SUPER_MAGIC;
  2016. sb->s_blocksize = UBIFS_BLOCK_SIZE;
  2017. sb->s_blocksize_bits = UBIFS_BLOCK_SHIFT;
  2018. sb->s_maxbytes = c->max_inode_sz = key_max_inode_size(c);
  2019. if (c->max_inode_sz > MAX_LFS_FILESIZE)
  2020. sb->s_maxbytes = c->max_inode_sz = MAX_LFS_FILESIZE;
  2021. sb->s_op = &ubifs_super_operations;
  2022. #ifndef __UBOOT__
  2023. sb->s_xattr = ubifs_xattr_handlers;
  2024. #endif
  2025. mutex_lock(&c->umount_mutex);
  2026. err = mount_ubifs(c);
  2027. if (err) {
  2028. ubifs_assert(err < 0);
  2029. goto out_unlock;
  2030. }
  2031. /* Read the root inode */
  2032. root = ubifs_iget(sb, UBIFS_ROOT_INO);
  2033. if (IS_ERR(root)) {
  2034. err = PTR_ERR(root);
  2035. goto out_umount;
  2036. }
  2037. #ifndef __UBOOT__
  2038. sb->s_root = d_make_root(root);
  2039. if (!sb->s_root) {
  2040. err = -ENOMEM;
  2041. goto out_umount;
  2042. }
  2043. #else
  2044. sb->s_root = NULL;
  2045. #endif
  2046. mutex_unlock(&c->umount_mutex);
  2047. return 0;
  2048. out_umount:
  2049. ubifs_umount(c);
  2050. out_unlock:
  2051. mutex_unlock(&c->umount_mutex);
  2052. #ifndef __UBOOT__
  2053. out_bdi:
  2054. bdi_destroy(&c->bdi);
  2055. out_close:
  2056. #endif
  2057. ubi_close_volume(c->ubi);
  2058. out:
  2059. return err;
  2060. }
  2061. static int sb_test(struct super_block *sb, void *data)
  2062. {
  2063. struct ubifs_info *c1 = data;
  2064. struct ubifs_info *c = sb->s_fs_info;
  2065. return c->vi.cdev == c1->vi.cdev;
  2066. }
  2067. static int sb_set(struct super_block *sb, void *data)
  2068. {
  2069. sb->s_fs_info = data;
  2070. return set_anon_super(sb, NULL);
  2071. }
  2072. static struct super_block *alloc_super(struct file_system_type *type, int flags)
  2073. {
  2074. struct super_block *s;
  2075. int err;
  2076. s = kzalloc(sizeof(struct super_block), GFP_USER);
  2077. if (!s) {
  2078. err = -ENOMEM;
  2079. return ERR_PTR(err);
  2080. }
  2081. INIT_HLIST_NODE(&s->s_instances);
  2082. INIT_LIST_HEAD(&s->s_inodes);
  2083. s->s_time_gran = 1000000000;
  2084. s->s_flags = flags;
  2085. return s;
  2086. }
  2087. /**
  2088. * sget - find or create a superblock
  2089. * @type: filesystem type superblock should belong to
  2090. * @test: comparison callback
  2091. * @set: setup callback
  2092. * @flags: mount flags
  2093. * @data: argument to each of them
  2094. */
  2095. struct super_block *sget(struct file_system_type *type,
  2096. int (*test)(struct super_block *,void *),
  2097. int (*set)(struct super_block *,void *),
  2098. int flags,
  2099. void *data)
  2100. {
  2101. struct super_block *s = NULL;
  2102. #ifndef __UBOOT__
  2103. struct super_block *old;
  2104. #endif
  2105. int err;
  2106. #ifndef __UBOOT__
  2107. retry:
  2108. spin_lock(&sb_lock);
  2109. if (test) {
  2110. hlist_for_each_entry(old, &type->fs_supers, s_instances) {
  2111. if (!test(old, data))
  2112. continue;
  2113. if (!grab_super(old))
  2114. goto retry;
  2115. if (s) {
  2116. up_write(&s->s_umount);
  2117. destroy_super(s);
  2118. s = NULL;
  2119. }
  2120. return old;
  2121. }
  2122. }
  2123. #endif
  2124. if (!s) {
  2125. spin_unlock(&sb_lock);
  2126. s = alloc_super(type, flags);
  2127. if (!s)
  2128. return ERR_PTR(-ENOMEM);
  2129. #ifndef __UBOOT__
  2130. goto retry;
  2131. #endif
  2132. }
  2133. err = set(s, data);
  2134. if (err) {
  2135. #ifndef __UBOOT__
  2136. spin_unlock(&sb_lock);
  2137. up_write(&s->s_umount);
  2138. destroy_super(s);
  2139. #endif
  2140. return ERR_PTR(err);
  2141. }
  2142. s->s_type = type;
  2143. #ifndef __UBOOT__
  2144. strlcpy(s->s_id, type->name, sizeof(s->s_id));
  2145. list_add_tail(&s->s_list, &super_blocks);
  2146. #else
  2147. strncpy(s->s_id, type->name, sizeof(s->s_id));
  2148. #endif
  2149. hlist_add_head(&s->s_instances, &type->fs_supers);
  2150. #ifndef __UBOOT__
  2151. spin_unlock(&sb_lock);
  2152. get_filesystem(type);
  2153. register_shrinker(&s->s_shrink);
  2154. #endif
  2155. return s;
  2156. }
  2157. EXPORT_SYMBOL(sget);
  2158. static struct dentry *ubifs_mount(struct file_system_type *fs_type, int flags,
  2159. const char *name, void *data)
  2160. {
  2161. struct ubi_volume_desc *ubi;
  2162. struct ubifs_info *c;
  2163. struct super_block *sb;
  2164. int err;
  2165. dbg_gen("name %s, flags %#x", name, flags);
  2166. /*
  2167. * Get UBI device number and volume ID. Mount it read-only so far
  2168. * because this might be a new mount point, and UBI allows only one
  2169. * read-write user at a time.
  2170. */
  2171. ubi = open_ubi(name, UBI_READONLY);
  2172. if (IS_ERR(ubi)) {
  2173. pr_err("UBIFS error (pid: %d): cannot open \"%s\", error %d",
  2174. current->pid, name, (int)PTR_ERR(ubi));
  2175. return ERR_CAST(ubi);
  2176. }
  2177. c = alloc_ubifs_info(ubi);
  2178. if (!c) {
  2179. err = -ENOMEM;
  2180. goto out_close;
  2181. }
  2182. dbg_gen("opened ubi%d_%d", c->vi.ubi_num, c->vi.vol_id);
  2183. sb = sget(fs_type, sb_test, sb_set, flags, c);
  2184. if (IS_ERR(sb)) {
  2185. err = PTR_ERR(sb);
  2186. kfree(c);
  2187. goto out_close;
  2188. }
  2189. if (sb->s_root) {
  2190. struct ubifs_info *c1 = sb->s_fs_info;
  2191. kfree(c);
  2192. /* A new mount point for already mounted UBIFS */
  2193. dbg_gen("this ubi volume is already mounted");
  2194. if (!!(flags & MS_RDONLY) != c1->ro_mount) {
  2195. err = -EBUSY;
  2196. goto out_deact;
  2197. }
  2198. } else {
  2199. err = ubifs_fill_super(sb, data, flags & MS_SILENT ? 1 : 0);
  2200. if (err)
  2201. goto out_deact;
  2202. /* We do not support atime */
  2203. sb->s_flags |= MS_ACTIVE | MS_NOATIME;
  2204. }
  2205. /* 'fill_super()' opens ubi again so we must close it here */
  2206. ubi_close_volume(ubi);
  2207. #ifdef __UBOOT__
  2208. ubifs_sb = sb;
  2209. return 0;
  2210. #else
  2211. return dget(sb->s_root);
  2212. #endif
  2213. out_deact:
  2214. #ifndef __UBOOT__
  2215. deactivate_locked_super(sb);
  2216. #endif
  2217. out_close:
  2218. ubi_close_volume(ubi);
  2219. return ERR_PTR(err);
  2220. }
  2221. static void kill_ubifs_super(struct super_block *s)
  2222. {
  2223. struct ubifs_info *c = s->s_fs_info;
  2224. #ifndef __UBOOT__
  2225. kill_anon_super(s);
  2226. #endif
  2227. kfree(c);
  2228. }
  2229. static struct file_system_type ubifs_fs_type = {
  2230. .name = "ubifs",
  2231. .owner = THIS_MODULE,
  2232. .mount = ubifs_mount,
  2233. .kill_sb = kill_ubifs_super,
  2234. };
  2235. #ifndef __UBOOT__
  2236. MODULE_ALIAS_FS("ubifs");
  2237. /*
  2238. * Inode slab cache constructor.
  2239. */
  2240. static void inode_slab_ctor(void *obj)
  2241. {
  2242. struct ubifs_inode *ui = obj;
  2243. inode_init_once(&ui->vfs_inode);
  2244. }
  2245. static int __init ubifs_init(void)
  2246. #else
  2247. int ubifs_init(void)
  2248. #endif
  2249. {
  2250. int err;
  2251. BUILD_BUG_ON(sizeof(struct ubifs_ch) != 24);
  2252. /* Make sure node sizes are 8-byte aligned */
  2253. BUILD_BUG_ON(UBIFS_CH_SZ & 7);
  2254. BUILD_BUG_ON(UBIFS_INO_NODE_SZ & 7);
  2255. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ & 7);
  2256. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ & 7);
  2257. BUILD_BUG_ON(UBIFS_DATA_NODE_SZ & 7);
  2258. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ & 7);
  2259. BUILD_BUG_ON(UBIFS_SB_NODE_SZ & 7);
  2260. BUILD_BUG_ON(UBIFS_MST_NODE_SZ & 7);
  2261. BUILD_BUG_ON(UBIFS_REF_NODE_SZ & 7);
  2262. BUILD_BUG_ON(UBIFS_CS_NODE_SZ & 7);
  2263. BUILD_BUG_ON(UBIFS_ORPH_NODE_SZ & 7);
  2264. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ & 7);
  2265. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ & 7);
  2266. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ & 7);
  2267. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ & 7);
  2268. BUILD_BUG_ON(UBIFS_MAX_NODE_SZ & 7);
  2269. BUILD_BUG_ON(MIN_WRITE_SZ & 7);
  2270. /* Check min. node size */
  2271. BUILD_BUG_ON(UBIFS_INO_NODE_SZ < MIN_WRITE_SZ);
  2272. BUILD_BUG_ON(UBIFS_DENT_NODE_SZ < MIN_WRITE_SZ);
  2273. BUILD_BUG_ON(UBIFS_XENT_NODE_SZ < MIN_WRITE_SZ);
  2274. BUILD_BUG_ON(UBIFS_TRUN_NODE_SZ < MIN_WRITE_SZ);
  2275. BUILD_BUG_ON(UBIFS_MAX_DENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2276. BUILD_BUG_ON(UBIFS_MAX_XENT_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2277. BUILD_BUG_ON(UBIFS_MAX_DATA_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2278. BUILD_BUG_ON(UBIFS_MAX_INO_NODE_SZ > UBIFS_MAX_NODE_SZ);
  2279. /* Defined node sizes */
  2280. BUILD_BUG_ON(UBIFS_SB_NODE_SZ != 4096);
  2281. BUILD_BUG_ON(UBIFS_MST_NODE_SZ != 512);
  2282. BUILD_BUG_ON(UBIFS_INO_NODE_SZ != 160);
  2283. BUILD_BUG_ON(UBIFS_REF_NODE_SZ != 64);
  2284. /*
  2285. * We use 2 bit wide bit-fields to store compression type, which should
  2286. * be amended if more compressors are added. The bit-fields are:
  2287. * @compr_type in 'struct ubifs_inode', @default_compr in
  2288. * 'struct ubifs_info' and @compr_type in 'struct ubifs_mount_opts'.
  2289. */
  2290. BUILD_BUG_ON(UBIFS_COMPR_TYPES_CNT > 4);
  2291. /*
  2292. * We require that PAGE_CACHE_SIZE is greater-than-or-equal-to
  2293. * UBIFS_BLOCK_SIZE. It is assumed that both are powers of 2.
  2294. */
  2295. if (PAGE_CACHE_SIZE < UBIFS_BLOCK_SIZE) {
  2296. pr_err("UBIFS error (pid %d): VFS page cache size is %u bytes, but UBIFS requires at least 4096 bytes",
  2297. current->pid, (unsigned int)PAGE_CACHE_SIZE);
  2298. return -EINVAL;
  2299. }
  2300. #ifndef __UBOOT__
  2301. ubifs_inode_slab = kmem_cache_create("ubifs_inode_slab",
  2302. sizeof(struct ubifs_inode), 0,
  2303. SLAB_MEM_SPREAD | SLAB_RECLAIM_ACCOUNT,
  2304. &inode_slab_ctor);
  2305. if (!ubifs_inode_slab)
  2306. return -ENOMEM;
  2307. err = register_shrinker(&ubifs_shrinker_info);
  2308. if (err)
  2309. goto out_slab;
  2310. #endif
  2311. err = ubifs_compressors_init();
  2312. if (err)
  2313. goto out_shrinker;
  2314. #ifndef __UBOOT__
  2315. err = dbg_debugfs_init();
  2316. if (err)
  2317. goto out_compr;
  2318. err = register_filesystem(&ubifs_fs_type);
  2319. if (err) {
  2320. pr_err("UBIFS error (pid %d): cannot register file system, error %d",
  2321. current->pid, err);
  2322. goto out_dbg;
  2323. }
  2324. #endif
  2325. return 0;
  2326. #ifndef __UBOOT__
  2327. out_dbg:
  2328. dbg_debugfs_exit();
  2329. out_compr:
  2330. ubifs_compressors_exit();
  2331. #endif
  2332. out_shrinker:
  2333. #ifndef __UBOOT__
  2334. unregister_shrinker(&ubifs_shrinker_info);
  2335. out_slab:
  2336. #endif
  2337. kmem_cache_destroy(ubifs_inode_slab);
  2338. return err;
  2339. }
  2340. /* late_initcall to let compressors initialize first */
  2341. late_initcall(ubifs_init);
  2342. #ifndef __UBOOT__
  2343. static void __exit ubifs_exit(void)
  2344. {
  2345. ubifs_assert(list_empty(&ubifs_infos));
  2346. ubifs_assert(atomic_long_read(&ubifs_clean_zn_cnt) == 0);
  2347. dbg_debugfs_exit();
  2348. ubifs_compressors_exit();
  2349. unregister_shrinker(&ubifs_shrinker_info);
  2350. /*
  2351. * Make sure all delayed rcu free inodes are flushed before we
  2352. * destroy cache.
  2353. */
  2354. rcu_barrier();
  2355. kmem_cache_destroy(ubifs_inode_slab);
  2356. unregister_filesystem(&ubifs_fs_type);
  2357. }
  2358. module_exit(ubifs_exit);
  2359. MODULE_LICENSE("GPL");
  2360. MODULE_VERSION(__stringify(UBIFS_VERSION));
  2361. MODULE_AUTHOR("Artem Bityutskiy, Adrian Hunter");
  2362. MODULE_DESCRIPTION("UBIFS - UBI File System");
  2363. #else
  2364. int uboot_ubifs_mount(char *vol_name)
  2365. {
  2366. struct dentry *ret;
  2367. int flags;
  2368. /*
  2369. * First unmount if allready mounted
  2370. */
  2371. if (ubifs_sb)
  2372. ubifs_umount(ubifs_sb->s_fs_info);
  2373. /*
  2374. * Mount in read-only mode
  2375. */
  2376. flags = MS_RDONLY;
  2377. ret = ubifs_mount(&ubifs_fs_type, flags, vol_name, NULL);
  2378. if (IS_ERR(ret)) {
  2379. printf("Error reading superblock on volume '%s' " \
  2380. "errno=%d!\n", vol_name, (int)PTR_ERR(ret));
  2381. return -1;
  2382. }
  2383. return 0;
  2384. }
  2385. #endif