|
0
|
1
|
|
|
2 /*
|
|
|
3 * Copyright (C) Igor Sysoev
|
|
|
4 */
|
|
|
5
|
|
|
6
|
|
|
7 #include <ngx_config.h>
|
|
|
8 #include <ngx_core.h>
|
|
|
9 #include <ngx_event.h>
|
|
|
10
|
|
|
11
|
|
18
|
12 #if 0
|
|
|
13 #define NGX_SENDFILE_LIMIT 4096
|
|
|
14 #endif
|
|
|
15
|
|
|
16
|
|
|
17 #define NGX_NONE 1
|
|
0
|
18
|
|
|
19
|
|
16
|
20 static ngx_inline ngx_int_t
|
|
0
|
21 ngx_output_chain_need_to_copy(ngx_output_chain_ctx_t *ctx, ngx_buf_t *buf);
|
|
18
|
22 static ngx_int_t ngx_output_chain_add_copy(ngx_pool_t *pool,
|
|
|
23 ngx_chain_t **chain, ngx_chain_t *in);
|
|
0
|
24 static ngx_int_t ngx_output_chain_copy_buf(ngx_buf_t *dst, ngx_buf_t *src,
|
|
|
25 ngx_uint_t sendfile);
|
|
|
26
|
|
|
27
|
|
|
28 ngx_int_t ngx_output_chain(ngx_output_chain_ctx_t *ctx, ngx_chain_t *in)
|
|
|
29 {
|
|
|
30 int rc, last;
|
|
22
|
31 off_t bsize;
|
|
|
32 size_t size;
|
|
0
|
33 ngx_chain_t *cl, *out, **last_out;
|
|
|
34
|
|
4
|
35 if (ctx->in == NULL && ctx->busy == NULL) {
|
|
0
|
36
|
|
18
|
37 /*
|
|
|
38 * the short path for the case when the ctx->in and ctx->busy chains
|
|
|
39 * are empty, the incoming chain is empty too or has the single buf
|
|
|
40 * that does not require the copy
|
|
|
41 */
|
|
0
|
42
|
|
|
43 if (in == NULL) {
|
|
|
44 return ctx->output_filter(ctx->filter_ctx, in);
|
|
|
45 }
|
|
|
46
|
|
|
47 if (in->next == NULL
|
|
18
|
48 #if (NGX_SENDFILE_LIMIT)
|
|
|
49 && !(in->buf->in_file && in->buf->file_last > NGX_SENDFILE_LIMIT)
|
|
|
50 #endif
|
|
0
|
51 && (!ngx_output_chain_need_to_copy(ctx, in->buf)))
|
|
|
52 {
|
|
|
53 return ctx->output_filter(ctx->filter_ctx, in);
|
|
|
54 }
|
|
|
55 }
|
|
|
56
|
|
|
57 /* add the incoming buf to the chain ctx->in */
|
|
|
58
|
|
|
59 if (in) {
|
|
18
|
60 if (ngx_output_chain_add_copy(ctx->pool, &ctx->in, in) == NGX_ERROR) {
|
|
0
|
61 return NGX_ERROR;
|
|
|
62 }
|
|
|
63 }
|
|
|
64
|
|
|
65 last = NGX_NONE;
|
|
|
66 out = NULL;
|
|
|
67 last_out = &out;
|
|
|
68
|
|
|
69 for ( ;; ) {
|
|
|
70
|
|
|
71 while (ctx->in) {
|
|
|
72
|
|
|
73 /*
|
|
|
74 * cycle while there are the ctx->in bufs
|
|
|
75 * or there are the free output bufs to copy in
|
|
|
76 */
|
|
|
77
|
|
|
78 bsize = ngx_buf_size(ctx->in->buf);
|
|
|
79
|
|
|
80 if (bsize == 0 && !ngx_buf_special(ctx->in->buf)) {
|
|
|
81
|
|
|
82 ngx_log_error(NGX_LOG_ALERT, ctx->pool->log, 0,
|
|
|
83 "zero size buf");
|
|
|
84
|
|
22
|
85 ngx_debug_point();
|
|
|
86
|
|
0
|
87 ctx->in = ctx->in->next;
|
|
|
88
|
|
|
89 continue;
|
|
|
90 }
|
|
|
91
|
|
|
92 if (!ngx_output_chain_need_to_copy(ctx, ctx->in->buf)) {
|
|
|
93
|
|
|
94 /* move the chain link to the output chain */
|
|
|
95
|
|
|
96 cl = ctx->in;
|
|
|
97 ctx->in = cl->next;
|
|
|
98
|
|
|
99 *last_out = cl;
|
|
|
100 last_out = &cl->next;
|
|
|
101 cl->next = NULL;
|
|
|
102
|
|
|
103 continue;
|
|
|
104 }
|
|
|
105
|
|
|
106 if (ctx->buf == NULL) {
|
|
|
107
|
|
|
108 /* get the free buf */
|
|
|
109
|
|
|
110 if (ctx->free) {
|
|
|
111 ctx->buf = ctx->free->buf;
|
|
|
112 ctx->free = ctx->free->next;
|
|
|
113
|
|
|
114 } else if (out || ctx->allocated == ctx->bufs.num) {
|
|
|
115
|
|
|
116 break;
|
|
|
117
|
|
|
118 } else {
|
|
|
119
|
|
|
120 size = ctx->bufs.size;
|
|
|
121
|
|
|
122 if (ctx->in->buf->last_buf) {
|
|
|
123
|
|
22
|
124 if (bsize < (off_t) ctx->bufs.size) {
|
|
0
|
125
|
|
|
126 /*
|
|
|
127 * allocate small temp buf for the small last buf
|
|
|
128 * or its small last part
|
|
|
129 */
|
|
|
130
|
|
22
|
131 size = (size_t) bsize;
|
|
0
|
132
|
|
|
133 } else if (ctx->bufs.num == 1
|
|
22
|
134 && (bsize < (off_t) (ctx->bufs.size
|
|
|
135 + (ctx->bufs.size >> 2))))
|
|
0
|
136 {
|
|
|
137 /*
|
|
|
138 * allocate a temp buf that equals
|
|
|
139 * to the last buf if the last buf size is lesser
|
|
|
140 * than 1.25 of bufs.size and a temp buf is single
|
|
|
141 */
|
|
|
142
|
|
22
|
143 size = (size_t) bsize;
|
|
0
|
144 }
|
|
|
145 }
|
|
|
146
|
|
|
147 if (!(ctx->buf = ngx_create_temp_buf(ctx->pool, size))) {
|
|
|
148 return NGX_ERROR;
|
|
|
149 }
|
|
|
150
|
|
|
151 ctx->buf->tag = ctx->tag;
|
|
|
152 ctx->buf->recycled = 1;
|
|
|
153 ctx->allocated++;
|
|
|
154 }
|
|
|
155 }
|
|
|
156
|
|
|
157 rc = ngx_output_chain_copy_buf(ctx->buf, ctx->in->buf,
|
|
|
158 ctx->sendfile);
|
|
|
159
|
|
|
160 if (rc == NGX_ERROR) {
|
|
|
161 return rc;
|
|
|
162 }
|
|
|
163
|
|
|
164 if (rc == NGX_AGAIN) {
|
|
|
165 if (out) {
|
|
|
166 break;
|
|
|
167 }
|
|
|
168
|
|
|
169 return rc;
|
|
|
170 }
|
|
|
171
|
|
|
172 /* delete the completed buf from the ctx->in chain */
|
|
|
173
|
|
|
174 if (ngx_buf_size(ctx->in->buf) == 0) {
|
|
|
175 ctx->in = ctx->in->next;
|
|
|
176 }
|
|
|
177
|
|
10
|
178 if (!(cl = ngx_alloc_chain_link(ctx->pool))) {
|
|
|
179 return NGX_ERROR;
|
|
|
180 }
|
|
|
181 cl->buf = ctx->buf;
|
|
|
182 cl->next = NULL;
|
|
0
|
183 *last_out = cl;
|
|
|
184 last_out = &cl->next;
|
|
|
185 ctx->buf = NULL;
|
|
|
186 }
|
|
|
187
|
|
|
188 if (out == NULL && last != NGX_NONE) {
|
|
|
189 return last;
|
|
|
190 }
|
|
|
191
|
|
|
192 last = ctx->output_filter(ctx->filter_ctx, out);
|
|
|
193
|
|
|
194 ngx_chain_update_chains(&ctx->free, &ctx->busy, &out, ctx->tag);
|
|
|
195 last_out = &out;
|
|
|
196
|
|
|
197 if (last == NGX_ERROR) {
|
|
|
198 return last;
|
|
|
199 }
|
|
|
200 }
|
|
|
201 }
|
|
|
202
|
|
|
203
|
|
16
|
204 static ngx_inline ngx_int_t
|
|
0
|
205 ngx_output_chain_need_to_copy(ngx_output_chain_ctx_t *ctx, ngx_buf_t *buf)
|
|
|
206 {
|
|
18
|
207 ngx_uint_t sendfile;
|
|
|
208
|
|
0
|
209 if (ngx_buf_special(buf)) {
|
|
|
210 return 0;
|
|
|
211 }
|
|
|
212
|
|
18
|
213 sendfile = ctx->sendfile;
|
|
|
214
|
|
|
215 #if (NGX_SENDFILE_LIMIT)
|
|
|
216
|
|
|
217 if (buf->in_file && buf->file_pos >= NGX_SENDFILE_LIMIT) {
|
|
|
218 sendfile = 0;
|
|
|
219 }
|
|
|
220
|
|
|
221 #endif
|
|
|
222
|
|
|
223 if (!sendfile) {
|
|
4
|
224
|
|
0
|
225 if (!ngx_buf_in_memory(buf)) {
|
|
|
226 return 1;
|
|
|
227 }
|
|
|
228
|
|
|
229 buf->in_file = 0;
|
|
|
230 }
|
|
|
231
|
|
|
232 if (ctx->need_in_memory && !ngx_buf_in_memory(buf)) {
|
|
|
233 return 1;
|
|
|
234 }
|
|
|
235
|
|
|
236 if (ctx->need_in_temp && (buf->memory || buf->mmap)) {
|
|
|
237 return 1;
|
|
|
238 }
|
|
|
239
|
|
|
240 return 0;
|
|
|
241 }
|
|
|
242
|
|
|
243
|
|
18
|
244 static ngx_int_t ngx_output_chain_add_copy(ngx_pool_t *pool,
|
|
|
245 ngx_chain_t **chain, ngx_chain_t *in)
|
|
|
246 {
|
|
|
247 ngx_chain_t *cl, **ll;
|
|
|
248 #if (NGX_SENDFILE_LIMIT)
|
|
|
249 ngx_buf_t *b, *buf;
|
|
|
250 #endif
|
|
|
251
|
|
|
252 ll = chain;
|
|
|
253
|
|
|
254 for (cl = *chain; cl; cl = cl->next) {
|
|
|
255 ll = &cl->next;
|
|
|
256 }
|
|
|
257
|
|
|
258 while (in) {
|
|
|
259
|
|
|
260 if (!(cl = ngx_alloc_chain_link(pool))) {
|
|
|
261 return NGX_ERROR;
|
|
|
262 }
|
|
|
263
|
|
|
264 #if (NGX_SENDFILE_LIMIT)
|
|
|
265
|
|
|
266 buf = in->buf;
|
|
|
267
|
|
|
268 if (buf->in_file
|
|
|
269 && buf->file_pos < NGX_SENDFILE_LIMIT
|
|
|
270 && buf->file_last > NGX_SENDFILE_LIMIT)
|
|
|
271 {
|
|
|
272 if (!(b = ngx_calloc_buf(pool))) {
|
|
|
273 return NGX_ERROR;
|
|
|
274 }
|
|
|
275
|
|
|
276 ngx_memcpy(b, buf, sizeof(ngx_buf_t));
|
|
|
277
|
|
|
278 if (ngx_buf_in_memory(buf)) {
|
|
|
279 buf->pos += (ssize_t) (NGX_SENDFILE_LIMIT - buf->file_pos);
|
|
|
280 b->last = buf->pos;
|
|
|
281 }
|
|
|
282
|
|
|
283 buf->file_pos = NGX_SENDFILE_LIMIT;
|
|
|
284 b->file_last = NGX_SENDFILE_LIMIT;
|
|
|
285
|
|
|
286 cl->buf = b;
|
|
|
287
|
|
|
288 } else {
|
|
|
289 cl->buf = buf;
|
|
|
290 in = in->next;
|
|
|
291 }
|
|
|
292
|
|
|
293 #else
|
|
|
294 cl->buf = in->buf;
|
|
|
295 in = in->next;
|
|
|
296
|
|
|
297 #endif
|
|
|
298
|
|
|
299 *ll = cl;
|
|
|
300 ll = &cl->next;
|
|
|
301 }
|
|
|
302
|
|
|
303 *ll = NULL;
|
|
|
304
|
|
|
305 return NGX_OK;
|
|
|
306 }
|
|
|
307
|
|
|
308
|
|
0
|
309 static ngx_int_t ngx_output_chain_copy_buf(ngx_buf_t *dst, ngx_buf_t *src,
|
|
|
310 ngx_uint_t sendfile)
|
|
|
311 {
|
|
22
|
312 off_t size;
|
|
0
|
313 ssize_t n;
|
|
|
314
|
|
|
315 size = ngx_buf_size(src);
|
|
|
316
|
|
22
|
317 if (size > dst->end - dst->pos) {
|
|
0
|
318 size = dst->end - dst->pos;
|
|
|
319 }
|
|
|
320
|
|
18
|
321 #if (NGX_SENDFILE_LIMIT)
|
|
|
322
|
|
|
323 if (src->in_file && src->file_pos >= NGX_SENDFILE_LIMIT) {
|
|
|
324 sendfile = 0;
|
|
|
325 }
|
|
|
326
|
|
|
327 #endif
|
|
|
328
|
|
0
|
329 if (ngx_buf_in_memory(src)) {
|
|
22
|
330 ngx_memcpy(dst->pos, src->pos, (size_t) size);
|
|
|
331 src->pos += (size_t) size;
|
|
|
332 dst->last += (size_t) size;
|
|
0
|
333
|
|
4
|
334 if (src->in_file) {
|
|
|
335
|
|
|
336 if (sendfile) {
|
|
|
337 dst->in_file = 1;
|
|
|
338 dst->file = src->file;
|
|
|
339 dst->file_pos = src->file_pos;
|
|
|
340 dst->file_last = src->file_pos + size;
|
|
|
341
|
|
|
342 } else {
|
|
|
343 dst->in_file = 0;
|
|
|
344 }
|
|
|
345
|
|
0
|
346 src->file_pos += size;
|
|
2
|
347
|
|
|
348 } else {
|
|
|
349 dst->in_file = 0;
|
|
0
|
350 }
|
|
|
351
|
|
|
352 if (src->last_buf && src->pos == src->last) {
|
|
|
353 dst->last_buf = 1;
|
|
|
354 }
|
|
|
355
|
|
|
356 } else {
|
|
22
|
357 n = ngx_read_file(src->file, dst->pos, (size_t) size, src->file_pos);
|
|
0
|
358
|
|
|
359 if (n == NGX_ERROR) {
|
|
|
360 return n;
|
|
|
361 }
|
|
|
362
|
|
|
363 #if (NGX_FILE_AIO_READ)
|
|
|
364 if (n == NGX_AGAIN) {
|
|
|
365 return n;
|
|
|
366 }
|
|
|
367 #endif
|
|
|
368
|
|
22
|
369 if (n != size) {
|
|
0
|
370 ngx_log_error(NGX_LOG_ALERT, src->file->log, 0,
|
|
22
|
371 ngx_read_file_n " reads only %z of %O from file",
|
|
0
|
372 n, size);
|
|
|
373 if (n == 0) {
|
|
|
374 return NGX_ERROR;
|
|
|
375 }
|
|
|
376 }
|
|
|
377
|
|
|
378 dst->last += n;
|
|
|
379
|
|
2
|
380 if (sendfile) {
|
|
|
381 dst->in_file = 1;
|
|
|
382 dst->file = src->file;
|
|
|
383 dst->file_pos = src->file_pos;
|
|
4
|
384 dst->file_last = src->file_pos + n;
|
|
2
|
385
|
|
|
386 } else {
|
|
0
|
387 dst->in_file = 0;
|
|
|
388 }
|
|
|
389
|
|
4
|
390 src->file_pos += n;
|
|
|
391
|
|
0
|
392 if (src->last_buf && src->file_pos == src->file_last) {
|
|
|
393 dst->last_buf = 1;
|
|
|
394 }
|
|
|
395 }
|
|
|
396
|
|
|
397 return NGX_OK;
|
|
|
398 }
|
|
|
399
|
|
|
400
|
|
|
401 ngx_int_t ngx_chain_writer(void *data, ngx_chain_t *in)
|
|
|
402 {
|
|
|
403 ngx_chain_writer_ctx_t *ctx = data;
|
|
|
404
|
|
22
|
405 off_t size;
|
|
0
|
406 ngx_chain_t *cl;
|
|
|
407
|
|
|
408
|
|
22
|
409 for (size = 0; in; in = in->next) {
|
|
|
410
|
|
|
411 #if 1
|
|
|
412 if (ngx_buf_size(in->buf) == 0 && !ngx_buf_special(in->buf)) {
|
|
|
413 ngx_debug_point();
|
|
|
414 }
|
|
|
415 #endif
|
|
|
416
|
|
|
417 size += ngx_buf_size(in->buf);
|
|
0
|
418
|
|
|
419 ngx_log_debug1(NGX_LOG_DEBUG_CORE, ctx->connection->log, 0,
|
|
10
|
420 "chain writer buf size: %uz", ngx_buf_size(in->buf));
|
|
0
|
421
|
|
10
|
422 if (!(cl = ngx_alloc_chain_link(ctx->pool))) {
|
|
|
423 return NGX_ERROR;
|
|
|
424 }
|
|
|
425 cl->buf = in->buf;
|
|
|
426 cl->next = NULL;
|
|
0
|
427 *ctx->last = cl;
|
|
|
428 ctx->last = &cl->next;
|
|
|
429 }
|
|
|
430
|
|
|
431 ngx_log_debug1(NGX_LOG_DEBUG_CORE, ctx->connection->log, 0,
|
|
10
|
432 "chain writer in: %p", ctx->out);
|
|
0
|
433
|
|
22
|
434 for (cl = ctx->out; cl; cl = cl->next) {
|
|
|
435
|
|
|
436 #if 1
|
|
|
437
|
|
|
438 if (ngx_buf_size(cl->buf) == 0 && !ngx_buf_special(cl->buf)) {
|
|
|
439 ngx_debug_point();
|
|
|
440 }
|
|
|
441
|
|
|
442 #endif
|
|
|
443
|
|
|
444 size += ngx_buf_size(cl->buf);
|
|
|
445 }
|
|
|
446
|
|
|
447 if (size == 0) {
|
|
|
448 return NGX_OK;
|
|
|
449 }
|
|
|
450
|
|
0
|
451 ctx->out = ngx_send_chain(ctx->connection, ctx->out, ctx->limit);
|
|
|
452
|
|
|
453 ngx_log_debug1(NGX_LOG_DEBUG_CORE, ctx->connection->log, 0,
|
|
10
|
454 "chain writer out: %p", ctx->out);
|
|
0
|
455
|
|
|
456 if (ctx->out == NGX_CHAIN_ERROR) {
|
|
|
457 return NGX_ERROR;
|
|
|
458 }
|
|
|
459
|
|
|
460 if (ctx->out == NULL) {
|
|
|
461 ctx->last = &ctx->out;
|
|
|
462 return NGX_OK;
|
|
|
463 }
|
|
|
464
|
|
|
465 return NGX_AGAIN;
|
|
|
466 }
|
