lfs.c 102 KB

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