CHUNKING/DKIM: fix handling of lines having a leading dot
[exim.git] / src / src / transport.c
... / ...
CommitLineData
1/*************************************************
2* Exim - an Internet mail transport agent *
3*************************************************/
4
5/* Copyright (c) University of Cambridge 1995 - 2016 */
6/* See the file NOTICE for conditions of use and distribution. */
7
8/* General functions concerned with transportation, and generic options for all
9transports. */
10
11
12#include "exim.h"
13
14#ifdef HAVE_LINUX_SENDFILE
15#include <sys/sendfile.h>
16#endif
17
18/* Structure for keeping list of addresses that have been added to
19Envelope-To:, in order to avoid duplication. */
20
21struct aci {
22 struct aci *next;
23 address_item *ptr;
24 };
25
26
27/* Static data for write_chunk() */
28
29static uschar *chunk_ptr; /* chunk pointer */
30static uschar *nl_check; /* string to look for at line start */
31static int nl_check_length; /* length of same */
32static uschar *nl_escape; /* string to insert */
33static int nl_escape_length; /* length of same */
34static int nl_partial_match; /* length matched at chunk end */
35
36
37/* Generic options for transports, all of which live inside transport_instance
38data blocks and which therefore have the opt_public flag set. Note that there
39are other options living inside this structure which can be set only from
40certain transports. */
41
42optionlist optionlist_transports[] = {
43 { "*expand_group", opt_stringptr|opt_hidden|opt_public,
44 (void *)offsetof(transport_instance, expand_gid) },
45 { "*expand_user", opt_stringptr|opt_hidden|opt_public,
46 (void *)offsetof(transport_instance, expand_uid) },
47 { "*headers_rewrite_flags", opt_int|opt_public|opt_hidden,
48 (void *)offsetof(transport_instance, rewrite_existflags) },
49 { "*headers_rewrite_rules", opt_void|opt_public|opt_hidden,
50 (void *)offsetof(transport_instance, rewrite_rules) },
51 { "*set_group", opt_bool|opt_hidden|opt_public,
52 (void *)offsetof(transport_instance, gid_set) },
53 { "*set_user", opt_bool|opt_hidden|opt_public,
54 (void *)offsetof(transport_instance, uid_set) },
55 { "body_only", opt_bool|opt_public,
56 (void *)offsetof(transport_instance, body_only) },
57 { "current_directory", opt_stringptr|opt_public,
58 (void *)offsetof(transport_instance, current_dir) },
59 { "debug_print", opt_stringptr | opt_public,
60 (void *)offsetof(transport_instance, debug_string) },
61 { "delivery_date_add", opt_bool|opt_public,
62 (void *)(offsetof(transport_instance, delivery_date_add)) },
63 { "disable_logging", opt_bool|opt_public,
64 (void *)(offsetof(transport_instance, disable_logging)) },
65 { "driver", opt_stringptr|opt_public,
66 (void *)offsetof(transport_instance, driver_name) },
67 { "envelope_to_add", opt_bool|opt_public,
68 (void *)(offsetof(transport_instance, envelope_to_add)) },
69#ifndef DISABLE_EVENT
70 { "event_action", opt_stringptr | opt_public,
71 (void *)offsetof(transport_instance, event_action) },
72#endif
73 { "group", opt_expand_gid|opt_public,
74 (void *)offsetof(transport_instance, gid) },
75 { "headers_add", opt_stringptr|opt_public|opt_rep_str,
76 (void *)offsetof(transport_instance, add_headers) },
77 { "headers_only", opt_bool|opt_public,
78 (void *)offsetof(transport_instance, headers_only) },
79 { "headers_remove", opt_stringptr|opt_public|opt_rep_str,
80 (void *)offsetof(transport_instance, remove_headers) },
81 { "headers_rewrite", opt_rewrite|opt_public,
82 (void *)offsetof(transport_instance, headers_rewrite) },
83 { "home_directory", opt_stringptr|opt_public,
84 (void *)offsetof(transport_instance, home_dir) },
85 { "initgroups", opt_bool|opt_public,
86 (void *)offsetof(transport_instance, initgroups) },
87 { "max_parallel", opt_stringptr|opt_public,
88 (void *)offsetof(transport_instance, max_parallel) },
89 { "message_size_limit", opt_stringptr|opt_public,
90 (void *)offsetof(transport_instance, message_size_limit) },
91 { "rcpt_include_affixes", opt_bool|opt_public,
92 (void *)offsetof(transport_instance, rcpt_include_affixes) },
93 { "retry_use_local_part", opt_bool|opt_public,
94 (void *)offsetof(transport_instance, retry_use_local_part) },
95 { "return_path", opt_stringptr|opt_public,
96 (void *)(offsetof(transport_instance, return_path)) },
97 { "return_path_add", opt_bool|opt_public,
98 (void *)(offsetof(transport_instance, return_path_add)) },
99 { "shadow_condition", opt_stringptr|opt_public,
100 (void *)offsetof(transport_instance, shadow_condition) },
101 { "shadow_transport", opt_stringptr|opt_public,
102 (void *)offsetof(transport_instance, shadow) },
103 { "transport_filter", opt_stringptr|opt_public,
104 (void *)offsetof(transport_instance, filter_command) },
105 { "transport_filter_timeout", opt_time|opt_public,
106 (void *)offsetof(transport_instance, filter_timeout) },
107 { "user", opt_expand_uid|opt_public,
108 (void *)offsetof(transport_instance, uid) }
109};
110
111int optionlist_transports_size =
112 sizeof(optionlist_transports)/sizeof(optionlist);
113
114
115/*************************************************
116* Initialize transport list *
117*************************************************/
118
119/* Read the transports section of the configuration file, and set up a chain of
120transport instances according to its contents. Each transport has generic
121options and may also have its own private options. This function is only ever
122called when transports == NULL. We use generic code in readconf to do most of
123the work. */
124
125void
126transport_init(void)
127{
128transport_instance *t;
129
130readconf_driver_init(US"transport",
131 (driver_instance **)(&transports), /* chain anchor */
132 (driver_info *)transports_available, /* available drivers */
133 sizeof(transport_info), /* size of info block */
134 &transport_defaults, /* default values for generic options */
135 sizeof(transport_instance), /* size of instance block */
136 optionlist_transports, /* generic options */
137 optionlist_transports_size);
138
139/* Now scan the configured transports and check inconsistencies. A shadow
140transport is permitted only for local transports. */
141
142for (t = transports; t != NULL; t = t->next)
143 {
144 if (!t->info->local)
145 {
146 if (t->shadow != NULL)
147 log_write(0, LOG_PANIC_DIE|LOG_CONFIG,
148 "shadow transport not allowed on non-local transport %s", t->name);
149 }
150
151 if (t->body_only && t->headers_only)
152 log_write(0, LOG_PANIC_DIE|LOG_CONFIG,
153 "%s transport: body_only and headers_only are mutually exclusive",
154 t->name);
155 }
156}
157
158
159
160/*************************************************
161* Write block of data *
162*************************************************/
163
164/* Subroutine called by write_chunk() and at the end of the message actually
165to write a data block. Also called directly by some transports to write
166additional data to the file descriptor (e.g. prefix, suffix).
167
168If a transport wants data transfers to be timed, it sets a non-zero value in
169transport_write_timeout. A non-zero transport_write_timeout causes a timer to
170be set for each block of data written from here. If time runs out, then write()
171fails and provokes an error return. The caller can then inspect sigalrm_seen to
172check for a timeout.
173
174On some systems, if a quota is exceeded during the write, the yield is the
175number of bytes written rather than an immediate error code. This also happens
176on some systems in other cases, for example a pipe that goes away because the
177other end's process terminates (Linux). On other systems, (e.g. Solaris 2) you
178get the error codes the first time.
179
180The write() function is also interruptible; the Solaris 2.6 man page says:
181
182 If write() is interrupted by a signal before it writes any
183 data, it will return -1 with errno set to EINTR.
184
185 If write() is interrupted by a signal after it successfully
186 writes some data, it will return the number of bytes written.
187
188To handle these cases, we want to restart the write() to output the remainder
189of the data after a non-negative return from write(), except after a timeout.
190In the error cases (EDQUOT, EPIPE) no bytes get written the second time, and a
191proper error then occurs. In principle, after an interruption, the second
192write() could suffer the same fate, but we do not want to continue for
193evermore, so stick a maximum repetition count on the loop to act as a
194longstop.
195
196Arguments:
197 fd file descriptor to write to
198 block block of bytes to write
199 len number of bytes to write
200
201Returns: TRUE on success, FALSE on failure (with errno preserved);
202 transport_count is incremented by the number of bytes written
203*/
204
205BOOL
206transport_write_block(int fd, uschar *block, int len)
207{
208int i, rc, save_errno;
209int local_timeout = transport_write_timeout;
210
211/* This loop is for handling incomplete writes and other retries. In most
212normal cases, it is only ever executed once. */
213
214for (i = 0; i < 100; i++)
215 {
216 DEBUG(D_transport)
217 debug_printf("writing data block fd=%d size=%d timeout=%d\n",
218 fd, len, local_timeout);
219
220 /* This code makes use of alarm() in order to implement the timeout. This
221 isn't a very tidy way of doing things. Using non-blocking I/O with select()
222 provides a neater approach. However, I don't know how to do this when TLS is
223 in use. */
224
225 if (transport_write_timeout <= 0) /* No timeout wanted */
226 {
227 #ifdef SUPPORT_TLS
228 if (tls_out.active == fd) rc = tls_write(FALSE, block, len); else
229 #endif
230 rc = write(fd, block, len);
231 save_errno = errno;
232 }
233
234 /* Timeout wanted. */
235
236 else
237 {
238 alarm(local_timeout);
239#ifdef SUPPORT_TLS
240 if (tls_out.active == fd)
241 rc = tls_write(FALSE, block, len);
242 else
243#endif
244 rc = write(fd, block, len);
245 save_errno = errno;
246 local_timeout = alarm(0);
247 if (sigalrm_seen)
248 {
249 errno = ETIMEDOUT;
250 return FALSE;
251 }
252 }
253
254 /* Hopefully, the most common case is success, so test that first. */
255
256 if (rc == len) { transport_count += len; return TRUE; }
257
258 /* A non-negative return code is an incomplete write. Try again for the rest
259 of the block. If we have exactly hit the timeout, give up. */
260
261 if (rc >= 0)
262 {
263 len -= rc;
264 block += rc;
265 transport_count += rc;
266 DEBUG(D_transport) debug_printf("write incomplete (%d)\n", rc);
267 goto CHECK_TIMEOUT; /* A few lines below */
268 }
269
270 /* A negative return code with an EINTR error is another form of
271 incomplete write, zero bytes having been written */
272
273 if (save_errno == EINTR)
274 {
275 DEBUG(D_transport)
276 debug_printf("write interrupted before anything written\n");
277 goto CHECK_TIMEOUT; /* A few lines below */
278 }
279
280 /* A response of EAGAIN from write() is likely only in the case of writing
281 to a FIFO that is not swallowing the data as fast as Exim is writing it. */
282
283 if (save_errno == EAGAIN)
284 {
285 DEBUG(D_transport)
286 debug_printf("write temporarily locked out, waiting 1 sec\n");
287 sleep(1);
288
289 /* Before continuing to try another write, check that we haven't run out of
290 time. */
291
292 CHECK_TIMEOUT:
293 if (transport_write_timeout > 0 && local_timeout <= 0)
294 {
295 errno = ETIMEDOUT;
296 return FALSE;
297 }
298 continue;
299 }
300
301 /* Otherwise there's been an error */
302
303 DEBUG(D_transport) debug_printf("writing error %d: %s\n", save_errno,
304 strerror(save_errno));
305 errno = save_errno;
306 return FALSE;
307 }
308
309/* We've tried and tried and tried but still failed */
310
311errno = ERRNO_WRITEINCOMPLETE;
312return FALSE;
313}
314
315
316
317
318/*************************************************
319* Write formatted string *
320*************************************************/
321
322/* This is called by various transports. It is a convenience function.
323
324Arguments:
325 fd file descriptor
326 format string format
327 ... arguments for format
328
329Returns: the yield of transport_write_block()
330*/
331
332BOOL
333transport_write_string(int fd, const char *format, ...)
334{
335va_list ap;
336va_start(ap, format);
337if (!string_vformat(big_buffer, big_buffer_size, format, ap))
338 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "overlong formatted string in transport");
339va_end(ap);
340return transport_write_block(fd, big_buffer, Ustrlen(big_buffer));
341}
342
343
344
345
346/*************************************************
347* Write character chunk *
348*************************************************/
349
350/* Subroutine used by transport_write_message() to scan character chunks for
351newlines and act appropriately. The object is to minimise the number of writes.
352The output byte stream is buffered up in deliver_out_buffer, which is written
353only when it gets full, thus minimizing write operations and TCP packets.
354
355Static data is used to handle the case when the last character of the previous
356chunk was NL, or matched part of the data that has to be escaped.
357
358Arguments:
359 fd file descript to write to
360 chunk pointer to data to write
361 len length of data to write
362 tctx transport context - processing to be done during output
363
364In addition, the static nl_xxx variables must be set as required.
365
366Returns: TRUE on success, FALSE on failure (with errno preserved)
367*/
368
369static BOOL
370write_chunk(int fd, transport_ctx * tctx, uschar *chunk, int len)
371{
372uschar *start = chunk;
373uschar *end = chunk + len;
374uschar *ptr;
375int mlen = DELIVER_OUT_BUFFER_SIZE - nl_escape_length - 2;
376
377/* The assumption is made that the check string will never stretch over move
378than one chunk since the only time there are partial matches is when copying
379the body in large buffers. There is always enough room in the buffer for an
380escape string, since the loop below ensures this for each character it
381processes, and it won't have stuck in the escape string if it left a partial
382match. */
383
384if (nl_partial_match >= 0)
385 {
386 if (nl_check_length > 0 && len >= nl_check_length &&
387 Ustrncmp(start, nl_check + nl_partial_match,
388 nl_check_length - nl_partial_match) == 0)
389 {
390 Ustrncpy(chunk_ptr, nl_escape, nl_escape_length);
391 chunk_ptr += nl_escape_length;
392 start += nl_check_length - nl_partial_match;
393 }
394
395 /* The partial match was a false one. Insert the characters carried over
396 from the previous chunk. */
397
398 else if (nl_partial_match > 0)
399 {
400 Ustrncpy(chunk_ptr, nl_check, nl_partial_match);
401 chunk_ptr += nl_partial_match;
402 }
403
404 nl_partial_match = -1;
405 }
406
407/* Now process the characters in the chunk. Whenever we hit a newline we check
408for possible escaping. The code for the non-NL route should be as fast as
409possible. */
410
411for (ptr = start; ptr < end; ptr++)
412 {
413 int ch, len;
414
415 /* Flush the buffer if it has reached the threshold - we want to leave enough
416 room for the next uschar, plus a possible extra CR for an LF, plus the escape
417 string. */
418
419 if ((len = chunk_ptr - deliver_out_buffer) > mlen)
420 {
421 DEBUG(D_transport) debug_printf("flushing headers buffer\n");
422
423 /* If CHUNKING, prefix with BDAT (size) NON-LAST. Also, reap responses
424 from previous SMTP commands. */
425
426 if (tctx && tctx->options & topt_use_bdat && tctx->chunk_cb)
427 {
428 if ( tctx->chunk_cb(fd, tctx, (unsigned)len, 0) != OK
429 || !transport_write_block(fd, deliver_out_buffer, len)
430 || tctx->chunk_cb(fd, tctx, 0, tc_reap_prev) != OK
431 )
432 return FALSE;
433 }
434 else
435 if (!transport_write_block(fd, deliver_out_buffer, len))
436 return FALSE;
437 chunk_ptr = deliver_out_buffer;
438 }
439
440 if ((ch = *ptr) == '\n')
441 {
442 int left = end - ptr - 1; /* count of chars left after NL */
443
444 /* Insert CR before NL if required */
445
446 if (tctx && tctx->options & topt_use_crlf) *chunk_ptr++ = '\r';
447 *chunk_ptr++ = '\n';
448 transport_newlines++;
449
450 /* The check_string test (formerly "from hack") replaces the specific
451 string at the start of a line with an escape string (e.g. "From " becomes
452 ">From " or "." becomes "..". It is a case-sensitive test. The length
453 check above ensures there is always enough room to insert this string. */
454
455 if (nl_check_length > 0)
456 {
457 if (left >= nl_check_length &&
458 Ustrncmp(ptr+1, nl_check, nl_check_length) == 0)
459 {
460 Ustrncpy(chunk_ptr, nl_escape, nl_escape_length);
461 chunk_ptr += nl_escape_length;
462 ptr += nl_check_length;
463 }
464
465 /* Handle the case when there isn't enough left to match the whole
466 check string, but there may be a partial match. We remember how many
467 characters matched, and finish processing this chunk. */
468
469 else if (left <= 0) nl_partial_match = 0;
470
471 else if (Ustrncmp(ptr+1, nl_check, left) == 0)
472 {
473 nl_partial_match = left;
474 ptr = end;
475 }
476 }
477 }
478
479 /* Not a NL character */
480
481 else *chunk_ptr++ = ch;
482 }
483
484return TRUE;
485}
486
487
488
489
490/*************************************************
491* Generate address for RCPT TO *
492*************************************************/
493
494/* This function puts together an address for RCPT to, using the caseful
495version of the local part and the caseful version of the domain. If there is no
496prefix or suffix, or if affixes are to be retained, we can just use the
497original address. Otherwise, if there is a prefix but no suffix we can use a
498pointer into the original address. If there is a suffix, however, we have to
499build a new string.
500
501Arguments:
502 addr the address item
503 include_affixes TRUE if affixes are to be included
504
505Returns: a string
506*/
507
508uschar *
509transport_rcpt_address(address_item *addr, BOOL include_affixes)
510{
511uschar *at;
512int plen, slen;
513
514if (include_affixes)
515 {
516 setflag(addr, af_include_affixes); /* Affects logged => line */
517 return addr->address;
518 }
519
520if (addr->suffix == NULL)
521 {
522 if (addr->prefix == NULL) return addr->address;
523 return addr->address + Ustrlen(addr->prefix);
524 }
525
526at = Ustrrchr(addr->address, '@');
527plen = (addr->prefix == NULL)? 0 : Ustrlen(addr->prefix);
528slen = Ustrlen(addr->suffix);
529
530return string_sprintf("%.*s@%s", (at - addr->address - plen - slen),
531 addr->address + plen, at + 1);
532}
533
534
535/*************************************************
536* Output Envelope-To: address & scan duplicates *
537*************************************************/
538
539/* This function is called from internal_transport_write_message() below, when
540generating an Envelope-To: header line. It checks for duplicates of the given
541address and its ancestors. When one is found, this function calls itself
542recursively, to output the envelope address of the duplicate.
543
544We want to avoid duplication in the list, which can arise for example when
545A->B,C and then both B and C alias to D. This can also happen when there are
546unseen drivers in use. So a list of addresses that have been output is kept in
547the plist variable.
548
549It is also possible to have loops in the address ancestry/duplication graph,
550for example if there are two top level addresses A and B and we have A->B,C and
551B->A. To break the loop, we use a list of processed addresses in the dlist
552variable.
553
554After handling duplication, this function outputs the progenitor of the given
555address.
556
557Arguments:
558 p the address we are interested in
559 pplist address of anchor of the list of addresses not to output
560 pdlist address of anchor of the list of processed addresses
561 first TRUE if this is the first address; set it FALSE afterwards
562 fd the file descriptor to write to
563 tctx transport context - processing to be done during output
564
565Returns: FALSE if writing failed
566*/
567
568static BOOL
569write_env_to(address_item *p, struct aci **pplist, struct aci **pdlist,
570 BOOL *first, int fd, transport_ctx * tctx)
571{
572address_item *pp;
573struct aci *ppp;
574
575/* Do nothing if we have already handled this address. If not, remember it
576so that we don't handle it again. */
577
578for (ppp = *pdlist; ppp; ppp = ppp->next) if (p == ppp->ptr) return TRUE;
579
580ppp = store_get(sizeof(struct aci));
581ppp->next = *pdlist;
582*pdlist = ppp;
583ppp->ptr = p;
584
585/* Now scan up the ancestry, checking for duplicates at each generation. */
586
587for (pp = p;; pp = pp->parent)
588 {
589 address_item *dup;
590 for (dup = addr_duplicate; dup; dup = dup->next)
591 if (dup->dupof == pp) /* a dup of our address */
592 if (!write_env_to(dup, pplist, pdlist, first, fd, tctx))
593 return FALSE;
594 if (!pp->parent) break;
595 }
596
597/* Check to see if we have already output the progenitor. */
598
599for (ppp = *pplist; ppp; ppp = ppp->next) if (pp == ppp->ptr) break;
600if (ppp) return TRUE;
601
602/* Remember what we have output, and output it. */
603
604ppp = store_get(sizeof(struct aci));
605ppp->next = *pplist;
606*pplist = ppp;
607ppp->ptr = pp;
608
609if (!*first && !write_chunk(fd, tctx, US",\n ", 3)) return FALSE;
610*first = FALSE;
611return write_chunk(fd, tctx, pp->address, Ustrlen(pp->address));
612}
613
614
615
616
617/* Add/remove/rewwrite headers, and send them plus the empty-line sparator.
618
619Globals:
620 header_list
621
622Arguments:
623 addr (chain of) addresses (for extra headers), or NULL;
624 only the first address is used
625 fd file descriptor to write the message to
626 tctx transport context
627 sendfn function for output (transport or verify)
628
629Returns: TRUE on success; FALSE on failure.
630*/
631BOOL
632transport_headers_send(int fd, transport_ctx * tctx,
633 BOOL (*sendfn)(int fd, transport_ctx * tctx, uschar * s, int len))
634{
635header_line *h;
636const uschar *list;
637transport_instance * tblock = tctx ? tctx->tblock : NULL;
638address_item * addr = tctx ? tctx->addr : NULL;
639
640/* Then the message's headers. Don't write any that are flagged as "old";
641that means they were rewritten, or are a record of envelope rewriting, or
642were removed (e.g. Bcc). If remove_headers is not null, skip any headers that
643match any entries therein. It is a colon-sep list; expand the items
644separately and squash any empty ones.
645Then check addr->prop.remove_headers too, provided that addr is not NULL. */
646
647for (h = header_list; h; h = h->next) if (h->type != htype_old)
648 {
649 int i;
650 BOOL include_header = TRUE;
651
652 list = tblock ? tblock->remove_headers : NULL;
653 for (i = 0; i < 2; i++) /* For remove_headers && addr->prop.remove_headers */
654 {
655 if (list)
656 {
657 int sep = ':'; /* This is specified as a colon-separated list */
658 uschar *s, *ss;
659 while ((s = string_nextinlist(&list, &sep, NULL, 0)))
660 {
661 int len;
662
663 if (i == 0)
664 if (!(s = expand_string(s)) && !expand_string_forcedfail)
665 {
666 errno = ERRNO_CHHEADER_FAIL;
667 return FALSE;
668 }
669 len = s ? Ustrlen(s) : 0;
670 if (strncmpic(h->text, s, len) != 0) continue;
671 ss = h->text + len;
672 while (*ss == ' ' || *ss == '\t') ss++;
673 if (*ss == ':') break;
674 }
675 if (s) { include_header = FALSE; break; }
676 }
677 if (addr) list = addr->prop.remove_headers;
678 }
679
680 /* If this header is to be output, try to rewrite it if there are rewriting
681 rules. */
682
683 if (include_header)
684 {
685 if (tblock && tblock->rewrite_rules)
686 {
687 void *reset_point = store_get(0);
688 header_line *hh;
689
690 if ((hh = rewrite_header(h, NULL, NULL, tblock->rewrite_rules,
691 tblock->rewrite_existflags, FALSE)))
692 {
693 if (!sendfn(fd, tctx, hh->text, hh->slen)) return FALSE;
694 store_reset(reset_point);
695 continue; /* With the next header line */
696 }
697 }
698
699 /* Either no rewriting rules, or it didn't get rewritten */
700
701 if (!sendfn(fd, tctx, h->text, h->slen)) return FALSE;
702 }
703
704 /* Header removed */
705
706 else
707 {
708 DEBUG(D_transport) debug_printf("removed header line:\n%s---\n", h->text);
709 }
710 }
711
712/* Add on any address-specific headers. If there are multiple addresses,
713they will all have the same headers in order to be batched. The headers
714are chained in reverse order of adding (so several addresses from the
715same alias might share some of them) but we want to output them in the
716opposite order. This is a bit tedious, but there shouldn't be very many
717of them. We just walk the list twice, reversing the pointers each time,
718but on the second time, write out the items.
719
720Headers added to an address by a router are guaranteed to end with a newline.
721*/
722
723if (addr)
724 {
725 int i;
726 header_line *hprev = addr->prop.extra_headers;
727 header_line *hnext;
728 for (i = 0; i < 2; i++)
729 for (h = hprev, hprev = NULL; h; h = hnext)
730 {
731 hnext = h->next;
732 h->next = hprev;
733 hprev = h;
734 if (i == 1)
735 {
736 if (!sendfn(fd, tctx, h->text, h->slen)) return FALSE;
737 DEBUG(D_transport)
738 debug_printf("added header line(s):\n%s---\n", h->text);
739 }
740 }
741 }
742
743/* If a string containing additional headers exists it is a newline-sep
744list. Expand each item and write out the result. This is done last so that
745if it (deliberately or accidentally) isn't in header format, it won't mess
746up any other headers. An empty string or a forced expansion failure are
747noops. An added header string from a transport may not end with a newline;
748add one if it does not. */
749
750if (tblock && (list = CUS tblock->add_headers))
751 {
752 int sep = '\n';
753 uschar * s;
754
755 while ((s = string_nextinlist(&list, &sep, NULL, 0)))
756 if ((s = expand_string(s)))
757 {
758 int len = Ustrlen(s);
759 if (len > 0)
760 {
761 if (!sendfn(fd, tctx, s, len)) return FALSE;
762 if (s[len-1] != '\n' && !sendfn(fd, tctx, US"\n", 1))
763 return FALSE;
764 DEBUG(D_transport)
765 {
766 debug_printf("added header line:\n%s", s);
767 if (s[len-1] != '\n') debug_printf("\n");
768 debug_printf("---\n");
769 }
770 }
771 }
772 else if (!expand_string_forcedfail)
773 { errno = ERRNO_CHHEADER_FAIL; return FALSE; }
774 }
775
776/* Separate headers from body with a blank line */
777
778return sendfn(fd, tctx, US"\n", 1);
779}
780
781
782/*************************************************
783* Write the message *
784*************************************************/
785
786/* This function writes the message to the given file descriptor. The headers
787are in the in-store data structure, and the rest of the message is in the open
788file descriptor deliver_datafile. Make sure we start it at the beginning.
789
790. If add_return_path is TRUE, a "return-path:" header is added to the message,
791 containing the envelope sender's address.
792
793. If add_envelope_to is TRUE, a "envelope-to:" header is added to the message,
794 giving the top-level envelope address that caused this delivery to happen.
795
796. If add_delivery_date is TRUE, a "delivery-date:" header is added to the
797 message. It gives the time and date that delivery took place.
798
799. If check_string is not null, the start of each line is checked for that
800 string. If it is found, it is replaced by escape_string. This used to be
801 the "from hack" for files, and "smtp_dots" for escaping SMTP dots.
802
803. If use_crlf is true, newlines are turned into CRLF (SMTP output).
804
805The yield is TRUE if all went well, and FALSE if not. Exit *immediately* after
806any writing or reading error, leaving the code in errno intact. Error exits
807can include timeouts for certain transports, which are requested by setting
808transport_write_timeout non-zero.
809
810Arguments:
811 fd file descriptor to write the message to
812 tctx
813 addr (chain of) addresses (for extra headers), or NULL;
814 only the first address is used
815 tblock optional transport instance block (NULL signifies NULL/0):
816 add_headers a string containing one or more headers to add; it is
817 expanded, and must be in correct RFC 822 format as
818 it is transmitted verbatim; NULL => no additions,
819 and so does empty string or forced expansion fail
820 remove_headers a colon-separated list of headers to remove, or NULL
821 rewrite_rules chain of header rewriting rules
822 rewrite_existflags flags for the rewriting rules
823 options bit-wise options:
824 add_return_path if TRUE, add a "return-path" header
825 add_envelope_to if TRUE, add a "envelope-to" header
826 add_delivery_date if TRUE, add a "delivery-date" header
827 use_crlf if TRUE, turn NL into CR LF
828 end_dot if TRUE, send a terminating "." line at the end
829 no_headers if TRUE, omit the headers
830 no_body if TRUE, omit the body
831 check_string a string to check for at the start of lines, or NULL
832 escape_string a string to insert in front of any check string
833 size_limit if > 0, this is a limit to the size of message written;
834 it is used when returning messages to their senders,
835 and is approximate rather than exact, owing to chunk
836 buffering
837
838Returns: TRUE on success; FALSE (with errno) on failure.
839 In addition, the global variable transport_count
840 is incremented by the number of bytes written.
841*/
842
843static BOOL
844internal_transport_write_message(int fd, transport_ctx * tctx, int size_limit)
845{
846int len;
847
848/* Initialize pointer in output buffer. */
849
850chunk_ptr = deliver_out_buffer;
851
852/* Set up the data for start-of-line data checking and escaping */
853
854nl_partial_match = -1;
855if (tctx->check_string && tctx->escape_string)
856 {
857 nl_check = tctx->check_string;
858 nl_check_length = Ustrlen(nl_check);
859 nl_escape = tctx->escape_string;
860 nl_escape_length = Ustrlen(nl_escape);
861 }
862else
863 nl_check_length = nl_escape_length = 0;
864
865/* Whether the escaping mechanism is applied to headers or not is controlled by
866an option (set for SMTP, not otherwise). Negate the length if not wanted till
867after the headers. */
868
869if (!(tctx->options & topt_escape_headers))
870 nl_check_length = -nl_check_length;
871
872/* Write the headers if required, including any that have to be added. If there
873are header rewriting rules, apply them. */
874
875if (!(tctx->options & topt_no_headers))
876 {
877 /* Add return-path: if requested. */
878
879 if (tctx->options & topt_add_return_path)
880 {
881 uschar buffer[ADDRESS_MAXLENGTH + 20];
882 int n = sprintf(CS buffer, "Return-path: <%.*s>\n", ADDRESS_MAXLENGTH,
883 return_path);
884 if (!write_chunk(fd, tctx, buffer, n)) return FALSE;
885 }
886
887 /* Add envelope-to: if requested */
888
889 if (tctx->options & topt_add_envelope_to)
890 {
891 BOOL first = TRUE;
892 address_item *p;
893 struct aci *plist = NULL;
894 struct aci *dlist = NULL;
895 void *reset_point = store_get(0);
896
897 if (!write_chunk(fd, tctx, US"Envelope-to: ", 13)) return FALSE;
898
899 /* Pick up from all the addresses. The plist and dlist variables are
900 anchors for lists of addresses already handled; they have to be defined at
901 this level becuase write_env_to() calls itself recursively. */
902
903 for (p = tctx->addr; p; p = p->next)
904 if (!write_env_to(p, &plist, &dlist, &first, fd, tctx))
905 return FALSE;
906
907 /* Add a final newline and reset the store used for tracking duplicates */
908
909 if (!write_chunk(fd, tctx, US"\n", 1)) return FALSE;
910 store_reset(reset_point);
911 }
912
913 /* Add delivery-date: if requested. */
914
915 if (tctx->options & topt_add_delivery_date)
916 {
917 uschar buffer[100];
918 int n = sprintf(CS buffer, "Delivery-date: %s\n", tod_stamp(tod_full));
919 if (!write_chunk(fd, tctx, buffer, n)) return FALSE;
920 }
921
922 /* Then the message's headers. Don't write any that are flagged as "old";
923 that means they were rewritten, or are a record of envelope rewriting, or
924 were removed (e.g. Bcc). If remove_headers is not null, skip any headers that
925 match any entries therein. Then check addr->prop.remove_headers too, provided that
926 addr is not NULL. */
927
928 if (!transport_headers_send(fd, tctx, &write_chunk))
929 return FALSE;
930 }
931
932/* When doing RFC3030 CHUNKING output, work out how much data would be in a
933last-BDAT, consisting of the current write_chunk() output buffer fill
934(optimally, all of the headers - but it does not matter if we already had to
935flush that buffer with non-last BDAT prependix) plus the amount of body data
936(as expanded for CRLF lines). Then create and write BDAT(s), and ensure
937that further use of write_chunk() will not prepend BDATs.
938The first BDAT written will also first flush any outstanding MAIL and RCPT
939commands which were buffered thans to PIPELINING.
940Commands go out (using a send()) from a different buffer to data (using a
941write()). They might not end up in the same TCP segment, which is
942suboptimal. */
943
944if (tctx->options & topt_use_bdat)
945 {
946 off_t fsize;
947 int hsize, size;
948
949 if ((hsize = chunk_ptr - deliver_out_buffer) < 0)
950 hsize = 0;
951 if (!(tctx->options & topt_no_body))
952 {
953 if ((fsize = lseek(deliver_datafile, 0, SEEK_END)) < 0) return FALSE;
954 fsize -= SPOOL_DATA_START_OFFSET;
955 if (size_limit > 0 && fsize > size_limit)
956 fsize = size_limit;
957 size = hsize + fsize;
958 if (tctx->options & topt_use_crlf)
959 size += body_linecount; /* account for CRLF-expansion */
960 }
961
962 /* If the message is large, emit first a non-LAST chunk with just the
963 headers, and reap the command responses. This lets us error out early
964 on RCPT rejects rather than sending megabytes of data. Include headers
965 on the assumption they are cheap enough and some clever implementations
966 might errorcheck them too, on-the-fly, and reject that chunk. */
967
968 if (size > DELIVER_OUT_BUFFER_SIZE && hsize > 0)
969 {
970 DEBUG(D_transport)
971 debug_printf("sending small initial BDAT; hssize=%d\n", hsize);
972 if ( tctx->chunk_cb(fd, tctx, hsize, 0) != OK
973 || !transport_write_block(fd, deliver_out_buffer, hsize)
974 || tctx->chunk_cb(fd, tctx, 0, tc_reap_prev) != OK
975 )
976 return FALSE;
977 chunk_ptr = deliver_out_buffer;
978 size -= hsize;
979 }
980
981 /* Emit a LAST datachunk command. */
982
983 if (tctx->chunk_cb(fd, tctx, size, tc_chunk_last) != OK)
984 return FALSE;
985
986 tctx->options &= ~topt_use_bdat;
987 }
988
989/* If the body is required, ensure that the data for check strings (formerly
990the "from hack") is enabled by negating the length if necessary. (It will be
991negative in cases where it isn't to apply to the headers). Then ensure the body
992is positioned at the start of its file (following the message id), then write
993it, applying the size limit if required. */
994
995if (!(tctx->options & topt_no_body))
996 {
997 int size = size_limit;
998
999 nl_check_length = abs(nl_check_length);
1000 nl_partial_match = 0;
1001 if (lseek(deliver_datafile, SPOOL_DATA_START_OFFSET, SEEK_SET) < 0)
1002 return FALSE;
1003 while ( (len = MAX(DELIVER_IN_BUFFER_SIZE, size)) > 0
1004 && (len = read(deliver_datafile, deliver_in_buffer, len)) > 0)
1005 {
1006 if (!write_chunk(fd, tctx, deliver_in_buffer, len))
1007 return FALSE;
1008 size -= len;
1009 }
1010
1011 /* A read error on the body will have left len == -1 and errno set. */
1012
1013 if (len != 0) return FALSE;
1014 }
1015
1016/* Finished with the check string */
1017
1018nl_check_length = nl_escape_length = 0;
1019
1020/* If requested, add a terminating "." line (SMTP output). */
1021
1022if (tctx->options & topt_end_dot && !write_chunk(fd, tctx, US".\n", 2))
1023 return FALSE;
1024
1025/* Write out any remaining data in the buffer before returning. */
1026
1027return (len = chunk_ptr - deliver_out_buffer) <= 0 ||
1028 transport_write_block(fd, deliver_out_buffer, len);
1029}
1030
1031
1032#ifndef DISABLE_DKIM
1033
1034/***************************************************************************************************
1035* External interface to write the message, while signing it with DKIM and/or Domainkeys *
1036***************************************************************************************************/
1037
1038/* This function is a wrapper around transport_write_message().
1039 It is only called from the smtp transport if DKIM or Domainkeys support
1040 is compiled in. The function sets up a replacement fd into a -K file,
1041 then calls the normal function. This way, the exact bits that exim would
1042 have put "on the wire" will end up in the file (except for TLS
1043 encapsulation, which is the very very last thing). When we are done
1044 signing the file, send the signed message down the original fd (or TLS fd).
1045
1046Arguments:
1047 as for internal_transport_write_message() above, with additional arguments
1048 for DKIM.
1049
1050Returns: TRUE on success; FALSE (with errno) for any failure
1051*/
1052
1053BOOL
1054dkim_transport_write_message(int out_fd, transport_ctx * tctx,
1055 struct ob_dkim * dkim)
1056{
1057int dkim_fd;
1058int save_errno = 0;
1059BOOL rc;
1060uschar * dkim_spool_name;
1061int sread = 0;
1062int wwritten = 0;
1063uschar *dkim_signature = NULL;
1064int siglen = 0;
1065off_t k_file_size;
1066int options;
1067
1068/* If we can't sign, just call the original function. */
1069
1070if (!(dkim->dkim_private_key && dkim->dkim_domain && dkim->dkim_selector))
1071 return transport_write_message(out_fd, tctx, 0);
1072
1073dkim_spool_name = spool_fname(US"input", message_subdir, message_id,
1074 string_sprintf("-%d-K", (int)getpid()));
1075
1076if ((dkim_fd = Uopen(dkim_spool_name, O_RDWR|O_CREAT|O_TRUNC, SPOOL_MODE)) < 0)
1077 {
1078 /* Can't create spool file. Ugh. */
1079 rc = FALSE;
1080 save_errno = errno;
1081 goto CLEANUP;
1082 }
1083
1084/* Call original function to write the -K file; does the CRLF expansion
1085(but, in the CHUNKING case, not dot-stuffing and dot-termination). */
1086
1087options = tctx->options;
1088tctx->options &= ~topt_use_bdat;
1089rc = transport_write_message(dkim_fd, tctx, 0);
1090tctx->options = options;
1091
1092/* Save error state. We must clean up before returning. */
1093if (!rc)
1094 {
1095 save_errno = errno;
1096 goto CLEANUP;
1097 }
1098
1099/* Rewind file and feed it to the goats^W DKIM lib */
1100dkim->dot_stuffed = !!(options & topt_end_dot);
1101lseek(dkim_fd, 0, SEEK_SET);
1102if ((dkim_signature = dkim_exim_sign(dkim_fd, dkim)))
1103 siglen = Ustrlen(dkim_signature);
1104else if (dkim->dkim_strict)
1105 {
1106 uschar *dkim_strict_result = expand_string(dkim->dkim_strict);
1107 if (dkim_strict_result)
1108 if ( (strcmpic(dkim->dkim_strict,US"1") == 0) ||
1109 (strcmpic(dkim->dkim_strict,US"true") == 0) )
1110 {
1111 /* Set errno to something halfway meaningful */
1112 save_errno = EACCES;
1113 log_write(0, LOG_MAIN, "DKIM: message could not be signed,"
1114 " and dkim_strict is set. Deferring message delivery.");
1115 rc = FALSE;
1116 goto CLEANUP;
1117 }
1118 }
1119
1120#ifndef HAVE_LINUX_SENDFILE
1121if (options & topt_use_bdat)
1122#endif
1123 k_file_size = lseek(dkim_fd, 0, SEEK_END); /* Fetch file size */
1124
1125if (options & topt_use_bdat)
1126 {
1127
1128 /* On big messages output a precursor chunk to get any pipelined
1129 MAIL & RCPT commands flushed, then reap the responses so we can
1130 error out on RCPT rejects before sending megabytes. */
1131
1132 if (siglen + k_file_size > DELIVER_OUT_BUFFER_SIZE && siglen > 0)
1133 {
1134 if ( tctx->chunk_cb(out_fd, tctx, siglen, 0) != OK
1135 || !transport_write_block(out_fd, dkim_signature, siglen)
1136 || tctx->chunk_cb(out_fd, tctx, 0, tc_reap_prev) != OK
1137 )
1138 goto err;
1139 siglen = 0;
1140 }
1141
1142 if (tctx->chunk_cb(out_fd, tctx, siglen + k_file_size, tc_chunk_last) != OK)
1143 goto err;
1144 }
1145
1146if(siglen > 0 && !transport_write_block(out_fd, dkim_signature, siglen))
1147 goto err;
1148
1149#ifdef HAVE_LINUX_SENDFILE
1150/* We can use sendfile() to shove the file contents
1151 to the socket. However only if we don't use TLS,
1152 as then there's another layer of indirection
1153 before the data finally hits the socket. */
1154if (tls_out.active != out_fd)
1155 {
1156 ssize_t copied = 0;
1157 off_t offset = 0;
1158
1159 /* Rewind file */
1160 lseek(dkim_fd, 0, SEEK_SET);
1161
1162 while(copied >= 0 && offset < k_file_size)
1163 copied = sendfile(out_fd, dkim_fd, &offset, k_file_size - offset);
1164 if (copied < 0)
1165 goto err;
1166 }
1167else
1168
1169#endif
1170
1171 {
1172 /* Rewind file */
1173 lseek(dkim_fd, 0, SEEK_SET);
1174
1175 /* Send file down the original fd */
1176 while((sread = read(dkim_fd, deliver_out_buffer, DELIVER_OUT_BUFFER_SIZE)) >0)
1177 {
1178 char *p = deliver_out_buffer;
1179 /* write the chunk */
1180
1181 while (sread)
1182 {
1183#ifdef SUPPORT_TLS
1184 wwritten = tls_out.active == out_fd
1185 ? tls_write(FALSE, US p, sread)
1186 : write(out_fd, p, sread);
1187#else
1188 wwritten = write(out_fd, p, sread);
1189#endif
1190 if (wwritten == -1)
1191 goto err;
1192 p += wwritten;
1193 sread -= wwritten;
1194 }
1195 }
1196
1197 if (sread == -1)
1198 {
1199 save_errno = errno;
1200 rc = FALSE;
1201 }
1202 }
1203
1204CLEANUP:
1205 /* unlink -K file */
1206 (void)close(dkim_fd);
1207 Uunlink(dkim_spool_name);
1208 errno = save_errno;
1209 return rc;
1210
1211err:
1212 save_errno = errno;
1213 rc = FALSE;
1214 goto CLEANUP;
1215}
1216
1217#endif
1218
1219
1220
1221/*************************************************
1222* External interface to write the message *
1223*************************************************/
1224
1225/* If there is no filtering required, call the internal function above to do
1226the real work, passing over all the arguments from this function. Otherwise,
1227set up a filtering process, fork another process to call the internal function
1228to write to the filter, and in this process just suck from the filter and write
1229down the given fd. At the end, tidy up the pipes and the processes.
1230
1231XXX
1232Arguments: as for internal_transport_write_message() above
1233
1234Returns: TRUE on success; FALSE (with errno) for any failure
1235 transport_count is incremented by the number of bytes written
1236*/
1237
1238BOOL
1239transport_write_message(int fd, transport_ctx * tctx, int size_limit)
1240{
1241unsigned wck_flags;
1242BOOL last_filter_was_NL = TRUE;
1243int rc, len, yield, fd_read, fd_write, save_errno;
1244int pfd[2] = {-1, -1};
1245pid_t filter_pid, write_pid;
1246static transport_ctx dummy_tctx = {0};
1247
1248if (!tctx) tctx = &dummy_tctx;
1249
1250transport_filter_timed_out = FALSE;
1251
1252/* If there is no filter command set up, call the internal function that does
1253the actual work, passing it the incoming fd, and return its result. */
1254
1255if ( !transport_filter_argv
1256 || !*transport_filter_argv
1257 || !**transport_filter_argv
1258 )
1259 return internal_transport_write_message(fd, tctx, size_limit);
1260
1261/* Otherwise the message must be written to a filter process and read back
1262before being written to the incoming fd. First set up the special processing to
1263be done during the copying. */
1264
1265wck_flags = tctx->options & topt_use_crlf;
1266nl_partial_match = -1;
1267
1268if (tctx->check_string && tctx->escape_string)
1269 {
1270 nl_check = tctx->check_string;
1271 nl_check_length = Ustrlen(nl_check);
1272 nl_escape = tctx->escape_string;
1273 nl_escape_length = Ustrlen(nl_escape);
1274 }
1275else nl_check_length = nl_escape_length = 0;
1276
1277/* Start up a subprocess to run the command. Ensure that our main fd will
1278be closed when the subprocess execs, but remove the flag afterwards.
1279(Otherwise, if this is a TCP/IP socket, it can't get passed on to another
1280process to deliver another message.) We get back stdin/stdout file descriptors.
1281If the process creation failed, give an error return. */
1282
1283fd_read = -1;
1284fd_write = -1;
1285save_errno = 0;
1286yield = FALSE;
1287write_pid = (pid_t)(-1);
1288
1289(void)fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) | FD_CLOEXEC);
1290filter_pid = child_open(USS transport_filter_argv, NULL, 077,
1291 &fd_write, &fd_read, FALSE);
1292(void)fcntl(fd, F_SETFD, fcntl(fd, F_GETFD) & ~FD_CLOEXEC);
1293if (filter_pid < 0) goto TIDY_UP; /* errno set */
1294
1295DEBUG(D_transport)
1296 debug_printf("process %d running as transport filter: fd_write=%d fd_read=%d\n",
1297 (int)filter_pid, fd_write, fd_read);
1298
1299/* Fork subprocess to write the message to the filter, and return the result
1300via a(nother) pipe. While writing to the filter, we do not do the CRLF,
1301smtp dots, or check string processing. */
1302
1303if (pipe(pfd) != 0) goto TIDY_UP; /* errno set */
1304if ((write_pid = fork()) == 0)
1305 {
1306 BOOL rc;
1307 (void)close(fd_read);
1308 (void)close(pfd[pipe_read]);
1309 nl_check_length = nl_escape_length = 0;
1310
1311 tctx->check_string = tctx->escape_string = NULL;
1312 tctx->options &= ~(topt_use_crlf | topt_end_dot | topt_use_bdat);
1313
1314 rc = internal_transport_write_message(fd_write, tctx, size_limit);
1315
1316 save_errno = errno;
1317 if ( write(pfd[pipe_write], (void *)&rc, sizeof(BOOL))
1318 != sizeof(BOOL)
1319 || write(pfd[pipe_write], (void *)&save_errno, sizeof(int))
1320 != sizeof(int)
1321 || write(pfd[pipe_write], (void *)&tctx->addr->more_errno, sizeof(int))
1322 != sizeof(int)
1323 )
1324 rc = FALSE; /* compiler quietening */
1325 _exit(0);
1326 }
1327save_errno = errno;
1328
1329/* Parent process: close our copy of the writing subprocess' pipes. */
1330
1331(void)close(pfd[pipe_write]);
1332(void)close(fd_write);
1333fd_write = -1;
1334
1335/* Writing process creation failed */
1336
1337if (write_pid < 0)
1338 {
1339 errno = save_errno; /* restore */
1340 goto TIDY_UP;
1341 }
1342
1343/* When testing, let the subprocess get going */
1344
1345if (running_in_test_harness) millisleep(250);
1346
1347DEBUG(D_transport)
1348 debug_printf("process %d writing to transport filter\n", (int)write_pid);
1349
1350/* Copy the message from the filter to the output fd. A read error leaves len
1351== -1 and errno set. We need to apply a timeout to the read, to cope with
1352the case when the filter gets stuck, but it can be quite a long one. The
1353default is 5m, but this is now configurable. */
1354
1355DEBUG(D_transport) debug_printf("copying from the filter\n");
1356
1357/* Copy the output of the filter, remembering if the last character was NL. If
1358no data is returned, that counts as "ended with NL" (default setting of the
1359variable is TRUE). */
1360
1361chunk_ptr = deliver_out_buffer;
1362
1363for (;;)
1364 {
1365 sigalrm_seen = FALSE;
1366 alarm(transport_filter_timeout);
1367 len = read(fd_read, deliver_in_buffer, DELIVER_IN_BUFFER_SIZE);
1368 alarm(0);
1369 if (sigalrm_seen)
1370 {
1371 errno = ETIMEDOUT;
1372 transport_filter_timed_out = TRUE;
1373 goto TIDY_UP;
1374 }
1375
1376 /* If the read was successful, write the block down the original fd,
1377 remembering whether it ends in \n or not. */
1378
1379 if (len > 0)
1380 {
1381 if (!write_chunk(fd, tctx, deliver_in_buffer, len)) goto TIDY_UP;
1382 last_filter_was_NL = (deliver_in_buffer[len-1] == '\n');
1383 }
1384
1385 /* Otherwise, break the loop. If we have hit EOF, set yield = TRUE. */
1386
1387 else
1388 {
1389 if (len == 0) yield = TRUE;
1390 break;
1391 }
1392 }
1393
1394/* Tidying up code. If yield = FALSE there has been an error and errno is set
1395to something. Ensure the pipes are all closed and the processes are removed. If
1396there has been an error, kill the processes before waiting for them, just to be
1397sure. Also apply a paranoia timeout. */
1398
1399TIDY_UP:
1400save_errno = errno;
1401
1402(void)close(fd_read);
1403if (fd_write > 0) (void)close(fd_write);
1404
1405if (!yield)
1406 {
1407 if (filter_pid > 0) kill(filter_pid, SIGKILL);
1408 if (write_pid > 0) kill(write_pid, SIGKILL);
1409 }
1410
1411/* Wait for the filter process to complete. */
1412
1413DEBUG(D_transport) debug_printf("waiting for filter process\n");
1414if (filter_pid > 0 && (rc = child_close(filter_pid, 30)) != 0 && yield)
1415 {
1416 yield = FALSE;
1417 save_errno = ERRNO_FILTER_FAIL;
1418 tctx->addr->more_errno = rc;
1419 DEBUG(D_transport) debug_printf("filter process returned %d\n", rc);
1420 }
1421
1422/* Wait for the writing process to complete. If it ends successfully,
1423read the results from its pipe, provided we haven't already had a filter
1424process failure. */
1425
1426DEBUG(D_transport) debug_printf("waiting for writing process\n");
1427if (write_pid > 0)
1428 {
1429 rc = child_close(write_pid, 30);
1430 if (yield)
1431 {
1432 if (rc == 0)
1433 {
1434 BOOL ok;
1435 int dummy = read(pfd[pipe_read], (void *)&ok, sizeof(BOOL));
1436 if (!ok)
1437 {
1438 dummy = read(pfd[pipe_read], (void *)&save_errno, sizeof(int));
1439 dummy = read(pfd[pipe_read], (void *)&(tctx->addr->more_errno), sizeof(int));
1440 yield = FALSE;
1441 }
1442 }
1443 else
1444 {
1445 yield = FALSE;
1446 save_errno = ERRNO_FILTER_FAIL;
1447 tctx->addr->more_errno = rc;
1448 DEBUG(D_transport) debug_printf("writing process returned %d\n", rc);
1449 }
1450 }
1451 }
1452(void)close(pfd[pipe_read]);
1453
1454/* If there have been no problems we can now add the terminating "." if this is
1455SMTP output, turning off escaping beforehand. If the last character from the
1456filter was not NL, insert a NL to make the SMTP protocol work. */
1457
1458if (yield)
1459 {
1460 nl_check_length = nl_escape_length = 0;
1461 if ( tctx->options & topt_end_dot
1462 && ( last_filter_was_NL
1463 ? !write_chunk(fd, tctx, US".\n", 2)
1464 : !write_chunk(fd, tctx, US"\n.\n", 3)
1465 ) )
1466 yield = FALSE;
1467
1468 /* Write out any remaining data in the buffer. */
1469
1470 else
1471 yield = (len = chunk_ptr - deliver_out_buffer) <= 0
1472 || transport_write_block(fd, deliver_out_buffer, len);
1473 }
1474else
1475 errno = save_errno; /* From some earlier error */
1476
1477DEBUG(D_transport)
1478 {
1479 debug_printf("end of filtering transport writing: yield=%d\n", yield);
1480 if (!yield)
1481 debug_printf("errno=%d more_errno=%d\n", errno, tctx->addr->more_errno);
1482 }
1483
1484return yield;
1485}
1486
1487
1488
1489
1490
1491/*************************************************
1492* Update waiting database *
1493*************************************************/
1494
1495/* This is called when an address is deferred by remote transports that are
1496capable of sending more than one message over one connection. A database is
1497maintained for each transport, keeping track of which messages are waiting for
1498which hosts. The transport can then consult this when eventually a successful
1499delivery happens, and if it finds that another message is waiting for the same
1500host, it can fire up a new process to deal with it using the same connection.
1501
1502The database records are keyed by host name. They can get full if there are
1503lots of messages waiting, and so there is a continuation mechanism for them.
1504
1505Each record contains a list of message ids, packed end to end without any
1506zeros. Each one is MESSAGE_ID_LENGTH bytes long. The count field says how many
1507in this record, and the sequence field says if there are any other records for
1508this host. If the sequence field is 0, there are none. If it is 1, then another
1509record with the name <hostname>:0 exists; if it is 2, then two other records
1510with sequence numbers 0 and 1 exist, and so on.
1511
1512Currently, an exhaustive search of all continuation records has to be done to
1513determine whether to add a message id to a given record. This shouldn't be
1514too bad except in extreme cases. I can't figure out a *simple* way of doing
1515better.
1516
1517Old records should eventually get swept up by the exim_tidydb utility.
1518
1519Arguments:
1520 hostlist list of hosts that this message could be sent to
1521 tpname name of the transport
1522
1523Returns: nothing
1524*/
1525
1526void
1527transport_update_waiting(host_item *hostlist, uschar *tpname)
1528{
1529uschar buffer[256];
1530const uschar *prevname = US"";
1531host_item *host;
1532open_db dbblock;
1533open_db *dbm_file;
1534
1535DEBUG(D_transport) debug_printf("updating wait-%s database\n", tpname);
1536
1537/* Open the database for this transport */
1538
1539sprintf(CS buffer, "wait-%.200s", tpname);
1540dbm_file = dbfn_open(buffer, O_RDWR, &dbblock, TRUE);
1541if (dbm_file == NULL) return;
1542
1543/* Scan the list of hosts for which this message is waiting, and ensure
1544that the message id is in each host record. */
1545
1546for (host = hostlist; host!= NULL; host = host->next)
1547 {
1548 BOOL already = FALSE;
1549 dbdata_wait *host_record;
1550 uschar *s;
1551 int i, host_length;
1552
1553 /* Skip if this is the same host as we just processed; otherwise remember
1554 the name for next time. */
1555
1556 if (Ustrcmp(prevname, host->name) == 0) continue;
1557 prevname = host->name;
1558
1559 /* Look up the host record; if there isn't one, make an empty one. */
1560
1561 host_record = dbfn_read(dbm_file, host->name);
1562 if (host_record == NULL)
1563 {
1564 host_record = store_get(sizeof(dbdata_wait) + MESSAGE_ID_LENGTH);
1565 host_record->count = host_record->sequence = 0;
1566 }
1567
1568 /* Compute the current length */
1569
1570 host_length = host_record->count * MESSAGE_ID_LENGTH;
1571
1572 /* Search the record to see if the current message is already in it. */
1573
1574 for (s = host_record->text; s < host_record->text + host_length;
1575 s += MESSAGE_ID_LENGTH)
1576 {
1577 if (Ustrncmp(s, message_id, MESSAGE_ID_LENGTH) == 0)
1578 { already = TRUE; break; }
1579 }
1580
1581 /* If we haven't found this message in the main record, search any
1582 continuation records that exist. */
1583
1584 for (i = host_record->sequence - 1; i >= 0 && !already; i--)
1585 {
1586 dbdata_wait *cont;
1587 sprintf(CS buffer, "%.200s:%d", host->name, i);
1588 cont = dbfn_read(dbm_file, buffer);
1589 if (cont != NULL)
1590 {
1591 int clen = cont->count * MESSAGE_ID_LENGTH;
1592 for (s = cont->text; s < cont->text + clen; s += MESSAGE_ID_LENGTH)
1593 {
1594 if (Ustrncmp(s, message_id, MESSAGE_ID_LENGTH) == 0)
1595 { already = TRUE; break; }
1596 }
1597 }
1598 }
1599
1600 /* If this message is already in a record, no need to update. */
1601
1602 if (already)
1603 {
1604 DEBUG(D_transport) debug_printf("already listed for %s\n", host->name);
1605 continue;
1606 }
1607
1608
1609 /* If this record is full, write it out with a new name constructed
1610 from the sequence number, increase the sequence number, and empty
1611 the record. */
1612
1613 if (host_record->count >= WAIT_NAME_MAX)
1614 {
1615 sprintf(CS buffer, "%.200s:%d", host->name, host_record->sequence);
1616 dbfn_write(dbm_file, buffer, host_record, sizeof(dbdata_wait) + host_length);
1617 host_record->sequence++;
1618 host_record->count = 0;
1619 host_length = 0;
1620 }
1621
1622 /* If this record is not full, increase the size of the record to
1623 allow for one new message id. */
1624
1625 else
1626 {
1627 dbdata_wait *newr =
1628 store_get(sizeof(dbdata_wait) + host_length + MESSAGE_ID_LENGTH);
1629 memcpy(newr, host_record, sizeof(dbdata_wait) + host_length);
1630 host_record = newr;
1631 }
1632
1633 /* Now add the new name on the end */
1634
1635 memcpy(host_record->text + host_length, message_id, MESSAGE_ID_LENGTH);
1636 host_record->count++;
1637 host_length += MESSAGE_ID_LENGTH;
1638
1639 /* Update the database */
1640
1641 dbfn_write(dbm_file, host->name, host_record, sizeof(dbdata_wait) + host_length);
1642 DEBUG(D_transport) debug_printf("added to list for %s\n", host->name);
1643 }
1644
1645/* All now done */
1646
1647dbfn_close(dbm_file);
1648}
1649
1650
1651
1652
1653/*************************************************
1654* Test for waiting messages *
1655*************************************************/
1656
1657/* This function is called by a remote transport which uses the previous
1658function to remember which messages are waiting for which remote hosts. It's
1659called after a successful delivery and its job is to check whether there is
1660another message waiting for the same host. However, it doesn't do this if the
1661current continue sequence is greater than the maximum supplied as an argument,
1662or greater than the global connection_max_messages, which, if set, overrides.
1663
1664Arguments:
1665 transport_name name of the transport
1666 hostname name of the host
1667 local_message_max maximum number of messages down one connection
1668 as set by the caller transport
1669 new_message_id set to the message id of a waiting message
1670 more set TRUE if there are yet more messages waiting
1671 oicf_func function to call to validate if it is ok to send
1672 to this message_id from the current instance.
1673 oicf_data opaque data for oicf_func
1674
1675Returns: TRUE if new_message_id set; FALSE otherwise
1676*/
1677
1678typedef struct msgq_s
1679{
1680 uschar message_id [MESSAGE_ID_LENGTH + 1];
1681 BOOL bKeep;
1682} msgq_t;
1683
1684BOOL
1685transport_check_waiting(const uschar *transport_name, const uschar *hostname,
1686 int local_message_max, uschar *new_message_id, BOOL *more, oicf oicf_func, void *oicf_data)
1687{
1688dbdata_wait *host_record;
1689int host_length;
1690open_db dbblock;
1691open_db *dbm_file;
1692uschar buffer[256];
1693
1694int i;
1695struct stat statbuf;
1696
1697*more = FALSE;
1698
1699DEBUG(D_transport)
1700 {
1701 debug_printf("transport_check_waiting entered\n");
1702 debug_printf(" sequence=%d local_max=%d global_max=%d\n",
1703 continue_sequence, local_message_max, connection_max_messages);
1704 }
1705
1706/* Do nothing if we have hit the maximum number that can be send down one
1707connection. */
1708
1709if (connection_max_messages >= 0) local_message_max = connection_max_messages;
1710if (local_message_max > 0 && continue_sequence >= local_message_max)
1711 {
1712 DEBUG(D_transport)
1713 debug_printf("max messages for one connection reached: returning\n");
1714 return FALSE;
1715 }
1716
1717/* Open the waiting information database. */
1718
1719sprintf(CS buffer, "wait-%.200s", transport_name);
1720dbm_file = dbfn_open(buffer, O_RDWR, &dbblock, TRUE);
1721if (dbm_file == NULL) return FALSE;
1722
1723/* See if there is a record for this host; if not, there's nothing to do. */
1724
1725if (!(host_record = dbfn_read(dbm_file, hostname)))
1726 {
1727 dbfn_close(dbm_file);
1728 DEBUG(D_transport) debug_printf("no messages waiting for %s\n", hostname);
1729 return FALSE;
1730 }
1731
1732/* If the data in the record looks corrupt, just log something and
1733don't try to use it. */
1734
1735if (host_record->count > WAIT_NAME_MAX)
1736 {
1737 dbfn_close(dbm_file);
1738 log_write(0, LOG_MAIN|LOG_PANIC, "smtp-wait database entry for %s has bad "
1739 "count=%d (max=%d)", hostname, host_record->count, WAIT_NAME_MAX);
1740 return FALSE;
1741 }
1742
1743/* Scan the message ids in the record from the end towards the beginning,
1744until one is found for which a spool file actually exists. If the record gets
1745emptied, delete it and continue with any continuation records that may exist.
1746*/
1747
1748/* For Bug 1141, I refactored this major portion of the routine, it is risky
1749but the 1 off will remain without it. This code now allows me to SKIP over
1750a message I do not want to send out on this run. */
1751
1752host_length = host_record->count * MESSAGE_ID_LENGTH;
1753
1754while (1)
1755 {
1756 msgq_t *msgq;
1757 int msgq_count = 0;
1758 int msgq_actual = 0;
1759 BOOL bFound = FALSE;
1760 BOOL bContinuation = FALSE;
1761
1762 /* create an array to read entire message queue into memory for processing */
1763
1764 msgq = (msgq_t*) malloc(sizeof(msgq_t) * host_record->count);
1765 msgq_count = host_record->count;
1766 msgq_actual = msgq_count;
1767
1768 for (i = 0; i < host_record->count; ++i)
1769 {
1770 msgq[i].bKeep = TRUE;
1771
1772 Ustrncpy(msgq[i].message_id, host_record->text + (i * MESSAGE_ID_LENGTH),
1773 MESSAGE_ID_LENGTH);
1774 msgq[i].message_id[MESSAGE_ID_LENGTH] = 0;
1775 }
1776
1777 /* first thing remove current message id if it exists */
1778
1779 for (i = 0; i < msgq_count; ++i)
1780 if (Ustrcmp(msgq[i].message_id, message_id) == 0)
1781 {
1782 msgq[i].bKeep = FALSE;
1783 break;
1784 }
1785
1786 /* now find the next acceptable message_id */
1787
1788 for (i = msgq_count - 1; i >= 0; --i) if (msgq[i].bKeep)
1789 {
1790 uschar subdir[2];
1791
1792 subdir[0] = split_spool_directory ? msgq[i].message_id[5] : 0;
1793 subdir[1] = 0;
1794
1795 if (Ustat(spool_fname(US"input", subdir, msgq[i].message_id, US"-D"),
1796 &statbuf) != 0)
1797 msgq[i].bKeep = FALSE;
1798 else if (!oicf_func || oicf_func(msgq[i].message_id, oicf_data))
1799 {
1800 Ustrcpy(new_message_id, msgq[i].message_id);
1801 msgq[i].bKeep = FALSE;
1802 bFound = TRUE;
1803 break;
1804 }
1805 }
1806
1807 /* re-count */
1808 for (msgq_actual = 0, i = 0; i < msgq_count; ++i)
1809 if (msgq[i].bKeep)
1810 msgq_actual++;
1811
1812 /* reassemble the host record, based on removed message ids, from in
1813 memory queue */
1814
1815 if (msgq_actual <= 0)
1816 {
1817 host_length = 0;
1818 host_record->count = 0;
1819 }
1820 else
1821 {
1822 host_length = msgq_actual * MESSAGE_ID_LENGTH;
1823 host_record->count = msgq_actual;
1824
1825 if (msgq_actual < msgq_count)
1826 {
1827 int new_count;
1828 for (new_count = 0, i = 0; i < msgq_count; ++i)
1829 if (msgq[i].bKeep)
1830 Ustrncpy(&host_record->text[new_count++ * MESSAGE_ID_LENGTH],
1831 msgq[i].message_id, MESSAGE_ID_LENGTH);
1832
1833 host_record->text[new_count * MESSAGE_ID_LENGTH] = 0;
1834 }
1835 }
1836
1837/* Jeremy: check for a continuation record, this code I do not know how to
1838test but the code should work */
1839
1840 while (host_length <= 0)
1841 {
1842 int i;
1843 dbdata_wait * newr = NULL;
1844
1845 /* Search for a continuation */
1846
1847 for (i = host_record->sequence - 1; i >= 0 && !newr; i--)
1848 {
1849 sprintf(CS buffer, "%.200s:%d", hostname, i);
1850 newr = dbfn_read(dbm_file, buffer);
1851 }
1852
1853 /* If no continuation, delete the current and break the loop */
1854
1855 if (!newr)
1856 {
1857 dbfn_delete(dbm_file, hostname);
1858 break;
1859 }
1860
1861 /* Else replace the current with the continuation */
1862
1863 dbfn_delete(dbm_file, buffer);
1864 host_record = newr;
1865 host_length = host_record->count * MESSAGE_ID_LENGTH;
1866
1867 bContinuation = TRUE;
1868 }
1869
1870 if (bFound) /* Usual exit from main loop */
1871 {
1872 free (msgq);
1873 break;
1874 }
1875
1876 /* If host_length <= 0 we have emptied a record and not found a good message,
1877 and there are no continuation records. Otherwise there is a continuation
1878 record to process. */
1879
1880 if (host_length <= 0)
1881 {
1882 dbfn_close(dbm_file);
1883 DEBUG(D_transport) debug_printf("waiting messages already delivered\n");
1884 return FALSE;
1885 }
1886
1887 /* we were not able to find an acceptable message, nor was there a
1888 * continuation record. So bug out, outer logic will clean this up.
1889 */
1890
1891 if (!bContinuation)
1892 {
1893 Ustrcpy(new_message_id, message_id);
1894 dbfn_close(dbm_file);
1895 return FALSE;
1896 }
1897
1898 free(msgq);
1899 } /* we need to process a continuation record */
1900
1901/* Control gets here when an existing message has been encountered; its
1902id is in new_message_id, and host_length is the revised length of the
1903host record. If it is zero, the record has been removed. Update the
1904record if required, close the database, and return TRUE. */
1905
1906if (host_length > 0)
1907 {
1908 host_record->count = host_length/MESSAGE_ID_LENGTH;
1909
1910 dbfn_write(dbm_file, hostname, host_record, (int)sizeof(dbdata_wait) + host_length);
1911 *more = TRUE;
1912 }
1913
1914dbfn_close(dbm_file);
1915return TRUE;
1916}
1917
1918/*************************************************
1919* Deliver waiting message down same socket *
1920*************************************************/
1921
1922/* Fork a new exim process to deliver the message, and do a re-exec, both to
1923get a clean delivery process, and to regain root privilege in cases where it
1924has been given away.
1925
1926Arguments:
1927 transport_name to pass to the new process
1928 hostname ditto
1929 hostaddress ditto
1930 id the new message to process
1931 socket_fd the connected socket
1932
1933Returns: FALSE if fork fails; TRUE otherwise
1934*/
1935
1936BOOL
1937transport_pass_socket(const uschar *transport_name, const uschar *hostname,
1938 const uschar *hostaddress, uschar *id, int socket_fd)
1939{
1940pid_t pid;
1941int status;
1942
1943DEBUG(D_transport) debug_printf("transport_pass_socket entered\n");
1944
1945if ((pid = fork()) == 0)
1946 {
1947 int i = 17;
1948 const uschar **argv;
1949
1950 /* Disconnect entirely from the parent process. If we are running in the
1951 test harness, wait for a bit to allow the previous process time to finish,
1952 write the log, etc., so that the output is always in the same order for
1953 automatic comparison. */
1954
1955 if ((pid = fork()) != 0) _exit(EXIT_SUCCESS);
1956 if (running_in_test_harness) sleep(1);
1957
1958 /* Set up the calling arguments; use the standard function for the basics,
1959 but we have a number of extras that may be added. */
1960
1961 argv = CUSS child_exec_exim(CEE_RETURN_ARGV, TRUE, &i, FALSE, 0);
1962
1963 if (smtp_authenticated) argv[i++] = US"-MCA";
1964
1965 if (smtp_peer_options & PEER_OFFERED_CHUNKING) argv[i++] = US"-MCK";
1966 if (smtp_peer_options & PEER_OFFERED_DSN) argv[i++] = US"-MCD";
1967 if (smtp_peer_options & PEER_OFFERED_PIPE) argv[i++] = US"-MCP";
1968 if (smtp_peer_options & PEER_OFFERED_SIZE) argv[i++] = US"-MCS";
1969#ifdef SUPPORT_TLS
1970 if (smtp_peer_options & PEER_OFFERED_TLS) argv[i++] = US"-MCT";
1971#endif
1972
1973 if (queue_run_pid != (pid_t)0)
1974 {
1975 argv[i++] = US"-MCQ";
1976 argv[i++] = string_sprintf("%d", queue_run_pid);
1977 argv[i++] = string_sprintf("%d", queue_run_pipe);
1978 }
1979
1980 argv[i++] = US"-MC";
1981 argv[i++] = US transport_name;
1982 argv[i++] = US hostname;
1983 argv[i++] = US hostaddress;
1984 argv[i++] = string_sprintf("%d", continue_sequence + 1);
1985 argv[i++] = id;
1986 argv[i++] = NULL;
1987
1988 /* Arrange for the channel to be on stdin. */
1989
1990 if (socket_fd != 0)
1991 {
1992 (void)dup2(socket_fd, 0);
1993 (void)close(socket_fd);
1994 }
1995
1996 DEBUG(D_exec) debug_print_argv(argv);
1997 exim_nullstd(); /* Ensure std{out,err} exist */
1998 execv(CS argv[0], (char *const *)argv);
1999
2000 DEBUG(D_any) debug_printf("execv failed: %s\n", strerror(errno));
2001 _exit(errno); /* Note: must be _exit(), NOT exit() */
2002 }
2003
2004/* If the process creation succeeded, wait for the first-level child, which
2005immediately exits, leaving the second level process entirely disconnected from
2006this one. */
2007
2008if (pid > 0)
2009 {
2010 int rc;
2011 while ((rc = wait(&status)) != pid && (rc >= 0 || errno != ECHILD));
2012 DEBUG(D_transport) debug_printf("transport_pass_socket succeeded\n");
2013 return TRUE;
2014 }
2015else
2016 {
2017 DEBUG(D_transport) debug_printf("transport_pass_socket failed to fork: %s\n",
2018 strerror(errno));
2019 return FALSE;
2020 }
2021}
2022
2023
2024
2025/*************************************************
2026* Set up direct (non-shell) command *
2027*************************************************/
2028
2029/* This function is called when a command line is to be parsed and executed
2030directly, without the use of /bin/sh. It is called by the pipe transport,
2031the queryprogram router, and also from the main delivery code when setting up a
2032transport filter process. The code for ETRN also makes use of this; in that
2033case, no addresses are passed.
2034
2035Arguments:
2036 argvptr pointer to anchor for argv vector
2037 cmd points to the command string (modified IN PLACE)
2038 expand_arguments true if expansion is to occur
2039 expand_failed error value to set if expansion fails; not relevant if
2040 addr == NULL
2041 addr chain of addresses, or NULL
2042 etext text for use in error messages
2043 errptr where to put error message if addr is NULL;
2044 otherwise it is put in the first address
2045
2046Returns: TRUE if all went well; otherwise an error will be
2047 set in the first address and FALSE returned
2048*/
2049
2050BOOL
2051transport_set_up_command(const uschar ***argvptr, uschar *cmd,
2052 BOOL expand_arguments, int expand_failed, address_item *addr,
2053 uschar *etext, uschar **errptr)
2054{
2055address_item *ad;
2056const uschar **argv;
2057uschar *s, *ss;
2058int address_count = 0;
2059int argcount = 0;
2060int i, max_args;
2061
2062/* Get store in which to build an argument list. Count the number of addresses
2063supplied, and allow for that many arguments, plus an additional 60, which
2064should be enough for anybody. Multiple addresses happen only when the local
2065delivery batch option is set. */
2066
2067for (ad = addr; ad != NULL; ad = ad->next) address_count++;
2068max_args = address_count + 60;
2069*argvptr = argv = store_get((max_args+1)*sizeof(uschar *));
2070
2071/* Split the command up into arguments terminated by white space. Lose
2072trailing space at the start and end. Double-quoted arguments can contain \\ and
2073\" escapes and so can be handled by the standard function; single-quoted
2074arguments are verbatim. Copy each argument into a new string. */
2075
2076s = cmd;
2077while (isspace(*s)) s++;
2078
2079while (*s != 0 && argcount < max_args)
2080 {
2081 if (*s == '\'')
2082 {
2083 ss = s + 1;
2084 while (*ss != 0 && *ss != '\'') ss++;
2085 argv[argcount++] = ss = store_get(ss - s++);
2086 while (*s != 0 && *s != '\'') *ss++ = *s++;
2087 if (*s != 0) s++;
2088 *ss++ = 0;
2089 }
2090 else argv[argcount++] = string_copy(string_dequote(CUSS &s));
2091 while (isspace(*s)) s++;
2092 }
2093
2094argv[argcount] = (uschar *)0;
2095
2096/* If *s != 0 we have run out of argument slots. */
2097
2098if (*s != 0)
2099 {
2100 uschar *msg = string_sprintf("Too many arguments in command \"%s\" in "
2101 "%s", cmd, etext);
2102 if (addr != NULL)
2103 {
2104 addr->transport_return = FAIL;
2105 addr->message = msg;
2106 }
2107 else *errptr = msg;
2108 return FALSE;
2109 }
2110
2111/* Expand each individual argument if required. Expansion happens for pipes set
2112up in filter files and with directly-supplied commands. It does not happen if
2113the pipe comes from a traditional .forward file. A failing expansion is a big
2114disaster if the command came from Exim's configuration; if it came from a user
2115it is just a normal failure. The expand_failed value is used as the error value
2116to cater for these two cases.
2117
2118An argument consisting just of the text "$pipe_addresses" is treated specially.
2119It is not passed to the general expansion function. Instead, it is replaced by
2120a number of arguments, one for each address. This avoids problems with shell
2121metacharacters and spaces in addresses.
2122
2123If the parent of the top address has an original part of "system-filter", this
2124pipe was set up by the system filter, and we can permit the expansion of
2125$recipients. */
2126
2127DEBUG(D_transport)
2128 {
2129 debug_printf("direct command:\n");
2130 for (i = 0; argv[i] != (uschar *)0; i++)
2131 debug_printf(" argv[%d] = %s\n", i, string_printing(argv[i]));
2132 }
2133
2134if (expand_arguments)
2135 {
2136 BOOL allow_dollar_recipients = addr != NULL &&
2137 addr->parent != NULL &&
2138 Ustrcmp(addr->parent->address, "system-filter") == 0;
2139
2140 for (i = 0; argv[i] != (uschar *)0; i++)
2141 {
2142
2143 /* Handle special fudge for passing an address list */
2144
2145 if (addr != NULL &&
2146 (Ustrcmp(argv[i], "$pipe_addresses") == 0 ||
2147 Ustrcmp(argv[i], "${pipe_addresses}") == 0))
2148 {
2149 int additional;
2150
2151 if (argcount + address_count - 1 > max_args)
2152 {
2153 addr->transport_return = FAIL;
2154 addr->message = string_sprintf("Too many arguments to command \"%s\" "
2155 "in %s", cmd, etext);
2156 return FALSE;
2157 }
2158
2159 additional = address_count - 1;
2160 if (additional > 0)
2161 memmove(argv + i + 1 + additional, argv + i + 1,
2162 (argcount - i)*sizeof(uschar *));
2163
2164 for (ad = addr; ad != NULL; ad = ad->next) {
2165 argv[i++] = ad->address;
2166 argcount++;
2167 }
2168
2169 /* Subtract one since we replace $pipe_addresses */
2170 argcount--;
2171 i--;
2172 }
2173
2174 /* Handle special case of $address_pipe when af_force_command is set */
2175
2176 else if (addr != NULL && testflag(addr,af_force_command) &&
2177 (Ustrcmp(argv[i], "$address_pipe") == 0 ||
2178 Ustrcmp(argv[i], "${address_pipe}") == 0))
2179 {
2180 int address_pipe_i;
2181 int address_pipe_argcount = 0;
2182 int address_pipe_max_args;
2183 uschar **address_pipe_argv;
2184
2185 /* We can never have more then the argv we will be loading into */
2186 address_pipe_max_args = max_args - argcount + 1;
2187
2188 DEBUG(D_transport)
2189 debug_printf("address_pipe_max_args=%d\n", address_pipe_max_args);
2190
2191 /* We allocate an additional for (uschar *)0 */
2192 address_pipe_argv = store_get((address_pipe_max_args+1)*sizeof(uschar *));
2193
2194 /* +1 because addr->local_part[0] == '|' since af_force_command is set */
2195 s = expand_string(addr->local_part + 1);
2196
2197 if (s == NULL || *s == '\0')
2198 {
2199 addr->transport_return = FAIL;
2200 addr->message = string_sprintf("Expansion of \"%s\" "
2201 "from command \"%s\" in %s failed: %s",
2202 (addr->local_part + 1), cmd, etext, expand_string_message);
2203 return FALSE;
2204 }
2205
2206 while (isspace(*s)) s++; /* strip leading space */
2207
2208 while (*s != 0 && address_pipe_argcount < address_pipe_max_args)
2209 {
2210 if (*s == '\'')
2211 {
2212 ss = s + 1;
2213 while (*ss != 0 && *ss != '\'') ss++;
2214 address_pipe_argv[address_pipe_argcount++] = ss = store_get(ss - s++);
2215 while (*s != 0 && *s != '\'') *ss++ = *s++;
2216 if (*s != 0) s++;
2217 *ss++ = 0;
2218 }
2219 else address_pipe_argv[address_pipe_argcount++] =
2220 string_copy(string_dequote(CUSS &s));
2221 while (isspace(*s)) s++; /* strip space after arg */
2222 }
2223
2224 address_pipe_argv[address_pipe_argcount] = (uschar *)0;
2225
2226 /* If *s != 0 we have run out of argument slots. */
2227 if (*s != 0)
2228 {
2229 uschar *msg = string_sprintf("Too many arguments in $address_pipe "
2230 "\"%s\" in %s", addr->local_part + 1, etext);
2231 if (addr != NULL)
2232 {
2233 addr->transport_return = FAIL;
2234 addr->message = msg;
2235 }
2236 else *errptr = msg;
2237 return FALSE;
2238 }
2239
2240 /* address_pipe_argcount - 1
2241 * because we are replacing $address_pipe in the argument list
2242 * with the first thing it expands to */
2243 if (argcount + address_pipe_argcount - 1 > max_args)
2244 {
2245 addr->transport_return = FAIL;
2246 addr->message = string_sprintf("Too many arguments to command "
2247 "\"%s\" after expanding $address_pipe in %s", cmd, etext);
2248 return FALSE;
2249 }
2250
2251 /* If we are not just able to replace the slot that contained
2252 * $address_pipe (address_pipe_argcount == 1)
2253 * We have to move the existing argv by address_pipe_argcount - 1
2254 * Visually if address_pipe_argcount == 2:
2255 * [argv 0][argv 1][argv 2($address_pipe)][argv 3][0]
2256 * [argv 0][argv 1][ap_arg0][ap_arg1][old argv 3][0]
2257 */
2258 if (address_pipe_argcount > 1)
2259 memmove(
2260 /* current position + additonal args */
2261 argv + i + address_pipe_argcount,
2262 /* current position + 1 (for the (uschar *)0 at the end) */
2263 argv + i + 1,
2264 /* -1 for the (uschar *)0 at the end)*/
2265 (argcount - i)*sizeof(uschar *)
2266 );
2267
2268 /* Now we fill in the slots we just moved argv out of
2269 * [argv 0][argv 1][argv 2=pipeargv[0]][argv 3=pipeargv[1]][old argv 3][0]
2270 */
2271 for (address_pipe_i = 0;
2272 address_pipe_argv[address_pipe_i] != (uschar *)0;
2273 address_pipe_i++)
2274 {
2275 argv[i++] = address_pipe_argv[address_pipe_i];
2276 argcount++;
2277 }
2278
2279 /* Subtract one since we replace $address_pipe */
2280 argcount--;
2281 i--;
2282 }
2283
2284 /* Handle normal expansion string */
2285
2286 else
2287 {
2288 const uschar *expanded_arg;
2289 enable_dollar_recipients = allow_dollar_recipients;
2290 expanded_arg = expand_cstring(argv[i]);
2291 enable_dollar_recipients = FALSE;
2292
2293 if (expanded_arg == NULL)
2294 {
2295 uschar *msg = string_sprintf("Expansion of \"%s\" "
2296 "from command \"%s\" in %s failed: %s",
2297 argv[i], cmd, etext, expand_string_message);
2298 if (addr != NULL)
2299 {
2300 addr->transport_return = expand_failed;
2301 addr->message = msg;
2302 }
2303 else *errptr = msg;
2304 return FALSE;
2305 }
2306 argv[i] = expanded_arg;
2307 }
2308 }
2309
2310 DEBUG(D_transport)
2311 {
2312 debug_printf("direct command after expansion:\n");
2313 for (i = 0; argv[i] != (uschar *)0; i++)
2314 debug_printf(" argv[%d] = %s\n", i, string_printing(argv[i]));
2315 }
2316 }
2317
2318return TRUE;
2319}
2320
2321/* vi: aw ai sw=2
2322*/
2323/* End of transport.c */