lfs.c 100 KB

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