lfs.c 108 KB

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