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