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
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
|
/* $OpenBSD: if_gre.c,v 1.16 2001/06/25 06:31:44 angelos Exp $ */
/* $NetBSD: if_gre.c,v 1.9 1999/10/25 19:18:11 drochner Exp $ */
/*
* Copyright (c) 1998 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Heiko W.Rupp <hwr@pilhuhn.de>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Encapsulate L3 protocols into IP, per RFC 1701 and 1702.
* See gre(4) for more details.
* Also supported: IP in IP encapsulation (proto 55) per RFC 2004.
*/
#include "gre.h"
#if NGRE > 0
#include "bpfilter.h"
#include <sys/param.h>
#include <sys/proc.h>
#include <sys/mbuf.h>
#include <sys/socket.h>
#include <sys/sockio.h>
#include <sys/kernel.h>
#include <sys/systm.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/netisr.h>
#include <net/route.h>
#ifdef INET
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/in_var.h>
#include <netinet/ip.h>
#include <netinet/ip_var.h>
#include <netinet/if_ether.h>
#else
#error "if_gre used without inet"
#endif
#ifdef NS
#include <netns/ns.h>
#include <netns/ns_if.h>
#endif
#ifdef NETATALK
#include <netatalk/at.h>
#include <netatalk/at_var.h>
#include <netatalk/at_extern.h>
#endif
#if NBPFILTER > 0
#include <net/bpf.h>
#endif
#include <net/if_gre.h>
#ifndef GRE_RECURSION_LIMIT
#define GRE_RECURSION_LIMIT 3 /* How many levels of recursion allowed */
#endif /* GRE_RECURSION_LIMIT */
#define GREMTU 1450 /* XXX this is below the standard MTU of
1500 Bytes, allowing for headers,
but we should possibly do path mtu discovery
before changing if state to up to find the
correct value */
#define LINK_MASK (IFF_LINK0|IFF_LINK1|IFF_LINK2)
struct gre_softc *gre = 0;
int ngre = 0;
/*
* We can control the acceptance of GRE and MobileIP packets by
* altering the sysctl net.inet.gre.allow and net.inet.mobileip.allow values
* respectively. Zero means drop them, all else is acceptance.
*/
int gre_allow = 0;
int ip_mobile_allow = 0;
static void gre_compute_route(struct gre_softc *sc);
void
greattach(n)
int n;
{
struct gre_softc *sc;
int i;
ngre = n;
gre = sc = malloc(ngre * sizeof(struct gre_softc), M_DEVBUF, M_WAIT);
bzero(sc, ngre * sizeof(struct gre_softc));
for (i = 0; i < ngre ; sc++) {
snprintf(sc->sc_if.if_xname, sizeof(sc->sc_if.if_xname),
"gre%d", i++);
sc->sc_if.if_softc = sc;
sc->sc_if.if_type = IFT_OTHER;
sc->sc_if.if_addrlen = 4;
sc->sc_if.if_hdrlen = 24; /* IP + GRE */
sc->sc_if.if_mtu = GREMTU;
sc->sc_if.if_flags = IFF_POINTOPOINT|IFF_MULTICAST;
sc->sc_if.if_output = gre_output;
sc->sc_if.if_ioctl = gre_ioctl;
sc->sc_if.if_collisions = 0;
sc->sc_if.if_ierrors = 0;
sc->sc_if.if_oerrors = 0;
sc->sc_if.if_ipackets = 0;
sc->sc_if.if_opackets = 0;
sc->g_dst.s_addr = sc->g_src.s_addr = INADDR_ANY;
sc->g_proto = IPPROTO_GRE;
if_attach(&sc->sc_if);
#if NBPFILTER > 0
bpfattach(&sc->sc_if.if_bpf, &sc->sc_if, DLT_RAW,
sizeof(u_int32_t) );
#endif
}
}
/*
* The output routine. Takes a packet and encapsulates it in the protocol
* given by sc->g_proto. See also RFC 1701 and RFC 2004.
*/
int
gre_output(struct ifnet *ifp, struct mbuf *m, struct sockaddr *dst,
struct rtentry *rt)
{
int error = 0;
struct gre_softc *sc = (struct gre_softc *) (ifp->if_softc);
struct greip *gh = NULL;
struct ip *inp = NULL;
u_short etype = 0;
struct mobile_h mob_h;
struct m_tag *mtag;
/* Try to limit infinite recursion through misconfiguration. */
for (mtag = m_tag_find(m, PACKET_TAG_GRE, NULL); mtag;
mtag = m_tag_find(m, PACKET_TAG_GRE, mtag)) {
if (!bcmp((caddr_t)(mtag + 1), &ifp, sizeof(struct ifnet *))) {
IF_DROP(&ifp->if_snd);
m_freem(m);
return (EIO); /* Use the same as in if_gif.c */
}
}
mtag = m_tag_get(PACKET_TAG_GRE, sizeof(struct ifnet *), M_NOWAIT);
if (mtag == NULL) {
IF_DROP(&ifp->if_snd);
m_freem(m);
return (ENOBUFS);
}
bcopy(&ifp, (caddr_t)(mtag + 1), sizeof(struct ifnet *));
m_tag_prepend(m, mtag);
#if NBPFILTER >0
if (ifp->if_bpf)
bpf_mtap(ifp->if_bpf, m);
#endif
if (sc->g_proto == IPPROTO_MOBILE) {
if (ip_mobile_allow == 0) {
IF_DROP(&ifp->if_snd);
m_freem(m);
return (EACCES);
}
if (dst->sa_family == AF_INET) {
struct mbuf *m0;
int msiz;
/*
* Make sure the complete IP header (with options)
* is in the first mbuf.
*/
if (m->m_len < sizeof(struct ip)) {
m = m_pullup(m, sizeof(struct ip));
if (m == NULL) {
IF_DROP(&ifp->if_snd);
return (ENOBUFS);
} else
inp = mtod(m, struct ip *);
if (m->m_len < inp->ip_hl << 2) {
m = m_pullup(m,
sizeof(inp->ip_hl << 2));
if (m == NULL) {
IF_DROP(&ifp->if_snd);
return (ENOBUFS);
}
}
}
inp = mtod(m, struct ip *);
bzero(&mob_h, MOB_H_SIZ_L);
mob_h.proto = (inp->ip_p) << 8;
mob_h.odst = inp->ip_dst.s_addr;
inp->ip_dst.s_addr = sc->g_dst.s_addr;
/*
* If the packet comes from our host, we only change
* the destination address in the IP header.
* Otherwise we need to save and change the source.
*/
if (inp->ip_src.s_addr == sc->g_src.s_addr) {
msiz = MOB_H_SIZ_S;
} else {
mob_h.proto |= MOB_H_SBIT;
mob_h.osrc = inp->ip_src.s_addr;
inp->ip_src.s_addr = sc->g_src.s_addr;
msiz = MOB_H_SIZ_L;
}
HTONS(mob_h.proto);
mob_h.hcrc = gre_in_cksum((u_short *) &mob_h, msiz);
/* Squeeze in the mobility header */
if ((m->m_data - msiz) < m->m_pktdat) {
/* Need new mbuf */
MGETHDR(m0, M_DONTWAIT, MT_HEADER);
if (m0 == NULL) {
IF_DROP(&ifp->if_snd);
m_freem(m);
return (ENOBUFS);
}
M_COPY_HDR(m0, m);
m0->m_len = msiz + (inp->ip_hl << 2);
m0->m_data += max_linkhdr;
m0->m_pkthdr.len = m->m_pkthdr.len + msiz;
m->m_data += inp->ip_hl << 2;
m->m_len -= inp->ip_hl << 2;
bcopy((caddr_t) inp, mtod(m0, caddr_t),
sizeof(struct ip));
m0->m_next = m;
m = m0;
} else { /* we have some space left in the old one */
m->m_data -= msiz;
m->m_len += msiz;
m->m_pkthdr.len += msiz;
bcopy(inp, mtod(m, caddr_t),
inp->ip_hl << 2);
}
/* Copy Mobility header */
inp = mtod(m, struct ip *);
bcopy(&mob_h, (caddr_t)(inp + 1), (unsigned) msiz);
NTOHS(inp->ip_len);
inp->ip_len += msiz;
} else { /* AF_INET */
IF_DROP(&ifp->if_snd);
m_freem(m);
return (EINVAL);
}
} else if (sc->g_proto == IPPROTO_GRE) {
if (gre_allow == 0) {
IF_DROP(&ifp->if_snd);
m_freem(m);
return (EACCES);
}
switch(dst->sa_family) {
case AF_INET:
if (m->m_len < sizeof(struct ip)) {
m = m_pullup(m, sizeof(struct ip));
if (m == NULL) {
IF_DROP(&ifp->if_snd);
return (ENOBUFS);
}
}
inp = mtod(m, struct ip *);
etype = ETHERTYPE_IP;
break;
#ifdef NETATALK
case AF_APPLETALK:
etype = ETHERTYPE_AT;
break;
#endif
#ifdef NS
case AF_NS:
etype = ETHERTYPE_NS;
break;
#endif
default:
IF_DROP(&ifp->if_snd);
m_freem(m);
return (EAFNOSUPPORT);
}
M_PREPEND(m, sizeof(struct greip), M_DONTWAIT);
} else {
error = EINVAL;
IF_DROP(&ifp->if_snd);
m_freem(m);
return (error);
}
if (m == NULL) {
IF_DROP(&ifp->if_snd);
return (ENOBUFS);
}
gh = mtod(m, struct greip *);
if (sc->g_proto == IPPROTO_GRE) {
/* We don't support any GRE flags for now */
bzero((void *) &gh->gi_g, sizeof(struct gre_h));
gh->gi_ptype = htons(etype);
}
gh->gi_pr = sc->g_proto;
if (sc->g_proto != IPPROTO_MOBILE) {
gh->gi_src = sc->g_src;
gh->gi_dst = sc->g_dst;
((struct ip *) gh)->ip_hl = (sizeof(struct ip)) >> 2;
((struct ip *) gh)->ip_ttl = ip_defttl;
((struct ip *) gh)->ip_tos = inp->ip_tos;
gh->gi_len = m->m_pkthdr.len;
}
ifp->if_opackets++;
ifp->if_obytes += m->m_pkthdr.len;
/* Send it off */
error = ip_output(m, NULL, &sc->route, 0, NULL, NULL);
if (error)
ifp->if_oerrors++;
return (error);
}
int
gre_ioctl(struct ifnet *ifp, u_long cmd, caddr_t data)
{
struct ifaddr *ifa = (struct ifaddr *) data;
struct ifreq *ifr = (struct ifreq *) data;
struct in_ifaddr *ia = (struct in_ifaddr *) data;
struct gre_softc *sc = ifp->if_softc;
int s;
struct sockaddr_in si;
struct sockaddr *sa = NULL;
int error = 0;
struct proc *prc = curproc; /* XXX */
s = splimp();
switch(cmd) {
case SIOCSIFADDR:
case SIOCSIFDSTADDR:
/*
* set tunnel endpoints in case that we "only"
* have ip over ip encapsulation. This allows to
* set tunnel endpoints with ifconfig.
*/
if (ifa->ifa_addr->sa_family == AF_INET) {
sa = ifa->ifa_addr;
sc->g_src = (satosin(sa))->sin_addr;
sc->g_dst = ia->ia_dstaddr.sin_addr;
if ((sc->g_src.s_addr != INADDR_ANY) &&
(sc->g_dst.s_addr != INADDR_ANY)) {
if (sc->route.ro_rt != 0) {
/* free old route */
RTFREE(sc->route.ro_rt);
sc->route.ro_rt = (struct rtentry *) 0;
}
gre_compute_route(sc);
if (sc->route.ro_rt == 0) {
sc->g_src.s_addr = INADDR_ANY;
sc->g_dst.s_addr = INADDR_ANY;
splx(s);
return EIO; /* Is this is good ? */
}
ifp->if_flags |= IFF_UP;
}
}
break;
case SIOCSIFFLAGS:
if ((sc->g_dst.s_addr == INADDR_ANY) ||
(sc->g_src.s_addr == INADDR_ANY))
ifp->if_flags &= ~IFF_UP;
switch(ifr->ifr_flags & LINK_MASK) {
case IFF_LINK0:
sc->g_proto = IPPROTO_GRE;
ifp->if_flags |= IFF_LINK0;
ifp->if_flags &= ~(IFF_LINK1|IFF_LINK2);
break;
case IFF_LINK2:
sc->g_proto = IPPROTO_MOBILE;
ifp->if_flags |= IFF_LINK2;
ifp->if_flags &= ~(IFF_LINK0|IFF_LINK1);
break;
}
break;
case SIOCADDMULTI:
case SIOCDELMULTI:
if (ifr == 0) {
error = EAFNOSUPPORT;
break;
}
switch (ifr->ifr_addr.sa_family) {
#ifdef INET
case AF_INET:
break;
#endif
default:
error = EAFNOSUPPORT;
break;
}
break;
case GRESPROTO:
/* Check for superuser */
if ((error = suser(prc->p_ucred, &prc->p_acflag)) != 0)
break;
sc->g_proto = ifr->ifr_flags;
switch (sc->g_proto) {
case IPPROTO_GRE :
ifp->if_flags |= IFF_LINK0;
ifp->if_flags &= ~(IFF_LINK1|IFF_LINK2);
break;
case IPPROTO_MOBILE :
ifp->if_flags |= IFF_LINK2;
ifp->if_flags &= ~(IFF_LINK1|IFF_LINK2);
break;
default:
ifp->if_flags &= ~(IFF_LINK0|IFF_LINK1|IFF_LINK2);
}
break;
case GREGPROTO:
ifr->ifr_flags = sc->g_proto;
break;
case GRESADDRS:
case GRESADDRD:
/* Check for superuser */
if ((error = suser(prc->p_ucred, &prc->p_acflag)) != 0)
break;
/*
* set tunnel endpoints, compute a less specific route
* to the remote end and mark if as up
*/
sa = &ifr->ifr_addr;
if (cmd == GRESADDRS )
sc->g_src = (satosin(sa))->sin_addr;
if (cmd == GRESADDRD )
sc->g_dst = (satosin(sa))->sin_addr;
if ((sc->g_src.s_addr != INADDR_ANY) &&
(sc->g_dst.s_addr != INADDR_ANY)) {
if (sc->route.ro_rt != 0) {
/* free old route */
RTFREE(sc->route.ro_rt);
sc->route.ro_rt = (struct rtentry *) 0;
}
gre_compute_route(sc);
if (sc->route.ro_rt == 0)
{
sc->g_src.s_addr = INADDR_ANY;
sc->g_dst.s_addr = INADDR_ANY;
splx(s);
return EIO; /* Is this is good ? */
}
ifp->if_flags |= IFF_UP;
}
break;
case GREGADDRS:
si.sin_addr.s_addr = sc->g_src.s_addr;
sa = sintosa(&si);
ifr->ifr_addr = *sa;
break;
case GREGADDRD:
si.sin_addr.s_addr = sc->g_dst.s_addr;
sa = sintosa(&si);
ifr->ifr_addr = *sa;
break;
default:
error = EINVAL;
}
splx(s);
return (error);
}
/*
* computes a route to our destination that is not the one
* which would be taken by ip_output(), as this one will loop back to
* us. If the interface is p2p as a--->b, then a routing entry exists
* If we now send a packet to b (e.g. ping b), this will come down here
* gets src=a, dst=b tacked on and would from ip_ouput() sent back to
* if_gre.
* Goal here is to compute a route to b that is less specific than
* a-->b. We know that this one exists as in normal operation we have
* at least a default route which matches.
*/
static void
gre_compute_route(struct gre_softc *sc)
{
struct route *ro;
u_int32_t a, b, c;
ro = &sc->route;
bzero(ro, sizeof(struct route));
((struct sockaddr_in *) &ro->ro_dst)->sin_addr = sc->g_dst;
ro->ro_dst.sa_family = AF_INET;
ro->ro_dst.sa_len = sizeof(ro->ro_dst);
/*
* toggle last bit, so our interface is not found, but a less
* specific route. I'd rather like to specify a shorter mask,
* but this is not possible. Should work though. XXX
* there is a simpler way ...
*/
if ((sc->sc_if.if_flags & IFF_LINK1) == 0) {
a = ntohl(sc->g_dst.s_addr);
b = a & 0x01;
c = a & 0xfffffffe;
b = b ^ 0x01;
a = b | c;
((struct sockaddr_in *) &ro->ro_dst)->sin_addr.s_addr = htonl(a);
}
rtalloc(ro);
if (ro->ro_rt == 0)
return;
/*
* Check whether we just created a loop. An even more paranoid
* check would be against all GRE interfaces, but that would
* not allow people to link GRE tunnels.
*/
if (ro->ro_rt->rt_ifp == &sc->sc_if) {
RTFREE(ro->ro_rt);
ro->ro_rt = (struct rtentry *) 0;
return;
}
/*
* now change it back - else ip_output will just drop
* the route and search one to this interface ...
*/
if ((sc->sc_if.if_flags & IFF_LINK1) == 0)
((struct sockaddr_in *) &ro->ro_dst)->sin_addr = sc->g_dst;
}
/*
* do a checksum of a buffer - much like in_cksum, which operates on
* mbufs.
*/
u_short
gre_in_cksum(u_short *p, u_int len)
{
u_int sum = 0;
int nwords = len >> 1;
while (nwords-- != 0)
sum += *p++;
if (len & 1) {
union {
u_short w;
u_char c[2];
} u;
u.c[0] = *(u_char *) p;
u.c[1] = 0;
sum += u.w;
}
/* end-around-carry */
sum = (sum >> 16) + (sum & 0xffff);
sum += (sum >> 16);
return (~sum);
}
#endif
|