lfs.c 96 KB

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