|
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);
|
|
416
|
174 m = ngx_align_ptr(m, NGX_ALIGNMENT);
|
|
382
|
175 new->d.last = m + size;
|
|
|
176
|
|
|
177 current = pool->current;
|
|
|
178
|
|
|
179 for (p = current; p->d.next; p = p->d.next) {
|
|
|
180 if ((size_t) (p->d.end - p->d.last) < NGX_ALIGNMENT) {
|
|
|
181 current = p->d.next;
|
|
0
|
182 }
|
|
382
|
183 }
|
|
130
|
184
|
|
382
|
185 p->d.next = new;
|
|
|
186
|
|
|
187 pool->current = current ? current : new;
|
|
|
188
|
|
|
189 return m;
|
|
|
190 }
|
|
0
|
191
|
|
382
|
192
|
|
|
193 static void *
|
|
|
194 ngx_palloc_large(ngx_pool_t *pool, size_t size)
|
|
|
195 {
|
|
|
196 void *p;
|
|
|
197 ngx_pool_large_t *large;
|
|
0
|
198
|
|
50
|
199 p = ngx_alloc(size, pool->log);
|
|
|
200 if (p == NULL) {
|
|
0
|
201 return NULL;
|
|
|
202 }
|
|
390
|
203
|
|
|
204 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
205 if (large == NULL) {
|
|
|
206 ngx_free(p);
|
|
|
207 return NULL;
|
|
|
208 }
|
|
|
209
|
|
|
210 large->alloc = p;
|
|
|
211 large->next = pool->large;
|
|
|
212 pool->large = large;
|
|
|
213
|
|
|
214 return p;
|
|
|
215 }
|
|
|
216
|
|
|
217
|
|
|
218 void *
|
|
|
219 ngx_pmemalign(ngx_pool_t *pool, size_t size, size_t alignment)
|
|
|
220 {
|
|
|
221 void *p;
|
|
|
222 ngx_pool_large_t *large;
|
|
|
223
|
|
|
224 p = ngx_memalign(alignment, size, pool->log);
|
|
|
225 if (p == NULL) {
|
|
|
226 return NULL;
|
|
|
227 }
|
|
0
|
228
|
|
178
|
229 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
230 if (large == NULL) {
|
|
322
|
231 ngx_free(p);
|
|
178
|
232 return NULL;
|
|
0
|
233 }
|
|
|
234
|
|
|
235 large->alloc = p;
|
|
178
|
236 large->next = pool->large;
|
|
|
237 pool->large = large;
|
|
0
|
238
|
|
|
239 return p;
|
|
|
240 }
|
|
|
241
|
|
|
242
|
|
50
|
243 ngx_int_t
|
|
|
244 ngx_pfree(ngx_pool_t *pool, void *p)
|
|
0
|
245 {
|
|
|
246 ngx_pool_large_t *l;
|
|
|
247
|
|
|
248 for (l = pool->large; l; l = l->next) {
|
|
|
249 if (p == l->alloc) {
|
|
|
250 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
251 "free: %p", l->alloc);
|
|
26
|
252 ngx_free(l->alloc);
|
|
0
|
253 l->alloc = NULL;
|
|
|
254
|
|
|
255 return NGX_OK;
|
|
|
256 }
|
|
|
257 }
|
|
|
258
|
|
|
259 return NGX_DECLINED;
|
|
|
260 }
|
|
|
261
|
|
|
262
|
|
50
|
263 void *
|
|
|
264 ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
0
|
265 {
|
|
|
266 void *p;
|
|
|
267
|
|
|
268 p = ngx_palloc(pool, size);
|
|
|
269 if (p) {
|
|
|
270 ngx_memzero(p, size);
|
|
|
271 }
|
|
|
272
|
|
|
273 return p;
|
|
|
274 }
|
|
|
275
|
|
58
|
276
|
|
|
277 ngx_pool_cleanup_t *
|
|
112
|
278 ngx_pool_cleanup_add(ngx_pool_t *p, size_t size)
|
|
58
|
279 {
|
|
|
280 ngx_pool_cleanup_t *c;
|
|
|
281
|
|
|
282 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
|
|
|
283 if (c == NULL) {
|
|
|
284 return NULL;
|
|
|
285 }
|
|
|
286
|
|
112
|
287 if (size) {
|
|
|
288 c->data = ngx_palloc(p, size);
|
|
|
289 if (c->data == NULL) {
|
|
|
290 return NULL;
|
|
|
291 }
|
|
|
292
|
|
|
293 } else {
|
|
|
294 c->data = NULL;
|
|
|
295 }
|
|
|
296
|
|
|
297 c->handler = NULL;
|
|
58
|
298 c->next = p->cleanup;
|
|
|
299
|
|
|
300 p->cleanup = c;
|
|
|
301
|
|
112
|
302 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, p->log, 0, "add cleanup: %p", c);
|
|
|
303
|
|
58
|
304 return c;
|
|
|
305 }
|
|
|
306
|
|
|
307
|
|
|
308 void
|
|
|
309 ngx_pool_cleanup_file(void *data)
|
|
|
310 {
|
|
|
311 ngx_pool_cleanup_file_t *c = data;
|
|
|
312
|
|
356
|
313 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, c->log, 0, "file cleanup: fd:%d",
|
|
|
314 c->fd);
|
|
112
|
315
|
|
58
|
316 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
317 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
318 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
319 }
|
|
|
320 }
|
|
|
321
|
|
|
322
|
|
278
|
323 void
|
|
|
324 ngx_pool_delete_file(void *data)
|
|
|
325 {
|
|
|
326 ngx_pool_cleanup_file_t *c = data;
|
|
|
327
|
|
|
328 ngx_err_t err;
|
|
|
329
|
|
356
|
330 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, c->log, 0, "file cleanup: fd:%d %s",
|
|
|
331 c->fd, c->name);
|
|
278
|
332
|
|
|
333 if (ngx_delete_file(c->name) == NGX_FILE_ERROR) {
|
|
|
334 err = ngx_errno;
|
|
|
335
|
|
|
336 if (err != NGX_ENOENT) {
|
|
|
337 ngx_log_error(NGX_LOG_CRIT, c->log, err,
|
|
|
338 ngx_delete_file_n " \"%s\" failed", c->name);
|
|
|
339 }
|
|
|
340 }
|
|
|
341
|
|
|
342 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
343 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
344 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
345 }
|
|
|
346 }
|
|
|
347
|
|
|
348
|
|
0
|
349 #if 0
|
|
|
350
|
|
50
|
351 static void *
|
|
|
352 ngx_get_cached_block(size_t size)
|
|
0
|
353 {
|
|
|
354 void *p;
|
|
|
355 ngx_cached_block_slot_t *slot;
|
|
|
356
|
|
|
357 if (ngx_cycle->cache == NULL) {
|
|
|
358 return NULL;
|
|
|
359 }
|
|
|
360
|
|
|
361 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
|
|
|
362
|
|
|
363 slot->tries++;
|
|
|
364
|
|
|
365 if (slot->number) {
|
|
|
366 p = slot->block;
|
|
|
367 slot->block = slot->block->next;
|
|
|
368 slot->number--;
|
|
|
369 return p;
|
|
|
370 }
|
|
|
371
|
|
|
372 return NULL;
|
|
|
373 }
|
|
|
374
|
|
|
375 #endif
|
