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