TLS version reporting. fixes: #745
[exim.git] / src / src / expand.c
CommitLineData
da5dfc3a 1/* $Cambridge: exim/src/src/expand.c,v 1.100 2009/08/31 21:14:50 tom Exp $ */
059ec3d9
PH
2
3/*************************************************
4* Exim - an Internet mail transport agent *
5*************************************************/
6
184e8823 7/* Copyright (c) University of Cambridge 1995 - 2007 */
059ec3d9
PH
8/* See the file NOTICE for conditions of use and distribution. */
9
10
11/* Functions for handling string expansion. */
12
13
14#include "exim.h"
15
96c065cb
PH
16/* Recursively called function */
17
18static uschar *expand_string_internal(uschar *, BOOL, uschar **, BOOL);
19
059ec3d9
PH
20#ifdef STAND_ALONE
21#ifndef SUPPORT_CRYPTEQ
22#define SUPPORT_CRYPTEQ
23#endif
24#endif
25
96c065cb
PH
26#ifdef LOOKUP_LDAP
27#include "lookups/ldap.h"
28#endif
29
059ec3d9
PH
30#ifdef SUPPORT_CRYPTEQ
31#ifdef CRYPT_H
32#include <crypt.h>
33#endif
34#ifndef HAVE_CRYPT16
35extern char* crypt16(char*, char*);
36#endif
37#endif
38
96c065cb
PH
39/* The handling of crypt16() is a mess. I will record below the analysis of the
40mess that was sent to me. We decided, however, to make changing this very low
41priority, because in practice people are moving away from the crypt()
42algorithms nowadays, so it doesn't seem worth it.
43
44<quote>
45There is an algorithm named "crypt16" in Ultrix and Tru64. It crypts
46the first 8 characters of the password using a 20-round version of crypt
47(standard crypt does 25 rounds). It then crypts the next 8 characters,
48or an empty block if the password is less than 9 characters, using a
4920-round version of crypt and the same salt as was used for the first
50block. Charaters after the first 16 are ignored. It always generates
51a 16-byte hash, which is expressed together with the salt as a string
52of 24 base 64 digits. Here are some links to peruse:
53
54 http://cvs.pld.org.pl/pam/pamcrypt/crypt16.c?rev=1.2
55 http://seclists.org/bugtraq/1999/Mar/0076.html
56
57There's a different algorithm named "bigcrypt" in HP-UX, Digital Unix,
58and OSF/1. This is the same as the standard crypt if given a password
59of 8 characters or less. If given more, it first does the same as crypt
60using the first 8 characters, then crypts the next 8 (the 9th to 16th)
61using as salt the first two base 64 digits from the first hash block.
62If the password is more than 16 characters then it crypts the 17th to 24th
63characters using as salt the first two base 64 digits from the second hash
64block. And so on: I've seen references to it cutting off the password at
6540 characters (5 blocks), 80 (10 blocks), or 128 (16 blocks). Some links:
66
67 http://cvs.pld.org.pl/pam/pamcrypt/bigcrypt.c?rev=1.2
68 http://seclists.org/bugtraq/1999/Mar/0109.html
69 http://h30097.www3.hp.com/docs/base_doc/DOCUMENTATION/HTML/AA-Q0R2D-
70 TET1_html/sec.c222.html#no_id_208
71
72Exim has something it calls "crypt16". It will either use a native
73crypt16 or its own implementation. A native crypt16 will presumably
74be the one that I called "crypt16" above. The internal "crypt16"
75function, however, is a two-block-maximum implementation of what I called
76"bigcrypt". The documentation matches the internal code.
77
78I suspect that whoever did the "crypt16" stuff for Exim didn't realise
79that crypt16 and bigcrypt were different things.
80
81Exim uses the LDAP-style scheme identifier "{crypt16}" to refer
82to whatever it is using under that name. This unfortunately sets a
83precedent for using "{crypt16}" to identify two incompatible algorithms
84whose output can't be distinguished. With "{crypt16}" thus rendered
85ambiguous, I suggest you deprecate it and invent two new identifiers
86for the two algorithms.
87
88Both crypt16 and bigcrypt are very poor algorithms, btw. Hashing parts
89of the password separately means they can be cracked separately, so
90the double-length hash only doubles the cracking effort instead of
91squaring it. I recommend salted SHA-1 ({SSHA}), or the Blowfish-based
92bcrypt ({CRYPT}$2a$).
93</quote>
94*/
059ec3d9
PH
95
96
059ec3d9
PH
97
98
99/*************************************************
100* Local statics and tables *
101*************************************************/
102
103/* Table of item names, and corresponding switch numbers. The names must be in
104alphabetical order. */
105
106static uschar *item_table[] = {
1a46a8c5 107 US"dlfunc",
059ec3d9 108 US"extract",
29f89cad 109 US"filter",
059ec3d9
PH
110 US"hash",
111 US"hmac",
112 US"if",
113 US"length",
114 US"lookup",
29f89cad 115 US"map",
059ec3d9 116 US"nhash",
1a46a8c5 117 US"perl",
fffda43a
TK
118 US"prvs",
119 US"prvscheck",
059ec3d9
PH
120 US"readfile",
121 US"readsocket",
29f89cad 122 US"reduce",
059ec3d9
PH
123 US"run",
124 US"sg",
125 US"substr",
126 US"tr" };
127
128enum {
1a46a8c5 129 EITEM_DLFUNC,
059ec3d9 130 EITEM_EXTRACT,
29f89cad 131 EITEM_FILTER,
059ec3d9
PH
132 EITEM_HASH,
133 EITEM_HMAC,
134 EITEM_IF,
135 EITEM_LENGTH,
136 EITEM_LOOKUP,
29f89cad 137 EITEM_MAP,
059ec3d9 138 EITEM_NHASH,
1a46a8c5 139 EITEM_PERL,
fffda43a
TK
140 EITEM_PRVS,
141 EITEM_PRVSCHECK,
059ec3d9
PH
142 EITEM_READFILE,
143 EITEM_READSOCK,
29f89cad 144 EITEM_REDUCE,
059ec3d9
PH
145 EITEM_RUN,
146 EITEM_SG,
147 EITEM_SUBSTR,
148 EITEM_TR };
149
150/* Tables of operator names, and corresponding switch numbers. The names must be
151in alphabetical order. There are two tables, because underscore is used in some
152cases to introduce arguments, whereas for other it is part of the name. This is
153an historical mis-design. */
154
155static uschar *op_table_underscore[] = {
156 US"from_utf8",
157 US"local_part",
158 US"quote_local_part",
f90d018c 159 US"time_eval",
059ec3d9
PH
160 US"time_interval"};
161
162enum {
163 EOP_FROM_UTF8,
164 EOP_LOCAL_PART,
165 EOP_QUOTE_LOCAL_PART,
f90d018c 166 EOP_TIME_EVAL,
059ec3d9
PH
167 EOP_TIME_INTERVAL };
168
169static uschar *op_table_main[] = {
170 US"address",
29f89cad 171 US"addresses",
059ec3d9
PH
172 US"base62",
173 US"base62d",
174 US"domain",
175 US"escape",
176 US"eval",
177 US"eval10",
178 US"expand",
179 US"h",
180 US"hash",
181 US"hex2b64",
182 US"l",
183 US"lc",
184 US"length",
185 US"mask",
186 US"md5",
187 US"nh",
188 US"nhash",
189 US"quote",
190 US"rfc2047",
9c57cbc0 191 US"rfc2047d",
059ec3d9
PH
192 US"rxquote",
193 US"s",
194 US"sha1",
195 US"stat",
196 US"str2b64",
197 US"strlen",
198 US"substr",
199 US"uc" };
200
201enum {
202 EOP_ADDRESS = sizeof(op_table_underscore)/sizeof(uschar *),
29f89cad 203 EOP_ADDRESSES,
059ec3d9
PH
204 EOP_BASE62,
205 EOP_BASE62D,
206 EOP_DOMAIN,
207 EOP_ESCAPE,
208 EOP_EVAL,
209 EOP_EVAL10,
210 EOP_EXPAND,
211 EOP_H,
212 EOP_HASH,
213 EOP_HEX2B64,
214 EOP_L,
215 EOP_LC,
216 EOP_LENGTH,
217 EOP_MASK,
218 EOP_MD5,
219 EOP_NH,
220 EOP_NHASH,
221 EOP_QUOTE,
222 EOP_RFC2047,
9c57cbc0 223 EOP_RFC2047D,
059ec3d9
PH
224 EOP_RXQUOTE,
225 EOP_S,
226 EOP_SHA1,
227 EOP_STAT,
228 EOP_STR2B64,
229 EOP_STRLEN,
230 EOP_SUBSTR,
231 EOP_UC };
232
233
234/* Table of condition names, and corresponding switch numbers. The names must
235be in alphabetical order. */
236
237static uschar *cond_table[] = {
238 US"<",
239 US"<=",
240 US"=",
241 US"==", /* Backward compatibility */
242 US">",
243 US">=",
244 US"and",
245 US"crypteq",
246 US"def",
247 US"eq",
248 US"eqi",
249 US"exists",
250 US"first_delivery",
0ce9abe6
PH
251 US"forall",
252 US"forany",
059ec3d9
PH
253 US"ge",
254 US"gei",
255 US"gt",
256 US"gti",
257 US"isip",
258 US"isip4",
259 US"isip6",
260 US"ldapauth",
261 US"le",
262 US"lei",
263 US"lt",
264 US"lti",
265 US"match",
266 US"match_address",
267 US"match_domain",
32d668a5 268 US"match_ip",
059ec3d9
PH
269 US"match_local_part",
270 US"or",
271 US"pam",
272 US"pwcheck",
273 US"queue_running",
274 US"radius",
275 US"saslauthd"
276};
277
278enum {
279 ECOND_NUM_L,
280 ECOND_NUM_LE,
281 ECOND_NUM_E,
282 ECOND_NUM_EE,
283 ECOND_NUM_G,
284 ECOND_NUM_GE,
285 ECOND_AND,
286 ECOND_CRYPTEQ,
287 ECOND_DEF,
288 ECOND_STR_EQ,
289 ECOND_STR_EQI,
290 ECOND_EXISTS,
291 ECOND_FIRST_DELIVERY,
0ce9abe6
PH
292 ECOND_FORALL,
293 ECOND_FORANY,
059ec3d9
PH
294 ECOND_STR_GE,
295 ECOND_STR_GEI,
296 ECOND_STR_GT,
297 ECOND_STR_GTI,
298 ECOND_ISIP,
299 ECOND_ISIP4,
300 ECOND_ISIP6,
301 ECOND_LDAPAUTH,
302 ECOND_STR_LE,
303 ECOND_STR_LEI,
304 ECOND_STR_LT,
305 ECOND_STR_LTI,
306 ECOND_MATCH,
307 ECOND_MATCH_ADDRESS,
308 ECOND_MATCH_DOMAIN,
32d668a5 309 ECOND_MATCH_IP,
059ec3d9
PH
310 ECOND_MATCH_LOCAL_PART,
311 ECOND_OR,
312 ECOND_PAM,
313 ECOND_PWCHECK,
314 ECOND_QUEUE_RUNNING,
315 ECOND_RADIUS,
316 ECOND_SASLAUTHD
317};
318
319
320/* Type for main variable table */
321
322typedef struct {
323 char *name;
324 int type;
325 void *value;
326} var_entry;
327
328/* Type for entries pointing to address/length pairs. Not currently
329in use. */
330
331typedef struct {
332 uschar **address;
333 int *length;
334} alblock;
335
336/* Types of table entry */
337
338enum {
339 vtype_int, /* value is address of int */
340 vtype_filter_int, /* ditto, but recognized only when filtering */
341 vtype_ino, /* value is address of ino_t (not always an int) */
342 vtype_uid, /* value is address of uid_t (not always an int) */
343 vtype_gid, /* value is address of gid_t (not always an int) */
344 vtype_stringptr, /* value is address of pointer to string */
345 vtype_msgbody, /* as stringptr, but read when first required */
346 vtype_msgbody_end, /* ditto, the end of the message */
ff75a1f7
PH
347 vtype_msgheaders, /* the message's headers, processed */
348 vtype_msgheaders_raw, /* the message's headers, unprocessed */
059ec3d9
PH
349 vtype_localpart, /* extract local part from string */
350 vtype_domain, /* extract domain from string */
351 vtype_recipients, /* extract recipients from recipients list */
0e20aff9
MH
352 /* (available only in system filters, ACLs, and */
353 /* local_scan()) */
059ec3d9
PH
354 vtype_todbsdin, /* value not used; generate BSD inbox tod */
355 vtype_tode, /* value not used; generate tod in epoch format */
356 vtype_todf, /* value not used; generate full tod */
357 vtype_todl, /* value not used; generate log tod */
358 vtype_todlf, /* value not used; generate log file datestamp tod */
359 vtype_todzone, /* value not used; generate time zone only */
360 vtype_todzulu, /* value not used; generate zulu tod */
361 vtype_reply, /* value not used; get reply from headers */
362 vtype_pid, /* value not used; result is pid */
363 vtype_host_lookup, /* value not used; get host name */
5cb8cbc6
PH
364 vtype_load_avg, /* value not used; result is int from os_getloadavg */
365 vtype_pspace, /* partition space; value is T/F for spool/log */
8e669ac1 366 vtype_pinodes /* partition inodes; value is T/F for spool/log */
80a47a2c
TK
367 #ifndef DISABLE_DKIM
368 ,vtype_dkim /* Lookup of value in DKIM signature */
369 #endif
059ec3d9
PH
370 };
371
372/* This table must be kept in alphabetical order. */
373
374static var_entry var_table[] = {
38a0a95f
PH
375 /* WARNING: Do not invent variables whose names start acl_c or acl_m because
376 they will be confused with user-creatable ACL variables. */
059ec3d9
PH
377 { "acl_verify_message", vtype_stringptr, &acl_verify_message },
378 { "address_data", vtype_stringptr, &deliver_address_data },
379 { "address_file", vtype_stringptr, &address_file },
380 { "address_pipe", vtype_stringptr, &address_pipe },
381 { "authenticated_id", vtype_stringptr, &authenticated_id },
382 { "authenticated_sender",vtype_stringptr, &authenticated_sender },
383 { "authentication_failed",vtype_int, &authentication_failed },
8523533c
TK
384#ifdef EXPERIMENTAL_BRIGHTMAIL
385 { "bmi_alt_location", vtype_stringptr, &bmi_alt_location },
386 { "bmi_base64_tracker_verdict", vtype_stringptr, &bmi_base64_tracker_verdict },
387 { "bmi_base64_verdict", vtype_stringptr, &bmi_base64_verdict },
388 { "bmi_deliver", vtype_int, &bmi_deliver },
389#endif
059ec3d9
PH
390 { "body_linecount", vtype_int, &body_linecount },
391 { "body_zerocount", vtype_int, &body_zerocount },
392 { "bounce_recipient", vtype_stringptr, &bounce_recipient },
393 { "bounce_return_size_limit", vtype_int, &bounce_return_size_limit },
394 { "caller_gid", vtype_gid, &real_gid },
395 { "caller_uid", vtype_uid, &real_uid },
396 { "compile_date", vtype_stringptr, &version_date },
397 { "compile_number", vtype_stringptr, &version_cnumber },
e5a9dba6 398 { "csa_status", vtype_stringptr, &csa_status },
6a8f9482
TK
399#ifdef EXPERIMENTAL_DCC
400 { "dcc_header", vtype_stringptr, &dcc_header },
401 { "dcc_result", vtype_stringptr, &dcc_result },
402#endif
8523533c
TK
403#ifdef WITH_OLD_DEMIME
404 { "demime_errorlevel", vtype_int, &demime_errorlevel },
405 { "demime_reason", vtype_stringptr, &demime_reason },
406#endif
80a47a2c
TK
407#ifndef DISABLE_DKIM
408 { "dkim_algo", vtype_dkim, (void *)DKIM_ALGO },
409 { "dkim_bodylength", vtype_dkim, (void *)DKIM_BODYLENGTH },
410 { "dkim_canon_body", vtype_dkim, (void *)DKIM_CANON_BODY },
411 { "dkim_canon_headers", vtype_dkim, (void *)DKIM_CANON_HEADERS },
412 { "dkim_copiedheaders", vtype_dkim, (void *)DKIM_COPIEDHEADERS },
413 { "dkim_created", vtype_dkim, (void *)DKIM_CREATED },
e08d09e5 414 { "dkim_domain", vtype_stringptr, &dkim_signing_domain },
80a47a2c
TK
415 { "dkim_expires", vtype_dkim, (void *)DKIM_EXPIRES },
416 { "dkim_headernames", vtype_dkim, (void *)DKIM_HEADERNAMES },
417 { "dkim_identity", vtype_dkim, (void *)DKIM_IDENTITY },
418 { "dkim_key_granularity",vtype_dkim, (void *)DKIM_KEY_GRANULARITY },
419 { "dkim_key_nosubdomains",vtype_dkim, (void *)DKIM_NOSUBDOMAINS },
420 { "dkim_key_notes", vtype_dkim, (void *)DKIM_KEY_NOTES },
421 { "dkim_key_srvtype", vtype_dkim, (void *)DKIM_KEY_SRVTYPE },
422 { "dkim_key_testing", vtype_dkim, (void *)DKIM_KEY_TESTING },
e08d09e5 423 { "dkim_selector", vtype_stringptr, &dkim_signing_selector },
80a47a2c
TK
424 { "dkim_signing_domains",vtype_stringptr, &dkim_signing_domains },
425 { "dkim_verify_reason", vtype_dkim, (void *)DKIM_VERIFY_REASON },
426 { "dkim_verify_status", vtype_dkim, (void *)DKIM_VERIFY_STATUS},
e08d09e5 427#endif
059ec3d9 428 { "dnslist_domain", vtype_stringptr, &dnslist_domain },
93655c46 429 { "dnslist_matched", vtype_stringptr, &dnslist_matched },
059ec3d9
PH
430 { "dnslist_text", vtype_stringptr, &dnslist_text },
431 { "dnslist_value", vtype_stringptr, &dnslist_value },
432 { "domain", vtype_stringptr, &deliver_domain },
433 { "domain_data", vtype_stringptr, &deliver_domain_data },
434 { "exim_gid", vtype_gid, &exim_gid },
435 { "exim_path", vtype_stringptr, &exim_path },
436 { "exim_uid", vtype_uid, &exim_uid },
8523533c
TK
437#ifdef WITH_OLD_DEMIME
438 { "found_extension", vtype_stringptr, &found_extension },
8e669ac1 439#endif
059ec3d9
PH
440 { "home", vtype_stringptr, &deliver_home },
441 { "host", vtype_stringptr, &deliver_host },
442 { "host_address", vtype_stringptr, &deliver_host_address },
443 { "host_data", vtype_stringptr, &host_data },
b08b24c8 444 { "host_lookup_deferred",vtype_int, &host_lookup_deferred },
059ec3d9
PH
445 { "host_lookup_failed", vtype_int, &host_lookup_failed },
446 { "inode", vtype_ino, &deliver_inode },
447 { "interface_address", vtype_stringptr, &interface_address },
448 { "interface_port", vtype_int, &interface_port },
0ce9abe6 449 { "item", vtype_stringptr, &iterate_item },
059ec3d9
PH
450 #ifdef LOOKUP_LDAP
451 { "ldap_dn", vtype_stringptr, &eldap_dn },
452 #endif
453 { "load_average", vtype_load_avg, NULL },
454 { "local_part", vtype_stringptr, &deliver_localpart },
455 { "local_part_data", vtype_stringptr, &deliver_localpart_data },
456 { "local_part_prefix", vtype_stringptr, &deliver_localpart_prefix },
457 { "local_part_suffix", vtype_stringptr, &deliver_localpart_suffix },
458 { "local_scan_data", vtype_stringptr, &local_scan_data },
459 { "local_user_gid", vtype_gid, &local_user_gid },
460 { "local_user_uid", vtype_uid, &local_user_uid },
461 { "localhost_number", vtype_int, &host_number },
5cb8cbc6 462 { "log_inodes", vtype_pinodes, (void *)FALSE },
8e669ac1 463 { "log_space", vtype_pspace, (void *)FALSE },
059ec3d9 464 { "mailstore_basename", vtype_stringptr, &mailstore_basename },
8523533c
TK
465#ifdef WITH_CONTENT_SCAN
466 { "malware_name", vtype_stringptr, &malware_name },
467#endif
d677b2f2 468 { "max_received_linelength", vtype_int, &max_received_linelength },
059ec3d9
PH
469 { "message_age", vtype_int, &message_age },
470 { "message_body", vtype_msgbody, &message_body },
471 { "message_body_end", vtype_msgbody_end, &message_body_end },
472 { "message_body_size", vtype_int, &message_body_size },
1ab52c69 473 { "message_exim_id", vtype_stringptr, &message_id },
059ec3d9 474 { "message_headers", vtype_msgheaders, NULL },
ff75a1f7 475 { "message_headers_raw", vtype_msgheaders_raw, NULL },
059ec3d9 476 { "message_id", vtype_stringptr, &message_id },
2e0c1448 477 { "message_linecount", vtype_int, &message_linecount },
059ec3d9 478 { "message_size", vtype_int, &message_size },
8523533c
TK
479#ifdef WITH_CONTENT_SCAN
480 { "mime_anomaly_level", vtype_int, &mime_anomaly_level },
481 { "mime_anomaly_text", vtype_stringptr, &mime_anomaly_text },
482 { "mime_boundary", vtype_stringptr, &mime_boundary },
483 { "mime_charset", vtype_stringptr, &mime_charset },
484 { "mime_content_description", vtype_stringptr, &mime_content_description },
485 { "mime_content_disposition", vtype_stringptr, &mime_content_disposition },
486 { "mime_content_id", vtype_stringptr, &mime_content_id },
487 { "mime_content_size", vtype_int, &mime_content_size },
488 { "mime_content_transfer_encoding",vtype_stringptr, &mime_content_transfer_encoding },
489 { "mime_content_type", vtype_stringptr, &mime_content_type },
490 { "mime_decoded_filename", vtype_stringptr, &mime_decoded_filename },
491 { "mime_filename", vtype_stringptr, &mime_filename },
492 { "mime_is_coverletter", vtype_int, &mime_is_coverletter },
493 { "mime_is_multipart", vtype_int, &mime_is_multipart },
494 { "mime_is_rfc822", vtype_int, &mime_is_rfc822 },
495 { "mime_part_count", vtype_int, &mime_part_count },
496#endif
059ec3d9
PH
497 { "n0", vtype_filter_int, &filter_n[0] },
498 { "n1", vtype_filter_int, &filter_n[1] },
499 { "n2", vtype_filter_int, &filter_n[2] },
500 { "n3", vtype_filter_int, &filter_n[3] },
501 { "n4", vtype_filter_int, &filter_n[4] },
502 { "n5", vtype_filter_int, &filter_n[5] },
503 { "n6", vtype_filter_int, &filter_n[6] },
504 { "n7", vtype_filter_int, &filter_n[7] },
505 { "n8", vtype_filter_int, &filter_n[8] },
506 { "n9", vtype_filter_int, &filter_n[9] },
507 { "original_domain", vtype_stringptr, &deliver_domain_orig },
508 { "original_local_part", vtype_stringptr, &deliver_localpart_orig },
509 { "originator_gid", vtype_gid, &originator_gid },
510 { "originator_uid", vtype_uid, &originator_uid },
511 { "parent_domain", vtype_stringptr, &deliver_domain_parent },
512 { "parent_local_part", vtype_stringptr, &deliver_localpart_parent },
513 { "pid", vtype_pid, NULL },
514 { "primary_hostname", vtype_stringptr, &primary_hostname },
fffda43a
TK
515 { "prvscheck_address", vtype_stringptr, &prvscheck_address },
516 { "prvscheck_keynum", vtype_stringptr, &prvscheck_keynum },
517 { "prvscheck_result", vtype_stringptr, &prvscheck_result },
059ec3d9
PH
518 { "qualify_domain", vtype_stringptr, &qualify_domain_sender },
519 { "qualify_recipient", vtype_stringptr, &qualify_domain_recipient },
520 { "rcpt_count", vtype_int, &rcpt_count },
521 { "rcpt_defer_count", vtype_int, &rcpt_defer_count },
522 { "rcpt_fail_count", vtype_int, &rcpt_fail_count },
523 { "received_count", vtype_int, &received_count },
524 { "received_for", vtype_stringptr, &received_for },
194cc0e4
PH
525 { "received_ip_address", vtype_stringptr, &interface_address },
526 { "received_port", vtype_int, &interface_port },
059ec3d9 527 { "received_protocol", vtype_stringptr, &received_protocol },
7dbf77c9 528 { "received_time", vtype_int, &received_time },
059ec3d9 529 { "recipient_data", vtype_stringptr, &recipient_data },
8e669ac1 530 { "recipient_verify_failure",vtype_stringptr,&recipient_verify_failure },
059ec3d9
PH
531 { "recipients", vtype_recipients, NULL },
532 { "recipients_count", vtype_int, &recipients_count },
8523533c
TK
533#ifdef WITH_CONTENT_SCAN
534 { "regex_match_string", vtype_stringptr, &regex_match_string },
535#endif
059ec3d9
PH
536 { "reply_address", vtype_reply, NULL },
537 { "return_path", vtype_stringptr, &return_path },
538 { "return_size_limit", vtype_int, &bounce_return_size_limit },
539 { "runrc", vtype_int, &runrc },
540 { "self_hostname", vtype_stringptr, &self_hostname },
541 { "sender_address", vtype_stringptr, &sender_address },
2a3eea10 542 { "sender_address_data", vtype_stringptr, &sender_address_data },
059ec3d9
PH
543 { "sender_address_domain", vtype_domain, &sender_address },
544 { "sender_address_local_part", vtype_localpart, &sender_address },
545 { "sender_data", vtype_stringptr, &sender_data },
546 { "sender_fullhost", vtype_stringptr, &sender_fullhost },
547 { "sender_helo_name", vtype_stringptr, &sender_helo_name },
548 { "sender_host_address", vtype_stringptr, &sender_host_address },
549 { "sender_host_authenticated",vtype_stringptr, &sender_host_authenticated },
550 { "sender_host_name", vtype_host_lookup, NULL },
551 { "sender_host_port", vtype_int, &sender_host_port },
552 { "sender_ident", vtype_stringptr, &sender_ident },
870f6ba8
TF
553 { "sender_rate", vtype_stringptr, &sender_rate },
554 { "sender_rate_limit", vtype_stringptr, &sender_rate_limit },
555 { "sender_rate_period", vtype_stringptr, &sender_rate_period },
059ec3d9 556 { "sender_rcvhost", vtype_stringptr, &sender_rcvhost },
8e669ac1 557 { "sender_verify_failure",vtype_stringptr, &sender_verify_failure },
41c7c167
PH
558 { "sending_ip_address", vtype_stringptr, &sending_ip_address },
559 { "sending_port", vtype_int, &sending_port },
8e669ac1 560 { "smtp_active_hostname", vtype_stringptr, &smtp_active_hostname },
3ee512ff
PH
561 { "smtp_command", vtype_stringptr, &smtp_cmd_buffer },
562 { "smtp_command_argument", vtype_stringptr, &smtp_cmd_argument },
b01dd148 563 { "smtp_count_at_connection_start", vtype_int, &smtp_accept_count },
8f128379 564 { "smtp_notquit_reason", vtype_stringptr, &smtp_notquit_reason },
059ec3d9
PH
565 { "sn0", vtype_filter_int, &filter_sn[0] },
566 { "sn1", vtype_filter_int, &filter_sn[1] },
567 { "sn2", vtype_filter_int, &filter_sn[2] },
568 { "sn3", vtype_filter_int, &filter_sn[3] },
569 { "sn4", vtype_filter_int, &filter_sn[4] },
570 { "sn5", vtype_filter_int, &filter_sn[5] },
571 { "sn6", vtype_filter_int, &filter_sn[6] },
572 { "sn7", vtype_filter_int, &filter_sn[7] },
573 { "sn8", vtype_filter_int, &filter_sn[8] },
574 { "sn9", vtype_filter_int, &filter_sn[9] },
8523533c
TK
575#ifdef WITH_CONTENT_SCAN
576 { "spam_bar", vtype_stringptr, &spam_bar },
577 { "spam_report", vtype_stringptr, &spam_report },
578 { "spam_score", vtype_stringptr, &spam_score },
579 { "spam_score_int", vtype_stringptr, &spam_score_int },
580#endif
581#ifdef EXPERIMENTAL_SPF
65a7d8c3 582 { "spf_guess", vtype_stringptr, &spf_guess },
8523533c
TK
583 { "spf_header_comment", vtype_stringptr, &spf_header_comment },
584 { "spf_received", vtype_stringptr, &spf_received },
585 { "spf_result", vtype_stringptr, &spf_result },
586 { "spf_smtp_comment", vtype_stringptr, &spf_smtp_comment },
587#endif
059ec3d9 588 { "spool_directory", vtype_stringptr, &spool_directory },
5cb8cbc6 589 { "spool_inodes", vtype_pinodes, (void *)TRUE },
8e669ac1 590 { "spool_space", vtype_pspace, (void *)TRUE },
8523533c
TK
591#ifdef EXPERIMENTAL_SRS
592 { "srs_db_address", vtype_stringptr, &srs_db_address },
593 { "srs_db_key", vtype_stringptr, &srs_db_key },
594 { "srs_orig_recipient", vtype_stringptr, &srs_orig_recipient },
595 { "srs_orig_sender", vtype_stringptr, &srs_orig_sender },
596 { "srs_recipient", vtype_stringptr, &srs_recipient },
597 { "srs_status", vtype_stringptr, &srs_status },
598#endif
059ec3d9
PH
599 { "thisaddress", vtype_stringptr, &filter_thisaddress },
600 { "tls_certificate_verified", vtype_int, &tls_certificate_verified },
601 { "tls_cipher", vtype_stringptr, &tls_cipher },
602 { "tls_peerdn", vtype_stringptr, &tls_peerdn },
603 { "tod_bsdinbox", vtype_todbsdin, NULL },
604 { "tod_epoch", vtype_tode, NULL },
605 { "tod_full", vtype_todf, NULL },
606 { "tod_log", vtype_todl, NULL },
607 { "tod_logfile", vtype_todlf, NULL },
608 { "tod_zone", vtype_todzone, NULL },
609 { "tod_zulu", vtype_todzulu, NULL },
610 { "value", vtype_stringptr, &lookup_value },
611 { "version_number", vtype_stringptr, &version_string },
612 { "warn_message_delay", vtype_stringptr, &warnmsg_delay },
613 { "warn_message_recipient",vtype_stringptr, &warnmsg_recipients },
614 { "warn_message_recipients",vtype_stringptr,&warnmsg_recipients },
615 { "warnmsg_delay", vtype_stringptr, &warnmsg_delay },
616 { "warnmsg_recipient", vtype_stringptr, &warnmsg_recipients },
617 { "warnmsg_recipients", vtype_stringptr, &warnmsg_recipients }
618};
619
620static int var_table_size = sizeof(var_table)/sizeof(var_entry);
621static uschar var_buffer[256];
622static BOOL malformed_header;
623
624/* For textual hashes */
625
626static char *hashcodes = "abcdefghijklmnopqrtsuvwxyz"
627 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
628 "0123456789";
629
630enum { HMAC_MD5, HMAC_SHA1 };
631
632/* For numeric hashes */
633
634static unsigned int prime[] = {
635 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
636 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
637 73, 79, 83, 89, 97, 101, 103, 107, 109, 113};
638
639/* For printing modes in symbolic form */
640
641static uschar *mtable_normal[] =
642 { US"---", US"--x", US"-w-", US"-wx", US"r--", US"r-x", US"rw-", US"rwx" };
643
644static uschar *mtable_setid[] =
645 { US"--S", US"--s", US"-wS", US"-ws", US"r-S", US"r-s", US"rwS", US"rws" };
646
647static uschar *mtable_sticky[] =
648 { US"--T", US"--t", US"-wT", US"-wt", US"r-T", US"r-t", US"rwT", US"rwt" };
649
650
651
652/*************************************************
653* Tables for UTF-8 support *
654*************************************************/
655
656/* Table of the number of extra characters, indexed by the first character
657masked with 0x3f. The highest number for a valid UTF-8 character is in fact
6580x3d. */
659
660static uschar utf8_table1[] = {
661 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
662 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
663 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
664 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
665
666/* These are the masks for the data bits in the first byte of a character,
667indexed by the number of additional bytes. */
668
669static int utf8_table2[] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
670
671/* Get the next UTF-8 character, advancing the pointer. */
672
673#define GETUTF8INC(c, ptr) \
674 c = *ptr++; \
675 if ((c & 0xc0) == 0xc0) \
676 { \
677 int a = utf8_table1[c & 0x3f]; /* Number of additional bytes */ \
678 int s = 6*a; \
679 c = (c & utf8_table2[a]) << s; \
680 while (a-- > 0) \
681 { \
682 s -= 6; \
683 c |= (*ptr++ & 0x3f) << s; \
684 } \
685 }
686
687
688/*************************************************
689* Binary chop search on a table *
690*************************************************/
691
692/* This is used for matching expansion items and operators.
693
694Arguments:
695 name the name that is being sought
696 table the table to search
697 table_size the number of items in the table
698
699Returns: the offset in the table, or -1
700*/
701
702static int
703chop_match(uschar *name, uschar **table, int table_size)
704{
705uschar **bot = table;
706uschar **top = table + table_size;
707
708while (top > bot)
709 {
710 uschar **mid = bot + (top - bot)/2;
711 int c = Ustrcmp(name, *mid);
712 if (c == 0) return mid - table;
713 if (c > 0) bot = mid + 1; else top = mid;
714 }
715
716return -1;
717}
718
719
720
721/*************************************************
722* Check a condition string *
723*************************************************/
724
725/* This function is called to expand a string, and test the result for a "true"
726or "false" value. Failure of the expansion yields FALSE; logged unless it was a
727forced fail or lookup defer. All store used by the function can be released on
728exit.
729
730Arguments:
731 condition the condition string
732 m1 text to be incorporated in panic error
733 m2 ditto
734
735Returns: TRUE if condition is met, FALSE if not
736*/
737
738BOOL
739expand_check_condition(uschar *condition, uschar *m1, uschar *m2)
740{
741int rc;
742void *reset_point = store_get(0);
743uschar *ss = expand_string(condition);
744if (ss == NULL)
745 {
746 if (!expand_string_forcedfail && !search_find_defer)
747 log_write(0, LOG_MAIN|LOG_PANIC, "failed to expand condition \"%s\" "
748 "for %s %s: %s", condition, m1, m2, expand_string_message);
749 return FALSE;
750 }
751rc = ss[0] != 0 && Ustrcmp(ss, "0") != 0 && strcmpic(ss, US"no") != 0 &&
752 strcmpic(ss, US"false") != 0;
753store_reset(reset_point);
754return rc;
755}
756
757
758
759/*************************************************
760* Pick out a name from a string *
761*************************************************/
762
763/* If the name is too long, it is silently truncated.
764
765Arguments:
766 name points to a buffer into which to put the name
767 max is the length of the buffer
768 s points to the first alphabetic character of the name
769 extras chars other than alphanumerics to permit
770
771Returns: pointer to the first character after the name
772
773Note: The test for *s != 0 in the while loop is necessary because
774Ustrchr() yields non-NULL if the character is zero (which is not something
775I expected). */
776
777static uschar *
778read_name(uschar *name, int max, uschar *s, uschar *extras)
779{
780int ptr = 0;
781while (*s != 0 && (isalnum(*s) || Ustrchr(extras, *s) != NULL))
782 {
783 if (ptr < max-1) name[ptr++] = *s;
784 s++;
785 }
786name[ptr] = 0;
787return s;
788}
789
790
791
792/*************************************************
793* Pick out the rest of a header name *
794*************************************************/
795
796/* A variable name starting $header_ (or just $h_ for those who like
797abbreviations) might not be the complete header name because headers can
798contain any printing characters in their names, except ':'. This function is
799called to read the rest of the name, chop h[eader]_ off the front, and put ':'
800on the end, if the name was terminated by white space.
801
802Arguments:
803 name points to a buffer in which the name read so far exists
804 max is the length of the buffer
805 s points to the first character after the name so far, i.e. the
806 first non-alphameric character after $header_xxxxx
807
808Returns: a pointer to the first character after the header name
809*/
810
811static uschar *
812read_header_name(uschar *name, int max, uschar *s)
813{
814int prelen = Ustrchr(name, '_') - name + 1;
815int ptr = Ustrlen(name) - prelen;
816if (ptr > 0) memmove(name, name+prelen, ptr);
817while (mac_isgraph(*s) && *s != ':')
818 {
819 if (ptr < max-1) name[ptr++] = *s;
820 s++;
821 }
822if (*s == ':') s++;
823name[ptr++] = ':';
824name[ptr] = 0;
825return s;
826}
827
828
829
830/*************************************************
831* Pick out a number from a string *
832*************************************************/
833
834/* Arguments:
835 n points to an integer into which to put the number
836 s points to the first digit of the number
837
838Returns: a pointer to the character after the last digit
839*/
840
841static uschar *
842read_number(int *n, uschar *s)
843{
844*n = 0;
845while (isdigit(*s)) *n = *n * 10 + (*s++ - '0');
846return s;
847}
848
849
850
851/*************************************************
852* Extract keyed subfield from a string *
853*************************************************/
854
855/* The yield is in dynamic store; NULL means that the key was not found.
856
857Arguments:
858 key points to the name of the key
859 s points to the string from which to extract the subfield
860
861Returns: NULL if the subfield was not found, or
862 a pointer to the subfield's data
863*/
864
865static uschar *
866expand_getkeyed(uschar *key, uschar *s)
867{
868int length = Ustrlen(key);
869while (isspace(*s)) s++;
870
871/* Loop to search for the key */
872
873while (*s != 0)
874 {
875 int dkeylength;
876 uschar *data;
877 uschar *dkey = s;
878
879 while (*s != 0 && *s != '=' && !isspace(*s)) s++;
880 dkeylength = s - dkey;
881 while (isspace(*s)) s++;
882 if (*s == '=') while (isspace((*(++s))));
883
884 data = string_dequote(&s);
885 if (length == dkeylength && strncmpic(key, dkey, length) == 0)
886 return data;
887
888 while (isspace(*s)) s++;
889 }
890
891return NULL;
892}
893
894
895
896
897/*************************************************
898* Extract numbered subfield from string *
899*************************************************/
900
901/* Extracts a numbered field from a string that is divided by tokens - for
902example a line from /etc/passwd is divided by colon characters. First field is
903numbered one. Negative arguments count from the right. Zero returns the whole
904string. Returns NULL if there are insufficient tokens in the string
905
906***WARNING***
907Modifies final argument - this is a dynamically generated string, so that's OK.
908
909Arguments:
910 field number of field to be extracted,
911 first field = 1, whole string = 0, last field = -1
912 separators characters that are used to break string into tokens
913 s points to the string from which to extract the subfield
914
915Returns: NULL if the field was not found,
916 a pointer to the field's data inside s (modified to add 0)
917*/
918
919static uschar *
920expand_gettokened (int field, uschar *separators, uschar *s)
921{
922int sep = 1;
923int count;
924uschar *ss = s;
925uschar *fieldtext = NULL;
926
927if (field == 0) return s;
928
929/* Break the line up into fields in place; for field > 0 we stop when we have
930done the number of fields we want. For field < 0 we continue till the end of
931the string, counting the number of fields. */
932
933count = (field > 0)? field : INT_MAX;
934
935while (count-- > 0)
936 {
937 size_t len;
938
939 /* Previous field was the last one in the string. For a positive field
940 number, this means there are not enough fields. For a negative field number,
941 check that there are enough, and scan back to find the one that is wanted. */
942
943 if (sep == 0)
944 {
945 if (field > 0 || (-field) > (INT_MAX - count - 1)) return NULL;
946 if ((-field) == (INT_MAX - count - 1)) return s;
947 while (field++ < 0)
948 {
949 ss--;
950 while (ss[-1] != 0) ss--;
951 }
952 fieldtext = ss;
953 break;
954 }
955
956 /* Previous field was not last in the string; save its start and put a
957 zero at its end. */
958
959 fieldtext = ss;
960 len = Ustrcspn(ss, separators);
961 sep = ss[len];
962 ss[len] = 0;
963 ss += len + 1;
964 }
965
966return fieldtext;
967}
968
969
970
971/*************************************************
972* Extract a substring from a string *
973*************************************************/
974
975/* Perform the ${substr or ${length expansion operations.
976
977Arguments:
978 subject the input string
979 value1 the offset from the start of the input string to the start of
980 the output string; if negative, count from the right.
981 value2 the length of the output string, or negative (-1) for unset
982 if value1 is positive, unset means "all after"
983 if value1 is negative, unset means "all before"
984 len set to the length of the returned string
985
986Returns: pointer to the output string, or NULL if there is an error
987*/
988
989static uschar *
990extract_substr(uschar *subject, int value1, int value2, int *len)
991{
992int sublen = Ustrlen(subject);
993
994if (value1 < 0) /* count from right */
995 {
996 value1 += sublen;
997
998 /* If the position is before the start, skip to the start, and adjust the
999 length. If the length ends up negative, the substring is null because nothing
1000 can precede. This falls out naturally when the length is unset, meaning "all
1001 to the left". */
1002
1003 if (value1 < 0)
1004 {
1005 value2 += value1;
1006 if (value2 < 0) value2 = 0;
1007 value1 = 0;
1008 }
1009
1010 /* Otherwise an unset length => characters before value1 */
1011
1012 else if (value2 < 0)
1013 {
1014 value2 = value1;
1015 value1 = 0;
1016 }
1017 }
1018
1019/* For a non-negative offset, if the starting position is past the end of the
1020string, the result will be the null string. Otherwise, an unset length means
1021"rest"; just set it to the maximum - it will be cut down below if necessary. */
1022
1023else
1024 {
1025 if (value1 > sublen)
1026 {
1027 value1 = sublen;
1028 value2 = 0;
1029 }
1030 else if (value2 < 0) value2 = sublen;
1031 }
1032
1033/* Cut the length down to the maximum possible for the offset value, and get
1034the required characters. */
1035
1036if (value1 + value2 > sublen) value2 = sublen - value1;
1037*len = value2;
1038return subject + value1;
1039}
1040
1041
1042
1043
1044/*************************************************
1045* Old-style hash of a string *
1046*************************************************/
1047
1048/* Perform the ${hash expansion operation.
1049
1050Arguments:
1051 subject the input string (an expanded substring)
1052 value1 the length of the output string; if greater or equal to the
1053 length of the input string, the input string is returned
1054 value2 the number of hash characters to use, or 26 if negative
1055 len set to the length of the returned string
1056
1057Returns: pointer to the output string, or NULL if there is an error
1058*/
1059
1060static uschar *
1061compute_hash(uschar *subject, int value1, int value2, int *len)
1062{
1063int sublen = Ustrlen(subject);
1064
1065if (value2 < 0) value2 = 26;
1066else if (value2 > Ustrlen(hashcodes))
1067 {
1068 expand_string_message =
1069 string_sprintf("hash count \"%d\" too big", value2);
1070 return NULL;
1071 }
1072
1073/* Calculate the hash text. We know it is shorter than the original string, so
1074can safely place it in subject[] (we know that subject is always itself an
1075expanded substring). */
1076
1077if (value1 < sublen)
1078 {
1079 int c;
1080 int i = 0;
1081 int j = value1;
1082 while ((c = (subject[j])) != 0)
1083 {
1084 int shift = (c + j++) & 7;
1085 subject[i] ^= (c << shift) | (c >> (8-shift));
1086 if (++i >= value1) i = 0;
1087 }
1088 for (i = 0; i < value1; i++)
1089 subject[i] = hashcodes[(subject[i]) % value2];
1090 }
1091else value1 = sublen;
1092
1093*len = value1;
1094return subject;
1095}
1096
1097
1098
1099
1100/*************************************************
1101* Numeric hash of a string *
1102*************************************************/
1103
1104/* Perform the ${nhash expansion operation. The first characters of the
1105string are treated as most important, and get the highest prime numbers.
1106
1107Arguments:
1108 subject the input string
1109 value1 the maximum value of the first part of the result
1110 value2 the maximum value of the second part of the result,
1111 or negative to produce only a one-part result
1112 len set to the length of the returned string
1113
1114Returns: pointer to the output string, or NULL if there is an error.
1115*/
1116
1117static uschar *
1118compute_nhash (uschar *subject, int value1, int value2, int *len)
1119{
1120uschar *s = subject;
1121int i = 0;
1122unsigned long int total = 0; /* no overflow */
1123
1124while (*s != 0)
1125 {
1126 if (i == 0) i = sizeof(prime)/sizeof(int) - 1;
1127 total += prime[i--] * (unsigned int)(*s++);
1128 }
1129
1130/* If value2 is unset, just compute one number */
1131
1132if (value2 < 0)
1133 {
1134 s = string_sprintf("%d", total % value1);
1135 }
1136
1137/* Otherwise do a div/mod hash */
1138
1139else
1140 {
1141 total = total % (value1 * value2);
1142 s = string_sprintf("%d/%d", total/value2, total % value2);
1143 }
1144
1145*len = Ustrlen(s);
1146return s;
1147}
1148
1149
1150
1151
1152
1153/*************************************************
1154* Find the value of a header or headers *
1155*************************************************/
1156
1157/* Multiple instances of the same header get concatenated, and this function
1158can also return a concatenation of all the header lines. When concatenating
1159specific headers that contain lists of addresses, a comma is inserted between
1160them. Otherwise we use a straight concatenation. Because some messages can have
1161pathologically large number of lines, there is a limit on the length that is
1162returned. Also, to avoid massive store use which would result from using
1163string_cat() as it copies and extends strings, we do a preliminary pass to find
1164out exactly how much store will be needed. On "normal" messages this will be
1165pretty trivial.
1166
1167Arguments:
1168 name the name of the header, without the leading $header_ or $h_,
1169 or NULL if a concatenation of all headers is required
1170 exists_only TRUE if called from a def: test; don't need to build a string;
1171 just return a string that is not "" and not "0" if the header
1172 exists
1173 newsize return the size of memory block that was obtained; may be NULL
1174 if exists_only is TRUE
1175 want_raw TRUE if called for $rh_ or $rheader_ variables; no processing,
ff75a1f7
PH
1176 other than concatenating, will be done on the header. Also used
1177 for $message_headers_raw.
059ec3d9
PH
1178 charset name of charset to translate MIME words to; used only if
1179 want_raw is false; if NULL, no translation is done (this is
1180 used for $bh_ and $bheader_)
1181
1182Returns: NULL if the header does not exist, else a pointer to a new
1183 store block
1184*/
1185
1186static uschar *
1187find_header(uschar *name, BOOL exists_only, int *newsize, BOOL want_raw,
1188 uschar *charset)
1189{
1190BOOL found = name == NULL;
1191int comma = 0;
1192int len = found? 0 : Ustrlen(name);
1193int i;
1194uschar *yield = NULL;
1195uschar *ptr = NULL;
1196
1197/* Loop for two passes - saves code repetition */
1198
1199for (i = 0; i < 2; i++)
1200 {
1201 int size = 0;
1202 header_line *h;
1203
1204 for (h = header_list; size < header_insert_maxlen && h != NULL; h = h->next)
1205 {
1206 if (h->type != htype_old && h->text != NULL) /* NULL => Received: placeholder */
1207 {
1208 if (name == NULL || (len <= h->slen && strncmpic(name, h->text, len) == 0))
1209 {
1210 int ilen;
1211 uschar *t;
1212
1213 if (exists_only) return US"1"; /* don't need actual string */
1214 found = TRUE;
1215 t = h->text + len; /* text to insert */
1216 if (!want_raw) /* unless wanted raw, */
1217 while (isspace(*t)) t++; /* remove leading white space */
1218 ilen = h->slen - (t - h->text); /* length to insert */
1219
fd700877
PH
1220 /* Unless wanted raw, remove trailing whitespace, including the
1221 newline. */
1222
1223 if (!want_raw)
1224 while (ilen > 0 && isspace(t[ilen-1])) ilen--;
1225
059ec3d9
PH
1226 /* Set comma = 1 if handling a single header and it's one of those
1227 that contains an address list, except when asked for raw headers. Only
1228 need to do this once. */
1229
1230 if (!want_raw && name != NULL && comma == 0 &&
1231 Ustrchr("BCFRST", h->type) != NULL)
1232 comma = 1;
1233
1234 /* First pass - compute total store needed; second pass - compute
1235 total store used, including this header. */
1236
fd700877 1237 size += ilen + comma + 1; /* +1 for the newline */
059ec3d9
PH
1238
1239 /* Second pass - concatentate the data, up to a maximum. Note that
1240 the loop stops when size hits the limit. */
1241
1242 if (i != 0)
1243 {
1244 if (size > header_insert_maxlen)
1245 {
fd700877 1246 ilen -= size - header_insert_maxlen - 1;
059ec3d9
PH
1247 comma = 0;
1248 }
1249 Ustrncpy(ptr, t, ilen);
1250 ptr += ilen;
fd700877
PH
1251
1252 /* For a non-raw header, put in the comma if needed, then add
3168332a
PH
1253 back the newline we removed above, provided there was some text in
1254 the header. */
fd700877 1255
3168332a 1256 if (!want_raw && ilen > 0)
059ec3d9 1257 {
3168332a 1258 if (comma != 0) *ptr++ = ',';
059ec3d9
PH
1259 *ptr++ = '\n';
1260 }
1261 }
1262 }
1263 }
1264 }
1265
fd700877
PH
1266 /* At end of first pass, return NULL if no header found. Then truncate size
1267 if necessary, and get the buffer to hold the data, returning the buffer size.
1268 */
059ec3d9
PH
1269
1270 if (i == 0)
1271 {
1272 if (!found) return NULL;
1273 if (size > header_insert_maxlen) size = header_insert_maxlen;
1274 *newsize = size + 1;
1275 ptr = yield = store_get(*newsize);
1276 }
1277 }
1278
059ec3d9
PH
1279/* That's all we do for raw header expansion. */
1280
1281if (want_raw)
1282 {
1283 *ptr = 0;
1284 }
1285
fd700877
PH
1286/* Otherwise, remove a final newline and a redundant added comma. Then we do
1287RFC 2047 decoding, translating the charset if requested. The rfc2047_decode2()
059ec3d9
PH
1288function can return an error with decoded data if the charset translation
1289fails. If decoding fails, it returns NULL. */
1290
1291else
1292 {
1293 uschar *decoded, *error;
3168332a 1294 if (ptr > yield && ptr[-1] == '\n') ptr--;
fd700877 1295 if (ptr > yield && comma != 0 && ptr[-1] == ',') ptr--;
059ec3d9 1296 *ptr = 0;
a0d6ba8a
PH
1297 decoded = rfc2047_decode2(yield, check_rfc2047_length, charset, '?', NULL,
1298 newsize, &error);
059ec3d9
PH
1299 if (error != NULL)
1300 {
1301 DEBUG(D_any) debug_printf("*** error in RFC 2047 decoding: %s\n"
1302 " input was: %s\n", error, yield);
1303 }
1304 if (decoded != NULL) yield = decoded;
1305 }
1306
1307return yield;
1308}
1309
1310
1311
1312
1313/*************************************************
1314* Find value of a variable *
1315*************************************************/
1316
1317/* The table of variables is kept in alphabetic order, so we can search it
1318using a binary chop. The "choplen" variable is nothing to do with the binary
1319chop.
1320
1321Arguments:
1322 name the name of the variable being sought
1323 exists_only TRUE if this is a def: test; passed on to find_header()
1324 skipping TRUE => skip any processing evaluation; this is not the same as
1325 exists_only because def: may test for values that are first
1326 evaluated here
1327 newsize pointer to an int which is initially zero; if the answer is in
1328 a new memory buffer, *newsize is set to its size
1329
1330Returns: NULL if the variable does not exist, or
1331 a pointer to the variable's contents, or
1332 something non-NULL if exists_only is TRUE
1333*/
1334
1335static uschar *
1336find_variable(uschar *name, BOOL exists_only, BOOL skipping, int *newsize)
1337{
1338int first = 0;
1339int last = var_table_size;
1340
38a0a95f
PH
1341/* Handle ACL variables, whose names are of the form acl_cxxx or acl_mxxx.
1342Originally, xxx had to be a number in the range 0-9 (later 0-19), but from
1343release 4.64 onwards arbitrary names are permitted, as long as the first 5
641cb756
PH
1344characters are acl_c or acl_m and the sixth is either a digit or an underscore
1345(this gave backwards compatibility at the changeover). There may be built-in
1346variables whose names start acl_ but they should never start in this way. This
1347slightly messy specification is a consequence of the history, needless to say.
47ca6d6c 1348
38a0a95f
PH
1349If an ACL variable does not exist, treat it as empty, unless strict_acl_vars is
1350set, in which case give an error. */
47ca6d6c 1351
641cb756
PH
1352if ((Ustrncmp(name, "acl_c", 5) == 0 || Ustrncmp(name, "acl_m", 5) == 0) &&
1353 !isalpha(name[5]))
38a0a95f
PH
1354 {
1355 tree_node *node =
1356 tree_search((name[4] == 'c')? acl_var_c : acl_var_m, name + 4);
1357 return (node == NULL)? (strict_acl_vars? NULL : US"") : node->data.ptr;
47ca6d6c
PH
1358 }
1359
38a0a95f 1360/* Handle $auth<n> variables. */
f78eb7c6
PH
1361
1362if (Ustrncmp(name, "auth", 4) == 0)
1363 {
1364 uschar *endptr;
1365 int n = Ustrtoul(name + 4, &endptr, 10);
1366 if (*endptr == 0 && n != 0 && n <= AUTH_VARS)
1367 return (auth_vars[n-1] == NULL)? US"" : auth_vars[n-1];
1368 }
1369
47ca6d6c
PH
1370/* For all other variables, search the table */
1371
059ec3d9
PH
1372while (last > first)
1373 {
1374 uschar *s, *domain;
1375 uschar **ss;
1376 int middle = (first + last)/2;
1377 int c = Ustrcmp(name, var_table[middle].name);
1378
1379 if (c > 0) { first = middle + 1; continue; }
1380 if (c < 0) { last = middle; continue; }
1381
1382 /* Found an existing variable. If in skipping state, the value isn't needed,
47ca6d6c 1383 and we want to avoid processing (such as looking up the host name). */
059ec3d9
PH
1384
1385 if (skipping) return US"";
1386
1387 switch (var_table[middle].type)
1388 {
9a26b6b2
PH
1389 case vtype_filter_int:
1390 if (!filter_running) return NULL;
1391 /* Fall through */
1392 /* VVVVVVVVVVVV */
059ec3d9
PH
1393 case vtype_int:
1394 sprintf(CS var_buffer, "%d", *(int *)(var_table[middle].value)); /* Integer */
1395 return var_buffer;
1396
1397 case vtype_ino:
1398 sprintf(CS var_buffer, "%ld", (long int)(*(ino_t *)(var_table[middle].value))); /* Inode */
1399 return var_buffer;
1400
1401 case vtype_gid:
1402 sprintf(CS var_buffer, "%ld", (long int)(*(gid_t *)(var_table[middle].value))); /* gid */
1403 return var_buffer;
1404
1405 case vtype_uid:
1406 sprintf(CS var_buffer, "%ld", (long int)(*(uid_t *)(var_table[middle].value))); /* uid */
1407 return var_buffer;
1408
1409 case vtype_stringptr: /* Pointer to string */
1410 s = *((uschar **)(var_table[middle].value));
1411 return (s == NULL)? US"" : s;
1412
1413 case vtype_pid:
1414 sprintf(CS var_buffer, "%d", (int)getpid()); /* pid */
1415 return var_buffer;
1416
1417 case vtype_load_avg:
8669f003 1418 sprintf(CS var_buffer, "%d", OS_GETLOADAVG()); /* load_average */
059ec3d9
PH
1419 return var_buffer;
1420
1421 case vtype_host_lookup: /* Lookup if not done so */
1422 if (sender_host_name == NULL && sender_host_address != NULL &&
1423 !host_lookup_failed && host_name_lookup() == OK)
1424 host_build_sender_fullhost();
1425 return (sender_host_name == NULL)? US"" : sender_host_name;
1426
1427 case vtype_localpart: /* Get local part from address */
1428 s = *((uschar **)(var_table[middle].value));
1429 if (s == NULL) return US"";
1430 domain = Ustrrchr(s, '@');
1431 if (domain == NULL) return s;
1432 if (domain - s > sizeof(var_buffer) - 1)
1433 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "local part longer than %d in "
1434 "string expansion", sizeof(var_buffer));
1435 Ustrncpy(var_buffer, s, domain - s);
1436 var_buffer[domain - s] = 0;
1437 return var_buffer;
1438
1439 case vtype_domain: /* Get domain from address */
1440 s = *((uschar **)(var_table[middle].value));
1441 if (s == NULL) return US"";
1442 domain = Ustrrchr(s, '@');
1443 return (domain == NULL)? US"" : domain + 1;
1444
1445 case vtype_msgheaders:
1446 return find_header(NULL, exists_only, newsize, FALSE, NULL);
1447
ff75a1f7
PH
1448 case vtype_msgheaders_raw:
1449 return find_header(NULL, exists_only, newsize, TRUE, NULL);
1450
059ec3d9
PH
1451 case vtype_msgbody: /* Pointer to msgbody string */
1452 case vtype_msgbody_end: /* Ditto, the end of the msg */
1453 ss = (uschar **)(var_table[middle].value);
1454 if (*ss == NULL && deliver_datafile >= 0) /* Read body when needed */
1455 {
1456 uschar *body;
0d7eb84a 1457 off_t start_offset = SPOOL_DATA_START_OFFSET;
059ec3d9
PH
1458 int len = message_body_visible;
1459 if (len > message_size) len = message_size;
1460 *ss = body = store_malloc(len+1);
1461 body[0] = 0;
1462 if (var_table[middle].type == vtype_msgbody_end)
1463 {
1464 struct stat statbuf;
1465 if (fstat(deliver_datafile, &statbuf) == 0)
1466 {
1467 start_offset = statbuf.st_size - len;
1468 if (start_offset < SPOOL_DATA_START_OFFSET)
1469 start_offset = SPOOL_DATA_START_OFFSET;
1470 }
1471 }
1472 lseek(deliver_datafile, start_offset, SEEK_SET);
1473 len = read(deliver_datafile, body, len);
1474 if (len > 0)
1475 {
1476 body[len] = 0;
ddea74fa 1477 if (message_body_newlines) /* Separate loops for efficiency */
059ec3d9 1478 {
ddea74fa
PH
1479 while (len > 0)
1480 { if (body[--len] == 0) body[len] = ' '; }
1481 }
1482 else
1483 {
1484 while (len > 0)
1485 { if (body[--len] == '\n' || body[len] == 0) body[len] = ' '; }
059ec3d9
PH
1486 }
1487 }
1488 }
1489 return (*ss == NULL)? US"" : *ss;
1490
1491 case vtype_todbsdin: /* BSD inbox time of day */
1492 return tod_stamp(tod_bsdin);
1493
1494 case vtype_tode: /* Unix epoch time of day */
1495 return tod_stamp(tod_epoch);
1496
1497 case vtype_todf: /* Full time of day */
1498 return tod_stamp(tod_full);
1499
1500 case vtype_todl: /* Log format time of day */
1501 return tod_stamp(tod_log_bare); /* (without timezone) */
1502
1503 case vtype_todzone: /* Time zone offset only */
1504 return tod_stamp(tod_zone);
1505
1506 case vtype_todzulu: /* Zulu time */
1507 return tod_stamp(tod_zulu);
1508
1509 case vtype_todlf: /* Log file datestamp tod */
1510 return tod_stamp(tod_log_datestamp);
1511
1512 case vtype_reply: /* Get reply address */
c8ea1597 1513 s = find_header(US"reply-to:", exists_only, newsize, TRUE,
059ec3d9 1514 headers_charset);
6979240a 1515 if (s != NULL) while (isspace(*s)) s++;
059ec3d9 1516 if (s == NULL || *s == 0)
41a13e0a
PH
1517 {
1518 *newsize = 0; /* For the *s==0 case */
c8ea1597
PH
1519 s = find_header(US"from:", exists_only, newsize, TRUE, headers_charset);
1520 }
1521 if (s != NULL)
1522 {
1523 uschar *t;
1524 while (isspace(*s)) s++;
1525 for (t = s; *t != 0; t++) if (*t == '\n') *t = ' ';
6979240a
PH
1526 while (t > s && isspace(t[-1])) t--;
1527 *t = 0;
41a13e0a 1528 }
059ec3d9
PH
1529 return (s == NULL)? US"" : s;
1530
1531 /* A recipients list is available only during system message filtering,
1532 during ACL processing after DATA, and while expanding pipe commands
1533 generated from a system filter, but not elsewhere. */
1534
1535 case vtype_recipients:
1536 if (!enable_dollar_recipients) return NULL; else
1537 {
1538 int size = 128;
1539 int ptr = 0;
1540 int i;
1541 s = store_get(size);
1542 for (i = 0; i < recipients_count; i++)
1543 {
1544 if (i != 0) s = string_cat(s, &size, &ptr, US", ", 2);
1545 s = string_cat(s, &size, &ptr, recipients_list[i].address,
1546 Ustrlen(recipients_list[i].address));
1547 }
1548 s[ptr] = 0; /* string_cat() leaves room */
1549 }
1550 return s;
8e669ac1 1551
5cb8cbc6
PH
1552 case vtype_pspace:
1553 {
1554 int inodes;
8e669ac1
PH
1555 sprintf(CS var_buffer, "%d",
1556 receive_statvfs(var_table[middle].value == (void *)TRUE, &inodes));
5cb8cbc6
PH
1557 }
1558 return var_buffer;
8e669ac1 1559
5cb8cbc6
PH
1560 case vtype_pinodes:
1561 {
1562 int inodes;
8e669ac1 1563 (void) receive_statvfs(var_table[middle].value == (void *)TRUE, &inodes);
5cb8cbc6
PH
1564 sprintf(CS var_buffer, "%d", inodes);
1565 }
1566 return var_buffer;
80a47a2c 1567
c8307c12 1568 #ifndef DISABLE_DKIM
80a47a2c 1569 case vtype_dkim:
da5dfc3a 1570 return dkim_exim_expand_query((int)(long)var_table[middle].value);
80a47a2c
TK
1571 #endif
1572
059ec3d9
PH
1573 }
1574 }
1575
1576return NULL; /* Unknown variable name */
1577}
1578
1579
1580
1581
1582/*************************************************
1583* Read and expand substrings *
1584*************************************************/
1585
1586/* This function is called to read and expand argument substrings for various
1587expansion items. Some have a minimum requirement that is less than the maximum;
1588in these cases, the first non-present one is set to NULL.
1589
1590Arguments:
1591 sub points to vector of pointers to set
1592 n maximum number of substrings
1593 m minimum required
1594 sptr points to current string pointer
1595 skipping the skipping flag
1596 check_end if TRUE, check for final '}'
1597 name name of item, for error message
1598
1599Returns: 0 OK; string pointer updated
1600 1 curly bracketing error (too few arguments)
1601 2 too many arguments (only if check_end is set); message set
1602 3 other error (expansion failure)
1603*/
1604
1605static int
1606read_subs(uschar **sub, int n, int m, uschar **sptr, BOOL skipping,
1607 BOOL check_end, uschar *name)
1608{
1609int i;
1610uschar *s = *sptr;
1611
1612while (isspace(*s)) s++;
1613for (i = 0; i < n; i++)
1614 {
1615 if (*s != '{')
1616 {
1617 if (i < m) return 1;
1618 sub[i] = NULL;
1619 break;
1620 }
1621 sub[i] = expand_string_internal(s+1, TRUE, &s, skipping);
1622 if (sub[i] == NULL) return 3;
1623 if (*s++ != '}') return 1;
1624 while (isspace(*s)) s++;
1625 }
1626if (check_end && *s++ != '}')
1627 {
1628 if (s[-1] == '{')
1629 {
1630 expand_string_message = string_sprintf("Too many arguments for \"%s\" "
1631 "(max is %d)", name, n);
1632 return 2;
1633 }
1634 return 1;
1635 }
1636
1637*sptr = s;
1638return 0;
1639}
1640
1641
1642
1643
1644/*************************************************
641cb756
PH
1645* Elaborate message for bad variable *
1646*************************************************/
1647
1648/* For the "unknown variable" message, take a look at the variable's name, and
1649give additional information about possible ACL variables. The extra information
1650is added on to expand_string_message.
1651
1652Argument: the name of the variable
1653Returns: nothing
1654*/
1655
1656static void
1657check_variable_error_message(uschar *name)
1658{
1659if (Ustrncmp(name, "acl_", 4) == 0)
1660 expand_string_message = string_sprintf("%s (%s)", expand_string_message,
1661 (name[4] == 'c' || name[4] == 'm')?
1662 (isalpha(name[5])?
1663 US"6th character of a user-defined ACL variable must be a digit or underscore" :
1664 US"strict_acl_vars is set" /* Syntax is OK, it has to be this */
1665 ) :
1666 US"user-defined ACL variables must start acl_c or acl_m");
1667}
1668
1669
1670
1671/*************************************************
059ec3d9
PH
1672* Read and evaluate a condition *
1673*************************************************/
1674
1675/*
1676Arguments:
1677 s points to the start of the condition text
1678 yield points to a BOOL to hold the result of the condition test;
1679 if NULL, we are just reading through a condition that is
1680 part of an "or" combination to check syntax, or in a state
1681 where the answer isn't required
1682
1683Returns: a pointer to the first character after the condition, or
1684 NULL after an error
1685*/
1686
1687static uschar *
1688eval_condition(uschar *s, BOOL *yield)
1689{
1690BOOL testfor = TRUE;
1691BOOL tempcond, combined_cond;
1692BOOL *subcondptr;
1693int i, rc, cond_type, roffset;
1694int num[2];
1695struct stat statbuf;
1696uschar name[256];
1697uschar *sub[4];
1698
1699const pcre *re;
1700const uschar *rerror;
1701
1702for (;;)
1703 {
1704 while (isspace(*s)) s++;
1705 if (*s == '!') { testfor = !testfor; s++; } else break;
1706 }
1707
1708/* Numeric comparisons are symbolic */
1709
1710if (*s == '=' || *s == '>' || *s == '<')
1711 {
1712 int p = 0;
1713 name[p++] = *s++;
1714 if (*s == '=')
1715 {
1716 name[p++] = '=';
1717 s++;
1718 }
1719 name[p] = 0;
1720 }
1721
1722/* All other conditions are named */
1723
1724else s = read_name(name, 256, s, US"_");
1725
1726/* If we haven't read a name, it means some non-alpha character is first. */
1727
1728if (name[0] == 0)
1729 {
1730 expand_string_message = string_sprintf("condition name expected, "
1731 "but found \"%.16s\"", s);
1732 return NULL;
1733 }
1734
1735/* Find which condition we are dealing with, and switch on it */
1736
1737cond_type = chop_match(name, cond_table, sizeof(cond_table)/sizeof(uschar *));
1738switch(cond_type)
1739 {
9b4768fa
PH
1740 /* def: tests for a non-empty variable, or for the existence of a header. If
1741 yield == NULL we are in a skipping state, and don't care about the answer. */
059ec3d9
PH
1742
1743 case ECOND_DEF:
1744 if (*s != ':')
1745 {
1746 expand_string_message = US"\":\" expected after \"def\"";
1747 return NULL;
1748 }
1749
1750 s = read_name(name, 256, s+1, US"_");
1751
0d85fa3f
PH
1752 /* Test for a header's existence. If the name contains a closing brace
1753 character, this may be a user error where the terminating colon has been
1754 omitted. Set a flag to adjust a subsequent error message in this case. */
059ec3d9
PH
1755
1756 if (Ustrncmp(name, "h_", 2) == 0 ||
1757 Ustrncmp(name, "rh_", 3) == 0 ||
1758 Ustrncmp(name, "bh_", 3) == 0 ||
1759 Ustrncmp(name, "header_", 7) == 0 ||
1760 Ustrncmp(name, "rheader_", 8) == 0 ||
1761 Ustrncmp(name, "bheader_", 8) == 0)
1762 {
1763 s = read_header_name(name, 256, s);
0d85fa3f 1764 if (Ustrchr(name, '}') != NULL) malformed_header = TRUE;
059ec3d9
PH
1765 if (yield != NULL) *yield =
1766 (find_header(name, TRUE, NULL, FALSE, NULL) != NULL) == testfor;
1767 }
1768
9b4768fa
PH
1769 /* Test for a variable's having a non-empty value. A non-existent variable
1770 causes an expansion failure. */
059ec3d9
PH
1771
1772 else
1773 {
1774 uschar *value = find_variable(name, TRUE, yield == NULL, NULL);
1775 if (value == NULL)
1776 {
1777 expand_string_message = (name[0] == 0)?
1778 string_sprintf("variable name omitted after \"def:\"") :
1779 string_sprintf("unknown variable \"%s\" after \"def:\"", name);
641cb756 1780 check_variable_error_message(name);
059ec3d9
PH
1781 return NULL;
1782 }
9b4768fa 1783 if (yield != NULL) *yield = (value[0] != 0) == testfor;
059ec3d9
PH
1784 }
1785
1786 return s;
1787
1788
1789 /* first_delivery tests for first delivery attempt */
1790
1791 case ECOND_FIRST_DELIVERY:
1792 if (yield != NULL) *yield = deliver_firsttime == testfor;
1793 return s;
1794
1795
1796 /* queue_running tests for any process started by a queue runner */
1797
1798 case ECOND_QUEUE_RUNNING:
1799 if (yield != NULL) *yield = (queue_run_pid != (pid_t)0) == testfor;
1800 return s;
1801
1802
1803 /* exists: tests for file existence
1804 isip: tests for any IP address
1805 isip4: tests for an IPv4 address
1806 isip6: tests for an IPv6 address
1807 pam: does PAM authentication
1808 radius: does RADIUS authentication
1809 ldapauth: does LDAP authentication
1810 pwcheck: does Cyrus SASL pwcheck authentication
1811 */
1812
1813 case ECOND_EXISTS:
1814 case ECOND_ISIP:
1815 case ECOND_ISIP4:
1816 case ECOND_ISIP6:
1817 case ECOND_PAM:
1818 case ECOND_RADIUS:
1819 case ECOND_LDAPAUTH:
1820 case ECOND_PWCHECK:
1821
1822 while (isspace(*s)) s++;
1823 if (*s != '{') goto COND_FAILED_CURLY_START;
1824
1825 sub[0] = expand_string_internal(s+1, TRUE, &s, yield == NULL);
1826 if (sub[0] == NULL) return NULL;
1827 if (*s++ != '}') goto COND_FAILED_CURLY_END;
1828
1829 if (yield == NULL) return s; /* No need to run the test if skipping */
1830
1831 switch(cond_type)
1832 {
1833 case ECOND_EXISTS:
1834 if ((expand_forbid & RDO_EXISTS) != 0)
1835 {
1836 expand_string_message = US"File existence tests are not permitted";
1837 return NULL;
1838 }
1839 *yield = (Ustat(sub[0], &statbuf) == 0) == testfor;
1840 break;
1841
1842 case ECOND_ISIP:
1843 case ECOND_ISIP4:
1844 case ECOND_ISIP6:
1845 rc = string_is_ip_address(sub[0], NULL);
7e66e54d 1846 *yield = ((cond_type == ECOND_ISIP)? (rc != 0) :
059ec3d9
PH
1847 (cond_type == ECOND_ISIP4)? (rc == 4) : (rc == 6)) == testfor;
1848 break;
1849
1850 /* Various authentication tests - all optionally compiled */
1851
1852 case ECOND_PAM:
1853 #ifdef SUPPORT_PAM
1854 rc = auth_call_pam(sub[0], &expand_string_message);
1855 goto END_AUTH;
1856 #else
1857 goto COND_FAILED_NOT_COMPILED;
1858 #endif /* SUPPORT_PAM */
1859
1860 case ECOND_RADIUS:
1861 #ifdef RADIUS_CONFIG_FILE
1862 rc = auth_call_radius(sub[0], &expand_string_message);
1863 goto END_AUTH;
1864 #else
1865 goto COND_FAILED_NOT_COMPILED;
1866 #endif /* RADIUS_CONFIG_FILE */
1867
1868 case ECOND_LDAPAUTH:
1869 #ifdef LOOKUP_LDAP
1870 {
1871 /* Just to keep the interface the same */
1872 BOOL do_cache;
1873 int old_pool = store_pool;
1874 store_pool = POOL_SEARCH;
1875 rc = eldapauth_find((void *)(-1), NULL, sub[0], Ustrlen(sub[0]), NULL,
1876 &expand_string_message, &do_cache);
1877 store_pool = old_pool;
1878 }
1879 goto END_AUTH;
1880 #else
1881 goto COND_FAILED_NOT_COMPILED;
1882 #endif /* LOOKUP_LDAP */
1883
1884 case ECOND_PWCHECK:
1885 #ifdef CYRUS_PWCHECK_SOCKET
1886 rc = auth_call_pwcheck(sub[0], &expand_string_message);
1887 goto END_AUTH;
1888 #else
1889 goto COND_FAILED_NOT_COMPILED;
1890 #endif /* CYRUS_PWCHECK_SOCKET */
1891
1892 #if defined(SUPPORT_PAM) || defined(RADIUS_CONFIG_FILE) || \
1893 defined(LOOKUP_LDAP) || defined(CYRUS_PWCHECK_SOCKET)
1894 END_AUTH:
1895 if (rc == ERROR || rc == DEFER) return NULL;
1896 *yield = (rc == OK) == testfor;
1897 #endif
1898 }
1899 return s;
1900
1901
1902 /* saslauthd: does Cyrus saslauthd authentication. Four parameters are used:
1903
1904 ${if saslauthd {{username}{password}{service}{realm}} {yes}[no}}
1905
1906 However, the last two are optional. That is why the whole set is enclosed
1907 in their own set or braces. */
1908
1909 case ECOND_SASLAUTHD:
1910 #ifndef CYRUS_SASLAUTHD_SOCKET
1911 goto COND_FAILED_NOT_COMPILED;
1912 #else
1913 while (isspace(*s)) s++;
1914 if (*s++ != '{') goto COND_FAILED_CURLY_START;
1915 switch(read_subs(sub, 4, 2, &s, yield == NULL, TRUE, US"saslauthd"))
1916 {
1917 case 1: expand_string_message = US"too few arguments or bracketing "
1918 "error for saslauthd";
1919 case 2:
1920 case 3: return NULL;
1921 }
1922 if (sub[2] == NULL) sub[3] = NULL; /* realm if no service */
1923 if (yield != NULL)
1924 {
1925 int rc;
1926 rc = auth_call_saslauthd(sub[0], sub[1], sub[2], sub[3],
1927 &expand_string_message);
1928 if (rc == ERROR || rc == DEFER) return NULL;
1929 *yield = (rc == OK) == testfor;
1930 }
1931 return s;
1932 #endif /* CYRUS_SASLAUTHD_SOCKET */
1933
1934
1935 /* symbolic operators for numeric and string comparison, and a number of
1936 other operators, all requiring two arguments.
1937
1938 match: does a regular expression match and sets up the numerical
1939 variables if it succeeds
1940 match_address: matches in an address list
1941 match_domain: matches in a domain list
32d668a5 1942 match_ip: matches a host list that is restricted to IP addresses
059ec3d9
PH
1943 match_local_part: matches in a local part list
1944 crypteq: encrypts plaintext and compares against an encrypted text,
1945 using crypt(), crypt16(), MD5 or SHA-1
1946 */
1947
1948 case ECOND_MATCH:
1949 case ECOND_MATCH_ADDRESS:
1950 case ECOND_MATCH_DOMAIN:
32d668a5 1951 case ECOND_MATCH_IP:
059ec3d9
PH
1952 case ECOND_MATCH_LOCAL_PART:
1953 case ECOND_CRYPTEQ:
1954
1955 case ECOND_NUM_L: /* Numerical comparisons */
1956 case ECOND_NUM_LE:
1957 case ECOND_NUM_E:
1958 case ECOND_NUM_EE:
1959 case ECOND_NUM_G:
1960 case ECOND_NUM_GE:
1961
1962 case ECOND_STR_LT: /* String comparisons */
1963 case ECOND_STR_LTI:
1964 case ECOND_STR_LE:
1965 case ECOND_STR_LEI:
1966 case ECOND_STR_EQ:
1967 case ECOND_STR_EQI:
1968 case ECOND_STR_GT:
1969 case ECOND_STR_GTI:
1970 case ECOND_STR_GE:
1971 case ECOND_STR_GEI:
1972
1973 for (i = 0; i < 2; i++)
1974 {
1975 while (isspace(*s)) s++;
1976 if (*s != '{')
1977 {
1978 if (i == 0) goto COND_FAILED_CURLY_START;
1979 expand_string_message = string_sprintf("missing 2nd string in {} "
1980 "after \"%s\"", name);
1981 return NULL;
1982 }
1983 sub[i] = expand_string_internal(s+1, TRUE, &s, yield == NULL);
1984 if (sub[i] == NULL) return NULL;
1985 if (*s++ != '}') goto COND_FAILED_CURLY_END;
1986
1987 /* Convert to numerical if required; we know that the names of all the
1988 conditions that compare numbers do not start with a letter. This just saves
1989 checking for them individually. */
1990
d6066548 1991 if (!isalpha(name[0]) && yield != NULL)
059ec3d9 1992 {
5dd1517f
PH
1993 if (sub[i][0] == 0)
1994 {
1995 num[i] = 0;
1996 DEBUG(D_expand)
1997 debug_printf("empty string cast to zero for numerical comparison\n");
1998 }
1999 else
2000 {
2001 num[i] = expand_string_integer(sub[i], FALSE);
2002 if (expand_string_message != NULL) return NULL;
2003 }
059ec3d9
PH
2004 }
2005 }
2006
2007 /* Result not required */
2008
2009 if (yield == NULL) return s;
2010
2011 /* Do an appropriate comparison */
2012
2013 switch(cond_type)
2014 {
2015 case ECOND_NUM_E:
2016 case ECOND_NUM_EE:
2017 *yield = (num[0] == num[1]) == testfor;
2018 break;
2019
2020 case ECOND_NUM_G:
2021 *yield = (num[0] > num[1]) == testfor;
2022 break;
2023
2024 case ECOND_NUM_GE:
2025 *yield = (num[0] >= num[1]) == testfor;
2026 break;
2027
2028 case ECOND_NUM_L:
2029 *yield = (num[0] < num[1]) == testfor;
2030 break;
2031
2032 case ECOND_NUM_LE:
2033 *yield = (num[0] <= num[1]) == testfor;
2034 break;
2035
2036 case ECOND_STR_LT:
2037 *yield = (Ustrcmp(sub[0], sub[1]) < 0) == testfor;
2038 break;
2039
2040 case ECOND_STR_LTI:
2041 *yield = (strcmpic(sub[0], sub[1]) < 0) == testfor;
2042 break;
2043
2044 case ECOND_STR_LE:
2045 *yield = (Ustrcmp(sub[0], sub[1]) <= 0) == testfor;
2046 break;
2047
2048 case ECOND_STR_LEI:
2049 *yield = (strcmpic(sub[0], sub[1]) <= 0) == testfor;
2050 break;
2051
2052 case ECOND_STR_EQ:
2053 *yield = (Ustrcmp(sub[0], sub[1]) == 0) == testfor;
2054 break;
2055
2056 case ECOND_STR_EQI:
2057 *yield = (strcmpic(sub[0], sub[1]) == 0) == testfor;
2058 break;
2059
2060 case ECOND_STR_GT:
2061 *yield = (Ustrcmp(sub[0], sub[1]) > 0) == testfor;
2062 break;
2063
2064 case ECOND_STR_GTI:
2065 *yield = (strcmpic(sub[0], sub[1]) > 0) == testfor;
2066 break;
2067
2068 case ECOND_STR_GE:
2069 *yield = (Ustrcmp(sub[0], sub[1]) >= 0) == testfor;
2070 break;
2071
2072 case ECOND_STR_GEI:
2073 *yield = (strcmpic(sub[0], sub[1]) >= 0) == testfor;
2074 break;
2075
2076 case ECOND_MATCH: /* Regular expression match */
2077 re = pcre_compile(CS sub[1], PCRE_COPT, (const char **)&rerror, &roffset,
2078 NULL);
2079 if (re == NULL)
2080 {
2081 expand_string_message = string_sprintf("regular expression error in "
2082 "\"%s\": %s at offset %d", sub[1], rerror, roffset);
2083 return NULL;
2084 }
2085 *yield = regex_match_and_setup(re, sub[0], 0, -1) == testfor;
2086 break;
2087
2088 case ECOND_MATCH_ADDRESS: /* Match in an address list */
2089 rc = match_address_list(sub[0], TRUE, FALSE, &(sub[1]), NULL, -1, 0, NULL);
2090 goto MATCHED_SOMETHING;
2091
2092 case ECOND_MATCH_DOMAIN: /* Match in a domain list */
2093 rc = match_isinlist(sub[0], &(sub[1]), 0, &domainlist_anchor, NULL,
2094 MCL_DOMAIN + MCL_NOEXPAND, TRUE, NULL);
2095 goto MATCHED_SOMETHING;
2096
32d668a5 2097 case ECOND_MATCH_IP: /* Match IP address in a host list */
7e66e54d 2098 if (sub[0][0] != 0 && string_is_ip_address(sub[0], NULL) == 0)
32d668a5
PH
2099 {
2100 expand_string_message = string_sprintf("\"%s\" is not an IP address",
2101 sub[0]);
2102 return NULL;
2103 }
2104 else
2105 {
2106 unsigned int *nullcache = NULL;
2107 check_host_block cb;
2108
2109 cb.host_name = US"";
2110 cb.host_address = sub[0];
2111
2112 /* If the host address starts off ::ffff: it is an IPv6 address in
2113 IPv4-compatible mode. Find the IPv4 part for checking against IPv4
2114 addresses. */
2115
2116 cb.host_ipv4 = (Ustrncmp(cb.host_address, "::ffff:", 7) == 0)?
2117 cb.host_address + 7 : cb.host_address;
2118
2119 rc = match_check_list(
2120 &sub[1], /* the list */
2121 0, /* separator character */
2122 &hostlist_anchor, /* anchor pointer */
2123 &nullcache, /* cache pointer */
2124 check_host, /* function for testing */
2125 &cb, /* argument for function */
2126 MCL_HOST, /* type of check */
2127 sub[0], /* text for debugging */
2128 NULL); /* where to pass back data */
2129 }
2130 goto MATCHED_SOMETHING;
2131
059ec3d9
PH
2132 case ECOND_MATCH_LOCAL_PART:
2133 rc = match_isinlist(sub[0], &(sub[1]), 0, &localpartlist_anchor, NULL,
2134 MCL_LOCALPART + MCL_NOEXPAND, TRUE, NULL);
2135 /* Fall through */
9a26b6b2 2136 /* VVVVVVVVVVVV */
059ec3d9
PH
2137 MATCHED_SOMETHING:
2138 switch(rc)
2139 {
2140 case OK:
2141 *yield = testfor;
2142 break;
2143
2144 case FAIL:
2145 *yield = !testfor;
2146 break;
2147
2148 case DEFER:
2149 expand_string_message = string_sprintf("unable to complete match "
2150 "against \"%s\": %s", sub[1], search_error_message);
2151 return NULL;
2152 }
2153
2154 break;
2155
2156 /* Various "encrypted" comparisons. If the second string starts with
2157 "{" then an encryption type is given. Default to crypt() or crypt16()
2158 (build-time choice). */
2159
2160 case ECOND_CRYPTEQ:
2161 #ifndef SUPPORT_CRYPTEQ
2162 goto COND_FAILED_NOT_COMPILED;
2163 #else
2164 if (strncmpic(sub[1], US"{md5}", 5) == 0)
2165 {
2166 int sublen = Ustrlen(sub[1]+5);
2167 md5 base;
2168 uschar digest[16];
2169
2170 md5_start(&base);
2171 md5_end(&base, (uschar *)sub[0], Ustrlen(sub[0]), digest);
2172
2173 /* If the length that we are comparing against is 24, the MD5 digest
2174 is expressed as a base64 string. This is the way LDAP does it. However,
2175 some other software uses a straightforward hex representation. We assume
2176 this if the length is 32. Other lengths fail. */
2177
2178 if (sublen == 24)
2179 {
2180 uschar *coded = auth_b64encode((uschar *)digest, 16);
2181 DEBUG(D_auth) debug_printf("crypteq: using MD5+B64 hashing\n"
2182 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
2183 *yield = (Ustrcmp(coded, sub[1]+5) == 0) == testfor;
2184 }
2185 else if (sublen == 32)
2186 {
2187 int i;
2188 uschar coded[36];
2189 for (i = 0; i < 16; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
2190 coded[32] = 0;
2191 DEBUG(D_auth) debug_printf("crypteq: using MD5+hex hashing\n"
2192 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
2193 *yield = (strcmpic(coded, sub[1]+5) == 0) == testfor;
2194 }
2195 else
2196 {
2197 DEBUG(D_auth) debug_printf("crypteq: length for MD5 not 24 or 32: "
2198 "fail\n crypted=%s\n", sub[1]+5);
2199 *yield = !testfor;
2200 }
2201 }
2202
2203 else if (strncmpic(sub[1], US"{sha1}", 6) == 0)
2204 {
2205 int sublen = Ustrlen(sub[1]+6);
2206 sha1 base;
2207 uschar digest[20];
2208
2209 sha1_start(&base);
2210 sha1_end(&base, (uschar *)sub[0], Ustrlen(sub[0]), digest);
2211
2212 /* If the length that we are comparing against is 28, assume the SHA1
2213 digest is expressed as a base64 string. If the length is 40, assume a
2214 straightforward hex representation. Other lengths fail. */
2215
2216 if (sublen == 28)
2217 {
2218 uschar *coded = auth_b64encode((uschar *)digest, 20);
2219 DEBUG(D_auth) debug_printf("crypteq: using SHA1+B64 hashing\n"
2220 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
2221 *yield = (Ustrcmp(coded, sub[1]+6) == 0) == testfor;
2222 }
2223 else if (sublen == 40)
2224 {
2225 int i;
2226 uschar coded[44];
2227 for (i = 0; i < 20; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
2228 coded[40] = 0;
2229 DEBUG(D_auth) debug_printf("crypteq: using SHA1+hex hashing\n"
2230 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
2231 *yield = (strcmpic(coded, sub[1]+6) == 0) == testfor;
2232 }
2233 else
2234 {
2235 DEBUG(D_auth) debug_printf("crypteq: length for SHA-1 not 28 or 40: "
2236 "fail\n crypted=%s\n", sub[1]+6);
2237 *yield = !testfor;
2238 }
2239 }
2240
2241 else /* {crypt} or {crypt16} and non-{ at start */
2242 {
2243 int which = 0;
2244 uschar *coded;
2245
2246 if (strncmpic(sub[1], US"{crypt}", 7) == 0)
2247 {
2248 sub[1] += 7;
2249 which = 1;
2250 }
2251 else if (strncmpic(sub[1], US"{crypt16}", 9) == 0)
2252 {
2253 sub[1] += 9;
2254 which = 2;
2255 }
2256 else if (sub[1][0] == '{')
2257 {
2258 expand_string_message = string_sprintf("unknown encryption mechanism "
2259 "in \"%s\"", sub[1]);
2260 return NULL;
2261 }
2262
2263 switch(which)
2264 {
2265 case 0: coded = US DEFAULT_CRYPT(CS sub[0], CS sub[1]); break;
2266 case 1: coded = US crypt(CS sub[0], CS sub[1]); break;
2267 default: coded = US crypt16(CS sub[0], CS sub[1]); break;
2268 }
2269
2270 #define STR(s) # s
2271 #define XSTR(s) STR(s)
2272 DEBUG(D_auth) debug_printf("crypteq: using %s()\n"
2273 " subject=%s\n crypted=%s\n",
2274 (which == 0)? XSTR(DEFAULT_CRYPT) : (which == 1)? "crypt" : "crypt16",
2275 coded, sub[1]);
2276 #undef STR
2277 #undef XSTR
2278
2279 /* If the encrypted string contains fewer than two characters (for the
2280 salt), force failure. Otherwise we get false positives: with an empty
2281 string the yield of crypt() is an empty string! */
2282
2283 *yield = (Ustrlen(sub[1]) < 2)? !testfor :
2284 (Ustrcmp(coded, sub[1]) == 0) == testfor;
2285 }
2286 break;
2287 #endif /* SUPPORT_CRYPTEQ */
2288 } /* Switch for comparison conditions */
2289
2290 return s; /* End of comparison conditions */
2291
2292
2293 /* and/or: computes logical and/or of several conditions */
2294
2295 case ECOND_AND:
2296 case ECOND_OR:
2297 subcondptr = (yield == NULL)? NULL : &tempcond;
2298 combined_cond = (cond_type == ECOND_AND);
2299
2300 while (isspace(*s)) s++;
2301 if (*s++ != '{') goto COND_FAILED_CURLY_START;
2302
2303 for (;;)
2304 {
2305 while (isspace(*s)) s++;
2306 if (*s == '}') break;
2307 if (*s != '{')
2308 {
2309 expand_string_message = string_sprintf("each subcondition "
2310 "inside an \"%s{...}\" condition must be in its own {}", name);
2311 return NULL;
2312 }
2313
2314 s = eval_condition(s+1, subcondptr);
2315 if (s == NULL)
2316 {
2317 expand_string_message = string_sprintf("%s inside \"%s{...}\" condition",
2318 expand_string_message, name);
2319 return NULL;
2320 }
2321 while (isspace(*s)) s++;
2322
2323 if (*s++ != '}')
2324 {
2325 expand_string_message = string_sprintf("missing } at end of condition "
2326 "inside \"%s\" group", name);
2327 return NULL;
2328 }
2329
2330 if (yield != NULL)
2331 {
2332 if (cond_type == ECOND_AND)
2333 {
2334 combined_cond &= tempcond;
2335 if (!combined_cond) subcondptr = NULL; /* once false, don't */
2336 } /* evaluate any more */
2337 else
2338 {
2339 combined_cond |= tempcond;
2340 if (combined_cond) subcondptr = NULL; /* once true, don't */
2341 } /* evaluate any more */
2342 }
2343 }
2344
2345 if (yield != NULL) *yield = (combined_cond == testfor);
2346 return ++s;
2347
2348
0ce9abe6
PH
2349 /* forall/forany: iterates a condition with different values */
2350
2351 case ECOND_FORALL:
2352 case ECOND_FORANY:
2353 {
2354 int sep = 0;
282b357d 2355 uschar *save_iterate_item = iterate_item;
0ce9abe6
PH
2356
2357 while (isspace(*s)) s++;
2358 if (*s++ != '{') goto COND_FAILED_CURLY_START;
0ce9abe6
PH
2359 sub[0] = expand_string_internal(s, TRUE, &s, (yield == NULL));
2360 if (sub[0] == NULL) return NULL;
2361 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2362
2363 while (isspace(*s)) s++;
2364 if (*s++ != '{') goto COND_FAILED_CURLY_START;
2365
2366 sub[1] = s;
2367
2368 /* Call eval_condition once, with result discarded (as if scanning a
2369 "false" part). This allows us to find the end of the condition, because if
2370 the list it empty, we won't actually evaluate the condition for real. */
2371
2372 s = eval_condition(sub[1], NULL);
2373 if (s == NULL)
2374 {
2375 expand_string_message = string_sprintf("%s inside \"%s\" condition",
2376 expand_string_message, name);
2377 return NULL;
2378 }
2379 while (isspace(*s)) s++;
2380
2381 if (*s++ != '}')
2382 {
2383 expand_string_message = string_sprintf("missing } at end of condition "
2384 "inside \"%s\"", name);
2385 return NULL;
2386 }
2387
2388 if (yield != NULL) *yield = !testfor;
2389 while ((iterate_item = string_nextinlist(&sub[0], &sep, NULL, 0)) != NULL)
2390 {
2391 DEBUG(D_expand) debug_printf("%s: $item = \"%s\"\n", name, iterate_item);
2392 if (eval_condition(sub[1], &tempcond) == NULL)
2393 {
2394 expand_string_message = string_sprintf("%s inside \"%s\" condition",
2395 expand_string_message, name);
e58c13cc 2396 iterate_item = save_iterate_item;
0ce9abe6
PH
2397 return NULL;
2398 }
2399 DEBUG(D_expand) debug_printf("%s: condition evaluated to %s\n", name,
2400 tempcond? "true":"false");
2401
2402 if (yield != NULL) *yield = (tempcond == testfor);
2403 if (tempcond == (cond_type == ECOND_FORANY)) break;
2404 }
2405
282b357d 2406 iterate_item = save_iterate_item;
0ce9abe6
PH
2407 return s;
2408 }
2409
2410
059ec3d9
PH
2411 /* Unknown condition */
2412
2413 default:
2414 expand_string_message = string_sprintf("unknown condition \"%s\"", name);
2415 return NULL;
2416 } /* End switch on condition type */
2417
2418/* Missing braces at start and end of data */
2419
2420COND_FAILED_CURLY_START:
2421expand_string_message = string_sprintf("missing { after \"%s\"", name);
2422return NULL;
2423
2424COND_FAILED_CURLY_END:
2425expand_string_message = string_sprintf("missing } at end of \"%s\" condition",
2426 name);
2427return NULL;
2428
2429/* A condition requires code that is not compiled */
2430
2431#if !defined(SUPPORT_PAM) || !defined(RADIUS_CONFIG_FILE) || \
2432 !defined(LOOKUP_LDAP) || !defined(CYRUS_PWCHECK_SOCKET) || \
2433 !defined(SUPPORT_CRYPTEQ) || !defined(CYRUS_SASLAUTHD_SOCKET)
2434COND_FAILED_NOT_COMPILED:
2435expand_string_message = string_sprintf("support for \"%s\" not compiled",
2436 name);
2437return NULL;
2438#endif
2439}
2440
2441
2442
2443
2444/*************************************************
2445* Save numerical variables *
2446*************************************************/
2447
2448/* This function is called from items such as "if" that want to preserve and
2449restore the numbered variables.
2450
2451Arguments:
2452 save_expand_string points to an array of pointers to set
2453 save_expand_nlength points to an array of ints for the lengths
2454
2455Returns: the value of expand max to save
2456*/
2457
2458static int
2459save_expand_strings(uschar **save_expand_nstring, int *save_expand_nlength)
2460{
2461int i;
2462for (i = 0; i <= expand_nmax; i++)
2463 {
2464 save_expand_nstring[i] = expand_nstring[i];
2465 save_expand_nlength[i] = expand_nlength[i];
2466 }
2467return expand_nmax;
2468}
2469
2470
2471
2472/*************************************************
2473* Restore numerical variables *
2474*************************************************/
2475
2476/* This function restored saved values of numerical strings.
2477
2478Arguments:
2479 save_expand_nmax the number of strings to restore
2480 save_expand_string points to an array of pointers
2481 save_expand_nlength points to an array of ints
2482
2483Returns: nothing
2484*/
2485
2486static void
2487restore_expand_strings(int save_expand_nmax, uschar **save_expand_nstring,
2488 int *save_expand_nlength)
2489{
2490int i;
2491expand_nmax = save_expand_nmax;
2492for (i = 0; i <= expand_nmax; i++)
2493 {
2494 expand_nstring[i] = save_expand_nstring[i];
2495 expand_nlength[i] = save_expand_nlength[i];
2496 }
2497}
2498
2499
2500
2501
2502
2503/*************************************************
2504* Handle yes/no substrings *
2505*************************************************/
2506
2507/* This function is used by ${if}, ${lookup} and ${extract} to handle the
2508alternative substrings that depend on whether or not the condition was true,
2509or the lookup or extraction succeeded. The substrings always have to be
2510expanded, to check their syntax, but "skipping" is set when the result is not
2511needed - this avoids unnecessary nested lookups.
2512
2513Arguments:
2514 skipping TRUE if we were skipping when this item was reached
2515 yes TRUE if the first string is to be used, else use the second
2516 save_lookup a value to put back into lookup_value before the 2nd expansion
2517 sptr points to the input string pointer
2518 yieldptr points to the output string pointer
2519 sizeptr points to the output string size
2520 ptrptr points to the output string pointer
2521 type "lookup" or "if" or "extract" or "run", for error message
2522
2523Returns: 0 OK; lookup_value has been reset to save_lookup
2524 1 expansion failed
2525 2 expansion failed because of bracketing error
2526*/
2527
2528static int
2529process_yesno(BOOL skipping, BOOL yes, uschar *save_lookup, uschar **sptr,
2530 uschar **yieldptr, int *sizeptr, int *ptrptr, uschar *type)
2531{
2532int rc = 0;
2533uschar *s = *sptr; /* Local value */
2534uschar *sub1, *sub2;
2535
2536/* If there are no following strings, we substitute the contents of $value for
063b1e99 2537lookups and for extractions in the success case. For the ${if item, the string
8e669ac1 2538"true" is substituted. In the fail case, nothing is substituted for all three
063b1e99 2539items. */
059ec3d9
PH
2540
2541while (isspace(*s)) s++;
2542if (*s == '}')
2543 {
063b1e99
PH
2544 if (type[0] == 'i')
2545 {
8e669ac1 2546 if (yes) *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, US"true", 4);
063b1e99
PH
2547 }
2548 else
8e669ac1 2549 {
063b1e99
PH
2550 if (yes && lookup_value != NULL)
2551 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, lookup_value,
2552 Ustrlen(lookup_value));
2553 lookup_value = save_lookup;
2554 }
059ec3d9
PH
2555 s++;
2556 goto RETURN;
2557 }
2558
9b4768fa
PH
2559/* The first following string must be braced. */
2560
2561if (*s++ != '{') goto FAILED_CURLY;
2562
059ec3d9
PH
2563/* Expand the first substring. Forced failures are noticed only if we actually
2564want this string. Set skipping in the call in the fail case (this will always
2565be the case if we were already skipping). */
2566
9b4768fa 2567sub1 = expand_string_internal(s, TRUE, &s, !yes);
059ec3d9
PH
2568if (sub1 == NULL && (yes || !expand_string_forcedfail)) goto FAILED;
2569expand_string_forcedfail = FALSE;
2570if (*s++ != '}') goto FAILED_CURLY;
2571
2572/* If we want the first string, add it to the output */
2573
2574if (yes)
2575 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, sub1, Ustrlen(sub1));
2576
2577/* If this is called from a lookup or an extract, we want to restore $value to
2578what it was at the start of the item, so that it has this value during the
d20976dc
PH
2579second string expansion. For the call from "if" or "run" to this function,
2580save_lookup is set to lookup_value, so that this statement does nothing. */
059ec3d9
PH
2581
2582lookup_value = save_lookup;
2583
2584/* There now follows either another substring, or "fail", or nothing. This
2585time, forced failures are noticed only if we want the second string. We must
2586set skipping in the nested call if we don't want this string, or if we were
2587already skipping. */
2588
2589while (isspace(*s)) s++;
2590if (*s == '{')
2591 {
2592 sub2 = expand_string_internal(s+1, TRUE, &s, yes || skipping);
2593 if (sub2 == NULL && (!yes || !expand_string_forcedfail)) goto FAILED;
2594 expand_string_forcedfail = FALSE;
2595 if (*s++ != '}') goto FAILED_CURLY;
2596
2597 /* If we want the second string, add it to the output */
2598
2599 if (!yes)
2600 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, sub2, Ustrlen(sub2));
2601 }
2602
2603/* If there is no second string, but the word "fail" is present when the use of
2604the second string is wanted, set a flag indicating it was a forced failure
2605rather than a syntactic error. Swallow the terminating } in case this is nested
2606inside another lookup or if or extract. */
2607
2608else if (*s != '}')
2609 {
2610 uschar name[256];
2611 s = read_name(name, sizeof(name), s, US"_");
2612 if (Ustrcmp(name, "fail") == 0)
2613 {
2614 if (!yes && !skipping)
2615 {
2616 while (isspace(*s)) s++;
2617 if (*s++ != '}') goto FAILED_CURLY;
2618 expand_string_message =
2619 string_sprintf("\"%s\" failed and \"fail\" requested", type);
2620 expand_string_forcedfail = TRUE;
2621 goto FAILED;
2622 }
2623 }
2624 else
2625 {
2626 expand_string_message =
2627 string_sprintf("syntax error in \"%s\" item - \"fail\" expected", type);
2628 goto FAILED;
2629 }
2630 }
2631
2632/* All we have to do now is to check on the final closing brace. */
2633
2634while (isspace(*s)) s++;
2635if (*s++ == '}') goto RETURN;
2636
2637/* Get here if there is a bracketing failure */
2638
2639FAILED_CURLY:
2640rc++;
2641
2642/* Get here for other failures */
2643
2644FAILED:
2645rc++;
2646
2647/* Update the input pointer value before returning */
2648
2649RETURN:
2650*sptr = s;
2651return rc;
2652}
2653
2654
2655
2656
059ec3d9
PH
2657/*************************************************
2658* Handle MD5 or SHA-1 computation for HMAC *
2659*************************************************/
2660
2661/* These are some wrapping functions that enable the HMAC code to be a bit
2662cleaner. A good compiler will spot the tail recursion.
2663
2664Arguments:
2665 type HMAC_MD5 or HMAC_SHA1
2666 remaining are as for the cryptographic hash functions
2667
2668Returns: nothing
2669*/
2670
2671static void
2672chash_start(int type, void *base)
2673{
2674if (type == HMAC_MD5)
2675 md5_start((md5 *)base);
2676else
2677 sha1_start((sha1 *)base);
2678}
2679
2680static void
2681chash_mid(int type, void *base, uschar *string)
2682{
2683if (type == HMAC_MD5)
2684 md5_mid((md5 *)base, string);
2685else
2686 sha1_mid((sha1 *)base, string);
2687}
2688
2689static void
2690chash_end(int type, void *base, uschar *string, int length, uschar *digest)
2691{
2692if (type == HMAC_MD5)
2693 md5_end((md5 *)base, string, length, digest);
2694else
2695 sha1_end((sha1 *)base, string, length, digest);
2696}
2697
2698
2699
2700
2701
1549ea3b
PH
2702/********************************************************
2703* prvs: Get last three digits of days since Jan 1, 1970 *
2704********************************************************/
2705
2706/* This is needed to implement the "prvs" BATV reverse
2707 path signing scheme
2708
2709Argument: integer "days" offset to add or substract to
2710 or from the current number of days.
2711
2712Returns: pointer to string containing the last three
2713 digits of the number of days since Jan 1, 1970,
2714 modified by the offset argument, NULL if there
2715 was an error in the conversion.
2716
2717*/
2718
2719static uschar *
2720prvs_daystamp(int day_offset)
2721{
a86229cf
PH
2722uschar *days = store_get(32); /* Need at least 24 for cases */
2723(void)string_format(days, 32, TIME_T_FMT, /* where TIME_T_FMT is %lld */
1549ea3b 2724 (time(NULL) + day_offset*86400)/86400);
e169f567 2725return (Ustrlen(days) >= 3) ? &days[Ustrlen(days)-3] : US"100";
1549ea3b
PH
2726}
2727
2728
2729
2730/********************************************************
2731* prvs: perform HMAC-SHA1 computation of prvs bits *
2732********************************************************/
2733
2734/* This is needed to implement the "prvs" BATV reverse
2735 path signing scheme
2736
2737Arguments:
2738 address RFC2821 Address to use
2739 key The key to use (must be less than 64 characters
2740 in size)
2741 key_num Single-digit key number to use. Defaults to
2742 '0' when NULL.
2743
2744Returns: pointer to string containing the first three
2745 bytes of the final hash in hex format, NULL if
2746 there was an error in the process.
2747*/
2748
2749static uschar *
2750prvs_hmac_sha1(uschar *address, uschar *key, uschar *key_num, uschar *daystamp)
2751{
2752uschar *hash_source, *p;
2753int size = 0,offset = 0,i;
2754sha1 sha1_base;
2755void *use_base = &sha1_base;
2756uschar innerhash[20];
2757uschar finalhash[20];
2758uschar innerkey[64];
2759uschar outerkey[64];
2760uschar *finalhash_hex = store_get(40);
2761
2762if (key_num == NULL)
2763 key_num = US"0";
2764
2765if (Ustrlen(key) > 64)
2766 return NULL;
2767
2768hash_source = string_cat(NULL,&size,&offset,key_num,1);
2769string_cat(hash_source,&size,&offset,daystamp,3);
2770string_cat(hash_source,&size,&offset,address,Ustrlen(address));
2771hash_source[offset] = '\0';
2772
2773DEBUG(D_expand) debug_printf("prvs: hash source is '%s'\n", hash_source);
2774
2775memset(innerkey, 0x36, 64);
2776memset(outerkey, 0x5c, 64);
2777
2778for (i = 0; i < Ustrlen(key); i++)
2779 {
2780 innerkey[i] ^= key[i];
2781 outerkey[i] ^= key[i];
2782 }
2783
2784chash_start(HMAC_SHA1, use_base);
2785chash_mid(HMAC_SHA1, use_base, innerkey);
2786chash_end(HMAC_SHA1, use_base, hash_source, offset, innerhash);
2787
2788chash_start(HMAC_SHA1, use_base);
2789chash_mid(HMAC_SHA1, use_base, outerkey);
2790chash_end(HMAC_SHA1, use_base, innerhash, 20, finalhash);
2791
2792p = finalhash_hex;
2793for (i = 0; i < 3; i++)
2794 {
2795 *p++ = hex_digits[(finalhash[i] & 0xf0) >> 4];
2796 *p++ = hex_digits[finalhash[i] & 0x0f];
2797 }
2798*p = '\0';
2799
2800return finalhash_hex;
2801}
2802
2803
2804
2805
059ec3d9
PH
2806/*************************************************
2807* Join a file onto the output string *
2808*************************************************/
2809
2810/* This is used for readfile and after a run expansion. It joins the contents
2811of a file onto the output string, globally replacing newlines with a given
2812string (optionally). The file is closed at the end.
2813
2814Arguments:
2815 f the FILE
2816 yield pointer to the expandable string
2817 sizep pointer to the current size
2818 ptrp pointer to the current position
2819 eol newline replacement string, or NULL
2820
2821Returns: new value of string pointer
2822*/
2823
2824static uschar *
2825cat_file(FILE *f, uschar *yield, int *sizep, int *ptrp, uschar *eol)
2826{
2827int eollen;
2828uschar buffer[1024];
2829
2830eollen = (eol == NULL)? 0 : Ustrlen(eol);
2831
2832while (Ufgets(buffer, sizeof(buffer), f) != NULL)
2833 {
2834 int len = Ustrlen(buffer);
2835 if (eol != NULL && buffer[len-1] == '\n') len--;
2836 yield = string_cat(yield, sizep, ptrp, buffer, len);
2837 if (buffer[len] != 0)
2838 yield = string_cat(yield, sizep, ptrp, eol, eollen);
2839 }
2840
2841if (yield != NULL) yield[*ptrp] = 0;
2842
2843return yield;
2844}
2845
2846
2847
2848
2849/*************************************************
2850* Evaluate numeric expression *
2851*************************************************/
2852
af561417
PH
2853/* This is a set of mutually recursive functions that evaluate an arithmetic
2854expression involving + - * / % & | ^ ~ << >> and parentheses. The only one of
2855these functions that is called from elsewhere is eval_expr, whose interface is:
059ec3d9
PH
2856
2857Arguments:
af561417
PH
2858 sptr pointer to the pointer to the string - gets updated
2859 decimal TRUE if numbers are to be assumed decimal
2860 error pointer to where to put an error message - must be NULL on input
2861 endket TRUE if ')' must terminate - FALSE for external call
059ec3d9 2862
af561417
PH
2863Returns: on success: the value of the expression, with *error still NULL
2864 on failure: an undefined value, with *error = a message
059ec3d9
PH
2865*/
2866
af561417
PH
2867static int eval_op_or(uschar **, BOOL, uschar **);
2868
059ec3d9
PH
2869
2870static int
2871eval_expr(uschar **sptr, BOOL decimal, uschar **error, BOOL endket)
2872{
2873uschar *s = *sptr;
af561417 2874int x = eval_op_or(&s, decimal, error);
059ec3d9
PH
2875if (*error == NULL)
2876 {
af561417 2877 if (endket)
059ec3d9 2878 {
af561417
PH
2879 if (*s != ')')
2880 *error = US"expecting closing parenthesis";
2881 else
2882 while (isspace(*(++s)));
059ec3d9 2883 }
af561417 2884 else if (*s != 0) *error = US"expecting operator";
059ec3d9 2885 }
059ec3d9
PH
2886*sptr = s;
2887return x;
2888}
2889
af561417 2890
059ec3d9 2891static int
af561417 2892eval_number(uschar **sptr, BOOL decimal, uschar **error)
059ec3d9
PH
2893{
2894register int c;
2895int n;
2896uschar *s = *sptr;
2897while (isspace(*s)) s++;
2898c = *s;
af561417 2899if (isdigit(c))
059ec3d9
PH
2900 {
2901 int count;
2902 (void)sscanf(CS s, (decimal? "%d%n" : "%i%n"), &n, &count);
2903 s += count;
2904 if (tolower(*s) == 'k') { n *= 1024; s++; }
2905 else if (tolower(*s) == 'm') { n *= 1024*1024; s++; }
2906 while (isspace (*s)) s++;
2907 }
2908else if (c == '(')
2909 {
2910 s++;
2911 n = eval_expr(&s, decimal, error, 1);
2912 }
2913else
2914 {
2915 *error = US"expecting number or opening parenthesis";
2916 n = 0;
2917 }
2918*sptr = s;
2919return n;
2920}
2921
af561417
PH
2922
2923static int eval_op_unary(uschar **sptr, BOOL decimal, uschar **error)
2924{
2925uschar *s = *sptr;
2926int x;
2927while (isspace(*s)) s++;
2928if (*s == '+' || *s == '-' || *s == '~')
2929 {
2930 int op = *s++;
2931 x = eval_op_unary(&s, decimal, error);
2932 if (op == '-') x = -x;
2933 else if (op == '~') x = ~x;
2934 }
2935else
2936 {
2937 x = eval_number(&s, decimal, error);
2938 }
2939*sptr = s;
2940return x;
2941}
2942
2943
2944static int eval_op_mult(uschar **sptr, BOOL decimal, uschar **error)
059ec3d9
PH
2945{
2946uschar *s = *sptr;
af561417 2947int x = eval_op_unary(&s, decimal, error);
059ec3d9
PH
2948if (*error == NULL)
2949 {
5591031b 2950 while (*s == '*' || *s == '/' || *s == '%')
059ec3d9
PH
2951 {
2952 int op = *s++;
af561417 2953 int y = eval_op_unary(&s, decimal, error);
059ec3d9 2954 if (*error != NULL) break;
5591031b
PH
2955 if (op == '*') x *= y;
2956 else if (op == '/') x /= y;
2957 else x %= y;
059ec3d9
PH
2958 }
2959 }
2960*sptr = s;
2961return x;
2962}
2963
2964
af561417
PH
2965static int eval_op_sum(uschar **sptr, BOOL decimal, uschar **error)
2966{
2967uschar *s = *sptr;
2968int x = eval_op_mult(&s, decimal, error);
2969if (*error == NULL)
2970 {
2971 while (*s == '+' || *s == '-')
2972 {
2973 int op = *s++;
2974 int y = eval_op_mult(&s, decimal, error);
2975 if (*error != NULL) break;
2976 if (op == '+') x += y; else x -= y;
2977 }
2978 }
2979*sptr = s;
2980return x;
2981}
2982
2983
2984static int eval_op_shift(uschar **sptr, BOOL decimal, uschar **error)
2985{
2986uschar *s = *sptr;
2987int x = eval_op_sum(&s, decimal, error);
2988if (*error == NULL)
2989 {
2990 while ((*s == '<' || *s == '>') && s[1] == s[0])
2991 {
2992 int y;
2993 int op = *s++;
2994 s++;
2995 y = eval_op_sum(&s, decimal, error);
2996 if (*error != NULL) break;
2997 if (op == '<') x <<= y; else x >>= y;
2998 }
2999 }
3000*sptr = s;
3001return x;
3002}
3003
3004
3005static int eval_op_and(uschar **sptr, BOOL decimal, uschar **error)
3006{
3007uschar *s = *sptr;
3008int x = eval_op_shift(&s, decimal, error);
3009if (*error == NULL)
3010 {
3011 while (*s == '&')
3012 {
3013 int y;
3014 s++;
3015 y = eval_op_shift(&s, decimal, error);
3016 if (*error != NULL) break;
3017 x &= y;
3018 }
3019 }
3020*sptr = s;
3021return x;
3022}
3023
3024
3025static int eval_op_xor(uschar **sptr, BOOL decimal, uschar **error)
3026{
3027uschar *s = *sptr;
3028int x = eval_op_and(&s, decimal, error);
3029if (*error == NULL)
3030 {
3031 while (*s == '^')
3032 {
3033 int y;
3034 s++;
3035 y = eval_op_and(&s, decimal, error);
3036 if (*error != NULL) break;
3037 x ^= y;
3038 }
3039 }
3040*sptr = s;
3041return x;
3042}
3043
3044
3045static int eval_op_or(uschar **sptr, BOOL decimal, uschar **error)
3046{
3047uschar *s = *sptr;
3048int x = eval_op_xor(&s, decimal, error);
3049if (*error == NULL)
3050 {
3051 while (*s == '|')
3052 {
3053 int y;
3054 s++;
3055 y = eval_op_xor(&s, decimal, error);
3056 if (*error != NULL) break;
3057 x |= y;
3058 }
3059 }
3060*sptr = s;
3061return x;
3062}
3063
059ec3d9
PH
3064
3065
3066/*************************************************
3067* Expand string *
3068*************************************************/
3069
3070/* Returns either an unchanged string, or the expanded string in stacking pool
3071store. Interpreted sequences are:
3072
3073 \... normal escaping rules
3074 $name substitutes the variable
3075 ${name} ditto
3076 ${op:string} operates on the expanded string value
3077 ${item{arg1}{arg2}...} expands the args and then does the business
3078 some literal args are not enclosed in {}
3079
3080There are now far too many operators and item types to make it worth listing
3081them here in detail any more.
3082
3083We use an internal routine recursively to handle embedded substrings. The
3084external function follows. The yield is NULL if the expansion failed, and there
3085are two cases: if something collapsed syntactically, or if "fail" was given
3086as the action on a lookup failure. These can be distinguised by looking at the
3087variable expand_string_forcedfail, which is TRUE in the latter case.
3088
3089The skipping flag is set true when expanding a substring that isn't actually
3090going to be used (after "if" or "lookup") and it prevents lookups from
3091happening lower down.
3092
3093Store usage: At start, a store block of the length of the input plus 64
3094is obtained. This is expanded as necessary by string_cat(), which might have to
3095get a new block, or might be able to expand the original. At the end of the
3096function we can release any store above that portion of the yield block that
3097was actually used. In many cases this will be optimal.
3098
3099However: if the first item in the expansion is a variable name or header name,
3100we reset the store before processing it; if the result is in fresh store, we
3101use that without copying. This is helpful for expanding strings like
3102$message_headers which can get very long.
3103
d6b4d938
TF
3104There's a problem if a ${dlfunc item has side-effects that cause allocation,
3105since resetting the store at the end of the expansion will free store that was
3106allocated by the plugin code as well as the slop after the expanded string. So
3107we skip any resets if ${dlfunc has been used. This is an unfortunate
3108consequence of string expansion becoming too powerful.
3109
059ec3d9
PH
3110Arguments:
3111 string the string to be expanded
3112 ket_ends true if expansion is to stop at }
3113 left if not NULL, a pointer to the first character after the
3114 expansion is placed here (typically used with ket_ends)
3115 skipping TRUE for recursive calls when the value isn't actually going
3116 to be used (to allow for optimisation)
3117
3118Returns: NULL if expansion fails:
3119 expand_string_forcedfail is set TRUE if failure was forced
3120 expand_string_message contains a textual error message
3121 a pointer to the expanded string on success
3122*/
3123
3124static uschar *
3125expand_string_internal(uschar *string, BOOL ket_ends, uschar **left,
3126 BOOL skipping)
3127{
3128int ptr = 0;
3129int size = Ustrlen(string)+ 64;
3130int item_type;
3131uschar *yield = store_get(size);
3132uschar *s = string;
3133uschar *save_expand_nstring[EXPAND_MAXN+1];
3134int save_expand_nlength[EXPAND_MAXN+1];
d6b4d938 3135BOOL resetok = TRUE;
059ec3d9
PH
3136
3137expand_string_forcedfail = FALSE;
3138expand_string_message = US"";
3139
3140while (*s != 0)
3141 {
3142 uschar *value;
3143 uschar name[256];
3144
3145 /* \ escapes the next character, which must exist, or else
3146 the expansion fails. There's a special escape, \N, which causes
3147 copying of the subject verbatim up to the next \N. Otherwise,
3148 the escapes are the standard set. */
3149
3150 if (*s == '\\')
3151 {
3152 if (s[1] == 0)
3153 {
3154 expand_string_message = US"\\ at end of string";
3155 goto EXPAND_FAILED;
3156 }
3157
3158 if (s[1] == 'N')
3159 {
3160 uschar *t = s + 2;
3161 for (s = t; *s != 0; s++) if (*s == '\\' && s[1] == 'N') break;
3162 yield = string_cat(yield, &size, &ptr, t, s - t);
3163 if (*s != 0) s += 2;
3164 }
3165
3166 else
3167 {
3168 uschar ch[1];
3169 ch[0] = string_interpret_escape(&s);
3170 s++;
3171 yield = string_cat(yield, &size, &ptr, ch, 1);
3172 }
3173
3174 continue;
3175 }
3176
3177 /* Anything other than $ is just copied verbatim, unless we are
3178 looking for a terminating } character. */
3179
3180 if (ket_ends && *s == '}') break;
3181
3182 if (*s != '$')
3183 {
3184 yield = string_cat(yield, &size, &ptr, s++, 1);
3185 continue;
3186 }
3187
3188 /* No { after the $ - must be a plain name or a number for string
3189 match variable. There has to be a fudge for variables that are the
3190 names of header fields preceded by "$header_" because header field
3191 names can contain any printing characters except space and colon.
3192 For those that don't like typing this much, "$h_" is a synonym for
3193 "$header_". A non-existent header yields a NULL value; nothing is
3194 inserted. */
3195
3196 if (isalpha((*(++s))))
3197 {
3198 int len;
3199 int newsize = 0;
3200
3201 s = read_name(name, sizeof(name), s, US"_");
3202
3203 /* If this is the first thing to be expanded, release the pre-allocated
3204 buffer. */
3205
3206 if (ptr == 0 && yield != NULL)
3207 {
d6b4d938 3208 if (resetok) store_reset(yield);
059ec3d9
PH
3209 yield = NULL;
3210 size = 0;
3211 }
3212
3213 /* Header */
3214
3215 if (Ustrncmp(name, "h_", 2) == 0 ||
3216 Ustrncmp(name, "rh_", 3) == 0 ||
3217 Ustrncmp(name, "bh_", 3) == 0 ||
3218 Ustrncmp(name, "header_", 7) == 0 ||
3219 Ustrncmp(name, "rheader_", 8) == 0 ||
3220 Ustrncmp(name, "bheader_", 8) == 0)
3221 {
3222 BOOL want_raw = (name[0] == 'r')? TRUE : FALSE;
3223 uschar *charset = (name[0] == 'b')? NULL : headers_charset;
3224 s = read_header_name(name, sizeof(name), s);
3225 value = find_header(name, FALSE, &newsize, want_raw, charset);
3226
3227 /* If we didn't find the header, and the header contains a closing brace
0d85fa3f 3228 character, this may be a user error where the terminating colon
059ec3d9
PH
3229 has been omitted. Set a flag to adjust the error message in this case.
3230 But there is no error here - nothing gets inserted. */
3231
3232 if (value == NULL)
3233 {
3234 if (Ustrchr(name, '}') != NULL) malformed_header = TRUE;
3235 continue;
3236 }
3237 }
3238
3239 /* Variable */
3240
3241 else
3242 {
3243 value = find_variable(name, FALSE, skipping, &newsize);
3244 if (value == NULL)
3245 {
3246 expand_string_message =
3247 string_sprintf("unknown variable name \"%s\"", name);
641cb756 3248 check_variable_error_message(name);
059ec3d9
PH
3249 goto EXPAND_FAILED;
3250 }
3251 }
3252
3253 /* If the data is known to be in a new buffer, newsize will be set to the
3254 size of that buffer. If this is the first thing in an expansion string,
3255 yield will be NULL; just point it at the new store instead of copying. Many
3256 expansion strings contain just one reference, so this is a useful
3257 optimization, especially for humungous headers. */
3258
3259 len = Ustrlen(value);
3260 if (yield == NULL && newsize != 0)
3261 {
3262 yield = value;
3263 size = newsize;
3264 ptr = len;
3265 }
3266 else yield = string_cat(yield, &size, &ptr, value, len);
3267
3268 continue;
3269 }
3270
3271 if (isdigit(*s))
3272 {
3273 int n;
3274 s = read_number(&n, s);
3275 if (n >= 0 && n <= expand_nmax)
3276 yield = string_cat(yield, &size, &ptr, expand_nstring[n],
3277 expand_nlength[n]);
3278 continue;
3279 }
3280
3281 /* Otherwise, if there's no '{' after $ it's an error. */
3282
3283 if (*s != '{')
3284 {
3285 expand_string_message = US"$ not followed by letter, digit, or {";
3286 goto EXPAND_FAILED;
3287 }
3288
3289 /* After { there can be various things, but they all start with
3290 an initial word, except for a number for a string match variable. */
3291
3292 if (isdigit((*(++s))))
3293 {
3294 int n;
3295 s = read_number(&n, s);
3296 if (*s++ != '}')
3297 {
3298 expand_string_message = US"} expected after number";
3299 goto EXPAND_FAILED;
3300 }
3301 if (n >= 0 && n <= expand_nmax)
3302 yield = string_cat(yield, &size, &ptr, expand_nstring[n],
3303 expand_nlength[n]);
3304 continue;
3305 }
3306
3307 if (!isalpha(*s))
3308 {
3309 expand_string_message = US"letter or digit expected after ${";
3310 goto EXPAND_FAILED;
3311 }
3312
3313 /* Allow "-" in names to cater for substrings with negative
3314 arguments. Since we are checking for known names after { this is
3315 OK. */
3316
3317 s = read_name(name, sizeof(name), s, US"_-");
3318 item_type = chop_match(name, item_table, sizeof(item_table)/sizeof(uschar *));
3319
3320 switch(item_type)
3321 {
3322 /* Handle conditionals - preserve the values of the numerical expansion
3323 variables in case they get changed by a regular expression match in the
3324 condition. If not, they retain their external settings. At the end
3325 of this "if" section, they get restored to their previous values. */
3326
3327 case EITEM_IF:
3328 {
3329 BOOL cond = FALSE;
3330 uschar *next_s;
3331 int save_expand_nmax =
3332 save_expand_strings(save_expand_nstring, save_expand_nlength);
3333
3334 while (isspace(*s)) s++;
3335 next_s = eval_condition(s, skipping? NULL : &cond);
3336 if (next_s == NULL) goto EXPAND_FAILED; /* message already set */
3337
3338 DEBUG(D_expand)
3339 debug_printf("condition: %.*s\n result: %s\n", (int)(next_s - s), s,
3340 cond? "true" : "false");
3341
3342 s = next_s;
3343
3344 /* The handling of "yes" and "no" result strings is now in a separate
3345 function that is also used by ${lookup} and ${extract} and ${run}. */
3346
3347 switch(process_yesno(
3348 skipping, /* were previously skipping */
3349 cond, /* success/failure indicator */
3350 lookup_value, /* value to reset for string2 */
3351 &s, /* input pointer */
3352 &yield, /* output pointer */
3353 &size, /* output size */
3354 &ptr, /* output current point */
3355 US"if")) /* condition type */
3356 {
3357 case 1: goto EXPAND_FAILED; /* when all is well, the */
3358 case 2: goto EXPAND_FAILED_CURLY; /* returned value is 0 */
3359 }
3360
3361 /* Restore external setting of expansion variables for continuation
3362 at this level. */
3363
3364 restore_expand_strings(save_expand_nmax, save_expand_nstring,
3365 save_expand_nlength);
3366 continue;
3367 }
3368
3369 /* Handle database lookups unless locked out. If "skipping" is TRUE, we are
3370 expanding an internal string that isn't actually going to be used. All we
3371 need to do is check the syntax, so don't do a lookup at all. Preserve the
3372 values of the numerical expansion variables in case they get changed by a
3373 partial lookup. If not, they retain their external settings. At the end
3374 of this "lookup" section, they get restored to their previous values. */
3375
3376 case EITEM_LOOKUP:
3377 {
3378 int stype, partial, affixlen, starflags;
3379 int expand_setup = 0;
3380 int nameptr = 0;
3381 uschar *key, *filename, *affix;
3382 uschar *save_lookup_value = lookup_value;
3383 int save_expand_nmax =
3384 save_expand_strings(save_expand_nstring, save_expand_nlength);
3385
3386 if ((expand_forbid & RDO_LOOKUP) != 0)
3387 {
3388 expand_string_message = US"lookup expansions are not permitted";
3389 goto EXPAND_FAILED;
3390 }
3391
3392 /* Get the key we are to look up for single-key+file style lookups.
3393 Otherwise set the key NULL pro-tem. */
3394
3395 while (isspace(*s)) s++;
3396 if (*s == '{')
3397 {
3398 key = expand_string_internal(s+1, TRUE, &s, skipping);
3399 if (key == NULL) goto EXPAND_FAILED;
3400 if (*s++ != '}') goto EXPAND_FAILED_CURLY;
3401 while (isspace(*s)) s++;
3402 }
3403 else key = NULL;
3404
3405 /* Find out the type of database */
3406
3407 if (!isalpha(*s))
3408 {
3409 expand_string_message = US"missing lookup type";
3410 goto EXPAND_FAILED;
3411 }
3412
3413 /* The type is a string that may contain special characters of various
3414 kinds. Allow everything except space or { to appear; the actual content
3415 is checked by search_findtype_partial. */
3416
3417 while (*s != 0 && *s != '{' && !isspace(*s))
3418 {
3419 if (nameptr < sizeof(name) - 1) name[nameptr++] = *s;
3420 s++;
3421 }
3422 name[nameptr] = 0;
3423 while (isspace(*s)) s++;
3424
3425 /* Now check for the individual search type and any partial or default
3426 options. Only those types that are actually in the binary are valid. */
3427
3428 stype = search_findtype_partial(name, &partial, &affix, &affixlen,
3429 &starflags);
3430 if (stype < 0)
3431 {
3432 expand_string_message = search_error_message;
3433 goto EXPAND_FAILED;
3434 }
3435
3436 /* Check that a key was provided for those lookup types that need it,
3437 and was not supplied for those that use the query style. */
3438
13b685f9 3439 if (!mac_islookup(stype, lookup_querystyle|lookup_absfilequery))
059ec3d9
PH
3440 {
3441 if (key == NULL)
3442 {
3443 expand_string_message = string_sprintf("missing {key} for single-"
3444 "key \"%s\" lookup", name);
3445 goto EXPAND_FAILED;
3446 }
3447 }
3448 else
3449 {
3450 if (key != NULL)
3451 {
3452 expand_string_message = string_sprintf("a single key was given for "
3453 "lookup type \"%s\", which is not a single-key lookup type", name);
3454 goto EXPAND_FAILED;
3455 }
3456 }
3457
3458 /* Get the next string in brackets and expand it. It is the file name for
13b685f9
PH
3459 single-key+file lookups, and the whole query otherwise. In the case of
3460 queries that also require a file name (e.g. sqlite), the file name comes
3461 first. */
059ec3d9
PH
3462
3463 if (*s != '{') goto EXPAND_FAILED_CURLY;
3464 filename = expand_string_internal(s+1, TRUE, &s, skipping);
3465 if (filename == NULL) goto EXPAND_FAILED;
3466 if (*s++ != '}') goto EXPAND_FAILED_CURLY;
3467 while (isspace(*s)) s++;
3468
3469 /* If this isn't a single-key+file lookup, re-arrange the variables
13b685f9
PH
3470 to be appropriate for the search_ functions. For query-style lookups,
3471 there is just a "key", and no file name. For the special query-style +
3472 file types, the query (i.e. "key") starts with a file name. */
059ec3d9
PH
3473
3474 if (key == NULL)
3475 {
13b685f9 3476 while (isspace(*filename)) filename++;
059ec3d9 3477 key = filename;
13b685f9
PH
3478
3479 if (mac_islookup(stype, lookup_querystyle))
3480 {
3481 filename = NULL;
3482 }
3483 else
3484 {
3485 if (*filename != '/')
3486 {
3487 expand_string_message = string_sprintf(
3488 "absolute file name expected for \"%s\" lookup", name);
3489 goto EXPAND_FAILED;
3490 }
3491 while (*key != 0 && !isspace(*key)) key++;
3492 if (*key != 0) *key++ = 0;
3493 }
059ec3d9
PH
3494 }
3495
3496 /* If skipping, don't do the next bit - just lookup_value == NULL, as if
3497 the entry was not found. Note that there is no search_close() function.
3498 Files are left open in case of re-use. At suitable places in higher logic,
3499 search_tidyup() is called to tidy all open files. This can save opening
3500 the same file several times. However, files may also get closed when
3501 others are opened, if too many are open at once. The rule is that a
3502 handle should not be used after a second search_open().
3503
3504 Request that a partial search sets up $1 and maybe $2 by passing
3505 expand_setup containing zero. If its value changes, reset expand_nmax,
3506 since new variables will have been set. Note that at the end of this
3507 "lookup" section, the old numeric variables are restored. */
3508
3509 if (skipping)
3510 lookup_value = NULL;
3511 else
3512 {
3513 void *handle = search_open(filename, stype, 0, NULL, NULL);
3514 if (handle == NULL)
3515 {
3516 expand_string_message = search_error_message;
3517 goto EXPAND_FAILED;
3518 }
3519 lookup_value = search_find(handle, filename, key, partial, affix,
3520 affixlen, starflags, &expand_setup);
3521 if (search_find_defer)
3522 {
3523 expand_string_message =
3524 string_sprintf("lookup of \"%s\" gave DEFER: %s", key,
3525 search_error_message);
3526 goto EXPAND_FAILED;
3527 }
3528 if (expand_setup > 0) expand_nmax = expand_setup;
3529 }
3530
3531 /* The handling of "yes" and "no" result strings is now in a separate
3532 function that is also used by ${if} and ${extract}. */
3533
3534 switch(process_yesno(
3535 skipping, /* were previously skipping */
3536 lookup_value != NULL, /* success/failure indicator */
3537 save_lookup_value, /* value to reset for string2 */
3538 &s, /* input pointer */
3539 &yield, /* output pointer */
3540 &size, /* output size */
3541 &ptr, /* output current point */
3542 US"lookup")) /* condition type */
3543 {
3544 case 1: goto EXPAND_FAILED; /* when all is well, the */
3545 case 2: goto EXPAND_FAILED_CURLY; /* returned value is 0 */
3546 }
3547
3548 /* Restore external setting of expansion variables for carrying on
3549 at this level, and continue. */
3550
3551 restore_expand_strings(save_expand_nmax, save_expand_nstring,
3552 save_expand_nlength);
3553 continue;
3554 }
3555
3556 /* If Perl support is configured, handle calling embedded perl subroutines,
3557 unless locked out at this time. Syntax is ${perl{sub}} or ${perl{sub}{arg}}
3558 or ${perl{sub}{arg1}{arg2}} or up to a maximum of EXIM_PERL_MAX_ARGS
3559 arguments (defined below). */
3560
059ec3d9
PH
3561 #define EXIM_PERL_MAX_ARGS 8
3562
3563 case EITEM_PERL:
1a46a8c5
PH
3564 #ifndef EXIM_PERL
3565 expand_string_message = US"\"${perl\" encountered, but this facility "
3566 "is not included in this binary";
3567 goto EXPAND_FAILED;
3568
3569 #else /* EXIM_PERL */
059ec3d9
PH
3570 {
3571 uschar *sub_arg[EXIM_PERL_MAX_ARGS + 2];
3572 uschar *new_yield;
3573
3574 if ((expand_forbid & RDO_PERL) != 0)
3575 {
3576 expand_string_message = US"Perl calls are not permitted";
3577 goto EXPAND_FAILED;
3578 }
3579
3580 switch(read_subs(sub_arg, EXIM_PERL_MAX_ARGS + 1, 1, &s, skipping, TRUE,
3581 US"perl"))
3582 {
3583 case 1: goto EXPAND_FAILED_CURLY;
3584 case 2:
3585 case 3: goto EXPAND_FAILED;
3586 }
3587
3588 /* If skipping, we don't actually do anything */
3589
3590 if (skipping) continue;
3591
3592 /* Start the interpreter if necessary */
3593
3594 if (!opt_perl_started)
3595 {
3596 uschar *initerror;
3597 if (opt_perl_startup == NULL)
3598 {
3599 expand_string_message = US"A setting of perl_startup is needed when "
3600 "using the Perl interpreter";
3601 goto EXPAND_FAILED;
3602 }
3603 DEBUG(D_any) debug_printf("Starting Perl interpreter\n");
3604 initerror = init_perl(opt_perl_startup);
3605 if (initerror != NULL)
3606 {
3607 expand_string_message =
3608 string_sprintf("error in perl_startup code: %s\n", initerror);
3609 goto EXPAND_FAILED;
3610 }
3611 opt_perl_started = TRUE;
3612 }
3613
3614 /* Call the function */
3615
3616 sub_arg[EXIM_PERL_MAX_ARGS + 1] = NULL;
3617 new_yield = call_perl_cat(yield, &size, &ptr, &expand_string_message,
3618 sub_arg[0], sub_arg + 1);
3619
3620 /* NULL yield indicates failure; if the message pointer has been set to
3621 NULL, the yield was undef, indicating a forced failure. Otherwise the
3622 message will indicate some kind of Perl error. */
3623
3624 if (new_yield == NULL)
3625 {
3626 if (expand_string_message == NULL)
3627 {
3628 expand_string_message =
3629 string_sprintf("Perl subroutine \"%s\" returned undef to force "
3630 "failure", sub_arg[0]);
3631 expand_string_forcedfail = TRUE;
3632 }
3633 goto EXPAND_FAILED;
3634 }
3635
3636 /* Yield succeeded. Ensure forcedfail is unset, just in case it got
3637 set during a callback from Perl. */
3638
3639 expand_string_forcedfail = FALSE;
3640 yield = new_yield;
3641 continue;
3642 }
3643 #endif /* EXIM_PERL */
3644
fffda43a
TK
3645 /* Transform email address to "prvs" scheme to use
3646 as BATV-signed return path */
3647
3648 case EITEM_PRVS:
3649 {
3650 uschar *sub_arg[3];
3651 uschar *p,*domain;
3652
3653 switch(read_subs(sub_arg, 3, 2, &s, skipping, TRUE, US"prvs"))
3654 {
3655 case 1: goto EXPAND_FAILED_CURLY;
3656 case 2:
3657 case 3: goto EXPAND_FAILED;
3658 }
3659
3660 /* If skipping, we don't actually do anything */
3661 if (skipping) continue;
3662
3663 /* sub_arg[0] is the address */
3664 domain = Ustrrchr(sub_arg[0],'@');
3665 if ( (domain == NULL) || (domain == sub_arg[0]) || (Ustrlen(domain) == 1) )
3666 {
cb9328de
PH
3667 expand_string_message = US"prvs first argument must be a qualified email address";
3668 goto EXPAND_FAILED;
3669 }
3670
3671 /* Calculate the hash. The second argument must be a single-digit
3672 key number, or unset. */
3673
3674 if (sub_arg[2] != NULL &&
3675 (!isdigit(sub_arg[2][0]) || sub_arg[2][1] != 0))
3676 {
3677 expand_string_message = US"prvs second argument must be a single digit";
fffda43a
TK
3678 goto EXPAND_FAILED;
3679 }
3680
fffda43a
TK
3681 p = prvs_hmac_sha1(sub_arg[0],sub_arg[1],sub_arg[2],prvs_daystamp(7));
3682 if (p == NULL)
3683 {
cb9328de 3684 expand_string_message = US"prvs hmac-sha1 conversion failed";
fffda43a
TK
3685 goto EXPAND_FAILED;
3686 }
3687
3688 /* Now separate the domain from the local part */
3689 *domain++ = '\0';
3690
3691 yield = string_cat(yield,&size,&ptr,US"prvs=",5);
fffda43a
TK
3692 string_cat(yield,&size,&ptr,(sub_arg[2] != NULL) ? sub_arg[2] : US"0", 1);
3693 string_cat(yield,&size,&ptr,prvs_daystamp(7),3);
3694 string_cat(yield,&size,&ptr,p,6);
a48ced90
TK
3695 string_cat(yield,&size,&ptr,US"=",1);
3696 string_cat(yield,&size,&ptr,sub_arg[0],Ustrlen(sub_arg[0]));
fffda43a
TK
3697 string_cat(yield,&size,&ptr,US"@",1);
3698 string_cat(yield,&size,&ptr,domain,Ustrlen(domain));
3699
3700 continue;
3701 }
3702
3703 /* Check a prvs-encoded address for validity */
3704
3705 case EITEM_PRVSCHECK:
3706 {
3707 uschar *sub_arg[3];
3708 int mysize = 0, myptr = 0;
3709 const pcre *re;
3710 uschar *p;
72fdd6ae
PH
3711
3712 /* TF: Ugliness: We want to expand parameter 1 first, then set
fffda43a
TK
3713 up expansion variables that are used in the expansion of
3714 parameter 2. So we clone the string for the first
72fdd6ae
PH
3715 expansion, where we only expand parameter 1.
3716
3717 PH: Actually, that isn't necessary. The read_subs() function is
3718 designed to work this way for the ${if and ${lookup expansions. I've
3719 tidied the code.
3720 */
fffda43a
TK
3721
3722 /* Reset expansion variables */
3723 prvscheck_result = NULL;
3724 prvscheck_address = NULL;
3725 prvscheck_keynum = NULL;
3726
72fdd6ae 3727 switch(read_subs(sub_arg, 1, 1, &s, skipping, FALSE, US"prvs"))
fffda43a
TK
3728 {
3729 case 1: goto EXPAND_FAILED_CURLY;
3730 case 2:
3731 case 3: goto EXPAND_FAILED;
3732 }
3733
a48ced90 3734 re = regex_must_compile(US"^prvs\\=([0-9])([0-9]{3})([A-F0-9]{6})\\=(.+)\\@(.+)$",
fffda43a
TK
3735 TRUE,FALSE);
3736
72fdd6ae
PH
3737 if (regex_match_and_setup(re,sub_arg[0],0,-1))
3738 {
a48ced90
TK
3739 uschar *local_part = string_copyn(expand_nstring[4],expand_nlength[4]);
3740 uschar *key_num = string_copyn(expand_nstring[1],expand_nlength[1]);
3741 uschar *daystamp = string_copyn(expand_nstring[2],expand_nlength[2]);
3742 uschar *hash = string_copyn(expand_nstring[3],expand_nlength[3]);
fffda43a
TK
3743 uschar *domain = string_copyn(expand_nstring[5],expand_nlength[5]);
3744
3745 DEBUG(D_expand) debug_printf("prvscheck localpart: %s\n", local_part);
3746 DEBUG(D_expand) debug_printf("prvscheck key number: %s\n", key_num);
3747 DEBUG(D_expand) debug_printf("prvscheck daystamp: %s\n", daystamp);
3748 DEBUG(D_expand) debug_printf("prvscheck hash: %s\n", hash);
3749 DEBUG(D_expand) debug_printf("prvscheck domain: %s\n", domain);
3750
3751 /* Set up expansion variables */
3752 prvscheck_address = string_cat(NULL, &mysize, &myptr, local_part, Ustrlen(local_part));
2740a2ca 3753 string_cat(prvscheck_address,&mysize,&myptr,US"@",1);
fffda43a
TK
3754 string_cat(prvscheck_address,&mysize,&myptr,domain,Ustrlen(domain));
3755 prvscheck_address[myptr] = '\0';
3756 prvscheck_keynum = string_copy(key_num);
3757
72fdd6ae
PH
3758 /* Now expand the second argument */
3759 switch(read_subs(sub_arg, 1, 1, &s, skipping, FALSE, US"prvs"))
fffda43a
TK
3760 {
3761 case 1: goto EXPAND_FAILED_CURLY;
3762 case 2:
3763 case 3: goto EXPAND_FAILED;
3764 }
3765
fffda43a 3766 /* Now we have the key and can check the address. */
72fdd6ae
PH
3767
3768 p = prvs_hmac_sha1(prvscheck_address, sub_arg[0], prvscheck_keynum,
3769 daystamp);
3770
fffda43a
TK
3771 if (p == NULL)
3772 {
3773 expand_string_message = US"hmac-sha1 conversion failed";
3774 goto EXPAND_FAILED;
3775 }
3776
3777 DEBUG(D_expand) debug_printf("prvscheck: received hash is %s\n", hash);
3778 DEBUG(D_expand) debug_printf("prvscheck: own hash is %s\n", p);
72fdd6ae 3779
fffda43a
TK
3780 if (Ustrcmp(p,hash) == 0)
3781 {
3782 /* Success, valid BATV address. Now check the expiry date. */
3783 uschar *now = prvs_daystamp(0);
3784 unsigned int inow = 0,iexpire = 1;
3785
ff790e47
PH
3786 (void)sscanf(CS now,"%u",&inow);
3787 (void)sscanf(CS daystamp,"%u",&iexpire);
fffda43a
TK
3788
3789 /* When "iexpire" is < 7, a "flip" has occured.
3790 Adjust "inow" accordingly. */
3791 if ( (iexpire < 7) && (inow >= 993) ) inow = 0;
3792
686c36b7 3793 if (iexpire >= inow)
fffda43a
TK
3794 {
3795 prvscheck_result = US"1";
3796 DEBUG(D_expand) debug_printf("prvscheck: success, $pvrs_result set to 1\n");
3797 }
3798 else
3799 {
3800 prvscheck_result = NULL;
3801 DEBUG(D_expand) debug_printf("prvscheck: signature expired, $pvrs_result unset\n");
3802 }
3803 }
3804 else
3805 {
3806 prvscheck_result = NULL;
3807 DEBUG(D_expand) debug_printf("prvscheck: hash failure, $pvrs_result unset\n");
3808 }
72fdd6ae
PH
3809
3810 /* Now expand the final argument. We leave this till now so that
3811 it can include $prvscheck_result. */
3812
3813 switch(read_subs(sub_arg, 1, 0, &s, skipping, TRUE, US"prvs"))
3814 {
3815 case 1: goto EXPAND_FAILED_CURLY;
3816 case 2:
3817 case 3: goto EXPAND_FAILED;
3818 }
3819
3820 if (sub_arg[0] == NULL || *sub_arg[0] == '\0')
3821 yield = string_cat(yield,&size,&ptr,prvscheck_address,Ustrlen(prvscheck_address));
3822 else
3823 yield = string_cat(yield,&size,&ptr,sub_arg[0],Ustrlen(sub_arg[0]));
3824
3825 /* Reset the "internal" variables afterwards, because they are in
3826 dynamic store that will be reclaimed if the expansion succeeded. */
3827
3828 prvscheck_address = NULL;
3829 prvscheck_keynum = NULL;
3830 }
fffda43a
TK
3831 else
3832 {
3833 /* Does not look like a prvs encoded address, return the empty string.
72fdd6ae
PH
3834 We need to make sure all subs are expanded first, so as to skip over
3835 the entire item. */
3836
5a03bd24 3837 switch(read_subs(sub_arg, 2, 1, &s, skipping, TRUE, US"prvs"))
fffda43a
TK
3838 {
3839 case 1: goto EXPAND_FAILED_CURLY;
3840 case 2:
3841 case 3: goto EXPAND_FAILED;
3842 }
3843 }
3844
3845 continue;
3846 }
3847
059ec3d9
PH
3848 /* Handle "readfile" to insert an entire file */
3849
3850 case EITEM_READFILE:
3851 {
3852 FILE *f;
3853 uschar *sub_arg[2];
3854
3855 if ((expand_forbid & RDO_READFILE) != 0)
3856 {
3857 expand_string_message = US"file insertions are not permitted";
3858 goto EXPAND_FAILED;
3859 }
3860
3861 switch(read_subs(sub_arg, 2, 1, &s, skipping, TRUE, US"readfile"))
3862 {
3863 case 1: goto EXPAND_FAILED_CURLY;
3864 case 2:
3865 case 3: goto EXPAND_FAILED;
3866 }
3867
3868 /* If skipping, we don't actually do anything */
3869
3870 if (skipping) continue;
3871
3872 /* Open the file and read it */
3873
3874 f = Ufopen(sub_arg[0], "rb");
3875 if (f == NULL)
3876 {
3877 expand_string_message = string_open_failed(errno, "%s", sub_arg[0]);
3878 goto EXPAND_FAILED;
3879 }
3880
3881 yield = cat_file(f, yield, &size, &ptr, sub_arg[1]);
f1e894f3 3882 (void)fclose(f);
059ec3d9
PH
3883 continue;
3884 }
3885
3886 /* Handle "readsocket" to insert data from a Unix domain socket */
3887
3888 case EITEM_READSOCK:
3889 {
3890 int fd;
3891 int timeout = 5;
3892 int save_ptr = ptr;
3893 FILE *f;
3894 struct sockaddr_un sockun; /* don't call this "sun" ! */
3895 uschar *arg;
3896 uschar *sub_arg[4];
3897
3898 if ((expand_forbid & RDO_READSOCK) != 0)
3899 {
3900 expand_string_message = US"socket insertions are not permitted";
3901 goto EXPAND_FAILED;
3902 }
3903
3904 /* Read up to 4 arguments, but don't do the end of item check afterwards,
3905 because there may be a string for expansion on failure. */
3906
3907 switch(read_subs(sub_arg, 4, 2, &s, skipping, FALSE, US"readsocket"))
3908 {
3909 case 1: goto EXPAND_FAILED_CURLY;
3910 case 2: /* Won't occur: no end check */
3911 case 3: goto EXPAND_FAILED;
3912 }
3913
3914 /* Sort out timeout, if given */
3915
3916 if (sub_arg[2] != NULL)
3917 {
3918 timeout = readconf_readtime(sub_arg[2], 0, FALSE);
3919 if (timeout < 0)
3920 {
3921 expand_string_message = string_sprintf("bad time value %s",
3922 sub_arg[2]);
3923 goto EXPAND_FAILED;
3924 }
3925 }
3926 else sub_arg[3] = NULL; /* No eol if no timeout */
3927
1cce3af8
PH
3928 /* If skipping, we don't actually do anything. Otherwise, arrange to
3929 connect to either an IP or a Unix socket. */
059ec3d9
PH
3930
3931 if (!skipping)
3932 {
1cce3af8 3933 /* Handle an IP (internet) domain */
059ec3d9 3934
91ecef39 3935 if (Ustrncmp(sub_arg[0], "inet:", 5) == 0)
059ec3d9 3936 {
1cce3af8
PH
3937 BOOL connected = FALSE;
3938 int namelen, port;
3939 host_item shost;
3940 host_item *h;
3941 uschar *server_name = sub_arg[0] + 5;
3942 uschar *port_name = Ustrrchr(server_name, ':');
3943
3944 /* Sort out the port */
3945
3946 if (port_name == NULL)
3947 {
3948 expand_string_message =
3949 string_sprintf("missing port for readsocket %s", sub_arg[0]);
3950 goto EXPAND_FAILED;
3951 }
3952 *port_name++ = 0; /* Terminate server name */
3953
3954 if (isdigit(*port_name))
3955 {
3956 uschar *end;
3957 port = Ustrtol(port_name, &end, 0);
3958 if (end != port_name + Ustrlen(port_name))
3959 {
3960 expand_string_message =
3961 string_sprintf("invalid port number %s", port_name);
3962 goto EXPAND_FAILED;
3963 }
3964 }
3965 else
3966 {
3967 struct servent *service_info = getservbyname(CS port_name, "tcp");
3968 if (service_info == NULL)
3969 {
3970 expand_string_message = string_sprintf("unknown port \"%s\"",
3971 port_name);
3972 goto EXPAND_FAILED;
3973 }
3974 port = ntohs(service_info->s_port);
3975 }
3976
3977 /* Sort out the server. */
3978
3979 shost.next = NULL;
3980 shost.address = NULL;
3981 shost.port = port;
3982 shost.mx = -1;
3983