]>
Commit | Line | Data |
---|---|---|
1c79356b A |
1 | /* |
2 | * Copyright (c) 2000 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
de355530 A |
6 | * The contents of this file constitute Original Code as defined in and |
7 | * are subject to the Apple Public Source License Version 1.1 (the | |
8 | * "License"). You may not use this file except in compliance with the | |
9 | * License. Please obtain a copy of the License at | |
10 | * http://www.apple.com/publicsource and read it before using this file. | |
1c79356b | 11 | * |
de355530 A |
12 | * This Original Code and all software distributed under the License are |
13 | * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
1c79356b A |
14 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, |
15 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
de355530 A |
16 | * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the |
17 | * License for the specific language governing rights and limitations | |
18 | * under the License. | |
1c79356b A |
19 | * |
20 | * @APPLE_LICENSE_HEADER_END@ | |
21 | */ | |
22 | /* | |
23 | * Copyright (c) 1982, 1986, 1993 | |
24 | * The Regents of the University of California. All rights reserved. | |
25 | * | |
26 | * Redistribution and use in source and binary forms, with or without | |
27 | * modification, are permitted provided that the following conditions | |
28 | * are met: | |
29 | * 1. Redistributions of source code must retain the above copyright | |
30 | * notice, this list of conditions and the following disclaimer. | |
31 | * 2. Redistributions in binary form must reproduce the above copyright | |
32 | * notice, this list of conditions and the following disclaimer in the | |
33 | * documentation and/or other materials provided with the distribution. | |
34 | * 3. All advertising materials mentioning features or use of this software | |
35 | * must display the following acknowledgement: | |
36 | * This product includes software developed by the University of | |
37 | * California, Berkeley and its contributors. | |
38 | * 4. Neither the name of the University nor the names of its contributors | |
39 | * may be used to endorse or promote products derived from this software | |
40 | * without specific prior written permission. | |
41 | * | |
42 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
43 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
44 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
45 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
46 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
47 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
48 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
49 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
50 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
51 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
52 | * SUCH DAMAGE. | |
53 | */ | |
54 | /* | |
55 | * derived from | |
56 | * @(#)if_loop.c 8.1 (Berkeley) 6/10/93 | |
57 | * Id: if_loop.c,v 1.22 1996/06/19 16:24:10 wollman Exp | |
58 | */ | |
59 | ||
60 | /* | |
61 | * Loopback interface driver for protocol testing and timing. | |
62 | */ | |
63 | #if BSD310 | |
64 | #include "opt_inet.h" | |
65 | #endif | |
66 | #include "dummy.h" | |
67 | #if NDUMMY > 0 | |
68 | ||
69 | #include <sys/param.h> | |
70 | #include <sys/systm.h> | |
71 | #include <sys/kernel.h> | |
72 | #include <sys/mbuf.h> | |
73 | #include <sys/socket.h> | |
74 | #include <sys/sockio.h> | |
75 | #include <sys/errno.h> | |
76 | #include <sys/time.h> | |
77 | ||
78 | #include <net/if.h> | |
79 | #include <net/if_types.h> | |
80 | #include <net/netisr.h> | |
81 | #include <net/route.h> | |
82 | #include <net/bpf.h> | |
83 | ||
84 | #if INET | |
85 | #include <netinet/in.h> | |
86 | #include <netinet/in_systm.h> | |
87 | #include <netinet/in_var.h> | |
88 | #include <netinet/ip.h> | |
89 | #endif | |
90 | ||
91 | #if IPX | |
92 | #include <netipx/ipx.h> | |
93 | #include <netipx/ipx_if.h> | |
94 | #endif | |
95 | ||
96 | #if INET6 | |
97 | #ifndef INET | |
98 | #include <netinet/in.h> | |
99 | #endif | |
100 | #include <netinet6/in6_var.h> | |
101 | #include <netinet6/ip6.h> | |
102 | #endif | |
103 | ||
1c79356b A |
104 | #if NETATALK |
105 | #include <netinet/if_ether.h> | |
106 | #include <netatalk/at.h> | |
107 | #include <netatalk/at_var.h> | |
108 | #endif NETATALK | |
109 | ||
110 | #include "bpfilter.h" | |
111 | ||
112 | static int dummyioctl __P((struct ifnet *, u_long, caddr_t)); | |
113 | int dummyoutput __P((struct ifnet *, register struct mbuf *, struct sockaddr *, | |
114 | register struct rtentry *)); | |
115 | static void dummyrtrequest __P((int, struct rtentry *, struct sockaddr *)); | |
116 | ||
117 | static void dummyattach __P((void *)); | |
118 | PSEUDO_SET(dummyattach, if_dummy); | |
119 | ||
120 | #if TINY_DUMMYMTU | |
121 | #define DUMMYMTU (1024+512) | |
122 | #else | |
123 | #define DUMMYMTU 16384 | |
124 | #endif | |
125 | #define HAVE_OLD_BPF 1 | |
126 | ||
127 | static struct ifnet dummyif[NDUMMY]; | |
128 | ||
129 | /* ARGSUSED */ | |
130 | static void | |
131 | dummyattach(dummy) | |
132 | void *dummy; | |
133 | { | |
134 | register struct ifnet *ifp; | |
135 | register int i = 0; | |
136 | ||
137 | for (i = 0; i < NDUMMY; i++) { | |
138 | ifp = &dummyif[i]; | |
139 | #if defined(__NetBSD__) || defined(__OpenBSD__) | |
140 | sprintf(ifp->if_xname, "dummy%d", i); | |
141 | #else | |
142 | ifp->if_name = "dummy"; | |
143 | ifp->if_unit = i; | |
144 | #endif | |
145 | #ifndef __bsdi__ | |
146 | ifp->if_softc = NULL; | |
147 | #endif | |
148 | ifp->if_mtu = DUMMYMTU; | |
149 | /* Change to BROADCAST experimentaly to announce its prefix. */ | |
150 | ifp->if_flags = /* IFF_LOOPBACK */ IFF_BROADCAST | IFF_MULTICAST; | |
151 | ifp->if_ioctl = dummyioctl; | |
152 | ifp->if_output = dummyoutput; | |
153 | ifp->if_type = IFT_DUMMY; | |
154 | ifp->if_hdrlen = 0; | |
155 | ifp->if_addrlen = 0; | |
156 | if_attach(ifp); | |
157 | #if NBPFILTER > 0 | |
158 | #ifdef HAVE_OLD_BPF | |
159 | bpfattach(ifp, DLT_NULL, sizeof(u_int)); | |
160 | #else | |
161 | bpfattach(&ifp->if_bpf, ifp, DLT_NULL, sizeof(u_int)); | |
162 | #endif | |
163 | #endif | |
164 | } | |
165 | } | |
166 | ||
167 | int | |
168 | dummyoutput(ifp, m, dst, rt) | |
169 | struct ifnet *ifp; | |
170 | register struct mbuf *m; | |
171 | struct sockaddr *dst; | |
172 | register struct rtentry *rt; | |
173 | { | |
174 | int s, isr; | |
175 | register struct ifqueue *ifq = 0; | |
176 | ||
177 | if ((m->m_flags & M_PKTHDR) == 0) | |
178 | panic("dummyoutput no HDR"); | |
179 | #if NBPFILTER > 0 | |
180 | /* BPF write needs to be handled specially */ | |
181 | if (dst->sa_family == AF_UNSPEC) { | |
182 | dst->sa_family = *(mtod(m, int *)); | |
183 | m->m_len -= sizeof(int); | |
184 | m->m_pkthdr.len -= sizeof(int); | |
185 | m->m_data += sizeof(int); | |
186 | } | |
187 | ||
188 | if (ifp->if_bpf) { | |
189 | /* | |
190 | * We need to prepend the address family as | |
191 | * a four byte field. Cons up a dummy header | |
192 | * to pacify bpf. This is safe because bpf | |
193 | * will only read from the mbuf (i.e., it won't | |
194 | * try to free it or keep a pointer a to it). | |
195 | */ | |
196 | struct mbuf m0; | |
197 | u_int af = dst->sa_family; | |
198 | ||
199 | m0.m_next = m; | |
200 | m0.m_len = 4; | |
201 | m0.m_data = (char *)⁡ | |
202 | ||
203 | #ifdef HAVE_OLD_BPF | |
204 | bpf_mtap(ifp, &m0); | |
205 | #else | |
206 | bpf_mtap(ifp->if_bpf, &m0); | |
207 | #endif | |
208 | } | |
209 | #endif | |
210 | m->m_pkthdr.rcvif = ifp; | |
211 | ||
212 | if (rt && rt->rt_flags & (RTF_REJECT|RTF_BLACKHOLE)) { | |
213 | m_freem(m); | |
214 | return (rt->rt_flags & RTF_BLACKHOLE ? 0 : | |
215 | rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH); | |
216 | } | |
217 | ifp->if_opackets++; | |
218 | ifp->if_obytes += m->m_pkthdr.len; | |
219 | switch (dst->sa_family) { | |
220 | ||
221 | #if INET | |
222 | case AF_INET: | |
223 | ifq = &ipintrq; | |
224 | isr = NETISR_IP; | |
225 | break; | |
226 | #endif | |
227 | #if IPX | |
228 | case AF_IPX: | |
229 | ifq = &ipxintrq; | |
230 | isr = NETISR_IPX; | |
231 | break; | |
232 | #endif | |
233 | #if INET6 | |
234 | case AF_INET6: | |
235 | ifq = &ip6intrq; | |
236 | isr = NETISR_IPV6; | |
237 | break; | |
238 | #endif | |
239 | #if NS | |
240 | case AF_NS: | |
241 | ifq = &nsintrq; | |
242 | isr = NETISR_NS; | |
243 | break; | |
244 | #endif | |
245 | #if ISO | |
246 | case AF_ISO: | |
247 | ifq = &clnlintrq; | |
248 | isr = NETISR_ISO; | |
249 | break; | |
250 | #endif | |
251 | #if NETATALK | |
252 | case AF_APPLETALK: | |
253 | ifq = &atintrq2; | |
254 | isr = NETISR_ATALK; | |
255 | break; | |
256 | #endif NETATALK | |
257 | default: | |
258 | printf("%s: can't handle af%d\n", | |
259 | if_name(ifp), dst->sa_family); | |
260 | m_freem(m); | |
261 | return (EAFNOSUPPORT); | |
262 | } | |
263 | s = splimp(); | |
264 | if (IF_QFULL(ifq)) { | |
265 | IF_DROP(ifq); | |
266 | m_freem(m); | |
267 | splx(s); | |
268 | return (ENOBUFS); | |
269 | } | |
270 | IF_ENQUEUE(ifq, m); | |
271 | schednetisr(isr); | |
272 | ifp->if_ipackets++; | |
273 | ifp->if_ibytes += m->m_pkthdr.len; | |
274 | splx(s); | |
275 | return (0); | |
276 | } | |
277 | ||
278 | /* ARGSUSED */ | |
279 | static void | |
280 | dummyrtrequest(cmd, rt, sa) | |
281 | int cmd; | |
282 | struct rtentry *rt; | |
283 | struct sockaddr *sa; | |
284 | { | |
285 | if (rt) { | |
286 | rt->rt_rmx.rmx_mtu = rt->rt_ifp->if_mtu; /* for ISO */ | |
287 | /* | |
288 | * For optimal performance, the send and receive buffers | |
289 | * should be at least twice the MTU plus a little more for | |
290 | * overhead. | |
291 | */ | |
292 | rt->rt_rmx.rmx_recvpipe = | |
293 | rt->rt_rmx.rmx_sendpipe = 3 * DUMMYMTU; | |
294 | } | |
295 | } | |
296 | ||
297 | /* | |
298 | * Process an ioctl request. | |
299 | */ | |
300 | /* ARGSUSED */ | |
301 | static int | |
302 | dummyioctl(ifp, cmd, data) | |
303 | register struct ifnet *ifp; | |
304 | u_long cmd; | |
305 | caddr_t data; | |
306 | { | |
307 | register struct ifaddr *ifa; | |
308 | register struct ifreq *ifr = (struct ifreq *)data; | |
309 | register int error = 0; | |
310 | ||
311 | switch (cmd) { | |
312 | ||
313 | case SIOCSIFADDR: | |
314 | ifp->if_flags |= IFF_UP | IFF_RUNNING; | |
315 | ifa = (struct ifaddr *)data; | |
316 | ifa->ifa_rtrequest = dummyrtrequest; | |
317 | /* | |
318 | * Everything else is done at a higher level. | |
319 | */ | |
320 | break; | |
321 | ||
322 | case SIOCADDMULTI: | |
323 | case SIOCDELMULTI: | |
324 | if (ifr == 0) { | |
325 | error = EAFNOSUPPORT; /* XXX */ | |
326 | break; | |
327 | } | |
328 | switch (ifr->ifr_addr.sa_family) { | |
329 | ||
330 | #if INET | |
331 | case AF_INET: | |
332 | break; | |
333 | #endif | |
334 | #if INET6 | |
335 | case AF_INET6: | |
336 | break; | |
337 | #endif | |
338 | ||
339 | default: | |
340 | error = EAFNOSUPPORT; | |
341 | break; | |
342 | } | |
343 | break; | |
344 | ||
345 | case SIOCSIFMTU: | |
346 | ifp->if_mtu = ifr->ifr_mtu; | |
347 | break; | |
348 | ||
349 | case SIOCSIFFLAGS: | |
350 | break; | |
351 | ||
352 | default: | |
353 | error = EINVAL; | |
354 | } | |
355 | return (error); | |
356 | } | |
357 | #endif /* NDUMMY > 0 */ |