1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
/**
* @file hash.h
* Hash table implementation that allows using memory pools for storage as well as using
* shared memory for this purpose
*/
#ifndef RSPAMD_HASH_H
#define RSPAMD_HASH_H
#include "config.h"
struct rspamd_lru_hash_s;
typedef struct rspamd_lru_hash_s rspamd_lru_hash_t;
/**
* Create new lru hash
* @param maxsize maximum elements in a hash
* @param maxage maximum age of elemnt
* @param hash_func pointer to hash function
* @param key_equal_func pointer to function for comparing keys
* @return new rspamd_hash object
*/
rspamd_lru_hash_t * rspamd_lru_hash_new (
gint maxsize,
gint maxage,
GDestroyNotify key_destroy,
GDestroyNotify value_destroy);
/**
* Create new lru hash
* @param maxsize maximum elements in a hash
* @param maxage maximum age of elemnt
* @param hash_func pointer to hash function
* @param key_equal_func pointer to function for comparing keys
* @return new rspamd_hash object
*/
rspamd_lru_hash_t * rspamd_lru_hash_new_full (
gint maxsize,
gint maxage,
GDestroyNotify key_destroy,
GDestroyNotify value_destroy,
GHashFunc hfunc,
GEqualFunc eqfunc);
/**
* Lookup item from hash
* @param hash hash object
* @param key key to find
* @return value of key or NULL if key is not found
*/
gpointer rspamd_lru_hash_lookup (rspamd_lru_hash_t *hash,
gconstpointer key,
time_t now);
/**
* Insert item in hash
* @param hash hash object
* @param key key to insert
* @param value value of key
*/
void rspamd_lru_hash_insert (rspamd_lru_hash_t *hash,
gpointer key,
gpointer value,
time_t now,
guint ttl);
/**
* Remove lru hash
* @param hash hash object
*/
void rspamd_lru_hash_destroy (rspamd_lru_hash_t *hash);
#endif
/*
* vi:ts=4
*/
|
