Update and clean Tomato RAF files
[tomato.git] / release / src / router / nginx / src / core / ngx_palloc.c
blobefbc24452bd08cd81cfad38839caa8670b1796f7
2 /*
3 * Copyright (C) Igor Sysoev
4 * Copyright (C) Nginx, Inc.
5 */
8 #include <ngx_config.h>
9 #include <ngx_core.h>
12 static void *ngx_palloc_block(ngx_pool_t *pool, size_t size);
13 static void *ngx_palloc_large(ngx_pool_t *pool, size_t size);
16 ngx_pool_t *
17 ngx_create_pool(size_t size, ngx_log_t *log)
19 ngx_pool_t *p;
21 p = ngx_memalign(NGX_POOL_ALIGNMENT, size, log);
22 if (p == NULL) {
23 return NULL;
26 p->d.last = (u_char *) p + sizeof(ngx_pool_t);
27 p->d.end = (u_char *) p + size;
28 p->d.next = NULL;
29 p->d.failed = 0;
31 size = size - sizeof(ngx_pool_t);
32 p->max = (size < NGX_MAX_ALLOC_FROM_POOL) ? size : NGX_MAX_ALLOC_FROM_POOL;
34 p->current = p;
35 p->chain = NULL;
36 p->large = NULL;
37 p->cleanup = NULL;
38 p->log = log;
40 return p;
44 void
45 ngx_destroy_pool(ngx_pool_t *pool)
47 ngx_pool_t *p, *n;
48 ngx_pool_large_t *l;
49 ngx_pool_cleanup_t *c;
51 for (c = pool->cleanup; c; c = c->next) {
52 if (c->handler) {
53 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
54 "run cleanup: %p", c);
55 c->handler(c->data);
59 for (l = pool->large; l; l = l->next) {
61 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0, "free: %p", l->alloc);
63 if (l->alloc) {
64 ngx_free(l->alloc);
68 #if (NGX_DEBUG)
71 * we could allocate the pool->log from this pool
72 * so we cannot use this log while free()ing the pool
75 for (p = pool, n = pool->d.next; /* void */; p = n, n = n->d.next) {
76 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
77 "free: %p, unused: %uz", p, p->d.end - p->d.last);
79 if (n == NULL) {
80 break;
84 #endif
86 for (p = pool, n = pool->d.next; /* void */; p = n, n = n->d.next) {
87 ngx_free(p);
89 if (n == NULL) {
90 break;
96 void
97 ngx_reset_pool(ngx_pool_t *pool)
99 ngx_pool_t *p;
100 ngx_pool_large_t *l;
102 for (l = pool->large; l; l = l->next) {
103 if (l->alloc) {
104 ngx_free(l->alloc);
108 pool->large = NULL;
110 for (p = pool; p; p = p->d.next) {
111 p->d.last = (u_char *) p + sizeof(ngx_pool_t);
116 void *
117 ngx_palloc(ngx_pool_t *pool, size_t size)
119 u_char *m;
120 ngx_pool_t *p;
122 if (size <= pool->max) {
124 p = pool->current;
126 do {
127 m = ngx_align_ptr(p->d.last, NGX_ALIGNMENT);
129 if ((size_t) (p->d.end - m) >= size) {
130 p->d.last = m + size;
132 return m;
135 p = p->d.next;
137 } while (p);
139 return ngx_palloc_block(pool, size);
142 return ngx_palloc_large(pool, size);
146 void *
147 ngx_pnalloc(ngx_pool_t *pool, size_t size)
149 u_char *m;
150 ngx_pool_t *p;
152 if (size <= pool->max) {
154 p = pool->current;
156 do {
157 m = p->d.last;
159 if ((size_t) (p->d.end - m) >= size) {
160 p->d.last = m + size;
162 return m;
165 p = p->d.next;
167 } while (p);
169 return ngx_palloc_block(pool, size);
172 return ngx_palloc_large(pool, size);
176 static void *
177 ngx_palloc_block(ngx_pool_t *pool, size_t size)
179 u_char *m;
180 size_t psize;
181 ngx_pool_t *p, *new, *current;
183 psize = (size_t) (pool->d.end - (u_char *) pool);
185 m = ngx_memalign(NGX_POOL_ALIGNMENT, psize, pool->log);
186 if (m == NULL) {
187 return NULL;
190 new = (ngx_pool_t *) m;
192 new->d.end = m + psize;
193 new->d.next = NULL;
194 new->d.failed = 0;
196 m += sizeof(ngx_pool_data_t);
197 m = ngx_align_ptr(m, NGX_ALIGNMENT);
198 new->d.last = m + size;
200 current = pool->current;
202 for (p = current; p->d.next; p = p->d.next) {
203 if (p->d.failed++ > 4) {
204 current = p->d.next;
208 p->d.next = new;
210 pool->current = current ? current : new;
212 return m;
216 static void *
217 ngx_palloc_large(ngx_pool_t *pool, size_t size)
219 void *p;
220 ngx_uint_t n;
221 ngx_pool_large_t *large;
223 p = ngx_alloc(size, pool->log);
224 if (p == NULL) {
225 return NULL;
228 n = 0;
230 for (large = pool->large; large; large = large->next) {
231 if (large->alloc == NULL) {
232 large->alloc = p;
233 return p;
236 if (n++ > 3) {
237 break;
241 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
242 if (large == NULL) {
243 ngx_free(p);
244 return NULL;
247 large->alloc = p;
248 large->next = pool->large;
249 pool->large = large;
251 return p;
255 void *
256 ngx_pmemalign(ngx_pool_t *pool, size_t size, size_t alignment)
258 void *p;
259 ngx_pool_large_t *large;
261 p = ngx_memalign(alignment, size, pool->log);
262 if (p == NULL) {
263 return NULL;
266 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
267 if (large == NULL) {
268 ngx_free(p);
269 return NULL;
272 large->alloc = p;
273 large->next = pool->large;
274 pool->large = large;
276 return p;
280 ngx_int_t
281 ngx_pfree(ngx_pool_t *pool, void *p)
283 ngx_pool_large_t *l;
285 for (l = pool->large; l; l = l->next) {
286 if (p == l->alloc) {
287 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
288 "free: %p", l->alloc);
289 ngx_free(l->alloc);
290 l->alloc = NULL;
292 return NGX_OK;
296 return NGX_DECLINED;
300 void *
301 ngx_pcalloc(ngx_pool_t *pool, size_t size)
303 void *p;
305 p = ngx_palloc(pool, size);
306 if (p) {
307 ngx_memzero(p, size);
310 return p;
314 ngx_pool_cleanup_t *
315 ngx_pool_cleanup_add(ngx_pool_t *p, size_t size)
317 ngx_pool_cleanup_t *c;
319 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
320 if (c == NULL) {
321 return NULL;
324 if (size) {
325 c->data = ngx_palloc(p, size);
326 if (c->data == NULL) {
327 return NULL;
330 } else {
331 c->data = NULL;
334 c->handler = NULL;
335 c->next = p->cleanup;
337 p->cleanup = c;
339 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, p->log, 0, "add cleanup: %p", c);
341 return c;
345 void
346 ngx_pool_run_cleanup_file(ngx_pool_t *p, ngx_fd_t fd)
348 ngx_pool_cleanup_t *c;
349 ngx_pool_cleanup_file_t *cf;
351 for (c = p->cleanup; c; c = c->next) {
352 if (c->handler == ngx_pool_cleanup_file) {
354 cf = c->data;
356 if (cf->fd == fd) {
357 c->handler(cf);
358 c->handler = NULL;
359 return;
366 void
367 ngx_pool_cleanup_file(void *data)
369 ngx_pool_cleanup_file_t *c = data;
371 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, c->log, 0, "file cleanup: fd:%d",
372 c->fd);
374 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
375 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
376 ngx_close_file_n " \"%s\" failed", c->name);
381 void
382 ngx_pool_delete_file(void *data)
384 ngx_pool_cleanup_file_t *c = data;
386 ngx_err_t err;
388 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, c->log, 0, "file cleanup: fd:%d %s",
389 c->fd, c->name);
391 if (ngx_delete_file(c->name) == NGX_FILE_ERROR) {
392 err = ngx_errno;
394 if (err != NGX_ENOENT) {
395 ngx_log_error(NGX_LOG_CRIT, c->log, err,
396 ngx_delete_file_n " \"%s\" failed", c->name);
400 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
401 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
402 ngx_close_file_n " \"%s\" failed", c->name);
407 #if 0
409 static void *
410 ngx_get_cached_block(size_t size)
412 void *p;
413 ngx_cached_block_slot_t *slot;
415 if (ngx_cycle->cache == NULL) {
416 return NULL;
419 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
421 slot->tries++;
423 if (slot->number) {
424 p = slot->block;
425 slot->block = slot->block->next;
426 slot->number--;
427 return p;
430 return NULL;
433 #endif