|
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;
|
|
0
|
88 ngx_pool_t *p, *n;
|
|
|
89 ngx_pool_large_t *large, *last;
|
|
|
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 {
|
|
130
|
95 for (p = pool->current; /* void */ ; p = p->next) {
|
|
138
|
96
|
|
|
97 if (size < sizeof(int) || (size & 1)) {
|
|
|
98 m = p->last;
|
|
|
99
|
|
|
100 } else {
|
|
|
101 m = ngx_align_ptr(p->last, NGX_ALIGNMENT);
|
|
|
102 }
|
|
0
|
103
|
|
|
104 if ((size_t) (p->end - m) >= size) {
|
|
2
|
105 p->last = m + size;
|
|
0
|
106
|
|
|
107 return m;
|
|
|
108 }
|
|
|
109
|
|
130
|
110 if ((size_t) (p->end - m) < NGX_ALIGNMENT) {
|
|
132
|
111 pool->current = p->next;
|
|
130
|
112 }
|
|
|
113
|
|
|
114 if (p->next == NULL) {
|
|
0
|
115 break;
|
|
|
116 }
|
|
|
117 }
|
|
|
118
|
|
|
119 /* allocate a new pool block */
|
|
|
120
|
|
50
|
121 n = ngx_create_pool((size_t) (p->end - (u_char *) p), p->log);
|
|
|
122 if (n == NULL) {
|
|
0
|
123 return NULL;
|
|
|
124 }
|
|
|
125
|
|
132
|
126 if (pool->current == NULL) {
|
|
|
127 pool->current = n;
|
|
130
|
128 }
|
|
|
129
|
|
0
|
130 p->next = n;
|
|
138
|
131 m = ngx_align_ptr(n->last, NGX_ALIGNMENT);
|
|
2
|
132 n->last = m + size;
|
|
0
|
133
|
|
|
134 return m;
|
|
|
135 }
|
|
|
136
|
|
|
137 /* allocate a large block */
|
|
|
138
|
|
|
139 large = NULL;
|
|
|
140 last = NULL;
|
|
|
141
|
|
|
142 if (pool->large) {
|
|
|
143 for (last = pool->large; /* void */ ; last = last->next) {
|
|
|
144 if (last->alloc == NULL) {
|
|
|
145 large = last;
|
|
|
146 last = NULL;
|
|
|
147 break;
|
|
|
148 }
|
|
|
149
|
|
|
150 if (last->next == NULL) {
|
|
|
151 break;
|
|
|
152 }
|
|
|
153 }
|
|
|
154 }
|
|
|
155
|
|
|
156 if (large == NULL) {
|
|
50
|
157 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
158 if (large == NULL) {
|
|
0
|
159 return NULL;
|
|
|
160 }
|
|
|
161
|
|
|
162 large->next = NULL;
|
|
|
163 }
|
|
|
164
|
|
|
165 #if 0
|
|
50
|
166 p = ngx_memalign(ngx_pagesize, size, pool->log);
|
|
|
167 if (p == NULL) {
|
|
0
|
168 return NULL;
|
|
|
169 }
|
|
|
170 #else
|
|
50
|
171 p = ngx_alloc(size, pool->log);
|
|
|
172 if (p == NULL) {
|
|
0
|
173 return NULL;
|
|
|
174 }
|
|
|
175 #endif
|
|
|
176
|
|
|
177 if (pool->large == NULL) {
|
|
|
178 pool->large = large;
|
|
|
179
|
|
|
180 } else if (last) {
|
|
|
181 last->next = large;
|
|
|
182 }
|
|
|
183
|
|
|
184 large->alloc = p;
|
|
|
185
|
|
|
186 return p;
|
|
|
187 }
|
|
|
188
|
|
|
189
|
|
50
|
190 ngx_int_t
|
|
|
191 ngx_pfree(ngx_pool_t *pool, void *p)
|
|
0
|
192 {
|
|
|
193 ngx_pool_large_t *l;
|
|
|
194
|
|
|
195 for (l = pool->large; l; l = l->next) {
|
|
|
196 if (p == l->alloc) {
|
|
|
197 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
198 "free: %p", l->alloc);
|
|
26
|
199 ngx_free(l->alloc);
|
|
0
|
200 l->alloc = NULL;
|
|
|
201
|
|
|
202 return NGX_OK;
|
|
|
203 }
|
|
|
204 }
|
|
|
205
|
|
|
206 return NGX_DECLINED;
|
|
|
207 }
|
|
|
208
|
|
|
209
|
|
50
|
210 void *
|
|
|
211 ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
0
|
212 {
|
|
|
213 void *p;
|
|
|
214
|
|
|
215 p = ngx_palloc(pool, size);
|
|
|
216 if (p) {
|
|
|
217 ngx_memzero(p, size);
|
|
|
218 }
|
|
|
219
|
|
|
220 return p;
|
|
|
221 }
|
|
|
222
|
|
58
|
223
|
|
154
|
224 void *
|
|
|
225 ngx_shalloc(size_t size)
|
|
|
226 {
|
|
|
227 u_char *p;
|
|
|
228
|
|
|
229 if (size < sizeof(int) || (size & 1)) {
|
|
|
230 p = ngx_cycle->shm_last;
|
|
|
231
|
|
|
232 } else {
|
|
|
233 p = ngx_align_ptr(ngx_cycle->shm_last, NGX_ALIGNMENT);
|
|
|
234 }
|
|
|
235
|
|
|
236 if ((size_t) (ngx_cycle->shm_end - p) >= size) {
|
|
|
237 ngx_cycle->shm_last = p + size;
|
|
|
238 return p;
|
|
|
239 }
|
|
|
240
|
|
|
241 ngx_log_error(NGX_LOG_EMERG, ngx_cycle->log, 0,
|
|
|
242 "allocation of %uz bytes in shared memory failed, "
|
|
|
243 "only %uz are available",
|
|
|
244 size, ngx_cycle->shm_end - ngx_cycle->shm_last);
|
|
|
245
|
|
|
246 return NULL;
|
|
|
247 }
|
|
|
248
|
|
|
249
|
|
|
250 void *
|
|
|
251 ngx_shcalloc(size_t size)
|
|
|
252 {
|
|
|
253 void *p;
|
|
|
254
|
|
|
255 p = ngx_shalloc(size);
|
|
|
256 if (p) {
|
|
|
257 ngx_memzero(p, size);
|
|
|
258 }
|
|
|
259
|
|
|
260 return p;
|
|
|
261 }
|
|
|
262
|
|
|
263
|
|
58
|
264 ngx_pool_cleanup_t *
|
|
112
|
265 ngx_pool_cleanup_add(ngx_pool_t *p, size_t size)
|
|
58
|
266 {
|
|
|
267 ngx_pool_cleanup_t *c;
|
|
|
268
|
|
|
269 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
|
|
|
270 if (c == NULL) {
|
|
|
271 return NULL;
|
|
|
272 }
|
|
|
273
|
|
112
|
274 if (size) {
|
|
|
275 c->data = ngx_palloc(p, size);
|
|
|
276 if (c->data == NULL) {
|
|
|
277 return NULL;
|
|
|
278 }
|
|
|
279
|
|
|
280 } else {
|
|
|
281 c->data = NULL;
|
|
|
282 }
|
|
|
283
|
|
|
284 c->handler = NULL;
|
|
58
|
285 c->next = p->cleanup;
|
|
|
286
|
|
|
287 p->cleanup = c;
|
|
|
288
|
|
112
|
289 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, p->log, 0, "add cleanup: %p", c);
|
|
|
290
|
|
58
|
291 return c;
|
|
|
292 }
|
|
|
293
|
|
|
294
|
|
|
295 void
|
|
|
296 ngx_pool_cleanup_file(void *data)
|
|
|
297 {
|
|
|
298 ngx_pool_cleanup_file_t *c = data;
|
|
|
299
|
|
112
|
300 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, c->log, 0, "run cleanup: %p, fd:%d",
|
|
|
301 c, c->fd);
|
|
|
302
|
|
58
|
303 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
304 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
305 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
306 }
|
|
|
307 }
|
|
|
308
|
|
|
309
|
|
0
|
310 #if 0
|
|
|
311
|
|
50
|
312 static void *
|
|
|
313 ngx_get_cached_block(size_t size)
|
|
0
|
314 {
|
|
|
315 void *p;
|
|
|
316 ngx_cached_block_slot_t *slot;
|
|
|
317
|
|
|
318 if (ngx_cycle->cache == NULL) {
|
|
|
319 return NULL;
|
|
|
320 }
|
|
|
321
|
|
|
322 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
|
|
|
323
|
|
|
324 slot->tries++;
|
|
|
325
|
|
|
326 if (slot->number) {
|
|
|
327 p = slot->block;
|
|
|
328 slot->block = slot->block->next;
|
|
|
329 slot->number--;
|
|
|
330 return p;
|
|
|
331 }
|
|
|
332
|
|
|
333 return NULL;
|
|
|
334 }
|
|
|
335
|
|
|
336 #endif
|
