lfs.c 98 KB

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