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