lfs.c 95 KB

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