lfs.c 104 KB

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