lfs.c 104 KB

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