lfs.c 105 KB

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