if_gre.h revision 1.2 1 /* $NetBSD: if_gre.h,v 1.2 1998/09/30 05:59:28 hwr Exp $ */
2
3 /*
4 * (c) 1998 The NetBSD Foundation, Inc.
5 * All rights reserved
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Heiko W.Rupp <hwr (at) pilhuhn.de>
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the NetBSD
21 * Foundation, Inc. and its contributors.
22 * 4. Neither the name of The NetBSD Foundation nor the names of its
23 * contributors may be used to endorse or promote products derived
24 * from this software without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 * POSSIBILITY OF SUCH DAMAGE.
37 */
38
39 #ifndef _NET_IF_GRE_H
40 #define _NET_IF_GRE_H
41
42 struct gre_softc {
43 struct ifnet sc_if;
44 int gre_unit;
45 int gre_flags;
46 struct in_addr g_src; /* source address of gre packets */
47 struct in_addr g_dst; /* destination address of gre packets */
48 caddr_t gre_bpf;
49 struct route route; /* routing entry that determines, where a
50 encapsulated packet should go */
51 u_char g_proto; /* protocol of encapsulator */
52 };
53
54
55 struct gre_h {
56 u_int16_t flags; /* GRE flags */
57 u_int16_t ptype; /* protocol type of payload typically
58 Ether protocol type*/
59 /*
60 * from here on: fields are optional, presence indicated by flags
61 *
62 u_int_16 checksum checksum (one-complements of GRE header
63 and payload
64 Present if (ck_pres | rt_pres == 1).
65 Valid if (ck_pres == 1).
66 u_int_16 offset offset from start of routing filed to
67 first octet of active SRE (see below).
68 Present if (ck_pres | rt_pres == 1).
69 Valid if (rt_pres == 1).
70 u_int_32 key inserted by encapsulator e.g. for
71 authentication
72 Present if (key_pres ==1 ).
73 u_int_32 seq_num Sequence number to allow for packet order
74 Present if (seq_pres ==1 ).
75
76 struct gre_sre[] routing Routing fileds (see below)
77 Present if (rt_pres == 1)
78 */
79 };
80
81 struct greip {
82 struct ip gi_i;
83 struct gre_h gi_g;
84 };
85
86 #define gi_pr gi_i.ip_p
87 #define gi_len gi_i.ip_len
88 #define gi_src gi_i.ip_src
89 #define gi_dst gi_i.ip_dst
90 #define gi_ptype gi_g.ptype
91 #define gi_flags gi_g.flags
92
93 #define GRE_CP 0x8000 /* Checksum Present */
94 #define GRE_RP 0x4000 /* Routing Present */
95 #define GRE_KP 0x2000 /* Key Present */
96 #define GRE_SP 0x1000 /* Sequence Present */
97 #define GRE_SS 0x0800 /* Strict Source Route */
98
99 /* gre_sre defines a Source route Entry. These are needed if packets
100 * should be routed over more than one tunnel hop by hop
101 */
102
103 struct gre_sre {
104 u_int16_t sre_family; /* adress family */
105 u_char sre_offset; /* offset to first octet of active entry */
106 u_char sre_length; /* number of octets in the SRE.
107 sre_lengthl==0 -> last entry. */
108 u_char *sre_rtinfo; /* the routing information */
109 };
110
111
112 void greattach __P((void));
113 int gre_ioctl __P((struct ifnet *, u_long, caddr_t));
114 int gre_output __P((struct ifnet *, struct mbuf *, struct sockaddr *,
115 struct rtentry *rt));
116
117 struct greioctl {
118 int unit;
119 struct in_addr addr;
120 };
121
122 /* for mobile encaps */
123
124 struct mobile_h {
125 u_int16_t proto; /* protocol and S-bit */
126 u_int16_t hcrc; /* header checksum */
127 u_int32_t odst; /* original destination address */
128 u_int32_t osrc; /* original source addr, if S-bit set */
129 };
130
131 struct mobip_h {
132 struct ip mi;
133 struct mobile_h mh;
134 };
135
136
137 #define MOB_H_SIZ_S (sizeof(struct mobile_h) - sizeof(u_int32_t))
138 #define MOB_H_SIZ_L (sizeof(struct mobile_h))
139 #define MOB_H_SBIT 0x0080
140
141
142 /*
143 * ioctls needed to manipulate the interface
144 */
145
146 #define GRESADDRS _IOW('i', 101, struct ifreq)
147 #define GRESADDRD _IOW('i', 102, struct ifreq)
148 #define GREGADDRS _IOWR('i', 103, struct ifreq)
149 #define GREGADDRD _IOWR('i', 104, struct ifreq)
150 #define GRESPROTO _IOW('i' , 105, struct ifreq)
151 #define GREGPROTO _IOWR('i', 106, struct ifreq)
152
153 /*
154 * do a checksum of a buffer - much like in_cksum, which operates on
155 * mbufs.
156 */
157
158 u_short gre_in_cksum(u_short *p, u_int len);
159
160 #endif
161