lfs.c 104 KB

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