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
33 * $DragonFly: src/sys/netinet/ip_demux.c,v 1.24 2004/07/08 22:43:01 hsu Exp $
37 * Copyright (c) 2003, 2004 Jeffrey M. Hsu. All rights reserved.
39 * License terms: all terms for the DragonFly license above plus the following:
41 * 4. All advertising materials mentioning features or use of this software
42 * must display the following acknowledgement:
44 * This product includes software developed by Jeffrey M. Hsu
45 * for the DragonFly Project.
47 * This requirement may be waived with permission from Jeffrey Hsu.
48 * This requirement will sunset and may be removed on July 8 2005,
49 * after which the standard DragonFly license (as shown above) will
55 #include <sys/param.h>
56 #include <sys/systm.h>
57 #include <sys/kernel.h>
58 #include <sys/socket.h>
59 #include <sys/socketvar.h>
60 #include <sys/thread.h>
61 #include <sys/sysctl.h>
62 #include <sys/globaldata.h>
65 #include <net/netisr.h>
67 #include <netinet/in_systm.h>
68 #include <netinet/in.h>
69 #include <netinet/in_var.h>
70 #include <netinet/in_pcb.h>
71 #include <netinet/ip.h>
72 #include <netinet/ip_var.h>
73 #include <netinet/tcp.h>
74 #include <netinet/tcpip.h>
75 #include <netinet/tcp_var.h>
76 #include <netinet/udp.h>
77 #include <netinet/udp_var.h>
79 extern struct thread netisr_cpu[];
81 static struct thread tcp_thread[MAXCPU];
82 static struct thread udp_thread[MAXCPU];
85 INP_MPORT_HASH(in_addr_t faddr, in_addr_t laddr,
86 in_port_t fport, in_port_t lport)
89 * Use low order bytes.
92 #if (BYTE_ORDER == LITTLE_ENDIAN)
93 KASSERT(ncpus2 < 256, ("need different hash function")); /* XXX JH */
94 return (((faddr >> 24) ^ (fport >> 8) ^ (laddr >> 24) ^ (lport >> 8)) &
97 return ((faddr ^ fport ^ laddr ^ lport) & ncpus2_mask);
102 * Map a packet to a protocol processing thread.
105 ip_mport(struct mbuf *m)
111 int thoff; /* TCP data offset */
115 if (m->m_pkthdr.len < sizeof(struct ip)) {
116 ipstat.ips_tooshort++;
120 if (m->m_len < sizeof(struct ip) &&
121 (m = m_pullup(m, sizeof(struct ip))) == NULL) {
122 ipstat.ips_toosmall++;
126 ip = mtod(m, struct ip *);
128 iphlen = ip->ip_hl << 2;
129 if (iphlen < sizeof(struct ip)) { /* minimum header length */
130 ipstat.ips_badhlen++;
135 * XXX generic packet handling defrag on CPU 0 for now.
137 if (ntohs(ip->ip_off) & (IP_MF | IP_OFFMASK))
138 return (&netisr_cpu[0].td_msgport);
142 if (m->m_len < iphlen + sizeof(struct tcphdr) &&
143 (m = m_pullup(m, iphlen + sizeof(struct tcphdr))) == NULL) {
144 tcpstat.tcps_rcvshort++;
147 th = (struct tcphdr *)((caddr_t)ip + iphlen);
148 thoff = th->th_off << 2;
149 if (thoff < sizeof(struct tcphdr) ||
150 thoff > ntohs(ip->ip_len)) {
151 tcpstat.tcps_rcvbadoff++;
154 if (m->m_len < iphlen + thoff) {
155 m = m_pullup(m, iphlen + thoff);
157 tcpstat.tcps_rcvshort++;
160 ip = mtod(m, struct ip *);
161 th = (struct tcphdr *)((caddr_t)ip + iphlen);
164 cpu = INP_MPORT_HASH(ip->ip_src.s_addr, ip->ip_dst.s_addr,
165 th->th_sport, th->th_dport);
166 port = &tcp_thread[cpu].td_msgport;
169 if (m->m_len < iphlen + sizeof(struct udphdr)) {
170 m = m_pullup(m, iphlen + sizeof(struct udphdr));
172 udpstat.udps_hdrops++;
175 ip = mtod(m, struct ip *);
177 uh = (struct udphdr *)((caddr_t)ip + iphlen);
179 if (IN_MULTICAST(ntohl(ip->ip_dst.s_addr)) ||
180 in_broadcast(ip->ip_dst, m->m_pkthdr.rcvif)) {
183 cpu = INP_MPORT_HASH(ip->ip_src.s_addr,
184 ip->ip_dst.s_addr, uh->uh_sport, uh->uh_dport);
186 port = &udp_thread[cpu].td_msgport;
189 if (m->m_len < iphlen && (m = m_pullup(m, iphlen)) == NULL) {
190 ipstat.ips_badhlen++;
193 port = &netisr_cpu[0].td_msgport;
196 KKASSERT(port->mp_putport != NULL);
202 * Map a TCP socket to a protocol processing thread.
205 tcp_soport(struct socket *so, struct sockaddr *nam, int req)
209 /* The following processing all take place on Protocol Thread 0. */
210 if (req == PRU_BIND || req == PRU_CONNECT || req == PRU_ATTACH ||
212 return (&tcp_thread[0].td_msgport);
215 if (!inp) /* connection reset by peer */
216 return (&tcp_thread[0].td_msgport);
219 * Already bound and connected or listening. For TCP connections,
220 * the (faddr, fport, laddr, lport) association cannot change now.
222 * Note: T/TCP code needs some reorganization to fit into
225 * Rely on type-stable memory and check in protocol handler
226 * to fix race condition here w/ deallocation of inp. XXX JH
228 return (&tcp_thread[INP_MPORT_HASH(inp->inp_faddr.s_addr,
229 inp->inp_laddr.s_addr, inp->inp_fport, inp->inp_lport)].td_msgport);
233 tcp_addrport(in_addr_t faddr, in_port_t fport, in_addr_t laddr, in_port_t lport)
235 return (&tcp_thread[tcp_addrcpu(faddr, fport,
236 laddr, lport)].td_msgport);
240 * Map a UDP socket to a protocol processing thread.
243 udp_soport(struct socket *so, struct sockaddr *nam, int req)
248 * The following processing all take place on Protocol Thread 0:
249 * only bind() and connect() have a non-null nam parameter
250 * attach() has a null socket parameter
251 * Fast and slow timeouts pass in two NULLs
253 if (nam != NULL || so == NULL)
254 return (&udp_thread[0].td_msgport);
258 if (IN_MULTICAST(ntohl(inp->inp_laddr.s_addr)))
259 return (&udp_thread[0].td_msgport);
262 * Rely on type-stable memory and check in protocol handler
263 * to fix race condition here w/ deallocation of inp. XXX JH
266 return (&udp_thread[INP_MPORT_HASH(inp->inp_faddr.s_addr,
267 inp->inp_laddr.s_addr, inp->inp_fport, inp->inp_lport)].td_msgport);
271 * Map a network address to a processor.
274 tcp_addrcpu(in_addr_t faddr, in_port_t fport, in_addr_t laddr, in_port_t lport)
276 return (INP_MPORT_HASH(faddr, laddr, fport, lport));
280 udp_addrcpu(in_addr_t faddr, in_port_t fport, in_addr_t laddr, in_port_t lport)
282 if (IN_MULTICAST(ntohl(laddr)))
285 return (INP_MPORT_HASH(faddr, laddr, fport, lport));
289 * Return LWKT port for cpu.
294 return (&tcp_thread[cpu].td_msgport);
298 tcp_thread_init(void)
302 for (cpu = 0; cpu < ncpus2; cpu++) {
303 lwkt_create(netmsg_service_loop, NULL, NULL,
304 &tcp_thread[cpu], 0, cpu, "tcp_thread %d", cpu);
305 tcp_thread[cpu].td_msgport.mp_putport = netmsg_put_port;
310 udp_thread_init(void)
314 for (cpu = 0; cpu < ncpus2; cpu++) {
315 lwkt_create(netmsg_service_loop, NULL, NULL,
316 &udp_thread[cpu], 0, cpu, "udp_thread %d", cpu);
317 udp_thread[cpu].td_msgport.mp_putport = netmsg_put_port;