|
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;
|
|
178
|
89 ngx_pool_large_t *large;
|
|
0
|
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 #if 0
|
|
50
|
138 p = ngx_memalign(ngx_pagesize, size, pool->log);
|
|
|
139 if (p == NULL) {
|
|
0
|
140 return NULL;
|
|
|
141 }
|
|
|
142 #else
|
|
50
|
143 p = ngx_alloc(size, pool->log);
|
|
|
144 if (p == NULL) {
|
|
0
|
145 return NULL;
|
|
|
146 }
|
|
|
147 #endif
|
|
|
148
|
|
178
|
149 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
150 if (large == NULL) {
|
|
|
151 return NULL;
|
|
0
|
152 }
|
|
|
153
|
|
|
154 large->alloc = p;
|
|
178
|
155 large->next = pool->large;
|
|
|
156 pool->large = large;
|
|
0
|
157
|
|
|
158 return p;
|
|
|
159 }
|
|
|
160
|
|
|
161
|
|
50
|
162 ngx_int_t
|
|
|
163 ngx_pfree(ngx_pool_t *pool, void *p)
|
|
0
|
164 {
|
|
|
165 ngx_pool_large_t *l;
|
|
|
166
|
|
|
167 for (l = pool->large; l; l = l->next) {
|
|
|
168 if (p == l->alloc) {
|
|
|
169 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
170 "free: %p", l->alloc);
|
|
26
|
171 ngx_free(l->alloc);
|
|
0
|
172 l->alloc = NULL;
|
|
|
173
|
|
|
174 return NGX_OK;
|
|
|
175 }
|
|
|
176 }
|
|
|
177
|
|
|
178 return NGX_DECLINED;
|
|
|
179 }
|
|
|
180
|
|
|
181
|
|
50
|
182 void *
|
|
|
183 ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
0
|
184 {
|
|
|
185 void *p;
|
|
|
186
|
|
|
187 p = ngx_palloc(pool, size);
|
|
|
188 if (p) {
|
|
|
189 ngx_memzero(p, size);
|
|
|
190 }
|
|
|
191
|
|
|
192 return p;
|
|
|
193 }
|
|
|
194
|
|
58
|
195
|
|
|
196 ngx_pool_cleanup_t *
|
|
112
|
197 ngx_pool_cleanup_add(ngx_pool_t *p, size_t size)
|
|
58
|
198 {
|
|
|
199 ngx_pool_cleanup_t *c;
|
|
|
200
|
|
|
201 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
|
|
|
202 if (c == NULL) {
|
|
|
203 return NULL;
|
|
|
204 }
|
|
|
205
|
|
112
|
206 if (size) {
|
|
|
207 c->data = ngx_palloc(p, size);
|
|
|
208 if (c->data == NULL) {
|
|
|
209 return NULL;
|
|
|
210 }
|
|
|
211
|
|
|
212 } else {
|
|
|
213 c->data = NULL;
|
|
|
214 }
|
|
|
215
|
|
|
216 c->handler = NULL;
|
|
58
|
217 c->next = p->cleanup;
|
|
|
218
|
|
|
219 p->cleanup = c;
|
|
|
220
|
|
112
|
221 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, p->log, 0, "add cleanup: %p", c);
|
|
|
222
|
|
58
|
223 return c;
|
|
|
224 }
|
|
|
225
|
|
|
226
|
|
|
227 void
|
|
|
228 ngx_pool_cleanup_file(void *data)
|
|
|
229 {
|
|
|
230 ngx_pool_cleanup_file_t *c = data;
|
|
|
231
|
|
112
|
232 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, c->log, 0, "run cleanup: %p, fd:%d",
|
|
|
233 c, c->fd);
|
|
|
234
|
|
58
|
235 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
236 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
237 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
238 }
|
|
|
239 }
|
|
|
240
|
|
|
241
|
|
0
|
242 #if 0
|
|
|
243
|
|
50
|
244 static void *
|
|
|
245 ngx_get_cached_block(size_t size)
|
|
0
|
246 {
|
|
|
247 void *p;
|
|
|
248 ngx_cached_block_slot_t *slot;
|
|
|
249
|
|
|
250 if (ngx_cycle->cache == NULL) {
|
|
|
251 return NULL;
|
|
|
252 }
|
|
|
253
|
|
|
254 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
|
|
|
255
|
|
|
256 slot->tries++;
|
|
|
257
|
|
|
258 if (slot->number) {
|
|
|
259 p = slot->block;
|
|
|
260 slot->block = slot->block->next;
|
|
|
261 slot->number--;
|
|
|
262 return p;
|
|
|
263 }
|
|
|
264
|
|
|
265 return NULL;
|
|
|
266 }
|
|
|
267
|
|
|
268 #endif
|
