lfs.c 94 KB

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