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