2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2001 Daniel Hartmeier
5 * Copyright (c) 2002 - 2008 Henning Brauer
6 * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * - Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * - Redistributions in binary form must reproduce the above
16 * copyright notice, this list of conditions and the following
17 * disclaimer in the documentation and/or other materials provided
18 * with the distribution.
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
28 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
30 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
33 * Effort sponsored in part by the Defense Advanced Research Projects
34 * Agency (DARPA) and Air Force Research Laboratory, Air Force
35 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
37 * $OpenBSD: pf.c,v 1.634 2009/02/27 12:37:45 henning Exp $
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
45 #include "opt_inet6.h"
49 #include <sys/param.h>
51 #include <sys/endian.h>
52 #include <sys/gsb_crc32.h>
54 #include <sys/interrupt.h>
55 #include <sys/kernel.h>
56 #include <sys/kthread.h>
57 #include <sys/limits.h>
60 #include <sys/random.h>
61 #include <sys/refcount.h>
62 #include <sys/socket.h>
63 #include <sys/sysctl.h>
64 #include <sys/taskqueue.h>
65 #include <sys/ucred.h>
68 #include <net/if_var.h>
69 #include <net/if_types.h>
70 #include <net/if_vlan_var.h>
71 #include <net/route.h>
72 #include <net/route/nhop.h>
76 #include <net/pfvar.h>
77 #include <net/if_pflog.h>
78 #include <net/if_pfsync.h>
80 #include <netinet/in_pcb.h>
81 #include <netinet/in_var.h>
82 #include <netinet/in_fib.h>
83 #include <netinet/ip.h>
84 #include <netinet/ip_fw.h>
85 #include <netinet/ip_icmp.h>
86 #include <netinet/icmp_var.h>
87 #include <netinet/ip_var.h>
88 #include <netinet/tcp.h>
89 #include <netinet/tcp_fsm.h>
90 #include <netinet/tcp_seq.h>
91 #include <netinet/tcp_timer.h>
92 #include <netinet/tcp_var.h>
93 #include <netinet/udp.h>
94 #include <netinet/udp_var.h>
97 #include <netinet/ip6.h>
98 #include <netinet/icmp6.h>
99 #include <netinet6/nd6.h>
100 #include <netinet6/ip6_var.h>
101 #include <netinet6/in6_pcb.h>
102 #include <netinet6/in6_fib.h>
103 #include <netinet6/scope6_var.h>
106 #if defined(SCTP) || defined(SCTP_SUPPORT)
107 #include <netinet/sctp_crc32.h>
110 #include <machine/in_cksum.h>
111 #include <security/mac/mac_framework.h>
113 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
120 VNET_DEFINE(struct pf_altqqueue, pf_altqs[4]);
121 VNET_DEFINE(struct pf_kpalist, pf_pabuf);
122 VNET_DEFINE(struct pf_altqqueue *, pf_altqs_active);
123 VNET_DEFINE(struct pf_altqqueue *, pf_altq_ifs_active);
124 VNET_DEFINE(struct pf_altqqueue *, pf_altqs_inactive);
125 VNET_DEFINE(struct pf_altqqueue *, pf_altq_ifs_inactive);
126 VNET_DEFINE(struct pf_kstatus, pf_status);
128 VNET_DEFINE(u_int32_t, ticket_altqs_active);
129 VNET_DEFINE(u_int32_t, ticket_altqs_inactive);
130 VNET_DEFINE(int, altqs_inactive_open);
131 VNET_DEFINE(u_int32_t, ticket_pabuf);
133 VNET_DEFINE(MD5_CTX, pf_tcp_secret_ctx);
134 #define V_pf_tcp_secret_ctx VNET(pf_tcp_secret_ctx)
135 VNET_DEFINE(u_char, pf_tcp_secret[16]);
136 #define V_pf_tcp_secret VNET(pf_tcp_secret)
137 VNET_DEFINE(int, pf_tcp_secret_init);
138 #define V_pf_tcp_secret_init VNET(pf_tcp_secret_init)
139 VNET_DEFINE(int, pf_tcp_iss_off);
140 #define V_pf_tcp_iss_off VNET(pf_tcp_iss_off)
141 VNET_DECLARE(int, pf_vnet_active);
142 #define V_pf_vnet_active VNET(pf_vnet_active)
144 VNET_DEFINE_STATIC(uint32_t, pf_purge_idx);
145 #define V_pf_purge_idx VNET(pf_purge_idx)
148 * Queue for pf_intr() sends.
150 static MALLOC_DEFINE(M_PFTEMP, "pf_temp", "pf(4) temporary allocations");
151 struct pf_send_entry {
152 STAILQ_ENTRY(pf_send_entry) pfse_next;
167 STAILQ_HEAD(pf_send_head, pf_send_entry);
168 VNET_DEFINE_STATIC(struct pf_send_head, pf_sendqueue);
169 #define V_pf_sendqueue VNET(pf_sendqueue)
171 static struct mtx pf_sendqueue_mtx;
172 MTX_SYSINIT(pf_sendqueue_mtx, &pf_sendqueue_mtx, "pf send queue", MTX_DEF);
173 #define PF_SENDQ_LOCK() mtx_lock(&pf_sendqueue_mtx)
174 #define PF_SENDQ_UNLOCK() mtx_unlock(&pf_sendqueue_mtx)
177 * Queue for pf_overload_task() tasks.
179 struct pf_overload_entry {
180 SLIST_ENTRY(pf_overload_entry) next;
184 struct pf_krule *rule;
187 SLIST_HEAD(pf_overload_head, pf_overload_entry);
188 VNET_DEFINE_STATIC(struct pf_overload_head, pf_overloadqueue);
189 #define V_pf_overloadqueue VNET(pf_overloadqueue)
190 VNET_DEFINE_STATIC(struct task, pf_overloadtask);
191 #define V_pf_overloadtask VNET(pf_overloadtask)
193 static struct mtx pf_overloadqueue_mtx;
194 MTX_SYSINIT(pf_overloadqueue_mtx, &pf_overloadqueue_mtx,
195 "pf overload/flush queue", MTX_DEF);
196 #define PF_OVERLOADQ_LOCK() mtx_lock(&pf_overloadqueue_mtx)
197 #define PF_OVERLOADQ_UNLOCK() mtx_unlock(&pf_overloadqueue_mtx)
199 VNET_DEFINE(struct pf_krulequeue, pf_unlinked_rules);
200 struct mtx pf_unlnkdrules_mtx;
201 MTX_SYSINIT(pf_unlnkdrules_mtx, &pf_unlnkdrules_mtx, "pf unlinked rules",
204 VNET_DEFINE_STATIC(uma_zone_t, pf_sources_z);
205 #define V_pf_sources_z VNET(pf_sources_z)
206 uma_zone_t pf_mtag_z;
207 VNET_DEFINE(uma_zone_t, pf_state_z);
208 VNET_DEFINE(uma_zone_t, pf_state_key_z);
210 VNET_DEFINE(uint64_t, pf_stateid[MAXCPU]);
211 #define PFID_CPUBITS 8
212 #define PFID_CPUSHIFT (sizeof(uint64_t) * NBBY - PFID_CPUBITS)
213 #define PFID_CPUMASK ((uint64_t)((1 << PFID_CPUBITS) - 1) << PFID_CPUSHIFT)
214 #define PFID_MAXID (~PFID_CPUMASK)
215 CTASSERT((1 << PFID_CPUBITS) >= MAXCPU);
217 static void pf_src_tree_remove_state(struct pf_state *);
218 static void pf_init_threshold(struct pf_threshold *, u_int32_t,
220 static void pf_add_threshold(struct pf_threshold *);
221 static int pf_check_threshold(struct pf_threshold *);
223 static void pf_change_ap(struct mbuf *, struct pf_addr *, u_int16_t *,
224 u_int16_t *, u_int16_t *, struct pf_addr *,
225 u_int16_t, u_int8_t, sa_family_t);
226 static int pf_modulate_sack(struct mbuf *, int, struct pf_pdesc *,
227 struct tcphdr *, struct pf_state_peer *);
228 static void pf_change_icmp(struct pf_addr *, u_int16_t *,
229 struct pf_addr *, struct pf_addr *, u_int16_t,
230 u_int16_t *, u_int16_t *, u_int16_t *,
231 u_int16_t *, u_int8_t, sa_family_t);
232 static void pf_send_tcp(struct mbuf *,
233 const struct pf_krule *, sa_family_t,
234 const struct pf_addr *, const struct pf_addr *,
235 u_int16_t, u_int16_t, u_int32_t, u_int32_t,
236 u_int8_t, u_int16_t, u_int16_t, u_int8_t, int,
237 u_int16_t, struct ifnet *);
238 static void pf_send_icmp(struct mbuf *, u_int8_t, u_int8_t,
239 sa_family_t, struct pf_krule *);
240 static void pf_detach_state(struct pf_state *);
241 static int pf_state_key_attach(struct pf_state_key *,
242 struct pf_state_key *, struct pf_state *);
243 static void pf_state_key_detach(struct pf_state *, int);
244 static int pf_state_key_ctor(void *, int, void *, int);
245 static u_int32_t pf_tcp_iss(struct pf_pdesc *);
246 static int pf_test_rule(struct pf_krule **, struct pf_state **,
247 int, struct pfi_kkif *, struct mbuf *, int,
248 struct pf_pdesc *, struct pf_krule **,
249 struct pf_kruleset **, struct inpcb *);
250 static int pf_create_state(struct pf_krule *, struct pf_krule *,
251 struct pf_krule *, struct pf_pdesc *,
252 struct pf_ksrc_node *, struct pf_state_key *,
253 struct pf_state_key *, struct mbuf *, int,
254 u_int16_t, u_int16_t, int *, struct pfi_kkif *,
255 struct pf_state **, int, u_int16_t, u_int16_t,
257 static int pf_test_fragment(struct pf_krule **, int,
258 struct pfi_kkif *, struct mbuf *, void *,
259 struct pf_pdesc *, struct pf_krule **,
260 struct pf_kruleset **);
261 static int pf_tcp_track_full(struct pf_state_peer *,
262 struct pf_state_peer *, struct pf_state **,
263 struct pfi_kkif *, struct mbuf *, int,
264 struct pf_pdesc *, u_short *, int *);
265 static int pf_tcp_track_sloppy(struct pf_state_peer *,
266 struct pf_state_peer *, struct pf_state **,
267 struct pf_pdesc *, u_short *);
268 static int pf_test_state_tcp(struct pf_state **, int,
269 struct pfi_kkif *, struct mbuf *, int,
270 void *, struct pf_pdesc *, u_short *);
271 static int pf_test_state_udp(struct pf_state **, int,
272 struct pfi_kkif *, struct mbuf *, int,
273 void *, struct pf_pdesc *);
274 static int pf_test_state_icmp(struct pf_state **, int,
275 struct pfi_kkif *, struct mbuf *, int,
276 void *, struct pf_pdesc *, u_short *);
277 static int pf_test_state_other(struct pf_state **, int,
278 struct pfi_kkif *, struct mbuf *, struct pf_pdesc *);
279 static u_int8_t pf_get_wscale(struct mbuf *, int, u_int16_t,
281 static u_int16_t pf_get_mss(struct mbuf *, int, u_int16_t,
283 static u_int16_t pf_calc_mss(struct pf_addr *, sa_family_t,
285 static int pf_check_proto_cksum(struct mbuf *, int, int,
286 u_int8_t, sa_family_t);
287 static void pf_print_state_parts(struct pf_state *,
288 struct pf_state_key *, struct pf_state_key *);
289 static int pf_addr_wrap_neq(struct pf_addr_wrap *,
290 struct pf_addr_wrap *);
291 static void pf_patch_8(struct mbuf *, u_int16_t *, u_int8_t *, u_int8_t,
293 static struct pf_state *pf_find_state(struct pfi_kkif *,
294 struct pf_state_key_cmp *, u_int);
295 static int pf_src_connlimit(struct pf_state **);
296 static void pf_overload_task(void *v, int pending);
297 static int pf_insert_src_node(struct pf_ksrc_node **,
298 struct pf_krule *, struct pf_addr *, sa_family_t);
299 static u_int pf_purge_expired_states(u_int, int);
300 static void pf_purge_unlinked_rules(void);
301 static int pf_mtag_uminit(void *, int, int);
302 static void pf_mtag_free(struct m_tag *);
304 static void pf_route(struct mbuf **, struct pf_krule *, int,
305 struct ifnet *, struct pf_state *,
306 struct pf_pdesc *, struct inpcb *);
309 static void pf_change_a6(struct pf_addr *, u_int16_t *,
310 struct pf_addr *, u_int8_t);
311 static void pf_route6(struct mbuf **, struct pf_krule *, int,
312 struct ifnet *, struct pf_state *,
313 struct pf_pdesc *, struct inpcb *);
316 int in4_cksum(struct mbuf *m, u_int8_t nxt, int off, int len);
318 extern int pf_end_threads;
319 extern struct proc *pf_purge_proc;
321 VNET_DEFINE(struct pf_limit, pf_limits[PF_LIMIT_MAX]);
323 #define PACKET_LOOPED(pd) ((pd)->pf_mtag && \
324 (pd)->pf_mtag->flags & PF_PACKET_LOOPED)
326 #define STATE_LOOKUP(i, k, d, s, pd) \
328 (s) = pf_find_state((i), (k), (d)); \
331 if (PACKET_LOOPED(pd)) \
333 if ((d) == PF_OUT && \
334 (((s)->rule.ptr->rt == PF_ROUTETO && \
335 (s)->rule.ptr->direction == PF_OUT) || \
336 ((s)->rule.ptr->rt == PF_REPLYTO && \
337 (s)->rule.ptr->direction == PF_IN)) && \
338 (s)->rt_kif != NULL && \
339 (s)->rt_kif != (i)) \
343 #define BOUND_IFACE(r, k) \
344 ((r)->rule_flag & PFRULE_IFBOUND) ? (k) : V_pfi_all
346 #define STATE_INC_COUNTERS(s) \
348 counter_u64_add(s->rule.ptr->states_cur, 1); \
349 counter_u64_add(s->rule.ptr->states_tot, 1); \
350 if (s->anchor.ptr != NULL) { \
351 counter_u64_add(s->anchor.ptr->states_cur, 1); \
352 counter_u64_add(s->anchor.ptr->states_tot, 1); \
354 if (s->nat_rule.ptr != NULL) { \
355 counter_u64_add(s->nat_rule.ptr->states_cur, 1);\
356 counter_u64_add(s->nat_rule.ptr->states_tot, 1);\
360 #define STATE_DEC_COUNTERS(s) \
362 if (s->nat_rule.ptr != NULL) \
363 counter_u64_add(s->nat_rule.ptr->states_cur, -1);\
364 if (s->anchor.ptr != NULL) \
365 counter_u64_add(s->anchor.ptr->states_cur, -1); \
366 counter_u64_add(s->rule.ptr->states_cur, -1); \
369 MALLOC_DEFINE(M_PFHASH, "pf_hash", "pf(4) hash header structures");
370 VNET_DEFINE(struct pf_keyhash *, pf_keyhash);
371 VNET_DEFINE(struct pf_idhash *, pf_idhash);
372 VNET_DEFINE(struct pf_srchash *, pf_srchash);
374 SYSCTL_NODE(_net, OID_AUTO, pf, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
378 u_long pf_srchashmask;
379 static u_long pf_hashsize;
380 static u_long pf_srchashsize;
381 u_long pf_ioctl_maxcount = 65535;
383 SYSCTL_ULONG(_net_pf, OID_AUTO, states_hashsize, CTLFLAG_RDTUN,
384 &pf_hashsize, 0, "Size of pf(4) states hashtable");
385 SYSCTL_ULONG(_net_pf, OID_AUTO, source_nodes_hashsize, CTLFLAG_RDTUN,
386 &pf_srchashsize, 0, "Size of pf(4) source nodes hashtable");
387 SYSCTL_ULONG(_net_pf, OID_AUTO, request_maxcount, CTLFLAG_RWTUN,
388 &pf_ioctl_maxcount, 0, "Maximum number of tables, addresses, ... in a single ioctl() call");
390 VNET_DEFINE(void *, pf_swi_cookie);
392 VNET_DEFINE(uint32_t, pf_hashseed);
393 #define V_pf_hashseed VNET(pf_hashseed)
396 pf_addr_cmp(struct pf_addr *a, struct pf_addr *b, sa_family_t af)
402 if (a->addr32[0] > b->addr32[0])
404 if (a->addr32[0] < b->addr32[0])
410 if (a->addr32[3] > b->addr32[3])
412 if (a->addr32[3] < b->addr32[3])
414 if (a->addr32[2] > b->addr32[2])
416 if (a->addr32[2] < b->addr32[2])
418 if (a->addr32[1] > b->addr32[1])
420 if (a->addr32[1] < b->addr32[1])
422 if (a->addr32[0] > b->addr32[0])
424 if (a->addr32[0] < b->addr32[0])
429 panic("%s: unknown address family %u", __func__, af);
434 static __inline uint32_t
435 pf_hashkey(struct pf_state_key *sk)
439 h = murmur3_32_hash32((uint32_t *)sk,
440 sizeof(struct pf_state_key_cmp)/sizeof(uint32_t),
443 return (h & pf_hashmask);
446 static __inline uint32_t
447 pf_hashsrc(struct pf_addr *addr, sa_family_t af)
453 h = murmur3_32_hash32((uint32_t *)&addr->v4,
454 sizeof(addr->v4)/sizeof(uint32_t), V_pf_hashseed);
457 h = murmur3_32_hash32((uint32_t *)&addr->v6,
458 sizeof(addr->v6)/sizeof(uint32_t), V_pf_hashseed);
461 panic("%s: unknown address family %u", __func__, af);
464 return (h & pf_srchashmask);
469 pf_state_hash(struct pf_state *s)
471 u_int32_t hv = (intptr_t)s / sizeof(*s);
473 hv ^= crc32(&s->src, sizeof(s->src));
474 hv ^= crc32(&s->dst, sizeof(s->dst));
483 pf_addrcpy(struct pf_addr *dst, struct pf_addr *src, sa_family_t af)
488 dst->addr32[0] = src->addr32[0];
492 dst->addr32[0] = src->addr32[0];
493 dst->addr32[1] = src->addr32[1];
494 dst->addr32[2] = src->addr32[2];
495 dst->addr32[3] = src->addr32[3];
502 pf_init_threshold(struct pf_threshold *threshold,
503 u_int32_t limit, u_int32_t seconds)
505 threshold->limit = limit * PF_THRESHOLD_MULT;
506 threshold->seconds = seconds;
507 threshold->count = 0;
508 threshold->last = time_uptime;
512 pf_add_threshold(struct pf_threshold *threshold)
514 u_int32_t t = time_uptime, diff = t - threshold->last;
516 if (diff >= threshold->seconds)
517 threshold->count = 0;
519 threshold->count -= threshold->count * diff /
521 threshold->count += PF_THRESHOLD_MULT;
526 pf_check_threshold(struct pf_threshold *threshold)
528 return (threshold->count > threshold->limit);
532 pf_src_connlimit(struct pf_state **state)
534 struct pf_overload_entry *pfoe;
537 PF_STATE_LOCK_ASSERT(*state);
539 (*state)->src_node->conn++;
540 (*state)->src.tcp_est = 1;
541 pf_add_threshold(&(*state)->src_node->conn_rate);
543 if ((*state)->rule.ptr->max_src_conn &&
544 (*state)->rule.ptr->max_src_conn <
545 (*state)->src_node->conn) {
546 counter_u64_add(V_pf_status.lcounters[LCNT_SRCCONN], 1);
550 if ((*state)->rule.ptr->max_src_conn_rate.limit &&
551 pf_check_threshold(&(*state)->src_node->conn_rate)) {
552 counter_u64_add(V_pf_status.lcounters[LCNT_SRCCONNRATE], 1);
559 /* Kill this state. */
560 (*state)->timeout = PFTM_PURGE;
561 (*state)->src.state = (*state)->dst.state = TCPS_CLOSED;
563 if ((*state)->rule.ptr->overload_tbl == NULL)
566 /* Schedule overloading and flushing task. */
567 pfoe = malloc(sizeof(*pfoe), M_PFTEMP, M_NOWAIT);
569 return (1); /* too bad :( */
571 bcopy(&(*state)->src_node->addr, &pfoe->addr, sizeof(pfoe->addr));
572 pfoe->af = (*state)->key[PF_SK_WIRE]->af;
573 pfoe->rule = (*state)->rule.ptr;
574 pfoe->dir = (*state)->direction;
576 SLIST_INSERT_HEAD(&V_pf_overloadqueue, pfoe, next);
577 PF_OVERLOADQ_UNLOCK();
578 taskqueue_enqueue(taskqueue_swi, &V_pf_overloadtask);
584 pf_overload_task(void *v, int pending)
586 struct pf_overload_head queue;
588 struct pf_overload_entry *pfoe, *pfoe1;
591 CURVNET_SET((struct vnet *)v);
594 queue = V_pf_overloadqueue;
595 SLIST_INIT(&V_pf_overloadqueue);
596 PF_OVERLOADQ_UNLOCK();
598 bzero(&p, sizeof(p));
599 SLIST_FOREACH(pfoe, &queue, next) {
600 counter_u64_add(V_pf_status.lcounters[LCNT_OVERLOAD_TABLE], 1);
601 if (V_pf_status.debug >= PF_DEBUG_MISC) {
602 printf("%s: blocking address ", __func__);
603 pf_print_host(&pfoe->addr, 0, pfoe->af);
607 p.pfra_af = pfoe->af;
612 p.pfra_ip4addr = pfoe->addr.v4;
618 p.pfra_ip6addr = pfoe->addr.v6;
624 pfr_insert_kentry(pfoe->rule->overload_tbl, &p, time_second);
629 * Remove those entries, that don't need flushing.
631 SLIST_FOREACH_SAFE(pfoe, &queue, next, pfoe1)
632 if (pfoe->rule->flush == 0) {
633 SLIST_REMOVE(&queue, pfoe, pf_overload_entry, next);
634 free(pfoe, M_PFTEMP);
637 V_pf_status.lcounters[LCNT_OVERLOAD_FLUSH], 1);
639 /* If nothing to flush, return. */
640 if (SLIST_EMPTY(&queue)) {
645 for (int i = 0; i <= pf_hashmask; i++) {
646 struct pf_idhash *ih = &V_pf_idhash[i];
647 struct pf_state_key *sk;
651 LIST_FOREACH(s, &ih->states, entry) {
652 sk = s->key[PF_SK_WIRE];
653 SLIST_FOREACH(pfoe, &queue, next)
654 if (sk->af == pfoe->af &&
655 ((pfoe->rule->flush & PF_FLUSH_GLOBAL) ||
656 pfoe->rule == s->rule.ptr) &&
657 ((pfoe->dir == PF_OUT &&
658 PF_AEQ(&pfoe->addr, &sk->addr[1], sk->af)) ||
659 (pfoe->dir == PF_IN &&
660 PF_AEQ(&pfoe->addr, &sk->addr[0], sk->af)))) {
661 s->timeout = PFTM_PURGE;
662 s->src.state = s->dst.state = TCPS_CLOSED;
666 PF_HASHROW_UNLOCK(ih);
668 SLIST_FOREACH_SAFE(pfoe, &queue, next, pfoe1)
669 free(pfoe, M_PFTEMP);
670 if (V_pf_status.debug >= PF_DEBUG_MISC)
671 printf("%s: %u states killed", __func__, killed);
677 * Can return locked on failure, so that we can consistently
678 * allocate and insert a new one.
680 struct pf_ksrc_node *
681 pf_find_src_node(struct pf_addr *src, struct pf_krule *rule, sa_family_t af,
684 struct pf_srchash *sh;
685 struct pf_ksrc_node *n;
687 counter_u64_add(V_pf_status.scounters[SCNT_SRC_NODE_SEARCH], 1);
689 sh = &V_pf_srchash[pf_hashsrc(src, af)];
691 LIST_FOREACH(n, &sh->nodes, entry)
692 if (n->rule.ptr == rule && n->af == af &&
693 ((af == AF_INET && n->addr.v4.s_addr == src->v4.s_addr) ||
694 (af == AF_INET6 && bcmp(&n->addr, src, sizeof(*src)) == 0)))
698 PF_HASHROW_UNLOCK(sh);
699 } else if (returnlocked == 0)
700 PF_HASHROW_UNLOCK(sh);
706 pf_free_src_node(struct pf_ksrc_node *sn)
709 for (int i = 0; i < 2; i++) {
711 counter_u64_free(sn->bytes[i]);
713 counter_u64_free(sn->packets[i]);
715 uma_zfree(V_pf_sources_z, sn);
719 pf_insert_src_node(struct pf_ksrc_node **sn, struct pf_krule *rule,
720 struct pf_addr *src, sa_family_t af)
723 KASSERT((rule->rule_flag & PFRULE_SRCTRACK ||
724 rule->rpool.opts & PF_POOL_STICKYADDR),
725 ("%s for non-tracking rule %p", __func__, rule));
728 *sn = pf_find_src_node(src, rule, af, 1);
731 struct pf_srchash *sh = &V_pf_srchash[pf_hashsrc(src, af)];
733 PF_HASHROW_ASSERT(sh);
735 if (!rule->max_src_nodes ||
736 counter_u64_fetch(rule->src_nodes) < rule->max_src_nodes)
737 (*sn) = uma_zalloc(V_pf_sources_z, M_NOWAIT | M_ZERO);
739 counter_u64_add(V_pf_status.lcounters[LCNT_SRCNODES],
742 PF_HASHROW_UNLOCK(sh);
746 for (int i = 0; i < 2; i++) {
747 (*sn)->bytes[i] = counter_u64_alloc(M_NOWAIT);
748 (*sn)->packets[i] = counter_u64_alloc(M_NOWAIT);
750 if ((*sn)->bytes[i] == NULL || (*sn)->packets[i] == NULL) {
751 pf_free_src_node(*sn);
752 PF_HASHROW_UNLOCK(sh);
757 pf_init_threshold(&(*sn)->conn_rate,
758 rule->max_src_conn_rate.limit,
759 rule->max_src_conn_rate.seconds);
762 (*sn)->rule.ptr = rule;
763 PF_ACPY(&(*sn)->addr, src, af);
764 LIST_INSERT_HEAD(&sh->nodes, *sn, entry);
765 (*sn)->creation = time_uptime;
766 (*sn)->ruletype = rule->action;
768 if ((*sn)->rule.ptr != NULL)
769 counter_u64_add((*sn)->rule.ptr->src_nodes, 1);
770 PF_HASHROW_UNLOCK(sh);
771 counter_u64_add(V_pf_status.scounters[SCNT_SRC_NODE_INSERT], 1);
773 if (rule->max_src_states &&
774 (*sn)->states >= rule->max_src_states) {
775 counter_u64_add(V_pf_status.lcounters[LCNT_SRCSTATES],
784 pf_unlink_src_node(struct pf_ksrc_node *src)
787 PF_HASHROW_ASSERT(&V_pf_srchash[pf_hashsrc(&src->addr, src->af)]);
788 LIST_REMOVE(src, entry);
790 counter_u64_add(src->rule.ptr->src_nodes, -1);
794 pf_free_src_nodes(struct pf_ksrc_node_list *head)
796 struct pf_ksrc_node *sn, *tmp;
799 LIST_FOREACH_SAFE(sn, head, entry, tmp) {
800 pf_free_src_node(sn);
804 counter_u64_add(V_pf_status.scounters[SCNT_SRC_NODE_REMOVALS], count);
813 pf_mtag_z = uma_zcreate("pf mtags", sizeof(struct m_tag) +
814 sizeof(struct pf_mtag), NULL, NULL, pf_mtag_uminit, NULL,
818 /* Per-vnet data storage structures initialization. */
822 struct pf_keyhash *kh;
823 struct pf_idhash *ih;
824 struct pf_srchash *sh;
827 if (pf_hashsize == 0 || !powerof2(pf_hashsize))
828 pf_hashsize = PF_HASHSIZ;
829 if (pf_srchashsize == 0 || !powerof2(pf_srchashsize))
830 pf_srchashsize = PF_SRCHASHSIZ;
832 V_pf_hashseed = arc4random();
834 /* States and state keys storage. */
835 V_pf_state_z = uma_zcreate("pf states", sizeof(struct pf_state),
836 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
837 V_pf_limits[PF_LIMIT_STATES].zone = V_pf_state_z;
838 uma_zone_set_max(V_pf_state_z, PFSTATE_HIWAT);
839 uma_zone_set_warning(V_pf_state_z, "PF states limit reached");
841 V_pf_state_key_z = uma_zcreate("pf state keys",
842 sizeof(struct pf_state_key), pf_state_key_ctor, NULL, NULL, NULL,
845 V_pf_keyhash = mallocarray(pf_hashsize, sizeof(struct pf_keyhash),
846 M_PFHASH, M_NOWAIT | M_ZERO);
847 V_pf_idhash = mallocarray(pf_hashsize, sizeof(struct pf_idhash),
848 M_PFHASH, M_NOWAIT | M_ZERO);
849 if (V_pf_keyhash == NULL || V_pf_idhash == NULL) {
850 printf("pf: Unable to allocate memory for "
851 "state_hashsize %lu.\n", pf_hashsize);
853 free(V_pf_keyhash, M_PFHASH);
854 free(V_pf_idhash, M_PFHASH);
856 pf_hashsize = PF_HASHSIZ;
857 V_pf_keyhash = mallocarray(pf_hashsize,
858 sizeof(struct pf_keyhash), M_PFHASH, M_WAITOK | M_ZERO);
859 V_pf_idhash = mallocarray(pf_hashsize,
860 sizeof(struct pf_idhash), M_PFHASH, M_WAITOK | M_ZERO);
863 pf_hashmask = pf_hashsize - 1;
864 for (i = 0, kh = V_pf_keyhash, ih = V_pf_idhash; i <= pf_hashmask;
866 mtx_init(&kh->lock, "pf_keyhash", NULL, MTX_DEF | MTX_DUPOK);
867 mtx_init(&ih->lock, "pf_idhash", NULL, MTX_DEF);
871 V_pf_sources_z = uma_zcreate("pf source nodes",
872 sizeof(struct pf_ksrc_node), NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
874 V_pf_limits[PF_LIMIT_SRC_NODES].zone = V_pf_sources_z;
875 uma_zone_set_max(V_pf_sources_z, PFSNODE_HIWAT);
876 uma_zone_set_warning(V_pf_sources_z, "PF source nodes limit reached");
878 V_pf_srchash = mallocarray(pf_srchashsize,
879 sizeof(struct pf_srchash), M_PFHASH, M_NOWAIT | M_ZERO);
880 if (V_pf_srchash == NULL) {
881 printf("pf: Unable to allocate memory for "
882 "source_hashsize %lu.\n", pf_srchashsize);
884 pf_srchashsize = PF_SRCHASHSIZ;
885 V_pf_srchash = mallocarray(pf_srchashsize,
886 sizeof(struct pf_srchash), M_PFHASH, M_WAITOK | M_ZERO);
889 pf_srchashmask = pf_srchashsize - 1;
890 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; i++, sh++)
891 mtx_init(&sh->lock, "pf_srchash", NULL, MTX_DEF);
894 TAILQ_INIT(&V_pf_altqs[0]);
895 TAILQ_INIT(&V_pf_altqs[1]);
896 TAILQ_INIT(&V_pf_altqs[2]);
897 TAILQ_INIT(&V_pf_altqs[3]);
898 TAILQ_INIT(&V_pf_pabuf);
899 V_pf_altqs_active = &V_pf_altqs[0];
900 V_pf_altq_ifs_active = &V_pf_altqs[1];
901 V_pf_altqs_inactive = &V_pf_altqs[2];
902 V_pf_altq_ifs_inactive = &V_pf_altqs[3];
904 /* Send & overload+flush queues. */
905 STAILQ_INIT(&V_pf_sendqueue);
906 SLIST_INIT(&V_pf_overloadqueue);
907 TASK_INIT(&V_pf_overloadtask, 0, pf_overload_task, curvnet);
909 /* Unlinked, but may be referenced rules. */
910 TAILQ_INIT(&V_pf_unlinked_rules);
917 uma_zdestroy(pf_mtag_z);
923 struct pf_keyhash *kh;
924 struct pf_idhash *ih;
925 struct pf_srchash *sh;
926 struct pf_send_entry *pfse, *next;
929 for (i = 0, kh = V_pf_keyhash, ih = V_pf_idhash; i <= pf_hashmask;
931 KASSERT(LIST_EMPTY(&kh->keys), ("%s: key hash not empty",
933 KASSERT(LIST_EMPTY(&ih->states), ("%s: id hash not empty",
935 mtx_destroy(&kh->lock);
936 mtx_destroy(&ih->lock);
938 free(V_pf_keyhash, M_PFHASH);
939 free(V_pf_idhash, M_PFHASH);
941 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; i++, sh++) {
942 KASSERT(LIST_EMPTY(&sh->nodes),
943 ("%s: source node hash not empty", __func__));
944 mtx_destroy(&sh->lock);
946 free(V_pf_srchash, M_PFHASH);
948 STAILQ_FOREACH_SAFE(pfse, &V_pf_sendqueue, pfse_next, next) {
949 m_freem(pfse->pfse_m);
950 free(pfse, M_PFTEMP);
953 uma_zdestroy(V_pf_sources_z);
954 uma_zdestroy(V_pf_state_z);
955 uma_zdestroy(V_pf_state_key_z);
959 pf_mtag_uminit(void *mem, int size, int how)
963 t = (struct m_tag *)mem;
964 t->m_tag_cookie = MTAG_ABI_COMPAT;
965 t->m_tag_id = PACKET_TAG_PF;
966 t->m_tag_len = sizeof(struct pf_mtag);
967 t->m_tag_free = pf_mtag_free;
973 pf_mtag_free(struct m_tag *t)
976 uma_zfree(pf_mtag_z, t);
980 pf_get_mtag(struct mbuf *m)
984 if ((mtag = m_tag_find(m, PACKET_TAG_PF, NULL)) != NULL)
985 return ((struct pf_mtag *)(mtag + 1));
987 mtag = uma_zalloc(pf_mtag_z, M_NOWAIT);
990 bzero(mtag + 1, sizeof(struct pf_mtag));
991 m_tag_prepend(m, mtag);
993 return ((struct pf_mtag *)(mtag + 1));
997 pf_state_key_attach(struct pf_state_key *skw, struct pf_state_key *sks,
1000 struct pf_keyhash *khs, *khw, *kh;
1001 struct pf_state_key *sk, *cur;
1002 struct pf_state *si, *olds = NULL;
1005 KASSERT(s->refs == 0, ("%s: state not pristine", __func__));
1006 KASSERT(s->key[PF_SK_WIRE] == NULL, ("%s: state has key", __func__));
1007 KASSERT(s->key[PF_SK_STACK] == NULL, ("%s: state has key", __func__));
1010 * We need to lock hash slots of both keys. To avoid deadlock
1011 * we always lock the slot with lower address first. Unlock order
1014 * We also need to lock ID hash slot before dropping key
1015 * locks. On success we return with ID hash slot locked.
1019 khs = khw = &V_pf_keyhash[pf_hashkey(skw)];
1020 PF_HASHROW_LOCK(khs);
1022 khs = &V_pf_keyhash[pf_hashkey(sks)];
1023 khw = &V_pf_keyhash[pf_hashkey(skw)];
1025 PF_HASHROW_LOCK(khs);
1026 } else if (khs < khw) {
1027 PF_HASHROW_LOCK(khs);
1028 PF_HASHROW_LOCK(khw);
1030 PF_HASHROW_LOCK(khw);
1031 PF_HASHROW_LOCK(khs);
1035 #define KEYS_UNLOCK() do { \
1037 PF_HASHROW_UNLOCK(khs); \
1038 PF_HASHROW_UNLOCK(khw); \
1040 PF_HASHROW_UNLOCK(khs); \
1044 * First run: start with wire key.
1051 LIST_FOREACH(cur, &kh->keys, entry)
1052 if (bcmp(cur, sk, sizeof(struct pf_state_key_cmp)) == 0)
1056 /* Key exists. Check for same kif, if none, add to key. */
1057 TAILQ_FOREACH(si, &cur->states[idx], key_list[idx]) {
1058 struct pf_idhash *ih = &V_pf_idhash[PF_IDHASH(si)];
1060 PF_HASHROW_LOCK(ih);
1061 if (si->kif == s->kif &&
1062 si->direction == s->direction) {
1063 if (sk->proto == IPPROTO_TCP &&
1064 si->src.state >= TCPS_FIN_WAIT_2 &&
1065 si->dst.state >= TCPS_FIN_WAIT_2) {
1067 * New state matches an old >FIN_WAIT_2
1068 * state. We can't drop key hash locks,
1069 * thus we can't unlink it properly.
1071 * As a workaround we drop it into
1072 * TCPS_CLOSED state, schedule purge
1073 * ASAP and push it into the very end
1074 * of the slot TAILQ, so that it won't
1075 * conflict with our new state.
1077 si->src.state = si->dst.state =
1079 si->timeout = PFTM_PURGE;
1082 if (V_pf_status.debug >= PF_DEBUG_MISC) {
1083 printf("pf: %s key attach "
1085 (idx == PF_SK_WIRE) ?
1088 pf_print_state_parts(s,
1089 (idx == PF_SK_WIRE) ?
1091 (idx == PF_SK_STACK) ?
1093 printf(", existing: ");
1094 pf_print_state_parts(si,
1095 (idx == PF_SK_WIRE) ?
1097 (idx == PF_SK_STACK) ?
1101 PF_HASHROW_UNLOCK(ih);
1103 uma_zfree(V_pf_state_key_z, sk);
1104 if (idx == PF_SK_STACK)
1106 return (EEXIST); /* collision! */
1109 PF_HASHROW_UNLOCK(ih);
1111 uma_zfree(V_pf_state_key_z, sk);
1114 LIST_INSERT_HEAD(&kh->keys, sk, entry);
1119 /* List is sorted, if-bound states before floating. */
1120 if (s->kif == V_pfi_all)
1121 TAILQ_INSERT_TAIL(&s->key[idx]->states[idx], s, key_list[idx]);
1123 TAILQ_INSERT_HEAD(&s->key[idx]->states[idx], s, key_list[idx]);
1126 TAILQ_REMOVE(&s->key[idx]->states[idx], olds, key_list[idx]);
1127 TAILQ_INSERT_TAIL(&s->key[idx]->states[idx], olds,
1133 * Attach done. See how should we (or should not?)
1134 * attach a second key.
1137 s->key[PF_SK_STACK] = s->key[PF_SK_WIRE];
1141 } else if (sks != NULL) {
1143 * Continue attaching with stack key.
1155 KASSERT(s->key[PF_SK_WIRE] != NULL && s->key[PF_SK_STACK] != NULL,
1156 ("%s failure", __func__));
1163 pf_detach_state(struct pf_state *s)
1165 struct pf_state_key *sks = s->key[PF_SK_STACK];
1166 struct pf_keyhash *kh;
1169 kh = &V_pf_keyhash[pf_hashkey(sks)];
1170 PF_HASHROW_LOCK(kh);
1171 if (s->key[PF_SK_STACK] != NULL)
1172 pf_state_key_detach(s, PF_SK_STACK);
1174 * If both point to same key, then we are done.
1176 if (sks == s->key[PF_SK_WIRE]) {
1177 pf_state_key_detach(s, PF_SK_WIRE);
1178 PF_HASHROW_UNLOCK(kh);
1181 PF_HASHROW_UNLOCK(kh);
1184 if (s->key[PF_SK_WIRE] != NULL) {
1185 kh = &V_pf_keyhash[pf_hashkey(s->key[PF_SK_WIRE])];
1186 PF_HASHROW_LOCK(kh);
1187 if (s->key[PF_SK_WIRE] != NULL)
1188 pf_state_key_detach(s, PF_SK_WIRE);
1189 PF_HASHROW_UNLOCK(kh);
1194 pf_state_key_detach(struct pf_state *s, int idx)
1196 struct pf_state_key *sk = s->key[idx];
1198 struct pf_keyhash *kh = &V_pf_keyhash[pf_hashkey(sk)];
1200 PF_HASHROW_ASSERT(kh);
1202 TAILQ_REMOVE(&sk->states[idx], s, key_list[idx]);
1205 if (TAILQ_EMPTY(&sk->states[0]) && TAILQ_EMPTY(&sk->states[1])) {
1206 LIST_REMOVE(sk, entry);
1207 uma_zfree(V_pf_state_key_z, sk);
1212 pf_state_key_ctor(void *mem, int size, void *arg, int flags)
1214 struct pf_state_key *sk = mem;
1216 bzero(sk, sizeof(struct pf_state_key_cmp));
1217 TAILQ_INIT(&sk->states[PF_SK_WIRE]);
1218 TAILQ_INIT(&sk->states[PF_SK_STACK]);
1223 struct pf_state_key *
1224 pf_state_key_setup(struct pf_pdesc *pd, struct pf_addr *saddr,
1225 struct pf_addr *daddr, u_int16_t sport, u_int16_t dport)
1227 struct pf_state_key *sk;
1229 sk = uma_zalloc(V_pf_state_key_z, M_NOWAIT);
1233 PF_ACPY(&sk->addr[pd->sidx], saddr, pd->af);
1234 PF_ACPY(&sk->addr[pd->didx], daddr, pd->af);
1235 sk->port[pd->sidx] = sport;
1236 sk->port[pd->didx] = dport;
1237 sk->proto = pd->proto;
1243 struct pf_state_key *
1244 pf_state_key_clone(struct pf_state_key *orig)
1246 struct pf_state_key *sk;
1248 sk = uma_zalloc(V_pf_state_key_z, M_NOWAIT);
1252 bcopy(orig, sk, sizeof(struct pf_state_key_cmp));
1258 pf_state_insert(struct pfi_kkif *kif, struct pf_state_key *skw,
1259 struct pf_state_key *sks, struct pf_state *s)
1261 struct pf_idhash *ih;
1262 struct pf_state *cur;
1265 KASSERT(TAILQ_EMPTY(&sks->states[0]) && TAILQ_EMPTY(&sks->states[1]),
1266 ("%s: sks not pristine", __func__));
1267 KASSERT(TAILQ_EMPTY(&skw->states[0]) && TAILQ_EMPTY(&skw->states[1]),
1268 ("%s: skw not pristine", __func__));
1269 KASSERT(s->refs == 0, ("%s: state not pristine", __func__));
1273 if (s->id == 0 && s->creatorid == 0) {
1274 /* XXX: should be atomic, but probability of collision low */
1275 if ((s->id = V_pf_stateid[curcpu]++) == PFID_MAXID)
1276 V_pf_stateid[curcpu] = 1;
1277 s->id |= (uint64_t )curcpu << PFID_CPUSHIFT;
1278 s->id = htobe64(s->id);
1279 s->creatorid = V_pf_status.hostid;
1282 /* Returns with ID locked on success. */
1283 if ((error = pf_state_key_attach(skw, sks, s)) != 0)
1286 ih = &V_pf_idhash[PF_IDHASH(s)];
1287 PF_HASHROW_ASSERT(ih);
1288 LIST_FOREACH(cur, &ih->states, entry)
1289 if (cur->id == s->id && cur->creatorid == s->creatorid)
1293 PF_HASHROW_UNLOCK(ih);
1294 if (V_pf_status.debug >= PF_DEBUG_MISC) {
1295 printf("pf: state ID collision: "
1296 "id: %016llx creatorid: %08x\n",
1297 (unsigned long long)be64toh(s->id),
1298 ntohl(s->creatorid));
1303 LIST_INSERT_HEAD(&ih->states, s, entry);
1304 /* One for keys, one for ID hash. */
1305 refcount_init(&s->refs, 2);
1307 counter_u64_add(V_pf_status.fcounters[FCNT_STATE_INSERT], 1);
1308 if (V_pfsync_insert_state_ptr != NULL)
1309 V_pfsync_insert_state_ptr(s);
1311 /* Returns locked. */
1316 * Find state by ID: returns with locked row on success.
1319 pf_find_state_byid(uint64_t id, uint32_t creatorid)
1321 struct pf_idhash *ih;
1324 counter_u64_add(V_pf_status.fcounters[FCNT_STATE_SEARCH], 1);
1326 ih = &V_pf_idhash[(be64toh(id) % (pf_hashmask + 1))];
1328 PF_HASHROW_LOCK(ih);
1329 LIST_FOREACH(s, &ih->states, entry)
1330 if (s->id == id && s->creatorid == creatorid)
1334 PF_HASHROW_UNLOCK(ih);
1340 * Find state by key.
1341 * Returns with ID hash slot locked on success.
1343 static struct pf_state *
1344 pf_find_state(struct pfi_kkif *kif, struct pf_state_key_cmp *key, u_int dir)
1346 struct pf_keyhash *kh;
1347 struct pf_state_key *sk;
1351 counter_u64_add(V_pf_status.fcounters[FCNT_STATE_SEARCH], 1);
1353 kh = &V_pf_keyhash[pf_hashkey((struct pf_state_key *)key)];
1355 PF_HASHROW_LOCK(kh);
1356 LIST_FOREACH(sk, &kh->keys, entry)
1357 if (bcmp(sk, key, sizeof(struct pf_state_key_cmp)) == 0)
1360 PF_HASHROW_UNLOCK(kh);
1364 idx = (dir == PF_IN ? PF_SK_WIRE : PF_SK_STACK);
1366 /* List is sorted, if-bound states before floating ones. */
1367 TAILQ_FOREACH(s, &sk->states[idx], key_list[idx])
1368 if (s->kif == V_pfi_all || s->kif == kif) {
1370 PF_HASHROW_UNLOCK(kh);
1371 if (s->timeout >= PFTM_MAX) {
1373 * State is either being processed by
1374 * pf_unlink_state() in an other thread, or
1375 * is scheduled for immediate expiry.
1382 PF_HASHROW_UNLOCK(kh);
1388 pf_find_state_all(struct pf_state_key_cmp *key, u_int dir, int *more)
1390 struct pf_keyhash *kh;
1391 struct pf_state_key *sk;
1392 struct pf_state *s, *ret = NULL;
1395 counter_u64_add(V_pf_status.fcounters[FCNT_STATE_SEARCH], 1);
1397 kh = &V_pf_keyhash[pf_hashkey((struct pf_state_key *)key)];
1399 PF_HASHROW_LOCK(kh);
1400 LIST_FOREACH(sk, &kh->keys, entry)
1401 if (bcmp(sk, key, sizeof(struct pf_state_key_cmp)) == 0)
1404 PF_HASHROW_UNLOCK(kh);
1419 panic("%s: dir %u", __func__, dir);
1422 TAILQ_FOREACH(s, &sk->states[idx], key_list[idx]) {
1424 PF_HASHROW_UNLOCK(kh);
1438 PF_HASHROW_UNLOCK(kh);
1443 /* END state table stuff */
1446 pf_send(struct pf_send_entry *pfse)
1450 STAILQ_INSERT_TAIL(&V_pf_sendqueue, pfse, pfse_next);
1452 swi_sched(V_pf_swi_cookie, 0);
1458 struct epoch_tracker et;
1459 struct pf_send_head queue;
1460 struct pf_send_entry *pfse, *next;
1462 CURVNET_SET((struct vnet *)v);
1465 queue = V_pf_sendqueue;
1466 STAILQ_INIT(&V_pf_sendqueue);
1469 NET_EPOCH_ENTER(et);
1471 STAILQ_FOREACH_SAFE(pfse, &queue, pfse_next, next) {
1472 switch (pfse->pfse_type) {
1475 ip_output(pfse->pfse_m, NULL, NULL, 0, NULL, NULL);
1478 icmp_error(pfse->pfse_m, pfse->icmpopts.type,
1479 pfse->icmpopts.code, 0, pfse->icmpopts.mtu);
1484 ip6_output(pfse->pfse_m, NULL, NULL, 0, NULL, NULL,
1488 icmp6_error(pfse->pfse_m, pfse->icmpopts.type,
1489 pfse->icmpopts.code, pfse->icmpopts.mtu);
1493 panic("%s: unknown type", __func__);
1495 free(pfse, M_PFTEMP);
1502 pf_purge_thread(void *unused __unused)
1504 VNET_ITERATOR_DECL(vnet_iter);
1506 sx_xlock(&pf_end_lock);
1507 while (pf_end_threads == 0) {
1508 sx_sleep(pf_purge_thread, &pf_end_lock, 0, "pftm", hz / 10);
1511 VNET_FOREACH(vnet_iter) {
1512 CURVNET_SET(vnet_iter);
1514 /* Wait until V_pf_default_rule is initialized. */
1515 if (V_pf_vnet_active == 0) {
1521 * Process 1/interval fraction of the state
1525 pf_purge_expired_states(V_pf_purge_idx, pf_hashmask /
1526 (V_pf_default_rule.timeout[PFTM_INTERVAL] * 10));
1529 * Purge other expired types every
1530 * PFTM_INTERVAL seconds.
1532 if (V_pf_purge_idx == 0) {
1534 * Order is important:
1535 * - states and src nodes reference rules
1536 * - states and rules reference kifs
1538 pf_purge_expired_fragments();
1539 pf_purge_expired_src_nodes();
1540 pf_purge_unlinked_rules();
1545 VNET_LIST_RUNLOCK();
1549 sx_xunlock(&pf_end_lock);
1554 pf_unload_vnet_purge(void)
1558 * To cleanse up all kifs and rules we need
1559 * two runs: first one clears reference flags,
1560 * then pf_purge_expired_states() doesn't
1561 * raise them, and then second run frees.
1563 pf_purge_unlinked_rules();
1567 * Now purge everything.
1569 pf_purge_expired_states(0, pf_hashmask);
1570 pf_purge_fragments(UINT_MAX);
1571 pf_purge_expired_src_nodes();
1574 * Now all kifs & rules should be unreferenced,
1575 * thus should be successfully freed.
1577 pf_purge_unlinked_rules();
1582 pf_state_expires(const struct pf_state *state)
1589 /* handle all PFTM_* > PFTM_MAX here */
1590 if (state->timeout == PFTM_PURGE)
1591 return (time_uptime);
1592 KASSERT(state->timeout != PFTM_UNLINKED,
1593 ("pf_state_expires: timeout == PFTM_UNLINKED"));
1594 KASSERT((state->timeout < PFTM_MAX),
1595 ("pf_state_expires: timeout > PFTM_MAX"));
1596 timeout = state->rule.ptr->timeout[state->timeout];
1598 timeout = V_pf_default_rule.timeout[state->timeout];
1599 start = state->rule.ptr->timeout[PFTM_ADAPTIVE_START];
1600 if (start && state->rule.ptr != &V_pf_default_rule) {
1601 end = state->rule.ptr->timeout[PFTM_ADAPTIVE_END];
1602 states = counter_u64_fetch(state->rule.ptr->states_cur);
1604 start = V_pf_default_rule.timeout[PFTM_ADAPTIVE_START];
1605 end = V_pf_default_rule.timeout[PFTM_ADAPTIVE_END];
1606 states = V_pf_status.states;
1608 if (end && states > start && start < end) {
1610 timeout = (u_int64_t)timeout * (end - states) /
1612 return (state->expire + timeout);
1615 return (time_uptime);
1617 return (state->expire + timeout);
1621 pf_purge_expired_src_nodes()
1623 struct pf_ksrc_node_list freelist;
1624 struct pf_srchash *sh;
1625 struct pf_ksrc_node *cur, *next;
1628 LIST_INIT(&freelist);
1629 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; i++, sh++) {
1630 PF_HASHROW_LOCK(sh);
1631 LIST_FOREACH_SAFE(cur, &sh->nodes, entry, next)
1632 if (cur->states == 0 && cur->expire <= time_uptime) {
1633 pf_unlink_src_node(cur);
1634 LIST_INSERT_HEAD(&freelist, cur, entry);
1635 } else if (cur->rule.ptr != NULL)
1636 cur->rule.ptr->rule_flag |= PFRULE_REFS;
1637 PF_HASHROW_UNLOCK(sh);
1640 pf_free_src_nodes(&freelist);
1642 V_pf_status.src_nodes = uma_zone_get_cur(V_pf_sources_z);
1646 pf_src_tree_remove_state(struct pf_state *s)
1648 struct pf_ksrc_node *sn;
1649 struct pf_srchash *sh;
1652 timeout = s->rule.ptr->timeout[PFTM_SRC_NODE] ?
1653 s->rule.ptr->timeout[PFTM_SRC_NODE] :
1654 V_pf_default_rule.timeout[PFTM_SRC_NODE];
1656 if (s->src_node != NULL) {
1658 sh = &V_pf_srchash[pf_hashsrc(&sn->addr, sn->af)];
1659 PF_HASHROW_LOCK(sh);
1662 if (--sn->states == 0)
1663 sn->expire = time_uptime + timeout;
1664 PF_HASHROW_UNLOCK(sh);
1666 if (s->nat_src_node != s->src_node && s->nat_src_node != NULL) {
1667 sn = s->nat_src_node;
1668 sh = &V_pf_srchash[pf_hashsrc(&sn->addr, sn->af)];
1669 PF_HASHROW_LOCK(sh);
1670 if (--sn->states == 0)
1671 sn->expire = time_uptime + timeout;
1672 PF_HASHROW_UNLOCK(sh);
1674 s->src_node = s->nat_src_node = NULL;
1678 * Unlink and potentilly free a state. Function may be
1679 * called with ID hash row locked, but always returns
1680 * unlocked, since it needs to go through key hash locking.
1683 pf_unlink_state(struct pf_state *s, u_int flags)
1685 struct pf_idhash *ih = &V_pf_idhash[PF_IDHASH(s)];
1687 if ((flags & PF_ENTER_LOCKED) == 0)
1688 PF_HASHROW_LOCK(ih);
1690 PF_HASHROW_ASSERT(ih);
1692 if (s->timeout == PFTM_UNLINKED) {
1694 * State is being processed
1695 * by pf_unlink_state() in
1698 PF_HASHROW_UNLOCK(ih);
1699 return (0); /* XXXGL: undefined actually */
1702 if (s->src.state == PF_TCPS_PROXY_DST) {
1703 /* XXX wire key the right one? */
1704 pf_send_tcp(NULL, s->rule.ptr, s->key[PF_SK_WIRE]->af,
1705 &s->key[PF_SK_WIRE]->addr[1],
1706 &s->key[PF_SK_WIRE]->addr[0],
1707 s->key[PF_SK_WIRE]->port[1],
1708 s->key[PF_SK_WIRE]->port[0],
1709 s->src.seqhi, s->src.seqlo + 1,
1710 TH_RST|TH_ACK, 0, 0, 0, 1, s->tag, NULL);
1713 LIST_REMOVE(s, entry);
1714 pf_src_tree_remove_state(s);
1716 if (V_pfsync_delete_state_ptr != NULL)
1717 V_pfsync_delete_state_ptr(s);
1719 STATE_DEC_COUNTERS(s);
1721 s->timeout = PFTM_UNLINKED;
1723 PF_HASHROW_UNLOCK(ih);
1726 /* pf_state_insert() initialises refs to 2, so we can never release the
1727 * last reference here, only in pf_release_state(). */
1728 (void)refcount_release(&s->refs);
1730 return (pf_release_state(s));
1734 pf_free_state(struct pf_state *cur)
1737 KASSERT(cur->refs == 0, ("%s: %p has refs", __func__, cur));
1738 KASSERT(cur->timeout == PFTM_UNLINKED, ("%s: timeout %u", __func__,
1741 for (int i = 0; i < 2; i++) {
1742 if (cur->bytes[i] != NULL)
1743 counter_u64_free(cur->bytes[i]);
1744 if (cur->packets[i] != NULL)
1745 counter_u64_free(cur->packets[i]);
1748 pf_normalize_tcp_cleanup(cur);
1749 uma_zfree(V_pf_state_z, cur);
1750 counter_u64_add(V_pf_status.fcounters[FCNT_STATE_REMOVALS], 1);
1754 * Called only from pf_purge_thread(), thus serialized.
1757 pf_purge_expired_states(u_int i, int maxcheck)
1759 struct pf_idhash *ih;
1762 V_pf_status.states = uma_zone_get_cur(V_pf_state_z);
1765 * Go through hash and unlink states that expire now.
1767 while (maxcheck > 0) {
1768 ih = &V_pf_idhash[i];
1770 /* only take the lock if we expect to do work */
1771 if (!LIST_EMPTY(&ih->states)) {
1773 PF_HASHROW_LOCK(ih);
1774 LIST_FOREACH(s, &ih->states, entry) {
1775 if (pf_state_expires(s) <= time_uptime) {
1776 V_pf_status.states -=
1777 pf_unlink_state(s, PF_ENTER_LOCKED);
1780 s->rule.ptr->rule_flag |= PFRULE_REFS;
1781 if (s->nat_rule.ptr != NULL)
1782 s->nat_rule.ptr->rule_flag |= PFRULE_REFS;
1783 if (s->anchor.ptr != NULL)
1784 s->anchor.ptr->rule_flag |= PFRULE_REFS;
1785 s->kif->pfik_flags |= PFI_IFLAG_REFS;
1787 s->rt_kif->pfik_flags |= PFI_IFLAG_REFS;
1789 PF_HASHROW_UNLOCK(ih);
1792 /* Return when we hit end of hash. */
1793 if (++i > pf_hashmask) {
1794 V_pf_status.states = uma_zone_get_cur(V_pf_state_z);
1801 V_pf_status.states = uma_zone_get_cur(V_pf_state_z);
1807 pf_purge_unlinked_rules()
1809 struct pf_krulequeue tmpq;
1810 struct pf_krule *r, *r1;
1813 * If we have overloading task pending, then we'd
1814 * better skip purging this time. There is a tiny
1815 * probability that overloading task references
1816 * an already unlinked rule.
1818 PF_OVERLOADQ_LOCK();
1819 if (!SLIST_EMPTY(&V_pf_overloadqueue)) {
1820 PF_OVERLOADQ_UNLOCK();
1823 PF_OVERLOADQ_UNLOCK();
1826 * Do naive mark-and-sweep garbage collecting of old rules.
1827 * Reference flag is raised by pf_purge_expired_states()
1828 * and pf_purge_expired_src_nodes().
1830 * To avoid LOR between PF_UNLNKDRULES_LOCK/PF_RULES_WLOCK,
1831 * use a temporary queue.
1834 PF_UNLNKDRULES_LOCK();
1835 TAILQ_FOREACH_SAFE(r, &V_pf_unlinked_rules, entries, r1) {
1836 if (!(r->rule_flag & PFRULE_REFS)) {
1837 TAILQ_REMOVE(&V_pf_unlinked_rules, r, entries);
1838 TAILQ_INSERT_TAIL(&tmpq, r, entries);
1840 r->rule_flag &= ~PFRULE_REFS;
1842 PF_UNLNKDRULES_UNLOCK();
1844 if (!TAILQ_EMPTY(&tmpq)) {
1846 TAILQ_FOREACH_SAFE(r, &tmpq, entries, r1) {
1847 TAILQ_REMOVE(&tmpq, r, entries);
1855 pf_print_host(struct pf_addr *addr, u_int16_t p, sa_family_t af)
1860 u_int32_t a = ntohl(addr->addr32[0]);
1861 printf("%u.%u.%u.%u", (a>>24)&255, (a>>16)&255,
1873 u_int8_t i, curstart, curend, maxstart, maxend;
1874 curstart = curend = maxstart = maxend = 255;
1875 for (i = 0; i < 8; i++) {
1876 if (!addr->addr16[i]) {
1877 if (curstart == 255)
1881 if ((curend - curstart) >
1882 (maxend - maxstart)) {
1883 maxstart = curstart;
1886 curstart = curend = 255;
1889 if ((curend - curstart) >
1890 (maxend - maxstart)) {
1891 maxstart = curstart;
1894 for (i = 0; i < 8; i++) {
1895 if (i >= maxstart && i <= maxend) {
1901 b = ntohs(addr->addr16[i]);
1918 pf_print_state(struct pf_state *s)
1920 pf_print_state_parts(s, NULL, NULL);
1924 pf_print_state_parts(struct pf_state *s,
1925 struct pf_state_key *skwp, struct pf_state_key *sksp)
1927 struct pf_state_key *skw, *sks;
1928 u_int8_t proto, dir;
1930 /* Do our best to fill these, but they're skipped if NULL */
1931 skw = skwp ? skwp : (s ? s->key[PF_SK_WIRE] : NULL);
1932 sks = sksp ? sksp : (s ? s->key[PF_SK_STACK] : NULL);
1933 proto = skw ? skw->proto : (sks ? sks->proto : 0);
1934 dir = s ? s->direction : 0;
1952 case IPPROTO_ICMPV6:
1956 printf("%u", proto);
1969 pf_print_host(&skw->addr[0], skw->port[0], skw->af);
1971 pf_print_host(&skw->addr[1], skw->port[1], skw->af);
1976 pf_print_host(&sks->addr[0], sks->port[0], sks->af);
1978 pf_print_host(&sks->addr[1], sks->port[1], sks->af);
1983 if (proto == IPPROTO_TCP) {
1984 printf(" [lo=%u high=%u win=%u modulator=%u",
1985 s->src.seqlo, s->src.seqhi,
1986 s->src.max_win, s->src.seqdiff);
1987 if (s->src.wscale && s->dst.wscale)
1988 printf(" wscale=%u",
1989 s->src.wscale & PF_WSCALE_MASK);
1991 printf(" [lo=%u high=%u win=%u modulator=%u",
1992 s->dst.seqlo, s->dst.seqhi,
1993 s->dst.max_win, s->dst.seqdiff);
1994 if (s->src.wscale && s->dst.wscale)
1995 printf(" wscale=%u",
1996 s->dst.wscale & PF_WSCALE_MASK);
1999 printf(" %u:%u", s->src.state, s->dst.state);
2004 pf_print_flags(u_int8_t f)
2026 #define PF_SET_SKIP_STEPS(i) \
2028 while (head[i] != cur) { \
2029 head[i]->skip[i].ptr = cur; \
2030 head[i] = TAILQ_NEXT(head[i], entries); \
2035 pf_calc_skip_steps(struct pf_krulequeue *rules)
2037 struct pf_krule *cur, *prev, *head[PF_SKIP_COUNT];
2040 cur = TAILQ_FIRST(rules);
2042 for (i = 0; i < PF_SKIP_COUNT; ++i)
2044 while (cur != NULL) {
2045 if (cur->kif != prev->kif || cur->ifnot != prev->ifnot)
2046 PF_SET_SKIP_STEPS(PF_SKIP_IFP);
2047 if (cur->direction != prev->direction)
2048 PF_SET_SKIP_STEPS(PF_SKIP_DIR);
2049 if (cur->af != prev->af)
2050 PF_SET_SKIP_STEPS(PF_SKIP_AF);
2051 if (cur->proto != prev->proto)
2052 PF_SET_SKIP_STEPS(PF_SKIP_PROTO);
2053 if (cur->src.neg != prev->src.neg ||
2054 pf_addr_wrap_neq(&cur->src.addr, &prev->src.addr))
2055 PF_SET_SKIP_STEPS(PF_SKIP_SRC_ADDR);
2056 if (cur->src.port[0] != prev->src.port[0] ||
2057 cur->src.port[1] != prev->src.port[1] ||
2058 cur->src.port_op != prev->src.port_op)
2059 PF_SET_SKIP_STEPS(PF_SKIP_SRC_PORT);
2060 if (cur->dst.neg != prev->dst.neg ||
2061 pf_addr_wrap_neq(&cur->dst.addr, &prev->dst.addr))
2062 PF_SET_SKIP_STEPS(PF_SKIP_DST_ADDR);
2063 if (cur->dst.port[0] != prev->dst.port[0] ||
2064 cur->dst.port[1] != prev->dst.port[1] ||
2065 cur->dst.port_op != prev->dst.port_op)
2066 PF_SET_SKIP_STEPS(PF_SKIP_DST_PORT);
2069 cur = TAILQ_NEXT(cur, entries);
2071 for (i = 0; i < PF_SKIP_COUNT; ++i)
2072 PF_SET_SKIP_STEPS(i);
2076 pf_addr_wrap_neq(struct pf_addr_wrap *aw1, struct pf_addr_wrap *aw2)
2078 if (aw1->type != aw2->type)
2080 switch (aw1->type) {
2081 case PF_ADDR_ADDRMASK:
2083 if (PF_ANEQ(&aw1->v.a.addr, &aw2->v.a.addr, AF_INET6))
2085 if (PF_ANEQ(&aw1->v.a.mask, &aw2->v.a.mask, AF_INET6))
2088 case PF_ADDR_DYNIFTL:
2089 return (aw1->p.dyn->pfid_kt != aw2->p.dyn->pfid_kt);
2090 case PF_ADDR_NOROUTE:
2091 case PF_ADDR_URPFFAILED:
2094 return (aw1->p.tbl != aw2->p.tbl);
2096 printf("invalid address type: %d\n", aw1->type);
2102 * Checksum updates are a little complicated because the checksum in the TCP/UDP
2103 * header isn't always a full checksum. In some cases (i.e. output) it's a
2104 * pseudo-header checksum, which is a partial checksum over src/dst IP
2105 * addresses, protocol number and length.
2107 * That means we have the following cases:
2108 * * Input or forwarding: we don't have TSO, the checksum fields are full
2109 * checksums, we need to update the checksum whenever we change anything.
2110 * * Output (i.e. the checksum is a pseudo-header checksum):
2111 * x The field being updated is src/dst address or affects the length of
2112 * the packet. We need to update the pseudo-header checksum (note that this
2113 * checksum is not ones' complement).
2114 * x Some other field is being modified (e.g. src/dst port numbers): We
2115 * don't have to update anything.
2118 pf_cksum_fixup(u_int16_t cksum, u_int16_t old, u_int16_t new, u_int8_t udp)
2122 x = cksum + old - new;
2123 x = (x + (x >> 16)) & 0xffff;
2125 /* optimise: eliminate a branch when not udp */
2126 if (udp && cksum == 0x0000)
2128 if (udp && x == 0x0000)
2131 return (u_int16_t)(x);
2135 pf_patch_8(struct mbuf *m, u_int16_t *cksum, u_int8_t *f, u_int8_t v, bool hi,
2138 u_int16_t old = htons(hi ? (*f << 8) : *f);
2139 u_int16_t new = htons(hi ? ( v << 8) : v);
2146 if (m->m_pkthdr.csum_flags & (CSUM_DELAY_DATA | CSUM_DELAY_DATA_IPV6))
2149 *cksum = pf_cksum_fixup(*cksum, old, new, udp);
2153 pf_patch_16_unaligned(struct mbuf *m, u_int16_t *cksum, void *f, u_int16_t v,
2154 bool hi, u_int8_t udp)
2156 u_int8_t *fb = (u_int8_t *)f;
2157 u_int8_t *vb = (u_int8_t *)&v;
2159 pf_patch_8(m, cksum, fb++, *vb++, hi, udp);
2160 pf_patch_8(m, cksum, fb++, *vb++, !hi, udp);
2164 pf_patch_32_unaligned(struct mbuf *m, u_int16_t *cksum, void *f, u_int32_t v,
2165 bool hi, u_int8_t udp)
2167 u_int8_t *fb = (u_int8_t *)f;
2168 u_int8_t *vb = (u_int8_t *)&v;
2170 pf_patch_8(m, cksum, fb++, *vb++, hi, udp);
2171 pf_patch_8(m, cksum, fb++, *vb++, !hi, udp);
2172 pf_patch_8(m, cksum, fb++, *vb++, hi, udp);
2173 pf_patch_8(m, cksum, fb++, *vb++, !hi, udp);
2177 pf_proto_cksum_fixup(struct mbuf *m, u_int16_t cksum, u_int16_t old,
2178 u_int16_t new, u_int8_t udp)
2180 if (m->m_pkthdr.csum_flags & (CSUM_DELAY_DATA | CSUM_DELAY_DATA_IPV6))
2183 return (pf_cksum_fixup(cksum, old, new, udp));
2187 pf_change_ap(struct mbuf *m, struct pf_addr *a, u_int16_t *p, u_int16_t *ic,
2188 u_int16_t *pc, struct pf_addr *an, u_int16_t pn, u_int8_t u,
2194 PF_ACPY(&ao, a, af);
2197 if (m->m_pkthdr.csum_flags & (CSUM_DELAY_DATA | CSUM_DELAY_DATA_IPV6))
2205 *ic = pf_cksum_fixup(pf_cksum_fixup(*ic,
2206 ao.addr16[0], an->addr16[0], 0),
2207 ao.addr16[1], an->addr16[1], 0);
2210 *pc = pf_cksum_fixup(pf_cksum_fixup(*pc,
2211 ao.addr16[0], an->addr16[0], u),
2212 ao.addr16[1], an->addr16[1], u);
2214 *pc = pf_proto_cksum_fixup(m, *pc, po, pn, u);
2219 *pc = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2220 pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2221 pf_cksum_fixup(pf_cksum_fixup(*pc,
2222 ao.addr16[0], an->addr16[0], u),
2223 ao.addr16[1], an->addr16[1], u),
2224 ao.addr16[2], an->addr16[2], u),
2225 ao.addr16[3], an->addr16[3], u),
2226 ao.addr16[4], an->addr16[4], u),
2227 ao.addr16[5], an->addr16[5], u),
2228 ao.addr16[6], an->addr16[6], u),
2229 ao.addr16[7], an->addr16[7], u);
2231 *pc = pf_proto_cksum_fixup(m, *pc, po, pn, u);
2236 if (m->m_pkthdr.csum_flags & (CSUM_DELAY_DATA |
2237 CSUM_DELAY_DATA_IPV6)) {
2244 /* Changes a u_int32_t. Uses a void * so there are no align restrictions */
2246 pf_change_a(void *a, u_int16_t *c, u_int32_t an, u_int8_t u)
2250 memcpy(&ao, a, sizeof(ao));
2251 memcpy(a, &an, sizeof(u_int32_t));
2252 *c = pf_cksum_fixup(pf_cksum_fixup(*c, ao / 65536, an / 65536, u),
2253 ao % 65536, an % 65536, u);
2257 pf_change_proto_a(struct mbuf *m, void *a, u_int16_t *c, u_int32_t an, u_int8_t udp)
2261 memcpy(&ao, a, sizeof(ao));
2262 memcpy(a, &an, sizeof(u_int32_t));
2264 *c = pf_proto_cksum_fixup(m,
2265 pf_proto_cksum_fixup(m, *c, ao / 65536, an / 65536, udp),
2266 ao % 65536, an % 65536, udp);
2271 pf_change_a6(struct pf_addr *a, u_int16_t *c, struct pf_addr *an, u_int8_t u)
2275 PF_ACPY(&ao, a, AF_INET6);
2276 PF_ACPY(a, an, AF_INET6);
2278 *c = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2279 pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2280 pf_cksum_fixup(pf_cksum_fixup(*c,
2281 ao.addr16[0], an->addr16[0], u),
2282 ao.addr16[1], an->addr16[1], u),
2283 ao.addr16[2], an->addr16[2], u),
2284 ao.addr16[3], an->addr16[3], u),
2285 ao.addr16[4], an->addr16[4], u),
2286 ao.addr16[5], an->addr16[5], u),
2287 ao.addr16[6], an->addr16[6], u),
2288 ao.addr16[7], an->addr16[7], u);
2293 pf_change_icmp(struct pf_addr *ia, u_int16_t *ip, struct pf_addr *oa,
2294 struct pf_addr *na, u_int16_t np, u_int16_t *pc, u_int16_t *h2c,
2295 u_int16_t *ic, u_int16_t *hc, u_int8_t u, sa_family_t af)
2297 struct pf_addr oia, ooa;
2299 PF_ACPY(&oia, ia, af);
2301 PF_ACPY(&ooa, oa, af);
2303 /* Change inner protocol port, fix inner protocol checksum. */
2305 u_int16_t oip = *ip;
2312 *pc = pf_cksum_fixup(*pc, oip, *ip, u);
2313 *ic = pf_cksum_fixup(*ic, oip, *ip, 0);
2315 *ic = pf_cksum_fixup(*ic, opc, *pc, 0);
2317 /* Change inner ip address, fix inner ip and icmp checksums. */
2318 PF_ACPY(ia, na, af);
2322 u_int32_t oh2c = *h2c;
2324 *h2c = pf_cksum_fixup(pf_cksum_fixup(*h2c,
2325 oia.addr16[0], ia->addr16[0], 0),
2326 oia.addr16[1], ia->addr16[1], 0);
2327 *ic = pf_cksum_fixup(pf_cksum_fixup(*ic,
2328 oia.addr16[0], ia->addr16[0], 0),
2329 oia.addr16[1], ia->addr16[1], 0);
2330 *ic = pf_cksum_fixup(*ic, oh2c, *h2c, 0);
2336 *ic = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2337 pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2338 pf_cksum_fixup(pf_cksum_fixup(*ic,
2339 oia.addr16[0], ia->addr16[0], u),
2340 oia.addr16[1], ia->addr16[1], u),
2341 oia.addr16[2], ia->addr16[2], u),
2342 oia.addr16[3], ia->addr16[3], u),
2343 oia.addr16[4], ia->addr16[4], u),
2344 oia.addr16[5], ia->addr16[5], u),
2345 oia.addr16[6], ia->addr16[6], u),
2346 oia.addr16[7], ia->addr16[7], u);
2350 /* Outer ip address, fix outer ip or icmpv6 checksum, if necessary. */
2352 PF_ACPY(oa, na, af);
2356 *hc = pf_cksum_fixup(pf_cksum_fixup(*hc,
2357 ooa.addr16[0], oa->addr16[0], 0),
2358 ooa.addr16[1], oa->addr16[1], 0);
2363 *ic = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2364 pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
2365 pf_cksum_fixup(pf_cksum_fixup(*ic,
2366 ooa.addr16[0], oa->addr16[0], u),
2367 ooa.addr16[1], oa->addr16[1], u),
2368 ooa.addr16[2], oa->addr16[2], u),
2369 ooa.addr16[3], oa->addr16[3], u),
2370 ooa.addr16[4], oa->addr16[4], u),
2371 ooa.addr16[5], oa->addr16[5], u),
2372 ooa.addr16[6], oa->addr16[6], u),
2373 ooa.addr16[7], oa->addr16[7], u);
2381 * Need to modulate the sequence numbers in the TCP SACK option
2382 * (credits to Krzysztof Pfaff for report and patch)
2385 pf_modulate_sack(struct mbuf *m, int off, struct pf_pdesc *pd,
2386 struct tcphdr *th, struct pf_state_peer *dst)
2388 int hlen = (th->th_off << 2) - sizeof(*th), thoptlen = hlen;
2389 u_int8_t opts[TCP_MAXOLEN], *opt = opts;
2390 int copyback = 0, i, olen;
2391 struct sackblk sack;
2393 #define TCPOLEN_SACKLEN (TCPOLEN_SACK + 2)
2394 if (hlen < TCPOLEN_SACKLEN ||
2395 !pf_pull_hdr(m, off + sizeof(*th), opts, hlen, NULL, NULL, pd->af))
2398 while (hlen >= TCPOLEN_SACKLEN) {
2399 size_t startoff = opt - opts;
2402 case TCPOPT_EOL: /* FALLTHROUGH */
2410 if (olen >= TCPOLEN_SACKLEN) {
2411 for (i = 2; i + TCPOLEN_SACK <= olen;
2412 i += TCPOLEN_SACK) {
2413 memcpy(&sack, &opt[i], sizeof(sack));
2414 pf_patch_32_unaligned(m,
2415 &th->th_sum, &sack.start,
2416 htonl(ntohl(sack.start) - dst->seqdiff),
2417 PF_ALGNMNT(startoff),
2419 pf_patch_32_unaligned(m, &th->th_sum,
2421 htonl(ntohl(sack.end) - dst->seqdiff),
2422 PF_ALGNMNT(startoff),
2424 memcpy(&opt[i], &sack, sizeof(sack));
2438 m_copyback(m, off + sizeof(*th), thoptlen, (caddr_t)opts);
2443 pf_send_tcp(struct mbuf *replyto, const struct pf_krule *r, sa_family_t af,
2444 const struct pf_addr *saddr, const struct pf_addr *daddr,
2445 u_int16_t sport, u_int16_t dport, u_int32_t seq, u_int32_t ack,
2446 u_int8_t flags, u_int16_t win, u_int16_t mss, u_int8_t ttl, int tag,
2447 u_int16_t rtag, struct ifnet *ifp)
2449 struct pf_send_entry *pfse;
2453 struct ip *h = NULL;
2456 struct ip6_hdr *h6 = NULL;
2460 struct pf_mtag *pf_mtag;
2465 /* maximum segment size tcp option */
2466 tlen = sizeof(struct tcphdr);
2473 len = sizeof(struct ip) + tlen;
2478 len = sizeof(struct ip6_hdr) + tlen;
2482 panic("%s: unsupported af %d", __func__, af);
2485 /* Allocate outgoing queue entry, mbuf and mbuf tag. */
2486 pfse = malloc(sizeof(*pfse), M_PFTEMP, M_NOWAIT);
2489 m = m_gethdr(M_NOWAIT, MT_DATA);
2491 free(pfse, M_PFTEMP);
2495 mac_netinet_firewall_send(m);
2497 if ((pf_mtag = pf_get_mtag(m)) == NULL) {
2498 free(pfse, M_PFTEMP);
2503 m->m_flags |= M_SKIP_FIREWALL;
2504 pf_mtag->tag = rtag;
2506 if (r != NULL && r->rtableid >= 0)
2507 M_SETFIB(m, r->rtableid);
2510 if (r != NULL && r->qid) {
2511 pf_mtag->qid = r->qid;
2513 /* add hints for ecn */
2514 pf_mtag->hdr = mtod(m, struct ip *);
2517 m->m_data += max_linkhdr;
2518 m->m_pkthdr.len = m->m_len = len;
2519 m->m_pkthdr.rcvif = NULL;
2520 bzero(m->m_data, len);
2524 h = mtod(m, struct ip *);
2526 /* IP header fields included in the TCP checksum */
2527 h->ip_p = IPPROTO_TCP;
2528 h->ip_len = htons(tlen);
2529 h->ip_src.s_addr = saddr->v4.s_addr;
2530 h->ip_dst.s_addr = daddr->v4.s_addr;
2532 th = (struct tcphdr *)((caddr_t)h + sizeof(struct ip));
2537 h6 = mtod(m, struct ip6_hdr *);
2539 /* IP header fields included in the TCP checksum */
2540 h6->ip6_nxt = IPPROTO_TCP;
2541 h6->ip6_plen = htons(tlen);
2542 memcpy(&h6->ip6_src, &saddr->v6, sizeof(struct in6_addr));
2543 memcpy(&h6->ip6_dst, &daddr->v6, sizeof(struct in6_addr));
2545 th = (struct tcphdr *)((caddr_t)h6 + sizeof(struct ip6_hdr));
2551 th->th_sport = sport;
2552 th->th_dport = dport;
2553 th->th_seq = htonl(seq);
2554 th->th_ack = htonl(ack);
2555 th->th_off = tlen >> 2;
2556 th->th_flags = flags;
2557 th->th_win = htons(win);
2560 opt = (char *)(th + 1);
2561 opt[0] = TCPOPT_MAXSEG;
2564 bcopy((caddr_t)&mss, (caddr_t)(opt + 2), 2);
2571 th->th_sum = in_cksum(m, len);
2573 /* Finish the IP header */
2575 h->ip_hl = sizeof(*h) >> 2;
2576 h->ip_tos = IPTOS_LOWDELAY;
2577 h->ip_off = htons(V_path_mtu_discovery ? IP_DF : 0);
2578 h->ip_len = htons(len);
2579 h->ip_ttl = ttl ? ttl : V_ip_defttl;
2582 pfse->pfse_type = PFSE_IP;
2588 th->th_sum = in6_cksum(m, IPPROTO_TCP,
2589 sizeof(struct ip6_hdr), tlen);
2591 h6->ip6_vfc |= IPV6_VERSION;
2592 h6->ip6_hlim = IPV6_DEFHLIM;
2594 pfse->pfse_type = PFSE_IP6;
2603 pf_return(struct pf_krule *r, struct pf_krule *nr, struct pf_pdesc *pd,
2604 struct pf_state_key *sk, int off, struct mbuf *m, struct tcphdr *th,
2605 struct pfi_kkif *kif, u_int16_t bproto_sum, u_int16_t bip_sum, int hdrlen,
2608 struct pf_addr * const saddr = pd->src;
2609 struct pf_addr * const daddr = pd->dst;
2610 sa_family_t af = pd->af;
2612 /* undo NAT changes, if they have taken place */
2614 PF_ACPY(saddr, &sk->addr[pd->sidx], af);
2615 PF_ACPY(daddr, &sk->addr[pd->didx], af);
2617 *pd->sport = sk->port[pd->sidx];
2619 *pd->dport = sk->port[pd->didx];
2621 *pd->proto_sum = bproto_sum;
2623 *pd->ip_sum = bip_sum;
2624 m_copyback(m, off, hdrlen, pd->hdr.any);
2626 if (pd->proto == IPPROTO_TCP &&
2627 ((r->rule_flag & PFRULE_RETURNRST) ||
2628 (r->rule_flag & PFRULE_RETURN)) &&
2629 !(th->th_flags & TH_RST)) {
2630 u_int32_t ack = ntohl(th->th_seq) + pd->p_len;
2642 h4 = mtod(m, struct ip *);
2643 len = ntohs(h4->ip_len) - off;
2648 h6 = mtod(m, struct ip6_hdr *);
2649 len = ntohs(h6->ip6_plen) - (off - sizeof(*h6));
2654 if (pf_check_proto_cksum(m, off, len, IPPROTO_TCP, af))
2655 REASON_SET(reason, PFRES_PROTCKSUM);
2657 if (th->th_flags & TH_SYN)
2659 if (th->th_flags & TH_FIN)
2661 pf_send_tcp(m, r, af, pd->dst,
2662 pd->src, th->th_dport, th->th_sport,
2663 ntohl(th->th_ack), ack, TH_RST|TH_ACK, 0, 0,
2664 r->return_ttl, 1, 0, kif->pfik_ifp);
2666 } else if (pd->proto != IPPROTO_ICMP && af == AF_INET &&
2668 pf_send_icmp(m, r->return_icmp >> 8,
2669 r->return_icmp & 255, af, r);
2670 else if (pd->proto != IPPROTO_ICMPV6 && af == AF_INET6 &&
2672 pf_send_icmp(m, r->return_icmp6 >> 8,
2673 r->return_icmp6 & 255, af, r);
2677 pf_ieee8021q_setpcp(struct mbuf *m, u_int8_t prio)
2681 KASSERT(prio <= PF_PRIO_MAX,
2682 ("%s with invalid pcp", __func__));
2684 mtag = m_tag_locate(m, MTAG_8021Q, MTAG_8021Q_PCP_OUT, NULL);
2686 mtag = m_tag_alloc(MTAG_8021Q, MTAG_8021Q_PCP_OUT,
2687 sizeof(uint8_t), M_NOWAIT);
2690 m_tag_prepend(m, mtag);
2693 *(uint8_t *)(mtag + 1) = prio;
2698 pf_match_ieee8021q_pcp(u_int8_t prio, struct mbuf *m)
2703 mtag = m_tag_locate(m, MTAG_8021Q, MTAG_8021Q_PCP_IN, NULL);
2707 if (prio == PF_PRIO_ZERO)
2710 mpcp = *(uint8_t *)(mtag + 1);
2712 return (mpcp == prio);
2716 pf_send_icmp(struct mbuf *m, u_int8_t type, u_int8_t code, sa_family_t af,
2719 struct pf_send_entry *pfse;
2721 struct pf_mtag *pf_mtag;
2723 /* Allocate outgoing queue entry, mbuf and mbuf tag. */
2724 pfse = malloc(sizeof(*pfse), M_PFTEMP, M_NOWAIT);
2728 if ((m0 = m_copypacket(m, M_NOWAIT)) == NULL) {
2729 free(pfse, M_PFTEMP);
2733 if ((pf_mtag = pf_get_mtag(m0)) == NULL) {
2734 free(pfse, M_PFTEMP);
2738 m0->m_flags |= M_SKIP_FIREWALL;
2740 if (r->rtableid >= 0)
2741 M_SETFIB(m0, r->rtableid);
2745 pf_mtag->qid = r->qid;
2746 /* add hints for ecn */
2747 pf_mtag->hdr = mtod(m0, struct ip *);
2754 pfse->pfse_type = PFSE_ICMP;
2759 pfse->pfse_type = PFSE_ICMP6;
2764 pfse->icmpopts.type = type;
2765 pfse->icmpopts.code = code;
2770 * Return 1 if the addresses a and b match (with mask m), otherwise return 0.
2771 * If n is 0, they match if they are equal. If n is != 0, they match if they
2775 pf_match_addr(u_int8_t n, struct pf_addr *a, struct pf_addr *m,
2776 struct pf_addr *b, sa_family_t af)
2783 if ((a->addr32[0] & m->addr32[0]) ==
2784 (b->addr32[0] & m->addr32[0]))
2790 if (((a->addr32[0] & m->addr32[0]) ==
2791 (b->addr32[0] & m->addr32[0])) &&
2792 ((a->addr32[1] & m->addr32[1]) ==
2793 (b->addr32[1] & m->addr32[1])) &&
2794 ((a->addr32[2] & m->addr32[2]) ==
2795 (b->addr32[2] & m->addr32[2])) &&
2796 ((a->addr32[3] & m->addr32[3]) ==
2797 (b->addr32[3] & m->addr32[3])))
2816 * Return 1 if b <= a <= e, otherwise return 0.
2819 pf_match_addr_range(struct pf_addr *b, struct pf_addr *e,
2820 struct pf_addr *a, sa_family_t af)
2825 if ((ntohl(a->addr32[0]) < ntohl(b->addr32[0])) ||
2826 (ntohl(a->addr32[0]) > ntohl(e->addr32[0])))
2835 for (i = 0; i < 4; ++i)
2836 if (ntohl(a->addr32[i]) > ntohl(b->addr32[i]))
2838 else if (ntohl(a->addr32[i]) < ntohl(b->addr32[i]))
2841 for (i = 0; i < 4; ++i)
2842 if (ntohl(a->addr32[i]) < ntohl(e->addr32[i]))
2844 else if (ntohl(a->addr32[i]) > ntohl(e->addr32[i]))
2854 pf_match(u_int8_t op, u_int32_t a1, u_int32_t a2, u_int32_t p)
2858 return ((p > a1) && (p < a2));
2860 return ((p < a1) || (p > a2));
2862 return ((p >= a1) && (p <= a2));
2876 return (0); /* never reached */
2880 pf_match_port(u_int8_t op, u_int16_t a1, u_int16_t a2, u_int16_t p)
2885 return (pf_match(op, a1, a2, p));
2889 pf_match_uid(u_int8_t op, uid_t a1, uid_t a2, uid_t u)
2891 if (u == UID_MAX && op != PF_OP_EQ && op != PF_OP_NE)
2893 return (pf_match(op, a1, a2, u));
2897 pf_match_gid(u_int8_t op, gid_t a1, gid_t a2, gid_t g)
2899 if (g == GID_MAX && op != PF_OP_EQ && op != PF_OP_NE)
2901 return (pf_match(op, a1, a2, g));
2905 pf_match_tag(struct mbuf *m, struct pf_krule *r, int *tag, int mtag)
2910 return ((!r->match_tag_not && r->match_tag == *tag) ||
2911 (r->match_tag_not && r->match_tag != *tag));
2915 pf_tag_packet(struct mbuf *m, struct pf_pdesc *pd, int tag)
2918 KASSERT(tag > 0, ("%s: tag %d", __func__, tag));
2920 if (pd->pf_mtag == NULL && ((pd->pf_mtag = pf_get_mtag(m)) == NULL))
2923 pd->pf_mtag->tag = tag;
2928 #define PF_ANCHOR_STACKSIZE 32
2929 struct pf_kanchor_stackframe {
2930 struct pf_kruleset *rs;
2931 struct pf_krule *r; /* XXX: + match bit */
2932 struct pf_kanchor *child;
2936 * XXX: We rely on malloc(9) returning pointer aligned addresses.
2938 #define PF_ANCHORSTACK_MATCH 0x00000001
2939 #define PF_ANCHORSTACK_MASK (PF_ANCHORSTACK_MATCH)
2941 #define PF_ANCHOR_MATCH(f) ((uintptr_t)(f)->r & PF_ANCHORSTACK_MATCH)
2942 #define PF_ANCHOR_RULE(f) (struct pf_krule *) \
2943 ((uintptr_t)(f)->r & ~PF_ANCHORSTACK_MASK)
2944 #define PF_ANCHOR_SET_MATCH(f) do { (f)->r = (void *) \
2945 ((uintptr_t)(f)->r | PF_ANCHORSTACK_MATCH); \
2949 pf_step_into_anchor(struct pf_kanchor_stackframe *stack, int *depth,
2950 struct pf_kruleset **rs, int n, struct pf_krule **r, struct pf_krule **a,
2953 struct pf_kanchor_stackframe *f;
2959 if (*depth >= PF_ANCHOR_STACKSIZE) {
2960 printf("%s: anchor stack overflow on %s\n",
2961 __func__, (*r)->anchor->name);
2962 *r = TAILQ_NEXT(*r, entries);
2964 } else if (*depth == 0 && a != NULL)
2966 f = stack + (*depth)++;
2969 if ((*r)->anchor_wildcard) {
2970 struct pf_kanchor_node *parent = &(*r)->anchor->children;
2972 if ((f->child = RB_MIN(pf_kanchor_node, parent)) == NULL) {
2976 *rs = &f->child->ruleset;
2979 *rs = &(*r)->anchor->ruleset;
2981 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
2985 pf_step_out_of_anchor(struct pf_kanchor_stackframe *stack, int *depth,
2986 struct pf_kruleset **rs, int n, struct pf_krule **r, struct pf_krule **a,
2989 struct pf_kanchor_stackframe *f;
2990 struct pf_krule *fr;
2998 f = stack + *depth - 1;
2999 fr = PF_ANCHOR_RULE(f);
3000 if (f->child != NULL) {
3001 struct pf_kanchor_node *parent;
3004 * This block traverses through
3005 * a wildcard anchor.
3007 parent = &fr->anchor->children;
3008 if (match != NULL && *match) {
3010 * If any of "*" matched, then
3011 * "foo/ *" matched, mark frame
3014 PF_ANCHOR_SET_MATCH(f);
3017 f->child = RB_NEXT(pf_kanchor_node, parent, f->child);
3018 if (f->child != NULL) {
3019 *rs = &f->child->ruleset;
3020 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
3028 if (*depth == 0 && a != NULL)
3031 if (PF_ANCHOR_MATCH(f) || (match != NULL && *match))
3033 *r = TAILQ_NEXT(fr, entries);
3034 } while (*r == NULL);
3041 pf_poolmask(struct pf_addr *naddr, struct pf_addr *raddr,
3042 struct pf_addr *rmask, struct pf_addr *saddr, sa_family_t af)
3047 naddr->addr32[0] = (raddr->addr32[0] & rmask->addr32[0]) |
3048 ((rmask->addr32[0] ^ 0xffffffff ) & saddr->addr32[0]);
3052 naddr->addr32[0] = (raddr->addr32[0] & rmask->addr32[0]) |
3053 ((rmask->addr32[0] ^ 0xffffffff ) & saddr->addr32[0]);
3054 naddr->addr32[1] = (raddr->addr32[1] & rmask->addr32[1]) |
3055 ((rmask->addr32[1] ^ 0xffffffff ) & saddr->addr32[1]);
3056 naddr->addr32[2] = (raddr->addr32[2] & rmask->addr32[2]) |
3057 ((rmask->addr32[2] ^ 0xffffffff ) & saddr->addr32[2]);
3058 naddr->addr32[3] = (raddr->addr32[3] & rmask->addr32[3]) |
3059 ((rmask->addr32[3] ^ 0xffffffff ) & saddr->addr32[3]);
3065 pf_addr_inc(struct pf_addr *addr, sa_family_t af)
3070 addr->addr32[0] = htonl(ntohl(addr->addr32[0]) + 1);
3074 if (addr->addr32[3] == 0xffffffff) {
3075 addr->addr32[3] = 0;
3076 if (addr->addr32[2] == 0xffffffff) {
3077 addr->addr32[2] = 0;
3078 if (addr->addr32[1] == 0xffffffff) {
3079 addr->addr32[1] = 0;
3081 htonl(ntohl(addr->addr32[0]) + 1);
3084 htonl(ntohl(addr->addr32[1]) + 1);
3087 htonl(ntohl(addr->addr32[2]) + 1);
3090 htonl(ntohl(addr->addr32[3]) + 1);
3097 pf_socket_lookup(int direction, struct pf_pdesc *pd, struct mbuf *m)
3099 struct pf_addr *saddr, *daddr;
3100 u_int16_t sport, dport;
3101 struct inpcbinfo *pi;
3104 pd->lookup.uid = UID_MAX;
3105 pd->lookup.gid = GID_MAX;
3107 switch (pd->proto) {
3109 if (pd->hdr.tcp == NULL)
3111 sport = pd->hdr.tcp->th_sport;
3112 dport = pd->hdr.tcp->th_dport;
3116 if (pd->hdr.udp == NULL)
3118 sport = pd->hdr.udp->uh_sport;
3119 dport = pd->hdr.udp->uh_dport;
3125 if (direction == PF_IN) {
3140 inp = in_pcblookup_mbuf(pi, saddr->v4, sport, daddr->v4,
3141 dport, INPLOOKUP_RLOCKPCB, NULL, m);
3143 inp = in_pcblookup_mbuf(pi, saddr->v4, sport,
3144 daddr->v4, dport, INPLOOKUP_WILDCARD |
3145 INPLOOKUP_RLOCKPCB, NULL, m);
3153 inp = in6_pcblookup_mbuf(pi, &saddr->v6, sport, &daddr->v6,
3154 dport, INPLOOKUP_RLOCKPCB, NULL, m);
3156 inp = in6_pcblookup_mbuf(pi, &saddr->v6, sport,
3157 &daddr->v6, dport, INPLOOKUP_WILDCARD |
3158 INPLOOKUP_RLOCKPCB, NULL, m);
3168 INP_RLOCK_ASSERT(inp);
3169 pd->lookup.uid = inp->inp_cred->cr_uid;
3170 pd->lookup.gid = inp->inp_cred->cr_groups[0];
3177 pf_get_wscale(struct mbuf *m, int off, u_int16_t th_off, sa_family_t af)
3181 u_int8_t *opt, optlen;
3182 u_int8_t wscale = 0;
3184 hlen = th_off << 2; /* hlen <= sizeof(hdr) */
3185 if (hlen <= sizeof(struct tcphdr))
3187 if (!pf_pull_hdr(m, off, hdr, hlen, NULL, NULL, af))
3189 opt = hdr + sizeof(struct tcphdr);
3190 hlen -= sizeof(struct tcphdr);
3200 if (wscale > TCP_MAX_WINSHIFT)
3201 wscale = TCP_MAX_WINSHIFT;
3202 wscale |= PF_WSCALE_FLAG;
3217 pf_get_mss(struct mbuf *m, int off, u_int16_t th_off, sa_family_t af)
3221 u_int8_t *opt, optlen;
3222 u_int16_t mss = V_tcp_mssdflt;
3224 hlen = th_off << 2; /* hlen <= sizeof(hdr) */
3225 if (hlen <= sizeof(struct tcphdr))
3227 if (!pf_pull_hdr(m, off, hdr, hlen, NULL, NULL, af))
3229 opt = hdr + sizeof(struct tcphdr);
3230 hlen -= sizeof(struct tcphdr);
3231 while (hlen >= TCPOLEN_MAXSEG) {
3239 bcopy((caddr_t)(opt + 2), (caddr_t)&mss, 2);
3255 pf_calc_mss(struct pf_addr *addr, sa_family_t af, int rtableid, u_int16_t offer)
3257 struct nhop_object *nh;
3259 struct in6_addr dst6;
3270 hlen = sizeof(struct ip);
3271 nh = fib4_lookup(rtableid, addr->v4, 0, 0, 0);
3273 mss = nh->nh_mtu - hlen - sizeof(struct tcphdr);
3278 hlen = sizeof(struct ip6_hdr);
3279 in6_splitscope(&addr->v6, &dst6, &scopeid);
3280 nh = fib6_lookup(rtableid, &dst6, scopeid, 0, 0);
3282 mss = nh->nh_mtu - hlen - sizeof(struct tcphdr);
3287 mss = max(V_tcp_mssdflt, mss);
3288 mss = min(mss, offer);
3289 mss = max(mss, 64); /* sanity - at least max opt space */
3294 pf_tcp_iss(struct pf_pdesc *pd)
3297 u_int32_t digest[4];
3299 if (V_pf_tcp_secret_init == 0) {
3300 arc4random_buf(&V_pf_tcp_secret, sizeof(V_pf_tcp_secret));
3301 MD5Init(&V_pf_tcp_secret_ctx);
3302 MD5Update(&V_pf_tcp_secret_ctx, V_pf_tcp_secret,
3303 sizeof(V_pf_tcp_secret));
3304 V_pf_tcp_secret_init = 1;
3307 ctx = V_pf_tcp_secret_ctx;
3309 MD5Update(&ctx, (char *)&pd->hdr.tcp->th_sport, sizeof(u_short));
3310 MD5Update(&ctx, (char *)&pd->hdr.tcp->th_dport, sizeof(u_short));
3311 if (pd->af == AF_INET6) {
3312 MD5Update(&ctx, (char *)&pd->src->v6, sizeof(struct in6_addr));
3313 MD5Update(&ctx, (char *)&pd->dst->v6, sizeof(struct in6_addr));
3315 MD5Update(&ctx, (char *)&pd->src->v4, sizeof(struct in_addr));
3316 MD5Update(&ctx, (char *)&pd->dst->v4, sizeof(struct in_addr));
3318 MD5Final((u_char *)digest, &ctx);
3319 V_pf_tcp_iss_off += 4096;
3320 #define ISN_RANDOM_INCREMENT (4096 - 1)
3321 return (digest[0] + (arc4random() & ISN_RANDOM_INCREMENT) +
3323 #undef ISN_RANDOM_INCREMENT
3327 pf_test_rule(struct pf_krule **rm, struct pf_state **sm, int direction,
3328 struct pfi_kkif *kif, struct mbuf *m, int off, struct pf_pdesc *pd,
3329 struct pf_krule **am, struct pf_kruleset **rsm, struct inpcb *inp)
3331 struct pf_krule *nr = NULL;
3332 struct pf_addr * const saddr = pd->src;
3333 struct pf_addr * const daddr = pd->dst;
3334 sa_family_t af = pd->af;
3335 struct pf_krule *r, *a = NULL;
3336 struct pf_kruleset *ruleset = NULL;
3337 struct pf_ksrc_node *nsn = NULL;
3338 struct tcphdr *th = pd->hdr.tcp;
3339 struct pf_state_key *sk = NULL, *nk = NULL;
3341 int rewrite = 0, hdrlen = 0;
3342 int tag = -1, rtableid = -1;
3346 u_int16_t sport = 0, dport = 0;
3347 u_int16_t bproto_sum = 0, bip_sum = 0;
3348 u_int8_t icmptype = 0, icmpcode = 0;
3349 struct pf_kanchor_stackframe anchor_stack[PF_ANCHOR_STACKSIZE];
3354 INP_LOCK_ASSERT(inp);
3355 pd->lookup.uid = inp->inp_cred->cr_uid;
3356 pd->lookup.gid = inp->inp_cred->cr_groups[0];
3357 pd->lookup.done = 1;
3360 switch (pd->proto) {
3362 sport = th->th_sport;
3363 dport = th->th_dport;
3364 hdrlen = sizeof(*th);
3367 sport = pd->hdr.udp->uh_sport;
3368 dport = pd->hdr.udp->uh_dport;
3369 hdrlen = sizeof(*pd->hdr.udp);
3373 if (pd->af != AF_INET)
3375 sport = dport = pd->hdr.icmp->icmp_id;
3376 hdrlen = sizeof(*pd->hdr.icmp);
3377 icmptype = pd->hdr.icmp->icmp_type;
3378 icmpcode = pd->hdr.icmp->icmp_code;
3380 if (icmptype == ICMP_UNREACH ||
3381 icmptype == ICMP_SOURCEQUENCH ||
3382 icmptype == ICMP_REDIRECT ||
3383 icmptype == ICMP_TIMXCEED ||
3384 icmptype == ICMP_PARAMPROB)
3389 case IPPROTO_ICMPV6:
3392 sport = dport = pd->hdr.icmp6->icmp6_id;
3393 hdrlen = sizeof(*pd->hdr.icmp6);
3394 icmptype = pd->hdr.icmp6->icmp6_type;
3395 icmpcode = pd->hdr.icmp6->icmp6_code;
3397 if (icmptype == ICMP6_DST_UNREACH ||
3398 icmptype == ICMP6_PACKET_TOO_BIG ||
3399 icmptype == ICMP6_TIME_EXCEEDED ||
3400 icmptype == ICMP6_PARAM_PROB)
3405 sport = dport = hdrlen = 0;
3409 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
3411 /* check packet for BINAT/NAT/RDR */
3412 if ((nr = pf_get_translation(pd, m, off, direction, kif, &nsn, &sk,
3413 &nk, saddr, daddr, sport, dport, anchor_stack)) != NULL) {
3414 KASSERT(sk != NULL, ("%s: null sk", __func__));
3415 KASSERT(nk != NULL, ("%s: null nk", __func__));
3418 bip_sum = *pd->ip_sum;
3420 switch (pd->proto) {
3422 bproto_sum = th->th_sum;
3423 pd->proto_sum = &th->th_sum;
3425 if (PF_ANEQ(saddr, &nk->addr[pd->sidx], af) ||
3426 nk->port[pd->sidx] != sport) {
3427 pf_change_ap(m, saddr, &th->th_sport, pd->ip_sum,
3428 &th->th_sum, &nk->addr[pd->sidx],
3429 nk->port[pd->sidx], 0, af);
3430 pd->sport = &th->th_sport;
3431 sport = th->th_sport;
3434 if (PF_ANEQ(daddr, &nk->addr[pd->didx], af) ||
3435 nk->port[pd->didx] != dport) {
3436 pf_change_ap(m, daddr, &th->th_dport, pd->ip_sum,
3437 &th->th_sum, &nk->addr[pd->didx],
3438 nk->port[pd->didx], 0, af);
3439 dport = th->th_dport;
3440 pd->dport = &th->th_dport;
3445 bproto_sum = pd->hdr.udp->uh_sum;
3446 pd->proto_sum = &pd->hdr.udp->uh_sum;
3448 if (PF_ANEQ(saddr, &nk->addr[pd->sidx], af) ||
3449 nk->port[pd->sidx] != sport) {
3450 pf_change_ap(m, saddr, &pd->hdr.udp->uh_sport,
3451 pd->ip_sum, &pd->hdr.udp->uh_sum,
3452 &nk->addr[pd->sidx],
3453 nk->port[pd->sidx], 1, af);
3454 sport = pd->hdr.udp->uh_sport;
3455 pd->sport = &pd->hdr.udp->uh_sport;
3458 if (PF_ANEQ(daddr, &nk->addr[pd->didx], af) ||
3459 nk->port[pd->didx] != dport) {
3460 pf_change_ap(m, daddr, &pd->hdr.udp->uh_dport,
3461 pd->ip_sum, &pd->hdr.udp->uh_sum,
3462 &nk->addr[pd->didx],
3463 nk->port[pd->didx], 1, af);
3464 dport = pd->hdr.udp->uh_dport;
3465 pd->dport = &pd->hdr.udp->uh_dport;
3471 nk->port[0] = nk->port[1];
3472 if (PF_ANEQ(saddr, &nk->addr[pd->sidx], AF_INET))
3473 pf_change_a(&saddr->v4.s_addr, pd->ip_sum,
3474 nk->addr[pd->sidx].v4.s_addr, 0);
3476 if (PF_ANEQ(daddr, &nk->addr[pd->didx], AF_INET))
3477 pf_change_a(&daddr->v4.s_addr, pd->ip_sum,
3478 nk->addr[pd->didx].v4.s_addr, 0);
3480 if (nk->port[1] != pd->hdr.icmp->icmp_id) {
3481 pd->hdr.icmp->icmp_cksum = pf_cksum_fixup(
3482 pd->hdr.icmp->icmp_cksum, sport,
3484 pd->hdr.icmp->icmp_id = nk->port[1];
3485 pd->sport = &pd->hdr.icmp->icmp_id;
3487 m_copyback(m, off, ICMP_MINLEN, (caddr_t)pd->hdr.icmp);
3491 case IPPROTO_ICMPV6:
3492 nk->port[0] = nk->port[1];
3493 if (PF_ANEQ(saddr, &nk->addr[pd->sidx], AF_INET6))
3494 pf_change_a6(saddr, &pd->hdr.icmp6->icmp6_cksum,
3495 &nk->addr[pd->sidx], 0);
3497 if (PF_ANEQ(daddr, &nk->addr[pd->didx], AF_INET6))
3498 pf_change_a6(daddr, &pd->hdr.icmp6->icmp6_cksum,
3499 &nk->addr[pd->didx], 0);
3508 &nk->addr[pd->sidx], AF_INET))
3509 pf_change_a(&saddr->v4.s_addr,
3511 nk->addr[pd->sidx].v4.s_addr, 0);
3514 &nk->addr[pd->didx], AF_INET))
3515 pf_change_a(&daddr->v4.s_addr,
3517 nk->addr[pd->didx].v4.s_addr, 0);
3523 &nk->addr[pd->sidx], AF_INET6))
3524 PF_ACPY(saddr, &nk->addr[pd->sidx], af);
3527 &nk->addr[pd->didx], AF_INET6))
3528 PF_ACPY(daddr, &nk->addr[pd->didx], af);
3540 counter_u64_add(r->evaluations, 1);
3541 if (pfi_kkif_match(r->kif, kif) == r->ifnot)
3542 r = r->skip[PF_SKIP_IFP].ptr;
3543 else if (r->direction && r->direction != direction)
3544 r = r->skip[PF_SKIP_DIR].ptr;
3545 else if (r->af && r->af != af)
3546 r = r->skip[PF_SKIP_AF].ptr;
3547 else if (r->proto && r->proto != pd->proto)
3548 r = r->skip[PF_SKIP_PROTO].ptr;
3549 else if (PF_MISMATCHAW(&r->src.addr, saddr, af,
3550 r->src.neg, kif, M_GETFIB(m)))
3551 r = r->skip[PF_SKIP_SRC_ADDR].ptr;
3552 /* tcp/udp only. port_op always 0 in other cases */
3553 else if (r->src.port_op && !pf_match_port(r->src.port_op,
3554 r->src.port[0], r->src.port[1], sport))
3555 r = r->skip[PF_SKIP_SRC_PORT].ptr;
3556 else if (PF_MISMATCHAW(&r->dst.addr, daddr, af,
3557 r->dst.neg, NULL, M_GETFIB(m)))
3558 r = r->skip[PF_SKIP_DST_ADDR].ptr;
3559 /* tcp/udp only. port_op always 0 in other cases */
3560 else if (r->dst.port_op && !pf_match_port(r->dst.port_op,
3561 r->dst.port[0], r->dst.port[1], dport))
3562 r = r->skip[PF_SKIP_DST_PORT].ptr;
3563 /* icmp only. type always 0 in other cases */
3564 else if (r->type && r->type != icmptype + 1)
3565 r = TAILQ_NEXT(r, entries);
3566 /* icmp only. type always 0 in other cases */
3567 else if (r->code && r->code != icmpcode + 1)
3568 r = TAILQ_NEXT(r, entries);
3569 else if (r->tos && !(r->tos == pd->tos))
3570 r = TAILQ_NEXT(r, entries);
3571 else if (r->rule_flag & PFRULE_FRAGMENT)
3572 r = TAILQ_NEXT(r, entries);
3573 else if (pd->proto == IPPROTO_TCP &&
3574 (r->flagset & th->th_flags) != r->flags)
3575 r = TAILQ_NEXT(r, entries);
3576 /* tcp/udp only. uid.op always 0 in other cases */
3577 else if (r->uid.op && (pd->lookup.done || (pd->lookup.done =
3578 pf_socket_lookup(direction, pd, m), 1)) &&
3579 !pf_match_uid(r->uid.op, r->uid.uid[0], r->uid.uid[1],
3581 r = TAILQ_NEXT(r, entries);
3582 /* tcp/udp only. gid.op always 0 in other cases */
3583 else if (r->gid.op && (pd->lookup.done || (pd->lookup.done =
3584 pf_socket_lookup(direction, pd, m), 1)) &&
3585 !pf_match_gid(r->gid.op, r->gid.gid[0], r->gid.gid[1],
3587 r = TAILQ_NEXT(r, entries);
3589 !pf_match_ieee8021q_pcp(r->prio, m))
3590 r = TAILQ_NEXT(r, entries);
3592 r->prob <= arc4random())
3593 r = TAILQ_NEXT(r, entries);
3594 else if (r->match_tag && !pf_match_tag(m, r, &tag,
3595 pd->pf_mtag ? pd->pf_mtag->tag : 0))
3596 r = TAILQ_NEXT(r, entries);
3597 else if (r->os_fingerprint != PF_OSFP_ANY &&
3598 (pd->proto != IPPROTO_TCP || !pf_osfp_match(
3599 pf_osfp_fingerprint(pd, m, off, th),
3600 r->os_fingerprint)))
3601 r = TAILQ_NEXT(r, entries);
3605 if (r->rtableid >= 0)
3606 rtableid = r->rtableid;
3607 if (r->anchor == NULL) {
3614 r = TAILQ_NEXT(r, entries);
3616 pf_step_into_anchor(anchor_stack, &asd,
3617 &ruleset, PF_RULESET_FILTER, &r, &a,
3620 if (r == NULL && pf_step_out_of_anchor(anchor_stack, &asd,
3621 &ruleset, PF_RULESET_FILTER, &r, &a, &match))
3628 REASON_SET(&reason, PFRES_MATCH);
3630 if (r->log || (nr != NULL && nr->log)) {
3632 m_copyback(m, off, hdrlen, pd->hdr.any);
3633 PFLOG_PACKET(kif, m, af, direction, reason, r->log ? r : nr, a,
3637 if ((r->action == PF_DROP) &&
3638 ((r->rule_flag & PFRULE_RETURNRST) ||
3639 (r->rule_flag & PFRULE_RETURNICMP) ||
3640 (r->rule_flag & PFRULE_RETURN))) {
3641 pf_return(r, nr, pd, sk, off, m, th, kif, bproto_sum,
3642 bip_sum, hdrlen, &reason);
3645 if (r->action == PF_DROP)
3648 if (tag > 0 && pf_tag_packet(m, pd, tag)) {
3649 REASON_SET(&reason, PFRES_MEMORY);
3653 M_SETFIB(m, rtableid);
3655 if (!state_icmp && (r->keep_state || nr != NULL ||
3656 (pd->flags & PFDESC_TCP_NORM))) {
3658 action = pf_create_state(r, nr, a, pd, nsn, nk, sk, m, off,
3659 sport, dport, &rewrite, kif, sm, tag, bproto_sum, bip_sum,
3661 if (action != PF_PASS) {
3662 if (action == PF_DROP &&
3663 (r->rule_flag & PFRULE_RETURN))
3664 pf_return(r, nr, pd, sk, off, m, th, kif,
3665 bproto_sum, bip_sum, hdrlen, &reason);
3670 uma_zfree(V_pf_state_key_z, sk);
3672 uma_zfree(V_pf_state_key_z, nk);
3675 /* copy back packet headers if we performed NAT operations */
3677 m_copyback(m, off, hdrlen, pd->hdr.any);
3679 if (*sm != NULL && !((*sm)->state_flags & PFSTATE_NOSYNC) &&
3680 direction == PF_OUT &&
3681 V_pfsync_defer_ptr != NULL && V_pfsync_defer_ptr(*sm, m))
3683 * We want the state created, but we dont
3684 * want to send this in case a partner
3685 * firewall has to know about it to allow
3686 * replies through it.
3694 uma_zfree(V_pf_state_key_z, sk);
3696 uma_zfree(V_pf_state_key_z, nk);
3701 pf_create_state(struct pf_krule *r, struct pf_krule *nr, struct pf_krule *a,
3702 struct pf_pdesc *pd, struct pf_ksrc_node *nsn, struct pf_state_key *nk,
3703 struct pf_state_key *sk, struct mbuf *m, int off, u_int16_t sport,
3704 u_int16_t dport, int *rewrite, struct pfi_kkif *kif, struct pf_state **sm,
3705 int tag, u_int16_t bproto_sum, u_int16_t bip_sum, int hdrlen)
3707 struct pf_state *s = NULL;
3708 struct pf_ksrc_node *sn = NULL;
3709 struct tcphdr *th = pd->hdr.tcp;
3710 u_int16_t mss = V_tcp_mssdflt;
3713 /* check maximums */
3714 if (r->max_states &&
3715 (counter_u64_fetch(r->states_cur) >= r->max_states)) {
3716 counter_u64_add(V_pf_status.lcounters[LCNT_STATES], 1);
3717 REASON_SET(&reason, PFRES_MAXSTATES);
3720 /* src node for filter rule */
3721 if ((r->rule_flag & PFRULE_SRCTRACK ||
3722 r->rpool.opts & PF_POOL_STICKYADDR) &&
3723 pf_insert_src_node(&sn, r, pd->src, pd->af) != 0) {
3724 REASON_SET(&reason, PFRES_SRCLIMIT);
3727 /* src node for translation rule */
3728 if (nr != NULL && (nr->rpool.opts & PF_POOL_STICKYADDR) &&
3729 pf_insert_src_node(&nsn, nr, &sk->addr[pd->sidx], pd->af)) {
3730 REASON_SET(&reason, PFRES_SRCLIMIT);
3733 s = uma_zalloc(V_pf_state_z, M_NOWAIT | M_ZERO);
3735 REASON_SET(&reason, PFRES_MEMORY);
3738 for (int i = 0; i < 2; i++) {
3739 s->bytes[i] = counter_u64_alloc(M_NOWAIT);
3740 s->packets[i] = counter_u64_alloc(M_NOWAIT);
3742 if (s->bytes[i] == NULL || s->packets[i] == NULL) {
3744 REASON_SET(&reason, PFRES_MEMORY);
3749 s->nat_rule.ptr = nr;
3751 STATE_INC_COUNTERS(s);
3753 s->state_flags |= PFSTATE_ALLOWOPTS;
3754 if (r->rule_flag & PFRULE_STATESLOPPY)
3755 s->state_flags |= PFSTATE_SLOPPY;
3756 s->log = r->log & PF_LOG_ALL;
3757 s->sync_state = PFSYNC_S_NONE;
3759 s->log |= nr->log & PF_LOG_ALL;
3760 switch (pd->proto) {
3762 s->src.seqlo = ntohl(th->th_seq);
3763 s->src.seqhi = s->src.seqlo + pd->p_len + 1;
3764 if ((th->th_flags & (TH_SYN|TH_ACK)) == TH_SYN &&
3765 r->keep_state == PF_STATE_MODULATE) {
3766 /* Generate sequence number modulator */
3767 if ((s->src.seqdiff = pf_tcp_iss(pd) - s->src.seqlo) ==
3770 pf_change_proto_a(m, &th->th_seq, &th->th_sum,
3771 htonl(s->src.seqlo + s->src.seqdiff), 0);
3775 if (th->th_flags & TH_SYN) {
3777 s->src.wscale = pf_get_wscale(m, off,
3778 th->th_off, pd->af);
3780 s->src.max_win = MAX(ntohs(th->th_win), 1);
3781 if (s->src.wscale & PF_WSCALE_MASK) {
3782 /* Remove scale factor from initial window */
3783 int win = s->src.max_win;
3784 win += 1 << (s->src.wscale & PF_WSCALE_MASK);
3785 s->src.max_win = (win - 1) >>
3786 (s->src.wscale & PF_WSCALE_MASK);
3788 if (th->th_flags & TH_FIN)
3792 s->src.state = TCPS_SYN_SENT;
3793 s->dst.state = TCPS_CLOSED;
3794 s->timeout = PFTM_TCP_FIRST_PACKET;
3797 s->src.state = PFUDPS_SINGLE;
3798 s->dst.state = PFUDPS_NO_TRAFFIC;
3799 s->timeout = PFTM_UDP_FIRST_PACKET;
3803 case IPPROTO_ICMPV6:
3805 s->timeout = PFTM_ICMP_FIRST_PACKET;
3808 s->src.state = PFOTHERS_SINGLE;
3809 s->dst.state = PFOTHERS_NO_TRAFFIC;
3810 s->timeout = PFTM_OTHER_FIRST_PACKET;
3814 if (pf_map_addr(pd->af, r, pd->src, &s->rt_addr, NULL, &sn)) {
3815 REASON_SET(&reason, PFRES_MAPFAILED);
3816 pf_src_tree_remove_state(s);
3817 STATE_DEC_COUNTERS(s);
3818 uma_zfree(V_pf_state_z, s);
3821 s->rt_kif = r->rpool.cur->kif;
3824 s->creation = time_uptime;
3825 s->expire = time_uptime;
3830 /* XXX We only modify one side for now. */
3831 PF_ACPY(&nsn->raddr, &nk->addr[1], pd->af);
3832 s->nat_src_node = nsn;
3834 if (pd->proto == IPPROTO_TCP) {
3835 if ((pd->flags & PFDESC_TCP_NORM) && pf_normalize_tcp_init(m,
3836 off, pd, th, &s->src, &s->dst)) {
3837 REASON_SET(&reason, PFRES_MEMORY);
3838 pf_src_tree_remove_state(s);
3839 STATE_DEC_COUNTERS(s);
3840 uma_zfree(V_pf_state_z, s);
3843 if ((pd->flags & PFDESC_TCP_NORM) && s->src.scrub &&
3844 pf_normalize_tcp_stateful(m, off, pd, &reason, th, s,
3845 &s->src, &s->dst, rewrite)) {
3846 /* This really shouldn't happen!!! */
3847 DPFPRINTF(PF_DEBUG_URGENT,
3848 ("pf_normalize_tcp_stateful failed on first "
3850 pf_normalize_tcp_cleanup(s);
3851 pf_src_tree_remove_state(s);
3852 STATE_DEC_COUNTERS(s);
3853 uma_zfree(V_pf_state_z, s);
3857 s->direction = pd->dir;
3860 * sk/nk could already been setup by pf_get_translation().
3863 KASSERT((sk == NULL && nk == NULL), ("%s: nr %p sk %p, nk %p",
3864 __func__, nr, sk, nk));
3865 sk = pf_state_key_setup(pd, pd->src, pd->dst, sport, dport);
3870 KASSERT((sk != NULL && nk != NULL), ("%s: nr %p sk %p, nk %p",
3871 __func__, nr, sk, nk));
3873 /* Swap sk/nk for PF_OUT. */
3874 if (pf_state_insert(BOUND_IFACE(r, kif),
3875 (pd->dir == PF_IN) ? sk : nk,
3876 (pd->dir == PF_IN) ? nk : sk, s)) {
3877 if (pd->proto == IPPROTO_TCP)
3878 pf_normalize_tcp_cleanup(s);
3879 REASON_SET(&reason, PFRES_STATEINS);
3880 pf_src_tree_remove_state(s);
3881 STATE_DEC_COUNTERS(s);
3882 uma_zfree(V_pf_state_z, s);
3889 if (pd->proto == IPPROTO_TCP && (th->th_flags & (TH_SYN|TH_ACK)) ==
3890 TH_SYN && r->keep_state == PF_STATE_SYNPROXY) {
3891 s->src.state = PF_TCPS_PROXY_SRC;
3892 /* undo NAT changes, if they have taken place */
3894 struct pf_state_key *skt = s->key[PF_SK_WIRE];
3895 if (pd->dir == PF_OUT)
3896 skt = s->key[PF_SK_STACK];
3897 PF_ACPY(pd->src, &skt->addr[pd->sidx], pd->af);
3898 PF_ACPY(pd->dst, &skt->addr[pd->didx], pd->af);
3900 *pd->sport = skt->port[pd->sidx];
3902 *pd->dport = skt->port[pd->didx];
3904 *pd->proto_sum = bproto_sum;
3906 *pd->ip_sum = bip_sum;
3907 m_copyback(m, off, hdrlen, pd->hdr.any);
3909 s->src.seqhi = htonl(arc4random());
3910 /* Find mss option */
3911 int rtid = M_GETFIB(m);
3912 mss = pf_get_mss(m, off, th->th_off, pd->af);
3913 mss = pf_calc_mss(pd->src, pd->af, rtid, mss);
3914 mss = pf_calc_mss(pd->dst, pd->af, rtid, mss);
3916 pf_send_tcp(NULL, r, pd->af, pd->dst, pd->src, th->th_dport,
3917 th->th_sport, s->src.seqhi, ntohl(th->th_seq) + 1,
3918 TH_SYN|TH_ACK, 0, s->src.mss, 0, 1, 0, NULL);
3919 REASON_SET(&reason, PFRES_SYNPROXY);
3920 return (PF_SYNPROXY_DROP);
3927 uma_zfree(V_pf_state_key_z, sk);
3929 uma_zfree(V_pf_state_key_z, nk);
3932 struct pf_srchash *sh;
3934 sh = &V_pf_srchash[pf_hashsrc(&sn->addr, sn->af)];
3935 PF_HASHROW_LOCK(sh);
3936 if (--sn->states == 0 && sn->expire == 0) {
3937 pf_unlink_src_node(sn);
3938 uma_zfree(V_pf_sources_z, sn);
3940 V_pf_status.scounters[SCNT_SRC_NODE_REMOVALS], 1);
3942 PF_HASHROW_UNLOCK(sh);
3945 if (nsn != sn && nsn != NULL) {
3946 struct pf_srchash *sh;
3948 sh = &V_pf_srchash[pf_hashsrc(&nsn->addr, nsn->af)];
3949 PF_HASHROW_LOCK(sh);
3950 if (--nsn->states == 0 && nsn->expire == 0) {
3951 pf_unlink_src_node(nsn);
3952 uma_zfree(V_pf_sources_z, nsn);
3954 V_pf_status.scounters[SCNT_SRC_NODE_REMOVALS], 1);
3956 PF_HASHROW_UNLOCK(sh);
3963 pf_test_fragment(struct pf_krule **rm, int direction, struct pfi_kkif *kif,
3964 struct mbuf *m, void *h, struct pf_pdesc *pd, struct pf_krule **am,
3965 struct pf_kruleset **rsm)
3967 struct pf_krule *r, *a = NULL;
3968 struct pf_kruleset *ruleset = NULL;
3969 sa_family_t af = pd->af;
3974 struct pf_kanchor_stackframe anchor_stack[PF_ANCHOR_STACKSIZE];
3978 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
3980 counter_u64_add(r->evaluations, 1);
3981 if (pfi_kkif_match(r->kif, kif) == r->ifnot)
3982 r = r->skip[PF_SKIP_IFP].ptr;
3983 else if (r->direction && r->direction != direction)
3984 r = r->skip[PF_SKIP_DIR].ptr;
3985 else if (r->af && r->af != af)
3986 r = r->skip[PF_SKIP_AF].ptr;
3987 else if (r->proto && r->proto != pd->proto)
3988 r = r->skip[PF_SKIP_PROTO].ptr;
3989 else if (PF_MISMATCHAW(&r->src.addr, pd->src, af,
3990 r->src.neg, kif, M_GETFIB(m)))
3991 r = r->skip[PF_SKIP_SRC_ADDR].ptr;
3992 else if (PF_MISMATCHAW(&r->dst.addr, pd->dst, af,
3993 r->dst.neg, NULL, M_GETFIB(m)))
3994 r = r->skip[PF_SKIP_DST_ADDR].ptr;
3995 else if (r->tos && !(r->tos == pd->tos))
3996 r = TAILQ_NEXT(r, entries);
3997 else if (r->os_fingerprint != PF_OSFP_ANY)
3998 r = TAILQ_NEXT(r, entries);
3999 else if (pd->proto == IPPROTO_UDP &&
4000 (r->src.port_op || r->dst.port_op))
4001 r = TAILQ_NEXT(r, entries);
4002 else if (pd->proto == IPPROTO_TCP &&
4003 (r->src.port_op || r->dst.port_op || r->flagset))
4004 r = TAILQ_NEXT(r, entries);
4005 else if ((pd->proto == IPPROTO_ICMP ||
4006 pd->proto == IPPROTO_ICMPV6) &&
4007 (r->type || r->code))
4008 r = TAILQ_NEXT(r, entries);
4010 !pf_match_ieee8021q_pcp(r->prio, m))
4011 r = TAILQ_NEXT(r, entries);
4012 else if (r->prob && r->prob <=
4013 (arc4random() % (UINT_MAX - 1) + 1))
4014 r = TAILQ_NEXT(r, entries);
4015 else if (r->match_tag && !pf_match_tag(m, r, &tag,
4016 pd->pf_mtag ? pd->pf_mtag->tag : 0))
4017 r = TAILQ_NEXT(r, entries);
4019 if (r->anchor == NULL) {
4026 r = TAILQ_NEXT(r, entries);
4028 pf_step_into_anchor(anchor_stack, &asd,
4029 &ruleset, PF_RULESET_FILTER, &r, &a,
4032 if (r == NULL && pf_step_out_of_anchor(anchor_stack, &asd,
4033 &ruleset, PF_RULESET_FILTER, &r, &a, &match))
4040 REASON_SET(&reason, PFRES_MATCH);
4043 PFLOG_PACKET(kif, m, af, direction, reason, r, a, ruleset, pd,
4046 if (r->action != PF_PASS)
4049 if (tag > 0 && pf_tag_packet(m, pd, tag)) {
4050 REASON_SET(&reason, PFRES_MEMORY);
4058 pf_tcp_track_full(struct pf_state_peer *src, struct pf_state_peer *dst,
4059 struct pf_state **state, struct pfi_kkif *kif, struct mbuf *m, int off,
4060 struct pf_pdesc *pd, u_short *reason, int *copyback)
4062 struct tcphdr *th = pd->hdr.tcp;
4063 u_int16_t win = ntohs(th->th_win);
4064 u_int32_t ack, end, seq, orig_seq;
4068 if (src->wscale && dst->wscale && !(th->th_flags & TH_SYN)) {
4069 sws = src->wscale & PF_WSCALE_MASK;
4070 dws = dst->wscale & PF_WSCALE_MASK;
4075 * Sequence tracking algorithm from Guido van Rooij's paper:
4076 * http://www.madison-gurkha.com/publications/tcp_filtering/
4080 orig_seq = seq = ntohl(th->th_seq);
4081 if (src->seqlo == 0) {
4082 /* First packet from this end. Set its state */
4084 if ((pd->flags & PFDESC_TCP_NORM || dst->scrub) &&
4085 src->scrub == NULL) {
4086 if (pf_normalize_tcp_init(m, off, pd, th, src, dst)) {
4087 REASON_SET(reason, PFRES_MEMORY);
4092 /* Deferred generation of sequence number modulator */
4093 if (dst->seqdiff && !src->seqdiff) {
4094 /* use random iss for the TCP server */
4095 while ((src->seqdiff = arc4random() - seq) == 0)
4097 ack = ntohl(th->th_ack) - dst->seqdiff;
4098 pf_change_proto_a(m, &th->th_seq, &th->th_sum, htonl(seq +
4100 pf_change_proto_a(m, &th->th_ack, &th->th_sum, htonl(ack), 0);
4103 ack = ntohl(th->th_ack);
4106 end = seq + pd->p_len;
4107 if (th->th_flags & TH_SYN) {
4109 if (dst->wscale & PF_WSCALE_FLAG) {
4110 src->wscale = pf_get_wscale(m, off, th->th_off,
4112 if (src->wscale & PF_WSCALE_FLAG) {
4113 /* Remove scale factor from initial
4115 sws = src->wscale & PF_WSCALE_MASK;
4116 win = ((u_int32_t)win + (1 << sws) - 1)
4118 dws = dst->wscale & PF_WSCALE_MASK;
4120 /* fixup other window */
4121 dst->max_win <<= dst->wscale &
4123 /* in case of a retrans SYN|ACK */
4128 if (th->th_flags & TH_FIN)
4132 if (src->state < TCPS_SYN_SENT)
4133 src->state = TCPS_SYN_SENT;
4136 * May need to slide the window (seqhi may have been set by
4137 * the crappy stack check or if we picked up the connection
4138 * after establishment)
4140 if (src->seqhi == 1 ||
4141 SEQ_GEQ(end + MAX(1, dst->max_win << dws), src->seqhi))
4142 src->seqhi = end + MAX(1, dst->max_win << dws);
4143 if (win > src->max_win)
4147 ack = ntohl(th->th_ack) - dst->seqdiff;
4149 /* Modulate sequence numbers */
4150 pf_change_proto_a(m, &th->th_seq, &th->th_sum, htonl(seq +
4152 pf_change_proto_a(m, &th->th_ack, &th->th_sum, htonl(ack), 0);
4155 end = seq + pd->p_len;
4156 if (th->th_flags & TH_SYN)
4158 if (th->th_flags & TH_FIN)
4162 if ((th->th_flags & TH_ACK) == 0) {
4163 /* Let it pass through the ack skew check */
4165 } else if ((ack == 0 &&
4166 (th->th_flags & (TH_ACK|TH_RST)) == (TH_ACK|TH_RST)) ||
4167 /* broken tcp stacks do not set ack */
4168 (dst->state < TCPS_SYN_SENT)) {
4170 * Many stacks (ours included) will set the ACK number in an
4171 * FIN|ACK if the SYN times out -- no sequence to ACK.
4177 /* Ease sequencing restrictions on no data packets */
4182 ackskew = dst->seqlo - ack;
4185 * Need to demodulate the sequence numbers in any TCP SACK options
4186 * (Selective ACK). We could optionally validate the SACK values
4187 * against the current ACK window, either forwards or backwards, but
4188 * I'm not confident that SACK has been implemented properly
4189 * everywhere. It wouldn't surprise me if several stacks accidentally
4190 * SACK too far backwards of previously ACKed data. There really aren't
4191 * any security implications of bad SACKing unless the target stack
4192 * doesn't validate the option length correctly. Someone trying to
4193 * spoof into a TCP connection won't bother blindly sending SACK
4196 if (dst->seqdiff && (th->th_off << 2) > sizeof(struct tcphdr)) {
4197 if (pf_modulate_sack(m, off, pd, th, dst))
4201 #define MAXACKWINDOW (0xffff + 1500) /* 1500 is an arbitrary fudge factor */
4202 if (SEQ_GEQ(src->seqhi, end) &&
4203 /* Last octet inside other's window space */
4204 SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws)) &&
4205 /* Retrans: not more than one window back */
4206 (ackskew >= -MAXACKWINDOW) &&
4207 /* Acking not more than one reassembled fragment backwards */
4208 (ackskew <= (MAXACKWINDOW << sws)) &&
4209 /* Acking not more than one window forward */
4210 ((th->th_flags & TH_RST) == 0 || orig_seq == src->seqlo ||
4211 (orig_seq == src->seqlo + 1) || (orig_seq + 1 == src->seqlo) ||
4212 (pd->flags & PFDESC_IP_REAS) == 0)) {
4213 /* Require an exact/+1 sequence match on resets when possible */
4215 if (dst->scrub || src->scrub) {
4216 if (pf_normalize_tcp_stateful(m, off, pd, reason, th,
4217 *state, src, dst, copyback))
4221 /* update max window */
4222 if (src->max_win < win)
4224 /* synchronize sequencing */
4225 if (SEQ_GT(end, src->seqlo))
4227 /* slide the window of what the other end can send */
4228 if (SEQ_GEQ(ack + (win << sws), dst->seqhi))
4229 dst->seqhi = ack + MAX((win << sws), 1);
4232 if (th->th_flags & TH_SYN)
4233 if (src->state < TCPS_SYN_SENT)
4234 src->state = TCPS_SYN_SENT;
4235 if (th->th_flags & TH_FIN)
4236 if (src->state < TCPS_CLOSING)
4237 src->state = TCPS_CLOSING;
4238 if (th->th_flags & TH_ACK) {
4239 if (dst->state == TCPS_SYN_SENT) {
4240 dst->state = TCPS_ESTABLISHED;
4241 if (src->state == TCPS_ESTABLISHED &&
4242 (*state)->src_node != NULL &&
4243 pf_src_connlimit(state)) {
4244 REASON_SET(reason, PFRES_SRCLIMIT);
4247 } else if (dst->state == TCPS_CLOSING)
4248 dst->state = TCPS_FIN_WAIT_2;
4250 if (th->th_flags & TH_RST)
4251 src->state = dst->state = TCPS_TIME_WAIT;
4253 /* update expire time */
4254 (*state)->expire = time_uptime;
4255 if (src->state >= TCPS_FIN_WAIT_2 &&
4256 dst->state >= TCPS_FIN_WAIT_2)
4257 (*state)->timeout = PFTM_TCP_CLOSED;
4258 else if (src->state >= TCPS_CLOSING &&
4259 dst->state >= TCPS_CLOSING)
4260 (*state)->timeout = PFTM_TCP_FIN_WAIT;
4261 else if (src->state < TCPS_ESTABLISHED ||
4262 dst->state < TCPS_ESTABLISHED)
4263 (*state)->timeout = PFTM_TCP_OPENING;
4264 else if (src->state >= TCPS_CLOSING ||
4265 dst->state >= TCPS_CLOSING)
4266 (*state)->timeout = PFTM_TCP_CLOSING;
4268 (*state)->timeout = PFTM_TCP_ESTABLISHED;
4270 /* Fall through to PASS packet */
4272 } else if ((dst->state < TCPS_SYN_SENT ||
4273 dst->state >= TCPS_FIN_WAIT_2 ||
4274 src->state >= TCPS_FIN_WAIT_2) &&
4275 SEQ_GEQ(src->seqhi + MAXACKWINDOW, end) &&
4276 /* Within a window forward of the originating packet */
4277 SEQ_GEQ(seq, src->seqlo - MAXACKWINDOW)) {
4278 /* Within a window backward of the originating packet */
4281 * This currently handles three situations:
4282 * 1) Stupid stacks will shotgun SYNs before their peer
4284 * 2) When PF catches an already established stream (the
4285 * firewall rebooted, the state table was flushed, routes
4287 * 3) Packets get funky immediately after the connection
4288 * closes (this should catch Solaris spurious ACK|FINs
4289 * that web servers like to spew after a close)
4291 * This must be a little more careful than the above code
4292 * since packet floods will also be caught here. We don't
4293 * update the TTL here to mitigate the damage of a packet
4294 * flood and so the same code can handle awkward establishment
4295 * and a loosened connection close.
4296 * In the establishment case, a correct peer response will
4297 * validate the connection, go through the normal state code
4298 * and keep updating the state TTL.
4301 if (V_pf_status.debug >= PF_DEBUG_MISC) {
4302 printf("pf: loose state match: ");
4303 pf_print_state(*state);
4304 pf_print_flags(th->th_flags);
4305 printf(" seq=%u (%u) ack=%u len=%u ackskew=%d "
4306 "pkts=%llu:%llu dir=%s,%s\n", seq, orig_seq, ack,
4308 (unsigned long long)counter_u64_fetch((*state)->packets[0]),
4309 (unsigned long long)counter_u64_fetch((*state)->packets[1]),
4310 pd->dir == PF_IN ? "in" : "out",
4311 pd->dir == (*state)->direction ? "fwd" : "rev");
4314 if (dst->scrub || src->scrub) {
4315 if (pf_normalize_tcp_stateful(m, off, pd, reason, th,
4316 *state, src, dst, copyback))
4320 /* update max window */
4321 if (src->max_win < win)
4323 /* synchronize sequencing */
4324 if (SEQ_GT(end, src->seqlo))
4326 /* slide the window of what the other end can send */
4327 if (SEQ_GEQ(ack + (win << sws), dst->seqhi))
4328 dst->seqhi = ack + MAX((win << sws), 1);
4331 * Cannot set dst->seqhi here since this could be a shotgunned
4332 * SYN and not an already established connection.
4335 if (th->th_flags & TH_FIN)
4336 if (src->state < TCPS_CLOSING)
4337 src->state = TCPS_CLOSING;
4338 if (th->th_flags & TH_RST)
4339 src->state = dst->state = TCPS_TIME_WAIT;
4341 /* Fall through to PASS packet */
4344 if ((*state)->dst.state == TCPS_SYN_SENT &&
4345 (*state)->src.state == TCPS_SYN_SENT) {
4346 /* Send RST for state mismatches during handshake */
4347 if (!(th->th_flags & TH_RST))
4348 pf_send_tcp(NULL, (*state)->rule.ptr, pd->af,
4349 pd->dst, pd->src, th->th_dport,
4350 th->th_sport, ntohl(th->th_ack), 0,
4352 (*state)->rule.ptr->return_ttl, 1, 0,
4357 } else if (V_pf_status.debug >= PF_DEBUG_MISC) {
4358 printf("pf: BAD state: ");
4359 pf_print_state(*state);
4360 pf_print_flags(th->th_flags);
4361 printf(" seq=%u (%u) ack=%u len=%u ackskew=%d "
4362 "pkts=%llu:%llu dir=%s,%s\n",
4363 seq, orig_seq, ack, pd->p_len, ackskew,
4364 (unsigned long long)counter_u64_fetch((*state)->packets[0]),
4365 (unsigned long long)counter_u64_fetch((*state)->packets[1]),
4366 pd->dir == PF_IN ? "in" : "out",
4367 pd->dir == (*state)->direction ? "fwd" : "rev");
4368 printf("pf: State failure on: %c %c %c %c | %c %c\n",
4369 SEQ_GEQ(src->seqhi, end) ? ' ' : '1',
4370 SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws)) ?
4372 (ackskew >= -MAXACKWINDOW) ? ' ' : '3',
4373 (ackskew <= (MAXACKWINDOW << sws)) ? ' ' : '4',
4374 SEQ_GEQ(src->seqhi + MAXACKWINDOW, end) ?' ' :'5',
4375 SEQ_GEQ(seq, src->seqlo - MAXACKWINDOW) ?' ' :'6');
4377 REASON_SET(reason, PFRES_BADSTATE);
4385 pf_tcp_track_sloppy(struct pf_state_peer *src, struct pf_state_peer *dst,
4386 struct pf_state **state, struct pf_pdesc *pd, u_short *reason)
4388 struct tcphdr *th = pd->hdr.tcp;
4390 if (th->th_flags & TH_SYN)
4391 if (src->state < TCPS_SYN_SENT)
4392 src->state = TCPS_SYN_SENT;
4393 if (th->th_flags & TH_FIN)
4394 if (src->state < TCPS_CLOSING)
4395 src->state = TCPS_CLOSING;
4396 if (th->th_flags & TH_ACK) {
4397 if (dst->state == TCPS_SYN_SENT) {
4398 dst->state = TCPS_ESTABLISHED;
4399 if (src->state == TCPS_ESTABLISHED &&
4400 (*state)->src_node != NULL &&
4401 pf_src_connlimit(state)) {
4402 REASON_SET(reason, PFRES_SRCLIMIT);
4405 } else if (dst->state == TCPS_CLOSING) {
4406 dst->state = TCPS_FIN_WAIT_2;
4407 } else if (src->state == TCPS_SYN_SENT &&
4408 dst->state < TCPS_SYN_SENT) {
4410 * Handle a special sloppy case where we only see one
4411 * half of the connection. If there is a ACK after
4412 * the initial SYN without ever seeing a packet from
4413 * the destination, set the connection to established.
4415 dst->state = src->state = TCPS_ESTABLISHED;
4416 if ((*state)->src_node != NULL &&
4417 pf_src_connlimit(state)) {
4418 REASON_SET(reason, PFRES_SRCLIMIT);
4421 } else if (src->state == TCPS_CLOSING &&
4422 dst->state == TCPS_ESTABLISHED &&
4425 * Handle the closing of half connections where we
4426 * don't see the full bidirectional FIN/ACK+ACK
4429 dst->state = TCPS_CLOSING;
4432 if (th->th_flags & TH_RST)
4433 src->state = dst->state = TCPS_TIME_WAIT;
4435 /* update expire time */
4436 (*state)->expire = time_uptime;
4437 if (src->state >= TCPS_FIN_WAIT_2 &&
4438 dst->state >= TCPS_FIN_WAIT_2)
4439 (*state)->timeout = PFTM_TCP_CLOSED;
4440 else if (src->state >= TCPS_CLOSING &&
4441 dst->state >= TCPS_CLOSING)
4442 (*state)->timeout = PFTM_TCP_FIN_WAIT;
4443 else if (src->state < TCPS_ESTABLISHED ||
4444 dst->state < TCPS_ESTABLISHED)
4445 (*state)->timeout = PFTM_TCP_OPENING;
4446 else if (src->state >= TCPS_CLOSING ||
4447 dst->state >= TCPS_CLOSING)
4448 (*state)->timeout = PFTM_TCP_CLOSING;
4450 (*state)->timeout = PFTM_TCP_ESTABLISHED;
4456 pf_test_state_tcp(struct pf_state **state, int direction, struct pfi_kkif *kif,
4457 struct mbuf *m, int off, void *h, struct pf_pdesc *pd,
4460 struct pf_state_key_cmp key;
4461 struct tcphdr *th = pd->hdr.tcp;
4463 struct pf_state_peer *src, *dst;
4464 struct pf_state_key *sk;
4466 bzero(&key, sizeof(key));
4468 key.proto = IPPROTO_TCP;
4469 if (direction == PF_IN) { /* wire side, straight */
4470 PF_ACPY(&key.addr[0], pd->src, key.af);
4471 PF_ACPY(&key.addr[1], pd->dst, key.af);
4472 key.port[0] = th->th_sport;
4473 key.port[1] = th->th_dport;
4474 } else { /* stack side, reverse */
4475 PF_ACPY(&key.addr[1], pd->src, key.af);
4476 PF_ACPY(&key.addr[0], pd->dst, key.af);
4477 key.port[1] = th->th_sport;
4478 key.port[0] = th->th_dport;
4481 STATE_LOOKUP(kif, &key, direction, *state, pd);
4483 if (direction == (*state)->direction) {
4484 src = &(*state)->src;
4485 dst = &(*state)->dst;
4487 src = &(*state)->dst;
4488 dst = &(*state)->src;
4491 sk = (*state)->key[pd->didx];
4493 if ((*state)->src.state == PF_TCPS_PROXY_SRC) {
4494 if (direction != (*state)->direction) {
4495 REASON_SET(reason, PFRES_SYNPROXY);
4496 return (PF_SYNPROXY_DROP);
4498 if (th->th_flags & TH_SYN) {
4499 if (ntohl(th->th_seq) != (*state)->src.seqlo) {
4500 REASON_SET(reason, PFRES_SYNPROXY);
4503 pf_send_tcp(NULL, (*state)->rule.ptr, pd->af, pd->dst,
4504 pd->src, th->th_dport, th->th_sport,
4505 (*state)->src.seqhi, ntohl(th->th_seq) + 1,
4506 TH_SYN|TH_ACK, 0, (*state)->src.mss, 0, 1, 0, NULL);
4507 REASON_SET(reason, PFRES_SYNPROXY);
4508 return (PF_SYNPROXY_DROP);
4509 } else if ((th->th_flags & (TH_ACK|TH_RST|TH_FIN)) != TH_ACK ||
4510 (ntohl(th->th_ack) != (*state)->src.seqhi + 1) ||
4511 (ntohl(th->th_seq) != (*state)->src.seqlo + 1)) {
4512 REASON_SET(reason, PFRES_SYNPROXY);
4514 } else if ((*state)->src_node != NULL &&
4515 pf_src_connlimit(state)) {
4516 REASON_SET(reason, PFRES_SRCLIMIT);
4519 (*state)->src.state = PF_TCPS_PROXY_DST;
4521 if ((*state)->src.state == PF_TCPS_PROXY_DST) {
4522 if (direction == (*state)->direction) {
4523 if (((th->th_flags & (TH_SYN|TH_ACK)) != TH_ACK) ||
4524 (ntohl(th->th_ack) != (*state)->src.seqhi + 1) ||
4525 (ntohl(th->th_seq) != (*state)->src.seqlo + 1)) {
4526 REASON_SET(reason, PFRES_SYNPROXY);
4529 (*state)->src.max_win = MAX(ntohs(th->th_win), 1);
4530 if ((*state)->dst.seqhi == 1)
4531 (*state)->dst.seqhi = htonl(arc4random());
4532 pf_send_tcp(NULL, (*state)->rule.ptr, pd->af,
4533 &sk->addr[pd->sidx], &sk->addr[pd->didx],
4534 sk->port[pd->sidx], sk->port[pd->didx],
4535 (*state)->dst.seqhi, 0, TH_SYN, 0,
4536 (*state)->src.mss, 0, 0, (*state)->tag, NULL);
4537 REASON_SET(reason, PFRES_SYNPROXY);
4538 return (PF_SYNPROXY_DROP);
4539 } else if (((th->th_flags & (TH_SYN|TH_ACK)) !=
4541 (ntohl(th->th_ack) != (*state)->dst.seqhi + 1)) {
4542 REASON_SET(reason, PFRES_SYNPROXY);
4545 (*state)->dst.max_win = MAX(ntohs(th->th_win), 1);
4546 (*state)->dst.seqlo = ntohl(th->th_seq);
4547 pf_send_tcp(NULL, (*state)->rule.ptr, pd->af, pd->dst,
4548 pd->src, th->th_dport, th->th_sport,
4549 ntohl(th->th_ack), ntohl(th->th_seq) + 1,
4550 TH_ACK, (*state)->src.max_win, 0, 0, 0,
4551 (*state)->tag, NULL);
4552 pf_send_tcp(NULL, (*state)->rule.ptr, pd->af,
4553 &sk->addr[pd->sidx], &sk->addr[pd->didx],
4554 sk->port[pd->sidx], sk->port[pd->didx],
4555 (*state)->src.seqhi + 1, (*state)->src.seqlo + 1,
4556 TH_ACK, (*state)->dst.max_win, 0, 0, 1, 0, NULL);
4557 (*state)->src.seqdiff = (*state)->dst.seqhi -
4558 (*state)->src.seqlo;
4559 (*state)->dst.seqdiff = (*state)->src.seqhi -
4560 (*state)->dst.seqlo;
4561 (*state)->src.seqhi = (*state)->src.seqlo +
4562 (*state)->dst.max_win;
4563 (*state)->dst.seqhi = (*state)->dst.seqlo +
4564 (*state)->src.max_win;
4565 (*state)->src.wscale = (*state)->dst.wscale = 0;
4566 (*state)->src.state = (*state)->dst.state =
4568 REASON_SET(reason, PFRES_SYNPROXY);
4569 return (PF_SYNPROXY_DROP);
4573 if (((th->th_flags & (TH_SYN|TH_ACK)) == TH_SYN) &&
4574 dst->state >= TCPS_FIN_WAIT_2 &&
4575 src->state >= TCPS_FIN_WAIT_2) {
4576 if (V_pf_status.debug >= PF_DEBUG_MISC) {
4577 printf("pf: state reuse ");
4578 pf_print_state(*state);
4579 pf_print_flags(th->th_flags);
4582 /* XXX make sure it's the same direction ?? */
4583 (*state)->src.state = (*state)->dst.state = TCPS_CLOSED;
4584 pf_unlink_state(*state, PF_ENTER_LOCKED);
4589 if ((*state)->state_flags & PFSTATE_SLOPPY) {
4590 if (pf_tcp_track_sloppy(src, dst, state, pd, reason) == PF_DROP)
4593 if (pf_tcp_track_full(src, dst, state, kif, m, off, pd, reason,
4594 ©back) == PF_DROP)
4598 /* translate source/destination address, if necessary */
4599 if ((*state)->key[PF_SK_WIRE] != (*state)->key[PF_SK_STACK]) {
4600 struct pf_state_key *nk = (*state)->key[pd->didx];
4602 if (PF_ANEQ(pd->src, &nk->addr[pd->sidx], pd->af) ||
4603 nk->port[pd->sidx] != th->th_sport)
4604 pf_change_ap(m, pd->src, &th->th_sport,
4605 pd->ip_sum, &th->th_sum, &nk->addr[pd->sidx],
4606 nk->port[pd->sidx], 0, pd->af);
4608 if (PF_ANEQ(pd->dst, &nk->addr[pd->didx], pd->af) ||
4609 nk->port[pd->didx] != th->th_dport)
4610 pf_change_ap(m, pd->dst, &th->th_dport,
4611 pd->ip_sum, &th->th_sum, &nk->addr[pd->didx],
4612 nk->port[pd->didx], 0, pd->af);
4616 /* Copyback sequence modulation or stateful scrub changes if needed */
4618 m_copyback(m, off, sizeof(*th), (caddr_t)th);
4624 pf_test_state_udp(struct pf_state **state, int direction, struct pfi_kkif *kif,
4625 struct mbuf *m, int off, void *h, struct pf_pdesc *pd)
4627 struct pf_state_peer *src, *dst;
4628 struct pf_state_key_cmp key;
4629 struct udphdr *uh = pd->hdr.udp;
4631 bzero(&key, sizeof(key));
4633 key.proto = IPPROTO_UDP;
4634 if (direction == PF_IN) { /* wire side, straight */
4635 PF_ACPY(&key.addr[0], pd->src, key.af);
4636 PF_ACPY(&key.addr[1], pd->dst, key.af);
4637 key.port[0] = uh->uh_sport;
4638 key.port[1] = uh->uh_dport;
4639 } else { /* stack side, reverse */
4640 PF_ACPY(&key.addr[1], pd->src, key.af);
4641 PF_ACPY(&key.addr[0], pd->dst, key.af);
4642 key.port[1] = uh->uh_sport;
4643 key.port[0] = uh->uh_dport;
4646 STATE_LOOKUP(kif, &key, direction, *state, pd);
4648 if (direction == (*state)->direction) {
4649 src = &(*state)->src;
4650 dst = &(*state)->dst;
4652 src = &(*state)->dst;
4653 dst = &(*state)->src;
4657 if (src->state < PFUDPS_SINGLE)
4658 src->state = PFUDPS_SINGLE;
4659 if (dst->state == PFUDPS_SINGLE)
4660 dst->state = PFUDPS_MULTIPLE;
4662 /* update expire time */
4663 (*state)->expire = time_uptime;
4664 if (src->state == PFUDPS_MULTIPLE && dst->state == PFUDPS_MULTIPLE)
4665 (*state)->timeout = PFTM_UDP_MULTIPLE;
4667 (*state)->timeout = PFTM_UDP_SINGLE;
4669 /* translate source/destination address, if necessary */
4670 if ((*state)->key[PF_SK_WIRE] != (*state)->key[PF_SK_STACK]) {
4671 struct pf_state_key *nk = (*state)->key[pd->didx];
4673 if (PF_ANEQ(pd->src, &nk->addr[pd->sidx], pd->af) ||
4674 nk->port[pd->sidx] != uh->uh_sport)
4675 pf_change_ap(m, pd->src, &uh->uh_sport, pd->ip_sum,
4676 &uh->uh_sum, &nk->addr[pd->sidx],
4677 nk->port[pd->sidx], 1, pd->af);
4679 if (PF_ANEQ(pd->dst, &nk->addr[pd->didx], pd->af) ||
4680 nk->port[pd->didx] != uh->uh_dport)
4681 pf_change_ap(m, pd->dst, &uh->uh_dport, pd->ip_sum,
4682 &uh->uh_sum, &nk->addr[pd->didx],
4683 nk->port[pd->didx], 1, pd->af);
4684 m_copyback(m, off, sizeof(*uh), (caddr_t)uh);
4691 pf_test_state_icmp(struct pf_state **state, int direction, struct pfi_kkif *kif,
4692 struct mbuf *m, int off, void *h, struct pf_pdesc *pd, u_short *reason)
4694 struct pf_addr *saddr = pd->src, *daddr = pd->dst;
4695 u_int16_t icmpid = 0, *icmpsum;
4696 u_int8_t icmptype, icmpcode;
4698 struct pf_state_key_cmp key;
4700 bzero(&key, sizeof(key));
4701 switch (pd->proto) {
4704 icmptype = pd->hdr.icmp->icmp_type;
4705 icmpcode = pd->hdr.icmp->icmp_code;
4706 icmpid = pd->hdr.icmp->icmp_id;
4707 icmpsum = &pd->hdr.icmp->icmp_cksum;
4709 if (icmptype == ICMP_UNREACH ||
4710 icmptype == ICMP_SOURCEQUENCH ||
4711 icmptype == ICMP_REDIRECT ||
4712 icmptype == ICMP_TIMXCEED ||
4713 icmptype == ICMP_PARAMPROB)
4718 case IPPROTO_ICMPV6:
4719 icmptype = pd->hdr.icmp6->icmp6_type;
4720 icmpcode = pd->hdr.icmp6->icmp6_code;
4721 icmpid = pd->hdr.icmp6->icmp6_id;
4722 icmpsum = &pd->hdr.icmp6->icmp6_cksum;
4724 if (icmptype == ICMP6_DST_UNREACH ||
4725 icmptype == ICMP6_PACKET_TOO_BIG ||
4726 icmptype == ICMP6_TIME_EXCEEDED ||
4727 icmptype == ICMP6_PARAM_PROB)
4735 * ICMP query/reply message not related to a TCP/UDP packet.
4736 * Search for an ICMP state.
4739 key.proto = pd->proto;
4740 key.port[0] = key.port[1] = icmpid;
4741 if (direction == PF_IN) { /* wire side, straight */
4742 PF_ACPY(&key.addr[0], pd->src, key.af);
4743 PF_ACPY(&key.addr[1], pd->dst, key.af);
4744 } else { /* stack side, reverse */
4745 PF_ACPY(&key.addr[1], pd->src, key.af);
4746 PF_ACPY(&key.addr[0], pd->dst, key.af);
4749 STATE_LOOKUP(kif, &key, direction, *state, pd);
4751 (*state)->expire = time_uptime;
4752 (*state)->timeout = PFTM_ICMP_ERROR_REPLY;
4754 /* translate source/destination address, if necessary */
4755 if ((*state)->key[PF_SK_WIRE] != (*state)->key[PF_SK_STACK]) {
4756 struct pf_state_key *nk = (*state)->key[pd->didx];
4761 if (PF_ANEQ(pd->src,
4762 &nk->addr[pd->sidx], AF_INET))
4763 pf_change_a(&saddr->v4.s_addr,
4765 nk->addr[pd->sidx].v4.s_addr, 0);
4767 if (PF_ANEQ(pd->dst, &nk->addr[pd->didx],
4769 pf_change_a(&daddr->v4.s_addr,
4771 nk->addr[pd->didx].v4.s_addr, 0);
4774 pd->hdr.icmp->icmp_id) {
4775 pd->hdr.icmp->icmp_cksum =
4777 pd->hdr.icmp->icmp_cksum, icmpid,
4778 nk->port[pd->sidx], 0);
4779 pd->hdr.icmp->icmp_id =
4783 m_copyback(m, off, ICMP_MINLEN,
4784 (caddr_t )pd->hdr.icmp);
4789 if (PF_ANEQ(pd->src,
4790 &nk->addr[pd->sidx], AF_INET6))
4792 &pd->hdr.icmp6->icmp6_cksum,
4793 &nk->addr[pd->sidx], 0);
4795 if (PF_ANEQ(pd->dst,
4796 &nk->addr[pd->didx], AF_INET6))
4798 &pd->hdr.icmp6->icmp6_cksum,
4799 &nk->addr[pd->didx], 0);
4801 m_copyback(m, off, sizeof(struct icmp6_hdr),
4802 (caddr_t )pd->hdr.icmp6);
4811 * ICMP error message in response to a TCP/UDP packet.
4812 * Extract the inner TCP/UDP header and search for that state.
4815 struct pf_pdesc pd2;
4816 bzero(&pd2, sizeof pd2);
4821 struct ip6_hdr h2_6;
4828 /* Payload packet is from the opposite direction. */
4829 pd2.sidx = (direction == PF_IN) ? 1 : 0;
4830 pd2.didx = (direction == PF_IN) ? 0 : 1;
4834 /* offset of h2 in mbuf chain */
4835 ipoff2 = off + ICMP_MINLEN;
4837 if (!pf_pull_hdr(m, ipoff2, &h2, sizeof(h2),
4838 NULL, reason, pd2.af)) {
4839 DPFPRINTF(PF_DEBUG_MISC,
4840 ("pf: ICMP error message too short "
4845 * ICMP error messages don't refer to non-first
4848 if (h2.ip_off & htons(IP_OFFMASK)) {
4849 REASON_SET(reason, PFRES_FRAG);
4853 /* offset of protocol header that follows h2 */
4854 off2 = ipoff2 + (h2.ip_hl << 2);
4856 pd2.proto = h2.ip_p;
4857 pd2.src = (struct pf_addr *)&h2.ip_src;
4858 pd2.dst = (struct pf_addr *)&h2.ip_dst;
4859 pd2.ip_sum = &h2.ip_sum;
4864 ipoff2 = off + sizeof(struct icmp6_hdr);
4866 if (!pf_pull_hdr(m, ipoff2, &h2_6, sizeof(h2_6),
4867 NULL, reason, pd2.af)) {
4868 DPFPRINTF(PF_DEBUG_MISC,
4869 ("pf: ICMP error message too short "
4873 pd2.proto = h2_6.ip6_nxt;
4874 pd2.src = (struct pf_addr *)&h2_6.ip6_src;
4875 pd2.dst = (struct pf_addr *)&h2_6.ip6_dst;
4877 off2 = ipoff2 + sizeof(h2_6);
4879 switch (pd2.proto) {
4880 case IPPROTO_FRAGMENT:
4882 * ICMPv6 error messages for
4883 * non-first fragments
4885 REASON_SET(reason, PFRES_FRAG);
4888 case IPPROTO_HOPOPTS:
4889 case IPPROTO_ROUTING:
4890 case IPPROTO_DSTOPTS: {
4891 /* get next header and header length */
4892 struct ip6_ext opt6;
4894 if (!pf_pull_hdr(m, off2, &opt6,
4895 sizeof(opt6), NULL, reason,
4897 DPFPRINTF(PF_DEBUG_MISC,
4898 ("pf: ICMPv6 short opt\n"));
4901 if (pd2.proto == IPPROTO_AH)
4902 off2 += (opt6.ip6e_len + 2) * 4;
4904 off2 += (opt6.ip6e_len + 1) * 8;
4905 pd2.proto = opt6.ip6e_nxt;
4906 /* goto the next header */
4913 } while (!terminal);
4918 if (PF_ANEQ(pd->dst, pd2.src, pd->af)) {
4919 if (V_pf_status.debug >= PF_DEBUG_MISC) {
4920 printf("pf: BAD ICMP %d:%d outer dst: ",
4921 icmptype, icmpcode);
4922 pf_print_host(pd->src, 0, pd->af);
4924 pf_print_host(pd->dst, 0, pd->af);
4925 printf(" inner src: ");
4926 pf_print_host(pd2.src, 0, pd2.af);
4928 pf_print_host(pd2.dst, 0, pd2.af);
4931 REASON_SET(reason, PFRES_BADSTATE);
4935 switch (pd2.proto) {
4939 struct pf_state_peer *src, *dst;
4944 * Only the first 8 bytes of the TCP header can be
4945 * expected. Don't access any TCP header fields after
4946 * th_seq, an ackskew test is not possible.
4948 if (!pf_pull_hdr(m, off2, &th, 8, NULL, reason,
4950 DPFPRINTF(PF_DEBUG_MISC,
4951 ("pf: ICMP error message too short "
4957 key.proto = IPPROTO_TCP;
4958 PF_ACPY(&key.addr[pd2.sidx], pd2.src, key.af);
4959 PF_ACPY(&key.addr[pd2.didx], pd2.dst, key.af);
4960 key.port[pd2.sidx] = th.th_sport;
4961 key.port[pd2.didx] = th.th_dport;
4963 STATE_LOOKUP(kif, &key, direction, *state, pd);
4965 if (direction == (*state)->direction) {
4966 src = &(*state)->dst;
4967 dst = &(*state)->src;
4969 src = &(*state)->src;
4970 dst = &(*state)->dst;
4973 if (src->wscale && dst->wscale)
4974 dws = dst->wscale & PF_WSCALE_MASK;
4978 /* Demodulate sequence number */
4979 seq = ntohl(th.th_seq) - src->seqdiff;
4981 pf_change_a(&th.th_seq, icmpsum,
4986 if (!((*state)->state_flags & PFSTATE_SLOPPY) &&
4987 (!SEQ_GEQ(src->seqhi, seq) ||
4988 !SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws)))) {
4989 if (V_pf_status.debug >= PF_DEBUG_MISC) {
4990 printf("pf: BAD ICMP %d:%d ",
4991 icmptype, icmpcode);
4992 pf_print_host(pd->src, 0, pd->af);
4994 pf_print_host(pd->dst, 0, pd->af);
4996 pf_print_state(*state);
4997 printf(" seq=%u\n", seq);
4999 REASON_SET(reason, PFRES_BADSTATE);
5002 if (V_pf_status.debug >= PF_DEBUG_MISC) {
5003 printf("pf: OK ICMP %d:%d ",
5004 icmptype, icmpcode);
5005 pf_print_host(pd->src, 0, pd->af);
5007 pf_print_host(pd->dst, 0, pd->af);
5009 pf_print_state(*state);
5010 printf(" seq=%u\n", seq);
5014 /* translate source/destination address, if necessary */
5015 if ((*state)->key[PF_SK_WIRE] !=
5016 (*state)->key[PF_SK_STACK]) {
5017 struct pf_state_key *nk =
5018 (*state)->key[pd->didx];
5020 if (PF_ANEQ(pd2.src,
5021 &nk->addr[pd2.sidx], pd2.af) ||
5022 nk->port[pd2.sidx] != th.th_sport)
5023 pf_change_icmp(pd2.src, &th.th_sport,
5024 daddr, &nk->addr[pd2.sidx],
5025 nk->port[pd2.sidx], NULL,
5026 pd2.ip_sum, icmpsum,
5027 pd->ip_sum, 0, pd2.af);
5029 if (PF_ANEQ(pd2.dst,
5030 &nk->addr[pd2.didx], pd2.af) ||
5031 nk->port[pd2.didx] != th.th_dport)
5032 pf_change_icmp(pd2.dst, &th.th_dport,
5033 saddr, &nk->addr[pd2.didx],
5034 nk->port[pd2.didx], NULL,
5035 pd2.ip_sum, icmpsum,
5036 pd->ip_sum, 0, pd2.af);
5044 m_copyback(m, off, ICMP_MINLEN,
5045 (caddr_t )pd->hdr.icmp);
5046 m_copyback(m, ipoff2, sizeof(h2),
5053 sizeof(struct icmp6_hdr),
5054 (caddr_t )pd->hdr.icmp6);
5055 m_copyback(m, ipoff2, sizeof(h2_6),
5060 m_copyback(m, off2, 8, (caddr_t)&th);
5069 if (!pf_pull_hdr(m, off2, &uh, sizeof(uh),
5070 NULL, reason, pd2.af)) {
5071 DPFPRINTF(PF_DEBUG_MISC,
5072 ("pf: ICMP error message too short "
5078 key.proto = IPPROTO_UDP;
5079 PF_ACPY(&key.addr[pd2.sidx], pd2.src, key.af);
5080 PF_ACPY(&key.addr[pd2.didx], pd2.dst, key.af);
5081 key.port[pd2.sidx] = uh.uh_sport;
5082 key.port[pd2.didx] = uh.uh_dport;
5084 STATE_LOOKUP(kif, &key, direction, *state, pd);
5086 /* translate source/destination address, if necessary */
5087 if ((*state)->key[PF_SK_WIRE] !=
5088 (*state)->key[PF_SK_STACK]) {
5089 struct pf_state_key *nk =
5090 (*state)->key[pd->didx];
5092 if (PF_ANEQ(pd2.src,
5093 &nk->addr[pd2.sidx], pd2.af) ||
5094 nk->port[pd2.sidx] != uh.uh_sport)
5095 pf_change_icmp(pd2.src, &uh.uh_sport,
5096 daddr, &nk->addr[pd2.sidx],
5097 nk->port[pd2.sidx], &uh.uh_sum,
5098 pd2.ip_sum, icmpsum,
5099 pd->ip_sum, 1, pd2.af);
5101 if (PF_ANEQ(pd2.dst,
5102 &nk->addr[pd2.didx], pd2.af) ||
5103 nk->port[pd2.didx] != uh.uh_dport)
5104 pf_change_icmp(pd2.dst, &uh.uh_dport,
5105 saddr, &nk->addr[pd2.didx],
5106 nk->port[pd2.didx], &uh.uh_sum,
5107 pd2.ip_sum, icmpsum,
5108 pd->ip_sum, 1, pd2.af);
5113 m_copyback(m, off, ICMP_MINLEN,
5114 (caddr_t )pd->hdr.icmp);
5115 m_copyback(m, ipoff2, sizeof(h2), (caddr_t)&h2);
5121 sizeof(struct icmp6_hdr),
5122 (caddr_t )pd->hdr.icmp6);
5123 m_copyback(m, ipoff2, sizeof(h2_6),
5128 m_copyback(m, off2, sizeof(uh), (caddr_t)&uh);
5134 case IPPROTO_ICMP: {
5137 if (!pf_pull_hdr(m, off2, &iih, ICMP_MINLEN,
5138 NULL, reason, pd2.af)) {
5139 DPFPRINTF(PF_DEBUG_MISC,
5140 ("pf: ICMP error message too short i"
5146 key.proto = IPPROTO_ICMP;
5147 PF_ACPY(&key.addr[pd2.sidx], pd2.src, key.af);
5148 PF_ACPY(&key.addr[pd2.didx], pd2.dst, key.af);
5149 key.port[0] = key.port[1] = iih.icmp_id;
5151 STATE_LOOKUP(kif, &key, direction, *state, pd);
5153 /* translate source/destination address, if necessary */
5154 if ((*state)->key[PF_SK_WIRE] !=
5155 (*state)->key[PF_SK_STACK]) {
5156 struct pf_state_key *nk =
5157 (*state)->key[pd->didx];
5159 if (PF_ANEQ(pd2.src,
5160 &nk->addr[pd2.sidx], pd2.af) ||
5161 nk->port[pd2.sidx] != iih.icmp_id)
5162 pf_change_icmp(pd2.src, &iih.icmp_id,
5163 daddr, &nk->addr[pd2.sidx],
5164 nk->port[pd2.sidx], NULL,
5165 pd2.ip_sum, icmpsum,
5166 pd->ip_sum, 0, AF_INET);
5168 if (PF_ANEQ(pd2.dst,
5169 &nk->addr[pd2.didx], pd2.af) ||
5170 nk->port[pd2.didx] != iih.icmp_id)
5171 pf_change_icmp(pd2.dst, &iih.icmp_id,
5172 saddr, &nk->addr[pd2.didx],
5173 nk->port[pd2.didx], NULL,
5174 pd2.ip_sum, icmpsum,
5175 pd->ip_sum, 0, AF_INET);
5177 m_copyback(m, off, ICMP_MINLEN, (caddr_t)pd->hdr.icmp);
5178 m_copyback(m, ipoff2, sizeof(h2), (caddr_t)&h2);
5179 m_copyback(m, off2, ICMP_MINLEN, (caddr_t)&iih);
5186 case IPPROTO_ICMPV6: {
5187 struct icmp6_hdr iih;
5189 if (!pf_pull_hdr(m, off2, &iih,
5190 sizeof(struct icmp6_hdr), NULL, reason, pd2.af)) {
5191 DPFPRINTF(PF_DEBUG_MISC,
5192 ("pf: ICMP error message too short "
5198 key.proto = IPPROTO_ICMPV6;
5199 PF_ACPY(&key.addr[pd2.sidx], pd2.src, key.af);
5200 PF_ACPY(&key.addr[pd2.didx], pd2.dst, key.af);
5201 key.port[0] = key.port[1] = iih.icmp6_id;
5203 STATE_LOOKUP(kif, &key, direction, *state, pd);
5205 /* translate source/destination address, if necessary */
5206 if ((*state)->key[PF_SK_WIRE] !=
5207 (*state)->key[PF_SK_STACK]) {
5208 struct pf_state_key *nk =
5209 (*state)->key[pd->didx];
5211 if (PF_ANEQ(pd2.src,
5212 &nk->addr[pd2.sidx], pd2.af) ||
5213 nk->port[pd2.sidx] != iih.icmp6_id)
5214 pf_change_icmp(pd2.src, &iih.icmp6_id,
5215 daddr, &nk->addr[pd2.sidx],
5216 nk->port[pd2.sidx], NULL,
5217 pd2.ip_sum, icmpsum,
5218 pd->ip_sum, 0, AF_INET6);
5220 if (PF_ANEQ(pd2.dst,
5221 &nk->addr[pd2.didx], pd2.af) ||
5222 nk->port[pd2.didx] != iih.icmp6_id)
5223 pf_change_icmp(pd2.dst, &iih.icmp6_id,
5224 saddr, &nk->addr[pd2.didx],
5225 nk->port[pd2.didx], NULL,
5226 pd2.ip_sum, icmpsum,
5227 pd->ip_sum, 0, AF_INET6);
5229 m_copyback(m, off, sizeof(struct icmp6_hdr),
5230 (caddr_t)pd->hdr.icmp6);
5231 m_copyback(m, ipoff2, sizeof(h2_6), (caddr_t)&h2_6);
5232 m_copyback(m, off2, sizeof(struct icmp6_hdr),
5241 key.proto = pd2.proto;
5242 PF_ACPY(&key.addr[pd2.sidx], pd2.src, key.af);
5243 PF_ACPY(&key.addr[pd2.didx], pd2.dst, key.af);
5244 key.port[0] = key.port[1] = 0;
5246 STATE_LOOKUP(kif, &key, direction, *state, pd);
5248 /* translate source/destination address, if necessary */
5249 if ((*state)->key[PF_SK_WIRE] !=
5250 (*state)->key[PF_SK_STACK]) {
5251 struct pf_state_key *nk =
5252 (*state)->key[pd->didx];
5254 if (PF_ANEQ(pd2.src,
5255 &nk->addr[pd2.sidx], pd2.af))
5256 pf_change_icmp(pd2.src, NULL, daddr,
5257 &nk->addr[pd2.sidx], 0, NULL,
5258 pd2.ip_sum, icmpsum,
5259 pd->ip_sum, 0, pd2.af);
5261 if (PF_ANEQ(pd2.dst,
5262 &nk->addr[pd2.didx], pd2.af))
5263 pf_change_icmp(pd2.dst, NULL, saddr,
5264 &nk->addr[pd2.didx], 0, NULL,
5265 pd2.ip_sum, icmpsum,
5266 pd->ip_sum, 0, pd2.af);
5271 m_copyback(m, off, ICMP_MINLEN,
5272 (caddr_t)pd->hdr.icmp);
5273 m_copyback(m, ipoff2, sizeof(h2), (caddr_t)&h2);
5279 sizeof(struct icmp6_hdr),
5280 (caddr_t )pd->hdr.icmp6);
5281 m_copyback(m, ipoff2, sizeof(h2_6),
5295 pf_test_state_other(struct pf_state **state, int direction, struct pfi_kkif *kif,
5296 struct mbuf *m, struct pf_pdesc *pd)
5298 struct pf_state_peer *src, *dst;
5299 struct pf_state_key_cmp key;
5301 bzero(&key, sizeof(key));
5303 key.proto = pd->proto;
5304 if (direction == PF_IN) {
5305 PF_ACPY(&key.addr[0], pd->src, key.af);
5306 PF_ACPY(&key.addr[1], pd->dst, key.af);
5307 key.port[0] = key.port[1] = 0;
5309 PF_ACPY(&key.addr[1], pd->src, key.af);
5310 PF_ACPY(&key.addr[0], pd->dst, key.af);
5311 key.port[1] = key.port[0] = 0;
5314 STATE_LOOKUP(kif, &key, direction, *state, pd);
5316 if (direction == (*state)->direction) {
5317 src = &(*state)->src;
5318 dst = &(*state)->dst;
5320 src = &(*state)->dst;
5321 dst = &(*state)->src;
5325 if (src->state < PFOTHERS_SINGLE)
5326 src->state = PFOTHERS_SINGLE;
5327 if (dst->state == PFOTHERS_SINGLE)
5328 dst->state = PFOTHERS_MULTIPLE;
5330 /* update expire time */
5331 (*state)->expire = time_uptime;
5332 if (src->state == PFOTHERS_MULTIPLE && dst->state == PFOTHERS_MULTIPLE)
5333 (*state)->timeout = PFTM_OTHER_MULTIPLE;
5335 (*state)->timeout = PFTM_OTHER_SINGLE;
5337 /* translate source/destination address, if necessary */
5338 if ((*state)->key[PF_SK_WIRE] != (*state)->key[PF_SK_STACK]) {
5339 struct pf_state_key *nk = (*state)->key[pd->didx];
5341 KASSERT(nk, ("%s: nk is null", __func__));
5342 KASSERT(pd, ("%s: pd is null", __func__));
5343 KASSERT(pd->src, ("%s: pd->src is null", __func__));
5344 KASSERT(pd->dst, ("%s: pd->dst is null", __func__));
5348 if (PF_ANEQ(pd->src, &nk->addr[pd->sidx], AF_INET))
5349 pf_change_a(&pd->src->v4.s_addr,
5351 nk->addr[pd->sidx].v4.s_addr,
5354 if (PF_ANEQ(pd->dst, &nk->addr[pd->didx], AF_INET))
5355 pf_change_a(&pd->dst->v4.s_addr,
5357 nk->addr[pd->didx].v4.s_addr,
5364 if (PF_ANEQ(pd->src, &nk->addr[pd->sidx], AF_INET))
5365 PF_ACPY(pd->src, &nk->addr[pd->sidx], pd->af);
5367 if (PF_ANEQ(pd->dst, &nk->addr[pd->didx], AF_INET))
5368 PF_ACPY(pd->dst, &nk->addr[pd->didx], pd->af);
5376 * ipoff and off are measured from the start of the mbuf chain.
5377 * h must be at "ipoff" on the mbuf chain.
5380 pf_pull_hdr(struct mbuf *m, int off, void *p, int len,
5381 u_short *actionp, u_short *reasonp, sa_family_t af)
5386 struct ip *h = mtod(m, struct ip *);
5387 u_int16_t fragoff = (ntohs(h->ip_off) & IP_OFFMASK) << 3;
5391 ACTION_SET(actionp, PF_PASS);
5393 ACTION_SET(actionp, PF_DROP);
5394 REASON_SET(reasonp, PFRES_FRAG);
5398 if (m->m_pkthdr.len < off + len ||
5399 ntohs(h->ip_len) < off + len) {
5400 ACTION_SET(actionp, PF_DROP);
5401 REASON_SET(reasonp, PFRES_SHORT);
5409 struct ip6_hdr *h = mtod(m, struct ip6_hdr *);
5411 if (m->m_pkthdr.len < off + len ||
5412 (ntohs(h->ip6_plen) + sizeof(struct ip6_hdr)) <
5413 (unsigned)(off + len)) {
5414 ACTION_SET(actionp, PF_DROP);
5415 REASON_SET(reasonp, PFRES_SHORT);
5422 m_copydata(m, off, len, p);
5427 pf_routable(struct pf_addr *addr, sa_family_t af, struct pfi_kkif *kif,
5433 * Skip check for addresses with embedded interface scope,
5434 * as they would always match anyway.
5436 if (af == AF_INET6 && IN6_IS_SCOPE_EMBED(&addr->v6))
5439 if (af != AF_INET && af != AF_INET6)
5442 /* Skip checks for ipsec interfaces */
5443 if (kif != NULL && kif->pfik_ifp->if_type == IFT_ENC)
5446 ifp = (kif != NULL) ? kif->pfik_ifp : NULL;
5451 return (fib6_check_urpf(rtableid, &addr->v6, 0, NHR_NONE,
5456 return (fib4_check_urpf(rtableid, addr->v4, 0, NHR_NONE,
5466 pf_route(struct mbuf **m, struct pf_krule *r, int dir, struct ifnet *oifp,
5467 struct pf_state *s, struct pf_pdesc *pd, struct inpcb *inp)
5469 struct mbuf *m0, *m1;
5470 struct sockaddr_in dst;
5472 struct ifnet *ifp = NULL;
5473 struct pf_addr naddr;
5474 struct pf_ksrc_node *sn = NULL;
5476 uint16_t ip_len, ip_off;
5478 KASSERT(m && *m && r && oifp, ("%s: invalid parameters", __func__));
5479 KASSERT(dir == PF_IN || dir == PF_OUT, ("%s: invalid direction",
5482 if ((pd->pf_mtag == NULL &&
5483 ((pd->pf_mtag = pf_get_mtag(*m)) == NULL)) ||
5484 pd->pf_mtag->routed++ > 3) {
5490 if (r->rt == PF_DUPTO) {
5491 if ((m0 = m_dup(*m, M_NOWAIT)) == NULL) {
5497 if ((r->rt == PF_REPLYTO) == (r->direction == dir)) {
5505 ip = mtod(m0, struct ip *);
5507 bzero(&dst, sizeof(dst));
5508 dst.sin_family = AF_INET;
5509 dst.sin_len = sizeof(dst);
5510 dst.sin_addr = ip->ip_dst;
5512 bzero(&naddr, sizeof(naddr));
5514 if (TAILQ_EMPTY(&r->rpool.list)) {
5515 DPFPRINTF(PF_DEBUG_URGENT,
5516 ("%s: TAILQ_EMPTY(&r->rpool.list)\n", __func__));
5520 pf_map_addr(AF_INET, r, (struct pf_addr *)&ip->ip_src,
5522 if (!PF_AZERO(&naddr, AF_INET))
5523 dst.sin_addr.s_addr = naddr.v4.s_addr;
5524 ifp = r->rpool.cur->kif ?
5525 r->rpool.cur->kif->pfik_ifp : NULL;
5527 if (!PF_AZERO(&s->rt_addr, AF_INET))
5528 dst.sin_addr.s_addr =
5529 s->rt_addr.v4.s_addr;
5530 ifp = s->rt_kif ? s->rt_kif->pfik_ifp : NULL;
5537 if (pf_test(PF_OUT, 0, ifp, &m0, inp) != PF_PASS)
5539 else if (m0 == NULL)
5541 if (m0->m_len < sizeof(struct ip)) {
5542 DPFPRINTF(PF_DEBUG_URGENT,
5543 ("%s: m0->m_len < sizeof(struct ip)\n", __func__));
5546 ip = mtod(m0, struct ip *);
5549 if (ifp->if_flags & IFF_LOOPBACK)
5550 m0->m_flags |= M_SKIP_FIREWALL;
5552 ip_len = ntohs(ip->ip_len);
5553 ip_off = ntohs(ip->ip_off);
5555 /* Copied from FreeBSD 10.0-CURRENT ip_output. */
5556 m0->m_pkthdr.csum_flags |= CSUM_IP;
5557 if (m0->m_pkthdr.csum_flags & CSUM_DELAY_DATA & ~ifp->if_hwassist) {
5558 m0 = mb_unmapped_to_ext(m0);
5561 in_delayed_cksum(m0);
5562 m0->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
5564 #if defined(SCTP) || defined(SCTP_SUPPORT)
5565 if (m0->m_pkthdr.csum_flags & CSUM_SCTP & ~ifp->if_hwassist) {
5566 m0 = mb_unmapped_to_ext(m0);
5569 sctp_delayed_cksum(m0, (uint32_t)(ip->ip_hl << 2));
5570 m0->m_pkthdr.csum_flags &= ~CSUM_SCTP;
5575 * If small enough for interface, or the interface will take
5576 * care of the fragmentation for us, we can just send directly.
5578 if (ip_len <= ifp->if_mtu ||
5579 (m0->m_pkthdr.csum_flags & ifp->if_hwassist & CSUM_TSO) != 0) {
5581 if (m0->m_pkthdr.csum_flags & CSUM_IP & ~ifp->if_hwassist) {
5582 ip->ip_sum = in_cksum(m0, ip->ip_hl << 2);
5583 m0->m_pkthdr.csum_flags &= ~CSUM_IP;
5585 m_clrprotoflags(m0); /* Avoid confusing lower layers. */
5586 error = (*ifp->if_output)(ifp, m0, sintosa(&dst), NULL);
5590 /* Balk when DF bit is set or the interface didn't support TSO. */
5591 if ((ip_off & IP_DF) || (m0->m_pkthdr.csum_flags & CSUM_TSO)) {
5593 KMOD_IPSTAT_INC(ips_cantfrag);
5594 if (r->rt != PF_DUPTO) {
5595 icmp_error(m0, ICMP_UNREACH, ICMP_UNREACH_NEEDFRAG, 0,
5602 error = ip_fragment(ip, &m0, ifp->if_mtu, ifp->if_hwassist);
5606 for (; m0; m0 = m1) {
5608 m0->m_nextpkt = NULL;
5610 m_clrprotoflags(m0);
5611 error = (*ifp->if_output)(ifp, m0, sintosa(&dst), NULL);
5617 KMOD_IPSTAT_INC(ips_fragmented);
5620 if (r->rt != PF_DUPTO)
5635 pf_route6(struct mbuf **m, struct pf_krule *r, int dir, struct ifnet *oifp,
5636 struct pf_state *s, struct pf_pdesc *pd, struct inpcb *inp)
5639 struct sockaddr_in6 dst;
5640 struct ip6_hdr *ip6;
5641 struct ifnet *ifp = NULL;
5642 struct pf_addr naddr;
5643 struct pf_ksrc_node *sn = NULL;
5645 KASSERT(m && *m && r && oifp, ("%s: invalid parameters", __func__));
5646 KASSERT(dir == PF_IN || dir == PF_OUT, ("%s: invalid direction",
5649 if ((pd->pf_mtag == NULL &&
5650 ((pd->pf_mtag = pf_get_mtag(*m)) == NULL)) ||
5651 pd->pf_mtag->routed++ > 3) {
5657 if (r->rt == PF_DUPTO) {
5658 if ((m0 = m_dup(*m, M_NOWAIT)) == NULL) {
5664 if ((r->rt == PF_REPLYTO) == (r->direction == dir)) {
5672 ip6 = mtod(m0, struct ip6_hdr *);
5674 bzero(&dst, sizeof(dst));
5675 dst.sin6_family = AF_INET6;
5676 dst.sin6_len = sizeof(dst);
5677 dst.sin6_addr = ip6->ip6_dst;
5679 bzero(&naddr, sizeof(naddr));
5681 if (TAILQ_EMPTY(&r->rpool.list)) {
5682 DPFPRINTF(PF_DEBUG_URGENT,
5683 ("%s: TAILQ_EMPTY(&r->rpool.list)\n", __func__));
5687 pf_map_addr(AF_INET6, r, (struct pf_addr *)&ip6->ip6_src,
5689 if (!PF_AZERO(&naddr, AF_INET6))
5690 PF_ACPY((struct pf_addr *)&dst.sin6_addr,
5692 ifp = r->rpool.cur->kif ? r->rpool.cur->kif->pfik_ifp : NULL;
5694 if (!PF_AZERO(&s->rt_addr, AF_INET6))
5695 PF_ACPY((struct pf_addr *)&dst.sin6_addr,
5696 &s->rt_addr, AF_INET6);
5697 ifp = s->rt_kif ? s->rt_kif->pfik_ifp : NULL;
5707 if (pf_test6(PF_OUT, PFIL_FWD, ifp, &m0, inp) != PF_PASS)
5709 else if (m0 == NULL)
5711 if (m0->m_len < sizeof(struct ip6_hdr)) {
5712 DPFPRINTF(PF_DEBUG_URGENT,
5713 ("%s: m0->m_len < sizeof(struct ip6_hdr)\n",
5717 ip6 = mtod(m0, struct ip6_hdr *);
5720 if (ifp->if_flags & IFF_LOOPBACK)
5721 m0->m_flags |= M_SKIP_FIREWALL;
5723 if (m0->m_pkthdr.csum_flags & CSUM_DELAY_DATA_IPV6 &
5724 ~ifp->if_hwassist) {
5725 uint32_t plen = m0->m_pkthdr.len - sizeof(*ip6);
5726 m0 = mb_unmapped_to_ext(m0);
5729 in6_delayed_cksum(m0, plen, sizeof(struct ip6_hdr));
5730 m0->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA_IPV6;
5734 * If the packet is too large for the outgoing interface,
5735 * send back an icmp6 error.
5737 if (IN6_IS_SCOPE_EMBED(&dst.sin6_addr))
5738 dst.sin6_addr.s6_addr16[1] = htons(ifp->if_index);
5739 if ((u_long)m0->m_pkthdr.len <= ifp->if_mtu)
5740 nd6_output_ifp(ifp, ifp, m0, &dst, NULL);
5742 in6_ifstat_inc(ifp, ifs6_in_toobig);
5743 if (r->rt != PF_DUPTO)
5744 icmp6_error(m0, ICMP6_PACKET_TOO_BIG, 0, ifp->if_mtu);
5750 if (r->rt != PF_DUPTO)
5764 * FreeBSD supports cksum offloads for the following drivers.
5765 * em(4), fxp(4), lge(4), ndis(4), nge(4), re(4), ti(4), txp(4), xl(4)
5767 * CSUM_DATA_VALID | CSUM_PSEUDO_HDR :
5768 * network driver performed cksum including pseudo header, need to verify
5771 * network driver performed cksum, needs to additional pseudo header
5772 * cksum computation with partial csum_data(i.e. lack of H/W support for
5773 * pseudo header, for instance sk(4) and possibly gem(4))
5775 * After validating the cksum of packet, set both flag CSUM_DATA_VALID and
5776 * CSUM_PSEUDO_HDR in order to avoid recomputation of the cksum in upper
5778 * Also, set csum_data to 0xffff to force cksum validation.
5781 pf_check_proto_cksum(struct mbuf *m, int off, int len, u_int8_t p, sa_family_t af)
5787 if (off < sizeof(struct ip) || len < sizeof(struct udphdr))
5789 if (m->m_pkthdr.len < off + len)
5794 if (m->m_pkthdr.csum_flags & CSUM_DATA_VALID) {
5795 if (m->m_pkthdr.csum_flags & CSUM_PSEUDO_HDR) {
5796 sum = m->m_pkthdr.csum_data;
5798 ip = mtod(m, struct ip *);
5799 sum = in_pseudo(ip->ip_src.s_addr,
5800 ip->ip_dst.s_addr, htonl((u_short)len +
5801 m->m_pkthdr.csum_data + IPPROTO_TCP));
5808 if (m->m_pkthdr.csum_flags & CSUM_DATA_VALID) {
5809 if (m->m_pkthdr.csum_flags & CSUM_PSEUDO_HDR) {
5810 sum = m->m_pkthdr.csum_data;
5812 ip = mtod(m, struct ip *);
5813 sum = in_pseudo(ip->ip_src.s_addr,
5814 ip->ip_dst.s_addr, htonl((u_short)len +
5815 m->m_pkthdr.csum_data + IPPROTO_UDP));
5823 case IPPROTO_ICMPV6:
5833 if (p == IPPROTO_ICMP) {
5838 sum = in_cksum(m, len);
5842 if (m->m_len < sizeof(struct ip))
5844 sum = in4_cksum(m, p, off, len);
5849 if (m->m_len < sizeof(struct ip6_hdr))
5851 sum = in6_cksum(m, p, off, len);
5862 KMOD_TCPSTAT_INC(tcps_rcvbadsum);
5867 KMOD_UDPSTAT_INC(udps_badsum);
5873 KMOD_ICMPSTAT_INC(icps_checksum);
5878 case IPPROTO_ICMPV6:
5880 KMOD_ICMP6STAT_INC(icp6s_checksum);
5887 if (p == IPPROTO_TCP || p == IPPROTO_UDP) {
5888 m->m_pkthdr.csum_flags |=
5889 (CSUM_DATA_VALID | CSUM_PSEUDO_HDR);
5890 m->m_pkthdr.csum_data = 0xffff;
5898 pf_test(int dir, int pflags, struct ifnet *ifp, struct mbuf **m0, struct inpcb *inp)
5900 struct pfi_kkif *kif;
5901 u_short action, reason = 0, log = 0;
5902 struct mbuf *m = *m0;
5903 struct ip *h = NULL;
5904 struct m_tag *ipfwtag;
5905 struct pf_krule *a = NULL, *r = &V_pf_default_rule, *tr, *nr;
5906 struct pf_state *s = NULL;
5907 struct pf_kruleset *ruleset = NULL;
5909 int off, dirndx, pqid = 0;
5911 PF_RULES_RLOCK_TRACKER;
5915 if (!V_pf_status.running)
5918 memset(&pd, 0, sizeof(pd));
5920 kif = (struct pfi_kkif *)ifp->if_pf_kif;
5923 DPFPRINTF(PF_DEBUG_URGENT,
5924 ("pf_test: kif == NULL, if_xname %s\n", ifp->if_xname));
5927 if (kif->pfik_flags & PFI_IFLAG_SKIP)
5930 if (m->m_flags & M_SKIP_FIREWALL)
5933 pd.pf_mtag = pf_find_mtag(m);
5937 if (ip_divert_ptr != NULL &&
5938 ((ipfwtag = m_tag_locate(m, MTAG_IPFW_RULE, 0, NULL)) != NULL)) {
5939 struct ipfw_rule_ref *rr = (struct ipfw_rule_ref *)(ipfwtag+1);
5940 if (rr->info & IPFW_IS_DIVERT && rr->rulenum == 0) {
5941 if (pd.pf_mtag == NULL &&
5942 ((pd.pf_mtag = pf_get_mtag(m)) == NULL)) {
5946 pd.pf_mtag->flags |= PF_PACKET_LOOPED;
5947 m_tag_delete(m, ipfwtag);
5949 if (pd.pf_mtag && pd.pf_mtag->flags & PF_FASTFWD_OURS_PRESENT) {
5950 m->m_flags |= M_FASTFWD_OURS;
5951 pd.pf_mtag->flags &= ~PF_FASTFWD_OURS_PRESENT;
5953 } else if (pf_normalize_ip(m0, dir, kif, &reason, &pd) != PF_PASS) {
5954 /* We do IP header normalization and packet reassembly here */
5958 m = *m0; /* pf_normalize messes with m0 */
5959 h = mtod(m, struct ip *);
5961 off = h->ip_hl << 2;
5962 if (off < (int)sizeof(struct ip)) {
5964 REASON_SET(&reason, PFRES_SHORT);
5969 pd.src = (struct pf_addr *)&h->ip_src;
5970 pd.dst = (struct pf_addr *)&h->ip_dst;
5971 pd.sport = pd.dport = NULL;
5972 pd.ip_sum = &h->ip_sum;
5973 pd.proto_sum = NULL;
5976 pd.sidx = (dir == PF_IN) ? 0 : 1;
5977 pd.didx = (dir == PF_IN) ? 1 : 0;
5979 pd.tos = h->ip_tos & ~IPTOS_ECN_MASK;
5980 pd.tot_len = ntohs(h->ip_len);
5982 /* handle fragments that didn't get reassembled by normalization */
5983 if (h->ip_off & htons(IP_MF | IP_OFFMASK)) {
5984 action = pf_test_fragment(&r, dir, kif, m, h,
5994 if (!pf_pull_hdr(m, off, &th, sizeof(th),
5995 &action, &reason, AF_INET)) {
5996 log = action != PF_PASS;
5999 pd.p_len = pd.tot_len - off - (th.th_off << 2);
6000 if ((th.th_flags & TH_ACK) && pd.p_len == 0)
6002 action = pf_normalize_tcp(dir, kif, m, 0, off, h, &pd);
6003 if (action == PF_DROP)
6005 action = pf_test_state_tcp(&s, dir, kif, m, off, h, &pd,
6007 if (action == PF_PASS) {
6008 if (V_pfsync_update_state_ptr != NULL)
6009 V_pfsync_update_state_ptr(s);
6013 } else if (s == NULL)
6014 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6023 if (!pf_pull_hdr(m, off, &uh, sizeof(uh),
6024 &action, &reason, AF_INET)) {
6025 log = action != PF_PASS;
6028 if (uh.uh_dport == 0 ||
6029 ntohs(uh.uh_ulen) > m->m_pkthdr.len - off ||
6030 ntohs(uh.uh_ulen) < sizeof(struct udphdr)) {
6032 REASON_SET(&reason, PFRES_SHORT);
6035 action = pf_test_state_udp(&s, dir, kif, m, off, h, &pd);
6036 if (action == PF_PASS) {
6037 if (V_pfsync_update_state_ptr != NULL)
6038 V_pfsync_update_state_ptr(s);
6042 } else if (s == NULL)
6043 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6048 case IPPROTO_ICMP: {
6052 if (!pf_pull_hdr(m, off, &ih, ICMP_MINLEN,
6053 &action, &reason, AF_INET)) {
6054 log = action != PF_PASS;
6057 action = pf_test_state_icmp(&s, dir, kif, m, off, h, &pd,
6059 if (action == PF_PASS) {
6060 if (V_pfsync_update_state_ptr != NULL)
6061 V_pfsync_update_state_ptr(s);
6065 } else if (s == NULL)
6066 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6072 case IPPROTO_ICMPV6: {
6074 DPFPRINTF(PF_DEBUG_MISC,
6075 ("pf: dropping IPv4 packet with ICMPv6 payload\n"));
6081 action = pf_test_state_other(&s, dir, kif, m, &pd);
6082 if (action == PF_PASS) {
6083 if (V_pfsync_update_state_ptr != NULL)
6084 V_pfsync_update_state_ptr(s);
6088 } else if (s == NULL)
6089 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6096 if (action == PF_PASS && h->ip_hl > 5 &&
6097 !((s && s->state_flags & PFSTATE_ALLOWOPTS) || r->allow_opts)) {
6099 REASON_SET(&reason, PFRES_IPOPTIONS);
6101 DPFPRINTF(PF_DEBUG_MISC,
6102 ("pf: dropping packet with ip options\n"));
6105 if (s && s->tag > 0 && pf_tag_packet(m, &pd, s->tag)) {
6107 REASON_SET(&reason, PFRES_MEMORY);
6109 if (r->rtableid >= 0)
6110 M_SETFIB(m, r->rtableid);
6112 if (r->scrub_flags & PFSTATE_SETPRIO) {
6113 if (pd.tos & IPTOS_LOWDELAY)
6115 if (pf_ieee8021q_setpcp(m, r->set_prio[pqid])) {
6117 REASON_SET(&reason, PFRES_MEMORY);
6119 DPFPRINTF(PF_DEBUG_MISC,
6120 ("pf: failed to allocate 802.1q mtag\n"));
6125 if (action == PF_PASS && r->qid) {
6126 if (pd.pf_mtag == NULL &&
6127 ((pd.pf_mtag = pf_get_mtag(m)) == NULL)) {
6129 REASON_SET(&reason, PFRES_MEMORY);
6132 pd.pf_mtag->qid_hash = pf_state_hash(s);
6133 if (pqid || (pd.tos & IPTOS_LOWDELAY))
6134 pd.pf_mtag->qid = r->pqid;
6136 pd.pf_mtag->qid = r->qid;
6137 /* Add hints for ecn. */
6138 pd.pf_mtag->hdr = h;
6144 * connections redirected to loopback should not match sockets
6145 * bound specifically to loopback due to security implications,
6146 * see tcp_input() and in_pcblookup_listen().
6148 if (dir == PF_IN && action == PF_PASS && (pd.proto == IPPROTO_TCP ||
6149 pd.proto == IPPROTO_UDP) && s != NULL && s->nat_rule.ptr != NULL &&
6150 (s->nat_rule.ptr->action == PF_RDR ||
6151 s->nat_rule.ptr->action == PF_BINAT) &&
6152 IN_LOOPBACK(ntohl(pd.dst->v4.s_addr)))
6153 m->m_flags |= M_SKIP_FIREWALL;
6155 if (action == PF_PASS && r->divert.port && ip_divert_ptr != NULL &&
6156 !PACKET_LOOPED(&pd)) {
6157 ipfwtag = m_tag_alloc(MTAG_IPFW_RULE, 0,
6158 sizeof(struct ipfw_rule_ref), M_NOWAIT | M_ZERO);
6159 if (ipfwtag != NULL) {
6160 ((struct ipfw_rule_ref *)(ipfwtag+1))->info =
6161 ntohs(r->divert.port);
6162 ((struct ipfw_rule_ref *)(ipfwtag+1))->rulenum = dir;
6167 m_tag_prepend(m, ipfwtag);
6168 if (m->m_flags & M_FASTFWD_OURS) {
6169 if (pd.pf_mtag == NULL &&
6170 ((pd.pf_mtag = pf_get_mtag(m)) == NULL)) {
6172 REASON_SET(&reason, PFRES_MEMORY);
6174 DPFPRINTF(PF_DEBUG_MISC,
6175 ("pf: failed to allocate tag\n"));
6177 pd.pf_mtag->flags |=
6178 PF_FASTFWD_OURS_PRESENT;
6179 m->m_flags &= ~M_FASTFWD_OURS;
6182 ip_divert_ptr(*m0, dir == PF_IN);
6187 /* XXX: ipfw has the same behaviour! */
6189 REASON_SET(&reason, PFRES_MEMORY);
6191 DPFPRINTF(PF_DEBUG_MISC,
6192 ("pf: failed to allocate divert tag\n"));
6197 struct pf_krule *lr;
6199 if (s != NULL && s->nat_rule.ptr != NULL &&
6200 s->nat_rule.ptr->log & PF_LOG_ALL)
6201 lr = s->nat_rule.ptr;
6204 PFLOG_PACKET(kif, m, AF_INET, dir, reason, lr, a, ruleset, &pd,
6208 counter_u64_add(kif->pfik_bytes[0][dir == PF_OUT][action != PF_PASS],
6210 counter_u64_add(kif->pfik_packets[0][dir == PF_OUT][action != PF_PASS],
6213 if (action == PF_PASS || r->action == PF_DROP) {
6214 dirndx = (dir == PF_OUT);
6215 counter_u64_add(r->packets[dirndx], 1);
6216 counter_u64_add(r->bytes[dirndx], pd.tot_len);
6218 counter_u64_add(a->packets[dirndx], 1);
6219 counter_u64_add(a->bytes[dirndx], pd.tot_len);
6222 if (s->nat_rule.ptr != NULL) {
6223 counter_u64_add(s->nat_rule.ptr->packets[dirndx],
6225 counter_u64_add(s->nat_rule.ptr->bytes[dirndx],
6228 if (s->src_node != NULL) {
6229 counter_u64_add(s->src_node->packets[dirndx],
6231 counter_u64_add(s->src_node->bytes[dirndx],
6234 if (s->nat_src_node != NULL) {
6235 counter_u64_add(s->nat_src_node->packets[dirndx],
6237 counter_u64_add(s->nat_src_node->bytes[dirndx],
6240 dirndx = (dir == s->direction) ? 0 : 1;
6241 counter_u64_add(s->packets[dirndx], 1);
6242 counter_u64_add(s->bytes[dirndx], pd.tot_len);
6245 nr = (s != NULL) ? s->nat_rule.ptr : pd.nat_rule;
6246 if (nr != NULL && r == &V_pf_default_rule)
6248 if (tr->src.addr.type == PF_ADDR_TABLE)
6249 pfr_update_stats(tr->src.addr.p.tbl,
6250 (s == NULL) ? pd.src :
6251 &s->key[(s->direction == PF_IN)]->
6252 addr[(s->direction == PF_OUT)],
6253 pd.af, pd.tot_len, dir == PF_OUT,
6254 r->action == PF_PASS, tr->src.neg);
6255 if (tr->dst.addr.type == PF_ADDR_TABLE)
6256 pfr_update_stats(tr->dst.addr.p.tbl,
6257 (s == NULL) ? pd.dst :
6258 &s->key[(s->direction == PF_IN)]->
6259 addr[(s->direction == PF_IN)],
6260 pd.af, pd.tot_len, dir == PF_OUT,
6261 r->action == PF_PASS, tr->dst.neg);
6265 case PF_SYNPROXY_DROP:
6276 /* pf_route() returns unlocked. */
6278 pf_route(m0, r, dir, kif->pfik_ifp, s, &pd, inp);
6292 pf_test6(int dir, int pflags, struct ifnet *ifp, struct mbuf **m0, struct inpcb *inp)
6294 struct pfi_kkif *kif;
6295 u_short action, reason = 0, log = 0;
6296 struct mbuf *m = *m0, *n = NULL;
6298 struct ip6_hdr *h = NULL;
6299 struct pf_krule *a = NULL, *r = &V_pf_default_rule, *tr, *nr;
6300 struct pf_state *s = NULL;
6301 struct pf_kruleset *ruleset = NULL;
6303 int off, terminal = 0, dirndx, rh_cnt = 0, pqid = 0;
6305 PF_RULES_RLOCK_TRACKER;
6308 if (!V_pf_status.running)
6311 memset(&pd, 0, sizeof(pd));
6312 pd.pf_mtag = pf_find_mtag(m);
6314 if (pd.pf_mtag && pd.pf_mtag->flags & PF_TAG_GENERATED)
6317 kif = (struct pfi_kkif *)ifp->if_pf_kif;
6319 DPFPRINTF(PF_DEBUG_URGENT,
6320 ("pf_test6: kif == NULL, if_xname %s\n", ifp->if_xname));
6323 if (kif->pfik_flags & PFI_IFLAG_SKIP)
6326 if (m->m_flags & M_SKIP_FIREWALL)
6331 /* We do IP header normalization and packet reassembly here */
6332 if (pf_normalize_ip6(m0, dir, kif, &reason, &pd) != PF_PASS) {
6336 m = *m0; /* pf_normalize messes with m0 */
6337 h = mtod(m, struct ip6_hdr *);
6340 * we do not support jumbogram. if we keep going, zero ip6_plen
6341 * will do something bad, so drop the packet for now.
6343 if (htons(h->ip6_plen) == 0) {
6345 REASON_SET(&reason, PFRES_NORM); /*XXX*/
6349 pd.src = (struct pf_addr *)&h->ip6_src;
6350 pd.dst = (struct pf_addr *)&h->ip6_dst;
6351 pd.sport = pd.dport = NULL;
6353 pd.proto_sum = NULL;
6355 pd.sidx = (dir == PF_IN) ? 0 : 1;
6356 pd.didx = (dir == PF_IN) ? 1 : 0;
6359 pd.tot_len = ntohs(h->ip6_plen) + sizeof(struct ip6_hdr);
6361 off = ((caddr_t)h - m->m_data) + sizeof(struct ip6_hdr);
6362 pd.proto = h->ip6_nxt;
6365 case IPPROTO_FRAGMENT:
6366 action = pf_test_fragment(&r, dir, kif, m, h,
6368 if (action == PF_DROP)
6369 REASON_SET(&reason, PFRES_FRAG);
6371 case IPPROTO_ROUTING: {
6372 struct ip6_rthdr rthdr;
6375 DPFPRINTF(PF_DEBUG_MISC,
6376 ("pf: IPv6 more than one rthdr\n"));
6378 REASON_SET(&reason, PFRES_IPOPTIONS);
6382 if (!pf_pull_hdr(m, off, &rthdr, sizeof(rthdr), NULL,
6384 DPFPRINTF(PF_DEBUG_MISC,
6385 ("pf: IPv6 short rthdr\n"));
6387 REASON_SET(&reason, PFRES_SHORT);
6391 if (rthdr.ip6r_type == IPV6_RTHDR_TYPE_0) {
6392 DPFPRINTF(PF_DEBUG_MISC,
6393 ("pf: IPv6 rthdr0\n"));
6395 REASON_SET(&reason, PFRES_IPOPTIONS);
6402 case IPPROTO_HOPOPTS:
6403 case IPPROTO_DSTOPTS: {
6404 /* get next header and header length */
6405 struct ip6_ext opt6;
6407 if (!pf_pull_hdr(m, off, &opt6, sizeof(opt6),
6408 NULL, &reason, pd.af)) {
6409 DPFPRINTF(PF_DEBUG_MISC,
6410 ("pf: IPv6 short opt\n"));
6415 if (pd.proto == IPPROTO_AH)
6416 off += (opt6.ip6e_len + 2) * 4;
6418 off += (opt6.ip6e_len + 1) * 8;
6419 pd.proto = opt6.ip6e_nxt;
6420 /* goto the next header */
6427 } while (!terminal);
6429 /* if there's no routing header, use unmodified mbuf for checksumming */
6438 if (!pf_pull_hdr(m, off, &th, sizeof(th),
6439 &action, &reason, AF_INET6)) {
6440 log = action != PF_PASS;
6443 pd.p_len = pd.tot_len - off - (th.th_off << 2);
6444 action = pf_normalize_tcp(dir, kif, m, 0, off, h, &pd);
6445 if (action == PF_DROP)
6447 action = pf_test_state_tcp(&s, dir, kif, m, off, h, &pd,
6449 if (action == PF_PASS) {
6450 if (V_pfsync_update_state_ptr != NULL)
6451 V_pfsync_update_state_ptr(s);
6455 } else if (s == NULL)
6456 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6465 if (!pf_pull_hdr(m, off, &uh, sizeof(uh),
6466 &action, &reason, AF_INET6)) {
6467 log = action != PF_PASS;
6470 if (uh.uh_dport == 0 ||
6471 ntohs(uh.uh_ulen) > m->m_pkthdr.len - off ||
6472 ntohs(uh.uh_ulen) < sizeof(struct udphdr)) {
6474 REASON_SET(&reason, PFRES_SHORT);
6477 action = pf_test_state_udp(&s, dir, kif, m, off, h, &pd);
6478 if (action == PF_PASS) {
6479 if (V_pfsync_update_state_ptr != NULL)
6480 V_pfsync_update_state_ptr(s);
6484 } else if (s == NULL)
6485 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6490 case IPPROTO_ICMP: {
6492 DPFPRINTF(PF_DEBUG_MISC,
6493 ("pf: dropping IPv6 packet with ICMPv4 payload\n"));
6497 case IPPROTO_ICMPV6: {
6498 struct icmp6_hdr ih;
6501 if (!pf_pull_hdr(m, off, &ih, sizeof(ih),
6502 &action, &reason, AF_INET6)) {
6503 log = action != PF_PASS;
6506 action = pf_test_state_icmp(&s, dir, kif,
6507 m, off, h, &pd, &reason);
6508 if (action == PF_PASS) {
6509 if (V_pfsync_update_state_ptr != NULL)
6510 V_pfsync_update_state_ptr(s);
6514 } else if (s == NULL)
6515 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6521 action = pf_test_state_other(&s, dir, kif, m, &pd);
6522 if (action == PF_PASS) {
6523 if (V_pfsync_update_state_ptr != NULL)
6524 V_pfsync_update_state_ptr(s);
6528 } else if (s == NULL)
6529 action = pf_test_rule(&r, &s, dir, kif, m, off, &pd,
6541 /* handle dangerous IPv6 extension headers. */
6542 if (action == PF_PASS && rh_cnt &&
6543 !((s && s->state_flags & PFSTATE_ALLOWOPTS) || r->allow_opts)) {
6545 REASON_SET(&reason, PFRES_IPOPTIONS);
6547 DPFPRINTF(PF_DEBUG_MISC,
6548 ("pf: dropping packet with dangerous v6 headers\n"));
6551 if (s && s->tag > 0 && pf_tag_packet(m, &pd, s->tag)) {
6553 REASON_SET(&reason, PFRES_MEMORY);
6555 if (r->rtableid >= 0)
6556 M_SETFIB(m, r->rtableid);
6558 if (r->scrub_flags & PFSTATE_SETPRIO) {
6559 if (pd.tos & IPTOS_LOWDELAY)
6561 if (pf_ieee8021q_setpcp(m, r->set_prio[pqid])) {
6563 REASON_SET(&reason, PFRES_MEMORY);
6565 DPFPRINTF(PF_DEBUG_MISC,
6566 ("pf: failed to allocate 802.1q mtag\n"));
6571 if (action == PF_PASS && r->qid) {
6572 if (pd.pf_mtag == NULL &&
6573 ((pd.pf_mtag = pf_get_mtag(m)) == NULL)) {
6575 REASON_SET(&reason, PFRES_MEMORY);
6578 pd.pf_mtag->qid_hash = pf_state_hash(s);
6579 if (pd.tos & IPTOS_LOWDELAY)
6580 pd.pf_mtag->qid = r->pqid;
6582 pd.pf_mtag->qid = r->qid;
6583 /* Add hints for ecn. */
6584 pd.pf_mtag->hdr = h;
6589 if (dir == PF_IN && action == PF_PASS && (pd.proto == IPPROTO_TCP ||
6590 pd.proto == IPPROTO_UDP) && s != NULL && s->nat_rule.ptr != NULL &&
6591 (s->nat_rule.ptr->action == PF_RDR ||
6592 s->nat_rule.ptr->action == PF_BINAT) &&
6593 IN6_IS_ADDR_LOOPBACK(&pd.dst->v6))
6594 m->m_flags |= M_SKIP_FIREWALL;
6596 /* XXX: Anybody working on it?! */
6598 printf("pf: divert(9) is not supported for IPv6\n");
6601 struct pf_krule *lr;
6603 if (s != NULL && s->nat_rule.ptr != NULL &&
6604 s->nat_rule.ptr->log & PF_LOG_ALL)
6605 lr = s->nat_rule.ptr;
6608 PFLOG_PACKET(kif, m, AF_INET6, dir, reason, lr, a, ruleset,
6612 counter_u64_add(kif->pfik_bytes[1][dir == PF_OUT][action != PF_PASS],
6614 counter_u64_add(kif->pfik_packets[1][dir == PF_OUT][action != PF_PASS],
6617 if (action == PF_PASS || r->action == PF_DROP) {
6618 dirndx = (dir == PF_OUT);
6619 counter_u64_add(r->packets[dirndx], 1);
6620 counter_u64_add(r->bytes[dirndx], pd.tot_len);
6622 counter_u64_add(a->packets[dirndx], 1);
6623 counter_u64_add(a->bytes[dirndx], pd.tot_len);
6626 if (s->nat_rule.ptr != NULL) {
6627 counter_u64_add(s->nat_rule.ptr->packets[dirndx],
6629 counter_u64_add(s->nat_rule.ptr->bytes[dirndx],
6632 if (s->src_node != NULL) {
6633 counter_u64_add(s->src_node->packets[dirndx],
6635 counter_u64_add(s->src_node->bytes[dirndx],
6638 if (s->nat_src_node != NULL) {
6639 counter_u64_add(s->nat_src_node->packets[dirndx],
6641 counter_u64_add(s->nat_src_node->bytes[dirndx],
6644 dirndx = (dir == s->direction) ? 0 : 1;
6645 counter_u64_add(s->packets[dirndx], 1);
6646 counter_u64_add(s->bytes[dirndx], pd.tot_len);
6649 nr = (s != NULL) ? s->nat_rule.ptr : pd.nat_rule;
6650 if (nr != NULL && r == &V_pf_default_rule)
6652 if (tr->src.addr.type == PF_ADDR_TABLE)
6653 pfr_update_stats(tr->src.addr.p.tbl,
6654 (s == NULL) ? pd.src :
6655 &s->key[(s->direction == PF_IN)]->addr[0],
6656 pd.af, pd.tot_len, dir == PF_OUT,
6657 r->action == PF_PASS, tr->src.neg);
6658 if (tr->dst.addr.type == PF_ADDR_TABLE)
6659 pfr_update_stats(tr->dst.addr.p.tbl,
6660 (s == NULL) ? pd.dst :
6661 &s->key[(s->direction == PF_IN)]->addr[1],
6662 pd.af, pd.tot_len, dir == PF_OUT,
6663 r->action == PF_PASS, tr->dst.neg);
6667 case PF_SYNPROXY_DROP:
6678 /* pf_route6() returns unlocked. */
6680 pf_route6(m0, r, dir, kif->pfik_ifp, s, &pd, inp);
6689 /* If reassembled packet passed, create new fragments. */
6690 if (action == PF_PASS && *m0 && (pflags & PFIL_FWD) &&
6691 (mtag = m_tag_find(m, PF_REASSEMBLED, NULL)) != NULL)
6692 action = pf_refragment6(ifp, m0, mtag);