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