if_loop.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1982, 1986 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.1 cgd * @(#)if_loop.c 7.13 (Berkeley) 4/26/91
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd /*
37 1.1 cgd * Loopback interface driver for protocol testing and timing.
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd #include "param.h"
41 1.1 cgd #include "systm.h"
42 1.1 cgd #include "mbuf.h"
43 1.1 cgd #include "socket.h"
44 1.1 cgd #include "errno.h"
45 1.1 cgd #include "ioctl.h"
46 1.1 cgd
47 1.1 cgd #include "../net/if.h"
48 1.1 cgd #include "../net/if_types.h"
49 1.1 cgd #include "../net/netisr.h"
50 1.1 cgd #include "../net/route.h"
51 1.1 cgd
52 1.1 cgd #include "machine/mtpr.h"
53 1.1 cgd
54 1.1 cgd #ifdef INET
55 1.1 cgd #include "../netinet/in.h"
56 1.1 cgd #include "../netinet/in_systm.h"
57 1.1 cgd #include "../netinet/in_var.h"
58 1.1 cgd #include "../netinet/ip.h"
59 1.1 cgd #endif
60 1.1 cgd
61 1.1 cgd #ifdef NS
62 1.1 cgd #include "../netns/ns.h"
63 1.1 cgd #include "../netns/ns_if.h"
64 1.1 cgd #endif
65 1.1 cgd
66 1.1 cgd #ifdef ISO
67 1.1 cgd #include "../netiso/iso.h"
68 1.1 cgd #include "../netiso/iso_var.h"
69 1.1 cgd #endif
70 1.1 cgd
71 1.2 cgd #include "bpfilter.h"
72 1.2 cgd #if NBPFILTER > 0
73 1.2 cgd #include <sys/time.h>
74 1.2 cgd #include <net/bpf.h>
75 1.2 cgd static caddr_t lo_bpf;
76 1.2 cgd #endif
77 1.2 cgd
78 1.1 cgd #define LOMTU (1024+512)
79 1.1 cgd
80 1.1 cgd struct ifnet loif;
81 1.1 cgd int looutput(), loioctl();
82 1.1 cgd
83 1.1 cgd loattach()
84 1.1 cgd {
85 1.1 cgd register struct ifnet *ifp = &loif;
86 1.1 cgd
87 1.1 cgd ifp->if_name = "lo";
88 1.1 cgd ifp->if_mtu = LOMTU;
89 1.1 cgd ifp->if_flags = IFF_LOOPBACK;
90 1.1 cgd ifp->if_ioctl = loioctl;
91 1.1 cgd ifp->if_output = looutput;
92 1.1 cgd ifp->if_type = IFT_LOOP;
93 1.1 cgd ifp->if_hdrlen = 0;
94 1.1 cgd ifp->if_addrlen = 0;
95 1.1 cgd if_attach(ifp);
96 1.2 cgd #if NBPFILTER > 0
97 1.2 cgd bpfattach(&lo_bpf, ifp, DLT_NULL, sizeof(u_int));
98 1.2 cgd #endif
99 1.1 cgd }
100 1.1 cgd
101 1.1 cgd looutput(ifp, m, dst, rt)
102 1.1 cgd struct ifnet *ifp;
103 1.1 cgd register struct mbuf *m;
104 1.1 cgd struct sockaddr *dst;
105 1.1 cgd register struct rtentry *rt;
106 1.1 cgd {
107 1.1 cgd int s, isr;
108 1.1 cgd register struct ifqueue *ifq = 0;
109 1.1 cgd
110 1.1 cgd if ((m->m_flags & M_PKTHDR) == 0)
111 1.1 cgd panic("looutput no HDR");
112 1.2 cgd #if NBPFILTER > 0
113 1.2 cgd if (lo_bpf) {
114 1.2 cgd /*
115 1.2 cgd * We need to prepend the address family as
116 1.2 cgd * a four byte field. Cons up a dummy header
117 1.2 cgd * to pacify bpf. This is safe because bpf
118 1.2 cgd * will only read from the mbuf (i.e., it won't
119 1.2 cgd * try to free it or keep a pointer to it).
120 1.2 cgd */
121 1.2 cgd struct mbuf m0;
122 1.2 cgd u_int af = dst->sa_family;
123 1.2 cgd
124 1.2 cgd m0.m_next = m;
125 1.2 cgd m0.m_len = 4;
126 1.2 cgd m0.m_data = (char *)⁡
127 1.2 cgd
128 1.2 cgd bpf_mtap(lo_bpf, &m0);
129 1.2 cgd }
130 1.2 cgd #endif
131 1.1 cgd m->m_pkthdr.rcvif = ifp;
132 1.1 cgd
133 1.1 cgd if (rt && rt->rt_flags & RTF_REJECT) {
134 1.1 cgd m_freem(m);
135 1.1 cgd return (rt->rt_flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
136 1.1 cgd }
137 1.1 cgd ifp->if_opackets++;
138 1.1 cgd ifp->if_obytes += m->m_pkthdr.len;
139 1.1 cgd switch (dst->sa_family) {
140 1.1 cgd
141 1.1 cgd #ifdef INET
142 1.1 cgd case AF_INET:
143 1.1 cgd ifq = &ipintrq;
144 1.1 cgd isr = NETISR_IP;
145 1.1 cgd break;
146 1.1 cgd #endif
147 1.1 cgd #ifdef NS
148 1.1 cgd case AF_NS:
149 1.1 cgd ifq = &nsintrq;
150 1.1 cgd isr = NETISR_NS;
151 1.1 cgd break;
152 1.1 cgd #endif
153 1.1 cgd #ifdef ISO
154 1.1 cgd case AF_ISO:
155 1.1 cgd ifq = &clnlintrq;
156 1.1 cgd isr = NETISR_ISO;
157 1.1 cgd break;
158 1.1 cgd #endif
159 1.1 cgd default:
160 1.1 cgd printf("lo%d: can't handle af%d\n", ifp->if_unit,
161 1.1 cgd dst->sa_family);
162 1.1 cgd m_freem(m);
163 1.1 cgd return (EAFNOSUPPORT);
164 1.1 cgd }
165 1.1 cgd s = splimp();
166 1.1 cgd if (IF_QFULL(ifq)) {
167 1.1 cgd IF_DROP(ifq);
168 1.1 cgd m_freem(m);
169 1.1 cgd splx(s);
170 1.1 cgd return (ENOBUFS);
171 1.1 cgd }
172 1.1 cgd IF_ENQUEUE(ifq, m);
173 1.1 cgd schednetisr(isr);
174 1.1 cgd ifp->if_ipackets++;
175 1.1 cgd ifp->if_ibytes += m->m_pkthdr.len;
176 1.1 cgd splx(s);
177 1.1 cgd return (0);
178 1.1 cgd }
179 1.1 cgd
180 1.1 cgd /* ARGSUSED */
181 1.1 cgd lortrequest(cmd, rt, sa)
182 1.1 cgd struct rtentry *rt;
183 1.1 cgd struct sockaddr *sa;
184 1.1 cgd {
185 1.1 cgd if (rt)
186 1.1 cgd rt->rt_rmx.rmx_mtu = LOMTU;
187 1.1 cgd }
188 1.1 cgd
189 1.1 cgd /*
190 1.1 cgd * Process an ioctl request.
191 1.1 cgd */
192 1.1 cgd /* ARGSUSED */
193 1.1 cgd loioctl(ifp, cmd, data)
194 1.1 cgd register struct ifnet *ifp;
195 1.1 cgd int cmd;
196 1.1 cgd caddr_t data;
197 1.1 cgd {
198 1.1 cgd register struct ifaddr *ifa;
199 1.1 cgd int error = 0;
200 1.1 cgd
201 1.1 cgd switch (cmd) {
202 1.1 cgd
203 1.1 cgd case SIOCSIFADDR:
204 1.1 cgd ifp->if_flags |= IFF_UP;
205 1.1 cgd ifa = (struct ifaddr *)data;
206 1.1 cgd if (ifa != 0 && ifa->ifa_addr->sa_family == AF_ISO)
207 1.1 cgd ifa->ifa_rtrequest = lortrequest;
208 1.1 cgd /*
209 1.1 cgd * Everything else is done at a higher level.
210 1.1 cgd */
211 1.1 cgd break;
212 1.1 cgd
213 1.1 cgd default:
214 1.1 cgd error = EINVAL;
215 1.1 cgd }
216 1.1 cgd return (error);
217 1.1 cgd }
218