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