summaryrefslogtreecommitdiffstats
path: root/tests/lib/test_ntop.c
blob: 0a55ecddb8fbcb8816b9e2ebd60ce4d14a53c6d4 (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
/*
 * frr_inet_ntop() unit test
 * Copyright (C) 2019  David Lamparter
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the Free
 * Software Foundation; either version 2 of the License, or (at your option)
 * any later version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License for
 * more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; see the file COPYING; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <assert.h>

#include "tests/helpers/c/prng.h"

/* NB: libfrr is NOT linked for this unit test! */

#define INET_NTOP_NO_OVERRIDE
#include "lib/ntop.c"

int main(int argc, char **argv)
{
	size_t i, j, k, l;
	struct in_addr i4;
	struct in6_addr i6, i6check;
	char buf1[64], buf2[64];
	const char *rv;
	struct prng *prng;

	prng = prng_new(0);
	/* IPv4 */
	for (i = 0; i < 1000; i++) {
		i4.s_addr = prng_rand(prng);
		assert(frr_inet_ntop(AF_INET, &i4, buf1, sizeof(buf1)));
		assert(inet_ntop(AF_INET, &i4, buf2, sizeof(buf2)));
		assert(!strcmp(buf1, buf2));
	}

	/* check size limit */
	for (i = 0; i < sizeof(buf1); i++) {
		memset(buf2, 0xcc, sizeof(buf2));
		rv = frr_inet_ntop(AF_INET, &i4, buf2, i);
		if (i < strlen(buf1) + 1)
			assert(!rv);
		else
			assert(rv && !strcmp(buf1, buf2));
	}

	/* IPv6 */
	for (i = 0; i < 10000; i++) {
		uint16_t *i6w = (uint16_t *)&i6;
		for (j = 0; j < 8; j++)
			i6w[j] = prng_rand(prng);

		/* clear some words */
		l = prng_rand(prng) & 7;
		for (j = 0; j < l; j++) {
			uint32_t num = __builtin_ctz(prng_rand(prng));
			uint32_t where = prng_rand(prng) & 7;

			for (k = where; k < where + num && k < 8; k++)
				i6w[k] = 0;
		}

		assert(frr_inet_ntop(AF_INET6, &i6, buf1, sizeof(buf1)));
		assert(inet_ntop(AF_INET6, &i6, buf2, sizeof(buf2)));
		if (strcmp(buf1, buf2))
			printf("%-40s (FRR) != (SYS) %-40s\n", buf1, buf2);

		assert(inet_pton(AF_INET6, buf1, &i6check));
		assert(!memcmp(&i6, &i6check, sizeof(i6)));
	}
	return 0;
}