lfs.c 95 KB

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