version 1.1.2.2, 2012/02/27 21:00:43
|
version 1.1.2.3, 2012/02/27 23:57:12
|
Line 55 mpool_t *
|
Line 55 mpool_t *
|
mpool_init(void) |
mpool_init(void) |
{ |
{ |
mpool_t *mp; |
mpool_t *mp; |
|
register int i; |
|
|
mp = malloc(sizeof(mpool_t)); |
mp = malloc(sizeof(mpool_t)); |
if (!mp) { |
if (!mp) { |
Line 64 mpool_init(void)
|
Line 65 mpool_init(void)
|
memset(mp, 0, sizeof(mpool_t)); |
memset(mp, 0, sizeof(mpool_t)); |
|
|
pthread_mutex_init(&mp->pool_mtx, NULL); |
pthread_mutex_init(&mp->pool_mtx, NULL); |
|
|
|
mpool_lock(mp); |
|
for (i = 0; i < MEM_BUCKETS; i++) { |
|
TAILQ_INIT(&mp->pool_active[i]); |
|
TAILQ_INIT(&mp->pool_inactive[i]); |
|
} |
|
mpool_unlock(mp); |
|
|
return mp; |
return mp; |
} |
} |
|
|
Line 131 pullInactive(mpool_t * __restrict mp, int idx)
|
Line 140 pullInactive(mpool_t * __restrict mp, int idx)
|
/* must be locked pool before use this function */ |
/* must be locked pool before use this function */ |
if ((m = TAILQ_FIRST(&mp->pool_inactive[idx]))) { |
if ((m = TAILQ_FIRST(&mp->pool_inactive[idx]))) { |
TAILQ_REMOVE(&mp->pool_inactive[idx], m, alloc_node); |
TAILQ_REMOVE(&mp->pool_inactive[idx], m, alloc_node); |
|
/* statistics */ |
|
mp->pool_calls.cache--; |
|
mp->pool_bytes.cache -= mem_size(m); |
|
|
/* clear name */ |
/* clear name */ |
*m->alloc_name = 0; |
*m->alloc_name = 0; |
Line 216 mpool_malloc(mpool_t * __restrict mp, u_int size, cons
|
Line 228 mpool_malloc(mpool_t * __restrict mp, u_int size, cons
|
} |
} |
|
|
/* |
/* |
|
* mpool_purge() - Purge memory block cache and release resources |
|
* |
|
* @mp = Memory pool |
|
* @atmost = Free at most in buckets |
|
* return: -1 error or 0 ok |
|
*/ |
|
int |
|
mpool_purge(mpool_t * __restrict mp, int atmost) |
|
{ |
|
register int i, cx = 0; |
|
struct tagAlloc *m, *tmp; |
|
|
|
if (!mp) { |
|
sess_SetErr(EINVAL, "Pool not specified"); |
|
return -1; |
|
} |
|
|
|
mpool_lock(mp); |
|
|
|
for (i = 0; i < MEM_BUCKETS; i++) { |
|
TAILQ_FOREACH_SAFE(m, &mp->pool_inactive[i], alloc_node, tmp) { |
|
/* count barrier for purge */ |
|
if (cx++ < atmost) |
|
continue; |
|
|
|
TAILQ_REMOVE(&mp->pool_inactive[i], m, alloc_node); |
|
/* statistics */ |
|
mp->pool_calls.cache--; |
|
mp->pool_bytes.cache -= mem_size(m); |
|
|
|
mp->pool_calls.free++; |
|
mp->pool_bytes.free += mem_size(m); |
|
/* quota */ |
|
mp->pool_quota.curr -= mem_size(m); |
|
|
|
if (m->alloc_mem) |
|
free(m->alloc_mem); |
|
free(m); |
|
} |
|
} |
|
|
|
mpool_unlock(mp); |
|
return 0; |
|
} |
|
|
|
/* |
* mpool_free() Free allocated memory with mpool_alloc() |
* mpool_free() Free allocated memory with mpool_alloc() |
* |
* |
* @mp = Memory pool |
* @mp = Memory pool |
Line 244 mpool_free(mpool_t * __restrict mp, void * __restrict
|
Line 302 mpool_free(mpool_t * __restrict mp, void * __restrict
|
TAILQ_FOREACH(m, &mp->pool_active[idx], alloc_node) |
TAILQ_FOREACH(m, &mp->pool_active[idx], alloc_node) |
if (mem_data(m, void*) == data) { |
if (mem_data(m, void*) == data) { |
TAILQ_REMOVE(&mp->pool_active[idx], m, alloc_node); |
TAILQ_REMOVE(&mp->pool_active[idx], m, alloc_node); |
|
/* statistics */ |
|
mp->pool_calls.alloc--; |
|
mp->pool_bytes.alloc -= mem_size(m); |
|
|
if (!purge) { |
if (!purge) { |
TAILQ_INSERT_HEAD(&mp->pool_inactive[idx], m, alloc_node); |
TAILQ_INSERT_HEAD(&mp->pool_inactive[idx], m, alloc_node); |
Line 251 mpool_free(mpool_t * __restrict mp, void * __restrict
|
Line 312 mpool_free(mpool_t * __restrict mp, void * __restrict
|
mp->pool_calls.cache++; |
mp->pool_calls.cache++; |
mp->pool_bytes.cache += mem_size(m); |
mp->pool_bytes.cache += mem_size(m); |
} else { |
} else { |
if (m->alloc_mem) |
|
free(m->alloc_mem); |
|
free(m); |
|
/* statistics */ |
/* statistics */ |
mp->pool_calls.free++; |
mp->pool_calls.free++; |
mp->pool_bytes.free += mem_size(m); |
mp->pool_bytes.free += mem_size(m); |
|
/* quota */ |
|
mp->pool_quota.curr -= mem_size(m); |
|
|
|
if (m->alloc_mem) |
|
free(m->alloc_mem); |
|
free(m); |
} |
} |
break; |
break; |
} |
} |
Line 290 mpool_free2(mpool_t * __restrict mp, u_int size, const
|
Line 354 mpool_free2(mpool_t * __restrict mp, u_int size, const
|
TAILQ_FOREACH(m, &mp->pool_active[idx], alloc_node) |
TAILQ_FOREACH(m, &mp->pool_active[idx], alloc_node) |
if (!strcmp(m->alloc_name, memname)) { |
if (!strcmp(m->alloc_name, memname)) { |
TAILQ_REMOVE(&mp->pool_active[idx], m, alloc_node); |
TAILQ_REMOVE(&mp->pool_active[idx], m, alloc_node); |
|
/* statistics */ |
|
mp->pool_calls.alloc--; |
|
mp->pool_bytes.alloc -= mem_size(m); |
|
|
if (!purge) { |
if (!purge) { |
TAILQ_INSERT_HEAD(&mp->pool_inactive[idx], m, alloc_node); |
TAILQ_INSERT_HEAD(&mp->pool_inactive[idx], m, alloc_node); |
Line 297 mpool_free2(mpool_t * __restrict mp, u_int size, const
|
Line 364 mpool_free2(mpool_t * __restrict mp, u_int size, const
|
mp->pool_calls.cache++; |
mp->pool_calls.cache++; |
mp->pool_bytes.cache += mem_size(m); |
mp->pool_bytes.cache += mem_size(m); |
} else { |
} else { |
if (m->alloc_mem) |
|
free(m->alloc_mem); |
|
free(m); |
|
/* statistics */ |
/* statistics */ |
mp->pool_calls.free++; |
mp->pool_calls.free++; |
mp->pool_bytes.free += mem_size(m); |
mp->pool_bytes.free += mem_size(m); |
|
/* quota */ |
|
mp->pool_quota.curr -= mem_size(m); |
|
|
|
if (m->alloc_mem) |
|
free(m->alloc_mem); |
|
free(m); |
} |
} |
break; |
break; |
} |
} |
Line 334 mpool_getmembynam(mpool_t * __restrict mp, u_int size,
|
Line 404 mpool_getmembynam(mpool_t * __restrict mp, u_int size,
|
break; |
break; |
|
|
return mem_data(m, void*); |
return mem_data(m, void*); |
|
} |
|
|
|
/* |
|
* mpool_getsizebyaddr() - Get size of allocated memory block by address |
|
* |
|
* @addr = allocated memory from mpool_malloc() |
|
* return: usable size of allocated memory block |
|
*/ |
|
inline u_int |
|
mpool_getsizebyaddr(void * __restrict data) |
|
{ |
|
if (mpool_chkaddr(data)) |
|
return 0; |
|
|
|
return (((u_int*) data)[-2] * sizeof(u_int)); |
|
} |
|
|
|
/* |
|
* mpool_chkaddr() - Check validity of given address |
|
* |
|
* @data = allocated memory from mpool_malloc() |
|
* return: -1 bad address, 1 corrupted address or 0 ok |
|
*/ |
|
inline int |
|
mpool_chkaddr(void * __restrict data) |
|
{ |
|
/* check address range */ |
|
if (MEM_BADADDR(data)) |
|
return -1; |
|
/* check sentinel */ |
|
if (MEM_CORRUPT(data)) |
|
return 1; |
|
/* data address is ok! */ |
|
return 0; |
} |
} |