2 * Copyright (c) 1995, Mike Mitchell
3 * Copyright (c) 1984, 1985, 1986, 1987, 1993
4 * The Regents of the University of California. All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by the University of
17 * California, Berkeley and its contributors.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * $FreeBSD: src/sys/netipx/ipx_input.c,v 1.22.2.2 2001/02/22 09:44:18 bp Exp $
37 * $DragonFly: src/sys/netproto/ipx/ipx_input.c,v 1.5 2003/09/15 23:38:15 hsu Exp $
40 #include <sys/param.h>
41 #include <sys/systm.h>
43 #include <sys/protosw.h>
44 #include <sys/socket.h>
45 #include <sys/kernel.h>
46 #include <sys/random.h>
47 #include <sys/sysctl.h>
50 #include <net/route.h>
51 #include <net/netisr.h>
52 #include <net/intrq.h>
61 SYSCTL_INT(_net_ipx_ipx, OID_AUTO, checksum, CTLFLAG_RW,
64 static int ipxprintfs = 0; /* printing forwarding information */
65 SYSCTL_INT(_net_ipx_ipx, OID_AUTO, ipxprintfs, CTLFLAG_RW,
68 static int ipxforwarding = 0;
69 SYSCTL_INT(_net_ipx_ipx, OID_AUTO, ipxforwarding, CTLFLAG_RW,
70 &ipxforwarding, 0, "");
72 static int ipxnetbios = 0;
73 SYSCTL_INT(_net_ipx, OID_AUTO, ipxnetbios, CTLFLAG_RW,
76 union ipx_net ipx_zeronet;
77 union ipx_host ipx_zerohost;
79 union ipx_net ipx_broadnet;
80 union ipx_host ipx_broadhost;
82 struct ipxstat ipxstat;
83 struct sockaddr_ipx ipx_netmask, ipx_hostmask;
85 static u_short allones[] = {-1, -1, -1};
88 struct ipxpcb ipxrawpcb;
90 static int ipxqmaxlen = IFQ_MAXLEN;
91 static struct ifqueue ipxintrq;
94 const int ipxintrq_present = 1;
96 static void ipxintr(struct mbuf *);
97 static int ipx_do_route(struct ipx_addr *src, struct route *ro);
98 static void ipx_undo_route(struct route *ro);
99 static void ipx_forward(struct mbuf *m);
102 * IPX initialization.
108 ipx_broadnet = *(union ipx_net *)allones;
109 ipx_broadhost = *(union ipx_host *)allones;
111 read_random(&ipx_pexseq, sizeof ipx_pexseq);
112 ipxintrq.ifq_maxlen = ipxqmaxlen;
113 ipxpcb.ipxp_next = ipxpcb.ipxp_prev = &ipxpcb;
114 ipxrawpcb.ipxp_next = ipxrawpcb.ipxp_prev = &ipxrawpcb;
116 ipx_netmask.sipx_len = 6;
117 ipx_netmask.sipx_addr.x_net = ipx_broadnet;
119 ipx_hostmask.sipx_len = 12;
120 ipx_hostmask.sipx_addr.x_net = ipx_broadnet;
121 ipx_hostmask.sipx_addr.x_host = ipx_broadhost;
123 netisr_register(NETISR_IPX, ipxintr, &ipxintrq);
127 * IPX input routine. Pass to next level.
130 ipxintr(struct mbuf *m)
134 struct ipx_ifaddr *ia;
138 * If no IPX addresses have been set yet but the interfaces
139 * are receiving, can't do anything with incoming packets yet.
141 if (ipx_ifaddr == NULL)
144 ipxstat.ipxs_total++;
146 if ((m->m_flags & M_EXT || m->m_len < sizeof(struct ipx)) &&
147 (m = m_pullup(m, sizeof(struct ipx))) == 0) {
148 ipxstat.ipxs_toosmall++;
153 * Give any raw listeners a crack at the packet
155 for (ipxp = ipxrawpcb.ipxp_next; ipxp != &ipxrawpcb;
156 ipxp = ipxp->ipxp_next) {
157 struct mbuf *m1 = m_copy(m, 0, (int)M_COPYALL);
162 ipx = mtod(m, struct ipx *);
163 len = ntohs(ipx->ipx_len);
165 * Check that the amount of data in the buffers
166 * is as at least much as the IPX header would have us expect.
167 * Trim mbufs if longer than we expect.
168 * Drop packet if shorter than we expect.
170 if (m->m_pkthdr.len < len) {
171 ipxstat.ipxs_tooshort++;
174 if (m->m_pkthdr.len > len) {
175 if (m->m_len == m->m_pkthdr.len) {
177 m->m_pkthdr.len = len;
179 m_adj(m, len - m->m_pkthdr.len);
181 if (ipxcksum && ipx->ipx_sum != 0xffff) {
182 if (ipx->ipx_sum != ipx_cksum(m, len)) {
183 ipxstat.ipxs_badsum++;
189 * Propagated (Netbios) packets (type 20) has to be handled
192 if (ipx->ipx_pt == IPXPROTO_NETBIOS) {
194 ipx_output_type20(m);
201 * Is this a directed broadcast?
203 if (ipx_hosteqnh(ipx_broadhost,ipx->ipx_dna.x_host)) {
204 if ((!ipx_neteq(ipx->ipx_dna, ipx->ipx_sna)) &&
205 (!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_broadnet)) &&
206 (!ipx_neteqnn(ipx->ipx_sna.x_net, ipx_zeronet)) &&
207 (!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)) ) {
209 * If it is a broadcast to the net where it was
210 * received from, treat it as ours.
212 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
213 if((ia->ia_ifa.ifa_ifp == m->m_pkthdr.rcvif) &&
214 ipx_neteq(ia->ia_addr.sipx_addr,
219 * Look to see if I need to eat this packet.
220 * Algorithm is to forward all young packets
221 * and prematurely age any packets which will
222 * by physically broadcasted.
223 * Any very old packets eaten without forwarding
226 * Suggestion of Bill Nesheim, Cornell U.
228 if (ipx->ipx_tc < IPX_MAXHOPS) {
234 * Is this our packet? If not, forward.
237 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
238 if (ipx_hosteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) &&
239 (ipx_neteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) ||
240 ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)))
250 * Locate pcb for datagram.
252 ipxp = ipx_pcblookup(&ipx->ipx_sna, ipx->ipx_dna.x_port, IPX_WILDCARD);
254 * Switch out to protocol's input routine.
257 ipxstat.ipxs_delivered++;
258 if ((ipxp->ipxp_flags & IPXP_ALL_PACKETS) == 0)
259 switch (ipx->ipx_pt) {
275 ipx_ctlinput(cmd, arg_as_sa, dummy)
277 struct sockaddr *arg_as_sa; /* XXX should be swapped with dummy */
280 caddr_t arg = (/* XXX */ caddr_t)arg_as_sa;
281 struct ipx_addr *ipx;
283 if (cmd < 0 || cmd > PRC_NCMDS)
286 struct sockaddr_ipx *sipx;
290 case PRC_HOSTUNREACH:
291 sipx = (struct sockaddr_ipx *)arg;
292 if (sipx->sipx_family != AF_IPX)
294 ipx = &sipx->sipx_addr;
299 printf("ipx_ctlinput: cmd %d.\n", cmd);
305 * Forward a packet. If some error occurs drop the packet. IPX don't
306 * have a way to return errors to the sender.
309 static struct route ipx_droute;
310 static struct route ipx_sroute;
316 struct ipx *ipx = mtod(m, struct ipx *);
318 struct mbuf *mcopy = NULL;
320 int flags = IPX_FORWARDING;
324 if (ipxforwarding == 0) {
325 /* can't tell difference between net and host */
326 ipxstat.ipxs_cantforward++;
331 if (ipx->ipx_tc > IPX_MAXHOPS) {
332 ipxstat.ipxs_cantforward++;
337 if ((ok_there = ipx_do_route(&ipx->ipx_dna,&ipx_droute)) == 0) {
338 ipxstat.ipxs_noroute++;
343 * Here we think about forwarding broadcast packets,
344 * so we try to insure that it doesn't go back out
345 * on the interface it came in on. Also, if we
346 * are going to physically broadcast this, let us
347 * age the packet so we can eat it safely the second time around.
349 if (ipx->ipx_dna.x_host.c_host[0] & 0x1) {
350 struct ipx_ifaddr *ia = ipx_iaonnetof(&ipx->ipx_dna);
353 /* I'm gonna hafta eat this packet */
354 agedelta += IPX_MAXHOPS - ipx->ipx_tc;
355 ipx->ipx_tc = IPX_MAXHOPS;
357 if ((ok_back = ipx_do_route(&ipx->ipx_sna,&ipx_sroute)) == 0) {
358 /* error = ENETUNREACH; He'll never get it! */
359 ipxstat.ipxs_noroute++;
363 if (ipx_droute.ro_rt &&
364 (ifp = ipx_droute.ro_rt->rt_ifp) &&
366 (ifp != ipx_sroute.ro_rt->rt_ifp)) {
367 flags |= IPX_ALLOWBROADCAST;
369 ipxstat.ipxs_noroute++;
375 * We don't need to recompute checksum because ipx_tc field
376 * is ignored by checksum calculation routine, however
377 * it may be desirable to reset checksum if ipxcksum == 0
381 ipx->ipx_sum = 0xffff;
384 error = ipx_outputfl(m, &ipx_droute, flags);
386 ipxstat.ipxs_forward++;
390 ipx_printhost(&ipx->ipx_sna);
392 ipx_printhost(&ipx->ipx_dna);
393 printf(" hops %d\n", ipx->ipx_tc);
395 } else if (mcopy != NULL) {
396 ipx = mtod(mcopy, struct ipx *);
404 ipxstat.ipxs_noroute++;
408 ipxstat.ipxs_mtutoosmall++;
412 ipxstat.ipxs_odropped++;
420 ipx_undo_route(&ipx_droute);
422 ipx_undo_route(&ipx_sroute);
428 ipx_do_route(src, ro)
429 struct ipx_addr *src;
432 struct sockaddr_ipx *dst;
434 bzero((caddr_t)ro, sizeof(*ro));
435 dst = (struct sockaddr_ipx *)&ro->ro_dst;
437 dst->sipx_len = sizeof(*dst);
438 dst->sipx_family = AF_IPX;
439 dst->sipx_addr = *src;
440 dst->sipx_addr.x_port = 0;
442 if (ro->ro_rt == NULL || ro->ro_rt->rt_ifp == NULL) {
453 if (ro->ro_rt != NULL) {
459 ipx_watch_output(m, ifp)
465 struct ipx_ifaddr *ia;
467 * Give any raw listeners a crack at the packet
469 for (ipxp = ipxrawpcb.ipxp_next; ipxp != &ipxrawpcb;
470 ipxp = ipxp->ipxp_next) {
471 struct mbuf *m0 = m_copy(m, 0, (int)M_COPYALL);
475 M_PREPEND(m0, sizeof(*ipx), M_DONTWAIT);
478 ipx = mtod(m0, struct ipx *);
479 ipx->ipx_sna.x_net = ipx_zeronet;
480 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
481 if (ifp == ia->ia_ifp)
484 ipx->ipx_sna.x_host = ipx_zerohost;
486 ipx->ipx_sna.x_host =
487 ia->ia_addr.sipx_addr.x_host;
489 if (ifp != NULL && (ifp->if_flags & IFF_POINTOPOINT))
490 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
491 if (ifa->ifa_addr->sa_family == AF_IPX) {
492 ipx->ipx_sna = IA_SIPX(ifa)->sipx_addr;
496 ipx->ipx_len = ntohl(m0->m_pkthdr.len);