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