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