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