lfs.c 115 KB

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