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
328
329
330
331
332
333
|
/* $OpenBSD: util.c,v 1.12 2022/12/28 21:30:16 jmc Exp $ */
/*
* Copyright (c) 2015 Renato Westphal <renato@openbsd.org>
* Copyright (c) 2012 Alexander Bluhm <bluhm@openbsd.org>
* Copyright (c) 2004 Esben Norby <norby@openbsd.org>
* Copyright (c) 2003, 2004 Henning Brauer <henning@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <string.h>
#include "eigrpd.h"
#include "log.h"
uint8_t
mask2prefixlen(in_addr_t ina)
{
if (ina == 0)
return (0);
else
return (33 - ffs(ntohl(ina)));
}
uint8_t
mask2prefixlen6(struct sockaddr_in6 *sa_in6)
{
unsigned int l = 0;
uint8_t *ap, *ep;
/*
* sin6_len is the size of the sockaddr so subtract the offset of
* the possibly truncated sin6_addr struct.
*/
ap = (uint8_t *)&sa_in6->sin6_addr;
ep = (uint8_t *)sa_in6 + sa_in6->sin6_len;
for (; ap < ep; ap++) {
/* this "beauty" is adopted from sbin/route/show.c ... */
switch (*ap) {
case 0xff:
l += 8;
break;
case 0xfe:
l += 7;
goto done;
case 0xfc:
l += 6;
goto done;
case 0xf8:
l += 5;
goto done;
case 0xf0:
l += 4;
goto done;
case 0xe0:
l += 3;
goto done;
case 0xc0:
l += 2;
goto done;
case 0x80:
l += 1;
goto done;
case 0x00:
goto done;
default:
fatalx("non contiguous inet6 netmask");
}
}
done:
if (l > sizeof(struct in6_addr) * 8)
fatalx("inet6 prefixlen out of bound");
return (l);
}
in_addr_t
prefixlen2mask(uint8_t prefixlen)
{
if (prefixlen == 0)
return (0);
return (htonl(0xffffffff << (32 - prefixlen)));
}
struct in6_addr *
prefixlen2mask6(uint8_t prefixlen)
{
static struct in6_addr mask;
int i;
memset(&mask, 0, sizeof(mask));
for (i = 0; i < prefixlen / 8; i++)
mask.s6_addr[i] = 0xff;
i = prefixlen % 8;
if (i)
mask.s6_addr[prefixlen / 8] = 0xff00 >> i;
return (&mask);
}
void
eigrp_applymask(int af, union eigrpd_addr *dest, const union eigrpd_addr *src,
int prefixlen)
{
struct in6_addr mask;
int i;
switch (af) {
case AF_INET:
dest->v4.s_addr = src->v4.s_addr & prefixlen2mask(prefixlen);
break;
case AF_INET6:
memset(&mask, 0, sizeof(mask));
for (i = 0; i < prefixlen / 8; i++)
mask.s6_addr[i] = 0xff;
i = prefixlen % 8;
if (i)
mask.s6_addr[prefixlen / 8] = 0xff00 >> i;
for (i = 0; i < 16; i++)
dest->v6.s6_addr[i] = src->v6.s6_addr[i] &
mask.s6_addr[i];
break;
default:
fatalx("eigrp_applymask: unknown af");
}
}
int
eigrp_addrcmp(int af, const union eigrpd_addr *a, const union eigrpd_addr *b)
{
switch (af) {
case AF_INET:
if (a->v4.s_addr == b->v4.s_addr)
return (0);
return ((ntohl(a->v4.s_addr) > ntohl(b->v4.s_addr)) ? 1 : -1);
case AF_INET6:
return (!!memcmp(&a->v6, &b->v6, sizeof(struct in6_addr)));
default:
fatalx("eigrp_addrcmp: unknown af");
}
}
int
eigrp_addrisset(int af, const union eigrpd_addr *addr)
{
switch (af) {
case AF_UNSPEC:
return (0);
case AF_INET:
if (addr->v4.s_addr != INADDR_ANY)
return (1);
break;
case AF_INET6:
if (!IN6_IS_ADDR_UNSPECIFIED(&addr->v6))
return (1);
break;
default:
fatalx("eigrp_addrisset: unknown af");
}
return (0);
}
int
eigrp_prefixcmp(int af, const union eigrpd_addr *a, const union eigrpd_addr *b,
uint8_t prefixlen)
{
in_addr_t mask, aa, ba;
int i;
uint8_t m;
switch (af) {
case AF_INET:
if (prefixlen == 0)
return (0);
if (prefixlen > 32)
fatalx("eigrp_prefixcmp: bad IPv4 prefixlen");
mask = htonl(prefixlen2mask(prefixlen));
aa = htonl(a->v4.s_addr) & mask;
ba = htonl(b->v4.s_addr) & mask;
return (aa - ba);
case AF_INET6:
if (prefixlen == 0)
return (0);
if (prefixlen > 128)
fatalx("eigrp_prefixcmp: bad IPv6 prefixlen");
for (i = 0; i < prefixlen / 8; i++)
if (a->v6.s6_addr[i] != b->v6.s6_addr[i])
return (a->v6.s6_addr[i] - b->v6.s6_addr[i]);
i = prefixlen % 8;
if (i) {
m = 0xff00 >> i;
if ((a->v6.s6_addr[prefixlen / 8] & m) !=
(b->v6.s6_addr[prefixlen / 8] & m))
return ((a->v6.s6_addr[prefixlen / 8] & m) -
(b->v6.s6_addr[prefixlen / 8] & m));
}
return (0);
default:
fatalx("eigrp_prefixcmp: unknown af");
}
return (-1);
}
int
bad_addr_v4(struct in_addr addr)
{
uint32_t a = ntohl(addr.s_addr);
if (((a >> IN_CLASSA_NSHIFT) == 0) ||
((a >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) ||
IN_MULTICAST(a))
return (1);
return (0);
}
int
bad_addr_v6(struct in6_addr *addr)
{
if (IN6_IS_ADDR_UNSPECIFIED(addr) ||
IN6_IS_ADDR_LOOPBACK(addr) ||
IN6_IS_ADDR_MULTICAST(addr) ||
IN6_IS_ADDR_SITELOCAL(addr) ||
IN6_IS_ADDR_V4MAPPED(addr) ||
IN6_IS_ADDR_V4COMPAT(addr))
return (1);
return (0);
}
int
bad_addr(int af, union eigrpd_addr *addr)
{
switch (af) {
case AF_INET:
return (bad_addr_v4(addr->v4));
case AF_INET6:
return (bad_addr_v6(&addr->v6));
default:
fatalx("bad_addr: unknown af");
}
}
void
embedscope(struct sockaddr_in6 *sin6)
{
uint16_t tmp16;
if (IN6_IS_SCOPE_EMBED(&sin6->sin6_addr)) {
memcpy(&tmp16, &sin6->sin6_addr.s6_addr[2], sizeof(tmp16));
if (tmp16 != 0) {
log_warnx("%s: address %s already has embedded scope %u",
__func__, log_sockaddr(sin6), ntohs(tmp16));
}
tmp16 = htons(sin6->sin6_scope_id);
memcpy(&sin6->sin6_addr.s6_addr[2], &tmp16, sizeof(tmp16));
sin6->sin6_scope_id = 0;
}
}
void
recoverscope(struct sockaddr_in6 *sin6)
{
uint16_t tmp16;
if (sin6->sin6_scope_id != 0)
log_warnx("%s: address %s already has scope id %u",
__func__, log_sockaddr(sin6), sin6->sin6_scope_id);
if (IN6_IS_SCOPE_EMBED(&sin6->sin6_addr)) {
memcpy(&tmp16, &sin6->sin6_addr.s6_addr[2], sizeof(tmp16));
sin6->sin6_scope_id = ntohs(tmp16);
sin6->sin6_addr.s6_addr[2] = 0;
sin6->sin6_addr.s6_addr[3] = 0;
}
}
void
addscope(struct sockaddr_in6 *sin6, uint32_t id)
{
if (sin6->sin6_scope_id != 0)
log_warnx("%s: address %s already has scope id %u", __func__,
log_sockaddr(sin6), sin6->sin6_scope_id);
if (IN6_IS_SCOPE_EMBED(&sin6->sin6_addr))
sin6->sin6_scope_id = id;
}
void
clearscope(struct in6_addr *in6)
{
if (IN6_IS_SCOPE_EMBED(in6)) {
in6->s6_addr[2] = 0;
in6->s6_addr[3] = 0;
}
}
void
sa2addr(struct sockaddr *sa, int *af, union eigrpd_addr *addr)
{
struct sockaddr_in *sa_in = (struct sockaddr_in *)sa;
struct sockaddr_in6 *sa_in6 = (struct sockaddr_in6 *)sa;
memset(addr, 0, sizeof(*addr));
switch (sa->sa_family) {
case AF_INET:
*af = AF_INET;
addr->v4 = sa_in->sin_addr;
break;
case AF_INET6:
*af = AF_INET6;
addr->v6 = sa_in6->sin6_addr;
break;
default:
fatalx("sa2addr: unknown af");
}
}
|
