lfs.c 105 KB

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