lfs.c 96 KB

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