PINT_tcache Struct Reference
[Timeout Cache (tcache)]

Describes a tcache instance. More...

#include <tcache.h>

Data Fields
int(*	compare_key_entry )(void *key, struct qhash_head *link)
int(*	hash_key )(void *key, int table_size)
int(*	free_payload )(void *payload)
unsigned int	timeout_msecs
unsigned int	expiration_enabled
unsigned int	num_entries
unsigned int	hard_limit
unsigned int	soft_limit
unsigned int	reclaim_percentage
enum PINT_tcache_replace_algorithms	replacement_algorithm
unsigned int	enable
qhash_table *	h_table
qlist_head	lru_list

---

Detailed Description

Describes a tcache instance.

---

Field Documentation

int(* PINT_tcache::compare_key_entry)(void* key, struct qhash_head* link)

comparison function

unsigned int PINT_tcache::enable

is the cache enabled?

unsigned int PINT_tcache::expiration_enabled

do cache entries expire?

int(* PINT_tcache::free_payload)(void* payload)

function that can be used to free payload pointer

struct qhash_table* PINT_tcache::h_table

hash table

unsigned int PINT_tcache::hard_limit

hard limit on number of entries

int(* PINT_tcache::hash_key)(void* key, int table_size)

hash function

struct qlist_head PINT_tcache::lru_list

lru list

unsigned int PINT_tcache::num_entries

current number of entries in tcache

unsigned int PINT_tcache::reclaim_percentage

what percentage to reclaim at soft limit

enum PINT_tcache_replace_algorithms PINT_tcache::replacement_algorithm

what algorithm to use to find entry to replace

unsigned int PINT_tcache::soft_limit

soft limit on number of entries

unsigned int PINT_tcache::timeout_msecs

timeout to use with each entry

---

The documentation for this struct was generated from the following file:

• src/common/misc/tcache.h

---