lfs.c 95 KB

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