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