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