|
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;
|
|
0
|
23 p->next = NULL;
|
|
|
24 p->large = NULL;
|
|
56
|
25 p->chain = NULL;
|
|
58
|
26 p->cleanup = NULL;
|
|
0
|
27 p->log = log;
|
|
|
28
|
|
|
29 return p;
|
|
|
30 }
|
|
|
31
|
|
|
32
|
|
50
|
33 void
|
|
|
34 ngx_destroy_pool(ngx_pool_t *pool)
|
|
0
|
35 {
|
|
58
|
36 ngx_pool_t *p, *n;
|
|
|
37 ngx_pool_large_t *l;
|
|
|
38 ngx_pool_cleanup_t *c;
|
|
|
39
|
|
|
40 for (c = pool->cleanup; c; c = c->next) {
|
|
|
41 if (c->handler) {
|
|
|
42 c->handler(c->data);
|
|
|
43 }
|
|
|
44 }
|
|
0
|
45
|
|
|
46 for (l = pool->large; l; l = l->next) {
|
|
|
47
|
|
10
|
48 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0, "free: %p", l->alloc);
|
|
0
|
49
|
|
|
50 if (l->alloc) {
|
|
26
|
51 ngx_free(l->alloc);
|
|
0
|
52 }
|
|
|
53 }
|
|
|
54
|
|
|
55 #if (NGX_DEBUG)
|
|
|
56
|
|
|
57 /*
|
|
|
58 * we could allocate the pool->log from this pool
|
|
|
59 * so we can not use this log while the free()ing the pool
|
|
|
60 */
|
|
|
61
|
|
|
62 for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
|
|
63 ngx_log_debug2(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
64 "free: %p, unused: %uz", p, p->end - p->last);
|
|
0
|
65
|
|
|
66 if (n == NULL) {
|
|
|
67 break;
|
|
|
68 }
|
|
|
69 }
|
|
|
70
|
|
|
71 #endif
|
|
|
72
|
|
|
73 for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
|
26
|
74 ngx_free(p);
|
|
0
|
75
|
|
|
76 if (n == NULL) {
|
|
|
77 break;
|
|
|
78 }
|
|
|
79 }
|
|
|
80 }
|
|
|
81
|
|
|
82
|
|
50
|
83 void *
|
|
|
84 ngx_palloc(ngx_pool_t *pool, size_t size)
|
|
0
|
85 {
|
|
34
|
86 u_char *m;
|
|
0
|
87 ngx_pool_t *p, *n;
|
|
|
88 ngx_pool_large_t *large, *last;
|
|
|
89
|
|
|
90 if (size <= (size_t) NGX_MAX_ALLOC_FROM_POOL
|
|
34
|
91 && size <= (size_t) (pool->end - (u_char *) pool)
|
|
2
|
92 - (size_t) ngx_align(sizeof(ngx_pool_t)))
|
|
0
|
93 {
|
|
|
94 for (p = pool, n = pool->next; /* void */; p = n, n = n->next) {
|
|
|
95 m = ngx_align(p->last);
|
|
|
96
|
|
|
97 if ((size_t) (p->end - m) >= size) {
|
|
2
|
98 p->last = m + size;
|
|
0
|
99
|
|
|
100 return m;
|
|
|
101 }
|
|
|
102
|
|
|
103 if (n == NULL) {
|
|
|
104 break;
|
|
|
105 }
|
|
|
106 }
|
|
|
107
|
|
|
108 /* allocate a new pool block */
|
|
|
109
|
|
50
|
110 n = ngx_create_pool((size_t) (p->end - (u_char *) p), p->log);
|
|
|
111 if (n == NULL) {
|
|
0
|
112 return NULL;
|
|
|
113 }
|
|
|
114
|
|
|
115 p->next = n;
|
|
2
|
116 m = ngx_align(n->last);
|
|
|
117 n->last = m + size;
|
|
0
|
118
|
|
|
119 return m;
|
|
|
120 }
|
|
|
121
|
|
|
122 /* allocate a large block */
|
|
|
123
|
|
|
124 large = NULL;
|
|
|
125 last = NULL;
|
|
|
126
|
|
|
127 if (pool->large) {
|
|
|
128 for (last = pool->large; /* void */ ; last = last->next) {
|
|
|
129 if (last->alloc == NULL) {
|
|
|
130 large = last;
|
|
|
131 last = NULL;
|
|
|
132 break;
|
|
|
133 }
|
|
|
134
|
|
|
135 if (last->next == NULL) {
|
|
|
136 break;
|
|
|
137 }
|
|
|
138 }
|
|
|
139 }
|
|
|
140
|
|
|
141 if (large == NULL) {
|
|
50
|
142 large = ngx_palloc(pool, sizeof(ngx_pool_large_t));
|
|
|
143 if (large == NULL) {
|
|
0
|
144 return NULL;
|
|
|
145 }
|
|
|
146
|
|
|
147 large->next = NULL;
|
|
|
148 }
|
|
|
149
|
|
|
150 #if 0
|
|
50
|
151 p = ngx_memalign(ngx_pagesize, size, pool->log);
|
|
|
152 if (p == NULL) {
|
|
0
|
153 return NULL;
|
|
|
154 }
|
|
|
155 #else
|
|
50
|
156 p = ngx_alloc(size, pool->log);
|
|
|
157 if (p == NULL) {
|
|
0
|
158 return NULL;
|
|
|
159 }
|
|
|
160 #endif
|
|
|
161
|
|
|
162 if (pool->large == NULL) {
|
|
|
163 pool->large = large;
|
|
|
164
|
|
|
165 } else if (last) {
|
|
|
166 last->next = large;
|
|
|
167 }
|
|
|
168
|
|
|
169 large->alloc = p;
|
|
|
170
|
|
|
171 return p;
|
|
|
172 }
|
|
|
173
|
|
|
174
|
|
50
|
175 ngx_int_t
|
|
|
176 ngx_pfree(ngx_pool_t *pool, void *p)
|
|
0
|
177 {
|
|
|
178 ngx_pool_large_t *l;
|
|
|
179
|
|
|
180 for (l = pool->large; l; l = l->next) {
|
|
|
181 if (p == l->alloc) {
|
|
|
182 ngx_log_debug1(NGX_LOG_DEBUG_ALLOC, pool->log, 0,
|
|
10
|
183 "free: %p", l->alloc);
|
|
26
|
184 ngx_free(l->alloc);
|
|
0
|
185 l->alloc = NULL;
|
|
|
186
|
|
|
187 return NGX_OK;
|
|
|
188 }
|
|
|
189 }
|
|
|
190
|
|
|
191 return NGX_DECLINED;
|
|
|
192 }
|
|
|
193
|
|
|
194
|
|
50
|
195 void *
|
|
|
196 ngx_pcalloc(ngx_pool_t *pool, size_t size)
|
|
0
|
197 {
|
|
|
198 void *p;
|
|
|
199
|
|
|
200 p = ngx_palloc(pool, size);
|
|
|
201 if (p) {
|
|
|
202 ngx_memzero(p, size);
|
|
|
203 }
|
|
|
204
|
|
|
205 return p;
|
|
|
206 }
|
|
|
207
|
|
58
|
208
|
|
|
209 ngx_pool_cleanup_t *
|
|
|
210 ngx_pool_cleanup_add(ngx_pool_t *p, ngx_pool_cleanup_pt handler, void *data)
|
|
|
211 {
|
|
|
212 ngx_pool_cleanup_t *c;
|
|
|
213
|
|
|
214 c = ngx_palloc(p, sizeof(ngx_pool_cleanup_t));
|
|
|
215 if (c == NULL) {
|
|
|
216 return NULL;
|
|
|
217 }
|
|
|
218
|
|
|
219 c->handler = handler;
|
|
|
220 c->data = data;
|
|
|
221 c->next = p->cleanup;
|
|
|
222
|
|
|
223 p->cleanup = c;
|
|
|
224
|
|
|
225 return c;
|
|
|
226 }
|
|
|
227
|
|
|
228
|
|
|
229 void
|
|
|
230 ngx_pool_cleanup_file(void *data)
|
|
|
231 {
|
|
|
232 ngx_pool_cleanup_file_t *c = data;
|
|
|
233
|
|
|
234 if (ngx_close_file(c->fd) == NGX_FILE_ERROR) {
|
|
|
235 ngx_log_error(NGX_LOG_ALERT, c->log, ngx_errno,
|
|
|
236 ngx_close_file_n " \"%s\" failed", c->name);
|
|
|
237 }
|
|
|
238 }
|
|
|
239
|
|
|
240
|
|
0
|
241 #if 0
|
|
|
242
|
|
50
|
243 static void *
|
|
|
244 ngx_get_cached_block(size_t size)
|
|
0
|
245 {
|
|
|
246 void *p;
|
|
|
247 ngx_cached_block_slot_t *slot;
|
|
|
248
|
|
|
249 if (ngx_cycle->cache == NULL) {
|
|
|
250 return NULL;
|
|
|
251 }
|
|
|
252
|
|
|
253 slot = &ngx_cycle->cache[(size + ngx_pagesize - 1) / ngx_pagesize];
|
|
|
254
|
|
|
255 slot->tries++;
|
|
|
256
|
|
|
257 if (slot->number) {
|
|
|
258 p = slot->block;
|
|
|
259 slot->block = slot->block->next;
|
|
|
260 slot->number--;
|
|
|
261 return p;
|
|
|
262 }
|
|
|
263
|
|
|
264 return NULL;
|
|
|
265 }
|
|
|
266
|
|
|
267 #endif
|
