TLS: variables $tls_(in,out)_tlsver
[exim.git] / src / src / expand.c
CommitLineData
059ec3d9
PH
1/*************************************************
2* Exim - an Internet mail transport agent *
3*************************************************/
4
f9ba5e22 5/* Copyright (c) University of Cambridge 1995 - 2018 */
059ec3d9
PH
6/* See the file NOTICE for conditions of use and distribution. */
7
8
9/* Functions for handling string expansion. */
10
11
12#include "exim.h"
13
96c065cb
PH
14/* Recursively called function */
15
55414b25
JH
16static uschar *expand_string_internal(const uschar *, BOOL, const uschar **, BOOL, BOOL, BOOL *);
17static int_eximarith_t expanded_string_integer(const uschar *, BOOL);
96c065cb 18
059ec3d9 19#ifdef STAND_ALONE
9d466bf7
JH
20# ifndef SUPPORT_CRYPTEQ
21# define SUPPORT_CRYPTEQ
22# endif
059ec3d9
PH
23#endif
24
96c065cb 25#ifdef LOOKUP_LDAP
9d466bf7 26# include "lookups/ldap.h"
96c065cb
PH
27#endif
28
059ec3d9 29#ifdef SUPPORT_CRYPTEQ
9d466bf7
JH
30# ifdef CRYPT_H
31# include <crypt.h>
32# endif
33# ifndef HAVE_CRYPT16
059ec3d9 34extern char* crypt16(char*, char*);
9d466bf7 35# endif
059ec3d9
PH
36#endif
37
96c065cb
PH
38/* The handling of crypt16() is a mess. I will record below the analysis of the
39mess that was sent to me. We decided, however, to make changing this very low
40priority, because in practice people are moving away from the crypt()
41algorithms nowadays, so it doesn't seem worth it.
42
43<quote>
44There is an algorithm named "crypt16" in Ultrix and Tru64. It crypts
45the first 8 characters of the password using a 20-round version of crypt
46(standard crypt does 25 rounds). It then crypts the next 8 characters,
47or an empty block if the password is less than 9 characters, using a
4820-round version of crypt and the same salt as was used for the first
4c04137d 49block. Characters after the first 16 are ignored. It always generates
96c065cb
PH
50a 16-byte hash, which is expressed together with the salt as a string
51of 24 base 64 digits. Here are some links to peruse:
52
53 http://cvs.pld.org.pl/pam/pamcrypt/crypt16.c?rev=1.2
54 http://seclists.org/bugtraq/1999/Mar/0076.html
55
56There's a different algorithm named "bigcrypt" in HP-UX, Digital Unix,
57and OSF/1. This is the same as the standard crypt if given a password
58of 8 characters or less. If given more, it first does the same as crypt
59using the first 8 characters, then crypts the next 8 (the 9th to 16th)
60using as salt the first two base 64 digits from the first hash block.
61If the password is more than 16 characters then it crypts the 17th to 24th
62characters using as salt the first two base 64 digits from the second hash
63block. And so on: I've seen references to it cutting off the password at
6440 characters (5 blocks), 80 (10 blocks), or 128 (16 blocks). Some links:
65
66 http://cvs.pld.org.pl/pam/pamcrypt/bigcrypt.c?rev=1.2
67 http://seclists.org/bugtraq/1999/Mar/0109.html
68 http://h30097.www3.hp.com/docs/base_doc/DOCUMENTATION/HTML/AA-Q0R2D-
69 TET1_html/sec.c222.html#no_id_208
70
71Exim has something it calls "crypt16". It will either use a native
72crypt16 or its own implementation. A native crypt16 will presumably
73be the one that I called "crypt16" above. The internal "crypt16"
74function, however, is a two-block-maximum implementation of what I called
75"bigcrypt". The documentation matches the internal code.
76
77I suspect that whoever did the "crypt16" stuff for Exim didn't realise
78that crypt16 and bigcrypt were different things.
79
80Exim uses the LDAP-style scheme identifier "{crypt16}" to refer
81to whatever it is using under that name. This unfortunately sets a
82precedent for using "{crypt16}" to identify two incompatible algorithms
83whose output can't be distinguished. With "{crypt16}" thus rendered
84ambiguous, I suggest you deprecate it and invent two new identifiers
85for the two algorithms.
86
87Both crypt16 and bigcrypt are very poor algorithms, btw. Hashing parts
88of the password separately means they can be cracked separately, so
89the double-length hash only doubles the cracking effort instead of
90squaring it. I recommend salted SHA-1 ({SSHA}), or the Blowfish-based
91bcrypt ({CRYPT}$2a$).
92</quote>
93*/
059ec3d9
PH
94
95
059ec3d9 96
059ec3d9
PH
97/*************************************************
98* Local statics and tables *
99*************************************************/
100
101/* Table of item names, and corresponding switch numbers. The names must be in
102alphabetical order. */
103
104static uschar *item_table[] = {
723c72e6 105 US"acl",
dfbcb5ac 106 US"authresults",
9d1c15ef 107 US"certextract",
1a46a8c5 108 US"dlfunc",
089fc87a 109 US"env",
059ec3d9 110 US"extract",
29f89cad 111 US"filter",
059ec3d9
PH
112 US"hash",
113 US"hmac",
114 US"if",
8c5d388a 115#ifdef SUPPORT_I18N
ed0512a1
JH
116 US"imapfolder",
117#endif
059ec3d9 118 US"length",
aa26e137 119 US"listextract",
059ec3d9 120 US"lookup",
29f89cad 121 US"map",
059ec3d9 122 US"nhash",
1a46a8c5 123 US"perl",
fffda43a
TK
124 US"prvs",
125 US"prvscheck",
059ec3d9
PH
126 US"readfile",
127 US"readsocket",
29f89cad 128 US"reduce",
059ec3d9
PH
129 US"run",
130 US"sg",
ac4ef9bd 131 US"sort",
7ef88aa0
JH
132#ifdef EXPERIMENTAL_SRS_NATIVE
133 US"srs_encode",
134#endif
059ec3d9
PH
135 US"substr",
136 US"tr" };
137
138enum {
723c72e6 139 EITEM_ACL,
dfbcb5ac 140 EITEM_AUTHRESULTS,
9d1c15ef 141 EITEM_CERTEXTRACT,
1a46a8c5 142 EITEM_DLFUNC,
089fc87a 143 EITEM_ENV,
059ec3d9 144 EITEM_EXTRACT,
29f89cad 145 EITEM_FILTER,
059ec3d9
PH
146 EITEM_HASH,
147 EITEM_HMAC,
148 EITEM_IF,
8c5d388a 149#ifdef SUPPORT_I18N
ed0512a1
JH
150 EITEM_IMAPFOLDER,
151#endif
059ec3d9 152 EITEM_LENGTH,
aa26e137 153 EITEM_LISTEXTRACT,
059ec3d9 154 EITEM_LOOKUP,
29f89cad 155 EITEM_MAP,
059ec3d9 156 EITEM_NHASH,
1a46a8c5 157 EITEM_PERL,
fffda43a
TK
158 EITEM_PRVS,
159 EITEM_PRVSCHECK,
059ec3d9
PH
160 EITEM_READFILE,
161 EITEM_READSOCK,
29f89cad 162 EITEM_REDUCE,
059ec3d9
PH
163 EITEM_RUN,
164 EITEM_SG,
ac4ef9bd 165 EITEM_SORT,
7ef88aa0
JH
166#ifdef EXPERIMENTAL_SRS_NATIVE
167 EITEM_SRS_ENCODE,
168#endif
059ec3d9
PH
169 EITEM_SUBSTR,
170 EITEM_TR };
171
172/* Tables of operator names, and corresponding switch numbers. The names must be
173in alphabetical order. There are two tables, because underscore is used in some
174cases to introduce arguments, whereas for other it is part of the name. This is
175an historical mis-design. */
176
177static uschar *op_table_underscore[] = {
178 US"from_utf8",
179 US"local_part",
180 US"quote_local_part",
83e029d5 181 US"reverse_ip",
f90d018c 182 US"time_eval",
4e08fd50 183 US"time_interval"
8c5d388a 184#ifdef SUPPORT_I18N
4e08fd50
JH
185 ,US"utf8_domain_from_alabel",
186 US"utf8_domain_to_alabel",
187 US"utf8_localpart_from_alabel",
188 US"utf8_localpart_to_alabel"
189#endif
190 };
059ec3d9
PH
191
192enum {
193 EOP_FROM_UTF8,
194 EOP_LOCAL_PART,
195 EOP_QUOTE_LOCAL_PART,
83e029d5 196 EOP_REVERSE_IP,
f90d018c 197 EOP_TIME_EVAL,
4e08fd50 198 EOP_TIME_INTERVAL
8c5d388a 199#ifdef SUPPORT_I18N
4e08fd50
JH
200 ,EOP_UTF8_DOMAIN_FROM_ALABEL,
201 EOP_UTF8_DOMAIN_TO_ALABEL,
202 EOP_UTF8_LOCALPART_FROM_ALABEL,
203 EOP_UTF8_LOCALPART_TO_ALABEL
204#endif
205 };
059ec3d9
PH
206
207static uschar *op_table_main[] = {
208 US"address",
29f89cad 209 US"addresses",
03ca21f8
JH
210 US"base32",
211 US"base32d",
059ec3d9
PH
212 US"base62",
213 US"base62d",
9aa35e9c
JH
214 US"base64",
215 US"base64d",
059ec3d9
PH
216 US"domain",
217 US"escape",
3367f8c2 218 US"escape8bit",
059ec3d9
PH
219 US"eval",
220 US"eval10",
221 US"expand",
222 US"h",
223 US"hash",
224 US"hex2b64",
c393f931 225 US"hexquote",
fc4a7f70
JH
226 US"ipv6denorm",
227 US"ipv6norm",
059ec3d9
PH
228 US"l",
229 US"lc",
230 US"length",
a64a3dfa
JH
231 US"listcount",
232 US"listnamed",
059ec3d9
PH
233 US"mask",
234 US"md5",
235 US"nh",
236 US"nhash",
237 US"quote",
9e3331ea 238 US"randint",
059ec3d9 239 US"rfc2047",
9c57cbc0 240 US"rfc2047d",
059ec3d9
PH
241 US"rxquote",
242 US"s",
243 US"sha1",
12e9bb25 244 US"sha2",
9ef9101c 245 US"sha256",
6e773413 246 US"sha3",
059ec3d9
PH
247 US"stat",
248 US"str2b64",
249 US"strlen",
250 US"substr",
b9c2e32f
AR
251 US"uc",
252 US"utf8clean" };
059ec3d9
PH
253
254enum {
0539a19d 255 EOP_ADDRESS = nelem(op_table_underscore),
29f89cad 256 EOP_ADDRESSES,
03ca21f8
JH
257 EOP_BASE32,
258 EOP_BASE32D,
059ec3d9
PH
259 EOP_BASE62,
260 EOP_BASE62D,
9aa35e9c
JH
261 EOP_BASE64,
262 EOP_BASE64D,
059ec3d9
PH
263 EOP_DOMAIN,
264 EOP_ESCAPE,
3367f8c2 265 EOP_ESCAPE8BIT,
059ec3d9
PH
266 EOP_EVAL,
267 EOP_EVAL10,
268 EOP_EXPAND,
269 EOP_H,
270 EOP_HASH,
271 EOP_HEX2B64,
c393f931 272 EOP_HEXQUOTE,
fc4a7f70
JH
273 EOP_IPV6DENORM,
274 EOP_IPV6NORM,
059ec3d9
PH
275 EOP_L,
276 EOP_LC,
277 EOP_LENGTH,
a64a3dfa
JH
278 EOP_LISTCOUNT,
279 EOP_LISTNAMED,
059ec3d9
PH
280 EOP_MASK,
281 EOP_MD5,
282 EOP_NH,
283 EOP_NHASH,
284 EOP_QUOTE,
9e3331ea 285 EOP_RANDINT,
059ec3d9 286 EOP_RFC2047,
9c57cbc0 287 EOP_RFC2047D,
059ec3d9
PH
288 EOP_RXQUOTE,
289 EOP_S,
290 EOP_SHA1,
12e9bb25 291 EOP_SHA2,
9ef9101c 292 EOP_SHA256,
6e773413 293 EOP_SHA3,
059ec3d9
PH
294 EOP_STAT,
295 EOP_STR2B64,
296 EOP_STRLEN,
297 EOP_SUBSTR,
b9c2e32f
AR
298 EOP_UC,
299 EOP_UTF8CLEAN };
059ec3d9
PH
300
301
302/* Table of condition names, and corresponding switch numbers. The names must
303be in alphabetical order. */
304
305static uschar *cond_table[] = {
306 US"<",
307 US"<=",
308 US"=",
309 US"==", /* Backward compatibility */
310 US">",
311 US">=",
333eea9c 312 US"acl",
059ec3d9 313 US"and",
f3766eb5 314 US"bool",
6a8de854 315 US"bool_lax",
059ec3d9
PH
316 US"crypteq",
317 US"def",
318 US"eq",
319 US"eqi",
320 US"exists",
321 US"first_delivery",
0ce9abe6 322 US"forall",
7f69e814
JH
323 US"forall_json",
324 US"forall_jsons",
0ce9abe6 325 US"forany",
7f69e814
JH
326 US"forany_json",
327 US"forany_jsons",
059ec3d9
PH
328 US"ge",
329 US"gei",
330 US"gt",
331 US"gti",
7ef88aa0
JH
332#ifdef EXPERIMENTAL_SRS_NATIVE
333 US"inbound_srs",
334#endif
76dca828
PP
335 US"inlist",
336 US"inlisti",
059ec3d9
PH
337 US"isip",
338 US"isip4",
339 US"isip6",
340 US"ldapauth",
341 US"le",
342 US"lei",
343 US"lt",
344 US"lti",
345 US"match",
346 US"match_address",
347 US"match_domain",
32d668a5 348 US"match_ip",
059ec3d9
PH
349 US"match_local_part",
350 US"or",
351 US"pam",
352 US"pwcheck",
353 US"queue_running",
354 US"radius",
355 US"saslauthd"
356};
357
358enum {
359 ECOND_NUM_L,
360 ECOND_NUM_LE,
361 ECOND_NUM_E,
362 ECOND_NUM_EE,
363 ECOND_NUM_G,
364 ECOND_NUM_GE,
333eea9c 365 ECOND_ACL,
059ec3d9 366 ECOND_AND,
f3766eb5 367 ECOND_BOOL,
6a8de854 368 ECOND_BOOL_LAX,
059ec3d9
PH
369 ECOND_CRYPTEQ,
370 ECOND_DEF,
371 ECOND_STR_EQ,
372 ECOND_STR_EQI,
373 ECOND_EXISTS,
374 ECOND_FIRST_DELIVERY,
0ce9abe6 375 ECOND_FORALL,
7f69e814
JH
376 ECOND_FORALL_JSON,
377 ECOND_FORALL_JSONS,
0ce9abe6 378 ECOND_FORANY,
7f69e814
JH
379 ECOND_FORANY_JSON,
380 ECOND_FORANY_JSONS,
059ec3d9
PH
381 ECOND_STR_GE,
382 ECOND_STR_GEI,
383 ECOND_STR_GT,
384 ECOND_STR_GTI,
7ef88aa0
JH
385#ifdef EXPERIMENTAL_SRS_NATIVE
386 ECOND_INBOUND_SRS,
387#endif
76dca828
PP
388 ECOND_INLIST,
389 ECOND_INLISTI,
059ec3d9
PH
390 ECOND_ISIP,
391 ECOND_ISIP4,
392 ECOND_ISIP6,
393 ECOND_LDAPAUTH,
394 ECOND_STR_LE,
395 ECOND_STR_LEI,
396 ECOND_STR_LT,
397 ECOND_STR_LTI,
398 ECOND_MATCH,
399 ECOND_MATCH_ADDRESS,
400 ECOND_MATCH_DOMAIN,
32d668a5 401 ECOND_MATCH_IP,
059ec3d9
PH
402 ECOND_MATCH_LOCAL_PART,
403 ECOND_OR,
404 ECOND_PAM,
405 ECOND_PWCHECK,
406 ECOND_QUEUE_RUNNING,
407 ECOND_RADIUS,
408 ECOND_SASLAUTHD
409};
410
411
059ec3d9
PH
412/* Types of table entry */
413
7e75538e 414enum vtypes {
059ec3d9
PH
415 vtype_int, /* value is address of int */
416 vtype_filter_int, /* ditto, but recognized only when filtering */
417 vtype_ino, /* value is address of ino_t (not always an int) */
418 vtype_uid, /* value is address of uid_t (not always an int) */
419 vtype_gid, /* value is address of gid_t (not always an int) */
11d7e4fa 420 vtype_bool, /* value is address of bool */
059ec3d9
PH
421 vtype_stringptr, /* value is address of pointer to string */
422 vtype_msgbody, /* as stringptr, but read when first required */
423 vtype_msgbody_end, /* ditto, the end of the message */
ff75a1f7
PH
424 vtype_msgheaders, /* the message's headers, processed */
425 vtype_msgheaders_raw, /* the message's headers, unprocessed */
059ec3d9
PH
426 vtype_localpart, /* extract local part from string */
427 vtype_domain, /* extract domain from string */
362145b5 428 vtype_string_func, /* value is string returned by given function */
059ec3d9
PH
429 vtype_todbsdin, /* value not used; generate BSD inbox tod */
430 vtype_tode, /* value not used; generate tod in epoch format */
f5787926 431 vtype_todel, /* value not used; generate tod in epoch/usec format */
059ec3d9
PH
432 vtype_todf, /* value not used; generate full tod */
433 vtype_todl, /* value not used; generate log tod */
434 vtype_todlf, /* value not used; generate log file datestamp tod */
435 vtype_todzone, /* value not used; generate time zone only */
436 vtype_todzulu, /* value not used; generate zulu tod */
437 vtype_reply, /* value not used; get reply from headers */
438 vtype_pid, /* value not used; result is pid */
439 vtype_host_lookup, /* value not used; get host name */
5cb8cbc6
PH
440 vtype_load_avg, /* value not used; result is int from os_getloadavg */
441 vtype_pspace, /* partition space; value is T/F for spool/log */
9d1c15ef
JH
442 vtype_pinodes, /* partition inodes; value is T/F for spool/log */
443 vtype_cert /* SSL certificate */
80a47a2c
TK
444 #ifndef DISABLE_DKIM
445 ,vtype_dkim /* Lookup of value in DKIM signature */
446 #endif
7e75538e
JH
447};
448
449/* Type for main variable table */
450
451typedef struct {
452 const char *name;
453 enum vtypes type;
454 void *value;
455} var_entry;
456
457/* Type for entries pointing to address/length pairs. Not currently
458in use. */
459
460typedef struct {
461 uschar **address;
462 int *length;
463} alblock;
059ec3d9 464
362145b5 465static uschar * fn_recipients(void);
6d95688d 466typedef uschar * stringptr_fn_t(void);
362145b5 467
059ec3d9
PH
468/* This table must be kept in alphabetical order. */
469
470static var_entry var_table[] = {
38a0a95f
PH
471 /* WARNING: Do not invent variables whose names start acl_c or acl_m because
472 they will be confused with user-creatable ACL variables. */
525239c1
JH
473 { "acl_arg1", vtype_stringptr, &acl_arg[0] },
474 { "acl_arg2", vtype_stringptr, &acl_arg[1] },
475 { "acl_arg3", vtype_stringptr, &acl_arg[2] },
476 { "acl_arg4", vtype_stringptr, &acl_arg[3] },
477 { "acl_arg5", vtype_stringptr, &acl_arg[4] },
478 { "acl_arg6", vtype_stringptr, &acl_arg[5] },
479 { "acl_arg7", vtype_stringptr, &acl_arg[6] },
480 { "acl_arg8", vtype_stringptr, &acl_arg[7] },
481 { "acl_arg9", vtype_stringptr, &acl_arg[8] },
482 { "acl_narg", vtype_int, &acl_narg },
059ec3d9
PH
483 { "acl_verify_message", vtype_stringptr, &acl_verify_message },
484 { "address_data", vtype_stringptr, &deliver_address_data },
485 { "address_file", vtype_stringptr, &address_file },
486 { "address_pipe", vtype_stringptr, &address_pipe },
93c931f8 487#ifdef EXPERIMENTAL_ARC
6d95688d 488 { "arc_domains", vtype_string_func, (void *) &fn_arc_domains },
ea7b1f16 489 { "arc_oldest_pass", vtype_int, &arc_oldest_pass },
93c931f8
JH
490 { "arc_state", vtype_stringptr, &arc_state },
491 { "arc_state_reason", vtype_stringptr, &arc_state_reason },
492#endif
2d07a215 493 { "authenticated_fail_id",vtype_stringptr, &authenticated_fail_id },
059ec3d9
PH
494 { "authenticated_id", vtype_stringptr, &authenticated_id },
495 { "authenticated_sender",vtype_stringptr, &authenticated_sender },
496 { "authentication_failed",vtype_int, &authentication_failed },
9e949f00
PP
497#ifdef WITH_CONTENT_SCAN
498 { "av_failed", vtype_int, &av_failed },
499#endif
8523533c
TK
500#ifdef EXPERIMENTAL_BRIGHTMAIL
501 { "bmi_alt_location", vtype_stringptr, &bmi_alt_location },
502 { "bmi_base64_tracker_verdict", vtype_stringptr, &bmi_base64_tracker_verdict },
503 { "bmi_base64_verdict", vtype_stringptr, &bmi_base64_verdict },
504 { "bmi_deliver", vtype_int, &bmi_deliver },
505#endif
059ec3d9
PH
506 { "body_linecount", vtype_int, &body_linecount },
507 { "body_zerocount", vtype_int, &body_zerocount },
508 { "bounce_recipient", vtype_stringptr, &bounce_recipient },
509 { "bounce_return_size_limit", vtype_int, &bounce_return_size_limit },
510 { "caller_gid", vtype_gid, &real_gid },
511 { "caller_uid", vtype_uid, &real_uid },
055e2cb4 512 { "callout_address", vtype_stringptr, &callout_address },
059ec3d9
PH
513 { "compile_date", vtype_stringptr, &version_date },
514 { "compile_number", vtype_stringptr, &version_cnumber },
98b8312f
HSHR
515 { "config_dir", vtype_stringptr, &config_main_directory },
516 { "config_file", vtype_stringptr, &config_main_filename },
e5a9dba6 517 { "csa_status", vtype_stringptr, &csa_status },
6a8f9482
TK
518#ifdef EXPERIMENTAL_DCC
519 { "dcc_header", vtype_stringptr, &dcc_header },
520 { "dcc_result", vtype_stringptr, &dcc_result },
521#endif
80a47a2c
TK
522#ifndef DISABLE_DKIM
523 { "dkim_algo", vtype_dkim, (void *)DKIM_ALGO },
524 { "dkim_bodylength", vtype_dkim, (void *)DKIM_BODYLENGTH },
525 { "dkim_canon_body", vtype_dkim, (void *)DKIM_CANON_BODY },
526 { "dkim_canon_headers", vtype_dkim, (void *)DKIM_CANON_HEADERS },
527 { "dkim_copiedheaders", vtype_dkim, (void *)DKIM_COPIEDHEADERS },
528 { "dkim_created", vtype_dkim, (void *)DKIM_CREATED },
2df588c9 529 { "dkim_cur_signer", vtype_stringptr, &dkim_cur_signer },
e08d09e5 530 { "dkim_domain", vtype_stringptr, &dkim_signing_domain },
80a47a2c
TK
531 { "dkim_expires", vtype_dkim, (void *)DKIM_EXPIRES },
532 { "dkim_headernames", vtype_dkim, (void *)DKIM_HEADERNAMES },
533 { "dkim_identity", vtype_dkim, (void *)DKIM_IDENTITY },
534 { "dkim_key_granularity",vtype_dkim, (void *)DKIM_KEY_GRANULARITY },
abe1010c 535 { "dkim_key_length", vtype_int, &dkim_key_length },
80a47a2c
TK
536 { "dkim_key_nosubdomains",vtype_dkim, (void *)DKIM_NOSUBDOMAINS },
537 { "dkim_key_notes", vtype_dkim, (void *)DKIM_KEY_NOTES },
538 { "dkim_key_srvtype", vtype_dkim, (void *)DKIM_KEY_SRVTYPE },
539 { "dkim_key_testing", vtype_dkim, (void *)DKIM_KEY_TESTING },
e08d09e5 540 { "dkim_selector", vtype_stringptr, &dkim_signing_selector },
9e5d6b55 541 { "dkim_signers", vtype_stringptr, &dkim_signers },
a79d8834
JH
542 { "dkim_verify_reason", vtype_stringptr, &dkim_verify_reason },
543 { "dkim_verify_status", vtype_stringptr, &dkim_verify_status },
e08d09e5 544#endif
1a2e76e1 545#ifdef SUPPORT_DMARC
8c8b8274 546 { "dmarc_domain_policy", vtype_stringptr, &dmarc_domain_policy },
4840604e
TL
547 { "dmarc_status", vtype_stringptr, &dmarc_status },
548 { "dmarc_status_text", vtype_stringptr, &dmarc_status_text },
549 { "dmarc_used_domain", vtype_stringptr, &dmarc_used_domain },
550#endif
059ec3d9 551 { "dnslist_domain", vtype_stringptr, &dnslist_domain },
93655c46 552 { "dnslist_matched", vtype_stringptr, &dnslist_matched },
059ec3d9
PH
553 { "dnslist_text", vtype_stringptr, &dnslist_text },
554 { "dnslist_value", vtype_stringptr, &dnslist_value },
555 { "domain", vtype_stringptr, &deliver_domain },
556 { "domain_data", vtype_stringptr, &deliver_domain_data },
0cbf2b82 557#ifndef DISABLE_EVENT
774ef2d7
JH
558 { "event_data", vtype_stringptr, &event_data },
559
560 /*XXX want to use generic vars for as many of these as possible*/
561 { "event_defer_errno", vtype_int, &event_defer_errno },
562
563 { "event_name", vtype_stringptr, &event_name },
564#endif
059ec3d9
PH
565 { "exim_gid", vtype_gid, &exim_gid },
566 { "exim_path", vtype_stringptr, &exim_path },
567 { "exim_uid", vtype_uid, &exim_uid },
71224040 568 { "exim_version", vtype_stringptr, &version_string },
6d95688d 569 { "headers_added", vtype_string_func, (void *) &fn_hdrs_added },
059ec3d9
PH
570 { "home", vtype_stringptr, &deliver_home },
571 { "host", vtype_stringptr, &deliver_host },
572 { "host_address", vtype_stringptr, &deliver_host_address },
573 { "host_data", vtype_stringptr, &host_data },
b08b24c8 574 { "host_lookup_deferred",vtype_int, &host_lookup_deferred },
059ec3d9 575 { "host_lookup_failed", vtype_int, &host_lookup_failed },
a7538db1 576 { "host_port", vtype_int, &deliver_host_port },
3615fa9a 577 { "initial_cwd", vtype_stringptr, &initial_cwd },
059ec3d9
PH
578 { "inode", vtype_ino, &deliver_inode },
579 { "interface_address", vtype_stringptr, &interface_address },
580 { "interface_port", vtype_int, &interface_port },
0ce9abe6 581 { "item", vtype_stringptr, &iterate_item },
059ec3d9
PH
582 #ifdef LOOKUP_LDAP
583 { "ldap_dn", vtype_stringptr, &eldap_dn },
584 #endif
585 { "load_average", vtype_load_avg, NULL },
586 { "local_part", vtype_stringptr, &deliver_localpart },
587 { "local_part_data", vtype_stringptr, &deliver_localpart_data },
588 { "local_part_prefix", vtype_stringptr, &deliver_localpart_prefix },
589 { "local_part_suffix", vtype_stringptr, &deliver_localpart_suffix },
9723f966 590#ifdef HAVE_LOCAL_SCAN
059ec3d9 591 { "local_scan_data", vtype_stringptr, &local_scan_data },
9723f966 592#endif
059ec3d9
PH
593 { "local_user_gid", vtype_gid, &local_user_gid },
594 { "local_user_uid", vtype_uid, &local_user_uid },
595 { "localhost_number", vtype_int, &host_number },
5cb8cbc6 596 { "log_inodes", vtype_pinodes, (void *)FALSE },
8e669ac1 597 { "log_space", vtype_pspace, (void *)FALSE },
4e0983dc 598 { "lookup_dnssec_authenticated",vtype_stringptr,&lookup_dnssec_authenticated},
059ec3d9 599 { "mailstore_basename", vtype_stringptr, &mailstore_basename },
8523533c
TK
600#ifdef WITH_CONTENT_SCAN
601 { "malware_name", vtype_stringptr, &malware_name },
602#endif
d677b2f2 603 { "max_received_linelength", vtype_int, &max_received_linelength },
059ec3d9
PH
604 { "message_age", vtype_int, &message_age },
605 { "message_body", vtype_msgbody, &message_body },
606 { "message_body_end", vtype_msgbody_end, &message_body_end },
607 { "message_body_size", vtype_int, &message_body_size },
1ab52c69 608 { "message_exim_id", vtype_stringptr, &message_id },
059ec3d9 609 { "message_headers", vtype_msgheaders, NULL },
ff75a1f7 610 { "message_headers_raw", vtype_msgheaders_raw, NULL },
059ec3d9 611 { "message_id", vtype_stringptr, &message_id },
2e0c1448 612 { "message_linecount", vtype_int, &message_linecount },
059ec3d9 613 { "message_size", vtype_int, &message_size },
8c5d388a 614#ifdef SUPPORT_I18N
eb02f5df
JH
615 { "message_smtputf8", vtype_bool, &message_smtputf8 },
616#endif
8523533c
TK
617#ifdef WITH_CONTENT_SCAN
618 { "mime_anomaly_level", vtype_int, &mime_anomaly_level },
619 { "mime_anomaly_text", vtype_stringptr, &mime_anomaly_text },
620 { "mime_boundary", vtype_stringptr, &mime_boundary },
621 { "mime_charset", vtype_stringptr, &mime_charset },
622 { "mime_content_description", vtype_stringptr, &mime_content_description },
623 { "mime_content_disposition", vtype_stringptr, &mime_content_disposition },
624 { "mime_content_id", vtype_stringptr, &mime_content_id },
625 { "mime_content_size", vtype_int, &mime_content_size },
626 { "mime_content_transfer_encoding",vtype_stringptr, &mime_content_transfer_encoding },
627 { "mime_content_type", vtype_stringptr, &mime_content_type },
628 { "mime_decoded_filename", vtype_stringptr, &mime_decoded_filename },
629 { "mime_filename", vtype_stringptr, &mime_filename },
630 { "mime_is_coverletter", vtype_int, &mime_is_coverletter },
631 { "mime_is_multipart", vtype_int, &mime_is_multipart },
632 { "mime_is_rfc822", vtype_int, &mime_is_rfc822 },
633 { "mime_part_count", vtype_int, &mime_part_count },
634#endif
059ec3d9
PH
635 { "n0", vtype_filter_int, &filter_n[0] },
636 { "n1", vtype_filter_int, &filter_n[1] },
637 { "n2", vtype_filter_int, &filter_n[2] },
638 { "n3", vtype_filter_int, &filter_n[3] },
639 { "n4", vtype_filter_int, &filter_n[4] },
640 { "n5", vtype_filter_int, &filter_n[5] },
641 { "n6", vtype_filter_int, &filter_n[6] },
642 { "n7", vtype_filter_int, &filter_n[7] },
643 { "n8", vtype_filter_int, &filter_n[8] },
644 { "n9", vtype_filter_int, &filter_n[9] },
645 { "original_domain", vtype_stringptr, &deliver_domain_orig },
646 { "original_local_part", vtype_stringptr, &deliver_localpart_orig },
647 { "originator_gid", vtype_gid, &originator_gid },
648 { "originator_uid", vtype_uid, &originator_uid },
649 { "parent_domain", vtype_stringptr, &deliver_domain_parent },
650 { "parent_local_part", vtype_stringptr, &deliver_localpart_parent },
651 { "pid", vtype_pid, NULL },
858e91c2
JH
652#ifndef DISABLE_PRDR
653 { "prdr_requested", vtype_bool, &prdr_requested },
654#endif
059ec3d9 655 { "primary_hostname", vtype_stringptr, &primary_hostname },
e6d2a989
JH
656#if defined(SUPPORT_PROXY) || defined(SUPPORT_SOCKS)
657 { "proxy_external_address",vtype_stringptr, &proxy_external_address },
658 { "proxy_external_port", vtype_int, &proxy_external_port },
659 { "proxy_local_address", vtype_stringptr, &proxy_local_address },
660 { "proxy_local_port", vtype_int, &proxy_local_port },
a3c86431
TL
661 { "proxy_session", vtype_bool, &proxy_session },
662#endif
fffda43a
TK
663 { "prvscheck_address", vtype_stringptr, &prvscheck_address },
664 { "prvscheck_keynum", vtype_stringptr, &prvscheck_keynum },
665 { "prvscheck_result", vtype_stringptr, &prvscheck_result },
059ec3d9
PH
666 { "qualify_domain", vtype_stringptr, &qualify_domain_sender },
667 { "qualify_recipient", vtype_stringptr, &qualify_domain_recipient },
0cd5fd23 668 { "queue_name", vtype_stringptr, &queue_name },
059ec3d9
PH
669 { "rcpt_count", vtype_int, &rcpt_count },
670 { "rcpt_defer_count", vtype_int, &rcpt_defer_count },
671 { "rcpt_fail_count", vtype_int, &rcpt_fail_count },
672 { "received_count", vtype_int, &received_count },
673 { "received_for", vtype_stringptr, &received_for },
194cc0e4
PH
674 { "received_ip_address", vtype_stringptr, &interface_address },
675 { "received_port", vtype_int, &interface_port },
059ec3d9 676 { "received_protocol", vtype_stringptr, &received_protocol },
32dfdf8b 677 { "received_time", vtype_int, &received_time.tv_sec },
059ec3d9 678 { "recipient_data", vtype_stringptr, &recipient_data },
8e669ac1 679 { "recipient_verify_failure",vtype_stringptr,&recipient_verify_failure },
6d95688d 680 { "recipients", vtype_string_func, (void *) &fn_recipients },
059ec3d9 681 { "recipients_count", vtype_int, &recipients_count },
8523533c
TK
682#ifdef WITH_CONTENT_SCAN
683 { "regex_match_string", vtype_stringptr, &regex_match_string },
684#endif
059ec3d9
PH
685 { "reply_address", vtype_reply, NULL },
686 { "return_path", vtype_stringptr, &return_path },
687 { "return_size_limit", vtype_int, &bounce_return_size_limit },
181d9bf8 688 { "router_name", vtype_stringptr, &router_name },
059ec3d9
PH
689 { "runrc", vtype_int, &runrc },
690 { "self_hostname", vtype_stringptr, &self_hostname },
691 { "sender_address", vtype_stringptr, &sender_address },
2a3eea10 692 { "sender_address_data", vtype_stringptr, &sender_address_data },
059ec3d9
PH
693 { "sender_address_domain", vtype_domain, &sender_address },
694 { "sender_address_local_part", vtype_localpart, &sender_address },
695 { "sender_data", vtype_stringptr, &sender_data },
696 { "sender_fullhost", vtype_stringptr, &sender_fullhost },
1705dd20 697 { "sender_helo_dnssec", vtype_bool, &sender_helo_dnssec },
059ec3d9
PH
698 { "sender_helo_name", vtype_stringptr, &sender_helo_name },
699 { "sender_host_address", vtype_stringptr, &sender_host_address },
700 { "sender_host_authenticated",vtype_stringptr, &sender_host_authenticated },
11d7e4fa 701 { "sender_host_dnssec", vtype_bool, &sender_host_dnssec },
059ec3d9
PH
702 { "sender_host_name", vtype_host_lookup, NULL },
703 { "sender_host_port", vtype_int, &sender_host_port },
704 { "sender_ident", vtype_stringptr, &sender_ident },
870f6ba8
TF
705 { "sender_rate", vtype_stringptr, &sender_rate },
706 { "sender_rate_limit", vtype_stringptr, &sender_rate_limit },
707 { "sender_rate_period", vtype_stringptr, &sender_rate_period },
059ec3d9 708 { "sender_rcvhost", vtype_stringptr, &sender_rcvhost },
8e669ac1 709 { "sender_verify_failure",vtype_stringptr, &sender_verify_failure },
41c7c167
PH
710 { "sending_ip_address", vtype_stringptr, &sending_ip_address },
711 { "sending_port", vtype_int, &sending_port },
8e669ac1 712 { "smtp_active_hostname", vtype_stringptr, &smtp_active_hostname },
3ee512ff
PH
713 { "smtp_command", vtype_stringptr, &smtp_cmd_buffer },
714 { "smtp_command_argument", vtype_stringptr, &smtp_cmd_argument },
6d95688d 715 { "smtp_command_history", vtype_string_func, (void *) &smtp_cmd_hist },
b01dd148 716 { "smtp_count_at_connection_start", vtype_int, &smtp_accept_count },
8f128379 717 { "smtp_notquit_reason", vtype_stringptr, &smtp_notquit_reason },
059ec3d9
PH
718 { "sn0", vtype_filter_int, &filter_sn[0] },
719 { "sn1", vtype_filter_int, &filter_sn[1] },
720 { "sn2", vtype_filter_int, &filter_sn[2] },
721 { "sn3", vtype_filter_int, &filter_sn[3] },
722 { "sn4", vtype_filter_int, &filter_sn[4] },
723 { "sn5", vtype_filter_int, &filter_sn[5] },
724 { "sn6", vtype_filter_int, &filter_sn[6] },
725 { "sn7", vtype_filter_int, &filter_sn[7] },
726 { "sn8", vtype_filter_int, &filter_sn[8] },
727 { "sn9", vtype_filter_int, &filter_sn[9] },
8523533c 728#ifdef WITH_CONTENT_SCAN
c5f280e2 729 { "spam_action", vtype_stringptr, &spam_action },
8523533c
TK
730 { "spam_bar", vtype_stringptr, &spam_bar },
731 { "spam_report", vtype_stringptr, &spam_report },
732 { "spam_score", vtype_stringptr, &spam_score },
733 { "spam_score_int", vtype_stringptr, &spam_score_int },
734#endif
7952eef9 735#ifdef SUPPORT_SPF
65a7d8c3 736 { "spf_guess", vtype_stringptr, &spf_guess },
8523533c
TK
737 { "spf_header_comment", vtype_stringptr, &spf_header_comment },
738 { "spf_received", vtype_stringptr, &spf_received },
739 { "spf_result", vtype_stringptr, &spf_result },
87e9d061 740 { "spf_result_guessed", vtype_bool, &spf_result_guessed },
8523533c
TK
741 { "spf_smtp_comment", vtype_stringptr, &spf_smtp_comment },
742#endif
059ec3d9 743 { "spool_directory", vtype_stringptr, &spool_directory },
5cb8cbc6 744 { "spool_inodes", vtype_pinodes, (void *)TRUE },
8e669ac1 745 { "spool_space", vtype_pspace, (void *)TRUE },
8523533c
TK
746#ifdef EXPERIMENTAL_SRS
747 { "srs_db_address", vtype_stringptr, &srs_db_address },
748 { "srs_db_key", vtype_stringptr, &srs_db_key },
749 { "srs_orig_recipient", vtype_stringptr, &srs_orig_recipient },
750 { "srs_orig_sender", vtype_stringptr, &srs_orig_sender },
7ef88aa0
JH
751#endif
752#if defined(EXPERIMENTAL_SRS) || defined(EXPERIMENTAL_SRS_NATIVE)
8523533c 753 { "srs_recipient", vtype_stringptr, &srs_recipient },
7ef88aa0
JH
754#endif
755#ifdef EXPERIMENTAL_SRS
8523533c
TK
756 { "srs_status", vtype_stringptr, &srs_status },
757#endif
059ec3d9 758 { "thisaddress", vtype_stringptr, &filter_thisaddress },
817d9f57 759
d9b2312b 760 /* The non-(in,out) variables are now deprecated */
817d9f57
JH
761 { "tls_bits", vtype_int, &tls_in.bits },
762 { "tls_certificate_verified", vtype_int, &tls_in.certificate_verified },
763 { "tls_cipher", vtype_stringptr, &tls_in.cipher },
d9b2312b
JH
764
765 { "tls_in_bits", vtype_int, &tls_in.bits },
766 { "tls_in_certificate_verified", vtype_int, &tls_in.certificate_verified },
767 { "tls_in_cipher", vtype_stringptr, &tls_in.cipher },
f1be21cf 768 { "tls_in_cipher_std", vtype_stringptr, &tls_in.cipher_stdname },
44662487 769 { "tls_in_ocsp", vtype_int, &tls_in.ocsp },
9d1c15ef
JH
770 { "tls_in_ourcert", vtype_cert, &tls_in.ourcert },
771 { "tls_in_peercert", vtype_cert, &tls_in.peercert },
d9b2312b 772 { "tls_in_peerdn", vtype_stringptr, &tls_in.peerdn },
b10c87b3
JH
773#ifdef EXPERIMENTAL_TLS_RESUME
774 { "tls_in_resumption", vtype_int, &tls_in.resumption },
775#endif
01603eec 776#ifndef DISABLE_TLS
d9b2312b
JH
777 { "tls_in_sni", vtype_stringptr, &tls_in.sni },
778#endif
5b195d6b 779 { "tls_in_ver", vtype_stringptr, &tls_in.ver },
817d9f57 780 { "tls_out_bits", vtype_int, &tls_out.bits },
cb9d95ae 781 { "tls_out_certificate_verified", vtype_int,&tls_out.certificate_verified },
817d9f57 782 { "tls_out_cipher", vtype_stringptr, &tls_out.cipher },
f1be21cf 783 { "tls_out_cipher_std", vtype_stringptr, &tls_out.cipher_stdname },
c0635b6d 784#ifdef SUPPORT_DANE
594706ea
JH
785 { "tls_out_dane", vtype_bool, &tls_out.dane_verified },
786#endif
44662487 787 { "tls_out_ocsp", vtype_int, &tls_out.ocsp },
9d1c15ef
JH
788 { "tls_out_ourcert", vtype_cert, &tls_out.ourcert },
789 { "tls_out_peercert", vtype_cert, &tls_out.peercert },
817d9f57 790 { "tls_out_peerdn", vtype_stringptr, &tls_out.peerdn },
b10c87b3
JH
791#ifdef EXPERIMENTAL_TLS_RESUME
792 { "tls_out_resumption", vtype_int, &tls_out.resumption },
793#endif
01603eec 794#ifndef DISABLE_TLS
817d9f57 795 { "tls_out_sni", vtype_stringptr, &tls_out.sni },
7be682ca 796#endif
c0635b6d 797#ifdef SUPPORT_DANE
594706ea
JH
798 { "tls_out_tlsa_usage", vtype_int, &tls_out.tlsa_usage },
799#endif
5b195d6b 800 { "tls_out_ver", vtype_stringptr, &tls_out.ver },
d9b2312b 801
613dd4ae 802 { "tls_peerdn", vtype_stringptr, &tls_in.peerdn }, /* mind the alphabetical order! */
01603eec 803#ifndef DISABLE_TLS
613dd4ae
JH
804 { "tls_sni", vtype_stringptr, &tls_in.sni }, /* mind the alphabetical order! */
805#endif
817d9f57 806
059ec3d9
PH
807 { "tod_bsdinbox", vtype_todbsdin, NULL },
808 { "tod_epoch", vtype_tode, NULL },
f5787926 809 { "tod_epoch_l", vtype_todel, NULL },
059ec3d9
PH
810 { "tod_full", vtype_todf, NULL },
811 { "tod_log", vtype_todl, NULL },
812 { "tod_logfile", vtype_todlf, NULL },
813 { "tod_zone", vtype_todzone, NULL },
814 { "tod_zulu", vtype_todzulu, NULL },
181d9bf8 815 { "transport_name", vtype_stringptr, &transport_name },
059ec3d9 816 { "value", vtype_stringptr, &lookup_value },
aec45841 817 { "verify_mode", vtype_stringptr, &verify_mode },
059ec3d9
PH
818 { "version_number", vtype_stringptr, &version_string },
819 { "warn_message_delay", vtype_stringptr, &warnmsg_delay },
820 { "warn_message_recipient",vtype_stringptr, &warnmsg_recipients },
821 { "warn_message_recipients",vtype_stringptr,&warnmsg_recipients },
822 { "warnmsg_delay", vtype_stringptr, &warnmsg_delay },
823 { "warnmsg_recipient", vtype_stringptr, &warnmsg_recipients },
824 { "warnmsg_recipients", vtype_stringptr, &warnmsg_recipients }
825};
826
0539a19d 827static int var_table_size = nelem(var_table);
059ec3d9
PH
828static uschar var_buffer[256];
829static BOOL malformed_header;
830
831/* For textual hashes */
832
1ba28e2b
PP
833static const char *hashcodes = "abcdefghijklmnopqrtsuvwxyz"
834 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
835 "0123456789";
059ec3d9
PH
836
837enum { HMAC_MD5, HMAC_SHA1 };
838
839/* For numeric hashes */
840
841static unsigned int prime[] = {
842 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
843 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
844 73, 79, 83, 89, 97, 101, 103, 107, 109, 113};
845
846/* For printing modes in symbolic form */
847
848static uschar *mtable_normal[] =
849 { US"---", US"--x", US"-w-", US"-wx", US"r--", US"r-x", US"rw-", US"rwx" };
850
851static uschar *mtable_setid[] =
852 { US"--S", US"--s", US"-wS", US"-ws", US"r-S", US"r-s", US"rwS", US"rws" };
853
854static uschar *mtable_sticky[] =
855 { US"--T", US"--t", US"-wT", US"-wt", US"r-T", US"r-t", US"rwT", US"rwt" };
856
bce15b62
JH
857/* flags for find_header() */
858#define FH_EXISTS_ONLY BIT(0)
859#define FH_WANT_RAW BIT(1)
860#define FH_WANT_LIST BIT(2)
059ec3d9
PH
861
862
863/*************************************************
864* Tables for UTF-8 support *
865*************************************************/
866
867/* Table of the number of extra characters, indexed by the first character
868masked with 0x3f. The highest number for a valid UTF-8 character is in fact
8690x3d. */
870
871static uschar utf8_table1[] = {
872 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
873 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
874 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
875 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 };
876
877/* These are the masks for the data bits in the first byte of a character,
878indexed by the number of additional bytes. */
879
880static int utf8_table2[] = { 0xff, 0x1f, 0x0f, 0x07, 0x03, 0x01};
881
882/* Get the next UTF-8 character, advancing the pointer. */
883
884#define GETUTF8INC(c, ptr) \
885 c = *ptr++; \
886 if ((c & 0xc0) == 0xc0) \
887 { \
888 int a = utf8_table1[c & 0x3f]; /* Number of additional bytes */ \
889 int s = 6*a; \
890 c = (c & utf8_table2[a]) << s; \
891 while (a-- > 0) \
892 { \
893 s -= 6; \
894 c |= (*ptr++ & 0x3f) << s; \
895 } \
896 }
897
898
03ca21f8
JH
899
900static uschar * base32_chars = US"abcdefghijklmnopqrstuvwxyz234567";
901
059ec3d9
PH
902/*************************************************
903* Binary chop search on a table *
904*************************************************/
905
906/* This is used for matching expansion items and operators.
907
908Arguments:
909 name the name that is being sought
910 table the table to search
911 table_size the number of items in the table
912
913Returns: the offset in the table, or -1
914*/
915
916static int
917chop_match(uschar *name, uschar **table, int table_size)
918{
919uschar **bot = table;
920uschar **top = table + table_size;
921
922while (top > bot)
923 {
924 uschar **mid = bot + (top - bot)/2;
925 int c = Ustrcmp(name, *mid);
926 if (c == 0) return mid - table;
927 if (c > 0) bot = mid + 1; else top = mid;
928 }
929
930return -1;
931}
932
933
934
935/*************************************************
936* Check a condition string *
937*************************************************/
938
939/* This function is called to expand a string, and test the result for a "true"
940or "false" value. Failure of the expansion yields FALSE; logged unless it was a
be7a5781
JH
941forced fail or lookup defer.
942
943We used to release all store used, but this is not not safe due
944to ${dlfunc } and ${acl }. In any case expand_string_internal()
945is reasonably careful to release what it can.
059ec3d9 946
6a8de854
PP
947The actual false-value tests should be replicated for ECOND_BOOL_LAX.
948
059ec3d9
PH
949Arguments:
950 condition the condition string
951 m1 text to be incorporated in panic error
952 m2 ditto
953
954Returns: TRUE if condition is met, FALSE if not
955*/
956
957BOOL
958expand_check_condition(uschar *condition, uschar *m1, uschar *m2)
959{
5694b905
JH
960uschar * ss = expand_string(condition);
961if (!ss)
059ec3d9 962 {
8768d548 963 if (!f.expand_string_forcedfail && !f.search_find_defer)
059ec3d9
PH
964 log_write(0, LOG_MAIN|LOG_PANIC, "failed to expand condition \"%s\" "
965 "for %s %s: %s", condition, m1, m2, expand_string_message);
966 return FALSE;
967 }
5694b905 968return *ss && Ustrcmp(ss, "0") != 0 && strcmpic(ss, US"no") != 0 &&
059ec3d9 969 strcmpic(ss, US"false") != 0;
059ec3d9
PH
970}
971
972
973
17c76198 974
059ec3d9 975/*************************************************
9e3331ea
TK
976* Pseudo-random number generation *
977*************************************************/
978
979/* Pseudo-random number generation. The result is not "expected" to be
980cryptographically strong but not so weak that someone will shoot themselves
981in the foot using it as a nonce in some email header scheme or whatever
982weirdness they'll twist this into. The result should ideally handle fork().
983
984However, if we're stuck unable to provide this, then we'll fall back to
985appallingly bad randomness.
986
01603eec 987If DISABLE_TLS is not defined then this will not be used except as an emergency
17c76198 988fallback.
9e3331ea
TK
989
990Arguments:
991 max range maximum
992Returns a random number in range [0, max-1]
993*/
994
01603eec 995#ifndef DISABLE_TLS
17c76198
PP
996# define vaguely_random_number vaguely_random_number_fallback
997#endif
9e3331ea 998int
17c76198 999vaguely_random_number(int max)
9e3331ea 1000{
01603eec 1001#ifndef DISABLE_TLS
17c76198
PP
1002# undef vaguely_random_number
1003#endif
dca6d121
JH
1004static pid_t pid = 0;
1005pid_t p2;
9e3331ea 1006
dca6d121
JH
1007if ((p2 = getpid()) != pid)
1008 {
1009 if (pid != 0)
9e3331ea 1010 {
9e3331ea
TK
1011
1012#ifdef HAVE_ARC4RANDOM
dca6d121
JH
1013 /* cryptographically strong randomness, common on *BSD platforms, not
1014 so much elsewhere. Alas. */
1015# ifndef NOT_HAVE_ARC4RANDOM_STIR
1016 arc4random_stir();
1017# endif
9e3331ea 1018#elif defined(HAVE_SRANDOM) || defined(HAVE_SRANDOMDEV)
dca6d121
JH
1019# ifdef HAVE_SRANDOMDEV
1020 /* uses random(4) for seeding */
1021 srandomdev();
1022# else
1023 {
1024 struct timeval tv;
1025 gettimeofday(&tv, NULL);
1026 srandom(tv.tv_sec | tv.tv_usec | getpid());
1027 }
1028# endif
9e3331ea 1029#else
dca6d121 1030 /* Poor randomness and no seeding here */
9e3331ea
TK
1031#endif
1032
9e3331ea 1033 }
dca6d121
JH
1034 pid = p2;
1035 }
9e3331ea
TK
1036
1037#ifdef HAVE_ARC4RANDOM
dca6d121 1038return arc4random() % max;
9e3331ea 1039#elif defined(HAVE_SRANDOM) || defined(HAVE_SRANDOMDEV)
dca6d121 1040return random() % max;
9e3331ea 1041#else
dca6d121
JH
1042/* This one returns a 16-bit number, definitely not crypto-strong */
1043return random_number(max);
9e3331ea
TK
1044#endif
1045}
1046
17c76198
PP
1047
1048
9e3331ea
TK
1049
1050/*************************************************
059ec3d9
PH
1051* Pick out a name from a string *
1052*************************************************/
1053
1054/* If the name is too long, it is silently truncated.
1055
1056Arguments:
1057 name points to a buffer into which to put the name
1058 max is the length of the buffer
1059 s points to the first alphabetic character of the name
1060 extras chars other than alphanumerics to permit
1061
1062Returns: pointer to the first character after the name
1063
1064Note: The test for *s != 0 in the while loop is necessary because
1065Ustrchr() yields non-NULL if the character is zero (which is not something
1066I expected). */
1067
55414b25
JH
1068static const uschar *
1069read_name(uschar *name, int max, const uschar *s, uschar *extras)
059ec3d9
PH
1070{
1071int ptr = 0;
5694b905 1072while (*s && (isalnum(*s) || Ustrchr(extras, *s) != NULL))
059ec3d9
PH
1073 {
1074 if (ptr < max-1) name[ptr++] = *s;
1075 s++;
1076 }
1077name[ptr] = 0;
1078return s;
1079}
1080
1081
1082
1083/*************************************************
1084* Pick out the rest of a header name *
1085*************************************************/
1086
1087/* A variable name starting $header_ (or just $h_ for those who like
1088abbreviations) might not be the complete header name because headers can
1089contain any printing characters in their names, except ':'. This function is
1090called to read the rest of the name, chop h[eader]_ off the front, and put ':'
1091on the end, if the name was terminated by white space.
1092
1093Arguments:
1094 name points to a buffer in which the name read so far exists
1095 max is the length of the buffer
1096 s points to the first character after the name so far, i.e. the
1097 first non-alphameric character after $header_xxxxx
1098
1099Returns: a pointer to the first character after the header name
1100*/
1101
55414b25
JH
1102static const uschar *
1103read_header_name(uschar *name, int max, const uschar *s)
059ec3d9
PH
1104{
1105int prelen = Ustrchr(name, '_') - name + 1;
1106int ptr = Ustrlen(name) - prelen;
1107if (ptr > 0) memmove(name, name+prelen, ptr);
1108while (mac_isgraph(*s) && *s != ':')
1109 {
1110 if (ptr < max-1) name[ptr++] = *s;
1111 s++;
1112 }
1113if (*s == ':') s++;
1114name[ptr++] = ':';
1115name[ptr] = 0;
1116return s;
1117}
1118
1119
1120
1121/*************************************************
1122* Pick out a number from a string *
1123*************************************************/
1124
1125/* Arguments:
1126 n points to an integer into which to put the number
1127 s points to the first digit of the number
1128
1129Returns: a pointer to the character after the last digit
1130*/
13559da6
JH
1131/*XXX consider expanding to int_eximarith_t. But the test for
1132"overbig numbers" in 0002 still needs to overflow it. */
059ec3d9
PH
1133
1134static uschar *
1135read_number(int *n, uschar *s)
1136{
1137*n = 0;
1138while (isdigit(*s)) *n = *n * 10 + (*s++ - '0');
1139return s;
1140}
1141
55414b25
JH
1142static const uschar *
1143read_cnumber(int *n, const uschar *s)
1144{
1145*n = 0;
1146while (isdigit(*s)) *n = *n * 10 + (*s++ - '0');
1147return s;
1148}
1149
059ec3d9
PH
1150
1151
1152/*************************************************
1153* Extract keyed subfield from a string *
1154*************************************************/
1155
1156/* The yield is in dynamic store; NULL means that the key was not found.
1157
1158Arguments:
1159 key points to the name of the key
1160 s points to the string from which to extract the subfield
1161
1162Returns: NULL if the subfield was not found, or
1163 a pointer to the subfield's data
1164*/
1165
1166static uschar *
8fdf20fd 1167expand_getkeyed(uschar * key, const uschar * s)
059ec3d9
PH
1168{
1169int length = Ustrlen(key);
1170while (isspace(*s)) s++;
1171
1172/* Loop to search for the key */
1173
8fdf20fd 1174while (*s)
059ec3d9
PH
1175 {
1176 int dkeylength;
8fdf20fd
JH
1177 uschar * data;
1178 const uschar * dkey = s;
059ec3d9 1179
8fdf20fd 1180 while (*s && *s != '=' && !isspace(*s)) s++;
059ec3d9
PH
1181 dkeylength = s - dkey;
1182 while (isspace(*s)) s++;
1183 if (*s == '=') while (isspace((*(++s))));
1184
1185 data = string_dequote(&s);
1186 if (length == dkeylength && strncmpic(key, dkey, length) == 0)
1187 return data;
1188
1189 while (isspace(*s)) s++;
1190 }
1191
1192return NULL;
1193}
1194
1195
1196
9d1c15ef
JH
1197static var_entry *
1198find_var_ent(uschar * name)
1199{
1200int first = 0;
1201int last = var_table_size;
1202
1203while (last > first)
1204 {
1205 int middle = (first + last)/2;
1206 int c = Ustrcmp(name, var_table[middle].name);
1207
1208 if (c > 0) { first = middle + 1; continue; }
1209 if (c < 0) { last = middle; continue; }
1210 return &var_table[middle];
1211 }
1212return NULL;
1213}
059ec3d9
PH
1214
1215/*************************************************
1216* Extract numbered subfield from string *
1217*************************************************/
1218
1219/* Extracts a numbered field from a string that is divided by tokens - for
1220example a line from /etc/passwd is divided by colon characters. First field is
1221numbered one. Negative arguments count from the right. Zero returns the whole
1222string. Returns NULL if there are insufficient tokens in the string
1223
1224***WARNING***
1225Modifies final argument - this is a dynamically generated string, so that's OK.
1226
1227Arguments:
1228 field number of field to be extracted,
1229 first field = 1, whole string = 0, last field = -1
1230 separators characters that are used to break string into tokens
1231 s points to the string from which to extract the subfield
1232
1233Returns: NULL if the field was not found,
1234 a pointer to the field's data inside s (modified to add 0)
1235*/
1236
1237static uschar *
1238expand_gettokened (int field, uschar *separators, uschar *s)
1239{
1240int sep = 1;
1241int count;
1242uschar *ss = s;
1243uschar *fieldtext = NULL;
1244
1245if (field == 0) return s;
1246
1247/* Break the line up into fields in place; for field > 0 we stop when we have
1248done the number of fields we want. For field < 0 we continue till the end of
1249the string, counting the number of fields. */
1250
1251count = (field > 0)? field : INT_MAX;
1252
1253while (count-- > 0)
1254 {
1255 size_t len;
1256
1257 /* Previous field was the last one in the string. For a positive field
1258 number, this means there are not enough fields. For a negative field number,
1259 check that there are enough, and scan back to find the one that is wanted. */
1260
1261 if (sep == 0)
1262 {
1263 if (field > 0 || (-field) > (INT_MAX - count - 1)) return NULL;
1264 if ((-field) == (INT_MAX - count - 1)) return s;
1265 while (field++ < 0)
1266 {
1267 ss--;
1268 while (ss[-1] != 0) ss--;
1269 }
1270 fieldtext = ss;
1271 break;
1272 }
1273
1274 /* Previous field was not last in the string; save its start and put a
1275 zero at its end. */
1276
1277 fieldtext = ss;
1278 len = Ustrcspn(ss, separators);
1279 sep = ss[len];
1280 ss[len] = 0;
1281 ss += len + 1;
1282 }
1283
1284return fieldtext;
1285}
1286
1287
aa26e137 1288static uschar *
55414b25 1289expand_getlistele(int field, const uschar * list)
aa26e137 1290{
8fdf20fd
JH
1291const uschar * tlist = list;
1292int sep = 0;
aa26e137
JH
1293uschar dummy;
1294
8fdf20fd 1295if (field < 0)
0f0c8159 1296 {
8fdf20fd
JH
1297 for (field++; string_nextinlist(&tlist, &sep, &dummy, 1); ) field++;
1298 sep = 0;
0f0c8159 1299 }
8fdf20fd
JH
1300if (field == 0) return NULL;
1301while (--field > 0 && (string_nextinlist(&list, &sep, &dummy, 1))) ;
aa26e137
JH
1302return string_nextinlist(&list, &sep, NULL, 0);
1303}
059ec3d9 1304
9d1c15ef
JH
1305
1306/* Certificate fields, by name. Worry about by-OID later */
9e4dddbd 1307/* Names are chosen to not have common prefixes */
9d1c15ef 1308
01603eec 1309#ifndef DISABLE_TLS
9d1c15ef
JH
1310typedef struct
1311{
1312uschar * name;
9e4dddbd
JH
1313int namelen;
1314uschar * (*getfn)(void * cert, uschar * mod);
9d1c15ef
JH
1315} certfield;
1316static certfield certfields[] =
1317{ /* linear search; no special order */
9e4dddbd
JH
1318 { US"version", 7, &tls_cert_version },
1319 { US"serial_number", 13, &tls_cert_serial_number },
1320 { US"subject", 7, &tls_cert_subject },
1321 { US"notbefore", 9, &tls_cert_not_before },
1322 { US"notafter", 8, &tls_cert_not_after },
1323 { US"issuer", 6, &tls_cert_issuer },
1324 { US"signature", 9, &tls_cert_signature },
1325 { US"sig_algorithm", 13, &tls_cert_signature_algorithm },
1326 { US"subj_altname", 12, &tls_cert_subject_altname },
1327 { US"ocsp_uri", 8, &tls_cert_ocsp_uri },
1328 { US"crl_uri", 7, &tls_cert_crl_uri },
9d1c15ef
JH
1329};
1330
1331static uschar *
1332expand_getcertele(uschar * field, uschar * certvar)
1333{
1334var_entry * vp;
9d1c15ef
JH
1335
1336if (!(vp = find_var_ent(certvar)))
1337 {
94431adb 1338 expand_string_message =
9d1c15ef
JH
1339 string_sprintf("no variable named \"%s\"", certvar);
1340 return NULL; /* Unknown variable name */
1341 }
1342/* NB this stops us passing certs around in variable. Might
1343want to do that in future */
1344if (vp->type != vtype_cert)
1345 {
94431adb 1346 expand_string_message =
9d1c15ef
JH
1347 string_sprintf("\"%s\" is not a certificate", certvar);
1348 return NULL; /* Unknown variable name */
1349 }
1350if (!*(void **)vp->value)
1351 return NULL;
1352
1353if (*field >= '0' && *field <= '9')
1354 return tls_cert_ext_by_oid(*(void **)vp->value, field, 0);
1355
d7978c0f
JH
1356for (certfield * cp = certfields;
1357 cp < certfields + nelem(certfields);
1358 cp++)
9e4dddbd
JH
1359 if (Ustrncmp(cp->name, field, cp->namelen) == 0)
1360 {
1361 uschar * modifier = *(field += cp->namelen) == ','
1362 ? ++field : NULL;
1363 return (*cp->getfn)( *(void **)vp->value, modifier );
1364 }
9d1c15ef 1365
94431adb 1366expand_string_message =
9d1c15ef
JH
1367 string_sprintf("bad field selector \"%s\" for certextract", field);
1368return NULL;
1369}
01603eec 1370#endif /*DISABLE_TLS*/
9d1c15ef 1371
059ec3d9
PH
1372/*************************************************
1373* Extract a substring from a string *
1374*************************************************/
1375
1376/* Perform the ${substr or ${length expansion operations.
1377
1378Arguments:
1379 subject the input string
1380 value1 the offset from the start of the input string to the start of
1381 the output string; if negative, count from the right.
1382 value2 the length of the output string, or negative (-1) for unset
1383 if value1 is positive, unset means "all after"
1384 if value1 is negative, unset means "all before"
1385 len set to the length of the returned string
1386
1387Returns: pointer to the output string, or NULL if there is an error
1388*/
1389
1390static uschar *
1391extract_substr(uschar *subject, int value1, int value2, int *len)
1392{
1393int sublen = Ustrlen(subject);
1394
1395if (value1 < 0) /* count from right */
1396 {
1397 value1 += sublen;
1398
1399 /* If the position is before the start, skip to the start, and adjust the
1400 length. If the length ends up negative, the substring is null because nothing
1401 can precede. This falls out naturally when the length is unset, meaning "all
1402 to the left". */
1403
1404 if (value1 < 0)
1405 {
1406 value2 += value1;
1407 if (value2 < 0) value2 = 0;
1408 value1 = 0;
1409 }
1410
1411 /* Otherwise an unset length => characters before value1 */
1412
1413 else if (value2 < 0)
1414 {
1415 value2 = value1;
1416 value1 = 0;
1417 }
1418 }
1419
1420/* For a non-negative offset, if the starting position is past the end of the
1421string, the result will be the null string. Otherwise, an unset length means
1422"rest"; just set it to the maximum - it will be cut down below if necessary. */
1423
1424else
1425 {
1426 if (value1 > sublen)
1427 {
1428 value1 = sublen;
1429 value2 = 0;
1430 }
1431 else if (value2 < 0) value2 = sublen;
1432 }
1433
1434/* Cut the length down to the maximum possible for the offset value, and get
1435the required characters. */
1436
1437if (value1 + value2 > sublen) value2 = sublen - value1;
1438*len = value2;
1439return subject + value1;
1440}
1441
1442
1443
1444
1445/*************************************************
1446* Old-style hash of a string *
1447*************************************************/
1448
1449/* Perform the ${hash expansion operation.
1450
1451Arguments:
1452 subject the input string (an expanded substring)
1453 value1 the length of the output string; if greater or equal to the
1454 length of the input string, the input string is returned
1455 value2 the number of hash characters to use, or 26 if negative
1456 len set to the length of the returned string
1457
1458Returns: pointer to the output string, or NULL if there is an error
1459*/
1460
1461static uschar *
1462compute_hash(uschar *subject, int value1, int value2, int *len)
1463{
1464int sublen = Ustrlen(subject);
1465
1466if (value2 < 0) value2 = 26;
1467else if (value2 > Ustrlen(hashcodes))
1468 {
1469 expand_string_message =
1470 string_sprintf("hash count \"%d\" too big", value2);
1471 return NULL;
1472 }
1473
1474/* Calculate the hash text. We know it is shorter than the original string, so
1475can safely place it in subject[] (we know that subject is always itself an
1476expanded substring). */
1477
1478if (value1 < sublen)
1479 {
1480 int c;
1481 int i = 0;
1482 int j = value1;
1483 while ((c = (subject[j])) != 0)
1484 {
1485 int shift = (c + j++) & 7;
1486 subject[i] ^= (c << shift) | (c >> (8-shift));
1487 if (++i >= value1) i = 0;
1488 }
1489 for (i = 0; i < value1; i++)
1490 subject[i] = hashcodes[(subject[i]) % value2];
1491 }
1492else value1 = sublen;
1493
1494*len = value1;
1495return subject;
1496}
1497
1498
1499
1500
1501/*************************************************
1502* Numeric hash of a string *
1503*************************************************/
1504
1505/* Perform the ${nhash expansion operation. The first characters of the
1506string are treated as most important, and get the highest prime numbers.
1507
1508Arguments:
1509 subject the input string
1510 value1 the maximum value of the first part of the result
1511 value2 the maximum value of the second part of the result,
1512 or negative to produce only a one-part result
1513 len set to the length of the returned string
1514
1515Returns: pointer to the output string, or NULL if there is an error.
1516*/
1517
1518static uschar *
1519compute_nhash (uschar *subject, int value1, int value2, int *len)
1520{
1521uschar *s = subject;
1522int i = 0;
1523unsigned long int total = 0; /* no overflow */
1524
1525while (*s != 0)
1526 {
0539a19d 1527 if (i == 0) i = nelem(prime) - 1;
059ec3d9
PH
1528 total += prime[i--] * (unsigned int)(*s++);
1529 }
1530
1531/* If value2 is unset, just compute one number */
1532
1533if (value2 < 0)
bb07bcd3 1534 s = string_sprintf("%lu", total % value1);
059ec3d9
PH
1535
1536/* Otherwise do a div/mod hash */
1537
1538else
1539 {
1540 total = total % (value1 * value2);
bb07bcd3 1541 s = string_sprintf("%lu/%lu", total/value2, total % value2);
059ec3d9
PH
1542 }
1543
1544*len = Ustrlen(s);
1545return s;
1546}
1547
1548
1549
1550
1551
1552/*************************************************
1553* Find the value of a header or headers *
1554*************************************************/
1555
1556/* Multiple instances of the same header get concatenated, and this function
1557can also return a concatenation of all the header lines. When concatenating
1558specific headers that contain lists of addresses, a comma is inserted between
1559them. Otherwise we use a straight concatenation. Because some messages can have
1560pathologically large number of lines, there is a limit on the length that is
5d26aacd 1561returned.
059ec3d9
PH
1562
1563Arguments:
1564 name the name of the header, without the leading $header_ or $h_,
1565 or NULL if a concatenation of all headers is required
059ec3d9
PH
1566 newsize return the size of memory block that was obtained; may be NULL
1567 if exists_only is TRUE
bce15b62
JH
1568 flags FH_EXISTS_ONLY
1569 set if called from a def: test; don't need to build a string;
1570 just return a string that is not "" and not "0" if the header
1571 exists
1572 FH_WANT_RAW
5d26aacd 1573 set if called for $rh_ or $rheader_ items; no processing,
bce15b62
JH
1574 other than concatenating, will be done on the header. Also used
1575 for $message_headers_raw.
1576 FH_WANT_LIST
1577 Double colon chars in the content, and replace newline with
1578 colon between each element when concatenating; returning a
1579 colon-sep list (elements might contain newlines)
059ec3d9
PH
1580 charset name of charset to translate MIME words to; used only if
1581 want_raw is false; if NULL, no translation is done (this is
1582 used for $bh_ and $bheader_)
1583
1584Returns: NULL if the header does not exist, else a pointer to a new
1585 store block
1586*/
1587
1588static uschar *
bce15b62 1589find_header(uschar *name, int *newsize, unsigned flags, uschar *charset)
059ec3d9 1590{
bce15b62
JH
1591BOOL found = !name;
1592int len = name ? Ustrlen(name) : 0;
1593BOOL comma = FALSE;
bce15b62 1594gstring * g = NULL;
059ec3d9 1595
d7978c0f 1596for (header_line * h = header_list; h; h = h->next)
bce15b62
JH
1597 if (h->type != htype_old && h->text) /* NULL => Received: placeholder */
1598 if (!name || (len <= h->slen && strncmpic(name, h->text, len) == 0))
1599 {
1600 uschar * s, * t;
1601 size_t inc;
fd700877 1602
bce15b62
JH
1603 if (flags & FH_EXISTS_ONLY)
1604 return US"1"; /* don't need actual string */
fd700877 1605
bce15b62
JH
1606 found = TRUE;
1607 s = h->text + len; /* text to insert */
1608 if (!(flags & FH_WANT_RAW)) /* unless wanted raw, */
1609 while (isspace(*s)) s++; /* remove leading white space */
1610 t = h->text + h->slen; /* end-point */
059ec3d9 1611
bce15b62
JH
1612 /* Unless wanted raw, remove trailing whitespace, including the
1613 newline. */
059ec3d9 1614
bce15b62
JH
1615 if (flags & FH_WANT_LIST)
1616 while (t > s && t[-1] == '\n') t--;
1617 else if (!(flags & FH_WANT_RAW))
1618 {
1619 while (t > s && isspace(t[-1])) t--;
059ec3d9 1620
bce15b62
JH
1621 /* Set comma if handling a single header and it's one of those
1622 that contains an address list, except when asked for raw headers. Only
1623 need to do this once. */
059ec3d9 1624
bce15b62
JH
1625 if (name && !comma && Ustrchr("BCFRST", h->type)) comma = TRUE;
1626 }
059ec3d9 1627
bce15b62
JH
1628 /* Trim the header roughly if we're approaching limits */
1629 inc = t - s;
1630 if ((g ? g->ptr : 0) + inc > header_insert_maxlen)
1631 inc = header_insert_maxlen - (g ? g->ptr : 0);
1632
1633 /* For raw just copy the data; for a list, add the data as a colon-sep
1634 list-element; for comma-list add as an unchecked comma,newline sep
1635 list-elemment; for other nonraw add as an unchecked newline-sep list (we
1636 stripped trailing WS above including the newline). We ignore the potential
1637 expansion due to colon-doubling, just leaving the loop if the limit is met
1638 or exceeded. */
1639
1640 if (flags & FH_WANT_LIST)
1641 g = string_append_listele_n(g, ':', s, (unsigned)inc);
1642 else if (flags & FH_WANT_RAW)
1643 {
1644 g = string_catn(g, s, (unsigned)inc);
1645 (void) string_from_gstring(g);
1646 }
1647 else if (inc > 0)
1648 if (comma)
1649 g = string_append2_listele_n(g, US",\n", s, (unsigned)inc);
1650 else
1651 g = string_append2_listele_n(g, US"\n", s, (unsigned)inc);
059ec3d9 1652
bce15b62
JH
1653 if (g && g->ptr >= header_insert_maxlen) break;
1654 }
059ec3d9 1655
bce15b62
JH
1656if (!found) return NULL; /* No header found */
1657if (!g) return US"";
059ec3d9 1658
059ec3d9
PH
1659/* That's all we do for raw header expansion. */
1660
bce15b62
JH
1661*newsize = g->size;
1662if (flags & FH_WANT_RAW)
1663 return g->s;
059ec3d9 1664
bce15b62
JH
1665/* Otherwise do RFC 2047 decoding, translating the charset if requested.
1666The rfc2047_decode2() function can return an error with decoded data if the
1667charset translation fails. If decoding fails, it returns NULL. */
059ec3d9
PH
1668
1669else
1670 {
1671 uschar *decoded, *error;
bce15b62
JH
1672
1673 decoded = rfc2047_decode2(g->s, check_rfc2047_length, charset, '?', NULL,
a0d6ba8a 1674 newsize, &error);
bce15b62 1675 if (error)
059ec3d9
PH
1676 {
1677 DEBUG(D_any) debug_printf("*** error in RFC 2047 decoding: %s\n"
bce15b62 1678 " input was: %s\n", error, g->s);
059ec3d9 1679 }
bce15b62 1680 return decoded ? decoded : g->s;
059ec3d9 1681 }
059ec3d9
PH
1682}
1683
1684
1685
1686
c8599aad 1687/* Append a "local" element to an Authentication-Results: header
40394cc1
JH
1688if this was a non-smtp message.
1689*/
1690
1691static gstring *
1692authres_local(gstring * g, const uschar * sysname)
1693{
8768d548 1694if (!f.authentication_local)
40394cc1
JH
1695 return g;
1696g = string_append(g, 3, US";\n\tlocal=pass (non-smtp, ", sysname, US")");
1697if (authenticated_id) g = string_append(g, 2, " u=", authenticated_id);
1698return g;
1699}
1700
1701
c8599aad 1702/* Append an "iprev" element to an Authentication-Results: header
dfbcb5ac
JH
1703if we have attempted to get the calling host's name.
1704*/
1705
1706static gstring *
1707authres_iprev(gstring * g)
1708{
1709if (sender_host_name)
61e3f250
JH
1710 g = string_append(g, 3, US";\n\tiprev=pass (", sender_host_name, US")");
1711else if (host_lookup_deferred)
1712 g = string_catn(g, US";\n\tiprev=temperror", 19);
1713else if (host_lookup_failed)
1714 g = string_catn(g, US";\n\tiprev=fail", 13);
0a682b6c 1715else
61e3f250
JH
1716 return g;
1717
1718if (sender_host_address)
99efa4cf 1719 g = string_append(g, 2, US" smtp.remote-ip=", sender_host_address);
dfbcb5ac
JH
1720return g;
1721}
1722
1723
1724
059ec3d9 1725/*************************************************
362145b5
JH
1726* Return list of recipients *
1727*************************************************/
1728/* A recipients list is available only during system message filtering,
1729during ACL processing after DATA, and while expanding pipe commands
1730generated from a system filter, but not elsewhere. */
1731
1732static uschar *
1733fn_recipients(void)
1734{
bce15b62 1735uschar * s;
acec9514 1736gstring * g = NULL;
acec9514 1737
8768d548 1738if (!f.enable_dollar_recipients) return NULL;
acec9514 1739
d7978c0f 1740for (int i = 0; i < recipients_count; i++)
362145b5 1741 {
bce15b62
JH
1742 s = recipients_list[i].address;
1743 g = string_append2_listele_n(g, US", ", s, Ustrlen(s));
362145b5 1744 }
bce15b62 1745return g ? g->s : NULL;
362145b5
JH
1746}
1747
1748
1749/*************************************************
059ec3d9
PH
1750* Find value of a variable *
1751*************************************************/
1752
1753/* The table of variables is kept in alphabetic order, so we can search it
1754using a binary chop. The "choplen" variable is nothing to do with the binary
1755chop.
1756
1757Arguments:
1758 name the name of the variable being sought
1759 exists_only TRUE if this is a def: test; passed on to find_header()
1760 skipping TRUE => skip any processing evaluation; this is not the same as
1761 exists_only because def: may test for values that are first
1762 evaluated here
1763 newsize pointer to an int which is initially zero; if the answer is in
1764 a new memory buffer, *newsize is set to its size
1765
1766Returns: NULL if the variable does not exist, or
1767 a pointer to the variable's contents, or
1768 something non-NULL if exists_only is TRUE
1769*/
1770
1771static uschar *
1772find_variable(uschar *name, BOOL exists_only, BOOL skipping, int *newsize)
1773{
9d1c15ef
JH
1774var_entry * vp;
1775uschar *s, *domain;
1776uschar **ss;
1777void * val;
059ec3d9 1778
38a0a95f
PH
1779/* Handle ACL variables, whose names are of the form acl_cxxx or acl_mxxx.
1780Originally, xxx had to be a number in the range 0-9 (later 0-19), but from
1781release 4.64 onwards arbitrary names are permitted, as long as the first 5
641cb756
PH
1782characters are acl_c or acl_m and the sixth is either a digit or an underscore
1783(this gave backwards compatibility at the changeover). There may be built-in
1784variables whose names start acl_ but they should never start in this way. This
1785slightly messy specification is a consequence of the history, needless to say.
47ca6d6c 1786
38a0a95f
PH
1787If an ACL variable does not exist, treat it as empty, unless strict_acl_vars is
1788set, in which case give an error. */
47ca6d6c 1789
641cb756
PH
1790if ((Ustrncmp(name, "acl_c", 5) == 0 || Ustrncmp(name, "acl_m", 5) == 0) &&
1791 !isalpha(name[5]))
38a0a95f 1792 {
fa7b17bd
JH
1793 tree_node * node =
1794 tree_search(name[4] == 'c' ? acl_var_c : acl_var_m, name + 4);
1795 return node ? node->data.ptr : strict_acl_vars ? NULL : US"";
1796 }
1797else if (Ustrncmp(name, "r_", 2) == 0)
1798 {
1799 tree_node * node = tree_search(router_var, name + 2);
63df3f26 1800 return node ? node->data.ptr : strict_acl_vars ? NULL : US"";
47ca6d6c
PH
1801 }
1802
38a0a95f 1803/* Handle $auth<n> variables. */
f78eb7c6
PH
1804
1805if (Ustrncmp(name, "auth", 4) == 0)
1806 {
1807 uschar *endptr;
1808 int n = Ustrtoul(name + 4, &endptr, 10);
1809 if (*endptr == 0 && n != 0 && n <= AUTH_VARS)
f38917cc
JH
1810 return !auth_vars[n-1] ? US"" : auth_vars[n-1];
1811 }
1812else if (Ustrncmp(name, "regex", 5) == 0)
1813 {
1814 uschar *endptr;
1815 int n = Ustrtoul(name + 5, &endptr, 10);
1816 if (*endptr == 0 && n != 0 && n <= REGEX_VARS)
1817 return !regex_vars[n-1] ? US"" : regex_vars[n-1];
f78eb7c6
PH
1818 }
1819
47ca6d6c
PH
1820/* For all other variables, search the table */
1821
9d1c15ef
JH
1822if (!(vp = find_var_ent(name)))
1823 return NULL; /* Unknown variable name */
059ec3d9 1824
9d1c15ef
JH
1825/* Found an existing variable. If in skipping state, the value isn't needed,
1826and we want to avoid processing (such as looking up the host name). */
059ec3d9 1827
9d1c15ef
JH
1828if (skipping)
1829 return US"";
059ec3d9 1830
9d1c15ef
JH
1831val = vp->value;
1832switch (vp->type)
1833 {
1834 case vtype_filter_int:
8768d548 1835 if (!f.filter_running) return NULL;
63df3f26
JH
1836 /* Fall through */
1837 /* VVVVVVVVVVVV */
9d1c15ef 1838 case vtype_int:
63df3f26
JH
1839 sprintf(CS var_buffer, "%d", *(int *)(val)); /* Integer */
1840 return var_buffer;
9d1c15ef
JH
1841
1842 case vtype_ino:
63df3f26
JH
1843 sprintf(CS var_buffer, "%ld", (long int)(*(ino_t *)(val))); /* Inode */
1844 return var_buffer;
9d1c15ef
JH
1845
1846 case vtype_gid:
63df3f26
JH
1847 sprintf(CS var_buffer, "%ld", (long int)(*(gid_t *)(val))); /* gid */
1848 return var_buffer;
9d1c15ef
JH
1849
1850 case vtype_uid:
63df3f26
JH
1851 sprintf(CS var_buffer, "%ld", (long int)(*(uid_t *)(val))); /* uid */
1852 return var_buffer;
9d1c15ef
JH
1853
1854 case vtype_bool:
63df3f26
JH
1855 sprintf(CS var_buffer, "%s", *(BOOL *)(val) ? "yes" : "no"); /* bool */
1856 return var_buffer;
9d1c15ef
JH
1857
1858 case vtype_stringptr: /* Pointer to string */
63df3f26 1859 return (s = *((uschar **)(val))) ? s : US"";
9d1c15ef
JH
1860
1861 case vtype_pid:
63df3f26
JH
1862 sprintf(CS var_buffer, "%d", (int)getpid()); /* pid */
1863 return var_buffer;
9d1c15ef
JH
1864
1865 case vtype_load_avg:
63df3f26
JH
1866 sprintf(CS var_buffer, "%d", OS_GETLOADAVG()); /* load_average */
1867 return var_buffer;
9d1c15ef
JH
1868
1869 case vtype_host_lookup: /* Lookup if not done so */
2d0dc929
JH
1870 if ( !sender_host_name && sender_host_address
1871 && !host_lookup_failed && host_name_lookup() == OK)
63df3f26 1872 host_build_sender_fullhost();
2d0dc929 1873 return sender_host_name ? sender_host_name : US"";
9d1c15ef
JH
1874
1875 case vtype_localpart: /* Get local part from address */
f3ebb786
JH
1876 if (!(s = *((uschar **)(val)))) return US"";
1877 if (!(domain = Ustrrchr(s, '@'))) return s;
63df3f26
JH
1878 if (domain - s > sizeof(var_buffer) - 1)
1879 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "local part longer than " SIZE_T_FMT
1880 " in string expansion", sizeof(var_buffer));
f3ebb786 1881 return string_copyn(s, domain - s);
9d1c15ef
JH
1882
1883 case vtype_domain: /* Get domain from address */
f3ebb786 1884 if (!(s = *((uschar **)(val)))) return US"";
63df3f26 1885 domain = Ustrrchr(s, '@');
f3ebb786 1886 return domain ? domain + 1 : US"";
9d1c15ef
JH
1887
1888 case vtype_msgheaders:
bce15b62 1889 return find_header(NULL, newsize, exists_only ? FH_EXISTS_ONLY : 0, NULL);
9d1c15ef
JH
1890
1891 case vtype_msgheaders_raw:
bce15b62
JH
1892 return find_header(NULL, newsize,
1893 exists_only ? FH_EXISTS_ONLY|FH_WANT_RAW : FH_WANT_RAW, NULL);
9d1c15ef
JH
1894
1895 case vtype_msgbody: /* Pointer to msgbody string */
1896 case vtype_msgbody_end: /* Ditto, the end of the msg */
63df3f26 1897 ss = (uschar **)(val);
d315eda1 1898 if (!*ss && deliver_datafile >= 0) /* Read body when needed */
059ec3d9 1899 {
63df3f26
JH
1900 uschar *body;
1901 off_t start_offset = SPOOL_DATA_START_OFFSET;
1902 int len = message_body_visible;
1903 if (len > message_size) len = message_size;
1904 *ss = body = store_malloc(len+1);
1905 body[0] = 0;
1906 if (vp->type == vtype_msgbody_end)
9d1c15ef 1907 {
63df3f26
JH
1908 struct stat statbuf;
1909 if (fstat(deliver_datafile, &statbuf) == 0)
1910 {
1911 start_offset = statbuf.st_size - len;
1912 if (start_offset < SPOOL_DATA_START_OFFSET)
1913 start_offset = SPOOL_DATA_START_OFFSET;
1914 }
9d1c15ef 1915 }
d4ff61d1
JH
1916 if (lseek(deliver_datafile, start_offset, SEEK_SET) < 0)
1917 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "deliver_datafile lseek: %s",
1918 strerror(errno));
63df3f26
JH
1919 len = read(deliver_datafile, body, len);
1920 if (len > 0)
9d1c15ef 1921 {
63df3f26
JH
1922 body[len] = 0;
1923 if (message_body_newlines) /* Separate loops for efficiency */
1924 while (len > 0)
1925 { if (body[--len] == 0) body[len] = ' '; }
1926 else
1927 while (len > 0)
1928 { if (body[--len] == '\n' || body[len] == 0) body[len] = ' '; }
9d1c15ef 1929 }
059ec3d9 1930 }
d315eda1 1931 return *ss ? *ss : US"";
059ec3d9 1932
9d1c15ef 1933 case vtype_todbsdin: /* BSD inbox time of day */
63df3f26 1934 return tod_stamp(tod_bsdin);
059ec3d9 1935
9d1c15ef 1936 case vtype_tode: /* Unix epoch time of day */
63df3f26 1937 return tod_stamp(tod_epoch);
059ec3d9 1938
9d1c15ef 1939 case vtype_todel: /* Unix epoch/usec time of day */
63df3f26 1940 return tod_stamp(tod_epoch_l);
f5787926 1941
9d1c15ef 1942 case vtype_todf: /* Full time of day */
63df3f26 1943 return tod_stamp(tod_full);
059ec3d9 1944
9d1c15ef 1945 case vtype_todl: /* Log format time of day */
63df3f26 1946 return tod_stamp(tod_log_bare); /* (without timezone) */
059ec3d9 1947
9d1c15ef 1948 case vtype_todzone: /* Time zone offset only */
63df3f26 1949 return tod_stamp(tod_zone);
059ec3d9 1950
9d1c15ef 1951 case vtype_todzulu: /* Zulu time */
63df3f26 1952 return tod_stamp(tod_zulu);
059ec3d9 1953
9d1c15ef 1954 case vtype_todlf: /* Log file datestamp tod */
63df3f26 1955 return tod_stamp(tod_log_datestamp_daily);
059ec3d9 1956
9d1c15ef 1957 case vtype_reply: /* Get reply address */
bce15b62
JH
1958 s = find_header(US"reply-to:", newsize,
1959 exists_only ? FH_EXISTS_ONLY|FH_WANT_RAW : FH_WANT_RAW,
1960 headers_charset);
9cffa436
JH
1961 if (s) while (isspace(*s)) s++;
1962 if (!s || !*s)
63df3f26
JH
1963 {
1964 *newsize = 0; /* For the *s==0 case */
bce15b62
JH
1965 s = find_header(US"from:", newsize,
1966 exists_only ? FH_EXISTS_ONLY|FH_WANT_RAW : FH_WANT_RAW,
1967 headers_charset);
63df3f26 1968 }
9cffa436 1969 if (s)
63df3f26
JH
1970 {
1971 uschar *t;
1972 while (isspace(*s)) s++;
1973 for (t = s; *t != 0; t++) if (*t == '\n') *t = ' ';
1974 while (t > s && isspace(t[-1])) t--;
1975 *t = 0;
1976 }
9cffa436 1977 return s ? s : US"";
059ec3d9 1978
9d1c15ef
JH
1979 case vtype_string_func:
1980 {
6d95688d 1981 stringptr_fn_t * fn = (stringptr_fn_t *) val;
9d1c15ef
JH
1982 return fn();
1983 }
8e669ac1 1984
9d1c15ef
JH
1985 case vtype_pspace:
1986 {
1987 int inodes;
8c513105 1988 sprintf(CS var_buffer, PR_EXIM_ARITH,
9d1c15ef
JH
1989 receive_statvfs(val == (void *)TRUE, &inodes));
1990 }
1991 return var_buffer;
8e669ac1 1992
9d1c15ef
JH
1993 case vtype_pinodes:
1994 {
1995 int inodes;
1996 (void) receive_statvfs(val == (void *)TRUE, &inodes);
1997 sprintf(CS var_buffer, "%d", inodes);
1998 }
1999 return var_buffer;
80a47a2c 2000
9d1c15ef 2001 case vtype_cert:
63df3f26 2002 return *(void **)val ? US"<cert>" : US"";
80a47a2c 2003
63df3f26 2004#ifndef DISABLE_DKIM
9d1c15ef 2005 case vtype_dkim:
63df3f26
JH
2006 return dkim_exim_expand_query((int)(long)val);
2007#endif
059ec3d9 2008
9d1c15ef 2009 }
6c08476d
LM
2010
2011return NULL; /* Unknown variable. Silences static checkers. */
059ec3d9
PH
2012}
2013
2014
2015
2016
d9b2312b
JH
2017void
2018modify_variable(uschar *name, void * value)
2019{
9d1c15ef
JH
2020var_entry * vp;
2021if ((vp = find_var_ent(name))) vp->value = value;
d9b2312b
JH
2022return; /* Unknown variable name, fail silently */
2023}
2024
2025
2026
2027
2028
cf0812d5 2029
059ec3d9
PH
2030/*************************************************
2031* Read and expand substrings *
2032*************************************************/
2033
2034/* This function is called to read and expand argument substrings for various
2035expansion items. Some have a minimum requirement that is less than the maximum;
2036in these cases, the first non-present one is set to NULL.
2037
2038Arguments:
2039 sub points to vector of pointers to set
2040 n maximum number of substrings
2041 m minimum required
2042 sptr points to current string pointer
2043 skipping the skipping flag
2044 check_end if TRUE, check for final '}'
2045 name name of item, for error message
b0e85a8f
JH
2046 resetok if not NULL, pointer to flag - write FALSE if unsafe to reset
2047 the store.
059ec3d9
PH
2048
2049Returns: 0 OK; string pointer updated
2050 1 curly bracketing error (too few arguments)
2051 2 too many arguments (only if check_end is set); message set
2052 3 other error (expansion failure)
2053*/
2054
2055static int
55414b25 2056read_subs(uschar **sub, int n, int m, const uschar **sptr, BOOL skipping,
b0e85a8f 2057 BOOL check_end, uschar *name, BOOL *resetok)
059ec3d9 2058{
55414b25 2059const uschar *s = *sptr;
059ec3d9
PH
2060
2061while (isspace(*s)) s++;
d7978c0f 2062for (int i = 0; i < n; i++)
059ec3d9
PH
2063 {
2064 if (*s != '{')
2065 {
e47376be
JH
2066 if (i < m)
2067 {
2068 expand_string_message = string_sprintf("Not enough arguments for '%s' "
2069 "(min is %d)", name, m);
2070 return 1;
2071 }
059ec3d9
PH
2072 sub[i] = NULL;
2073 break;
2074 }
e47376be
JH
2075 if (!(sub[i] = expand_string_internal(s+1, TRUE, &s, skipping, TRUE, resetok)))
2076 return 3;
059ec3d9
PH
2077 if (*s++ != '}') return 1;
2078 while (isspace(*s)) s++;
2079 }
2080if (check_end && *s++ != '}')
2081 {
2082 if (s[-1] == '{')
2083 {
e47376be 2084 expand_string_message = string_sprintf("Too many arguments for '%s' "
059ec3d9
PH
2085 "(max is %d)", name, n);
2086 return 2;
2087 }
e47376be 2088 expand_string_message = string_sprintf("missing '}' after '%s'", name);
059ec3d9
PH
2089 return 1;
2090 }
2091
2092*sptr = s;
2093return 0;
2094}
2095
2096
2097
2098
2099/*************************************************
641cb756
PH
2100* Elaborate message for bad variable *
2101*************************************************/
2102
2103/* For the "unknown variable" message, take a look at the variable's name, and
2104give additional information about possible ACL variables. The extra information
2105is added on to expand_string_message.
2106
2107Argument: the name of the variable
2108Returns: nothing
2109*/
2110
2111static void
2112check_variable_error_message(uschar *name)
2113{
2114if (Ustrncmp(name, "acl_", 4) == 0)
2115 expand_string_message = string_sprintf("%s (%s)", expand_string_message,
2116 (name[4] == 'c' || name[4] == 'm')?
2117 (isalpha(name[5])?
2118 US"6th character of a user-defined ACL variable must be a digit or underscore" :
2119 US"strict_acl_vars is set" /* Syntax is OK, it has to be this */
2120 ) :
2121 US"user-defined ACL variables must start acl_c or acl_m");
2122}
2123
2124
2125
f60d98e8
JH
2126/*
2127Load args from sub array to globals, and call acl_check().
ef21c07d 2128Sub array will be corrupted on return.
f60d98e8
JH
2129
2130Returns: OK access is granted by an ACCEPT verb
6e3b198d 2131 DISCARD access is (apparently) granted by a DISCARD verb
f60d98e8
JH
2132 FAIL access is denied
2133 FAIL_DROP access is denied; drop the connection
2134 DEFER can't tell at the moment
2135 ERROR disaster
2136*/
2137static int
2138eval_acl(uschar ** sub, int nsub, uschar ** user_msgp)
2139{
2140int i;
ef21c07d
JH
2141int sav_narg = acl_narg;
2142int ret;
93a6fce2 2143uschar * dummy_logmsg;
faa05a93 2144extern int acl_where;
f60d98e8 2145
0539a19d 2146if(--nsub > nelem(acl_arg)) nsub = nelem(acl_arg);
ef21c07d
JH
2147for (i = 0; i < nsub && sub[i+1]; i++)
2148 {
93a6fce2 2149 uschar * tmp = acl_arg[i];
ef21c07d
JH
2150 acl_arg[i] = sub[i+1]; /* place callers args in the globals */
2151 sub[i+1] = tmp; /* stash the old args using our caller's storage */
2152 }
2153acl_narg = i;
bef3ea7f 2154while (i < nsub)
ef21c07d
JH
2155 {
2156 sub[i+1] = acl_arg[i];
2157 acl_arg[i++] = NULL;
2158 }
f60d98e8
JH
2159
2160DEBUG(D_expand)
e1d04f48 2161 debug_printf_indent("expanding: acl: %s arg: %s%s\n",
f60d98e8 2162 sub[0],
60f8e1e8
JH
2163 acl_narg>0 ? acl_arg[0] : US"<none>",
2164 acl_narg>1 ? " +more" : "");
f60d98e8 2165
93a6fce2 2166ret = acl_eval(acl_where, sub[0], user_msgp, &dummy_logmsg);
ef21c07d
JH
2167
2168for (i = 0; i < nsub; i++)
2169 acl_arg[i] = sub[i+1]; /* restore old args */
2170acl_narg = sav_narg;
2171
2172return ret;
f60d98e8
JH
2173}
2174
2175
2176
2177
7f69e814
JH
2178/* Return pointer to dewrapped string, with enclosing specified chars removed.
2179The given string is modified on return. Leading whitespace is skipped while
2180looking for the opening wrap character, then the rest is scanned for the trailing
2181(non-escaped) wrap character. A backslash in the string will act as an escape.
2182
2183A nul is written over the trailing wrap, and a pointer to the char after the
2184leading wrap is returned.
2185
2186Arguments:
2187 s String for de-wrapping
2188 wrap Two-char string, the first being the opener, second the closer wrapping
2189 character
2190Return:
2191 Pointer to de-wrapped string, or NULL on error (with expand_string_message set).
2192*/
2193
2194static uschar *
2195dewrap(uschar * s, const uschar * wrap)
2196{
2197uschar * p = s;
2198unsigned depth = 0;
2199BOOL quotesmode = wrap[0] == wrap[1];
2200
2201while (isspace(*p)) p++;
2202
2203if (*p == *wrap)
2204 {
2205 s = ++p;
2206 wrap++;
2207 while (*p)
2208 {
2209 if (*p == '\\') p++;
2210 else if (!quotesmode && *p == wrap[-1]) depth++;
2211 else if (*p == *wrap)
2212 if (depth == 0)
2213 {
2214 *p = '\0';
2215 return s;
2216 }
2217 else
2218 depth--;
2219 p++;
2220 }
2221 }
2222expand_string_message = string_sprintf("missing '%c'", *wrap);
2223return NULL;
2224}
2225
2226
2227/* Pull off the leading array or object element, returning
2228a copy in an allocated string. Update the list pointer.
2229
2230The element may itself be an abject or array.
2231Return NULL when the list is empty.
2232*/
2233
2234static uschar *
2235json_nextinlist(const uschar ** list)
2236{
2237unsigned array_depth = 0, object_depth = 0;
2238const uschar * s = *list, * item;
2239
2240while (isspace(*s)) s++;
2241
2242for (item = s;
2243 *s && (*s != ',' || array_depth != 0 || object_depth != 0);
2244 s++)
2245 switch (*s)
2246 {
2247 case '[': array_depth++; break;
2248 case ']': array_depth--; break;
2249 case '{': object_depth++; break;
2250 case '}': object_depth--; break;
2251 }
2252*list = *s ? s+1 : s;
2253if (item == s) return NULL;
2254item = string_copyn(item, s - item);
2255DEBUG(D_expand) debug_printf_indent(" json ele: '%s'\n", item);
2256return US item;
2257}
2258
2259
2260
21aa0597
JH
2261/************************************************/
2262/* Return offset in ops table, or -1 if not found.
2263Repoint to just after the operator in the string.
2264
2265Argument:
2266 ss string representation of operator
2267 opname split-out operator name
2268*/
2269
2270static int
2271identify_operator(const uschar ** ss, uschar ** opname)
2272{
2273const uschar * s = *ss;
2274uschar name[256];
2275
2276/* Numeric comparisons are symbolic */
2277
2278if (*s == '=' || *s == '>' || *s == '<')
2279 {
2280 int p = 0;
2281 name[p++] = *s++;
2282 if (*s == '=')
2283 {
2284 name[p++] = '=';
2285 s++;
2286 }
2287 name[p] = 0;
2288 }
2289
2290/* All other conditions are named */
2291
2292else
2293 s = read_name(name, sizeof(name), s, US"_");
2294*ss = s;
2295
2296/* If we haven't read a name, it means some non-alpha character is first. */
2297
2298if (!name[0])
2299 {
2300 expand_string_message = string_sprintf("condition name expected, "
2301 "but found \"%.16s\"", s);
2302 return -1;
2303 }
2304if (opname)
2305 *opname = string_copy(name);
2306
2307return chop_match(name, cond_table, nelem(cond_table));
2308}
2309
2310
641cb756 2311/*************************************************
7ef88aa0
JH
2312* Handle MD5 or SHA-1 computation for HMAC *
2313*************************************************/
2314
2315/* These are some wrapping functions that enable the HMAC code to be a bit
2316cleaner. A good compiler will spot the tail recursion.
2317
2318Arguments:
2319 type HMAC_MD5 or HMAC_SHA1
2320 remaining are as for the cryptographic hash functions
2321
2322Returns: nothing
2323*/
2324
2325static void
2326chash_start(int type, void * base)
2327{
2328if (type == HMAC_MD5)
2329 md5_start((md5 *)base);
2330else
2331 sha1_start((hctx *)base);
2332}
2333
2334static void
2335chash_mid(int type, void * base, const uschar * string)
2336{
2337if (type == HMAC_MD5)
2338 md5_mid((md5 *)base, string);
2339else
2340 sha1_mid((hctx *)base, string);
2341}
2342
2343static void
2344chash_end(int type, void * base, const uschar * string, int length,
2345 uschar * digest)
2346{
2347if (type == HMAC_MD5)
2348 md5_end((md5 *)base, string, length, digest);
2349else
2350 sha1_end((hctx *)base, string, length, digest);
2351}
2352
2353
2354
2355
2356/* Do an hmac_md5. The result is _not_ nul-terminated, and is sized as
2357the smaller of a full hmac_md5 result (16 bytes) or the supplied output buffer.
2358
2359Arguments:
2360 key encoding key, nul-terminated
2361 src data to be hashed, nul-terminated
2362 buf output buffer
2363 len size of output buffer
2364*/
2365
2366static void
2367hmac_md5(const uschar * key, const uschar * src, uschar * buf, unsigned len)
2368{
2369md5 md5_base;
2370const uschar * keyptr;
2371uschar * p;
2372unsigned int keylen;
2373
2374#define MD5_HASHLEN 16
2375#define MD5_HASHBLOCKLEN 64
2376
2377uschar keyhash[MD5_HASHLEN];
2378uschar innerhash[MD5_HASHLEN];
2379uschar finalhash[MD5_HASHLEN];
2380uschar innerkey[MD5_HASHBLOCKLEN];
2381uschar outerkey[MD5_HASHBLOCKLEN];
2382
2383keyptr = key;
2384keylen = Ustrlen(keyptr);
2385
2386/* If the key is longer than the hash block length, then hash the key
2387first */
2388
2389if (keylen > MD5_HASHBLOCKLEN)
2390 {
2391 chash_start(HMAC_MD5, &md5_base);
2392 chash_end(HMAC_MD5, &md5_base, keyptr, keylen, keyhash);
2393 keyptr = keyhash;
2394 keylen = MD5_HASHLEN;
2395 }
2396
2397/* Now make the inner and outer key values */
2398
2399memset(innerkey, 0x36, MD5_HASHBLOCKLEN);
2400memset(outerkey, 0x5c, MD5_HASHBLOCKLEN);
2401
2402for (int i = 0; i < keylen; i++)
2403 {
2404 innerkey[i] ^= keyptr[i];
2405 outerkey[i] ^= keyptr[i];
2406 }
2407
2408/* Now do the hashes */
2409
2410chash_start(HMAC_MD5, &md5_base);
2411chash_mid(HMAC_MD5, &md5_base, innerkey);
2412chash_end(HMAC_MD5, &md5_base, src, Ustrlen(src), innerhash);
2413
2414chash_start(HMAC_MD5, &md5_base);
2415chash_mid(HMAC_MD5, &md5_base, outerkey);
2416chash_end(HMAC_MD5, &md5_base, innerhash, MD5_HASHLEN, finalhash);
2417
2418/* Encode the final hash as a hex string, limited by output buffer size */
2419
2420p = buf;
2421for (int i = 0, j = len; i < MD5_HASHLEN; i++)
2422 {
2423 if (j-- <= 0) break;
2424 *p++ = hex_digits[(finalhash[i] & 0xf0) >> 4];
2425 if (j-- <= 0) break;
2426 *p++ = hex_digits[finalhash[i] & 0x0f];
2427 }
2428return;
2429}
2430
2431
2432/*************************************************
059ec3d9
PH
2433* Read and evaluate a condition *
2434*************************************************/
2435
2436/*
2437Arguments:
2438 s points to the start of the condition text
b0e85a8f
JH
2439 resetok points to a BOOL which is written false if it is unsafe to
2440 free memory. Certain condition types (acl) may have side-effect
2441 allocation which must be preserved.
059ec3d9
PH
2442 yield points to a BOOL to hold the result of the condition test;
2443 if NULL, we are just reading through a condition that is
2444 part of an "or" combination to check syntax, or in a state
2445 where the answer isn't required
2446
2447Returns: a pointer to the first character after the condition, or
2448 NULL after an error
2449*/
2450
55414b25
JH
2451static const uschar *
2452eval_condition(const uschar *s, BOOL *resetok, BOOL *yield)
059ec3d9
PH
2453{
2454BOOL testfor = TRUE;
2455BOOL tempcond, combined_cond;
2456BOOL *subcondptr;
5cfd2e57 2457BOOL sub2_honour_dollar = TRUE;
7f69e814 2458BOOL is_forany, is_json, is_jsons;
56dbf856 2459int rc, cond_type, roffset;
97d17305 2460int_eximarith_t num[2];
059ec3d9 2461struct stat statbuf;
21aa0597 2462uschar * opname;
059ec3d9 2463uschar name[256];
55414b25 2464const uschar *sub[10];
059ec3d9
PH
2465
2466const pcre *re;
2467const uschar *rerror;
2468
2469for (;;)
2470 {
2471 while (isspace(*s)) s++;
2472 if (*s == '!') { testfor = !testfor; s++; } else break;
2473 }
2474
21aa0597 2475switch(cond_type = identify_operator(&s, &opname))
059ec3d9 2476 {
9b4768fa
PH
2477 /* def: tests for a non-empty variable, or for the existence of a header. If
2478 yield == NULL we are in a skipping state, and don't care about the answer. */
059ec3d9
PH
2479
2480 case ECOND_DEF:
059ec3d9 2481 {
bce15b62 2482 uschar * t;
059ec3d9 2483
bce15b62
JH
2484 if (*s != ':')
2485 {
2486 expand_string_message = US"\":\" expected after \"def\"";
2487 return NULL;
2488 }
059ec3d9 2489
f3ebb786 2490 s = read_name(name, sizeof(name), s+1, US"_");
059ec3d9 2491
bce15b62
JH
2492 /* Test for a header's existence. If the name contains a closing brace
2493 character, this may be a user error where the terminating colon has been
2494 omitted. Set a flag to adjust a subsequent error message in this case. */
059ec3d9 2495
bce15b62
JH
2496 if ( ( *(t = name) == 'h'
2497 || (*t == 'r' || *t == 'l' || *t == 'b') && *++t == 'h'
2498 )
2499 && (*++t == '_' || Ustrncmp(t, "eader_", 6) == 0)
2500 )
2501 {
f3ebb786 2502 s = read_header_name(name, sizeof(name), s);
bce15b62
JH
2503 /* {-for-text-editors */
2504 if (Ustrchr(name, '}') != NULL) malformed_header = TRUE;
2505 if (yield) *yield =
2506 (find_header(name, NULL, FH_EXISTS_ONLY, NULL) != NULL) == testfor;
2507 }
059ec3d9 2508
bce15b62
JH
2509 /* Test for a variable's having a non-empty value. A non-existent variable
2510 causes an expansion failure. */
2511
2512 else
059ec3d9 2513 {
bce15b62
JH
2514 if (!(t = find_variable(name, TRUE, yield == NULL, NULL)))
2515 {
f3ebb786
JH
2516 expand_string_message = name[0]
2517 ? string_sprintf("unknown variable \"%s\" after \"def:\"", name)
2518 : US"variable name omitted after \"def:\"";
bce15b62
JH
2519 check_variable_error_message(name);
2520 return NULL;
2521 }
2522 if (yield) *yield = (t[0] != 0) == testfor;
059ec3d9 2523 }
059ec3d9 2524
bce15b62
JH
2525 return s;
2526 }
059ec3d9
PH
2527
2528
2529 /* first_delivery tests for first delivery attempt */
2530
2531 case ECOND_FIRST_DELIVERY:
5694b905 2532 if (yield) *yield = f.deliver_firsttime == testfor;
059ec3d9
PH
2533 return s;
2534
2535
2536 /* queue_running tests for any process started by a queue runner */
2537
2538 case ECOND_QUEUE_RUNNING:
5694b905 2539 if (yield) *yield = (queue_run_pid != (pid_t)0) == testfor;
059ec3d9
PH
2540 return s;
2541
2542
2543 /* exists: tests for file existence
2544 isip: tests for any IP address
2545 isip4: tests for an IPv4 address
2546 isip6: tests for an IPv6 address
2547 pam: does PAM authentication
2548 radius: does RADIUS authentication
2549 ldapauth: does LDAP authentication
2550 pwcheck: does Cyrus SASL pwcheck authentication
2551 */
2552
2553 case ECOND_EXISTS:
2554 case ECOND_ISIP:
2555 case ECOND_ISIP4:
2556 case ECOND_ISIP6:
2557 case ECOND_PAM:
2558 case ECOND_RADIUS:
2559 case ECOND_LDAPAUTH:
2560 case ECOND_PWCHECK:
2561
2562 while (isspace(*s)) s++;
b5b871ac 2563 if (*s != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
059ec3d9 2564
b0e85a8f 2565 sub[0] = expand_string_internal(s+1, TRUE, &s, yield == NULL, TRUE, resetok);
5694b905 2566 if (!sub[0]) return NULL;
b5b871ac 2567 /* {-for-text-editors */
059ec3d9
PH
2568 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2569
5694b905 2570 if (!yield) return s; /* No need to run the test if skipping */
059ec3d9
PH
2571
2572 switch(cond_type)
2573 {
2574 case ECOND_EXISTS:
2575 if ((expand_forbid & RDO_EXISTS) != 0)
2576 {
2577 expand_string_message = US"File existence tests are not permitted";
2578 return NULL;
2579 }
2580 *yield = (Ustat(sub[0], &statbuf) == 0) == testfor;
2581 break;
2582
2583 case ECOND_ISIP:
2584 case ECOND_ISIP4:
2585 case ECOND_ISIP6:
2586 rc = string_is_ip_address(sub[0], NULL);
7e66e54d 2587 *yield = ((cond_type == ECOND_ISIP)? (rc != 0) :
059ec3d9
PH
2588 (cond_type == ECOND_ISIP4)? (rc == 4) : (rc == 6)) == testfor;
2589 break;
2590
2591 /* Various authentication tests - all optionally compiled */
2592
2593 case ECOND_PAM:
2594 #ifdef SUPPORT_PAM
2595 rc = auth_call_pam(sub[0], &expand_string_message);
2596 goto END_AUTH;
2597 #else
2598 goto COND_FAILED_NOT_COMPILED;
2599 #endif /* SUPPORT_PAM */
2600
2601 case ECOND_RADIUS:
2602 #ifdef RADIUS_CONFIG_FILE
2603 rc = auth_call_radius(sub[0], &expand_string_message);
2604 goto END_AUTH;
2605 #else
2606 goto COND_FAILED_NOT_COMPILED;
2607 #endif /* RADIUS_CONFIG_FILE */
2608
2609 case ECOND_LDAPAUTH:
2610 #ifdef LOOKUP_LDAP
2611 {
2612 /* Just to keep the interface the same */
2613 BOOL do_cache;
2614 int old_pool = store_pool;
2615 store_pool = POOL_SEARCH;
2616 rc = eldapauth_find((void *)(-1), NULL, sub[0], Ustrlen(sub[0]), NULL,
2617 &expand_string_message, &do_cache);
2618 store_pool = old_pool;
2619 }
2620 goto END_AUTH;
2621 #else
2622 goto COND_FAILED_NOT_COMPILED;
2623 #endif /* LOOKUP_LDAP */
2624
2625 case ECOND_PWCHECK:
2626 #ifdef CYRUS_PWCHECK_SOCKET
2627 rc = auth_call_pwcheck(sub[0], &expand_string_message);
2628 goto END_AUTH;
2629 #else
2630 goto COND_FAILED_NOT_COMPILED;
2631 #endif /* CYRUS_PWCHECK_SOCKET */
2632
2633 #if defined(SUPPORT_PAM) || defined(RADIUS_CONFIG_FILE) || \
2634 defined(LOOKUP_LDAP) || defined(CYRUS_PWCHECK_SOCKET)
2635 END_AUTH:
2636 if (rc == ERROR || rc == DEFER) return NULL;
2637 *yield = (rc == OK) == testfor;
2638 #endif
2639 }
2640 return s;
2641
2642
333eea9c
JH
2643 /* call ACL (in a conditional context). Accept true, deny false.
2644 Defer is a forced-fail. Anything set by message= goes to $value.
f60d98e8
JH
2645 Up to ten parameters are used; we use the braces round the name+args
2646 like the saslauthd condition does, to permit a variable number of args.
2647 See also the expansion-item version EITEM_ACL and the traditional
2648 acl modifier ACLC_ACL.
fd5dad68
JH
2649 Since the ACL may allocate new global variables, tell our caller to not
2650 reclaim memory.
f60d98e8 2651 */
333eea9c
JH
2652
2653 case ECOND_ACL:
bef3ea7f 2654 /* ${if acl {{name}{arg1}{arg2}...} {yes}{no}} */
333eea9c 2655 {
55414b25 2656 uschar *sub[10];
333eea9c 2657 uschar *user_msg;
333eea9c 2658 BOOL cond = FALSE;
333eea9c
JH
2659
2660 while (isspace(*s)) s++;
6d9cfc47 2661 if (*s++ != '{') goto COND_FAILED_CURLY_START; /*}*/
333eea9c 2662
0539a19d 2663 switch(read_subs(sub, nelem(sub), 1,
b0e85a8f 2664 &s, yield == NULL, TRUE, US"acl", resetok))
333eea9c 2665 {
f60d98e8
JH
2666 case 1: expand_string_message = US"too few arguments or bracketing "
2667 "error for acl";
2668 case 2:
2669 case 3: return NULL;
333eea9c 2670 }
f60d98e8 2671
5694b905 2672 if (yield)
9e70917d 2673 {
17ccbda6 2674 int rc;
9e70917d 2675 *resetok = FALSE; /* eval_acl() might allocate; do not reclaim */
17ccbda6 2676 switch(rc = eval_acl(sub, nelem(sub), &user_msg))
f60d98e8
JH
2677 {
2678 case OK:
2679 cond = TRUE;
2680 case FAIL:
bef3ea7f 2681 lookup_value = NULL;
f60d98e8 2682 if (user_msg)
acec9514 2683 lookup_value = string_copy(user_msg);
b5b871ac 2684 *yield = cond == testfor;
f60d98e8
JH
2685 break;
2686
2687 case DEFER:
8768d548 2688 f.expand_string_forcedfail = TRUE;
6e3b198d 2689 /*FALLTHROUGH*/
f60d98e8 2690 default:
17ccbda6
JH
2691 expand_string_message = string_sprintf("%s from acl \"%s\"",
2692 rc_names[rc], sub[0]);
f60d98e8
JH
2693 return NULL;
2694 }
9e70917d 2695 }
f60d98e8 2696 return s;
333eea9c 2697 }
333eea9c
JH
2698
2699
059ec3d9
PH
2700 /* saslauthd: does Cyrus saslauthd authentication. Four parameters are used:
2701
b0e85a8f 2702 ${if saslauthd {{username}{password}{service}{realm}} {yes}{no}}
059ec3d9
PH
2703
2704 However, the last two are optional. That is why the whole set is enclosed
333eea9c 2705 in their own set of braces. */
059ec3d9
PH
2706
2707 case ECOND_SASLAUTHD:
0539a19d
JH
2708#ifndef CYRUS_SASLAUTHD_SOCKET
2709 goto COND_FAILED_NOT_COMPILED;
2710#else
059ec3d9 2711 {
0539a19d
JH
2712 uschar *sub[4];
2713 while (isspace(*s)) s++;
2714 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2715 switch(read_subs(sub, nelem(sub), 2, &s, yield == NULL, TRUE, US"saslauthd",
2716 resetok))
2717 {
2718 case 1: expand_string_message = US"too few arguments or bracketing "
2719 "error for saslauthd";
2720 case 2:
2721 case 3: return NULL;
2722 }
5694b905
JH
2723 if (!sub[2]) sub[3] = NULL; /* realm if no service */
2724 if (yield)
0539a19d
JH
2725 {
2726 int rc = auth_call_saslauthd(sub[0], sub[1], sub[2], sub[3],
2727 &expand_string_message);
2728 if (rc == ERROR || rc == DEFER) return NULL;
2729 *yield = (rc == OK) == testfor;
2730 }
2731 return s;
059ec3d9 2732 }
0539a19d 2733#endif /* CYRUS_SASLAUTHD_SOCKET */
059ec3d9
PH
2734
2735
2736 /* symbolic operators for numeric and string comparison, and a number of
2737 other operators, all requiring two arguments.
2738
76dca828
PP
2739 crypteq: encrypts plaintext and compares against an encrypted text,
2740 using crypt(), crypt16(), MD5 or SHA-1
2741 inlist/inlisti: checks if first argument is in the list of the second
059ec3d9
PH
2742 match: does a regular expression match and sets up the numerical
2743 variables if it succeeds
2744 match_address: matches in an address list
2745 match_domain: matches in a domain list
32d668a5 2746 match_ip: matches a host list that is restricted to IP addresses
059ec3d9 2747 match_local_part: matches in a local part list
059ec3d9
PH
2748 */
2749
059ec3d9
PH
2750 case ECOND_MATCH_ADDRESS:
2751 case ECOND_MATCH_DOMAIN:
32d668a5 2752 case ECOND_MATCH_IP:
059ec3d9 2753 case ECOND_MATCH_LOCAL_PART:
da6dbe26
PP
2754#ifndef EXPAND_LISTMATCH_RHS
2755 sub2_honour_dollar = FALSE;
2756#endif
2757 /* FALLTHROUGH */
2758
2759 case ECOND_CRYPTEQ:
2760 case ECOND_INLIST:
2761 case ECOND_INLISTI:
2762 case ECOND_MATCH:
059ec3d9
PH
2763
2764 case ECOND_NUM_L: /* Numerical comparisons */
2765 case ECOND_NUM_LE:
2766 case ECOND_NUM_E:
2767 case ECOND_NUM_EE:
2768 case ECOND_NUM_G:
2769 case ECOND_NUM_GE:
2770
2771 case ECOND_STR_LT: /* String comparisons */
2772 case ECOND_STR_LTI:
2773 case ECOND_STR_LE:
2774 case ECOND_STR_LEI:
2775 case ECOND_STR_EQ:
2776 case ECOND_STR_EQI:
2777 case ECOND_STR_GT:
2778 case ECOND_STR_GTI:
2779 case ECOND_STR_GE:
2780 case ECOND_STR_GEI:
2781
d7978c0f 2782 for (int i = 0; i < 2; i++)
059ec3d9 2783 {
da6dbe26
PP
2784 /* Sometimes, we don't expand substrings; too many insecure configurations
2785 created using match_address{}{} and friends, where the second param
2786 includes information from untrustworthy sources. */
2787 BOOL honour_dollar = TRUE;
2788 if ((i > 0) && !sub2_honour_dollar)
2789 honour_dollar = FALSE;
2790
059ec3d9
PH
2791 while (isspace(*s)) s++;
2792 if (*s != '{')
2793 {
2794 if (i == 0) goto COND_FAILED_CURLY_START;
2795 expand_string_message = string_sprintf("missing 2nd string in {} "
21aa0597 2796 "after \"%s\"", opname);
059ec3d9
PH
2797 return NULL;
2798 }
d584cdca
JH
2799 if (!(sub[i] = expand_string_internal(s+1, TRUE, &s, yield == NULL,
2800 honour_dollar, resetok)))
2801 return NULL;
2802 DEBUG(D_expand) if (i == 1 && !sub2_honour_dollar && Ustrchr(sub[1], '$'))
2803 debug_printf_indent("WARNING: the second arg is NOT expanded,"
2804 " for security reasons\n");
059ec3d9
PH
2805 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2806
2807 /* Convert to numerical if required; we know that the names of all the
2808 conditions that compare numbers do not start with a letter. This just saves
2809 checking for them individually. */
2810
5694b905 2811 if (!isalpha(opname[0]) && yield)
5dd1517f
PH
2812 if (sub[i][0] == 0)
2813 {
2814 num[i] = 0;
2815 DEBUG(D_expand)
e1d04f48 2816 debug_printf_indent("empty string cast to zero for numerical comparison\n");
5dd1517f
PH
2817 }
2818 else
2819 {
7685ce68 2820 num[i] = expanded_string_integer(sub[i], FALSE);
5694b905 2821 if (expand_string_message) return NULL;
5dd1517f 2822 }
059ec3d9
PH
2823 }
2824
2825 /* Result not required */
2826
5694b905 2827 if (!yield) return s;
059ec3d9
PH
2828
2829 /* Do an appropriate comparison */
2830
2831 switch(cond_type)
2832 {
2833 case ECOND_NUM_E:
2834 case ECOND_NUM_EE:
b5b871ac 2835 tempcond = (num[0] == num[1]);
059ec3d9
PH
2836 break;
2837
2838 case ECOND_NUM_G:
b5b871ac 2839 tempcond = (num[0] > num[1]);
059ec3d9
PH
2840 break;
2841
2842 case ECOND_NUM_GE:
b5b871ac 2843 tempcond = (num[0] >= num[1]);
059ec3d9
PH
2844 break;
2845
2846 case ECOND_NUM_L:
b5b871ac 2847 tempcond = (num[0] < num[1]);
059ec3d9
PH
2848 break;
2849
2850 case ECOND_NUM_LE:
b5b871ac 2851 tempcond = (num[0] <= num[1]);
059ec3d9
PH
2852 break;
2853
2854 case ECOND_STR_LT:
b5b871ac 2855 tempcond = (Ustrcmp(sub[0], sub[1]) < 0);
059ec3d9
PH
2856 break;
2857
2858 case ECOND_STR_LTI:
b5b871ac 2859 tempcond = (strcmpic(sub[0], sub[1]) < 0);
059ec3d9
PH
2860 break;
2861
2862 case ECOND_STR_LE:
b5b871ac 2863 tempcond = (Ustrcmp(sub[0], sub[1]) <= 0);
059ec3d9
PH
2864 break;
2865
2866 case ECOND_STR_LEI:
b5b871ac 2867 tempcond = (strcmpic(sub[0], sub[1]) <= 0);
059ec3d9
PH
2868 break;
2869
2870 case ECOND_STR_EQ:
b5b871ac 2871 tempcond = (Ustrcmp(sub[0], sub[1]) == 0);
059ec3d9
PH
2872 break;
2873
2874 case ECOND_STR_EQI:
b5b871ac 2875 tempcond = (strcmpic(sub[0], sub[1]) == 0);
059ec3d9
PH
2876 break;
2877
2878 case ECOND_STR_GT:
b5b871ac 2879 tempcond = (Ustrcmp(sub[0], sub[1]) > 0);
059ec3d9
PH
2880 break;
2881
2882 case ECOND_STR_GTI:
b5b871ac 2883 tempcond = (strcmpic(sub[0], sub[1]) > 0);
059ec3d9
PH
2884 break;
2885
2886 case ECOND_STR_GE:
b5b871ac 2887 tempcond = (Ustrcmp(sub[0], sub[1]) >= 0);
059ec3d9
PH
2888 break;
2889
2890 case ECOND_STR_GEI:
b5b871ac 2891 tempcond = (strcmpic(sub[0], sub[1]) >= 0);
059ec3d9
PH
2892 break;
2893
2894 case ECOND_MATCH: /* Regular expression match */
5694b905
JH
2895 if (!(re = pcre_compile(CS sub[1], PCRE_COPT, (const char **)&rerror,
2896 &roffset, NULL)))
059ec3d9
PH
2897 {
2898 expand_string_message = string_sprintf("regular expression error in "
2899 "\"%s\": %s at offset %d", sub[1], rerror, roffset);
2900 return NULL;
2901 }
b5b871ac 2902 tempcond = regex_match_and_setup(re, sub[0], 0, -1);
059ec3d9
PH
2903 break;
2904
2905 case ECOND_MATCH_ADDRESS: /* Match in an address list */
2906 rc = match_address_list(sub[0], TRUE, FALSE, &(sub[1]), NULL, -1, 0, NULL);
2907 goto MATCHED_SOMETHING;
2908
2909 case ECOND_MATCH_DOMAIN: /* Match in a domain list */
2910 rc = match_isinlist(sub[0], &(sub[1]), 0, &domainlist_anchor, NULL,
2911 MCL_DOMAIN + MCL_NOEXPAND, TRUE, NULL);
2912 goto MATCHED_SOMETHING;
2913
32d668a5 2914 case ECOND_MATCH_IP: /* Match IP address in a host list */
7e66e54d 2915 if (sub[0][0] != 0 && string_is_ip_address(sub[0], NULL) == 0)
32d668a5
PH
2916 {
2917 expand_string_message = string_sprintf("\"%s\" is not an IP address",
2918 sub[0]);
2919 return NULL;
2920 }
2921 else
2922 {
2923 unsigned int *nullcache = NULL;
2924 check_host_block cb;
2925
2926 cb.host_name = US"";
2927 cb.host_address = sub[0];
2928
2929 /* If the host address starts off ::ffff: it is an IPv6 address in
2930 IPv4-compatible mode. Find the IPv4 part for checking against IPv4
2931 addresses. */
2932
2933 cb.host_ipv4 = (Ustrncmp(cb.host_address, "::ffff:", 7) == 0)?
2934 cb.host_address + 7 : cb.host_address;
2935
2936 rc = match_check_list(
2937 &sub[1], /* the list */
2938 0, /* separator character */
2939 &hostlist_anchor, /* anchor pointer */
2940 &nullcache, /* cache pointer */
2941 check_host, /* function for testing */
2942 &cb, /* argument for function */
2943 MCL_HOST, /* type of check */
2944 sub[0], /* text for debugging */
2945 NULL); /* where to pass back data */
2946 }
2947 goto MATCHED_SOMETHING;
2948
059ec3d9
PH
2949 case ECOND_MATCH_LOCAL_PART:
2950 rc = match_isinlist(sub[0], &(sub[1]), 0, &localpartlist_anchor, NULL,
2951 MCL_LOCALPART + MCL_NOEXPAND, TRUE, NULL);
2952 /* Fall through */
9a26b6b2 2953 /* VVVVVVVVVVVV */
059ec3d9
PH
2954 MATCHED_SOMETHING:
2955 switch(rc)
2956 {
2957 case OK:
b5b871ac 2958 tempcond = TRUE;
059ec3d9
PH
2959 break;
2960
2961 case FAIL:
b5b871ac 2962 tempcond = FALSE;
059ec3d9
PH
2963 break;
2964
2965 case DEFER:
2966 expand_string_message = string_sprintf("unable to complete match "
2967 "against \"%s\": %s", sub[1], search_error_message);
2968 return NULL;
2969 }
2970
2971 break;
2972
2973 /* Various "encrypted" comparisons. If the second string starts with
2974 "{" then an encryption type is given. Default to crypt() or crypt16()
2975 (build-time choice). */
b5b871ac 2976 /* }-for-text-editors */
059ec3d9
PH
2977
2978 case ECOND_CRYPTEQ:
2979 #ifndef SUPPORT_CRYPTEQ
2980 goto COND_FAILED_NOT_COMPILED;
2981 #else
2982 if (strncmpic(sub[1], US"{md5}", 5) == 0)
2983 {
2984 int sublen = Ustrlen(sub[1]+5);
2985 md5 base;
2986 uschar digest[16];
2987
2988 md5_start(&base);
cfab9d68 2989 md5_end(&base, sub[0], Ustrlen(sub[0]), digest);
059ec3d9
PH
2990
2991 /* If the length that we are comparing against is 24, the MD5 digest
2992 is expressed as a base64 string. This is the way LDAP does it. However,
2993 some other software uses a straightforward hex representation. We assume
2994 this if the length is 32. Other lengths fail. */
2995
2996 if (sublen == 24)
2997 {
1f20760b 2998 uschar *coded = b64encode(CUS digest, 16);
059ec3d9
PH
2999 DEBUG(D_auth) debug_printf("crypteq: using MD5+B64 hashing\n"
3000 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
b5b871ac 3001 tempcond = (Ustrcmp(coded, sub[1]+5) == 0);
059ec3d9
PH
3002 }
3003 else if (sublen == 32)
3004 {
059ec3d9 3005 uschar coded[36];
d7978c0f 3006 for (int i = 0; i < 16; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
059ec3d9
PH
3007 coded[32] = 0;
3008 DEBUG(D_auth) debug_printf("crypteq: using MD5+hex hashing\n"
3009 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
b5b871ac 3010 tempcond = (strcmpic(coded, sub[1]+5) == 0);
059ec3d9
PH
3011 }
3012 else
3013 {
3014 DEBUG(D_auth) debug_printf("crypteq: length for MD5 not 24 or 32: "
3015 "fail\n crypted=%s\n", sub[1]+5);
b5b871ac 3016 tempcond = FALSE;
059ec3d9
PH
3017 }
3018 }
3019
3020 else if (strncmpic(sub[1], US"{sha1}", 6) == 0)
3021 {
3022 int sublen = Ustrlen(sub[1]+6);
5fb822fc 3023 hctx h;
059ec3d9
PH
3024 uschar digest[20];
3025
5fb822fc 3026 sha1_start(&h);
cfab9d68 3027 sha1_end(&h, sub[0], Ustrlen(sub[0]), digest);
059ec3d9
PH
3028
3029 /* If the length that we are comparing against is 28, assume the SHA1
3030 digest is expressed as a base64 string. If the length is 40, assume a
3031 straightforward hex representation. Other lengths fail. */
3032
3033 if (sublen == 28)
3034 {
1f20760b 3035 uschar *coded = b64encode(CUS digest, 20);
059ec3d9
PH
3036 DEBUG(D_auth) debug_printf("crypteq: using SHA1+B64 hashing\n"
3037 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
b5b871ac 3038 tempcond = (Ustrcmp(coded, sub[1]+6) == 0);
059ec3d9
PH
3039 }
3040 else if (sublen == 40)
3041 {
059ec3d9 3042 uschar coded[44];
d7978c0f 3043 for (int i = 0; i < 20; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
059ec3d9
PH
3044 coded[40] = 0;
3045 DEBUG(D_auth) debug_printf("crypteq: using SHA1+hex hashing\n"
3046 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
b5b871ac 3047 tempcond = (strcmpic(coded, sub[1]+6) == 0);
059ec3d9
PH
3048 }
3049 else
3050 {
3051 DEBUG(D_auth) debug_printf("crypteq: length for SHA-1 not 28 or 40: "
3052 "fail\n crypted=%s\n", sub[1]+6);
b5b871ac 3053 tempcond = FALSE;
059ec3d9
PH
3054 }
3055 }
3056
3057 else /* {crypt} or {crypt16} and non-{ at start */
76dca828 3058 /* }-for-text-editors */
059ec3d9
PH
3059 {
3060 int which = 0;
3061 uschar *coded;
3062
3063 if (strncmpic(sub[1], US"{crypt}", 7) == 0)
3064 {
3065 sub[1] += 7;
3066 which = 1;
3067 }
3068 else if (strncmpic(sub[1], US"{crypt16}", 9) == 0)
3069 {
3070 sub[1] += 9;
3071 which = 2;
3072 }
b5b871ac 3073 else if (sub[1][0] == '{') /* }-for-text-editors */
059ec3d9
PH
3074 {
3075 expand_string_message = string_sprintf("unknown encryption mechanism "
3076 "in \"%s\"", sub[1]);
3077 return NULL;
3078 }
3079
3080 switch(which)
3081 {
3082 case 0: coded = US DEFAULT_CRYPT(CS sub[0], CS sub[1]); break;
3083 case 1: coded = US crypt(CS sub[0], CS sub[1]); break;
3084 default: coded = US crypt16(CS sub[0], CS sub[1]); break;
3085 }
3086
3087 #define STR(s) # s
3088 #define XSTR(s) STR(s)
3089 DEBUG(D_auth) debug_printf("crypteq: using %s()\n"
3090 " subject=%s\n crypted=%s\n",
9dc2b215 3091 which == 0 ? XSTR(DEFAULT_CRYPT) : which == 1 ? "crypt" : "crypt16",
059ec3d9
PH
3092 coded, sub[1]);
3093 #undef STR
3094 #undef XSTR
3095
3096 /* If the encrypted string contains fewer than two characters (for the
3097 salt), force failure. Otherwise we get false positives: with an empty
3098 string the yield of crypt() is an empty string! */
3099
9dc2b215
JH
3100 if (coded)
3101 tempcond = Ustrlen(sub[1]) < 2 ? FALSE : Ustrcmp(coded, sub[1]) == 0;
3102 else if (errno == EINVAL)
3103 tempcond = FALSE;
3104 else
3105 {
3106 expand_string_message = string_sprintf("crypt error: %s\n",
3107 US strerror(errno));
3108 return NULL;
3109 }
059ec3d9
PH
3110 }
3111 break;
3112 #endif /* SUPPORT_CRYPTEQ */
76dca828
PP
3113
3114 case ECOND_INLIST:
3115 case ECOND_INLISTI:
3116 {
55414b25 3117 const uschar * list = sub[1];
76dca828 3118 int sep = 0;
76dca828
PP
3119 uschar *save_iterate_item = iterate_item;
3120 int (*compare)(const uschar *, const uschar *);
3121
21aa0597 3122 DEBUG(D_expand) debug_printf_indent("condition: %s item: %s\n", opname, sub[0]);
82dbd376 3123
b5b871ac 3124 tempcond = FALSE;
55414b25
JH
3125 compare = cond_type == ECOND_INLISTI
3126 ? strcmpic : (int (*)(const uschar *, const uschar *)) strcmp;
76dca828 3127
55414b25 3128 while ((iterate_item = string_nextinlist(&list, &sep, NULL, 0)))
05e796ad
JH
3129 {
3130 DEBUG(D_expand) debug_printf_indent(" compare %s\n", iterate_item);
76dca828
PP
3131 if (compare(sub[0], iterate_item) == 0)
3132 {
b5b871ac 3133 tempcond = TRUE;
76dca828
PP
3134 break;
3135 }
05e796ad 3136 }
76dca828 3137 iterate_item = save_iterate_item;
76dca828
PP
3138 }
3139
059ec3d9
PH
3140 } /* Switch for comparison conditions */
3141
b5b871ac 3142 *yield = tempcond == testfor;
059ec3d9
PH
3143 return s; /* End of comparison conditions */
3144
3145
3146 /* and/or: computes logical and/or of several conditions */
3147
3148 case ECOND_AND:
3149 case ECOND_OR:
5694b905 3150 subcondptr = (yield == NULL) ? NULL : &tempcond;
059ec3d9
PH
3151 combined_cond = (cond_type == ECOND_AND);
3152
3153 while (isspace(*s)) s++;
b5b871ac 3154 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
059ec3d9
PH
3155
3156 for (;;)
3157 {
3158 while (isspace(*s)) s++;
b5b871ac 3159 /* {-for-text-editors */
059ec3d9 3160 if (*s == '}') break;
b5b871ac 3161 if (*s != '{') /* }-for-text-editors */
059ec3d9
PH
3162 {
3163 expand_string_message = string_sprintf("each subcondition "
21aa0597 3164 "inside an \"%s{...}\" condition must be in its own {}", opname);
059ec3d9
PH
3165 return NULL;
3166 }
3167
b0e85a8f 3168 if (!(s = eval_condition(s+1, resetok, subcondptr)))
059ec3d9
PH
3169 {
3170 expand_string_message = string_sprintf("%s inside \"%s{...}\" condition",
21aa0597 3171 expand_string_message, opname);
059ec3d9
PH
3172 return NULL;
3173 }
3174 while (isspace(*s)) s++;
3175
b5b871ac 3176 /* {-for-text-editors */
059ec3d9
PH
3177 if (*s++ != '}')
3178 {
b5b871ac 3179 /* {-for-text-editors */
059ec3d9 3180 expand_string_message = string_sprintf("missing } at end of condition "
21aa0597 3181 "inside \"%s\" group", opname);
059ec3d9
PH
3182 return NULL;
3183 }
3184
5694b905 3185 if (yield)
059ec3d9
PH
3186 if (cond_type == ECOND_AND)
3187 {
3188 combined_cond &= tempcond;
3189 if (!combined_cond) subcondptr = NULL; /* once false, don't */
3190 } /* evaluate any more */
3191 else
3192 {
3193 combined_cond |= tempcond;
3194 if (combined_cond) subcondptr = NULL; /* once true, don't */
3195 } /* evaluate any more */
059ec3d9
PH
3196 }
3197
5694b905 3198 if (yield) *yield = (combined_cond == testfor);
059ec3d9
PH
3199 return ++s;
3200
3201
0ce9abe6
PH
3202 /* forall/forany: iterates a condition with different values */
3203
7f69e814
JH
3204 case ECOND_FORALL: is_forany = FALSE; is_json = FALSE; is_jsons = FALSE; goto FORMANY;
3205 case ECOND_FORANY: is_forany = TRUE; is_json = FALSE; is_jsons = FALSE; goto FORMANY;
3206 case ECOND_FORALL_JSON: is_forany = FALSE; is_json = TRUE; is_jsons = FALSE; goto FORMANY;
3207 case ECOND_FORANY_JSON: is_forany = TRUE; is_json = TRUE; is_jsons = FALSE; goto FORMANY;
3208 case ECOND_FORALL_JSONS: is_forany = FALSE; is_json = TRUE; is_jsons = TRUE; goto FORMANY;
3209 case ECOND_FORANY_JSONS: is_forany = TRUE; is_json = TRUE; is_jsons = TRUE; goto FORMANY;
3210
3211 FORMANY:
0ce9abe6 3212 {
55414b25 3213 const uschar * list;
0ce9abe6 3214 int sep = 0;
282b357d 3215 uschar *save_iterate_item = iterate_item;
0ce9abe6 3216
21aa0597 3217 DEBUG(D_expand) debug_printf_indent("condition: %s\n", opname);
82dbd376 3218
0ce9abe6 3219 while (isspace(*s)) s++;
b5b871ac 3220 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
5694b905
JH
3221 if (!(sub[0] = expand_string_internal(s, TRUE, &s, yield == NULL, TRUE, resetok)))
3222 return NULL;
b5b871ac 3223 /* {-for-text-editors */
0ce9abe6
PH
3224 if (*s++ != '}') goto COND_FAILED_CURLY_END;
3225
3226 while (isspace(*s)) s++;
b5b871ac 3227 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
0ce9abe6
PH
3228
3229 sub[1] = s;
3230
3231 /* Call eval_condition once, with result discarded (as if scanning a
3232 "false" part). This allows us to find the end of the condition, because if
3233 the list it empty, we won't actually evaluate the condition for real. */
3234
b0e85a8f 3235 if (!(s = eval_condition(sub[1], resetok, NULL)))
0ce9abe6
PH
3236 {
3237 expand_string_message = string_sprintf("%s inside \"%s\" condition",
21aa0597 3238 expand_string_message, opname);
0ce9abe6
PH
3239 return NULL;
3240 }
3241 while (isspace(*s)) s++;
3242
b5b871ac 3243 /* {-for-text-editors */
0ce9abe6
PH
3244 if (*s++ != '}')
3245 {
b5b871ac 3246 /* {-for-text-editors */
0ce9abe6 3247 expand_string_message = string_sprintf("missing } at end of condition "
21aa0597 3248 "inside \"%s\"", opname);
0ce9abe6
PH
3249 return NULL;
3250 }
3251
7f69e814 3252 if (yield) *yield = !testfor;
55414b25 3253 list = sub[0];
7f69e814
JH
3254 if (is_json) list = dewrap(string_copy(list), US"[]");
3255 while ((iterate_item = is_json
3256 ? json_nextinlist(&list) : string_nextinlist(&list, &sep, NULL, 0)))
0ce9abe6 3257 {
7f69e814
JH
3258 if (is_jsons)
3259 if (!(iterate_item = dewrap(iterate_item, US"\"\"")))
3260 {
3261 expand_string_message =
3262 string_sprintf("%s wrapping string result for extract jsons",
3263 expand_string_message);
3264 iterate_item = save_iterate_item;
3265 return NULL;
3266 }
3267
f3ebb786 3268 DEBUG(D_expand) debug_printf_indent("%s: $item = \"%s\"\n", opname, iterate_item);
b0e85a8f 3269 if (!eval_condition(sub[1], resetok, &tempcond))
0ce9abe6
PH
3270 {
3271 expand_string_message = string_sprintf("%s inside \"%s\" condition",
21aa0597 3272 expand_string_message, opname);
e58c13cc 3273 iterate_item = save_iterate_item;
0ce9abe6
PH
3274 return NULL;
3275 }
21aa0597 3276 DEBUG(D_expand) debug_printf_indent("%s: condition evaluated to %s\n", opname,
0ce9abe6
PH
3277 tempcond? "true":"false");
3278
7f69e814
JH
3279 if (yield) *yield = (tempcond == testfor);
3280 if (tempcond == is_forany) break;
0ce9abe6
PH
3281 }
3282
282b357d 3283 iterate_item = save_iterate_item;
0ce9abe6
PH
3284 return s;
3285 }
3286
3287
f3766eb5
NM
3288 /* The bool{} expansion condition maps a string to boolean.
3289 The values supported should match those supported by the ACL condition
3290 (acl.c, ACLC_CONDITION) so that we keep to a minimum the different ideas
3291 of true/false. Note that Router "condition" rules have a different
3292 interpretation, where general data can be used and only a few values
3293 map to FALSE.
3294 Note that readconf.c boolean matching, for boolean configuration options,
6a8de854
PP
3295 only matches true/yes/false/no.
3296 The bool_lax{} condition matches the Router logic, which is much more
3297 liberal. */
f3766eb5 3298 case ECOND_BOOL:
6a8de854 3299 case ECOND_BOOL_LAX:
f3766eb5
NM
3300 {
3301 uschar *sub_arg[1];
71265ae9 3302 uschar *t, *t2;
6a8de854 3303 uschar *ourname;
f3766eb5
NM
3304 size_t len;
3305 BOOL boolvalue = FALSE;
3306 while (isspace(*s)) s++;
b5b871ac 3307 if (*s != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
6a8de854 3308 ourname = cond_type == ECOND_BOOL_LAX ? US"bool_lax" : US"bool";
b0e85a8f 3309 switch(read_subs(sub_arg, 1, 1, &s, yield == NULL, FALSE, ourname, resetok))
f3766eb5 3310 {
6a8de854
PP
3311 case 1: expand_string_message = string_sprintf(
3312 "too few arguments or bracketing error for %s",
3313 ourname);
f3766eb5
NM
3314 /*FALLTHROUGH*/
3315 case 2:
3316 case 3: return NULL;
3317 }
3318 t = sub_arg[0];
3319 while (isspace(*t)) t++;
3320 len = Ustrlen(t);
71265ae9
PP
3321 if (len)
3322 {
3323 /* trailing whitespace: seems like a good idea to ignore it too */
3324 t2 = t + len - 1;
3325 while (isspace(*t2)) t2--;
3326 if (t2 != (t + len))
3327 {
3328 *++t2 = '\0';
3329 len = t2 - t;
3330 }
3331 }
f3766eb5 3332 DEBUG(D_expand)
e1d04f48 3333 debug_printf_indent("considering %s: %s\n", ourname, len ? t : US"<empty>");
6a8de854
PP
3334 /* logic for the lax case from expand_check_condition(), which also does
3335 expands, and the logic is both short and stable enough that there should
3336 be no maintenance burden from replicating it. */
f3766eb5
NM
3337 if (len == 0)
3338 boolvalue = FALSE;
51c7471d
JH
3339 else if (*t == '-'
3340 ? Ustrspn(t+1, "0123456789") == len-1
3341 : Ustrspn(t, "0123456789") == len)
6a8de854 3342 {
f3766eb5 3343 boolvalue = (Uatoi(t) == 0) ? FALSE : TRUE;
6a8de854
PP
3344 /* expand_check_condition only does a literal string "0" check */
3345 if ((cond_type == ECOND_BOOL_LAX) && (len > 1))
3346 boolvalue = TRUE;
3347 }
f3766eb5
NM
3348 else if (strcmpic(t, US"true") == 0 || strcmpic(t, US"yes") == 0)
3349 boolvalue = TRUE;
3350 else if (strcmpic(t, US"false") == 0 || strcmpic(t, US"no") == 0)
3351 boolvalue = FALSE;
6a8de854
PP
3352 else if (cond_type == ECOND_BOOL_LAX)
3353 boolvalue = TRUE;
f3766eb5
NM
3354 else
3355 {
3356 expand_string_message = string_sprintf("unrecognised boolean "
3357 "value \"%s\"", t);
3358 return NULL;
3359 }
e1d04f48 3360 DEBUG(D_expand) debug_printf_indent("%s: condition evaluated to %s\n", ourname,
c7c833c6 3361 boolvalue? "true":"false");
5694b905 3362 if (yield) *yield = (boolvalue == testfor);
f3766eb5
NM
3363 return s;
3364 }
3365
7ef88aa0
JH
3366#ifdef EXPERIMENTAL_SRS_NATIVE
3367 case ECOND_INBOUND_SRS:
3368 /* ${if inbound_srs {local_part}{secret} {yes}{no}} */
3369 {
3370 uschar * sub[2];
3371 const pcre * re;
3372 int ovec[3*(4+1)];
3373 int n;
3374 uschar cksum[4];
3375 BOOL boolvalue = FALSE;
3376
3377 switch(read_subs(sub, 2, 2, CUSS &s, yield == NULL, FALSE, US"inbound_srs", resetok))
3378 {
3379 case 1: expand_string_message = US"too few arguments or bracketing "
3380 "error for inbound_srs";
3381 case 2:
3382 case 3: return NULL;
3383 }
3384
3385 /* Match the given local_part against the SRS-encoded pattern */
3386
3387 re = regex_must_compile(US"^(?i)SRS0=([^=]+)=([A-Z2-7]+)=([^=]*)=(.*)$",
3388 TRUE, FALSE);
3389 if (pcre_exec(re, NULL, CS sub[0], Ustrlen(sub[0]), 0, PCRE_EOPT,
3390 ovec, nelem(ovec)) < 0)
3391 {
3392 DEBUG(D_expand) debug_printf("no match for SRS'd local-part pattern\n");
3393 goto srs_result;
3394 }
3395
3396 /* Side-effect: record the decoded recipient */
3397
3398 srs_recipient = string_sprintf("%.*S@%.*S", /* lowercased */
3399 ovec[9]-ovec[8], sub[0] + ovec[8], /* substring 4 */
3400 ovec[7]-ovec[6], sub[0] + ovec[6]); /* substring 3 */
3401
3402 /* If a zero-length secret was given, we're done. Otherwise carry on
3403 and validate the given SRS local_part againt our secret. */
3404
3405 if (!*sub[1])
3406 {
3407 boolvalue = TRUE;
3408 goto srs_result;
3409 }
3410
3411 /* check the timestamp */
3412 {
3413 struct timeval now;
3414 uschar * ss = sub[0] + ovec[4]; /* substring 2, the timestamp */
3415 long d;
3416
3417 gettimeofday(&now, NULL);
3418 now.tv_sec /= 86400; /* days since epoch */
3419
3420 /* Decode substring 2 from base32 to a number */
3421
3422 for (d = 0, n = ovec[5]-ovec[4]; n; n--)
3423 {
3424 uschar * t = Ustrchr(base32_chars, *ss++);
3425 d = d * 32 + (t - base32_chars);
3426 }
3427
3428 if (((now.tv_sec - d) & 0x3ff) > 10) /* days since SRS generated */
3429 {
3430 DEBUG(D_expand) debug_printf("SRS too old\n");
3431 goto srs_result;
3432 }
3433 }
3434
3435 /* check length of substring 1, the offered checksum */
3436
3437 if (ovec[3]-ovec[2] != 4)
3438 {
3439 DEBUG(D_expand) debug_printf("SRS checksum wrong size\n");
3440 goto srs_result;
3441 }
3442
3443 /* Hash the address with our secret, and compare that computed checksum
3444 with the one extracted from the arg */
3445
3446 hmac_md5(sub[1], srs_recipient, cksum, sizeof(cksum));
3447 if (Ustrncmp(cksum, sub[0] + ovec[2], 4) != 0)
3448 {
3449 DEBUG(D_expand) debug_printf("SRS checksum mismatch\n");
3450 goto srs_result;
3451 }
3452 boolvalue = TRUE;
3453
3454srs_result:
3455 if (yield) *yield = (boolvalue == testfor);
3456 return s;
3457 }
3458#endif /*EXPERIMENTAL_SRS_NATIVE*/
3459
059ec3d9
PH
3460 /* Unknown condition */
3461
3462 default:
21aa0597
JH
3463 if (!expand_string_message || !*expand_string_message)
3464 expand_string_message = string_sprintf("unknown condition \"%s\"", opname);
3465 return NULL;
059ec3d9
PH
3466 } /* End switch on condition type */
3467
3468/* Missing braces at start and end of data */
3469
3470COND_FAILED_CURLY_START:
21aa0597 3471expand_string_message = string_sprintf("missing { after \"%s\"", opname);
059ec3d9
PH
3472return NULL;
3473
3474COND_FAILED_CURLY_END:
3475expand_string_message = string_sprintf("missing } at end of \"%s\" condition",
21aa0597 3476 opname);
059ec3d9
PH
3477return NULL;
3478
3479/* A condition requires code that is not compiled */
3480
3481#if !defined(SUPPORT_PAM) || !defined(RADIUS_CONFIG_FILE) || \
3482 !defined(LOOKUP_LDAP) || !defined(CYRUS_PWCHECK_SOCKET) || \
3483 !defined(SUPPORT_CRYPTEQ) || !defined(CYRUS_SASLAUTHD_SOCKET)
3484COND_FAILED_NOT_COMPILED:
3485expand_string_message = string_sprintf("support for \"%s\" not compiled",
21aa0597 3486 opname);
059ec3d9
PH
3487return NULL;
3488#endif
3489}
3490
3491
3492
3493
3494/*************************************************
3495* Save numerical variables *
3496*************************************************/
3497
3498/* This function is called from items such as "if" that want to preserve and
3499restore the numbered variables.
3500
3501Arguments:
3502 save_expand_string points to an array of pointers to set
3503 save_expand_nlength points to an array of ints for the lengths
3504
3505Returns: the value of expand max to save
3506*/
3507
3508static int
3509save_expand_strings(uschar **save_expand_nstring, int *save_expand_nlength)
3510{
d7978c0f 3511for (int i = 0; i <= expand_nmax; i++)
059ec3d9
PH
3512 {
3513 save_expand_nstring[i] = expand_nstring[i];
3514 save_expand_nlength[i] = expand_nlength[i];
3515 }
3516return expand_nmax;
3517}
3518
3519
3520<