1 /* $OpenBSD: pfvar.h,v 1.495 2020/07/28 16:47:42 yasuoka Exp $ */ 2 3 /* 4 * Copyright (c) 2001 Daniel Hartmeier 5 * Copyright (c) 2002 - 2013 Henning Brauer <henning@openbsd.org> 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * - Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * - Redistributions in binary form must reproduce the above 15 * copyright notice, this list of conditions and the following 16 * disclaimer in the documentation and/or other materials provided 17 * with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 27 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 29 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 * 32 */ 33 34 #ifndef _NET_PFVAR_H_ 35 #define _NET_PFVAR_H_ 36 37 #include <sys/queue.h> 38 #include <sys/tree.h> 39 #include <sys/rwlock.h> 40 #include <sys/syslimits.h> 41 #include <sys/refcnt.h> 42 #include <sys/timeout.h> 43 44 #include <netinet/in.h> 45 46 #include <net/radix.h> 47 #include <net/route.h> 48 49 struct ip; 50 struct ip6_hdr; 51 struct mbuf_list; 52 53 #define PF_TCPS_PROXY_SRC ((TCP_NSTATES)+0) 54 #define PF_TCPS_PROXY_DST ((TCP_NSTATES)+1) 55 56 #define PF_MD5_DIGEST_LENGTH 16 57 #ifdef MD5_DIGEST_LENGTH 58 #if PF_MD5_DIGEST_LENGTH != MD5_DIGEST_LENGTH 59 #error md5 digest length mismatch 60 #endif 61 #endif 62 63 typedef struct refcnt pf_refcnt_t; 64 #define PF_REF_INIT(_x) refcnt_init(&(_x)) 65 #define PF_REF_TAKE(_x) refcnt_take(&(_x)) 66 #define PF_REF_RELE(_x) refcnt_rele(&(_x)) 67 68 enum { PF_INOUT, PF_IN, PF_OUT, PF_FWD }; 69 enum { PF_PASS, PF_DROP, PF_SCRUB, PF_NOSCRUB, PF_NAT, PF_NONAT, 70 PF_BINAT, PF_NOBINAT, PF_RDR, PF_NORDR, PF_SYNPROXY_DROP, PF_DEFER, 71 PF_MATCH, PF_DIVERT, PF_RT, PF_AFRT }; 72 enum { PF_TRANS_RULESET, PF_TRANS_TABLE }; 73 enum { PF_OP_NONE, PF_OP_IRG, PF_OP_EQ, PF_OP_NE, PF_OP_LT, 74 PF_OP_LE, PF_OP_GT, PF_OP_GE, PF_OP_XRG, PF_OP_RRG }; 75 enum { PF_CHANGE_NONE, PF_CHANGE_ADD_HEAD, PF_CHANGE_ADD_TAIL, 76 PF_CHANGE_ADD_BEFORE, PF_CHANGE_ADD_AFTER, 77 PF_CHANGE_REMOVE, PF_CHANGE_GET_TICKET }; 78 enum { PF_GET_NONE, PF_GET_CLR_CNTR }; 79 enum { PF_SK_WIRE, PF_SK_STACK, PF_SK_BOTH }; 80 enum { PF_PEER_SRC, PF_PEER_DST, PF_PEER_BOTH }; 81 82 /* 83 * Note about PFTM_*: real indices into pf_rule.timeout[] come before 84 * PFTM_MAX, special cases afterwards. See pf_state_expires(). 85 */ 86 enum { PFTM_TCP_FIRST_PACKET, PFTM_TCP_OPENING, PFTM_TCP_ESTABLISHED, 87 PFTM_TCP_CLOSING, PFTM_TCP_FIN_WAIT, PFTM_TCP_CLOSED, 88 PFTM_UDP_FIRST_PACKET, PFTM_UDP_SINGLE, PFTM_UDP_MULTIPLE, 89 PFTM_ICMP_FIRST_PACKET, PFTM_ICMP_ERROR_REPLY, 90 PFTM_OTHER_FIRST_PACKET, PFTM_OTHER_SINGLE, 91 PFTM_OTHER_MULTIPLE, PFTM_FRAG, PFTM_INTERVAL, 92 PFTM_ADAPTIVE_START, PFTM_ADAPTIVE_END, PFTM_SRC_NODE, 93 PFTM_TS_DIFF, PFTM_MAX, PFTM_PURGE, PFTM_UNLINKED }; 94 95 /* PFTM default values */ 96 #define PFTM_TCP_FIRST_PACKET_VAL 120 /* First TCP packet */ 97 #define PFTM_TCP_OPENING_VAL 30 /* No response yet */ 98 #define PFTM_TCP_ESTABLISHED_VAL 24*60*60/* Established */ 99 #define PFTM_TCP_CLOSING_VAL 15 * 60 /* Half closed */ 100 #define PFTM_TCP_FIN_WAIT_VAL 45 /* Got both FINs */ 101 #define PFTM_TCP_CLOSED_VAL 90 /* Got a RST */ 102 #define PFTM_UDP_FIRST_PACKET_VAL 60 /* First UDP packet */ 103 #define PFTM_UDP_SINGLE_VAL 30 /* Unidirectional */ 104 #define PFTM_UDP_MULTIPLE_VAL 60 /* Bidirectional */ 105 #define PFTM_ICMP_FIRST_PACKET_VAL 20 /* First ICMP packet */ 106 #define PFTM_ICMP_ERROR_REPLY_VAL 10 /* Got error response */ 107 #define PFTM_OTHER_FIRST_PACKET_VAL 60 /* First packet */ 108 #define PFTM_OTHER_SINGLE_VAL 30 /* Unidirectional */ 109 #define PFTM_OTHER_MULTIPLE_VAL 60 /* Bidirectional */ 110 #define PFTM_FRAG_VAL 60 /* Fragment expire */ 111 #define PFTM_INTERVAL_VAL 10 /* Expire interval */ 112 #define PFTM_SRC_NODE_VAL 0 /* Source tracking */ 113 #define PFTM_TS_DIFF_VAL 30 /* Allowed TS diff */ 114 115 /* 116 * For each connection (combination of proto,src,dst,af) the number 117 * of fragments is limited. Over the PFTM_FRAG interval the average 118 * rate must be less than PF_FRAG_STALE fragments per second. 119 * Otherwise older fragments are considered stale and are dropped. 120 */ 121 #define PF_FRAG_STALE 200 122 123 /* 124 * Limit the length of the fragment queue traversal. Remember 125 * search entry points based on the fragment offset. 126 */ 127 #define PF_FRAG_ENTRY_POINTS 16 128 129 /* 130 * The number of entries in the fragment queue must be limited 131 * to avoid DoS by linear seaching. Instead of a global limit, 132 * use a limit per entry point. For large packets these sum up. 133 */ 134 #define PF_FRAG_ENTRY_LIMIT 64 135 136 enum { PF_NOPFROUTE, PF_ROUTETO, PF_DUPTO, PF_REPLYTO }; 137 enum { PF_LIMIT_STATES, PF_LIMIT_SRC_NODES, PF_LIMIT_FRAGS, 138 PF_LIMIT_TABLES, PF_LIMIT_TABLE_ENTRIES, PF_LIMIT_PKTDELAY_PKTS, 139 PF_LIMIT_MAX }; 140 #define PF_POOL_IDMASK 0x0f 141 enum { PF_POOL_NONE, PF_POOL_BITMASK, PF_POOL_RANDOM, 142 PF_POOL_SRCHASH, PF_POOL_ROUNDROBIN, PF_POOL_LEASTSTATES }; 143 enum { PF_ADDR_ADDRMASK, PF_ADDR_NOROUTE, PF_ADDR_DYNIFTL, 144 PF_ADDR_TABLE, PF_ADDR_RTLABEL, PF_ADDR_URPFFAILED, 145 PF_ADDR_RANGE, PF_ADDR_NONE }; 146 #define PF_POOL_TYPEMASK 0x0f 147 #define PF_POOL_STICKYADDR 0x20 148 #define PF_WSCALE_FLAG 0x80 149 #define PF_WSCALE_MASK 0x0f 150 151 #define PF_POOL_DYNTYPE(_o) \ 152 ((((_o) & PF_POOL_TYPEMASK) == PF_POOL_ROUNDROBIN) || \ 153 (((_o) & PF_POOL_TYPEMASK) == PF_POOL_LEASTSTATES) || \ 154 (((_o) & PF_POOL_TYPEMASK) == PF_POOL_RANDOM) || \ 155 (((_o) & PF_POOL_TYPEMASK) == PF_POOL_SRCHASH)) 156 157 #define PF_LOG 0x01 158 #define PF_LOG_ALL 0x02 159 #define PF_LOG_SOCKET_LOOKUP 0x04 160 #define PF_LOG_FORCE 0x08 161 #define PF_LOG_MATCHES 0x10 162 163 struct pf_addr { 164 union { 165 struct in_addr v4; 166 struct in6_addr v6; 167 u_int8_t addr8[16]; 168 u_int16_t addr16[8]; 169 u_int32_t addr32[4]; 170 } pfa; /* 128-bit address */ 171 #define v4 pfa.v4 172 #define v6 pfa.v6 173 #define addr8 pfa.addr8 174 #define addr16 pfa.addr16 175 #define addr32 pfa.addr32 176 }; 177 178 #define PF_TABLE_NAME_SIZE 32 179 180 #define PFI_AFLAG_NETWORK 0x01 181 #define PFI_AFLAG_BROADCAST 0x02 182 #define PFI_AFLAG_PEER 0x04 183 #define PFI_AFLAG_MODEMASK 0x07 184 #define PFI_AFLAG_NOALIAS 0x08 185 186 struct pf_addr_wrap { 187 union { 188 struct { 189 struct pf_addr addr; 190 struct pf_addr mask; 191 } a; 192 char ifname[IFNAMSIZ]; 193 char tblname[PF_TABLE_NAME_SIZE]; 194 char rtlabelname[RTLABEL_LEN]; 195 u_int32_t rtlabel; 196 } v; 197 union { 198 struct pfi_dynaddr *dyn; 199 struct pfr_ktable *tbl; 200 int dyncnt; 201 int tblcnt; 202 } p; 203 u_int8_t type; /* PF_ADDR_* */ 204 u_int8_t iflags; /* PFI_AFLAG_* */ 205 }; 206 207 #ifdef _KERNEL 208 struct pfi_dynaddr { 209 TAILQ_ENTRY(pfi_dynaddr) entry; 210 struct pf_addr pfid_addr4; 211 struct pf_addr pfid_mask4; 212 struct pf_addr pfid_addr6; 213 struct pf_addr pfid_mask6; 214 struct pfr_ktable *pfid_kt; 215 struct pfi_kif *pfid_kif; 216 void *pfid_hook_cookie; 217 int pfid_net; /* mask or 128 */ 218 int pfid_acnt4; /* address count IPv4 */ 219 int pfid_acnt6; /* address count IPv6 */ 220 sa_family_t pfid_af; /* rule af */ 221 u_int8_t pfid_iflags; /* PFI_AFLAG_* */ 222 }; 223 #endif /* _KERNEL */ 224 225 226 /* 227 * Logging macros 228 */ 229 230 #ifndef PF_DEBUGNAME 231 #define PF_DEBUGNAME "pf: " 232 #endif 233 234 #ifdef _KERNEL 235 #define DPFPRINTF(n, format, x...) \ 236 do { \ 237 if (pf_status.debug >= (n)) { \ 238 log(n, PF_DEBUGNAME); \ 239 addlog(format, ##x); \ 240 addlog("\n"); \ 241 } \ 242 } while (0) 243 #else 244 #ifdef PFDEBUG 245 #define DPFPRINTF(n, format, x...) \ 246 do { \ 247 fprintf(stderr, format, ##x); \ 248 fprintf(stderr, "\n"); \ 249 } while (0) 250 #else 251 #define DPFPRINTF(n, format, x...) ((void)0) 252 #endif /* PFDEBUG */ 253 #endif /* _KERNEL */ 254 255 256 /* 257 * Address manipulation macros 258 */ 259 260 #define PF_AEQ(a, b, c) \ 261 ((c == AF_INET && (a)->addr32[0] == (b)->addr32[0]) || \ 262 (c == AF_INET6 && \ 263 (a)->addr32[3] == (b)->addr32[3] && \ 264 (a)->addr32[2] == (b)->addr32[2] && \ 265 (a)->addr32[1] == (b)->addr32[1] && \ 266 (a)->addr32[0] == (b)->addr32[0])) \ 267 268 #define PF_ANEQ(a, b, c) \ 269 ((c == AF_INET && (a)->addr32[0] != (b)->addr32[0]) || \ 270 (c == AF_INET6 && \ 271 ((a)->addr32[3] != (b)->addr32[3] || \ 272 (a)->addr32[2] != (b)->addr32[2] || \ 273 (a)->addr32[1] != (b)->addr32[1] || \ 274 (a)->addr32[0] != (b)->addr32[0]))) \ 275 276 #define PF_AZERO(a, c) \ 277 ((c == AF_INET && !(a)->addr32[0]) || \ 278 (c == AF_INET6 && \ 279 !(a)->addr32[0] && !(a)->addr32[1] && \ 280 !(a)->addr32[2] && !(a)->addr32[3] )) \ 281 282 #define PF_MISMATCHAW(aw, x, af, neg, ifp, rtid) \ 283 ( \ 284 (((aw)->type == PF_ADDR_NOROUTE && \ 285 pf_routable((x), (af), NULL, (rtid))) || \ 286 (((aw)->type == PF_ADDR_URPFFAILED && (ifp) != NULL && \ 287 pf_routable((x), (af), (ifp), (rtid))) || \ 288 ((aw)->type == PF_ADDR_RTLABEL && \ 289 !pf_rtlabel_match((x), (af), (aw), (rtid))) || \ 290 ((aw)->type == PF_ADDR_TABLE && \ 291 !pfr_match_addr((aw)->p.tbl, (x), (af))) || \ 292 ((aw)->type == PF_ADDR_DYNIFTL && \ 293 !pfi_match_addr((aw)->p.dyn, (x), (af))) || \ 294 ((aw)->type == PF_ADDR_RANGE && \ 295 !pf_match_addr_range(&(aw)->v.a.addr, \ 296 &(aw)->v.a.mask, (x), (af))) || \ 297 ((aw)->type == PF_ADDR_ADDRMASK && \ 298 !PF_AZERO(&(aw)->v.a.mask, (af)) && \ 299 !pf_match_addr(0, &(aw)->v.a.addr, \ 300 &(aw)->v.a.mask, (x), (af))))) != \ 301 (neg) \ 302 ) 303 304 struct pf_rule_uid { 305 uid_t uid[2]; 306 u_int8_t op; 307 }; 308 309 struct pf_rule_gid { 310 uid_t gid[2]; 311 u_int8_t op; 312 }; 313 314 struct pf_rule_addr { 315 struct pf_addr_wrap addr; 316 u_int16_t port[2]; 317 u_int8_t neg; 318 u_int8_t port_op; 319 u_int16_t weight; 320 }; 321 322 struct pf_threshold { 323 u_int32_t limit; 324 #define PF_THRESHOLD_MULT 1000 325 #define PF_THRESHOLD_MAX 0xffffffff / PF_THRESHOLD_MULT 326 u_int32_t seconds; 327 u_int32_t count; 328 u_int32_t last; 329 }; 330 331 struct pf_poolhashkey { 332 union { 333 u_int8_t key8[16]; 334 u_int16_t key16[8]; 335 u_int32_t key32[4]; 336 } pfk; /* 128-bit hash key */ 337 #define key8 pfk.key8 338 #define key16 pfk.key16 339 #define key32 pfk.key32 340 }; 341 342 struct pf_pool { 343 struct pf_addr_wrap addr; 344 struct pf_poolhashkey key; 345 struct pf_addr counter; 346 char ifname[IFNAMSIZ]; 347 struct pfi_kif *kif; 348 int tblidx; 349 u_int64_t states; 350 int curweight; 351 u_int16_t weight; 352 u_int16_t proxy_port[2]; 353 u_int8_t port_op; 354 u_int8_t opts; 355 }; 356 357 /* A packed Operating System description for fingerprinting */ 358 typedef u_int32_t pf_osfp_t; 359 #define PF_OSFP_ANY ((pf_osfp_t)0) 360 #define PF_OSFP_UNKNOWN ((pf_osfp_t)-1) 361 #define PF_OSFP_NOMATCH ((pf_osfp_t)-2) 362 363 struct pf_osfp_entry { 364 SLIST_ENTRY(pf_osfp_entry) fp_entry; 365 pf_osfp_t fp_os; 366 int fp_enflags; 367 #define PF_OSFP_EXPANDED 0x001 /* expanded entry */ 368 #define PF_OSFP_GENERIC 0x002 /* generic signature */ 369 #define PF_OSFP_NODETAIL 0x004 /* no p0f details */ 370 #define PF_OSFP_LEN 32 371 u_char fp_class_nm[PF_OSFP_LEN]; 372 u_char fp_version_nm[PF_OSFP_LEN]; 373 u_char fp_subtype_nm[PF_OSFP_LEN]; 374 }; 375 #define PF_OSFP_ENTRY_EQ(a, b) \ 376 ((a)->fp_os == (b)->fp_os && \ 377 memcmp((a)->fp_class_nm, (b)->fp_class_nm, PF_OSFP_LEN) == 0 && \ 378 memcmp((a)->fp_version_nm, (b)->fp_version_nm, PF_OSFP_LEN) == 0 && \ 379 memcmp((a)->fp_subtype_nm, (b)->fp_subtype_nm, PF_OSFP_LEN) == 0) 380 381 /* handle pf_osfp_t packing */ 382 #define _FP_RESERVED_BIT 1 /* For the special negative #defines */ 383 #define _FP_UNUSED_BITS 1 384 #define _FP_CLASS_BITS 10 /* OS Class (Windows, Linux) */ 385 #define _FP_VERSION_BITS 10 /* OS version (95, 98, NT, 2.4.54, 3.2) */ 386 #define _FP_SUBTYPE_BITS 10 /* patch level (NT SP4, SP3, ECN patch) */ 387 #define PF_OSFP_UNPACK(osfp, class, version, subtype) do { \ 388 (class) = ((osfp) >> (_FP_VERSION_BITS+_FP_SUBTYPE_BITS)) & \ 389 ((1 << _FP_CLASS_BITS) - 1); \ 390 (version) = ((osfp) >> _FP_SUBTYPE_BITS) & \ 391 ((1 << _FP_VERSION_BITS) - 1);\ 392 (subtype) = (osfp) & ((1 << _FP_SUBTYPE_BITS) - 1); \ 393 } while(0) 394 #define PF_OSFP_PACK(osfp, class, version, subtype) do { \ 395 (osfp) = ((class) & ((1 << _FP_CLASS_BITS) - 1)) << (_FP_VERSION_BITS \ 396 + _FP_SUBTYPE_BITS); \ 397 (osfp) |= ((version) & ((1 << _FP_VERSION_BITS) - 1)) << \ 398 _FP_SUBTYPE_BITS; \ 399 (osfp) |= (subtype) & ((1 << _FP_SUBTYPE_BITS) - 1); \ 400 } while(0) 401 402 /* the fingerprint of an OSes TCP SYN packet */ 403 typedef u_int64_t pf_tcpopts_t; 404 struct pf_os_fingerprint { 405 SLIST_HEAD(pf_osfp_enlist, pf_osfp_entry) fp_oses; /* list of matches */ 406 pf_tcpopts_t fp_tcpopts; /* packed TCP options */ 407 u_int16_t fp_wsize; /* TCP window size */ 408 u_int16_t fp_psize; /* ip->ip_len */ 409 u_int16_t fp_mss; /* TCP MSS */ 410 u_int16_t fp_flags; 411 #define PF_OSFP_WSIZE_MOD 0x0001 /* Window modulus */ 412 #define PF_OSFP_WSIZE_DC 0x0002 /* Window don't care */ 413 #define PF_OSFP_WSIZE_MSS 0x0004 /* Window multiple of MSS */ 414 #define PF_OSFP_WSIZE_MTU 0x0008 /* Window multiple of MTU */ 415 #define PF_OSFP_PSIZE_MOD 0x0010 /* packet size modulus */ 416 #define PF_OSFP_PSIZE_DC 0x0020 /* packet size don't care */ 417 #define PF_OSFP_WSCALE 0x0040 /* TCP window scaling */ 418 #define PF_OSFP_WSCALE_MOD 0x0080 /* TCP window scale modulus */ 419 #define PF_OSFP_WSCALE_DC 0x0100 /* TCP window scale dont-care */ 420 #define PF_OSFP_MSS 0x0200 /* TCP MSS */ 421 #define PF_OSFP_MSS_MOD 0x0400 /* TCP MSS modulus */ 422 #define PF_OSFP_MSS_DC 0x0800 /* TCP MSS dont-care */ 423 #define PF_OSFP_DF 0x1000 /* IPv4 don't fragment bit */ 424 #define PF_OSFP_TS0 0x2000 /* Zero timestamp */ 425 #define PF_OSFP_INET6 0x4000 /* IPv6 */ 426 u_int8_t fp_optcnt; /* TCP option count */ 427 u_int8_t fp_wscale; /* TCP window scaling */ 428 u_int8_t fp_ttl; /* IPv4 TTL */ 429 #define PF_OSFP_MAXTTL_OFFSET 40 430 /* TCP options packing */ 431 #define PF_OSFP_TCPOPT_NOP 0x0 /* TCP NOP option */ 432 #define PF_OSFP_TCPOPT_WSCALE 0x1 /* TCP window scaling option */ 433 #define PF_OSFP_TCPOPT_MSS 0x2 /* TCP max segment size opt */ 434 #define PF_OSFP_TCPOPT_SACK 0x3 /* TCP SACK OK option */ 435 #define PF_OSFP_TCPOPT_TS 0x4 /* TCP timestamp option */ 436 #define PF_OSFP_TCPOPT_BITS 3 /* bits used by each option */ 437 #define PF_OSFP_MAX_OPTS \ 438 (sizeof(((struct pf_os_fingerprint *)0)->fp_tcpopts) * 8) \ 439 / PF_OSFP_TCPOPT_BITS 440 441 SLIST_ENTRY(pf_os_fingerprint) fp_next; 442 }; 443 444 struct pf_osfp_ioctl { 445 struct pf_osfp_entry fp_os; 446 pf_tcpopts_t fp_tcpopts; /* packed TCP options */ 447 u_int16_t fp_wsize; /* TCP window size */ 448 u_int16_t fp_psize; /* ip->ip_len */ 449 u_int16_t fp_mss; /* TCP MSS */ 450 u_int16_t fp_flags; 451 u_int8_t fp_optcnt; /* TCP option count */ 452 u_int8_t fp_wscale; /* TCP window scaling */ 453 u_int8_t fp_ttl; /* IPv4 TTL */ 454 455 int fp_getnum; /* DIOCOSFPGET number */ 456 }; 457 458 struct pf_rule_actions { 459 int rtableid; 460 u_int16_t qid; 461 u_int16_t pqid; 462 u_int16_t max_mss; 463 u_int16_t flags; 464 u_int16_t delay; 465 u_int8_t log; 466 u_int8_t set_tos; 467 u_int8_t min_ttl; 468 u_int8_t set_prio[2]; 469 u_int8_t pad[1]; 470 }; 471 472 union pf_rule_ptr { 473 struct pf_rule *ptr; 474 u_int32_t nr; 475 }; 476 477 #define PF_ANCHOR_NAME_SIZE 64 478 #define PF_ANCHOR_MAXPATH (MAXPATHLEN - PF_ANCHOR_NAME_SIZE - 1) 479 #define PF_OPTIMIZER_TABLE_PFX "__automatic_" 480 481 struct pf_rule { 482 struct pf_rule_addr src; 483 struct pf_rule_addr dst; 484 #define PF_SKIP_IFP 0 485 #define PF_SKIP_DIR 1 486 #define PF_SKIP_RDOM 2 487 #define PF_SKIP_AF 3 488 #define PF_SKIP_PROTO 4 489 #define PF_SKIP_SRC_ADDR 5 490 #define PF_SKIP_DST_ADDR 6 491 #define PF_SKIP_SRC_PORT 7 492 #define PF_SKIP_DST_PORT 8 493 #define PF_SKIP_COUNT 9 494 union pf_rule_ptr skip[PF_SKIP_COUNT]; 495 #define PF_RULE_LABEL_SIZE 64 496 char label[PF_RULE_LABEL_SIZE]; 497 #define PF_QNAME_SIZE 64 498 char ifname[IFNAMSIZ]; 499 char rcv_ifname[IFNAMSIZ]; 500 char qname[PF_QNAME_SIZE]; 501 char pqname[PF_QNAME_SIZE]; 502 #define PF_TAG_NAME_SIZE 64 503 char tagname[PF_TAG_NAME_SIZE]; 504 char match_tagname[PF_TAG_NAME_SIZE]; 505 506 char overload_tblname[PF_TABLE_NAME_SIZE]; 507 508 TAILQ_ENTRY(pf_rule) entries; 509 struct pf_pool nat; 510 struct pf_pool rdr; 511 struct pf_pool route; 512 struct pf_threshold pktrate; 513 514 u_int64_t evaluations; 515 u_int64_t packets[2]; 516 u_int64_t bytes[2]; 517 518 struct pfi_kif *kif; 519 struct pfi_kif *rcv_kif; 520 struct pf_anchor *anchor; 521 struct pfr_ktable *overload_tbl; 522 523 pf_osfp_t os_fingerprint; 524 525 int rtableid; 526 int onrdomain; 527 u_int32_t timeout[PFTM_MAX]; 528 u_int32_t states_cur; 529 u_int32_t states_tot; 530 u_int32_t max_states; 531 u_int32_t src_nodes; 532 u_int32_t max_src_nodes; 533 u_int32_t max_src_states; 534 u_int32_t max_src_conn; 535 struct { 536 u_int32_t limit; 537 u_int32_t seconds; 538 } max_src_conn_rate; 539 u_int32_t qid; 540 u_int32_t pqid; 541 u_int32_t rt_listid; 542 u_int32_t nr; 543 u_int32_t prob; 544 uid_t cuid; 545 pid_t cpid; 546 547 u_int16_t return_icmp; 548 u_int16_t return_icmp6; 549 u_int16_t max_mss; 550 u_int16_t tag; 551 u_int16_t match_tag; 552 u_int16_t scrub_flags; 553 u_int16_t delay; 554 555 struct pf_rule_uid uid; 556 struct pf_rule_gid gid; 557 558 u_int32_t rule_flag; 559 u_int8_t action; 560 u_int8_t direction; 561 u_int8_t log; 562 u_int8_t logif; 563 u_int8_t quick; 564 u_int8_t ifnot; 565 u_int8_t match_tag_not; 566 567 #define PF_STATE_NORMAL 0x1 568 #define PF_STATE_MODULATE 0x2 569 #define PF_STATE_SYNPROXY 0x3 570 u_int8_t keep_state; 571 sa_family_t af; 572 u_int8_t proto; 573 u_int8_t type; 574 u_int8_t code; 575 u_int8_t flags; 576 u_int8_t flagset; 577 u_int8_t min_ttl; 578 u_int8_t allow_opts; 579 u_int8_t rt; 580 u_int8_t return_ttl; 581 u_int8_t tos; 582 u_int8_t set_tos; 583 u_int8_t anchor_relative; 584 u_int8_t anchor_wildcard; 585 586 #define PF_FLUSH 0x01 587 #define PF_FLUSH_GLOBAL 0x02 588 u_int8_t flush; 589 u_int8_t prio; 590 u_int8_t set_prio[2]; 591 sa_family_t naf; 592 u_int8_t rcvifnot; 593 u_int8_t pad[2]; 594 595 struct { 596 struct pf_addr addr; 597 u_int16_t port; 598 u_int8_t type; 599 } divert; 600 601 SLIST_ENTRY(pf_rule) gcle; 602 struct pf_ruleset *ruleset; 603 time_t exptime; 604 }; 605 606 /* rule flags */ 607 #define PFRULE_DROP 0x0000 608 #define PFRULE_RETURNRST 0x0001 609 #define PFRULE_FRAGMENT 0x0002 610 #define PFRULE_RETURNICMP 0x0004 611 #define PFRULE_RETURN 0x0008 612 #define PFRULE_NOSYNC 0x0010 613 #define PFRULE_SRCTRACK 0x0020 /* track source states */ 614 #define PFRULE_RULESRCTRACK 0x0040 /* per rule */ 615 #define PFRULE_SETDELAY 0x0080 616 617 /* rule flags again */ 618 #define PFRULE_IFBOUND 0x00010000 /* if-bound */ 619 #define PFRULE_STATESLOPPY 0x00020000 /* sloppy state tracking */ 620 #define PFRULE_PFLOW 0x00040000 621 #define PFRULE_ONCE 0x00100000 /* one shot rule */ 622 #define PFRULE_AFTO 0x00200000 /* af-to rule */ 623 #define PFRULE_EXPIRED 0x00400000 /* one shot rule hit by pkt */ 624 625 #define PFSTATE_HIWAT 100000 /* default state table size */ 626 #define PFSTATE_ADAPT_START 60000 /* default adaptive timeout start */ 627 #define PFSTATE_ADAPT_END 120000 /* default adaptive timeout end */ 628 #define PF_PKTDELAY_MAXPKTS 10000 /* max # of pkts held in delay queue */ 629 630 struct pf_rule_item { 631 SLIST_ENTRY(pf_rule_item) entry; 632 struct pf_rule *r; 633 }; 634 635 SLIST_HEAD(pf_rule_slist, pf_rule_item); 636 637 enum pf_sn_types { PF_SN_NONE, PF_SN_NAT, PF_SN_RDR, PF_SN_ROUTE, PF_SN_MAX }; 638 639 struct pf_src_node { 640 RB_ENTRY(pf_src_node) entry; 641 struct pf_addr addr; 642 struct pf_addr raddr; 643 union pf_rule_ptr rule; 644 struct pfi_kif *kif; 645 u_int64_t bytes[2]; 646 u_int64_t packets[2]; 647 u_int32_t states; 648 u_int32_t conn; 649 struct pf_threshold conn_rate; 650 int32_t creation; 651 int32_t expire; 652 sa_family_t af; 653 sa_family_t naf; 654 u_int8_t type; 655 }; 656 657 struct pf_sn_item { 658 SLIST_ENTRY(pf_sn_item) next; 659 struct pf_src_node *sn; 660 }; 661 662 SLIST_HEAD(pf_sn_head, pf_sn_item); 663 664 #define PFSNODE_HIWAT 10000 /* default source node table size */ 665 666 struct pf_state_scrub { 667 struct timeval pfss_last; /* time received last packet */ 668 u_int32_t pfss_tsecr; /* last echoed timestamp */ 669 u_int32_t pfss_tsval; /* largest timestamp */ 670 u_int32_t pfss_tsval0; /* original timestamp */ 671 u_int16_t pfss_flags; 672 #define PFSS_TIMESTAMP 0x0001 /* modulate timestamp */ 673 #define PFSS_PAWS 0x0010 /* stricter PAWS checks */ 674 #define PFSS_PAWS_IDLED 0x0020 /* was idle too long. no PAWS */ 675 #define PFSS_DATA_TS 0x0040 /* timestamp on data packets */ 676 #define PFSS_DATA_NOTS 0x0080 /* no timestamp on data packets */ 677 u_int8_t pfss_ttl; /* stashed TTL */ 678 u_int8_t pad; 679 u_int32_t pfss_ts_mod; /* timestamp modulation */ 680 }; 681 682 struct pf_state_host { 683 struct pf_addr addr; 684 u_int16_t port; 685 u_int16_t pad; 686 }; 687 688 struct pf_state_peer { 689 struct pf_state_scrub *scrub; /* state is scrubbed */ 690 u_int32_t seqlo; /* Max sequence number sent */ 691 u_int32_t seqhi; /* Max the other end ACKd + win */ 692 u_int32_t seqdiff; /* Sequence number modulator */ 693 u_int16_t max_win; /* largest window (pre scaling) */ 694 u_int16_t mss; /* Maximum segment size option */ 695 u_int8_t state; /* active state level */ 696 u_int8_t wscale; /* window scaling factor */ 697 u_int8_t tcp_est; /* Did we reach TCPS_ESTABLISHED */ 698 u_int8_t pad[1]; 699 }; 700 701 TAILQ_HEAD(pf_state_queue, pf_state); 702 703 /* keep synced with struct pf_state_key, used in RB_FIND */ 704 struct pf_state_key_cmp { 705 struct pf_addr addr[2]; 706 u_int16_t port[2]; 707 u_int16_t rdomain; 708 sa_family_t af; 709 u_int8_t proto; 710 }; 711 712 struct pf_state_item { 713 TAILQ_ENTRY(pf_state_item) entry; 714 struct pf_state *s; 715 }; 716 717 TAILQ_HEAD(pf_statelisthead, pf_state_item); 718 719 struct pf_state_key { 720 struct pf_addr addr[2]; 721 u_int16_t port[2]; 722 u_int16_t rdomain; 723 sa_family_t af; 724 u_int8_t proto; 725 726 RB_ENTRY(pf_state_key) entry; 727 struct pf_statelisthead states; 728 struct pf_state_key *reverse; 729 struct inpcb *inp; 730 pf_refcnt_t refcnt; 731 u_int8_t removed; 732 }; 733 #define PF_REVERSED_KEY(key, family) \ 734 ((key[PF_SK_WIRE]->af != key[PF_SK_STACK]->af) && \ 735 (key[PF_SK_WIRE]->af != (family))) 736 737 /* keep synced with struct pf_state, used in RB_FIND */ 738 struct pf_state_cmp { 739 u_int64_t id; 740 u_int32_t creatorid; 741 u_int8_t direction; 742 u_int8_t pad[3]; 743 }; 744 745 struct pf_state { 746 u_int64_t id; 747 u_int32_t creatorid; 748 u_int8_t direction; 749 u_int8_t pad[3]; 750 751 TAILQ_ENTRY(pf_state) sync_list; 752 TAILQ_ENTRY(pf_state) entry_list; 753 SLIST_ENTRY(pf_state) gc_list; 754 RB_ENTRY(pf_state) entry_id; 755 struct pf_state_peer src; 756 struct pf_state_peer dst; 757 struct pf_rule_slist match_rules; 758 union pf_rule_ptr rule; 759 union pf_rule_ptr anchor; 760 union pf_rule_ptr natrule; 761 struct pf_addr rt_addr; 762 struct pf_sn_head src_nodes; 763 struct pf_state_key *key[2]; /* addresses stack and wire */ 764 struct pfi_kif *kif; 765 struct pfi_kif *rt_kif; 766 u_int64_t packets[2]; 767 u_int64_t bytes[2]; 768 int32_t creation; 769 int32_t expire; 770 int32_t pfsync_time; 771 int rtableid[2]; /* rtables stack and wire */ 772 u_int16_t qid; 773 u_int16_t pqid; 774 u_int16_t tag; 775 u_int16_t state_flags; 776 #define PFSTATE_ALLOWOPTS 0x0001 777 #define PFSTATE_SLOPPY 0x0002 778 #define PFSTATE_PFLOW 0x0004 779 #define PFSTATE_NOSYNC 0x0008 780 #define PFSTATE_ACK 0x0010 781 #define PFSTATE_NODF 0x0020 782 #define PFSTATE_SETTOS 0x0040 783 #define PFSTATE_RANDOMID 0x0080 784 #define PFSTATE_SCRUB_TCP 0x0100 785 #define PFSTATE_SETPRIO 0x0200 786 #define PFSTATE_SCRUBMASK (PFSTATE_NODF|PFSTATE_RANDOMID|PFSTATE_SCRUB_TCP) 787 #define PFSTATE_SETMASK (PFSTATE_SETTOS|PFSTATE_SETPRIO) 788 u_int8_t log; 789 u_int8_t timeout; 790 u_int8_t sync_state; /* PFSYNC_S_x */ 791 u_int8_t sync_updates; 792 u_int8_t min_ttl; 793 u_int8_t set_tos; 794 u_int8_t set_prio[2]; 795 u_int16_t max_mss; 796 u_int16_t if_index_in; 797 u_int16_t if_index_out; 798 pf_refcnt_t refcnt; 799 u_int16_t delay; 800 }; 801 802 /* 803 * Unified state structures for pulling states out of the kernel 804 * used by pfsync(4) and the pf(4) ioctl. 805 */ 806 struct pfsync_state_scrub { 807 u_int16_t pfss_flags; 808 u_int8_t pfss_ttl; /* stashed TTL */ 809 #define PFSYNC_SCRUB_FLAG_VALID 0x01 810 u_int8_t scrub_flag; 811 u_int32_t pfss_ts_mod; /* timestamp modulation */ 812 } __packed; 813 814 struct pfsync_state_peer { 815 struct pfsync_state_scrub scrub; /* state is scrubbed */ 816 u_int32_t seqlo; /* Max sequence number sent */ 817 u_int32_t seqhi; /* Max the other end ACKd + win */ 818 u_int32_t seqdiff; /* Sequence number modulator */ 819 u_int16_t max_win; /* largest window (pre scaling) */ 820 u_int16_t mss; /* Maximum segment size option */ 821 u_int8_t state; /* active state level */ 822 u_int8_t wscale; /* window scaling factor */ 823 u_int8_t pad[6]; 824 } __packed; 825 826 struct pfsync_state_key { 827 struct pf_addr addr[2]; 828 u_int16_t port[2]; 829 u_int16_t rdomain; 830 sa_family_t af; 831 u_int8_t pad; 832 }; 833 834 struct pfsync_state { 835 u_int64_t id; 836 char ifname[IFNAMSIZ]; 837 struct pfsync_state_key key[2]; 838 struct pfsync_state_peer src; 839 struct pfsync_state_peer dst; 840 struct pf_addr rt_addr; 841 u_int32_t rule; 842 u_int32_t anchor; 843 u_int32_t nat_rule; 844 u_int32_t creation; 845 u_int32_t expire; 846 u_int32_t packets[2][2]; 847 u_int32_t bytes[2][2]; 848 u_int32_t creatorid; 849 int32_t rtableid[2]; 850 u_int16_t max_mss; 851 sa_family_t af; 852 u_int8_t proto; 853 u_int8_t direction; 854 u_int8_t log; 855 u_int8_t pad0; 856 u_int8_t timeout; 857 u_int8_t sync_flags; 858 u_int8_t updates; 859 u_int8_t min_ttl; 860 u_int8_t set_tos; 861 u_int16_t state_flags; 862 u_int8_t set_prio[2]; 863 } __packed; 864 865 #define PFSYNC_FLAG_SRCNODE 0x04 866 #define PFSYNC_FLAG_NATSRCNODE 0x08 867 868 /* for copies to/from network byte order */ 869 /* ioctl interface also uses network byte order */ 870 #define pf_state_peer_hton(s,d) do { \ 871 (d)->seqlo = htonl((s)->seqlo); \ 872 (d)->seqhi = htonl((s)->seqhi); \ 873 (d)->seqdiff = htonl((s)->seqdiff); \ 874 (d)->max_win = htons((s)->max_win); \ 875 (d)->mss = htons((s)->mss); \ 876 (d)->state = (s)->state; \ 877 (d)->wscale = (s)->wscale; \ 878 if ((s)->scrub) { \ 879 (d)->scrub.pfss_flags = \ 880 htons((s)->scrub->pfss_flags & PFSS_TIMESTAMP); \ 881 (d)->scrub.pfss_ttl = (s)->scrub->pfss_ttl; \ 882 (d)->scrub.pfss_ts_mod = htonl((s)->scrub->pfss_ts_mod);\ 883 (d)->scrub.scrub_flag = PFSYNC_SCRUB_FLAG_VALID; \ 884 } \ 885 } while (0) 886 887 #define pf_state_peer_ntoh(s,d) do { \ 888 (d)->seqlo = ntohl((s)->seqlo); \ 889 (d)->seqhi = ntohl((s)->seqhi); \ 890 (d)->seqdiff = ntohl((s)->seqdiff); \ 891 (d)->max_win = ntohs((s)->max_win); \ 892 (d)->mss = ntohs((s)->mss); \ 893 (d)->state = (s)->state; \ 894 (d)->wscale = (s)->wscale; \ 895 if ((s)->scrub.scrub_flag == PFSYNC_SCRUB_FLAG_VALID && \ 896 (d)->scrub != NULL) { \ 897 (d)->scrub->pfss_flags = \ 898 ntohs((s)->scrub.pfss_flags) & PFSS_TIMESTAMP; \ 899 (d)->scrub->pfss_ttl = (s)->scrub.pfss_ttl; \ 900 (d)->scrub->pfss_ts_mod = ntohl((s)->scrub.pfss_ts_mod);\ 901 } \ 902 } while (0) 903 904 #define pf_state_counter_hton(s,d) do { \ 905 d[0] = htonl((s>>32)&0xffffffff); \ 906 d[1] = htonl(s&0xffffffff); \ 907 } while (0) 908 909 #define pf_state_counter_from_pfsync(s) \ 910 (((u_int64_t)(s[0])<<32) | (u_int64_t)(s[1])) 911 912 #define pf_state_counter_ntoh(s,d) do { \ 913 d = ntohl(s[0]); \ 914 d = d<<32; \ 915 d += ntohl(s[1]); \ 916 } while (0) 917 918 TAILQ_HEAD(pf_rulequeue, pf_rule); 919 920 struct pf_anchor; 921 922 struct pf_ruleset { 923 struct { 924 struct pf_rulequeue queues[2]; 925 struct { 926 struct pf_rulequeue *ptr; 927 struct pf_rule **ptr_array; 928 u_int32_t rcount; 929 u_int32_t ticket; 930 int open; 931 } active, inactive; 932 } rules; 933 struct pf_anchor *anchor; 934 u_int32_t tticket; 935 int tables; 936 int topen; 937 }; 938 939 RB_HEAD(pf_anchor_global, pf_anchor); 940 RB_HEAD(pf_anchor_node, pf_anchor); 941 struct pf_anchor { 942 RB_ENTRY(pf_anchor) entry_global; 943 RB_ENTRY(pf_anchor) entry_node; 944 struct pf_anchor *parent; 945 struct pf_anchor_node children; 946 char name[PF_ANCHOR_NAME_SIZE]; 947 char path[PATH_MAX]; 948 struct pf_ruleset ruleset; 949 int refcnt; /* anchor rules */ 950 int match; 951 }; 952 RB_PROTOTYPE(pf_anchor_global, pf_anchor, entry_global, pf_anchor_compare) 953 RB_PROTOTYPE(pf_anchor_node, pf_anchor, entry_node, pf_anchor_compare) 954 955 #define PF_RESERVED_ANCHOR "_pf" 956 957 #define PFR_TFLAG_PERSIST 0x00000001 958 #define PFR_TFLAG_CONST 0x00000002 959 #define PFR_TFLAG_ACTIVE 0x00000004 960 #define PFR_TFLAG_INACTIVE 0x00000008 961 #define PFR_TFLAG_REFERENCED 0x00000010 962 #define PFR_TFLAG_REFDANCHOR 0x00000020 963 #define PFR_TFLAG_COUNTERS 0x00000040 964 /* Adjust masks below when adding flags. */ 965 #define PFR_TFLAG_USRMASK 0x00000043 966 #define PFR_TFLAG_SETMASK 0x0000003C 967 #define PFR_TFLAG_ALLMASK 0x0000007F 968 969 struct pfr_table { 970 char pfrt_anchor[PATH_MAX]; 971 char pfrt_name[PF_TABLE_NAME_SIZE]; 972 u_int32_t pfrt_flags; 973 u_int8_t pfrt_fback; 974 }; 975 976 enum { PFR_FB_NONE, PFR_FB_MATCH, PFR_FB_ADDED, PFR_FB_DELETED, 977 PFR_FB_CHANGED, PFR_FB_CLEARED, PFR_FB_DUPLICATE, 978 PFR_FB_NOTMATCH, PFR_FB_CONFLICT, PFR_FB_NOCOUNT, PFR_FB_MAX }; 979 980 struct pfr_addr { 981 union { 982 struct in_addr _pfra_ip4addr; 983 struct in6_addr _pfra_ip6addr; 984 } pfra_u; 985 char pfra_ifname[IFNAMSIZ]; 986 u_int32_t pfra_states; 987 u_int16_t pfra_weight; 988 u_int8_t pfra_af; 989 u_int8_t pfra_net; 990 u_int8_t pfra_not; 991 u_int8_t pfra_fback; 992 u_int8_t pfra_type; 993 u_int8_t pad[7]; 994 }; 995 #define pfra_ip4addr pfra_u._pfra_ip4addr 996 #define pfra_ip6addr pfra_u._pfra_ip6addr 997 998 enum { PFR_DIR_IN, PFR_DIR_OUT, PFR_DIR_MAX }; 999 enum { PFR_OP_BLOCK, PFR_OP_MATCH, PFR_OP_PASS, PFR_OP_ADDR_MAX, 1000 PFR_OP_TABLE_MAX }; 1001 #define PFR_OP_XPASS PFR_OP_ADDR_MAX 1002 1003 struct pfr_astats { 1004 struct pfr_addr pfras_a; 1005 u_int64_t pfras_packets[PFR_DIR_MAX][PFR_OP_ADDR_MAX]; 1006 u_int64_t pfras_bytes[PFR_DIR_MAX][PFR_OP_ADDR_MAX]; 1007 time_t pfras_tzero; 1008 }; 1009 1010 enum { PFR_REFCNT_RULE, PFR_REFCNT_ANCHOR, PFR_REFCNT_MAX }; 1011 1012 struct pfr_tstats { 1013 struct pfr_table pfrts_t; 1014 u_int64_t pfrts_packets[PFR_DIR_MAX][PFR_OP_TABLE_MAX]; 1015 u_int64_t pfrts_bytes[PFR_DIR_MAX][PFR_OP_TABLE_MAX]; 1016 u_int64_t pfrts_match; 1017 u_int64_t pfrts_nomatch; 1018 time_t pfrts_tzero; 1019 int pfrts_cnt; 1020 int pfrts_refcnt[PFR_REFCNT_MAX]; 1021 }; 1022 #define pfrts_name pfrts_t.pfrt_name 1023 #define pfrts_flags pfrts_t.pfrt_flags 1024 1025 struct pfr_kcounters { 1026 u_int64_t pfrkc_packets[PFR_DIR_MAX][PFR_OP_ADDR_MAX]; 1027 u_int64_t pfrkc_bytes[PFR_DIR_MAX][PFR_OP_ADDR_MAX]; 1028 u_int64_t states; 1029 }; 1030 1031 /* 1032 * XXX ip_ipsp.h's sockaddr_union should be converted to sockaddr * 1033 * passing with correct sa_len, then a good approach for cleaning this 1034 * will become more clear. 1035 */ 1036 union pfsockaddr_union { 1037 struct sockaddr sa; 1038 struct sockaddr_in sin; 1039 struct sockaddr_in6 sin6; 1040 }; 1041 1042 SLIST_HEAD(pfr_kentryworkq, pfr_kentry); 1043 struct _pfr_kentry { 1044 struct radix_node _pfrke_node[2]; 1045 union pfsockaddr_union _pfrke_sa; 1046 SLIST_ENTRY(pfr_kentry) _pfrke_workq; 1047 struct pfr_kcounters *_pfrke_counters; 1048 time_t _pfrke_tzero; 1049 u_int8_t _pfrke_af; 1050 u_int8_t _pfrke_net; 1051 u_int8_t _pfrke_flags; 1052 u_int8_t _pfrke_type; 1053 }; 1054 #define PFRKE_FLAG_NOT 0x01 1055 #define PFRKE_FLAG_MARK 0x02 1056 1057 /* pfrke_type */ 1058 enum { PFRKE_PLAIN, PFRKE_ROUTE, PFRKE_COST, PFRKE_MAX }; 1059 1060 struct pfr_kentry { 1061 union { 1062 struct _pfr_kentry _ke; 1063 } u; 1064 }; 1065 #define pfrke_node u._ke._pfrke_node 1066 #define pfrke_sa u._ke._pfrke_sa 1067 #define pfrke_workq u._ke._pfrke_workq 1068 #define pfrke_counters u._ke._pfrke_counters 1069 #define pfrke_tzero u._ke._pfrke_tzero 1070 #define pfrke_af u._ke._pfrke_af 1071 #define pfrke_net u._ke._pfrke_net 1072 #define pfrke_flags u._ke._pfrke_flags 1073 #define pfrke_type u._ke._pfrke_type 1074 1075 struct pfr_kentry_route { 1076 union { 1077 struct _pfr_kentry _ke; 1078 } u; 1079 1080 struct pfi_kif *kif; 1081 }; 1082 1083 struct pfr_kentry_cost { 1084 union { 1085 struct _pfr_kentry _ke; 1086 } u; 1087 1088 struct pfi_kif *kif; 1089 /* Above overlaps with pfr_kentry route */ 1090 1091 u_int16_t weight; 1092 }; 1093 1094 struct pfr_kentry_all { 1095 union { 1096 struct _pfr_kentry _ke; 1097 struct pfr_kentry_route kr; 1098 struct pfr_kentry_cost kc; 1099 } u; 1100 }; 1101 #define pfrke_rkif u.kr.kif 1102 1103 SLIST_HEAD(pfr_ktableworkq, pfr_ktable); 1104 RB_HEAD(pfr_ktablehead, pfr_ktable); 1105 struct pfr_ktable { 1106 struct pfr_tstats pfrkt_ts; 1107 RB_ENTRY(pfr_ktable) pfrkt_tree; 1108 SLIST_ENTRY(pfr_ktable) pfrkt_workq; 1109 struct radix_node_head *pfrkt_ip4; 1110 struct radix_node_head *pfrkt_ip6; 1111 struct pfr_ktable *pfrkt_shadow; 1112 struct pfr_ktable *pfrkt_root; 1113 struct pf_ruleset *pfrkt_rs; 1114 long pfrkt_larg; 1115 int pfrkt_nflags; 1116 u_int64_t pfrkt_refcntcost; 1117 u_int16_t pfrkt_gcdweight; 1118 u_int16_t pfrkt_maxweight; 1119 }; 1120 #define pfrkt_t pfrkt_ts.pfrts_t 1121 #define pfrkt_name pfrkt_t.pfrt_name 1122 #define pfrkt_anchor pfrkt_t.pfrt_anchor 1123 #define pfrkt_ruleset pfrkt_t.pfrt_ruleset 1124 #define pfrkt_flags pfrkt_t.pfrt_flags 1125 #define pfrkt_cnt pfrkt_ts.pfrts_cnt 1126 #define pfrkt_refcnt pfrkt_ts.pfrts_refcnt 1127 #define pfrkt_packets pfrkt_ts.pfrts_packets 1128 #define pfrkt_bytes pfrkt_ts.pfrts_bytes 1129 #define pfrkt_match pfrkt_ts.pfrts_match 1130 #define pfrkt_nomatch pfrkt_ts.pfrts_nomatch 1131 #define pfrkt_tzero pfrkt_ts.pfrts_tzero 1132 1133 RB_HEAD(pf_state_tree, pf_state_key); 1134 RB_PROTOTYPE(pf_state_tree, pf_state_key, entry, pf_state_compare_key) 1135 1136 RB_HEAD(pf_state_tree_ext_gwy, pf_state_key); 1137 RB_PROTOTYPE(pf_state_tree_ext_gwy, pf_state_key, 1138 entry_ext_gwy, pf_state_compare_ext_gwy) 1139 1140 RB_HEAD(pfi_ifhead, pfi_kif); 1141 1142 /* state tables */ 1143 extern struct pf_state_tree pf_statetbl; 1144 1145 /* keep synced with pfi_kif, used in RB_FIND */ 1146 struct pfi_kif_cmp { 1147 char pfik_name[IFNAMSIZ]; 1148 }; 1149 1150 struct ifnet; 1151 struct ifg_group; 1152 1153 struct pfi_kif { 1154 char pfik_name[IFNAMSIZ]; 1155 RB_ENTRY(pfi_kif) pfik_tree; 1156 u_int64_t pfik_packets[2][2][2]; 1157 u_int64_t pfik_bytes[2][2][2]; 1158 time_t pfik_tzero; 1159 int pfik_flags; 1160 int pfik_flags_new; 1161 void *pfik_ah_cookie; 1162 struct ifnet *pfik_ifp; 1163 struct ifg_group *pfik_group; 1164 int pfik_states; 1165 int pfik_rules; 1166 int pfik_routes; 1167 int pfik_srcnodes; 1168 TAILQ_HEAD(, pfi_dynaddr) pfik_dynaddrs; 1169 }; 1170 1171 enum pfi_kif_refs { 1172 PFI_KIF_REF_NONE, 1173 PFI_KIF_REF_STATE, 1174 PFI_KIF_REF_RULE, 1175 PFI_KIF_REF_ROUTE, 1176 PFI_KIF_REF_SRCNODE 1177 }; 1178 1179 #define PFI_IFLAG_SKIP 0x0100 /* skip filtering on interface */ 1180 #define PFI_IFLAG_ANY 0x0200 /* match any non-loopback interface */ 1181 1182 /* flags for RDR options */ 1183 #define PF_DPORT_RANGE 0x01 /* Dest port uses range */ 1184 #define PF_RPORT_RANGE 0x02 /* RDR'ed port uses range */ 1185 1186 /* Reasons code for passing/dropping a packet */ 1187 #define PFRES_MATCH 0 /* Explicit match of a rule */ 1188 #define PFRES_BADOFF 1 /* Bad offset for pull_hdr */ 1189 #define PFRES_FRAG 2 /* Dropping following fragment */ 1190 #define PFRES_SHORT 3 /* Dropping short packet */ 1191 #define PFRES_NORM 4 /* Dropping by normalizer */ 1192 #define PFRES_MEMORY 5 /* Dropped due to lacking mem */ 1193 #define PFRES_TS 6 /* Bad TCP Timestamp (RFC1323) */ 1194 #define PFRES_CONGEST 7 /* Congestion */ 1195 #define PFRES_IPOPTIONS 8 /* IP option */ 1196 #define PFRES_PROTCKSUM 9 /* Protocol checksum invalid */ 1197 #define PFRES_BADSTATE 10 /* State mismatch */ 1198 #define PFRES_STATEINS 11 /* State insertion failure */ 1199 #define PFRES_MAXSTATES 12 /* State limit */ 1200 #define PFRES_SRCLIMIT 13 /* Source node/conn limit */ 1201 #define PFRES_SYNPROXY 14 /* SYN proxy */ 1202 #define PFRES_TRANSLATE 15 /* No translation address available */ 1203 #define PFRES_NOROUTE 16 /* No route found for PBR action */ 1204 #define PFRES_MAX 17 /* total+1 */ 1205 1206 #define PFRES_NAMES { \ 1207 "match", \ 1208 "bad-offset", \ 1209 "fragment", \ 1210 "short", \ 1211 "normalize", \ 1212 "memory", \ 1213 "bad-timestamp", \ 1214 "congestion", \ 1215 "ip-option", \ 1216 "proto-cksum", \ 1217 "state-mismatch", \ 1218 "state-insert", \ 1219 "state-limit", \ 1220 "src-limit", \ 1221 "synproxy", \ 1222 "translate", \ 1223 "no-route", \ 1224 NULL \ 1225 } 1226 1227 /* Counters for other things we want to keep track of */ 1228 #define LCNT_STATES 0 /* states */ 1229 #define LCNT_SRCSTATES 1 /* max-src-states */ 1230 #define LCNT_SRCNODES 2 /* max-src-nodes */ 1231 #define LCNT_SRCCONN 3 /* max-src-conn */ 1232 #define LCNT_SRCCONNRATE 4 /* max-src-conn-rate */ 1233 #define LCNT_OVERLOAD_TABLE 5 /* entry added to overload table */ 1234 #define LCNT_OVERLOAD_FLUSH 6 /* state entries flushed */ 1235 #define LCNT_SYNFLOODS 7 /* synfloods detected */ 1236 #define LCNT_SYNCOOKIES_SENT 8 /* syncookies sent */ 1237 #define LCNT_SYNCOOKIES_VALID 9 /* syncookies validated */ 1238 #define LCNT_MAX 10 /* total+1 */ 1239 1240 #define LCNT_NAMES { \ 1241 "max states per rule", \ 1242 "max-src-states", \ 1243 "max-src-nodes", \ 1244 "max-src-conn", \ 1245 "max-src-conn-rate", \ 1246 "overload table insertion", \ 1247 "overload flush states", \ 1248 "synfloods detected", \ 1249 "syncookies sent", \ 1250 "syncookies validated", \ 1251 NULL \ 1252 } 1253 1254 /* UDP state enumeration */ 1255 #define PFUDPS_NO_TRAFFIC 0 1256 #define PFUDPS_SINGLE 1 1257 #define PFUDPS_MULTIPLE 2 1258 1259 #define PFUDPS_NSTATES 3 /* number of state levels */ 1260 1261 #define PFUDPS_NAMES { \ 1262 "NO_TRAFFIC", \ 1263 "SINGLE", \ 1264 "MULTIPLE", \ 1265 NULL \ 1266 } 1267 1268 /* Other protocol state enumeration */ 1269 #define PFOTHERS_NO_TRAFFIC 0 1270 #define PFOTHERS_SINGLE 1 1271 #define PFOTHERS_MULTIPLE 2 1272 1273 #define PFOTHERS_NSTATES 3 /* number of state levels */ 1274 1275 #define PFOTHERS_NAMES { \ 1276 "NO_TRAFFIC", \ 1277 "SINGLE", \ 1278 "MULTIPLE", \ 1279 NULL \ 1280 } 1281 1282 #define FCNT_STATE_SEARCH 0 1283 #define FCNT_STATE_INSERT 1 1284 #define FCNT_STATE_REMOVALS 2 1285 #define FCNT_MAX 3 1286 1287 #define SCNT_SRC_NODE_SEARCH 0 1288 #define SCNT_SRC_NODE_INSERT 1 1289 #define SCNT_SRC_NODE_REMOVALS 2 1290 #define SCNT_MAX 3 1291 1292 #define ACTION_SET(a, x) \ 1293 do { \ 1294 if ((a) != NULL) \ 1295 *(a) = (x); \ 1296 } while (0) 1297 1298 #define REASON_SET(a, x) \ 1299 do { \ 1300 if ((void *)(a) != NULL) { \ 1301 *(a) = (x); \ 1302 if (x < PFRES_MAX) \ 1303 pf_status.counters[x]++; \ 1304 } \ 1305 } while (0) 1306 1307 struct pf_status { 1308 u_int64_t counters[PFRES_MAX]; 1309 u_int64_t lcounters[LCNT_MAX]; /* limit counters */ 1310 u_int64_t fcounters[FCNT_MAX]; 1311 u_int64_t scounters[SCNT_MAX]; 1312 u_int64_t pcounters[2][2][3]; 1313 u_int64_t bcounters[2][2]; 1314 u_int64_t stateid; 1315 u_int64_t syncookies_inflight[2]; /* unACKed SYNcookies */ 1316 time_t since; 1317 u_int32_t running; 1318 u_int32_t states; 1319 u_int32_t states_halfopen; 1320 u_int32_t src_nodes; 1321 u_int32_t debug; 1322 u_int32_t hostid; 1323 u_int32_t reass; /* reassembly */ 1324 u_int8_t syncookies_active; 1325 u_int8_t syncookies_mode; /* never/always/adaptive */ 1326 u_int8_t pad[2]; 1327 char ifname[IFNAMSIZ]; 1328 u_int8_t pf_chksum[PF_MD5_DIGEST_LENGTH]; 1329 }; 1330 1331 #define PF_REASS_ENABLED 0x01 1332 #define PF_REASS_NODF 0x02 1333 1334 #define PF_SYNCOOKIES_NEVER 0 1335 #define PF_SYNCOOKIES_ALWAYS 1 1336 #define PF_SYNCOOKIES_ADAPTIVE 2 1337 #define PF_SYNCOOKIES_MODE_MAX PF_SYNCOOKIES_ADAPTIVE 1338 1339 #define PF_SYNCOOKIES_HIWATPCT 25 1340 #define PF_SYNCOOKIES_LOWATPCT PF_SYNCOOKIES_HIWATPCT/2 1341 1342 #define PF_PRIO_ZERO 0xff /* match "prio 0" packets */ 1343 1344 struct pf_queue_bwspec { 1345 u_int absolute; 1346 u_int percent; 1347 }; 1348 1349 struct pf_queue_scspec { 1350 struct pf_queue_bwspec m1; 1351 struct pf_queue_bwspec m2; 1352 u_int d; 1353 }; 1354 1355 struct pf_queue_fqspec { 1356 u_int flows; 1357 u_int quantum; 1358 u_int target; 1359 u_int interval; 1360 }; 1361 1362 struct pf_queuespec { 1363 TAILQ_ENTRY(pf_queuespec) entries; 1364 char qname[PF_QNAME_SIZE]; 1365 char parent[PF_QNAME_SIZE]; 1366 char ifname[IFNAMSIZ]; 1367 struct pf_queue_scspec realtime; 1368 struct pf_queue_scspec linkshare; 1369 struct pf_queue_scspec upperlimit; 1370 struct pf_queue_fqspec flowqueue; 1371 struct pfi_kif *kif; 1372 u_int flags; 1373 u_int qlimit; 1374 u_int32_t qid; 1375 u_int32_t parent_qid; 1376 }; 1377 1378 #define PFQS_FLOWQUEUE 0x0001 1379 #define PFQS_ROOTCLASS 0x0002 1380 #define PFQS_DEFAULT 0x1000 /* maps to HFSC_DEFAULTCLASS */ 1381 1382 struct priq_opts { 1383 int flags; 1384 }; 1385 1386 struct hfsc_opts { 1387 /* real-time service curve */ 1388 u_int rtsc_m1; /* slope of the 1st segment in bps */ 1389 u_int rtsc_d; /* the x-projection of m1 in msec */ 1390 u_int rtsc_m2; /* slope of the 2nd segment in bps */ 1391 /* link-sharing service curve */ 1392 u_int lssc_m1; 1393 u_int lssc_d; 1394 u_int lssc_m2; 1395 /* upper-limit service curve */ 1396 u_int ulsc_m1; 1397 u_int ulsc_d; 1398 u_int ulsc_m2; 1399 int flags; 1400 }; 1401 1402 struct pfq_ops { 1403 void * (*pfq_alloc)(struct ifnet *); 1404 int (*pfq_addqueue)(void *, struct pf_queuespec *); 1405 void (*pfq_free)(void *); 1406 int (*pfq_qstats)(struct pf_queuespec *, void *, int *); 1407 /* Queue manager ops */ 1408 unsigned int (*pfq_qlength)(void *); 1409 struct mbuf * (*pfq_enqueue)(void *, struct mbuf *); 1410 struct mbuf * (*pfq_deq_begin)(void *, void **, struct mbuf_list *); 1411 void (*pfq_deq_commit)(void *, struct mbuf *, void *); 1412 void (*pfq_purge)(void *, struct mbuf_list *); 1413 }; 1414 1415 struct pf_tagname { 1416 TAILQ_ENTRY(pf_tagname) entries; 1417 char name[PF_TAG_NAME_SIZE]; 1418 u_int16_t tag; 1419 int ref; 1420 }; 1421 1422 struct pf_divert { 1423 struct pf_addr addr; 1424 u_int16_t port; 1425 u_int16_t rdomain; 1426 u_int8_t type; 1427 }; 1428 1429 enum pf_divert_types { 1430 PF_DIVERT_NONE, 1431 PF_DIVERT_TO, 1432 PF_DIVERT_REPLY, 1433 PF_DIVERT_PACKET 1434 }; 1435 1436 struct pf_pktdelay { 1437 struct timeout to; 1438 struct mbuf *m; 1439 u_int ifidx; 1440 }; 1441 1442 /* Fragment entries reference mbuf clusters, so base the default on that. */ 1443 #define PFFRAG_FRENT_HIWAT (NMBCLUSTERS / 16) /* Number of entries */ 1444 #define PFFRAG_FRAG_HIWAT (NMBCLUSTERS / 32) /* Number of packets */ 1445 1446 #define PFR_KTABLE_HIWAT 1000 /* Number of tables */ 1447 #define PFR_KENTRY_HIWAT 200000 /* Number of table entries */ 1448 #define PFR_KENTRY_HIWAT_SMALL 100000 /* Number of entries for tiny hosts */ 1449 1450 /* 1451 * ioctl parameter structures 1452 */ 1453 1454 struct pfioc_rule { 1455 u_int32_t action; 1456 u_int32_t ticket; 1457 u_int32_t nr; 1458 char anchor[PATH_MAX]; 1459 char anchor_call[PATH_MAX]; 1460 struct pf_rule rule; 1461 }; 1462 1463 struct pfioc_natlook { 1464 struct pf_addr saddr; 1465 struct pf_addr daddr; 1466 struct pf_addr rsaddr; 1467 struct pf_addr rdaddr; 1468 u_int16_t rdomain; 1469 u_int16_t rrdomain; 1470 u_int16_t sport; 1471 u_int16_t dport; 1472 u_int16_t rsport; 1473 u_int16_t rdport; 1474 sa_family_t af; 1475 u_int8_t proto; 1476 u_int8_t direction; 1477 }; 1478 1479 struct pfioc_state { 1480 struct pfsync_state state; 1481 }; 1482 1483 struct pfioc_src_node_kill { 1484 sa_family_t psnk_af; 1485 struct pf_rule_addr psnk_src; 1486 struct pf_rule_addr psnk_dst; 1487 u_int psnk_killed; 1488 }; 1489 1490 struct pfioc_state_kill { 1491 struct pf_state_cmp psk_pfcmp; 1492 sa_family_t psk_af; 1493 int psk_proto; 1494 struct pf_rule_addr psk_src; 1495 struct pf_rule_addr psk_dst; 1496 char psk_ifname[IFNAMSIZ]; 1497 char psk_label[PF_RULE_LABEL_SIZE]; 1498 u_int psk_killed; 1499 u_int16_t psk_rdomain; 1500 }; 1501 1502 struct pfioc_states { 1503 size_t ps_len; 1504 union { 1505 caddr_t psu_buf; 1506 struct pfsync_state *psu_states; 1507 } ps_u; 1508 #define ps_buf ps_u.psu_buf 1509 #define ps_states ps_u.psu_states 1510 }; 1511 1512 struct pfioc_src_nodes { 1513 size_t psn_len; 1514 union { 1515 caddr_t psu_buf; 1516 struct pf_src_node *psu_src_nodes; 1517 } psn_u; 1518 #define psn_buf psn_u.psu_buf 1519 #define psn_src_nodes psn_u.psu_src_nodes 1520 }; 1521 1522 struct pfioc_tm { 1523 int timeout; 1524 int seconds; 1525 }; 1526 1527 struct pfioc_limit { 1528 int index; 1529 unsigned limit; 1530 }; 1531 1532 struct pfioc_ruleset { 1533 u_int32_t nr; 1534 char path[PATH_MAX]; 1535 char name[PF_ANCHOR_NAME_SIZE]; 1536 }; 1537 1538 struct pfioc_trans { 1539 int size; /* number of elements */ 1540 int esize; /* size of each element in bytes */ 1541 struct pfioc_trans_e { 1542 int type; 1543 char anchor[PATH_MAX]; 1544 u_int32_t ticket; 1545 } *array; 1546 }; 1547 1548 struct pfioc_queue { 1549 u_int32_t ticket; 1550 u_int nr; 1551 struct pf_queuespec queue; 1552 }; 1553 1554 struct pfioc_qstats { 1555 u_int32_t ticket; 1556 u_int32_t nr; 1557 struct pf_queuespec queue; 1558 void *buf; 1559 int nbytes; 1560 }; 1561 1562 #define PFR_FLAG_DUMMY 0x00000002 1563 #define PFR_FLAG_FEEDBACK 0x00000004 1564 #define PFR_FLAG_CLSTATS 0x00000008 1565 #define PFR_FLAG_ADDRSTOO 0x00000010 1566 #define PFR_FLAG_REPLACE 0x00000020 1567 #define PFR_FLAG_ALLRSETS 0x00000040 1568 #define PFR_FLAG_ALLMASK 0x0000007F 1569 #ifdef _KERNEL 1570 #define PFR_FLAG_USERIOCTL 0x10000000 1571 #endif 1572 1573 struct pfioc_table { 1574 struct pfr_table pfrio_table; 1575 void *pfrio_buffer; 1576 int pfrio_esize; 1577 int pfrio_size; 1578 int pfrio_size2; 1579 int pfrio_nadd; 1580 int pfrio_ndel; 1581 int pfrio_nchange; 1582 int pfrio_flags; 1583 u_int32_t pfrio_ticket; 1584 }; 1585 #define pfrio_exists pfrio_nadd 1586 #define pfrio_nzero pfrio_nadd 1587 #define pfrio_nmatch pfrio_nadd 1588 #define pfrio_naddr pfrio_size2 1589 #define pfrio_setflag pfrio_size2 1590 #define pfrio_clrflag pfrio_nadd 1591 1592 struct pfioc_iface { 1593 char pfiio_name[IFNAMSIZ]; 1594 void *pfiio_buffer; 1595 int pfiio_esize; 1596 int pfiio_size; 1597 int pfiio_nzero; 1598 int pfiio_flags; 1599 }; 1600 1601 struct pfioc_synflwats { 1602 u_int32_t hiwat; 1603 u_int32_t lowat; 1604 }; 1605 1606 /* 1607 * ioctl operations 1608 */ 1609 1610 #define DIOCSTART _IO ('D', 1) 1611 #define DIOCSTOP _IO ('D', 2) 1612 #define DIOCADDRULE _IOWR('D', 4, struct pfioc_rule) 1613 #define DIOCGETRULES _IOWR('D', 6, struct pfioc_rule) 1614 #define DIOCGETRULE _IOWR('D', 7, struct pfioc_rule) 1615 /* cut 8 - 17 */ 1616 #define DIOCCLRSTATES _IOWR('D', 18, struct pfioc_state_kill) 1617 #define DIOCGETSTATE _IOWR('D', 19, struct pfioc_state) 1618 #define DIOCSETSTATUSIF _IOWR('D', 20, struct pfioc_iface) 1619 #define DIOCGETSTATUS _IOWR('D', 21, struct pf_status) 1620 #define DIOCCLRSTATUS _IOWR('D', 22, struct pfioc_iface) 1621 #define DIOCNATLOOK _IOWR('D', 23, struct pfioc_natlook) 1622 #define DIOCSETDEBUG _IOWR('D', 24, u_int32_t) 1623 #define DIOCGETSTATES _IOWR('D', 25, struct pfioc_states) 1624 #define DIOCCHANGERULE _IOWR('D', 26, struct pfioc_rule) 1625 /* cut 27 - 28 */ 1626 #define DIOCSETTIMEOUT _IOWR('D', 29, struct pfioc_tm) 1627 #define DIOCGETTIMEOUT _IOWR('D', 30, struct pfioc_tm) 1628 #define DIOCADDSTATE _IOWR('D', 37, struct pfioc_state) 1629 /* cut 38 */ 1630 #define DIOCGETLIMIT _IOWR('D', 39, struct pfioc_limit) 1631 #define DIOCSETLIMIT _IOWR('D', 40, struct pfioc_limit) 1632 #define DIOCKILLSTATES _IOWR('D', 41, struct pfioc_state_kill) 1633 /* cut 42 - 57 */ 1634 #define DIOCGETRULESETS _IOWR('D', 58, struct pfioc_ruleset) 1635 #define DIOCGETRULESET _IOWR('D', 59, struct pfioc_ruleset) 1636 #define DIOCRCLRTABLES _IOWR('D', 60, struct pfioc_table) 1637 #define DIOCRADDTABLES _IOWR('D', 61, struct pfioc_table) 1638 #define DIOCRDELTABLES _IOWR('D', 62, struct pfioc_table) 1639 #define DIOCRGETTABLES _IOWR('D', 63, struct pfioc_table) 1640 #define DIOCRGETTSTATS _IOWR('D', 64, struct pfioc_table) 1641 #define DIOCRCLRTSTATS _IOWR('D', 65, struct pfioc_table) 1642 #define DIOCRCLRADDRS _IOWR('D', 66, struct pfioc_table) 1643 #define DIOCRADDADDRS _IOWR('D', 67, struct pfioc_table) 1644 #define DIOCRDELADDRS _IOWR('D', 68, struct pfioc_table) 1645 #define DIOCRSETADDRS _IOWR('D', 69, struct pfioc_table) 1646 #define DIOCRGETADDRS _IOWR('D', 70, struct pfioc_table) 1647 #define DIOCRGETASTATS _IOWR('D', 71, struct pfioc_table) 1648 #define DIOCRCLRASTATS _IOWR('D', 72, struct pfioc_table) 1649 #define DIOCRTSTADDRS _IOWR('D', 73, struct pfioc_table) 1650 #define DIOCRSETTFLAGS _IOWR('D', 74, struct pfioc_table) 1651 #define DIOCRINADEFINE _IOWR('D', 77, struct pfioc_table) 1652 #define DIOCOSFPFLUSH _IO('D', 78) 1653 #define DIOCOSFPADD _IOWR('D', 79, struct pf_osfp_ioctl) 1654 #define DIOCOSFPGET _IOWR('D', 80, struct pf_osfp_ioctl) 1655 #define DIOCXBEGIN _IOWR('D', 81, struct pfioc_trans) 1656 #define DIOCXCOMMIT _IOWR('D', 82, struct pfioc_trans) 1657 #define DIOCXROLLBACK _IOWR('D', 83, struct pfioc_trans) 1658 #define DIOCGETSRCNODES _IOWR('D', 84, struct pfioc_src_nodes) 1659 #define DIOCCLRSRCNODES _IO('D', 85) 1660 #define DIOCSETHOSTID _IOWR('D', 86, u_int32_t) 1661 #define DIOCIGETIFACES _IOWR('D', 87, struct pfioc_iface) 1662 #define DIOCSETIFFLAG _IOWR('D', 89, struct pfioc_iface) 1663 #define DIOCCLRIFFLAG _IOWR('D', 90, struct pfioc_iface) 1664 #define DIOCKILLSRCNODES _IOWR('D', 91, struct pfioc_src_node_kill) 1665 #define DIOCSETREASS _IOWR('D', 92, u_int32_t) 1666 #define DIOCADDQUEUE _IOWR('D', 93, struct pfioc_queue) 1667 #define DIOCGETQUEUES _IOWR('D', 94, struct pfioc_queue) 1668 #define DIOCGETQUEUE _IOWR('D', 95, struct pfioc_queue) 1669 #define DIOCGETQSTATS _IOWR('D', 96, struct pfioc_qstats) 1670 #define DIOCSETSYNFLWATS _IOWR('D', 97, struct pfioc_synflwats) 1671 #define DIOCSETSYNCOOKIES _IOWR('D', 98, u_int8_t) 1672 #define DIOCGETSYNFLWATS _IOWR('D', 99, struct pfioc_synflwats) 1673 1674 #ifdef _KERNEL 1675 1676 struct pf_pdesc; 1677 1678 RB_HEAD(pf_src_tree, pf_src_node); 1679 RB_PROTOTYPE(pf_src_tree, pf_src_node, entry, pf_src_compare); 1680 extern struct pf_src_tree tree_src_tracking; 1681 1682 RB_HEAD(pf_state_tree_id, pf_state); 1683 RB_PROTOTYPE(pf_state_tree_id, pf_state, 1684 entry_id, pf_state_compare_id); 1685 extern struct pf_state_tree_id tree_id; 1686 extern struct pf_state_queue state_list; 1687 1688 TAILQ_HEAD(pf_queuehead, pf_queuespec); 1689 extern struct pf_queuehead pf_queues[2]; 1690 extern struct pf_queuehead *pf_queues_active, *pf_queues_inactive; 1691 1692 extern u_int32_t ticket_pabuf; 1693 extern struct pool pf_src_tree_pl, pf_sn_item_pl, pf_rule_pl; 1694 extern struct pool pf_state_pl, pf_state_key_pl, pf_state_item_pl, 1695 pf_rule_item_pl, pf_queue_pl, 1696 pf_pktdelay_pl; 1697 extern struct pool pf_state_scrub_pl; 1698 extern struct ifnet *sync_ifp; 1699 extern struct pf_rule pf_default_rule; 1700 1701 extern int pf_tbladdr_setup(struct pf_ruleset *, 1702 struct pf_addr_wrap *); 1703 extern void pf_tbladdr_remove(struct pf_addr_wrap *); 1704 extern void pf_tbladdr_copyout(struct pf_addr_wrap *); 1705 extern void pf_calc_skip_steps(struct pf_rulequeue *); 1706 extern void pf_purge_expired_src_nodes(void); 1707 extern void pf_purge_expired_states(u_int32_t); 1708 extern void pf_purge_expired_rules(void); 1709 extern void pf_remove_state(struct pf_state *); 1710 extern void pf_remove_divert_state(struct pf_state_key *); 1711 extern void pf_free_state(struct pf_state *); 1712 extern int pf_state_insert(struct pfi_kif *, 1713 struct pf_state_key **, 1714 struct pf_state_key **, 1715 struct pf_state *); 1716 int pf_insert_src_node(struct pf_src_node **, 1717 struct pf_rule *, enum pf_sn_types, 1718 sa_family_t, struct pf_addr *, 1719 struct pf_addr *, struct pfi_kif *); 1720 void pf_remove_src_node(struct pf_src_node *); 1721 struct pf_src_node *pf_get_src_node(struct pf_state *, 1722 enum pf_sn_types); 1723 void pf_src_tree_remove_state(struct pf_state *); 1724 void pf_state_rm_src_node(struct pf_state *, 1725 struct pf_src_node *); 1726 1727 extern struct pf_state *pf_find_state_byid(struct pf_state_cmp *); 1728 extern struct pf_state *pf_find_state_all(struct pf_state_key_cmp *, 1729 u_int, int *); 1730 extern void pf_state_export(struct pfsync_state *, 1731 struct pf_state *); 1732 extern void pf_print_state(struct pf_state *); 1733 extern void pf_print_flags(u_int8_t); 1734 extern void pf_addrcpy(struct pf_addr *, struct pf_addr *, 1735 sa_family_t); 1736 void pf_rm_rule(struct pf_rulequeue *, 1737 struct pf_rule *); 1738 void pf_purge_rule(struct pf_rule *); 1739 struct pf_divert *pf_find_divert(struct mbuf *); 1740 int pf_setup_pdesc(struct pf_pdesc *, sa_family_t, 1741 int, struct pfi_kif *, struct mbuf *, 1742 u_short *); 1743 1744 int pf_test(sa_family_t, int, struct ifnet *, struct mbuf **); 1745 1746 void pf_poolmask(struct pf_addr *, struct pf_addr*, 1747 struct pf_addr *, struct pf_addr *, sa_family_t); 1748 void pf_addr_inc(struct pf_addr *, sa_family_t); 1749 1750 void *pf_pull_hdr(struct mbuf *, int, void *, int, u_short *, u_short *, 1751 sa_family_t); 1752 #define PF_HI (true) 1753 #define PF_LO (!PF_HI) 1754 #define PF_ALGNMNT(off) (((off) % 2) == 0 ? PF_HI : PF_LO) 1755 int pf_patch_8(struct pf_pdesc *, u_int8_t *, u_int8_t, bool); 1756 int pf_patch_16(struct pf_pdesc *, u_int16_t *, u_int16_t); 1757 int pf_patch_16_unaligned(struct pf_pdesc *, void *, u_int16_t, bool); 1758 int pf_patch_32(struct pf_pdesc *, u_int32_t *, u_int32_t); 1759 int pf_patch_32_unaligned(struct pf_pdesc *, void *, u_int32_t, bool); 1760 int pflog_packet(struct pf_pdesc *, u_int8_t, struct pf_rule *, 1761 struct pf_rule *, struct pf_ruleset *, struct pf_rule *); 1762 void pf_send_deferred_syn(struct pf_state *); 1763 int pf_match_addr(u_int8_t, struct pf_addr *, struct pf_addr *, 1764 struct pf_addr *, sa_family_t); 1765 int pf_match_addr_range(struct pf_addr *, struct pf_addr *, 1766 struct pf_addr *, sa_family_t); 1767 int pf_match(u_int8_t, u_int32_t, u_int32_t, u_int32_t); 1768 int pf_match_port(u_int8_t, u_int16_t, u_int16_t, u_int16_t); 1769 int pf_match_uid(u_int8_t, uid_t, uid_t, uid_t); 1770 int pf_match_gid(u_int8_t, gid_t, gid_t, gid_t); 1771 1772 int pf_refragment6(struct mbuf **, struct m_tag *mtag, 1773 struct sockaddr_in6 *, struct ifnet *, struct rtentry *); 1774 void pf_normalize_init(void); 1775 int pf_normalize_ip(struct pf_pdesc *, u_short *); 1776 int pf_normalize_ip6(struct pf_pdesc *, u_short *); 1777 int pf_normalize_tcp(struct pf_pdesc *); 1778 void pf_normalize_tcp_cleanup(struct pf_state *); 1779 int pf_normalize_tcp_init(struct pf_pdesc *, struct pf_state_peer *); 1780 int pf_normalize_tcp_stateful(struct pf_pdesc *, u_short *, 1781 struct pf_state *, struct pf_state_peer *, struct pf_state_peer *, 1782 int *); 1783 int pf_normalize_mss(struct pf_pdesc *, u_int16_t); 1784 void pf_scrub(struct mbuf *, u_int16_t, sa_family_t, u_int8_t, u_int8_t); 1785 int32_t pf_state_expires(const struct pf_state *); 1786 void pf_purge_expired_fragments(void); 1787 int pf_routable(struct pf_addr *addr, sa_family_t af, struct pfi_kif *, 1788 int); 1789 int pf_rtlabel_match(struct pf_addr *, sa_family_t, struct pf_addr_wrap *, 1790 int); 1791 int pf_socket_lookup(struct pf_pdesc *); 1792 struct pf_state_key *pf_alloc_state_key(int); 1793 int pf_ouraddr(struct mbuf *); 1794 void pf_pkt_addr_changed(struct mbuf *); 1795 struct inpcb *pf_inp_lookup(struct mbuf *); 1796 void pf_inp_link(struct mbuf *, struct inpcb *); 1797 void pf_inp_unlink(struct inpcb *); 1798 int pf_state_key_attach(struct pf_state_key *, struct pf_state *, int); 1799 int pf_translate(struct pf_pdesc *, struct pf_addr *, u_int16_t, 1800 struct pf_addr *, u_int16_t, u_int16_t, int); 1801 int pf_translate_af(struct pf_pdesc *); 1802 void pf_route(struct pf_pdesc *, struct pf_rule *, struct pf_state *); 1803 void pf_route6(struct pf_pdesc *, struct pf_rule *, struct pf_state *); 1804 void pf_init_threshold(struct pf_threshold *, u_int32_t, u_int32_t); 1805 int pf_delay_pkt(struct mbuf *, u_int); 1806 1807 void pfr_initialize(void); 1808 int pfr_match_addr(struct pfr_ktable *, struct pf_addr *, sa_family_t); 1809 void pfr_update_stats(struct pfr_ktable *, struct pf_addr *, 1810 struct pf_pdesc *, int, int); 1811 int pfr_pool_get(struct pf_pool *, struct pf_addr **, 1812 struct pf_addr **, sa_family_t); 1813 int pfr_states_increase(struct pfr_ktable *, struct pf_addr *, int); 1814 int pfr_states_decrease(struct pfr_ktable *, struct pf_addr *, int); 1815 struct pfr_kentry * 1816 pfr_kentry_byaddr(struct pfr_ktable *, struct pf_addr *, sa_family_t, 1817 int); 1818 void pfr_dynaddr_update(struct pfr_ktable *, struct pfi_dynaddr *); 1819 struct pfr_ktable * 1820 pfr_attach_table(struct pf_ruleset *, char *, int); 1821 void pfr_detach_table(struct pfr_ktable *); 1822 int pfr_clr_tables(struct pfr_table *, int *, int); 1823 int pfr_add_tables(struct pfr_table *, int, int *, int); 1824 int pfr_del_tables(struct pfr_table *, int, int *, int); 1825 int pfr_get_tables(struct pfr_table *, struct pfr_table *, int *, int); 1826 int pfr_get_tstats(struct pfr_table *, struct pfr_tstats *, int *, int); 1827 int pfr_clr_tstats(struct pfr_table *, int, int *, int); 1828 int pfr_set_tflags(struct pfr_table *, int, int, int, int *, int *, int); 1829 int pfr_clr_addrs(struct pfr_table *, int *, int); 1830 int pfr_insert_kentry(struct pfr_ktable *, struct pfr_addr *, time_t); 1831 int pfr_add_addrs(struct pfr_table *, struct pfr_addr *, int, int *, 1832 int); 1833 int pfr_del_addrs(struct pfr_table *, struct pfr_addr *, int, int *, 1834 int); 1835 int pfr_set_addrs(struct pfr_table *, struct pfr_addr *, int, int *, 1836 int *, int *, int *, int, u_int32_t); 1837 int pfr_get_addrs(struct pfr_table *, struct pfr_addr *, int *, int); 1838 int pfr_get_astats(struct pfr_table *, struct pfr_astats *, int *, int); 1839 int pfr_clr_astats(struct pfr_table *, struct pfr_addr *, int, int *, 1840 int); 1841 int pfr_tst_addrs(struct pfr_table *, struct pfr_addr *, int, int *, 1842 int); 1843 int pfr_ina_begin(struct pfr_table *, u_int32_t *, int *, int); 1844 int pfr_ina_rollback(struct pfr_table *, u_int32_t, int *, int); 1845 int pfr_ina_commit(struct pfr_table *, u_int32_t, int *, int *, int); 1846 int pfr_ina_define(struct pfr_table *, struct pfr_addr *, int, int *, 1847 int *, u_int32_t, int); 1848 struct pfr_ktable 1849 *pfr_ktable_select_active(struct pfr_ktable *); 1850 1851 extern struct pfi_kif *pfi_all; 1852 1853 void pfi_initialize(void); 1854 struct pfi_kif *pfi_kif_find(const char *); 1855 struct pfi_kif *pfi_kif_get(const char *); 1856 void pfi_kif_ref(struct pfi_kif *, enum pfi_kif_refs); 1857 void pfi_kif_unref(struct pfi_kif *, enum pfi_kif_refs); 1858 int pfi_kif_match(struct pfi_kif *, struct pfi_kif *); 1859 void pfi_attach_ifnet(struct ifnet *); 1860 void pfi_detach_ifnet(struct ifnet *); 1861 void pfi_attach_ifgroup(struct ifg_group *); 1862 void pfi_detach_ifgroup(struct ifg_group *); 1863 void pfi_group_change(const char *); 1864 void pfi_group_addmember(const char *, struct ifnet *); 1865 int pfi_match_addr(struct pfi_dynaddr *, struct pf_addr *, 1866 sa_family_t); 1867 int pfi_dynaddr_setup(struct pf_addr_wrap *, sa_family_t); 1868 void pfi_dynaddr_remove(struct pf_addr_wrap *); 1869 void pfi_dynaddr_copyout(struct pf_addr_wrap *); 1870 void pfi_update_status(const char *, struct pf_status *); 1871 int pfi_get_ifaces(const char *, struct pfi_kif *, int *); 1872 int pfi_set_flags(const char *, int); 1873 int pfi_clear_flags(const char *, int); 1874 void pfi_xcommit(void); 1875 1876 int pf_match_tag(struct mbuf *, struct pf_rule *, int *); 1877 u_int16_t pf_tagname2tag(char *, int); 1878 void pf_tag2tagname(u_int16_t, char *); 1879 void pf_tag_ref(u_int16_t); 1880 void pf_tag_unref(u_int16_t); 1881 void pf_tag_packet(struct mbuf *, int, int); 1882 int pf_addr_compare(struct pf_addr *, struct pf_addr *, 1883 sa_family_t); 1884 1885 const struct pfq_ops 1886 *pf_queue_manager(struct pf_queuespec *); 1887 1888 extern struct pf_status pf_status; 1889 extern struct pool pf_frent_pl, pf_frag_pl; 1890 1891 struct pf_pool_limit { 1892 void *pp; 1893 unsigned limit; 1894 unsigned limit_new; 1895 }; 1896 extern struct pf_pool_limit pf_pool_limits[PF_LIMIT_MAX]; 1897 1898 #endif /* _KERNEL */ 1899 1900 extern struct pf_anchor_global pf_anchors; 1901 extern struct pf_anchor pf_main_anchor; 1902 #define pf_main_ruleset pf_main_anchor.ruleset 1903 1904 struct tcphdr; 1905 1906 /* these ruleset functions can be linked into userland programs (pfctl) */ 1907 void pf_init_ruleset(struct pf_ruleset *); 1908 int pf_anchor_setup(struct pf_rule *, 1909 const struct pf_ruleset *, const char *); 1910 int pf_anchor_copyout(const struct pf_ruleset *, 1911 const struct pf_rule *, struct pfioc_rule *); 1912 void pf_remove_anchor(struct pf_rule *); 1913 void pf_remove_if_empty_ruleset(struct pf_ruleset *); 1914 struct pf_anchor *pf_find_anchor(const char *); 1915 struct pf_ruleset *pf_find_ruleset(const char *); 1916 struct pf_ruleset *pf_get_leaf_ruleset(char *, char **); 1917 struct pf_anchor *pf_create_anchor(struct pf_anchor *, const char *); 1918 struct pf_ruleset *pf_find_or_create_ruleset(const char *); 1919 void pf_rs_initialize(void); 1920 1921 /* The fingerprint functions can be linked into userland programs (tcpdump) */ 1922 int pf_osfp_add(struct pf_osfp_ioctl *); 1923 #ifdef _KERNEL 1924 struct pf_osfp_enlist * 1925 pf_osfp_fingerprint(struct pf_pdesc *); 1926 #endif /* _KERNEL */ 1927 struct pf_osfp_enlist * 1928 pf_osfp_fingerprint_hdr(const struct ip *, const struct ip6_hdr *, 1929 const struct tcphdr *); 1930 void pf_osfp_flush(void); 1931 int pf_osfp_get(struct pf_osfp_ioctl *); 1932 void pf_osfp_initialize(void); 1933 int pf_osfp_match(struct pf_osfp_enlist *, pf_osfp_t); 1934 struct pf_os_fingerprint * 1935 pf_osfp_validate(void); 1936 1937 #ifdef _KERNEL 1938 void pf_print_host(struct pf_addr *, u_int16_t, 1939 sa_family_t); 1940 int pf_get_transaddr(struct pf_rule *, struct pf_pdesc *, 1941 struct pf_src_node **, struct pf_rule **); 1942 int pf_map_addr(sa_family_t, struct pf_rule *, 1943 struct pf_addr *, struct pf_addr *, 1944 struct pf_addr *, struct pf_src_node **, 1945 struct pf_pool *, enum pf_sn_types); 1946 int pf_postprocess_addr(struct pf_state *); 1947 1948 void pf_mbuf_link_state_key(struct mbuf *, 1949 struct pf_state_key *); 1950 void pf_mbuf_unlink_state_key(struct mbuf *); 1951 void pf_mbuf_link_inpcb(struct mbuf *, struct inpcb *); 1952 void pf_mbuf_unlink_inpcb(struct mbuf *); 1953 1954 u_int8_t* pf_find_tcpopt(u_int8_t *, u_int8_t *, size_t, 1955 u_int8_t, u_int8_t); 1956 u_int8_t pf_get_wscale(struct pf_pdesc *); 1957 u_int16_t pf_get_mss(struct pf_pdesc *); 1958 struct mbuf * pf_build_tcp(const struct pf_rule *, sa_family_t, 1959 const struct pf_addr *, const struct pf_addr *, 1960 u_int16_t, u_int16_t, u_int32_t, u_int32_t, 1961 u_int8_t, u_int16_t, u_int16_t, u_int8_t, int, 1962 u_int16_t, u_int, u_int); 1963 void pf_send_tcp(const struct pf_rule *, sa_family_t, 1964 const struct pf_addr *, const struct pf_addr *, 1965 u_int16_t, u_int16_t, u_int32_t, u_int32_t, 1966 u_int8_t, u_int16_t, u_int16_t, u_int8_t, int, 1967 u_int16_t, u_int); 1968 void pf_syncookies_init(void); 1969 int pf_syncookies_setmode(u_int8_t); 1970 int pf_syncookies_setwats(u_int32_t, u_int32_t); 1971 int pf_syncookies_getwats(struct pfioc_synflwats *); 1972 int pf_synflood_check(struct pf_pdesc *); 1973 void pf_syncookie_send(struct pf_pdesc *); 1974 u_int8_t pf_syncookie_validate(struct pf_pdesc *); 1975 struct mbuf * pf_syncookie_recreate_syn(struct pf_pdesc *); 1976 #endif /* _KERNEL */ 1977 1978 #endif /* _NET_PFVAR_H_ */ 1979