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