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