lfs.c 114 KB

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