lfs.c 101 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588
  1. /*
  2. * The little filesystem
  3. *
  4. * Copyright (c) 2017 ARM Limited
  5. *
  6. * Licensed under the Apache License, Version 2.0 (the "License");
  7. * you may not use this file except in compliance with the License.
  8. * You may obtain a copy of the License at
  9. *
  10. * http://www.apache.org/licenses/LICENSE-2.0
  11. *
  12. * Unless required by applicable law or agreed to in writing, software
  13. * distributed under the License is distributed on an "AS IS" BASIS,
  14. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  15. * See the License for the specific language governing permissions and
  16. * limitations under the License.
  17. */
  18. #include "lfs.h"
  19. #include "lfs_util.h"
  20. /// Caching block device operations ///
  21. static inline void lfs_cache_drop(lfs_t *lfs, lfs_cache_t *rcache) {
  22. // do not zero, cheaper if cache is readonly or only going to be
  23. // written with identical data (during relocates)
  24. (void)lfs;
  25. rcache->block = 0xffffffff;
  26. }
  27. static inline void lfs_cache_zero(lfs_t *lfs, lfs_cache_t *pcache) {
  28. // zero to avoid information leak
  29. memset(pcache->buffer, 0xff, lfs->cfg->prog_size);
  30. pcache->block = 0xffffffff;
  31. }
  32. static int lfs_bd_read(lfs_t *lfs,
  33. const lfs_cache_t *pcache, lfs_cache_t *rcache, lfs_size_t hint,
  34. lfs_block_t block, lfs_off_t off,
  35. void *buffer, lfs_size_t size) {
  36. uint8_t *data = buffer;
  37. LFS_ASSERT(block != 0xffffffff);
  38. if (off+size > lfs->cfg->block_size) {
  39. return LFS_ERR_CORRUPT;
  40. }
  41. while (size > 0) {
  42. if (pcache && block == pcache->block &&
  43. off >= pcache->off &&
  44. off < pcache->off + pcache->size) {
  45. // is already in pcache?
  46. lfs_size_t diff = lfs_min(size, pcache->size - (off-pcache->off));
  47. memcpy(data, &pcache->buffer[off-pcache->off], diff);
  48. data += diff;
  49. off += diff;
  50. size -= diff;
  51. continue;
  52. }
  53. if (block == rcache->block &&
  54. off >= rcache->off &&
  55. off < rcache->off + rcache->size) {
  56. // is already in rcache?
  57. lfs_size_t diff = lfs_min(size, rcache->size - (off-rcache->off));
  58. if (pcache && block == pcache->block) {
  59. diff = lfs_min(diff, pcache->off - off);
  60. }
  61. memcpy(data, &rcache->buffer[off-rcache->off], diff);
  62. data += diff;
  63. off += diff;
  64. size -= diff;
  65. continue;
  66. }
  67. if (size >= hint && off % lfs->cfg->read_size == 0 &&
  68. size >= lfs->cfg->read_size) {
  69. // bypass cache?
  70. lfs_size_t diff = size - (size % lfs->cfg->read_size);
  71. int err = lfs->cfg->read(lfs->cfg, block, off, data, diff);
  72. if (err) {
  73. return err;
  74. }
  75. data += diff;
  76. off += diff;
  77. size -= diff;
  78. continue;
  79. }
  80. // load to cache, first condition can no longer fail
  81. LFS_ASSERT(block < lfs->cfg->block_count);
  82. rcache->block = block;
  83. rcache->off = lfs_aligndown(off, lfs->cfg->prog_size);
  84. rcache->size = lfs_min(lfs_min(
  85. lfs_alignup(off+hint, lfs->cfg->prog_size),
  86. lfs->cfg->block_size) - rcache->off, lfs->cfg->cache_size);
  87. int err = lfs->cfg->read(lfs->cfg, rcache->block,
  88. rcache->off, rcache->buffer, rcache->size);
  89. if (err) {
  90. return err;
  91. }
  92. }
  93. return 0;
  94. }
  95. static int lfs_bd_cmp(lfs_t *lfs,
  96. const lfs_cache_t *pcache, lfs_cache_t *rcache, lfs_size_t hint,
  97. lfs_block_t block, lfs_off_t off,
  98. const void *buffer, lfs_size_t size) {
  99. const uint8_t *data = buffer;
  100. for (lfs_off_t i = 0; i < size; i++) {
  101. uint8_t dat;
  102. int err = lfs_bd_read(lfs,
  103. pcache, rcache, hint-i,
  104. block, off+i, &dat, 1);
  105. if (err) {
  106. return err;
  107. }
  108. if (dat != data[i]) {
  109. return false;
  110. }
  111. }
  112. return true;
  113. }
  114. static int lfs_bd_flush(lfs_t *lfs,
  115. lfs_cache_t *pcache, lfs_cache_t *rcache, bool validate) {
  116. if (pcache->block != 0xffffffff && pcache->block != 0xfffffffe) {
  117. LFS_ASSERT(pcache->block < lfs->cfg->block_count);
  118. lfs_size_t diff = lfs_alignup(pcache->size, lfs->cfg->prog_size);
  119. int err = lfs->cfg->prog(lfs->cfg, pcache->block,
  120. pcache->off, pcache->buffer, diff);
  121. if (err) {
  122. return err;
  123. }
  124. if (validate) {
  125. // check data on disk
  126. lfs_cache_drop(lfs, rcache);
  127. int res = lfs_bd_cmp(lfs,
  128. NULL, rcache, diff,
  129. pcache->block, pcache->off, pcache->buffer, diff);
  130. if (res < 0) {
  131. return res;
  132. }
  133. if (!res) {
  134. return LFS_ERR_CORRUPT;
  135. }
  136. }
  137. lfs_cache_zero(lfs, pcache);
  138. }
  139. return 0;
  140. }
  141. static int lfs_bd_sync(lfs_t *lfs,
  142. lfs_cache_t *pcache, lfs_cache_t *rcache, bool validate) {
  143. lfs_cache_drop(lfs, rcache);
  144. int err = lfs_bd_flush(lfs, pcache, rcache, validate);
  145. if (err) {
  146. return err;
  147. }
  148. return lfs->cfg->sync(lfs->cfg);
  149. }
  150. static int lfs_bd_prog(lfs_t *lfs,
  151. lfs_cache_t *pcache, lfs_cache_t *rcache, bool validate,
  152. lfs_block_t block, lfs_off_t off,
  153. const void *buffer, lfs_size_t size) {
  154. const uint8_t *data = buffer;
  155. LFS_ASSERT(block != 0xffffffff);
  156. LFS_ASSERT(off + size <= lfs->cfg->block_size);
  157. while (size > 0) {
  158. if (block == pcache->block &&
  159. off >= pcache->off &&
  160. off < pcache->off + lfs->cfg->cache_size) {
  161. // already fits in pcache?
  162. lfs_size_t diff = lfs_min(size,
  163. lfs->cfg->cache_size - (off-pcache->off));
  164. memcpy(&pcache->buffer[off-pcache->off], data, diff);
  165. data += diff;
  166. off += diff;
  167. size -= diff;
  168. pcache->size = off - pcache->off;
  169. if (pcache->size == lfs->cfg->cache_size) {
  170. // eagerly flush out pcache if we fill up
  171. int err = lfs_bd_flush(lfs, pcache, rcache, validate);
  172. if (err) {
  173. return err;
  174. }
  175. }
  176. continue;
  177. }
  178. // pcache must have been flushed, either by programming and
  179. // entire block or manually flushing the pcache
  180. LFS_ASSERT(pcache->block == 0xffffffff);
  181. // prepare pcache, first condition can no longer fail
  182. pcache->block = block;
  183. pcache->off = lfs_aligndown(off, lfs->cfg->prog_size);
  184. pcache->size = 0;
  185. }
  186. return 0;
  187. }
  188. static int lfs_bd_erase(lfs_t *lfs, lfs_block_t block) {
  189. LFS_ASSERT(block < lfs->cfg->block_count);
  190. return lfs->cfg->erase(lfs->cfg, block);
  191. }
  192. /// Small type-level utilities ///
  193. // operations on block pairs
  194. static inline void lfs_pair_swap(lfs_block_t pair[2]) {
  195. lfs_block_t t = pair[0];
  196. pair[0] = pair[1];
  197. pair[1] = t;
  198. }
  199. static inline bool lfs_pair_isnull(const lfs_block_t pair[2]) {
  200. return pair[0] == 0xffffffff || pair[1] == 0xffffffff;
  201. }
  202. static inline int lfs_pair_cmp(
  203. const lfs_block_t paira[2],
  204. const lfs_block_t pairb[2]) {
  205. return !(paira[0] == pairb[0] || paira[1] == pairb[1] ||
  206. paira[0] == pairb[1] || paira[1] == pairb[0]);
  207. }
  208. static inline bool lfs_pair_sync(
  209. const lfs_block_t paira[2],
  210. const lfs_block_t pairb[2]) {
  211. return (paira[0] == pairb[0] && paira[1] == pairb[1]) ||
  212. (paira[0] == pairb[1] && paira[1] == pairb[0]);
  213. }
  214. static inline void lfs_pair_fromle32(lfs_block_t pair[2]) {
  215. pair[0] = lfs_fromle32(pair[0]);
  216. pair[1] = lfs_fromle32(pair[1]);
  217. }
  218. static inline void lfs_pair_tole32(lfs_block_t pair[2]) {
  219. pair[0] = lfs_tole32(pair[0]);
  220. pair[1] = lfs_tole32(pair[1]);
  221. }
  222. // operations on 32-bit entry tags
  223. typedef uint32_t lfs_tag_t;
  224. typedef int32_t lfs_stag_t;
  225. #define LFS_MKTAG(type, id, size) \
  226. (((lfs_tag_t)(type) << 22) | ((lfs_tag_t)(id) << 12) | (lfs_tag_t)(size))
  227. static inline bool lfs_tag_isvalid(lfs_tag_t tag) {
  228. return !(tag & 0x80000000);
  229. }
  230. static inline bool lfs_tag_isuser(lfs_tag_t tag) {
  231. return (tag & 0x40000000);
  232. }
  233. static inline bool lfs_tag_isdelete(lfs_tag_t tag) {
  234. return (tag & 0x00000fff) == 0xfff;
  235. }
  236. static inline uint16_t lfs_tag_type(lfs_tag_t tag) {
  237. return (tag & 0x7fc00000) >> 22;
  238. }
  239. static inline uint16_t lfs_tag_subtype(lfs_tag_t tag) {
  240. return ((tag & 0x7c000000) >> 26) << 4;
  241. }
  242. static inline uint16_t lfs_tag_id(lfs_tag_t tag) {
  243. return (tag & 0x003ff000) >> 12;
  244. }
  245. static inline lfs_size_t lfs_tag_size(lfs_tag_t tag) {
  246. return tag & 0x00000fff;
  247. }
  248. static inline lfs_size_t lfs_tag_dsize(lfs_tag_t tag) {
  249. return sizeof(tag) + lfs_tag_size(tag + lfs_tag_isdelete(tag));
  250. }
  251. // operations on attributes in attribute lists
  252. struct lfs_mattr {
  253. lfs_tag_t tag;
  254. const void *buffer;
  255. const struct lfs_mattr *next;
  256. };
  257. #define LFS_MKATTR(type, id, buffer, size, next) \
  258. &(const struct lfs_mattr){LFS_MKTAG(type, id, size), (buffer), (next)}
  259. struct lfs_diskoff {
  260. lfs_block_t block;
  261. lfs_off_t off;
  262. };
  263. // operations on set of globals
  264. static inline void lfs_global_xor(struct lfs_globals *a,
  265. const struct lfs_globals *b) {
  266. uint32_t *a32 = (uint32_t *)a;
  267. const uint32_t *b32 = (const uint32_t *)b;
  268. for (int i = 0; i < sizeof(struct lfs_globals)/4; i++) {
  269. a32[i] ^= b32[i];
  270. }
  271. }
  272. static inline bool lfs_global_iszero(const struct lfs_globals *a) {
  273. const uint32_t *a32 = (const uint32_t *)a;
  274. for (int i = 0; i < sizeof(struct lfs_globals)/4; i++) {
  275. if (a32[i] != 0) {
  276. return false;
  277. }
  278. }
  279. return true;
  280. }
  281. static inline void lfs_global_zero(struct lfs_globals *a) {
  282. lfs_global_xor(a, a);
  283. }
  284. static inline void lfs_global_fromle32(struct lfs_globals *a) {
  285. lfs_pair_fromle32(a->pair);
  286. a->id = lfs_fromle16(a->id);
  287. }
  288. static inline void lfs_global_tole32(struct lfs_globals *a) {
  289. lfs_pair_tole32(a->pair);
  290. a->id = lfs_tole16(a->id);
  291. }
  292. static inline void lfs_global_move(lfs_t *lfs,
  293. bool hasmove, const lfs_block_t pair[2], uint16_t id) {
  294. lfs_global_fromle32(&lfs->locals);
  295. lfs_global_xor(&lfs->locals, &lfs->globals);
  296. lfs->globals.hasmove = hasmove;
  297. lfs->globals.pair[0] = pair[0];
  298. lfs->globals.pair[1] = pair[1];
  299. lfs->globals.id = id;
  300. lfs_global_xor(&lfs->locals, &lfs->globals);
  301. lfs_global_tole32(&lfs->locals);
  302. }
  303. static inline void lfs_global_orphans(lfs_t *lfs, int8_t orphans) {
  304. lfs->locals.orphans ^= (lfs->globals.orphans == 0);
  305. lfs->globals.orphans += orphans;
  306. lfs->locals.orphans ^= (lfs->globals.orphans == 0);
  307. }
  308. // other endianness operations
  309. static void lfs_ctz_fromle32(struct lfs_ctz *ctz) {
  310. ctz->head = lfs_fromle32(ctz->head);
  311. ctz->size = lfs_fromle32(ctz->size);
  312. }
  313. static void lfs_ctz_tole32(struct lfs_ctz *ctz) {
  314. ctz->head = lfs_tole32(ctz->head);
  315. ctz->size = lfs_tole32(ctz->size);
  316. }
  317. static inline void lfs_superblock_fromle32(lfs_superblock_t *superblock) {
  318. superblock->version = lfs_fromle32(superblock->version);
  319. superblock->block_size = lfs_fromle32(superblock->block_size);
  320. superblock->block_count = lfs_fromle32(superblock->block_count);
  321. superblock->inline_max = lfs_fromle32(superblock->inline_max);
  322. superblock->attr_max = lfs_fromle32(superblock->attr_max);
  323. superblock->name_max = lfs_fromle32(superblock->name_max);
  324. }
  325. static inline void lfs_superblock_tole32(lfs_superblock_t *superblock) {
  326. superblock->version = lfs_tole32(superblock->version);
  327. superblock->block_size = lfs_tole32(superblock->block_size);
  328. superblock->block_count = lfs_tole32(superblock->block_count);
  329. superblock->inline_max = lfs_tole32(superblock->inline_max);
  330. superblock->attr_max = lfs_tole32(superblock->attr_max);
  331. superblock->name_max = lfs_tole32(superblock->name_max);
  332. }
  333. /// Internal operations predeclared here ///
  334. static int lfs_dir_commit(lfs_t *lfs, lfs_mdir_t *dir,
  335. const struct lfs_mattr *attrs);
  336. static int lfs_fs_pred(lfs_t *lfs, const lfs_block_t dir[2],
  337. lfs_mdir_t *pdir);
  338. static lfs_stag_t lfs_fs_parent(lfs_t *lfs, const lfs_block_t dir[2],
  339. lfs_mdir_t *parent);
  340. static int lfs_fs_relocate(lfs_t *lfs,
  341. const lfs_block_t oldpair[2], lfs_block_t newpair[2]);
  342. static int lfs_fs_forceconsistency(lfs_t *lfs);
  343. static int lfs_deinit(lfs_t *lfs);
  344. /// Block allocator ///
  345. static int lfs_alloc_lookahead(void *p, lfs_block_t block) {
  346. lfs_t *lfs = (lfs_t*)p;
  347. lfs_block_t off = ((block - lfs->free.off)
  348. + lfs->cfg->block_count) % lfs->cfg->block_count;
  349. if (off < lfs->free.size) {
  350. lfs->free.buffer[off / 32] |= 1U << (off % 32);
  351. }
  352. return 0;
  353. }
  354. static int lfs_alloc(lfs_t *lfs, lfs_block_t *block) {
  355. while (true) {
  356. while (lfs->free.i != lfs->free.size) {
  357. lfs_block_t off = lfs->free.i;
  358. lfs->free.i += 1;
  359. lfs->free.ack -= 1;
  360. if (!(lfs->free.buffer[off / 32] & (1U << (off % 32)))) {
  361. // found a free block
  362. *block = (lfs->free.off + off) % lfs->cfg->block_count;
  363. // eagerly find next off so an alloc ack can
  364. // discredit old lookahead blocks
  365. while (lfs->free.i != lfs->free.size &&
  366. (lfs->free.buffer[lfs->free.i / 32]
  367. & (1U << (lfs->free.i % 32)))) {
  368. lfs->free.i += 1;
  369. lfs->free.ack -= 1;
  370. }
  371. return 0;
  372. }
  373. }
  374. // check if we have looked at all blocks since last ack
  375. if (lfs->free.ack == 0) {
  376. LFS_WARN("No more free space %"PRIu32,
  377. lfs->free.i + lfs->free.off);
  378. return LFS_ERR_NOSPC;
  379. }
  380. lfs->free.off = (lfs->free.off + lfs->free.size)
  381. % lfs->cfg->block_count;
  382. lfs->free.size = lfs_min(lfs->cfg->lookahead, lfs->free.ack);
  383. lfs->free.i = 0;
  384. // find mask of free blocks from tree
  385. memset(lfs->free.buffer, 0, lfs->cfg->lookahead/8);
  386. int err = lfs_fs_traverse(lfs, lfs_alloc_lookahead, lfs);
  387. if (err) {
  388. return err;
  389. }
  390. }
  391. }
  392. static void lfs_alloc_ack(lfs_t *lfs) {
  393. lfs->free.ack = lfs->cfg->block_count;
  394. }
  395. /// Metadata pair and directory operations ///
  396. static int lfs_dir_traverse(lfs_t *lfs,
  397. const lfs_mdir_t *dir, const struct lfs_mattr *attrs,
  398. lfs_tag_t matchmask, lfs_tag_t matchtag, lfs_stag_t matchdiff,
  399. int (*cb)(void *data, lfs_tag_t tag, const void *buffer), void *data) {
  400. lfs_block_t block = dir->pair[0];
  401. lfs_off_t off = dir->off;
  402. lfs_tag_t ntag = dir->etag;
  403. bool lastcommit = false;
  404. matchtag += matchdiff;
  405. // iterate over dir block backwards (for faster lookups)
  406. while (attrs || off >= sizeof(lfs_tag_t) + lfs_tag_dsize(ntag)) {
  407. lfs_tag_t tag;
  408. const void *buffer;
  409. struct lfs_diskoff disk;
  410. if (attrs) {
  411. tag = attrs->tag;
  412. buffer = attrs->buffer;
  413. attrs = attrs->next;
  414. } else {
  415. off -= lfs_tag_dsize(ntag);
  416. tag = ntag;
  417. buffer = &disk;
  418. disk.block = block;
  419. disk.off = off + sizeof(tag);
  420. int err = lfs_bd_read(lfs,
  421. &lfs->pcache, &lfs->rcache, sizeof(ntag),
  422. block, off, &ntag, sizeof(ntag));
  423. if (err) {
  424. return err;
  425. }
  426. ntag = lfs_fromle32(ntag) ^ tag;
  427. tag |= 0x80000000;
  428. }
  429. if (lfs_tag_subtype(tag) == LFS_TYPE_CRC) {
  430. lastcommit = 2 & lfs_tag_type(tag);
  431. } else if (lfs_tag_subtype(tag) == LFS_TYPE_DELETE) {
  432. // something was deleted, need to move around it
  433. if (lfs_tag_id(tag) <= lfs_tag_id(matchtag - matchdiff)) {
  434. matchdiff -= LFS_MKTAG(0, 1, 0);
  435. }
  436. }
  437. if ((tag & matchmask) == ((matchtag - matchdiff) & matchmask) &&
  438. !(lfs_tag_isdelete(tag) && lastcommit)) {
  439. int res = cb(data, tag + matchdiff, buffer);
  440. if (res) {
  441. return res;
  442. }
  443. }
  444. if (lfs_tag_subtype(tag) == LFS_TYPE_NAME) {
  445. // found where something was created
  446. if (lfs_tag_id(tag) == lfs_tag_id(matchtag - matchdiff)) {
  447. break;
  448. } else if (lfs_tag_id(tag) < lfs_tag_id(matchtag - matchdiff)) {
  449. matchdiff += LFS_MKTAG(0, 1, 0);
  450. }
  451. }
  452. }
  453. return 0;
  454. }
  455. static lfs_stag_t lfs_dir_fetchmatch(lfs_t *lfs,
  456. lfs_mdir_t *dir, const lfs_block_t pair[2],
  457. lfs_tag_t matchmask, lfs_tag_t matchtag,
  458. int (*cb)(void *data, lfs_tag_t tag, const void *buffer), void *data) {
  459. // find the block with the most recent revision
  460. uint32_t revs[2];
  461. int r = 0;
  462. for (int i = 0; i < 2; i++) {
  463. int err = lfs_bd_read(lfs,
  464. &lfs->pcache, &lfs->rcache, sizeof(revs[i]),
  465. pair[i], 0, &revs[i], sizeof(revs[i]));
  466. revs[i] = lfs_fromle32(revs[i]);
  467. if (err && err != LFS_ERR_CORRUPT) {
  468. return err;
  469. }
  470. if (lfs_scmp(revs[i], revs[(i+1)%2]) > 0 || err == LFS_ERR_CORRUPT) {
  471. r = i;
  472. }
  473. }
  474. // now fetch the actual dir (and find match)
  475. lfs_stag_t foundtag = 0;
  476. dir->pair[0] = pair[0];
  477. dir->pair[1] = pair[1];
  478. dir->off = 0;
  479. if (r != 0) {
  480. lfs_pair_swap(dir->pair);
  481. lfs_pair_swap(revs);
  482. }
  483. // scan tags and check crcs
  484. for (int i = 0; i < 2; i++) {
  485. lfs_block_t block = dir->pair[0];
  486. lfs_off_t off = sizeof(uint32_t);
  487. lfs_tag_t ptag = 0xffffffff;
  488. lfs_tag_t tempfoundtag = foundtag;
  489. lfs_mdir_t temp = {
  490. .pair = {dir->pair[0], dir->pair[1]},
  491. .rev = revs[0],
  492. .tail = {0xffffffff, 0xffffffff},
  493. .split = false,
  494. .count = 0,
  495. };
  496. temp.rev = lfs_tole32(temp.rev);
  497. uint32_t crc = lfs_crc(0xffffffff, &temp.rev, sizeof(temp.rev));
  498. temp.rev = lfs_fromle32(temp.rev);
  499. while (true) {
  500. // extract next tag
  501. lfs_tag_t tag;
  502. int err = lfs_bd_read(lfs,
  503. &lfs->pcache, &lfs->rcache, lfs->cfg->block_size,
  504. block, off, &tag, sizeof(tag));
  505. if (err) {
  506. if (err == LFS_ERR_CORRUPT) {
  507. // can't continue?
  508. dir->erased = false;
  509. break;
  510. }
  511. return err;
  512. }
  513. crc = lfs_crc(crc, &tag, sizeof(tag));
  514. tag = lfs_fromle32(tag) ^ ptag;
  515. // next commit not yet programmed
  516. if (!lfs_tag_isvalid(tag)) {
  517. dir->erased = (lfs_tag_subtype(ptag) == LFS_TYPE_CRC);
  518. break;
  519. }
  520. // check we're in valid range
  521. if (off + lfs_tag_dsize(tag) > lfs->cfg->block_size) {
  522. dir->erased = false;
  523. break;
  524. }
  525. if (lfs_tag_subtype(tag) == LFS_TYPE_CRC) {
  526. // check the crc attr
  527. uint32_t dcrc;
  528. err = lfs_bd_read(lfs,
  529. &lfs->pcache, &lfs->rcache, lfs->cfg->block_size,
  530. block, off+sizeof(tag), &dcrc, sizeof(dcrc));
  531. if (err) {
  532. if (err == LFS_ERR_CORRUPT) {
  533. dir->erased = false;
  534. break;
  535. }
  536. return err;
  537. }
  538. dcrc = lfs_fromle32(dcrc);
  539. if (crc != dcrc) {
  540. dir->erased = false;
  541. break;
  542. }
  543. // reset the next bit if we need to
  544. tag ^= (lfs_tag_type(tag) & 1) << 31;
  545. lfs->seed ^= crc;
  546. crc = 0xffffffff;
  547. // update with what's found so far
  548. foundtag = tempfoundtag;
  549. *dir = temp;
  550. dir->off = off + lfs_tag_dsize(tag);
  551. dir->etag = tag;
  552. } else {
  553. // crc the entry first, leaving it in the cache
  554. for (lfs_off_t j = sizeof(tag); j < lfs_tag_dsize(tag); j++) {
  555. uint8_t dat;
  556. err = lfs_bd_read(lfs,
  557. NULL, &lfs->rcache, lfs->cfg->block_size,
  558. block, off+j, &dat, 1);
  559. if (err) {
  560. if (err == LFS_ERR_CORRUPT) {
  561. dir->erased = false;
  562. break;
  563. }
  564. return err;
  565. }
  566. crc = lfs_crc(crc, &dat, 1);
  567. }
  568. // check for special tags
  569. if (lfs_tag_subtype(tag) == LFS_TYPE_NAME) {
  570. temp.count += 1;
  571. if (tempfoundtag &&
  572. lfs_tag_id(tag) <= lfs_tag_id(tempfoundtag)) {
  573. tempfoundtag += LFS_MKTAG(0, 1, 0);
  574. }
  575. } else if (lfs_tag_subtype(tag) == LFS_TYPE_DELETE) {
  576. LFS_ASSERT(temp.count > 0);
  577. temp.count -= 1;
  578. if (lfs_tag_id(tag) == lfs_tag_id(tempfoundtag)) {
  579. tempfoundtag = 0;
  580. } else if (tempfoundtag &&
  581. lfs_tag_id(tag) < lfs_tag_id(tempfoundtag)) {
  582. tempfoundtag -= LFS_MKTAG(0, 1, 0);
  583. }
  584. } else if (lfs_tag_subtype(tag) == LFS_TYPE_TAIL) {
  585. temp.split = (lfs_tag_type(tag) & 1);
  586. err = lfs_bd_read(lfs,
  587. &lfs->pcache, &lfs->rcache, lfs->cfg->block_size,
  588. block, off+sizeof(tag),
  589. &temp.tail, sizeof(temp.tail));
  590. if (err) {
  591. if (err == LFS_ERR_CORRUPT) {
  592. dir->erased = false;
  593. break;
  594. }
  595. }
  596. lfs_pair_fromle32(temp.tail);
  597. }
  598. if ((tag & matchmask) == (matchtag & matchmask)) {
  599. // found a match?
  600. if (lfs_tag_isdelete(tag)) {
  601. tempfoundtag = 0;
  602. } else if (cb) {
  603. int res = cb(data, tag, &(struct lfs_diskoff){
  604. block, off+sizeof(tag)});
  605. if (res < 0) {
  606. if (res == LFS_ERR_CORRUPT) {
  607. dir->erased = false;
  608. break;
  609. }
  610. return res;
  611. }
  612. if (res) {
  613. tempfoundtag = tag;
  614. }
  615. } else {
  616. tempfoundtag = tag;
  617. }
  618. }
  619. }
  620. ptag = tag;
  621. off += lfs_tag_dsize(tag);
  622. }
  623. // consider what we have good enough
  624. if (dir->off > 0) {
  625. // synthetic move
  626. if (lfs->globals.hasmove &&
  627. lfs_pair_cmp(dir->pair, lfs->globals.pair) == 0) {
  628. if (lfs->globals.id == lfs_tag_id(foundtag)) {
  629. foundtag = 0;
  630. } else if (foundtag &&
  631. lfs->globals.id < lfs_tag_id(foundtag)) {
  632. foundtag -= LFS_MKTAG(0, 1, 0);
  633. }
  634. }
  635. return foundtag;
  636. }
  637. // failed, try the other crc?
  638. lfs_pair_swap(dir->pair);
  639. lfs_pair_swap(revs);
  640. }
  641. LFS_ERROR("Corrupted dir pair at %"PRIu32" %"PRIu32,
  642. dir->pair[0], dir->pair[1]);
  643. return LFS_ERR_CORRUPT;
  644. }
  645. static int lfs_dir_fetch(lfs_t *lfs,
  646. lfs_mdir_t *dir, const lfs_block_t pair[2]) {
  647. return lfs_dir_fetchmatch(lfs, dir, pair,
  648. 0xffffffff, 0x00000000, NULL, NULL);
  649. }
  650. struct lfs_dir_get_match {
  651. lfs_t *lfs;
  652. void *buffer;
  653. lfs_size_t size;
  654. bool compacting;
  655. };
  656. static int lfs_dir_get_match(void *data,
  657. lfs_tag_t tag, const void *buffer) {
  658. struct lfs_dir_get_match *get = data;
  659. lfs_t *lfs = get->lfs;
  660. const struct lfs_diskoff *disk = buffer;
  661. if (lfs_tag_isdelete(tag) && !get->compacting) {
  662. return LFS_ERR_NOENT;
  663. }
  664. if (get->buffer) {
  665. lfs_size_t diff = lfs_min(lfs_tag_size(tag), get->size);
  666. int err = lfs_bd_read(lfs,
  667. &lfs->pcache, &lfs->rcache, diff,
  668. disk->block, disk->off, get->buffer, diff);
  669. if (err) {
  670. return err;
  671. }
  672. memset((uint8_t*)get->buffer + diff, 0, get->size - diff);
  673. }
  674. return tag & 0x7fffffff;
  675. }
  676. static lfs_stag_t lfs_dir_get(lfs_t *lfs, const lfs_mdir_t *dir,
  677. lfs_tag_t getmask, lfs_tag_t gettag, void *buffer) {
  678. lfs_stag_t getdiff = 0;
  679. if (lfs->globals.hasmove &&
  680. lfs_pair_cmp(dir->pair, lfs->globals.pair) == 0 &&
  681. lfs_tag_id(gettag) <= lfs->globals.id) {
  682. // synthetic moves
  683. gettag += LFS_MKTAG(0, 1, 0);
  684. getdiff -= LFS_MKTAG(0, 1, 0);
  685. }
  686. lfs_stag_t res = lfs_dir_traverse(lfs, dir, NULL,
  687. getmask, gettag, getdiff,
  688. lfs_dir_get_match, &(struct lfs_dir_get_match){
  689. lfs, buffer, lfs_tag_size(gettag)});
  690. if (res < 0) {
  691. return res;
  692. }
  693. return res ? res : LFS_ERR_NOENT;
  694. }
  695. static int lfs_dir_getglobals(lfs_t *lfs, const lfs_mdir_t *dir,
  696. struct lfs_globals *globals) {
  697. struct lfs_globals locals;
  698. lfs_stag_t res = lfs_dir_get(lfs, dir, 0x7c000000,
  699. LFS_MKTAG(LFS_TYPE_GLOBALS, 0, 10), &locals);
  700. if (res < 0 && res != LFS_ERR_NOENT) {
  701. return res;
  702. }
  703. if (res != LFS_ERR_NOENT) {
  704. locals.hasmove = (lfs_tag_type(res) & 2);
  705. locals.orphans = (lfs_tag_type(res) & 1);
  706. // xor together to find resulting globals
  707. lfs_global_xor(globals, &locals);
  708. }
  709. return 0;
  710. }
  711. static int lfs_dir_getinfo(lfs_t *lfs, lfs_mdir_t *dir,
  712. uint16_t id, struct lfs_info *info) {
  713. if (id == 0x3ff) {
  714. // special case for root
  715. strcpy(info->name, "/");
  716. info->type = LFS_TYPE_DIR;
  717. return 0;
  718. }
  719. lfs_stag_t tag = lfs_dir_get(lfs, dir, 0x7c3ff000,
  720. LFS_MKTAG(LFS_TYPE_NAME, id, lfs->name_max+1), info->name);
  721. if (tag < 0) {
  722. return tag;
  723. }
  724. info->type = lfs_tag_type(tag);
  725. struct lfs_ctz ctz;
  726. tag = lfs_dir_get(lfs, dir, 0x7c3ff000,
  727. LFS_MKTAG(LFS_TYPE_STRUCT, id, sizeof(ctz)), &ctz);
  728. if (tag < 0) {
  729. return tag;
  730. }
  731. lfs_ctz_fromle32(&ctz);
  732. if (lfs_tag_type(tag) == LFS_TYPE_CTZSTRUCT) {
  733. info->size = ctz.size;
  734. } else if (lfs_tag_type(tag) == LFS_TYPE_INLINESTRUCT) {
  735. info->size = lfs_tag_size(tag);
  736. }
  737. return 0;
  738. }
  739. static lfs_stag_t lfs_dir_findmatch(lfs_t *lfs,
  740. lfs_mdir_t *dir, const lfs_block_t pair[2], bool fs,
  741. lfs_tag_t findmask, lfs_tag_t findtag,
  742. int (*cb)(void *data, lfs_tag_t tag, const void *buffer), void *data) {
  743. dir->split = true;
  744. dir->tail[0] = pair[0];
  745. dir->tail[1] = pair[1];
  746. while ((dir->split || fs) && !lfs_pair_isnull(dir->tail)) {
  747. lfs_stag_t tag = lfs_dir_fetchmatch(lfs, dir, dir->tail,
  748. findmask, findtag, cb, data);
  749. if (tag) {
  750. return tag;
  751. }
  752. }
  753. return LFS_ERR_NOENT;
  754. }
  755. struct lfs_dir_find_match {
  756. lfs_t *lfs;
  757. const void *name;
  758. lfs_size_t size;
  759. };
  760. static int lfs_dir_find_match(void *data,
  761. lfs_tag_t tag, const void *buffer) {
  762. struct lfs_dir_find_match *name = data;
  763. lfs_t *lfs = name->lfs;
  764. const struct lfs_diskoff *disk = buffer;
  765. (void)tag;
  766. return lfs_bd_cmp(lfs,
  767. NULL, &lfs->rcache, name->size,
  768. disk->block, disk->off, name->name, name->size);
  769. }
  770. static lfs_stag_t lfs_dir_find(lfs_t *lfs,
  771. lfs_mdir_t *dir, const char **path) {
  772. // we reduce path to a single name if we can find it
  773. const char *name = *path;
  774. *path = NULL;
  775. // default to root dir
  776. lfs_stag_t tag = LFS_MKTAG(LFS_TYPE_DIR, 0x3ff, 0);
  777. lfs_block_t pair[2] = {lfs->root[0], lfs->root[1]};
  778. while (true) {
  779. nextname:
  780. // skip slashes
  781. name += strspn(name, "/");
  782. lfs_size_t namelen = strcspn(name, "/");
  783. // skip '.' and root '..'
  784. if ((namelen == 1 && memcmp(name, ".", 1) == 0) ||
  785. (namelen == 2 && memcmp(name, "..", 2) == 0)) {
  786. name += namelen;
  787. goto nextname;
  788. }
  789. // skip if matched by '..' in name
  790. const char *suffix = name + namelen;
  791. lfs_size_t sufflen;
  792. int depth = 1;
  793. while (true) {
  794. suffix += strspn(suffix, "/");
  795. sufflen = strcspn(suffix, "/");
  796. if (sufflen == 0) {
  797. break;
  798. }
  799. if (sufflen == 2 && memcmp(suffix, "..", 2) == 0) {
  800. depth -= 1;
  801. if (depth == 0) {
  802. name = suffix + sufflen;
  803. goto nextname;
  804. }
  805. } else {
  806. depth += 1;
  807. }
  808. suffix += sufflen;
  809. }
  810. // found path
  811. if (name[0] == '\0') {
  812. return tag;
  813. }
  814. // update what we've found if path is only a name
  815. if (strchr(name, '/') == NULL) {
  816. *path = name;
  817. }
  818. // only continue if we hit a directory
  819. if (lfs_tag_type(tag) != LFS_TYPE_DIR) {
  820. return LFS_ERR_NOTDIR;
  821. }
  822. // grab the entry data
  823. if (lfs_tag_id(tag) != 0x3ff) {
  824. lfs_stag_t res = lfs_dir_get(lfs, dir, 0x7c3ff000,
  825. LFS_MKTAG(LFS_TYPE_STRUCT, lfs_tag_id(tag), 8), pair);
  826. if (res < 0) {
  827. return res;
  828. }
  829. lfs_pair_fromle32(pair);
  830. }
  831. // find entry matching name
  832. tag = lfs_dir_findmatch(lfs, dir, pair, false, 0x7c000fff,
  833. LFS_MKTAG(LFS_TYPE_NAME, 0, namelen),
  834. lfs_dir_find_match, &(struct lfs_dir_find_match){
  835. lfs, name, namelen});
  836. if (tag < 0) {
  837. return tag;
  838. }
  839. // to next name
  840. name += namelen;
  841. }
  842. }
  843. // commit logic
  844. struct lfs_commit {
  845. lfs_block_t block;
  846. lfs_off_t off;
  847. lfs_tag_t ptag;
  848. uint32_t crc;
  849. lfs_off_t begin;
  850. lfs_off_t end;
  851. lfs_off_t ack;
  852. };
  853. static int lfs_commit_prog(lfs_t *lfs, struct lfs_commit *commit,
  854. const void *buffer, lfs_size_t size) {
  855. lfs_off_t skip = lfs_min(lfs_max(commit->ack, commit->off)
  856. - commit->off, size);
  857. int err = lfs_bd_prog(lfs,
  858. &lfs->pcache, &lfs->rcache, false,
  859. commit->block, commit->off + skip,
  860. (const uint8_t*)buffer + skip, size - skip);
  861. if (err) {
  862. return err;
  863. }
  864. commit->crc = lfs_crc(commit->crc, buffer, size);
  865. commit->off += size;
  866. commit->ack = lfs_max(commit->off, commit->ack);
  867. return 0;
  868. }
  869. static int lfs_commit_attr(lfs_t *lfs, struct lfs_commit *commit,
  870. lfs_tag_t tag, const void *buffer);
  871. struct lfs_commit_move_match {
  872. lfs_t *lfs;
  873. struct lfs_commit *commit;
  874. int pass;
  875. };
  876. static int lfs_commit_move_match(void *data,
  877. lfs_tag_t tag, const void *buffer) {
  878. struct lfs_commit_move_match *move = data;
  879. lfs_t *lfs = move->lfs;
  880. struct lfs_commit *commit = move->commit;
  881. if (move->pass == 0) {
  882. if (lfs_tag_subtype(tag) != LFS_TYPE_NAME) {
  883. return 0;
  884. }
  885. } else {
  886. // check if type has already been committed
  887. lfs_stag_t res = lfs_dir_traverse(lfs, &(const lfs_mdir_t){
  888. .pair[0] = commit->block,
  889. .off = commit->off,
  890. .etag = commit->ptag}, NULL,
  891. lfs_tag_isuser(tag) ? 0x7ffff000 : 0x7c3ff000, tag, 0,
  892. lfs_dir_get_match, &(struct lfs_dir_get_match){
  893. lfs, NULL, 0, true});
  894. if (res < 0 && res != LFS_ERR_NOENT) {
  895. return res;
  896. }
  897. if (res > 0) {
  898. return 0;
  899. }
  900. }
  901. // update id and commit, as we are currently unique
  902. return lfs_commit_attr(lfs, commit, tag, buffer);
  903. }
  904. static int lfs_commit_move(lfs_t *lfs, struct lfs_commit *commit, int pass,
  905. lfs_tag_t frommask, lfs_tag_t fromtag, lfs_stag_t fromdiff,
  906. const lfs_mdir_t *dir, const struct lfs_mattr *attrs) {
  907. return lfs_dir_traverse(lfs, dir, attrs,
  908. frommask, fromtag, fromdiff,
  909. lfs_commit_move_match, &(struct lfs_commit_move_match){
  910. lfs, commit, pass});
  911. }
  912. static int lfs_commit_userattrs(lfs_t *lfs, struct lfs_commit *commit,
  913. uint16_t id, const struct lfs_attr *attrs) {
  914. for (const struct lfs_attr *a = attrs; a; a = a->next) {
  915. int err = lfs_commit_attr(lfs, commit,
  916. LFS_MKTAG(0x100 | a->type, id, a->size), a->buffer);
  917. if (err) {
  918. return err;
  919. }
  920. }
  921. return 0;
  922. }
  923. static int lfs_commit_attr(lfs_t *lfs, struct lfs_commit *commit,
  924. lfs_tag_t tag, const void *buffer) {
  925. if (lfs_tag_type(tag) == LFS_FROM_MOVE) {
  926. // special case for moves
  927. return lfs_commit_move(lfs, commit, 1,
  928. 0x003ff000, LFS_MKTAG(0, lfs_tag_size(tag), 0),
  929. LFS_MKTAG(0, lfs_tag_id(tag), 0) -
  930. LFS_MKTAG(0, lfs_tag_size(tag), 0),
  931. buffer, NULL);
  932. } else if (lfs_tag_type(tag) == LFS_FROM_USERATTRS) {
  933. // special case for custom attributes
  934. return lfs_commit_userattrs(lfs, commit,
  935. lfs_tag_id(tag), buffer);
  936. }
  937. // check if we fit
  938. lfs_size_t dsize = lfs_tag_dsize(tag);
  939. if (commit->off + dsize > commit->end) {
  940. return LFS_ERR_NOSPC;
  941. }
  942. // write out tag
  943. lfs_tag_t ntag = lfs_tole32((tag & 0x7fffffff) ^ commit->ptag);
  944. int err = lfs_commit_prog(lfs, commit, &ntag, sizeof(ntag));
  945. if (err) {
  946. return err;
  947. }
  948. if (!(tag & 0x80000000)) {
  949. // from memory
  950. err = lfs_commit_prog(lfs, commit, buffer, dsize-sizeof(tag));
  951. if (err) {
  952. return err;
  953. }
  954. } else {
  955. // from disk
  956. const struct lfs_diskoff *disk = buffer;
  957. for (lfs_off_t i = 0; i < dsize-sizeof(tag); i++) {
  958. // rely on caching to make this efficient
  959. uint8_t dat;
  960. err = lfs_bd_read(lfs,
  961. &lfs->pcache, &lfs->rcache, dsize-sizeof(tag)-i,
  962. disk->block, disk->off+i, &dat, 1);
  963. if (err) {
  964. return err;
  965. }
  966. err = lfs_commit_prog(lfs, commit, &dat, 1);
  967. if (err) {
  968. return err;
  969. }
  970. }
  971. }
  972. commit->ptag = tag & 0x7fffffff;
  973. return 0;
  974. }
  975. static int lfs_commit_globals(lfs_t *lfs, struct lfs_commit *commit,
  976. struct lfs_globals *globals) {
  977. return lfs_commit_attr(lfs, commit,
  978. LFS_MKTAG(LFS_TYPE_GLOBALS + 2*globals->hasmove + globals->orphans,
  979. 0x3ff, 10), globals);
  980. }
  981. static int lfs_commit_crc(lfs_t *lfs, struct lfs_commit *commit,
  982. bool compacting) {
  983. // align to program units
  984. lfs_off_t off = lfs_alignup(commit->off + 2*sizeof(uint32_t),
  985. lfs->cfg->prog_size);
  986. // read erased state from next program unit
  987. lfs_tag_t tag;
  988. int err = lfs_bd_read(lfs,
  989. &lfs->pcache, &lfs->rcache, sizeof(tag),
  990. commit->block, off, &tag, sizeof(tag));
  991. if (err && err != LFS_ERR_CORRUPT) {
  992. return err;
  993. }
  994. // build crc tag
  995. bool reset = ~lfs_fromle32(tag) >> 31;
  996. tag = LFS_MKTAG(LFS_TYPE_CRC + (compacting << 1) + reset,
  997. 0x3ff, off - (commit->off+sizeof(lfs_tag_t)));
  998. // write out crc
  999. uint32_t footer[2];
  1000. footer[0] = lfs_tole32(tag ^ commit->ptag);
  1001. commit->crc = lfs_crc(commit->crc, &footer[0], sizeof(footer[0]));
  1002. footer[1] = lfs_tole32(commit->crc);
  1003. err = lfs_bd_prog(lfs,
  1004. &lfs->pcache, &lfs->rcache, false,
  1005. commit->block, commit->off, &footer, sizeof(footer));
  1006. if (err) {
  1007. return err;
  1008. }
  1009. commit->off += sizeof(tag)+lfs_tag_size(tag);
  1010. commit->ptag = tag ^ (reset << 31);
  1011. // flush buffers
  1012. err = lfs_bd_sync(lfs, &lfs->pcache, &lfs->rcache, false);
  1013. if (err) {
  1014. return err;
  1015. }
  1016. // successful commit, check checksum to make sure
  1017. uint32_t crc = 0xffffffff;
  1018. lfs_size_t size = commit->off - lfs_tag_size(tag) - commit->begin;
  1019. for (lfs_off_t i = 0; i < size; i++) {
  1020. // leave it up to caching to make this efficient
  1021. uint8_t dat;
  1022. err = lfs_bd_read(lfs,
  1023. NULL, &lfs->rcache, size-i,
  1024. commit->block, commit->begin+i, &dat, 1);
  1025. if (err) {
  1026. return err;
  1027. }
  1028. crc = lfs_crc(crc, &dat, 1);
  1029. }
  1030. if (err) {
  1031. return err;
  1032. }
  1033. if (crc != commit->crc) {
  1034. return LFS_ERR_CORRUPT;
  1035. }
  1036. return 0;
  1037. }
  1038. static int lfs_dir_alloc(lfs_t *lfs, lfs_mdir_t *dir) {
  1039. // allocate pair of dir blocks (backwards, so we write block 1 first)
  1040. for (int i = 0; i < 2; i++) {
  1041. int err = lfs_alloc(lfs, &dir->pair[(i+1)%2]);
  1042. if (err) {
  1043. return err;
  1044. }
  1045. }
  1046. // rather than clobbering one of the blocks we just pretend
  1047. // the revision may be valid
  1048. int err = lfs_bd_read(lfs,
  1049. &lfs->pcache, &lfs->rcache, sizeof(dir->rev),
  1050. dir->pair[0], 0, &dir->rev, sizeof(dir->rev));
  1051. if (err) {
  1052. return err;
  1053. }
  1054. dir->rev = lfs_fromle32(dir->rev);
  1055. if (err && err != LFS_ERR_CORRUPT) {
  1056. return err;
  1057. }
  1058. // set defaults
  1059. dir->off = sizeof(dir->rev);
  1060. dir->etag = 0xffffffff;
  1061. dir->count = 0;
  1062. dir->tail[0] = 0xffffffff;
  1063. dir->tail[1] = 0xffffffff;
  1064. dir->erased = false;
  1065. dir->split = false;
  1066. // don't write out yet, let caller take care of that
  1067. return 0;
  1068. }
  1069. static int lfs_dir_drop(lfs_t *lfs, lfs_mdir_t *dir, const lfs_mdir_t *tail) {
  1070. // steal tail
  1071. dir->tail[0] = tail->tail[0];
  1072. dir->tail[1] = tail->tail[1];
  1073. dir->split = tail->split;
  1074. // steal state
  1075. int err = lfs_dir_getglobals(lfs, tail, &lfs->locals);
  1076. if (err) {
  1077. return err;
  1078. }
  1079. // update pred's tail
  1080. return lfs_dir_commit(lfs, dir,
  1081. LFS_MKATTR(LFS_TYPE_TAIL + dir->split,
  1082. 0x3ff, dir->tail, sizeof(dir->tail),
  1083. NULL));
  1084. }
  1085. static int lfs_dir_compact(lfs_t *lfs,
  1086. lfs_mdir_t *dir, const struct lfs_mattr *attrs,
  1087. lfs_mdir_t *source, uint16_t begin, uint16_t end) {
  1088. // save some state in case block is bad
  1089. const lfs_block_t oldpair[2] = {dir->pair[1], dir->pair[0]};
  1090. bool relocated = false;
  1091. // There's nothing special about our global delta, so feed it back
  1092. // into the global global delta
  1093. int err = lfs_dir_getglobals(lfs, dir, &lfs->locals);
  1094. if (err) {
  1095. return err;
  1096. }
  1097. // begin loop to commit compaction to blocks until a compact sticks
  1098. while (true) {
  1099. // setup compaction
  1100. bool splitted = false;
  1101. bool exhausted = false;
  1102. struct lfs_commit commit;
  1103. commit.block = dir->pair[1];
  1104. commit.ack = 0;
  1105. commit:
  1106. // setup erase state
  1107. exhausted = false;
  1108. dir->count = end - begin;
  1109. int16_t ackid = -1;
  1110. // setup commit state
  1111. commit.off = 0;
  1112. commit.crc = 0xffffffff;
  1113. commit.ptag = 0xffffffff;
  1114. // space is complicated, we need room for tail, crc, globals,
  1115. // cleanup delete, and we cap at half a block to give room
  1116. // for metadata updates
  1117. commit.begin = 0;
  1118. commit.end = lfs_min(
  1119. lfs_alignup(lfs->cfg->block_size/2, lfs->cfg->prog_size),
  1120. lfs->cfg->block_size - 38);
  1121. if (!splitted) {
  1122. // increment revision count
  1123. dir->rev += 1;
  1124. if (lfs->cfg->block_cycles &&
  1125. dir->rev % lfs->cfg->block_cycles == 0) {
  1126. if (lfs_pair_cmp(dir->pair,
  1127. (const lfs_block_t[2]){0, 1}) == 0) {
  1128. // we're writing too much to the superblock,
  1129. // should we expand?
  1130. lfs_stag_t res = lfs_fs_size(lfs);
  1131. if (res < 0) {
  1132. return res;
  1133. }
  1134. // do we have enough space to expand?
  1135. if (res < lfs->cfg->block_count/2) {
  1136. LFS_DEBUG("Expanding superblock at rev %"PRIu32,
  1137. dir->rev);
  1138. exhausted = true;
  1139. goto split;
  1140. }
  1141. } else {
  1142. // we're writing too much, time to relocate
  1143. exhausted = true;
  1144. goto relocate;
  1145. }
  1146. }
  1147. // erase block to write to
  1148. err = lfs_bd_erase(lfs, dir->pair[1]);
  1149. if (err) {
  1150. if (err == LFS_ERR_CORRUPT) {
  1151. goto relocate;
  1152. }
  1153. return err;
  1154. }
  1155. }
  1156. // write out header
  1157. uint32_t rev = lfs_tole32(dir->rev);
  1158. err = lfs_commit_prog(lfs, &commit, &rev, sizeof(rev));
  1159. if (err) {
  1160. if (err == LFS_ERR_CORRUPT) {
  1161. goto relocate;
  1162. }
  1163. return err;
  1164. }
  1165. // commit with a move
  1166. for (uint16_t id = begin; id < end || commit.off < commit.ack; id++) {
  1167. for (int pass = 0; pass < 2; pass++) {
  1168. err = lfs_commit_move(lfs, &commit, pass,
  1169. 0x003ff000, LFS_MKTAG(0, id, 0),
  1170. -LFS_MKTAG(0, begin, 0),
  1171. source, attrs);
  1172. if (err && !(splitted && err == LFS_ERR_NOSPC)) {
  1173. if (err == LFS_ERR_NOSPC) {
  1174. goto split;
  1175. } else if (err == LFS_ERR_CORRUPT) {
  1176. goto relocate;
  1177. }
  1178. return err;
  1179. }
  1180. }
  1181. ackid = id;
  1182. }
  1183. // reopen reserved space at the end
  1184. commit.end = lfs->cfg->block_size - 8;
  1185. if (ackid >= end) {
  1186. // extra garbage attributes were written out during split,
  1187. // need to clean up
  1188. err = lfs_commit_attr(lfs, &commit,
  1189. LFS_MKTAG(LFS_TYPE_DELETE, ackid, 0), NULL);
  1190. if (err) {
  1191. if (err == LFS_ERR_CORRUPT) {
  1192. goto relocate;
  1193. }
  1194. return err;
  1195. }
  1196. }
  1197. if (!relocated && !lfs_global_iszero(&lfs->locals)) {
  1198. // commit any globals, unless we're relocating,
  1199. // in which case our parent will steal our globals
  1200. err = lfs_commit_globals(lfs, &commit, &lfs->locals);
  1201. if (err) {
  1202. if (err == LFS_ERR_CORRUPT) {
  1203. goto relocate;
  1204. }
  1205. return err;
  1206. }
  1207. }
  1208. if (!lfs_pair_isnull(dir->tail)) {
  1209. // commit tail, which may be new after last size check
  1210. lfs_pair_tole32(dir->tail);
  1211. err = lfs_commit_attr(lfs, &commit,
  1212. LFS_MKTAG(LFS_TYPE_TAIL + dir->split,
  1213. 0x3ff, sizeof(dir->tail)), dir->tail);
  1214. lfs_pair_fromle32(dir->tail);
  1215. if (err) {
  1216. if (err == LFS_ERR_CORRUPT) {
  1217. goto relocate;
  1218. }
  1219. return err;
  1220. }
  1221. }
  1222. err = lfs_commit_crc(lfs, &commit, true);
  1223. if (err) {
  1224. if (err == LFS_ERR_CORRUPT) {
  1225. goto relocate;
  1226. }
  1227. return err;
  1228. }
  1229. // successful compaction, swap dir pair to indicate most recent
  1230. lfs_pair_swap(dir->pair);
  1231. dir->off = commit.off;
  1232. dir->etag = commit.ptag;
  1233. dir->erased = true;
  1234. break;
  1235. split:
  1236. // commit no longer fits, need to split dir,
  1237. // drop caches and create tail
  1238. splitted = !exhausted;
  1239. if (lfs->pcache.block != 0xffffffff) {
  1240. commit.ack -= lfs->pcache.size;
  1241. lfs_cache_drop(lfs, &lfs->pcache);
  1242. }
  1243. if (!exhausted && ackid < 0) {
  1244. // If we can't fit in this block, we won't fit in next block
  1245. return LFS_ERR_NOSPC;
  1246. }
  1247. lfs_mdir_t tail;
  1248. err = lfs_dir_alloc(lfs, &tail);
  1249. if (err) {
  1250. return err;
  1251. }
  1252. tail.split = dir->split;
  1253. tail.tail[0] = dir->tail[0];
  1254. tail.tail[1] = dir->tail[1];
  1255. err = lfs_dir_compact(lfs, &tail, attrs, source, ackid+1, end);
  1256. if (err) {
  1257. return err;
  1258. }
  1259. end = ackid+1;
  1260. dir->tail[0] = tail.pair[0];
  1261. dir->tail[1] = tail.pair[1];
  1262. dir->split = true;
  1263. if (exhausted) {
  1264. lfs->root[0] = tail.pair[0];
  1265. lfs->root[1] = tail.pair[1];
  1266. }
  1267. goto commit;
  1268. relocate:
  1269. // commit was corrupted, drop caches and prepare to relocate block
  1270. relocated = true;
  1271. lfs_cache_drop(lfs, &lfs->pcache);
  1272. if (!exhausted) {
  1273. LFS_DEBUG("Bad block at %"PRIu32, dir->pair[1]);
  1274. }
  1275. // can't relocate superblock, filesystem is now frozen
  1276. if (lfs_pair_cmp(oldpair, (const lfs_block_t[2]){0, 1}) == 0) {
  1277. LFS_WARN("Superblock %"PRIu32" has become unwritable", oldpair[1]);
  1278. return LFS_ERR_NOSPC;
  1279. }
  1280. // relocate half of pair
  1281. err = lfs_alloc(lfs, &dir->pair[1]);
  1282. if (err && (err != LFS_ERR_NOSPC && !exhausted)) {
  1283. return err;
  1284. }
  1285. continue;
  1286. }
  1287. if (!relocated) {
  1288. // successful commit, update globals
  1289. lfs_global_zero(&lfs->locals);
  1290. } else {
  1291. // update references if we relocated
  1292. LFS_DEBUG("Relocating %"PRIu32" %"PRIu32" to %"PRIu32" %"PRIu32,
  1293. oldpair[0], oldpair[1], dir->pair[0], dir->pair[1]);
  1294. err = lfs_fs_relocate(lfs, oldpair, dir->pair);
  1295. if (err) {
  1296. return err;
  1297. }
  1298. }
  1299. return 0;
  1300. }
  1301. static int lfs_dir_commit(lfs_t *lfs, lfs_mdir_t *dir,
  1302. const struct lfs_mattr *attrs) {
  1303. struct lfs_mattr cancelattr;
  1304. struct lfs_globals cancels;
  1305. lfs_global_zero(&cancels);
  1306. if (lfs->globals.hasmove &&
  1307. lfs_pair_cmp(dir->pair, lfs->globals.pair) == 0) {
  1308. // Wait, we have the move? Just cancel this out here
  1309. // We need to, or else the move can become outdated
  1310. cancelattr.tag = LFS_MKTAG(LFS_TYPE_DELETE, lfs->globals.id, 0);
  1311. cancelattr.next = attrs;
  1312. attrs = &cancelattr;
  1313. cancels.hasmove = lfs->globals.hasmove;
  1314. cancels.pair[0] = lfs->globals.pair[0];
  1315. cancels.pair[1] = lfs->globals.pair[1];
  1316. cancels.id = lfs->globals.id;
  1317. lfs_global_fromle32(&lfs->locals);
  1318. lfs_global_xor(&lfs->locals, &cancels);
  1319. lfs_global_tole32(&lfs->locals);
  1320. }
  1321. // calculate new directory size
  1322. lfs_tag_t deletetag = 0xffffffff;
  1323. int attrcount = 0;
  1324. for (const struct lfs_mattr *a = attrs; a; a = a->next) {
  1325. if (lfs_tag_subtype(a->tag) == LFS_TYPE_NAME) {
  1326. dir->count += 1;
  1327. } else if (lfs_tag_subtype(a->tag) == LFS_TYPE_DELETE) {
  1328. LFS_ASSERT(dir->count > 0);
  1329. dir->count -= 1;
  1330. deletetag = a->tag;
  1331. if (dir->count == 0) {
  1332. // should we actually drop the directory block?
  1333. lfs_mdir_t pdir;
  1334. int err = lfs_fs_pred(lfs, dir->pair, &pdir);
  1335. if (err && err != LFS_ERR_NOENT) {
  1336. return err;
  1337. }
  1338. if (err != LFS_ERR_NOENT && pdir.split) {
  1339. return lfs_dir_drop(lfs, &pdir, dir);
  1340. }
  1341. }
  1342. }
  1343. attrcount += 1;
  1344. }
  1345. while (true) {
  1346. if (!dir->erased) {
  1347. goto compact;
  1348. }
  1349. // try to commit
  1350. struct lfs_commit commit = {
  1351. .block = dir->pair[0],
  1352. .off = dir->off,
  1353. .crc = 0xffffffff,
  1354. .ptag = dir->etag,
  1355. .begin = dir->off,
  1356. .end = lfs->cfg->block_size - 8,
  1357. .ack = 0,
  1358. };
  1359. // iterate over commits backwards, this lets us "append" commits
  1360. for (int i = 0; i < attrcount; i++) {
  1361. const struct lfs_mattr *a = attrs;
  1362. for (int j = 0; j < attrcount-i-1; j++) {
  1363. a = a->next;
  1364. }
  1365. lfs_pair_tole32(dir->tail);
  1366. int err = lfs_commit_attr(lfs, &commit, a->tag, a->buffer);
  1367. lfs_pair_fromle32(dir->tail);
  1368. if (err) {
  1369. if (err == LFS_ERR_NOSPC || err == LFS_ERR_CORRUPT) {
  1370. goto compact;
  1371. }
  1372. return err;
  1373. }
  1374. }
  1375. // commit any global diffs if we have any
  1376. if (!lfs_global_iszero(&lfs->locals)) {
  1377. struct lfs_globals locals = lfs->locals;
  1378. int err = lfs_dir_getglobals(lfs, dir, &locals);
  1379. if (err) {
  1380. return err;
  1381. }
  1382. err = lfs_commit_globals(lfs, &commit, &locals);
  1383. if (err) {
  1384. if (err == LFS_ERR_NOSPC || err == LFS_ERR_CORRUPT) {
  1385. goto compact;
  1386. }
  1387. return err;
  1388. }
  1389. }
  1390. // finalize commit with the crc
  1391. int err = lfs_commit_crc(lfs, &commit, false);
  1392. if (err) {
  1393. if (err == LFS_ERR_NOSPC || err == LFS_ERR_CORRUPT) {
  1394. goto compact;
  1395. }
  1396. return err;
  1397. }
  1398. // successful commit, update dir
  1399. dir->off = commit.off;
  1400. dir->etag = commit.ptag;
  1401. // successful commit, update globals
  1402. lfs_global_zero(&lfs->locals);
  1403. break;
  1404. compact:
  1405. // fall back to compaction
  1406. lfs_cache_drop(lfs, &lfs->pcache);
  1407. err = lfs_dir_compact(lfs, dir, attrs, dir, 0, dir->count);
  1408. if (err) {
  1409. return err;
  1410. }
  1411. break;
  1412. }
  1413. // update globals that are affected
  1414. lfs_global_xor(&lfs->globals, &cancels);
  1415. // update any directories that are affected
  1416. lfs_mdir_t copy = *dir;
  1417. // two passes, once for things that aren't us, and one
  1418. // for things that are
  1419. for (struct lfs_mlist *d = lfs->mlist; d; d = d->next) {
  1420. if (lfs_pair_cmp(d->m.pair, copy.pair) == 0) {
  1421. d->m = *dir;
  1422. if (d->id == lfs_tag_id(deletetag)) {
  1423. d->m.pair[0] = 0xffffffff;
  1424. d->m.pair[1] = 0xffffffff;
  1425. } else if (d->id > lfs_tag_id(deletetag)) {
  1426. d->id -= 1;
  1427. if (d->type == LFS_TYPE_DIR) {
  1428. ((lfs_dir_t*)d)->pos -= 1;
  1429. }
  1430. }
  1431. while (d->id >= d->m.count && d->m.split) {
  1432. // we split and id is on tail now
  1433. d->id -= d->m.count;
  1434. int err = lfs_dir_fetch(lfs, &d->m, d->m.tail);
  1435. if (err) {
  1436. return err;
  1437. }
  1438. }
  1439. }
  1440. }
  1441. return 0;
  1442. }
  1443. /// Top level directory operations ///
  1444. int lfs_mkdir(lfs_t *lfs, const char *path) {
  1445. // deorphan if we haven't yet, needed at most once after poweron
  1446. int err = lfs_fs_forceconsistency(lfs);
  1447. if (err) {
  1448. return err;
  1449. }
  1450. lfs_mdir_t cwd;
  1451. lfs_stag_t res = lfs_dir_find(lfs, &cwd, &path);
  1452. if (!(res == LFS_ERR_NOENT && path)) {
  1453. return (res < 0) ? res : LFS_ERR_EXIST;
  1454. }
  1455. // check that name fits
  1456. lfs_size_t nlen = strlen(path);
  1457. if (nlen > lfs->name_max) {
  1458. return LFS_ERR_NAMETOOLONG;
  1459. }
  1460. // build up new directory
  1461. lfs_alloc_ack(lfs);
  1462. lfs_mdir_t dir;
  1463. err = lfs_dir_alloc(lfs, &dir);
  1464. if (err) {
  1465. return err;
  1466. }
  1467. dir.tail[0] = cwd.tail[0];
  1468. dir.tail[1] = cwd.tail[1];
  1469. err = lfs_dir_commit(lfs, &dir, NULL);
  1470. if (err) {
  1471. return err;
  1472. }
  1473. // get next slot and commit
  1474. uint16_t id = cwd.count;
  1475. cwd.tail[0] = dir.pair[0];
  1476. cwd.tail[1] = dir.pair[1];
  1477. lfs_pair_tole32(dir.pair);
  1478. err = lfs_dir_commit(lfs, &cwd,
  1479. LFS_MKATTR(LFS_TYPE_SOFTTAIL, 0x3ff, cwd.tail, sizeof(cwd.tail),
  1480. LFS_MKATTR(LFS_TYPE_DIRSTRUCT, id, dir.pair, sizeof(dir.pair),
  1481. LFS_MKATTR(LFS_TYPE_DIR, id, path, nlen,
  1482. NULL))));
  1483. lfs_pair_fromle32(dir.pair);
  1484. if (err) {
  1485. return err;
  1486. }
  1487. return 0;
  1488. }
  1489. int lfs_dir_open(lfs_t *lfs, lfs_dir_t *dir, const char *path) {
  1490. lfs_stag_t tag = lfs_dir_find(lfs, &dir->m, &path);
  1491. if (tag < 0) {
  1492. return tag;
  1493. }
  1494. if (lfs_tag_type(tag) != LFS_TYPE_DIR) {
  1495. return LFS_ERR_NOTDIR;
  1496. }
  1497. lfs_block_t pair[2];
  1498. if (lfs_tag_id(tag) == 0x3ff) {
  1499. // handle root dir separately
  1500. pair[0] = lfs->root[0];
  1501. pair[1] = lfs->root[1];
  1502. } else {
  1503. // get dir pair from parent
  1504. lfs_stag_t res = lfs_dir_get(lfs, &dir->m, 0x7c3ff000,
  1505. LFS_MKTAG(LFS_TYPE_STRUCT, lfs_tag_id(tag), 8), pair);
  1506. if (res < 0) {
  1507. return res;
  1508. }
  1509. lfs_pair_fromle32(pair);
  1510. }
  1511. // fetch first pair
  1512. int err = lfs_dir_fetch(lfs, &dir->m, pair);
  1513. if (err) {
  1514. return err;
  1515. }
  1516. // setup entry
  1517. dir->head[0] = dir->m.pair[0];
  1518. dir->head[1] = dir->m.pair[1];
  1519. dir->id = 0;
  1520. dir->pos = 0;
  1521. // add to list of mdirs
  1522. dir->type = LFS_TYPE_DIR;
  1523. dir->next = (lfs_dir_t*)lfs->mlist;
  1524. lfs->mlist = (struct lfs_mlist*)dir;
  1525. return 0;
  1526. }
  1527. int lfs_dir_close(lfs_t *lfs, lfs_dir_t *dir) {
  1528. // remove from list of mdirs
  1529. for (struct lfs_mlist **p = &lfs->mlist; *p; p = &(*p)->next) {
  1530. if (*p == (struct lfs_mlist*)dir) {
  1531. *p = (*p)->next;
  1532. break;
  1533. }
  1534. }
  1535. return 0;
  1536. }
  1537. int lfs_dir_read(lfs_t *lfs, lfs_dir_t *dir, struct lfs_info *info) {
  1538. memset(info, 0, sizeof(*info));
  1539. // special offset for '.' and '..'
  1540. if (dir->pos == 0) {
  1541. info->type = LFS_TYPE_DIR;
  1542. strcpy(info->name, ".");
  1543. dir->pos += 1;
  1544. return 1;
  1545. } else if (dir->pos == 1) {
  1546. info->type = LFS_TYPE_DIR;
  1547. strcpy(info->name, "..");
  1548. dir->pos += 1;
  1549. return 1;
  1550. }
  1551. while (true) {
  1552. if (dir->id == dir->m.count) {
  1553. if (!dir->m.split) {
  1554. return false;
  1555. }
  1556. int err = lfs_dir_fetch(lfs, &dir->m, dir->m.tail);
  1557. if (err) {
  1558. return err;
  1559. }
  1560. dir->id = 0;
  1561. }
  1562. int err = lfs_dir_getinfo(lfs, &dir->m, dir->id, info);
  1563. if (err && err != LFS_ERR_NOENT) {
  1564. return err;
  1565. }
  1566. dir->id += 1;
  1567. if (err != LFS_ERR_NOENT) {
  1568. break;
  1569. }
  1570. }
  1571. dir->pos += 1;
  1572. return true;
  1573. }
  1574. int lfs_dir_seek(lfs_t *lfs, lfs_dir_t *dir, lfs_off_t off) {
  1575. // simply walk from head dir
  1576. int err = lfs_dir_rewind(lfs, dir);
  1577. if (err) {
  1578. return err;
  1579. }
  1580. // first two for ./..
  1581. dir->pos = lfs_min(2, off);
  1582. off -= dir->pos;
  1583. while (off != 0) {
  1584. dir->id = lfs_min(dir->m.count, off);
  1585. dir->pos += dir->id;
  1586. off -= dir->id;
  1587. if (dir->id == dir->m.count) {
  1588. if (!dir->m.split) {
  1589. return LFS_ERR_INVAL;
  1590. }
  1591. err = lfs_dir_fetch(lfs, &dir->m, dir->m.tail);
  1592. if (err) {
  1593. return err;
  1594. }
  1595. }
  1596. }
  1597. return 0;
  1598. }
  1599. lfs_soff_t lfs_dir_tell(lfs_t *lfs, lfs_dir_t *dir) {
  1600. (void)lfs;
  1601. return dir->pos;
  1602. }
  1603. int lfs_dir_rewind(lfs_t *lfs, lfs_dir_t *dir) {
  1604. // reload the head dir
  1605. int err = lfs_dir_fetch(lfs, &dir->m, dir->head);
  1606. if (err) {
  1607. return err;
  1608. }
  1609. dir->m.pair[0] = dir->head[0];
  1610. dir->m.pair[1] = dir->head[1];
  1611. dir->id = 0;
  1612. dir->pos = 0;
  1613. return 0;
  1614. }
  1615. /// File index list operations ///
  1616. static int lfs_ctz_index(lfs_t *lfs, lfs_off_t *off) {
  1617. lfs_off_t size = *off;
  1618. lfs_off_t b = lfs->cfg->block_size - 2*4;
  1619. lfs_off_t i = size / b;
  1620. if (i == 0) {
  1621. return 0;
  1622. }
  1623. i = (size - 4*(lfs_popc(i-1)+2)) / b;
  1624. *off = size - b*i - 4*lfs_popc(i);
  1625. return i;
  1626. }
  1627. static int lfs_ctz_find(lfs_t *lfs,
  1628. const lfs_cache_t *pcache, lfs_cache_t *rcache,
  1629. lfs_block_t head, lfs_size_t size,
  1630. lfs_size_t pos, lfs_block_t *block, lfs_off_t *off) {
  1631. if (size == 0) {
  1632. *block = 0xffffffff;
  1633. *off = 0;
  1634. return 0;
  1635. }
  1636. lfs_off_t current = lfs_ctz_index(lfs, &(lfs_off_t){size-1});
  1637. lfs_off_t target = lfs_ctz_index(lfs, &pos);
  1638. while (current > target) {
  1639. lfs_size_t skip = lfs_min(
  1640. lfs_npw2(current-target+1) - 1,
  1641. lfs_ctz(current));
  1642. int err = lfs_bd_read(lfs,
  1643. pcache, rcache, sizeof(head),
  1644. head, 4*skip, &head, sizeof(head));
  1645. head = lfs_fromle32(head);
  1646. if (err) {
  1647. return err;
  1648. }
  1649. LFS_ASSERT(head >= 2 && head <= lfs->cfg->block_count);
  1650. current -= 1 << skip;
  1651. }
  1652. *block = head;
  1653. *off = pos;
  1654. return 0;
  1655. }
  1656. static int lfs_ctz_extend(lfs_t *lfs,
  1657. lfs_cache_t *pcache, lfs_cache_t *rcache,
  1658. lfs_block_t head, lfs_size_t size,
  1659. lfs_block_t *block, lfs_off_t *off) {
  1660. while (true) {
  1661. // go ahead and grab a block
  1662. lfs_block_t nblock;
  1663. int err = lfs_alloc(lfs, &nblock);
  1664. if (err) {
  1665. return err;
  1666. }
  1667. LFS_ASSERT(nblock >= 2 && nblock <= lfs->cfg->block_count);
  1668. err = lfs_bd_erase(lfs, nblock);
  1669. if (err) {
  1670. if (err == LFS_ERR_CORRUPT) {
  1671. goto relocate;
  1672. }
  1673. return err;
  1674. }
  1675. if (size == 0) {
  1676. *block = nblock;
  1677. *off = 0;
  1678. return 0;
  1679. }
  1680. size -= 1;
  1681. lfs_off_t index = lfs_ctz_index(lfs, &size);
  1682. size += 1;
  1683. // just copy out the last block if it is incomplete
  1684. if (size != lfs->cfg->block_size) {
  1685. for (lfs_off_t i = 0; i < size; i++) {
  1686. uint8_t data;
  1687. err = lfs_bd_read(lfs,
  1688. NULL, rcache, size-i,
  1689. head, i, &data, 1);
  1690. if (err) {
  1691. return err;
  1692. }
  1693. err = lfs_bd_prog(lfs,
  1694. pcache, rcache, true,
  1695. nblock, i, &data, 1);
  1696. if (err) {
  1697. if (err == LFS_ERR_CORRUPT) {
  1698. goto relocate;
  1699. }
  1700. return err;
  1701. }
  1702. }
  1703. *block = nblock;
  1704. *off = size;
  1705. return 0;
  1706. }
  1707. // append block
  1708. index += 1;
  1709. lfs_size_t skips = lfs_ctz(index) + 1;
  1710. for (lfs_off_t i = 0; i < skips; i++) {
  1711. head = lfs_tole32(head);
  1712. err = lfs_bd_prog(lfs, pcache, rcache, true,
  1713. nblock, 4*i, &head, 4);
  1714. head = lfs_fromle32(head);
  1715. if (err) {
  1716. if (err == LFS_ERR_CORRUPT) {
  1717. goto relocate;
  1718. }
  1719. return err;
  1720. }
  1721. if (i != skips-1) {
  1722. err = lfs_bd_read(lfs,
  1723. NULL, rcache, sizeof(head),
  1724. head, 4*i, &head, sizeof(head));
  1725. head = lfs_fromle32(head);
  1726. if (err) {
  1727. return err;
  1728. }
  1729. }
  1730. LFS_ASSERT(head >= 2 && head <= lfs->cfg->block_count);
  1731. }
  1732. *block = nblock;
  1733. *off = 4*skips;
  1734. return 0;
  1735. relocate:
  1736. LFS_DEBUG("Bad block at %"PRIu32, nblock);
  1737. // just clear cache and try a new block
  1738. lfs_cache_drop(lfs, pcache);
  1739. }
  1740. }
  1741. static int lfs_ctz_traverse(lfs_t *lfs,
  1742. const lfs_cache_t *pcache, lfs_cache_t *rcache,
  1743. lfs_block_t head, lfs_size_t size,
  1744. int (*cb)(void*, lfs_block_t), void *data) {
  1745. if (size == 0) {
  1746. return 0;
  1747. }
  1748. lfs_off_t index = lfs_ctz_index(lfs, &(lfs_off_t){size-1});
  1749. while (true) {
  1750. int err = cb(data, head);
  1751. if (err) {
  1752. return err;
  1753. }
  1754. if (index == 0) {
  1755. return 0;
  1756. }
  1757. lfs_block_t heads[2];
  1758. int count = 2 - (index & 1);
  1759. err = lfs_bd_read(lfs,
  1760. pcache, rcache, count*sizeof(head),
  1761. head, 0, &heads, count*sizeof(head));
  1762. heads[0] = lfs_fromle32(heads[0]);
  1763. heads[1] = lfs_fromle32(heads[1]);
  1764. if (err) {
  1765. return err;
  1766. }
  1767. for (int i = 0; i < count-1; i++) {
  1768. err = cb(data, heads[i]);
  1769. if (err) {
  1770. return err;
  1771. }
  1772. }
  1773. head = heads[count-1];
  1774. index -= count;
  1775. }
  1776. }
  1777. /// Top level file operations ///
  1778. int lfs_file_opencfg(lfs_t *lfs, lfs_file_t *file,
  1779. const char *path, int flags,
  1780. const struct lfs_file_config *cfg) {
  1781. // deorphan if we haven't yet, needed at most once after poweron
  1782. if ((flags & 3) != LFS_O_RDONLY) {
  1783. int err = lfs_fs_forceconsistency(lfs);
  1784. if (err) {
  1785. return err;
  1786. }
  1787. }
  1788. // setup simple file details
  1789. int err = 0;
  1790. file->cfg = cfg;
  1791. file->flags = flags;
  1792. file->pos = 0;
  1793. file->cache.buffer = NULL;
  1794. // allocate entry for file if it doesn't exist
  1795. lfs_stag_t tag = lfs_dir_find(lfs, &file->m, &path);
  1796. if (tag < 0 && !(tag == LFS_ERR_NOENT && path)) {
  1797. err = tag;
  1798. goto cleanup;
  1799. }
  1800. // get id, add to list of mdirs to catch update changes
  1801. file->id = lfs_tag_id(tag);
  1802. file->type = LFS_TYPE_REG;
  1803. file->next = (lfs_file_t*)lfs->mlist;
  1804. lfs->mlist = (struct lfs_mlist*)file;
  1805. if (tag == LFS_ERR_NOENT) {
  1806. if (!(flags & LFS_O_CREAT)) {
  1807. err = LFS_ERR_NOENT;
  1808. goto cleanup;
  1809. }
  1810. // check that name fits
  1811. lfs_size_t nlen = strlen(path);
  1812. if (nlen > lfs->name_max) {
  1813. err = LFS_ERR_NAMETOOLONG;
  1814. goto cleanup;
  1815. }
  1816. // get next slot and create entry to remember name
  1817. file->id = file->m.count;
  1818. err = lfs_dir_commit(lfs, &file->m,
  1819. LFS_MKATTR(LFS_TYPE_INLINESTRUCT, file->id, NULL, 0,
  1820. LFS_MKATTR(LFS_TYPE_REG, file->id, path, nlen,
  1821. NULL)));
  1822. if (err) {
  1823. err = LFS_ERR_NAMETOOLONG;
  1824. goto cleanup;
  1825. }
  1826. tag = LFS_MKTAG(LFS_TYPE_INLINESTRUCT, 0, 0);
  1827. } else if (flags & LFS_O_EXCL) {
  1828. err = LFS_ERR_EXIST;
  1829. goto cleanup;
  1830. } else if (lfs_tag_type(tag) != LFS_TYPE_REG) {
  1831. err = LFS_ERR_ISDIR;
  1832. goto cleanup;
  1833. } else if (flags & LFS_O_TRUNC) {
  1834. // truncate if requested
  1835. tag = LFS_MKTAG(LFS_TYPE_INLINESTRUCT, file->id, 0);
  1836. file->flags |= LFS_F_DIRTY;
  1837. } else {
  1838. // try to load what's on disk, if it's inlined we'll fix it later
  1839. tag = lfs_dir_get(lfs, &file->m, 0x7c3ff000,
  1840. LFS_MKTAG(LFS_TYPE_STRUCT, file->id, 8), &file->ctz);
  1841. if (tag < 0) {
  1842. err = tag;
  1843. goto cleanup;
  1844. }
  1845. lfs_ctz_fromle32(&file->ctz);
  1846. }
  1847. // fetch attrs
  1848. for (const struct lfs_attr *a = file->cfg->attrs; a; a = a->next) {
  1849. if ((file->flags & 3) != LFS_O_WRONLY) {
  1850. lfs_stag_t res = lfs_dir_get(lfs, &file->m, 0x7ffff000,
  1851. LFS_MKTAG(0x100 | a->type, file->id, a->size), a->buffer);
  1852. if (res < 0 && res != LFS_ERR_NOENT) {
  1853. err = res;
  1854. goto cleanup;
  1855. }
  1856. }
  1857. if ((file->flags & 3) != LFS_O_RDONLY) {
  1858. if (a->size > lfs->attr_max) {
  1859. err = LFS_ERR_NOSPC;
  1860. goto cleanup;
  1861. }
  1862. file->flags |= LFS_F_DIRTY;
  1863. }
  1864. }
  1865. // allocate buffer if needed
  1866. if (file->cfg->buffer) {
  1867. file->cache.buffer = file->cfg->buffer;
  1868. } else {
  1869. file->cache.buffer = lfs_malloc(lfs->cfg->cache_size);
  1870. if (!file->cache.buffer) {
  1871. err = LFS_ERR_NOMEM;
  1872. goto cleanup;
  1873. }
  1874. }
  1875. // zero to avoid information leak
  1876. lfs_cache_zero(lfs, &file->cache);
  1877. if (lfs_tag_type(tag) == LFS_TYPE_INLINESTRUCT) {
  1878. // load inline files
  1879. file->ctz.head = 0xfffffffe;
  1880. file->ctz.size = lfs_tag_size(tag);
  1881. file->flags |= LFS_F_INLINE;
  1882. file->cache.block = file->ctz.head;
  1883. file->cache.off = 0;
  1884. file->cache.size = lfs->cfg->cache_size;
  1885. // don't always read (may be new/trunc file)
  1886. if (file->ctz.size > 0) {
  1887. lfs_stag_t res = lfs_dir_get(lfs, &file->m, 0x7c3ff000,
  1888. LFS_MKTAG(LFS_TYPE_STRUCT, file->id, file->ctz.size),
  1889. file->cache.buffer);
  1890. if (res < 0) {
  1891. err = res;
  1892. goto cleanup;
  1893. }
  1894. }
  1895. }
  1896. return 0;
  1897. cleanup:
  1898. // clean up lingering resources
  1899. file->flags |= LFS_F_ERRED;
  1900. lfs_file_close(lfs, file);
  1901. return err;
  1902. }
  1903. int lfs_file_open(lfs_t *lfs, lfs_file_t *file,
  1904. const char *path, int flags) {
  1905. static const struct lfs_file_config defaults = {0};
  1906. return lfs_file_opencfg(lfs, file, path, flags, &defaults);
  1907. }
  1908. int lfs_file_close(lfs_t *lfs, lfs_file_t *file) {
  1909. int err = lfs_file_sync(lfs, file);
  1910. // remove from list of mdirs
  1911. for (struct lfs_mlist **p = &lfs->mlist; *p; p = &(*p)->next) {
  1912. if (*p == (struct lfs_mlist*)file) {
  1913. *p = (*p)->next;
  1914. break;
  1915. }
  1916. }
  1917. // clean up memory
  1918. if (!file->cfg->buffer) {
  1919. lfs_free(file->cache.buffer);
  1920. }
  1921. return err;
  1922. }
  1923. static int lfs_file_relocate(lfs_t *lfs, lfs_file_t *file) {
  1924. while (true) {
  1925. // just relocate what exists into new block
  1926. lfs_block_t nblock;
  1927. int err = lfs_alloc(lfs, &nblock);
  1928. if (err) {
  1929. return err;
  1930. }
  1931. err = lfs_bd_erase(lfs, nblock);
  1932. if (err) {
  1933. if (err == LFS_ERR_CORRUPT) {
  1934. goto relocate;
  1935. }
  1936. return err;
  1937. }
  1938. // either read from dirty cache or disk
  1939. for (lfs_off_t i = 0; i < file->off; i++) {
  1940. uint8_t data;
  1941. err = lfs_bd_read(lfs,
  1942. &file->cache, &lfs->rcache, file->off-i,
  1943. file->block, i, &data, 1);
  1944. if (err) {
  1945. return err;
  1946. }
  1947. err = lfs_bd_prog(lfs,
  1948. &lfs->pcache, &lfs->rcache, true,
  1949. nblock, i, &data, 1);
  1950. if (err) {
  1951. if (err == LFS_ERR_CORRUPT) {
  1952. goto relocate;
  1953. }
  1954. return err;
  1955. }
  1956. }
  1957. // copy over new state of file
  1958. memcpy(file->cache.buffer, lfs->pcache.buffer, lfs->cfg->cache_size);
  1959. file->cache.block = lfs->pcache.block;
  1960. file->cache.off = lfs->pcache.off;
  1961. file->cache.size = lfs->pcache.size;
  1962. lfs_cache_zero(lfs, &lfs->pcache);
  1963. file->block = nblock;
  1964. return 0;
  1965. relocate:
  1966. LFS_DEBUG("Bad block at %"PRIu32, nblock);
  1967. // just clear cache and try a new block
  1968. lfs_cache_drop(lfs, &lfs->pcache);
  1969. }
  1970. }
  1971. static int lfs_file_flush(lfs_t *lfs, lfs_file_t *file) {
  1972. if (file->flags & LFS_F_READING) {
  1973. file->flags &= ~LFS_F_READING;
  1974. }
  1975. if (file->flags & LFS_F_WRITING) {
  1976. lfs_off_t pos = file->pos;
  1977. if (!(file->flags & LFS_F_INLINE)) {
  1978. // copy over anything after current branch
  1979. lfs_file_t orig = {
  1980. .ctz.head = file->ctz.head,
  1981. .ctz.size = file->ctz.size,
  1982. .flags = LFS_O_RDONLY,
  1983. .pos = file->pos,
  1984. .cache = lfs->rcache,
  1985. };
  1986. lfs_cache_drop(lfs, &lfs->rcache);
  1987. while (file->pos < file->ctz.size) {
  1988. // copy over a byte at a time, leave it up to caching
  1989. // to make this efficient
  1990. uint8_t data;
  1991. lfs_ssize_t res = lfs_file_read(lfs, &orig, &data, 1);
  1992. if (res < 0) {
  1993. return res;
  1994. }
  1995. res = lfs_file_write(lfs, file, &data, 1);
  1996. if (res < 0) {
  1997. return res;
  1998. }
  1999. // keep our reference to the rcache in sync
  2000. if (lfs->rcache.block != 0xffffffff) {
  2001. lfs_cache_drop(lfs, &orig.cache);
  2002. lfs_cache_drop(lfs, &lfs->rcache);
  2003. }
  2004. }
  2005. // write out what we have
  2006. while (true) {
  2007. int err = lfs_bd_flush(lfs,
  2008. &file->cache, &lfs->rcache, true);
  2009. if (err) {
  2010. if (err == LFS_ERR_CORRUPT) {
  2011. goto relocate;
  2012. }
  2013. return err;
  2014. }
  2015. break;
  2016. relocate:
  2017. LFS_DEBUG("Bad block at %"PRIu32, file->block);
  2018. err = lfs_file_relocate(lfs, file);
  2019. if (err) {
  2020. return err;
  2021. }
  2022. }
  2023. } else {
  2024. file->ctz.size = lfs_max(file->pos, file->ctz.size);
  2025. }
  2026. // actual file updates
  2027. file->ctz.head = file->block;
  2028. file->ctz.size = file->pos;
  2029. file->flags &= ~LFS_F_WRITING;
  2030. file->flags |= LFS_F_DIRTY;
  2031. file->pos = pos;
  2032. }
  2033. return 0;
  2034. }
  2035. int lfs_file_sync(lfs_t *lfs, lfs_file_t *file) {
  2036. while (true) {
  2037. int err = lfs_file_flush(lfs, file);
  2038. if (err) {
  2039. return err;
  2040. }
  2041. if ((file->flags & LFS_F_DIRTY) &&
  2042. !(file->flags & LFS_F_ERRED) &&
  2043. !lfs_pair_isnull(file->m.pair)) {
  2044. // update dir entry
  2045. uint16_t type;
  2046. const void *buffer;
  2047. lfs_size_t size;
  2048. struct lfs_ctz ctz;
  2049. if (file->flags & LFS_F_INLINE) {
  2050. // inline the whole file
  2051. type = LFS_TYPE_INLINESTRUCT;
  2052. buffer = file->cache.buffer;
  2053. size = file->ctz.size;
  2054. } else {
  2055. // update the ctz reference
  2056. type = LFS_TYPE_CTZSTRUCT;
  2057. // copy ctz so alloc will work during a relocate
  2058. ctz = file->ctz;
  2059. lfs_ctz_tole32(&ctz);
  2060. buffer = &ctz;
  2061. size = sizeof(ctz);
  2062. }
  2063. // commit file data and attributes
  2064. err = lfs_dir_commit(lfs, &file->m,
  2065. LFS_MKATTR(LFS_FROM_USERATTRS,
  2066. file->id, file->cfg->attrs, 0,
  2067. LFS_MKATTR(type, file->id, buffer, size,
  2068. NULL)));
  2069. if (err) {
  2070. if (err == LFS_ERR_NOSPC && (file->flags & LFS_F_INLINE)) {
  2071. goto relocate;
  2072. }
  2073. return err;
  2074. }
  2075. file->flags &= ~LFS_F_DIRTY;
  2076. }
  2077. return 0;
  2078. relocate:
  2079. // inline file doesn't fit anymore
  2080. file->block = 0xfffffffe;
  2081. file->off = file->pos;
  2082. lfs_alloc_ack(lfs);
  2083. err = lfs_file_relocate(lfs, file);
  2084. if (err) {
  2085. return err;
  2086. }
  2087. file->flags &= ~LFS_F_INLINE;
  2088. file->flags |= LFS_F_WRITING;
  2089. }
  2090. }
  2091. lfs_ssize_t lfs_file_read(lfs_t *lfs, lfs_file_t *file,
  2092. void *buffer, lfs_size_t size) {
  2093. uint8_t *data = buffer;
  2094. lfs_size_t nsize = size;
  2095. if ((file->flags & 3) == LFS_O_WRONLY) {
  2096. return LFS_ERR_BADF;
  2097. }
  2098. if (file->flags & LFS_F_WRITING) {
  2099. // flush out any writes
  2100. int err = lfs_file_flush(lfs, file);
  2101. if (err) {
  2102. return err;
  2103. }
  2104. }
  2105. if (file->pos >= file->ctz.size) {
  2106. // eof if past end
  2107. return 0;
  2108. }
  2109. size = lfs_min(size, file->ctz.size - file->pos);
  2110. nsize = size;
  2111. while (nsize > 0) {
  2112. // check if we need a new block
  2113. if (!(file->flags & LFS_F_READING) ||
  2114. file->off == lfs->cfg->block_size) {
  2115. if (!(file->flags & LFS_F_INLINE)) {
  2116. int err = lfs_ctz_find(lfs, NULL, &file->cache,
  2117. file->ctz.head, file->ctz.size,
  2118. file->pos, &file->block, &file->off);
  2119. if (err) {
  2120. return err;
  2121. }
  2122. } else {
  2123. file->block = 0xfffffffe;
  2124. file->off = file->pos;
  2125. }
  2126. file->flags |= LFS_F_READING;
  2127. }
  2128. // read as much as we can in current block
  2129. lfs_size_t diff = lfs_min(nsize, lfs->cfg->block_size - file->off);
  2130. int err = lfs_bd_read(lfs,
  2131. NULL, &file->cache, lfs->cfg->block_size,
  2132. file->block, file->off, data, diff);
  2133. if (err) {
  2134. return err;
  2135. }
  2136. file->pos += diff;
  2137. file->off += diff;
  2138. data += diff;
  2139. nsize -= diff;
  2140. }
  2141. return size;
  2142. }
  2143. lfs_ssize_t lfs_file_write(lfs_t *lfs, lfs_file_t *file,
  2144. const void *buffer, lfs_size_t size) {
  2145. const uint8_t *data = buffer;
  2146. lfs_size_t nsize = size;
  2147. if ((file->flags & 3) == LFS_O_RDONLY) {
  2148. return LFS_ERR_BADF;
  2149. }
  2150. if (file->flags & LFS_F_READING) {
  2151. // drop any reads
  2152. int err = lfs_file_flush(lfs, file);
  2153. if (err) {
  2154. return err;
  2155. }
  2156. }
  2157. if ((file->flags & LFS_O_APPEND) && file->pos < file->ctz.size) {
  2158. file->pos = file->ctz.size;
  2159. }
  2160. if (!(file->flags & LFS_F_WRITING) && file->pos > file->ctz.size) {
  2161. // fill with zeros
  2162. lfs_off_t pos = file->pos;
  2163. file->pos = file->ctz.size;
  2164. while (file->pos < pos) {
  2165. lfs_ssize_t res = lfs_file_write(lfs, file, &(uint8_t){0}, 1);
  2166. if (res < 0) {
  2167. return res;
  2168. }
  2169. }
  2170. }
  2171. if ((file->flags & LFS_F_INLINE) &&
  2172. file->pos + nsize > lfs->inline_max) {
  2173. // inline file doesn't fit anymore
  2174. file->block = 0xfffffffe;
  2175. file->off = file->pos;
  2176. lfs_alloc_ack(lfs);
  2177. int err = lfs_file_relocate(lfs, file);
  2178. if (err) {
  2179. file->flags |= LFS_F_ERRED;
  2180. return err;
  2181. }
  2182. file->flags &= ~LFS_F_INLINE;
  2183. file->flags |= LFS_F_WRITING;
  2184. }
  2185. while (nsize > 0) {
  2186. // check if we need a new block
  2187. if (!(file->flags & LFS_F_WRITING) ||
  2188. file->off == lfs->cfg->block_size) {
  2189. if (!(file->flags & LFS_F_INLINE)) {
  2190. if (!(file->flags & LFS_F_WRITING) && file->pos > 0) {
  2191. // find out which block we're extending from
  2192. int err = lfs_ctz_find(lfs, NULL, &file->cache,
  2193. file->ctz.head, file->ctz.size,
  2194. file->pos-1, &file->block, &file->off);
  2195. if (err) {
  2196. file->flags |= LFS_F_ERRED;
  2197. return err;
  2198. }
  2199. // mark cache as dirty since we may have read data into it
  2200. lfs_cache_zero(lfs, &file->cache);
  2201. }
  2202. // extend file with new blocks
  2203. lfs_alloc_ack(lfs);
  2204. int err = lfs_ctz_extend(lfs, &file->cache, &lfs->rcache,
  2205. file->block, file->pos,
  2206. &file->block, &file->off);
  2207. if (err) {
  2208. file->flags |= LFS_F_ERRED;
  2209. return err;
  2210. }
  2211. } else {
  2212. file->block = 0xfffffffe;
  2213. file->off = file->pos;
  2214. }
  2215. file->flags |= LFS_F_WRITING;
  2216. }
  2217. // program as much as we can in current block
  2218. lfs_size_t diff = lfs_min(nsize, lfs->cfg->block_size - file->off);
  2219. while (true) {
  2220. int err = lfs_bd_prog(lfs, &file->cache, &lfs->rcache, true,
  2221. file->block, file->off, data, diff);
  2222. if (err) {
  2223. if (err == LFS_ERR_CORRUPT) {
  2224. goto relocate;
  2225. }
  2226. file->flags |= LFS_F_ERRED;
  2227. return err;
  2228. }
  2229. break;
  2230. relocate:
  2231. err = lfs_file_relocate(lfs, file);
  2232. if (err) {
  2233. file->flags |= LFS_F_ERRED;
  2234. return err;
  2235. }
  2236. }
  2237. file->pos += diff;
  2238. file->off += diff;
  2239. data += diff;
  2240. nsize -= diff;
  2241. lfs_alloc_ack(lfs);
  2242. }
  2243. file->flags &= ~LFS_F_ERRED;
  2244. return size;
  2245. }
  2246. lfs_soff_t lfs_file_seek(lfs_t *lfs, lfs_file_t *file,
  2247. lfs_soff_t off, int whence) {
  2248. // write out everything beforehand, may be noop if rdonly
  2249. int err = lfs_file_flush(lfs, file);
  2250. if (err) {
  2251. return err;
  2252. }
  2253. // update pos
  2254. if (whence == LFS_SEEK_SET) {
  2255. file->pos = off;
  2256. } else if (whence == LFS_SEEK_CUR) {
  2257. if (off < 0 && (lfs_off_t)-off > file->pos) {
  2258. return LFS_ERR_INVAL;
  2259. }
  2260. file->pos = file->pos + off;
  2261. } else if (whence == LFS_SEEK_END) {
  2262. if (off < 0 && (lfs_off_t)-off > file->ctz.size) {
  2263. return LFS_ERR_INVAL;
  2264. }
  2265. file->pos = file->ctz.size + off;
  2266. }
  2267. return file->pos;
  2268. }
  2269. int lfs_file_truncate(lfs_t *lfs, lfs_file_t *file, lfs_off_t size) {
  2270. if ((file->flags & 3) == LFS_O_RDONLY) {
  2271. return LFS_ERR_BADF;
  2272. }
  2273. lfs_off_t oldsize = lfs_file_size(lfs, file);
  2274. if (size < oldsize) {
  2275. // need to flush since directly changing metadata
  2276. int err = lfs_file_flush(lfs, file);
  2277. if (err) {
  2278. return err;
  2279. }
  2280. // lookup new head in ctz skip list
  2281. err = lfs_ctz_find(lfs, NULL, &file->cache,
  2282. file->ctz.head, file->ctz.size,
  2283. size, &file->ctz.head, &(lfs_off_t){0});
  2284. if (err) {
  2285. return err;
  2286. }
  2287. file->ctz.size = size;
  2288. file->flags |= LFS_F_DIRTY;
  2289. } else if (size > oldsize) {
  2290. lfs_off_t pos = file->pos;
  2291. // flush+seek if not already at end
  2292. if (file->pos != oldsize) {
  2293. int err = lfs_file_seek(lfs, file, 0, LFS_SEEK_END);
  2294. if (err < 0) {
  2295. return err;
  2296. }
  2297. }
  2298. // fill with zeros
  2299. while (file->pos < size) {
  2300. lfs_ssize_t res = lfs_file_write(lfs, file, &(uint8_t){0}, 1);
  2301. if (res < 0) {
  2302. return res;
  2303. }
  2304. }
  2305. // restore pos
  2306. int err = lfs_file_seek(lfs, file, pos, LFS_SEEK_SET);
  2307. if (err < 0) {
  2308. return err;
  2309. }
  2310. }
  2311. return 0;
  2312. }
  2313. lfs_soff_t lfs_file_tell(lfs_t *lfs, lfs_file_t *file) {
  2314. (void)lfs;
  2315. return file->pos;
  2316. }
  2317. int lfs_file_rewind(lfs_t *lfs, lfs_file_t *file) {
  2318. lfs_soff_t res = lfs_file_seek(lfs, file, 0, LFS_SEEK_SET);
  2319. if (res < 0) {
  2320. return res;
  2321. }
  2322. return 0;
  2323. }
  2324. lfs_soff_t lfs_file_size(lfs_t *lfs, lfs_file_t *file) {
  2325. (void)lfs;
  2326. if (file->flags & LFS_F_WRITING) {
  2327. return lfs_max(file->pos, file->ctz.size);
  2328. } else {
  2329. return file->ctz.size;
  2330. }
  2331. }
  2332. /// General fs operations ///
  2333. int lfs_stat(lfs_t *lfs, const char *path, struct lfs_info *info) {
  2334. lfs_mdir_t cwd;
  2335. lfs_stag_t tag = lfs_dir_find(lfs, &cwd, &path);
  2336. if (tag < 0) {
  2337. return tag;
  2338. }
  2339. return lfs_dir_getinfo(lfs, &cwd, lfs_tag_id(tag), info);
  2340. }
  2341. int lfs_remove(lfs_t *lfs, const char *path) {
  2342. // deorphan if we haven't yet, needed at most once after poweron
  2343. int err = lfs_fs_forceconsistency(lfs);
  2344. if (err) {
  2345. return err;
  2346. }
  2347. lfs_mdir_t cwd;
  2348. err = lfs_dir_fetch(lfs, &cwd, lfs->root);
  2349. if (err) {
  2350. return err;
  2351. }
  2352. lfs_stag_t tag = lfs_dir_find(lfs, &cwd, &path);
  2353. if (tag < 0) {
  2354. return tag;
  2355. }
  2356. lfs_mdir_t dir;
  2357. if (lfs_tag_type(tag) == LFS_TYPE_DIR) {
  2358. // must be empty before removal
  2359. lfs_block_t pair[2];
  2360. lfs_stag_t res = lfs_dir_get(lfs, &cwd, 0x7c3ff000,
  2361. LFS_MKTAG(LFS_TYPE_STRUCT, lfs_tag_id(tag), 8), pair);
  2362. if (res < 0) {
  2363. return res;
  2364. }
  2365. lfs_pair_fromle32(pair);
  2366. err = lfs_dir_fetch(lfs, &dir, pair);
  2367. if (err) {
  2368. return err;
  2369. }
  2370. if (dir.count > 0 || dir.split) {
  2371. return LFS_ERR_NOTEMPTY;
  2372. }
  2373. // mark fs as orphaned
  2374. lfs_global_orphans(lfs, +1);
  2375. }
  2376. // delete the entry
  2377. err = lfs_dir_commit(lfs, &cwd,
  2378. LFS_MKATTR(LFS_TYPE_DELETE, lfs_tag_id(tag), NULL, 0,
  2379. NULL));
  2380. if (err) {
  2381. return err;
  2382. }
  2383. if (lfs_tag_type(tag) == LFS_TYPE_DIR) {
  2384. // fix orphan
  2385. lfs_global_orphans(lfs, -1);
  2386. err = lfs_fs_pred(lfs, dir.pair, &cwd);
  2387. if (err) {
  2388. return err;
  2389. }
  2390. err = lfs_dir_drop(lfs, &cwd, &dir);
  2391. if (err) {
  2392. return err;
  2393. }
  2394. }
  2395. return 0;
  2396. }
  2397. int lfs_rename(lfs_t *lfs, const char *oldpath, const char *newpath) {
  2398. // deorphan if we haven't yet, needed at most once after poweron
  2399. int err = lfs_fs_forceconsistency(lfs);
  2400. if (err) {
  2401. return err;
  2402. }
  2403. // find old entry
  2404. lfs_mdir_t oldcwd;
  2405. lfs_stag_t oldtag = lfs_dir_find(lfs, &oldcwd, &oldpath);
  2406. if (oldtag < 0) {
  2407. return oldtag;
  2408. }
  2409. // find new entry
  2410. lfs_mdir_t newcwd;
  2411. lfs_stag_t prevtag = lfs_dir_find(lfs, &newcwd, &newpath);
  2412. if (prevtag < 0 && prevtag != LFS_ERR_NOENT) {
  2413. return prevtag;
  2414. }
  2415. uint16_t newid = lfs_tag_id(prevtag);
  2416. lfs_mdir_t prevdir;
  2417. if (prevtag == LFS_ERR_NOENT) {
  2418. // check that name fits
  2419. lfs_size_t nlen = strlen(newpath);
  2420. if (nlen > lfs->name_max) {
  2421. return LFS_ERR_NAMETOOLONG;
  2422. }
  2423. // get next id
  2424. newid = newcwd.count;
  2425. } else if (lfs_tag_type(prevtag) != lfs_tag_type(oldtag)) {
  2426. return LFS_ERR_ISDIR;
  2427. } else if (lfs_tag_type(prevtag) == LFS_TYPE_DIR) {
  2428. // must be empty before removal
  2429. lfs_block_t prevpair[2];
  2430. lfs_stag_t res = lfs_dir_get(lfs, &newcwd, 0x7c3ff000,
  2431. LFS_MKTAG(LFS_TYPE_STRUCT, newid, 8), prevpair);
  2432. if (res < 0) {
  2433. return res;
  2434. }
  2435. lfs_pair_fromle32(prevpair);
  2436. // must be empty before removal
  2437. err = lfs_dir_fetch(lfs, &prevdir, prevpair);
  2438. if (err) {
  2439. return err;
  2440. }
  2441. if (prevdir.count > 0 || prevdir.split) {
  2442. return LFS_ERR_NOTEMPTY;
  2443. }
  2444. // mark fs as orphaned
  2445. lfs_global_orphans(lfs, +1);
  2446. }
  2447. // create move to fix later
  2448. lfs_global_move(lfs, true, oldcwd.pair, lfs_tag_id(oldtag));
  2449. // move over all attributes
  2450. err = lfs_dir_commit(lfs, &newcwd,
  2451. LFS_MKATTR(LFS_FROM_MOVE, newid, &oldcwd, lfs_tag_id(oldtag),
  2452. LFS_MKATTR(lfs_tag_type(oldtag), newid, newpath, strlen(newpath),
  2453. (prevtag != LFS_ERR_NOENT)
  2454. ? LFS_MKATTR(LFS_TYPE_DELETE, newid, NULL, 0, NULL)
  2455. : NULL)));
  2456. if (err) {
  2457. return err;
  2458. }
  2459. // let commit clean up after move (if we're different! otherwise move
  2460. // logic already fixed it for us)
  2461. if (lfs_pair_cmp(oldcwd.pair, newcwd.pair) != 0) {
  2462. err = lfs_dir_commit(lfs, &oldcwd, NULL);
  2463. if (err) {
  2464. return err;
  2465. }
  2466. }
  2467. if (prevtag != LFS_ERR_NOENT && lfs_tag_type(prevtag) == LFS_TYPE_DIR) {
  2468. // fix orphan
  2469. lfs_global_orphans(lfs, -1);
  2470. err = lfs_fs_pred(lfs, prevdir.pair, &newcwd);
  2471. if (err) {
  2472. return err;
  2473. }
  2474. err = lfs_dir_drop(lfs, &newcwd, &prevdir);
  2475. if (err) {
  2476. return err;
  2477. }
  2478. }
  2479. return 0;
  2480. }
  2481. lfs_ssize_t lfs_getattr(lfs_t *lfs, const char *path,
  2482. uint8_t type, void *buffer, lfs_size_t size) {
  2483. lfs_mdir_t cwd;
  2484. lfs_stag_t res = lfs_dir_find(lfs, &cwd, &path);
  2485. if (res < 0) {
  2486. return res;
  2487. }
  2488. uint16_t id = lfs_tag_id(res);
  2489. if (id == 0x3ff) {
  2490. // special case for root
  2491. id = 0;
  2492. int err = lfs_dir_fetch(lfs, &cwd, lfs->root);
  2493. if (err) {
  2494. return err;
  2495. }
  2496. }
  2497. res = lfs_dir_get(lfs, &cwd, 0x7ffff000,
  2498. LFS_MKTAG(0x100 | type, id, lfs_min(size, lfs->attr_max)),
  2499. buffer);
  2500. if (res < 0) {
  2501. if (res == LFS_ERR_NOENT) {
  2502. return LFS_ERR_NOATTR;
  2503. }
  2504. return res;
  2505. }
  2506. return lfs_tag_size(res);
  2507. }
  2508. static int lfs_commitattr(lfs_t *lfs, const char *path,
  2509. uint8_t type, const void *buffer, lfs_size_t size) {
  2510. lfs_mdir_t cwd;
  2511. lfs_stag_t res = lfs_dir_find(lfs, &cwd, &path);
  2512. if (res < 0) {
  2513. return res;
  2514. }
  2515. uint16_t id = lfs_tag_id(res);
  2516. if (id == 0x3ff) {
  2517. // special case for root
  2518. id = 0;
  2519. int err = lfs_dir_fetch(lfs, &cwd, lfs->root);
  2520. if (err) {
  2521. return err;
  2522. }
  2523. }
  2524. return lfs_dir_commit(lfs, &cwd,
  2525. LFS_MKATTR(0x100 | type, id, buffer, size,
  2526. NULL));
  2527. }
  2528. int lfs_setattr(lfs_t *lfs, const char *path,
  2529. uint8_t type, const void *buffer, lfs_size_t size) {
  2530. if (size > lfs->attr_max) {
  2531. return LFS_ERR_NOSPC;
  2532. }
  2533. return lfs_commitattr(lfs, path, type, buffer, size);
  2534. }
  2535. int lfs_removeattr(lfs_t *lfs, const char *path, uint8_t type) {
  2536. return lfs_commitattr(lfs, path, type, NULL, LFS_ATTR_MAX+1);
  2537. }
  2538. /// Filesystem operations ///
  2539. static int lfs_init(lfs_t *lfs, const struct lfs_config *cfg) {
  2540. lfs->cfg = cfg;
  2541. int err = 0;
  2542. // check that block size is a multiple of cache size is a multiple
  2543. // of prog and read sizes
  2544. LFS_ASSERT(lfs->cfg->cache_size % lfs->cfg->read_size == 0);
  2545. LFS_ASSERT(lfs->cfg->cache_size % lfs->cfg->prog_size == 0);
  2546. LFS_ASSERT(lfs->cfg->block_size % lfs->cfg->cache_size == 0);
  2547. // check that the block size is large enough to fit ctz pointers
  2548. LFS_ASSERT(4*lfs_npw2(0xffffffff / (lfs->cfg->block_size-2*4))
  2549. <= lfs->cfg->block_size);
  2550. // setup read cache
  2551. if (lfs->cfg->read_buffer) {
  2552. lfs->rcache.buffer = lfs->cfg->read_buffer;
  2553. } else {
  2554. lfs->rcache.buffer = lfs_malloc(lfs->cfg->cache_size);
  2555. if (!lfs->rcache.buffer) {
  2556. err = LFS_ERR_NOMEM;
  2557. goto cleanup;
  2558. }
  2559. }
  2560. // setup program cache
  2561. if (lfs->cfg->prog_buffer) {
  2562. lfs->pcache.buffer = lfs->cfg->prog_buffer;
  2563. } else {
  2564. lfs->pcache.buffer = lfs_malloc(lfs->cfg->cache_size);
  2565. if (!lfs->pcache.buffer) {
  2566. err = LFS_ERR_NOMEM;
  2567. goto cleanup;
  2568. }
  2569. }
  2570. // zero to avoid information leaks
  2571. lfs_cache_zero(lfs, &lfs->rcache);
  2572. lfs_cache_zero(lfs, &lfs->pcache);
  2573. // setup lookahead, must be multiple of 32-bits
  2574. LFS_ASSERT(lfs->cfg->lookahead % 32 == 0);
  2575. LFS_ASSERT(lfs->cfg->lookahead > 0);
  2576. if (lfs->cfg->lookahead_buffer) {
  2577. lfs->free.buffer = lfs->cfg->lookahead_buffer;
  2578. } else {
  2579. lfs->free.buffer = lfs_malloc(lfs->cfg->lookahead/8);
  2580. if (!lfs->free.buffer) {
  2581. err = LFS_ERR_NOMEM;
  2582. goto cleanup;
  2583. }
  2584. }
  2585. // check that the size limits are sane
  2586. LFS_ASSERT(lfs->cfg->inline_max <= LFS_INLINE_MAX);
  2587. LFS_ASSERT(lfs->cfg->inline_max <= lfs->cfg->cache_size);
  2588. lfs->inline_max = lfs->cfg->inline_max;
  2589. if (!lfs->inline_max) {
  2590. lfs->inline_max = lfs_min(LFS_INLINE_MAX, lfs->cfg->cache_size);
  2591. }
  2592. LFS_ASSERT(lfs->cfg->attr_max <= LFS_ATTR_MAX);
  2593. lfs->attr_max = lfs->cfg->attr_max;
  2594. if (!lfs->attr_max) {
  2595. lfs->attr_max = LFS_ATTR_MAX;
  2596. }
  2597. LFS_ASSERT(lfs->cfg->name_max <= LFS_NAME_MAX);
  2598. lfs->name_max = lfs->cfg->name_max;
  2599. if (!lfs->name_max) {
  2600. lfs->name_max = LFS_NAME_MAX;
  2601. }
  2602. // setup default state
  2603. lfs->root[0] = 0xffffffff;
  2604. lfs->root[1] = 0xffffffff;
  2605. lfs->mlist = NULL;
  2606. lfs->seed = 0;
  2607. lfs_global_zero(&lfs->globals);
  2608. lfs_global_zero(&lfs->locals);
  2609. return 0;
  2610. cleanup:
  2611. lfs_deinit(lfs);
  2612. return err;
  2613. }
  2614. static int lfs_deinit(lfs_t *lfs) {
  2615. // free allocated memory
  2616. if (!lfs->cfg->read_buffer) {
  2617. lfs_free(lfs->rcache.buffer);
  2618. }
  2619. if (!lfs->cfg->prog_buffer) {
  2620. lfs_free(lfs->pcache.buffer);
  2621. }
  2622. if (!lfs->cfg->lookahead_buffer) {
  2623. lfs_free(lfs->free.buffer);
  2624. }
  2625. return 0;
  2626. }
  2627. int lfs_format(lfs_t *lfs, const struct lfs_config *cfg) {
  2628. int err = lfs_init(lfs, cfg);
  2629. if (err) {
  2630. return err;
  2631. }
  2632. // create free lookahead
  2633. memset(lfs->free.buffer, 0, lfs->cfg->lookahead/8);
  2634. lfs->free.off = 0;
  2635. lfs->free.size = lfs_min(lfs->cfg->lookahead, lfs->cfg->block_count);
  2636. lfs->free.i = 0;
  2637. lfs_alloc_ack(lfs);
  2638. // create root dir
  2639. lfs_mdir_t root;
  2640. err = lfs_dir_alloc(lfs, &root);
  2641. if (err) {
  2642. goto cleanup;
  2643. }
  2644. // write one superblock
  2645. lfs_superblock_t superblock = {
  2646. .magic = {"littlefs"},
  2647. .version = LFS_DISK_VERSION,
  2648. .block_size = lfs->cfg->block_size,
  2649. .block_count = lfs->cfg->block_count,
  2650. .attr_max = lfs->attr_max,
  2651. .name_max = lfs->name_max,
  2652. .inline_max = lfs->inline_max,
  2653. };
  2654. lfs_superblock_tole32(&superblock);
  2655. err = lfs_dir_commit(lfs, &root,
  2656. LFS_MKATTR(LFS_TYPE_SUPERBLOCK, 0, &superblock, sizeof(superblock),
  2657. NULL));
  2658. if (err) {
  2659. goto cleanup;
  2660. }
  2661. // sanity check that fetch works
  2662. err = lfs_dir_fetch(lfs, &root, (const lfs_block_t[2]){0, 1});
  2663. if (err) {
  2664. goto cleanup;
  2665. }
  2666. cleanup:
  2667. lfs_deinit(lfs);
  2668. return err;
  2669. }
  2670. int lfs_mount(lfs_t *lfs, const struct lfs_config *cfg) {
  2671. int err = lfs_init(lfs, cfg);
  2672. if (err) {
  2673. return err;
  2674. }
  2675. // scan directory blocks for superblock and any global updates
  2676. lfs_mdir_t dir = {.tail = {0, 1}};
  2677. while (!lfs_pair_isnull(dir.tail)) {
  2678. // fetch next block in tail list
  2679. lfs_stag_t res = lfs_dir_fetchmatch(lfs, &dir, dir.tail, 0x7fc00000,
  2680. LFS_MKTAG(LFS_TYPE_SUPERBLOCK, 0, 8),
  2681. lfs_dir_find_match, &(struct lfs_dir_find_match){
  2682. lfs, "littlefs", 8});
  2683. if (res < 0) {
  2684. err = res;
  2685. goto cleanup;
  2686. }
  2687. // has superblock?
  2688. if (res) {
  2689. // update root
  2690. lfs->root[0] = dir.pair[0];
  2691. lfs->root[1] = dir.pair[1];
  2692. // grab superblock
  2693. lfs_superblock_t superblock;
  2694. res = lfs_dir_get(lfs, &dir, 0x7f800000,
  2695. LFS_MKTAG(LFS_TYPE_SUPERBLOCK, 0, sizeof(superblock)),
  2696. &superblock);
  2697. if (res < 0) {
  2698. err = res;
  2699. goto cleanup;
  2700. }
  2701. lfs_superblock_fromle32(&superblock);
  2702. // check version
  2703. uint16_t major_version = (0xffff & (superblock.version >> 16));
  2704. uint16_t minor_version = (0xffff & (superblock.version >> 0));
  2705. if ((major_version != LFS_DISK_VERSION_MAJOR ||
  2706. minor_version > LFS_DISK_VERSION_MINOR)) {
  2707. LFS_ERROR("Invalid version %"PRIu32".%"PRIu32,
  2708. major_version, minor_version);
  2709. err = LFS_ERR_INVAL;
  2710. goto cleanup;
  2711. }
  2712. // check superblock configuration
  2713. if (superblock.attr_max) {
  2714. if (superblock.attr_max > lfs->attr_max) {
  2715. LFS_ERROR("Unsupported attr_max (%"PRIu32" > %"PRIu32")",
  2716. superblock.attr_max, lfs->attr_max);
  2717. err = LFS_ERR_INVAL;
  2718. goto cleanup;
  2719. }
  2720. lfs->attr_max = superblock.attr_max;
  2721. }
  2722. if (superblock.name_max) {
  2723. if (superblock.name_max > lfs->name_max) {
  2724. LFS_ERROR("Unsupported name_max (%"PRIu32" > %"PRIu32")",
  2725. superblock.name_max, lfs->name_max);
  2726. err = LFS_ERR_INVAL;
  2727. goto cleanup;
  2728. }
  2729. lfs->name_max = superblock.name_max;
  2730. }
  2731. if (superblock.inline_max) {
  2732. if (superblock.inline_max > lfs->inline_max) {
  2733. LFS_ERROR("Unsupported inline_max (%"PRIu32" > %"PRIu32")",
  2734. superblock.inline_max, lfs->inline_max);
  2735. err = LFS_ERR_INVAL;
  2736. goto cleanup;
  2737. }
  2738. lfs->inline_max = superblock.inline_max;
  2739. }
  2740. }
  2741. // has globals?
  2742. err = lfs_dir_getglobals(lfs, &dir, &lfs->locals);
  2743. if (err) {
  2744. return err;
  2745. }
  2746. }
  2747. // update littlefs with globals
  2748. lfs_global_fromle32(&lfs->locals);
  2749. lfs_global_xor(&lfs->globals, &lfs->locals);
  2750. lfs_global_zero(&lfs->locals);
  2751. if (lfs->globals.hasmove) {
  2752. LFS_DEBUG("Found move %"PRIu32" %"PRIu32" %"PRIu32,
  2753. lfs->globals.pair[0], lfs->globals.pair[1], lfs->globals.id);
  2754. }
  2755. // setup free lookahead
  2756. lfs->free.off = lfs->seed % lfs->cfg->block_size;
  2757. lfs->free.size = 0;
  2758. lfs->free.i = 0;
  2759. lfs_alloc_ack(lfs);
  2760. return 0;
  2761. cleanup:
  2762. lfs_unmount(lfs);
  2763. return err;
  2764. }
  2765. int lfs_unmount(lfs_t *lfs) {
  2766. return lfs_deinit(lfs);
  2767. }
  2768. /// Filesystem filesystem operations ///
  2769. int lfs_fs_traverse(lfs_t *lfs,
  2770. int (*cb)(void *data, lfs_block_t block), void *data) {
  2771. if (lfs_pair_isnull(lfs->root)) {
  2772. return 0;
  2773. }
  2774. // iterate over metadata pairs
  2775. lfs_mdir_t dir = {.tail = {0, 1}};
  2776. while (!lfs_pair_isnull(dir.tail)) {
  2777. for (int i = 0; i < 2; i++) {
  2778. int err = cb(data, dir.tail[i]);
  2779. if (err) {
  2780. return err;
  2781. }
  2782. }
  2783. // iterate through ids in directory
  2784. int err = lfs_dir_fetch(lfs, &dir, dir.tail);
  2785. if (err) {
  2786. return err;
  2787. }
  2788. for (uint16_t id = 0; id < dir.count; id++) {
  2789. struct lfs_ctz ctz;
  2790. lfs_stag_t tag = lfs_dir_get(lfs, &dir, 0x7c3ff000,
  2791. LFS_MKTAG(LFS_TYPE_STRUCT, id, sizeof(ctz)), &ctz);
  2792. if (tag < 0) {
  2793. if (tag == LFS_ERR_NOENT) {
  2794. continue;
  2795. }
  2796. return tag;
  2797. }
  2798. lfs_ctz_fromle32(&ctz);
  2799. if (lfs_tag_type(tag) == LFS_TYPE_CTZSTRUCT) {
  2800. err = lfs_ctz_traverse(lfs, NULL, &lfs->rcache,
  2801. ctz.head, ctz.size, cb, data);
  2802. if (err) {
  2803. return err;
  2804. }
  2805. }
  2806. }
  2807. }
  2808. // iterate over any open files
  2809. for (lfs_file_t *f = (lfs_file_t*)lfs->mlist; f; f = f->next) {
  2810. if (f->type != LFS_TYPE_REG) {
  2811. continue;
  2812. }
  2813. if ((f->flags & LFS_F_DIRTY) && !(f->flags & LFS_F_INLINE)) {
  2814. int err = lfs_ctz_traverse(lfs, &f->cache, &lfs->rcache,
  2815. f->ctz.head, f->ctz.size, cb, data);
  2816. if (err) {
  2817. return err;
  2818. }
  2819. }
  2820. if ((f->flags & LFS_F_WRITING) && !(f->flags & LFS_F_INLINE)) {
  2821. int err = lfs_ctz_traverse(lfs, &f->cache, &lfs->rcache,
  2822. f->block, f->pos, cb, data);
  2823. if (err) {
  2824. return err;
  2825. }
  2826. }
  2827. }
  2828. return 0;
  2829. }
  2830. static int lfs_fs_pred(lfs_t *lfs,
  2831. const lfs_block_t pair[2], lfs_mdir_t *pdir) {
  2832. if (lfs_pair_isnull(lfs->root)) {
  2833. return LFS_ERR_NOENT;
  2834. }
  2835. // iterate over all directory directory entries
  2836. pdir->tail[0] = 0;
  2837. pdir->tail[1] = 1;
  2838. while (!lfs_pair_isnull(pdir->tail)) {
  2839. if (lfs_pair_cmp(pdir->tail, pair) == 0) {
  2840. return 0;
  2841. }
  2842. int err = lfs_dir_fetch(lfs, pdir, pdir->tail);
  2843. if (err) {
  2844. return err;
  2845. }
  2846. }
  2847. return LFS_ERR_NOENT;
  2848. }
  2849. struct lfs_fs_parent_match {
  2850. lfs_t *lfs;
  2851. const lfs_block_t pair[2];
  2852. };
  2853. static int lfs_fs_parent_match(void *data,
  2854. lfs_tag_t tag, const void *buffer) {
  2855. struct lfs_fs_parent_match *find = data;
  2856. lfs_t *lfs = find->lfs;
  2857. const struct lfs_diskoff *disk = buffer;
  2858. (void)tag;
  2859. lfs_block_t child[2];
  2860. int err = lfs_bd_read(lfs,
  2861. &lfs->pcache, &lfs->rcache, lfs->cfg->block_size,
  2862. disk->block, disk->off, &child, sizeof(child));
  2863. if (err) {
  2864. return err;
  2865. }
  2866. lfs_pair_fromle32(child);
  2867. return (lfs_pair_cmp(child, find->pair) == 0);
  2868. }
  2869. static lfs_stag_t lfs_fs_parent(lfs_t *lfs, const lfs_block_t pair[2],
  2870. lfs_mdir_t *parent) {
  2871. if (lfs_pair_isnull(lfs->root)) {
  2872. return LFS_ERR_NOENT;
  2873. }
  2874. // search for both orderings so we can reuse the find function
  2875. for (int i = 0; i < 2; i++) {
  2876. struct lfs_fs_parent_match match = {lfs, {pair[0], pair[1]}};
  2877. lfs_stag_t tag = lfs_dir_findmatch(lfs, parent,
  2878. (const lfs_block_t[2]){0, 1}, true, 0x7fc00fff,
  2879. LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 0, 8),
  2880. lfs_fs_parent_match, &match);
  2881. if (tag != LFS_ERR_NOENT) {
  2882. return tag;
  2883. }
  2884. }
  2885. return LFS_ERR_NOENT;
  2886. }
  2887. static int lfs_fs_relocate(lfs_t *lfs,
  2888. const lfs_block_t oldpair[2], lfs_block_t newpair[2]) {
  2889. // update internal root
  2890. if (lfs_pair_cmp(oldpair, lfs->root) == 0) {
  2891. LFS_DEBUG("Relocating root %"PRIu32" %"PRIu32,
  2892. newpair[0], newpair[1]);
  2893. lfs->root[0] = newpair[0];
  2894. lfs->root[1] = newpair[1];
  2895. }
  2896. // update internally tracked dirs
  2897. for (struct lfs_mlist *d = lfs->mlist; d; d = d->next) {
  2898. if (lfs_pair_cmp(oldpair, d->m.pair) == 0) {
  2899. d->m.pair[0] = newpair[0];
  2900. d->m.pair[1] = newpair[1];
  2901. }
  2902. }
  2903. // find parent
  2904. lfs_mdir_t parent;
  2905. lfs_stag_t tag = lfs_fs_parent(lfs, oldpair, &parent);
  2906. if (tag < 0 && tag != LFS_ERR_NOENT) {
  2907. return tag;
  2908. }
  2909. if (tag != LFS_ERR_NOENT) {
  2910. // update disk, this creates a desync
  2911. lfs_global_orphans(lfs, +1);
  2912. lfs_pair_tole32(newpair);
  2913. int err = lfs_dir_commit(lfs, &parent,
  2914. &(struct lfs_mattr){.tag=tag, .buffer=newpair});
  2915. lfs_pair_fromle32(newpair);
  2916. if (err) {
  2917. return err;
  2918. }
  2919. // next step, clean up orphans
  2920. lfs_global_orphans(lfs, -1);
  2921. }
  2922. // find pred
  2923. int err = lfs_fs_pred(lfs, oldpair, &parent);
  2924. if (err && err != LFS_ERR_NOENT) {
  2925. return err;
  2926. }
  2927. // if we can't find dir, it must be new
  2928. if (err != LFS_ERR_NOENT) {
  2929. // replace bad pair, either we clean up desync, or no desync occured
  2930. parent.tail[0] = newpair[0];
  2931. parent.tail[1] = newpair[1];
  2932. err = lfs_dir_commit(lfs, &parent,
  2933. LFS_MKATTR(LFS_TYPE_TAIL + parent.split,
  2934. 0x3ff, parent.tail, sizeof(parent.tail),
  2935. NULL));
  2936. if (err) {
  2937. return err;
  2938. }
  2939. }
  2940. return 0;
  2941. }
  2942. static int lfs_fs_demove(lfs_t *lfs) {
  2943. if (!lfs->globals.hasmove) {
  2944. return 0;
  2945. }
  2946. // Fix bad moves
  2947. LFS_DEBUG("Fixing move %"PRIu32" %"PRIu32" %"PRIu32,
  2948. lfs->globals.pair[0], lfs->globals.pair[1], lfs->globals.id);
  2949. // fetch and delete the moved entry
  2950. lfs_mdir_t movedir;
  2951. int err = lfs_dir_fetch(lfs, &movedir, lfs->globals.pair);
  2952. if (err) {
  2953. return err;
  2954. }
  2955. // rely on cancel logic inside commit
  2956. err = lfs_dir_commit(lfs, &movedir, NULL);
  2957. if (err) {
  2958. return err;
  2959. }
  2960. return 0;
  2961. }
  2962. static int lfs_fs_deorphan(lfs_t *lfs) {
  2963. if (!lfs->globals.orphans) {
  2964. return 0;
  2965. }
  2966. // Fix any orphans
  2967. lfs_mdir_t pdir = {.split = true};
  2968. lfs_mdir_t dir = {.tail = {0, 1}};
  2969. // iterate over all directory directory entries
  2970. while (!lfs_pair_isnull(dir.tail)) {
  2971. int err = lfs_dir_fetch(lfs, &dir, dir.tail);
  2972. if (err) {
  2973. return err;
  2974. }
  2975. // check head blocks for orphans
  2976. if (!pdir.split) {
  2977. // check if we have a parent
  2978. lfs_mdir_t parent;
  2979. lfs_stag_t tag = lfs_fs_parent(lfs, pdir.tail, &parent);
  2980. if (tag < 0 && tag != LFS_ERR_NOENT) {
  2981. return tag;
  2982. }
  2983. if (tag == LFS_ERR_NOENT) {
  2984. // we are an orphan
  2985. LFS_DEBUG("Fixing orphan %"PRIu32" %"PRIu32,
  2986. pdir.tail[0], pdir.tail[1]);
  2987. err = lfs_dir_drop(lfs, &pdir, &dir);
  2988. if (err) {
  2989. return err;
  2990. }
  2991. break;
  2992. }
  2993. lfs_block_t pair[2];
  2994. lfs_stag_t res = lfs_dir_get(lfs, &parent, 0x7ffff000, tag, pair);
  2995. if (res < 0) {
  2996. return res;
  2997. }
  2998. lfs_pair_fromle32(pair);
  2999. if (!lfs_pair_sync(pair, pdir.tail)) {
  3000. // we have desynced
  3001. LFS_DEBUG("Fixing half-orphan %"PRIu32" %"PRIu32,
  3002. pair[0], pair[1]);
  3003. pdir.tail[0] = pair[0];
  3004. pdir.tail[1] = pair[1];
  3005. err = lfs_dir_commit(lfs, &pdir,
  3006. LFS_MKATTR(LFS_TYPE_SOFTTAIL,
  3007. 0x3ff, pdir.tail, sizeof(pdir.tail),
  3008. NULL));
  3009. if (err) {
  3010. return err;
  3011. }
  3012. break;
  3013. }
  3014. }
  3015. memcpy(&pdir, &dir, sizeof(pdir));
  3016. }
  3017. // mark orphans as fixed
  3018. lfs_global_orphans(lfs, -lfs->globals.orphans);
  3019. return 0;
  3020. }
  3021. static int lfs_fs_forceconsistency(lfs_t *lfs) {
  3022. int err = lfs_fs_demove(lfs);
  3023. if (err) {
  3024. return err;
  3025. }
  3026. err = lfs_fs_deorphan(lfs);
  3027. if (err) {
  3028. return err;
  3029. }
  3030. return 0;
  3031. }
  3032. static int lfs_fs_size_count(void *p, lfs_block_t block) {
  3033. (void)block;
  3034. lfs_size_t *size = p;
  3035. *size += 1;
  3036. return 0;
  3037. }
  3038. lfs_ssize_t lfs_fs_size(lfs_t *lfs) {
  3039. lfs_size_t size = 0;
  3040. int err = lfs_fs_traverse(lfs, lfs_fs_size_count, &size);
  3041. if (err) {
  3042. return err;
  3043. }
  3044. return size;
  3045. }