1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
/*
* Copyright (c) 2000-2001 Proofpoint, Inc. and its suppliers.
* All rights reserved.
*
* By using this file, you agree to the terms and conditions set
* forth in the LICENSE file which can be found at the top level of
* the sendmail distribution.
*
*/
/*
* Copyright (c) 1995, 1996, 1997, 1998, 1999 Kungliga Tekniska Högskolan
* (Royal Institute of Technology, Stockholm, Sweden).
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the Institute nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* $Id: sm_resolve.h,v 8.9 2013-11-22 20:51:56 ca Exp $ */
#ifndef SM_RESOLVE_H
#define SM_RESOLVE_H
#if DNSMAP || DANE
/* We use these, but they are not always present in <arpa/nameser.h> */
# ifndef T_TXT
# define T_TXT 16
# endif
# ifndef T_AFSDB
# define T_AFSDB 18
# endif
# ifndef T_SRV
# define T_SRV 33
# endif
# ifndef T_NAPTR
# define T_NAPTR 35
# endif
# ifndef T_RRSIG
# define T_RRSIG 46
# endif
# ifndef T_TLSA
# define T_TLSA 52
# endif
typedef struct
{
char *dns_q_domain;
unsigned int dns_q_type;
unsigned int dns_q_class;
} DNS_QUERY_T;
typedef struct
{
unsigned int mx_r_preference;
char mx_r_domain[1];
} MX_RECORD_T;
typedef struct
{
unsigned int srv_r_priority;
unsigned int srv_r_weight;
unsigned int srv_r_port;
char srv_r_target[1];
} SRV_RECORDT_T;
typedef struct resource_record RESOURCE_RECORD_T;
struct resource_record
{
char *rr_domain;
unsigned int rr_type;
unsigned int rr_class;
unsigned int rr_ttl;
unsigned int rr_size;
union
{
void *rr_data;
MX_RECORD_T *rr_mx;
MX_RECORD_T *rr_afsdb; /* mx and afsdb are identical */
SRV_RECORDT_T *rr_srv;
# if NETINET
struct in_addr *rr_a;
# endif
# if NETINET6
struct in6_addr *rr_aaaa;
# endif
char *rr_txt;
} rr_u;
RESOURCE_RECORD_T *rr_next;
};
# if !defined(T_A) && !defined(T_AAAA)
/* XXX if <arpa/nameser.h> isn't included */
typedef int HEADER; /* will never be used */
# endif
typedef struct
{
HEADER dns_r_h;
DNS_QUERY_T dns_r_q;
RESOURCE_RECORD_T *dns_r_head;
} DNS_REPLY_T;
#define SM_DNS_FL_EDNS0 0x01
#define SM_DNS_FL_DNSSEC 0x02
/* flags for parse_dns_reply() et.al. */
#define RR_AS_TEXT 0x01 /* convert some RRs to text, e.g., TLSA */
#define RR_RAW 0x02 /* return some RRs as "raw" data */
/* currently not used (set, but not read) */
#define RR_NO_CNAME 0x04 /* do not try CNAME lookup */
#define RR_ONLY_CNAME 0x08 /* if !RR_NO_CNAME" return only CNAME */
extern void dns_free_data __P((DNS_REPLY_T *));
extern int dns_string_to_type __P((const char *));
extern const char *dns_type_to_string __P((int));
extern DNS_REPLY_T *dns_lookup_map __P((const char *, int, int, time_t,
int, unsigned int));
extern DNS_REPLY_T *dns_lookup_int __P((const char *, int, int, time_t,
int, unsigned int, unsigned int, int *, int *));
# if 0
extern DNS_REPLY_T *dns_lookup __P((const char *domain,
const char *type_name,
time_t retrans,
int retry));
# endif /* 0 */
# if DANE
struct hostent *dns2he __P((DNS_REPLY_T *, int));
# endif
/* what to do if family is not supported? add SM_ASSERT()? */
#define FAM2T_(family) (((family) == AF_INET) ? T_A : T_AAAA)
# if DNSSEC_TEST
const char *herrno2txt __P((int));
int setherrnofromstring __P((const char *, int *));
int getttlfromstring __P((const char *));
int tstdns_search __P((const char *, int, int, u_char *, int));
int tstdns_querydomain __P((const char *, const char *, int, int, unsigned char *, int));
# endif /* DNSSEC_TEST*/
#ifndef RES_TRUSTAD
# define RES_TRUSTAD 0
#endif
#define SM_RES_DNSSEC (RES_USE_EDNS0|RES_USE_DNSSEC|RES_TRUSTAD)
#endif /* DNSMAP || DANE */
#if DNSSEC_TEST || _FFR_NAMESERVER
# ifdef _DEFINE_SMR_GLOBALS
# define SMR_EXTERN
# else
# define SMR_EXTERN extern
# endif
SMR_EXTERN char *NameSearchList;
# undef SMR_EXTERN
extern int nsportip __P((char *));
#endif /* DNSSEC_TEST || _FFR_NAMESERVER */
#endif /* ! SM_RESOLVE_H */
|
