lfs.c 104 KB

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