lfs.c 99 KB

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