lfs.c 102 KB

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