* @brief find the object to be evicted * this function does not actually evict the object or update metadata * not all eviction algorithms support t

parameter set up functions

parameter set up functions

end user facing functions * @brief initialize a QDLPv0 cache * * @param ccache_params some common cache parameters * @param cache_specific_params

end user facing functions init, free, get * @brief initialize a RandomLRU cache * * @param ccache_params some common cache parameters * @param ca

end user facing functions init, free, get * @brief initialize a RandomTwo cache * * @param ccache_params some common cache parameters * @param ca

* @brief find the object to be evicted * this function does not actually evict the object or update metadata * not all eviction algorithms support t

parameter set up functions

parameter set up functions

parameter set up functions

developer facing APIs (used by cache developer)

parameter set up functions

parameter set up functions

* @brief move an object from ith fifo into (i-1)th fifo, cool * (i-1)th fifo if it is full, where the n_seg th fifo is the most recent * * @param c

setup functions

* @brief evict an object from the cache * it needs to call cache_evict_base before returning * which updates some metadata such as n_obj, occupied s

* @brief initialize a SFIFO cache * * @param ccache_params some common cache parameters * @param cache_specific_params SFIFO specific parameters, e

* @brief promote the object from the current segment to the next (i+1) segment */

cache internal functions * @brief move an object from ith FIFO into (i-1)th FIFO, cool * (i-1)th FIFO if it is full * * @param cache * @param i

parameter set up functions

end user facing functions init, free, get * @brief initialize the cache * * @param ccache_params some common cache parameters * @param cache_spec

* @brief move an object from ith LRU into (i-1)th LRU, cool * (i-1)th LRU if it is full, where the n_seg th LRU is the most recent * * @param cache

parameter set up functions

* @brief evict an object from the cache * it needs to call cache_evict_base before returning * which updates some metadata such as n_obj, occupied s

* @brief promote the object from the current segment to the next (i+1) * segment */

* @brief find the object to be evicted * this function does not actually evict the object or update metadata * not all eviction algorithms support t

cache internal functions * @brief move an object from ith LRU into (i-1)th LRU, cool * (i-1)th LRU if it is full * * @param cache * @param i */

parameter set up functions

* @brief evict an object from the cache * it needs to call cache_evict_base before returning * which updates some metadata such as n_obj, occupied s

end user facing functions init, free, get * @brief initialize the cache * * @param ccache_params some common cache parameters * @param cache_spec

* @brief find an object in the cache * * @param cache * @param req * @param update_cache whether to update the cache, * if true, the object is p

* @brief insert an object into the cache, * update the hash table and cache metadata * this function assumes the cache has enough space * eviction

* @brief find the object to be evicted * this function does not actually evict the object or update metadata * not all eviction algorithms support t

* @brief initialize cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see parse

* @brief initialize a Size cache * * @param ccache_params some common cache parameters * @param cache_specific_params Size specific parameters, sho

parameter set up functions

parameter set up functions

* This is a stronger avalanche, * inspired by Pelle Evensen's rrmxmx * preferable when input has not been previously mixed */

* Frees an aligned pointer allocated by XXH_alignedMalloc(). Don't pass * normal malloc'd pointers, XXH_alignedMalloc has a specific data layout. */

* Malloc's a pointer that is always aligned to align. * * This must be freed with `XXH_alignedFree()`. * * malloc typically guarantees 16 byte ali

Returns the best XXH3 implementation */

* While the CPU may support AVX2, the operating system might not properly save * the full YMM/ZMM registers. * * xgetbv is used for detecting this:

this is the case IV in the paper */

finding the eviction candidate in _ARC_evict_miss_on_all_queues, but do not * perform eviction */

this is the case IV in the paper */

finding the eviction candidate in _ARCv0_evict_miss_on_all_queues, but do not * perform eviction */

this is the case IV in the paper */

finding the eviction candidate in _LP_ARC_evict_miss_on_all_queues, but do * not perform eviction */

add two associated block into prefetch table @param Mithril the cache struct @param gp1 pointer to the first block @param gp2 pointer to the secon

the mining function, it is called when mining table is ready @param Mithril the cache struct */

1. insert the `req->obj_id` to the past_request_pointer. 2. update the graph using `past_requests[past_request_pointer]` as the node and `node->past

get some objs which are associated with req->obj_id and their probability is higher than `prefetch_threshold`. @param cache the cache struct @para

grows the hashtable to the next power of 2. */