lfs.c 97 KB

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