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
|
/* $NetBSD: dns_rr.c,v 1.1.1.6 2006/07/19 01:17:20 rpaulo Exp $ */
/*++
/* NAME
/* dns_rr 3
/* SUMMARY
/* resource record memory and list management
/* SYNOPSIS
/* #include <dns.h>
/*
/* DNS_RR *dns_rr_create(qname, rname, type, class, ttl, preference,
/* data, data_len)
/* const char *qname;
/* const char *rname;
/* unsigned short type;
/* unsigned short class;
/* unsigned int ttl;
/* unsigned preference;
/* const char *data;
/* size_t data_len;
/*
/* void dns_rr_free(list)
/* DNS_RR *list;
/*
/* DNS_RR *dns_rr_copy(record)
/* DNS_RR *record;
/*
/* DNS_RR *dns_rr_append(list, record)
/* DNS_RR *list;
/* DNS_RR *record;
/*
/* DNS_RR *dns_rr_sort(list, compar)
/* DNS_RR *list
/* int (*compar)(DNS_RR *, DNS_RR *);
/*
/* int dns_rr_compare_pref(DNS_RR *a, DNS_RR *b)
/* DNS_RR *list
/* DNS_RR *list
/*
/* DNS_RR *dns_rr_shuffle(list)
/* DNS_RR *list;
/*
/* DNS_RR *dns_rr_remove(list, record)
/* DNS_RR *list;
/* DNS_RR *record;
/* DESCRIPTION
/* The routines in this module maintain memory for DNS resource record
/* information, and maintain lists of DNS resource records.
/*
/* dns_rr_create() creates and initializes one resource record.
/* The \fIqname\fR field specifies the query name.
/* The \fIrname\fR field specifies the reply name.
/* \fIpreference\fR is used for MX records; \fIdata\fR is a null
/* pointer or specifies optional resource-specific data;
/* \fIdata_len\fR is the amount of resource-specific data.
/*
/* dns_rr_free() releases the resource used by of zero or more
/* resource records.
/*
/* dns_rr_copy() makes a copy of a resource record.
/*
/* dns_rr_append() appends a resource record to a (list of) resource
/* record(s).
/* A null input list is explicitly allowed.
/*
/* dns_rr_sort() sorts a list of resource records into ascending
/* order according to a user-specified criterion. The result is the
/* sorted list.
/*
/* dns_rr_compare_pref() is a dns_rr_sort() helper to sort records
/* by their MX preference.
/*
/* dns_rr_shuffle() randomly permutes a list of resource records.
/*
/* dns_rr_remove() removes the specified record from the specified list.
/* The updated list is the result value.
/* The record MUST be a list member.
/* LICENSE
/* .ad
/* .fi
/* The Secure Mailer license must be distributed with this software.
/* AUTHOR(S)
/* Wietse Venema
/* IBM T.J. Watson Research
/* P.O. Box 704
/* Yorktown Heights, NY 10598, USA
/*--*/
/* System library. */
#include <sys_defs.h>
#include <string.h>
#include <stdlib.h>
/* Utility library. */
#include <msg.h>
#include <mymalloc.h>
#include <myrand.h>
/* DNS library. */
#include "dns.h"
/* dns_rr_create - fill in resource record structure */
DNS_RR *dns_rr_create(const char *qname, const char *rname,
ushort type, ushort class,
unsigned int ttl, unsigned pref,
const char *data, size_t data_len)
{
DNS_RR *rr;
rr = (DNS_RR *) mymalloc(sizeof(*rr) + data_len - 1);
rr->qname = mystrdup(qname);
rr->rname = mystrdup(rname);
rr->type = type;
rr->class = class;
rr->ttl = ttl;
rr->pref = pref;
if (data && data_len > 0)
memcpy(rr->data, data, data_len);
rr->data_len = data_len;
rr->next = 0;
return (rr);
}
/* dns_rr_free - destroy resource record structure */
void dns_rr_free(DNS_RR *rr)
{
if (rr) {
if (rr->next)
dns_rr_free(rr->next);
myfree(rr->qname);
myfree(rr->rname);
myfree((char *) rr);
}
}
/* dns_rr_copy - copy resource record */
DNS_RR *dns_rr_copy(DNS_RR *src)
{
ssize_t len = sizeof(*src) + src->data_len - 1;
DNS_RR *dst;
/*
* Combine struct assignment and data copy in one block copy operation.
*/
dst = (DNS_RR *) mymalloc(len);
memcpy((char *) dst, (char *) src, len);
dst->qname = mystrdup(src->qname);
dst->rname = mystrdup(src->rname);
dst->next = 0;
return (dst);
}
/* dns_rr_append - append resource record to list */
DNS_RR *dns_rr_append(DNS_RR *list, DNS_RR *rr)
{
if (list == 0) {
list = rr;
} else {
list->next = dns_rr_append(list->next, rr);
}
return (list);
}
/* dns_rr_compare_pref - compare resource records by preference */
int dns_rr_compare_pref(DNS_RR *a, DNS_RR *b)
{
if (a->pref != b->pref)
return (a->pref - b->pref);
#ifdef HAS_IPV6
if (a->type == b->type) /* 200412 */
return 0;
if (a->type == T_AAAA)
return (-1);
if (b->type == T_AAAA)
return (+1);
#endif
return 0;
}
/* dns_rr_sort_callback - glue function */
static int (*dns_rr_sort_user) (DNS_RR *, DNS_RR *);
static int dns_rr_sort_callback(const void *a, const void *b)
{
DNS_RR *aa = *(DNS_RR **) a;
DNS_RR *bb = *(DNS_RR **) b;
return (dns_rr_sort_user(aa, bb));
}
/* dns_rr_sort - sort resource record list */
DNS_RR *dns_rr_sort(DNS_RR *list, int (*compar) (DNS_RR *, DNS_RR *))
{
int (*saved_user) (DNS_RR *, DNS_RR *);
DNS_RR **rr_array;
DNS_RR *rr;
int len;
int i;
/*
* Save state and initialize.
*/
saved_user = dns_rr_sort_user;
dns_rr_sort_user = compar;
/*
* Build linear array with pointers to each list element.
*/
for (len = 0, rr = list; rr != 0; len++, rr = rr->next)
/* void */ ;
rr_array = (DNS_RR **) mymalloc(len * sizeof(*rr_array));
for (len = 0, rr = list; rr != 0; len++, rr = rr->next)
rr_array[len] = rr;
/*
* Sort by user-specified criterion.
*/
qsort((char *) rr_array, len, sizeof(*rr_array), dns_rr_sort_callback);
/*
* Fix the links.
*/
for (i = 0; i < len - 1; i++)
rr_array[i]->next = rr_array[i + 1];
rr_array[i]->next = 0;
list = rr_array[0];
/*
* Cleanup.
*/
myfree((char *) rr_array);
dns_rr_sort_user = saved_user;
return (list);
}
/* dns_rr_shuffle - shuffle resource record list */
DNS_RR *dns_rr_shuffle(DNS_RR *list)
{
DNS_RR **rr_array;
DNS_RR *rr;
int len;
int i;
int r;
/*
* Build linear array with pointers to each list element.
*/
for (len = 0, rr = list; rr != 0; len++, rr = rr->next)
/* void */ ;
rr_array = (DNS_RR **) mymalloc(len * sizeof(*rr_array));
for (len = 0, rr = list; rr != 0; len++, rr = rr->next)
rr_array[len] = rr;
/*
* Shuffle resource records.
*/
for (i = 0; i < len; i++) {
r = myrand() % len;
rr = rr_array[i];
rr_array[i] = rr_array[r];
rr_array[r] = rr;
}
/*
* Fix the links.
*/
for (i = 0; i < len - 1; i++)
rr_array[i]->next = rr_array[i + 1];
rr_array[i]->next = 0;
list = rr_array[0];
/*
* Cleanup.
*/
myfree((char *) rr_array);
return (list);
}
/* dns_rr_remove - remove record from list, return new list */
DNS_RR *dns_rr_remove(DNS_RR *list, DNS_RR *record)
{
if (list == 0)
msg_panic("dns_rr_remove: record not found");
if (list == record) {
list = record->next;
record->next = 0;
dns_rr_free(record);
} else {
list->next = dns_rr_remove(list->next, record);
}
return (list);
}
|