lfs.c 97 KB

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