lfs.c 102 KB

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