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
|
/* $OpenBSD: rde_prefix.c,v 1.38 2019/02/15 09:55:21 claudio Exp $ */
/*
* Copyright (c) 2003, 2004 Claudio Jeker <claudio@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 <sys/queue.h>
#include <endian.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include "bgpd.h"
#include "rde.h"
#include "log.h"
/*
* Prefix Table functions:
* pt_add: create new prefix and link it into the prefix table
* pt_remove: Checks if there is no bgp prefix linked to the prefix,
* unlinks from the prefix table and frees the pt_entry.
* pt_get: get a prefix/prefixlen entry. While pt_lookup searches for the
* best matching prefix pt_get only finds the prefix/prefixlen
* entry. The speed of pt_get is important for the bgp updates.
* pt_getaddr: convert the address into a struct bgpd_addr.
* pt_lookup: lookup a IP in the prefix table. Mainly for "show ip bgp".
* pt_empty: returns true if there is no bgp prefix linked to the pt_entry.
* pt_init: initialize prefix table.
* pt_alloc: allocate a AF specific pt_entry. Internal function.
* pt_free: free a pt_entry. Internal function.
*/
/* internal prototypes */
static struct pt_entry *pt_alloc(struct pt_entry *);
static void pt_free(struct pt_entry *);
size_t pt_sizes[AID_MAX] = AID_PTSIZE;
RB_HEAD(pt_tree, pt_entry);
RB_PROTOTYPE(pt_tree, pt_entry, pt_e, pt_prefix_cmp);
RB_GENERATE(pt_tree, pt_entry, pt_e, pt_prefix_cmp);
struct pt_tree pttable;
void
pt_init(void)
{
RB_INIT(&pttable);
}
void
pt_shutdown(void)
{
if (!RB_EMPTY(&pttable))
log_debug("pt_shutdown: tree is not empty.");
}
void
pt_getaddr(struct pt_entry *pte, struct bgpd_addr *addr)
{
bzero(addr, sizeof(struct bgpd_addr));
addr->aid = pte->aid;
switch (addr->aid) {
case AID_INET:
addr->v4 = ((struct pt_entry4 *)pte)->prefix4;
break;
case AID_INET6:
memcpy(&addr->v6, &((struct pt_entry6 *)pte)->prefix6,
sizeof(addr->v6));
/* XXX scope_id ??? */
break;
case AID_VPN_IPv4:
addr->vpn4.addr = ((struct pt_entry_vpn4 *)pte)->prefix4;
addr->vpn4.rd = ((struct pt_entry_vpn4 *)pte)->rd;
addr->vpn4.labellen = ((struct pt_entry_vpn4 *)pte)->labellen;
memcpy(addr->vpn4.labelstack,
((struct pt_entry_vpn4 *)pte)->labelstack,
addr->vpn4.labellen);
break;
case AID_VPN_IPv6:
memcpy(&addr->vpn6.addr,
&((struct pt_entry_vpn6 *)pte)->prefix6,
sizeof(addr->vpn6.addr));
addr->vpn6.rd = ((struct pt_entry_vpn6 *)pte)->rd;
addr->vpn6.labellen = ((struct pt_entry_vpn6 *)pte)->labellen;
memcpy(addr->vpn6.labelstack,
((struct pt_entry_vpn6 *)pte)->labelstack,
addr->vpn6.labellen);
break;
default:
fatalx("pt_getaddr: unknown af");
}
}
struct pt_entry *
pt_fill(struct bgpd_addr *prefix, int prefixlen)
{
static struct pt_entry4 pte4;
static struct pt_entry6 pte6;
static struct pt_entry_vpn4 pte_vpn4;
static struct pt_entry_vpn6 pte_vpn6;
switch (prefix->aid) {
case AID_INET:
bzero(&pte4, sizeof(pte4));
pte4.aid = prefix->aid;
if (prefixlen > 32)
fatalx("pt_fill: bad IPv4 prefixlen");
inet4applymask(&pte4.prefix4, &prefix->v4, prefixlen);
pte4.prefixlen = prefixlen;
return ((struct pt_entry *)&pte4);
case AID_INET6:
bzero(&pte6, sizeof(pte6));
pte6.aid = prefix->aid;
if (prefixlen > 128)
fatalx("pt_fill: bad IPv6 prefixlen");
inet6applymask(&pte6.prefix6, &prefix->v6, prefixlen);
pte6.prefixlen = prefixlen;
return ((struct pt_entry *)&pte6);
case AID_VPN_IPv4:
bzero(&pte_vpn4, sizeof(pte_vpn4));
pte_vpn4.aid = prefix->aid;
if (prefixlen > 32)
fatalx("pt_fill: bad IPv4 prefixlen");
inet4applymask(&pte_vpn4.prefix4, &prefix->vpn4.addr,
prefixlen);
pte_vpn4.prefixlen = prefixlen;
pte_vpn4.rd = prefix->vpn4.rd;
pte_vpn4.labellen = prefix->vpn4.labellen;
memcpy(pte_vpn4.labelstack, prefix->vpn4.labelstack,
prefix->vpn4.labellen);
return ((struct pt_entry *)&pte_vpn4);
case AID_VPN_IPv6:
memset(&pte_vpn6, 0, sizeof(pte_vpn6));
pte_vpn6.aid = prefix->aid;
if (prefixlen > 128)
fatalx("pt_get: bad IPv6 prefixlen");
inet6applymask(&pte_vpn6.prefix6, &prefix->vpn6.addr,
prefixlen);
pte_vpn6.prefixlen = prefixlen;
pte_vpn6.rd = prefix->vpn6.rd;
pte_vpn6.labellen = prefix->vpn6.labellen;
memcpy(pte_vpn6.labelstack, prefix->vpn6.labelstack,
prefix->vpn6.labellen);
return ((struct pt_entry *)&pte_vpn6);
default:
fatalx("pt_fill: unknown af");
}
}
struct pt_entry *
pt_get(struct bgpd_addr *prefix, int prefixlen)
{
struct pt_entry *pte;
pte = pt_fill(prefix, prefixlen);
return RB_FIND(pt_tree, &pttable, pte);
}
struct pt_entry *
pt_add(struct bgpd_addr *prefix, int prefixlen)
{
struct pt_entry *p = NULL;
p = pt_fill(prefix, prefixlen);
p = pt_alloc(p);
if (RB_INSERT(pt_tree, &pttable, p) != NULL)
fatalx("pt_add: insert failed");
return (p);
}
void
pt_remove(struct pt_entry *pte)
{
if (!pt_empty(pte))
fatalx("pt_remove: entry still holds references");
if (RB_REMOVE(pt_tree, &pttable, pte) == NULL)
log_warnx("pt_remove: remove failed.");
pt_free(pte);
}
struct pt_entry *
pt_lookup(struct bgpd_addr *addr)
{
struct pt_entry *p;
int i;
switch (addr->aid) {
case AID_INET:
case AID_VPN_IPv4:
i = 32;
break;
case AID_INET6:
case AID_VPN_IPv6:
i = 128;
break;
default:
fatalx("pt_lookup: unknown af");
}
for (; i >= 0; i--) {
p = pt_get(addr, i);
if (p != NULL)
return (p);
}
return (NULL);
}
int
pt_prefix_cmp(const struct pt_entry *a, const struct pt_entry *b)
{
const struct pt_entry4 *a4, *b4;
const struct pt_entry6 *a6, *b6;
const struct pt_entry_vpn4 *va4, *vb4;
const struct pt_entry_vpn6 *va6, *vb6;
int i;
if (a->aid > b->aid)
return (1);
if (a->aid < b->aid)
return (-1);
switch (a->aid) {
case AID_INET:
a4 = (const struct pt_entry4 *)a;
b4 = (const struct pt_entry4 *)b;
if (ntohl(a4->prefix4.s_addr) > ntohl(b4->prefix4.s_addr))
return (1);
if (ntohl(a4->prefix4.s_addr) < ntohl(b4->prefix4.s_addr))
return (-1);
if (a4->prefixlen > b4->prefixlen)
return (1);
if (a4->prefixlen < b4->prefixlen)
return (-1);
return (0);
case AID_INET6:
a6 = (const struct pt_entry6 *)a;
b6 = (const struct pt_entry6 *)b;
i = memcmp(&a6->prefix6, &b6->prefix6, sizeof(struct in6_addr));
if (i > 0)
return (1);
if (i < 0)
return (-1);
if (a6->prefixlen < b6->prefixlen)
return (-1);
if (a6->prefixlen > b6->prefixlen)
return (1);
return (0);
case AID_VPN_IPv4:
va4 = (const struct pt_entry_vpn4 *)a;
vb4 = (const struct pt_entry_vpn4 *)b;
if (be64toh(va4->rd) > be64toh(vb4->rd))
return (1);
if (be64toh(va4->rd) < be64toh(vb4->rd))
return (-1);
if (ntohl(va4->prefix4.s_addr) > ntohl(vb4->prefix4.s_addr))
return (1);
if (ntohl(va4->prefix4.s_addr) < ntohl(vb4->prefix4.s_addr))
return (-1);
if (va4->prefixlen > vb4->prefixlen)
return (1);
if (va4->prefixlen < vb4->prefixlen)
return (-1);
return (0);
case AID_VPN_IPv6:
va6 = (const struct pt_entry_vpn6 *)a;
vb6 = (const struct pt_entry_vpn6 *)b;
if (be64toh(va6->rd) > be64toh(vb6->rd))
return (1);
if (be64toh(va6->rd) < be64toh(vb6->rd))
return (-1);
i = memcmp(&va6->prefix6, &vb6->prefix6,
sizeof(struct in6_addr));
if (i > 0)
return (1);
if (i < 0)
return (-1);
if (va6->prefixlen > vb6->prefixlen)
return (1);
if (va6->prefixlen < vb6->prefixlen)
return (-1);
return (0);
default:
fatalx("pt_prefix_cmp: unknown af");
}
return (-1);
}
/*
* Returns a pt_entry cloned from the one passed in.
* Function may not return on failure.
*/
static struct pt_entry *
pt_alloc(struct pt_entry *op)
{
struct pt_entry *p;
p = malloc(pt_sizes[op->aid]);
if (p == NULL)
fatal("pt_alloc");
rdemem.pt_cnt[op->aid]++;
memcpy(p, op, pt_sizes[op->aid]);
return (p);
}
static void
pt_free(struct pt_entry *pte)
{
rdemem.pt_cnt[pte->aid]--;
free(pte);
}
|
