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