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