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