lfs.c 96 KB

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