lfs.c 100 KB

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