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