|
0
|
1
|
|
|
2 /*
|
|
|
3 * Copyright (C) Igor Sysoev
|
|
|
4 */
|
|
|
5
|
|
|
6
|
|
|
7 #include <ngx_config.h>
|
|
|
8 #include <ngx_core.h>
|
|
|
9
|
|
|
10
|
|
50
|
11 ngx_pool_t *
|
|
|
12 ngx_create_pool(size_t size, ngx_log_t *log)
|
|
0
|
13 {
|
|
|
14 ngx_pool_t *p;
|
|
|
15
|
|
50
|
16 p = ngx_alloc(size, log);
|
|
|
17 if (p == NULL) {
|
|
76
|
18 return NULL;
|
|
0
|
19 }
|
|
|
20
|
|
34
|
21 p->last = (u_char *) p + sizeof(ngx_pool_t);
|
|
|
22 p->end = (u_char *) p + size;
|
|
130
|
23 p->current = p;
|
|
|
24 p->chain = NULL;
|
|
0
|
25 p->next = NULL;
|
|
|
26 p->large = NULL;
|
|
58
|
27 p->cleanup = NULL;
|
|
0
|
28 p->log = log;
|
|
|
29
|
|
|
30 return p;
|
|
|
31 }
|
|
|
32
|
|
|
33
|
|
50
|
34 void
|
|
|
35 ngx_destroy_pool(ngx_pool_t *pool)
|
|
0
|
36 {
|
|
58
|
37 ngx_pool_t *p, *n;
|
|
|
38 ngx_pool_large_t *l;
|
|
|
39 ngx_pool_cleanup_t *c;
|
|
|
40
|
|
|
41 for (c = pool->cleanup; c; c = c->next) {
|
|
|
42 if (c->handler) {
|
|
|
43 c->handler(c->data);
|
|
|
44 }
|
|
|
45 }
|
|
0
|
46
|
|
|
47 for (l = pool->large; l; l = l->next) {
|
|
|
48
|
|
10
|
49 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0, "free: %p", l->alloc);
|
|
0
|
50
|
|
|
51 if (l->alloc) {
|
|
26
|
52 ngx_free(l->alloc);
|
|
0
|
53 }
|
|
|
54 }
|
|
|
55
|
|
|
56 #if (NGX_DEBUG)
|
|
|
57
|
|
|
58 /*
|
|
|
59 * we could allocate the pool->log from this pool
|
|
|
60 * so we can not use this log while the free()ing the pool
|
|
|
61 */
|
|
|
62
|
|
|
63 for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
|
|
64 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
65 "free: %p, unused: %uz", p, p->end - p->last);
|
|
0
|
66
|
|
|
67 if (n == NULL) {
|
|
|
68 break;
|
|
|
69 }
|
|
|
70 }
|
|
|
71
|
|
|
72 #endif
|
|
|
73
|
|
|
74 for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
|
26
|
75 ngx_free(p);
|
|
0
|
76
|
|
|
77 if (n == NULL) {
|
|
|
78 break;
|
|
|
79 }
|
|
|
80 }
|
|
|
81 }
|
|
|
82
|
|
|
83
|
|
50
|
84 void *
|
|
|
85 ngx_palloc(ngx_pool_t *pool, size_t size)
|
|
0
|
86 {
|
|
34
|
87 u_char *m;
|
|
270
|
88 ngx_pool_t *p, *n, *current;
|
|
178
|
89 ngx_pool_large_t *large;
|
|
0
|
90
|
|
|
91 if (size <= (size_t) NGX_MAX_ALLOC_FROM_POOL
|
|
34
|
92 && size <= (size_t) (pool->end - (u_char *) pool)
|
|
138
|
93 - (size_t) ngx_align_ptr(sizeof(ngx_pool_t), NGX_ALIGNMENT))
|
|
0
|
94 {
|
|
270
|
95 p = pool->current;
|
|
|
96 current = p;
|
|
|
97
|
|
|
98 for ( ;; ) {
|
|
138
|
99
|
|
302
|
100 #if (NGX_HAVE_NONALIGNED)
|
|
|
101
|
|
|
102 /*
|
|
|
103 * allow non-aligned memory blocks for small allocations (1, 2,
|
|
|
104 * or 3 bytes) and for odd length strings (struct's have aligned
|
|
|
105 * size)
|
|
|
106 */
|
|
|
107
|
|
138
|
108 if (size < sizeof(int) || (size & 1)) {
|
|
|
109 m = p->last;
|
|
|
110
|
|
302
|
111 } else
|
|
|
112 #endif
|
|
|
113
|
|
|
114 {
|
|
138
|
115 m = ngx_align_ptr(p->last, NGX_ALIGNMENT);
|
|
|
116 }
|
|
0
|
117
|
|
|
118 if ((size_t) (p->end - m) >= size) {
|
|
2
|
119 p->last = m + size;
|
|
0
|
120
|
|
|
121 return m;
|
|
|
122 }
|
|
|
123
|
|
130
|
124 if ((size_t) (p->end - m) < NGX_ALIGNMENT) {
|
|
270
|
125 current = p->next;
|
|
130
|
126 }
|
|
|
127
|
|
|
128 if (p->next == NULL) {
|
|
0
|
129 break;
|
|
|
130 }
|
|
270
|
131
|
|
|
132 p = p->next;
|
|
|
133 pool->current = current;
|
|
0
|
134 }
|
|
|
135
|
|
|
136 /* allocate a new pool block */
|
|
|
137
|
|
50
|
138 n = ngx_create_pool((size_t) (p->end - (u_char *) p), p->log);
|
|
|
139 if (n == NULL) {
|
|
0
|
140 return NULL;
|
|
|
141 }
|
|
|
142
|
|
270
|
143 pool->current = current ? current : n;
|
|
130
|
144
|
|
0
|
145 p->next = n;
|
|
138
|
146 m = ngx_align_ptr(n->last, NGX_ALIGNMENT);
|
|
2
|
147 n->last = m + size;
|
|
0
|
148
|
|
|
149 return m;
|
|
|
150 }
|
|
|
151
|
|
|
152 #if 0
|
|
50
|
153 p = ngx_memalign(ngx_pagesize, size, pool->log);
|
|
|
154 if (p == NULL) {
|
|
0
|
155 return NULL;
|
|
|
156 }
|
|
|
157 #else
|
|
50
|
158 p = ngx_alloc(size, pool->log);
|
|
|
159 if (p == NULL) {
|
|
0
|
160 return NULL;
|
|
|
161 }
|
|
|
162 #endif
|
|
|
163
|
|
178
|
164 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
165 if (large == NULL) {
|
|
|
166 return NULL;
|
|
0
|
167 }
|
|
|
168
|
|
|
169 large->alloc = p;
|
|
178
|
170 large->next = pool->large;
|
|
|
171 pool->large = large;
|
|
0
|
172
|
|
|
173 return p;
|
|
|
174 }
|
|
|
175
|
|
|
176
|
|
50
|
177 ngx_int_t
|
|
|
178 ngx_pfree(ngx_pool_t *pool, void *p)
|
|
0
|
179 {
|
|
|
180 ngx_pool_large_t *l;
|
|
|
181
|
|
|
182 for (l = pool->large; l; l = l->next) {
|
|
|
183 if (p == l->alloc) {
|
|
|
184 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
185 "free: %p", l->alloc);
|
|
26
|
186 ngx_free(l->alloc);
|
|
0
|
187 l->alloc = NULL;
|
|
|
188
|
|
|
189 return NGX_OK;
|
|
|
190 }
|
|
|
191 }
|
|
|
192
|
|
|
193 return NGX_DECLINED;
|
|
|
194 }
|
|
|
195
|
|
|
196
|
|
50
|
197 void *
|
|
|
198 ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
0
|
199 {
|
|
|
200 void *p;
|
|
|
201
|
|
|
202 p = ngx_palloc(pool, size);
|
|
|
203 if (p) {
|
|
|
204 ngx_memzero(p, size);
|
|
|
205 }
|
|
|
206
|
|
|
207 return p;
|
|
|
208 }
|
|
|
209
|
|
58
|
210
|
|
|
211 ngx_pool_cleanup_t *
|
|
112
|
212 ngx_pool_cleanup_add(ngx_pool_t *p, size_t size)
|
|
58
|
213 {
|
|
|
214 ngx_pool_cleanup_t *c;
|
|
|
215
|
|
|
216 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
|
|
|
217 if (c == NULL) {
|
|
|
218 return NULL;
|
|
|
219 }
|
|
|
220
|
|
112
|
221 if (size) {
|
|
|
222 c->data = ngx_palloc(p, size);
|
|
|
223 if (c->data == NULL) {
|
|
|
224 return NULL;
|
|
|
225 }
|
|
|
226
|
|
|
227 } else {
|
|
|
228 c->data = NULL;
|
|
|
229 }
|
|
|
230
|
|
|
231 c->handler = NULL;
|
|
58
|
232 c->next = p->cleanup;
|
|
|
233
|
|
|
234 p->cleanup = c;
|
|
|
235
|
|
112
|
236 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, p->log, 0, "add cleanup: %p", c);
|
|
|
237
|
|
58
|
238 return c;
|
|
|
239 }
|
|
|
240
|
|
|
241
|
|
|
242 void
|
|
|
243 ngx_pool_cleanup_file(void *data)
|
|
|
244 {
|
|
|
245 ngx_pool_cleanup_file_t *c = data;
|
|
|
246
|
|
112
|
247 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, c->log, 0, "run cleanup: %p, fd:%d",
|
|
|
248 c, c->fd);
|
|
|
249
|
|
58
|
250 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
251 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
252 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
253 }
|
|
|
254 }
|
|
|
255
|
|
|
256
|
|
278
|
257 void
|
|
|
258 ngx_pool_delete_file(void *data)
|
|
|
259 {
|
|
|
260 ngx_pool_cleanup_file_t *c = data;
|
|
|
261
|
|
|
262 ngx_err_t err;
|
|
|
263
|
|
|
264 ngx_log_debug3(NGX_LOG_DEBUG_ALLOC, c->log, 0, "run cleanup: %p, fd:%d %s",
|
|
|
265 c, c->fd, c->name);
|
|
|
266
|
|
|
267 if (ngx_delete_file(c->name) == NGX_FILE_ERROR) {
|
|
|
268 err = ngx_errno;
|
|
|
269
|
|
|
270 if (err != NGX_ENOENT) {
|
|
|
271 ngx_log_error(NGX_LOG_CRIT, c->log, err,
|
|
|
272 ngx_delete_file_n " \"%s\" failed", c->name);
|
|
|
273 }
|
|
|
274 }
|
|
|
275
|
|
|
276 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
277 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
278 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
279 }
|
|
|
280 }
|
|
|
281
|
|
|
282
|
|
0
|
283 #if 0
|
|
|
284
|
|
50
|
285 static void *
|
|
|
286 ngx_get_cached_block(size_t size)
|
|
0
|
287 {
|
|
|
288 void *p;
|
|
|
289 ngx_cached_block_slot_t *slot;
|
|
|
290
|
|
|
291 if (ngx_cycle->cache == NULL) {
|
|
|
292 return NULL;
|
|
|
293 }
|
|
|
294
|
|
|
295 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
|
|
|
296
|
|
|
297 slot->tries++;
|
|
|
298
|
|
|
299 if (slot->number) {
|
|
|
300 p = slot->block;
|
|
|
301 slot->block = slot->block->next;
|
|
|
302 slot->number--;
|
|
|
303 return p;
|
|
|
304 }
|
|
|
305
|
|
|
306 return NULL;
|
|
|
307 }
|
|
|
308
|
|
|
309 #endif
|
