2 * Copyright (c) 1982, 1986, 1988, 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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)ip_input.c 8.2 (Berkeley) 1/4/94
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
35 #include "opt_bootp.h"
37 #include "opt_ipstealth.h"
38 #include "opt_ipsec.h"
39 #include "opt_route.h"
42 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/callout.h>
46 #include <sys/malloc.h>
47 #include <sys/domain.h>
48 #include <sys/protosw.h>
49 #include <sys/socket.h>
51 #include <sys/kernel.h>
53 #include <sys/rwlock.h>
54 #include <sys/syslog.h>
55 #include <sys/sysctl.h>
59 #include <net/if_types.h>
60 #include <net/if_var.h>
61 #include <net/if_dl.h>
62 #include <net/route.h>
63 #include <net/netisr.h>
65 #include <net/flowtable.h>
67 #include <netinet/in.h>
68 #include <netinet/in_systm.h>
69 #include <netinet/in_var.h>
70 #include <netinet/ip.h>
71 #include <netinet/in_pcb.h>
72 #include <netinet/ip_var.h>
73 #include <netinet/ip_fw.h>
74 #include <netinet/ip_icmp.h>
75 #include <netinet/ip_options.h>
76 #include <machine/in_cksum.h>
78 #include <netinet/ip_carp.h>
81 #include <netinet/ip_ipsec.h>
84 #include <sys/socketvar.h>
86 #include <security/mac/mac_framework.h>
89 CTASSERT(sizeof(struct ip) == 20);
92 static VNET_DEFINE(int, ipsendredirects) = 1; /* XXX */
93 static VNET_DEFINE(int, ip_checkinterface);
94 static VNET_DEFINE(int, ip_keepfaith);
95 static VNET_DEFINE(int, ip_sendsourcequench);
97 #define V_ipsendredirects VNET(ipsendredirects)
98 #define V_ip_checkinterface VNET(ip_checkinterface)
99 #define V_ip_keepfaith VNET(ip_keepfaith)
100 #define V_ip_sendsourcequench VNET(ip_sendsourcequench)
102 VNET_DEFINE(int, ip_defttl) = IPDEFTTL;
103 VNET_DEFINE(int, ip_do_randomid);
104 VNET_DEFINE(int, ipforwarding);
106 VNET_DEFINE(struct in_ifaddrhead, in_ifaddrhead); /* first inet address */
107 VNET_DEFINE(struct in_ifaddrhashhead *, in_ifaddrhashtbl); /* inet addr hash table */
108 VNET_DEFINE(u_long, in_ifaddrhmask); /* mask for hash table */
109 VNET_DEFINE(struct ipstat, ipstat);
111 static VNET_DEFINE(int, ip_rsvp_on);
112 VNET_DEFINE(struct socket *, ip_rsvpd);
113 VNET_DEFINE(int, rsvp_on);
115 #define V_ip_rsvp_on VNET(ip_rsvp_on)
117 static VNET_DEFINE(TAILQ_HEAD(ipqhead, ipq), ipq[IPREASS_NHASH]);
118 static VNET_DEFINE(int, maxnipq); /* Administrative limit on # reass queues. */
119 static VNET_DEFINE(int, maxfragsperpacket);
120 static VNET_DEFINE(int, nipq); /* Total # of reass queues */
122 #define V_ipq VNET(ipq)
123 #define V_maxnipq VNET(maxnipq)
124 #define V_maxfragsperpacket VNET(maxfragsperpacket)
125 #define V_nipq VNET(nipq)
127 VNET_DEFINE(int, ipstealth);
129 struct rwlock in_ifaddr_lock;
130 RW_SYSINIT(in_ifaddr_lock, &in_ifaddr_lock, "in_ifaddr_lock");
132 SYSCTL_VNET_INT(_net_inet_ip, IPCTL_FORWARDING, forwarding, CTLFLAG_RW,
133 &VNET_NAME(ipforwarding), 0,
134 "Enable IP forwarding between interfaces");
136 SYSCTL_VNET_INT(_net_inet_ip, IPCTL_SENDREDIRECTS, redirect, CTLFLAG_RW,
137 &VNET_NAME(ipsendredirects), 0,
138 "Enable sending IP redirects");
140 SYSCTL_VNET_INT(_net_inet_ip, IPCTL_DEFTTL, ttl, CTLFLAG_RW,
141 &VNET_NAME(ip_defttl), 0,
142 "Maximum TTL on IP packets");
144 SYSCTL_VNET_INT(_net_inet_ip, IPCTL_KEEPFAITH, keepfaith, CTLFLAG_RW,
145 &VNET_NAME(ip_keepfaith), 0,
146 "Enable packet capture for FAITH IPv4->IPv6 translater daemon");
148 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, sendsourcequench, CTLFLAG_RW,
149 &VNET_NAME(ip_sendsourcequench), 0,
150 "Enable the transmission of source quench packets");
152 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, random_id, CTLFLAG_RW,
153 &VNET_NAME(ip_do_randomid), 0,
154 "Assign random ip_id values");
157 * XXX - Setting ip_checkinterface mostly implements the receive side of
158 * the Strong ES model described in RFC 1122, but since the routing table
159 * and transmit implementation do not implement the Strong ES model,
160 * setting this to 1 results in an odd hybrid.
162 * XXX - ip_checkinterface currently must be disabled if you use ipnat
163 * to translate the destination address to another local interface.
165 * XXX - ip_checkinterface must be disabled if you add IP aliases
166 * to the loopback interface instead of the interface where the
167 * packets for those addresses are received.
169 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, check_interface, CTLFLAG_RW,
170 &VNET_NAME(ip_checkinterface), 0,
171 "Verify packet arrives on correct interface");
173 VNET_DEFINE(struct pfil_head, inet_pfil_hook); /* Packet filter hooks */
175 static struct netisr_handler ip_nh = {
177 .nh_handler = ip_input,
178 .nh_proto = NETISR_IP,
179 .nh_policy = NETISR_POLICY_FLOW,
182 extern struct domain inetdomain;
183 extern struct protosw inetsw[];
184 u_char ip_protox[IPPROTO_MAX];
186 SYSCTL_VNET_STRUCT(_net_inet_ip, IPCTL_STATS, stats, CTLFLAG_RW,
187 &VNET_NAME(ipstat), ipstat,
188 "IP statistics (struct ipstat, netinet/ip_var.h)");
190 static VNET_DEFINE(uma_zone_t, ipq_zone);
191 #define V_ipq_zone VNET(ipq_zone)
193 static struct mtx ipqlock;
195 #define IPQ_LOCK() mtx_lock(&ipqlock)
196 #define IPQ_UNLOCK() mtx_unlock(&ipqlock)
197 #define IPQ_LOCK_INIT() mtx_init(&ipqlock, "ipqlock", NULL, MTX_DEF)
198 #define IPQ_LOCK_ASSERT() mtx_assert(&ipqlock, MA_OWNED)
200 static void maxnipq_update(void);
201 static void ipq_zone_change(void *);
203 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, fragpackets, CTLFLAG_RD,
205 "Current number of IPv4 fragment reassembly queue entries");
207 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, maxfragsperpacket, CTLFLAG_RW,
208 &VNET_NAME(maxfragsperpacket), 0,
209 "Maximum number of IPv4 fragments allowed per packet");
211 struct callout ipport_tick_callout;
214 SYSCTL_INT(_net_inet_ip, IPCTL_DEFMTU, mtu, CTLFLAG_RW,
215 &ip_mtu, 0, "Default MTU");
219 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, stealth, CTLFLAG_RW,
220 &VNET_NAME(ipstealth), 0,
221 "IP stealth mode, no TTL decrementation on forwarding");
225 static VNET_DEFINE(int, ip_output_flowtable_size) = 2048;
226 VNET_DEFINE(struct flowtable *, ip_ft);
227 #define V_ip_output_flowtable_size VNET(ip_output_flowtable_size)
229 SYSCTL_VNET_INT(_net_inet_ip, OID_AUTO, output_flowtable_size, CTLFLAG_RDTUN,
230 &VNET_NAME(ip_output_flowtable_size), 2048,
231 "number of entries in the per-cpu output flow caches");
234 VNET_DEFINE(int, fw_one_pass) = 1;
236 static void ip_freef(struct ipqhead *, struct ipq *);
239 * Kernel module interface for updating ipstat. The argument is an index
240 * into ipstat treated as an array of u_long. While this encodes the general
241 * layout of ipstat into the caller, it doesn't encode its location, so that
242 * future changes to add, for example, per-CPU stats support won't cause
243 * binary compatibility problems for kernel modules.
246 kmod_ipstat_inc(int statnum)
249 (*((u_long *)&V_ipstat + statnum))++;
253 kmod_ipstat_dec(int statnum)
256 (*((u_long *)&V_ipstat + statnum))--;
260 sysctl_netinet_intr_queue_maxlen(SYSCTL_HANDLER_ARGS)
264 netisr_getqlimit(&ip_nh, &qlimit);
265 error = sysctl_handle_int(oidp, &qlimit, 0, req);
266 if (error || !req->newptr)
270 return (netisr_setqlimit(&ip_nh, qlimit));
272 SYSCTL_PROC(_net_inet_ip, IPCTL_INTRQMAXLEN, intr_queue_maxlen,
273 CTLTYPE_INT|CTLFLAG_RW, 0, 0, sysctl_netinet_intr_queue_maxlen, "I",
274 "Maximum size of the IP input queue");
277 sysctl_netinet_intr_queue_drops(SYSCTL_HANDLER_ARGS)
279 u_int64_t qdrops_long;
282 netisr_getqdrops(&ip_nh, &qdrops_long);
283 qdrops = qdrops_long;
284 error = sysctl_handle_int(oidp, &qdrops, 0, req);
285 if (error || !req->newptr)
289 netisr_clearqdrops(&ip_nh);
293 SYSCTL_PROC(_net_inet_ip, IPCTL_INTRQDROPS, intr_queue_drops,
294 CTLTYPE_INT|CTLFLAG_RD, 0, 0, sysctl_netinet_intr_queue_drops, "I",
295 "Number of packets dropped from the IP input queue");
298 * IP initialization: fill in IP protocol switch table.
299 * All protocols not implemented in kernel go to raw IP protocol handler.
307 V_ip_id = time_second & 0xffff;
309 TAILQ_INIT(&V_in_ifaddrhead);
310 V_in_ifaddrhashtbl = hashinit(INADDR_NHASH, M_IFADDR, &V_in_ifaddrhmask);
312 /* Initialize IP reassembly queue. */
313 for (i = 0; i < IPREASS_NHASH; i++)
314 TAILQ_INIT(&V_ipq[i]);
315 V_maxnipq = nmbclusters / 32;
316 V_maxfragsperpacket = 16;
317 V_ipq_zone = uma_zcreate("ipq", sizeof(struct ipq), NULL, NULL, NULL,
318 NULL, UMA_ALIGN_PTR, 0);
321 /* Initialize packet filter hooks. */
322 V_inet_pfil_hook.ph_type = PFIL_TYPE_AF;
323 V_inet_pfil_hook.ph_af = AF_INET;
324 if ((i = pfil_head_register(&V_inet_pfil_hook)) != 0)
325 printf("%s: WARNING: unable to register pfil hook, "
326 "error %d\n", __func__, i);
329 TUNABLE_INT_FETCH("net.inet.ip.output_flowtable_size",
330 &V_ip_output_flowtable_size);
331 V_ip_ft = flowtable_alloc(V_ip_output_flowtable_size, FL_PCPU);
334 /* Skip initialization of globals for non-default instances. */
335 if (!IS_DEFAULT_VNET(curvnet))
338 pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW);
340 panic("ip_init: PF_INET not found");
342 /* Initialize the entire ip_protox[] array to IPPROTO_RAW. */
343 for (i = 0; i < IPPROTO_MAX; i++)
344 ip_protox[i] = pr - inetsw;
346 * Cycle through IP protocols and put them into the appropriate place
349 for (pr = inetdomain.dom_protosw;
350 pr < inetdomain.dom_protoswNPROTOSW; pr++)
351 if (pr->pr_domain->dom_family == PF_INET &&
352 pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW) {
353 /* Be careful to only index valid IP protocols. */
354 if (pr->pr_protocol < IPPROTO_MAX)
355 ip_protox[pr->pr_protocol] = pr - inetsw;
358 /* Start ipport_tick. */
359 callout_init(&ipport_tick_callout, CALLOUT_MPSAFE);
360 callout_reset(&ipport_tick_callout, 1, ipport_tick, NULL);
361 EVENTHANDLER_REGISTER(shutdown_pre_sync, ip_fini, NULL,
362 SHUTDOWN_PRI_DEFAULT);
363 EVENTHANDLER_REGISTER(nmbclusters_change, ipq_zone_change,
364 NULL, EVENTHANDLER_PRI_ANY);
366 /* Initialize various other remaining things. */
368 netisr_register(&ip_nh);
375 callout_stop(&ipport_tick_callout);
379 * Ip input routine. Checksum and byte swap header. If fragmented
380 * try to reassemble. Process options. Pass to next level.
383 ip_input(struct mbuf *m)
385 struct ip *ip = NULL;
386 struct in_ifaddr *ia = NULL;
389 int checkif, hlen = 0;
391 int dchg = 0; /* dest changed after fw */
392 struct in_addr odst; /* original dst address */
396 if (m->m_flags & M_FASTFWD_OURS) {
398 * Firewall or NAT changed destination to local.
399 * We expect ip_len and ip_off to be in host byte order.
401 m->m_flags &= ~M_FASTFWD_OURS;
402 /* Set up some basics that will be used later. */
403 ip = mtod(m, struct ip *);
404 hlen = ip->ip_hl << 2;
408 IPSTAT_INC(ips_total);
410 if (m->m_pkthdr.len < sizeof(struct ip))
413 if (m->m_len < sizeof (struct ip) &&
414 (m = m_pullup(m, sizeof (struct ip))) == NULL) {
415 IPSTAT_INC(ips_toosmall);
418 ip = mtod(m, struct ip *);
420 if (ip->ip_v != IPVERSION) {
421 IPSTAT_INC(ips_badvers);
425 hlen = ip->ip_hl << 2;
426 if (hlen < sizeof(struct ip)) { /* minimum header length */
427 IPSTAT_INC(ips_badhlen);
430 if (hlen > m->m_len) {
431 if ((m = m_pullup(m, hlen)) == NULL) {
432 IPSTAT_INC(ips_badhlen);
435 ip = mtod(m, struct ip *);
438 /* 127/8 must not appear on wire - RFC1122 */
439 ifp = m->m_pkthdr.rcvif;
440 if ((ntohl(ip->ip_dst.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET ||
441 (ntohl(ip->ip_src.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET) {
442 if ((ifp->if_flags & IFF_LOOPBACK) == 0) {
443 IPSTAT_INC(ips_badaddr);
448 if (m->m_pkthdr.csum_flags & CSUM_IP_CHECKED) {
449 sum = !(m->m_pkthdr.csum_flags & CSUM_IP_VALID);
451 if (hlen == sizeof(struct ip)) {
452 sum = in_cksum_hdr(ip);
454 sum = in_cksum(m, hlen);
458 IPSTAT_INC(ips_badsum);
463 if (altq_input != NULL && (*altq_input)(m, AF_INET) == 0)
464 /* packet is dropped by traffic conditioner */
469 * Convert fields to host representation.
471 ip->ip_len = ntohs(ip->ip_len);
472 if (ip->ip_len < hlen) {
473 IPSTAT_INC(ips_badlen);
476 ip->ip_off = ntohs(ip->ip_off);
479 * Check that the amount of data in the buffers
480 * is as at least much as the IP header would have us expect.
481 * Trim mbufs if longer than we expect.
482 * Drop packet if shorter than we expect.
484 if (m->m_pkthdr.len < ip->ip_len) {
486 IPSTAT_INC(ips_tooshort);
489 if (m->m_pkthdr.len > ip->ip_len) {
490 if (m->m_len == m->m_pkthdr.len) {
491 m->m_len = ip->ip_len;
492 m->m_pkthdr.len = ip->ip_len;
494 m_adj(m, ip->ip_len - m->m_pkthdr.len);
498 * Bypass packet filtering for packets from a tunnel (gif).
500 if (ip_ipsec_filtertunnel(m))
505 * Run through list of hooks for input packets.
507 * NB: Beware of the destination address changing (e.g.
508 * by NAT rewriting). When this happens, tell
509 * ip_forward to do the right thing.
512 /* Jump over all PFIL processing if hooks are not active. */
513 if (!PFIL_HOOKED(&V_inet_pfil_hook))
517 if (pfil_run_hooks(&V_inet_pfil_hook, &m, ifp, PFIL_IN, NULL) != 0)
519 if (m == NULL) /* consumed by filter */
522 ip = mtod(m, struct ip *);
523 dchg = (odst.s_addr != ip->ip_dst.s_addr);
524 ifp = m->m_pkthdr.rcvif;
526 #ifdef IPFIREWALL_FORWARD
527 if (m->m_flags & M_FASTFWD_OURS) {
528 m->m_flags &= ~M_FASTFWD_OURS;
531 if ((dchg = (m_tag_find(m, PACKET_TAG_IPFORWARD, NULL) != NULL)) != 0) {
533 * Directly ship the packet on. This allows forwarding
534 * packets originally destined to us to some other directly
540 #endif /* IPFIREWALL_FORWARD */
544 * Process options and, if not destined for us,
545 * ship it on. ip_dooptions returns 1 when an
546 * error was detected (causing an icmp message
547 * to be sent and the original packet to be freed).
549 if (hlen > sizeof (struct ip) && ip_dooptions(m, 0))
552 /* greedy RSVP, snatches any PATH packet of the RSVP protocol and no
553 * matter if it is destined to another node, or whether it is
554 * a multicast one, RSVP wants it! and prevents it from being forwarded
555 * anywhere else. Also checks if the rsvp daemon is running before
556 * grabbing the packet.
558 if (V_rsvp_on && ip->ip_p==IPPROTO_RSVP)
562 * Check our list of addresses, to see if the packet is for us.
563 * If we don't have any addresses, assume any unicast packet
564 * we receive might be for us (and let the upper layers deal
567 if (TAILQ_EMPTY(&V_in_ifaddrhead) &&
568 (m->m_flags & (M_MCAST|M_BCAST)) == 0)
572 * Enable a consistency check between the destination address
573 * and the arrival interface for a unicast packet (the RFC 1122
574 * strong ES model) if IP forwarding is disabled and the packet
575 * is not locally generated and the packet is not subject to
578 * XXX - Checking also should be disabled if the destination
579 * address is ipnat'ed to a different interface.
581 * XXX - Checking is incompatible with IP aliases added
582 * to the loopback interface instead of the interface where
583 * the packets are received.
585 * XXX - This is the case for carp vhost IPs as well so we
586 * insert a workaround. If the packet got here, we already
587 * checked with carp_iamatch() and carp_forus().
589 checkif = V_ip_checkinterface && (V_ipforwarding == 0) &&
590 ifp != NULL && ((ifp->if_flags & IFF_LOOPBACK) == 0) &&
597 * Check for exact addresses in the hash bucket.
599 /* IN_IFADDR_RLOCK(); */
600 LIST_FOREACH(ia, INADDR_HASH(ip->ip_dst.s_addr), ia_hash) {
602 * If the address matches, verify that the packet
603 * arrived via the correct interface if checking is
606 if (IA_SIN(ia)->sin_addr.s_addr == ip->ip_dst.s_addr &&
607 (!checkif || ia->ia_ifp == ifp)) {
608 ifa_ref(&ia->ia_ifa);
609 /* IN_IFADDR_RUNLOCK(); */
613 /* IN_IFADDR_RUNLOCK(); */
616 * Check for broadcast addresses.
618 * Only accept broadcast packets that arrive via the matching
619 * interface. Reception of forwarded directed broadcasts would
620 * be handled via ip_forward() and ether_output() with the loopback
621 * into the stack for SIMPLEX interfaces handled by ether_output().
623 if (ifp != NULL && ifp->if_flags & IFF_BROADCAST) {
625 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) {
626 if (ifa->ifa_addr->sa_family != AF_INET)
629 if (satosin(&ia->ia_broadaddr)->sin_addr.s_addr ==
635 if (ia->ia_netbroadcast.s_addr == ip->ip_dst.s_addr) {
641 if (IA_SIN(ia)->sin_addr.s_addr == INADDR_ANY) {
651 /* RFC 3927 2.7: Do not forward datagrams for 169.254.0.0/16. */
652 if (IN_LINKLOCAL(ntohl(ip->ip_dst.s_addr))) {
653 IPSTAT_INC(ips_cantforward);
657 if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr))) {
660 * If we are acting as a multicast router, all
661 * incoming multicast packets are passed to the
662 * kernel-level multicast forwarding function.
663 * The packet is returned (relatively) intact; if
664 * ip_mforward() returns a non-zero value, the packet
665 * must be discarded, else it may be accepted below.
667 if (ip_mforward && ip_mforward(ip, ifp, m, 0) != 0) {
668 IPSTAT_INC(ips_cantforward);
674 * The process-level routing daemon needs to receive
675 * all multicast IGMP packets, whether or not this
676 * host belongs to their destination groups.
678 if (ip->ip_p == IPPROTO_IGMP)
680 IPSTAT_INC(ips_forward);
683 * Assume the packet is for us, to avoid prematurely taking
684 * a lock on the in_multi hash. Protocols must perform
685 * their own filtering and update statistics accordingly.
689 if (ip->ip_dst.s_addr == (u_long)INADDR_BROADCAST)
691 if (ip->ip_dst.s_addr == INADDR_ANY)
695 * FAITH(Firewall Aided Internet Translator)
697 if (ifp && ifp->if_type == IFT_FAITH) {
698 if (V_ip_keepfaith) {
699 if (ip->ip_p == IPPROTO_TCP || ip->ip_p == IPPROTO_ICMP)
707 * Not for us; forward if possible and desirable.
709 if (V_ipforwarding == 0) {
710 IPSTAT_INC(ips_cantforward);
724 * IPSTEALTH: Process non-routing options only
725 * if the packet is destined for us.
727 if (V_ipstealth && hlen > sizeof (struct ip) && ip_dooptions(m, 1)) {
729 ifa_free(&ia->ia_ifa);
732 #endif /* IPSTEALTH */
734 /* Count the packet in the ip address stats */
736 ia->ia_ifa.if_ipackets++;
737 ia->ia_ifa.if_ibytes += m->m_pkthdr.len;
738 ifa_free(&ia->ia_ifa);
742 * Attempt reassembly; if it succeeds, proceed.
743 * ip_reass() will return a different mbuf.
745 if (ip->ip_off & (IP_MF | IP_OFFMASK)) {
749 ip = mtod(m, struct ip *);
750 /* Get the header length of the reassembled packet */
751 hlen = ip->ip_hl << 2;
755 * Further protocols expect the packet length to be w/o the
762 * enforce IPsec policy checking if we are seeing last header.
763 * note that we do not visit this with protocols with pcb layer
764 * code - like udp/tcp/raw ip.
766 if (ip_ipsec_input(m))
771 * Switch out to protocol's input routine.
773 IPSTAT_INC(ips_delivered);
775 (*inetsw[ip_protox[ip->ip_p]].pr_input)(m, hlen);
782 * After maxnipq has been updated, propagate the change to UMA. The UMA zone
783 * max has slightly different semantics than the sysctl, for historical
791 * -1 for unlimited allocation.
794 uma_zone_set_max(V_ipq_zone, 0);
796 * Positive number for specific bound.
799 uma_zone_set_max(V_ipq_zone, V_maxnipq);
801 * Zero specifies no further fragment queue allocation -- set the
802 * bound very low, but rely on implementation elsewhere to actually
803 * prevent allocation and reclaim current queues.
806 uma_zone_set_max(V_ipq_zone, 1);
810 ipq_zone_change(void *tag)
813 if (V_maxnipq > 0 && V_maxnipq < (nmbclusters / 32)) {
814 V_maxnipq = nmbclusters / 32;
820 sysctl_maxnipq(SYSCTL_HANDLER_ARGS)
825 error = sysctl_handle_int(oidp, &i, 0, req);
826 if (error || !req->newptr)
830 * XXXRW: Might be a good idea to sanity check the argument and place
831 * an extreme upper bound.
840 SYSCTL_PROC(_net_inet_ip, OID_AUTO, maxfragpackets, CTLTYPE_INT|CTLFLAG_RW,
841 NULL, 0, sysctl_maxnipq, "I",
842 "Maximum number of IPv4 fragment reassembly queue entries");
845 * Take incoming datagram fragment and try to reassemble it into
846 * whole datagram. If the argument is the first fragment or one
847 * in between the function will return NULL and store the mbuf
848 * in the fragment chain. If the argument is the last fragment
849 * the packet will be reassembled and the pointer to the new
850 * mbuf returned for further processing. Only m_tags attached
851 * to the first packet/fragment are preserved.
852 * The IP header is *NOT* adjusted out of iplen.
855 ip_reass(struct mbuf *m)
858 struct mbuf *p, *q, *nq, *t;
859 struct ipq *fp = NULL;
860 struct ipqhead *head;
865 /* If maxnipq or maxfragsperpacket are 0, never accept fragments. */
866 if (V_maxnipq == 0 || V_maxfragsperpacket == 0) {
867 IPSTAT_INC(ips_fragments);
868 IPSTAT_INC(ips_fragdropped);
873 ip = mtod(m, struct ip *);
874 hlen = ip->ip_hl << 2;
876 hash = IPREASS_HASH(ip->ip_src.s_addr, ip->ip_id);
881 * Look for queue of fragments
884 TAILQ_FOREACH(fp, head, ipq_list)
885 if (ip->ip_id == fp->ipq_id &&
886 ip->ip_src.s_addr == fp->ipq_src.s_addr &&
887 ip->ip_dst.s_addr == fp->ipq_dst.s_addr &&
889 mac_ipq_match(m, fp) &&
891 ip->ip_p == fp->ipq_p)
897 * Attempt to trim the number of allocated fragment queues if it
898 * exceeds the administrative limit.
900 if ((V_nipq > V_maxnipq) && (V_maxnipq > 0)) {
902 * drop something from the tail of the current queue
903 * before proceeding further
905 struct ipq *q = TAILQ_LAST(head, ipqhead);
906 if (q == NULL) { /* gak */
907 for (i = 0; i < IPREASS_NHASH; i++) {
908 struct ipq *r = TAILQ_LAST(&V_ipq[i], ipqhead);
910 IPSTAT_ADD(ips_fragtimeout,
912 ip_freef(&V_ipq[i], r);
917 IPSTAT_ADD(ips_fragtimeout, q->ipq_nfrags);
924 * Adjust ip_len to not reflect header,
925 * convert offset of this to bytes.
928 if (ip->ip_off & IP_MF) {
930 * Make sure that fragments have a data length
931 * that's a non-zero multiple of 8 bytes.
933 if (ip->ip_len == 0 || (ip->ip_len & 0x7) != 0) {
934 IPSTAT_INC(ips_toosmall); /* XXX */
937 m->m_flags |= M_FRAG;
939 m->m_flags &= ~M_FRAG;
944 * Attempt reassembly; if it succeeds, proceed.
945 * ip_reass() will return a different mbuf.
947 IPSTAT_INC(ips_fragments);
948 m->m_pkthdr.header = ip;
950 /* Previous ip_reass() started here. */
952 * Presence of header sizes in mbufs
953 * would confuse code below.
959 * If first fragment to arrive, create a reassembly queue.
962 fp = uma_zalloc(V_ipq_zone, M_NOWAIT);
966 if (mac_ipq_init(fp, M_NOWAIT) != 0) {
967 uma_zfree(V_ipq_zone, fp);
971 mac_ipq_create(m, fp);
973 TAILQ_INSERT_HEAD(head, fp, ipq_list);
976 fp->ipq_ttl = IPFRAGTTL;
977 fp->ipq_p = ip->ip_p;
978 fp->ipq_id = ip->ip_id;
979 fp->ipq_src = ip->ip_src;
980 fp->ipq_dst = ip->ip_dst;
987 mac_ipq_update(m, fp);
991 #define GETIP(m) ((struct ip*)((m)->m_pkthdr.header))
994 * Handle ECN by comparing this segment with the first one;
995 * if CE is set, do not lose CE.
996 * drop if CE and not-ECT are mixed for the same packet.
998 ecn = ip->ip_tos & IPTOS_ECN_MASK;
999 ecn0 = GETIP(fp->ipq_frags)->ip_tos & IPTOS_ECN_MASK;
1000 if (ecn == IPTOS_ECN_CE) {
1001 if (ecn0 == IPTOS_ECN_NOTECT)
1003 if (ecn0 != IPTOS_ECN_CE)
1004 GETIP(fp->ipq_frags)->ip_tos |= IPTOS_ECN_CE;
1006 if (ecn == IPTOS_ECN_NOTECT && ecn0 != IPTOS_ECN_NOTECT)
1010 * Find a segment which begins after this one does.
1012 for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt)
1013 if (GETIP(q)->ip_off > ip->ip_off)
1017 * If there is a preceding segment, it may provide some of
1018 * our data already. If so, drop the data from the incoming
1019 * segment. If it provides all of our data, drop us, otherwise
1020 * stick new segment in the proper place.
1022 * If some of the data is dropped from the the preceding
1023 * segment, then it's checksum is invalidated.
1026 i = GETIP(p)->ip_off + GETIP(p)->ip_len - ip->ip_off;
1028 if (i >= ip->ip_len)
1031 m->m_pkthdr.csum_flags = 0;
1035 m->m_nextpkt = p->m_nextpkt;
1038 m->m_nextpkt = fp->ipq_frags;
1043 * While we overlap succeeding segments trim them or,
1044 * if they are completely covered, dequeue them.
1046 for (; q != NULL && ip->ip_off + ip->ip_len > GETIP(q)->ip_off;
1048 i = (ip->ip_off + ip->ip_len) - GETIP(q)->ip_off;
1049 if (i < GETIP(q)->ip_len) {
1050 GETIP(q)->ip_len -= i;
1051 GETIP(q)->ip_off += i;
1053 q->m_pkthdr.csum_flags = 0;
1058 IPSTAT_INC(ips_fragdropped);
1064 * Check for complete reassembly and perform frag per packet
1067 * Frag limiting is performed here so that the nth frag has
1068 * a chance to complete the packet before we drop the packet.
1069 * As a result, n+1 frags are actually allowed per packet, but
1070 * only n will ever be stored. (n = maxfragsperpacket.)
1074 for (p = NULL, q = fp->ipq_frags; q; p = q, q = q->m_nextpkt) {
1075 if (GETIP(q)->ip_off != next) {
1076 if (fp->ipq_nfrags > V_maxfragsperpacket) {
1077 IPSTAT_ADD(ips_fragdropped, fp->ipq_nfrags);
1082 next += GETIP(q)->ip_len;
1084 /* Make sure the last packet didn't have the IP_MF flag */
1085 if (p->m_flags & M_FRAG) {
1086 if (fp->ipq_nfrags > V_maxfragsperpacket) {
1087 IPSTAT_ADD(ips_fragdropped, fp->ipq_nfrags);
1094 * Reassembly is complete. Make sure the packet is a sane size.
1098 if (next + (ip->ip_hl << 2) > IP_MAXPACKET) {
1099 IPSTAT_INC(ips_toolong);
1100 IPSTAT_ADD(ips_fragdropped, fp->ipq_nfrags);
1106 * Concatenate fragments.
1113 q->m_nextpkt = NULL;
1114 for (q = nq; q != NULL; q = nq) {
1116 q->m_nextpkt = NULL;
1117 m->m_pkthdr.csum_flags &= q->m_pkthdr.csum_flags;
1118 m->m_pkthdr.csum_data += q->m_pkthdr.csum_data;
1122 * In order to do checksumming faster we do 'end-around carry' here
1123 * (and not in for{} loop), though it implies we are not going to
1124 * reassemble more than 64k fragments.
1126 m->m_pkthdr.csum_data =
1127 (m->m_pkthdr.csum_data & 0xffff) + (m->m_pkthdr.csum_data >> 16);
1129 mac_ipq_reassemble(fp, m);
1130 mac_ipq_destroy(fp);
1134 * Create header for new ip packet by modifying header of first
1135 * packet; dequeue and discard fragment reassembly header.
1136 * Make header visible.
1138 ip->ip_len = (ip->ip_hl << 2) + next;
1139 ip->ip_src = fp->ipq_src;
1140 ip->ip_dst = fp->ipq_dst;
1141 TAILQ_REMOVE(head, fp, ipq_list);
1143 uma_zfree(V_ipq_zone, fp);
1144 m->m_len += (ip->ip_hl << 2);
1145 m->m_data -= (ip->ip_hl << 2);
1146 /* some debugging cruft by sklower, below, will go away soon */
1147 if (m->m_flags & M_PKTHDR) /* XXX this should be done elsewhere */
1149 IPSTAT_INC(ips_reassembled);
1154 IPSTAT_INC(ips_fragdropped);
1166 * Free a fragment reassembly header and all
1167 * associated datagrams.
1170 ip_freef(struct ipqhead *fhp, struct ipq *fp)
1176 while (fp->ipq_frags) {
1178 fp->ipq_frags = q->m_nextpkt;
1181 TAILQ_REMOVE(fhp, fp, ipq_list);
1182 uma_zfree(V_ipq_zone, fp);
1187 * IP timer processing;
1188 * if a timer expires on a reassembly
1189 * queue, discard it.
1194 VNET_ITERATOR_DECL(vnet_iter);
1198 VNET_LIST_RLOCK_NOSLEEP();
1200 VNET_FOREACH(vnet_iter) {
1201 CURVNET_SET(vnet_iter);
1202 for (i = 0; i < IPREASS_NHASH; i++) {
1203 for(fp = TAILQ_FIRST(&V_ipq[i]); fp;) {
1207 fp = TAILQ_NEXT(fp, ipq_list);
1208 if(--fpp->ipq_ttl == 0) {
1209 IPSTAT_ADD(ips_fragtimeout,
1211 ip_freef(&V_ipq[i], fpp);
1216 * If we are over the maximum number of fragments
1217 * (due to the limit being lowered), drain off
1218 * enough to get down to the new limit.
1220 if (V_maxnipq >= 0 && V_nipq > V_maxnipq) {
1221 for (i = 0; i < IPREASS_NHASH; i++) {
1222 while (V_nipq > V_maxnipq &&
1223 !TAILQ_EMPTY(&V_ipq[i])) {
1224 IPSTAT_ADD(ips_fragdropped,
1225 TAILQ_FIRST(&V_ipq[i])->ipq_nfrags);
1227 TAILQ_FIRST(&V_ipq[i]));
1234 VNET_LIST_RUNLOCK_NOSLEEP();
1238 * Drain off all datagram fragments.
1243 VNET_ITERATOR_DECL(vnet_iter);
1246 VNET_LIST_RLOCK_NOSLEEP();
1248 VNET_FOREACH(vnet_iter) {
1249 CURVNET_SET(vnet_iter);
1250 for (i = 0; i < IPREASS_NHASH; i++) {
1251 while(!TAILQ_EMPTY(&V_ipq[i])) {
1252 IPSTAT_ADD(ips_fragdropped,
1253 TAILQ_FIRST(&V_ipq[i])->ipq_nfrags);
1254 ip_freef(&V_ipq[i], TAILQ_FIRST(&V_ipq[i]));
1260 VNET_LIST_RUNLOCK_NOSLEEP();
1265 * The protocol to be inserted into ip_protox[] must be already registered
1266 * in inetsw[], either statically or through pf_proto_register().
1269 ipproto_register(u_char ipproto)
1273 /* Sanity checks. */
1275 return (EPROTONOSUPPORT);
1278 * The protocol slot must not be occupied by another protocol
1279 * already. An index pointing to IPPROTO_RAW is unused.
1281 pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW);
1283 return (EPFNOSUPPORT);
1284 if (ip_protox[ipproto] != pr - inetsw) /* IPPROTO_RAW */
1287 /* Find the protocol position in inetsw[] and set the index. */
1288 for (pr = inetdomain.dom_protosw;
1289 pr < inetdomain.dom_protoswNPROTOSW; pr++) {
1290 if (pr->pr_domain->dom_family == PF_INET &&
1291 pr->pr_protocol && pr->pr_protocol == ipproto) {
1292 /* Be careful to only index valid IP protocols. */
1293 if (pr->pr_protocol < IPPROTO_MAX) {
1294 ip_protox[pr->pr_protocol] = pr - inetsw;
1300 return (EPROTONOSUPPORT);
1304 ipproto_unregister(u_char ipproto)
1308 /* Sanity checks. */
1310 return (EPROTONOSUPPORT);
1312 /* Check if the protocol was indeed registered. */
1313 pr = pffindproto(PF_INET, IPPROTO_RAW, SOCK_RAW);
1315 return (EPFNOSUPPORT);
1316 if (ip_protox[ipproto] == pr - inetsw) /* IPPROTO_RAW */
1319 /* Reset the protocol slot to IPPROTO_RAW. */
1320 ip_protox[ipproto] = pr - inetsw;
1325 * Given address of next destination (final or next hop), return (referenced)
1326 * internet address info of interface to be used to get there.
1329 ip_rtaddr(struct in_addr dst, u_int fibnum)
1332 struct sockaddr_in *sin;
1333 struct in_ifaddr *ia;
1335 bzero(&sro, sizeof(sro));
1336 sin = (struct sockaddr_in *)&sro.ro_dst;
1337 sin->sin_family = AF_INET;
1338 sin->sin_len = sizeof(*sin);
1339 sin->sin_addr = dst;
1340 in_rtalloc_ign(&sro, 0, fibnum);
1342 if (sro.ro_rt == NULL)
1345 ia = ifatoia(sro.ro_rt->rt_ifa);
1346 ifa_ref(&ia->ia_ifa);
1351 u_char inetctlerrmap[PRC_NCMDS] = {
1353 0, EMSGSIZE, EHOSTDOWN, EHOSTUNREACH,
1354 EHOSTUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED,
1355 EMSGSIZE, EHOSTUNREACH, 0, 0,
1356 0, 0, EHOSTUNREACH, 0,
1357 ENOPROTOOPT, ECONNREFUSED
1361 * Forward a packet. If some error occurs return the sender
1362 * an icmp packet. Note we can't always generate a meaningful
1363 * icmp message because icmp doesn't have a large enough repertoire
1364 * of codes and types.
1366 * If not forwarding, just drop the packet. This could be confusing
1367 * if ipforwarding was zero but some routing protocol was advancing
1368 * us as a gateway to somewhere. However, we must let the routing
1369 * protocol deal with that.
1371 * The srcrt parameter indicates whether the packet is being forwarded
1372 * via a source route.
1375 ip_forward(struct mbuf *m, int srcrt)
1377 struct ip *ip = mtod(m, struct ip *);
1378 struct in_ifaddr *ia;
1380 struct in_addr dest;
1382 int error, type = 0, code = 0, mtu = 0;
1384 if (m->m_flags & (M_BCAST|M_MCAST) || in_canforward(ip->ip_dst) == 0) {
1385 IPSTAT_INC(ips_cantforward);
1392 if (ip->ip_ttl <= IPTTLDEC) {
1393 icmp_error(m, ICMP_TIMXCEED, ICMP_TIMXCEED_INTRANS,
1401 ia = ip_rtaddr(ip->ip_dst, M_GETFIB(m));
1404 * 'ia' may be NULL if there is no route for this destination.
1405 * In case of IPsec, Don't discard it just yet, but pass it to
1406 * ip_output in case of outgoing IPsec policy.
1408 if (!srcrt && ia == NULL) {
1409 icmp_error(m, ICMP_UNREACH, ICMP_UNREACH_HOST, 0, 0);
1415 * Save the IP header and at most 8 bytes of the payload,
1416 * in case we need to generate an ICMP message to the src.
1418 * XXX this can be optimized a lot by saving the data in a local
1419 * buffer on the stack (72 bytes at most), and only allocating the
1420 * mbuf if really necessary. The vast majority of the packets
1421 * are forwarded without having to send an ICMP back (either
1422 * because unnecessary, or because rate limited), so we are
1423 * really we are wasting a lot of work here.
1425 * We don't use m_copy() because it might return a reference
1426 * to a shared cluster. Both this function and ip_output()
1427 * assume exclusive access to the IP header in `m', so any
1428 * data in a cluster may change before we reach icmp_error().
1430 MGETHDR(mcopy, M_DONTWAIT, m->m_type);
1431 if (mcopy != NULL && !m_dup_pkthdr(mcopy, m, M_DONTWAIT)) {
1433 * It's probably ok if the pkthdr dup fails (because
1434 * the deep copy of the tag chain failed), but for now
1435 * be conservative and just discard the copy since
1436 * code below may some day want the tags.
1441 if (mcopy != NULL) {
1442 mcopy->m_len = min(ip->ip_len, M_TRAILINGSPACE(mcopy));
1443 mcopy->m_pkthdr.len = mcopy->m_len;
1444 m_copydata(m, 0, mcopy->m_len, mtod(mcopy, caddr_t));
1450 ip->ip_ttl -= IPTTLDEC;
1456 * If forwarding packet using same interface that it came in on,
1457 * perhaps should send a redirect to sender to shortcut a hop.
1458 * Only send redirect if source is sending directly to us,
1459 * and if packet was not source routed (or has any options).
1460 * Also, don't send redirect if forwarding using a default route
1461 * or a route modified by a redirect.
1464 if (!srcrt && V_ipsendredirects &&
1465 ia != NULL && ia->ia_ifp == m->m_pkthdr.rcvif) {
1466 struct sockaddr_in *sin;
1469 bzero(&ro, sizeof(ro));
1470 sin = (struct sockaddr_in *)&ro.ro_dst;
1471 sin->sin_family = AF_INET;
1472 sin->sin_len = sizeof(*sin);
1473 sin->sin_addr = ip->ip_dst;
1474 in_rtalloc_ign(&ro, 0, M_GETFIB(m));
1478 if (rt && (rt->rt_flags & (RTF_DYNAMIC|RTF_MODIFIED)) == 0 &&
1479 satosin(rt_key(rt))->sin_addr.s_addr != 0) {
1480 #define RTA(rt) ((struct in_ifaddr *)(rt->rt_ifa))
1481 u_long src = ntohl(ip->ip_src.s_addr);
1484 (src & RTA(rt)->ia_subnetmask) == RTA(rt)->ia_subnet) {
1485 if (rt->rt_flags & RTF_GATEWAY)
1486 dest.s_addr = satosin(rt->rt_gateway)->sin_addr.s_addr;
1488 dest.s_addr = ip->ip_dst.s_addr;
1489 /* Router requirements says to only send host redirects */
1490 type = ICMP_REDIRECT;
1491 code = ICMP_REDIRECT_HOST;
1499 * Try to cache the route MTU from ip_output so we can consider it for
1500 * the ICMP_UNREACH_NEEDFRAG "Next-Hop MTU" field described in RFC1191.
1502 bzero(&ro, sizeof(ro));
1504 error = ip_output(m, NULL, &ro, IP_FORWARDING, NULL, NULL);
1506 if (error == EMSGSIZE && ro.ro_rt)
1507 mtu = ro.ro_rt->rt_rmx.rmx_mtu;
1512 IPSTAT_INC(ips_cantforward);
1514 IPSTAT_INC(ips_forward);
1516 IPSTAT_INC(ips_redirectsent);
1521 ifa_free(&ia->ia_ifa);
1525 if (mcopy == NULL) {
1527 ifa_free(&ia->ia_ifa);
1533 case 0: /* forwarded, but need redirect */
1534 /* type, code set above */
1542 type = ICMP_UNREACH;
1543 code = ICMP_UNREACH_HOST;
1547 type = ICMP_UNREACH;
1548 code = ICMP_UNREACH_NEEDFRAG;
1552 * If IPsec is configured for this path,
1553 * override any possibly mtu value set by ip_output.
1555 mtu = ip_ipsec_mtu(m, mtu);
1558 * If the MTU was set before make sure we are below the
1560 * If the MTU wasn't set before use the interface mtu or
1561 * fall back to the next smaller mtu step compared to the
1562 * current packet size.
1566 mtu = min(mtu, ia->ia_ifp->if_mtu);
1569 mtu = ia->ia_ifp->if_mtu;
1571 mtu = ip_next_mtu(ip->ip_len, 0);
1573 IPSTAT_INC(ips_cantfrag);
1578 * A router should not generate ICMP_SOURCEQUENCH as
1579 * required in RFC1812 Requirements for IP Version 4 Routers.
1580 * Source quench could be a big problem under DoS attacks,
1581 * or if the underlying interface is rate-limited.
1582 * Those who need source quench packets may re-enable them
1583 * via the net.inet.ip.sendsourcequench sysctl.
1585 if (V_ip_sendsourcequench == 0) {
1588 ifa_free(&ia->ia_ifa);
1591 type = ICMP_SOURCEQUENCH;
1596 case EACCES: /* ipfw denied packet */
1599 ifa_free(&ia->ia_ifa);
1603 ifa_free(&ia->ia_ifa);
1604 icmp_error(mcopy, type, code, dest.s_addr, mtu);
1608 ip_savecontrol(struct inpcb *inp, struct mbuf **mp, struct ip *ip,
1612 if (inp->inp_socket->so_options & (SO_BINTIME | SO_TIMESTAMP)) {
1616 if (inp->inp_socket->so_options & SO_BINTIME) {
1617 *mp = sbcreatecontrol((caddr_t) &bt, sizeof(bt),
1618 SCM_BINTIME, SOL_SOCKET);
1620 mp = &(*mp)->m_next;
1622 if (inp->inp_socket->so_options & SO_TIMESTAMP) {
1625 bintime2timeval(&bt, &tv);
1626 *mp = sbcreatecontrol((caddr_t) &tv, sizeof(tv),
1627 SCM_TIMESTAMP, SOL_SOCKET);
1629 mp = &(*mp)->m_next;
1632 if (inp->inp_flags & INP_RECVDSTADDR) {
1633 *mp = sbcreatecontrol((caddr_t) &ip->ip_dst,
1634 sizeof(struct in_addr), IP_RECVDSTADDR, IPPROTO_IP);
1636 mp = &(*mp)->m_next;
1638 if (inp->inp_flags & INP_RECVTTL) {
1639 *mp = sbcreatecontrol((caddr_t) &ip->ip_ttl,
1640 sizeof(u_char), IP_RECVTTL, IPPROTO_IP);
1642 mp = &(*mp)->m_next;
1646 * Moving these out of udp_input() made them even more broken
1647 * than they already were.
1649 /* options were tossed already */
1650 if (inp->inp_flags & INP_RECVOPTS) {
1651 *mp = sbcreatecontrol((caddr_t) opts_deleted_above,
1652 sizeof(struct in_addr), IP_RECVOPTS, IPPROTO_IP);
1654 mp = &(*mp)->m_next;
1656 /* ip_srcroute doesn't do what we want here, need to fix */
1657 if (inp->inp_flags & INP_RECVRETOPTS) {
1658 *mp = sbcreatecontrol((caddr_t) ip_srcroute(m),
1659 sizeof(struct in_addr), IP_RECVRETOPTS, IPPROTO_IP);
1661 mp = &(*mp)->m_next;
1664 if (inp->inp_flags & INP_RECVIF) {
1667 struct sockaddr_dl sdl;
1670 struct sockaddr_dl *sdp;
1671 struct sockaddr_dl *sdl2 = &sdlbuf.sdl;
1673 if (((ifp = m->m_pkthdr.rcvif))
1674 && ( ifp->if_index && (ifp->if_index <= V_if_index))) {
1675 sdp = (struct sockaddr_dl *)ifp->if_addr->ifa_addr;
1677 * Change our mind and don't try copy.
1679 if ((sdp->sdl_family != AF_LINK)
1680 || (sdp->sdl_len > sizeof(sdlbuf))) {
1683 bcopy(sdp, sdl2, sdp->sdl_len);
1687 = offsetof(struct sockaddr_dl, sdl_data[0]);
1688 sdl2->sdl_family = AF_LINK;
1689 sdl2->sdl_index = 0;
1690 sdl2->sdl_nlen = sdl2->sdl_alen = sdl2->sdl_slen = 0;
1692 *mp = sbcreatecontrol((caddr_t) sdl2, sdl2->sdl_len,
1693 IP_RECVIF, IPPROTO_IP);
1695 mp = &(*mp)->m_next;
1700 * XXXRW: Multicast routing code in ip_mroute.c is generally MPSAFE, but the
1701 * ip_rsvp and ip_rsvp_on variables need to be interlocked with rsvp_on
1702 * locking. This code remains in ip_input.c as ip_mroute.c is optionally
1706 ip_rsvp_init(struct socket *so)
1709 if (so->so_type != SOCK_RAW ||
1710 so->so_proto->pr_protocol != IPPROTO_RSVP)
1713 if (V_ip_rsvpd != NULL)
1718 * This may seem silly, but we need to be sure we don't over-increment
1719 * the RSVP counter, in case something slips up.
1721 if (!V_ip_rsvp_on) {
1735 * This may seem silly, but we need to be sure we don't over-decrement
1736 * the RSVP counter, in case something slips up.
1746 rsvp_input(struct mbuf *m, int off) /* XXX must fixup manually */
1749 if (rsvp_input_p) { /* call the real one if loaded */
1750 rsvp_input_p(m, off);
1754 /* Can still get packets with rsvp_on = 0 if there is a local member
1755 * of the group to which the RSVP packet is addressed. But in this
1756 * case we want to throw the packet away.
1764 if (V_ip_rsvpd != NULL) {
1768 /* Drop the packet */