lv_lru.h

Typedefs

typedef void (*lv_lru_free_cb_t)(void *v)

typedef struct _lv_lru_item_t lv_lru_item_t

Enums

enum lv_lru_res_t

Values:

enumerator LV_LRU_OK

enumerator LV_LRU_MISSING_CACHE

enumerator LV_LRU_MISSING_KEY

enumerator LV_LRU_MISSING_VALUE

enumerator LV_LRU_LOCK_ERROR

enumerator LV_LRU_VALUE_TOO_LARGE

Functions

lv_lru_t *lv_lru_create(size_t cache_size, size_t average_length, lv_lru_free_cb_t value_free, lv_lru_free_cb_t key_free)

void lv_lru_delete(lv_lru_t *cache)

lv_lru_res_t lv_lru_set(lv_lru_t *cache, const void *key, size_t key_length, void *value, size_t value_length)

lv_lru_res_t lv_lru_get(lv_lru_t *cache, const void *key, size_t key_size, void **value)

lv_lru_res_t lv_lru_remove(lv_lru_t *cache, const void *key, size_t key_size)

void lv_lru_remove_lru_item(lv_lru_t *cache)

remove the least recently used item

Todo:: we can optimise this by finding the n lru items, where n = required_space / average_length

struct lv_lru_t

Public Members

lv_lru_item_t **items

uint64_t access_count

size_t free_memory

size_t total_memory

size_t average_item_length

size_t hash_table_size

uint32_t seed

lv_lru_free_cb_t value_free

lv_lru_free_cb_t key_free

lv_lru_item_t *free_items