summaryrefslogtreecommitdiffstats
path: root/tests/dns/dns64_test.c
blob: 58349918ed18a1ee5af3133699c8248ce5447a68 (plain)
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
/*
 * Copyright (C) Internet Systems Consortium, Inc. ("ISC")
 *
 * SPDX-License-Identifier: MPL-2.0
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
 *
 * See the COPYRIGHT file distributed with this work for additional
 * information regarding copyright ownership.
 */

#include <inttypes.h>
#include <sched.h> /* IWYU pragma: keep */
#include <setjmp.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

#define UNIT_TESTING
#include <cmocka.h>

#include <isc/netaddr.h>
#include <isc/result.h>
#include <isc/string.h>
#include <isc/util.h>

#include <dns/dns64.h>
#include <dns/rdata.h>
#include <dns/rdatalist.h>
#include <dns/rdataset.h>

#include <tests/dns.h>

static void
multiple_prefixes(void) {
	size_t i, count;
	/*
	 * Two prefix, non consectutive.
	 */
	unsigned char aaaa[4][16] = {
		{ 0, 0, 0, 0, 192, 0, 0, 170, 0, 0, 0, 0, 192, 0, 0, 171 },
		{ 0, 0, 0, 0, 192, 55, 0, 170, 0, 0, 0, 0, 192, 0, 0, 170 },
		{ 0, 0, 0, 0, 192, 0, 0, 170, 0, 0, 0, 0, 192, 0, 0, 170 },
		{ 0, 0, 0, 0, 192, 55, 0, 170, 0, 0, 0, 0, 192, 0, 0, 171 },
	};
	dns_rdataset_t rdataset;
	dns_rdatalist_t rdatalist;
	dns_rdata_t rdata[4] = { DNS_RDATA_INIT, DNS_RDATA_INIT, DNS_RDATA_INIT,
				 DNS_RDATA_INIT };
	isc_netprefix_t prefix[2];
	unsigned char p1[] = { 0, 0, 0, 0, 192, 0, 0, 170, 0, 0, 0, 0 };
	unsigned char p2[] = { 0, 0, 0, 0, 192, 55, 0, 170, 0, 0, 0, 0 };
	isc_result_t result;
	bool have_p1, have_p2;

	/*
	 * Construct AAAA rdataset containing 2 prefixes.
	 */
	dns_rdatalist_init(&rdatalist);
	for (i = 0; i < 4; i++) {
		isc_region_t region;
		region.base = aaaa[i];
		region.length = 16;
		dns_rdata_fromregion(&rdata[i], dns_rdataclass_in,
				     dns_rdatatype_aaaa, &region);
		ISC_LIST_APPEND(rdatalist.rdata, &rdata[i], link);
	}
	rdatalist.type = rdata[0].type;
	rdatalist.rdclass = rdata[0].rdclass;
	rdatalist.ttl = 0;
	dns_rdataset_init(&rdataset);
	result = dns_rdatalist_tordataset(&rdatalist, &rdataset);
	assert_int_equal(result, ISC_R_SUCCESS);

	count = ARRAY_SIZE(prefix);
	memset(&prefix, 0, sizeof(prefix));
	result = dns_dns64_findprefix(&rdataset, prefix, &count);
	assert_int_equal(result, ISC_R_SUCCESS);
	assert_int_equal(count, 2);
	have_p1 = have_p2 = false;
	for (i = 0; i < count; i++) {
		assert_int_equal(prefix[i].prefixlen, 96);
		assert_int_equal(prefix[i].addr.family, AF_INET6);
		if (memcmp(prefix[i].addr.type.in6.s6_addr, p1, 12) == 0) {
			have_p1 = true;
		}
		if (memcmp(prefix[i].addr.type.in6.s6_addr, p2, 12) == 0) {
			have_p2 = true;
		}
	}
	assert_true(have_p1);
	assert_true(have_p2);

	/*
	 * Check that insufficient prefix space returns ISC_R_NOSPACE
	 * and that the prefix is populated.
	 */
	count = 1;
	memset(&prefix, 0, sizeof(prefix));
	result = dns_dns64_findprefix(&rdataset, prefix, &count);
	assert_int_equal(result, ISC_R_NOSPACE);
	assert_int_equal(count, 2);
	have_p1 = have_p2 = false;
	assert_int_equal(prefix[0].prefixlen, 96);
	assert_int_equal(prefix[0].addr.family, AF_INET6);
	if (memcmp(prefix[0].addr.type.in6.s6_addr, p1, 12) == 0) {
		have_p1 = true;
	}
	if (memcmp(prefix[0].addr.type.in6.s6_addr, p2, 12) == 0) {
		have_p2 = true;
	}
	if (!have_p2) {
		assert_true(have_p1);
	}
	if (!have_p1) {
		assert_true(have_p2);
	}
	assert_true(have_p1 != have_p2);
}

ISC_RUN_TEST_IMPL(dns64_findprefix) {
	unsigned int i, j, o;
	isc_result_t result;
	struct {
		unsigned char prefix[12];
		unsigned int prefixlen;
		isc_result_t result;
	} tests[] = {
		/* The WKP with various lengths. */
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  32,
		  ISC_R_SUCCESS },
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  40,
		  ISC_R_SUCCESS },
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  48,
		  ISC_R_SUCCESS },
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  56,
		  ISC_R_SUCCESS },
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  64,
		  ISC_R_SUCCESS },
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 0, 0, 0, 0 },
		  96,
		  ISC_R_SUCCESS },
		/*
		 * Prefix with the mapped addresses also appearing in the
		 * prefix.
		 */
		{ { 0, 0, 0, 0, 192, 0, 0, 170, 0, 0, 0, 0 },
		  96,
		  ISC_R_SUCCESS },
		{ { 0, 0, 0, 0, 192, 0, 0, 171, 0, 0, 0, 0 },
		  96,
		  ISC_R_SUCCESS },
		/* Bad prefix, MBZ != 0. */
		{ { 0, 0x64, 0xff, 0x9b, 0, 0, 0, 0, 1, 0, 0, 0 },
		  96,
		  ISC_R_NOTFOUND },
	};

	for (i = 0; i < ARRAY_SIZE(tests); i++) {
		size_t count = 2;
		dns_rdataset_t rdataset;
		dns_rdatalist_t rdatalist;
		dns_rdata_t rdata[2] = { DNS_RDATA_INIT, DNS_RDATA_INIT };
		struct in6_addr ina6[2];
		isc_netprefix_t prefix[2];
		unsigned char aa[] = { 192, 0, 0, 170 };
		unsigned char ab[] = { 192, 0, 0, 171 };
		isc_region_t region;

		/*
		 * Construct rdata.
		 */
		memset(ina6[0].s6_addr, 0, sizeof(ina6[0].s6_addr));
		memset(ina6[1].s6_addr, 0, sizeof(ina6[1].s6_addr));
		memmove(ina6[0].s6_addr, tests[i].prefix, 12);
		memmove(ina6[1].s6_addr, tests[i].prefix, 12);
		o = tests[i].prefixlen / 8;
		for (j = 0; j < 4; j++) {
			if ((o + j) == 8U) {
				o++; /* skip mbz */
			}
			ina6[0].s6_addr[j + o] = aa[j];
			ina6[1].s6_addr[j + o] = ab[j];
		}
		region.base = ina6[0].s6_addr;
		region.length = sizeof(ina6[0].s6_addr);
		dns_rdata_fromregion(&rdata[0], dns_rdataclass_in,
				     dns_rdatatype_aaaa, &region);
		region.base = ina6[1].s6_addr;
		region.length = sizeof(ina6[1].s6_addr);
		dns_rdata_fromregion(&rdata[1], dns_rdataclass_in,
				     dns_rdatatype_aaaa, &region);

		dns_rdatalist_init(&rdatalist);
		rdatalist.type = rdata[0].type;
		rdatalist.rdclass = rdata[0].rdclass;
		rdatalist.ttl = 0;
		ISC_LIST_APPEND(rdatalist.rdata, &rdata[0], link);
		ISC_LIST_APPEND(rdatalist.rdata, &rdata[1], link);
		dns_rdataset_init(&rdataset);
		result = dns_rdatalist_tordataset(&rdatalist, &rdataset);
		assert_int_equal(result, ISC_R_SUCCESS);

		result = dns_dns64_findprefix(&rdataset, prefix, &count);
		assert_int_equal(result, tests[i].result);
		if (tests[i].result == ISC_R_SUCCESS) {
			assert_int_equal(count, 1);
			assert_int_equal(prefix[0].prefixlen,
					 tests[i].prefixlen);
			assert_int_equal(prefix[0].addr.family, AF_INET6);
			assert_memory_equal(prefix[0].addr.type.in6.s6_addr,
					    tests[i].prefix,
					    tests[i].prefixlen / 8);
		}
	}

	/*
	 * Test multiple prefixes.
	 */
	multiple_prefixes();
}

ISC_TEST_LIST_START
ISC_TEST_ENTRY(dns64_findprefix)
ISC_TEST_LIST_END

ISC_TEST_MAIN