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.4 2003/08/07 21:17:37 dillon 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;
93 const int ipxintrq_present = 1;
95 static int ipx_do_route(struct ipx_addr *src, struct route *ro);
96 static void ipx_undo_route(struct route *ro);
97 static void ipx_forward(struct mbuf *m);
100 * IPX initialization.
106 ipx_broadnet = *(union ipx_net *)allones;
107 ipx_broadhost = *(union ipx_host *)allones;
109 read_random(&ipx_pexseq, sizeof ipx_pexseq);
110 ipxintrq.ifq_maxlen = ipxqmaxlen;
111 ipxpcb.ipxp_next = ipxpcb.ipxp_prev = &ipxpcb;
112 ipxrawpcb.ipxp_next = ipxrawpcb.ipxp_prev = &ipxrawpcb;
114 ipx_netmask.sipx_len = 6;
115 ipx_netmask.sipx_addr.x_net = ipx_broadnet;
117 ipx_hostmask.sipx_len = 12;
118 ipx_hostmask.sipx_addr.x_net = ipx_broadnet;
119 ipx_hostmask.sipx_addr.x_host = ipx_broadhost;
121 register_netisr(NETISR_IPX, ipxintr);
125 * IPX input routine. Pass to next level.
133 struct ipx_ifaddr *ia;
138 * Get next datagram off input queue and get IPX header
142 IF_DEQUEUE(&ipxintrq, m);
147 * If no IPX addresses have been set yet but the interfaces
148 * are receiving, can't do anything with incoming packets yet.
150 if (ipx_ifaddr == NULL)
153 ipxstat.ipxs_total++;
155 if ((m->m_flags & M_EXT || m->m_len < sizeof(struct ipx)) &&
156 (m = m_pullup(m, sizeof(struct ipx))) == 0) {
157 ipxstat.ipxs_toosmall++;
162 * Give any raw listeners a crack at the packet
164 for (ipxp = ipxrawpcb.ipxp_next; ipxp != &ipxrawpcb;
165 ipxp = ipxp->ipxp_next) {
166 struct mbuf *m1 = m_copy(m, 0, (int)M_COPYALL);
171 ipx = mtod(m, struct ipx *);
172 len = ntohs(ipx->ipx_len);
174 * Check that the amount of data in the buffers
175 * is as at least much as the IPX header would have us expect.
176 * Trim mbufs if longer than we expect.
177 * Drop packet if shorter than we expect.
179 if (m->m_pkthdr.len < len) {
180 ipxstat.ipxs_tooshort++;
183 if (m->m_pkthdr.len > len) {
184 if (m->m_len == m->m_pkthdr.len) {
186 m->m_pkthdr.len = len;
188 m_adj(m, len - m->m_pkthdr.len);
190 if (ipxcksum && ipx->ipx_sum != 0xffff) {
191 if (ipx->ipx_sum != ipx_cksum(m, len)) {
192 ipxstat.ipxs_badsum++;
198 * Propagated (Netbios) packets (type 20) has to be handled
201 if (ipx->ipx_pt == IPXPROTO_NETBIOS) {
203 ipx_output_type20(m);
210 * Is this a directed broadcast?
212 if (ipx_hosteqnh(ipx_broadhost,ipx->ipx_dna.x_host)) {
213 if ((!ipx_neteq(ipx->ipx_dna, ipx->ipx_sna)) &&
214 (!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_broadnet)) &&
215 (!ipx_neteqnn(ipx->ipx_sna.x_net, ipx_zeronet)) &&
216 (!ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)) ) {
218 * If it is a broadcast to the net where it was
219 * received from, treat it as ours.
221 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
222 if((ia->ia_ifa.ifa_ifp == m->m_pkthdr.rcvif) &&
223 ipx_neteq(ia->ia_addr.sipx_addr,
228 * Look to see if I need to eat this packet.
229 * Algorithm is to forward all young packets
230 * and prematurely age any packets which will
231 * by physically broadcasted.
232 * Any very old packets eaten without forwarding
235 * Suggestion of Bill Nesheim, Cornell U.
237 if (ipx->ipx_tc < IPX_MAXHOPS) {
243 * Is this our packet? If not, forward.
246 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
247 if (ipx_hosteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) &&
248 (ipx_neteq(ipx->ipx_dna, ia->ia_addr.sipx_addr) ||
249 ipx_neteqnn(ipx->ipx_dna.x_net, ipx_zeronet)))
259 * Locate pcb for datagram.
261 ipxp = ipx_pcblookup(&ipx->ipx_sna, ipx->ipx_dna.x_port, IPX_WILDCARD);
263 * Switch out to protocol's input routine.
266 ipxstat.ipxs_delivered++;
267 if ((ipxp->ipxp_flags & IPXP_ALL_PACKETS) == 0)
268 switch (ipx->ipx_pt) {
286 ipx_ctlinput(cmd, arg_as_sa, dummy)
288 struct sockaddr *arg_as_sa; /* XXX should be swapped with dummy */
291 caddr_t arg = (/* XXX */ caddr_t)arg_as_sa;
292 struct ipx_addr *ipx;
294 if (cmd < 0 || cmd > PRC_NCMDS)
297 struct sockaddr_ipx *sipx;
301 case PRC_HOSTUNREACH:
302 sipx = (struct sockaddr_ipx *)arg;
303 if (sipx->sipx_family != AF_IPX)
305 ipx = &sipx->sipx_addr;
310 printf("ipx_ctlinput: cmd %d.\n", cmd);
316 * Forward a packet. If some error occurs drop the packet. IPX don't
317 * have a way to return errors to the sender.
320 static struct route ipx_droute;
321 static struct route ipx_sroute;
327 struct ipx *ipx = mtod(m, struct ipx *);
329 struct mbuf *mcopy = NULL;
331 int flags = IPX_FORWARDING;
335 if (ipxforwarding == 0) {
336 /* can't tell difference between net and host */
337 ipxstat.ipxs_cantforward++;
342 if (ipx->ipx_tc > IPX_MAXHOPS) {
343 ipxstat.ipxs_cantforward++;
348 if ((ok_there = ipx_do_route(&ipx->ipx_dna,&ipx_droute)) == 0) {
349 ipxstat.ipxs_noroute++;
354 * Here we think about forwarding broadcast packets,
355 * so we try to insure that it doesn't go back out
356 * on the interface it came in on. Also, if we
357 * are going to physically broadcast this, let us
358 * age the packet so we can eat it safely the second time around.
360 if (ipx->ipx_dna.x_host.c_host[0] & 0x1) {
361 struct ipx_ifaddr *ia = ipx_iaonnetof(&ipx->ipx_dna);
364 /* I'm gonna hafta eat this packet */
365 agedelta += IPX_MAXHOPS - ipx->ipx_tc;
366 ipx->ipx_tc = IPX_MAXHOPS;
368 if ((ok_back = ipx_do_route(&ipx->ipx_sna,&ipx_sroute)) == 0) {
369 /* error = ENETUNREACH; He'll never get it! */
370 ipxstat.ipxs_noroute++;
374 if (ipx_droute.ro_rt &&
375 (ifp = ipx_droute.ro_rt->rt_ifp) &&
377 (ifp != ipx_sroute.ro_rt->rt_ifp)) {
378 flags |= IPX_ALLOWBROADCAST;
380 ipxstat.ipxs_noroute++;
386 * We don't need to recompute checksum because ipx_tc field
387 * is ignored by checksum calculation routine, however
388 * it may be desirable to reset checksum if ipxcksum == 0
392 ipx->ipx_sum = 0xffff;
395 error = ipx_outputfl(m, &ipx_droute, flags);
397 ipxstat.ipxs_forward++;
401 ipx_printhost(&ipx->ipx_sna);
403 ipx_printhost(&ipx->ipx_dna);
404 printf(" hops %d\n", ipx->ipx_tc);
406 } else if (mcopy != NULL) {
407 ipx = mtod(mcopy, struct ipx *);
415 ipxstat.ipxs_noroute++;
419 ipxstat.ipxs_mtutoosmall++;
423 ipxstat.ipxs_odropped++;
431 ipx_undo_route(&ipx_droute);
433 ipx_undo_route(&ipx_sroute);
439 ipx_do_route(src, ro)
440 struct ipx_addr *src;
443 struct sockaddr_ipx *dst;
445 bzero((caddr_t)ro, sizeof(*ro));
446 dst = (struct sockaddr_ipx *)&ro->ro_dst;
448 dst->sipx_len = sizeof(*dst);
449 dst->sipx_family = AF_IPX;
450 dst->sipx_addr = *src;
451 dst->sipx_addr.x_port = 0;
453 if (ro->ro_rt == NULL || ro->ro_rt->rt_ifp == NULL) {
464 if (ro->ro_rt != NULL) {
470 ipx_watch_output(m, ifp)
476 struct ipx_ifaddr *ia;
478 * Give any raw listeners a crack at the packet
480 for (ipxp = ipxrawpcb.ipxp_next; ipxp != &ipxrawpcb;
481 ipxp = ipxp->ipxp_next) {
482 struct mbuf *m0 = m_copy(m, 0, (int)M_COPYALL);
486 M_PREPEND(m0, sizeof(*ipx), M_DONTWAIT);
489 ipx = mtod(m0, struct ipx *);
490 ipx->ipx_sna.x_net = ipx_zeronet;
491 for (ia = ipx_ifaddr; ia != NULL; ia = ia->ia_next)
492 if (ifp == ia->ia_ifp)
495 ipx->ipx_sna.x_host = ipx_zerohost;
497 ipx->ipx_sna.x_host =
498 ia->ia_addr.sipx_addr.x_host;
500 if (ifp != NULL && (ifp->if_flags & IFF_POINTOPOINT))
501 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
502 if (ifa->ifa_addr->sa_family == AF_IPX) {
503 ipx->ipx_sna = IA_SIPX(ifa)->sipx_addr;
507 ipx->ipx_len = ntohl(m0->m_pkthdr.len);