docs/html/lru_8h_source.html

//

// Created by claunia on 2/10/22.

//


#ifndef LIBAARUFORMAT_LRU_H

#define LIBAARUFORMAT_LRU_H


#include <stdint.h>

#include <uthash.h>


struct CacheEntry

{

    uint64_t       key;

    void          *value;

    UT_hash_handle hh;

};


struct CacheHeader

{

    uint64_t max_items;

    struct CacheEntry *cache;

    void (*free_func)(void *);

};


void *find_in_cache_uint64(struct CacheHeader *cache, uint64_t key);

void  add_to_cache_uint64(struct CacheHeader *cache, uint64_t key, void *value);

void  free_cache(struct CacheHeader *cache);


#endif  // LIBAARUFORMAT_LRU_H

add_to_cache_uint64
void add_to_cache_uint64(struct CacheHeader *cache, uint64_t key, void *value)
Adds a value to the cache with a uint64_t key, evicting LRU if full.
Definition lru.c:48

find_in_cache_uint64
void * find_in_cache_uint64(struct CacheHeader *cache, uint64_t key)
Finds a value in the cache by uint64_t key.
Definition lru.c:24

free_cache
void free_cache(struct CacheHeader *cache)
Frees all entries in the cache and clears it.
Definition lru.c:82

CacheEntry
Single hash entry in the in-memory cache.
Definition lru.h:24

CacheEntry::value
void * value
Opaque value pointer associated with key.
Definition lru.h:26

CacheEntry::key
uint64_t key
64-bit integer key (unique within the cache).
Definition lru.h:25

CacheEntry::hh
UT_hash_handle hh
uthash handle (must remain per uthash docs).
Definition lru.h:27

CacheHeader
Cache top-level descriptor encapsulating the hash table root and capacity limit.
Definition lru.h:42

CacheHeader::cache
struct CacheEntry * cache
Hash root (uthash). NULL when empty.
Definition lru.h:44

CacheHeader::max_items
uint64_t max_items
Hard limit for number of entries.
Definition lru.h:43

CacheHeader::free_func
void(* free_func)(void *)
Optional callback to free cached values. NULL if not needed.
Definition lru.h:45