2 * Copyright (c) 1984, 1985, 1986, 1987, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)ns_input.c 8.1 (Berkeley) 6/10/93
34 * $FreeBSD: src/sys/netns/ns_input.c,v 1.13 2000/02/13 03:32:04 peter Exp $
35 * $DragonFly: src/sys/netproto/ns/ns_input.c,v 1.6 2003/09/15 23:38:15 hsu Exp $
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/malloc.h>
42 #include <sys/domain.h>
43 #include <sys/protosw.h>
44 #include <sys/socket.h>
45 #include <sys/socketvar.h>
46 #include <sys/errno.h>
48 #include <sys/kernel.h>
51 #include <net/route.h>
52 #include <net/raw_cb.h>
53 #include <net/netisr.h>
62 extern void spp_input(struct mbuf *, struct nspcb *); /* spp_usrreq.c XXX */
67 union ns_host ns_thishost;
68 union ns_host ns_zerohost;
69 union ns_host ns_broadhost;
70 union ns_net ns_zeronet;
71 union ns_net ns_broadnet;
72 struct sockaddr_ns ns_netmask, ns_hostmask;
74 static u_short allones[] = {-1, -1, -1};
76 static struct ifqueue nsintrq;
77 struct nspcb nsrawpcb;
79 int nsqmaxlen = IFQ_MAXLEN;
84 const int nsintrq_present = 1;
86 static void nsintr(struct mbuf *m);
91 ns_broadhost = * (union ns_host *) allones;
92 ns_broadnet = * (union ns_net *) allones;
93 nspcb.nsp_next = nspcb.nsp_prev = &nspcb;
94 nsrawpcb.nsp_next = nsrawpcb.nsp_prev = &nsrawpcb;
96 ns_netmask.sns_len = 6;
97 ns_netmask.sns_addr.x_net = ns_broadnet;
98 ns_hostmask.sns_len = 12;
99 ns_hostmask.sns_addr.x_net = ns_broadnet;
100 ns_hostmask.sns_addr.x_host = ns_broadhost;
101 nsintrq.ifq_maxlen = nsqmaxlen;
102 netisr_register(NETISR_NS, nsintr, &nsintrq);
106 * Idp input routine. Pass to next level.
108 int nsintr_getpck = 0;
109 int nsintr_swtch = 0;
112 nsintr(struct mbuf *m)
121 * Get IDP header in first mbuf.
125 if ((m->m_flags & M_EXT || m->m_len < sizeof (struct idp)) &&
126 (m = m_pullup(m, sizeof (struct idp))) == 0) {
127 idpstat.idps_toosmall++;
132 * Give any raw listeners a crack at the packet
134 for (nsp = nsrawpcb.nsp_next; nsp != &nsrawpcb; nsp = nsp->nsp_next) {
135 struct mbuf *m1 = m_copy(m, 0, (int)M_COPYALL);
136 if (m1) idp_input(m1, nsp);
139 idp = mtod(m, struct idp *);
140 len = ntohs(idp->idp_len);
141 if ((oddpacketp = (len & 1))) {
142 len++; /* If this packet is of odd length,
143 preserve garbage byte for checksum */
147 * Check that the amount of data in the buffers
148 * is as at least much as the IDP header would have us expect.
149 * Trim mbufs if longer than we expect.
150 * Drop packet if shorter than we expect.
152 if (m->m_pkthdr.len < len) {
153 idpstat.idps_tooshort++;
156 if (m->m_pkthdr.len > len) {
157 if (m->m_len == m->m_pkthdr.len) {
159 m->m_pkthdr.len = len;
161 m_adj(m, len - m->m_pkthdr.len);
163 if (idpcksum && ((i = idp->idp_sum)!=0xffff)) {
165 if (i != (idp->idp_sum = ns_cksum(m, len))) {
166 idpstat.idps_badsum++;
168 if (ns_hosteqnh(ns_thishost, idp->idp_dna.x_host))
169 error = NS_ERR_BADSUM;
171 error = NS_ERR_BADSUM_T;
172 ns_error(m, error, 0);
177 * Is this a directed broadcast?
179 if (ns_hosteqnh(ns_broadhost,idp->idp_dna.x_host)) {
180 if ((!ns_neteq(idp->idp_dna, idp->idp_sna)) &&
181 (!ns_neteqnn(idp->idp_dna.x_net, ns_broadnet)) &&
182 (!ns_neteqnn(idp->idp_sna.x_net, ns_zeronet)) &&
183 (!ns_neteqnn(idp->idp_dna.x_net, ns_zeronet)) ) {
185 * Look to see if I need to eat this packet.
186 * Algorithm is to forward all young packets
187 * and prematurely age any packets which will
188 * by physically broadcasted.
189 * Any very old packets eaten without forwarding
192 * Suggestion of Bill Nesheim, Cornell U.
194 if (idp->idp_tc < NS_MAXHOPS) {
200 * Is this our packet? If not, forward.
202 } else if (!ns_hosteqnh(ns_thishost,idp->idp_dna.x_host)) {
207 * Locate pcb for datagram.
209 nsp = ns_pcblookup(&idp->idp_sna, idp->idp_dna.x_port, NS_WILDCARD);
211 * Switch out to protocol's input routine.
218 if ((nsp->nsp_flags & NSP_ALL_PACKETS)==0)
219 switch (idp->idp_pt) {
231 ns_error(m, NS_ERR_NOSOCK, 0);
240 u_char nsctlerrmap[PRC_NCMDS] = {
241 ECONNABORTED, ECONNABORTED, 0, 0,
242 0, 0, EHOSTDOWN, EHOSTUNREACH,
243 ENETUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED,
248 int idp_donosocks = 1;
251 idp_ctlinput(cmd, arg)
257 struct ns_errp *errp = (struct ns_errp *)arg; /* XXX */
260 if (cmd < 0 || cmd > PRC_NCMDS)
262 if (nsctlerrmap[cmd] == 0)
264 type = NS_ERR_UNREACH_HOST;
266 struct sockaddr_ns *sns;
270 case PRC_HOSTUNREACH:
271 sns = (struct sockaddr_ns *)arg;
272 if (sns->sns_family != AF_NS)
278 errp = (struct ns_errp *)arg;
279 ns = &errp->ns_err_idp.idp_dna;
280 type = errp->ns_err_num;
281 type = ntohs((u_short)type);
285 case NS_ERR_UNREACH_HOST:
286 ns_pcbnotify(ns, (int)nsctlerrmap[cmd], idp_abort, (long)0);
290 nsp = ns_pcblookup(ns, errp->ns_err_idp.idp_sna.x_port,
292 if(nsp && idp_donosocks && ! ns_nullhost(nsp->nsp_faddr))
293 (void) idp_drop(nsp, (int)nsctlerrmap[cmd]);
298 int idpforwarding = 1;
300 * Forward a packet. If some error occurs return the sender
301 * an error packet. Note we can't always generate a meaningful
302 * error message because the NS errors don't have a large enough repetoire
303 * of codes and types.
305 struct route idp_droute;
306 struct route idp_sroute;
312 struct idp *idp = mtod(m, struct idp *);
313 int error, type, code;
314 struct mbuf *mcopy = NULL;
316 int flags = NS_FORWARDING;
321 printf("forward: src ");
322 ns_printhost(&idp->idp_sna);
324 ns_printhost(&idp->idp_dna);
325 printf("hop count %d\n", idp->idp_tc);
327 if (idpforwarding == 0) {
328 /* can't tell difference between net and host */
329 type = NS_ERR_UNREACH_HOST, code = 0;
333 if (idp->idp_tc > NS_MAXHOPS) {
334 type = NS_ERR_TOO_OLD, code = 0;
338 * Save at most 42 bytes of the packet in case
339 * we need to generate an NS error message to the src.
341 mcopy = m_copy(m, 0, imin((int)ntohs(idp->idp_len), 42));
343 if ((ok_there = idp_do_route(&idp->idp_dna,&idp_droute))==0) {
344 type = NS_ERR_UNREACH_HOST, code = 0;
348 * Here we think about forwarding broadcast packets,
349 * so we try to insure that it doesn't go back out
350 * on the interface it came in on. Also, if we
351 * are going to physically broadcast this, let us
352 * age the packet so we can eat it safely the second time around.
354 if (idp->idp_dna.x_host.c_host[0] & 0x1) {
355 struct ns_ifaddr *ia = ns_iaonnetof(&idp->idp_dna);
358 /* I'm gonna hafta eat this packet */
359 agedelta += NS_MAXHOPS - idp->idp_tc;
360 idp->idp_tc = NS_MAXHOPS;
362 if ((ok_back = idp_do_route(&idp->idp_sna,&idp_sroute))==0) {
363 /* error = ENETUNREACH; He'll never get it! */
367 if (idp_droute.ro_rt &&
368 (ifp=idp_droute.ro_rt->rt_ifp) &&
370 (ifp!=idp_sroute.ro_rt->rt_ifp)) {
371 flags |= NS_ALLOWBROADCAST;
373 type = NS_ERR_UNREACH_HOST, code = 0;
377 /* need to adjust checksum */
378 if (idp->idp_sum!=0xffff) {
385 x.l = 0; x.c[0] = agedelta;
386 shift = (((((int)ntohs(idp->idp_len))+1)>>1)-2) & 0xf;
387 x.l = idp->idp_sum + (x.s[0] << shift);
388 x.l = x.s[0] + x.s[1];
389 x.l = x.s[0] + x.s[1];
390 if (x.l==0xffff) idp->idp_sum = 0; else idp->idp_sum = x.l;
392 if ((error = ns_output(m, &idp_droute, flags)) &&
394 idp = mtod(mcopy, struct idp *);
395 type = NS_ERR_UNSPEC_T, code = 0;
403 type = NS_ERR_UNREACH_HOST;
407 type = NS_ERR_TOO_BIG;
408 code = 576; /* too hard to figure out mtu here */
412 type = NS_ERR_UNSPEC_T;
417 ns_error(m, type, code);
421 idp_undo_route(&idp_droute);
423 idp_undo_route(&idp_sroute);
429 idp_do_route(src, ro)
434 struct sockaddr_ns *dst;
436 bzero((caddr_t)ro, sizeof (*ro));
437 dst = (struct sockaddr_ns *)&ro->ro_dst;
439 dst->sns_len = sizeof(*dst);
440 dst->sns_family = AF_NS;
441 dst->sns_addr = *src;
442 dst->sns_addr.x_port = 0;
444 if (ro->ro_rt == 0 || ro->ro_rt->rt_ifp == 0) {
455 if (ro->ro_rt) {RTFREE(ro->ro_rt);}
459 ns_watch_output(m, ifp)
466 * Give any raw listeners a crack at the packet
468 for (nsp = nsrawpcb.nsp_next; nsp != &nsrawpcb; nsp = nsp->nsp_next) {
469 struct mbuf *m0 = m_copy(m, 0, (int)M_COPYALL);
473 M_PREPEND(m0, sizeof (*idp), M_DONTWAIT);
476 idp = mtod(m0, struct idp *);
477 idp->idp_sna.x_net = ns_zeronet;
478 idp->idp_sna.x_host = ns_thishost;
479 if (ifp && (ifp->if_flags & IFF_POINTOPOINT))
480 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link)
481 if (ifa->ifa_addr->sa_family==AF_NS) {
482 idp->idp_sna = IA_SNS(ifa)->sns_addr;
485 idp->idp_len = ntohl(m0->m_pkthdr.len);