lfs.c 105 KB

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