diff options
author | Igor Sysoev <igor@sysoev.ru> | 2008-06-17 15:00:30 +0000 |
---|---|---|
committer | Igor Sysoev <igor@sysoev.ru> | 2008-06-17 15:00:30 +0000 |
commit | 7f6b2ffc60135a8340213fe8d5d0b70e479e3ac1 (patch) | |
tree | 90325238fc9a9d9a7e8818e76b60cc9e011242aa /src/core/ngx_array.c | |
parent | c2eb2cf4cba5f47fbc33eebe279f0d3855401421 (diff) | |
download | nginx-7f6b2ffc60135a8340213fe8d5d0b70e479e3ac1.tar.gz nginx-7f6b2ffc60135a8340213fe8d5d0b70e479e3ac1.zip |
*) back out r2040
*) refactor ngx_palloc()
*) introduce ngx_pnalloc()
*) additional pool blocks have smaller header
Diffstat (limited to 'src/core/ngx_array.c')
-rw-r--r-- | src/core/ngx_array.c | 19 |
1 files changed, 10 insertions, 9 deletions
diff --git a/src/core/ngx_array.c b/src/core/ngx_array.c index 1b9f7cb78..a536d87b5 100644 --- a/src/core/ngx_array.c +++ b/src/core/ngx_array.c @@ -39,12 +39,12 @@ ngx_array_destroy(ngx_array_t *a) p = a->pool; - if ((u_char *) a->elts + a->size * a->nalloc == p->last) { - p->last -= a->size * a->nalloc; + if ((u_char *) a->elts + a->size * a->nalloc == p->d.last) { + p->d.last -= a->size * a->nalloc; } - if ((u_char *) a + sizeof(ngx_array_t) == p->last) { - p->last = (u_char *) a; + if ((u_char *) a + sizeof(ngx_array_t) == p->d.last) { + p->d.last = (u_char *) a; } } @@ -64,14 +64,15 @@ ngx_array_push(ngx_array_t *a) p = a->pool; - if ((u_char *) a->elts + size == p->last && p->last + a->size <= p->end) + if ((u_char *) a->elts + size == p->d.last + && p->d.last + a->size <= p->d.end) { /* * the array allocation is the last in the pool * and there is space for new allocation */ - p->last += a->size; + p->d.last += a->size; a->nalloc++; } else { @@ -111,15 +112,15 @@ ngx_array_push_n(ngx_array_t *a, ngx_uint_t n) p = a->pool; - if ((u_char *) a->elts + a->size * a->nalloc == p->last - && p->last + size <= p->end) + if ((u_char *) a->elts + a->size * a->nalloc == p->d.last + && p->d.last + size <= p->d.end) { /* * the array allocation is the last in the pool * and there is space for new allocation */ - p->last += size; + p->d.last += size; a->nalloc += n; } else { |