lfs.c 97 KB

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