if_loop.c revision 1.28 1 1.28 itojun /* $NetBSD: if_loop.c,v 1.28 1999/12/15 06:16:05 itojun Exp $ */
2 1.26 itojun
3 1.26 itojun /*
4 1.26 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 1.26 itojun * All rights reserved.
6 1.26 itojun *
7 1.26 itojun * Redistribution and use in source and binary forms, with or without
8 1.26 itojun * modification, are permitted provided that the following conditions
9 1.26 itojun * are met:
10 1.26 itojun * 1. Redistributions of source code must retain the above copyright
11 1.26 itojun * notice, this list of conditions and the following disclaimer.
12 1.26 itojun * 2. Redistributions in binary form must reproduce the above copyright
13 1.26 itojun * notice, this list of conditions and the following disclaimer in the
14 1.26 itojun * documentation and/or other materials provided with the distribution.
15 1.26 itojun * 3. Neither the name of the project nor the names of its contributors
16 1.26 itojun * may be used to endorse or promote products derived from this software
17 1.26 itojun * without specific prior written permission.
18 1.26 itojun *
19 1.26 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 1.26 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.26 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.26 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 1.26 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.26 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.26 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.26 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.26 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.26 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.26 itojun * SUCH DAMAGE.
30 1.26 itojun */
31 1.12 cgd
32 1.1 cgd /*
33 1.11 mycroft * Copyright (c) 1982, 1986, 1993
34 1.11 mycroft * The Regents of the University of California. All rights reserved.
35 1.1 cgd *
36 1.1 cgd * Redistribution and use in source and binary forms, with or without
37 1.1 cgd * modification, are permitted provided that the following conditions
38 1.1 cgd * are met:
39 1.1 cgd * 1. Redistributions of source code must retain the above copyright
40 1.1 cgd * notice, this list of conditions and the following disclaimer.
41 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
42 1.1 cgd * notice, this list of conditions and the following disclaimer in the
43 1.1 cgd * documentation and/or other materials provided with the distribution.
44 1.1 cgd * 3. All advertising materials mentioning features or use of this software
45 1.1 cgd * must display the following acknowledgement:
46 1.1 cgd * This product includes software developed by the University of
47 1.1 cgd * California, Berkeley and its contributors.
48 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
49 1.1 cgd * may be used to endorse or promote products derived from this software
50 1.1 cgd * without specific prior written permission.
51 1.1 cgd *
52 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 1.1 cgd * SUCH DAMAGE.
63 1.1 cgd *
64 1.21 fvdl * @(#)if_loop.c 8.2 (Berkeley) 1/9/95
65 1.1 cgd */
66 1.1 cgd
67 1.1 cgd /*
68 1.1 cgd * Loopback interface driver for protocol testing and timing.
69 1.1 cgd */
70 1.23 jonathan
71 1.23 jonathan #include "opt_inet.h"
72 1.23 jonathan #include "opt_atalk.h"
73 1.24 jonathan #include "opt_iso.h"
74 1.25 jonathan #include "opt_ns.h"
75 1.1 cgd
76 1.9 mycroft #include "bpfilter.h"
77 1.4 cgd #include "loop.h"
78 1.4 cgd
79 1.9 mycroft #include <sys/param.h>
80 1.9 mycroft #include <sys/systm.h>
81 1.11 mycroft #include <sys/kernel.h>
82 1.9 mycroft #include <sys/mbuf.h>
83 1.9 mycroft #include <sys/socket.h>
84 1.9 mycroft #include <sys/errno.h>
85 1.9 mycroft #include <sys/ioctl.h>
86 1.11 mycroft #include <sys/time.h>
87 1.11 mycroft
88 1.11 mycroft #include <machine/cpu.h>
89 1.9 mycroft
90 1.9 mycroft #include <net/if.h>
91 1.9 mycroft #include <net/if_types.h>
92 1.9 mycroft #include <net/netisr.h>
93 1.9 mycroft #include <net/route.h>
94 1.1 cgd
95 1.1 cgd #ifdef INET
96 1.9 mycroft #include <netinet/in.h>
97 1.9 mycroft #include <netinet/in_systm.h>
98 1.9 mycroft #include <netinet/in_var.h>
99 1.9 mycroft #include <netinet/ip.h>
100 1.1 cgd #endif
101 1.1 cgd
102 1.26 itojun #ifdef INET6
103 1.26 itojun #ifndef INET
104 1.26 itojun #include <netinet/in.h>
105 1.26 itojun #endif
106 1.26 itojun #include <netinet6/in6_var.h>
107 1.26 itojun #include <netinet6/ip6.h>
108 1.26 itojun #endif
109 1.26 itojun
110 1.1 cgd #ifdef NS
111 1.9 mycroft #include <netns/ns.h>
112 1.9 mycroft #include <netns/ns_if.h>
113 1.1 cgd #endif
114 1.1 cgd
115 1.22 christos #ifdef IPX
116 1.22 christos #include <netipx/ipx.h>
117 1.22 christos #include <netipx/ipx_if.h>
118 1.22 christos #endif
119 1.22 christos
120 1.1 cgd #ifdef ISO
121 1.9 mycroft #include <netiso/iso.h>
122 1.9 mycroft #include <netiso/iso_var.h>
123 1.1 cgd #endif
124 1.1 cgd
125 1.19 christos #ifdef NETATALK
126 1.19 christos #include <netatalk/at.h>
127 1.19 christos #include <netatalk/at_var.h>
128 1.19 christos #endif
129 1.19 christos
130 1.2 cgd #if NBPFILTER > 0
131 1.2 cgd #include <net/bpf.h>
132 1.2 cgd #endif
133 1.9 mycroft
134 1.26 itojun #if defined(LARGE_LOMTU)
135 1.26 itojun #define LOMTU (131072 + MHLEN + MLEN)
136 1.26 itojun #else
137 1.20 jonathan #define LOMTU (32768 + MHLEN + MLEN)
138 1.26 itojun #endif
139 1.1 cgd
140 1.4 cgd struct ifnet loif[NLOOP];
141 1.1 cgd
142 1.6 andrew void
143 1.11 mycroft loopattach(n)
144 1.11 mycroft int n;
145 1.1 cgd {
146 1.4 cgd register int i;
147 1.4 cgd register struct ifnet *ifp;
148 1.1 cgd
149 1.11 mycroft for (i = 0; i < NLOOP; i++) {
150 1.4 cgd ifp = &loif[i];
151 1.17 christos sprintf(ifp->if_xname, "lo%d", i);
152 1.15 thorpej ifp->if_softc = NULL;
153 1.4 cgd ifp->if_mtu = LOMTU;
154 1.11 mycroft ifp->if_flags = IFF_LOOPBACK | IFF_MULTICAST;
155 1.4 cgd ifp->if_ioctl = loioctl;
156 1.4 cgd ifp->if_output = looutput;
157 1.4 cgd ifp->if_type = IFT_LOOP;
158 1.4 cgd ifp->if_hdrlen = 0;
159 1.4 cgd ifp->if_addrlen = 0;
160 1.4 cgd if_attach(ifp);
161 1.2 cgd #if NBPFILTER > 0
162 1.11 mycroft bpfattach(&ifp->if_bpf, ifp, DLT_NULL, sizeof(u_int));
163 1.2 cgd #endif
164 1.4 cgd }
165 1.1 cgd }
166 1.1 cgd
167 1.11 mycroft int
168 1.1 cgd looutput(ifp, m, dst, rt)
169 1.1 cgd struct ifnet *ifp;
170 1.1 cgd register struct mbuf *m;
171 1.1 cgd struct sockaddr *dst;
172 1.1 cgd register struct rtentry *rt;
173 1.1 cgd {
174 1.1 cgd int s, isr;
175 1.1 cgd register struct ifqueue *ifq = 0;
176 1.1 cgd
177 1.1 cgd if ((m->m_flags & M_PKTHDR) == 0)
178 1.14 mycroft panic("looutput: no header mbuf");
179 1.11 mycroft ifp->if_lastchange = time;
180 1.2 cgd #if NBPFILTER > 0
181 1.18 mycroft if (ifp->if_bpf && (ifp->if_flags & IFF_LOOPBACK)) {
182 1.2 cgd /*
183 1.2 cgd * We need to prepend the address family as
184 1.2 cgd * a four byte field. Cons up a dummy header
185 1.2 cgd * to pacify bpf. This is safe because bpf
186 1.2 cgd * will only read from the mbuf (i.e., it won't
187 1.2 cgd * try to free it or keep a pointer to it).
188 1.2 cgd */
189 1.2 cgd struct mbuf m0;
190 1.2 cgd u_int af = dst->sa_family;
191 1.2 cgd
192 1.2 cgd m0.m_next = m;
193 1.2 cgd m0.m_len = 4;
194 1.2 cgd m0.m_data = (char *)⁡
195 1.2 cgd
196 1.11 mycroft bpf_mtap(ifp->if_bpf, &m0);
197 1.2 cgd }
198 1.2 cgd #endif
199 1.1 cgd m->m_pkthdr.rcvif = ifp;
200 1.1 cgd
201 1.11 mycroft if (rt && rt->rt_flags & (RTF_REJECT|RTF_BLACKHOLE)) {
202 1.1 cgd m_freem(m);
203 1.11 mycroft return (rt->rt_flags & RTF_BLACKHOLE ? 0 :
204 1.11 mycroft rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
205 1.1 cgd }
206 1.26 itojun
207 1.27 itojun #ifndef PULLDOWN_TEST
208 1.26 itojun /*
209 1.26 itojun * KAME requires that the packet to be contiguous on the
210 1.26 itojun * mbuf. We need to make that sure.
211 1.26 itojun * this kind of code should be avoided.
212 1.27 itojun * XXX other conditions to avoid running this part?
213 1.26 itojun */
214 1.28 itojun if (m->m_len != m->m_pkthdr.len) {
215 1.28 itojun struct mbuf *n = NULL;
216 1.28 itojun int maxlen;
217 1.26 itojun
218 1.26 itojun MGETHDR(n, M_DONTWAIT, MT_HEADER);
219 1.28 itojun maxlen = MHLEN;
220 1.28 itojun if (n)
221 1.28 itojun M_COPY_PKTHDR(n, m);
222 1.28 itojun if (n && m->m_pkthdr.len > maxlen) {
223 1.27 itojun MCLGET(n, M_DONTWAIT);
224 1.28 itojun maxlen = MCLBYTES;
225 1.27 itojun if ((n->m_flags & M_EXT) == 0) {
226 1.27 itojun m_free(n);
227 1.27 itojun n = NULL;
228 1.27 itojun }
229 1.27 itojun }
230 1.27 itojun if (!n) {
231 1.27 itojun printf("looutput: mbuf allocation failed\n");
232 1.27 itojun m_freem(m);
233 1.27 itojun return ENOBUFS;
234 1.26 itojun }
235 1.26 itojun
236 1.28 itojun if (m->m_pkthdr.len <= maxlen) {
237 1.27 itojun m_copydata(m, 0, m->m_pkthdr.len, mtod(n, caddr_t));
238 1.27 itojun n->m_len = m->m_pkthdr.len;
239 1.27 itojun n->m_next = NULL;
240 1.27 itojun m_freem(m);
241 1.27 itojun } else {
242 1.28 itojun m_copydata(m, 0, maxlen, mtod(n, caddr_t));
243 1.28 itojun m_adj(m, maxlen);
244 1.28 itojun n->m_len = maxlen;
245 1.27 itojun n->m_next = m;
246 1.27 itojun m->m_flags &= ~M_PKTHDR;
247 1.27 itojun }
248 1.26 itojun m = n;
249 1.26 itojun }
250 1.26 itojun #if 0
251 1.27 itojun if (m && m->m_next != NULL) {
252 1.26 itojun printf("loop: not contiguous...\n");
253 1.27 itojun m_freem(m);
254 1.27 itojun return ENOBUFS;
255 1.27 itojun }
256 1.26 itojun #endif
257 1.26 itojun #endif
258 1.26 itojun
259 1.1 cgd ifp->if_opackets++;
260 1.1 cgd ifp->if_obytes += m->m_pkthdr.len;
261 1.1 cgd switch (dst->sa_family) {
262 1.1 cgd
263 1.1 cgd #ifdef INET
264 1.1 cgd case AF_INET:
265 1.1 cgd ifq = &ipintrq;
266 1.1 cgd isr = NETISR_IP;
267 1.1 cgd break;
268 1.1 cgd #endif
269 1.26 itojun #ifdef INET6
270 1.26 itojun case AF_INET6:
271 1.26 itojun m->m_flags |= M_LOOP;
272 1.26 itojun ifq = &ip6intrq;
273 1.26 itojun isr = NETISR_IPV6;
274 1.26 itojun break;
275 1.26 itojun #endif
276 1.1 cgd #ifdef NS
277 1.1 cgd case AF_NS:
278 1.1 cgd ifq = &nsintrq;
279 1.1 cgd isr = NETISR_NS;
280 1.1 cgd break;
281 1.1 cgd #endif
282 1.1 cgd #ifdef ISO
283 1.1 cgd case AF_ISO:
284 1.1 cgd ifq = &clnlintrq;
285 1.1 cgd isr = NETISR_ISO;
286 1.22 christos break;
287 1.22 christos #endif
288 1.22 christos #ifdef IPX
289 1.22 christos case AF_IPX:
290 1.22 christos ifq = &ipxintrq;
291 1.22 christos isr = NETISR_IPX;
292 1.19 christos break;
293 1.19 christos #endif
294 1.19 christos #ifdef NETATALK
295 1.19 christos case AF_APPLETALK:
296 1.19 christos ifq = &atintrq2;
297 1.19 christos isr = NETISR_ATALK;
298 1.1 cgd break;
299 1.1 cgd #endif
300 1.1 cgd default:
301 1.17 christos printf("%s: can't handle af%d\n", ifp->if_xname,
302 1.16 christos dst->sa_family);
303 1.1 cgd m_freem(m);
304 1.1 cgd return (EAFNOSUPPORT);
305 1.1 cgd }
306 1.1 cgd s = splimp();
307 1.1 cgd if (IF_QFULL(ifq)) {
308 1.1 cgd IF_DROP(ifq);
309 1.1 cgd m_freem(m);
310 1.1 cgd splx(s);
311 1.1 cgd return (ENOBUFS);
312 1.1 cgd }
313 1.1 cgd IF_ENQUEUE(ifq, m);
314 1.1 cgd schednetisr(isr);
315 1.1 cgd ifp->if_ipackets++;
316 1.1 cgd ifp->if_ibytes += m->m_pkthdr.len;
317 1.1 cgd splx(s);
318 1.1 cgd return (0);
319 1.1 cgd }
320 1.1 cgd
321 1.1 cgd /* ARGSUSED */
322 1.11 mycroft void
323 1.1 cgd lortrequest(cmd, rt, sa)
324 1.11 mycroft int cmd;
325 1.11 mycroft struct rtentry *rt;
326 1.11 mycroft struct sockaddr *sa;
327 1.1 cgd {
328 1.11 mycroft
329 1.1 cgd if (rt)
330 1.1 cgd rt->rt_rmx.rmx_mtu = LOMTU;
331 1.1 cgd }
332 1.1 cgd
333 1.1 cgd /*
334 1.1 cgd * Process an ioctl request.
335 1.1 cgd */
336 1.1 cgd /* ARGSUSED */
337 1.11 mycroft int
338 1.1 cgd loioctl(ifp, cmd, data)
339 1.1 cgd register struct ifnet *ifp;
340 1.13 cgd u_long cmd;
341 1.1 cgd caddr_t data;
342 1.1 cgd {
343 1.1 cgd register struct ifaddr *ifa;
344 1.8 hpeyerl register struct ifreq *ifr;
345 1.11 mycroft register int error = 0;
346 1.1 cgd
347 1.1 cgd switch (cmd) {
348 1.1 cgd
349 1.1 cgd case SIOCSIFADDR:
350 1.1 cgd ifp->if_flags |= IFF_UP;
351 1.1 cgd ifa = (struct ifaddr *)data;
352 1.26 itojun if (ifa != 0 /*&& ifa->ifa_addr->sa_family == AF_ISO*/)
353 1.1 cgd ifa->ifa_rtrequest = lortrequest;
354 1.1 cgd /*
355 1.1 cgd * Everything else is done at a higher level.
356 1.1 cgd */
357 1.1 cgd break;
358 1.1 cgd
359 1.8 hpeyerl case SIOCADDMULTI:
360 1.8 hpeyerl case SIOCDELMULTI:
361 1.8 hpeyerl ifr = (struct ifreq *)data;
362 1.8 hpeyerl if (ifr == 0) {
363 1.8 hpeyerl error = EAFNOSUPPORT; /* XXX */
364 1.8 hpeyerl break;
365 1.8 hpeyerl }
366 1.8 hpeyerl switch (ifr->ifr_addr.sa_family) {
367 1.8 hpeyerl
368 1.8 hpeyerl #ifdef INET
369 1.8 hpeyerl case AF_INET:
370 1.26 itojun break;
371 1.26 itojun #endif
372 1.26 itojun #ifdef INET6
373 1.26 itojun case AF_INET6:
374 1.8 hpeyerl break;
375 1.8 hpeyerl #endif
376 1.11 mycroft
377 1.8 hpeyerl default:
378 1.8 hpeyerl error = EAFNOSUPPORT;
379 1.8 hpeyerl break;
380 1.8 hpeyerl }
381 1.8 hpeyerl break;
382 1.11 mycroft
383 1.1 cgd default:
384 1.1 cgd error = EINVAL;
385 1.1 cgd }
386 1.1 cgd return (error);
387 1.1 cgd }
388