dfd62e50c7d8963e784d8b5c2f706b71315cbd96
[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 != NULL; h = h->next)
1558 {
1559 if (h->type != htype_old && h->text != NULL) /* NULL => Received: placeholder */
1560 {
1561 if (name == NULL || (len <= h->slen && strncmpic(name, h->text, len) == 0))
1562 {
1563 int ilen;
1564 uschar *t;
1565
1566 if (exists_only) return US"1"; /* don't need actual string */
1567 found = TRUE;
1568 t = h->text + len; /* text to insert */
1569 if (!want_raw) /* unless wanted raw, */
1570 while (isspace(*t)) t++; /* remove leading white space */
1571 ilen = h->slen - (t - h->text); /* length to insert */
1572
1573 /* Unless wanted raw, remove trailing whitespace, including the
1574 newline. */
1575
1576 if (!want_raw)
1577 while (ilen > 0 && isspace(t[ilen-1])) ilen--;
1578
1579 /* Set comma = 1 if handling a single header and it's one of those
1580 that contains an address list, except when asked for raw headers. Only
1581 need to do this once. */
1582
1583 if (!want_raw && name != NULL && comma == 0 &&
1584 Ustrchr("BCFRST", h->type) != NULL)
1585 comma = 1;
1586
1587 /* First pass - compute total store needed; second pass - compute
1588 total store used, including this header. */
1589
1590 size += ilen + comma + 1; /* +1 for the newline */
1591
1592 /* Second pass - concatenate the data, up to a maximum. Note that
1593 the loop stops when size hits the limit. */
1594
1595 if (i != 0)
1596 {
1597 if (size > header_insert_maxlen)
1598 {
1599 ilen -= size - header_insert_maxlen - 1;
1600 comma = 0;
1601 }
1602 Ustrncpy(ptr, t, ilen);
1603 ptr += ilen;
1604
1605 /* For a non-raw header, put in the comma if needed, then add
1606 back the newline we removed above, provided there was some text in
1607 the header. */
1608
1609 if (!want_raw && ilen > 0)
1610 {
1611 if (comma != 0) *ptr++ = ',';
1612 *ptr++ = '\n';
1613 }
1614 }
1615 }
1616 }
1617 }
1618
1619 /* At end of first pass, return NULL if no header found. Then truncate size
1620 if necessary, and get the buffer to hold the data, returning the buffer size.
1621 */
1622
1623 if (i == 0)
1624 {
1625 if (!found) return NULL;
1626 if (size > header_insert_maxlen) size = header_insert_maxlen;
1627 *newsize = size + 1;
1628 ptr = yield = store_get(*newsize);
1629 }
1630 }
1631
1632 /* That's all we do for raw header expansion. */
1633
1634 if (want_raw)
1635 {
1636 *ptr = 0;
1637 }
1638
1639 /* Otherwise, remove a final newline and a redundant added comma. Then we do
1640 RFC 2047 decoding, translating the charset if requested. The rfc2047_decode2()
1641 function can return an error with decoded data if the charset translation
1642 fails. If decoding fails, it returns NULL. */
1643
1644 else
1645 {
1646 uschar *decoded, *error;
1647 if (ptr > yield && ptr[-1] == '\n') ptr--;
1648 if (ptr > yield && comma != 0 && ptr[-1] == ',') ptr--;
1649 *ptr = 0;
1650 decoded = rfc2047_decode2(yield, check_rfc2047_length, charset, '?', NULL,
1651 newsize, &error);
1652 if (error != NULL)
1653 {
1654 DEBUG(D_any) debug_printf("*** error in RFC 2047 decoding: %s\n"
1655 " input was: %s\n", error, yield);
1656 }
1657 if (decoded != NULL) yield = decoded;
1658 }
1659
1660 return yield;
1661 }
1662
1663
1664
1665
1666 /*************************************************
1667 * Return list of recipients *
1668 *************************************************/
1669 /* A recipients list is available only during system message filtering,
1670 during ACL processing after DATA, and while expanding pipe commands
1671 generated from a system filter, but not elsewhere. */
1672
1673 static uschar *
1674 fn_recipients(void)
1675 {
1676 if (!enable_dollar_recipients) return NULL; else
1677 {
1678 int size = 128;
1679 int ptr = 0;
1680 int i;
1681 uschar * s = store_get(size);
1682 for (i = 0; i < recipients_count; i++)
1683 {
1684 if (i != 0) s = string_catn(s, &size, &ptr, US", ", 2);
1685 s = string_cat(s, &size, &ptr, recipients_list[i].address);
1686 }
1687 s[ptr] = 0; /* string_cat() leaves room */
1688 return s;
1689 }
1690 }
1691
1692
1693 /*************************************************
1694 * Find value of a variable *
1695 *************************************************/
1696
1697 /* The table of variables is kept in alphabetic order, so we can search it
1698 using a binary chop. The "choplen" variable is nothing to do with the binary
1699 chop.
1700
1701 Arguments:
1702 name the name of the variable being sought
1703 exists_only TRUE if this is a def: test; passed on to find_header()
1704 skipping TRUE => skip any processing evaluation; this is not the same as
1705 exists_only because def: may test for values that are first
1706 evaluated here
1707 newsize pointer to an int which is initially zero; if the answer is in
1708 a new memory buffer, *newsize is set to its size
1709
1710 Returns: NULL if the variable does not exist, or
1711 a pointer to the variable's contents, or
1712 something non-NULL if exists_only is TRUE
1713 */
1714
1715 static uschar *
1716 find_variable(uschar *name, BOOL exists_only, BOOL skipping, int *newsize)
1717 {
1718 var_entry * vp;
1719 uschar *s, *domain;
1720 uschar **ss;
1721 void * val;
1722
1723 /* Handle ACL variables, whose names are of the form acl_cxxx or acl_mxxx.
1724 Originally, xxx had to be a number in the range 0-9 (later 0-19), but from
1725 release 4.64 onwards arbitrary names are permitted, as long as the first 5
1726 characters are acl_c or acl_m and the sixth is either a digit or an underscore
1727 (this gave backwards compatibility at the changeover). There may be built-in
1728 variables whose names start acl_ but they should never start in this way. This
1729 slightly messy specification is a consequence of the history, needless to say.
1730
1731 If an ACL variable does not exist, treat it as empty, unless strict_acl_vars is
1732 set, in which case give an error. */
1733
1734 if ((Ustrncmp(name, "acl_c", 5) == 0 || Ustrncmp(name, "acl_m", 5) == 0) &&
1735 !isalpha(name[5]))
1736 {
1737 tree_node *node =
1738 tree_search((name[4] == 'c')? acl_var_c : acl_var_m, name + 4);
1739 return node ? node->data.ptr : strict_acl_vars ? NULL : US"";
1740 }
1741
1742 /* Handle $auth<n> variables. */
1743
1744 if (Ustrncmp(name, "auth", 4) == 0)
1745 {
1746 uschar *endptr;
1747 int n = Ustrtoul(name + 4, &endptr, 10);
1748 if (*endptr == 0 && n != 0 && n <= AUTH_VARS)
1749 return !auth_vars[n-1] ? US"" : auth_vars[n-1];
1750 }
1751 else if (Ustrncmp(name, "regex", 5) == 0)
1752 {
1753 uschar *endptr;
1754 int n = Ustrtoul(name + 5, &endptr, 10);
1755 if (*endptr == 0 && n != 0 && n <= REGEX_VARS)
1756 return !regex_vars[n-1] ? US"" : regex_vars[n-1];
1757 }
1758
1759 /* For all other variables, search the table */
1760
1761 if (!(vp = find_var_ent(name)))
1762 return NULL; /* Unknown variable name */
1763
1764 /* Found an existing variable. If in skipping state, the value isn't needed,
1765 and we want to avoid processing (such as looking up the host name). */
1766
1767 if (skipping)
1768 return US"";
1769
1770 val = vp->value;
1771 switch (vp->type)
1772 {
1773 case vtype_filter_int:
1774 if (!filter_running) return NULL;
1775 /* Fall through */
1776 /* VVVVVVVVVVVV */
1777 case vtype_int:
1778 sprintf(CS var_buffer, "%d", *(int *)(val)); /* Integer */
1779 return var_buffer;
1780
1781 case vtype_ino:
1782 sprintf(CS var_buffer, "%ld", (long int)(*(ino_t *)(val))); /* Inode */
1783 return var_buffer;
1784
1785 case vtype_gid:
1786 sprintf(CS var_buffer, "%ld", (long int)(*(gid_t *)(val))); /* gid */
1787 return var_buffer;
1788
1789 case vtype_uid:
1790 sprintf(CS var_buffer, "%ld", (long int)(*(uid_t *)(val))); /* uid */
1791 return var_buffer;
1792
1793 case vtype_bool:
1794 sprintf(CS var_buffer, "%s", *(BOOL *)(val) ? "yes" : "no"); /* bool */
1795 return var_buffer;
1796
1797 case vtype_stringptr: /* Pointer to string */
1798 return (s = *((uschar **)(val))) ? s : US"";
1799
1800 case vtype_pid:
1801 sprintf(CS var_buffer, "%d", (int)getpid()); /* pid */
1802 return var_buffer;
1803
1804 case vtype_load_avg:
1805 sprintf(CS var_buffer, "%d", OS_GETLOADAVG()); /* load_average */
1806 return var_buffer;
1807
1808 case vtype_host_lookup: /* Lookup if not done so */
1809 if (sender_host_name == NULL && sender_host_address != NULL &&
1810 !host_lookup_failed && host_name_lookup() == OK)
1811 host_build_sender_fullhost();
1812 return (sender_host_name == NULL)? US"" : sender_host_name;
1813
1814 case vtype_localpart: /* Get local part from address */
1815 s = *((uschar **)(val));
1816 if (s == NULL) return US"";
1817 domain = Ustrrchr(s, '@');
1818 if (domain == NULL) return s;
1819 if (domain - s > sizeof(var_buffer) - 1)
1820 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "local part longer than " SIZE_T_FMT
1821 " in string expansion", sizeof(var_buffer));
1822 Ustrncpy(var_buffer, s, domain - s);
1823 var_buffer[domain - s] = 0;
1824 return var_buffer;
1825
1826 case vtype_domain: /* Get domain from address */
1827 s = *((uschar **)(val));
1828 if (s == NULL) return US"";
1829 domain = Ustrrchr(s, '@');
1830 return (domain == NULL)? US"" : domain + 1;
1831
1832 case vtype_msgheaders:
1833 return find_header(NULL, exists_only, newsize, FALSE, NULL);
1834
1835 case vtype_msgheaders_raw:
1836 return find_header(NULL, exists_only, newsize, TRUE, NULL);
1837
1838 case vtype_msgbody: /* Pointer to msgbody string */
1839 case vtype_msgbody_end: /* Ditto, the end of the msg */
1840 ss = (uschar **)(val);
1841 if (*ss == NULL && deliver_datafile >= 0) /* Read body when needed */
1842 {
1843 uschar *body;
1844 off_t start_offset = SPOOL_DATA_START_OFFSET;
1845 int len = message_body_visible;
1846 if (len > message_size) len = message_size;
1847 *ss = body = store_malloc(len+1);
1848 body[0] = 0;
1849 if (vp->type == vtype_msgbody_end)
1850 {
1851 struct stat statbuf;
1852 if (fstat(deliver_datafile, &statbuf) == 0)
1853 {
1854 start_offset = statbuf.st_size - len;
1855 if (start_offset < SPOOL_DATA_START_OFFSET)
1856 start_offset = SPOOL_DATA_START_OFFSET;
1857 }
1858 }
1859 if (lseek(deliver_datafile, start_offset, SEEK_SET) < 0)
1860 log_write(0, LOG_MAIN|LOG_PANIC_DIE, "deliver_datafile lseek: %s",
1861 strerror(errno));
1862 len = read(deliver_datafile, body, len);
1863 if (len > 0)
1864 {
1865 body[len] = 0;
1866 if (message_body_newlines) /* Separate loops for efficiency */
1867 while (len > 0)
1868 { if (body[--len] == 0) body[len] = ' '; }
1869 else
1870 while (len > 0)
1871 { if (body[--len] == '\n' || body[len] == 0) body[len] = ' '; }
1872 }
1873 }
1874 return (*ss == NULL)? US"" : *ss;
1875
1876 case vtype_todbsdin: /* BSD inbox time of day */
1877 return tod_stamp(tod_bsdin);
1878
1879 case vtype_tode: /* Unix epoch time of day */
1880 return tod_stamp(tod_epoch);
1881
1882 case vtype_todel: /* Unix epoch/usec time of day */
1883 return tod_stamp(tod_epoch_l);
1884
1885 case vtype_todf: /* Full time of day */
1886 return tod_stamp(tod_full);
1887
1888 case vtype_todl: /* Log format time of day */
1889 return tod_stamp(tod_log_bare); /* (without timezone) */
1890
1891 case vtype_todzone: /* Time zone offset only */
1892 return tod_stamp(tod_zone);
1893
1894 case vtype_todzulu: /* Zulu time */
1895 return tod_stamp(tod_zulu);
1896
1897 case vtype_todlf: /* Log file datestamp tod */
1898 return tod_stamp(tod_log_datestamp_daily);
1899
1900 case vtype_reply: /* Get reply address */
1901 s = find_header(US"reply-to:", exists_only, newsize, TRUE,
1902 headers_charset);
1903 if (s != NULL) while (isspace(*s)) s++;
1904 if (s == NULL || *s == 0)
1905 {
1906 *newsize = 0; /* For the *s==0 case */
1907 s = find_header(US"from:", exists_only, newsize, TRUE, headers_charset);
1908 }
1909 if (s != NULL)
1910 {
1911 uschar *t;
1912 while (isspace(*s)) s++;
1913 for (t = s; *t != 0; t++) if (*t == '\n') *t = ' ';
1914 while (t > s && isspace(t[-1])) t--;
1915 *t = 0;
1916 }
1917 return (s == NULL)? US"" : s;
1918
1919 case vtype_string_func:
1920 {
1921 uschar * (*fn)() = val;
1922 return fn();
1923 }
1924
1925 case vtype_pspace:
1926 {
1927 int inodes;
1928 sprintf(CS var_buffer, "%d",
1929 receive_statvfs(val == (void *)TRUE, &inodes));
1930 }
1931 return var_buffer;
1932
1933 case vtype_pinodes:
1934 {
1935 int inodes;
1936 (void) receive_statvfs(val == (void *)TRUE, &inodes);
1937 sprintf(CS var_buffer, "%d", inodes);
1938 }
1939 return var_buffer;
1940
1941 case vtype_cert:
1942 return *(void **)val ? US"<cert>" : US"";
1943
1944 #ifndef DISABLE_DKIM
1945 case vtype_dkim:
1946 return dkim_exim_expand_query((int)(long)val);
1947 #endif
1948
1949 }
1950
1951 return NULL; /* Unknown variable. Silences static checkers. */
1952 }
1953
1954
1955
1956
1957 void
1958 modify_variable(uschar *name, void * value)
1959 {
1960 var_entry * vp;
1961 if ((vp = find_var_ent(name))) vp->value = value;
1962 return; /* Unknown variable name, fail silently */
1963 }
1964
1965
1966
1967
1968
1969 /*************************************************
1970 * Read and expand substrings *
1971 *************************************************/
1972
1973 /* This function is called to read and expand argument substrings for various
1974 expansion items. Some have a minimum requirement that is less than the maximum;
1975 in these cases, the first non-present one is set to NULL.
1976
1977 Arguments:
1978 sub points to vector of pointers to set
1979 n maximum number of substrings
1980 m minimum required
1981 sptr points to current string pointer
1982 skipping the skipping flag
1983 check_end if TRUE, check for final '}'
1984 name name of item, for error message
1985 resetok if not NULL, pointer to flag - write FALSE if unsafe to reset
1986 the store.
1987
1988 Returns: 0 OK; string pointer updated
1989 1 curly bracketing error (too few arguments)
1990 2 too many arguments (only if check_end is set); message set
1991 3 other error (expansion failure)
1992 */
1993
1994 static int
1995 read_subs(uschar **sub, int n, int m, const uschar **sptr, BOOL skipping,
1996 BOOL check_end, uschar *name, BOOL *resetok)
1997 {
1998 int i;
1999 const uschar *s = *sptr;
2000
2001 while (isspace(*s)) s++;
2002 for (i = 0; i < n; i++)
2003 {
2004 if (*s != '{')
2005 {
2006 if (i < m)
2007 {
2008 expand_string_message = string_sprintf("Not enough arguments for '%s' "
2009 "(min is %d)", name, m);
2010 return 1;
2011 }
2012 sub[i] = NULL;
2013 break;
2014 }
2015 if (!(sub[i] = expand_string_internal(s+1, TRUE, &s, skipping, TRUE, resetok)))
2016 return 3;
2017 if (*s++ != '}') return 1;
2018 while (isspace(*s)) s++;
2019 }
2020 if (check_end && *s++ != '}')
2021 {
2022 if (s[-1] == '{')
2023 {
2024 expand_string_message = string_sprintf("Too many arguments for '%s' "
2025 "(max is %d)", name, n);
2026 return 2;
2027 }
2028 expand_string_message = string_sprintf("missing '}' after '%s'", name);
2029 return 1;
2030 }
2031
2032 *sptr = s;
2033 return 0;
2034 }
2035
2036
2037
2038
2039 /*************************************************
2040 * Elaborate message for bad variable *
2041 *************************************************/
2042
2043 /* For the "unknown variable" message, take a look at the variable's name, and
2044 give additional information about possible ACL variables. The extra information
2045 is added on to expand_string_message.
2046
2047 Argument: the name of the variable
2048 Returns: nothing
2049 */
2050
2051 static void
2052 check_variable_error_message(uschar *name)
2053 {
2054 if (Ustrncmp(name, "acl_", 4) == 0)
2055 expand_string_message = string_sprintf("%s (%s)", expand_string_message,
2056 (name[4] == 'c' || name[4] == 'm')?
2057 (isalpha(name[5])?
2058 US"6th character of a user-defined ACL variable must be a digit or underscore" :
2059 US"strict_acl_vars is set" /* Syntax is OK, it has to be this */
2060 ) :
2061 US"user-defined ACL variables must start acl_c or acl_m");
2062 }
2063
2064
2065
2066 /*
2067 Load args from sub array to globals, and call acl_check().
2068 Sub array will be corrupted on return.
2069
2070 Returns: OK access is granted by an ACCEPT verb
2071 DISCARD access is (apparently) granted by a DISCARD verb
2072 FAIL access is denied
2073 FAIL_DROP access is denied; drop the connection
2074 DEFER can't tell at the moment
2075 ERROR disaster
2076 */
2077 static int
2078 eval_acl(uschar ** sub, int nsub, uschar ** user_msgp)
2079 {
2080 int i;
2081 int sav_narg = acl_narg;
2082 int ret;
2083 uschar * dummy_logmsg;
2084 extern int acl_where;
2085
2086 if(--nsub > nelem(acl_arg)) nsub = nelem(acl_arg);
2087 for (i = 0; i < nsub && sub[i+1]; i++)
2088 {
2089 uschar * tmp = acl_arg[i];
2090 acl_arg[i] = sub[i+1]; /* place callers args in the globals */
2091 sub[i+1] = tmp; /* stash the old args using our caller's storage */
2092 }
2093 acl_narg = i;
2094 while (i < nsub)
2095 {
2096 sub[i+1] = acl_arg[i];
2097 acl_arg[i++] = NULL;
2098 }
2099
2100 DEBUG(D_expand)
2101 debug_printf("expanding: acl: %s arg: %s%s\n",
2102 sub[0],
2103 acl_narg>0 ? acl_arg[0] : US"<none>",
2104 acl_narg>1 ? " +more" : "");
2105
2106 ret = acl_eval(acl_where, sub[0], user_msgp, &dummy_logmsg);
2107
2108 for (i = 0; i < nsub; i++)
2109 acl_arg[i] = sub[i+1]; /* restore old args */
2110 acl_narg = sav_narg;
2111
2112 return ret;
2113 }
2114
2115
2116
2117
2118 /*************************************************
2119 * Read and evaluate a condition *
2120 *************************************************/
2121
2122 /*
2123 Arguments:
2124 s points to the start of the condition text
2125 resetok points to a BOOL which is written false if it is unsafe to
2126 free memory. Certain condition types (acl) may have side-effect
2127 allocation which must be preserved.
2128 yield points to a BOOL to hold the result of the condition test;
2129 if NULL, we are just reading through a condition that is
2130 part of an "or" combination to check syntax, or in a state
2131 where the answer isn't required
2132
2133 Returns: a pointer to the first character after the condition, or
2134 NULL after an error
2135 */
2136
2137 static const uschar *
2138 eval_condition(const uschar *s, BOOL *resetok, BOOL *yield)
2139 {
2140 BOOL testfor = TRUE;
2141 BOOL tempcond, combined_cond;
2142 BOOL *subcondptr;
2143 BOOL sub2_honour_dollar = TRUE;
2144 int i, rc, cond_type, roffset;
2145 int_eximarith_t num[2];
2146 struct stat statbuf;
2147 uschar name[256];
2148 const uschar *sub[10];
2149
2150 const pcre *re;
2151 const uschar *rerror;
2152
2153 for (;;)
2154 {
2155 while (isspace(*s)) s++;
2156 if (*s == '!') { testfor = !testfor; s++; } else break;
2157 }
2158
2159 /* Numeric comparisons are symbolic */
2160
2161 if (*s == '=' || *s == '>' || *s == '<')
2162 {
2163 int p = 0;
2164 name[p++] = *s++;
2165 if (*s == '=')
2166 {
2167 name[p++] = '=';
2168 s++;
2169 }
2170 name[p] = 0;
2171 }
2172
2173 /* All other conditions are named */
2174
2175 else s = read_name(name, 256, s, US"_");
2176
2177 /* If we haven't read a name, it means some non-alpha character is first. */
2178
2179 if (name[0] == 0)
2180 {
2181 expand_string_message = string_sprintf("condition name expected, "
2182 "but found \"%.16s\"", s);
2183 return NULL;
2184 }
2185
2186 /* Find which condition we are dealing with, and switch on it */
2187
2188 cond_type = chop_match(name, cond_table, nelem(cond_table));
2189 switch(cond_type)
2190 {
2191 /* def: tests for a non-empty variable, or for the existence of a header. If
2192 yield == NULL we are in a skipping state, and don't care about the answer. */
2193
2194 case ECOND_DEF:
2195 if (*s != ':')
2196 {
2197 expand_string_message = US"\":\" expected after \"def\"";
2198 return NULL;
2199 }
2200
2201 s = read_name(name, 256, s+1, US"_");
2202
2203 /* Test for a header's existence. If the name contains a closing brace
2204 character, this may be a user error where the terminating colon has been
2205 omitted. Set a flag to adjust a subsequent error message in this case. */
2206
2207 if (Ustrncmp(name, "h_", 2) == 0 ||
2208 Ustrncmp(name, "rh_", 3) == 0 ||
2209 Ustrncmp(name, "bh_", 3) == 0 ||
2210 Ustrncmp(name, "header_", 7) == 0 ||
2211 Ustrncmp(name, "rheader_", 8) == 0 ||
2212 Ustrncmp(name, "bheader_", 8) == 0)
2213 {
2214 s = read_header_name(name, 256, s);
2215 /* {-for-text-editors */
2216 if (Ustrchr(name, '}') != NULL) malformed_header = TRUE;
2217 if (yield != NULL) *yield =
2218 (find_header(name, TRUE, NULL, FALSE, NULL) != NULL) == testfor;
2219 }
2220
2221 /* Test for a variable's having a non-empty value. A non-existent variable
2222 causes an expansion failure. */
2223
2224 else
2225 {
2226 uschar *value = find_variable(name, TRUE, yield == NULL, NULL);
2227 if (value == NULL)
2228 {
2229 expand_string_message = (name[0] == 0)?
2230 string_sprintf("variable name omitted after \"def:\"") :
2231 string_sprintf("unknown variable \"%s\" after \"def:\"", name);
2232 check_variable_error_message(name);
2233 return NULL;
2234 }
2235 if (yield != NULL) *yield = (value[0] != 0) == testfor;
2236 }
2237
2238 return s;
2239
2240
2241 /* first_delivery tests for first delivery attempt */
2242
2243 case ECOND_FIRST_DELIVERY:
2244 if (yield != NULL) *yield = deliver_firsttime == testfor;
2245 return s;
2246
2247
2248 /* queue_running tests for any process started by a queue runner */
2249
2250 case ECOND_QUEUE_RUNNING:
2251 if (yield != NULL) *yield = (queue_run_pid != (pid_t)0) == testfor;
2252 return s;
2253
2254
2255 /* exists: tests for file existence
2256 isip: tests for any IP address
2257 isip4: tests for an IPv4 address
2258 isip6: tests for an IPv6 address
2259 pam: does PAM authentication
2260 radius: does RADIUS authentication
2261 ldapauth: does LDAP authentication
2262 pwcheck: does Cyrus SASL pwcheck authentication
2263 */
2264
2265 case ECOND_EXISTS:
2266 case ECOND_ISIP:
2267 case ECOND_ISIP4:
2268 case ECOND_ISIP6:
2269 case ECOND_PAM:
2270 case ECOND_RADIUS:
2271 case ECOND_LDAPAUTH:
2272 case ECOND_PWCHECK:
2273
2274 while (isspace(*s)) s++;
2275 if (*s != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2276
2277 sub[0] = expand_string_internal(s+1, TRUE, &s, yield == NULL, TRUE, resetok);
2278 if (sub[0] == NULL) return NULL;
2279 /* {-for-text-editors */
2280 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2281
2282 if (yield == NULL) return s; /* No need to run the test if skipping */
2283
2284 switch(cond_type)
2285 {
2286 case ECOND_EXISTS:
2287 if ((expand_forbid & RDO_EXISTS) != 0)
2288 {
2289 expand_string_message = US"File existence tests are not permitted";
2290 return NULL;
2291 }
2292 *yield = (Ustat(sub[0], &statbuf) == 0) == testfor;
2293 break;
2294
2295 case ECOND_ISIP:
2296 case ECOND_ISIP4:
2297 case ECOND_ISIP6:
2298 rc = string_is_ip_address(sub[0], NULL);
2299 *yield = ((cond_type == ECOND_ISIP)? (rc != 0) :
2300 (cond_type == ECOND_ISIP4)? (rc == 4) : (rc == 6)) == testfor;
2301 break;
2302
2303 /* Various authentication tests - all optionally compiled */
2304
2305 case ECOND_PAM:
2306 #ifdef SUPPORT_PAM
2307 rc = auth_call_pam(sub[0], &expand_string_message);
2308 goto END_AUTH;
2309 #else
2310 goto COND_FAILED_NOT_COMPILED;
2311 #endif /* SUPPORT_PAM */
2312
2313 case ECOND_RADIUS:
2314 #ifdef RADIUS_CONFIG_FILE
2315 rc = auth_call_radius(sub[0], &expand_string_message);
2316 goto END_AUTH;
2317 #else
2318 goto COND_FAILED_NOT_COMPILED;
2319 #endif /* RADIUS_CONFIG_FILE */
2320
2321 case ECOND_LDAPAUTH:
2322 #ifdef LOOKUP_LDAP
2323 {
2324 /* Just to keep the interface the same */
2325 BOOL do_cache;
2326 int old_pool = store_pool;
2327 store_pool = POOL_SEARCH;
2328 rc = eldapauth_find((void *)(-1), NULL, sub[0], Ustrlen(sub[0]), NULL,
2329 &expand_string_message, &do_cache);
2330 store_pool = old_pool;
2331 }
2332 goto END_AUTH;
2333 #else
2334 goto COND_FAILED_NOT_COMPILED;
2335 #endif /* LOOKUP_LDAP */
2336
2337 case ECOND_PWCHECK:
2338 #ifdef CYRUS_PWCHECK_SOCKET
2339 rc = auth_call_pwcheck(sub[0], &expand_string_message);
2340 goto END_AUTH;
2341 #else
2342 goto COND_FAILED_NOT_COMPILED;
2343 #endif /* CYRUS_PWCHECK_SOCKET */
2344
2345 #if defined(SUPPORT_PAM) || defined(RADIUS_CONFIG_FILE) || \
2346 defined(LOOKUP_LDAP) || defined(CYRUS_PWCHECK_SOCKET)
2347 END_AUTH:
2348 if (rc == ERROR || rc == DEFER) return NULL;
2349 *yield = (rc == OK) == testfor;
2350 #endif
2351 }
2352 return s;
2353
2354
2355 /* call ACL (in a conditional context). Accept true, deny false.
2356 Defer is a forced-fail. Anything set by message= goes to $value.
2357 Up to ten parameters are used; we use the braces round the name+args
2358 like the saslauthd condition does, to permit a variable number of args.
2359 See also the expansion-item version EITEM_ACL and the traditional
2360 acl modifier ACLC_ACL.
2361 Since the ACL may allocate new global variables, tell our caller to not
2362 reclaim memory.
2363 */
2364
2365 case ECOND_ACL:
2366 /* ${if acl {{name}{arg1}{arg2}...} {yes}{no}} */
2367 {
2368 uschar *sub[10];
2369 uschar *user_msg;
2370 BOOL cond = FALSE;
2371 int size = 0;
2372 int ptr = 0;
2373
2374 while (isspace(*s)) s++;
2375 if (*s++ != '{') goto COND_FAILED_CURLY_START; /*}*/
2376
2377 switch(read_subs(sub, nelem(sub), 1,
2378 &s, yield == NULL, TRUE, US"acl", resetok))
2379 {
2380 case 1: expand_string_message = US"too few arguments or bracketing "
2381 "error for acl";
2382 case 2:
2383 case 3: return NULL;
2384 }
2385
2386 *resetok = FALSE; /* eval_acl() might allocate; do not reclaim */
2387 if (yield != NULL) switch(eval_acl(sub, nelem(sub), &user_msg))
2388 {
2389 case OK:
2390 cond = TRUE;
2391 case FAIL:
2392 lookup_value = NULL;
2393 if (user_msg)
2394 {
2395 lookup_value = string_cat(NULL, &size, &ptr, user_msg);
2396 lookup_value[ptr] = '\0';
2397 }
2398 *yield = cond == testfor;
2399 break;
2400
2401 case DEFER:
2402 expand_string_forcedfail = TRUE;
2403 /*FALLTHROUGH*/
2404 default:
2405 expand_string_message = string_sprintf("error from acl \"%s\"", sub[0]);
2406 return NULL;
2407 }
2408 return s;
2409 }
2410
2411
2412 /* saslauthd: does Cyrus saslauthd authentication. Four parameters are used:
2413
2414 ${if saslauthd {{username}{password}{service}{realm}} {yes}{no}}
2415
2416 However, the last two are optional. That is why the whole set is enclosed
2417 in their own set of braces. */
2418
2419 case ECOND_SASLAUTHD:
2420 #ifndef CYRUS_SASLAUTHD_SOCKET
2421 goto COND_FAILED_NOT_COMPILED;
2422 #else
2423 {
2424 uschar *sub[4];
2425 while (isspace(*s)) s++;
2426 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2427 switch(read_subs(sub, nelem(sub), 2, &s, yield == NULL, TRUE, US"saslauthd",
2428 resetok))
2429 {
2430 case 1: expand_string_message = US"too few arguments or bracketing "
2431 "error for saslauthd";
2432 case 2:
2433 case 3: return NULL;
2434 }
2435 if (sub[2] == NULL) sub[3] = NULL; /* realm if no service */
2436 if (yield != NULL)
2437 {
2438 int rc = auth_call_saslauthd(sub[0], sub[1], sub[2], sub[3],
2439 &expand_string_message);
2440 if (rc == ERROR || rc == DEFER) return NULL;
2441 *yield = (rc == OK) == testfor;
2442 }
2443 return s;
2444 }
2445 #endif /* CYRUS_SASLAUTHD_SOCKET */
2446
2447
2448 /* symbolic operators for numeric and string comparison, and a number of
2449 other operators, all requiring two arguments.
2450
2451 crypteq: encrypts plaintext and compares against an encrypted text,
2452 using crypt(), crypt16(), MD5 or SHA-1
2453 inlist/inlisti: checks if first argument is in the list of the second
2454 match: does a regular expression match and sets up the numerical
2455 variables if it succeeds
2456 match_address: matches in an address list
2457 match_domain: matches in a domain list
2458 match_ip: matches a host list that is restricted to IP addresses
2459 match_local_part: matches in a local part list
2460 */
2461
2462 case ECOND_MATCH_ADDRESS:
2463 case ECOND_MATCH_DOMAIN:
2464 case ECOND_MATCH_IP:
2465 case ECOND_MATCH_LOCAL_PART:
2466 #ifndef EXPAND_LISTMATCH_RHS
2467 sub2_honour_dollar = FALSE;
2468 #endif
2469 /* FALLTHROUGH */
2470
2471 case ECOND_CRYPTEQ:
2472 case ECOND_INLIST:
2473 case ECOND_INLISTI:
2474 case ECOND_MATCH:
2475
2476 case ECOND_NUM_L: /* Numerical comparisons */
2477 case ECOND_NUM_LE:
2478 case ECOND_NUM_E:
2479 case ECOND_NUM_EE:
2480 case ECOND_NUM_G:
2481 case ECOND_NUM_GE:
2482
2483 case ECOND_STR_LT: /* String comparisons */
2484 case ECOND_STR_LTI:
2485 case ECOND_STR_LE:
2486 case ECOND_STR_LEI:
2487 case ECOND_STR_EQ:
2488 case ECOND_STR_EQI:
2489 case ECOND_STR_GT:
2490 case ECOND_STR_GTI:
2491 case ECOND_STR_GE:
2492 case ECOND_STR_GEI:
2493
2494 for (i = 0; i < 2; i++)
2495 {
2496 /* Sometimes, we don't expand substrings; too many insecure configurations
2497 created using match_address{}{} and friends, where the second param
2498 includes information from untrustworthy sources. */
2499 BOOL honour_dollar = TRUE;
2500 if ((i > 0) && !sub2_honour_dollar)
2501 honour_dollar = FALSE;
2502
2503 while (isspace(*s)) s++;
2504 if (*s != '{')
2505 {
2506 if (i == 0) goto COND_FAILED_CURLY_START;
2507 expand_string_message = string_sprintf("missing 2nd string in {} "
2508 "after \"%s\"", name);
2509 return NULL;
2510 }
2511 sub[i] = expand_string_internal(s+1, TRUE, &s, yield == NULL,
2512 honour_dollar, resetok);
2513 if (sub[i] == NULL) return NULL;
2514 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2515
2516 /* Convert to numerical if required; we know that the names of all the
2517 conditions that compare numbers do not start with a letter. This just saves
2518 checking for them individually. */
2519
2520 if (!isalpha(name[0]) && yield != NULL)
2521 if (sub[i][0] == 0)
2522 {
2523 num[i] = 0;
2524 DEBUG(D_expand)
2525 debug_printf("empty string cast to zero for numerical comparison\n");
2526 }
2527 else
2528 {
2529 num[i] = expanded_string_integer(sub[i], FALSE);
2530 if (expand_string_message != NULL) return NULL;
2531 }
2532 }
2533
2534 /* Result not required */
2535
2536 if (yield == NULL) return s;
2537
2538 /* Do an appropriate comparison */
2539
2540 switch(cond_type)
2541 {
2542 case ECOND_NUM_E:
2543 case ECOND_NUM_EE:
2544 tempcond = (num[0] == num[1]);
2545 break;
2546
2547 case ECOND_NUM_G:
2548 tempcond = (num[0] > num[1]);
2549 break;
2550
2551 case ECOND_NUM_GE:
2552 tempcond = (num[0] >= num[1]);
2553 break;
2554
2555 case ECOND_NUM_L:
2556 tempcond = (num[0] < num[1]);
2557 break;
2558
2559 case ECOND_NUM_LE:
2560 tempcond = (num[0] <= num[1]);
2561 break;
2562
2563 case ECOND_STR_LT:
2564 tempcond = (Ustrcmp(sub[0], sub[1]) < 0);
2565 break;
2566
2567 case ECOND_STR_LTI:
2568 tempcond = (strcmpic(sub[0], sub[1]) < 0);
2569 break;
2570
2571 case ECOND_STR_LE:
2572 tempcond = (Ustrcmp(sub[0], sub[1]) <= 0);
2573 break;
2574
2575 case ECOND_STR_LEI:
2576 tempcond = (strcmpic(sub[0], sub[1]) <= 0);
2577 break;
2578
2579 case ECOND_STR_EQ:
2580 tempcond = (Ustrcmp(sub[0], sub[1]) == 0);
2581 break;
2582
2583 case ECOND_STR_EQI:
2584 tempcond = (strcmpic(sub[0], sub[1]) == 0);
2585 break;
2586
2587 case ECOND_STR_GT:
2588 tempcond = (Ustrcmp(sub[0], sub[1]) > 0);
2589 break;
2590
2591 case ECOND_STR_GTI:
2592 tempcond = (strcmpic(sub[0], sub[1]) > 0);
2593 break;
2594
2595 case ECOND_STR_GE:
2596 tempcond = (Ustrcmp(sub[0], sub[1]) >= 0);
2597 break;
2598
2599 case ECOND_STR_GEI:
2600 tempcond = (strcmpic(sub[0], sub[1]) >= 0);
2601 break;
2602
2603 case ECOND_MATCH: /* Regular expression match */
2604 re = pcre_compile(CS sub[1], PCRE_COPT, (const char **)&rerror, &roffset,
2605 NULL);
2606 if (re == NULL)
2607 {
2608 expand_string_message = string_sprintf("regular expression error in "
2609 "\"%s\": %s at offset %d", sub[1], rerror, roffset);
2610 return NULL;
2611 }
2612 tempcond = regex_match_and_setup(re, sub[0], 0, -1);
2613 break;
2614
2615 case ECOND_MATCH_ADDRESS: /* Match in an address list */
2616 rc = match_address_list(sub[0], TRUE, FALSE, &(sub[1]), NULL, -1, 0, NULL);
2617 goto MATCHED_SOMETHING;
2618
2619 case ECOND_MATCH_DOMAIN: /* Match in a domain list */
2620 rc = match_isinlist(sub[0], &(sub[1]), 0, &domainlist_anchor, NULL,
2621 MCL_DOMAIN + MCL_NOEXPAND, TRUE, NULL);
2622 goto MATCHED_SOMETHING;
2623
2624 case ECOND_MATCH_IP: /* Match IP address in a host list */
2625 if (sub[0][0] != 0 && string_is_ip_address(sub[0], NULL) == 0)
2626 {
2627 expand_string_message = string_sprintf("\"%s\" is not an IP address",
2628 sub[0]);
2629 return NULL;
2630 }
2631 else
2632 {
2633 unsigned int *nullcache = NULL;
2634 check_host_block cb;
2635
2636 cb.host_name = US"";
2637 cb.host_address = sub[0];
2638
2639 /* If the host address starts off ::ffff: it is an IPv6 address in
2640 IPv4-compatible mode. Find the IPv4 part for checking against IPv4
2641 addresses. */
2642
2643 cb.host_ipv4 = (Ustrncmp(cb.host_address, "::ffff:", 7) == 0)?
2644 cb.host_address + 7 : cb.host_address;
2645
2646 rc = match_check_list(
2647 &sub[1], /* the list */
2648 0, /* separator character */
2649 &hostlist_anchor, /* anchor pointer */
2650 &nullcache, /* cache pointer */
2651 check_host, /* function for testing */
2652 &cb, /* argument for function */
2653 MCL_HOST, /* type of check */
2654 sub[0], /* text for debugging */
2655 NULL); /* where to pass back data */
2656 }
2657 goto MATCHED_SOMETHING;
2658
2659 case ECOND_MATCH_LOCAL_PART:
2660 rc = match_isinlist(sub[0], &(sub[1]), 0, &localpartlist_anchor, NULL,
2661 MCL_LOCALPART + MCL_NOEXPAND, TRUE, NULL);
2662 /* Fall through */
2663 /* VVVVVVVVVVVV */
2664 MATCHED_SOMETHING:
2665 switch(rc)
2666 {
2667 case OK:
2668 tempcond = TRUE;
2669 break;
2670
2671 case FAIL:
2672 tempcond = FALSE;
2673 break;
2674
2675 case DEFER:
2676 expand_string_message = string_sprintf("unable to complete match "
2677 "against \"%s\": %s", sub[1], search_error_message);
2678 return NULL;
2679 }
2680
2681 break;
2682
2683 /* Various "encrypted" comparisons. If the second string starts with
2684 "{" then an encryption type is given. Default to crypt() or crypt16()
2685 (build-time choice). */
2686 /* }-for-text-editors */
2687
2688 case ECOND_CRYPTEQ:
2689 #ifndef SUPPORT_CRYPTEQ
2690 goto COND_FAILED_NOT_COMPILED;
2691 #else
2692 if (strncmpic(sub[1], US"{md5}", 5) == 0)
2693 {
2694 int sublen = Ustrlen(sub[1]+5);
2695 md5 base;
2696 uschar digest[16];
2697
2698 md5_start(&base);
2699 md5_end(&base, sub[0], Ustrlen(sub[0]), digest);
2700
2701 /* If the length that we are comparing against is 24, the MD5 digest
2702 is expressed as a base64 string. This is the way LDAP does it. However,
2703 some other software uses a straightforward hex representation. We assume
2704 this if the length is 32. Other lengths fail. */
2705
2706 if (sublen == 24)
2707 {
2708 uschar *coded = b64encode(digest, 16);
2709 DEBUG(D_auth) debug_printf("crypteq: using MD5+B64 hashing\n"
2710 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
2711 tempcond = (Ustrcmp(coded, sub[1]+5) == 0);
2712 }
2713 else if (sublen == 32)
2714 {
2715 int i;
2716 uschar coded[36];
2717 for (i = 0; i < 16; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
2718 coded[32] = 0;
2719 DEBUG(D_auth) debug_printf("crypteq: using MD5+hex hashing\n"
2720 " subject=%s\n crypted=%s\n", coded, sub[1]+5);
2721 tempcond = (strcmpic(coded, sub[1]+5) == 0);
2722 }
2723 else
2724 {
2725 DEBUG(D_auth) debug_printf("crypteq: length for MD5 not 24 or 32: "
2726 "fail\n crypted=%s\n", sub[1]+5);
2727 tempcond = FALSE;
2728 }
2729 }
2730
2731 else if (strncmpic(sub[1], US"{sha1}", 6) == 0)
2732 {
2733 int sublen = Ustrlen(sub[1]+6);
2734 hctx h;
2735 uschar digest[20];
2736
2737 sha1_start(&h);
2738 sha1_end(&h, sub[0], Ustrlen(sub[0]), digest);
2739
2740 /* If the length that we are comparing against is 28, assume the SHA1
2741 digest is expressed as a base64 string. If the length is 40, assume a
2742 straightforward hex representation. Other lengths fail. */
2743
2744 if (sublen == 28)
2745 {
2746 uschar *coded = b64encode(digest, 20);
2747 DEBUG(D_auth) debug_printf("crypteq: using SHA1+B64 hashing\n"
2748 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
2749 tempcond = (Ustrcmp(coded, sub[1]+6) == 0);
2750 }
2751 else if (sublen == 40)
2752 {
2753 int i;
2754 uschar coded[44];
2755 for (i = 0; i < 20; i++) sprintf(CS (coded+2*i), "%02X", digest[i]);
2756 coded[40] = 0;
2757 DEBUG(D_auth) debug_printf("crypteq: using SHA1+hex hashing\n"
2758 " subject=%s\n crypted=%s\n", coded, sub[1]+6);
2759 tempcond = (strcmpic(coded, sub[1]+6) == 0);
2760 }
2761 else
2762 {
2763 DEBUG(D_auth) debug_printf("crypteq: length for SHA-1 not 28 or 40: "
2764 "fail\n crypted=%s\n", sub[1]+6);
2765 tempcond = FALSE;
2766 }
2767 }
2768
2769 else /* {crypt} or {crypt16} and non-{ at start */
2770 /* }-for-text-editors */
2771 {
2772 int which = 0;
2773 uschar *coded;
2774
2775 if (strncmpic(sub[1], US"{crypt}", 7) == 0)
2776 {
2777 sub[1] += 7;
2778 which = 1;
2779 }
2780 else if (strncmpic(sub[1], US"{crypt16}", 9) == 0)
2781 {
2782 sub[1] += 9;
2783 which = 2;
2784 }
2785 else if (sub[1][0] == '{') /* }-for-text-editors */
2786 {
2787 expand_string_message = string_sprintf("unknown encryption mechanism "
2788 "in \"%s\"", sub[1]);
2789 return NULL;
2790 }
2791
2792 switch(which)
2793 {
2794 case 0: coded = US DEFAULT_CRYPT(CS sub[0], CS sub[1]); break;
2795 case 1: coded = US crypt(CS sub[0], CS sub[1]); break;
2796 default: coded = US crypt16(CS sub[0], CS sub[1]); break;
2797 }
2798
2799 #define STR(s) # s
2800 #define XSTR(s) STR(s)
2801 DEBUG(D_auth) debug_printf("crypteq: using %s()\n"
2802 " subject=%s\n crypted=%s\n",
2803 which == 0 ? XSTR(DEFAULT_CRYPT) : which == 1 ? "crypt" : "crypt16",
2804 coded, sub[1]);
2805 #undef STR
2806 #undef XSTR
2807
2808 /* If the encrypted string contains fewer than two characters (for the
2809 salt), force failure. Otherwise we get false positives: with an empty
2810 string the yield of crypt() is an empty string! */
2811
2812 if (coded)
2813 tempcond = Ustrlen(sub[1]) < 2 ? FALSE : Ustrcmp(coded, sub[1]) == 0;
2814 else if (errno == EINVAL)
2815 tempcond = FALSE;
2816 else
2817 {
2818 expand_string_message = string_sprintf("crypt error: %s\n",
2819 US strerror(errno));
2820 return NULL;
2821 }
2822 }
2823 break;
2824 #endif /* SUPPORT_CRYPTEQ */
2825
2826 case ECOND_INLIST:
2827 case ECOND_INLISTI:
2828 {
2829 const uschar * list = sub[1];
2830 int sep = 0;
2831 uschar *save_iterate_item = iterate_item;
2832 int (*compare)(const uschar *, const uschar *);
2833
2834 DEBUG(D_expand) debug_printf("condition: %s\n", name);
2835
2836 tempcond = FALSE;
2837 compare = cond_type == ECOND_INLISTI
2838 ? strcmpic : (int (*)(const uschar *, const uschar *)) strcmp;
2839
2840 while ((iterate_item = string_nextinlist(&list, &sep, NULL, 0)))
2841 if (compare(sub[0], iterate_item) == 0)
2842 {
2843 tempcond = TRUE;
2844 break;
2845 }
2846 iterate_item = save_iterate_item;
2847 }
2848
2849 } /* Switch for comparison conditions */
2850
2851 *yield = tempcond == testfor;
2852 return s; /* End of comparison conditions */
2853
2854
2855 /* and/or: computes logical and/or of several conditions */
2856
2857 case ECOND_AND:
2858 case ECOND_OR:
2859 subcondptr = (yield == NULL)? NULL : &tempcond;
2860 combined_cond = (cond_type == ECOND_AND);
2861
2862 while (isspace(*s)) s++;
2863 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2864
2865 for (;;)
2866 {
2867 while (isspace(*s)) s++;
2868 /* {-for-text-editors */
2869 if (*s == '}') break;
2870 if (*s != '{') /* }-for-text-editors */
2871 {
2872 expand_string_message = string_sprintf("each subcondition "
2873 "inside an \"%s{...}\" condition must be in its own {}", name);
2874 return NULL;
2875 }
2876
2877 if (!(s = eval_condition(s+1, resetok, subcondptr)))
2878 {
2879 expand_string_message = string_sprintf("%s inside \"%s{...}\" condition",
2880 expand_string_message, name);
2881 return NULL;
2882 }
2883 while (isspace(*s)) s++;
2884
2885 /* {-for-text-editors */
2886 if (*s++ != '}')
2887 {
2888 /* {-for-text-editors */
2889 expand_string_message = string_sprintf("missing } at end of condition "
2890 "inside \"%s\" group", name);
2891 return NULL;
2892 }
2893
2894 if (yield != NULL)
2895 {
2896 if (cond_type == ECOND_AND)
2897 {
2898 combined_cond &= tempcond;
2899 if (!combined_cond) subcondptr = NULL; /* once false, don't */
2900 } /* evaluate any more */
2901 else
2902 {
2903 combined_cond |= tempcond;
2904 if (combined_cond) subcondptr = NULL; /* once true, don't */
2905 } /* evaluate any more */
2906 }
2907 }
2908
2909 if (yield != NULL) *yield = (combined_cond == testfor);
2910 return ++s;
2911
2912
2913 /* forall/forany: iterates a condition with different values */
2914
2915 case ECOND_FORALL:
2916 case ECOND_FORANY:
2917 {
2918 const uschar * list;
2919 int sep = 0;
2920 uschar *save_iterate_item = iterate_item;
2921
2922 DEBUG(D_expand) debug_printf("condition: %s\n", name);
2923
2924 while (isspace(*s)) s++;
2925 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2926 sub[0] = expand_string_internal(s, TRUE, &s, (yield == NULL), TRUE, resetok);
2927 if (sub[0] == NULL) return NULL;
2928 /* {-for-text-editors */
2929 if (*s++ != '}') goto COND_FAILED_CURLY_END;
2930
2931 while (isspace(*s)) s++;
2932 if (*s++ != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
2933
2934 sub[1] = s;
2935
2936 /* Call eval_condition once, with result discarded (as if scanning a
2937 "false" part). This allows us to find the end of the condition, because if
2938 the list it empty, we won't actually evaluate the condition for real. */
2939
2940 if (!(s = eval_condition(sub[1], resetok, NULL)))
2941 {
2942 expand_string_message = string_sprintf("%s inside \"%s\" condition",
2943 expand_string_message, name);
2944 return NULL;
2945 }
2946 while (isspace(*s)) s++;
2947
2948 /* {-for-text-editors */
2949 if (*s++ != '}')
2950 {
2951 /* {-for-text-editors */
2952 expand_string_message = string_sprintf("missing } at end of condition "
2953 "inside \"%s\"", name);
2954 return NULL;
2955 }
2956
2957 if (yield != NULL) *yield = !testfor;
2958 list = sub[0];
2959 while ((iterate_item = string_nextinlist(&list, &sep, NULL, 0)) != NULL)
2960 {
2961 DEBUG(D_expand) debug_printf("%s: $item = \"%s\"\n", name, iterate_item);
2962 if (!eval_condition(sub[1], resetok, &tempcond))
2963 {
2964 expand_string_message = string_sprintf("%s inside \"%s\" condition",
2965 expand_string_message, name);
2966 iterate_item = save_iterate_item;
2967 return NULL;
2968 }
2969 DEBUG(D_expand) debug_printf("%s: condition evaluated to %s\n", name,
2970 tempcond? "true":"false");
2971
2972 if (yield != NULL) *yield = (tempcond == testfor);
2973 if (tempcond == (cond_type == ECOND_FORANY)) break;
2974 }
2975
2976 iterate_item = save_iterate_item;
2977 return s;
2978 }
2979
2980
2981 /* The bool{} expansion condition maps a string to boolean.
2982 The values supported should match those supported by the ACL condition
2983 (acl.c, ACLC_CONDITION) so that we keep to a minimum the different ideas
2984 of true/false. Note that Router "condition" rules have a different
2985 interpretation, where general data can be used and only a few values
2986 map to FALSE.
2987 Note that readconf.c boolean matching, for boolean configuration options,
2988 only matches true/yes/false/no.
2989 The bool_lax{} condition matches the Router logic, which is much more
2990 liberal. */
2991 case ECOND_BOOL:
2992 case ECOND_BOOL_LAX:
2993 {
2994 uschar *sub_arg[1];
2995 uschar *t, *t2;
2996 uschar *ourname;
2997 size_t len;
2998 BOOL boolvalue = FALSE;
2999 while (isspace(*s)) s++;
3000 if (*s != '{') goto COND_FAILED_CURLY_START; /* }-for-text-editors */
3001 ourname = cond_type == ECOND_BOOL_LAX ? US"bool_lax" : US"bool";
3002 switch(read_subs(sub_arg, 1, 1, &s, yield == NULL, FALSE, ourname, resetok))
3003 {
3004 case 1: expand_string_message = string_sprintf(
3005 "too few arguments or bracketing error for %s",
3006 ourname);
3007 /*FALLTHROUGH*/
3008 case 2:
3009 case 3: return NULL;
3010 }
3011 t = sub_arg[0];
3012 while (isspace(*t)) t++;
3013 len = Ustrlen(t);
3014 if (len)
3015 {
3016 /* trailing whitespace: seems like a good idea to ignore it too */
3017 t2 = t + len - 1;
3018 while (isspace(*t2)) t2--;
3019 if (t2 != (t + len))
3020 {
3021 *++t2 = '\0';
3022 len = t2 - t;
3023 }
3024 }
3025 DEBUG(D_expand)
3026 debug_printf("considering %s: %s\n", ourname, len ? t : US"<empty>");
3027 /* logic for the lax case from expand_check_condition(), which also does
3028 expands, and the logic is both short and stable enough that there should
3029 be no maintenance burden from replicating it. */
3030 if (len == 0)
3031 boolvalue = FALSE;
3032 else if (*t == '-'
3033 ? Ustrspn(t+1, "0123456789") == len-1
3034 : Ustrspn(t, "0123456789") == len)
3035 {
3036 boolvalue = (Uatoi(t) == 0) ? FALSE : TRUE;
3037 /* expand_check_condition only does a literal string "0" check */
3038 if ((cond_type == ECOND_BOOL_LAX) && (len > 1))
3039 boolvalue = TRUE;
3040 }
3041 else if (strcmpic(t, US"true") == 0 || strcmpic(t, US"yes") == 0)
3042 boolvalue = TRUE;
3043 else if (strcmpic(t, US"false") == 0 || strcmpic(t, US"no") == 0)
3044 boolvalue = FALSE;
3045 else if (cond_type == ECOND_BOOL_LAX)
3046 boolvalue = TRUE;
3047 else
3048 {
3049 expand_string_message = string_sprintf("unrecognised boolean "
3050 "value \"%s\"", t);
3051 return NULL;
3052 }
3053 DEBUG(D_expand) debug_printf("%s: condition evaluated to %s\n", ourname,
3054 boolvalue? "true":"false");
3055 if (yield != NULL) *yield = (boolvalue == testfor);
3056 return s;
3057 }
3058
3059 /* Unknown condition */
3060
3061 default:
3062 expand_string_message = string_sprintf("unknown condition \"%s\"", name);
3063 return NULL;
3064 } /* End switch on condition type */
3065
3066 /* Missing braces at start and end of data */
3067
3068 COND_FAILED_CURLY_START:
3069 expand_string_message = string_sprintf("missing { after \"%s\"", name);
3070 return NULL;
3071
3072 COND_FAILED_CURLY_END:
3073 expand_string_message = string_sprintf("missing } at end of \"%s\" condition",
3074 name);
3075 return NULL;
3076
3077 /* A condition requires code that is not compiled */
3078
3079 #if !defined(SUPPORT_PAM) || !defined(RADIUS_CONFIG_FILE) || \
3080 !defined(LOOKUP_LDAP) || !defined(CYRUS_PWCHECK_SOCKET) || \
3081 !defined(SUPPORT_CRYPTEQ) || !defined(CYRUS_SASLAUTHD_SOCKET)
3082 COND_FAILED_NOT_COMPILED:
3083 expand_string_message = string_sprintf("support for \"%s\" not compiled",
3084 name);
3085 return NULL;
3086 #endif
3087 }
3088
3089
3090
3091
3092 /*************************************************
3093 * Save numerical variables *
3094 *************************************************/
3095
3096 /* This function is called from items such as "if" that want to preserve and
3097 restore the numbered variables.
3098
3099 Arguments:
3100 save_expand_string points to an array of pointers to set
3101 save_expand_nlength points to an array of ints for the lengths
3102
3103 Returns: the value of expand max to save
3104 */
3105
3106 static int
3107 save_expand_strings(uschar **save_expand_nstring, int *save_expand_nlength)
3108 {
3109 int i;
3110 for (i = 0; i <= expand_nmax; i++)
3111 {
3112 save_expand_nstring[i] = expand_nstring[i];
3113 save_expand_nlength[i] = expand_nlength[i];
3114 }
3115 return expand_nmax;
3116 }
3117
3118
3119
3120 /*************************************************
3121 * Restore numerical variables *
3122 *************************************************/
3123
3124 /* This function restored saved values of numerical strings.
3125
3126 Arguments:
3127 save_expand_nmax the number of strings to restore
3128 save_expand_string points to an array of pointers
3129 save_expand_nlength points to an array of ints
3130
3131 Returns: nothing
3132 */
3133
3134 static void
3135 restore_expand_strings(int save_expand_nmax, uschar **save_expand_nstring,
3136 int *save_expand_nlength)
3137 {
3138 int i;
3139 expand_nmax = save_expand_nmax;
3140 for (i = 0; i <= expand_nmax; i++)
3141 {
3142 expand_nstring[i] = save_expand_nstring[i];
3143 expand_nlength[i] = save_expand_nlength[i];
3144 }
3145 }
3146
3147
3148
3149
3150
3151 /*************************************************
3152 * Handle yes/no substrings *
3153 *************************************************/
3154
3155 /* This function is used by ${if}, ${lookup} and ${extract} to handle the
3156 alternative substrings that depend on whether or not the condition was true,
3157 or the lookup or extraction succeeded. The substrings always have to be
3158 expanded, to check their syntax, but "skipping" is set when the result is not
3159 needed - this avoids unnecessary nested lookups.
3160
3161 Arguments:
3162 skipping TRUE if we were skipping when this item was reached
3163 yes TRUE if the first string is to be used, else use the second
3164 save_lookup a value to put back into lookup_value before the 2nd expansion
3165 sptr points to the input string pointer
3166 yieldptr points to the output string pointer
3167 sizeptr points to the output string size
3168 ptrptr points to the output string pointer
3169 type "lookup", "if", "extract", "run", "env", "listextract" or
3170 "certextract" for error message
3171 resetok if not NULL, pointer to flag - write FALSE if unsafe to reset
3172 the store.
3173
3174 Returns: 0 OK; lookup_value has been reset to save_lookup
3175 1 expansion failed
3176 2 expansion failed because of bracketing error
3177 */
3178
3179 static int
3180 process_yesno(BOOL skipping, BOOL yes, uschar *save_lookup, const uschar **sptr,
3181 uschar **yieldptr, int *sizeptr, int *ptrptr, uschar *type, BOOL *resetok)
3182 {
3183 int rc = 0;
3184 const uschar *s = *sptr; /* Local value */
3185 uschar *sub1, *sub2;
3186 const uschar * errwhere;
3187
3188 /* If there are no following strings, we substitute the contents of $value for
3189 lookups and for extractions in the success case. For the ${if item, the string
3190 "true" is substituted. In the fail case, nothing is substituted for all three
3191 items. */
3192
3193 while (isspace(*s)) s++;
3194 if (*s == '}')
3195 {
3196 if (!skipping)
3197 if (type[0] == 'i')
3198 {
3199 if (yes) *yieldptr = string_catn(*yieldptr, sizeptr, ptrptr, US"true", 4);
3200 }
3201 else
3202 {
3203 if (yes && lookup_value)
3204 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, lookup_value);
3205 lookup_value = save_lookup;
3206 }
3207 s++;
3208 goto RETURN;
3209 }
3210
3211 /* The first following string must be braced. */
3212
3213 if (*s++ != '{')
3214 {
3215 errwhere = US"'yes' part did not start with '{'";
3216 goto FAILED_CURLY;
3217 }
3218
3219 /* Expand the first substring. Forced failures are noticed only if we actually
3220 want this string. Set skipping in the call in the fail case (this will always
3221 be the case if we were already skipping). */
3222
3223 sub1 = expand_string_internal(s, TRUE, &s, !yes, TRUE, resetok);
3224 if (sub1 == NULL && (yes || !expand_string_forcedfail)) goto FAILED;
3225 expand_string_forcedfail = FALSE;
3226 if (*s++ != '}')
3227 {
3228 errwhere = US"'yes' part did not end with '}'";
3229 goto FAILED_CURLY;
3230 }
3231
3232 /* If we want the first string, add it to the output */
3233
3234 if (yes)
3235 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, sub1);
3236
3237 /* If this is called from a lookup/env or a (cert)extract, we want to restore
3238 $value to what it was at the start of the item, so that it has this value
3239 during the second string expansion. For the call from "if" or "run" to this
3240 function, save_lookup is set to lookup_value, so that this statement does
3241 nothing. */
3242
3243 lookup_value = save_lookup;
3244
3245 /* There now follows either another substring, or "fail", or nothing. This
3246 time, forced failures are noticed only if we want the second string. We must
3247 set skipping in the nested call if we don't want this string, or if we were
3248 already skipping. */
3249
3250 while (isspace(*s)) s++;
3251 if (*s == '{')
3252 {
3253 sub2 = expand_string_internal(s+1, TRUE, &s, yes || skipping, TRUE, resetok);
3254 if (sub2 == NULL && (!yes || !expand_string_forcedfail)) goto FAILED;
3255 expand_string_forcedfail = FALSE;
3256 if (*s++ != '}')
3257 {
3258 errwhere = US"'no' part did not start with '{'";
3259 goto FAILED_CURLY;
3260 }
3261
3262 /* If we want the second string, add it to the output */
3263
3264 if (!yes)
3265 *yieldptr = string_cat(*yieldptr, sizeptr, ptrptr, sub2);
3266 }
3267
3268 /* If there is no second string, but the word "fail" is present when the use of
3269 the second string is wanted, set a flag indicating it was a forced failure
3270 rather than a syntactic error. Swallow the terminating } in case this is nested
3271 inside another lookup or if or extract. */
3272
3273 else if (*s != '}')
3274 {
3275 uschar name[256];
3276 /* deconst cast ok here as source is s anyway */
3277 s = US read_name(name, sizeof(name), s, US"_");
3278 if (Ustrcmp(name, "fail") == 0)
3279 {
3280 if (!yes && !skipping)
3281 {
3282 while (isspace(*s)) s++;
3283 if (*s++ != '}')
3284 {
3285 errwhere = US"did not close with '}' after forcedfail";
3286 goto FAILED_CURLY;
3287 }
3288 expand_string_message =
3289 string_sprintf("\"%s\" failed and \"fail\" requested", type);
3290 expand_string_forcedfail = TRUE;
3291 goto FAILED;
3292 }
3293 }
3294 else
3295 {
3296 expand_string_message =
3297 string_sprintf("syntax error in \"%s\" item - \"fail\" expected", type);
3298 goto FAILED;
3299 }
3300 }
3301
3302 /* All we have to do now is to check on the final closing brace. */
3303
3304 while (isspace(*s)) s++;
3305 if (*s++ != '}')
3306 {
3307 errwhere = US"did not close with '}'";
3308 goto FAILED_CURLY;
3309 }
3310
3311
3312 RETURN:
3313 /* Update the input pointer value before returning */
3314 *sptr = s;
3315 return rc;
3316
3317 FAILED_CURLY:
3318 /* Get here if there is a bracketing failure */
3319 expand_string_message = string_sprintf(
3320 "curly-bracket problem in conditional yes/no parsing: %s\n"
3321 " remaining string is '%s'", errwhere, --s);
3322 rc = 2;
3323 goto RETURN;
3324
3325 FAILED:
3326 /* Get here for other failures */
3327 rc = 1;
3328 goto RETURN;
3329 }
3330
3331
3332
3333
3334 /*************************************************
3335 * Handle MD5 or SHA-1 computation for HMAC *
3336 *************************************************/
3337
3338 /* These are some wrapping functions that enable the HMAC code to be a bit
3339 cleaner. A good compiler will spot the tail recursion.
3340
3341 Arguments:
3342 type HMAC_MD5 or HMAC_SHA1
3343 remaining are as for the cryptographic hash functions
3344
3345 Returns: nothing
3346 */
3347
3348 static void
3349 chash_start(int type, void *base)
3350 {
3351 if (type == HMAC_MD5)
3352 md5_start((md5 *)base);
3353 else
3354 sha1_start((hctx *)base);
3355 }
3356
3357 static void
3358 chash_mid(int type, void *base, uschar *string)
3359 {
3360 if (type == HMAC_MD5)
3361 md5_mid((md5 *)base, string);
3362 else
3363 sha1_mid((hctx *)base, string);
3364 }
3365
3366 static void
3367 chash_end(int type, void *base, uschar *string, int length, uschar *digest)
3368 {
3369 if (type == HMAC_MD5)
3370 md5_end((md5 *)base, string, length, digest);
3371 else
3372 sha1_end((hctx *)base, string, length, digest);
3373 }
3374
3375
3376
3377
3378
3379 /********************************************************
3380 * prvs: Get last three digits of days since Jan 1, 1970 *
3381 ********************************************************/
3382
3383 /* This is needed to implement the "prvs" BATV reverse
3384 path signing scheme
3385
3386 Argument: integer "days" offset to add or substract to
3387 or from the current number of days.
3388
3389 Returns: pointer to string containing the last three
3390 digits of the number of days since Jan 1, 1970,
3391 modified by the offset argument, NULL if there
3392 was an error in the conversion.
3393
3394 */
3395
3396 static uschar *
3397 prvs_daystamp(int day_offset)
3398 {
3399 uschar *days = store_get(32); /* Need at least 24 for cases */
3400 (void)string_format(days, 32, TIME_T_FMT, /* where TIME_T_FMT is %lld */
3401 (time(NULL) + day_offset*86400)/86400);
3402 return (Ustrlen(days) >= 3) ? &days[Ustrlen(days)-3] : US"100";
3403 }
3404
3405
3406
3407 /********************************************************
3408 * prvs: perform HMAC-SHA1 computation of prvs bits *
3409 ********************************************************/
3410
3411 /* This is needed to implement the "prvs" BATV reverse
3412 path signing scheme
3413
3414 Arguments:
3415 address RFC2821 Address to use
3416 key The key to use (must be less than 64 characters
3417 in size)
3418 key_num Single-digit key number to use. Defaults to
3419 '0' when NULL.
3420
3421 Returns: pointer to string containing the first three
3422 bytes of the final hash in hex format, NULL if
3423 there was an error in the process.
3424 */
3425
3426 static uschar *
3427 prvs_hmac_sha1(uschar *address, uschar *key, uschar *key_num, uschar *daystamp)
3428 {
3429 uschar *hash_source, *p;
3430 int size = 0,offset = 0,i;
3431 hctx h;
3432 uschar innerhash[20];
3433 uschar finalhash[20];
3434 uschar innerkey[64];
3435 uschar outerkey[64];
3436 uschar *finalhash_hex = store_get(40);
3437
3438 if (key_num == NULL)
3439 key_num = US"0";
3440
3441 if (Ustrlen(key) > 64)
3442 return NULL;
3443
3444 hash_source = string_catn(NULL, &size, &offset, key_num, 1);
3445 hash_source = string_catn(hash_source, &size, &offset, daystamp, 3);
3446 hash_source = string_cat(hash_source, &size, &offset, address);
3447 hash_source[offset] = '\0';
3448
3449 DEBUG(D_expand) debug_printf("prvs: hash source is '%s'\n", hash_source);
3450
3451 memset(innerkey, 0x36, 64);
3452 memset(outerkey, 0x5c, 64);
3453
3454 for (i = 0; i < Ustrlen(key); i++)
3455 {
3456 innerkey[i] ^= key[i];
3457 outerkey[i] ^= key[i];
3458 }
3459
3460 chash_start(HMAC_SHA1, &h);
3461 chash_mid(HMAC_SHA1, &h, innerkey);
3462 chash_end(HMAC_SHA1, &h, hash_source, offset, innerhash);
3463
3464 chash_start(HMAC_SHA1, &h);
3465 chash_mid(HMAC_SHA1, &h, outerkey);
3466 chash_end(HMAC_SHA1, &h, innerhash, 20, finalhash);
3467
3468 p = finalhash_hex;
3469 for (i = 0; i < 3; i++)
3470 {
3471 *p++ = hex_digits[(finalhash[i] & 0xf0) >> 4];
3472 *p++ = hex_digits[finalhash[i] & 0x0f];
3473 }
3474 *p = '\0';
3475
3476 return finalhash_hex;
3477 }
3478
3479
3480
3481
3482 /*************************************************
3483 * Join a file onto the output string *
3484 *************************************************/
3485
3486 /* This is used for readfile/readsock and after a run expansion.
3487 It joins the contents of a file onto the output string, globally replacing
3488 newlines with a given string (optionally).
3489
3490 Arguments:
3491 f the FILE
3492 yield pointer to the expandable string
3493 sizep pointer to the current size
3494 ptrp pointer to the current position
3495 eol newline replacement string, or NULL
3496
3497 Returns: new value of string pointer
3498 */
3499
3500 static uschar *
3501 cat_file(FILE *f, uschar *yield, int *sizep, int *ptrp, uschar *eol)
3502 {
3503 uschar buffer[1024];
3504
3505 while (Ufgets(buffer, sizeof(buffer), f))
3506 {
3507 int len = Ustrlen(buffer);
3508 if (eol && buffer[len-1] == '\n') len--;
3509 yield = string_catn(yield, sizep, ptrp, buffer, len);
3510 if (eol && buffer[len])
3511 yield = string_cat(yield, sizep, ptrp, eol);
3512 }
3513
3514 if (yield) yield[*ptrp] = 0;
3515
3516 return yield;
3517 }
3518
3519
3520
3521
3522 /*************************************************
3523 * Evaluate numeric expression *
3524 *************************************************/
3525
3526 /* This is a set of mutually recursive functions that evaluate an arithmetic
3527 expression involving + - * / % & | ^ ~ << >> and parentheses. The only one of
3528 these functions that is called from elsewhere is eval_expr, whose interface is:
3529
3530 Arguments:
3531 sptr pointer to the pointer to the string - gets updated
3532 decimal TRUE if numbers are to be assumed decimal
3533 error pointer to where to put an error message - must be NULL on input
3534 endket TRUE if ')' must terminate - FALSE for external call
3535
3536 Returns: on success: the value of the expression, with *error still NULL
3537 on failure: an undefined value, with *error = a message
3538 */
3539
3540 static int_eximarith_t eval_op_or(uschar **, BOOL, uschar **);
3541
3542
3543 static int_eximarith_t
3544 eval_expr(uschar **sptr, BOOL decimal, uschar **error, BOOL endket)
3545 {
3546 uschar *s = *sptr;
3547 int_eximarith_t x = eval_op_or(&s, decimal, error);
3548 if (*error == NULL)
3549 {
3550 if (endket)
3551 {
3552 if (*s != ')')
3553 *error = US"expecting closing parenthesis";
3554 else
3555 while (isspace(*(++s)));
3556 }
3557 else if (*s != 0) *error = US"expecting operator";
3558 }
3559 *sptr = s;
3560 return x;
3561 }
3562
3563
3564 static int_eximarith_t
3565 eval_number(uschar **sptr, BOOL decimal, uschar **error)
3566 {
3567 register int c;
3568 int_eximarith_t n;
3569 uschar *s = *sptr;
3570 while (isspace(*s)) s++;
3571 c = *s;
3572 if (isdigit(c))
3573 {
3574 int count;
3575 (void)sscanf(CS s, (decimal? SC_EXIM_DEC "%n" : SC_EXIM_ARITH "%n"), &n, &count);
3576 s += count;
3577 switch (tolower(*s))
3578 {
3579 default: break;
3580 case 'k': n *= 1024; s++; break;
3581 case 'm': n *= 1024*1024; s++; break;
3582 case 'g': n *= 1024*1024*1024; s++; break;
3583 }
3584 while (isspace (*s)) s++;
3585 }
3586 else if (c == '(')
3587 {
3588 s++;
3589 n = eval_expr(&s, decimal, error, 1);
3590 }
3591 else
3592 {
3593 *error = US"expecting number or opening parenthesis";
3594 n = 0;
3595 }
3596 *sptr = s;
3597 return n;
3598 }
3599
3600
3601 static int_eximarith_t
3602 eval_op_unary(uschar **sptr, BOOL decimal, uschar **error)
3603 {
3604 uschar *s = *sptr;
3605 int_eximarith_t x;
3606 while (isspace(*s)) s++;
3607 if (*s == '+' || *s == '-' || *s == '~')
3608 {
3609 int op = *s++;
3610 x = eval_op_unary(&s, decimal, error);
3611 if (op == '-') x = -x;
3612 else if (op == '~') x = ~x;
3613 }
3614 else
3615 {
3616 x = eval_number(&s, decimal, error);
3617 }
3618 *sptr = s;
3619 return x;
3620 }
3621
3622
3623 static int_eximarith_t
3624 eval_op_mult(uschar **sptr, BOOL decimal, uschar **error)
3625 {
3626 uschar *s = *sptr;
3627 int_eximarith_t x = eval_op_unary(&s, decimal, error);
3628 if (*error == NULL)
3629 {
3630 while (*s == '*' || *s == '/' || *s == '%')
3631 {
3632 int op = *s++;
3633 int_eximarith_t y = eval_op_unary(&s, decimal, error);
3634 if (*error != NULL) break;
3635 /* SIGFPE both on div/mod by zero and on INT_MIN / -1, which would give
3636 * a value of INT_MAX+1. Note that INT_MIN * -1 gives INT_MIN for me, which
3637 * is a bug somewhere in [gcc 4.2.1, FreeBSD, amd64]. In fact, -N*-M where
3638 * -N*M is INT_MIN will yield INT_MIN.
3639 * Since we don't support floating point, this is somewhat simpler.
3640 * Ideally, we'd return an error, but since we overflow for all other
3641 * arithmetic, consistency suggests otherwise, but what's the correct value
3642 * to use? There is none.
3643 * The C standard guarantees overflow for unsigned arithmetic but signed
3644 * overflow invokes undefined behaviour; in practice, this is overflow
3645 * except for converting INT_MIN to INT_MAX+1. We also can't guarantee
3646 * that long/longlong larger than int are available, or we could just work
3647 * with larger types. We should consider whether to guarantee 32bit eval
3648 * and 64-bit working variables, with errors returned. For now ...
3649 * So, the only SIGFPEs occur with a non-shrinking div/mod, thus -1; we
3650 * can just let the other invalid results occur otherwise, as they have
3651 * until now. For this one case, we can coerce.
3652 */
3653 if (y == -1 && x == EXIM_ARITH_MIN && op != '*')
3654 {
3655 DEBUG(D_expand)
3656 debug_printf("Integer exception dodging: " PR_EXIM_ARITH "%c-1 coerced to " PR_EXIM_ARITH "\n",
3657 EXIM_ARITH_MIN, op, EXIM_ARITH_MAX);
3658 x = EXIM_ARITH_MAX;
3659 continue;
3660 }
3661 if (op == '*')
3662 x *= y;
3663 else
3664 {
3665 if (y == 0)
3666 {
3667 *error = (op == '/') ? US"divide by zero" : US"modulo by zero";
3668 x = 0;
3669 break;
3670 }
3671 if (op == '/')
3672 x /= y;
3673 else
3674 x %= y;
3675 }
3676 }
3677 }
3678 *sptr = s;
3679 return x;
3680 }
3681
3682
3683 static int_eximarith_t
3684 eval_op_sum(uschar **sptr, BOOL decimal, uschar **error)
3685 {
3686 uschar *s = *sptr;
3687 int_eximarith_t x = eval_op_mult(&s, decimal, error);
3688 if (!*error)
3689 {
3690 while (*s == '+' || *s == '-')
3691 {
3692 int op = *s++;
3693 int_eximarith_t y = eval_op_mult(&s, decimal, error);
3694 if (*error) break;
3695 if ( (x >= EXIM_ARITH_MAX/2 && x >= EXIM_ARITH_MAX/2)
3696 || (x <= -(EXIM_ARITH_MAX/2) && y <= -(EXIM_ARITH_MAX/2)))
3697 { /* over-conservative check */
3698 *error = op == '+'
3699 ? US"overflow in sum" : US"overflow in difference";
3700 break;
3701 }
3702 if (op == '+') x += y; else x -= y;
3703 }
3704 }
3705 *sptr = s;
3706 return x;
3707 }
3708
3709
3710 static int_eximarith_t
3711 eval_op_shift(uschar **sptr, BOOL decimal, uschar **error)
3712 {
3713 uschar *s = *sptr;
3714 int_eximarith_t x = eval_op_sum(&s, decimal, error);
3715 if (*error == NULL)
3716 {
3717 while ((*s == '<' || *s == '>') && s[1] == s[0])
3718 {
3719 int_eximarith_t y;
3720 int op = *s++;
3721 s++;
3722 y = eval_op_sum(&s, decimal, error);
3723 if (*error != NULL) break;
3724 if (op == '<') x <<= y; else x >>= y;
3725 }
3726 }
3727 *sptr = s;
3728 return x;
3729 }
3730
3731
3732 static int_eximarith_t
3733 eval_op_and(uschar **sptr, BOOL decimal, uschar **error)
3734 {
3735 uschar *s = *sptr;
3736 int_eximarith_t x = eval_op_shift(&s, decimal, error);
3737 if (*error == NULL)
3738 {
3739 while (*s == '&')
3740 {
3741 int_eximarith_t y;
3742 s++;
3743 y = eval_op_shift(&s, decimal, error);
3744 if (*error != NULL) break;
3745 x &= y;
3746 }
3747 }
3748 *sptr = s;
3749 return x;
3750 }
3751
3752
3753 static int_eximarith_t
3754 eval_op_xor(uschar **sptr, BOOL decimal, uschar **error)
3755 {
3756 uschar *s = *sptr;
3757 int_eximarith_t x = eval_op_and(&s, decimal, error);
3758 if (*error == NULL)
3759 {
3760 while (*s == '^')
3761 {
3762 int_eximarith_t y;
3763 s++;
3764 y = eval_op_and(&s, decimal, error);
3765 if (*error != NULL) break;
3766 x ^= y;
3767 }
3768 }
3769 *sptr = s;
3770 return x;
3771 }
3772
3773
3774 static int_eximarith_t
3775 eval_op_or(uschar **sptr, BOOL decimal, uschar **error)
3776 {
3777 uschar *s = *sptr;
3778 int_eximarith_t x = eval_op_xor(&s, decimal, error);
3779 if (*error == NULL)
3780 {
3781 while (*s == '|')
3782 {
3783 int_eximarith_t y;
3784 s++;
3785 y = eval_op_xor(&s, decimal, error);
3786 if (*error != NULL) break;
3787 x |= y;
3788 }
3789 }
3790 *sptr = s;
3791 return x;
3792 }
3793
3794
3795
3796 /*************************************************
3797 * Expand string *
3798 *************************************************/
3799
3800 /* Returns either an unchanged string, or the expanded string in stacking pool
3801 store. Interpreted sequences are:
3802
3803 \... normal escaping rules
3804 $name substitutes the variable
3805 ${name} ditto
3806 ${op:string} operates on the expanded string value
3807 ${item{arg1}{arg2}...} expands the args and then does the business
3808 some literal args are not enclosed in {}
3809
3810 There are now far too many operators and item types to make it worth listing
3811 them here in detail any more.
3812
3813 We use an internal routine recursively to handle embedded substrings. The
3814 external function follows. The yield is NULL if the expansion failed, and there
3815 are two cases: if something collapsed syntactically, or if "fail" was given
3816 as the action on a lookup failure. These can be distinguished by looking at the
3817 variable expand_string_forcedfail, which is TRUE in the latter case.
3818
3819 The skipping flag is set true when expanding a substring that isn't actually
3820 going to be used (after "if" or "lookup") and it prevents lookups from
3821 happening lower down.
3822
3823 Store usage: At start, a store block of the length of the input plus 64
3824 is obtained. This is expanded as necessary by string_cat(), which might have to
3825 get a new block, or might be able to expand the original. At the end of the
3826 function we can release any store above that portion of the yield block that
3827 was actually used. In many cases this will be optimal.
3828
3829 However: if the first item in the expansion is a variable name or header name,
3830 we reset the store before processing it; if the result is in fresh store, we
3831 use that without copying. This is helpful for expanding strings like
3832 $message_headers which can get very long.
3833
3834 There's a problem if a ${dlfunc item has side-effects that cause allocation,
3835 since resetting the store at the end of the expansion will free store that was
3836 allocated by the plugin code as well as the slop after the expanded string. So
3837 we skip any resets if ${dlfunc } has been used. The same applies for ${acl }
3838 and, given the acl condition, ${if }. This is an unfortunate consequence of
3839 string expansion becoming too powerful.
3840
3841 Arguments:
3842 string the string to be expanded
3843 ket_ends true if expansion is to stop at }
3844 left if not NULL, a pointer to the first character after the
3845 expansion is placed here (typically used with ket_ends)
3846 skipping TRUE for recursive calls when the value isn't actually going
3847 to be used (to allow for optimisation)
3848 honour_dollar TRUE if $ is to be expanded,
3849 FALSE if it's just another character
3850 resetok_p if not NULL, pointer to flag - write FALSE if unsafe to reset
3851 the store.
3852
3853 Returns: NULL if expansion fails:
3854 expand_string_forcedfail is set TRUE if failure was forced
3855 expand_string_message contains a textual error message
3856 a pointer to the expanded string on success
3857 */
3858
3859 static uschar *
3860 expand_string_internal(const uschar *string, BOOL ket_ends, const uschar **left,
3861 BOOL skipping, BOOL honour_dollar, BOOL *resetok_p)
3862 {
3863 int ptr = 0;
3864 int size = Ustrlen(string)+ 64;
3865 uschar *yield = store_get(size);
3866 int item_type;
3867 const uschar *s = string;
3868 uschar *save_expand_nstring[EXPAND_MAXN+1];
3869 int save_expand_nlength[EXPAND_MAXN+1];
3870 BOOL resetok = TRUE;
3871
3872 DEBUG(D_expand)
3873 debug_printf("%s: %s\n", skipping ? " scanning" : "considering", string);
3874
3875 expand_string_forcedfail = FALSE;
3876 expand_string_message = US"";
3877
3878 while (*s != 0)
3879 {
3880 uschar *value;
3881 uschar name[256];
3882
3883 /* \ escapes the next character, which must exist, or else
3884 the expansion fails. There's a special escape, \N, which causes
3885 copying of the subject verbatim up to the next \N. Otherwise,
3886 the escapes are the standard set. */
3887
3888 if (*s == '\\')
3889 {
3890 if (s[1] == 0)
3891 {
3892 expand_string_message = US"\\ at end of string";
3893 goto EXPAND_FAILED;
3894 }
3895
3896 if (s[1] == 'N')
3897 {
3898 const uschar * t = s + 2;
3899 for (s = t; *s != 0; s++) if (*s == '\\' && s[1] == 'N') break;
3900 yield = string_catn(yield, &size, &ptr, t, s - t);
3901 if (*s != 0) s += 2;
3902 }
3903
3904 else
3905 {
3906 uschar ch[1];
3907 ch[0] = string_interpret_escape(&s);
3908 s++;
3909 yield = string_catn(yield, &size, &ptr, ch, 1);
3910 }
3911
3912 continue;
3913 }
3914
3915 /*{*/
3916 /* Anything other than $ is just copied verbatim, unless we are
3917 looking for a terminating } character. */
3918
3919 /*{*/
3920 if (ket_ends && *s == '}') break;
3921
3922 if (*s != '$' || !honour_dollar)
3923 {
3924 yield = string_catn(yield, &size, &ptr, s++, 1);
3925 continue;
3926 }
3927
3928 /* No { after the $ - must be a plain name or a number for string
3929 match variable. There has to be a fudge for variables that are the
3930 names of header fields preceded by "$header_" because header field
3931 names can contain any printing characters except space and colon.
3932 For those that don't like typing this much, "$h_" is a synonym for
3933 "$header_". A non-existent header yields a NULL value; nothing is
3934 inserted. */ /*}*/
3935
3936 if (isalpha((*(++s))))
3937 {
3938 int len;
3939 int newsize = 0;
3940
3941 s = read_name(name, sizeof(name), s, US"_");
3942
3943 /* If this is the first thing to be expanded, release the pre-allocated
3944 buffer. */
3945
3946 if (ptr == 0 && yield != NULL)
3947 {
3948 if (resetok) store_reset(yield