lfs.c 100 KB

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