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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
|
/* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* lib/krb5/os/dnssrv.c - Perform DNS SRV queries */
/*
* Copyright 1990,2000,2001,2002,2003 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original M.I.T. software.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*/
#include "autoconf.h"
#ifdef KRB5_DNS_LOOKUP
#include "k5-int.h"
#include "os-proto.h"
/*
* Lookup a KDC via DNS SRV records
*/
void
krb5int_free_srv_dns_data (struct srv_dns_entry *p)
{
struct srv_dns_entry *next;
while (p) {
next = p->next;
free(p->host);
free(p);
p = next;
}
}
/* Construct a DNS label of the form "service.[protocol.]realm.". protocol may
* be NULL. */
static char *
make_lookup_name(const krb5_data *realm, const char *service,
const char *protocol)
{
struct k5buf buf;
if (memchr(realm->data, 0, realm->length))
return NULL;
k5_buf_init_dynamic(&buf);
k5_buf_add_fmt(&buf, "%s.", service);
if (protocol != NULL)
k5_buf_add_fmt(&buf, "%s.", protocol);
k5_buf_add_len(&buf, realm->data, realm->length);
/*
* Realm names don't (normally) end with ".", but if the query doesn't end
* with "." and doesn't get an answer as is, the resolv code will try
* appending the local domain. Since the realm names are absolutes, let's
* stop that.
*/
if (buf.len > 0 && ((char *)buf.data)[buf.len - 1] != '.')
k5_buf_add(&buf, ".");
return buf.data;
}
/* Insert new into the list *head, ordering by priority. Weight is not
* currently used. */
static void
place_srv_entry(struct srv_dns_entry **head, struct srv_dns_entry *new)
{
struct srv_dns_entry *entry;
if (*head == NULL || (*head)->priority > new->priority) {
new->next = *head;
*head = new;
return;
}
for (entry = *head; entry != NULL; entry = entry->next) {
/*
* Insert an entry into the next spot if there is no next entry (we're
* at the end), or if the next entry has a higher priority (lower
* priorities are preferred).
*/
if (entry->next == NULL || entry->next->priority > new->priority) {
new->next = entry->next;
entry->next = new;
break;
}
}
}
#ifdef _WIN32
#include <windns.h>
krb5_error_code
k5_make_uri_query(krb5_context context, const krb5_data *realm,
const char *service, struct srv_dns_entry **answers)
{
/* Windows does not currently support the URI record type or make it
* possible to query for a record type it does not have support for. */
*answers = NULL;
return 0;
}
krb5_error_code
krb5int_make_srv_query_realm(krb5_context context, const krb5_data *realm,
const char *service, const char *protocol,
struct srv_dns_entry **answers)
{
char *name = NULL;
DNS_STATUS st;
PDNS_RECORD records, rr;
struct srv_dns_entry *head = NULL, *srv = NULL;
*answers = NULL;
name = make_lookup_name(realm, service, protocol);
if (name == NULL)
return 0;
TRACE_DNS_SRV_SEND(context, name);
st = DnsQuery_UTF8(name, DNS_TYPE_SRV, DNS_QUERY_STANDARD, NULL, &records,
NULL);
if (st != ERROR_SUCCESS)
return 0;
for (rr = records; rr != NULL; rr = rr->pNext) {
if (rr->wType != DNS_TYPE_SRV)
continue;
srv = malloc(sizeof(struct srv_dns_entry));
if (srv == NULL)
goto cleanup;
srv->priority = rr->Data.SRV.wPriority;
srv->weight = rr->Data.SRV.wWeight;
srv->port = rr->Data.SRV.wPort;
/* Make sure the name looks fully qualified to the resolver. */
if (asprintf(&srv->host, "%s.", rr->Data.SRV.pNameTarget) < 0) {
free(srv);
goto cleanup;
}
TRACE_DNS_SRV_ANS(context, srv->host, srv->port, srv->priority,
srv->weight);
place_srv_entry(&head, srv);
}
cleanup:
free(name);
if (records != NULL)
DnsRecordListFree(records, DnsFreeRecordList);
*answers = head;
return 0;
}
#else /* _WIN32 */
#include "dnsglue.h"
/* Query the URI RR, collecting weight, priority, and target. */
krb5_error_code
k5_make_uri_query(krb5_context context, const krb5_data *realm,
const char *service, struct srv_dns_entry **answers)
{
const unsigned char *p = NULL, *base = NULL;
char *name = NULL;
int size, ret, rdlen;
unsigned short priority, weight;
struct krb5int_dns_state *ds = NULL;
struct srv_dns_entry *head = NULL, *uri = NULL;
*answers = NULL;
/* Construct service.realm. */
name = make_lookup_name(realm, service, NULL);
if (name == NULL)
return 0;
TRACE_DNS_URI_SEND(context, name);
size = krb5int_dns_init(&ds, name, C_IN, T_URI);
if (size < 0)
goto out;
for (;;) {
ret = krb5int_dns_nextans(ds, &base, &rdlen);
if (ret < 0 || base == NULL)
goto out;
p = base;
SAFE_GETUINT16(base, rdlen, p, 2, priority, out);
SAFE_GETUINT16(base, rdlen, p, 2, weight, out);
uri = k5alloc(sizeof(*uri), &ret);
if (uri == NULL)
goto out;
uri->priority = priority;
uri->weight = weight;
/* rdlen - 4 bytes remain after the priority and weight. */
uri->host = k5memdup0(p, rdlen - 4, &ret);
if (uri->host == NULL) {
free(uri);
goto out;
}
TRACE_DNS_URI_ANS(context, uri->host, uri->priority, uri->weight);
place_srv_entry(&head, uri);
}
out:
krb5int_dns_fini(ds);
free(name);
*answers = head;
return 0;
}
/*
* Do DNS SRV query, return results in *answers.
*
* Make a best effort to return all the data we can. On memory or decoding
* errors, just return what we've got. Always return 0, currently.
*/
krb5_error_code
krb5int_make_srv_query_realm(krb5_context context, const krb5_data *realm,
const char *service, const char *protocol,
struct srv_dns_entry **answers)
{
const unsigned char *p = NULL, *base = NULL;
char *name = NULL, host[MAXDNAME];
int size, ret, rdlen, nlen;
unsigned short priority, weight, port;
struct krb5int_dns_state *ds = NULL;
struct srv_dns_entry *head = NULL, *srv = NULL;
/*
* First off, build a query of the form:
*
* service.protocol.realm
*
* which will most likely be something like:
*
* _kerberos._udp.REALM
*
*/
name = make_lookup_name(realm, service, protocol);
if (name == NULL)
return 0;
TRACE_DNS_SRV_SEND(context, name);
size = krb5int_dns_init(&ds, name, C_IN, T_SRV);
if (size < 0)
goto out;
for (;;) {
ret = krb5int_dns_nextans(ds, &base, &rdlen);
if (ret < 0 || base == NULL)
goto out;
p = base;
SAFE_GETUINT16(base, rdlen, p, 2, priority, out);
SAFE_GETUINT16(base, rdlen, p, 2, weight, out);
SAFE_GETUINT16(base, rdlen, p, 2, port, out);
/*
* RFC 2782 says the target is never compressed in the reply;
* do we believe that? We need to flatten it anyway, though.
*/
nlen = krb5int_dns_expand(ds, p, host, sizeof(host));
if (nlen < 0 || !INCR_OK(base, rdlen, p, nlen))
goto out;
/*
* We got everything! Insert it into our list, but make sure
* it's in the right order. Right now we don't do anything
* with the weight field
*/
srv = malloc(sizeof(struct srv_dns_entry));
if (srv == NULL)
goto out;
srv->priority = priority;
srv->weight = weight;
srv->port = port;
/* The returned names are fully qualified. Don't let the
* local resolver code do domain search path stuff. */
if (asprintf(&srv->host, "%s.", host) < 0) {
free(srv);
goto out;
}
TRACE_DNS_SRV_ANS(context, srv->host, srv->port, srv->priority,
srv->weight);
place_srv_entry(&head, srv);
}
out:
krb5int_dns_fini(ds);
free(name);
*answers = head;
return 0;
}
#endif /* not _WIN32 */
#endif /* KRB5_DNS_LOOKUP */
|