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