blob: 719aef220bf5b62f4c5d05d45b174c5b93477fa8 (
plain)
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/**
* @file mem_pool.h
* \brief Memory pools library.
*
* Memory pools library. Library is designed to implement efficient way to
* store data in memory avoiding calling of many malloc/free. It has overhead
* because of fact that objects live in pool for rather long time and are not freed
* immediately after use, but if we know certainly when these objects can be used, we
* can use pool for them
*/
#ifndef RSPAMD_MEM_POOL_H
#define RSPAMD_MEM_POOL_H
#include <sys/types.h>
#include <glib.h>
/**
* Destructor type definition
*/
typedef void (*pool_destruct_func)(void *ptr);
/**
* Pool page structure
*/
struct _pool_chain {
u_char *begin; /**< begin of pool chain block */
u_char *pos; /**< current start of free space in block */
size_t len; /**< length of block */
struct _pool_chain *next; /**< chain link */
};
/**
* Shared pool page
*/
struct _pool_chain_shared {
u_char *begin;
u_char *pos;
size_t len;
gint lock;
struct _pool_chain_shared *next;
};
/**
* Destructors list item structure
*/
struct _pool_destructors {
pool_destruct_func func; /**< pointer to destructor */
void *data; /**< data to free */
struct _pool_destructors *prev; /**< chain link */
};
/**
* Memory pool type
*/
typedef struct memory_pool_s {
struct _pool_chain *cur_pool; /**< currently used page */
struct _pool_chain *first_pool; /**< first page */
struct _pool_chain_shared *shared_pool; /**< shared chain */
struct _pool_destructors *destructors; /**< destructors chain */
} memory_pool_t;
/**
* Statistics structure
*/
typedef struct memory_pool_stat_s {
size_t bytes_allocated; /**< bytes that are allocated with pool allocator */
size_t chunks_allocated; /**< number of chunks that are allocated */
size_t shared_chunks_allocated; /**< shared chunks allocated */
size_t chunks_freed; /**< chunks freed */
} memory_pool_stat_t;
/**
* Rwlock for locking shared memory regions
*/
typedef struct memory_pool_rwlock_s {
gint *__r_lock; /**< read mutex (private) */
gint *__w_lock; /**< write mutex (private) */
} memory_pool_rwlock_t;
/**
* Allocate new memory poll
* @param size size of pool's page
* @return new memory pool object
*/
memory_pool_t* memory_pool_new (size_t size);
/**
* Get memory from pool
* @param pool memory pool object
* @param size bytes to allocate
* @return pointer to allocated object
*/
void* memory_pool_alloc (memory_pool_t* pool, size_t size);
/**
* Get memory and set it to zero
* @param pool memory pool object
* @param size bytes to allocate
* @return pointer to allocated object
*/
void* memory_pool_alloc0 (memory_pool_t* pool, size_t size);
/**
* Make a copy of string in pool
* @param pool memory pool object
* @param src source string
* @return pointer to newly created string that is copy of src
*/
char* memory_pool_strdup (memory_pool_t* pool, const char *src);
/**
* Allocate piece of shared memory
* @param pool memory pool object
* @param size bytes to allocate
*/
void* memory_pool_alloc_shared (memory_pool_t *pool, size_t size);
/**
* Lock chunk of shared memory in which pointer is placed
* @param pool memory pool object
* @param pointer pointer of shared memory object that is to be locked (the whole page that contains that object is locked)
*/
void memory_pool_lock_shared (memory_pool_t *pool, void *pointer);
/**
* Unlock chunk of shared memory in which pointer is placed
* @param pool memory pool object
* @param pointer pointer of shared memory object that is to be unlocked (the whole page that contains that object is locked)
*/
void memory_pool_unlock_shared (memory_pool_t *pool, void *pointer);
/**
* Add destructor callback to pool
* @param pool memory pool object
* @param func pointer to function-destructor
* @param data pointer to data that would be passed to destructor
*/
void memory_pool_add_destructor (memory_pool_t *pool, pool_destruct_func func, void *data);
/**
* Delete pool, free all its chunks and call destructors chain
* @param pool memory pool object
*/
void memory_pool_delete (memory_pool_t *pool);
/**
* Get new mutex from pool (allocated in shared memory)
* @param pool memory pool object
* @return mutex object
*/
gint* memory_pool_get_mutex (memory_pool_t *pool);
/**
* Lock mutex
* @param mutex mutex to lock
*/
void memory_pool_lock_mutex (gint *mutex);
/**
* Unlock mutex
* @param mutex mutex to unlock
*/
void memory_pool_unlock_mutex (gint *mutex);
/**
* Create new rwlock and place it in shared memory
* @param pool memory pool object
* @return rwlock object
*/
memory_pool_rwlock_t* memory_pool_get_rwlock (memory_pool_t *pool);
/**
* Aquire read lock
* @param lock rwlock object
*/
void memory_pool_rlock_rwlock (memory_pool_rwlock_t *lock);
/**
* Aquire write lock
* @param lock rwlock object
*/
void memory_pool_wlock_rwlock (memory_pool_rwlock_t *lock);
/**
* Release read lock
* @param lock rwlock object
*/
void memory_pool_runlock_rwlock (memory_pool_rwlock_t *lock);
/**
* Release write lock
* @param lock rwlock object
*/
void memory_pool_wunlock_rwlock (memory_pool_rwlock_t *lock);
/**
* Get pool allocator statistics
* @param st stat pool struct
*/
void memory_pool_stat (memory_pool_stat_t *st);
/**
* Get optimal pool size based on page size for this system
* @return size of memory page in system
*/
size_t memory_pool_get_size ();
/**
* Macro that return free space in pool page
* @param x pool page struct
*/
#define memory_pool_free(x) ((x)->len - ((x)->pos - (x)->begin))
#endif
|