Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.
 
 
 

315 rindas
9.4 KiB

  1. /*
  2. * spiffs_cache.c
  3. *
  4. * Created on: Jun 23, 2013
  5. * Author: petera
  6. */
  7. #include "spiffs.h"
  8. #include "spiffs_nucleus.h"
  9. #if SPIFFS_CACHE
  10. // returns cached page for give page index, or null if no such cached page
  11. static spiffs_cache_page *spiffs_cache_page_get(spiffs *fs, spiffs_page_ix pix) {
  12. spiffs_cache *cache = spiffs_get_cache(fs);
  13. if ((cache->cpage_use_map & cache->cpage_use_mask) == 0) return 0;
  14. int i;
  15. for (i = 0; i < cache->cpage_count; i++) {
  16. spiffs_cache_page *cp = spiffs_get_cache_page_hdr(fs, cache, i);
  17. if ((cache->cpage_use_map & (1<<i)) &&
  18. (cp->flags & SPIFFS_CACHE_FLAG_TYPE_WR) == 0 &&
  19. cp->pix == pix ) {
  20. SPIFFS_CACHE_DBG("CACHE_GET: have cache page "_SPIPRIi" for "_SPIPRIpg"\n", i, pix);
  21. cp->last_access = cache->last_access;
  22. return cp;
  23. }
  24. }
  25. //SPIFFS_CACHE_DBG("CACHE_GET: no cache for "_SPIPRIpg"\n", pix);
  26. return 0;
  27. }
  28. // frees cached page
  29. static s32_t spiffs_cache_page_free(spiffs *fs, int ix, u8_t write_back) {
  30. s32_t res = SPIFFS_OK;
  31. spiffs_cache *cache = spiffs_get_cache(fs);
  32. spiffs_cache_page *cp = spiffs_get_cache_page_hdr(fs, cache, ix);
  33. if (cache->cpage_use_map & (1<<ix)) {
  34. if (write_back &&
  35. (cp->flags & SPIFFS_CACHE_FLAG_TYPE_WR) == 0 &&
  36. (cp->flags & SPIFFS_CACHE_FLAG_DIRTY)) {
  37. u8_t *mem = spiffs_get_cache_page(fs, cache, ix);
  38. res = SPIFFS_HAL_WRITE(fs, SPIFFS_PAGE_TO_PADDR(fs, cp->pix), SPIFFS_CFG_LOG_PAGE_SZ(fs), mem);
  39. }
  40. cp->flags = 0;
  41. cache->cpage_use_map &= ~(1 << ix);
  42. if (cp->flags & SPIFFS_CACHE_FLAG_TYPE_WR) {
  43. SPIFFS_CACHE_DBG("CACHE_FREE: free cache page "_SPIPRIi" objid "_SPIPRIid"\n", ix, cp->obj_id);
  44. } else {
  45. SPIFFS_CACHE_DBG("CACHE_FREE: free cache page "_SPIPRIi" pix "_SPIPRIpg"\n", ix, cp->pix);
  46. }
  47. }
  48. return res;
  49. }
  50. // removes the oldest accessed cached page
  51. static s32_t spiffs_cache_page_remove_oldest(spiffs *fs, u8_t flag_mask, u8_t flags) {
  52. s32_t res = SPIFFS_OK;
  53. spiffs_cache *cache = spiffs_get_cache(fs);
  54. if ((cache->cpage_use_map & cache->cpage_use_mask) != cache->cpage_use_mask) {
  55. // at least one free cpage
  56. return SPIFFS_OK;
  57. }
  58. // all busy, scan thru all to find the cpage which has oldest access
  59. int i;
  60. int cand_ix = -1;
  61. u32_t oldest_val = 0;
  62. for (i = 0; i < cache->cpage_count; i++) {
  63. spiffs_cache_page *cp = spiffs_get_cache_page_hdr(fs, cache, i);
  64. if ((cache->last_access - cp->last_access) > oldest_val &&
  65. (cp->flags & flag_mask) == flags) {
  66. oldest_val = cache->last_access - cp->last_access;
  67. cand_ix = i;
  68. }
  69. }
  70. if (cand_ix >= 0) {
  71. res = spiffs_cache_page_free(fs, cand_ix, 1);
  72. }
  73. return res;
  74. }
  75. // allocates a new cached page and returns it, or null if all cache pages are busy
  76. static spiffs_cache_page *spiffs_cache_page_allocate(spiffs *fs) {
  77. spiffs_cache *cache = spiffs_get_cache(fs);
  78. if (cache->cpage_use_map == 0xffffffff) {
  79. // out of cache memory
  80. return 0;
  81. }
  82. int i;
  83. for (i = 0; i < cache->cpage_count; i++) {
  84. if ((cache->cpage_use_map & (1<<i)) == 0) {
  85. spiffs_cache_page *cp = spiffs_get_cache_page_hdr(fs, cache, i);
  86. cache->cpage_use_map |= (1<<i);
  87. cp->last_access = cache->last_access;
  88. SPIFFS_CACHE_DBG("CACHE_ALLO: allocated cache page "_SPIPRIi"\n", i);
  89. return cp;
  90. }
  91. }
  92. // out of cache entries
  93. return 0;
  94. }
  95. // drops the cache page for give page index
  96. void spiffs_cache_drop_page(spiffs *fs, spiffs_page_ix pix) {
  97. spiffs_cache_page *cp = spiffs_cache_page_get(fs, pix);
  98. if (cp) {
  99. spiffs_cache_page_free(fs, cp->ix, 0);
  100. }
  101. }
  102. // ------------------------------
  103. // reads from spi flash or the cache
  104. s32_t spiffs_phys_rd(
  105. spiffs *fs,
  106. u8_t op,
  107. spiffs_file fh,
  108. u32_t addr,
  109. u32_t len,
  110. u8_t *dst) {
  111. (void)fh;
  112. s32_t res = SPIFFS_OK;
  113. spiffs_cache *cache = spiffs_get_cache(fs);
  114. spiffs_cache_page *cp = spiffs_cache_page_get(fs, SPIFFS_PADDR_TO_PAGE(fs, addr));
  115. cache->last_access++;
  116. if (cp) {
  117. // we've already got one, you see
  118. #if SPIFFS_CACHE_STATS
  119. fs->cache_hits++;
  120. #endif
  121. cp->last_access = cache->last_access;
  122. u8_t *mem = spiffs_get_cache_page(fs, cache, cp->ix);
  123. memcpy(dst, &mem[SPIFFS_PADDR_TO_PAGE_OFFSET(fs, addr)], len);
  124. } else {
  125. if ((op & SPIFFS_OP_TYPE_MASK) == SPIFFS_OP_T_OBJ_LU2) {
  126. // for second layer lookup functions, we do not cache in order to prevent shredding
  127. return SPIFFS_HAL_READ(fs, addr, len, dst);
  128. }
  129. #if SPIFFS_CACHE_STATS
  130. fs->cache_misses++;
  131. #endif
  132. // this operation will always free one cache page (unless all already free),
  133. // the result code stems from the write operation of the possibly freed cache page
  134. res = spiffs_cache_page_remove_oldest(fs, SPIFFS_CACHE_FLAG_TYPE_WR, 0);
  135. cp = spiffs_cache_page_allocate(fs);
  136. if (cp) {
  137. cp->flags = SPIFFS_CACHE_FLAG_WRTHRU;
  138. cp->pix = SPIFFS_PADDR_TO_PAGE(fs, addr);
  139. s32_t res2 = SPIFFS_HAL_READ(fs,
  140. addr - SPIFFS_PADDR_TO_PAGE_OFFSET(fs, addr),
  141. SPIFFS_CFG_LOG_PAGE_SZ(fs),
  142. spiffs_get_cache_page(fs, cache, cp->ix));
  143. if (res2 != SPIFFS_OK) {
  144. // honor read failure before possible write failure (bad idea?)
  145. res = res2;
  146. }
  147. u8_t *mem = spiffs_get_cache_page(fs, cache, cp->ix);
  148. memcpy(dst, &mem[SPIFFS_PADDR_TO_PAGE_OFFSET(fs, addr)], len);
  149. } else {
  150. // this will never happen, last resort for sake of symmetry
  151. s32_t res2 = SPIFFS_HAL_READ(fs, addr, len, dst);
  152. if (res2 != SPIFFS_OK) {
  153. // honor read failure before possible write failure (bad idea?)
  154. res = res2;
  155. }
  156. }
  157. }
  158. return res;
  159. }
  160. // writes to spi flash and/or the cache
  161. s32_t spiffs_phys_wr(
  162. spiffs *fs,
  163. u8_t op,
  164. spiffs_file fh,
  165. u32_t addr,
  166. u32_t len,
  167. u8_t *src) {
  168. (void)fh;
  169. spiffs_page_ix pix = SPIFFS_PADDR_TO_PAGE(fs, addr);
  170. spiffs_cache *cache = spiffs_get_cache(fs);
  171. spiffs_cache_page *cp = spiffs_cache_page_get(fs, pix);
  172. if (cp && (op & SPIFFS_OP_COM_MASK) != SPIFFS_OP_C_WRTHRU) {
  173. // have a cache page
  174. // copy in data to cache page
  175. if ((op & SPIFFS_OP_COM_MASK) == SPIFFS_OP_C_DELE &&
  176. (op & SPIFFS_OP_TYPE_MASK) != SPIFFS_OP_T_OBJ_LU) {
  177. // page is being deleted, wipe from cache - unless it is a lookup page
  178. spiffs_cache_page_free(fs, cp->ix, 0);
  179. return SPIFFS_HAL_WRITE(fs, addr, len, src);
  180. }
  181. u8_t *mem = spiffs_get_cache_page(fs, cache, cp->ix);
  182. memcpy(&mem[SPIFFS_PADDR_TO_PAGE_OFFSET(fs, addr)], src, len);
  183. cache->last_access++;
  184. cp->last_access = cache->last_access;
  185. if (cp->flags & SPIFFS_CACHE_FLAG_WRTHRU) {
  186. // page is being updated, no write-cache, just pass thru
  187. return SPIFFS_HAL_WRITE(fs, addr, len, src);
  188. } else {
  189. return SPIFFS_OK;
  190. }
  191. } else {
  192. // no cache page, no write cache - just write thru
  193. return SPIFFS_HAL_WRITE(fs, addr, len, src);
  194. }
  195. }
  196. #if SPIFFS_CACHE_WR
  197. // returns the cache page that this fd refers, or null if no cache page
  198. spiffs_cache_page *spiffs_cache_page_get_by_fd(spiffs *fs, spiffs_fd *fd) {
  199. spiffs_cache *cache = spiffs_get_cache(fs);
  200. if ((cache->cpage_use_map & cache->cpage_use_mask) == 0) {
  201. // all cpages free, no cpage cannot be assigned to obj_id
  202. return 0;
  203. }
  204. int i;
  205. for (i = 0; i < cache->cpage_count; i++) {
  206. spiffs_cache_page *cp = spiffs_get_cache_page_hdr(fs, cache, i);
  207. if ((cache->cpage_use_map & (1<<i)) &&
  208. (cp->flags & SPIFFS_CACHE_FLAG_TYPE_WR) &&
  209. cp->obj_id == fd->obj_id) {
  210. return cp;
  211. }
  212. }
  213. return 0;
  214. }
  215. // allocates a new cache page and refers this to given fd - flushes an old cache
  216. // page if all cache is busy
  217. spiffs_cache_page *spiffs_cache_page_allocate_by_fd(spiffs *fs, spiffs_fd *fd) {
  218. // before this function is called, it is ensured that there is no already existing
  219. // cache page with same object id
  220. spiffs_cache_page_remove_oldest(fs, SPIFFS_CACHE_FLAG_TYPE_WR, 0);
  221. spiffs_cache_page *cp = spiffs_cache_page_allocate(fs);
  222. if (cp == 0) {
  223. // could not get cache page
  224. return 0;
  225. }
  226. cp->flags = SPIFFS_CACHE_FLAG_TYPE_WR;
  227. cp->obj_id = fd->obj_id;
  228. fd->cache_page = cp;
  229. return cp;
  230. }
  231. // unrefers all fds that this cache page refers to and releases the cache page
  232. void spiffs_cache_fd_release(spiffs *fs, spiffs_cache_page *cp) {
  233. if (cp == 0) return;
  234. u32_t i;
  235. spiffs_fd *fds = (spiffs_fd *)fs->fd_space;
  236. for (i = 0; i < fs->fd_count; i++) {
  237. spiffs_fd *cur_fd = &fds[i];
  238. if (cur_fd->file_nbr != 0 && cur_fd->cache_page == cp) {
  239. cur_fd->cache_page = 0;
  240. }
  241. }
  242. spiffs_cache_page_free(fs, cp->ix, 0);
  243. cp->obj_id = 0;
  244. }
  245. #endif
  246. // initializes the cache
  247. void spiffs_cache_init(spiffs *fs) {
  248. if (fs->cache == 0) return;
  249. u32_t sz = fs->cache_size;
  250. u32_t cache_mask = 0;
  251. int i;
  252. int cache_entries =
  253. (sz - sizeof(spiffs_cache)) / (SPIFFS_CACHE_PAGE_SIZE(fs));
  254. if (cache_entries <= 0) return;
  255. for (i = 0; i < cache_entries; i++) {
  256. cache_mask <<= 1;
  257. cache_mask |= 1;
  258. }
  259. spiffs_cache cache;
  260. memset(&cache, 0, sizeof(spiffs_cache));
  261. cache.cpage_count = cache_entries;
  262. cache.cpages = (u8_t *)((u8_t *)fs->cache + sizeof(spiffs_cache));
  263. cache.cpage_use_map = 0xffffffff;
  264. cache.cpage_use_mask = cache_mask;
  265. memcpy(fs->cache, &cache, sizeof(spiffs_cache));
  266. spiffs_cache *c = spiffs_get_cache(fs);
  267. memset(c->cpages, 0, c->cpage_count * SPIFFS_CACHE_PAGE_SIZE(fs));
  268. c->cpage_use_map &= ~(c->cpage_use_mask);
  269. for (i = 0; i < cache.cpage_count; i++) {
  270. spiffs_get_cache_page_hdr(fs, c, i)->ix = i;
  271. }
  272. }
  273. #endif // SPIFFS_CACHE