parameter set up functions * @brief print the default parameters * */

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

* parse the given parameters * input parameter is a string, * to see the default parameters, use current_params() * or use -e "print" with cachesim

* @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 Belady cache * * @param ccache_params some common cache parameters * @param cache_specific_params Belady specific parameters,

parameter set up functions

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

* @brief initialize a ClockPro cache * * @param ccache_params some common cache parameters * @param cache_specific_params Clock specific parameters as

parameter set up functions

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

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

parameter set up functions

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

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

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

* @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 the cache * * @param ccache_params some common cache parameters * @param cache_specific_params cache specific parameters, see p

====== Canonical representation ======*/

gcc needs inline assembly */ Adapted from * https://github.com/google/highwayhash/blob/master/highwayhash/hh_vsx.h. */

Mithril help function ********************/ check whether last request is part of a sequential access */

record req to the recording table or the mining table @param Mithril the cache struct @param req the request containing the request @return */

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

* @brief copy the entries from the old_table to the new_table * * @param new_table * @param old_table * @param old_size * @return * void */

load reuse heatmap plot data from C++ computation Args: datapath (str): the path of reuse heatmap data file Returns: Tuple[n

load size heatmap plot data from C++ computation Args: datapath (str): the path of size heatmap data file Returns: Tuple[np.

* move cache_obj from old_table into new_table, this is part of the expand * @param hashtable * @param cache_obj * @param part_of_old_table */

* @brief read the reverse trace and write to the output file * * @param ofilepath * @param stat * @param output_txt * @param lcs_ver */

* @brief Parsing params for adaptsize. * @param init_params Adaptsize spesific parameter * @param pa Adaptsize current data */

* @brief add a cache to this server * return the index of the cache in this server * * @param cache * @return size_t */

append a segment to the end of bucket */

@brief Assign node value to the current node. @param node_value A rvalue basic_node_type object to be assigned to the current node.

@brief Accesses the underlying iterator object. @return The underlying iterator object.

This is a tr1 method: the bucket a given key is in, or what bucket it would be put in, if it were to be inserted. Shrug. ----------------------------

These are tr1 methods. Their idea of 'bucket' doesn't map well to what we do. We just say every bucket has 0 or 1 items in it.

* @brief calculate the mean and std of 1. reuse time, 2. n_reuse of a * write-time-based object group and a random object group, repeat this n_repeat

* * @brief convert cache size string to byte, e.g., 100MB -> 100 * 1024 * 1024 * the cache size can be an integer or a string with suffix KB/MB/GB

Counts how many elements have key key. For maps, it's either 0 or 1. ---------------------------------------------------------------------