2 * Copyright (c) 2003, 2004 Jeffrey M. Hsu. All rights reserved.
3 * Copyright (c) 2003, 2004 The DragonFly Project. All rights reserved.
5 * This code is derived from software contributed to The DragonFly Project
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of The DragonFly Project nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific, prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
28 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
29 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
30 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * Copyright (c) 1982, 1986, 1988, 1993
36 * The Regents of the University of California. All rights reserved.
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. All advertising materials mentioning features or use of this software
47 * must display the following acknowledgement:
48 * This product includes software developed by the University of
49 * California, Berkeley and its contributors.
50 * 4. Neither the name of the University nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 * @(#)ip_input.c 8.2 (Berkeley) 1/4/94
67 * $FreeBSD: src/sys/netinet/ip_input.c,v 1.130.2.52 2003/03/07 07:01:28 silby Exp $
68 * $DragonFly: src/sys/netinet/ip_input.c,v 1.66 2007/04/04 06:13:26 dillon Exp $
73 #include "opt_bootp.h"
76 #include "opt_ipdivert.h"
77 #include "opt_ipfilter.h"
78 #include "opt_ipstealth.h"
79 #include "opt_ipsec.h"
81 #include <sys/param.h>
82 #include <sys/systm.h>
84 #include <sys/malloc.h>
85 #include <sys/mpipe.h>
86 #include <sys/domain.h>
87 #include <sys/protosw.h>
88 #include <sys/socket.h>
90 #include <sys/globaldata.h>
91 #include <sys/thread.h>
92 #include <sys/kernel.h>
93 #include <sys/syslog.h>
94 #include <sys/sysctl.h>
95 #include <sys/in_cksum.h>
97 #include <sys/thread2.h>
98 #include <sys/msgport2.h>
100 #include <machine/stdarg.h>
103 #include <net/if_types.h>
104 #include <net/if_var.h>
105 #include <net/if_dl.h>
106 #include <net/pfil.h>
107 #include <net/route.h>
108 #include <net/netisr.h>
109 #include <net/intrq.h>
111 #include <netinet/in.h>
112 #include <netinet/in_systm.h>
113 #include <netinet/in_var.h>
114 #include <netinet/ip.h>
115 #include <netinet/in_pcb.h>
116 #include <netinet/ip_var.h>
117 #include <netinet/ip_icmp.h>
120 #include <sys/socketvar.h>
122 #include <net/ipfw/ip_fw.h>
123 #include <net/dummynet/ip_dummynet.h>
126 #include <netinet6/ipsec.h>
127 #include <netproto/key/key.h>
131 #include <netproto/ipsec/ipsec.h>
132 #include <netproto/ipsec/key.h>
136 static int ip_rsvp_on;
137 struct socket *ip_rsvpd;
139 int ipforwarding = 0;
140 SYSCTL_INT(_net_inet_ip, IPCTL_FORWARDING, forwarding, CTLFLAG_RW,
141 &ipforwarding, 0, "Enable IP forwarding between interfaces");
143 static int ipsendredirects = 1; /* XXX */
144 SYSCTL_INT(_net_inet_ip, IPCTL_SENDREDIRECTS, redirect, CTLFLAG_RW,
145 &ipsendredirects, 0, "Enable sending IP redirects");
147 int ip_defttl = IPDEFTTL;
148 SYSCTL_INT(_net_inet_ip, IPCTL_DEFTTL, ttl, CTLFLAG_RW,
149 &ip_defttl, 0, "Maximum TTL on IP packets");
151 static int ip_dosourceroute = 0;
152 SYSCTL_INT(_net_inet_ip, IPCTL_SOURCEROUTE, sourceroute, CTLFLAG_RW,
153 &ip_dosourceroute, 0, "Enable forwarding source routed IP packets");
155 static int ip_acceptsourceroute = 0;
156 SYSCTL_INT(_net_inet_ip, IPCTL_ACCEPTSOURCEROUTE, accept_sourceroute,
157 CTLFLAG_RW, &ip_acceptsourceroute, 0,
158 "Enable accepting source routed IP packets");
160 static int ip_keepfaith = 0;
161 SYSCTL_INT(_net_inet_ip, IPCTL_KEEPFAITH, keepfaith, CTLFLAG_RW,
163 "Enable packet capture for FAITH IPv4->IPv6 translater daemon");
165 static int nipq = 0; /* total # of reass queues */
167 SYSCTL_INT(_net_inet_ip, OID_AUTO, maxfragpackets, CTLFLAG_RW,
169 "Maximum number of IPv4 fragment reassembly queue entries");
171 static int maxfragsperpacket;
172 SYSCTL_INT(_net_inet_ip, OID_AUTO, maxfragsperpacket, CTLFLAG_RW,
173 &maxfragsperpacket, 0,
174 "Maximum number of IPv4 fragments allowed per packet");
176 static int ip_sendsourcequench = 0;
177 SYSCTL_INT(_net_inet_ip, OID_AUTO, sendsourcequench, CTLFLAG_RW,
178 &ip_sendsourcequench, 0,
179 "Enable the transmission of source quench packets");
181 int ip_do_randomid = 0;
182 SYSCTL_INT(_net_inet_ip, OID_AUTO, random_id, CTLFLAG_RW,
184 "Assign random ip_id values");
186 * XXX - Setting ip_checkinterface mostly implements the receive side of
187 * the Strong ES model described in RFC 1122, but since the routing table
188 * and transmit implementation do not implement the Strong ES model,
189 * setting this to 1 results in an odd hybrid.
191 * XXX - ip_checkinterface currently must be disabled if you use ipnat
192 * to translate the destination address to another local interface.
194 * XXX - ip_checkinterface must be disabled if you add IP aliases
195 * to the loopback interface instead of the interface where the
196 * packets for those addresses are received.
198 static int ip_checkinterface = 0;
199 SYSCTL_INT(_net_inet_ip, OID_AUTO, check_interface, CTLFLAG_RW,
200 &ip_checkinterface, 0, "Verify packet arrives on correct interface");
203 static int ipprintfs = 0;
206 static struct ifqueue ipintrq;
207 static int ipqmaxlen = IFQ_MAXLEN;
209 extern struct domain inetdomain;
210 extern struct protosw inetsw[];
211 u_char ip_protox[IPPROTO_MAX];
212 struct in_ifaddrhead in_ifaddrhead; /* first inet address */
213 struct in_ifaddrhashhead *in_ifaddrhashtbl; /* inet addr hash table */
214 u_long in_ifaddrhmask; /* mask for hash table */
216 SYSCTL_INT(_net_inet_ip, IPCTL_INTRQMAXLEN, intr_queue_maxlen, CTLFLAG_RW,
217 &ipintrq.ifq_maxlen, 0, "Maximum size of the IP input queue");
218 SYSCTL_INT(_net_inet_ip, IPCTL_INTRQDROPS, intr_queue_drops, CTLFLAG_RD,
219 &ipintrq.ifq_drops, 0, "Number of packets dropped from the IP input queue");
221 struct ip_stats ipstats_percpu[MAXCPU];
224 sysctl_ipstats(SYSCTL_HANDLER_ARGS)
228 for (cpu = 0; cpu < ncpus; ++cpu) {
229 if ((error = SYSCTL_OUT(req, &ipstats_percpu[cpu],
230 sizeof(struct ip_stats))))
232 if ((error = SYSCTL_IN(req, &ipstats_percpu[cpu],
233 sizeof(struct ip_stats))))
239 SYSCTL_PROC(_net_inet_ip, IPCTL_STATS, stats, (CTLTYPE_OPAQUE | CTLFLAG_RW),
240 0, 0, sysctl_ipstats, "S,ip_stats", "IP statistics");
242 SYSCTL_STRUCT(_net_inet_ip, IPCTL_STATS, stats, CTLFLAG_RW,
243 &ipstat, ip_stats, "IP statistics");
246 /* Packet reassembly stuff */
247 #define IPREASS_NHASH_LOG2 6
248 #define IPREASS_NHASH (1 << IPREASS_NHASH_LOG2)
249 #define IPREASS_HMASK (IPREASS_NHASH - 1)
250 #define IPREASS_HASH(x,y) \
251 (((((x) & 0xF) | ((((x) >> 8) & 0xF) << 4)) ^ (y)) & IPREASS_HMASK)
253 static struct ipq ipq[IPREASS_NHASH];
254 const int ipintrq_present = 1;
257 SYSCTL_INT(_net_inet_ip, IPCTL_DEFMTU, mtu, CTLFLAG_RW,
258 &ip_mtu, 0, "Default MTU");
262 static int ipstealth = 0;
263 SYSCTL_INT(_net_inet_ip, OID_AUTO, stealth, CTLFLAG_RW, &ipstealth, 0, "");
265 static const int ipstealth = 0;
270 ip_fw_chk_t *ip_fw_chk_ptr;
275 ip_dn_io_t *ip_dn_io_ptr;
277 struct pfil_head inet_pfil_hook;
280 * XXX this is ugly -- the following two global variables are
281 * used to store packet state while it travels through the stack.
282 * Note that the code even makes assumptions on the size and
283 * alignment of fields inside struct ip_srcrt so e.g. adding some
284 * fields will break the code. This needs to be fixed.
286 * We need to save the IP options in case a protocol wants to respond
287 * to an incoming packet over the same route if the packet got here
288 * using IP source routing. This allows connection establishment and
289 * maintenance when the remote end is on a network that is not known
292 static int ip_nhops = 0;
294 static struct ip_srcrt {
295 struct in_addr dst; /* final destination */
296 char nop; /* one NOP to align */
297 char srcopt[IPOPT_OFFSET + 1]; /* OPTVAL, OLEN and OFFSET */
298 struct in_addr route[MAX_IPOPTLEN/sizeof(struct in_addr)];
301 static MALLOC_DEFINE(M_IPQ, "ipq", "IP Fragment Management");
302 static struct malloc_pipe ipq_mpipe;
304 static void save_rte (u_char *, struct in_addr);
305 static int ip_dooptions (struct mbuf *m, int,
306 struct sockaddr_in *next_hop);
307 static void ip_forward (struct mbuf *m, boolean_t using_srcrt,
308 struct sockaddr_in *next_hop);
309 static void ip_freef (struct ipq *);
310 static int ip_input_handler (struct netmsg *);
311 static struct mbuf *ip_reass (struct mbuf *, struct ipq *,
312 struct ipq *, u_int32_t *);
315 * IP initialization: fill in IP protocol switch table.
316 * All protocols not implemented in kernel go to raw IP protocol handler.
328 * Make sure we can handle a reasonable number of fragments but
329 * cap it at 4000 (XXX).
331 mpipe_init(&ipq_mpipe, M_IPQ, sizeof(struct ipq),
332 IFQ_MAXLEN, 4000, 0, NULL);
333 TAILQ_INIT(&in_ifaddrhead);
334 in_ifaddrhashtbl = hashinit(INADDR_NHASH, M_IFADDR, &in_ifaddrhmask);
335 pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW);
338 for (i = 0; i < IPPROTO_MAX; i++)
339 ip_protox[i] = pr - inetsw;
340 for (pr = inetdomain.dom_protosw;
341 pr < inetdomain.dom_protoswNPROTOSW; pr++)
342 if (pr->pr_domain->dom_family == PF_INET &&
343 pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW)
344 ip_protox[pr->pr_protocol] = pr - inetsw;
346 inet_pfil_hook.ph_type = PFIL_TYPE_AF;
347 inet_pfil_hook.ph_af = AF_INET;
348 if ((i = pfil_head_register(&inet_pfil_hook)) != 0) {
349 kprintf("%s: WARNING: unable to register pfil hook, "
350 "error %d\n", __func__, i);
353 for (i = 0; i < IPREASS_NHASH; i++)
354 ipq[i].next = ipq[i].prev = &ipq[i];
356 maxnipq = nmbclusters / 32;
357 maxfragsperpacket = 16;
359 ip_id = time_second & 0xffff;
360 ipintrq.ifq_maxlen = ipqmaxlen;
363 * Initialize IP statistics counters for each CPU.
367 for (cpu = 0; cpu < ncpus; ++cpu) {
368 bzero(&ipstats_percpu[cpu], sizeof(struct ip_stats));
371 bzero(&ipstat, sizeof(struct ip_stats));
374 netisr_register(NETISR_IP, ip_mport, ip_input_handler);
378 * XXX watch out this one. It is perhaps used as a cache for
379 * the most recently used route ? it is cleared in in_addroute()
380 * when a new route is successfully created.
382 struct route ipforward_rt[MAXCPU];
384 /* Do transport protocol processing. */
386 transport_processing_oncpu(struct mbuf *m, int hlen, struct ip *ip,
387 struct sockaddr_in *nexthop)
390 * Switch out to protocol's input routine.
392 if (nexthop && ip->ip_p == IPPROTO_TCP) {
393 /* TCP needs IPFORWARD info if available */
396 tag.mh_type = MT_TAG;
397 tag.mh_flags = PACKET_TAG_IPFORWARD;
398 tag.mh_data = (caddr_t)nexthop;
401 (*inetsw[ip_protox[ip->ip_p]].pr_input)
402 ((struct mbuf *)&tag, hlen, ip->ip_p);
404 (*inetsw[ip_protox[ip->ip_p]].pr_input)(m, hlen, ip->ip_p);
408 struct netmsg_transport_packet {
409 struct lwkt_msg nm_lmsg;
410 struct mbuf *nm_mbuf;
412 boolean_t nm_hasnexthop;
413 struct sockaddr_in nm_nexthop;
417 transport_processing_handler(lwkt_msg_t lmsg)
419 struct netmsg_transport_packet *msg = (void *)lmsg;
420 struct sockaddr_in *nexthop;
423 ip = mtod(msg->nm_mbuf, struct ip *);
424 nexthop = msg->nm_hasnexthop ? &msg->nm_nexthop : NULL;
425 transport_processing_oncpu(msg->nm_mbuf, msg->nm_hlen, ip, nexthop);
426 lwkt_replymsg(lmsg, 0);
431 ip_input_handler(struct netmsg *msg0)
433 struct mbuf *m = ((struct netmsg_packet *)msg0)->nm_packet;
436 /* msg0 was embedded in the mbuf, do not reply! */
441 * IP input routine. Checksum and byte swap header. If fragmented
442 * try to reassemble. Process options. Pass to next level.
445 ip_input(struct mbuf *m)
449 struct in_ifaddr *ia = NULL;
451 int i, hlen, checkif;
453 struct in_addr pkt_dst;
454 u_int32_t divert_info = 0; /* packet divert/tee info */
455 struct ip_fw_args args;
456 boolean_t using_srcrt = FALSE; /* forward (by PFIL_HOOKS) */
457 boolean_t needredispatch = FALSE;
458 struct in_addr odst; /* original dst address(NAT) */
459 #if defined(FAST_IPSEC) || defined(IPDIVERT)
463 struct tdb_ident *tdbi;
464 struct secpolicy *sp;
471 args.next_hop = NULL;
473 /* Grab info from MT_TAG mbufs prepended to the chain. */
474 while (m != NULL && m->m_type == MT_TAG) {
475 switch(m->_m_tag_id) {
476 case PACKET_TAG_DUMMYNET:
477 args.rule = ((struct dn_pkt *)m)->rule;
479 case PACKET_TAG_IPFORWARD:
480 args.next_hop = (struct sockaddr_in *)m->m_hdr.mh_data;
483 kprintf("ip_input: unrecognised MT_TAG tag %d\n",
489 KASSERT(m != NULL && (m->m_flags & M_PKTHDR), ("ip_input: no HDR"));
491 if (args.rule != NULL) { /* dummynet already filtered us */
492 ip = mtod(m, struct ip *);
493 hlen = IP_VHL_HL(ip->ip_vhl) << 2;
499 /* length checks already done in ip_demux() */
500 KASSERT(m->m_len >= sizeof(ip), ("IP header not in one mbuf"));
502 ip = mtod(m, struct ip *);
504 if (IP_VHL_V(ip->ip_vhl) != IPVERSION) {
505 ipstat.ips_badvers++;
509 hlen = IP_VHL_HL(ip->ip_vhl) << 2;
510 /* length checks already done in ip_demux() */
511 KASSERT(hlen >= sizeof(struct ip), ("IP header len too small"));
512 KASSERT(m->m_len >= hlen, ("packet shorter than IP header length"));
514 /* 127/8 must not appear on wire - RFC1122 */
515 if ((ntohl(ip->ip_dst.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET ||
516 (ntohl(ip->ip_src.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) {
517 if (!(m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK)) {
518 ipstat.ips_badaddr++;
523 if (m->m_pkthdr.csum_flags & CSUM_IP_CHECKED) {
524 sum = !(m->m_pkthdr.csum_flags & CSUM_IP_VALID);
526 if (hlen == sizeof(struct ip)) {
527 sum = in_cksum_hdr(ip);
529 sum = in_cksum(m, hlen);
538 if (altq_input != NULL && (*altq_input)(m, AF_INET) == 0) {
539 /* packet is dropped by traffic conditioner */
544 * Convert fields to host representation.
546 ip->ip_len = ntohs(ip->ip_len);
547 if (ip->ip_len < hlen) {
551 ip->ip_off = ntohs(ip->ip_off);
554 * Check that the amount of data in the buffers
555 * is as at least much as the IP header would have us expect.
556 * Trim mbufs if longer than we expect.
557 * Drop packet if shorter than we expect.
559 if (m->m_pkthdr.len < ip->ip_len) {
560 ipstat.ips_tooshort++;
563 if (m->m_pkthdr.len > ip->ip_len) {
564 if (m->m_len == m->m_pkthdr.len) {
565 m->m_len = ip->ip_len;
566 m->m_pkthdr.len = ip->ip_len;
568 m_adj(m, ip->ip_len - m->m_pkthdr.len);
570 #if defined(IPSEC) && !defined(IPSEC_FILTERGIF)
572 * Bypass packet filtering for packets from a tunnel (gif).
574 if (ipsec_gethist(m, NULL))
580 * Right now when no processing on packet has done
581 * and it is still fresh out of network we do our black
583 * - Firewall: deny/allow/divert
584 * - Xlate: translate packet's addr/port (NAT).
585 * - Pipe: pass pkt through dummynet.
586 * - Wrap: fake packet's addr/port <unimpl.>
587 * - Encapsulate: put it in another IP and send out. <unimp.>
593 * Run through list of hooks for input packets.
595 * NB: Beware of the destination address changing (e.g.
596 * by NAT rewriting). When this happens, tell
597 * ip_forward to do the right thing.
599 if (pfil_has_hooks(&inet_pfil_hook)) {
601 if (pfil_run_hooks(&inet_pfil_hook, &m,
602 m->m_pkthdr.rcvif, PFIL_IN)) {
605 if (m == NULL) /* consumed by filter */
607 ip = mtod(m, struct ip *);
608 using_srcrt = (odst.s_addr != ip->ip_dst.s_addr);
611 if (fw_enable && IPFW_LOADED) {
613 * If we've been forwarded from the output side, then
614 * skip the firewall a second time
616 if (args.next_hop != NULL)
620 i = ip_fw_chk_ptr(&args);
623 if ((i & IP_FW_PORT_DENY_FLAG) || m == NULL) { /* drop */
628 ip = mtod(m, struct ip *); /* just in case m changed */
629 if (i == 0 && args.next_hop == NULL) /* common case */
631 if (DUMMYNET_LOADED && (i & IP_FW_PORT_DYNT_FLAG)) {
632 /* Send packet to the appropriate pipe */
633 ip_dn_io_ptr(m, i&0xffff, DN_TO_IP_IN, &args);
637 if (i != 0 && !(i & IP_FW_PORT_DYNT_FLAG)) {
638 /* Divert or tee packet */
643 if (i == 0 && args.next_hop != NULL)
646 * if we get here, the packet must be dropped
654 * Process options and, if not destined for us,
655 * ship it on. ip_dooptions returns 1 when an
656 * error was detected (causing an icmp message
657 * to be sent and the original packet to be freed).
659 ip_nhops = 0; /* for source routed packets */
660 if (hlen > sizeof(struct ip) && ip_dooptions(m, 0, args.next_hop))
663 /* greedy RSVP, snatches any PATH packet of the RSVP protocol and no
664 * matter if it is destined to another node, or whether it is
665 * a multicast one, RSVP wants it! and prevents it from being forwarded
666 * anywhere else. Also checks if the rsvp daemon is running before
667 * grabbing the packet.
669 if (rsvp_on && ip->ip_p == IPPROTO_RSVP)
673 * Check our list of addresses, to see if the packet is for us.
674 * If we don't have any addresses, assume any unicast packet
675 * we receive might be for us (and let the upper layers deal
678 if (TAILQ_EMPTY(&in_ifaddrhead) && !(m->m_flags & (M_MCAST | M_BCAST)))
682 * Cache the destination address of the packet; this may be
683 * changed by use of 'ipfw fwd'.
685 pkt_dst = args.next_hop ? args.next_hop->sin_addr : ip->ip_dst;
688 * Enable a consistency check between the destination address
689 * and the arrival interface for a unicast packet (the RFC 1122
690 * strong ES model) if IP forwarding is disabled and the packet
691 * is not locally generated and the packet is not subject to
694 * XXX - Checking also should be disabled if the destination
695 * address is ipnat'ed to a different interface.
697 * XXX - Checking is incompatible with IP aliases added
698 * to the loopback interface instead of the interface where
699 * the packets are received.
701 checkif = ip_checkinterface &&
703 m->m_pkthdr.rcvif != NULL &&
704 !(m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) &&
705 (args.next_hop == NULL);
708 * Check for exact addresses in the hash bucket.
710 LIST_FOREACH(ia, INADDR_HASH(pkt_dst.s_addr), ia_hash) {
712 * If the address matches, verify that the packet
713 * arrived via the correct interface if checking is
716 if (IA_SIN(ia)->sin_addr.s_addr == pkt_dst.s_addr &&
717 (!checkif || ia->ia_ifp == m->m_pkthdr.rcvif))
721 * Check for broadcast addresses.
723 * Only accept broadcast packets that arrive via the matching
724 * interface. Reception of forwarded directed broadcasts would
725 * be handled via ip_forward() and ether_output() with the loopback
726 * into the stack for SIMPLEX interfaces handled by ether_output().
728 if (m->m_pkthdr.rcvif->if_flags & IFF_BROADCAST) {
729 TAILQ_FOREACH(ifa, &m->m_pkthdr.rcvif->if_addrhead, ifa_link) {
730 if (ifa->ifa_addr == NULL) /* shutdown/startup race */
732 if (ifa->ifa_addr->sa_family != AF_INET)
735 if (satosin(&ia->ia_broadaddr)->sin_addr.s_addr ==
738 if (ia->ia_netbroadcast.s_addr == pkt_dst.s_addr)
741 if (IA_SIN(ia)->sin_addr.s_addr == INADDR_ANY)
746 if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr))) {
747 struct in_multi *inm;
749 if (ip_mrouter != NULL) {
751 * If we are acting as a multicast router, all
752 * incoming multicast packets are passed to the
753 * kernel-level multicast forwarding function.
754 * The packet is returned (relatively) intact; if
755 * ip_mforward() returns a non-zero value, the packet
756 * must be discarded, else it may be accepted below.
758 if (ip_mforward != NULL &&
759 ip_mforward(ip, m->m_pkthdr.rcvif, m, NULL) != 0) {
760 ipstat.ips_cantforward++;
766 * The process-level routing daemon needs to receive
767 * all multicast IGMP packets, whether or not this
768 * host belongs to their destination groups.
770 if (ip->ip_p == IPPROTO_IGMP)
772 ipstat.ips_forward++;
775 * See if we belong to the destination multicast group on the
778 IN_LOOKUP_MULTI(ip->ip_dst, m->m_pkthdr.rcvif, inm);
780 ipstat.ips_notmember++;
786 if (ip->ip_dst.s_addr == INADDR_BROADCAST)
788 if (ip->ip_dst.s_addr == INADDR_ANY)
792 * FAITH(Firewall Aided Internet Translator)
794 if (m->m_pkthdr.rcvif && m->m_pkthdr.rcvif->if_type == IFT_FAITH) {
796 if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_ICMP)
804 * Not for us; forward if possible and desirable.
807 ipstat.ips_cantforward++;
812 * Enforce inbound IPsec SPD.
814 if (ipsec4_in_reject(m, NULL)) {
815 ipsecstat.in_polvio++;
820 mtag = m_tag_find(m, PACKET_TAG_IPSEC_IN_DONE, NULL);
823 tdbi = (struct tdb_ident *)m_tag_data(mtag);
824 sp = ipsec_getpolicy(tdbi, IPSEC_DIR_INBOUND);
826 sp = ipsec_getpolicybyaddr(m, IPSEC_DIR_INBOUND,
827 IP_FORWARDING, &error);
829 if (sp == NULL) { /* NB: can happen if error */
831 /*XXX error stat???*/
832 DPRINTF(("ip_input: no SP for forwarding\n")); /*XXX*/
837 * Check security policy against packet attributes.
839 error = ipsec_in_reject(sp, m);
843 ipstat.ips_cantforward++;
847 ip_forward(m, using_srcrt, args.next_hop);
854 * IPSTEALTH: Process non-routing options only
855 * if the packet is destined for us.
858 hlen > sizeof(struct ip) &&
859 ip_dooptions(m, 1, args.next_hop))
862 /* Count the packet in the ip address stats */
864 ia->ia_ifa.if_ipackets++;
865 ia->ia_ifa.if_ibytes += m->m_pkthdr.len;
869 * If offset or IP_MF are set, must reassemble.
870 * Otherwise, nothing need be done.
871 * (We could look in the reassembly queue to see
872 * if the packet was previously fragmented,
873 * but it's not worth the time; just let them time out.)
875 if (ip->ip_off & (IP_MF | IP_OFFMASK)) {
877 /* If maxnipq is 0, never accept fragments. */
879 ipstat.ips_fragments++;
880 ipstat.ips_fragdropped++;
884 sum = IPREASS_HASH(ip->ip_src.s_addr, ip->ip_id);
886 * Look for queue of fragments
889 for (fp = ipq[sum].next; fp != &ipq[sum]; fp = fp->next)
890 if (ip->ip_id == fp->ipq_id &&
891 ip->ip_src.s_addr == fp->ipq_src.s_addr &&
892 ip->ip_dst.s_addr == fp->ipq_dst.s_addr &&
893 ip->ip_p == fp->ipq_p)
899 * Enforce upper bound on number of fragmented packets
900 * for which we attempt reassembly;
901 * If maxnipq is -1, accept all fragments without limitation.
903 if ((nipq > maxnipq) && (maxnipq > 0)) {
905 * drop something from the tail of the current queue
906 * before proceeding further
908 if (ipq[sum].prev == &ipq[sum]) { /* gak */
909 for (i = 0; i < IPREASS_NHASH; i++) {
910 if (ipq[i].prev != &ipq[i]) {
911 ipstat.ips_fragtimeout +=
912 ipq[i].prev->ipq_nfrags;
913 ip_freef(ipq[i].prev);
918 ipstat.ips_fragtimeout +=
919 ipq[sum].prev->ipq_nfrags;
920 ip_freef(ipq[sum].prev);
925 * Adjust ip_len to not reflect header,
926 * convert offset of this to bytes.
929 if (ip->ip_off & IP_MF) {
931 * Make sure that fragments have a data length
932 * that's a non-zero multiple of 8 bytes.
934 if (ip->ip_len == 0 || (ip->ip_len & 0x7) != 0) {
935 ipstat.ips_toosmall++; /* XXX */
938 m->m_flags |= M_FRAG;
940 m->m_flags &= ~M_FRAG;
944 * Attempt reassembly; if it succeeds, proceed.
945 * ip_reass() will return a different mbuf, and update
946 * the divert info in divert_info.
948 ipstat.ips_fragments++;
949 m->m_pkthdr.header = ip;
950 m = ip_reass(m, fp, &ipq[sum], &divert_info);
953 ipstat.ips_reassembled++;
954 needredispatch = TRUE;
955 ip = mtod(m, struct ip *);
956 /* Get the header length of the reassembled packet */
957 hlen = IP_VHL_HL(ip->ip_vhl) << 2;
959 /* Restore original checksum before diverting packet */
960 if (divert_info != 0) {
962 ip->ip_len = htons(ip->ip_len);
963 ip->ip_off = htons(ip->ip_off);
965 if (hlen == sizeof(struct ip))
966 ip->ip_sum = in_cksum_hdr(ip);
968 ip->ip_sum = in_cksum(m, hlen);
969 ip->ip_off = ntohs(ip->ip_off);
970 ip->ip_len = ntohs(ip->ip_len);
980 * Divert or tee packet to the divert protocol if required.
982 if (divert_info != 0) {
983 struct mbuf *clone = NULL;
985 /* Clone packet if we're doing a 'tee' */
986 if ((divert_info & IP_FW_PORT_TEE_FLAG) != 0)
987 clone = m_dup(m, MB_DONTWAIT);
989 /* Restore packet header fields to original values */
991 ip->ip_len = htons(ip->ip_len);
992 ip->ip_off = htons(ip->ip_off);
994 /* Deliver packet to divert input routine */
995 divert_packet(m, 1, divert_info & 0xffff);
996 ipstat.ips_delivered++;
998 /* If 'tee', continue with original packet */
1002 ip = mtod(m, struct ip *);
1005 * Jump backwards to complete processing of the
1006 * packet. But first clear divert_info to avoid
1007 * entering this block again.
1008 * We do not need to clear args.divert_rule
1009 * or args.next_hop as they will not be used.
1011 * XXX Better safe than sorry, remove the DIVERT tag.
1013 mtag = m_tag_find(m, PACKET_TAG_IPFW_DIVERT, NULL);
1015 m_tag_delete(m, mtag);
1024 * enforce IPsec policy checking if we are seeing last header.
1025 * note that we do not visit this with protocols with pcb layer
1026 * code - like udp/tcp/raw ip.
1028 if ((inetsw[ip_protox[ip->ip_p]].pr_flags & PR_LASTHDR) &&
1029 ipsec4_in_reject(m, NULL)) {
1030 ipsecstat.in_polvio++;
1036 * enforce IPsec policy checking if we are seeing last header.
1037 * note that we do not visit this with protocols with pcb layer
1038 * code - like udp/tcp/raw ip.
1040 if (inetsw[ip_protox[ip->ip_p]].pr_flags & PR_LASTHDR) {
1042 * Check if the packet has already had IPsec processing
1043 * done. If so, then just pass it along. This tag gets
1044 * set during AH, ESP, etc. input handling, before the
1045 * packet is returned to the ip input queue for delivery.
1047 mtag = m_tag_find(m, PACKET_TAG_IPSEC_IN_DONE, NULL);
1050 tdbi = (struct tdb_ident *)m_tag_data(mtag);
1051 sp = ipsec_getpolicy(tdbi, IPSEC_DIR_INBOUND);
1053 sp = ipsec_getpolicybyaddr(m, IPSEC_DIR_INBOUND,
1054 IP_FORWARDING, &error);
1058 * Check security policy against packet attributes.
1060 error = ipsec_in_reject(sp, m);
1063 /* XXX error stat??? */
1065 DPRINTF(("ip_input: no SP, packet discarded\n"));/*XXX*/
1072 #endif /* FAST_IPSEC */
1074 ipstat.ips_delivered++;
1075 if (needredispatch) {
1076 struct netmsg_transport_packet *msg;
1079 ip->ip_off = htons(ip->ip_off);
1080 ip->ip_len = htons(ip->ip_len);
1081 port = ip_mport(&m);
1085 msg = kmalloc(sizeof(struct netmsg_transport_packet), M_LWKTMSG,
1086 M_INTWAIT | M_NULLOK);
1090 lwkt_initmsg(&msg->nm_lmsg, &netisr_afree_rport, 0,
1091 lwkt_cmd_func(transport_processing_handler),
1093 msg->nm_hlen = hlen;
1094 msg->nm_hasnexthop = (args.next_hop != NULL);
1095 if (msg->nm_hasnexthop)
1096 msg->nm_nexthop = *args.next_hop; /* structure copy */
1099 ip = mtod(m, struct ip *);
1100 ip->ip_len = ntohs(ip->ip_len);
1101 ip->ip_off = ntohs(ip->ip_off);
1102 lwkt_sendmsg(port, &msg->nm_lmsg);
1104 transport_processing_oncpu(m, hlen, ip, args.next_hop);
1113 * Take incoming datagram fragment and try to reassemble it into
1114 * whole datagram. If a chain for reassembly of this datagram already
1115 * exists, then it is given as fp; otherwise have to make a chain.
1117 * When IPDIVERT enabled, keep additional state with each packet that
1118 * tells us if we need to divert or tee the packet we're building.
1119 * In particular, *divinfo includes the port and TEE flag.
1122 static struct mbuf *
1123 ip_reass(struct mbuf *m, struct ipq *fp, struct ipq *where,
1126 struct ip *ip = mtod(m, struct ip *);
1127 struct mbuf *p = NULL, *q, *nq;
1129 int hlen = IP_VHL_HL(ip->ip_vhl) << 2;
1136 * Presence of header sizes in mbufs
1137 * would confuse code below.
1143 * If first fragment to arrive, create a reassembly queue.
1146 if ((fp = mpipe_alloc_nowait(&ipq_mpipe)) == NULL)
1151 fp->ipq_ttl = IPFRAGTTL;
1152 fp->ipq_p = ip->ip_p;
1153 fp->ipq_id = ip->ip_id;
1154 fp->ipq_src = ip->ip_src;
1155 fp->ipq_dst = ip->ip_dst;
1157 m->m_nextpkt = NULL;
1159 fp->ipq_div_info = 0;
1166 #define GETIP(m) ((struct ip*)((m)->m_pkthdr.header))
1169 * Find a segment which begins after this one does.
1171 for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt)
1172 if (GETIP(q)->ip_off > ip->ip_off)
1176 * If there is a preceding segment, it may provide some of
1177 * our data already. If so, drop the data from the incoming
1178 * segment. If it provides all of our data, drop us, otherwise
1179 * stick new segment in the proper place.
1181 * If some of the data is dropped from the the preceding
1182 * segment, then it's checksum is invalidated.
1185 i = GETIP(p)->ip_off + GETIP(p)->ip_len - ip->ip_off;
1187 if (i >= ip->ip_len)
1190 m->m_pkthdr.csum_flags = 0;
1194 m->m_nextpkt = p->m_nextpkt;
1197 m->m_nextpkt = fp->ipq_frags;
1202 * While we overlap succeeding segments trim them or,
1203 * if they are completely covered, dequeue them.
1205 for (; q != NULL && ip->ip_off + ip->ip_len > GETIP(q)->ip_off;
1207 i = (ip->ip_off + ip->ip_len) - GETIP(q)->ip_off;
1208 if (i < GETIP(q)->ip_len) {
1209 GETIP(q)->ip_len -= i;
1210 GETIP(q)->ip_off += i;
1212 q->m_pkthdr.csum_flags = 0;
1217 ipstat.ips_fragdropped++;
1219 q->m_nextpkt = NULL;
1227 * Transfer firewall instructions to the fragment structure.
1228 * Only trust info in the fragment at offset 0.
1230 if (ip->ip_off == 0) {
1231 fp->ipq_div_info = *divinfo;
1233 mtag = m_tag_find(m, PACKET_TAG_IPFW_DIVERT, NULL);
1235 m_tag_delete(m, mtag);
1241 * Check for complete reassembly and perform frag per packet
1244 * Frag limiting is performed here so that the nth frag has
1245 * a chance to complete the packet before we drop the packet.
1246 * As a result, n+1 frags are actually allowed per packet, but
1247 * only n will ever be stored. (n = maxfragsperpacket.)
1251 for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt) {
1252 if (GETIP(q)->ip_off != next) {
1253 if (fp->ipq_nfrags > maxfragsperpacket) {
1254 ipstat.ips_fragdropped += fp->ipq_nfrags;
1259 next += GETIP(q)->ip_len;
1261 /* Make sure the last packet didn't have the IP_MF flag */
1262 if (p->m_flags & M_FRAG) {
1263 if (fp->ipq_nfrags > maxfragsperpacket) {
1264 ipstat.ips_fragdropped += fp->ipq_nfrags;
1271 * Reassembly is complete. Make sure the packet is a sane size.
1275 if (next + (IP_VHL_HL(ip->ip_vhl) << 2) > IP_MAXPACKET) {
1276 ipstat.ips_toolong++;
1277 ipstat.ips_fragdropped += fp->ipq_nfrags;
1283 * Concatenate fragments.
1290 q->m_nextpkt = NULL;
1291 for (q = nq; q != NULL; q = nq) {
1293 q->m_nextpkt = NULL;
1294 m->m_pkthdr.csum_flags &= q->m_pkthdr.csum_flags;
1295 m->m_pkthdr.csum_data += q->m_pkthdr.csum_data;
1301 * Extract firewall instructions from the fragment structure.
1303 *divinfo = fp->ipq_div_info;
1307 * Create header for new ip packet by
1308 * modifying header of first packet;
1309 * dequeue and discard fragment reassembly header.
1310 * Make header visible.
1313 ip->ip_src = fp->ipq_src;
1314 ip->ip_dst = fp->ipq_dst;
1317 mpipe_free(&ipq_mpipe, fp);
1318 m->m_len += (IP_VHL_HL(ip->ip_vhl) << 2);
1319 m->m_data -= (IP_VHL_HL(ip->ip_vhl) << 2);
1320 /* some debugging cruft by sklower, below, will go away soon */
1321 if (m->m_flags & M_PKTHDR) { /* XXX this should be done elsewhere */
1324 for (n = m; n; n = n->m_next)
1326 m->m_pkthdr.len = plen;
1334 ipstat.ips_fragdropped++;
1344 * Free a fragment reassembly header and all
1345 * associated datagrams.
1348 ip_freef(struct ipq *fp)
1352 while (fp->ipq_frags) {
1354 fp->ipq_frags = q->m_nextpkt;
1355 q->m_nextpkt = NULL;
1359 mpipe_free(&ipq_mpipe, fp);
1364 * IP timer processing;
1365 * if a timer expires on a reassembly
1366 * queue, discard it.
1375 for (i = 0; i < IPREASS_NHASH; i++) {
1379 while (fp != &ipq[i]) {
1382 if (fp->prev->ipq_ttl == 0) {
1383 ipstat.ips_fragtimeout += fp->prev->ipq_nfrags;
1389 * If we are over the maximum number of fragments
1390 * (due to the limit being lowered), drain off
1391 * enough to get down to the new limit.
1393 if (maxnipq >= 0 && nipq > maxnipq) {
1394 for (i = 0; i < IPREASS_NHASH; i++) {
1395 while (nipq > maxnipq &&
1396 (ipq[i].next != &ipq[i])) {
1397 ipstat.ips_fragdropped +=
1398 ipq[i].next->ipq_nfrags;
1399 ip_freef(ipq[i].next);
1408 * Drain off all datagram fragments.
1415 for (i = 0; i < IPREASS_NHASH; i++) {
1416 while (ipq[i].next != &ipq[i]) {
1417 ipstat.ips_fragdropped += ipq[i].next->ipq_nfrags;
1418 ip_freef(ipq[i].next);
1425 * Do option processing on a datagram,
1426 * possibly discarding it if bad options are encountered,
1427 * or forwarding it if source-routed.
1428 * The pass argument is used when operating in the IPSTEALTH
1429 * mode to tell what options to process:
1430 * [LS]SRR (pass 0) or the others (pass 1).
1431 * The reason for as many as two passes is that when doing IPSTEALTH,
1432 * non-routing options should be processed only if the packet is for us.
1433 * Returns 1 if packet has been forwarded/freed,
1434 * 0 if the packet should be processed further.
1437 ip_dooptions(struct mbuf *m, int pass, struct sockaddr_in *next_hop)
1439 struct sockaddr_in ipaddr = { sizeof ipaddr, AF_INET };
1440 struct ip *ip = mtod(m, struct ip *);
1442 struct in_ifaddr *ia;
1443 int opt, optlen, cnt, off, code, type = ICMP_PARAMPROB;
1444 boolean_t forward = FALSE;
1445 struct in_addr *sin, dst;
1449 cp = (u_char *)(ip + 1);
1450 cnt = (IP_VHL_HL(ip->ip_vhl) << 2) - sizeof(struct ip);
1451 for (; cnt > 0; cnt -= optlen, cp += optlen) {
1452 opt = cp[IPOPT_OPTVAL];
1453 if (opt == IPOPT_EOL)
1455 if (opt == IPOPT_NOP)
1458 if (cnt < IPOPT_OLEN + sizeof(*cp)) {
1459 code = &cp[IPOPT_OLEN] - (u_char *)ip;
1462 optlen = cp[IPOPT_OLEN];
1463 if (optlen < IPOPT_OLEN + sizeof(*cp) || optlen > cnt) {
1464 code = &cp[IPOPT_OLEN] - (u_char *)ip;
1474 * Source routing with record.
1475 * Find interface with current destination address.
1476 * If none on this machine then drop if strictly routed,
1477 * or do nothing if loosely routed.
1478 * Record interface address and bring up next address
1479 * component. If strictly routed make sure next
1480 * address is on directly accessible net.
1484 if (ipstealth && pass > 0)
1486 if (optlen < IPOPT_OFFSET + sizeof(*cp)) {
1487 code = &cp[IPOPT_OLEN] - (u_char *)ip;
1490 if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
1491 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1494 ipaddr.sin_addr = ip->ip_dst;
1495 ia = (struct in_ifaddr *)
1496 ifa_ifwithaddr((struct sockaddr *)&ipaddr);
1498 if (opt == IPOPT_SSRR) {
1499 type = ICMP_UNREACH;
1500 code = ICMP_UNREACH_SRCFAIL;
1503 if (!ip_dosourceroute)
1504 goto nosourcerouting;
1506 * Loose routing, and not at next destination
1507 * yet; nothing to do except forward.
1511 off--; /* 0 origin */
1512 if (off > optlen - (int)sizeof(struct in_addr)) {
1514 * End of source route. Should be for us.
1516 if (!ip_acceptsourceroute)
1517 goto nosourcerouting;
1518 save_rte(cp, ip->ip_src);
1523 if (!ip_dosourceroute) {
1525 char buf[sizeof "aaa.bbb.ccc.ddd"];
1528 * Acting as a router, so generate ICMP
1531 strcpy(buf, inet_ntoa(ip->ip_dst));
1533 "attempted source route from %s to %s\n",
1534 inet_ntoa(ip->ip_src), buf);
1535 type = ICMP_UNREACH;
1536 code = ICMP_UNREACH_SRCFAIL;
1540 * Not acting as a router,
1544 ipstat.ips_cantforward++;
1551 * locate outgoing interface
1553 memcpy(&ipaddr.sin_addr, cp + off,
1554 sizeof ipaddr.sin_addr);
1556 if (opt == IPOPT_SSRR) {
1557 #define INA struct in_ifaddr *
1558 #define SA struct sockaddr *
1559 if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr))
1561 ia = (INA)ifa_ifwithnet((SA)&ipaddr);
1563 ia = ip_rtaddr(ipaddr.sin_addr,
1564 &ipforward_rt[mycpuid]);
1566 type = ICMP_UNREACH;
1567 code = ICMP_UNREACH_SRCFAIL;
1570 ip->ip_dst = ipaddr.sin_addr;
1571 memcpy(cp + off, &IA_SIN(ia)->sin_addr,
1572 sizeof(struct in_addr));
1573 cp[IPOPT_OFFSET] += sizeof(struct in_addr);
1575 * Let ip_intr's mcast routing check handle mcast pkts
1577 forward = !IN_MULTICAST(ntohl(ip->ip_dst.s_addr));
1581 if (ipstealth && pass == 0)
1583 if (optlen < IPOPT_OFFSET + sizeof(*cp)) {
1584 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1587 if ((off = cp[IPOPT_OFFSET]) < IPOPT_MINOFF) {
1588 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1592 * If no space remains, ignore.
1594 off--; /* 0 origin */
1595 if (off > optlen - (int)sizeof(struct in_addr))
1597 memcpy(&ipaddr.sin_addr, &ip->ip_dst,
1598 sizeof ipaddr.sin_addr);
1600 * locate outgoing interface; if we're the destination,
1601 * use the incoming interface (should be same).
1603 if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == NULL &&
1604 (ia = ip_rtaddr(ipaddr.sin_addr,
1605 &ipforward_rt[mycpuid]))
1607 type = ICMP_UNREACH;
1608 code = ICMP_UNREACH_HOST;
1611 memcpy(cp + off, &IA_SIN(ia)->sin_addr,
1612 sizeof(struct in_addr));
1613 cp[IPOPT_OFFSET] += sizeof(struct in_addr);
1617 if (ipstealth && pass == 0)
1619 code = cp - (u_char *)ip;
1620 if (optlen < 4 || optlen > 40) {
1621 code = &cp[IPOPT_OLEN] - (u_char *)ip;
1624 if ((off = cp[IPOPT_OFFSET]) < 5) {
1625 code = &cp[IPOPT_OLEN] - (u_char *)ip;
1628 if (off > optlen - (int)sizeof(int32_t)) {
1629 cp[IPOPT_OFFSET + 1] += (1 << 4);
1630 if ((cp[IPOPT_OFFSET + 1] & 0xf0) == 0) {
1631 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1636 off--; /* 0 origin */
1637 sin = (struct in_addr *)(cp + off);
1638 switch (cp[IPOPT_OFFSET + 1] & 0x0f) {
1640 case IPOPT_TS_TSONLY:
1643 case IPOPT_TS_TSANDADDR:
1644 if (off + sizeof(n_time) +
1645 sizeof(struct in_addr) > optlen) {
1646 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1649 ipaddr.sin_addr = dst;
1650 ia = (INA)ifaof_ifpforaddr((SA)&ipaddr,
1654 memcpy(sin, &IA_SIN(ia)->sin_addr,
1655 sizeof(struct in_addr));
1656 cp[IPOPT_OFFSET] += sizeof(struct in_addr);
1657 off += sizeof(struct in_addr);
1660 case IPOPT_TS_PRESPEC:
1661 if (off + sizeof(n_time) +
1662 sizeof(struct in_addr) > optlen) {
1663 code = &cp[IPOPT_OFFSET] - (u_char *)ip;
1666 memcpy(&ipaddr.sin_addr, sin,
1667 sizeof(struct in_addr));
1668 if (ifa_ifwithaddr((SA)&ipaddr) == NULL)
1670 cp[IPOPT_OFFSET] += sizeof(struct in_addr);
1671 off += sizeof(struct in_addr);
1675 code = &cp[IPOPT_OFFSET + 1] - (u_char *)ip;
1679 memcpy(cp + off, &ntime, sizeof(n_time));
1680 cp[IPOPT_OFFSET] += sizeof(n_time);
1683 if (forward && ipforwarding) {
1684 ip_forward(m, TRUE, next_hop);
1689 icmp_error(m, type, code, 0, 0);
1690 ipstat.ips_badoptions++;
1695 * Given address of next destination (final or next hop),
1696 * return internet address info of interface to be used to get there.
1699 ip_rtaddr(struct in_addr dst, struct route *ro)
1701 struct sockaddr_in *sin;
1703 sin = (struct sockaddr_in *)&ro->ro_dst;
1705 if (ro->ro_rt == NULL || dst.s_addr != sin->sin_addr.s_addr) {
1706 if (ro->ro_rt != NULL) {
1710 sin->sin_family = AF_INET;
1711 sin->sin_len = sizeof *sin;
1712 sin->sin_addr = dst;
1713 rtalloc_ign(ro, RTF_PRCLONING);
1716 if (ro->ro_rt == NULL)
1719 return (ifatoia(ro->ro_rt->rt_ifa));
1723 * Save incoming source route for use in replies,
1724 * to be picked up later by ip_srcroute if the receiver is interested.
1727 save_rte(u_char *option, struct in_addr dst)
1731 olen = option[IPOPT_OLEN];
1734 kprintf("save_rte: olen %d\n", olen);
1736 if (olen > sizeof(ip_srcrt) - (1 + sizeof(dst)))
1738 bcopy(option, ip_srcrt.srcopt, olen);
1739 ip_nhops = (olen - IPOPT_OFFSET - 1) / sizeof(struct in_addr);
1744 * Retrieve incoming source route for use in replies,
1745 * in the same form used by setsockopt.
1746 * The first hop is placed before the options, will be removed later.
1751 struct in_addr *p, *q;
1756 m = m_get(MB_DONTWAIT, MT_HEADER);
1760 #define OPTSIZ (sizeof(ip_srcrt.nop) + sizeof(ip_srcrt.srcopt))
1762 /* length is (nhops+1)*sizeof(addr) + sizeof(nop + srcrt header) */
1763 m->m_len = ip_nhops * sizeof(struct in_addr) + sizeof(struct in_addr) +
1767 kprintf("ip_srcroute: nhops %d mlen %d", ip_nhops, m->m_len);
1771 * First save first hop for return route
1773 p = &ip_srcrt.route[ip_nhops - 1];
1774 *(mtod(m, struct in_addr *)) = *p--;
1777 kprintf(" hops %x", ntohl(mtod(m, struct in_addr *)->s_addr));
1781 * Copy option fields and padding (nop) to mbuf.
1783 ip_srcrt.nop = IPOPT_NOP;
1784 ip_srcrt.srcopt[IPOPT_OFFSET] = IPOPT_MINOFF;
1785 memcpy(mtod(m, caddr_t) + sizeof(struct in_addr), &ip_srcrt.nop,
1787 q = (struct in_addr *)(mtod(m, caddr_t) +
1788 sizeof(struct in_addr) + OPTSIZ);
1791 * Record return path as an IP source route,
1792 * reversing the path (pointers are now aligned).
1794 while (p >= ip_srcrt.route) {
1797 kprintf(" %x", ntohl(q->s_addr));
1802 * Last hop goes to final destination.
1807 kprintf(" %x\n", ntohl(q->s_addr));
1813 * Strip out IP options.
1816 ip_stripoptions(struct mbuf *m)
1819 struct ip *ip = mtod(m, struct ip *);
1823 optlen = (IP_VHL_HL(ip->ip_vhl) << 2) - sizeof(struct ip);
1824 opts = (caddr_t)(ip + 1);
1825 datalen = m->m_len - (sizeof(struct ip) + optlen);
1826 bcopy(opts + optlen, opts, datalen);
1828 if (m->m_flags & M_PKTHDR)
1829 m->m_pkthdr.len -= optlen;
1830 ip->ip_vhl = IP_MAKE_VHL(IPVERSION, sizeof(struct ip) >> 2);
1833 u_char inetctlerrmap[PRC_NCMDS] = {
1835 0, EMSGSIZE, EHOSTDOWN, EHOSTUNREACH,
1836 EHOSTUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED,
1837 EMSGSIZE, EHOSTUNREACH, 0, 0,
1839 ENOPROTOOPT, ECONNREFUSED
1843 * Forward a packet. If some error occurs return the sender
1844 * an icmp packet. Note we can't always generate a meaningful
1845 * icmp message because icmp doesn't have a large enough repertoire
1846 * of codes and types.
1848 * If not forwarding, just drop the packet. This could be confusing
1849 * if ipforwarding was zero but some routing protocol was advancing
1850 * us as a gateway to somewhere. However, we must let the routing
1851 * protocol deal with that.
1853 * The using_srcrt parameter indicates whether the packet is being forwarded
1854 * via a source route.
1857 ip_forward(struct mbuf *m, boolean_t using_srcrt, struct sockaddr_in *next_hop)
1859 struct ip *ip = mtod(m, struct ip *);
1860 struct sockaddr_in *ipforward_rtaddr;
1862 int error, type = 0, code = 0, destmtu = 0;
1865 struct in_addr pkt_dst;
1867 struct route *cache_rt = &ipforward_rt[mycpuid];
1871 * Cache the destination address of the packet; this may be
1872 * changed by use of 'ipfw fwd'.
1874 pkt_dst = (next_hop != NULL) ? next_hop->sin_addr : ip->ip_dst;
1878 kprintf("forward: src %x dst %x ttl %x\n",
1879 ip->ip_src.s_addr, pkt_dst.s_addr, ip->ip_ttl);
1882 if (m->m_flags & (M_BCAST | M_MCAST) || !in_canforward(pkt_dst)) {
1883 ipstat.ips_cantforward++;
1887 if (!ipstealth && ip->ip_ttl <= IPTTLDEC) {
1888 icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS, dest, 0);
1892 ipforward_rtaddr = (struct sockaddr_in *) &cache_rt->ro_dst;
1893 if (cache_rt->ro_rt == NULL ||
1894 ipforward_rtaddr->sin_addr.s_addr != pkt_dst.s_addr) {
1895 if (cache_rt->ro_rt != NULL) {
1896 RTFREE(cache_rt->ro_rt);
1897 cache_rt->ro_rt = NULL;
1899 ipforward_rtaddr->sin_family = AF_INET;
1900 ipforward_rtaddr->sin_len = sizeof(struct sockaddr_in);
1901 ipforward_rtaddr->sin_addr = pkt_dst;
1902 rtalloc_ign(cache_rt, RTF_PRCLONING);
1903 if (cache_rt->ro_rt == NULL) {
1904 icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST, dest, 0);
1908 rt = cache_rt->ro_rt;
1911 * Save the IP header and at most 8 bytes of the payload,
1912 * in case we need to generate an ICMP message to the src.
1914 * XXX this can be optimized a lot by saving the data in a local
1915 * buffer on the stack (72 bytes at most), and only allocating the
1916 * mbuf if really necessary. The vast majority of the packets
1917 * are forwarded without having to send an ICMP back (either
1918 * because unnecessary, or because rate limited), so we are
1919 * really we are wasting a lot of work here.
1921 * We don't use m_copy() because it might return a reference
1922 * to a shared cluster. Both this function and ip_output()
1923 * assume exclusive access to the IP header in `m', so any
1924 * data in a cluster may change before we reach icmp_error().
1926 MGETHDR(mcopy, MB_DONTWAIT, m->m_type);
1927 if (mcopy != NULL && !m_dup_pkthdr(mcopy, m, MB_DONTWAIT)) {
1929 * It's probably ok if the pkthdr dup fails (because
1930 * the deep copy of the tag chain failed), but for now
1931 * be conservative and just discard the copy since
1932 * code below may some day want the tags.
1937 if (mcopy != NULL) {
1938 mcopy->m_len = imin((IP_VHL_HL(ip->ip_vhl) << 2) + 8,
1940 mcopy->m_pkthdr.len = mcopy->m_len;
1941 m_copydata(m, 0, mcopy->m_len, mtod(mcopy, caddr_t));
1945 ip->ip_ttl -= IPTTLDEC;
1948 * If forwarding packet using same interface that it came in on,
1949 * perhaps should send a redirect to sender to shortcut a hop.
1950 * Only send redirect if source is sending directly to us,
1951 * and if packet was not source routed (or has any options).
1952 * Also, don't send redirect if forwarding using a default route
1953 * or a route modified by a redirect.
1955 if (rt->rt_ifp == m->m_pkthdr.rcvif &&
1956 !(rt->rt_flags & (RTF_DYNAMIC | RTF_MODIFIED)) &&
1957 satosin(rt_key(rt))->sin_addr.s_addr != INADDR_ANY &&
1958 ipsendredirects && !using_srcrt && next_hop == NULL) {
1959 u_long src = ntohl(ip->ip_src.s_addr);
1960 struct in_ifaddr *rt_ifa = (struct in_ifaddr *)rt->rt_ifa;
1962 if (rt_ifa != NULL &&
1963 (src & rt_ifa->ia_subnetmask) == rt_ifa->ia_subnet) {
1964 if (rt->rt_flags & RTF_GATEWAY)
1965 dest = satosin(rt->rt_gateway)->sin_addr.s_addr;
1967 dest = pkt_dst.s_addr;
1969 * Router requirements says to only send
1972 type = ICMP_REDIRECT;
1973 code = ICMP_REDIRECT_HOST;
1976 kprintf("redirect (%d) to %x\n", code, dest);
1981 if (next_hop != NULL) {
1982 /* Pass IPFORWARD info if available */
1983 tag.mh_type = MT_TAG;
1984 tag.mh_flags = PACKET_TAG_IPFORWARD;
1985 tag.mh_data = (caddr_t)next_hop;
1987 m = (struct mbuf *)&tag;
1990 error = ip_output(m, NULL, cache_rt, IP_FORWARDING, NULL,
1993 ipstat.ips_forward++;
1996 ipflow_create(cache_rt, mcopy);
1999 return; /* most common case */
2001 ipstat.ips_redirectsent++;
2004 ipstat.ips_cantforward++;
2011 * Send ICMP message.
2016 case 0: /* forwarded, but need redirect */
2017 /* type, code set above */
2020 case ENETUNREACH: /* shouldn't happen, checked above */
2025 type = ICMP_UNREACH;
2026 code = ICMP_UNREACH_HOST;
2030 type = ICMP_UNREACH;
2031 code = ICMP_UNREACH_NEEDFRAG;
2034 * If the packet is routed over IPsec tunnel, tell the
2035 * originator the tunnel MTU.
2036 * tunnel MTU = if MTU - sizeof(IP) - ESP/AH hdrsiz
2039 if (cache_rt->ro_rt != NULL) {
2040 struct secpolicy *sp = NULL;
2045 sp = ipsec4_getpolicybyaddr(mcopy,
2051 destmtu = cache_rt->ro_rt->rt_ifp->if_mtu;
2053 /* count IPsec header size */
2054 ipsechdr = ipsec4_hdrsiz(mcopy,
2059 * find the correct route for outer IPv4
2060 * header, compute tunnel MTU.
2063 if (sp->req != NULL && sp->req->sav != NULL &&
2064 sp->req->sav->sah != NULL) {
2065 ro = &sp->req->sav->sah->sa_route;
2066 if (ro->ro_rt != NULL &&
2067 ro->ro_rt->rt_ifp != NULL) {
2069 ro->ro_rt->rt_ifp->if_mtu;
2070 destmtu -= ipsechdr;
2079 * If the packet is routed over IPsec tunnel, tell the
2080 * originator the tunnel MTU.
2081 * tunnel MTU = if MTU - sizeof(IP) - ESP/AH hdrsiz
2084 if (cache_rt->ro_rt != NULL) {
2085 struct secpolicy *sp = NULL;
2090 sp = ipsec_getpolicybyaddr(mcopy,
2096 destmtu = cache_rt->ro_rt->rt_ifp->if_mtu;
2098 /* count IPsec header size */
2099 ipsechdr = ipsec4_hdrsiz(mcopy,
2104 * find the correct route for outer IPv4
2105 * header, compute tunnel MTU.
2108 if (sp->req != NULL &&
2109 sp->req->sav != NULL &&
2110 sp->req->sav->sah != NULL) {
2111 ro = &sp->req->sav->sah->sa_route;
2112 if (ro->ro_rt != NULL &&
2113 ro->ro_rt->rt_ifp != NULL) {
2115 ro->ro_rt->rt_ifp->if_mtu;
2116 destmtu -= ipsechdr;
2123 #else /* !IPSEC && !FAST_IPSEC */
2124 if (cache_rt->ro_rt != NULL)
2125 destmtu = cache_rt->ro_rt->rt_ifp->if_mtu;
2127 ipstat.ips_cantfrag++;
2132 * A router should not generate ICMP_SOURCEQUENCH as
2133 * required in RFC1812 Requirements for IP Version 4 Routers.
2134 * Source quench could be a big problem under DoS attacks,
2135 * or if the underlying interface is rate-limited.
2136 * Those who need source quench packets may re-enable them
2137 * via the net.inet.ip.sendsourcequench sysctl.
2139 if (!ip_sendsourcequench) {
2143 type = ICMP_SOURCEQUENCH;
2148 case EACCES: /* ipfw denied packet */
2152 icmp_error(mcopy, type, code, dest, destmtu);
2156 ip_savecontrol(struct inpcb *inp, struct mbuf **mp, struct ip *ip,
2159 if (inp->inp_socket->so_options & SO_TIMESTAMP) {
2163 *mp = sbcreatecontrol((caddr_t) &tv, sizeof(tv),
2164 SCM_TIMESTAMP, SOL_SOCKET);
2166 mp = &(*mp)->m_next;
2168 if (inp->inp_flags & INP_RECVDSTADDR) {
2169 *mp = sbcreatecontrol((caddr_t) &ip->ip_dst,
2170 sizeof(struct in_addr), IP_RECVDSTADDR, IPPROTO_IP);
2172 mp = &(*mp)->m_next;
2174 if (inp->inp_flags & INP_RECVTTL) {
2175 *mp = sbcreatecontrol((caddr_t) &ip->ip_ttl,
2176 sizeof(u_char), IP_RECVTTL, IPPROTO_IP);
2178 mp = &(*mp)->m_next;
2182 * Moving these out of udp_input() made them even more broken
2183 * than they already were.
2185 /* options were tossed already */
2186 if (inp->inp_flags & INP_RECVOPTS) {
2187 *mp = sbcreatecontrol((caddr_t) opts_deleted_above,
2188 sizeof(struct in_addr), IP_RECVOPTS, IPPROTO_IP);
2190 mp = &(*mp)->m_next;
2192 /* ip_srcroute doesn't do what we want here, need to fix */
2193 if (inp->inp_flags & INP_RECVRETOPTS) {
2194 *mp = sbcreatecontrol((caddr_t) ip_srcroute(),
2195 sizeof(struct in_addr), IP_RECVRETOPTS, IPPROTO_IP);
2197 mp = &(*mp)->m_next;
2200 if (inp->inp_flags & INP_RECVIF) {
2203 struct sockaddr_dl sdl;
2206 struct sockaddr_dl *sdp;
2207 struct sockaddr_dl *sdl2 = &sdlbuf.sdl;
2209 if (((ifp = m->m_pkthdr.rcvif)) &&
2210 ((ifp->if_index != 0) && (ifp->if_index <= if_index))) {
2211 sdp = IF_LLSOCKADDR(ifp);
2213 * Change our mind and don't try copy.
2215 if ((sdp->sdl_family != AF_LINK) ||
2216 (sdp->sdl_len > sizeof(sdlbuf))) {
2219 bcopy(sdp, sdl2, sdp->sdl_len);
2223 offsetof(struct sockaddr_dl, sdl_data[0]);
2224 sdl2->sdl_family = AF_LINK;
2225 sdl2->sdl_index = 0;
2226 sdl2->sdl_nlen = sdl2->sdl_alen = sdl2->sdl_slen = 0;
2228 *mp = sbcreatecontrol((caddr_t) sdl2, sdl2->sdl_len,
2229 IP_RECVIF, IPPROTO_IP);
2231 mp = &(*mp)->m_next;
2236 * XXX these routines are called from the upper part of the kernel.
2238 * They could also be moved to ip_mroute.c, since all the RSVP
2239 * handling is done there already.
2242 ip_rsvp_init(struct socket *so)
2244 if (so->so_type != SOCK_RAW ||
2245 so->so_proto->pr_protocol != IPPROTO_RSVP)
2248 if (ip_rsvpd != NULL)
2253 * This may seem silly, but we need to be sure we don't over-increment
2254 * the RSVP counter, in case something slips up.
2269 * This may seem silly, but we need to be sure we don't over-decrement
2270 * the RSVP counter, in case something slips up.
2280 rsvp_input(struct mbuf *m, ...) /* XXX must fixup manually */
2286 off = __va_arg(ap, int);
2287 proto = __va_arg(ap, int);
2290 if (rsvp_input_p) { /* call the real one if loaded */
2291 rsvp_input_p(m, off, proto);
2295 /* Can still get packets with rsvp_on = 0 if there is a local member
2296 * of the group to which the RSVP packet is addressed. But in this
2297 * case we want to throw the packet away.
2305 if (ip_rsvpd != NULL) {
2306 rip_input(m, off, proto);
2309 /* Drop the packet */