lfs.c 96 KB

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