2002-08-07 00:39:45 +08:00
|
|
|
|
|
|
|
#include <ngx_config.h>
|
2003-06-03 23:42:58 +08:00
|
|
|
#include <ngx_core.h>
|
2002-08-07 00:39:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
void *ngx_alloc(size_t size, ngx_log_t *log)
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
p = malloc(size);
|
2002-12-25 01:30:59 +08:00
|
|
|
if (p == NULL) {
|
2002-08-26 23:18:19 +08:00
|
|
|
ngx_log_error(NGX_LOG_EMERG, log, ngx_errno,
|
|
|
|
"malloc() %d bytes failed", size);
|
2002-12-25 01:30:59 +08:00
|
|
|
}
|
2002-08-30 00:59:54 +08:00
|
|
|
|
2002-12-25 01:30:59 +08:00
|
|
|
#if (NGX_DEBUG_ALLOC)
|
2002-12-15 14:25:09 +08:00
|
|
|
ngx_log_debug(log, "malloc: %08x:%d" _ p _ size);
|
2002-12-25 01:30:59 +08:00
|
|
|
#endif
|
2002-08-30 00:59:54 +08:00
|
|
|
|
2002-08-07 00:39:45 +08:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
void *ngx_calloc(size_t size, ngx_log_t *log)
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
p = ngx_alloc(size, log);
|
2002-12-25 01:30:59 +08:00
|
|
|
if (p) {
|
2002-08-07 00:39:45 +08:00
|
|
|
ngx_memzero(p, size);
|
2002-12-25 01:30:59 +08:00
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
ngx_pool_t *ngx_create_pool(size_t size, ngx_log_t *log)
|
|
|
|
{
|
|
|
|
ngx_pool_t *p;
|
|
|
|
|
|
|
|
ngx_test_null(p, ngx_alloc(size, log), NULL);
|
|
|
|
|
|
|
|
p->last = (char *) p + sizeof(ngx_pool_t);
|
|
|
|
p->end = (char *) p + size;
|
|
|
|
p->next = NULL;
|
|
|
|
p->large = NULL;
|
|
|
|
p->log = log;
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ngx_destroy_pool(ngx_pool_t *pool)
|
|
|
|
{
|
|
|
|
ngx_pool_t *p, *n;
|
|
|
|
ngx_pool_large_t *l;
|
|
|
|
|
2002-09-11 23:18:33 +08:00
|
|
|
for (l = pool->large; l; l = l->next) {
|
2002-12-25 01:30:59 +08:00
|
|
|
#if (NGX_DEBUG_ALLOC)
|
2002-12-15 14:25:09 +08:00
|
|
|
ngx_log_debug(pool->log, "free: %08x" _ l->alloc);
|
2002-12-25 01:30:59 +08:00
|
|
|
#endif
|
2002-08-07 00:39:45 +08:00
|
|
|
free(l->alloc);
|
2002-09-11 23:18:33 +08:00
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
|
2003-08-08 23:13:24 +08:00
|
|
|
/*
|
|
|
|
* we could allocate pool->log from this pool
|
|
|
|
* so we can not use this log while free()ing the pool
|
|
|
|
*/
|
2003-08-06 22:43:50 +08:00
|
|
|
|
2002-12-25 01:30:59 +08:00
|
|
|
#if (NGX_DEBUG_ALLOC)
|
2003-08-08 23:13:24 +08:00
|
|
|
for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
2002-12-15 14:25:09 +08:00
|
|
|
ngx_log_debug(pool->log, "free: %08x" _ p);
|
2003-08-08 23:13:24 +08:00
|
|
|
}
|
2002-12-25 01:30:59 +08:00
|
|
|
#endif
|
2003-08-08 23:13:24 +08:00
|
|
|
|
|
|
|
for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
2002-08-07 00:39:45 +08:00
|
|
|
free(p);
|
2003-08-08 23:13:24 +08:00
|
|
|
|
|
|
|
if (n == NULL) {
|
|
|
|
break;
|
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
}
|
2003-08-06 22:43:50 +08:00
|
|
|
|
2003-05-14 00:02:32 +08:00
|
|
|
pool = NULL;
|
2002-08-07 00:39:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void *ngx_palloc(ngx_pool_t *pool, size_t size)
|
|
|
|
{
|
2003-06-12 13:54:39 +08:00
|
|
|
char *m;
|
2002-08-07 00:39:45 +08:00
|
|
|
ngx_pool_t *p, *n;
|
|
|
|
ngx_pool_large_t *large, *last;
|
|
|
|
|
|
|
|
if (size <= NGX_MAX_ALLOC_FROM_POOL) {
|
|
|
|
|
|
|
|
for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
2003-06-12 13:54:39 +08:00
|
|
|
m = ngx_align(p->last);
|
|
|
|
|
|
|
|
if ((size_t) (p->end - m) >= size) {
|
|
|
|
p->last = m + size ;
|
2002-08-07 00:39:45 +08:00
|
|
|
|
|
|
|
return m;
|
|
|
|
}
|
|
|
|
|
2002-12-25 01:30:59 +08:00
|
|
|
if (n == NULL) {
|
2002-08-07 00:39:45 +08:00
|
|
|
break;
|
2002-12-25 01:30:59 +08:00
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* alloc new pool block */
|
|
|
|
ngx_test_null(n, ngx_create_pool(p->end - (char *) p, p->log), NULL);
|
|
|
|
p->next = n;
|
|
|
|
m = n->last;
|
|
|
|
n->last += size;
|
|
|
|
return m;
|
|
|
|
|
|
|
|
/* alloc large block */
|
|
|
|
} else {
|
|
|
|
large = NULL;
|
|
|
|
last = NULL;
|
|
|
|
|
|
|
|
if (pool->large) {
|
|
|
|
for (last = pool->large; /* void */; last = last->next) {
|
|
|
|
if (last->alloc == NULL) {
|
|
|
|
large = last;
|
|
|
|
last = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2002-12-25 01:30:59 +08:00
|
|
|
if (last->next == NULL) {
|
2002-08-07 00:39:45 +08:00
|
|
|
break;
|
2002-12-25 01:30:59 +08:00
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (large == NULL) {
|
|
|
|
ngx_test_null(large, ngx_palloc(pool, sizeof(ngx_pool_large_t)),
|
|
|
|
NULL);
|
2002-09-11 23:18:33 +08:00
|
|
|
large->next = NULL;
|
2002-08-07 00:39:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
ngx_test_null(p, ngx_alloc(size, pool->log), NULL);
|
|
|
|
|
|
|
|
if (pool->large == NULL) {
|
|
|
|
pool->large = large;
|
|
|
|
|
|
|
|
} else if (last) {
|
|
|
|
last->next = large;
|
|
|
|
}
|
|
|
|
|
|
|
|
large->alloc = p;
|
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void *ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
p = ngx_palloc(pool, size);
|
2002-12-25 01:30:59 +08:00
|
|
|
if (p) {
|
2002-08-07 00:39:45 +08:00
|
|
|
ngx_memzero(p, size);
|
2002-12-25 01:30:59 +08:00
|
|
|
}
|
2002-08-07 00:39:45 +08:00
|
|
|
|
|
|
|
return p;
|
|
|
|
}
|