2007-03-04 08:59:00 +03:00
|
|
|
/* $NetBSD: pf.c,v 1.36 2007/03/04 06:02:58 christos Exp $ */
|
2006-10-08 01:45:49 +04:00
|
|
|
/* $OpenBSD: pf.c,v 1.487 2005/04/22 09:53:18 dhartmei Exp $ */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 2001 Daniel Hartmeier
|
|
|
|
* Copyright (c) 2002,2003 Henning Brauer
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* - Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials provided
|
|
|
|
* with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* Effort sponsored in part by the Defense Advanced Research Projects
|
|
|
|
* Agency (DARPA) and Air Force Research Laboratory, Air Force
|
|
|
|
* Materiel Command, USAF, under agreement number F30602-01-2-0537.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "bpfilter.h"
|
|
|
|
#include "pflog.h"
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
#include "pfsync.h"
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
#define NPFSYNC 0
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/filio.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/pool.h>
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __NetBSD__
|
|
|
|
#include <sys/endian.h>
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
#include <net/bpf.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
#include <netinet/tcp.h>
|
|
|
|
#include <netinet/tcp_seq.h>
|
|
|
|
#include <netinet/udp.h>
|
|
|
|
#include <netinet/ip_icmp.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/tcp_timer.h>
|
|
|
|
#include <netinet/tcp_var.h>
|
|
|
|
#include <netinet/udp_var.h>
|
|
|
|
#include <netinet/icmp_var.h>
|
2004-11-14 14:12:16 +03:00
|
|
|
#ifdef __OpenBSD__
|
|
|
|
#include <netinet/if_ether.h>
|
|
|
|
#else
|
|
|
|
#include <net/if_ether.h>
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
#include <dev/rndvar.h>
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
#include <sys/rnd.h>
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
#include <net/pfvar.h>
|
|
|
|
#include <net/if_pflog.h>
|
|
|
|
|
|
|
|
#if NPFSYNC > 0
|
|
|
|
#include <net/if_pfsync.h>
|
|
|
|
#endif /* NPFSYNC > 0 */
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet/ip6.h>
|
2004-06-22 18:17:07 +04:00
|
|
|
#include <netinet6/ip6_var.h>
|
|
|
|
#ifdef __NetBSD__
|
|
|
|
#include <netinet6/in6_pcb.h>
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
#include <netinet/icmp6.h>
|
|
|
|
#include <netinet6/nd6.h>
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
#define DPFPRINTF(n, x) if (pf_status.debug >= (n)) printf x
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Global variables
|
|
|
|
*/
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_anchor_global pf_anchors;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_ruleset pf_main_ruleset;
|
|
|
|
struct pf_altqqueue pf_altqs[2];
|
|
|
|
struct pf_palist pf_pabuf;
|
|
|
|
struct pf_altqqueue *pf_altqs_active;
|
|
|
|
struct pf_altqqueue *pf_altqs_inactive;
|
|
|
|
struct pf_status pf_status;
|
|
|
|
|
|
|
|
u_int32_t ticket_altqs_active;
|
|
|
|
u_int32_t ticket_altqs_inactive;
|
|
|
|
int altqs_inactive_open;
|
|
|
|
u_int32_t ticket_pabuf;
|
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
struct timeout pf_expire_to; /* expire timeout */
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
struct callout pf_expire_to; /* expire timeout */
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_anchor_stackframe {
|
|
|
|
struct pf_ruleset *rs;
|
|
|
|
struct pf_rule *r;
|
|
|
|
struct pf_anchor_node *parent;
|
|
|
|
struct pf_anchor *child;
|
|
|
|
} pf_anchor_stack[64];
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pool pf_src_tree_pl, pf_rule_pl;
|
|
|
|
struct pool pf_state_pl, pf_altq_pl, pf_pooladdr_pl;
|
|
|
|
|
|
|
|
void pf_print_host(struct pf_addr *, u_int16_t, u_int8_t);
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
void pf_init_threshold(struct pf_threshold *, u_int32_t,
|
|
|
|
u_int32_t);
|
|
|
|
void pf_add_threshold(struct pf_threshold *);
|
|
|
|
int pf_check_threshold(struct pf_threshold *);
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
void pf_change_ap(struct pf_addr *, u_int16_t *,
|
|
|
|
u_int16_t *, u_int16_t *, struct pf_addr *,
|
|
|
|
u_int16_t, u_int8_t, sa_family_t);
|
|
|
|
#ifdef INET6
|
|
|
|
void pf_change_a6(struct pf_addr *, u_int16_t *,
|
|
|
|
struct pf_addr *, u_int8_t);
|
|
|
|
#endif /* INET6 */
|
|
|
|
void pf_change_icmp(struct pf_addr *, u_int16_t *,
|
|
|
|
struct pf_addr *, struct pf_addr *, u_int16_t,
|
|
|
|
u_int16_t *, u_int16_t *, u_int16_t *,
|
|
|
|
u_int16_t *, u_int8_t, sa_family_t);
|
|
|
|
void pf_send_tcp(const struct pf_rule *, sa_family_t,
|
|
|
|
const struct pf_addr *, const struct pf_addr *,
|
|
|
|
u_int16_t, u_int16_t, u_int32_t, u_int32_t,
|
2004-11-14 14:12:16 +03:00
|
|
|
u_int8_t, u_int16_t, u_int16_t, u_int8_t, int,
|
2006-10-08 01:45:49 +04:00
|
|
|
u_int16_t, struct ether_header *, struct ifnet *);
|
2004-06-22 17:52:05 +04:00
|
|
|
void pf_send_icmp(struct mbuf *, u_int8_t, u_int8_t,
|
|
|
|
sa_family_t, struct pf_rule *);
|
|
|
|
struct pf_rule *pf_match_translation(struct pf_pdesc *, struct mbuf *,
|
|
|
|
int, int, struct pfi_kif *,
|
|
|
|
struct pf_addr *, u_int16_t, struct pf_addr *,
|
|
|
|
u_int16_t, int);
|
|
|
|
struct pf_rule *pf_get_translation(struct pf_pdesc *, struct mbuf *,
|
|
|
|
int, int, struct pfi_kif *, struct pf_src_node **,
|
|
|
|
struct pf_addr *, u_int16_t,
|
|
|
|
struct pf_addr *, u_int16_t,
|
|
|
|
struct pf_addr *, u_int16_t *);
|
|
|
|
int pf_test_tcp(struct pf_rule **, struct pf_state **,
|
|
|
|
int, struct pfi_kif *, struct mbuf *, int,
|
|
|
|
void *, struct pf_pdesc *, struct pf_rule **,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_ruleset **, struct ifqueue *);
|
2004-06-22 17:52:05 +04:00
|
|
|
int pf_test_udp(struct pf_rule **, struct pf_state **,
|
|
|
|
int, struct pfi_kif *, struct mbuf *, int,
|
|
|
|
void *, struct pf_pdesc *, struct pf_rule **,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_ruleset **, struct ifqueue *);
|
2004-06-22 17:52:05 +04:00
|
|
|
int pf_test_icmp(struct pf_rule **, struct pf_state **,
|
|
|
|
int, struct pfi_kif *, struct mbuf *, int,
|
|
|
|
void *, struct pf_pdesc *, struct pf_rule **,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_ruleset **, struct ifqueue *);
|
2004-06-22 17:52:05 +04:00
|
|
|
int pf_test_other(struct pf_rule **, struct pf_state **,
|
|
|
|
int, struct pfi_kif *, struct mbuf *, int, void *,
|
|
|
|
struct pf_pdesc *, struct pf_rule **,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_ruleset **, struct ifqueue *);
|
2004-06-22 17:52:05 +04:00
|
|
|
int pf_test_fragment(struct pf_rule **, int,
|
|
|
|
struct pfi_kif *, struct mbuf *, void *,
|
|
|
|
struct pf_pdesc *, struct pf_rule **,
|
|
|
|
struct pf_ruleset **);
|
|
|
|
int pf_test_state_tcp(struct pf_state **, int,
|
|
|
|
struct pfi_kif *, struct mbuf *, int,
|
|
|
|
void *, struct pf_pdesc *, u_short *);
|
|
|
|
int pf_test_state_udp(struct pf_state **, int,
|
|
|
|
struct pfi_kif *, struct mbuf *, int,
|
|
|
|
void *, struct pf_pdesc *);
|
|
|
|
int pf_test_state_icmp(struct pf_state **, int,
|
|
|
|
struct pfi_kif *, struct mbuf *, int,
|
2005-07-01 16:37:34 +04:00
|
|
|
void *, struct pf_pdesc *, u_short *);
|
2004-06-22 17:52:05 +04:00
|
|
|
int pf_test_state_other(struct pf_state **, int,
|
|
|
|
struct pfi_kif *, struct pf_pdesc *);
|
|
|
|
struct pf_tag *pf_get_tag(struct mbuf *);
|
|
|
|
int pf_match_tag(struct mbuf *, struct pf_rule *,
|
2005-07-01 16:37:34 +04:00
|
|
|
struct pf_tag **, int *);
|
2006-12-04 05:58:06 +03:00
|
|
|
void pf_hash(const struct pf_addr *, struct pf_addr *,
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_poolhashkey *, sa_family_t);
|
|
|
|
int pf_map_addr(u_int8_t, struct pf_rule *,
|
2006-12-04 05:58:06 +03:00
|
|
|
const struct pf_addr *, struct pf_addr *,
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_addr *, struct pf_src_node **);
|
|
|
|
int pf_get_sport(sa_family_t, u_int8_t, struct pf_rule *,
|
|
|
|
struct pf_addr *, struct pf_addr *, u_int16_t,
|
|
|
|
struct pf_addr *, u_int16_t*, u_int16_t, u_int16_t,
|
|
|
|
struct pf_src_node **);
|
|
|
|
void pf_route(struct mbuf **, struct pf_rule *, int,
|
|
|
|
struct ifnet *, struct pf_state *);
|
|
|
|
void pf_route6(struct mbuf **, struct pf_rule *, int,
|
|
|
|
struct ifnet *, struct pf_state *);
|
|
|
|
int pf_socket_lookup(uid_t *, gid_t *,
|
|
|
|
int, struct pf_pdesc *);
|
|
|
|
u_int8_t pf_get_wscale(struct mbuf *, int, u_int16_t,
|
|
|
|
sa_family_t);
|
|
|
|
u_int16_t pf_get_mss(struct mbuf *, int, u_int16_t,
|
|
|
|
sa_family_t);
|
|
|
|
u_int16_t pf_calc_mss(struct pf_addr *, sa_family_t,
|
|
|
|
u_int16_t);
|
|
|
|
void pf_set_rt_ifp(struct pf_state *,
|
|
|
|
struct pf_addr *);
|
|
|
|
int pf_check_proto_cksum(struct mbuf *, int, int,
|
|
|
|
u_int8_t, sa_family_t);
|
|
|
|
int pf_addr_wrap_neq(struct pf_addr_wrap *,
|
|
|
|
struct pf_addr_wrap *);
|
|
|
|
static int pf_add_mbuf_tag(struct mbuf *, u_int);
|
|
|
|
struct pf_state *pf_find_state_recurse(struct pfi_kif *,
|
|
|
|
struct pf_state *, u_int8_t);
|
2005-07-01 16:37:34 +04:00
|
|
|
int pf_src_connlimit(struct pf_state **);
|
2004-11-14 14:12:16 +03:00
|
|
|
int pf_check_congestion(struct ifqueue *);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
struct pf_pool_limit pf_pool_limits[PF_LIMIT_MAX] = {
|
|
|
|
{ &pf_state_pl, PFSTATE_HIWAT },
|
|
|
|
{ &pf_src_tree_pl, PFSNODE_HIWAT },
|
|
|
|
{ &pf_frent_pl, PFFRAG_FRENT_HIWAT }
|
|
|
|
};
|
|
|
|
|
|
|
|
#define STATE_LOOKUP() \
|
|
|
|
do { \
|
|
|
|
if (direction == PF_IN) \
|
2005-07-01 16:37:34 +04:00
|
|
|
*state = pf_find_state_recurse( \
|
2004-06-22 17:52:05 +04:00
|
|
|
kif, &key, PF_EXT_GWY); \
|
|
|
|
else \
|
2005-07-01 16:37:34 +04:00
|
|
|
*state = pf_find_state_recurse( \
|
2004-06-22 17:52:05 +04:00
|
|
|
kif, &key, PF_LAN_EXT); \
|
2005-07-01 16:37:34 +04:00
|
|
|
if (*state == NULL || (*state)->timeout == PFTM_PURGE) \
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP); \
|
|
|
|
if (direction == PF_OUT && \
|
|
|
|
(((*state)->rule.ptr->rt == PF_ROUTETO && \
|
2006-12-04 05:59:35 +03:00
|
|
|
(*state)->rule.ptr->direction == PF_OUT) || \
|
|
|
|
((*state)->rule.ptr->rt == PF_REPLYTO && \
|
|
|
|
(*state)->rule.ptr->direction == PF_IN)) && \
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->rt_kif != NULL && \
|
|
|
|
(*state)->rt_kif != kif) \
|
|
|
|
return (PF_PASS); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define STATE_TRANSLATE(s) \
|
|
|
|
(s)->lan.addr.addr32[0] != (s)->gwy.addr.addr32[0] || \
|
|
|
|
((s)->af == AF_INET6 && \
|
2006-12-04 05:59:35 +03:00
|
|
|
((s)->lan.addr.addr32[1] != (s)->gwy.addr.addr32[1] || \
|
|
|
|
(s)->lan.addr.addr32[2] != (s)->gwy.addr.addr32[2] || \
|
|
|
|
(s)->lan.addr.addr32[3] != (s)->gwy.addr.addr32[3])) || \
|
2004-06-22 17:52:05 +04:00
|
|
|
(s)->lan.port != (s)->gwy.port
|
|
|
|
|
|
|
|
#define BOUND_IFACE(r, k) (((r)->rule_flag & PFRULE_IFBOUND) ? (k) : \
|
|
|
|
((r)->rule_flag & PFRULE_GRBOUND) ? (k)->pfik_parent : \
|
|
|
|
(k)->pfik_parent->pfik_parent)
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
#define STATE_INC_COUNTERS(s) \
|
|
|
|
do { \
|
|
|
|
s->rule.ptr->states++; \
|
|
|
|
if (s->anchor.ptr != NULL) \
|
|
|
|
s->anchor.ptr->states++; \
|
|
|
|
if (s->nat_rule.ptr != NULL) \
|
|
|
|
s->nat_rule.ptr->states++; \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define STATE_DEC_COUNTERS(s) \
|
|
|
|
do { \
|
|
|
|
if (s->nat_rule.ptr != NULL) \
|
|
|
|
s->nat_rule.ptr->states--; \
|
|
|
|
if (s->anchor.ptr != NULL) \
|
|
|
|
s->anchor.ptr->states--; \
|
|
|
|
s->rule.ptr->states--; \
|
|
|
|
} while (0)
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
static __inline int pf_src_compare(struct pf_src_node *, struct pf_src_node *);
|
|
|
|
static __inline int pf_state_compare_lan_ext(struct pf_state *,
|
|
|
|
struct pf_state *);
|
|
|
|
static __inline int pf_state_compare_ext_gwy(struct pf_state *,
|
|
|
|
struct pf_state *);
|
|
|
|
static __inline int pf_state_compare_id(struct pf_state *,
|
|
|
|
struct pf_state *);
|
2004-11-14 14:12:16 +03:00
|
|
|
static __inline int pf_anchor_compare(struct pf_anchor *, struct pf_anchor *);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
struct pf_src_tree tree_src_tracking;
|
|
|
|
|
|
|
|
struct pf_state_tree_id tree_id;
|
|
|
|
struct pf_state_queue state_updates;
|
|
|
|
|
|
|
|
RB_GENERATE(pf_src_tree, pf_src_node, entry, pf_src_compare);
|
|
|
|
RB_GENERATE(pf_state_tree_lan_ext, pf_state,
|
|
|
|
u.s.entry_lan_ext, pf_state_compare_lan_ext);
|
|
|
|
RB_GENERATE(pf_state_tree_ext_gwy, pf_state,
|
|
|
|
u.s.entry_ext_gwy, pf_state_compare_ext_gwy);
|
|
|
|
RB_GENERATE(pf_state_tree_id, pf_state,
|
|
|
|
u.s.entry_id, pf_state_compare_id);
|
2004-11-14 14:12:16 +03:00
|
|
|
RB_GENERATE(pf_anchor_global, pf_anchor, entry_global, pf_anchor_compare);
|
|
|
|
RB_GENERATE(pf_anchor_node, pf_anchor, entry_node, pf_anchor_compare);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
static __inline int
|
|
|
|
pf_src_compare(struct pf_src_node *a, struct pf_src_node *b)
|
|
|
|
{
|
|
|
|
int diff;
|
|
|
|
|
|
|
|
if (a->rule.ptr > b->rule.ptr)
|
|
|
|
return (1);
|
|
|
|
if (a->rule.ptr < b->rule.ptr)
|
|
|
|
return (-1);
|
|
|
|
if ((diff = a->af - b->af) != 0)
|
|
|
|
return (diff);
|
|
|
|
switch (a->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
if (a->addr.addr32[0] > b->addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->addr.addr32[0] < b->addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (a->addr.addr32[3] > b->addr.addr32[3])
|
|
|
|
return (1);
|
|
|
|
if (a->addr.addr32[3] < b->addr.addr32[3])
|
|
|
|
return (-1);
|
|
|
|
if (a->addr.addr32[2] > b->addr.addr32[2])
|
|
|
|
return (1);
|
|
|
|
if (a->addr.addr32[2] < b->addr.addr32[2])
|
|
|
|
return (-1);
|
|
|
|
if (a->addr.addr32[1] > b->addr.addr32[1])
|
|
|
|
return (1);
|
|
|
|
if (a->addr.addr32[1] < b->addr.addr32[1])
|
|
|
|
return (-1);
|
|
|
|
if (a->addr.addr32[0] > b->addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->addr.addr32[0] < b->addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline int
|
|
|
|
pf_state_compare_lan_ext(struct pf_state *a, struct pf_state *b)
|
|
|
|
{
|
|
|
|
int diff;
|
|
|
|
|
|
|
|
if ((diff = a->proto - b->proto) != 0)
|
|
|
|
return (diff);
|
|
|
|
if ((diff = a->af - b->af) != 0)
|
|
|
|
return (diff);
|
|
|
|
switch (a->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
if (a->lan.addr.addr32[0] > b->lan.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->lan.addr.addr32[0] < b->lan.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[0] > b->ext.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[0] < b->ext.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (a->lan.addr.addr32[3] > b->lan.addr.addr32[3])
|
|
|
|
return (1);
|
|
|
|
if (a->lan.addr.addr32[3] < b->lan.addr.addr32[3])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[3] > b->ext.addr.addr32[3])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[3] < b->ext.addr.addr32[3])
|
|
|
|
return (-1);
|
|
|
|
if (a->lan.addr.addr32[2] > b->lan.addr.addr32[2])
|
|
|
|
return (1);
|
|
|
|
if (a->lan.addr.addr32[2] < b->lan.addr.addr32[2])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[2] > b->ext.addr.addr32[2])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[2] < b->ext.addr.addr32[2])
|
|
|
|
return (-1);
|
|
|
|
if (a->lan.addr.addr32[1] > b->lan.addr.addr32[1])
|
|
|
|
return (1);
|
|
|
|
if (a->lan.addr.addr32[1] < b->lan.addr.addr32[1])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[1] > b->ext.addr.addr32[1])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[1] < b->ext.addr.addr32[1])
|
|
|
|
return (-1);
|
|
|
|
if (a->lan.addr.addr32[0] > b->lan.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->lan.addr.addr32[0] < b->lan.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[0] > b->ext.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[0] < b->ext.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((diff = a->lan.port - b->lan.port) != 0)
|
|
|
|
return (diff);
|
|
|
|
if ((diff = a->ext.port - b->ext.port) != 0)
|
|
|
|
return (diff);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline int
|
|
|
|
pf_state_compare_ext_gwy(struct pf_state *a, struct pf_state *b)
|
|
|
|
{
|
|
|
|
int diff;
|
|
|
|
|
|
|
|
if ((diff = a->proto - b->proto) != 0)
|
|
|
|
return (diff);
|
|
|
|
if ((diff = a->af - b->af) != 0)
|
|
|
|
return (diff);
|
|
|
|
switch (a->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
if (a->ext.addr.addr32[0] > b->ext.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[0] < b->ext.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
if (a->gwy.addr.addr32[0] > b->gwy.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->gwy.addr.addr32[0] < b->gwy.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (a->ext.addr.addr32[3] > b->ext.addr.addr32[3])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[3] < b->ext.addr.addr32[3])
|
|
|
|
return (-1);
|
|
|
|
if (a->gwy.addr.addr32[3] > b->gwy.addr.addr32[3])
|
|
|
|
return (1);
|
|
|
|
if (a->gwy.addr.addr32[3] < b->gwy.addr.addr32[3])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[2] > b->ext.addr.addr32[2])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[2] < b->ext.addr.addr32[2])
|
|
|
|
return (-1);
|
|
|
|
if (a->gwy.addr.addr32[2] > b->gwy.addr.addr32[2])
|
|
|
|
return (1);
|
|
|
|
if (a->gwy.addr.addr32[2] < b->gwy.addr.addr32[2])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[1] > b->ext.addr.addr32[1])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[1] < b->ext.addr.addr32[1])
|
|
|
|
return (-1);
|
|
|
|
if (a->gwy.addr.addr32[1] > b->gwy.addr.addr32[1])
|
|
|
|
return (1);
|
|
|
|
if (a->gwy.addr.addr32[1] < b->gwy.addr.addr32[1])
|
|
|
|
return (-1);
|
|
|
|
if (a->ext.addr.addr32[0] > b->ext.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->ext.addr.addr32[0] < b->ext.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
if (a->gwy.addr.addr32[0] > b->gwy.addr.addr32[0])
|
|
|
|
return (1);
|
|
|
|
if (a->gwy.addr.addr32[0] < b->gwy.addr.addr32[0])
|
|
|
|
return (-1);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((diff = a->ext.port - b->ext.port) != 0)
|
|
|
|
return (diff);
|
|
|
|
if ((diff = a->gwy.port - b->gwy.port) != 0)
|
|
|
|
return (diff);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static __inline int
|
|
|
|
pf_state_compare_id(struct pf_state *a, struct pf_state *b)
|
|
|
|
{
|
|
|
|
if (a->id > b->id)
|
|
|
|
return (1);
|
|
|
|
if (a->id < b->id)
|
|
|
|
return (-1);
|
|
|
|
if (a->creatorid > b->creatorid)
|
|
|
|
return (1);
|
|
|
|
if (a->creatorid < b->creatorid)
|
|
|
|
return (-1);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
static __inline int
|
|
|
|
pf_anchor_compare(struct pf_anchor *a, struct pf_anchor *b)
|
|
|
|
{
|
|
|
|
int c = strcmp(a->path, b->path);
|
|
|
|
|
|
|
|
return (c ? (c < 0 ? -1 : 1) : 0);
|
|
|
|
}
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
#ifdef INET6
|
|
|
|
void
|
2006-12-04 05:58:06 +03:00
|
|
|
pf_addrcpy(struct pf_addr *dst, const struct pf_addr *src, sa_family_t af)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
dst->addr32[0] = src->addr32[0];
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
case AF_INET6:
|
|
|
|
dst->addr32[0] = src->addr32[0];
|
|
|
|
dst->addr32[1] = src->addr32[1];
|
|
|
|
dst->addr32[2] = src->addr32[2];
|
|
|
|
dst->addr32[3] = src->addr32[3];
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* INET6 */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
struct pf_state *
|
|
|
|
pf_find_state_byid(struct pf_state *key)
|
|
|
|
{
|
|
|
|
pf_status.fcounters[FCNT_STATE_SEARCH]++;
|
|
|
|
return (RB_FIND(pf_state_tree_id, &tree_id, key));
|
|
|
|
}
|
|
|
|
|
|
|
|
struct pf_state *
|
|
|
|
pf_find_state_recurse(struct pfi_kif *kif, struct pf_state *key, u_int8_t tree)
|
|
|
|
{
|
|
|
|
struct pf_state *s;
|
|
|
|
|
|
|
|
pf_status.fcounters[FCNT_STATE_SEARCH]++;
|
|
|
|
|
|
|
|
switch (tree) {
|
|
|
|
case PF_LAN_EXT:
|
|
|
|
for (; kif != NULL; kif = kif->pfik_parent) {
|
|
|
|
s = RB_FIND(pf_state_tree_lan_ext,
|
|
|
|
&kif->pfik_lan_ext, key);
|
|
|
|
if (s != NULL)
|
|
|
|
return (s);
|
|
|
|
}
|
|
|
|
return (NULL);
|
|
|
|
case PF_EXT_GWY:
|
|
|
|
for (; kif != NULL; kif = kif->pfik_parent) {
|
|
|
|
s = RB_FIND(pf_state_tree_ext_gwy,
|
|
|
|
&kif->pfik_ext_gwy, key);
|
|
|
|
if (s != NULL)
|
|
|
|
return (s);
|
|
|
|
}
|
|
|
|
return (NULL);
|
|
|
|
default:
|
|
|
|
panic("pf_find_state_recurse");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
struct pf_state *
|
|
|
|
pf_find_state_all(struct pf_state *key, u_int8_t tree, int *more)
|
|
|
|
{
|
|
|
|
struct pf_state *s, *ss = NULL;
|
|
|
|
struct pfi_kif *kif;
|
|
|
|
|
|
|
|
pf_status.fcounters[FCNT_STATE_SEARCH]++;
|
|
|
|
|
|
|
|
switch (tree) {
|
|
|
|
case PF_LAN_EXT:
|
|
|
|
TAILQ_FOREACH(kif, &pfi_statehead, pfik_w_states) {
|
|
|
|
s = RB_FIND(pf_state_tree_lan_ext,
|
|
|
|
&kif->pfik_lan_ext, key);
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
if (more == NULL)
|
|
|
|
return (s);
|
|
|
|
ss = s;
|
|
|
|
(*more)++;
|
|
|
|
}
|
|
|
|
return (ss);
|
|
|
|
case PF_EXT_GWY:
|
|
|
|
TAILQ_FOREACH(kif, &pfi_statehead, pfik_w_states) {
|
|
|
|
s = RB_FIND(pf_state_tree_ext_gwy,
|
|
|
|
&kif->pfik_ext_gwy, key);
|
|
|
|
if (s == NULL)
|
|
|
|
continue;
|
|
|
|
if (more == NULL)
|
|
|
|
return (s);
|
|
|
|
ss = s;
|
|
|
|
(*more)++;
|
|
|
|
}
|
|
|
|
return (ss);
|
|
|
|
default:
|
|
|
|
panic("pf_find_state_all");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
void
|
|
|
|
pf_init_threshold(struct pf_threshold *threshold,
|
|
|
|
u_int32_t limit, u_int32_t seconds)
|
|
|
|
{
|
|
|
|
threshold->limit = limit * PF_THRESHOLD_MULT;
|
|
|
|
threshold->seconds = seconds;
|
|
|
|
threshold->count = 0;
|
|
|
|
threshold->last = time_second;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_add_threshold(struct pf_threshold *threshold)
|
|
|
|
{
|
|
|
|
u_int32_t t = time_second, diff = t - threshold->last;
|
|
|
|
|
|
|
|
if (diff >= threshold->seconds)
|
|
|
|
threshold->count = 0;
|
|
|
|
else
|
|
|
|
threshold->count -= threshold->count * diff /
|
|
|
|
threshold->seconds;
|
|
|
|
threshold->count += PF_THRESHOLD_MULT;
|
|
|
|
threshold->last = t;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_check_threshold(struct pf_threshold *threshold)
|
|
|
|
{
|
|
|
|
return (threshold->count > threshold->limit);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_src_connlimit(struct pf_state **state)
|
|
|
|
{
|
|
|
|
struct pf_state *s;
|
|
|
|
int bad = 0;
|
|
|
|
|
|
|
|
(*state)->src_node->conn++;
|
|
|
|
pf_add_threshold(&(*state)->src_node->conn_rate);
|
|
|
|
|
|
|
|
if ((*state)->rule.ptr->max_src_conn &&
|
|
|
|
(*state)->rule.ptr->max_src_conn <
|
|
|
|
(*state)->src_node->conn) {
|
|
|
|
pf_status.lcounters[LCNT_SRCCONN]++;
|
|
|
|
bad++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((*state)->rule.ptr->max_src_conn_rate.limit &&
|
|
|
|
pf_check_threshold(&(*state)->src_node->conn_rate)) {
|
|
|
|
pf_status.lcounters[LCNT_SRCCONNRATE]++;
|
|
|
|
bad++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!bad)
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
if ((*state)->rule.ptr->overload_tbl) {
|
|
|
|
struct pfr_addr p;
|
|
|
|
u_int32_t killed = 0;
|
|
|
|
|
|
|
|
pf_status.lcounters[LCNT_OVERLOAD_TABLE]++;
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf_src_connlimit: blocking address ");
|
|
|
|
pf_print_host(&(*state)->src_node->addr, 0,
|
|
|
|
(*state)->af);
|
|
|
|
}
|
|
|
|
|
|
|
|
bzero(&p, sizeof(p));
|
|
|
|
p.pfra_af = (*state)->af;
|
|
|
|
switch ((*state)->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
p.pfra_net = 32;
|
|
|
|
p.pfra_ip4addr = (*state)->src_node->addr.v4;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
p.pfra_net = 128;
|
|
|
|
p.pfra_ip6addr = (*state)->src_node->addr.v6;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
pfr_insert_kentry((*state)->rule.ptr->overload_tbl,
|
|
|
|
&p, time_second);
|
|
|
|
|
|
|
|
/* kill existing states if that's required. */
|
|
|
|
if ((*state)->rule.ptr->flush) {
|
|
|
|
pf_status.lcounters[LCNT_OVERLOAD_FLUSH]++;
|
|
|
|
|
|
|
|
RB_FOREACH(s, pf_state_tree_id, &tree_id) {
|
|
|
|
/*
|
|
|
|
* Kill states from this source. (Only those
|
|
|
|
* from the same rule if PF_FLUSH_GLOBAL is not
|
|
|
|
* set)
|
|
|
|
*/
|
|
|
|
if (s->af == (*state)->af &&
|
|
|
|
(((*state)->direction == PF_OUT &&
|
|
|
|
PF_AEQ(&(*state)->src_node->addr,
|
|
|
|
&s->lan.addr, s->af)) ||
|
|
|
|
((*state)->direction == PF_IN &&
|
|
|
|
PF_AEQ(&(*state)->src_node->addr,
|
|
|
|
&s->ext.addr, s->af))) &&
|
|
|
|
((*state)->rule.ptr->flush &
|
|
|
|
PF_FLUSH_GLOBAL ||
|
|
|
|
(*state)->rule.ptr == s->rule.ptr)) {
|
|
|
|
s->timeout = PFTM_PURGE;
|
|
|
|
s->src.state = s->dst.state =
|
|
|
|
TCPS_CLOSED;
|
|
|
|
killed++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC)
|
|
|
|
printf(", %u states killed", killed);
|
|
|
|
}
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC)
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
/* kill this state */
|
|
|
|
(*state)->timeout = PFTM_PURGE;
|
|
|
|
(*state)->src.state = (*state)->dst.state = TCPS_CLOSED;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
int
|
|
|
|
pf_insert_src_node(struct pf_src_node **sn, struct pf_rule *rule,
|
|
|
|
struct pf_addr *src, sa_family_t af)
|
|
|
|
{
|
|
|
|
struct pf_src_node k;
|
|
|
|
|
|
|
|
if (*sn == NULL) {
|
|
|
|
k.af = af;
|
|
|
|
PF_ACPY(&k.addr, src, af);
|
|
|
|
if (rule->rule_flag & PFRULE_RULESRCTRACK ||
|
|
|
|
rule->rpool.opts & PF_POOL_STICKYADDR)
|
|
|
|
k.rule.ptr = rule;
|
|
|
|
else
|
|
|
|
k.rule.ptr = NULL;
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_SEARCH]++;
|
|
|
|
*sn = RB_FIND(pf_src_tree, &tree_src_tracking, &k);
|
|
|
|
}
|
|
|
|
if (*sn == NULL) {
|
|
|
|
if (!rule->max_src_nodes ||
|
|
|
|
rule->src_nodes < rule->max_src_nodes)
|
|
|
|
(*sn) = pool_get(&pf_src_tree_pl, PR_NOWAIT);
|
2005-07-01 16:37:34 +04:00
|
|
|
else
|
|
|
|
pf_status.lcounters[LCNT_SRCNODES]++;
|
2004-06-22 17:52:05 +04:00
|
|
|
if ((*sn) == NULL)
|
|
|
|
return (-1);
|
|
|
|
bzero(*sn, sizeof(struct pf_src_node));
|
2005-07-01 16:37:34 +04:00
|
|
|
|
|
|
|
pf_init_threshold(&(*sn)->conn_rate,
|
|
|
|
rule->max_src_conn_rate.limit,
|
|
|
|
rule->max_src_conn_rate.seconds);
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
(*sn)->af = af;
|
|
|
|
if (rule->rule_flag & PFRULE_RULESRCTRACK ||
|
|
|
|
rule->rpool.opts & PF_POOL_STICKYADDR)
|
|
|
|
(*sn)->rule.ptr = rule;
|
|
|
|
else
|
|
|
|
(*sn)->rule.ptr = NULL;
|
|
|
|
PF_ACPY(&(*sn)->addr, src, af);
|
|
|
|
if (RB_INSERT(pf_src_tree,
|
|
|
|
&tree_src_tracking, *sn) != NULL) {
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: src_tree insert failed: ");
|
|
|
|
pf_print_host(&(*sn)->addr, 0, af);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
pool_put(&pf_src_tree_pl, *sn);
|
|
|
|
return (-1);
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
(*sn)->creation = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
(*sn)->ruletype = rule->action;
|
|
|
|
if ((*sn)->rule.ptr != NULL)
|
|
|
|
(*sn)->rule.ptr->src_nodes++;
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_INSERT]++;
|
|
|
|
pf_status.src_nodes++;
|
|
|
|
} else {
|
|
|
|
if (rule->max_src_states &&
|
2005-07-01 16:37:34 +04:00
|
|
|
(*sn)->states >= rule->max_src_states) {
|
|
|
|
pf_status.lcounters[LCNT_SRCSTATES]++;
|
2004-06-22 17:52:05 +04:00
|
|
|
return (-1);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_insert_state(struct pfi_kif *kif, struct pf_state *state)
|
|
|
|
{
|
|
|
|
/* Thou MUST NOT insert multiple duplicate keys */
|
|
|
|
state->u.s.kif = kif;
|
|
|
|
if (RB_INSERT(pf_state_tree_lan_ext, &kif->pfik_lan_ext, state)) {
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: state insert failed: tree_lan_ext");
|
|
|
|
printf(" lan: ");
|
|
|
|
pf_print_host(&state->lan.addr, state->lan.port,
|
|
|
|
state->af);
|
|
|
|
printf(" gwy: ");
|
|
|
|
pf_print_host(&state->gwy.addr, state->gwy.port,
|
|
|
|
state->af);
|
|
|
|
printf(" ext: ");
|
|
|
|
pf_print_host(&state->ext.addr, state->ext.port,
|
|
|
|
state->af);
|
|
|
|
if (state->sync_flags & PFSTATE_FROMSYNC)
|
|
|
|
printf(" (from sync)");
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (RB_INSERT(pf_state_tree_ext_gwy, &kif->pfik_ext_gwy, state)) {
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: state insert failed: tree_ext_gwy");
|
|
|
|
printf(" lan: ");
|
|
|
|
pf_print_host(&state->lan.addr, state->lan.port,
|
|
|
|
state->af);
|
|
|
|
printf(" gwy: ");
|
|
|
|
pf_print_host(&state->gwy.addr, state->gwy.port,
|
|
|
|
state->af);
|
|
|
|
printf(" ext: ");
|
|
|
|
pf_print_host(&state->ext.addr, state->ext.port,
|
|
|
|
state->af);
|
|
|
|
if (state->sync_flags & PFSTATE_FROMSYNC)
|
|
|
|
printf(" (from sync)");
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
RB_REMOVE(pf_state_tree_lan_ext, &kif->pfik_lan_ext, state);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (state->id == 0 && state->creatorid == 0) {
|
|
|
|
state->id = htobe64(pf_status.stateid++);
|
|
|
|
state->creatorid = pf_status.hostid;
|
|
|
|
}
|
|
|
|
if (RB_INSERT(pf_state_tree_id, &tree_id, state) != NULL) {
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
printf("pf: state insert failed: "
|
|
|
|
"id: %016llx creatorid: %08x",
|
|
|
|
betoh64(state->id), ntohl(state->creatorid));
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
printf("pf: state insert failed: "
|
2004-06-22 22:37:49 +04:00
|
|
|
"id: %016" PRIx64 " creatorid: %08x",
|
2004-06-22 18:17:07 +04:00
|
|
|
be64toh(state->id), ntohl(state->creatorid));
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
if (state->sync_flags & PFSTATE_FROMSYNC)
|
|
|
|
printf(" (from sync)");
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
RB_REMOVE(pf_state_tree_lan_ext, &kif->pfik_lan_ext, state);
|
|
|
|
RB_REMOVE(pf_state_tree_ext_gwy, &kif->pfik_ext_gwy, state);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
TAILQ_INSERT_HEAD(&state_updates, state, u.s.entry_updates);
|
|
|
|
|
|
|
|
pf_status.fcounters[FCNT_STATE_INSERT]++;
|
|
|
|
pf_status.states++;
|
|
|
|
pfi_attach_state(kif);
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_insert_state(state);
|
|
|
|
#endif
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_purge_timeout(void *arg)
|
|
|
|
{
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
struct timeout *to = arg;
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
struct callout *to = arg;
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
int s;
|
|
|
|
|
|
|
|
s = splsoftnet();
|
|
|
|
pf_purge_expired_states();
|
|
|
|
pf_purge_expired_fragments();
|
|
|
|
pf_purge_expired_src_nodes();
|
|
|
|
splx(s);
|
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
timeout_add(to, pf_default_rule.timeout[PFTM_INTERVAL] * hz);
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
callout_schedule(to, pf_default_rule.timeout[PFTM_INTERVAL] * hz);
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
u_int32_t
|
|
|
|
pf_state_expires(const struct pf_state *state)
|
|
|
|
{
|
|
|
|
u_int32_t timeout;
|
|
|
|
u_int32_t start;
|
|
|
|
u_int32_t end;
|
|
|
|
u_int32_t states;
|
|
|
|
|
|
|
|
/* handle all PFTM_* > PFTM_MAX here */
|
|
|
|
if (state->timeout == PFTM_PURGE)
|
2004-11-14 14:12:16 +03:00
|
|
|
return (time_second);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (state->timeout == PFTM_UNTIL_PACKET)
|
|
|
|
return (0);
|
|
|
|
KASSERT(state->timeout < PFTM_MAX);
|
|
|
|
timeout = state->rule.ptr->timeout[state->timeout];
|
|
|
|
if (!timeout)
|
|
|
|
timeout = pf_default_rule.timeout[state->timeout];
|
|
|
|
start = state->rule.ptr->timeout[PFTM_ADAPTIVE_START];
|
|
|
|
if (start) {
|
|
|
|
end = state->rule.ptr->timeout[PFTM_ADAPTIVE_END];
|
|
|
|
states = state->rule.ptr->states;
|
|
|
|
} else {
|
|
|
|
start = pf_default_rule.timeout[PFTM_ADAPTIVE_START];
|
|
|
|
end = pf_default_rule.timeout[PFTM_ADAPTIVE_END];
|
|
|
|
states = pf_status.states;
|
|
|
|
}
|
|
|
|
if (end && states > start && start < end) {
|
|
|
|
if (states < end)
|
|
|
|
return (state->expire + timeout * (end - states) /
|
|
|
|
(end - start));
|
|
|
|
else
|
2004-11-14 14:12:16 +03:00
|
|
|
return (time_second);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
return (state->expire + timeout);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_purge_expired_src_nodes(void)
|
|
|
|
{
|
|
|
|
struct pf_src_node *cur, *next;
|
|
|
|
|
|
|
|
for (cur = RB_MIN(pf_src_tree, &tree_src_tracking); cur; cur = next) {
|
|
|
|
next = RB_NEXT(pf_src_tree, &tree_src_tracking, cur);
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if (cur->states <= 0 && cur->expire <= time_second) {
|
2004-06-22 17:52:05 +04:00
|
|
|
if (cur->rule.ptr != NULL) {
|
|
|
|
cur->rule.ptr->src_nodes--;
|
|
|
|
if (cur->rule.ptr->states <= 0 &&
|
|
|
|
cur->rule.ptr->max_src_nodes <= 0)
|
|
|
|
pf_rm_rule(NULL, cur->rule.ptr);
|
|
|
|
}
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, cur);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, cur);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_src_tree_remove_state(struct pf_state *s)
|
|
|
|
{
|
|
|
|
u_int32_t timeout;
|
|
|
|
|
|
|
|
if (s->src_node != NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (s->proto == IPPROTO_TCP) {
|
|
|
|
if (s->src.state == PF_TCPS_PROXY_DST ||
|
|
|
|
s->timeout >= PFTM_TCP_ESTABLISHED)
|
|
|
|
--s->src_node->conn;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
if (--s->src_node->states <= 0) {
|
|
|
|
timeout = s->rule.ptr->timeout[PFTM_SRC_NODE];
|
|
|
|
if (!timeout)
|
|
|
|
timeout =
|
|
|
|
pf_default_rule.timeout[PFTM_SRC_NODE];
|
2004-11-14 14:12:16 +03:00
|
|
|
s->src_node->expire = time_second + timeout;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (s->nat_src_node != s->src_node && s->nat_src_node != NULL) {
|
|
|
|
if (--s->nat_src_node->states <= 0) {
|
|
|
|
timeout = s->rule.ptr->timeout[PFTM_SRC_NODE];
|
|
|
|
if (!timeout)
|
|
|
|
timeout =
|
|
|
|
pf_default_rule.timeout[PFTM_SRC_NODE];
|
2004-11-14 14:12:16 +03:00
|
|
|
s->nat_src_node->expire = time_second + timeout;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
s->src_node = s->nat_src_node = NULL;
|
|
|
|
}
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
void
|
|
|
|
pf_purge_expired_state(struct pf_state *cur)
|
|
|
|
{
|
|
|
|
if (cur->src.state == PF_TCPS_PROXY_DST)
|
|
|
|
pf_send_tcp(cur->rule.ptr, cur->af,
|
|
|
|
&cur->ext.addr, &cur->lan.addr,
|
|
|
|
cur->ext.port, cur->lan.port,
|
|
|
|
cur->src.seqhi, cur->src.seqlo + 1,
|
2006-10-08 01:45:49 +04:00
|
|
|
TH_RST|TH_ACK, 0, 0, 0, 1, cur->tag, NULL, NULL);
|
2004-11-14 14:12:16 +03:00
|
|
|
RB_REMOVE(pf_state_tree_ext_gwy,
|
|
|
|
&cur->u.s.kif->pfik_ext_gwy, cur);
|
|
|
|
RB_REMOVE(pf_state_tree_lan_ext,
|
|
|
|
&cur->u.s.kif->pfik_lan_ext, cur);
|
|
|
|
RB_REMOVE(pf_state_tree_id, &tree_id, cur);
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_delete_state(cur);
|
|
|
|
#endif
|
|
|
|
pf_src_tree_remove_state(cur);
|
|
|
|
if (--cur->rule.ptr->states <= 0 &&
|
|
|
|
cur->rule.ptr->src_nodes <= 0)
|
|
|
|
pf_rm_rule(NULL, cur->rule.ptr);
|
|
|
|
if (cur->nat_rule.ptr != NULL)
|
|
|
|
if (--cur->nat_rule.ptr->states <= 0 &&
|
|
|
|
cur->nat_rule.ptr->src_nodes <= 0)
|
|
|
|
pf_rm_rule(NULL, cur->nat_rule.ptr);
|
|
|
|
if (cur->anchor.ptr != NULL)
|
|
|
|
if (--cur->anchor.ptr->states <= 0)
|
|
|
|
pf_rm_rule(NULL, cur->anchor.ptr);
|
|
|
|
pf_normalize_tcp_cleanup(cur);
|
|
|
|
pfi_detach_state(cur->u.s.kif);
|
|
|
|
TAILQ_REMOVE(&state_updates, cur, u.s.entry_updates);
|
2005-07-01 16:37:34 +04:00
|
|
|
if (cur->tag)
|
|
|
|
pf_tag_unref(cur->tag);
|
2004-11-14 14:12:16 +03:00
|
|
|
pool_put(&pf_state_pl, cur);
|
|
|
|
pf_status.fcounters[FCNT_STATE_REMOVALS]++;
|
|
|
|
pf_status.states--;
|
|
|
|
}
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
void
|
|
|
|
pf_purge_expired_states(void)
|
|
|
|
{
|
|
|
|
struct pf_state *cur, *next;
|
|
|
|
|
|
|
|
for (cur = RB_MIN(pf_state_tree_id, &tree_id);
|
|
|
|
cur; cur = next) {
|
|
|
|
next = RB_NEXT(pf_state_tree_id, &tree_id, cur);
|
2004-11-14 14:12:16 +03:00
|
|
|
if (pf_state_expires(cur) <= time_second)
|
|
|
|
pf_purge_expired_state(cur);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_tbladdr_setup(struct pf_ruleset *rs, struct pf_addr_wrap *aw)
|
|
|
|
{
|
|
|
|
if (aw->type != PF_ADDR_TABLE)
|
|
|
|
return (0);
|
|
|
|
if ((aw->p.tbl = pfr_attach_table(rs, aw->v.tblname)) == NULL)
|
|
|
|
return (1);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_tbladdr_remove(struct pf_addr_wrap *aw)
|
|
|
|
{
|
|
|
|
if (aw->type != PF_ADDR_TABLE || aw->p.tbl == NULL)
|
|
|
|
return;
|
|
|
|
pfr_detach_table(aw->p.tbl);
|
|
|
|
aw->p.tbl = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_tbladdr_copyout(struct pf_addr_wrap *aw)
|
|
|
|
{
|
|
|
|
struct pfr_ktable *kt = aw->p.tbl;
|
|
|
|
|
|
|
|
if (aw->type != PF_ADDR_TABLE || kt == NULL)
|
|
|
|
return;
|
|
|
|
if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
|
|
|
|
kt = kt->pfrkt_root;
|
|
|
|
aw->p.tbl = NULL;
|
|
|
|
aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
|
|
|
|
kt->pfrkt_cnt : -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_print_host(struct pf_addr *addr, u_int16_t p, sa_family_t af)
|
|
|
|
{
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET: {
|
|
|
|
u_int32_t a = ntohl(addr->addr32[0]);
|
|
|
|
printf("%u.%u.%u.%u", (a>>24)&255, (a>>16)&255,
|
|
|
|
(a>>8)&255, a&255);
|
|
|
|
if (p) {
|
|
|
|
p = ntohs(p);
|
|
|
|
printf(":%u", p);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6: {
|
|
|
|
u_int16_t b;
|
|
|
|
u_int8_t i, curstart = 255, curend = 0,
|
2005-07-01 16:37:34 +04:00
|
|
|
maxstart = 255, maxend = 255;
|
2004-06-22 17:52:05 +04:00
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
if (!addr->addr16[i]) {
|
|
|
|
if (curstart == 255)
|
|
|
|
curstart = i;
|
|
|
|
else
|
|
|
|
curend = i;
|
|
|
|
} else {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (curstart != 255) {
|
2004-06-22 17:52:05 +04:00
|
|
|
if ((curend - curstart) >
|
|
|
|
(maxend - maxstart)) {
|
|
|
|
maxstart = curstart;
|
|
|
|
maxend = curend;
|
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
curstart = 255;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (i = 0; i < 8; i++) {
|
|
|
|
if (i >= maxstart && i <= maxend) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (maxstart == 0) {
|
|
|
|
if (i < 2)
|
|
|
|
printf(":");
|
|
|
|
} else if (maxend != 7) {
|
2004-06-22 17:52:05 +04:00
|
|
|
if (i == maxstart)
|
|
|
|
printf(":");
|
|
|
|
} else {
|
|
|
|
if (i == maxend)
|
|
|
|
printf(":");
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
b = ntohs(addr->addr16[i]);
|
|
|
|
printf("%x", b);
|
|
|
|
if (i < 7)
|
|
|
|
printf(":");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (p) {
|
|
|
|
p = ntohs(p);
|
|
|
|
printf("[%u]", p);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_print_state(struct pf_state *s)
|
|
|
|
{
|
|
|
|
switch (s->proto) {
|
|
|
|
case IPPROTO_TCP:
|
|
|
|
printf("TCP ");
|
|
|
|
break;
|
|
|
|
case IPPROTO_UDP:
|
|
|
|
printf("UDP ");
|
|
|
|
break;
|
|
|
|
case IPPROTO_ICMP:
|
|
|
|
printf("ICMP ");
|
|
|
|
break;
|
|
|
|
case IPPROTO_ICMPV6:
|
|
|
|
printf("ICMPV6 ");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("%u ", s->proto);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
pf_print_host(&s->lan.addr, s->lan.port, s->af);
|
|
|
|
printf(" ");
|
|
|
|
pf_print_host(&s->gwy.addr, s->gwy.port, s->af);
|
|
|
|
printf(" ");
|
|
|
|
pf_print_host(&s->ext.addr, s->ext.port, s->af);
|
|
|
|
printf(" [lo=%u high=%u win=%u modulator=%u", s->src.seqlo,
|
|
|
|
s->src.seqhi, s->src.max_win, s->src.seqdiff);
|
|
|
|
if (s->src.wscale && s->dst.wscale)
|
|
|
|
printf(" wscale=%u", s->src.wscale & PF_WSCALE_MASK);
|
|
|
|
printf("]");
|
|
|
|
printf(" [lo=%u high=%u win=%u modulator=%u", s->dst.seqlo,
|
|
|
|
s->dst.seqhi, s->dst.max_win, s->dst.seqdiff);
|
|
|
|
if (s->src.wscale && s->dst.wscale)
|
|
|
|
printf(" wscale=%u", s->dst.wscale & PF_WSCALE_MASK);
|
|
|
|
printf("]");
|
|
|
|
printf(" %u:%u", s->src.state, s->dst.state);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_print_flags(u_int8_t f)
|
|
|
|
{
|
|
|
|
if (f)
|
|
|
|
printf(" ");
|
|
|
|
if (f & TH_FIN)
|
|
|
|
printf("F");
|
|
|
|
if (f & TH_SYN)
|
|
|
|
printf("S");
|
|
|
|
if (f & TH_RST)
|
|
|
|
printf("R");
|
|
|
|
if (f & TH_PUSH)
|
|
|
|
printf("P");
|
|
|
|
if (f & TH_ACK)
|
|
|
|
printf("A");
|
|
|
|
if (f & TH_URG)
|
|
|
|
printf("U");
|
|
|
|
if (f & TH_ECE)
|
|
|
|
printf("E");
|
|
|
|
if (f & TH_CWR)
|
|
|
|
printf("W");
|
|
|
|
}
|
|
|
|
|
|
|
|
#define PF_SET_SKIP_STEPS(i) \
|
|
|
|
do { \
|
|
|
|
while (head[i] != cur) { \
|
|
|
|
head[i]->skip[i].ptr = cur; \
|
|
|
|
head[i] = TAILQ_NEXT(head[i], entries); \
|
|
|
|
} \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_calc_skip_steps(struct pf_rulequeue *rules)
|
|
|
|
{
|
|
|
|
struct pf_rule *cur, *prev, *head[PF_SKIP_COUNT];
|
|
|
|
int i;
|
|
|
|
|
|
|
|
cur = TAILQ_FIRST(rules);
|
|
|
|
prev = cur;
|
|
|
|
for (i = 0; i < PF_SKIP_COUNT; ++i)
|
|
|
|
head[i] = cur;
|
|
|
|
while (cur != NULL) {
|
|
|
|
|
|
|
|
if (cur->kif != prev->kif || cur->ifnot != prev->ifnot)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_IFP);
|
|
|
|
if (cur->direction != prev->direction)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_DIR);
|
|
|
|
if (cur->af != prev->af)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_AF);
|
|
|
|
if (cur->proto != prev->proto)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_PROTO);
|
2004-11-14 14:12:16 +03:00
|
|
|
if (cur->src.neg != prev->src.neg ||
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_addr_wrap_neq(&cur->src.addr, &prev->src.addr))
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_SRC_ADDR);
|
|
|
|
if (cur->src.port[0] != prev->src.port[0] ||
|
|
|
|
cur->src.port[1] != prev->src.port[1] ||
|
|
|
|
cur->src.port_op != prev->src.port_op)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_SRC_PORT);
|
2004-11-14 14:12:16 +03:00
|
|
|
if (cur->dst.neg != prev->dst.neg ||
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_addr_wrap_neq(&cur->dst.addr, &prev->dst.addr))
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_DST_ADDR);
|
|
|
|
if (cur->dst.port[0] != prev->dst.port[0] ||
|
|
|
|
cur->dst.port[1] != prev->dst.port[1] ||
|
|
|
|
cur->dst.port_op != prev->dst.port_op)
|
|
|
|
PF_SET_SKIP_STEPS(PF_SKIP_DST_PORT);
|
|
|
|
|
|
|
|
prev = cur;
|
|
|
|
cur = TAILQ_NEXT(cur, entries);
|
|
|
|
}
|
|
|
|
for (i = 0; i < PF_SKIP_COUNT; ++i)
|
|
|
|
PF_SET_SKIP_STEPS(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_addr_wrap_neq(struct pf_addr_wrap *aw1, struct pf_addr_wrap *aw2)
|
|
|
|
{
|
|
|
|
if (aw1->type != aw2->type)
|
|
|
|
return (1);
|
|
|
|
switch (aw1->type) {
|
|
|
|
case PF_ADDR_ADDRMASK:
|
|
|
|
if (PF_ANEQ(&aw1->v.a.addr, &aw2->v.a.addr, 0))
|
|
|
|
return (1);
|
|
|
|
if (PF_ANEQ(&aw1->v.a.mask, &aw2->v.a.mask, 0))
|
|
|
|
return (1);
|
|
|
|
return (0);
|
|
|
|
case PF_ADDR_DYNIFTL:
|
|
|
|
return (aw1->p.dyn->pfid_kt != aw2->p.dyn->pfid_kt);
|
|
|
|
case PF_ADDR_NOROUTE:
|
|
|
|
return (0);
|
|
|
|
case PF_ADDR_TABLE:
|
|
|
|
return (aw1->p.tbl != aw2->p.tbl);
|
|
|
|
default:
|
|
|
|
printf("invalid address type: %d\n", aw1->type);
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
u_int16_t
|
|
|
|
pf_cksum_fixup(u_int16_t cksum, u_int16_t old, u_int16_t new, u_int8_t udp)
|
|
|
|
{
|
|
|
|
u_int32_t l;
|
|
|
|
|
|
|
|
if (udp && !cksum)
|
|
|
|
return (0x0000);
|
|
|
|
l = cksum + old - new;
|
|
|
|
l = (l >> 16) + (l & 65535);
|
|
|
|
l = l & 65535;
|
|
|
|
if (udp && !l)
|
|
|
|
return (0xFFFF);
|
|
|
|
return (l);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_change_ap(struct pf_addr *a, u_int16_t *p, u_int16_t *ic, u_int16_t *pc,
|
|
|
|
struct pf_addr *an, u_int16_t pn, u_int8_t u, sa_family_t af)
|
|
|
|
{
|
|
|
|
struct pf_addr ao;
|
|
|
|
u_int16_t po = *p;
|
|
|
|
|
|
|
|
PF_ACPY(&ao, a, af);
|
|
|
|
PF_ACPY(a, an, af);
|
|
|
|
|
|
|
|
*p = pn;
|
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
*ic = pf_cksum_fixup(pf_cksum_fixup(*ic,
|
|
|
|
ao.addr16[0], an->addr16[0], 0),
|
|
|
|
ao.addr16[1], an->addr16[1], 0);
|
|
|
|
*p = pn;
|
|
|
|
*pc = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(*pc,
|
|
|
|
ao.addr16[0], an->addr16[0], u),
|
|
|
|
ao.addr16[1], an->addr16[1], u),
|
|
|
|
po, pn, u);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
*pc = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(*pc,
|
|
|
|
ao.addr16[0], an->addr16[0], u),
|
|
|
|
ao.addr16[1], an->addr16[1], u),
|
|
|
|
ao.addr16[2], an->addr16[2], u),
|
|
|
|
ao.addr16[3], an->addr16[3], u),
|
|
|
|
ao.addr16[4], an->addr16[4], u),
|
|
|
|
ao.addr16[5], an->addr16[5], u),
|
|
|
|
ao.addr16[6], an->addr16[6], u),
|
|
|
|
ao.addr16[7], an->addr16[7], u),
|
|
|
|
po, pn, u);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
/* Changes a u_int32_t. Uses a void *so there are no align restrictions */
|
2004-06-22 17:52:05 +04:00
|
|
|
void
|
|
|
|
pf_change_a(void *a, u_int16_t *c, u_int32_t an, u_int8_t u)
|
|
|
|
{
|
|
|
|
u_int32_t ao;
|
|
|
|
|
|
|
|
memcpy(&ao, a, sizeof(ao));
|
|
|
|
memcpy(a, &an, sizeof(u_int32_t));
|
|
|
|
*c = pf_cksum_fixup(pf_cksum_fixup(*c, ao / 65536, an / 65536, u),
|
|
|
|
ao % 65536, an % 65536, u);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
void
|
|
|
|
pf_change_a6(struct pf_addr *a, u_int16_t *c, struct pf_addr *an, u_int8_t u)
|
|
|
|
{
|
|
|
|
struct pf_addr ao;
|
|
|
|
|
|
|
|
PF_ACPY(&ao, a, AF_INET6);
|
|
|
|
PF_ACPY(a, an, AF_INET6);
|
|
|
|
|
|
|
|
*c = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(*c,
|
|
|
|
ao.addr16[0], an->addr16[0], u),
|
|
|
|
ao.addr16[1], an->addr16[1], u),
|
|
|
|
ao.addr16[2], an->addr16[2], u),
|
|
|
|
ao.addr16[3], an->addr16[3], u),
|
|
|
|
ao.addr16[4], an->addr16[4], u),
|
|
|
|
ao.addr16[5], an->addr16[5], u),
|
|
|
|
ao.addr16[6], an->addr16[6], u),
|
|
|
|
ao.addr16[7], an->addr16[7], u);
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_change_icmp(struct pf_addr *ia, u_int16_t *ip, struct pf_addr *oa,
|
|
|
|
struct pf_addr *na, u_int16_t np, u_int16_t *pc, u_int16_t *h2c,
|
|
|
|
u_int16_t *ic, u_int16_t *hc, u_int8_t u, sa_family_t af)
|
|
|
|
{
|
|
|
|
struct pf_addr oia, ooa;
|
|
|
|
|
|
|
|
PF_ACPY(&oia, ia, af);
|
|
|
|
PF_ACPY(&ooa, oa, af);
|
|
|
|
|
|
|
|
/* Change inner protocol port, fix inner protocol checksum. */
|
|
|
|
if (ip != NULL) {
|
|
|
|
u_int16_t oip = *ip;
|
2004-06-22 18:17:07 +04:00
|
|
|
u_int32_t opc = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
if (pc != NULL)
|
|
|
|
opc = *pc;
|
|
|
|
*ip = np;
|
|
|
|
if (pc != NULL)
|
|
|
|
*pc = pf_cksum_fixup(*pc, oip, *ip, u);
|
|
|
|
*ic = pf_cksum_fixup(*ic, oip, *ip, 0);
|
|
|
|
if (pc != NULL)
|
|
|
|
*ic = pf_cksum_fixup(*ic, opc, *pc, 0);
|
|
|
|
}
|
|
|
|
/* Change inner ip address, fix inner ip and icmp checksums. */
|
|
|
|
PF_ACPY(ia, na, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET: {
|
|
|
|
u_int32_t oh2c = *h2c;
|
|
|
|
|
|
|
|
*h2c = pf_cksum_fixup(pf_cksum_fixup(*h2c,
|
|
|
|
oia.addr16[0], ia->addr16[0], 0),
|
|
|
|
oia.addr16[1], ia->addr16[1], 0);
|
|
|
|
*ic = pf_cksum_fixup(pf_cksum_fixup(*ic,
|
|
|
|
oia.addr16[0], ia->addr16[0], 0),
|
|
|
|
oia.addr16[1], ia->addr16[1], 0);
|
|
|
|
*ic = pf_cksum_fixup(*ic, oh2c, *h2c, 0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
*ic = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(*ic,
|
|
|
|
oia.addr16[0], ia->addr16[0], u),
|
|
|
|
oia.addr16[1], ia->addr16[1], u),
|
|
|
|
oia.addr16[2], ia->addr16[2], u),
|
|
|
|
oia.addr16[3], ia->addr16[3], u),
|
|
|
|
oia.addr16[4], ia->addr16[4], u),
|
|
|
|
oia.addr16[5], ia->addr16[5], u),
|
|
|
|
oia.addr16[6], ia->addr16[6], u),
|
|
|
|
oia.addr16[7], ia->addr16[7], u);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
/* Change outer ip address, fix outer ip or icmpv6 checksum. */
|
|
|
|
PF_ACPY(oa, na, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
*hc = pf_cksum_fixup(pf_cksum_fixup(*hc,
|
|
|
|
ooa.addr16[0], oa->addr16[0], 0),
|
|
|
|
ooa.addr16[1], oa->addr16[1], 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
*ic = pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(pf_cksum_fixup(
|
|
|
|
pf_cksum_fixup(pf_cksum_fixup(*ic,
|
|
|
|
ooa.addr16[0], oa->addr16[0], u),
|
|
|
|
ooa.addr16[1], oa->addr16[1], u),
|
|
|
|
ooa.addr16[2], oa->addr16[2], u),
|
|
|
|
ooa.addr16[3], oa->addr16[3], u),
|
|
|
|
ooa.addr16[4], oa->addr16[4], u),
|
|
|
|
ooa.addr16[5], oa->addr16[5], u),
|
|
|
|
ooa.addr16[6], oa->addr16[6], u),
|
|
|
|
ooa.addr16[7], oa->addr16[7], u);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2006-11-16 04:32:37 +03:00
|
|
|
pf_send_tcp(const struct pf_rule *r, sa_family_t af,
|
2004-06-22 17:52:05 +04:00
|
|
|
const struct pf_addr *saddr, const struct pf_addr *daddr,
|
|
|
|
u_int16_t sport, u_int16_t dport, u_int32_t seq, u_int32_t ack,
|
2004-11-14 14:12:16 +03:00
|
|
|
u_int8_t flags, u_int16_t win, u_int16_t mss, u_int8_t ttl, int tag,
|
2006-11-16 04:32:37 +03:00
|
|
|
u_int16_t rtag, struct ether_header *eh, struct ifnet *ifp)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
int len, tlen;
|
|
|
|
#ifdef INET
|
2004-06-22 18:17:07 +04:00
|
|
|
struct ip *h = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
2004-06-22 18:17:07 +04:00
|
|
|
struct ip6_hdr *h6 = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
#endif /* INET6 */
|
|
|
|
struct tcphdr *th;
|
|
|
|
char *opt;
|
|
|
|
|
|
|
|
/* maximum segment size tcp option */
|
|
|
|
tlen = sizeof(struct tcphdr);
|
|
|
|
if (mss)
|
|
|
|
tlen += 4;
|
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
len = sizeof(struct ip) + tlen;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
len = sizeof(struct ip6_hdr) + tlen;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 18:17:07 +04:00
|
|
|
default:
|
|
|
|
return;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* create outgoing mbuf */
|
|
|
|
m = m_gethdr(M_DONTWAIT, MT_HEADER);
|
2004-11-14 14:12:16 +03:00
|
|
|
if (m == NULL)
|
2004-06-22 17:52:05 +04:00
|
|
|
return;
|
2004-11-14 14:12:16 +03:00
|
|
|
if (tag) {
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_GENERATED, 0, M_NOWAIT);
|
|
|
|
if (mtag == NULL) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
m_tag_prepend(m, mtag);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2006-10-08 01:45:49 +04:00
|
|
|
if (rtag)
|
|
|
|
if (pf_tag_packet(m, NULL, rtag)) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
2006-10-12 23:59:07 +04:00
|
|
|
#ifdef ALTQ
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r != NULL && r->qid) {
|
2004-11-14 14:12:16 +03:00
|
|
|
struct m_tag *mtag;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct altq_tag *atag;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_QID, sizeof(*atag), M_NOWAIT);
|
|
|
|
if (mtag != NULL) {
|
|
|
|
atag = (struct altq_tag *)(mtag + 1);
|
|
|
|
atag->qid = r->qid;
|
|
|
|
/* add hints for ecn */
|
|
|
|
atag->af = af;
|
|
|
|
atag->hdr = mtod(m, struct ip *);
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
}
|
|
|
|
}
|
2006-10-12 23:59:07 +04:00
|
|
|
#endif /* ALTQ */
|
2004-06-22 17:52:05 +04:00
|
|
|
m->m_data += max_linkhdr;
|
|
|
|
m->m_pkthdr.len = m->m_len = len;
|
|
|
|
m->m_pkthdr.rcvif = NULL;
|
|
|
|
bzero(m->m_data, len);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
h = mtod(m, struct ip *);
|
|
|
|
|
|
|
|
/* IP header fields included in the TCP checksum */
|
|
|
|
h->ip_p = IPPROTO_TCP;
|
|
|
|
h->ip_len = htons(tlen);
|
|
|
|
h->ip_src.s_addr = saddr->v4.s_addr;
|
|
|
|
h->ip_dst.s_addr = daddr->v4.s_addr;
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
th = (struct tcphdr *)((char *)h + sizeof(struct ip));
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
h6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
/* IP header fields included in the TCP checksum */
|
|
|
|
h6->ip6_nxt = IPPROTO_TCP;
|
|
|
|
h6->ip6_plen = htons(tlen);
|
|
|
|
memcpy(&h6->ip6_src, &saddr->v6, sizeof(struct in6_addr));
|
|
|
|
memcpy(&h6->ip6_dst, &daddr->v6, sizeof(struct in6_addr));
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
th = (struct tcphdr *)((char *)h6 + sizeof(struct ip6_hdr));
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 18:17:07 +04:00
|
|
|
default:
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* TCP header */
|
|
|
|
th->th_sport = sport;
|
|
|
|
th->th_dport = dport;
|
|
|
|
th->th_seq = htonl(seq);
|
|
|
|
th->th_ack = htonl(ack);
|
|
|
|
th->th_off = tlen >> 2;
|
|
|
|
th->th_flags = flags;
|
|
|
|
th->th_win = htons(win);
|
|
|
|
|
|
|
|
if (mss) {
|
|
|
|
opt = (char *)(th + 1);
|
|
|
|
opt[0] = TCPOPT_MAXSEG;
|
|
|
|
opt[1] = 4;
|
|
|
|
HTONS(mss);
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)&mss, (void *)(opt + 2), 2);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
/* TCP checksum */
|
|
|
|
th->th_sum = in_cksum(m, len);
|
|
|
|
|
|
|
|
/* Finish the IP header */
|
|
|
|
h->ip_v = 4;
|
|
|
|
h->ip_hl = sizeof(*h) >> 2;
|
|
|
|
h->ip_tos = IPTOS_LOWDELAY;
|
|
|
|
h->ip_len = htons(len);
|
|
|
|
h->ip_off = htons(ip_mtudisc ? IP_DF : 0);
|
|
|
|
h->ip_ttl = ttl ? ttl : ip_defttl;
|
|
|
|
h->ip_sum = 0;
|
2004-11-14 14:12:16 +03:00
|
|
|
if (eh == NULL) {
|
|
|
|
ip_output(m, (void *)NULL, (void *)NULL, 0,
|
|
|
|
(void *)NULL, (void *)NULL);
|
|
|
|
} else {
|
|
|
|
#ifdef __OpenBSD__
|
|
|
|
struct route ro;
|
|
|
|
struct rtentry rt;
|
|
|
|
struct ether_header *e = (void *)ro.ro_dst.sa_data;
|
|
|
|
|
|
|
|
if (ifp == NULL) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
rt.rt_ifp = ifp;
|
|
|
|
ro.ro_rt = &rt;
|
|
|
|
ro.ro_dst.sa_len = sizeof(ro.ro_dst);
|
|
|
|
ro.ro_dst.sa_family = pseudo_AF_HDRCMPLT;
|
|
|
|
bcopy(eh->ether_dhost, e->ether_shost, ETHER_ADDR_LEN);
|
|
|
|
bcopy(eh->ether_shost, e->ether_dhost, ETHER_ADDR_LEN);
|
|
|
|
e->ether_type = eh->ether_type;
|
|
|
|
ip_output(m, (void *)NULL, &ro, IP_ROUTETOETHER,
|
|
|
|
(void *)NULL, (void *)NULL);
|
|
|
|
#else
|
|
|
|
/*
|
|
|
|
* on netbsd, pf_test and pf_test6 are always called
|
|
|
|
* with eh == NULL.
|
|
|
|
*/
|
|
|
|
panic("pf_send_tcp: eh != NULL");
|
|
|
|
#endif
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
/* TCP checksum */
|
|
|
|
th->th_sum = in6_cksum(m, IPPROTO_TCP,
|
|
|
|
sizeof(struct ip6_hdr), tlen);
|
|
|
|
|
|
|
|
h6->ip6_vfc |= IPV6_VERSION;
|
|
|
|
h6->ip6_hlim = IPV6_DEFHLIM;
|
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
ip6_output(m, NULL, NULL, 0, NULL, NULL);
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
ip6_output(m, NULL, NULL, 0, NULL, NULL, NULL);
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_send_icmp(struct mbuf *m, u_int8_t type, u_int8_t code, sa_family_t af,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pf_rule *r)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
struct mbuf *m0;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_GENERATED, 0, M_NOWAIT);
|
|
|
|
if (mtag == NULL)
|
|
|
|
return;
|
|
|
|
m0 = m_copy(m, 0, M_COPYALL);
|
|
|
|
if (m0 == NULL) {
|
|
|
|
m_tag_free(mtag);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
m_tag_prepend(m0, mtag);
|
|
|
|
|
2006-10-12 23:59:07 +04:00
|
|
|
#ifdef ALTQ
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r->qid) {
|
|
|
|
struct altq_tag *atag;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_QID, sizeof(*atag), M_NOWAIT);
|
|
|
|
if (mtag != NULL) {
|
|
|
|
atag = (struct altq_tag *)(mtag + 1);
|
|
|
|
atag->qid = r->qid;
|
|
|
|
/* add hints for ecn */
|
|
|
|
atag->af = af;
|
|
|
|
atag->hdr = mtod(m0, struct ip *);
|
|
|
|
m_tag_prepend(m0, mtag);
|
|
|
|
}
|
|
|
|
}
|
2006-10-12 23:59:07 +04:00
|
|
|
#endif /* ALTQ */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
2005-10-23 23:40:20 +04:00
|
|
|
icmp_error(m0, type, code, 0, 0);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
icmp6_error(m0, type, code, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return 1 if the addresses a and b match (with mask m), otherwise return 0.
|
|
|
|
* If n is 0, they match if they are equal. If n is != 0, they match if they
|
|
|
|
* are different.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
pf_match_addr(u_int8_t n, struct pf_addr *a, struct pf_addr *m,
|
|
|
|
struct pf_addr *b, sa_family_t af)
|
|
|
|
{
|
|
|
|
int match = 0;
|
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
if ((a->addr32[0] & m->addr32[0]) ==
|
|
|
|
(b->addr32[0] & m->addr32[0]))
|
|
|
|
match++;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (((a->addr32[0] & m->addr32[0]) ==
|
|
|
|
(b->addr32[0] & m->addr32[0])) &&
|
|
|
|
((a->addr32[1] & m->addr32[1]) ==
|
|
|
|
(b->addr32[1] & m->addr32[1])) &&
|
|
|
|
((a->addr32[2] & m->addr32[2]) ==
|
|
|
|
(b->addr32[2] & m->addr32[2])) &&
|
|
|
|
((a->addr32[3] & m->addr32[3]) ==
|
|
|
|
(b->addr32[3] & m->addr32[3])))
|
|
|
|
match++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
if (match) {
|
|
|
|
if (n)
|
|
|
|
return (0);
|
|
|
|
else
|
|
|
|
return (1);
|
|
|
|
} else {
|
|
|
|
if (n)
|
|
|
|
return (1);
|
|
|
|
else
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_match(u_int8_t op, u_int32_t a1, u_int32_t a2, u_int32_t p)
|
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case PF_OP_IRG:
|
|
|
|
return ((p > a1) && (p < a2));
|
|
|
|
case PF_OP_XRG:
|
|
|
|
return ((p < a1) || (p > a2));
|
|
|
|
case PF_OP_RRG:
|
|
|
|
return ((p >= a1) && (p <= a2));
|
|
|
|
case PF_OP_EQ:
|
|
|
|
return (p == a1);
|
|
|
|
case PF_OP_NE:
|
|
|
|
return (p != a1);
|
|
|
|
case PF_OP_LT:
|
|
|
|
return (p < a1);
|
|
|
|
case PF_OP_LE:
|
|
|
|
return (p <= a1);
|
|
|
|
case PF_OP_GT:
|
|
|
|
return (p > a1);
|
|
|
|
case PF_OP_GE:
|
|
|
|
return (p >= a1);
|
|
|
|
}
|
|
|
|
return (0); /* never reached */
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_match_port(u_int8_t op, u_int16_t a1, u_int16_t a2, u_int16_t p)
|
|
|
|
{
|
|
|
|
NTOHS(a1);
|
|
|
|
NTOHS(a2);
|
|
|
|
NTOHS(p);
|
|
|
|
return (pf_match(op, a1, a2, p));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_match_uid(u_int8_t op, uid_t a1, uid_t a2, uid_t u)
|
|
|
|
{
|
|
|
|
if (u == UID_MAX && op != PF_OP_EQ && op != PF_OP_NE)
|
|
|
|
return (0);
|
|
|
|
return (pf_match(op, a1, a2, u));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_match_gid(u_int8_t op, gid_t a1, gid_t a2, gid_t g)
|
|
|
|
{
|
|
|
|
if (g == GID_MAX && op != PF_OP_EQ && op != PF_OP_NE)
|
|
|
|
return (0);
|
|
|
|
return (pf_match(op, a1, a2, g));
|
|
|
|
}
|
|
|
|
|
|
|
|
struct pf_tag *
|
|
|
|
pf_get_tag(struct mbuf *m)
|
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
if ((mtag = m_tag_find(m, PACKET_TAG_PF_TAG, NULL)) != NULL)
|
|
|
|
return ((struct pf_tag *)(mtag + 1));
|
|
|
|
else
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2005-07-01 16:37:34 +04:00
|
|
|
pf_match_tag(struct mbuf *m, struct pf_rule *r, struct pf_tag **pftag, int *tag)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
if (*tag == -1) { /* find mbuf tag */
|
2004-11-14 14:12:16 +03:00
|
|
|
*pftag = pf_get_tag(m);
|
|
|
|
if (*pftag != NULL)
|
|
|
|
*tag = (*pftag)->tag;
|
2004-06-22 17:52:05 +04:00
|
|
|
else
|
|
|
|
*tag = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ((!r->match_tag_not && r->match_tag == *tag) ||
|
|
|
|
(r->match_tag_not && r->match_tag != *tag));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_tag_packet(struct mbuf *m, struct pf_tag *pftag, int tag)
|
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
if (tag <= 0)
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
if (pftag == NULL) {
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_TAG, sizeof(*pftag), M_NOWAIT);
|
|
|
|
if (mtag == NULL)
|
|
|
|
return (1);
|
|
|
|
((struct pf_tag *)(mtag + 1))->tag = tag;
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
} else
|
|
|
|
pftag->tag = tag;
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
static void
|
|
|
|
pf_step_into_anchor(int *depth, struct pf_ruleset **rs, int n,
|
|
|
|
struct pf_rule **r, struct pf_rule **a)
|
|
|
|
{
|
|
|
|
struct pf_anchor_stackframe *f;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if (*depth >= sizeof(pf_anchor_stack) /
|
|
|
|
sizeof(pf_anchor_stack[0])) {
|
|
|
|
printf("pf_step_into_anchor: stack overflow\n");
|
|
|
|
*r = TAILQ_NEXT(*r, entries);
|
|
|
|
return;
|
|
|
|
} else if (*depth == 0 && a != NULL)
|
|
|
|
*a = *r;
|
|
|
|
f = pf_anchor_stack + (*depth)++;
|
|
|
|
f->rs = *rs;
|
|
|
|
f->r = *r;
|
|
|
|
if ((*r)->anchor_wildcard) {
|
|
|
|
f->parent = &(*r)->anchor->children;
|
|
|
|
if ((f->child = RB_MIN(pf_anchor_node, f->parent)) ==
|
|
|
|
NULL) {
|
|
|
|
*r = NULL;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
*rs = &f->child->ruleset;
|
|
|
|
} else {
|
|
|
|
f->parent = NULL;
|
|
|
|
f->child = NULL;
|
|
|
|
*rs = &(*r)->anchor->ruleset;
|
|
|
|
}
|
|
|
|
*r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
pf_step_out_of_anchor(int *depth, struct pf_ruleset **rs, int n,
|
|
|
|
struct pf_rule **r, struct pf_rule **a)
|
|
|
|
{
|
|
|
|
struct pf_anchor_stackframe *f;
|
|
|
|
|
|
|
|
do {
|
|
|
|
if (*depth <= 0)
|
|
|
|
break;
|
|
|
|
f = pf_anchor_stack + *depth - 1;
|
|
|
|
if (f->parent != NULL && f->child != NULL) {
|
|
|
|
f->child = RB_NEXT(pf_anchor_node, f->parent, f->child);
|
|
|
|
if (f->child != NULL) {
|
|
|
|
*rs = &f->child->ruleset;
|
|
|
|
*r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
|
|
|
|
if (*r == NULL)
|
|
|
|
continue;
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
(*depth)--;
|
|
|
|
if (*depth == 0 && a != NULL)
|
|
|
|
*a = NULL;
|
|
|
|
*rs = f->rs;
|
|
|
|
*r = TAILQ_NEXT(f->r, entries);
|
|
|
|
} while (*r == NULL);
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
void
|
|
|
|
pf_poolmask(struct pf_addr *naddr, struct pf_addr *raddr,
|
2006-12-04 05:58:06 +03:00
|
|
|
struct pf_addr *rmask, const struct pf_addr *saddr, sa_family_t af)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
naddr->addr32[0] = (raddr->addr32[0] & rmask->addr32[0]) |
|
|
|
|
((rmask->addr32[0] ^ 0xffffffff ) & saddr->addr32[0]);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
case AF_INET6:
|
|
|
|
naddr->addr32[0] = (raddr->addr32[0] & rmask->addr32[0]) |
|
|
|
|
((rmask->addr32[0] ^ 0xffffffff ) & saddr->addr32[0]);
|
|
|
|
naddr->addr32[1] = (raddr->addr32[1] & rmask->addr32[1]) |
|
|
|
|
((rmask->addr32[1] ^ 0xffffffff ) & saddr->addr32[1]);
|
|
|
|
naddr->addr32[2] = (raddr->addr32[2] & rmask->addr32[2]) |
|
|
|
|
((rmask->addr32[2] ^ 0xffffffff ) & saddr->addr32[2]);
|
|
|
|
naddr->addr32[3] = (raddr->addr32[3] & rmask->addr32[3]) |
|
|
|
|
((rmask->addr32[3] ^ 0xffffffff ) & saddr->addr32[3]);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_addr_inc(struct pf_addr *addr, sa_family_t af)
|
|
|
|
{
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
addr->addr32[0] = htonl(ntohl(addr->addr32[0]) + 1);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
case AF_INET6:
|
|
|
|
if (addr->addr32[3] == 0xffffffff) {
|
|
|
|
addr->addr32[3] = 0;
|
|
|
|
if (addr->addr32[2] == 0xffffffff) {
|
|
|
|
addr->addr32[2] = 0;
|
|
|
|
if (addr->addr32[1] == 0xffffffff) {
|
|
|
|
addr->addr32[1] = 0;
|
|
|
|
addr->addr32[0] =
|
|
|
|
htonl(ntohl(addr->addr32[0]) + 1);
|
|
|
|
} else
|
|
|
|
addr->addr32[1] =
|
|
|
|
htonl(ntohl(addr->addr32[1]) + 1);
|
|
|
|
} else
|
|
|
|
addr->addr32[2] =
|
|
|
|
htonl(ntohl(addr->addr32[2]) + 1);
|
|
|
|
} else
|
|
|
|
addr->addr32[3] =
|
|
|
|
htonl(ntohl(addr->addr32[3]) + 1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
#define mix(a,b,c) \
|
|
|
|
do { \
|
|
|
|
a -= b; a -= c; a ^= (c >> 13); \
|
|
|
|
b -= c; b -= a; b ^= (a << 8); \
|
|
|
|
c -= a; c -= b; c ^= (b >> 13); \
|
|
|
|
a -= b; a -= c; a ^= (c >> 12); \
|
|
|
|
b -= c; b -= a; b ^= (a << 16); \
|
|
|
|
c -= a; c -= b; c ^= (b >> 5); \
|
|
|
|
a -= b; a -= c; a ^= (c >> 3); \
|
|
|
|
b -= c; b -= a; b ^= (a << 10); \
|
|
|
|
c -= a; c -= b; c ^= (b >> 15); \
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* hash function based on bridge_hash in if_bridge.c
|
|
|
|
*/
|
|
|
|
void
|
2006-12-04 05:58:06 +03:00
|
|
|
pf_hash(const struct pf_addr *inaddr, struct pf_addr *hash,
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_poolhashkey *key, sa_family_t af)
|
|
|
|
{
|
|
|
|
u_int32_t a = 0x9e3779b9, b = 0x9e3779b9, c = key->key32[0];
|
|
|
|
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
a += inaddr->addr32[0];
|
|
|
|
b += key->key32[1];
|
|
|
|
mix(a, b, c);
|
|
|
|
hash->addr32[0] = c + key->key32[2];
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
a += inaddr->addr32[0];
|
|
|
|
b += inaddr->addr32[2];
|
|
|
|
mix(a, b, c);
|
|
|
|
hash->addr32[0] = c;
|
|
|
|
a += inaddr->addr32[1];
|
|
|
|
b += inaddr->addr32[3];
|
|
|
|
c += key->key32[1];
|
|
|
|
mix(a, b, c);
|
|
|
|
hash->addr32[1] = c;
|
|
|
|
a += inaddr->addr32[2];
|
|
|
|
b += inaddr->addr32[1];
|
|
|
|
c += key->key32[2];
|
|
|
|
mix(a, b, c);
|
|
|
|
hash->addr32[2] = c;
|
|
|
|
a += inaddr->addr32[3];
|
|
|
|
b += inaddr->addr32[0];
|
|
|
|
c += key->key32[3];
|
|
|
|
mix(a, b, c);
|
|
|
|
hash->addr32[3] = c;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2006-12-04 05:58:06 +03:00
|
|
|
pf_map_addr(sa_family_t af, struct pf_rule *r, const struct pf_addr *saddr,
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_addr *naddr, struct pf_addr *init_addr, struct pf_src_node **sn)
|
|
|
|
{
|
|
|
|
unsigned char hash[16];
|
|
|
|
struct pf_pool *rpool = &r->rpool;
|
|
|
|
struct pf_addr *raddr = &rpool->cur->addr.v.a.addr;
|
|
|
|
struct pf_addr *rmask = &rpool->cur->addr.v.a.mask;
|
|
|
|
struct pf_pooladdr *acur = rpool->cur;
|
|
|
|
struct pf_src_node k;
|
|
|
|
|
|
|
|
if (*sn == NULL && r->rpool.opts & PF_POOL_STICKYADDR &&
|
|
|
|
(r->rpool.opts & PF_POOL_TYPEMASK) != PF_POOL_NONE) {
|
|
|
|
k.af = af;
|
|
|
|
PF_ACPY(&k.addr, saddr, af);
|
|
|
|
if (r->rule_flag & PFRULE_RULESRCTRACK ||
|
|
|
|
r->rpool.opts & PF_POOL_STICKYADDR)
|
|
|
|
k.rule.ptr = r;
|
|
|
|
else
|
|
|
|
k.rule.ptr = NULL;
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_SEARCH]++;
|
|
|
|
*sn = RB_FIND(pf_src_tree, &tree_src_tracking, &k);
|
|
|
|
if (*sn != NULL && !PF_AZERO(&(*sn)->raddr, af)) {
|
|
|
|
PF_ACPY(naddr, &(*sn)->raddr, af);
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf_map_addr: src tracking maps ");
|
|
|
|
pf_print_host(&k.addr, 0, af);
|
|
|
|
printf(" to ");
|
|
|
|
pf_print_host(naddr, 0, af);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rpool->cur->addr.type == PF_ADDR_NOROUTE)
|
|
|
|
return (1);
|
|
|
|
if (rpool->cur->addr.type == PF_ADDR_DYNIFTL) {
|
2004-11-14 14:12:16 +03:00
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (rpool->cur->addr.p.dyn->pfid_acnt4 < 1 &&
|
|
|
|
(rpool->opts & PF_POOL_TYPEMASK) !=
|
|
|
|
PF_POOL_ROUNDROBIN)
|
|
|
|
return (1);
|
|
|
|
raddr = &rpool->cur->addr.p.dyn->pfid_addr4;
|
|
|
|
rmask = &rpool->cur->addr.p.dyn->pfid_mask4;
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (rpool->cur->addr.p.dyn->pfid_acnt6 < 1 &&
|
|
|
|
(rpool->opts & PF_POOL_TYPEMASK) !=
|
|
|
|
PF_POOL_ROUNDROBIN)
|
|
|
|
return (1);
|
|
|
|
raddr = &rpool->cur->addr.p.dyn->pfid_addr6;
|
|
|
|
rmask = &rpool->cur->addr.p.dyn->pfid_mask6;
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
} else if (rpool->cur->addr.type == PF_ADDR_TABLE) {
|
|
|
|
if ((rpool->opts & PF_POOL_TYPEMASK) != PF_POOL_ROUNDROBIN)
|
|
|
|
return (1); /* unsupported */
|
|
|
|
} else {
|
|
|
|
raddr = &rpool->cur->addr.v.a.addr;
|
|
|
|
rmask = &rpool->cur->addr.v.a.mask;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (rpool->opts & PF_POOL_TYPEMASK) {
|
|
|
|
case PF_POOL_NONE:
|
|
|
|
PF_ACPY(naddr, raddr, af);
|
|
|
|
break;
|
|
|
|
case PF_POOL_BITMASK:
|
|
|
|
PF_POOLMASK(naddr, raddr, rmask, saddr, af);
|
|
|
|
break;
|
|
|
|
case PF_POOL_RANDOM:
|
|
|
|
if (init_addr != NULL && PF_AZERO(init_addr, af)) {
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
2004-11-14 14:12:16 +03:00
|
|
|
rpool->counter.addr32[0] = htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (rmask->addr32[3] != 0xffffffff)
|
2004-11-14 14:12:16 +03:00
|
|
|
rpool->counter.addr32[3] =
|
|
|
|
htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
else
|
|
|
|
break;
|
|
|
|
if (rmask->addr32[2] != 0xffffffff)
|
2004-11-14 14:12:16 +03:00
|
|
|
rpool->counter.addr32[2] =
|
|
|
|
htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
else
|
|
|
|
break;
|
|
|
|
if (rmask->addr32[1] != 0xffffffff)
|
2004-11-14 14:12:16 +03:00
|
|
|
rpool->counter.addr32[1] =
|
|
|
|
htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
else
|
|
|
|
break;
|
|
|
|
if (rmask->addr32[0] != 0xffffffff)
|
2004-11-14 14:12:16 +03:00
|
|
|
rpool->counter.addr32[0] =
|
|
|
|
htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
PF_POOLMASK(naddr, raddr, rmask, &rpool->counter, af);
|
|
|
|
PF_ACPY(init_addr, naddr, af);
|
|
|
|
|
|
|
|
} else {
|
|
|
|
PF_AINC(&rpool->counter, af);
|
|
|
|
PF_POOLMASK(naddr, raddr, rmask, &rpool->counter, af);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case PF_POOL_SRCHASH:
|
|
|
|
pf_hash(saddr, (struct pf_addr *)&hash, &rpool->key, af);
|
|
|
|
PF_POOLMASK(naddr, raddr, rmask, (struct pf_addr *)&hash, af);
|
|
|
|
break;
|
|
|
|
case PF_POOL_ROUNDROBIN:
|
|
|
|
if (rpool->cur->addr.type == PF_ADDR_TABLE) {
|
|
|
|
if (!pfr_pool_get(rpool->cur->addr.p.tbl,
|
|
|
|
&rpool->tblidx, &rpool->counter,
|
|
|
|
&raddr, &rmask, af))
|
|
|
|
goto get_addr;
|
|
|
|
} else if (rpool->cur->addr.type == PF_ADDR_DYNIFTL) {
|
|
|
|
if (!pfr_pool_get(rpool->cur->addr.p.dyn->pfid_kt,
|
|
|
|
&rpool->tblidx, &rpool->counter,
|
|
|
|
&raddr, &rmask, af))
|
|
|
|
goto get_addr;
|
|
|
|
} else if (pf_match_addr(0, raddr, rmask, &rpool->counter, af))
|
|
|
|
goto get_addr;
|
|
|
|
|
|
|
|
try_next:
|
|
|
|
if ((rpool->cur = TAILQ_NEXT(rpool->cur, entries)) == NULL)
|
|
|
|
rpool->cur = TAILQ_FIRST(&rpool->list);
|
|
|
|
if (rpool->cur->addr.type == PF_ADDR_TABLE) {
|
|
|
|
rpool->tblidx = -1;
|
|
|
|
if (pfr_pool_get(rpool->cur->addr.p.tbl,
|
|
|
|
&rpool->tblidx, &rpool->counter,
|
|
|
|
&raddr, &rmask, af)) {
|
|
|
|
/* table contains no address of type 'af' */
|
|
|
|
if (rpool->cur != acur)
|
|
|
|
goto try_next;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
} else if (rpool->cur->addr.type == PF_ADDR_DYNIFTL) {
|
|
|
|
rpool->tblidx = -1;
|
|
|
|
if (pfr_pool_get(rpool->cur->addr.p.dyn->pfid_kt,
|
|
|
|
&rpool->tblidx, &rpool->counter,
|
|
|
|
&raddr, &rmask, af)) {
|
|
|
|
/* table contains no address of type 'af' */
|
|
|
|
if (rpool->cur != acur)
|
|
|
|
goto try_next;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
raddr = &rpool->cur->addr.v.a.addr;
|
|
|
|
rmask = &rpool->cur->addr.v.a.mask;
|
|
|
|
PF_ACPY(&rpool->counter, raddr, af);
|
|
|
|
}
|
|
|
|
|
|
|
|
get_addr:
|
|
|
|
PF_ACPY(naddr, &rpool->counter, af);
|
2004-12-21 15:05:34 +03:00
|
|
|
if (init_addr != NULL && PF_AZERO(init_addr, af))
|
|
|
|
PF_ACPY(init_addr, naddr, af);
|
2004-06-22 17:52:05 +04:00
|
|
|
PF_AINC(&rpool->counter, af);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (*sn != NULL)
|
|
|
|
PF_ACPY(&(*sn)->raddr, naddr, af);
|
|
|
|
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC &&
|
|
|
|
(rpool->opts & PF_POOL_TYPEMASK) != PF_POOL_NONE) {
|
|
|
|
printf("pf_map_addr: selected address ");
|
|
|
|
pf_print_host(naddr, 0, af);
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_get_sport(sa_family_t af, u_int8_t proto, struct pf_rule *r,
|
|
|
|
struct pf_addr *saddr, struct pf_addr *daddr, u_int16_t dport,
|
|
|
|
struct pf_addr *naddr, u_int16_t *nport, u_int16_t low, u_int16_t high,
|
|
|
|
struct pf_src_node **sn)
|
|
|
|
{
|
|
|
|
struct pf_state key;
|
|
|
|
struct pf_addr init_addr;
|
|
|
|
u_int16_t cut;
|
|
|
|
|
|
|
|
bzero(&init_addr, sizeof(init_addr));
|
|
|
|
if (pf_map_addr(af, r, saddr, naddr, &init_addr, sn))
|
|
|
|
return (1);
|
|
|
|
|
|
|
|
do {
|
|
|
|
key.af = af;
|
|
|
|
key.proto = proto;
|
|
|
|
PF_ACPY(&key.ext.addr, daddr, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, naddr, key.af);
|
|
|
|
key.ext.port = dport;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* port search; start random, step;
|
|
|
|
* similar 2 portloop in in_pcbbind
|
|
|
|
*/
|
|
|
|
if (!(proto == IPPROTO_TCP || proto == IPPROTO_UDP)) {
|
2005-02-15 00:27:26 +03:00
|
|
|
key.gwy.port = dport;
|
2004-06-22 17:52:05 +04:00
|
|
|
if (pf_find_state_all(&key, PF_EXT_GWY, NULL) == NULL)
|
|
|
|
return (0);
|
|
|
|
} else if (low == 0 && high == 0) {
|
|
|
|
key.gwy.port = *nport;
|
|
|
|
if (pf_find_state_all(&key, PF_EXT_GWY, NULL) == NULL)
|
|
|
|
return (0);
|
|
|
|
} else if (low == high) {
|
|
|
|
key.gwy.port = htons(low);
|
|
|
|
if (pf_find_state_all(&key, PF_EXT_GWY, NULL) == NULL) {
|
|
|
|
*nport = htons(low);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
u_int16_t tmp;
|
|
|
|
|
|
|
|
if (low > high) {
|
|
|
|
tmp = low;
|
|
|
|
low = high;
|
|
|
|
high = tmp;
|
|
|
|
}
|
|
|
|
/* low < high */
|
2004-11-14 14:12:16 +03:00
|
|
|
cut = htonl(arc4random()) % (1 + high - low) + low;
|
2004-06-22 17:52:05 +04:00
|
|
|
/* low <= cut <= high */
|
|
|
|
for (tmp = cut; tmp <= high; ++(tmp)) {
|
|
|
|
key.gwy.port = htons(tmp);
|
|
|
|
if (pf_find_state_all(&key, PF_EXT_GWY, NULL) ==
|
|
|
|
NULL) {
|
|
|
|
*nport = htons(tmp);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (tmp = cut - 1; tmp >= low; --(tmp)) {
|
|
|
|
key.gwy.port = htons(tmp);
|
|
|
|
if (pf_find_state_all(&key, PF_EXT_GWY, NULL) ==
|
|
|
|
NULL) {
|
|
|
|
*nport = htons(tmp);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (r->rpool.opts & PF_POOL_TYPEMASK) {
|
|
|
|
case PF_POOL_RANDOM:
|
|
|
|
case PF_POOL_ROUNDROBIN:
|
|
|
|
if (pf_map_addr(af, r, saddr, naddr, &init_addr, sn))
|
|
|
|
return (1);
|
|
|
|
break;
|
|
|
|
case PF_POOL_NONE:
|
|
|
|
case PF_POOL_SRCHASH:
|
|
|
|
case PF_POOL_BITMASK:
|
|
|
|
default:
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
} while (! PF_AEQ(&init_addr, naddr, af) );
|
|
|
|
|
|
|
|
return (1); /* none available */
|
|
|
|
}
|
|
|
|
|
|
|
|
struct pf_rule *
|
|
|
|
pf_match_translation(struct pf_pdesc *pd, struct mbuf *m, int off,
|
|
|
|
int direction, struct pfi_kif *kif, struct pf_addr *saddr, u_int16_t sport,
|
|
|
|
struct pf_addr *daddr, u_int16_t dport, int rs_num)
|
|
|
|
{
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_rule *r, *rm = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_ruleset *ruleset = NULL;
|
2005-07-01 16:37:34 +04:00
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[rs_num].active.ptr);
|
|
|
|
while (r && rm == NULL) {
|
|
|
|
struct pf_rule_addr *src = NULL, *dst = NULL;
|
|
|
|
struct pf_addr_wrap *xdst = NULL;
|
|
|
|
|
|
|
|
if (r->action == PF_BINAT && direction == PF_IN) {
|
|
|
|
src = &r->dst;
|
|
|
|
if (r->rpool.cur != NULL)
|
|
|
|
xdst = &r->rpool.cur->addr;
|
|
|
|
} else {
|
|
|
|
src = &r->src;
|
|
|
|
dst = &r->dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != pd->af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != pd->proto)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&src->addr, saddr, pd->af, src->neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[src == &r->src ? PF_SKIP_SRC_ADDR :
|
|
|
|
PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (src->port_op && !pf_match_port(src->port_op,
|
|
|
|
src->port[0], src->port[1], sport))
|
|
|
|
r = r->skip[src == &r->src ? PF_SKIP_SRC_PORT :
|
|
|
|
PF_SKIP_DST_PORT].ptr;
|
|
|
|
else if (dst != NULL &&
|
2004-11-14 14:12:16 +03:00
|
|
|
PF_MISMATCHAW(&dst->addr, daddr, pd->af, dst->neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (xdst != NULL && PF_MISMATCHAW(xdst, daddr, pd->af, 0))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (dst != NULL && dst->port_op &&
|
|
|
|
!pf_match_port(dst->port_op, dst->port[0],
|
|
|
|
dst->port[1], dport))
|
|
|
|
r = r->skip[PF_SKIP_DST_PORT].ptr;
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-06-22 17:52:05 +04:00
|
|
|
else if (r->os_fingerprint != PF_OSFP_ANY && (pd->proto !=
|
|
|
|
IPPROTO_TCP || !pf_osfp_match(pf_osfp_fingerprint(pd, m,
|
|
|
|
off, pd->hdr.tcp), r->os_fingerprint)))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else {
|
|
|
|
if (r->tag)
|
|
|
|
tag = r->tag;
|
|
|
|
if (r->anchor == NULL) {
|
2004-06-22 17:52:05 +04:00
|
|
|
rm = r;
|
2005-07-01 16:37:34 +04:00
|
|
|
} else
|
|
|
|
pf_step_into_anchor(&asd, &ruleset, rs_num, &r, NULL);
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset, rs_num, &r, NULL);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_tag_packet(m, pftag, tag))
|
|
|
|
return (NULL);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (rm != NULL && (rm->action == PF_NONAT ||
|
|
|
|
rm->action == PF_NORDR || rm->action == PF_NOBINAT))
|
|
|
|
return (NULL);
|
|
|
|
return (rm);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct pf_rule *
|
|
|
|
pf_get_translation(struct pf_pdesc *pd, struct mbuf *m, int off, int direction,
|
|
|
|
struct pfi_kif *kif, struct pf_src_node **sn,
|
|
|
|
struct pf_addr *saddr, u_int16_t sport,
|
|
|
|
struct pf_addr *daddr, u_int16_t dport,
|
|
|
|
struct pf_addr *naddr, u_int16_t *nport)
|
|
|
|
{
|
|
|
|
struct pf_rule *r = NULL;
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
r = pf_match_translation(pd, m, off, direction, kif, saddr,
|
|
|
|
sport, daddr, dport, PF_RULESET_BINAT);
|
|
|
|
if (r == NULL)
|
|
|
|
r = pf_match_translation(pd, m, off, direction, kif,
|
|
|
|
saddr, sport, daddr, dport, PF_RULESET_NAT);
|
|
|
|
} else {
|
|
|
|
r = pf_match_translation(pd, m, off, direction, kif, saddr,
|
|
|
|
sport, daddr, dport, PF_RULESET_RDR);
|
|
|
|
if (r == NULL)
|
|
|
|
r = pf_match_translation(pd, m, off, direction, kif,
|
|
|
|
saddr, sport, daddr, dport, PF_RULESET_BINAT);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r != NULL) {
|
|
|
|
switch (r->action) {
|
|
|
|
case PF_NONAT:
|
|
|
|
case PF_NOBINAT:
|
|
|
|
case PF_NORDR:
|
|
|
|
return (NULL);
|
|
|
|
case PF_NAT:
|
|
|
|
if (pf_get_sport(pd->af, pd->proto, r, saddr,
|
|
|
|
daddr, dport, naddr, nport, r->rpool.proxy_port[0],
|
|
|
|
r->rpool.proxy_port[1], sn)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: NAT proxy port allocation "
|
|
|
|
"(%u-%u) failed\n",
|
|
|
|
r->rpool.proxy_port[0],
|
|
|
|
r->rpool.proxy_port[1]));
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case PF_BINAT:
|
|
|
|
switch (direction) {
|
|
|
|
case PF_OUT:
|
|
|
|
if (r->rpool.cur->addr.type == PF_ADDR_DYNIFTL){
|
2004-11-14 14:12:16 +03:00
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_acnt4 < 1)
|
|
|
|
return (NULL);
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_addr4,
|
|
|
|
&r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_mask4,
|
|
|
|
saddr, AF_INET);
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_acnt6 < 1)
|
|
|
|
return (NULL);
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_addr6,
|
|
|
|
&r->rpool.cur->addr.p.dyn->
|
|
|
|
pfid_mask6,
|
|
|
|
saddr, AF_INET6);
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
} else
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->rpool.cur->addr.v.a.addr,
|
|
|
|
&r->rpool.cur->addr.v.a.mask,
|
|
|
|
saddr, pd->af);
|
|
|
|
break;
|
|
|
|
case PF_IN:
|
2004-12-05 16:32:17 +03:00
|
|
|
if (r->src.addr.type == PF_ADDR_DYNIFTL) {
|
2004-11-14 14:12:16 +03:00
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r->src.addr.p.dyn->
|
|
|
|
pfid_acnt4 < 1)
|
|
|
|
return (NULL);
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->src.addr.p.dyn->
|
|
|
|
pfid_addr4,
|
|
|
|
&r->src.addr.p.dyn->
|
|
|
|
pfid_mask4,
|
|
|
|
daddr, AF_INET);
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
2004-06-22 17:52:05 +04:00
|
|
|
if (r->src.addr.p.dyn->
|
|
|
|
pfid_acnt6 < 1)
|
|
|
|
return (NULL);
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->src.addr.p.dyn->
|
|
|
|
pfid_addr6,
|
|
|
|
&r->src.addr.p.dyn->
|
|
|
|
pfid_mask6,
|
|
|
|
daddr, AF_INET6);
|
2004-11-14 14:12:16 +03:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
} else
|
|
|
|
PF_POOLMASK(naddr,
|
|
|
|
&r->src.addr.v.a.addr,
|
|
|
|
&r->src.addr.v.a.mask, daddr,
|
|
|
|
pd->af);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case PF_RDR: {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_map_addr(pd->af, r, saddr, naddr, NULL, sn))
|
2004-06-22 17:52:05 +04:00
|
|
|
return (NULL);
|
|
|
|
|
|
|
|
if (r->rpool.proxy_port[1]) {
|
|
|
|
u_int32_t tmp_nport;
|
|
|
|
|
|
|
|
tmp_nport = ((ntohs(dport) -
|
|
|
|
ntohs(r->dst.port[0])) %
|
|
|
|
(r->rpool.proxy_port[1] -
|
|
|
|
r->rpool.proxy_port[0] + 1)) +
|
|
|
|
r->rpool.proxy_port[0];
|
|
|
|
|
|
|
|
/* wrap around if necessary */
|
|
|
|
if (tmp_nport > 65535)
|
|
|
|
tmp_nport -= 65535;
|
|
|
|
*nport = htons((u_int16_t)tmp_nport);
|
|
|
|
} else if (r->rpool.proxy_port[0])
|
|
|
|
*nport = htons(r->rpool.proxy_port[0]);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (r);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_socket_lookup(uid_t *uid, gid_t *gid, int direction, struct pf_pdesc *pd)
|
|
|
|
{
|
|
|
|
struct pf_addr *saddr, *daddr;
|
|
|
|
u_int16_t sport, dport;
|
|
|
|
struct inpcbtable *tb;
|
2004-06-22 18:17:07 +04:00
|
|
|
struct inpcb *inp = NULL;
|
2004-06-22 22:37:49 +04:00
|
|
|
#if defined(__NetBSD__) && defined(INET6)
|
2004-06-22 18:17:07 +04:00
|
|
|
struct in6pcb *in6p = NULL;
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
*uid = UID_MAX;
|
|
|
|
*gid = GID_MAX;
|
|
|
|
switch (pd->proto) {
|
|
|
|
case IPPROTO_TCP:
|
|
|
|
sport = pd->hdr.tcp->th_sport;
|
|
|
|
dport = pd->hdr.tcp->th_dport;
|
|
|
|
tb = &tcbtable;
|
|
|
|
break;
|
|
|
|
case IPPROTO_UDP:
|
|
|
|
sport = pd->hdr.udp->uh_sport;
|
|
|
|
dport = pd->hdr.udp->uh_dport;
|
|
|
|
tb = &udbtable;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
saddr = pd->src;
|
|
|
|
daddr = pd->dst;
|
|
|
|
} else {
|
|
|
|
u_int16_t p;
|
|
|
|
|
|
|
|
p = sport;
|
|
|
|
sport = dport;
|
|
|
|
dport = p;
|
|
|
|
saddr = pd->dst;
|
|
|
|
daddr = pd->src;
|
|
|
|
}
|
|
|
|
switch (pd->af) {
|
2004-11-14 14:12:16 +03:00
|
|
|
#ifdef INET
|
2004-06-22 17:52:05 +04:00
|
|
|
case AF_INET:
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
inp = in_pcbhashlookup(tb, saddr->v4, sport, daddr->v4, dport);
|
|
|
|
if (inp == NULL) {
|
|
|
|
inp = in_pcblookup_listen(tb, daddr->v4, dport, 0);
|
|
|
|
if (inp == NULL)
|
|
|
|
return (0);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
inp = in_pcblookup_connect(tb, saddr->v4, sport, daddr->v4,
|
|
|
|
dport);
|
|
|
|
if (inp == NULL) {
|
|
|
|
inp = in_pcblookup_bind(tb, daddr->v4, dport);
|
|
|
|
if (inp == NULL)
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* INET */
|
2004-06-22 17:52:05 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
inp = in6_pcbhashlookup(tb, &saddr->v6, sport, &daddr->v6,
|
|
|
|
dport);
|
|
|
|
if (inp == NULL) {
|
|
|
|
inp = in6_pcblookup_listen(tb, &daddr->v6, dport, 0);
|
|
|
|
if (inp == NULL)
|
|
|
|
return (0);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
in6p = in6_pcblookup_connect(tb, &saddr->v6, sport, &daddr->v6,
|
|
|
|
dport, 0);
|
|
|
|
if (in6p == NULL) {
|
|
|
|
in6p = in6_pcblookup_bind(tb, &daddr->v6, dport, 0);
|
2006-02-08 01:53:03 +03:00
|
|
|
if (in6p == NULL)
|
2004-06-22 18:17:07 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
default:
|
|
|
|
return (0);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
*uid = inp->inp_socket->so_euid;
|
|
|
|
*gid = inp->inp_socket->so_egid;
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
switch (pd->af) {
|
|
|
|
case AF_INET:
|
2005-05-07 23:59:56 +04:00
|
|
|
*uid = inp->inp_socket->so_uidinfo->ui_uid;
|
2004-06-22 18:17:07 +04:00
|
|
|
/* XXX gid */
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
2005-05-07 23:59:56 +04:00
|
|
|
*uid = in6p->in6p_socket->so_uidinfo->ui_uid;
|
2004-06-22 18:17:07 +04:00
|
|
|
/* XXX gid */
|
|
|
|
break;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
u_int8_t
|
|
|
|
pf_get_wscale(struct mbuf *m, int off, u_int16_t th_off, sa_family_t af)
|
|
|
|
{
|
|
|
|
int hlen;
|
|
|
|
u_int8_t hdr[60];
|
|
|
|
u_int8_t *opt, optlen;
|
|
|
|
u_int8_t wscale = 0;
|
|
|
|
|
|
|
|
hlen = th_off << 2; /* hlen <= sizeof(hdr) */
|
|
|
|
if (hlen <= sizeof(struct tcphdr))
|
|
|
|
return (0);
|
|
|
|
if (!pf_pull_hdr(m, off, hdr, hlen, NULL, NULL, af))
|
|
|
|
return (0);
|
|
|
|
opt = hdr + sizeof(struct tcphdr);
|
|
|
|
hlen -= sizeof(struct tcphdr);
|
|
|
|
while (hlen >= 3) {
|
|
|
|
switch (*opt) {
|
|
|
|
case TCPOPT_EOL:
|
|
|
|
case TCPOPT_NOP:
|
|
|
|
++opt;
|
|
|
|
--hlen;
|
|
|
|
break;
|
|
|
|
case TCPOPT_WINDOW:
|
|
|
|
wscale = opt[2];
|
|
|
|
if (wscale > TCP_MAX_WINSHIFT)
|
|
|
|
wscale = TCP_MAX_WINSHIFT;
|
|
|
|
wscale |= PF_WSCALE_FLAG;
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
default:
|
|
|
|
optlen = opt[1];
|
|
|
|
if (optlen < 2)
|
|
|
|
optlen = 2;
|
|
|
|
hlen -= optlen;
|
|
|
|
opt += optlen;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (wscale);
|
|
|
|
}
|
|
|
|
|
|
|
|
u_int16_t
|
|
|
|
pf_get_mss(struct mbuf *m, int off, u_int16_t th_off, sa_family_t af)
|
|
|
|
{
|
|
|
|
int hlen;
|
|
|
|
u_int8_t hdr[60];
|
|
|
|
u_int8_t *opt, optlen;
|
|
|
|
u_int16_t mss = tcp_mssdflt;
|
|
|
|
|
|
|
|
hlen = th_off << 2; /* hlen <= sizeof(hdr) */
|
|
|
|
if (hlen <= sizeof(struct tcphdr))
|
|
|
|
return (0);
|
|
|
|
if (!pf_pull_hdr(m, off, hdr, hlen, NULL, NULL, af))
|
|
|
|
return (0);
|
|
|
|
opt = hdr + sizeof(struct tcphdr);
|
|
|
|
hlen -= sizeof(struct tcphdr);
|
|
|
|
while (hlen >= TCPOLEN_MAXSEG) {
|
|
|
|
switch (*opt) {
|
|
|
|
case TCPOPT_EOL:
|
|
|
|
case TCPOPT_NOP:
|
|
|
|
++opt;
|
|
|
|
--hlen;
|
|
|
|
break;
|
|
|
|
case TCPOPT_MAXSEG:
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)(opt + 2), (void *)&mss, 2);
|
2005-07-01 16:37:34 +04:00
|
|
|
NTOHS(mss);
|
2004-06-22 17:52:05 +04:00
|
|
|
/* FALLTHROUGH */
|
|
|
|
default:
|
|
|
|
optlen = opt[1];
|
|
|
|
if (optlen < 2)
|
|
|
|
optlen = 2;
|
|
|
|
hlen -= optlen;
|
|
|
|
opt += optlen;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (mss);
|
|
|
|
}
|
|
|
|
|
|
|
|
u_int16_t
|
|
|
|
pf_calc_mss(struct pf_addr *addr, sa_family_t af, u_int16_t offer)
|
|
|
|
{
|
2006-12-04 05:28:12 +03:00
|
|
|
struct route *rop = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
#ifdef INET
|
|
|
|
struct sockaddr_in *dst;
|
|
|
|
struct route ro;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
struct sockaddr_in6 *dst6;
|
|
|
|
struct route_in6 ro6;
|
|
|
|
#endif /* INET6 */
|
2005-06-15 05:48:20 +04:00
|
|
|
int hlen;
|
2004-06-22 17:52:05 +04:00
|
|
|
u_int16_t mss = tcp_mssdflt;
|
|
|
|
|
2005-06-15 05:48:20 +04:00
|
|
|
hlen = 0; /* XXXGCC - -Wunitialized m68k */
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
hlen = sizeof(struct ip);
|
|
|
|
bzero(&ro, sizeof(ro));
|
|
|
|
dst = (struct sockaddr_in *)&ro.ro_dst;
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr = addr->v4;
|
2006-12-04 05:28:12 +03:00
|
|
|
rop = &ro;
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
hlen = sizeof(struct ip6_hdr);
|
|
|
|
bzero(&ro6, sizeof(ro6));
|
|
|
|
dst6 = (struct sockaddr_in6 *)&ro6.ro_dst;
|
|
|
|
dst6->sin6_family = AF_INET6;
|
|
|
|
dst6->sin6_len = sizeof(*dst6);
|
|
|
|
dst6->sin6_addr = addr->v6;
|
2006-12-04 05:28:12 +03:00
|
|
|
rop = (struct route *)&ro6;
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
2006-12-04 05:28:12 +03:00
|
|
|
#ifdef __OpenBSD__
|
|
|
|
rtalloc_noclone(rop, NO_CLONING);
|
|
|
|
#else
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_init_noclone(rop);
|
2006-12-04 05:28:12 +03:00
|
|
|
#endif
|
2006-12-16 00:18:52 +03:00
|
|
|
if (rop->ro_rt != NULL) {
|
|
|
|
mss = rop->ro_rt->rt_ifp->if_mtu - hlen - sizeof(struct tcphdr);
|
2004-06-22 17:52:05 +04:00
|
|
|
mss = max(tcp_mssdflt, mss);
|
|
|
|
}
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_free(rop);
|
2004-06-22 17:52:05 +04:00
|
|
|
mss = min(mss, offer);
|
|
|
|
mss = max(mss, 64); /* sanity - at least max opt space */
|
|
|
|
return (mss);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pf_set_rt_ifp(struct pf_state *s, struct pf_addr *saddr)
|
|
|
|
{
|
|
|
|
struct pf_rule *r = s->rule.ptr;
|
|
|
|
|
|
|
|
s->rt_kif = NULL;
|
|
|
|
if (!r->rt || r->rt == PF_FASTROUTE)
|
|
|
|
return;
|
|
|
|
switch (s->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_map_addr(AF_INET, r, saddr, &s->rt_addr, NULL,
|
|
|
|
&s->nat_src_node);
|
|
|
|
s->rt_kif = r->rpool.cur->kif;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
pf_map_addr(AF_INET6, r, saddr, &s->rt_addr, NULL,
|
|
|
|
&s->nat_src_node);
|
|
|
|
s->rt_kif = r->rpool.cur->kif;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_tcp(struct pf_rule **rm, struct pf_state **sm, int direction,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pfi_kif *kif, struct mbuf *m, int off, void *h,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_pdesc *pd, struct pf_rule **am, struct pf_ruleset **rsm,
|
|
|
|
struct ifqueue *ifq)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_rule *nr = NULL;
|
|
|
|
struct pf_addr *saddr = pd->src, *daddr = pd->dst;
|
|
|
|
struct tcphdr *th = pd->hdr.tcp;
|
|
|
|
u_int16_t bport, nport = 0;
|
|
|
|
sa_family_t af = pd->af;
|
|
|
|
int lookup = -1;
|
2006-05-14 07:40:02 +04:00
|
|
|
uid_t uid = 0; /* XXX: GCC */
|
|
|
|
gid_t gid = 0; /* XXX: GCC */
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_rule *r, *a = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_src_node *nsn = NULL;
|
|
|
|
u_short reason;
|
|
|
|
int rewrite = 0;
|
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
|
|
|
u_int16_t mss = tcp_mssdflt;
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_check_congestion(ifq)) {
|
|
|
|
REASON_SET(&reason, PFRES_CONGEST);
|
2004-11-14 14:12:16 +03:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
bport = nport = th->th_sport;
|
|
|
|
/* check outgoing packet for BINAT/NAT */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_OUT, kif, &nsn,
|
|
|
|
saddr, th->th_sport, daddr, th->th_dport,
|
|
|
|
&pd->naddr, &nport)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, saddr, af);
|
|
|
|
pf_change_ap(saddr, &th->th_sport, pd->ip_sum,
|
|
|
|
&th->th_sum, &pd->naddr, nport, 0, af);
|
|
|
|
rewrite++;
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
bport = nport = th->th_dport;
|
|
|
|
/* check incoming packet for BINAT/RDR */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_IN, kif, &nsn,
|
|
|
|
saddr, th->th_sport, daddr, th->th_dport,
|
|
|
|
&pd->naddr, &nport)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, daddr, af);
|
|
|
|
pf_change_ap(daddr, &th->th_dport, pd->ip_sum,
|
|
|
|
&th->th_sum, &pd->naddr, nport, 0, af);
|
|
|
|
rewrite++;
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (r != NULL) {
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != IPPROTO_TCP)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->src.addr, saddr, af, r->src.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_SRC_ADDR].ptr;
|
|
|
|
else if (r->src.port_op && !pf_match_port(r->src.port_op,
|
|
|
|
r->src.port[0], r->src.port[1], th->th_sport))
|
|
|
|
r = r->skip[PF_SKIP_SRC_PORT].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->dst.addr, daddr, af, r->dst.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (r->dst.port_op && !pf_match_port(r->dst.port_op,
|
|
|
|
r->dst.port[0], r->dst.port[1], th->th_dport))
|
|
|
|
r = r->skip[PF_SKIP_DST_PORT].ptr;
|
|
|
|
else if (r->tos && !(r->tos & pd->tos))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->rule_flag & PFRULE_FRAGMENT)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if ((r->flagset & th->th_flags) != r->flags)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->uid.op && (lookup != -1 || (lookup =
|
|
|
|
pf_socket_lookup(&uid, &gid, direction, pd), 1)) &&
|
|
|
|
!pf_match_uid(r->uid.op, r->uid.uid[0], r->uid.uid[1],
|
|
|
|
uid))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->gid.op && (lookup != -1 || (lookup =
|
|
|
|
pf_socket_lookup(&uid, &gid, direction, pd), 1)) &&
|
|
|
|
!pf_match_gid(r->gid.op, r->gid.gid[0], r->gid.gid[1],
|
|
|
|
gid))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (r->prob && r->prob <= arc4random())
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->os_fingerprint != PF_OSFP_ANY && !pf_osfp_match(
|
|
|
|
pf_osfp_fingerprint(pd, m, off, th), r->os_fingerprint))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else {
|
|
|
|
if (r->tag)
|
|
|
|
tag = r->tag;
|
|
|
|
if (r->anchor == NULL) {
|
|
|
|
*rm = r;
|
|
|
|
*am = a;
|
|
|
|
*rsm = ruleset;
|
|
|
|
if ((*rm)->quick)
|
|
|
|
break;
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
} else
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_step_into_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
r = *rm;
|
|
|
|
a = *am;
|
|
|
|
ruleset = *rsm;
|
|
|
|
|
|
|
|
REASON_SET(&reason, PFRES_MATCH);
|
|
|
|
|
|
|
|
if (r->log) {
|
|
|
|
if (rewrite)
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*th), th);
|
2004-06-22 17:52:05 +04:00
|
|
|
PFLOG_PACKET(kif, h, m, af, direction, reason, r, a, ruleset);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((r->action == PF_DROP) &&
|
|
|
|
((r->rule_flag & PFRULE_RETURNRST) ||
|
|
|
|
(r->rule_flag & PFRULE_RETURNICMP) ||
|
|
|
|
(r->rule_flag & PFRULE_RETURN))) {
|
|
|
|
/* undo NAT changes, if they have taken place */
|
|
|
|
if (nr != NULL) {
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
pf_change_ap(saddr, &th->th_sport, pd->ip_sum,
|
|
|
|
&th->th_sum, &pd->baddr, bport, 0, af);
|
|
|
|
rewrite++;
|
|
|
|
} else {
|
|
|
|
pf_change_ap(daddr, &th->th_dport, pd->ip_sum,
|
|
|
|
&th->th_sum, &pd->baddr, bport, 0, af);
|
|
|
|
rewrite++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (((r->rule_flag & PFRULE_RETURNRST) ||
|
|
|
|
(r->rule_flag & PFRULE_RETURN)) &&
|
|
|
|
!(th->th_flags & TH_RST)) {
|
|
|
|
u_int32_t ack = ntohl(th->th_seq) + pd->p_len;
|
|
|
|
|
|
|
|
if (th->th_flags & TH_SYN)
|
|
|
|
ack++;
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
ack++;
|
|
|
|
pf_send_tcp(r, af, pd->dst,
|
|
|
|
pd->src, th->th_dport, th->th_sport,
|
|
|
|
ntohl(th->th_ack), ack, TH_RST|TH_ACK, 0, 0,
|
2006-10-08 01:45:49 +04:00
|
|
|
r->return_ttl, 1, 0, pd->eh, kif->pfik_ifp);
|
2004-06-22 17:52:05 +04:00
|
|
|
} else if ((af == AF_INET) && r->return_icmp)
|
|
|
|
pf_send_icmp(m, r->return_icmp >> 8,
|
|
|
|
r->return_icmp & 255, af, r);
|
|
|
|
else if ((af == AF_INET6) && r->return_icmp6)
|
|
|
|
pf_send_icmp(m, r->return_icmp6 >> 8,
|
|
|
|
r->return_icmp6 & 255, af, r);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->action == PF_DROP)
|
|
|
|
return (PF_DROP);
|
|
|
|
|
|
|
|
if (pf_tag_packet(m, pftag, tag)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->keep_state || nr != NULL ||
|
|
|
|
(pd->flags & PFDESC_TCP_NORM)) {
|
|
|
|
/* create new state */
|
|
|
|
u_int16_t len;
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
|
|
|
|
len = pd->tot_len - off - (th->th_off << 2);
|
|
|
|
|
|
|
|
/* check maximums */
|
2005-07-01 16:37:34 +04:00
|
|
|
if (r->max_states && (r->states >= r->max_states)) {
|
|
|
|
pf_status.lcounters[LCNT_STATES]++;
|
|
|
|
REASON_SET(&reason, PFRES_MAXSTATES);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for flter rule */
|
|
|
|
if ((r->rule_flag & PFRULE_SRCTRACK ||
|
|
|
|
r->rpool.opts & PF_POOL_STICKYADDR) &&
|
2005-07-01 16:37:34 +04:00
|
|
|
pf_insert_src_node(&sn, r, saddr, af) != 0) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for translation rule */
|
|
|
|
if (nr != NULL && (nr->rpool.opts & PF_POOL_STICKYADDR) &&
|
|
|
|
((direction == PF_OUT &&
|
|
|
|
pf_insert_src_node(&nsn, nr, &pd->baddr, af) != 0) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(pf_insert_src_node(&nsn, nr, saddr, af) != 0))) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
s = pool_get(&pf_state_pl, PR_NOWAIT);
|
|
|
|
if (s == NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
2004-06-22 17:52:05 +04:00
|
|
|
cleanup:
|
|
|
|
if (sn != NULL && sn->states == 0 && sn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, sn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, sn);
|
|
|
|
}
|
|
|
|
if (nsn != sn && nsn != NULL && nsn->states == 0 &&
|
|
|
|
nsn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, nsn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, nsn);
|
|
|
|
}
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
bzero(s, sizeof(*s));
|
|
|
|
s->rule.ptr = r;
|
|
|
|
s->nat_rule.ptr = nr;
|
|
|
|
s->anchor.ptr = a;
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_INC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
s->allow_opts = r->allow_opts;
|
|
|
|
s->log = r->log & 2;
|
|
|
|
s->proto = IPPROTO_TCP;
|
|
|
|
s->direction = direction;
|
|
|
|
s->af = af;
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
PF_ACPY(&s->gwy.addr, saddr, af);
|
|
|
|
s->gwy.port = th->th_sport; /* sport */
|
|
|
|
PF_ACPY(&s->ext.addr, daddr, af);
|
|
|
|
s->ext.port = th->th_dport;
|
|
|
|
if (nr != NULL) {
|
|
|
|
PF_ACPY(&s->lan.addr, &pd->baddr, af);
|
|
|
|
s->lan.port = bport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, &s->gwy.addr, af);
|
|
|
|
s->lan.port = s->gwy.port;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, daddr, af);
|
|
|
|
s->lan.port = th->th_dport;
|
|
|
|
PF_ACPY(&s->ext.addr, saddr, af);
|
|
|
|
s->ext.port = th->th_sport;
|
|
|
|
if (nr != NULL) {
|
|
|
|
PF_ACPY(&s->gwy.addr, &pd->baddr, af);
|
|
|
|
s->gwy.port = bport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->gwy.addr, &s->lan.addr, af);
|
|
|
|
s->gwy.port = s->lan.port;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
s->src.seqlo = ntohl(th->th_seq);
|
|
|
|
s->src.seqhi = s->src.seqlo + len + 1;
|
|
|
|
if ((th->th_flags & (TH_SYN|TH_ACK)) == TH_SYN &&
|
|
|
|
r->keep_state == PF_STATE_MODULATE) {
|
|
|
|
/* Generate sequence number modulator */
|
2004-11-14 14:12:16 +03:00
|
|
|
while ((s->src.seqdiff = htonl(arc4random())) == 0)
|
2004-06-22 17:52:05 +04:00
|
|
|
;
|
|
|
|
pf_change_a(&th->th_seq, &th->th_sum,
|
|
|
|
htonl(s->src.seqlo + s->src.seqdiff), 0);
|
|
|
|
rewrite = 1;
|
|
|
|
} else
|
|
|
|
s->src.seqdiff = 0;
|
2006-12-13 06:45:48 +03:00
|
|
|
s->src.max_win = MAX(ntohs(th->th_win), 1);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (th->th_flags & TH_SYN) {
|
|
|
|
s->src.seqhi++;
|
|
|
|
s->src.wscale = pf_get_wscale(m, off, th->th_off, af);
|
2006-12-13 06:45:48 +03:00
|
|
|
} else if (s->src.wscale & PF_WSCALE_MASK) {
|
2004-06-22 17:52:05 +04:00
|
|
|
/* Remove scale factor from initial window */
|
2006-12-13 06:45:48 +03:00
|
|
|
u_int win = s->src.max_win;
|
2004-06-22 17:52:05 +04:00
|
|
|
win += 1 << (s->src.wscale & PF_WSCALE_MASK);
|
|
|
|
s->src.max_win = (win - 1) >>
|
|
|
|
(s->src.wscale & PF_WSCALE_MASK);
|
|
|
|
}
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
s->src.seqhi++;
|
|
|
|
s->dst.seqhi = 1;
|
|
|
|
s->dst.max_win = 1;
|
|
|
|
s->src.state = TCPS_SYN_SENT;
|
|
|
|
s->dst.state = TCPS_CLOSED;
|
2004-11-14 14:12:16 +03:00
|
|
|
s->creation = time_second;
|
|
|
|
s->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
s->timeout = PFTM_TCP_FIRST_PACKET;
|
|
|
|
pf_set_rt_ifp(s, saddr);
|
|
|
|
if (sn != NULL) {
|
|
|
|
s->src_node = sn;
|
|
|
|
s->src_node->states++;
|
|
|
|
}
|
|
|
|
if (nsn != NULL) {
|
|
|
|
PF_ACPY(&nsn->raddr, &pd->naddr, af);
|
|
|
|
s->nat_src_node = nsn;
|
|
|
|
s->nat_src_node->states++;
|
|
|
|
}
|
|
|
|
if ((pd->flags & PFDESC_TCP_NORM) && pf_normalize_tcp_init(m,
|
|
|
|
off, pd, th, &s->src, &s->dst)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
if ((pd->flags & PFDESC_TCP_NORM) && s->src.scrub &&
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_normalize_tcp_stateful(m, off, pd, &reason, th, s,
|
|
|
|
&s->src, &s->dst, &rewrite)) {
|
|
|
|
/* This really shouldn't happen!!! */
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_normalize_tcp_stateful failed on first pkt"));
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_normalize_tcp_cleanup(s);
|
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
if (pf_insert_state(BOUND_IFACE(r, kif), s)) {
|
|
|
|
pf_normalize_tcp_cleanup(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_STATEINS);
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
} else
|
|
|
|
*sm = s;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (tag > 0) {
|
|
|
|
pf_tag_ref(tag);
|
|
|
|
s->tag = tag;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
if ((th->th_flags & (TH_SYN|TH_ACK)) == TH_SYN &&
|
|
|
|
r->keep_state == PF_STATE_SYNPROXY) {
|
|
|
|
s->src.state = PF_TCPS_PROXY_SRC;
|
|
|
|
if (nr != NULL) {
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
pf_change_ap(saddr, &th->th_sport,
|
|
|
|
pd->ip_sum, &th->th_sum, &pd->baddr,
|
|
|
|
bport, 0, af);
|
|
|
|
} else {
|
|
|
|
pf_change_ap(daddr, &th->th_dport,
|
|
|
|
pd->ip_sum, &th->th_sum, &pd->baddr,
|
|
|
|
bport, 0, af);
|
|
|
|
}
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
s->src.seqhi = htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
/* Find mss option */
|
|
|
|
mss = pf_get_mss(m, off, th->th_off, af);
|
|
|
|
mss = pf_calc_mss(saddr, af, mss);
|
|
|
|
mss = pf_calc_mss(daddr, af, mss);
|
|
|
|
s->src.mss = mss;
|
|
|
|
pf_send_tcp(r, af, daddr, saddr, th->th_dport,
|
|
|
|
th->th_sport, s->src.seqhi, ntohl(th->th_seq) + 1,
|
2006-10-08 01:45:49 +04:00
|
|
|
TH_SYN|TH_ACK, 0, s->src.mss, 0, 1, 0, NULL, NULL);
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_SYNPROXY_DROP);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* copy back packet headers if we performed NAT operations */
|
|
|
|
if (rewrite)
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*th), th);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_udp(struct pf_rule **rm, struct pf_state **sm, int direction,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pfi_kif *kif, struct mbuf *m, int off, void *h,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_pdesc *pd, struct pf_rule **am, struct pf_ruleset **rsm,
|
|
|
|
struct ifqueue *ifq)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_rule *nr = NULL;
|
|
|
|
struct pf_addr *saddr = pd->src, *daddr = pd->dst;
|
|
|
|
struct udphdr *uh = pd->hdr.udp;
|
|
|
|
u_int16_t bport, nport = 0;
|
|
|
|
sa_family_t af = pd->af;
|
|
|
|
int lookup = -1;
|
2006-05-14 07:40:02 +04:00
|
|
|
uid_t uid = 0; /* XXX: GCC */
|
|
|
|
gid_t gid = 0; /* XXX: GCC */
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_rule *r, *a = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_src_node *nsn = NULL;
|
|
|
|
u_short reason;
|
|
|
|
int rewrite = 0;
|
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_check_congestion(ifq)) {
|
|
|
|
REASON_SET(&reason, PFRES_CONGEST);
|
2004-11-14 14:12:16 +03:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
bport = nport = uh->uh_sport;
|
|
|
|
/* check outgoing packet for BINAT/NAT */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_OUT, kif, &nsn,
|
|
|
|
saddr, uh->uh_sport, daddr, uh->uh_dport,
|
|
|
|
&pd->naddr, &nport)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, saddr, af);
|
|
|
|
pf_change_ap(saddr, &uh->uh_sport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &pd->naddr, nport, 1, af);
|
|
|
|
rewrite++;
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
bport = nport = uh->uh_dport;
|
|
|
|
/* check incoming packet for BINAT/RDR */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_IN, kif, &nsn,
|
|
|
|
saddr, uh->uh_sport, daddr, uh->uh_dport, &pd->naddr,
|
|
|
|
&nport)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, daddr, af);
|
|
|
|
pf_change_ap(daddr, &uh->uh_dport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &pd->naddr, nport, 1, af);
|
|
|
|
rewrite++;
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (r != NULL) {
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != IPPROTO_UDP)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->src.addr, saddr, af, r->src.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_SRC_ADDR].ptr;
|
|
|
|
else if (r->src.port_op && !pf_match_port(r->src.port_op,
|
|
|
|
r->src.port[0], r->src.port[1], uh->uh_sport))
|
|
|
|
r = r->skip[PF_SKIP_SRC_PORT].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->dst.addr, daddr, af, r->dst.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (r->dst.port_op && !pf_match_port(r->dst.port_op,
|
|
|
|
r->dst.port[0], r->dst.port[1], uh->uh_dport))
|
|
|
|
r = r->skip[PF_SKIP_DST_PORT].ptr;
|
|
|
|
else if (r->tos && !(r->tos & pd->tos))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->rule_flag & PFRULE_FRAGMENT)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->uid.op && (lookup != -1 || (lookup =
|
|
|
|
pf_socket_lookup(&uid, &gid, direction, pd), 1)) &&
|
|
|
|
!pf_match_uid(r->uid.op, r->uid.uid[0], r->uid.uid[1],
|
|
|
|
uid))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->gid.op && (lookup != -1 || (lookup =
|
|
|
|
pf_socket_lookup(&uid, &gid, direction, pd), 1)) &&
|
|
|
|
!pf_match_gid(r->gid.op, r->gid.gid[0], r->gid.gid[1],
|
|
|
|
gid))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (r->prob && r->prob <= arc4random())
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->os_fingerprint != PF_OSFP_ANY)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else {
|
|
|
|
if (r->tag)
|
|
|
|
tag = r->tag;
|
|
|
|
if (r->anchor == NULL) {
|
|
|
|
*rm = r;
|
|
|
|
*am = a;
|
|
|
|
*rsm = ruleset;
|
|
|
|
if ((*rm)->quick)
|
|
|
|
break;
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
} else
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_step_into_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
r = *rm;
|
|
|
|
a = *am;
|
|
|
|
ruleset = *rsm;
|
|
|
|
|
|
|
|
REASON_SET(&reason, PFRES_MATCH);
|
|
|
|
|
|
|
|
if (r->log) {
|
|
|
|
if (rewrite)
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*uh), uh);
|
2004-06-22 17:52:05 +04:00
|
|
|
PFLOG_PACKET(kif, h, m, af, direction, reason, r, a, ruleset);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((r->action == PF_DROP) &&
|
|
|
|
((r->rule_flag & PFRULE_RETURNICMP) ||
|
|
|
|
(r->rule_flag & PFRULE_RETURN))) {
|
|
|
|
/* undo NAT changes, if they have taken place */
|
|
|
|
if (nr != NULL) {
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
pf_change_ap(saddr, &uh->uh_sport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &pd->baddr, bport, 1, af);
|
|
|
|
rewrite++;
|
|
|
|
} else {
|
|
|
|
pf_change_ap(daddr, &uh->uh_dport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &pd->baddr, bport, 1, af);
|
|
|
|
rewrite++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ((af == AF_INET) && r->return_icmp)
|
|
|
|
pf_send_icmp(m, r->return_icmp >> 8,
|
|
|
|
r->return_icmp & 255, af, r);
|
|
|
|
else if ((af == AF_INET6) && r->return_icmp6)
|
|
|
|
pf_send_icmp(m, r->return_icmp6 >> 8,
|
|
|
|
r->return_icmp6 & 255, af, r);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->action == PF_DROP)
|
|
|
|
return (PF_DROP);
|
|
|
|
|
|
|
|
if (pf_tag_packet(m, pftag, tag)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->keep_state || nr != NULL) {
|
|
|
|
/* create new state */
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
|
|
|
|
/* check maximums */
|
2005-07-01 16:37:34 +04:00
|
|
|
if (r->max_states && (r->states >= r->max_states)) {
|
|
|
|
pf_status.lcounters[LCNT_STATES]++;
|
|
|
|
REASON_SET(&reason, PFRES_MAXSTATES);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for flter rule */
|
|
|
|
if ((r->rule_flag & PFRULE_SRCTRACK ||
|
|
|
|
r->rpool.opts & PF_POOL_STICKYADDR) &&
|
2005-07-01 16:37:34 +04:00
|
|
|
pf_insert_src_node(&sn, r, saddr, af) != 0) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for translation rule */
|
|
|
|
if (nr != NULL && (nr->rpool.opts & PF_POOL_STICKYADDR) &&
|
|
|
|
((direction == PF_OUT &&
|
|
|
|
pf_insert_src_node(&nsn, nr, &pd->baddr, af) != 0) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(pf_insert_src_node(&nsn, nr, saddr, af) != 0))) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
s = pool_get(&pf_state_pl, PR_NOWAIT);
|
|
|
|
if (s == NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
2004-06-22 17:52:05 +04:00
|
|
|
cleanup:
|
|
|
|
if (sn != NULL && sn->states == 0 && sn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, sn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, sn);
|
|
|
|
}
|
|
|
|
if (nsn != sn && nsn != NULL && nsn->states == 0 &&
|
|
|
|
nsn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, nsn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, nsn);
|
|
|
|
}
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
bzero(s, sizeof(*s));
|
|
|
|
s->rule.ptr = r;
|
|
|
|
s->nat_rule.ptr = nr;
|
|
|
|
s->anchor.ptr = a;
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_INC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
s->allow_opts = r->allow_opts;
|
|
|
|
s->log = r->log & 2;
|
|
|
|
s->proto = IPPROTO_UDP;
|
|
|
|
s->direction = direction;
|
|
|
|
s->af = af;
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
PF_ACPY(&s->gwy.addr, saddr, af);
|
|
|
|
s->gwy.port = uh->uh_sport;
|
|
|
|
PF_ACPY(&s->ext.addr, daddr, af);
|
|
|
|
s->ext.port = uh->uh_dport;
|
|
|
|
if (nr != NULL) {
|
|
|
|
PF_ACPY(&s->lan.addr, &pd->baddr, af);
|
|
|
|
s->lan.port = bport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, &s->gwy.addr, af);
|
|
|
|
s->lan.port = s->gwy.port;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, daddr, af);
|
|
|
|
s->lan.port = uh->uh_dport;
|
|
|
|
PF_ACPY(&s->ext.addr, saddr, af);
|
|
|
|
s->ext.port = uh->uh_sport;
|
|
|
|
if (nr != NULL) {
|
|
|
|
PF_ACPY(&s->gwy.addr, &pd->baddr, af);
|
|
|
|
s->gwy.port = bport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->gwy.addr, &s->lan.addr, af);
|
|
|
|
s->gwy.port = s->lan.port;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s->src.state = PFUDPS_SINGLE;
|
|
|
|
s->dst.state = PFUDPS_NO_TRAFFIC;
|
2004-11-14 14:12:16 +03:00
|
|
|
s->creation = time_second;
|
|
|
|
s->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
s->timeout = PFTM_UDP_FIRST_PACKET;
|
|
|
|
pf_set_rt_ifp(s, saddr);
|
|
|
|
if (sn != NULL) {
|
|
|
|
s->src_node = sn;
|
|
|
|
s->src_node->states++;
|
|
|
|
}
|
|
|
|
if (nsn != NULL) {
|
|
|
|
PF_ACPY(&nsn->raddr, &pd->naddr, af);
|
|
|
|
s->nat_src_node = nsn;
|
|
|
|
s->nat_src_node->states++;
|
|
|
|
}
|
|
|
|
if (pf_insert_state(BOUND_IFACE(r, kif), s)) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_STATEINS);
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
} else
|
|
|
|
*sm = s;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (tag > 0) {
|
|
|
|
pf_tag_ref(tag);
|
|
|
|
s->tag = tag;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* copy back packet headers if we performed NAT operations */
|
|
|
|
if (rewrite)
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*uh), uh);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_icmp(struct pf_rule **rm, struct pf_state **sm, int direction,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pfi_kif *kif, struct mbuf *m, int off, void *h,
|
2004-11-14 14:12:16 +03:00
|
|
|
struct pf_pdesc *pd, struct pf_rule **am, struct pf_ruleset **rsm,
|
|
|
|
struct ifqueue *ifq)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_rule *nr = NULL;
|
|
|
|
struct pf_addr *saddr = pd->src, *daddr = pd->dst;
|
|
|
|
struct pf_rule *r, *a = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_src_node *nsn = NULL;
|
|
|
|
u_short reason;
|
2004-06-22 18:17:07 +04:00
|
|
|
u_int16_t icmpid = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
sa_family_t af = pd->af;
|
2004-06-22 18:17:07 +04:00
|
|
|
u_int8_t icmptype = 0, icmpcode = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
int state_icmp = 0;
|
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
|
|
|
#ifdef INET6
|
|
|
|
int rewrite = 0;
|
|
|
|
#endif /* INET6 */
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_check_congestion(ifq)) {
|
|
|
|
REASON_SET(&reason, PFRES_CONGEST);
|
2004-11-14 14:12:16 +03:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
switch (pd->proto) {
|
|
|
|
#ifdef INET
|
|
|
|
case IPPROTO_ICMP:
|
|
|
|
icmptype = pd->hdr.icmp->icmp_type;
|
|
|
|
icmpcode = pd->hdr.icmp->icmp_code;
|
|
|
|
icmpid = pd->hdr.icmp->icmp_id;
|
|
|
|
|
|
|
|
if (icmptype == ICMP_UNREACH ||
|
|
|
|
icmptype == ICMP_SOURCEQUENCH ||
|
|
|
|
icmptype == ICMP_REDIRECT ||
|
|
|
|
icmptype == ICMP_TIMXCEED ||
|
|
|
|
icmptype == ICMP_PARAMPROB)
|
|
|
|
state_icmp++;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case IPPROTO_ICMPV6:
|
|
|
|
icmptype = pd->hdr.icmp6->icmp6_type;
|
|
|
|
icmpcode = pd->hdr.icmp6->icmp6_code;
|
|
|
|
icmpid = pd->hdr.icmp6->icmp6_id;
|
|
|
|
|
|
|
|
if (icmptype == ICMP6_DST_UNREACH ||
|
|
|
|
icmptype == ICMP6_PACKET_TOO_BIG ||
|
|
|
|
icmptype == ICMP6_TIME_EXCEEDED ||
|
|
|
|
icmptype == ICMP6_PARAM_PROB)
|
|
|
|
state_icmp++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
/* check outgoing packet for BINAT/NAT */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_OUT, kif, &nsn,
|
2005-02-15 00:27:26 +03:00
|
|
|
saddr, icmpid, daddr, icmpid, &pd->naddr, NULL)) != NULL) {
|
2004-06-22 17:52:05 +04:00
|
|
|
PF_ACPY(&pd->baddr, saddr, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&saddr->v4.s_addr, pd->ip_sum,
|
|
|
|
pd->naddr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
pf_change_a6(saddr, &pd->hdr.icmp6->icmp6_cksum,
|
|
|
|
&pd->naddr, 0);
|
|
|
|
rewrite++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* check incoming packet for BINAT/RDR */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_IN, kif, &nsn,
|
2005-02-15 00:27:26 +03:00
|
|
|
saddr, icmpid, daddr, icmpid, &pd->naddr, NULL)) != NULL) {
|
2004-06-22 17:52:05 +04:00
|
|
|
PF_ACPY(&pd->baddr, daddr, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&daddr->v4.s_addr,
|
|
|
|
pd->ip_sum, pd->naddr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
pf_change_a6(daddr, &pd->hdr.icmp6->icmp6_cksum,
|
|
|
|
&pd->naddr, 0);
|
|
|
|
rewrite++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (r != NULL) {
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != pd->proto)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->src.addr, saddr, af, r->src.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_SRC_ADDR].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->dst.addr, daddr, af, r->dst.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (r->type && r->type != icmptype + 1)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->code && r->code != icmpcode + 1)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->tos && !(r->tos & pd->tos))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->rule_flag & PFRULE_FRAGMENT)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (r->prob && r->prob <= arc4random())
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->os_fingerprint != PF_OSFP_ANY)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else {
|
|
|
|
if (r->tag)
|
|
|
|
tag = r->tag;
|
|
|
|
if (r->anchor == NULL) {
|
|
|
|
*rm = r;
|
|
|
|
*am = a;
|
|
|
|
*rsm = ruleset;
|
|
|
|
if ((*rm)->quick)
|
|
|
|
break;
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
} else
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_step_into_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
r = *rm;
|
|
|
|
a = *am;
|
|
|
|
ruleset = *rsm;
|
|
|
|
|
|
|
|
REASON_SET(&reason, PFRES_MATCH);
|
|
|
|
|
|
|
|
if (r->log) {
|
|
|
|
#ifdef INET6
|
|
|
|
if (rewrite)
|
|
|
|
m_copyback(m, off, sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
#endif /* INET6 */
|
|
|
|
PFLOG_PACKET(kif, h, m, af, direction, reason, r, a, ruleset);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->action != PF_PASS)
|
|
|
|
return (PF_DROP);
|
|
|
|
|
|
|
|
if (pf_tag_packet(m, pftag, tag)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!state_icmp && (r->keep_state || nr != NULL)) {
|
|
|
|
/* create new state */
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
|
|
|
|
/* check maximums */
|
2005-07-01 16:37:34 +04:00
|
|
|
if (r->max_states && (r->states >= r->max_states)) {
|
|
|
|
pf_status.lcounters[LCNT_STATES]++;
|
|
|
|
REASON_SET(&reason, PFRES_MAXSTATES);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for flter rule */
|
|
|
|
if ((r->rule_flag & PFRULE_SRCTRACK ||
|
|
|
|
r->rpool.opts & PF_POOL_STICKYADDR) &&
|
2005-07-01 16:37:34 +04:00
|
|
|
pf_insert_src_node(&sn, r, saddr, af) != 0) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for translation rule */
|
|
|
|
if (nr != NULL && (nr->rpool.opts & PF_POOL_STICKYADDR) &&
|
|
|
|
((direction == PF_OUT &&
|
|
|
|
pf_insert_src_node(&nsn, nr, &pd->baddr, af) != 0) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(pf_insert_src_node(&nsn, nr, saddr, af) != 0))) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
s = pool_get(&pf_state_pl, PR_NOWAIT);
|
|
|
|
if (s == NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
2004-06-22 17:52:05 +04:00
|
|
|
cleanup:
|
|
|
|
if (sn != NULL && sn->states == 0 && sn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, sn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, sn);
|
|
|
|
}
|
|
|
|
if (nsn != sn && nsn != NULL && nsn->states == 0 &&
|
|
|
|
nsn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, nsn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, nsn);
|
|
|
|
}
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
bzero(s, sizeof(*s));
|
|
|
|
s->rule.ptr = r;
|
|
|
|
s->nat_rule.ptr = nr;
|
|
|
|
s->anchor.ptr = a;
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_INC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
s->allow_opts = r->allow_opts;
|
|
|
|
s->log = r->log & 2;
|
|
|
|
s->proto = pd->proto;
|
|
|
|
s->direction = direction;
|
|
|
|
s->af = af;
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
PF_ACPY(&s->gwy.addr, saddr, af);
|
|
|
|
s->gwy.port = icmpid;
|
|
|
|
PF_ACPY(&s->ext.addr, daddr, af);
|
|
|
|
s->ext.port = icmpid;
|
|
|
|
if (nr != NULL)
|
|
|
|
PF_ACPY(&s->lan.addr, &pd->baddr, af);
|
|
|
|
else
|
|
|
|
PF_ACPY(&s->lan.addr, &s->gwy.addr, af);
|
|
|
|
s->lan.port = icmpid;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, daddr, af);
|
|
|
|
s->lan.port = icmpid;
|
|
|
|
PF_ACPY(&s->ext.addr, saddr, af);
|
|
|
|
s->ext.port = icmpid;
|
|
|
|
if (nr != NULL)
|
|
|
|
PF_ACPY(&s->gwy.addr, &pd->baddr, af);
|
|
|
|
else
|
|
|
|
PF_ACPY(&s->gwy.addr, &s->lan.addr, af);
|
|
|
|
s->gwy.port = icmpid;
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
s->creation = time_second;
|
|
|
|
s->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
s->timeout = PFTM_ICMP_FIRST_PACKET;
|
|
|
|
pf_set_rt_ifp(s, saddr);
|
|
|
|
if (sn != NULL) {
|
|
|
|
s->src_node = sn;
|
|
|
|
s->src_node->states++;
|
|
|
|
}
|
|
|
|
if (nsn != NULL) {
|
|
|
|
PF_ACPY(&nsn->raddr, &pd->naddr, af);
|
|
|
|
s->nat_src_node = nsn;
|
|
|
|
s->nat_src_node->states++;
|
|
|
|
}
|
|
|
|
if (pf_insert_state(BOUND_IFACE(r, kif), s)) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_STATEINS);
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
} else
|
|
|
|
*sm = s;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (tag > 0) {
|
|
|
|
pf_tag_ref(tag);
|
|
|
|
s->tag = tag;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
/* copy back packet headers if we performed IPv6 NAT operations */
|
|
|
|
if (rewrite)
|
|
|
|
m_copyback(m, off, sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_other(struct pf_rule **rm, struct pf_state **sm, int direction,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pfi_kif *kif, struct mbuf *m, int off, void *h,
|
2006-10-12 05:30:41 +04:00
|
|
|
struct pf_pdesc *pd, struct pf_rule **am, struct pf_ruleset **rsm,
|
|
|
|
struct ifqueue *ifq)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_rule *nr = NULL;
|
|
|
|
struct pf_rule *r, *a = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_src_node *nsn = NULL;
|
|
|
|
struct pf_addr *saddr = pd->src, *daddr = pd->dst;
|
|
|
|
sa_family_t af = pd->af;
|
|
|
|
u_short reason;
|
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (pf_check_congestion(ifq)) {
|
|
|
|
REASON_SET(&reason, PFRES_CONGEST);
|
2004-11-14 14:12:16 +03:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
/* check outgoing packet for BINAT/NAT */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_OUT, kif, &nsn,
|
|
|
|
saddr, 0, daddr, 0, &pd->naddr, NULL)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, saddr, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&saddr->v4.s_addr, pd->ip_sum,
|
|
|
|
pd->naddr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
PF_ACPY(saddr, &pd->naddr, af);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* check incoming packet for BINAT/RDR */
|
|
|
|
if ((nr = pf_get_translation(pd, m, off, PF_IN, kif, &nsn,
|
|
|
|
saddr, 0, daddr, 0, &pd->naddr, NULL)) != NULL) {
|
|
|
|
PF_ACPY(&pd->baddr, daddr, af);
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&daddr->v4.s_addr,
|
|
|
|
pd->ip_sum, pd->naddr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
PF_ACPY(daddr, &pd->naddr, af);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
if (nr->natpass)
|
|
|
|
r = NULL;
|
|
|
|
pd->nat_rule = nr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (r != NULL) {
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != pd->proto)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->src.addr, pd->src, af, r->src.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_SRC_ADDR].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->dst.addr, pd->dst, af, r->dst.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (r->tos && !(r->tos & pd->tos))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->rule_flag & PFRULE_FRAGMENT)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (r->prob && r->prob <= arc4random())
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->os_fingerprint != PF_OSFP_ANY)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else {
|
|
|
|
if (r->tag)
|
|
|
|
tag = r->tag;
|
|
|
|
if (r->anchor == NULL) {
|
|
|
|
*rm = r;
|
|
|
|
*am = a;
|
|
|
|
*rsm = ruleset;
|
|
|
|
if ((*rm)->quick)
|
|
|
|
break;
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
} else
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_step_into_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
r = *rm;
|
|
|
|
a = *am;
|
|
|
|
ruleset = *rsm;
|
|
|
|
|
|
|
|
REASON_SET(&reason, PFRES_MATCH);
|
|
|
|
|
|
|
|
if (r->log)
|
|
|
|
PFLOG_PACKET(kif, h, m, af, direction, reason, r, a, ruleset);
|
|
|
|
|
|
|
|
if ((r->action == PF_DROP) &&
|
|
|
|
((r->rule_flag & PFRULE_RETURNICMP) ||
|
|
|
|
(r->rule_flag & PFRULE_RETURN))) {
|
|
|
|
struct pf_addr *a = NULL;
|
|
|
|
|
|
|
|
if (nr != NULL) {
|
|
|
|
if (direction == PF_OUT)
|
|
|
|
a = saddr;
|
|
|
|
else
|
|
|
|
a = daddr;
|
|
|
|
}
|
|
|
|
if (a != NULL) {
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&a->v4.s_addr, pd->ip_sum,
|
|
|
|
pd->baddr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
PF_ACPY(a, &pd->baddr, af);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ((af == AF_INET) && r->return_icmp)
|
|
|
|
pf_send_icmp(m, r->return_icmp >> 8,
|
|
|
|
r->return_icmp & 255, af, r);
|
|
|
|
else if ((af == AF_INET6) && r->return_icmp6)
|
|
|
|
pf_send_icmp(m, r->return_icmp6 >> 8,
|
|
|
|
r->return_icmp6 & 255, af, r);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->action != PF_PASS)
|
|
|
|
return (PF_DROP);
|
|
|
|
|
|
|
|
if (pf_tag_packet(m, pftag, tag)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->keep_state || nr != NULL) {
|
|
|
|
/* create new state */
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
|
|
|
|
/* check maximums */
|
2005-07-01 16:37:34 +04:00
|
|
|
if (r->max_states && (r->states >= r->max_states)) {
|
|
|
|
pf_status.lcounters[LCNT_STATES]++;
|
|
|
|
REASON_SET(&reason, PFRES_MAXSTATES);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for flter rule */
|
|
|
|
if ((r->rule_flag & PFRULE_SRCTRACK ||
|
|
|
|
r->rpool.opts & PF_POOL_STICKYADDR) &&
|
2005-07-01 16:37:34 +04:00
|
|
|
pf_insert_src_node(&sn, r, saddr, af) != 0) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
/* src node for translation rule */
|
|
|
|
if (nr != NULL && (nr->rpool.opts & PF_POOL_STICKYADDR) &&
|
|
|
|
((direction == PF_OUT &&
|
|
|
|
pf_insert_src_node(&nsn, nr, &pd->baddr, af) != 0) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(pf_insert_src_node(&nsn, nr, saddr, af) != 0))) {
|
|
|
|
REASON_SET(&reason, PFRES_SRCLIMIT);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto cleanup;
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
s = pool_get(&pf_state_pl, PR_NOWAIT);
|
|
|
|
if (s == NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
2004-06-22 17:52:05 +04:00
|
|
|
cleanup:
|
|
|
|
if (sn != NULL && sn->states == 0 && sn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, sn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, sn);
|
|
|
|
}
|
|
|
|
if (nsn != sn && nsn != NULL && nsn->states == 0 &&
|
|
|
|
nsn->expire == 0) {
|
|
|
|
RB_REMOVE(pf_src_tree, &tree_src_tracking, nsn);
|
|
|
|
pf_status.scounters[SCNT_SRC_NODE_REMOVALS]++;
|
|
|
|
pf_status.src_nodes--;
|
|
|
|
pool_put(&pf_src_tree_pl, nsn);
|
|
|
|
}
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
bzero(s, sizeof(*s));
|
|
|
|
s->rule.ptr = r;
|
|
|
|
s->nat_rule.ptr = nr;
|
|
|
|
s->anchor.ptr = a;
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_INC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
s->allow_opts = r->allow_opts;
|
|
|
|
s->log = r->log & 2;
|
|
|
|
s->proto = pd->proto;
|
|
|
|
s->direction = direction;
|
|
|
|
s->af = af;
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
PF_ACPY(&s->gwy.addr, saddr, af);
|
|
|
|
PF_ACPY(&s->ext.addr, daddr, af);
|
|
|
|
if (nr != NULL)
|
|
|
|
PF_ACPY(&s->lan.addr, &pd->baddr, af);
|
|
|
|
else
|
|
|
|
PF_ACPY(&s->lan.addr, &s->gwy.addr, af);
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&s->lan.addr, daddr, af);
|
|
|
|
PF_ACPY(&s->ext.addr, saddr, af);
|
|
|
|
if (nr != NULL)
|
|
|
|
PF_ACPY(&s->gwy.addr, &pd->baddr, af);
|
|
|
|
else
|
|
|
|
PF_ACPY(&s->gwy.addr, &s->lan.addr, af);
|
|
|
|
}
|
|
|
|
s->src.state = PFOTHERS_SINGLE;
|
|
|
|
s->dst.state = PFOTHERS_NO_TRAFFIC;
|
2004-11-14 14:12:16 +03:00
|
|
|
s->creation = time_second;
|
|
|
|
s->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
s->timeout = PFTM_OTHER_FIRST_PACKET;
|
|
|
|
pf_set_rt_ifp(s, saddr);
|
|
|
|
if (sn != NULL) {
|
|
|
|
s->src_node = sn;
|
|
|
|
s->src_node->states++;
|
|
|
|
}
|
|
|
|
if (nsn != NULL) {
|
|
|
|
PF_ACPY(&nsn->raddr, &pd->naddr, af);
|
|
|
|
s->nat_src_node = nsn;
|
|
|
|
s->nat_src_node->states++;
|
|
|
|
}
|
|
|
|
if (pf_insert_state(BOUND_IFACE(r, kif), s)) {
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_STATEINS);
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_src_tree_remove_state(s);
|
2005-07-01 16:37:34 +04:00
|
|
|
STATE_DEC_COUNTERS(s);
|
2004-06-22 17:52:05 +04:00
|
|
|
pool_put(&pf_state_pl, s);
|
|
|
|
return (PF_DROP);
|
|
|
|
} else
|
|
|
|
*sm = s;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (tag > 0) {
|
|
|
|
pf_tag_ref(tag);
|
|
|
|
s->tag = tag;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_fragment(struct pf_rule **rm, int direction, struct pfi_kif *kif,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct mbuf *m, void *h, struct pf_pdesc *pd, struct pf_rule **am,
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_ruleset **rsm)
|
|
|
|
{
|
|
|
|
struct pf_rule *r, *a = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
sa_family_t af = pd->af;
|
|
|
|
u_short reason;
|
|
|
|
struct pf_tag *pftag = NULL;
|
|
|
|
int tag = -1;
|
2004-11-14 14:12:16 +03:00
|
|
|
int asd = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr);
|
|
|
|
while (r != NULL) {
|
|
|
|
r->evaluations++;
|
|
|
|
if (r->kif != NULL &&
|
|
|
|
(r->kif != kif && r->kif != kif->pfik_parent) == !r->ifnot)
|
|
|
|
r = r->skip[PF_SKIP_IFP].ptr;
|
|
|
|
else if (r->direction && r->direction != direction)
|
|
|
|
r = r->skip[PF_SKIP_DIR].ptr;
|
|
|
|
else if (r->af && r->af != af)
|
|
|
|
r = r->skip[PF_SKIP_AF].ptr;
|
|
|
|
else if (r->proto && r->proto != pd->proto)
|
|
|
|
r = r->skip[PF_SKIP_PROTO].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->src.addr, pd->src, af, r->src.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_SRC_ADDR].ptr;
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (PF_MISMATCHAW(&r->dst.addr, pd->dst, af, r->dst.neg))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = r->skip[PF_SKIP_DST_ADDR].ptr;
|
|
|
|
else if (r->tos && !(r->tos & pd->tos))
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else if (r->src.port_op || r->dst.port_op ||
|
|
|
|
r->flagset || r->type || r->code ||
|
|
|
|
r->os_fingerprint != PF_OSFP_ANY)
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
2004-11-14 14:12:16 +03:00
|
|
|
else if (r->prob && r->prob <= arc4random())
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
2005-07-01 16:37:34 +04:00
|
|
|
else if (r->match_tag && !pf_match_tag(m, r, &pftag, &tag))
|
2004-06-22 17:52:05 +04:00
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
else {
|
|
|
|
if (r->anchor == NULL) {
|
|
|
|
*rm = r;
|
|
|
|
*am = a;
|
|
|
|
*rsm = ruleset;
|
|
|
|
if ((*rm)->quick)
|
|
|
|
break;
|
|
|
|
r = TAILQ_NEXT(r, entries);
|
|
|
|
} else
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_step_into_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
if (r == NULL)
|
|
|
|
pf_step_out_of_anchor(&asd, &ruleset,
|
|
|
|
PF_RULESET_FILTER, &r, &a);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
r = *rm;
|
|
|
|
a = *am;
|
|
|
|
ruleset = *rsm;
|
|
|
|
|
|
|
|
REASON_SET(&reason, PFRES_MATCH);
|
|
|
|
|
|
|
|
if (r->log)
|
|
|
|
PFLOG_PACKET(kif, h, m, af, direction, reason, r, a, ruleset);
|
|
|
|
|
|
|
|
if (r->action != PF_PASS)
|
|
|
|
return (PF_DROP);
|
|
|
|
|
|
|
|
if (pf_tag_packet(m, pftag, tag)) {
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_state_tcp(struct pf_state **state, int direction, struct pfi_kif *kif,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct mbuf *m, int off, void *h, struct pf_pdesc *pd,
|
2004-06-22 17:52:05 +04:00
|
|
|
u_short *reason)
|
|
|
|
{
|
|
|
|
struct pf_state key;
|
|
|
|
struct tcphdr *th = pd->hdr.tcp;
|
|
|
|
u_int16_t win = ntohs(th->th_win);
|
2004-11-14 14:12:16 +03:00
|
|
|
u_int32_t ack, end, seq, orig_seq;
|
2004-06-22 17:52:05 +04:00
|
|
|
u_int8_t sws, dws;
|
|
|
|
int ackskew;
|
|
|
|
int copyback = 0;
|
|
|
|
struct pf_state_peer *src, *dst;
|
|
|
|
|
|
|
|
key.af = pd->af;
|
|
|
|
key.proto = IPPROTO_TCP;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd->dst, key.af);
|
|
|
|
key.ext.port = th->th_sport;
|
|
|
|
key.gwy.port = th->th_dport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd->dst, key.af);
|
|
|
|
key.lan.port = th->th_sport;
|
|
|
|
key.ext.port = th->th_dport;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (direction == (*state)->direction) {
|
|
|
|
src = &(*state)->src;
|
|
|
|
dst = &(*state)->dst;
|
|
|
|
} else {
|
|
|
|
src = &(*state)->dst;
|
|
|
|
dst = &(*state)->src;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((*state)->src.state == PF_TCPS_PROXY_SRC) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (direction != (*state)->direction) {
|
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_SYNPROXY_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
if (th->th_flags & TH_SYN) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (ntohl(th->th_seq) != (*state)->src.seqlo) {
|
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_send_tcp((*state)->rule.ptr, pd->af, pd->dst,
|
|
|
|
pd->src, th->th_dport, th->th_sport,
|
|
|
|
(*state)->src.seqhi, ntohl(th->th_seq) + 1,
|
2004-11-14 14:12:16 +03:00
|
|
|
TH_SYN|TH_ACK, 0, (*state)->src.mss, 0, 1,
|
2006-10-08 01:45:49 +04:00
|
|
|
0, NULL, NULL);
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_SYNPROXY_DROP);
|
|
|
|
} else if (!(th->th_flags & TH_ACK) ||
|
|
|
|
(ntohl(th->th_ack) != (*state)->src.seqhi + 1) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(ntohl(th->th_seq) != (*state)->src.seqlo + 1)) {
|
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
} else if ((*state)->src_node != NULL &&
|
|
|
|
pf_src_connlimit(state)) {
|
|
|
|
REASON_SET(reason, PFRES_SRCLIMIT);
|
|
|
|
return (PF_DROP);
|
|
|
|
} else
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->src.state = PF_TCPS_PROXY_DST;
|
|
|
|
}
|
|
|
|
if ((*state)->src.state == PF_TCPS_PROXY_DST) {
|
|
|
|
struct pf_state_host *src, *dst;
|
|
|
|
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
src = &(*state)->gwy;
|
|
|
|
dst = &(*state)->ext;
|
|
|
|
} else {
|
|
|
|
src = &(*state)->ext;
|
|
|
|
dst = &(*state)->lan;
|
|
|
|
}
|
|
|
|
if (direction == (*state)->direction) {
|
|
|
|
if (((th->th_flags & (TH_SYN|TH_ACK)) != TH_ACK) ||
|
|
|
|
(ntohl(th->th_ack) != (*state)->src.seqhi + 1) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(ntohl(th->th_seq) != (*state)->src.seqlo + 1)) {
|
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->src.max_win = MAX(ntohs(th->th_win), 1);
|
|
|
|
if ((*state)->dst.seqhi == 1)
|
2004-11-14 14:12:16 +03:00
|
|
|
(*state)->dst.seqhi = htonl(arc4random());
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_send_tcp((*state)->rule.ptr, pd->af, &src->addr,
|
|
|
|
&dst->addr, src->port, dst->port,
|
|
|
|
(*state)->dst.seqhi, 0, TH_SYN, 0,
|
2006-10-08 01:45:49 +04:00
|
|
|
(*state)->src.mss, 0, 0, (*state)->tag, NULL, NULL);
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_SYNPROXY_DROP);
|
|
|
|
} else if (((th->th_flags & (TH_SYN|TH_ACK)) !=
|
|
|
|
(TH_SYN|TH_ACK)) ||
|
2005-07-01 16:37:34 +04:00
|
|
|
(ntohl(th->th_ack) != (*state)->dst.seqhi + 1)) {
|
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
} else {
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->dst.max_win = MAX(ntohs(th->th_win), 1);
|
|
|
|
(*state)->dst.seqlo = ntohl(th->th_seq);
|
|
|
|
pf_send_tcp((*state)->rule.ptr, pd->af, pd->dst,
|
|
|
|
pd->src, th->th_dport, th->th_sport,
|
|
|
|
ntohl(th->th_ack), ntohl(th->th_seq) + 1,
|
2004-11-21 20:59:24 +03:00
|
|
|
TH_ACK, (*state)->src.max_win, 0, 0, 0,
|
2006-10-08 01:45:49 +04:00
|
|
|
(*state)->tag, NULL, NULL);
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_send_tcp((*state)->rule.ptr, pd->af, &src->addr,
|
|
|
|
&dst->addr, src->port, dst->port,
|
|
|
|
(*state)->src.seqhi + 1, (*state)->src.seqlo + 1,
|
2004-11-21 20:59:24 +03:00
|
|
|
TH_ACK, (*state)->dst.max_win, 0, 0, 1,
|
2006-10-08 01:45:49 +04:00
|
|
|
0, NULL, NULL);
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->src.seqdiff = (*state)->dst.seqhi -
|
|
|
|
(*state)->src.seqlo;
|
|
|
|
(*state)->dst.seqdiff = (*state)->src.seqhi -
|
|
|
|
(*state)->dst.seqlo;
|
|
|
|
(*state)->src.seqhi = (*state)->src.seqlo +
|
|
|
|
(*state)->dst.max_win;
|
2006-10-08 01:45:49 +04:00
|
|
|
(*state)->dst.seqhi = (*state)->dst.seqlo +
|
|
|
|
(*state)->src.max_win;
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->src.wscale = (*state)->dst.wscale = 0;
|
|
|
|
(*state)->src.state = (*state)->dst.state =
|
|
|
|
TCPS_ESTABLISHED;
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_SYNPROXY);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_SYNPROXY_DROP);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (src->wscale && dst->wscale && !(th->th_flags & TH_SYN)) {
|
|
|
|
sws = src->wscale & PF_WSCALE_MASK;
|
|
|
|
dws = dst->wscale & PF_WSCALE_MASK;
|
|
|
|
} else
|
|
|
|
sws = dws = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sequence tracking algorithm from Guido van Rooij's paper:
|
|
|
|
* http://www.madison-gurkha.com/publications/tcp_filtering/
|
|
|
|
* tcp_filtering.ps
|
|
|
|
*/
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
orig_seq = seq = ntohl(th->th_seq);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (src->seqlo == 0) {
|
|
|
|
/* First packet from this end. Set its state */
|
|
|
|
|
|
|
|
if ((pd->flags & PFDESC_TCP_NORM || dst->scrub) &&
|
|
|
|
src->scrub == NULL) {
|
|
|
|
if (pf_normalize_tcp_init(m, off, pd, th, src, dst)) {
|
|
|
|
REASON_SET(reason, PFRES_MEMORY);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Deferred generation of sequence number modulator */
|
|
|
|
if (dst->seqdiff && !src->seqdiff) {
|
2004-11-14 14:12:16 +03:00
|
|
|
while ((src->seqdiff = htonl(arc4random())) == 0)
|
2004-06-22 17:52:05 +04:00
|
|
|
;
|
|
|
|
ack = ntohl(th->th_ack) - dst->seqdiff;
|
|
|
|
pf_change_a(&th->th_seq, &th->th_sum, htonl(seq +
|
|
|
|
src->seqdiff), 0);
|
|
|
|
pf_change_a(&th->th_ack, &th->th_sum, htonl(ack), 0);
|
|
|
|
copyback = 1;
|
|
|
|
} else {
|
|
|
|
ack = ntohl(th->th_ack);
|
|
|
|
}
|
|
|
|
|
|
|
|
end = seq + pd->p_len;
|
|
|
|
if (th->th_flags & TH_SYN) {
|
|
|
|
end++;
|
|
|
|
if (dst->wscale & PF_WSCALE_FLAG) {
|
|
|
|
src->wscale = pf_get_wscale(m, off, th->th_off,
|
|
|
|
pd->af);
|
|
|
|
if (src->wscale & PF_WSCALE_FLAG) {
|
|
|
|
/* Remove scale factor from initial
|
|
|
|
* window */
|
|
|
|
sws = src->wscale & PF_WSCALE_MASK;
|
|
|
|
win = ((u_int32_t)win + (1 << sws) - 1)
|
|
|
|
>> sws;
|
|
|
|
dws = dst->wscale & PF_WSCALE_MASK;
|
|
|
|
} else {
|
|
|
|
/* fixup other window */
|
|
|
|
dst->max_win <<= dst->wscale &
|
|
|
|
PF_WSCALE_MASK;
|
|
|
|
/* in case of a retrans SYN|ACK */
|
|
|
|
dst->wscale = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
end++;
|
|
|
|
|
|
|
|
src->seqlo = seq;
|
|
|
|
if (src->state < TCPS_SYN_SENT)
|
|
|
|
src->state = TCPS_SYN_SENT;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* May need to slide the window (seqhi may have been set by
|
|
|
|
* the crappy stack check or if we picked up the connection
|
|
|
|
* after establishment)
|
|
|
|
*/
|
|
|
|
if (src->seqhi == 1 ||
|
|
|
|
SEQ_GEQ(end + MAX(1, dst->max_win << dws), src->seqhi))
|
|
|
|
src->seqhi = end + MAX(1, dst->max_win << dws);
|
|
|
|
if (win > src->max_win)
|
|
|
|
src->max_win = win;
|
|
|
|
|
|
|
|
} else {
|
|
|
|
ack = ntohl(th->th_ack) - dst->seqdiff;
|
|
|
|
if (src->seqdiff) {
|
|
|
|
/* Modulate sequence numbers */
|
|
|
|
pf_change_a(&th->th_seq, &th->th_sum, htonl(seq +
|
|
|
|
src->seqdiff), 0);
|
|
|
|
pf_change_a(&th->th_ack, &th->th_sum, htonl(ack), 0);
|
|
|
|
copyback = 1;
|
|
|
|
}
|
|
|
|
end = seq + pd->p_len;
|
|
|
|
if (th->th_flags & TH_SYN)
|
|
|
|
end++;
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
end++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((th->th_flags & TH_ACK) == 0) {
|
|
|
|
/* Let it pass through the ack skew check */
|
|
|
|
ack = dst->seqlo;
|
|
|
|
} else if ((ack == 0 &&
|
|
|
|
(th->th_flags & (TH_ACK|TH_RST)) == (TH_ACK|TH_RST)) ||
|
|
|
|
/* broken tcp stacks do not set ack */
|
|
|
|
(dst->state < TCPS_SYN_SENT)) {
|
|
|
|
/*
|
|
|
|
* Many stacks (ours included) will set the ACK number in an
|
|
|
|
* FIN|ACK if the SYN times out -- no sequence to ACK.
|
|
|
|
*/
|
|
|
|
ack = dst->seqlo;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (seq == end) {
|
|
|
|
/* Ease sequencing restrictions on no data packets */
|
|
|
|
seq = src->seqlo;
|
|
|
|
end = seq;
|
|
|
|
}
|
|
|
|
|
|
|
|
ackskew = dst->seqlo - ack;
|
|
|
|
|
|
|
|
#define MAXACKWINDOW (0xffff + 1500) /* 1500 is an arbitrary fudge factor */
|
|
|
|
if (SEQ_GEQ(src->seqhi, end) &&
|
|
|
|
/* Last octet inside other's window space */
|
|
|
|
SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws)) &&
|
|
|
|
/* Retrans: not more than one window back */
|
|
|
|
(ackskew >= -MAXACKWINDOW) &&
|
|
|
|
/* Acking not more than one reassembled fragment backwards */
|
2004-11-14 14:12:16 +03:00
|
|
|
(ackskew <= (MAXACKWINDOW << sws)) &&
|
2004-06-22 17:52:05 +04:00
|
|
|
/* Acking not more than one window forward */
|
2004-11-14 14:12:16 +03:00
|
|
|
((th->th_flags & TH_RST) == 0 || orig_seq == src->seqlo ||
|
|
|
|
(pd->flags & PFDESC_IP_REAS) == 0)) {
|
|
|
|
/* Require an exact sequence match on resets when possible */
|
|
|
|
|
|
|
|
if (dst->scrub || src->scrub) {
|
|
|
|
if (pf_normalize_tcp_stateful(m, off, pd, reason, th,
|
|
|
|
*state, src, dst, ©back))
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/* update max window */
|
|
|
|
if (src->max_win < win)
|
|
|
|
src->max_win = win;
|
|
|
|
/* synchronize sequencing */
|
|
|
|
if (SEQ_GT(end, src->seqlo))
|
|
|
|
src->seqlo = end;
|
|
|
|
/* slide the window of what the other end can send */
|
|
|
|
if (SEQ_GEQ(ack + (win << sws), dst->seqhi))
|
|
|
|
dst->seqhi = ack + MAX((win << sws), 1);
|
|
|
|
|
|
|
|
|
|
|
|
/* update states */
|
|
|
|
if (th->th_flags & TH_SYN)
|
|
|
|
if (src->state < TCPS_SYN_SENT)
|
|
|
|
src->state = TCPS_SYN_SENT;
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
if (src->state < TCPS_CLOSING)
|
|
|
|
src->state = TCPS_CLOSING;
|
|
|
|
if (th->th_flags & TH_ACK) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (dst->state == TCPS_SYN_SENT) {
|
2004-06-22 17:52:05 +04:00
|
|
|
dst->state = TCPS_ESTABLISHED;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (src->state == TCPS_ESTABLISHED &&
|
|
|
|
(*state)->src_node != NULL &&
|
|
|
|
pf_src_connlimit(state)) {
|
|
|
|
REASON_SET(reason, PFRES_SRCLIMIT);
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
} else if (dst->state == TCPS_CLOSING)
|
2004-06-22 17:52:05 +04:00
|
|
|
dst->state = TCPS_FIN_WAIT_2;
|
|
|
|
}
|
|
|
|
if (th->th_flags & TH_RST)
|
|
|
|
src->state = dst->state = TCPS_TIME_WAIT;
|
|
|
|
|
|
|
|
/* update expire time */
|
2004-11-14 14:12:16 +03:00
|
|
|
(*state)->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
if (src->state >= TCPS_FIN_WAIT_2 &&
|
|
|
|
dst->state >= TCPS_FIN_WAIT_2)
|
|
|
|
(*state)->timeout = PFTM_TCP_CLOSED;
|
|
|
|
else if (src->state >= TCPS_FIN_WAIT_2 ||
|
|
|
|
dst->state >= TCPS_FIN_WAIT_2)
|
|
|
|
(*state)->timeout = PFTM_TCP_FIN_WAIT;
|
|
|
|
else if (src->state < TCPS_ESTABLISHED ||
|
|
|
|
dst->state < TCPS_ESTABLISHED)
|
|
|
|
(*state)->timeout = PFTM_TCP_OPENING;
|
|
|
|
else if (src->state >= TCPS_CLOSING ||
|
|
|
|
dst->state >= TCPS_CLOSING)
|
|
|
|
(*state)->timeout = PFTM_TCP_CLOSING;
|
|
|
|
else
|
|
|
|
(*state)->timeout = PFTM_TCP_ESTABLISHED;
|
|
|
|
|
|
|
|
/* Fall through to PASS packet */
|
|
|
|
|
|
|
|
} else if ((dst->state < TCPS_SYN_SENT ||
|
|
|
|
dst->state >= TCPS_FIN_WAIT_2 ||
|
|
|
|
src->state >= TCPS_FIN_WAIT_2) &&
|
|
|
|
SEQ_GEQ(src->seqhi + MAXACKWINDOW, end) &&
|
|
|
|
/* Within a window forward of the originating packet */
|
|
|
|
SEQ_GEQ(seq, src->seqlo - MAXACKWINDOW)) {
|
|
|
|
/* Within a window backward of the originating packet */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This currently handles three situations:
|
|
|
|
* 1) Stupid stacks will shotgun SYNs before their peer
|
|
|
|
* replies.
|
|
|
|
* 2) When PF catches an already established stream (the
|
|
|
|
* firewall rebooted, the state table was flushed, routes
|
|
|
|
* changed...)
|
|
|
|
* 3) Packets get funky immediately after the connection
|
|
|
|
* closes (this should catch Solaris spurious ACK|FINs
|
|
|
|
* that web servers like to spew after a close)
|
|
|
|
*
|
|
|
|
* This must be a little more careful than the above code
|
|
|
|
* since packet floods will also be caught here. We don't
|
|
|
|
* update the TTL here to mitigate the damage of a packet
|
|
|
|
* flood and so the same code can handle awkward establishment
|
|
|
|
* and a loosened connection close.
|
|
|
|
* In the establishment case, a correct peer response will
|
|
|
|
* validate the connection, go through the normal state code
|
|
|
|
* and keep updating the state TTL.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: loose state match: ");
|
|
|
|
pf_print_state(*state);
|
|
|
|
pf_print_flags(th->th_flags);
|
|
|
|
printf(" seq=%u ack=%u len=%u ackskew=%d pkts=%d:%d\n",
|
|
|
|
seq, ack, pd->p_len, ackskew,
|
|
|
|
(*state)->packets[0], (*state)->packets[1]);
|
|
|
|
}
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if (dst->scrub || src->scrub) {
|
|
|
|
if (pf_normalize_tcp_stateful(m, off, pd, reason, th,
|
|
|
|
*state, src, dst, ©back))
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
/* update max window */
|
|
|
|
if (src->max_win < win)
|
|
|
|
src->max_win = win;
|
|
|
|
/* synchronize sequencing */
|
|
|
|
if (SEQ_GT(end, src->seqlo))
|
|
|
|
src->seqlo = end;
|
|
|
|
/* slide the window of what the other end can send */
|
|
|
|
if (SEQ_GEQ(ack + (win << sws), dst->seqhi))
|
|
|
|
dst->seqhi = ack + MAX((win << sws), 1);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Cannot set dst->seqhi here since this could be a shotgunned
|
|
|
|
* SYN and not an already established connection.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (th->th_flags & TH_FIN)
|
|
|
|
if (src->state < TCPS_CLOSING)
|
|
|
|
src->state = TCPS_CLOSING;
|
|
|
|
if (th->th_flags & TH_RST)
|
|
|
|
src->state = dst->state = TCPS_TIME_WAIT;
|
|
|
|
|
|
|
|
/* Fall through to PASS packet */
|
|
|
|
|
|
|
|
} else {
|
|
|
|
if ((*state)->dst.state == TCPS_SYN_SENT &&
|
|
|
|
(*state)->src.state == TCPS_SYN_SENT) {
|
|
|
|
/* Send RST for state mismatches during handshake */
|
2004-11-21 20:57:52 +03:00
|
|
|
if (!(th->th_flags & TH_RST))
|
2004-06-22 17:52:05 +04:00
|
|
|
pf_send_tcp((*state)->rule.ptr, pd->af,
|
|
|
|
pd->dst, pd->src, th->th_dport,
|
2004-11-21 20:57:52 +03:00
|
|
|
th->th_sport, ntohl(th->th_ack), 0,
|
|
|
|
TH_RST, 0, 0,
|
2006-10-08 01:45:49 +04:00
|
|
|
(*state)->rule.ptr->return_ttl, 1, 0,
|
2004-11-14 14:12:16 +03:00
|
|
|
pd->eh, kif->pfik_ifp);
|
2004-06-22 17:52:05 +04:00
|
|
|
src->seqlo = 0;
|
|
|
|
src->seqhi = 1;
|
|
|
|
src->max_win = 1;
|
|
|
|
} else if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: BAD state: ");
|
|
|
|
pf_print_state(*state);
|
|
|
|
pf_print_flags(th->th_flags);
|
|
|
|
printf(" seq=%u ack=%u len=%u ackskew=%d pkts=%d:%d "
|
|
|
|
"dir=%s,%s\n", seq, ack, pd->p_len, ackskew,
|
|
|
|
(*state)->packets[0], (*state)->packets[1],
|
|
|
|
direction == PF_IN ? "in" : "out",
|
|
|
|
direction == (*state)->direction ? "fwd" : "rev");
|
|
|
|
printf("pf: State failure on: %c %c %c %c | %c %c\n",
|
|
|
|
SEQ_GEQ(src->seqhi, end) ? ' ' : '1',
|
|
|
|
SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws)) ?
|
|
|
|
' ': '2',
|
|
|
|
(ackskew >= -MAXACKWINDOW) ? ' ' : '3',
|
|
|
|
(ackskew <= (MAXACKWINDOW << sws)) ? ' ' : '4',
|
|
|
|
SEQ_GEQ(src->seqhi + MAXACKWINDOW, end) ?' ' :'5',
|
|
|
|
SEQ_GEQ(seq, src->seqlo - MAXACKWINDOW) ?' ' :'6');
|
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_BADSTATE);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Any packets which have gotten here are to be passed */
|
|
|
|
|
|
|
|
/* translate source/destination address, if necessary */
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_OUT)
|
|
|
|
pf_change_ap(pd->src, &th->th_sport, pd->ip_sum,
|
|
|
|
&th->th_sum, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, 0, pd->af);
|
|
|
|
else
|
|
|
|
pf_change_ap(pd->dst, &th->th_dport, pd->ip_sum,
|
|
|
|
&th->th_sum, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, 0, pd->af);
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*th), th);
|
2004-06-22 17:52:05 +04:00
|
|
|
} else if (copyback) {
|
|
|
|
/* Copyback sequence modulation or stateful scrub changes */
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*th), th);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_state_udp(struct pf_state **state, int direction, struct pfi_kif *kif,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct mbuf *m, int off, void *h, struct pf_pdesc *pd)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_state_peer *src, *dst;
|
|
|
|
struct pf_state key;
|
|
|
|
struct udphdr *uh = pd->hdr.udp;
|
|
|
|
|
|
|
|
key.af = pd->af;
|
|
|
|
key.proto = IPPROTO_UDP;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd->dst, key.af);
|
|
|
|
key.ext.port = uh->uh_sport;
|
|
|
|
key.gwy.port = uh->uh_dport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd->dst, key.af);
|
|
|
|
key.lan.port = uh->uh_sport;
|
|
|
|
key.ext.port = uh->uh_dport;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (direction == (*state)->direction) {
|
|
|
|
src = &(*state)->src;
|
|
|
|
dst = &(*state)->dst;
|
|
|
|
} else {
|
|
|
|
src = &(*state)->dst;
|
|
|
|
dst = &(*state)->src;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update states */
|
|
|
|
if (src->state < PFUDPS_SINGLE)
|
|
|
|
src->state = PFUDPS_SINGLE;
|
|
|
|
if (dst->state == PFUDPS_SINGLE)
|
|
|
|
dst->state = PFUDPS_MULTIPLE;
|
|
|
|
|
|
|
|
/* update expire time */
|
2004-11-14 14:12:16 +03:00
|
|
|
(*state)->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
if (src->state == PFUDPS_MULTIPLE && dst->state == PFUDPS_MULTIPLE)
|
|
|
|
(*state)->timeout = PFTM_UDP_MULTIPLE;
|
|
|
|
else
|
|
|
|
(*state)->timeout = PFTM_UDP_SINGLE;
|
|
|
|
|
|
|
|
/* translate source/destination address, if necessary */
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_OUT)
|
|
|
|
pf_change_ap(pd->src, &uh->uh_sport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, 1, pd->af);
|
|
|
|
else
|
|
|
|
pf_change_ap(pd->dst, &uh->uh_dport, pd->ip_sum,
|
|
|
|
&uh->uh_sum, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, 1, pd->af);
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, sizeof(*uh), uh);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_state_icmp(struct pf_state **state, int direction, struct pfi_kif *kif,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct mbuf *m, int off, void *h, struct pf_pdesc *pd,
|
2006-10-12 05:30:41 +04:00
|
|
|
u_short *reason)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pf_addr *saddr = pd->src, *daddr = pd->dst;
|
2005-06-15 05:48:20 +04:00
|
|
|
u_int16_t icmpid = 0, *icmpsum;
|
|
|
|
u_int8_t icmptype;
|
2004-06-22 17:52:05 +04:00
|
|
|
int state_icmp = 0;
|
|
|
|
|
2005-06-15 05:48:20 +04:00
|
|
|
icmpsum = NULL; /* XXXGCC -Wunitialized m68k */
|
|
|
|
icmptype = 0; /* XXXGCC -Wunitialized m68k */
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
switch (pd->proto) {
|
|
|
|
#ifdef INET
|
|
|
|
case IPPROTO_ICMP:
|
|
|
|
icmptype = pd->hdr.icmp->icmp_type;
|
|
|
|
icmpid = pd->hdr.icmp->icmp_id;
|
|
|
|
icmpsum = &pd->hdr.icmp->icmp_cksum;
|
|
|
|
|
|
|
|
if (icmptype == ICMP_UNREACH ||
|
|
|
|
icmptype == ICMP_SOURCEQUENCH ||
|
|
|
|
icmptype == ICMP_REDIRECT ||
|
|
|
|
icmptype == ICMP_TIMXCEED ||
|
|
|
|
icmptype == ICMP_PARAMPROB)
|
|
|
|
state_icmp++;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case IPPROTO_ICMPV6:
|
|
|
|
icmptype = pd->hdr.icmp6->icmp6_type;
|
|
|
|
icmpid = pd->hdr.icmp6->icmp6_id;
|
|
|
|
icmpsum = &pd->hdr.icmp6->icmp6_cksum;
|
|
|
|
|
|
|
|
if (icmptype == ICMP6_DST_UNREACH ||
|
|
|
|
icmptype == ICMP6_PACKET_TOO_BIG ||
|
|
|
|
icmptype == ICMP6_TIME_EXCEEDED ||
|
|
|
|
icmptype == ICMP6_PARAM_PROB)
|
|
|
|
state_icmp++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!state_icmp) {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ICMP query/reply message not related to a TCP/UDP packet.
|
|
|
|
* Search for an ICMP state.
|
|
|
|
*/
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
key.af = pd->af;
|
|
|
|
key.proto = pd->proto;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd->dst, key.af);
|
|
|
|
key.ext.port = icmpid;
|
|
|
|
key.gwy.port = icmpid;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd->dst, key.af);
|
|
|
|
key.lan.port = icmpid;
|
|
|
|
key.ext.port = icmpid;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
(*state)->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
(*state)->timeout = PFTM_ICMP_ERROR_REPLY;
|
|
|
|
|
|
|
|
/* translate source/destination address, if necessary */
|
|
|
|
if (PF_ANEQ(&(*state)->lan.addr, &(*state)->gwy.addr, pd->af)) {
|
|
|
|
if (direction == PF_OUT) {
|
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&saddr->v4.s_addr,
|
|
|
|
pd->ip_sum,
|
|
|
|
(*state)->gwy.addr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
pf_change_a6(saddr,
|
|
|
|
&pd->hdr.icmp6->icmp6_cksum,
|
|
|
|
&(*state)->gwy.addr, 0);
|
|
|
|
m_copyback(m, off,
|
|
|
|
sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&daddr->v4.s_addr,
|
|
|
|
pd->ip_sum,
|
|
|
|
(*state)->lan.addr.v4.s_addr, 0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
pf_change_a6(daddr,
|
|
|
|
&pd->hdr.icmp6->icmp6_cksum,
|
|
|
|
&(*state)->lan.addr, 0);
|
|
|
|
m_copyback(m, off,
|
|
|
|
sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* ICMP error message in response to a TCP/UDP packet.
|
|
|
|
* Extract the inner TCP/UDP header and search for that state.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct pf_pdesc pd2;
|
|
|
|
#ifdef INET
|
|
|
|
struct ip h2;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
struct ip6_hdr h2_6;
|
|
|
|
int terminal = 0;
|
|
|
|
#endif /* INET6 */
|
2004-06-22 18:17:07 +04:00
|
|
|
int ipoff2 = 0;
|
|
|
|
int off2 = 0;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2006-05-11 05:08:38 +04:00
|
|
|
memset(&pd2, 0, sizeof pd2); /* XXX gcc */
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
pd2.af = pd->af;
|
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
/* offset of h2 in mbuf chain */
|
|
|
|
ipoff2 = off + ICMP_MINLEN;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, ipoff2, &h2, sizeof(h2),
|
2005-07-01 16:37:34 +04:00
|
|
|
NULL, reason, pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short "
|
|
|
|
"(ip)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* ICMP error messages don't refer to non-first
|
|
|
|
* fragments
|
|
|
|
*/
|
2005-07-01 16:37:34 +04:00
|
|
|
if (h2.ip_off & htons(IP_OFFMASK)) {
|
|
|
|
REASON_SET(reason, PFRES_FRAG);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/* offset of protocol header that follows h2 */
|
|
|
|
off2 = ipoff2 + (h2.ip_hl << 2);
|
|
|
|
|
|
|
|
pd2.proto = h2.ip_p;
|
|
|
|
pd2.src = (struct pf_addr *)&h2.ip_src;
|
|
|
|
pd2.dst = (struct pf_addr *)&h2.ip_dst;
|
|
|
|
pd2.ip_sum = &h2.ip_sum;
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
ipoff2 = off + sizeof(struct icmp6_hdr);
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, ipoff2, &h2_6, sizeof(h2_6),
|
2005-07-01 16:37:34 +04:00
|
|
|
NULL, reason, pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short "
|
|
|
|
"(ip6)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
pd2.proto = h2_6.ip6_nxt;
|
|
|
|
pd2.src = (struct pf_addr *)&h2_6.ip6_src;
|
|
|
|
pd2.dst = (struct pf_addr *)&h2_6.ip6_dst;
|
|
|
|
pd2.ip_sum = NULL;
|
|
|
|
off2 = ipoff2 + sizeof(h2_6);
|
|
|
|
do {
|
|
|
|
switch (pd2.proto) {
|
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
/*
|
|
|
|
* ICMPv6 error messages for
|
|
|
|
* non-first fragments
|
|
|
|
*/
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_FRAG);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
|
|
|
case IPPROTO_AH:
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_DSTOPTS: {
|
|
|
|
/* get next header and header length */
|
|
|
|
struct ip6_ext opt6;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, off2, &opt6,
|
2005-07-01 16:37:34 +04:00
|
|
|
sizeof(opt6), NULL, reason,
|
|
|
|
pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMPv6 short opt\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
if (pd2.proto == IPPROTO_AH)
|
|
|
|
off2 += (opt6.ip6e_len + 2) * 4;
|
|
|
|
else
|
|
|
|
off2 += (opt6.ip6e_len + 1) * 8;
|
|
|
|
pd2.proto = opt6.ip6e_nxt;
|
|
|
|
/* goto the next header */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
terminal++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} while (!terminal);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (pd2.proto) {
|
|
|
|
case IPPROTO_TCP: {
|
|
|
|
struct tcphdr th;
|
|
|
|
u_int32_t seq;
|
|
|
|
struct pf_state key;
|
|
|
|
struct pf_state_peer *src, *dst;
|
|
|
|
u_int8_t dws;
|
|
|
|
int copyback = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Only the first 8 bytes of the TCP header can be
|
|
|
|
* expected. Don't access any TCP header fields after
|
|
|
|
* th_seq, an ackskew test is not possible.
|
|
|
|
*/
|
2005-07-01 16:37:34 +04:00
|
|
|
if (!pf_pull_hdr(m, off2, &th, 8, NULL, reason,
|
|
|
|
pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short "
|
|
|
|
"(tcp)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
key.af = pd2.af;
|
|
|
|
key.proto = IPPROTO_TCP;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd2.src, key.af);
|
|
|
|
key.ext.port = th.th_dport;
|
|
|
|
key.gwy.port = th.th_sport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.src, key.af);
|
|
|
|
key.lan.port = th.th_dport;
|
|
|
|
key.ext.port = th.th_sport;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (direction == (*state)->direction) {
|
|
|
|
src = &(*state)->dst;
|
|
|
|
dst = &(*state)->src;
|
|
|
|
} else {
|
|
|
|
src = &(*state)->src;
|
|
|
|
dst = &(*state)->dst;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (src->wscale && dst->wscale &&
|
|
|
|
!(th.th_flags & TH_SYN))
|
|
|
|
dws = dst->wscale & PF_WSCALE_MASK;
|
|
|
|
else
|
|
|
|
dws = 0;
|
|
|
|
|
|
|
|
/* Demodulate sequence number */
|
|
|
|
seq = ntohl(th.th_seq) - src->seqdiff;
|
|
|
|
if (src->seqdiff) {
|
|
|
|
pf_change_a(&th.th_seq, icmpsum,
|
|
|
|
htonl(seq), 0);
|
|
|
|
copyback = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!SEQ_GEQ(src->seqhi, seq) ||
|
|
|
|
!SEQ_GEQ(seq, src->seqlo - (dst->max_win << dws))) {
|
|
|
|
if (pf_status.debug >= PF_DEBUG_MISC) {
|
|
|
|
printf("pf: BAD ICMP %d:%d ",
|
|
|
|
icmptype, pd->hdr.icmp->icmp_code);
|
|
|
|
pf_print_host(pd->src, 0, pd->af);
|
|
|
|
printf(" -> ");
|
|
|
|
pf_print_host(pd->dst, 0, pd->af);
|
|
|
|
printf(" state: ");
|
|
|
|
pf_print_state(*state);
|
|
|
|
printf(" seq=%u\n", seq);
|
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(reason, PFRES_BADSTATE);
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
pf_change_icmp(pd2.src, &th.th_sport,
|
|
|
|
daddr, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, pd2.af);
|
|
|
|
} else {
|
|
|
|
pf_change_icmp(pd2.dst, &th.th_dport,
|
|
|
|
saddr, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, pd2.af);
|
|
|
|
}
|
|
|
|
copyback = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (copyback) {
|
|
|
|
switch (pd2.af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
m_copyback(m, off, ICMP_MINLEN,
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp);
|
2004-06-22 17:52:05 +04:00
|
|
|
m_copyback(m, ipoff2, sizeof(h2),
|
2004-09-08 16:11:25 +04:00
|
|
|
&h2);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
m_copyback(m, off,
|
|
|
|
sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
m_copyback(m, ipoff2, sizeof(h2_6),
|
2004-09-08 16:11:25 +04:00
|
|
|
&h2_6);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off2, 8, &th);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case IPPROTO_UDP: {
|
|
|
|
struct udphdr uh;
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, off2, &uh, sizeof(uh),
|
2005-07-01 16:37:34 +04:00
|
|
|
NULL, reason, pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short "
|
|
|
|
"(udp)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
key.af = pd2.af;
|
|
|
|
key.proto = IPPROTO_UDP;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd2.src, key.af);
|
|
|
|
key.ext.port = uh.uh_dport;
|
|
|
|
key.gwy.port = uh.uh_sport;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.src, key.af);
|
|
|
|
key.lan.port = uh.uh_dport;
|
|
|
|
key.ext.port = uh.uh_sport;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
pf_change_icmp(pd2.src, &uh.uh_sport,
|
|
|
|
daddr, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, &uh.uh_sum,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 1, pd2.af);
|
|
|
|
} else {
|
|
|
|
pf_change_icmp(pd2.dst, &uh.uh_dport,
|
|
|
|
saddr, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, &uh.uh_sum,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 1, pd2.af);
|
|
|
|
}
|
|
|
|
switch (pd2.af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
m_copyback(m, off, ICMP_MINLEN,
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp);
|
|
|
|
m_copyback(m, ipoff2, sizeof(h2), &h2);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
m_copyback(m, off,
|
|
|
|
sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
m_copyback(m, ipoff2, sizeof(h2_6),
|
2004-09-08 16:11:25 +04:00
|
|
|
&h2_6);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off2, sizeof(uh), &uh);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#ifdef INET
|
|
|
|
case IPPROTO_ICMP: {
|
|
|
|
struct icmp iih;
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, off2, &iih, ICMP_MINLEN,
|
2005-07-01 16:37:34 +04:00
|
|
|
NULL, reason, pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short i"
|
|
|
|
"(icmp)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
key.af = pd2.af;
|
|
|
|
key.proto = IPPROTO_ICMP;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd2.src, key.af);
|
|
|
|
key.ext.port = iih.icmp_id;
|
|
|
|
key.gwy.port = iih.icmp_id;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.src, key.af);
|
|
|
|
key.lan.port = iih.icmp_id;
|
|
|
|
key.ext.port = iih.icmp_id;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
pf_change_icmp(pd2.src, &iih.icmp_id,
|
|
|
|
daddr, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, AF_INET);
|
|
|
|
} else {
|
|
|
|
pf_change_icmp(pd2.dst, &iih.icmp_id,
|
|
|
|
saddr, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, AF_INET);
|
|
|
|
}
|
2004-09-08 16:11:25 +04:00
|
|
|
m_copyback(m, off, ICMP_MINLEN, pd->hdr.icmp);
|
|
|
|
m_copyback(m, ipoff2, sizeof(h2), &h2);
|
|
|
|
m_copyback(m, off2, ICMP_MINLEN, &iih);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case IPPROTO_ICMPV6: {
|
|
|
|
struct icmp6_hdr iih;
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, off2, &iih,
|
2005-07-01 16:37:34 +04:00
|
|
|
sizeof(struct icmp6_hdr), NULL, reason, pd2.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: ICMP error message too short "
|
|
|
|
"(icmp6)\n"));
|
|
|
|
return (PF_DROP);
|
|
|
|
}
|
|
|
|
|
|
|
|
key.af = pd2.af;
|
|
|
|
key.proto = IPPROTO_ICMPV6;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd2.src, key.af);
|
|
|
|
key.ext.port = iih.icmp6_id;
|
|
|
|
key.gwy.port = iih.icmp6_id;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.src, key.af);
|
|
|
|
key.lan.port = iih.icmp6_id;
|
|
|
|
key.ext.port = iih.icmp6_id;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
pf_change_icmp(pd2.src, &iih.icmp6_id,
|
|
|
|
daddr, &(*state)->lan.addr,
|
|
|
|
(*state)->lan.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, AF_INET6);
|
|
|
|
} else {
|
|
|
|
pf_change_icmp(pd2.dst, &iih.icmp6_id,
|
|
|
|
saddr, &(*state)->gwy.addr,
|
|
|
|
(*state)->gwy.port, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, AF_INET6);
|
|
|
|
}
|
|
|
|
m_copyback(m, off, sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
|
|
|
m_copyback(m, ipoff2, sizeof(h2_6), &h2_6);
|
2004-06-22 17:52:05 +04:00
|
|
|
m_copyback(m, off2, sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
&iih);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
default: {
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
key.af = pd2.af;
|
|
|
|
key.proto = pd2.proto;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd2.src, key.af);
|
|
|
|
key.ext.port = 0;
|
|
|
|
key.gwy.port = 0;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd2.dst, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd2.src, key.af);
|
|
|
|
key.lan.port = 0;
|
|
|
|
key.ext.port = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
pf_change_icmp(pd2.src, NULL,
|
|
|
|
daddr, &(*state)->lan.addr,
|
|
|
|
0, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, pd2.af);
|
|
|
|
} else {
|
|
|
|
pf_change_icmp(pd2.dst, NULL,
|
|
|
|
saddr, &(*state)->gwy.addr,
|
|
|
|
0, NULL,
|
|
|
|
pd2.ip_sum, icmpsum,
|
|
|
|
pd->ip_sum, 0, pd2.af);
|
|
|
|
}
|
|
|
|
switch (pd2.af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
m_copyback(m, off, ICMP_MINLEN,
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp);
|
|
|
|
m_copyback(m, ipoff2, sizeof(h2), &h2);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
m_copyback(m, off,
|
|
|
|
sizeof(struct icmp6_hdr),
|
2004-09-08 16:11:25 +04:00
|
|
|
pd->hdr.icmp6);
|
2004-06-22 17:52:05 +04:00
|
|
|
m_copyback(m, ipoff2, sizeof(h2_6),
|
2004-09-08 16:11:25 +04:00
|
|
|
&h2_6);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_test_state_other(struct pf_state **state, int direction, struct pfi_kif *kif,
|
|
|
|
struct pf_pdesc *pd)
|
|
|
|
{
|
|
|
|
struct pf_state_peer *src, *dst;
|
|
|
|
struct pf_state key;
|
|
|
|
|
|
|
|
key.af = pd->af;
|
|
|
|
key.proto = pd->proto;
|
|
|
|
if (direction == PF_IN) {
|
|
|
|
PF_ACPY(&key.ext.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.gwy.addr, pd->dst, key.af);
|
|
|
|
key.ext.port = 0;
|
|
|
|
key.gwy.port = 0;
|
|
|
|
} else {
|
|
|
|
PF_ACPY(&key.lan.addr, pd->src, key.af);
|
|
|
|
PF_ACPY(&key.ext.addr, pd->dst, key.af);
|
|
|
|
key.lan.port = 0;
|
|
|
|
key.ext.port = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
STATE_LOOKUP();
|
|
|
|
|
|
|
|
if (direction == (*state)->direction) {
|
|
|
|
src = &(*state)->src;
|
|
|
|
dst = &(*state)->dst;
|
|
|
|
} else {
|
|
|
|
src = &(*state)->dst;
|
|
|
|
dst = &(*state)->src;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update states */
|
|
|
|
if (src->state < PFOTHERS_SINGLE)
|
|
|
|
src->state = PFOTHERS_SINGLE;
|
|
|
|
if (dst->state == PFOTHERS_SINGLE)
|
|
|
|
dst->state = PFOTHERS_MULTIPLE;
|
|
|
|
|
|
|
|
/* update expire time */
|
2004-11-14 14:12:16 +03:00
|
|
|
(*state)->expire = time_second;
|
2004-06-22 17:52:05 +04:00
|
|
|
if (src->state == PFOTHERS_MULTIPLE && dst->state == PFOTHERS_MULTIPLE)
|
|
|
|
(*state)->timeout = PFTM_OTHER_MULTIPLE;
|
|
|
|
else
|
|
|
|
(*state)->timeout = PFTM_OTHER_SINGLE;
|
|
|
|
|
|
|
|
/* translate source/destination address, if necessary */
|
|
|
|
if (STATE_TRANSLATE(*state)) {
|
|
|
|
if (direction == PF_OUT)
|
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&pd->src->v4.s_addr,
|
|
|
|
pd->ip_sum, (*state)->gwy.addr.v4.s_addr,
|
|
|
|
0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
PF_ACPY(pd->src, &(*state)->gwy.addr, pd->af);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
else
|
|
|
|
switch (pd->af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET:
|
|
|
|
pf_change_a(&pd->dst->v4.s_addr,
|
|
|
|
pd->ip_sum, (*state)->lan.addr.v4.s_addr,
|
|
|
|
0);
|
|
|
|
break;
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
PF_ACPY(pd->dst, &(*state)->lan.addr, pd->af);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (PF_PASS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ipoff and off are measured from the start of the mbuf chain.
|
|
|
|
* h must be at "ipoff" on the mbuf chain.
|
|
|
|
*/
|
|
|
|
void *
|
|
|
|
pf_pull_hdr(struct mbuf *m, int off, void *p, int len,
|
|
|
|
u_short *actionp, u_short *reasonp, sa_family_t af)
|
|
|
|
{
|
|
|
|
switch (af) {
|
|
|
|
#ifdef INET
|
|
|
|
case AF_INET: {
|
|
|
|
struct ip *h = mtod(m, struct ip *);
|
|
|
|
u_int16_t fragoff = (ntohs(h->ip_off) & IP_OFFMASK) << 3;
|
|
|
|
|
|
|
|
if (fragoff) {
|
|
|
|
if (fragoff >= len)
|
|
|
|
ACTION_SET(actionp, PF_PASS);
|
|
|
|
else {
|
|
|
|
ACTION_SET(actionp, PF_DROP);
|
|
|
|
REASON_SET(reasonp, PFRES_FRAG);
|
|
|
|
}
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
if (m->m_pkthdr.len < off + len ||
|
|
|
|
ntohs(h->ip_len) < off + len) {
|
|
|
|
ACTION_SET(actionp, PF_DROP);
|
|
|
|
REASON_SET(reasonp, PFRES_SHORT);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6: {
|
|
|
|
struct ip6_hdr *h = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
if (m->m_pkthdr.len < off + len ||
|
|
|
|
(ntohs(h->ip6_plen) + sizeof(struct ip6_hdr)) <
|
|
|
|
(unsigned)(off + len)) {
|
|
|
|
ACTION_SET(actionp, PF_DROP);
|
|
|
|
REASON_SET(reasonp, PFRES_SHORT);
|
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
m_copydata(m, off, len, p);
|
|
|
|
return (p);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
pf_routable(struct pf_addr *addr, sa_family_t af)
|
|
|
|
{
|
|
|
|
struct sockaddr_in *dst;
|
2005-07-01 16:37:34 +04:00
|
|
|
#ifdef INET6
|
|
|
|
struct sockaddr_in6 *dst6;
|
|
|
|
struct route_in6 ro;
|
|
|
|
#else
|
2004-06-22 17:52:05 +04:00
|
|
|
struct route ro;
|
2005-07-01 16:37:34 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
bzero(&ro, sizeof(ro));
|
|
|
|
switch (af) {
|
|
|
|
case AF_INET:
|
|
|
|
dst = satosin(&ro.ro_dst);
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr = addr->v4;
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
dst6 = (struct sockaddr_in6 *)&ro.ro_dst;
|
|
|
|
dst6->sin6_family = AF_INET6;
|
|
|
|
dst6->sin6_len = sizeof(*dst6);
|
|
|
|
dst6->sin6_addr = addr->v6;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
default:
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef __OpenBSD__
|
|
|
|
rtalloc_noclone((struct route *)&ro, NO_CLONING);
|
2006-12-16 00:18:52 +03:00
|
|
|
if (ro.ro_rt != NULL) {
|
|
|
|
RTFREE(ro.ro_rt);
|
|
|
|
return (1);
|
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
#else
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_init((struct route *)&ro);
|
2005-07-01 16:37:34 +04:00
|
|
|
if (ro.ro_rt != NULL) {
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_free((struct route *)&ro);
|
2005-07-01 16:37:34 +04:00
|
|
|
return (1);
|
|
|
|
}
|
2006-12-16 00:18:52 +03:00
|
|
|
#endif
|
2005-07-01 16:37:34 +04:00
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2006-10-12 05:30:41 +04:00
|
|
|
pf_rtlabel_match(struct pf_addr *addr, sa_family_t af,
|
2006-11-16 04:32:37 +03:00
|
|
|
struct pf_addr_wrap *aw)
|
2005-07-01 16:37:34 +04:00
|
|
|
{
|
2006-12-16 00:18:52 +03:00
|
|
|
#if 0
|
2005-07-01 16:37:34 +04:00
|
|
|
struct sockaddr_in *dst;
|
|
|
|
#ifdef INET6
|
|
|
|
struct sockaddr_in6 *dst6;
|
|
|
|
struct route_in6 ro;
|
|
|
|
#else
|
|
|
|
struct route ro;
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
bzero(&ro, sizeof(ro));
|
2005-07-01 16:37:34 +04:00
|
|
|
switch (af) {
|
|
|
|
case AF_INET:
|
|
|
|
dst = satosin(&ro.ro_dst);
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr = addr->v4;
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
dst6 = (struct sockaddr_in6 *)&ro.ro_dst;
|
|
|
|
dst6->sin6_family = AF_INET6;
|
|
|
|
dst6->sin6_len = sizeof(*dst6);
|
|
|
|
dst6->sin6_addr = addr->v6;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
default:
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2005-07-01 16:37:34 +04:00
|
|
|
rtalloc_noclone((struct route *)&ro, NO_CLONING);
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
2007-02-18 00:08:52 +03:00
|
|
|
rtcache_init((struct route *)&ro);
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
#ifdef __OpenBSD__
|
2007-02-18 00:08:52 +03:00
|
|
|
if (ro.ro_rt != NULL) {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (ro.ro_rt->rt_labelid == aw->v.rtlabel)
|
|
|
|
ret = 1;
|
2006-12-16 00:18:52 +03:00
|
|
|
RTFREE(ro.ro_rt);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2007-02-18 00:08:52 +03:00
|
|
|
#else
|
|
|
|
rtcache_free((struct route *)&ro);
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
return (ret);
|
2006-12-16 00:18:52 +03:00
|
|
|
#else
|
|
|
|
return 0;
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef INET
|
|
|
|
void
|
|
|
|
pf_route(struct mbuf **m, struct pf_rule *r, int dir, struct ifnet *oifp,
|
|
|
|
struct pf_state *s)
|
|
|
|
{
|
|
|
|
struct mbuf *m0, *m1;
|
2004-11-14 14:12:16 +03:00
|
|
|
struct m_tag *mtag;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct route iproute;
|
2004-06-22 18:17:07 +04:00
|
|
|
struct route *ro = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct sockaddr_in *dst;
|
|
|
|
struct ip *ip;
|
|
|
|
struct ifnet *ifp = NULL;
|
|
|
|
struct pf_addr naddr;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if (m == NULL || *m == NULL || r == NULL ||
|
|
|
|
(dir != PF_IN && dir != PF_OUT) || oifp == NULL)
|
|
|
|
panic("pf_route: invalid parameters");
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if ((mtag = m_tag_find(*m, PACKET_TAG_PF_ROUTED, NULL)) == NULL) {
|
|
|
|
if ((mtag = m_tag_get(PACKET_TAG_PF_ROUTED, 1, M_NOWAIT)) ==
|
|
|
|
NULL) {
|
|
|
|
m0 = *m;
|
|
|
|
*m = NULL;
|
|
|
|
goto bad;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
*(char *)(mtag + 1) = 1;
|
|
|
|
m_tag_prepend(*m, mtag);
|
|
|
|
} else {
|
|
|
|
if (*(char *)(mtag + 1) > 3) {
|
|
|
|
m0 = *m;
|
|
|
|
*m = NULL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
(*(char *)(mtag + 1))++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->rt == PF_DUPTO) {
|
|
|
|
if ((m0 = m_copym2(*m, 0, M_COPYALL, M_NOWAIT)) == NULL)
|
2004-06-22 17:52:05 +04:00
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
if ((r->rt == PF_REPLYTO) == (r->direction == dir))
|
|
|
|
return;
|
|
|
|
m0 = *m;
|
|
|
|
}
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (m0->m_len < sizeof(struct ip)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route: m0->m_len < sizeof(struct ip)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
ip = mtod(m0, struct ip *);
|
|
|
|
|
|
|
|
ro = &iproute;
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)ro, sizeof(*ro));
|
2004-06-22 17:52:05 +04:00
|
|
|
dst = satosin(&ro->ro_dst);
|
|
|
|
dst->sin_family = AF_INET;
|
|
|
|
dst->sin_len = sizeof(*dst);
|
|
|
|
dst->sin_addr = ip->ip_dst;
|
|
|
|
|
|
|
|
if (r->rt == PF_FASTROUTE) {
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_init(ro);
|
|
|
|
if (ro->ro_rt == NULL) {
|
2004-06-22 17:52:05 +04:00
|
|
|
ipstat.ips_noroute++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
ifp = ro->ro_rt->rt_ifp;
|
|
|
|
ro->ro_rt->rt_use++;
|
|
|
|
|
|
|
|
if (ro->ro_rt->rt_flags & RTF_GATEWAY)
|
|
|
|
dst = satosin(ro->ro_rt->rt_gateway);
|
|
|
|
} else {
|
2005-07-01 16:37:34 +04:00
|
|
|
if (TAILQ_EMPTY(&r->rpool.list)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route: TAILQ_EMPTY(&r->rpool.list)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
if (s == NULL) {
|
Here are various changes designed to protect against bad IPv4
routing caused by stale route caches (struct route). Route caches
are sprinkled throughout PCBs, the IP fast-forwarding table, and
IP tunnel interfaces (gre, gif, stf).
Stale IPv6 and ISO route caches will be treated by separate patches.
Thank you to Christoph Badura for suggesting the general approach
to invalidating route caches that I take here.
Here are the details:
Add hooks to struct domain for tracking and for invalidating each
domain's route caches: dom_rtcache, dom_rtflush, and dom_rtflushall.
Introduce helper subroutines, rtflush(ro) for invalidating a route
cache, rtflushall(family) for invalidating all route caches in a
routing domain, and rtcache(ro) for notifying the domain of a new
cached route.
Chain together all IPv4 route caches where ro_rt != NULL. Provide
in_rtcache() for adding a route to the chain. Provide in_rtflush()
and in_rtflushall() for invalidating IPv4 route caches. In
in_rtflush(), set ro_rt to NULL, and remove the route from the
chain. In in_rtflushall(), walk the chain and remove every route
cache.
In rtrequest1(), call rtflushall() to invalidate route caches when
a route is added.
In gif(4), discard the workaround for stale caches that involves
expiring them every so often.
Replace the pattern 'RTFREE(ro->ro_rt); ro->ro_rt = NULL;' with a
call to rtflush(ro).
Update ipflow_fastforward() and all other users of route caches so
that they expect a cached route, ro->ro_rt, to turn to NULL.
Take care when moving a 'struct route' to rtflush() the source and
to rtcache() the destination.
In domain initializers, use .dom_xxx tags.
KNF here and there.
2006-12-09 08:33:04 +03:00
|
|
|
pf_map_addr(AF_INET, r,
|
|
|
|
(const struct pf_addr *)&ip->ip_src,
|
2004-06-22 17:52:05 +04:00
|
|
|
&naddr, NULL, &sn);
|
|
|
|
if (!PF_AZERO(&naddr, AF_INET))
|
|
|
|
dst->sin_addr.s_addr = naddr.v4.s_addr;
|
|
|
|
ifp = r->rpool.cur->kif ?
|
|
|
|
r->rpool.cur->kif->pfik_ifp : NULL;
|
|
|
|
} else {
|
|
|
|
if (!PF_AZERO(&s->rt_addr, AF_INET))
|
|
|
|
dst->sin_addr.s_addr =
|
|
|
|
s->rt_addr.v4.s_addr;
|
|
|
|
ifp = s->rt_kif ? s->rt_kif->pfik_ifp : NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (ifp == NULL)
|
|
|
|
goto bad;
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if (oifp != ifp) {
|
|
|
|
if (pf_test(PF_OUT, ifp, &m0, NULL) != PF_PASS)
|
2004-06-22 17:52:05 +04:00
|
|
|
goto bad;
|
|
|
|
else if (m0 == NULL)
|
|
|
|
goto done;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (m0->m_len < sizeof(struct ip)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route: m0->m_len < sizeof(struct ip)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
ip = mtod(m0, struct ip *);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Copied from ip_output. */
|
|
|
|
#ifdef IPSEC
|
|
|
|
/*
|
|
|
|
* If deferred crypto processing is needed, check that the
|
|
|
|
* interface supports it.
|
|
|
|
*/
|
|
|
|
if ((mtag = m_tag_find(m0, PACKET_TAG_IPSEC_OUT_CRYPTO_NEEDED, NULL))
|
|
|
|
!= NULL && (ifp->if_capabilities & IFCAP_IPSEC) == 0) {
|
|
|
|
/* Notify IPsec to do its own crypto. */
|
|
|
|
ipsp_skipcrypto_unmark((struct tdb_ident *)(mtag + 1));
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif /* IPSEC */
|
|
|
|
|
|
|
|
/* Catch routing changes wrt. hardware checksumming for TCP or UDP. */
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
if (m0->m_pkthdr.csum & M_TCPV4_CSUM_OUT) {
|
|
|
|
if (!(ifp->if_capabilities & IFCAP_CSUM_TCPv4) ||
|
|
|
|
ifp->if_bridge != NULL) {
|
|
|
|
in_delayed_cksum(m0);
|
|
|
|
m0->m_pkthdr.csum &= ~M_TCPV4_CSUM_OUT; /* Clear */
|
|
|
|
}
|
|
|
|
} else if (m0->m_pkthdr.csum & M_UDPV4_CSUM_OUT) {
|
|
|
|
if (!(ifp->if_capabilities & IFCAP_CSUM_UDPv4) ||
|
|
|
|
ifp->if_bridge != NULL) {
|
|
|
|
in_delayed_cksum(m0);
|
|
|
|
m0->m_pkthdr.csum &= ~M_UDPV4_CSUM_OUT; /* Clear */
|
|
|
|
}
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
2006-02-19 15:15:33 +03:00
|
|
|
if (m0->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
|
|
|
in_delayed_cksum(m0);
|
|
|
|
m0->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
if (ntohs(ip->ip_len) <= ifp->if_mtu) {
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
if ((ifp->if_capabilities & IFCAP_CSUM_IPv4) &&
|
|
|
|
ifp->if_bridge == NULL) {
|
|
|
|
m0->m_pkthdr.csum |= M_IPV4_CSUM_OUT;
|
|
|
|
ipstat.ips_outhwcsum++;
|
|
|
|
} else {
|
|
|
|
ip->ip_sum = 0;
|
|
|
|
ip->ip_sum = in_cksum(m0, ip->ip_hl << 2);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
ip->ip_sum = 0;
|
|
|
|
ip->ip_sum = in_cksum(m0, ip->ip_hl << 2);
|
2006-02-19 15:15:33 +03:00
|
|
|
|
|
|
|
m0->m_pkthdr.csum_flags &= ~M_CSUM_IPv4;
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
/* Update relevant hardware checksum stats for TCP/UDP */
|
|
|
|
if (m0->m_pkthdr.csum & M_TCPV4_CSUM_OUT)
|
|
|
|
tcpstat.tcps_outhwcsum++;
|
|
|
|
else if (m0->m_pkthdr.csum & M_UDPV4_CSUM_OUT)
|
|
|
|
udpstat.udps_outhwcsum++;
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
error = (*ifp->if_output)(ifp, m0, sintosa(dst), NULL);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Too large for interface; fragment if possible.
|
|
|
|
* Must be able to put at least 8 bytes per fragment.
|
|
|
|
*/
|
|
|
|
if (ip->ip_off & htons(IP_DF)) {
|
|
|
|
ipstat.ips_cantfrag++;
|
|
|
|
if (r->rt != PF_DUPTO) {
|
|
|
|
icmp_error(m0, ICMP_UNREACH, ICMP_UNREACH_NEEDFRAG, 0,
|
2005-10-23 23:40:20 +04:00
|
|
|
ifp->if_mtu);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto done;
|
|
|
|
} else
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
m1 = m0;
|
|
|
|
error = ip_fragment(m0, ifp, ifp->if_mtu);
|
|
|
|
if (error) {
|
|
|
|
m0 = NULL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (m0 = m1; m0; m0 = m1) {
|
|
|
|
m1 = m0->m_nextpkt;
|
|
|
|
m0->m_nextpkt = 0;
|
|
|
|
if (error == 0)
|
|
|
|
error = (*ifp->if_output)(ifp, m0, sintosa(dst),
|
|
|
|
NULL);
|
|
|
|
else
|
|
|
|
m_freem(m0);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (error == 0)
|
|
|
|
ipstat.ips_fragmented++;
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (r->rt != PF_DUPTO)
|
|
|
|
*m = NULL;
|
2006-12-16 00:18:52 +03:00
|
|
|
if (ro == &iproute)
|
|
|
|
rtcache_free(ro);
|
2004-06-22 17:52:05 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
|
|
|
m_freem(m0);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
void
|
|
|
|
pf_route6(struct mbuf **m, struct pf_rule *r, int dir, struct ifnet *oifp,
|
|
|
|
struct pf_state *s)
|
|
|
|
{
|
|
|
|
struct mbuf *m0;
|
|
|
|
struct m_tag *mtag;
|
2006-12-04 05:28:12 +03:00
|
|
|
struct sockaddr_in6 dst;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct ifnet *ifp = NULL;
|
|
|
|
struct pf_addr naddr;
|
|
|
|
struct pf_src_node *sn = NULL;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if (m == NULL || *m == NULL || r == NULL ||
|
|
|
|
(dir != PF_IN && dir != PF_OUT) || oifp == NULL)
|
|
|
|
panic("pf_route6: invalid parameters");
|
|
|
|
|
2004-11-14 14:12:16 +03:00
|
|
|
if ((mtag = m_tag_find(*m, PACKET_TAG_PF_ROUTED, NULL)) == NULL) {
|
|
|
|
if ((mtag = m_tag_get(PACKET_TAG_PF_ROUTED, 1, M_NOWAIT)) ==
|
|
|
|
NULL) {
|
|
|
|
m0 = *m;
|
|
|
|
*m = NULL;
|
|
|
|
goto bad;
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
*(char *)(mtag + 1) = 1;
|
|
|
|
m_tag_prepend(*m, mtag);
|
|
|
|
} else {
|
|
|
|
if (*(char *)(mtag + 1) > 3) {
|
|
|
|
m0 = *m;
|
|
|
|
*m = NULL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
(*(char *)(mtag + 1))++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (r->rt == PF_DUPTO) {
|
|
|
|
if ((m0 = m_copym2(*m, 0, M_COPYALL, M_NOWAIT)) == NULL)
|
2004-06-22 17:52:05 +04:00
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
if ((r->rt == PF_REPLYTO) == (r->direction == dir))
|
|
|
|
return;
|
|
|
|
m0 = *m;
|
|
|
|
}
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (m0->m_len < sizeof(struct ip6_hdr)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route6: m0->m_len < sizeof(struct ip6_hdr)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
ip6 = mtod(m0, struct ip6_hdr *);
|
|
|
|
|
2006-12-04 05:28:12 +03:00
|
|
|
dst.sin6_family = AF_INET6;
|
|
|
|
dst.sin6_len = sizeof(dst);
|
|
|
|
dst.sin6_addr = ip6->ip6_dst;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/* Cheat. */
|
|
|
|
if (r->rt == PF_FASTROUTE) {
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_GENERATED, 0, M_NOWAIT);
|
|
|
|
if (mtag == NULL)
|
|
|
|
goto bad;
|
|
|
|
m_tag_prepend(m0, mtag);
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
ip6_output(m0, NULL, NULL, 0, NULL, NULL);
|
2004-06-22 18:17:07 +04:00
|
|
|
#else
|
|
|
|
ip6_output(m0, NULL, NULL, 0, NULL, NULL, NULL);
|
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (TAILQ_EMPTY(&r->rpool.list)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route6: TAILQ_EMPTY(&r->rpool.list)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
2004-06-22 17:52:05 +04:00
|
|
|
if (s == NULL) {
|
|
|
|
pf_map_addr(AF_INET6, r, (struct pf_addr *)&ip6->ip6_src,
|
|
|
|
&naddr, NULL, &sn);
|
|
|
|
if (!PF_AZERO(&naddr, AF_INET6))
|
2006-12-04 05:28:12 +03:00
|
|
|
PF_ACPY((struct pf_addr *)&dst.sin6_addr,
|
2004-06-22 17:52:05 +04:00
|
|
|
&naddr, AF_INET6);
|
|
|
|
ifp = r->rpool.cur->kif ? r->rpool.cur->kif->pfik_ifp : NULL;
|
|
|
|
} else {
|
|
|
|
if (!PF_AZERO(&s->rt_addr, AF_INET6))
|
2006-12-04 05:28:12 +03:00
|
|
|
PF_ACPY((struct pf_addr *)&dst.sin6_addr,
|
2004-06-22 17:52:05 +04:00
|
|
|
&s->rt_addr, AF_INET6);
|
|
|
|
ifp = s->rt_kif ? s->rt_kif->pfik_ifp : NULL;
|
|
|
|
}
|
|
|
|
if (ifp == NULL)
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
if (oifp != ifp) {
|
2004-11-14 14:12:16 +03:00
|
|
|
if (pf_test6(PF_OUT, ifp, &m0, NULL) != PF_PASS)
|
|
|
|
goto bad;
|
|
|
|
else if (m0 == NULL)
|
|
|
|
goto done;
|
2005-07-01 16:37:34 +04:00
|
|
|
if (m0->m_len < sizeof(struct ip6_hdr)) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_route6: m0->m_len < sizeof(struct ip6_hdr)\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
2004-11-14 14:12:16 +03:00
|
|
|
ip6 = mtod(m0, struct ip6_hdr *);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the packet is too large for the outgoing interface,
|
|
|
|
* send back an icmp6 error.
|
|
|
|
*/
|
2006-12-04 05:28:12 +03:00
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&dst.sin6_addr))
|
|
|
|
dst.sin6_addr.s6_addr16[1] = htons(ifp->if_index);
|
2004-06-22 17:52:05 +04:00
|
|
|
if ((u_long)m0->m_pkthdr.len <= ifp->if_mtu) {
|
2006-12-04 05:28:12 +03:00
|
|
|
error = nd6_output(ifp, ifp, m0, &dst, NULL);
|
2004-06-22 17:52:05 +04:00
|
|
|
} else {
|
|
|
|
in6_ifstat_inc(ifp, ifs6_in_toobig);
|
|
|
|
if (r->rt != PF_DUPTO)
|
|
|
|
icmp6_error(m0, ICMP6_PACKET_TOO_BIG, 0, ifp->if_mtu);
|
|
|
|
else
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (r->rt != PF_DUPTO)
|
|
|
|
*m = NULL;
|
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
|
|
|
m_freem(m0);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* check protocol (tcp/udp/icmp/icmp6) checksum and set mbuf flag
|
|
|
|
* off is the offset where the protocol header starts
|
|
|
|
* len is the total length of protocol header plus payload
|
|
|
|
* returns 0 when the checksum is valid, otherwise returns 1.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
pf_check_proto_cksum(struct mbuf *m, int off, int len, u_int8_t p,
|
|
|
|
sa_family_t af)
|
|
|
|
{
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
u_int16_t flag_ok, flag_bad;
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
u_int16_t sum;
|
|
|
|
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
switch (p) {
|
|
|
|
case IPPROTO_TCP:
|
|
|
|
flag_ok = M_TCP_CSUM_IN_OK;
|
|
|
|
flag_bad = M_TCP_CSUM_IN_BAD;
|
|
|
|
break;
|
|
|
|
case IPPROTO_UDP:
|
|
|
|
flag_ok = M_UDP_CSUM_IN_OK;
|
|
|
|
flag_bad = M_UDP_CSUM_IN_BAD;
|
|
|
|
break;
|
|
|
|
case IPPROTO_ICMP:
|
|
|
|
#ifdef INET6
|
|
|
|
case IPPROTO_ICMPV6:
|
|
|
|
#endif /* INET6 */
|
|
|
|
flag_ok = flag_bad = 0;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
if (m->m_pkthdr.csum & flag_ok)
|
|
|
|
return (0);
|
|
|
|
if (m->m_pkthdr.csum & flag_bad)
|
|
|
|
return (1);
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
if (off < sizeof(struct ip) || len < sizeof(struct udphdr))
|
|
|
|
return (1);
|
|
|
|
if (m->m_pkthdr.len < off + len)
|
|
|
|
return (1);
|
2004-12-21 08:55:23 +03:00
|
|
|
#ifdef __NetBSD__
|
|
|
|
switch (p) {
|
|
|
|
case IPPROTO_TCP: {
|
|
|
|
struct tcphdr th; /* XXX */
|
|
|
|
int thlen;
|
|
|
|
|
|
|
|
m_copydata(m, off, sizeof(th), &th); /* XXX */
|
|
|
|
thlen = th.th_off << 2;
|
|
|
|
return tcp_input_checksum(af, m, &th, off,
|
|
|
|
thlen, len - thlen) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IPPROTO_UDP: {
|
|
|
|
struct udphdr uh; /* XXX */
|
|
|
|
|
|
|
|
m_copydata(m, off, sizeof(uh), &uh); /* XXX */
|
|
|
|
return udp_input_checksum(af, m, &uh, off, len) != 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /* __NetBSD__ */
|
|
|
|
switch (af) {
|
2004-11-14 14:12:16 +03:00
|
|
|
#ifdef INET
|
2004-06-22 17:52:05 +04:00
|
|
|
case AF_INET:
|
|
|
|
if (p == IPPROTO_ICMP) {
|
|
|
|
if (m->m_len < off)
|
|
|
|
return (1);
|
|
|
|
m->m_data += off;
|
|
|
|
m->m_len -= off;
|
|
|
|
sum = in_cksum(m, len);
|
|
|
|
m->m_data -= off;
|
|
|
|
m->m_len += off;
|
|
|
|
} else {
|
|
|
|
if (m->m_len < sizeof(struct ip))
|
|
|
|
return (1);
|
|
|
|
sum = in4_cksum(m, p, off, len);
|
|
|
|
}
|
|
|
|
break;
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* INET */
|
2004-06-22 17:52:05 +04:00
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
if (m->m_len < sizeof(struct ip6_hdr))
|
|
|
|
return (1);
|
|
|
|
sum = in6_cksum(m, p, off, len);
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
default:
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
if (sum) {
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
m->m_pkthdr.csum |= flag_bad;
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
switch (p) {
|
|
|
|
case IPPROTO_TCP:
|
|
|
|
tcpstat.tcps_rcvbadsum++;
|
|
|
|
break;
|
|
|
|
case IPPROTO_UDP:
|
|
|
|
udpstat.udps_badsum++;
|
|
|
|
break;
|
|
|
|
case IPPROTO_ICMP:
|
|
|
|
icmpstat.icps_checksum++;
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case IPPROTO_ICMPV6:
|
|
|
|
icmp6stat.icp6s_checksum++;
|
|
|
|
break;
|
|
|
|
#endif /* INET6 */
|
|
|
|
}
|
|
|
|
return (1);
|
|
|
|
}
|
2004-06-22 18:17:07 +04:00
|
|
|
#ifdef __OpenBSD__
|
2004-06-22 17:52:05 +04:00
|
|
|
m->m_pkthdr.csum |= flag_ok;
|
2004-06-22 18:17:07 +04:00
|
|
|
#endif
|
2004-06-22 17:52:05 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
pf_add_mbuf_tag(struct mbuf *m, u_int tag)
|
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
if (m_tag_find(m, tag, NULL) != NULL)
|
|
|
|
return (0);
|
|
|
|
mtag = m_tag_get(tag, 0, M_NOWAIT);
|
|
|
|
if (mtag == NULL)
|
|
|
|
return (1);
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef INET
|
|
|
|
int
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_test(int dir, struct ifnet *ifp, struct mbuf **m0,
|
|
|
|
struct ether_header *eh)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pfi_kif *kif;
|
|
|
|
u_short action, reason = 0, log = 0;
|
|
|
|
struct mbuf *m = *m0;
|
2004-06-22 18:17:07 +04:00
|
|
|
struct ip *h = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_rule *a = NULL, *r = &pf_default_rule, *tr, *nr;
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_pdesc pd;
|
|
|
|
int off, dirndx, pqid = 0;
|
|
|
|
|
|
|
|
if (!pf_status.running ||
|
|
|
|
(m_tag_find(m, PACKET_TAG_PF_GENERATED, NULL) != NULL))
|
|
|
|
return (PF_PASS);
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
#if NCARP > 0
|
|
|
|
if (ifp->if_type == IFT_CARP && ifp->if_carpdev)
|
|
|
|
ifp = ifp->if_carpdev;
|
|
|
|
#endif
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
kif = pfi_index2kif[ifp->if_index];
|
2005-07-01 16:37:34 +04:00
|
|
|
if (kif == NULL) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_test: kif == NULL, if_xname %s\n", ifp->if_xname));
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
|
|
|
if (kif->pfik_flags & PFI_IFLAG_SKIP)
|
|
|
|
return (PF_PASS);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0)
|
|
|
|
panic("non-M_PKTHDR is passed to pf_test");
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* DIAGNOSTIC */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
memset(&pd, 0, sizeof(pd));
|
|
|
|
if (m->m_pkthdr.len < (int)sizeof(*h)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
REASON_SET(&reason, PFRES_SHORT);
|
|
|
|
log = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We do IP header normalization and packet reassembly here */
|
2004-11-14 14:12:16 +03:00
|
|
|
if (pf_normalize_ip(m0, dir, kif, &reason, &pd) != PF_PASS) {
|
2004-06-22 17:52:05 +04:00
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
m = *m0;
|
|
|
|
h = mtod(m, struct ip *);
|
|
|
|
|
|
|
|
off = h->ip_hl << 2;
|
|
|
|
if (off < (int)sizeof(*h)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
REASON_SET(&reason, PFRES_SHORT);
|
|
|
|
log = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
pd.src = (struct pf_addr *)&h->ip_src;
|
|
|
|
pd.dst = (struct pf_addr *)&h->ip_dst;
|
|
|
|
PF_ACPY(&pd.baddr, dir == PF_OUT ? pd.src : pd.dst, AF_INET);
|
|
|
|
pd.ip_sum = &h->ip_sum;
|
|
|
|
pd.proto = h->ip_p;
|
|
|
|
pd.af = AF_INET;
|
|
|
|
pd.tos = h->ip_tos;
|
|
|
|
pd.tot_len = ntohs(h->ip_len);
|
2004-11-14 14:12:16 +03:00
|
|
|
pd.eh = eh;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/* handle fragments that didn't get reassembled by normalization */
|
|
|
|
if (h->ip_off & htons(IP_MF | IP_OFFMASK)) {
|
|
|
|
action = pf_test_fragment(&r, dir, kif, m, h,
|
|
|
|
&pd, &a, &ruleset);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (h->ip_p) {
|
|
|
|
|
|
|
|
case IPPROTO_TCP: {
|
|
|
|
struct tcphdr th;
|
|
|
|
|
|
|
|
pd.hdr.tcp = &th;
|
|
|
|
if (!pf_pull_hdr(m, off, &th, sizeof(th),
|
|
|
|
&action, &reason, AF_INET)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && pf_check_proto_cksum(m, off,
|
|
|
|
ntohs(h->ip_len) - off, IPPROTO_TCP, AF_INET)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
pd.p_len = pd.tot_len - off - (th.th_off << 2);
|
|
|
|
if ((th.th_flags & TH_ACK) && pd.p_len == 0)
|
|
|
|
pqid = 1;
|
|
|
|
action = pf_normalize_tcp(dir, kif, m, 0, off, h, &pd);
|
|
|
|
if (action == PF_DROP)
|
|
|
|
goto done;
|
|
|
|
action = pf_test_state_tcp(&s, dir, kif, m, off, h, &pd,
|
|
|
|
&reason);
|
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_tcp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ipintrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IPPROTO_UDP: {
|
|
|
|
struct udphdr uh;
|
|
|
|
|
|
|
|
pd.hdr.udp = &uh;
|
|
|
|
if (!pf_pull_hdr(m, off, &uh, sizeof(uh),
|
|
|
|
&action, &reason, AF_INET)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && uh.uh_sum && pf_check_proto_cksum(m,
|
|
|
|
off, ntohs(h->ip_len) - off, IPPROTO_UDP, AF_INET)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (uh.uh_dport == 0 ||
|
|
|
|
ntohs(uh.uh_ulen) > m->m_pkthdr.len - off ||
|
|
|
|
ntohs(uh.uh_ulen) < sizeof(struct udphdr)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
action = pf_test_state_udp(&s, dir, kif, m, off, h, &pd);
|
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_udp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ipintrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IPPROTO_ICMP: {
|
|
|
|
struct icmp ih;
|
|
|
|
|
|
|
|
pd.hdr.icmp = &ih;
|
|
|
|
if (!pf_pull_hdr(m, off, &ih, ICMP_MINLEN,
|
|
|
|
&action, &reason, AF_INET)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && pf_check_proto_cksum(m, off,
|
|
|
|
ntohs(h->ip_len) - off, IPPROTO_ICMP, AF_INET)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
2005-07-01 16:37:34 +04:00
|
|
|
action = pf_test_state_icmp(&s, dir, kif, m, off, h, &pd,
|
|
|
|
&reason);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_icmp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ipintrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
action = pf_test_state_other(&s, dir, kif, &pd);
|
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_other(&r, &s, dir, kif, m, off, h,
|
2004-11-14 14:12:16 +03:00
|
|
|
&pd, &a, &ruleset, &ipintrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
if (action == PF_PASS && h->ip_hl > 5 &&
|
|
|
|
!((s && s->allow_opts) || r->allow_opts)) {
|
|
|
|
action = PF_DROP;
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_IPOPTIONS);
|
2004-06-22 17:52:05 +04:00
|
|
|
log = 1;
|
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: dropping packet with ip options\n"));
|
|
|
|
}
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (s && s->tag)
|
|
|
|
pf_tag_packet(m, pf_get_tag(m), s->tag);
|
|
|
|
|
2006-10-12 23:59:07 +04:00
|
|
|
#ifdef ALTQ
|
2004-06-22 17:52:05 +04:00
|
|
|
if (action == PF_PASS && r->qid) {
|
|
|
|
struct m_tag *mtag;
|
|
|
|
struct altq_tag *atag;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_QID, sizeof(*atag), M_NOWAIT);
|
|
|
|
if (mtag != NULL) {
|
|
|
|
atag = (struct altq_tag *)(mtag + 1);
|
|
|
|
if (pqid || pd.tos == IPTOS_LOWDELAY)
|
|
|
|
atag->qid = r->pqid;
|
|
|
|
else
|
|
|
|
atag->qid = r->qid;
|
|
|
|
/* add hints for ecn */
|
|
|
|
atag->af = AF_INET;
|
|
|
|
atag->hdr = h;
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
}
|
|
|
|
}
|
2006-10-12 23:59:07 +04:00
|
|
|
#endif /* ALTQ */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* connections redirected to loopback should not match sockets
|
|
|
|
* bound specifically to loopback due to security implications,
|
|
|
|
* see tcp_input() and in_pcblookup_listen().
|
|
|
|
*/
|
|
|
|
if (dir == PF_IN && action == PF_PASS && (pd.proto == IPPROTO_TCP ||
|
|
|
|
pd.proto == IPPROTO_UDP) && s != NULL && s->nat_rule.ptr != NULL &&
|
|
|
|
(s->nat_rule.ptr->action == PF_RDR ||
|
|
|
|
s->nat_rule.ptr->action == PF_BINAT) &&
|
|
|
|
(ntohl(pd.dst->v4.s_addr) >> IN_CLASSA_NSHIFT) == IN_LOOPBACKNET &&
|
|
|
|
pf_add_mbuf_tag(m, PACKET_TAG_PF_TRANSLATE_LOCALHOST)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (log)
|
|
|
|
PFLOG_PACKET(kif, h, m, AF_INET, dir, reason, r, a, ruleset);
|
|
|
|
|
|
|
|
kif->pfik_bytes[0][dir == PF_OUT][action != PF_PASS] += pd.tot_len;
|
|
|
|
kif->pfik_packets[0][dir == PF_OUT][action != PF_PASS]++;
|
|
|
|
|
|
|
|
if (action == PF_PASS || r->action == PF_DROP) {
|
|
|
|
r->packets++;
|
|
|
|
r->bytes += pd.tot_len;
|
|
|
|
if (a != NULL) {
|
|
|
|
a->packets++;
|
|
|
|
a->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s != NULL) {
|
|
|
|
dirndx = (dir == s->direction) ? 0 : 1;
|
|
|
|
s->packets[dirndx]++;
|
|
|
|
s->bytes[dirndx] += pd.tot_len;
|
|
|
|
if (s->nat_rule.ptr != NULL) {
|
|
|
|
s->nat_rule.ptr->packets++;
|
|
|
|
s->nat_rule.ptr->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s->src_node != NULL) {
|
|
|
|
s->src_node->packets++;
|
|
|
|
s->src_node->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s->nat_src_node != NULL) {
|
|
|
|
s->nat_src_node->packets++;
|
|
|
|
s->nat_src_node->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
tr = r;
|
|
|
|
nr = (s != NULL) ? s->nat_rule.ptr : pd.nat_rule;
|
|
|
|
if (nr != NULL) {
|
|
|
|
struct pf_addr *x;
|
|
|
|
/*
|
|
|
|
* XXX: we need to make sure that the addresses
|
|
|
|
* passed to pfr_update_stats() are the same than
|
|
|
|
* the addresses used during matching (pfr_match)
|
|
|
|
*/
|
|
|
|
if (r == &pf_default_rule) {
|
|
|
|
tr = nr;
|
|
|
|
x = (s == NULL || s->direction == dir) ?
|
|
|
|
&pd.baddr : &pd.naddr;
|
|
|
|
} else
|
|
|
|
x = (s == NULL || s->direction == dir) ?
|
|
|
|
&pd.naddr : &pd.baddr;
|
|
|
|
if (x == &pd.baddr || s == NULL) {
|
|
|
|
/* we need to change the address */
|
|
|
|
if (dir == PF_OUT)
|
|
|
|
pd.src = x;
|
|
|
|
else
|
|
|
|
pd.dst = x;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (tr->src.addr.type == PF_ADDR_TABLE)
|
|
|
|
pfr_update_stats(tr->src.addr.p.tbl, (s == NULL ||
|
|
|
|
s->direction == dir) ? pd.src : pd.dst, pd.af,
|
|
|
|
pd.tot_len, dir == PF_OUT, r->action == PF_PASS,
|
2004-11-14 14:12:16 +03:00
|
|
|
tr->src.neg);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (tr->dst.addr.type == PF_ADDR_TABLE)
|
|
|
|
pfr_update_stats(tr->dst.addr.p.tbl, (s == NULL ||
|
|
|
|
s->direction == dir) ? pd.dst : pd.src, pd.af,
|
|
|
|
pd.tot_len, dir == PF_OUT, r->action == PF_PASS,
|
2004-11-14 14:12:16 +03:00
|
|
|
tr->dst.neg);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (action == PF_SYNPROXY_DROP) {
|
|
|
|
m_freem(*m0);
|
|
|
|
*m0 = NULL;
|
|
|
|
action = PF_PASS;
|
|
|
|
} else if (r->rt)
|
|
|
|
/* pf_route can free the mbuf causing *m0 to become NULL */
|
|
|
|
pf_route(m0, r, dir, ifp, s);
|
|
|
|
|
|
|
|
return (action);
|
|
|
|
}
|
|
|
|
#endif /* INET */
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
int
|
2004-11-14 14:12:16 +03:00
|
|
|
pf_test6(int dir, struct ifnet *ifp, struct mbuf **m0,
|
|
|
|
struct ether_header *eh)
|
2004-06-22 17:52:05 +04:00
|
|
|
{
|
|
|
|
struct pfi_kif *kif;
|
|
|
|
u_short action, reason = 0, log = 0;
|
|
|
|
struct mbuf *m = *m0;
|
2006-10-12 23:59:07 +04:00
|
|
|
struct ip6_hdr *h = NULL;
|
2004-06-22 17:52:05 +04:00
|
|
|
struct pf_rule *a = NULL, *r = &pf_default_rule, *tr, *nr;
|
|
|
|
struct pf_state *s = NULL;
|
|
|
|
struct pf_ruleset *ruleset = NULL;
|
|
|
|
struct pf_pdesc pd;
|
|
|
|
int off, terminal = 0, dirndx;
|
|
|
|
|
|
|
|
if (!pf_status.running ||
|
|
|
|
(m_tag_find(m, PACKET_TAG_PF_GENERATED, NULL) != NULL))
|
|
|
|
return (PF_PASS);
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
#if NCARP > 0
|
|
|
|
if (ifp->if_type == IFT_CARP && ifp->if_carpdev)
|
|
|
|
ifp = ifp->if_carpdev;
|
|
|
|
#endif
|
|
|
|
|
2004-06-22 17:52:05 +04:00
|
|
|
kif = pfi_index2kif[ifp->if_index];
|
2005-07-01 16:37:34 +04:00
|
|
|
if (kif == NULL) {
|
|
|
|
DPFPRINTF(PF_DEBUG_URGENT,
|
|
|
|
("pf_test6: kif == NULL, if_xname %s\n", ifp->if_xname));
|
2004-06-22 17:52:05 +04:00
|
|
|
return (PF_DROP);
|
2005-07-01 16:37:34 +04:00
|
|
|
}
|
|
|
|
if (kif->pfik_flags & PFI_IFLAG_SKIP)
|
|
|
|
return (PF_PASS);
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0)
|
2005-07-01 16:37:34 +04:00
|
|
|
panic("non-M_PKTHDR is passed to pf_test6");
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* DIAGNOSTIC */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
memset(&pd, 0, sizeof(pd));
|
|
|
|
if (m->m_pkthdr.len < (int)sizeof(*h)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
REASON_SET(&reason, PFRES_SHORT);
|
|
|
|
log = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We do IP header normalization and packet reassembly here */
|
2004-11-14 14:12:16 +03:00
|
|
|
if (pf_normalize_ip6(m0, dir, kif, &reason, &pd) != PF_PASS) {
|
2004-06-22 17:52:05 +04:00
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
m = *m0;
|
|
|
|
h = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
pd.src = (struct pf_addr *)&h->ip6_src;
|
|
|
|
pd.dst = (struct pf_addr *)&h->ip6_dst;
|
|
|
|
PF_ACPY(&pd.baddr, dir == PF_OUT ? pd.src : pd.dst, AF_INET6);
|
|
|
|
pd.ip_sum = NULL;
|
|
|
|
pd.af = AF_INET6;
|
|
|
|
pd.tos = 0;
|
|
|
|
pd.tot_len = ntohs(h->ip6_plen) + sizeof(struct ip6_hdr);
|
2004-11-14 14:12:16 +03:00
|
|
|
pd.eh = eh;
|
2004-06-22 17:52:05 +04:00
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
off = ((char *)h - m->m_data) + sizeof(struct ip6_hdr);
|
2004-06-22 17:52:05 +04:00
|
|
|
pd.proto = h->ip6_nxt;
|
|
|
|
do {
|
|
|
|
switch (pd.proto) {
|
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
action = pf_test_fragment(&r, dir, kif, m, h,
|
|
|
|
&pd, &a, &ruleset);
|
|
|
|
if (action == PF_DROP)
|
|
|
|
REASON_SET(&reason, PFRES_FRAG);
|
|
|
|
goto done;
|
|
|
|
case IPPROTO_AH:
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_DSTOPTS: {
|
|
|
|
/* get next header and header length */
|
|
|
|
struct ip6_ext opt6;
|
|
|
|
|
|
|
|
if (!pf_pull_hdr(m, off, &opt6, sizeof(opt6),
|
2005-07-01 16:37:34 +04:00
|
|
|
NULL, &reason, pd.af)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
DPFPRINTF(PF_DEBUG_MISC,
|
|
|
|
("pf: IPv6 short opt\n"));
|
|
|
|
action = PF_DROP;
|
|
|
|
log = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (pd.proto == IPPROTO_AH)
|
|
|
|
off += (opt6.ip6e_len + 2) * 4;
|
|
|
|
else
|
|
|
|
off += (opt6.ip6e_len + 1) * 8;
|
|
|
|
pd.proto = opt6.ip6e_nxt;
|
|
|
|
/* goto the next header */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
terminal++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} while (!terminal);
|
|
|
|
|
|
|
|
switch (pd.proto) {
|
|
|
|
|
|
|
|
case IPPROTO_TCP: {
|
|
|
|
struct tcphdr th;
|
|
|
|
|
|
|
|
pd.hdr.tcp = &th;
|
|
|
|
if (!pf_pull_hdr(m, off, &th, sizeof(th),
|
|
|
|
&action, &reason, AF_INET6)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && pf_check_proto_cksum(m, off,
|
2004-12-21 15:06:37 +03:00
|
|
|
ntohs(h->ip6_plen) - (off - sizeof(struct ip6_hdr)),
|
|
|
|
IPPROTO_TCP, AF_INET6)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
action = PF_DROP;
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_PROTCKSUM);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
pd.p_len = pd.tot_len - off - (th.th_off << 2);
|
|
|
|
action = pf_normalize_tcp(dir, kif, m, 0, off, h, &pd);
|
|
|
|
if (action == PF_DROP)
|
|
|
|
goto done;
|
|
|
|
action = pf_test_state_tcp(&s, dir, kif, m, off, h, &pd,
|
|
|
|
&reason);
|
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_tcp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ip6intrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IPPROTO_UDP: {
|
|
|
|
struct udphdr uh;
|
|
|
|
|
|
|
|
pd.hdr.udp = &uh;
|
|
|
|
if (!pf_pull_hdr(m, off, &uh, sizeof(uh),
|
|
|
|
&action, &reason, AF_INET6)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && uh.uh_sum && pf_check_proto_cksum(m,
|
2004-12-21 15:06:37 +03:00
|
|
|
off, ntohs(h->ip6_plen) - (off - sizeof(struct ip6_hdr)),
|
|
|
|
IPPROTO_UDP, AF_INET6)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
action = PF_DROP;
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_PROTCKSUM);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (uh.uh_dport == 0 ||
|
|
|
|
ntohs(uh.uh_ulen) > m->m_pkthdr.len - off ||
|
|
|
|
ntohs(uh.uh_ulen) < sizeof(struct udphdr)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
action = pf_test_state_udp(&s, dir, kif, m, off, h, &pd);
|
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_udp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ip6intrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IPPROTO_ICMPV6: {
|
|
|
|
struct icmp6_hdr ih;
|
|
|
|
|
|
|
|
pd.hdr.icmp6 = &ih;
|
|
|
|
if (!pf_pull_hdr(m, off, &ih, sizeof(ih),
|
|
|
|
&action, &reason, AF_INET6)) {
|
|
|
|
log = action != PF_PASS;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (dir == PF_IN && pf_check_proto_cksum(m, off,
|
2004-12-21 15:06:37 +03:00
|
|
|
ntohs(h->ip6_plen) - (off - sizeof(struct ip6_hdr)),
|
|
|
|
IPPROTO_ICMPV6, AF_INET6)) {
|
2004-06-22 17:52:05 +04:00
|
|
|
action = PF_DROP;
|
2005-07-01 16:37:34 +04:00
|
|
|
REASON_SET(&reason, PFRES_PROTCKSUM);
|
2004-06-22 17:52:05 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
action = pf_test_state_icmp(&s, dir, kif,
|
2005-07-01 16:37:34 +04:00
|
|
|
m, off, h, &pd, &reason);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (action == PF_PASS) {
|
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
2004-11-14 14:12:16 +03:00
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_icmp(&r, &s, dir, kif,
|
2004-11-14 14:12:16 +03:00
|
|
|
m, off, h, &pd, &a, &ruleset, &ip6intrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
action = pf_test_state_other(&s, dir, kif, &pd);
|
|
|
|
if (action == PF_PASS) {
|
2004-11-14 14:12:16 +03:00
|
|
|
#if NPFSYNC
|
|
|
|
pfsync_update_state(s);
|
|
|
|
#endif /* NPFSYNC */
|
2004-06-22 17:52:05 +04:00
|
|
|
r = s->rule.ptr;
|
|
|
|
a = s->anchor.ptr;
|
|
|
|
log = s->log;
|
|
|
|
} else if (s == NULL)
|
|
|
|
action = pf_test_other(&r, &s, dir, kif, m, off, h,
|
2004-11-14 14:12:16 +03:00
|
|
|
&pd, &a, &ruleset, &ip6intrq);
|
2004-06-22 17:52:05 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
/* XXX handle IPv6 options, if not allowed. not implemented. */
|
|
|
|
|
2005-07-01 16:37:34 +04:00
|
|
|
if (s && s->tag)
|
|
|
|
pf_tag_packet(m, pf_get_tag(m), s->tag);
|
|
|
|
|
2006-10-12 23:59:07 +04:00
|
|
|
#ifdef ALTQ
|
2004-06-22 17:52:05 +04:00
|
|
|
if (action == PF_PASS && r->qid) {
|
|
|
|
struct m_tag *mtag;
|
|
|
|
struct altq_tag *atag;
|
|
|
|
|
|
|
|
mtag = m_tag_get(PACKET_TAG_PF_QID, sizeof(*atag), M_NOWAIT);
|
|
|
|
if (mtag != NULL) {
|
|
|
|
atag = (struct altq_tag *)(mtag + 1);
|
|
|
|
if (pd.tos == IPTOS_LOWDELAY)
|
|
|
|
atag->qid = r->pqid;
|
|
|
|
else
|
|
|
|
atag->qid = r->qid;
|
|
|
|
/* add hints for ecn */
|
|
|
|
atag->af = AF_INET6;
|
|
|
|
atag->hdr = h;
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
}
|
|
|
|
}
|
2006-10-12 23:59:07 +04:00
|
|
|
#endif /* ALTQ */
|
2004-06-22 17:52:05 +04:00
|
|
|
|
|
|
|
if (dir == PF_IN && action == PF_PASS && (pd.proto == IPPROTO_TCP ||
|
|
|
|
pd.proto == IPPROTO_UDP) && s != NULL && s->nat_rule.ptr != NULL &&
|
|
|
|
(s->nat_rule.ptr->action == PF_RDR ||
|
|
|
|
s->nat_rule.ptr->action == PF_BINAT) &&
|
|
|
|
IN6_IS_ADDR_LOOPBACK(&pd.dst->v6) &&
|
|
|
|
pf_add_mbuf_tag(m, PACKET_TAG_PF_TRANSLATE_LOCALHOST)) {
|
|
|
|
action = PF_DROP;
|
|
|
|
REASON_SET(&reason, PFRES_MEMORY);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (log)
|
|
|
|
PFLOG_PACKET(kif, h, m, AF_INET6, dir, reason, r, a, ruleset);
|
|
|
|
|
|
|
|
kif->pfik_bytes[1][dir == PF_OUT][action != PF_PASS] += pd.tot_len;
|
|
|
|
kif->pfik_packets[1][dir == PF_OUT][action != PF_PASS]++;
|
|
|
|
|
|
|
|
if (action == PF_PASS || r->action == PF_DROP) {
|
|
|
|
r->packets++;
|
|
|
|
r->bytes += pd.tot_len;
|
|
|
|
if (a != NULL) {
|
|
|
|
a->packets++;
|
|
|
|
a->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s != NULL) {
|
|
|
|
dirndx = (dir == s->direction) ? 0 : 1;
|
|
|
|
s->packets[dirndx]++;
|
|
|
|
s->bytes[dirndx] += pd.tot_len;
|
|
|
|
if (s->nat_rule.ptr != NULL) {
|
|
|
|
s->nat_rule.ptr->packets++;
|
|
|
|
s->nat_rule.ptr->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s->src_node != NULL) {
|
|
|
|
s->src_node->packets++;
|
|
|
|
s->src_node->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
if (s->nat_src_node != NULL) {
|
|
|
|
s->nat_src_node->packets++;
|
|
|
|
s->nat_src_node->bytes += pd.tot_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
tr = r;
|
|
|
|
nr = (s != NULL) ? s->nat_rule.ptr : pd.nat_rule;
|
|
|
|
if (nr != NULL) {
|
|
|
|
struct pf_addr *x;
|
|
|
|
/*
|
|
|
|
* XXX: we need to make sure that the addresses
|
|
|
|
* passed to pfr_update_stats() are the same than
|
|
|
|
* the addresses used during matching (pfr_match)
|
|
|
|
*/
|
|
|
|
if (r == &pf_default_rule) {
|
|
|
|
tr = nr;
|
|
|
|
x = (s == NULL || s->direction == dir) ?
|
|
|
|
&pd.baddr : &pd.naddr;
|
|
|
|
} else {
|
|
|
|
x = (s == NULL || s->direction == dir) ?
|
|
|
|
&pd.naddr : &pd.baddr;
|
|
|
|
}
|
|
|
|
if (x == &pd.baddr || s == NULL) {
|
|
|
|
if (dir == PF_OUT)
|
|
|
|
pd.src = x;
|
|
|
|
else
|
|
|
|
pd.dst = x;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (tr->src.addr.type == PF_ADDR_TABLE)
|
|
|
|
pfr_update_stats(tr->src.addr.p.tbl, (s == NULL ||
|
|
|
|
s->direction == dir) ? pd.src : pd.dst, pd.af,
|
|
|
|
pd.tot_len, dir == PF_OUT, r->action == PF_PASS,
|
2004-11-14 14:12:16 +03:00
|
|
|
tr->src.neg);
|
2004-06-22 17:52:05 +04:00
|
|
|
if (tr->dst.addr.type == PF_ADDR_TABLE)
|
|
|
|
pfr_update_stats(tr->dst.addr.p.tbl, (s == NULL ||
|
|
|
|
s->direction == dir) ? pd.dst : pd.src, pd.af,
|
|
|
|
pd.tot_len, dir == PF_OUT, r->action == PF_PASS,
|
2004-11-14 14:12:16 +03:00
|
|
|
tr->dst.neg);
|
2004-06-22 17:52:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (action == PF_SYNPROXY_DROP) {
|
|
|
|
m_freem(*m0);
|
|
|
|
*m0 = NULL;
|
|
|
|
action = PF_PASS;
|
|
|
|
} else if (r->rt)
|
|
|
|
/* pf_route6 can free the mbuf causing *m0 to become NULL */
|
|
|
|
pf_route6(m0, r, dir, ifp, s);
|
|
|
|
|
|
|
|
return (action);
|
|
|
|
}
|
|
|
|
#endif /* INET6 */
|
2004-11-14 14:12:16 +03:00
|
|
|
|
|
|
|
int
|
2006-11-16 04:32:37 +03:00
|
|
|
pf_check_congestion(struct ifqueue *ifq)
|
2004-11-14 14:12:16 +03:00
|
|
|
{
|
|
|
|
#ifdef __OpenBSD__
|
|
|
|
if (ifq->ifq_congestion)
|
|
|
|
return (1);
|
|
|
|
else
|
|
|
|
return (0);
|
|
|
|
#else
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
|
|
}
|