1/* $FreeBSD: releng/10.3/sys/contrib/ipfilter/netinet/fil.c 275690 2014-12-10 20:54:23Z cy $ */ 2 3/* 4 * Copyright (C) 2012 by Darren Reed. 5 * 6 * See the IPFILTER.LICENCE file for details on licencing. 7 * 8 * Copyright 2008 Sun Microsystems. 9 * 10 * $Id$ 11 * 12 */ 13#if defined(KERNEL) || defined(_KERNEL) 14# undef KERNEL 15# undef _KERNEL 16# define KERNEL 1 17# define _KERNEL 1 18#endif 19#include <sys/errno.h> 20#include <sys/types.h> 21#include <sys/param.h> 22#include <sys/time.h> 23#if defined(_KERNEL) && defined(__FreeBSD_version) && \ 24 (__FreeBSD_version >= 220000) 25# if (__FreeBSD_version >= 400000) 26# if !defined(IPFILTER_LKM) 27# include "opt_inet6.h" 28# endif 29# if (__FreeBSD_version == 400019) 30# define CSUM_DELAY_DATA 31# endif 32# endif 33# include <sys/filio.h> 34#else 35# include <sys/ioctl.h> 36#endif 37#if (defined(__SVR4) || defined(__svr4__)) && defined(sun) 38# include <sys/filio.h> 39#endif 40#if !defined(_AIX51) 41# include <sys/fcntl.h> 42#endif 43#if defined(_KERNEL) 44# include <sys/systm.h> 45# include <sys/file.h> 46#else 47# include <stdio.h> 48# include <string.h> 49# include <stdlib.h> 50# include <stddef.h> 51# include <sys/file.h> 52# define _KERNEL 53# ifdef __OpenBSD__ 54struct file; 55# endif 56# include <sys/uio.h> 57# undef _KERNEL 58#endif 59#if !defined(__SVR4) && !defined(__svr4__) && !defined(__hpux) && \ 60 !defined(linux) 61# include <sys/mbuf.h> 62#else 63# if !defined(linux) 64# include <sys/byteorder.h> 65# endif 66# if (SOLARIS2 < 5) && defined(sun) 67# include <sys/dditypes.h> 68# endif 69#endif 70#ifdef __hpux 71# define _NET_ROUTE_INCLUDED 72#endif 73#if !defined(linux) 74# include <sys/protosw.h> 75#endif 76#include <sys/socket.h> 77#include <net/if.h> 78#ifdef sun 79# include <net/af.h> 80#endif 81#include <netinet/in.h> 82#include <netinet/in_systm.h> 83#include <netinet/ip.h> 84#if defined(__sgi) && defined(IFF_DRVRLOCK) /* IRIX 6 */ 85# include <sys/hashing.h> 86# include <netinet/in_var.h> 87#endif 88#include <netinet/tcp.h> 89#if (!defined(__sgi) && !defined(AIX)) || defined(_KERNEL) 90# include <netinet/udp.h> 91# include <netinet/ip_icmp.h> 92#endif 93#ifdef __hpux 94# undef _NET_ROUTE_INCLUDED 95#endif 96#ifdef __osf__ 97# undef _RADIX_H_ 98#endif 99#include "netinet/ip_compat.h" 100#ifdef USE_INET6 101# include <netinet/icmp6.h> 102# if !SOLARIS && defined(_KERNEL) && !defined(__osf__) && !defined(__hpux) 103# include <netinet6/in6_var.h> 104# endif 105#endif 106#include "netinet/ip_fil.h" 107#include "netinet/ip_nat.h" 108#include "netinet/ip_frag.h" 109#include "netinet/ip_state.h" 110#include "netinet/ip_proxy.h" 111#include "netinet/ip_auth.h" 112#ifdef IPFILTER_SCAN 113# include "netinet/ip_scan.h" 114#endif 115#include "netinet/ip_sync.h" 116#include "netinet/ip_lookup.h" 117#include "netinet/ip_pool.h" 118#include "netinet/ip_htable.h" 119#ifdef IPFILTER_COMPILED 120# include "netinet/ip_rules.h" 121#endif 122#if defined(IPFILTER_BPF) && defined(_KERNEL) 123# include <net/bpf.h> 124#endif 125#if defined(__FreeBSD_version) && (__FreeBSD_version >= 300000) 126# include <sys/malloc.h> 127#endif 128#include "netinet/ipl.h" 129 130#if defined(__NetBSD__) && (__NetBSD_Version__ >= 104230000) 131# include <sys/callout.h> 132extern struct callout ipf_slowtimer_ch; 133#endif 134#if defined(__OpenBSD__) 135# include <sys/timeout.h> 136extern struct timeout ipf_slowtimer_ch; 137#endif 138/* END OF INCLUDES */ 139 140#if !defined(lint) 141static const char sccsid[] = "@(#)fil.c 1.36 6/5/96 (C) 1993-2000 Darren Reed"; 142static const char rcsid[] = "@(#)$FreeBSD: releng/10.3/sys/contrib/ipfilter/netinet/fil.c 275690 2014-12-10 20:54:23Z cy $"; 143/* static const char rcsid[] = "@(#)$Id: fil.c,v 2.243.2.125 2007/10/10 09:27:20 darrenr Exp $"; */ 144#endif 145 146#ifndef _KERNEL 147# include "ipf.h" 148# include "ipt.h" 149extern int opts; 150extern int blockreason; 151#endif /* _KERNEL */ 152 153#define LBUMP(x) softc->x++ 154#define LBUMPD(x, y) do { softc->x.y++; DT(y); } while (0) 155 156static INLINE int ipf_check_ipf __P((fr_info_t *, frentry_t *, int)); 157static u_32_t ipf_checkcipso __P((fr_info_t *, u_char *, int)); 158static u_32_t ipf_checkripso __P((u_char *)); 159static u_32_t ipf_decaps __P((fr_info_t *, u_32_t, int)); 160#ifdef IPFILTER_LOG 161static frentry_t *ipf_dolog __P((fr_info_t *, u_32_t *)); 162#endif 163static int ipf_flushlist __P((ipf_main_softc_t *, int *, 164 frentry_t **)); 165static int ipf_flush_groups __P((ipf_main_softc_t *, frgroup_t **, 166 int)); 167static ipfunc_t ipf_findfunc __P((ipfunc_t)); 168static void *ipf_findlookup __P((ipf_main_softc_t *, int, 169 frentry_t *, 170 i6addr_t *, i6addr_t *)); 171static frentry_t *ipf_firewall __P((fr_info_t *, u_32_t *)); 172static int ipf_fr_matcharray __P((fr_info_t *, int *)); 173static int ipf_frruleiter __P((ipf_main_softc_t *, void *, int, 174 void *)); 175static void ipf_funcfini __P((ipf_main_softc_t *, frentry_t *)); 176static int ipf_funcinit __P((ipf_main_softc_t *, frentry_t *)); 177static int ipf_geniter __P((ipf_main_softc_t *, ipftoken_t *, 178 ipfgeniter_t *)); 179static void ipf_getstat __P((ipf_main_softc_t *, 180 struct friostat *, int)); 181static int ipf_group_flush __P((ipf_main_softc_t *, frgroup_t *)); 182static void ipf_group_free __P((frgroup_t *)); 183static int ipf_grpmapfini __P((struct ipf_main_softc_s *, 184 frentry_t *)); 185static int ipf_grpmapinit __P((struct ipf_main_softc_s *, 186 frentry_t *)); 187static frentry_t *ipf_nextrule __P((ipf_main_softc_t *, int, int, 188 frentry_t *, int)); 189static int ipf_portcheck __P((frpcmp_t *, u_32_t)); 190static INLINE int ipf_pr_ah __P((fr_info_t *)); 191static INLINE void ipf_pr_esp __P((fr_info_t *)); 192static INLINE void ipf_pr_gre __P((fr_info_t *)); 193static INLINE void ipf_pr_udp __P((fr_info_t *)); 194static INLINE void ipf_pr_tcp __P((fr_info_t *)); 195static INLINE void ipf_pr_icmp __P((fr_info_t *)); 196static INLINE void ipf_pr_ipv4hdr __P((fr_info_t *)); 197static INLINE void ipf_pr_short __P((fr_info_t *, int)); 198static INLINE int ipf_pr_tcpcommon __P((fr_info_t *)); 199static INLINE int ipf_pr_udpcommon __P((fr_info_t *)); 200static void ipf_rule_delete __P((ipf_main_softc_t *, frentry_t *f, 201 int, int)); 202static void ipf_rule_expire_insert __P((ipf_main_softc_t *, 203 frentry_t *, int)); 204static int ipf_synclist __P((ipf_main_softc_t *, frentry_t *, 205 void *)); 206static void ipf_token_flush __P((ipf_main_softc_t *)); 207static void ipf_token_unlink __P((ipf_main_softc_t *, 208 ipftoken_t *)); 209static ipftuneable_t *ipf_tune_findbyname __P((ipftuneable_t *, 210 const char *)); 211static ipftuneable_t *ipf_tune_findbycookie __P((ipftuneable_t **, void *, 212 void **)); 213static int ipf_updateipid __P((fr_info_t *)); 214static int ipf_settimeout __P((struct ipf_main_softc_s *, 215 struct ipftuneable *, 216 ipftuneval_t *)); 217#if !defined(_KERNEL) || (!defined(__NetBSD__) && !defined(__OpenBSD__) && \ 218 !defined(__FreeBSD__)) || \ 219 FREEBSD_LT_REV(501000) || NETBSD_LT_REV(105000000) || \ 220 OPENBSD_LT_REV(200006) 221static int ppsratecheck(struct timeval *, int *, int); 222#endif 223 224 225/* 226 * bit values for identifying presence of individual IP options 227 * All of these tables should be ordered by increasing key value on the left 228 * hand side to allow for binary searching of the array and include a trailer 229 * with a 0 for the bitmask for linear searches to easily find the end with. 230 */ 231static const struct optlist ipopts[20] = { 232 { IPOPT_NOP, 0x000001 }, 233 { IPOPT_RR, 0x000002 }, 234 { IPOPT_ZSU, 0x000004 }, 235 { IPOPT_MTUP, 0x000008 }, 236 { IPOPT_MTUR, 0x000010 }, 237 { IPOPT_ENCODE, 0x000020 }, 238 { IPOPT_TS, 0x000040 }, 239 { IPOPT_TR, 0x000080 }, 240 { IPOPT_SECURITY, 0x000100 }, 241 { IPOPT_LSRR, 0x000200 }, 242 { IPOPT_E_SEC, 0x000400 }, 243 { IPOPT_CIPSO, 0x000800 }, 244 { IPOPT_SATID, 0x001000 }, 245 { IPOPT_SSRR, 0x002000 }, 246 { IPOPT_ADDEXT, 0x004000 }, 247 { IPOPT_VISA, 0x008000 }, 248 { IPOPT_IMITD, 0x010000 }, 249 { IPOPT_EIP, 0x020000 }, 250 { IPOPT_FINN, 0x040000 }, 251 { 0, 0x000000 } 252}; 253 254#ifdef USE_INET6 255static const struct optlist ip6exthdr[] = { 256 { IPPROTO_HOPOPTS, 0x000001 }, 257 { IPPROTO_IPV6, 0x000002 }, 258 { IPPROTO_ROUTING, 0x000004 }, 259 { IPPROTO_FRAGMENT, 0x000008 }, 260 { IPPROTO_ESP, 0x000010 }, 261 { IPPROTO_AH, 0x000020 }, 262 { IPPROTO_NONE, 0x000040 }, 263 { IPPROTO_DSTOPTS, 0x000080 }, 264 { IPPROTO_MOBILITY, 0x000100 }, 265 { 0, 0 } 266}; 267#endif 268 269/* 270 * bit values for identifying presence of individual IP security options 271 */ 272static const struct optlist secopt[8] = { 273 { IPSO_CLASS_RES4, 0x01 }, 274 { IPSO_CLASS_TOPS, 0x02 }, 275 { IPSO_CLASS_SECR, 0x04 }, 276 { IPSO_CLASS_RES3, 0x08 }, 277 { IPSO_CLASS_CONF, 0x10 }, 278 { IPSO_CLASS_UNCL, 0x20 }, 279 { IPSO_CLASS_RES2, 0x40 }, 280 { IPSO_CLASS_RES1, 0x80 } 281}; 282 283char ipfilter_version[] = IPL_VERSION; 284 285int ipf_features = 0 286#ifdef IPFILTER_LKM 287 | IPF_FEAT_LKM 288#endif 289#ifdef IPFILTER_LOG 290 | IPF_FEAT_LOG 291#endif 292 | IPF_FEAT_LOOKUP 293#ifdef IPFILTER_BPF 294 | IPF_FEAT_BPF 295#endif 296#ifdef IPFILTER_COMPILED 297 | IPF_FEAT_COMPILED 298#endif 299#ifdef IPFILTER_CKSUM 300 | IPF_FEAT_CKSUM 301#endif 302 | IPF_FEAT_SYNC 303#ifdef IPFILTER_SCAN 304 | IPF_FEAT_SCAN 305#endif 306#ifdef USE_INET6 307 | IPF_FEAT_IPV6 308#endif 309 ; 310 311 312/* 313 * Table of functions available for use with call rules. 314 */ 315static ipfunc_resolve_t ipf_availfuncs[] = { 316 { "srcgrpmap", ipf_srcgrpmap, ipf_grpmapinit, ipf_grpmapfini }, 317 { "dstgrpmap", ipf_dstgrpmap, ipf_grpmapinit, ipf_grpmapfini }, 318 { "", NULL, NULL, NULL } 319}; 320 321static ipftuneable_t ipf_main_tuneables[] = { 322 { { (void *)offsetof(struct ipf_main_softc_s, ipf_flags) }, 323 "ipf_flags", 0, 0xffffffff, 324 stsizeof(ipf_main_softc_t, ipf_flags), 325 0, NULL, NULL }, 326 { { (void *)offsetof(struct ipf_main_softc_s, ipf_active) }, 327 "active", 0, 0, 328 stsizeof(ipf_main_softc_t, ipf_active), 329 IPFT_RDONLY, NULL, NULL }, 330 { { (void *)offsetof(ipf_main_softc_t, ipf_control_forwarding) }, 331 "control_forwarding", 0, 1, 332 stsizeof(ipf_main_softc_t, ipf_control_forwarding), 333 0, NULL, NULL }, 334 { { (void *)offsetof(ipf_main_softc_t, ipf_update_ipid) }, 335 "update_ipid", 0, 1, 336 stsizeof(ipf_main_softc_t, ipf_update_ipid), 337 0, NULL, NULL }, 338 { { (void *)offsetof(ipf_main_softc_t, ipf_chksrc) }, 339 "chksrc", 0, 1, 340 stsizeof(ipf_main_softc_t, ipf_chksrc), 341 0, NULL, NULL }, 342 { { (void *)offsetof(ipf_main_softc_t, ipf_minttl) }, 343 "min_ttl", 0, 1, 344 stsizeof(ipf_main_softc_t, ipf_minttl), 345 0, NULL, NULL }, 346 { { (void *)offsetof(ipf_main_softc_t, ipf_icmpminfragmtu) }, 347 "icmp_minfragmtu", 0, 1, 348 stsizeof(ipf_main_softc_t, ipf_icmpminfragmtu), 349 0, NULL, NULL }, 350 { { (void *)offsetof(ipf_main_softc_t, ipf_pass) }, 351 "default_pass", 0, 0xffffffff, 352 stsizeof(ipf_main_softc_t, ipf_pass), 353 0, NULL, NULL }, 354 { { (void *)offsetof(ipf_main_softc_t, ipf_tcpidletimeout) }, 355 "tcp_idle_timeout", 1, 0x7fffffff, 356 stsizeof(ipf_main_softc_t, ipf_tcpidletimeout), 357 0, NULL, ipf_settimeout }, 358 { { (void *)offsetof(ipf_main_softc_t, ipf_tcpclosewait) }, 359 "tcp_close_wait", 1, 0x7fffffff, 360 stsizeof(ipf_main_softc_t, ipf_tcpclosewait), 361 0, NULL, ipf_settimeout }, 362 { { (void *)offsetof(ipf_main_softc_t, ipf_tcplastack) }, 363 "tcp_last_ack", 1, 0x7fffffff, 364 stsizeof(ipf_main_softc_t, ipf_tcplastack), 365 0, NULL, ipf_settimeout }, 366 { { (void *)offsetof(ipf_main_softc_t, ipf_tcptimeout) }, 367 "tcp_timeout", 1, 0x7fffffff, 368 stsizeof(ipf_main_softc_t, ipf_tcptimeout), 369 0, NULL, ipf_settimeout }, 370 { { (void *)offsetof(ipf_main_softc_t, ipf_tcpsynsent) }, 371 "tcp_syn_sent", 1, 0x7fffffff, 372 stsizeof(ipf_main_softc_t, ipf_tcpsynsent), 373 0, NULL, ipf_settimeout }, 374 { { (void *)offsetof(ipf_main_softc_t, ipf_tcpsynrecv) }, 375 "tcp_syn_received", 1, 0x7fffffff, 376 stsizeof(ipf_main_softc_t, ipf_tcpsynrecv), 377 0, NULL, ipf_settimeout }, 378 { { (void *)offsetof(ipf_main_softc_t, ipf_tcpclosed) }, 379 "tcp_closed", 1, 0x7fffffff, 380 stsizeof(ipf_main_softc_t, ipf_tcpclosed), 381 0, NULL, ipf_settimeout }, 382 { { (void *)offsetof(ipf_main_softc_t, ipf_tcphalfclosed) }, 383 "tcp_half_closed", 1, 0x7fffffff, 384 stsizeof(ipf_main_softc_t, ipf_tcphalfclosed), 385 0, NULL, ipf_settimeout }, 386 { { (void *)offsetof(ipf_main_softc_t, ipf_tcptimewait) }, 387 "tcp_time_wait", 1, 0x7fffffff, 388 stsizeof(ipf_main_softc_t, ipf_tcptimewait), 389 0, NULL, ipf_settimeout }, 390 { { (void *)offsetof(ipf_main_softc_t, ipf_udptimeout) }, 391 "udp_timeout", 1, 0x7fffffff, 392 stsizeof(ipf_main_softc_t, ipf_udptimeout), 393 0, NULL, ipf_settimeout }, 394 { { (void *)offsetof(ipf_main_softc_t, ipf_udpacktimeout) }, 395 "udp_ack_timeout", 1, 0x7fffffff, 396 stsizeof(ipf_main_softc_t, ipf_udpacktimeout), 397 0, NULL, ipf_settimeout }, 398 { { (void *)offsetof(ipf_main_softc_t, ipf_icmptimeout) }, 399 "icmp_timeout", 1, 0x7fffffff, 400 stsizeof(ipf_main_softc_t, ipf_icmptimeout), 401 0, NULL, ipf_settimeout }, 402 { { (void *)offsetof(ipf_main_softc_t, ipf_icmpacktimeout) }, 403 "icmp_ack_timeout", 1, 0x7fffffff, 404 stsizeof(ipf_main_softc_t, ipf_icmpacktimeout), 405 0, NULL, ipf_settimeout }, 406 { { (void *)offsetof(ipf_main_softc_t, ipf_iptimeout) }, 407 "ip_timeout", 1, 0x7fffffff, 408 stsizeof(ipf_main_softc_t, ipf_iptimeout), 409 0, NULL, ipf_settimeout }, 410#if defined(INSTANCES) && defined(_KERNEL) 411 { { (void *)offsetof(ipf_main_softc_t, ipf_get_loopback) }, 412 "intercept_loopback", 0, 1, 413 stsizeof(ipf_main_softc_t, ipf_get_loopback), 414 0, NULL, ipf_set_loopback }, 415#endif 416 { { 0 }, 417 NULL, 0, 0, 418 0, 419 0, NULL, NULL } 420}; 421 422 423/* 424 * The next section of code is a a collection of small routines that set 425 * fields in the fr_info_t structure passed based on properties of the 426 * current packet. There are different routines for the same protocol 427 * for each of IPv4 and IPv6. Adding a new protocol, for which there 428 * will "special" inspection for setup, is now more easily done by adding 429 * a new routine and expanding the ipf_pr_ipinit*() function rather than by 430 * adding more code to a growing switch statement. 431 */ 432#ifdef USE_INET6 433static INLINE int ipf_pr_ah6 __P((fr_info_t *)); 434static INLINE void ipf_pr_esp6 __P((fr_info_t *)); 435static INLINE void ipf_pr_gre6 __P((fr_info_t *)); 436static INLINE void ipf_pr_udp6 __P((fr_info_t *)); 437static INLINE void ipf_pr_tcp6 __P((fr_info_t *)); 438static INLINE void ipf_pr_icmp6 __P((fr_info_t *)); 439static INLINE void ipf_pr_ipv6hdr __P((fr_info_t *)); 440static INLINE void ipf_pr_short6 __P((fr_info_t *, int)); 441static INLINE int ipf_pr_hopopts6 __P((fr_info_t *)); 442static INLINE int ipf_pr_mobility6 __P((fr_info_t *)); 443static INLINE int ipf_pr_routing6 __P((fr_info_t *)); 444static INLINE int ipf_pr_dstopts6 __P((fr_info_t *)); 445static INLINE int ipf_pr_fragment6 __P((fr_info_t *)); 446static INLINE struct ip6_ext *ipf_pr_ipv6exthdr __P((fr_info_t *, int, int)); 447 448 449/* ------------------------------------------------------------------------ */ 450/* Function: ipf_pr_short6 */ 451/* Returns: void */ 452/* Parameters: fin(I) - pointer to packet information */ 453/* xmin(I) - minimum header size */ 454/* */ 455/* IPv6 Only */ 456/* This is function enforces the 'is a packet too short to be legit' rule */ 457/* for IPv6 and marks the packet with FI_SHORT if so. See function comment */ 458/* for ipf_pr_short() for more details. */ 459/* ------------------------------------------------------------------------ */ 460static INLINE void 461ipf_pr_short6(fin, xmin) 462 fr_info_t *fin; 463 int xmin; 464{ 465 466 if (fin->fin_dlen < xmin) 467 fin->fin_flx |= FI_SHORT; 468} 469 470 471/* ------------------------------------------------------------------------ */ 472/* Function: ipf_pr_ipv6hdr */ 473/* Returns: void */ 474/* Parameters: fin(I) - pointer to packet information */ 475/* */ 476/* IPv6 Only */ 477/* Copy values from the IPv6 header into the fr_info_t struct and call the */ 478/* per-protocol analyzer if it exists. In validating the packet, a protocol*/ 479/* analyzer may pullup or free the packet itself so we need to be vigiliant */ 480/* of that possibility arising. */ 481/* ------------------------------------------------------------------------ */ 482static INLINE void 483ipf_pr_ipv6hdr(fin) 484 fr_info_t *fin; 485{ 486 ip6_t *ip6 = (ip6_t *)fin->fin_ip; 487 int p, go = 1, i, hdrcount; 488 fr_ip_t *fi = &fin->fin_fi; 489 490 fin->fin_off = 0; 491 492 fi->fi_tos = 0; 493 fi->fi_optmsk = 0; 494 fi->fi_secmsk = 0; 495 fi->fi_auth = 0; 496 497 p = ip6->ip6_nxt; 498 fin->fin_crc = p; 499 fi->fi_ttl = ip6->ip6_hlim; 500 fi->fi_src.in6 = ip6->ip6_src; 501 fin->fin_crc += fi->fi_src.i6[0]; 502 fin->fin_crc += fi->fi_src.i6[1]; 503 fin->fin_crc += fi->fi_src.i6[2]; 504 fin->fin_crc += fi->fi_src.i6[3]; 505 fi->fi_dst.in6 = ip6->ip6_dst; 506 fin->fin_crc += fi->fi_dst.i6[0]; 507 fin->fin_crc += fi->fi_dst.i6[1]; 508 fin->fin_crc += fi->fi_dst.i6[2]; 509 fin->fin_crc += fi->fi_dst.i6[3]; 510 fin->fin_id = 0; 511 if (IN6_IS_ADDR_MULTICAST(&fi->fi_dst.in6)) 512 fin->fin_flx |= FI_MULTICAST|FI_MBCAST; 513 514 hdrcount = 0; 515 while (go && !(fin->fin_flx & FI_SHORT)) { 516 switch (p) 517 { 518 case IPPROTO_UDP : 519 ipf_pr_udp6(fin); 520 go = 0; 521 break; 522 523 case IPPROTO_TCP : 524 ipf_pr_tcp6(fin); 525 go = 0; 526 break; 527 528 case IPPROTO_ICMPV6 : 529 ipf_pr_icmp6(fin); 530 go = 0; 531 break; 532 533 case IPPROTO_GRE : 534 ipf_pr_gre6(fin); 535 go = 0; 536 break; 537 538 case IPPROTO_HOPOPTS : 539 p = ipf_pr_hopopts6(fin); 540 break; 541 542 case IPPROTO_MOBILITY : 543 p = ipf_pr_mobility6(fin); 544 break; 545 546 case IPPROTO_DSTOPTS : 547 p = ipf_pr_dstopts6(fin); 548 break; 549 550 case IPPROTO_ROUTING : 551 p = ipf_pr_routing6(fin); 552 break; 553 554 case IPPROTO_AH : 555 p = ipf_pr_ah6(fin); 556 break; 557 558 case IPPROTO_ESP : 559 ipf_pr_esp6(fin); 560 go = 0; 561 break; 562 563 case IPPROTO_IPV6 : 564 for (i = 0; ip6exthdr[i].ol_bit != 0; i++) 565 if (ip6exthdr[i].ol_val == p) { 566 fin->fin_flx |= ip6exthdr[i].ol_bit; 567 break; 568 } 569 go = 0; 570 break; 571 572 case IPPROTO_NONE : 573 go = 0; 574 break; 575 576 case IPPROTO_FRAGMENT : 577 p = ipf_pr_fragment6(fin); 578 /* 579 * Given that the only fragments we want to let through 580 * (where fin_off != 0) are those where the non-first 581 * fragments only have data, we can safely stop looking 582 * at headers if this is a non-leading fragment. 583 */ 584 if (fin->fin_off != 0) 585 go = 0; 586 break; 587 588 default : 589 go = 0; 590 break; 591 } 592 hdrcount++; 593 594 /* 595 * It is important to note that at this point, for the 596 * extension headers (go != 0), the entire header may not have 597 * been pulled up when the code gets to this point. This is 598 * only done for "go != 0" because the other header handlers 599 * will all pullup their complete header. The other indicator 600 * of an incomplete packet is that this was just an extension 601 * header. 602 */ 603 if ((go != 0) && (p != IPPROTO_NONE) && 604 (ipf_pr_pullup(fin, 0) == -1)) { 605 p = IPPROTO_NONE; 606 break; 607 } 608 } 609 610 /* 611 * Some of the above functions, like ipf_pr_esp6(), can call ipf_pullup 612 * and destroy whatever packet was here. The caller of this function 613 * expects us to return if there is a problem with ipf_pullup. 614 */ 615 if (fin->fin_m == NULL) { 616 ipf_main_softc_t *softc = fin->fin_main_soft; 617 618 LBUMPD(ipf_stats[fin->fin_out], fr_v6_bad); 619 return; 620 } 621 622 fi->fi_p = p; 623 624 /* 625 * IPv6 fragment case 1 - see comment for ipf_pr_fragment6(). 626 * "go != 0" imples the above loop hasn't arrived at a layer 4 header. 627 */ 628 if ((go != 0) && (fin->fin_flx & FI_FRAG) && (fin->fin_off == 0)) { 629 ipf_main_softc_t *softc = fin->fin_main_soft; 630 631 fin->fin_flx |= FI_BAD; 632 LBUMPD(ipf_stats[fin->fin_out], fr_v6_badfrag); 633 LBUMP(ipf_stats[fin->fin_out].fr_v6_bad); 634 } 635} 636 637 638/* ------------------------------------------------------------------------ */ 639/* Function: ipf_pr_ipv6exthdr */ 640/* Returns: struct ip6_ext * - pointer to the start of the next header */ 641/* or NULL if there is a prolblem. */ 642/* Parameters: fin(I) - pointer to packet information */ 643/* multiple(I) - flag indicating yes/no if multiple occurances */ 644/* of this extension header are allowed. */ 645/* proto(I) - protocol number for this extension header */ 646/* */ 647/* IPv6 Only */ 648/* This function embodies a number of common checks that all IPv6 extension */ 649/* headers must be subjected to. For example, making sure the packet is */ 650/* big enough for it to be in, checking if it is repeated and setting a */ 651/* flag to indicate its presence. */ 652/* ------------------------------------------------------------------------ */ 653static INLINE struct ip6_ext * 654ipf_pr_ipv6exthdr(fin, multiple, proto) 655 fr_info_t *fin; 656 int multiple, proto; 657{ 658 ipf_main_softc_t *softc = fin->fin_main_soft; 659 struct ip6_ext *hdr; 660 u_short shift; 661 int i; 662 663 fin->fin_flx |= FI_V6EXTHDR; 664 665 /* 8 is default length of extension hdr */ 666 if ((fin->fin_dlen - 8) < 0) { 667 fin->fin_flx |= FI_SHORT; 668 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ext_short); 669 return NULL; 670 } 671 672 if (ipf_pr_pullup(fin, 8) == -1) { 673 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ext_pullup); 674 return NULL; 675 } 676 677 hdr = fin->fin_dp; 678 switch (proto) 679 { 680 case IPPROTO_FRAGMENT : 681 shift = 8; 682 break; 683 default : 684 shift = 8 + (hdr->ip6e_len << 3); 685 break; 686 } 687 688 if (shift > fin->fin_dlen) { /* Nasty extension header length? */ 689 fin->fin_flx |= FI_BAD; 690 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ext_hlen); 691 return NULL; 692 } 693 694 fin->fin_dp = (char *)fin->fin_dp + shift; 695 fin->fin_dlen -= shift; 696 697 /* 698 * If we have seen a fragment header, do not set any flags to indicate 699 * the presence of this extension header as it has no impact on the 700 * end result until after it has been defragmented. 701 */ 702 if (fin->fin_flx & FI_FRAG) 703 return hdr; 704 705 for (i = 0; ip6exthdr[i].ol_bit != 0; i++) 706 if (ip6exthdr[i].ol_val == proto) { 707 /* 708 * Most IPv6 extension headers are only allowed once. 709 */ 710 if ((multiple == 0) && 711 ((fin->fin_optmsk & ip6exthdr[i].ol_bit) != 0)) 712 fin->fin_flx |= FI_BAD; 713 else 714 fin->fin_optmsk |= ip6exthdr[i].ol_bit; 715 break; 716 } 717 718 return hdr; 719} 720 721 722/* ------------------------------------------------------------------------ */ 723/* Function: ipf_pr_hopopts6 */ 724/* Returns: int - value of the next header or IPPROTO_NONE if error */ 725/* Parameters: fin(I) - pointer to packet information */ 726/* */ 727/* IPv6 Only */ 728/* This is function checks pending hop by hop options extension header */ 729/* ------------------------------------------------------------------------ */ 730static INLINE int 731ipf_pr_hopopts6(fin) 732 fr_info_t *fin; 733{ 734 struct ip6_ext *hdr; 735 736 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_HOPOPTS); 737 if (hdr == NULL) 738 return IPPROTO_NONE; 739 return hdr->ip6e_nxt; 740} 741 742 743/* ------------------------------------------------------------------------ */ 744/* Function: ipf_pr_mobility6 */ 745/* Returns: int - value of the next header or IPPROTO_NONE if error */ 746/* Parameters: fin(I) - pointer to packet information */ 747/* */ 748/* IPv6 Only */ 749/* This is function checks the IPv6 mobility extension header */ 750/* ------------------------------------------------------------------------ */ 751static INLINE int 752ipf_pr_mobility6(fin) 753 fr_info_t *fin; 754{ 755 struct ip6_ext *hdr; 756 757 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_MOBILITY); 758 if (hdr == NULL) 759 return IPPROTO_NONE; 760 return hdr->ip6e_nxt; 761} 762 763 764/* ------------------------------------------------------------------------ */ 765/* Function: ipf_pr_routing6 */ 766/* Returns: int - value of the next header or IPPROTO_NONE if error */ 767/* Parameters: fin(I) - pointer to packet information */ 768/* */ 769/* IPv6 Only */ 770/* This is function checks pending routing extension header */ 771/* ------------------------------------------------------------------------ */ 772static INLINE int 773ipf_pr_routing6(fin) 774 fr_info_t *fin; 775{ 776 struct ip6_routing *hdr; 777 778 hdr = (struct ip6_routing *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_ROUTING); 779 if (hdr == NULL) 780 return IPPROTO_NONE; 781 782 switch (hdr->ip6r_type) 783 { 784 case 0 : 785 /* 786 * Nasty extension header length? 787 */ 788 if (((hdr->ip6r_len >> 1) < hdr->ip6r_segleft) || 789 (hdr->ip6r_segleft && (hdr->ip6r_len & 1))) { 790 ipf_main_softc_t *softc = fin->fin_main_soft; 791 792 fin->fin_flx |= FI_BAD; 793 LBUMPD(ipf_stats[fin->fin_out], fr_v6_rh_bad); 794 return IPPROTO_NONE; 795 } 796 break; 797 798 default : 799 break; 800 } 801 802 return hdr->ip6r_nxt; 803} 804 805 806/* ------------------------------------------------------------------------ */ 807/* Function: ipf_pr_fragment6 */ 808/* Returns: int - value of the next header or IPPROTO_NONE if error */ 809/* Parameters: fin(I) - pointer to packet information */ 810/* */ 811/* IPv6 Only */ 812/* Examine the IPv6 fragment header and extract fragment offset information.*/ 813/* */ 814/* Fragments in IPv6 are extraordinarily difficult to deal with - much more */ 815/* so than in IPv4. There are 5 cases of fragments with IPv6 that all */ 816/* packets with a fragment header can fit into. They are as follows: */ 817/* */ 818/* 1. [IPv6][0-n EH][FH][0-n EH] (no L4HDR present) */ 819/* 2. [IPV6][0-n EH][FH][0-n EH][L4HDR part] (short) */ 820/* 3. [IPV6][0-n EH][FH][L4HDR part][0-n data] (short) */ 821/* 4. [IPV6][0-n EH][FH][0-n EH][L4HDR][0-n data] */ 822/* 5. [IPV6][0-n EH][FH][data] */ 823/* */ 824/* IPV6 = IPv6 header, FH = Fragment Header, */ 825/* 0-n EH = 0 or more extension headers, 0-n data = 0 or more bytes of data */ 826/* */ 827/* Packets that match 1, 2, 3 will be dropped as the only reasonable */ 828/* scenario in which they happen is in extreme circumstances that are most */ 829/* likely to be an indication of an attack rather than normal traffic. */ 830/* A type 3 packet may be sent by an attacked after a type 4 packet. There */ 831/* are two rules that can be used to guard against type 3 packets: L4 */ 832/* headers must always be in a packet that has the offset field set to 0 */ 833/* and no packet is allowed to overlay that where offset = 0. */ 834/* ------------------------------------------------------------------------ */ 835static INLINE int 836ipf_pr_fragment6(fin) 837 fr_info_t *fin; 838{ 839 ipf_main_softc_t *softc = fin->fin_main_soft; 840 struct ip6_frag *frag; 841 842 fin->fin_flx |= FI_FRAG; 843 844 frag = (struct ip6_frag *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_FRAGMENT); 845 if (frag == NULL) { 846 LBUMPD(ipf_stats[fin->fin_out], fr_v6_frag_bad); 847 return IPPROTO_NONE; 848 } 849 850 if ((frag->ip6f_offlg & IP6F_MORE_FRAG) != 0) { 851 /* 852 * Any fragment that isn't the last fragment must have its 853 * length as a multiple of 8. 854 */ 855 if ((fin->fin_plen & 7) != 0) 856 fin->fin_flx |= FI_BAD; 857 } 858 859 fin->fin_fraghdr = frag; 860 fin->fin_id = frag->ip6f_ident; 861 fin->fin_off = ntohs(frag->ip6f_offlg & IP6F_OFF_MASK); 862 if (fin->fin_off != 0) 863 fin->fin_flx |= FI_FRAGBODY; 864 865 /* 866 * Jumbograms aren't handled, so the max. length is 64k 867 */ 868 if ((fin->fin_off << 3) + fin->fin_dlen > 65535) 869 fin->fin_flx |= FI_BAD; 870 871 /* 872 * We don't know where the transport layer header (or whatever is next 873 * is), as it could be behind destination options (amongst others) so 874 * return the fragment header as the type of packet this is. Note that 875 * this effectively disables the fragment cache for > 1 protocol at a 876 * time. 877 */ 878 return frag->ip6f_nxt; 879} 880 881 882/* ------------------------------------------------------------------------ */ 883/* Function: ipf_pr_dstopts6 */ 884/* Returns: int - value of the next header or IPPROTO_NONE if error */ 885/* Parameters: fin(I) - pointer to packet information */ 886/* */ 887/* IPv6 Only */ 888/* This is function checks pending destination options extension header */ 889/* ------------------------------------------------------------------------ */ 890static INLINE int 891ipf_pr_dstopts6(fin) 892 fr_info_t *fin; 893{ 894 ipf_main_softc_t *softc = fin->fin_main_soft; 895 struct ip6_ext *hdr; 896 897 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_DSTOPTS); 898 if (hdr == NULL) { 899 LBUMPD(ipf_stats[fin->fin_out], fr_v6_dst_bad); 900 return IPPROTO_NONE; 901 } 902 return hdr->ip6e_nxt; 903} 904 905 906/* ------------------------------------------------------------------------ */ 907/* Function: ipf_pr_icmp6 */ 908/* Returns: void */ 909/* Parameters: fin(I) - pointer to packet information */ 910/* */ 911/* IPv6 Only */ 912/* This routine is mainly concerned with determining the minimum valid size */ 913/* for an ICMPv6 packet. */ 914/* ------------------------------------------------------------------------ */ 915static INLINE void 916ipf_pr_icmp6(fin) 917 fr_info_t *fin; 918{ 919 int minicmpsz = sizeof(struct icmp6_hdr); 920 struct icmp6_hdr *icmp6; 921 922 if (ipf_pr_pullup(fin, ICMP6ERR_MINPKTLEN - sizeof(ip6_t)) == -1) { 923 ipf_main_softc_t *softc = fin->fin_main_soft; 924 925 LBUMPD(ipf_stats[fin->fin_out], fr_v6_icmp6_pullup); 926 return; 927 } 928 929 if (fin->fin_dlen > 1) { 930 ip6_t *ip6; 931 932 icmp6 = fin->fin_dp; 933 934 fin->fin_data[0] = *(u_short *)icmp6; 935 936 if ((icmp6->icmp6_type & ICMP6_INFOMSG_MASK) != 0) 937 fin->fin_flx |= FI_ICMPQUERY; 938 939 switch (icmp6->icmp6_type) 940 { 941 case ICMP6_ECHO_REPLY : 942 case ICMP6_ECHO_REQUEST : 943 if (fin->fin_dlen >= 6) 944 fin->fin_data[1] = icmp6->icmp6_id; 945 minicmpsz = ICMP6ERR_MINPKTLEN - sizeof(ip6_t); 946 break; 947 948 case ICMP6_DST_UNREACH : 949 case ICMP6_PACKET_TOO_BIG : 950 case ICMP6_TIME_EXCEEDED : 951 case ICMP6_PARAM_PROB : 952 fin->fin_flx |= FI_ICMPERR; 953 minicmpsz = ICMP6ERR_IPICMPHLEN - sizeof(ip6_t); 954 if (fin->fin_plen < ICMP6ERR_IPICMPHLEN) 955 break; 956 957 if (M_LEN(fin->fin_m) < fin->fin_plen) { 958 if (ipf_coalesce(fin) != 1) 959 return; 960 } 961 962 if (ipf_pr_pullup(fin, ICMP6ERR_MINPKTLEN) == -1) 963 return; 964 965 /* 966 * If the destination of this packet doesn't match the 967 * source of the original packet then this packet is 968 * not correct. 969 */ 970 icmp6 = fin->fin_dp; 971 ip6 = (ip6_t *)((char *)icmp6 + ICMPERR_ICMPHLEN); 972 if (IP6_NEQ(&fin->fin_fi.fi_dst, 973 (i6addr_t *)&ip6->ip6_src)) 974 fin->fin_flx |= FI_BAD; 975 break; 976 default : 977 break; 978 } 979 } 980 981 ipf_pr_short6(fin, minicmpsz); 982 if ((fin->fin_flx & (FI_SHORT|FI_BAD)) == 0) { 983 u_char p = fin->fin_p; 984 985 fin->fin_p = IPPROTO_ICMPV6; 986 ipf_checkv6sum(fin); 987 fin->fin_p = p; 988 } 989} 990 991 992/* ------------------------------------------------------------------------ */ 993/* Function: ipf_pr_udp6 */ 994/* Returns: void */ 995/* Parameters: fin(I) - pointer to packet information */ 996/* */ 997/* IPv6 Only */ 998/* Analyse the packet for IPv6/UDP properties. */ 999/* Is not expected to be called for fragmented packets. */ 1000/* ------------------------------------------------------------------------ */ 1001static INLINE void 1002ipf_pr_udp6(fin) 1003 fr_info_t *fin; 1004{ 1005 1006 if (ipf_pr_udpcommon(fin) == 0) { 1007 u_char p = fin->fin_p; 1008 1009 fin->fin_p = IPPROTO_UDP; 1010 ipf_checkv6sum(fin); 1011 fin->fin_p = p; 1012 } 1013} 1014 1015 1016/* ------------------------------------------------------------------------ */ 1017/* Function: ipf_pr_tcp6 */ 1018/* Returns: void */ 1019/* Parameters: fin(I) - pointer to packet information */ 1020/* */ 1021/* IPv6 Only */ 1022/* Analyse the packet for IPv6/TCP properties. */ 1023/* Is not expected to be called for fragmented packets. */ 1024/* ------------------------------------------------------------------------ */ 1025static INLINE void 1026ipf_pr_tcp6(fin) 1027 fr_info_t *fin; 1028{ 1029 1030 if (ipf_pr_tcpcommon(fin) == 0) { 1031 u_char p = fin->fin_p; 1032 1033 fin->fin_p = IPPROTO_TCP; 1034 ipf_checkv6sum(fin); 1035 fin->fin_p = p; 1036 } 1037} 1038 1039 1040/* ------------------------------------------------------------------------ */ 1041/* Function: ipf_pr_esp6 */ 1042/* Returns: void */ 1043/* Parameters: fin(I) - pointer to packet information */ 1044/* */ 1045/* IPv6 Only */ 1046/* Analyse the packet for ESP properties. */ 1047/* The minimum length is taken to be the SPI (32bits) plus a tail (32bits) */ 1048/* even though the newer ESP packets must also have a sequence number that */ 1049/* is 32bits as well, it is not possible(?) to determine the version from a */ 1050/* simple packet header. */ 1051/* ------------------------------------------------------------------------ */ 1052static INLINE void 1053ipf_pr_esp6(fin) 1054 fr_info_t *fin; 1055{ 1056 1057 if ((fin->fin_off == 0) && (ipf_pr_pullup(fin, 8) == -1)) { 1058 ipf_main_softc_t *softc = fin->fin_main_soft; 1059 1060 LBUMPD(ipf_stats[fin->fin_out], fr_v6_esp_pullup); 1061 return; 1062 } 1063} 1064 1065 1066/* ------------------------------------------------------------------------ */ 1067/* Function: ipf_pr_ah6 */ 1068/* Returns: int - value of the next header or IPPROTO_NONE if error */ 1069/* Parameters: fin(I) - pointer to packet information */ 1070/* */ 1071/* IPv6 Only */ 1072/* Analyse the packet for AH properties. */ 1073/* The minimum length is taken to be the combination of all fields in the */ 1074/* header being present and no authentication data (null algorithm used.) */ 1075/* ------------------------------------------------------------------------ */ 1076static INLINE int 1077ipf_pr_ah6(fin) 1078 fr_info_t *fin; 1079{ 1080 authhdr_t *ah; 1081 1082 fin->fin_flx |= FI_AH; 1083 1084 ah = (authhdr_t *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_HOPOPTS); 1085 if (ah == NULL) { 1086 ipf_main_softc_t *softc = fin->fin_main_soft; 1087 1088 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ah_bad); 1089 return IPPROTO_NONE; 1090 } 1091 1092 ipf_pr_short6(fin, sizeof(*ah)); 1093 1094 /* 1095 * No need for another pullup, ipf_pr_ipv6exthdr() will pullup 1096 * enough data to satisfy ah_next (the very first one.) 1097 */ 1098 return ah->ah_next; 1099} 1100 1101 1102/* ------------------------------------------------------------------------ */ 1103/* Function: ipf_pr_gre6 */ 1104/* Returns: void */ 1105/* Parameters: fin(I) - pointer to packet information */ 1106/* */ 1107/* Analyse the packet for GRE properties. */ 1108/* ------------------------------------------------------------------------ */ 1109static INLINE void 1110ipf_pr_gre6(fin) 1111 fr_info_t *fin; 1112{ 1113 grehdr_t *gre; 1114 1115 if (ipf_pr_pullup(fin, sizeof(grehdr_t)) == -1) { 1116 ipf_main_softc_t *softc = fin->fin_main_soft; 1117 1118 LBUMPD(ipf_stats[fin->fin_out], fr_v6_gre_pullup); 1119 return; 1120 } 1121 1122 gre = fin->fin_dp; 1123 if (GRE_REV(gre->gr_flags) == 1) 1124 fin->fin_data[0] = gre->gr_call; 1125} 1126#endif /* USE_INET6 */ 1127 1128 1129/* ------------------------------------------------------------------------ */ 1130/* Function: ipf_pr_pullup */ 1131/* Returns: int - 0 == pullup succeeded, -1 == failure */ 1132/* Parameters: fin(I) - pointer to packet information */ 1133/* plen(I) - length (excluding L3 header) to pullup */ 1134/* */ 1135/* Short inline function to cut down on code duplication to perform a call */ 1136/* to ipf_pullup to ensure there is the required amount of data, */ 1137/* consecutively in the packet buffer. */ 1138/* */ 1139/* This function pulls up 'extra' data at the location of fin_dp. fin_dp */ 1140/* points to the first byte after the complete layer 3 header, which will */ 1141/* include all of the known extension headers for IPv6 or options for IPv4. */ 1142/* */ 1143/* Since fr_pullup() expects the total length of bytes to be pulled up, it */ 1144/* is necessary to add those we can already assume to be pulled up (fin_dp */ 1145/* - fin_ip) to what is passed through. */ 1146/* ------------------------------------------------------------------------ */ 1147int 1148ipf_pr_pullup(fin, plen) 1149 fr_info_t *fin; 1150 int plen; 1151{ 1152 ipf_main_softc_t *softc = fin->fin_main_soft; 1153 1154 if (fin->fin_m != NULL) { 1155 if (fin->fin_dp != NULL) 1156 plen += (char *)fin->fin_dp - 1157 ((char *)fin->fin_ip + fin->fin_hlen); 1158 plen += fin->fin_hlen; 1159 if (M_LEN(fin->fin_m) < plen + fin->fin_ipoff) { 1160#if defined(_KERNEL) 1161 if (ipf_pullup(fin->fin_m, fin, plen) == NULL) { 1162 DT(ipf_pullup_fail); 1163 LBUMP(ipf_stats[fin->fin_out].fr_pull[1]); 1164 return -1; 1165 } 1166 LBUMP(ipf_stats[fin->fin_out].fr_pull[0]); 1167#else 1168 LBUMP(ipf_stats[fin->fin_out].fr_pull[1]); 1169 /* 1170 * Fake ipf_pullup failing 1171 */ 1172 fin->fin_reason = FRB_PULLUP; 1173 *fin->fin_mp = NULL; 1174 fin->fin_m = NULL; 1175 fin->fin_ip = NULL; 1176 return -1; 1177#endif 1178 } 1179 } 1180 return 0; 1181} 1182 1183 1184/* ------------------------------------------------------------------------ */ 1185/* Function: ipf_pr_short */ 1186/* Returns: void */ 1187/* Parameters: fin(I) - pointer to packet information */ 1188/* xmin(I) - minimum header size */ 1189/* */ 1190/* Check if a packet is "short" as defined by xmin. The rule we are */ 1191/* applying here is that the packet must not be fragmented within the layer */ 1192/* 4 header. That is, it must not be a fragment that has its offset set to */ 1193/* start within the layer 4 header (hdrmin) or if it is at offset 0, the */ 1194/* entire layer 4 header must be present (min). */ 1195/* ------------------------------------------------------------------------ */ 1196static INLINE void 1197ipf_pr_short(fin, xmin) 1198 fr_info_t *fin; 1199 int xmin; 1200{ 1201 1202 if (fin->fin_off == 0) { 1203 if (fin->fin_dlen < xmin) 1204 fin->fin_flx |= FI_SHORT; 1205 } else if (fin->fin_off < xmin) { 1206 fin->fin_flx |= FI_SHORT; 1207 } 1208} 1209 1210 1211/* ------------------------------------------------------------------------ */ 1212/* Function: ipf_pr_icmp */ 1213/* Returns: void */ 1214/* Parameters: fin(I) - pointer to packet information */ 1215/* */ 1216/* IPv4 Only */ 1217/* Do a sanity check on the packet for ICMP (v4). In nearly all cases, */ 1218/* except extrememly bad packets, both type and code will be present. */ 1219/* The expected minimum size of an ICMP packet is very much dependent on */ 1220/* the type of it. */ 1221/* */ 1222/* XXX - other ICMP sanity checks? */ 1223/* ------------------------------------------------------------------------ */ 1224static INLINE void 1225ipf_pr_icmp(fin) 1226 fr_info_t *fin; 1227{ 1228 ipf_main_softc_t *softc = fin->fin_main_soft; 1229 int minicmpsz = sizeof(struct icmp); 1230 icmphdr_t *icmp; 1231 ip_t *oip; 1232 1233 ipf_pr_short(fin, ICMPERR_ICMPHLEN); 1234 1235 if (fin->fin_off != 0) { 1236 LBUMPD(ipf_stats[fin->fin_out], fr_v4_icmp_frag); 1237 return; 1238 } 1239 1240 if (ipf_pr_pullup(fin, ICMPERR_ICMPHLEN) == -1) { 1241 LBUMPD(ipf_stats[fin->fin_out], fr_v4_icmp_pullup); 1242 return; 1243 } 1244 1245 icmp = fin->fin_dp; 1246 1247 fin->fin_data[0] = *(u_short *)icmp; 1248 fin->fin_data[1] = icmp->icmp_id; 1249 1250 switch (icmp->icmp_type) 1251 { 1252 case ICMP_ECHOREPLY : 1253 case ICMP_ECHO : 1254 /* Router discovery messaes - RFC 1256 */ 1255 case ICMP_ROUTERADVERT : 1256 case ICMP_ROUTERSOLICIT : 1257 fin->fin_flx |= FI_ICMPQUERY; 1258 minicmpsz = ICMP_MINLEN; 1259 break; 1260 /* 1261 * type(1) + code(1) + cksum(2) + id(2) seq(2) + 1262 * 3 * timestamp(3 * 4) 1263 */ 1264 case ICMP_TSTAMP : 1265 case ICMP_TSTAMPREPLY : 1266 fin->fin_flx |= FI_ICMPQUERY; 1267 minicmpsz = 20; 1268 break; 1269 /* 1270 * type(1) + code(1) + cksum(2) + id(2) seq(2) + 1271 * mask(4) 1272 */ 1273 case ICMP_IREQ : 1274 case ICMP_IREQREPLY : 1275 case ICMP_MASKREQ : 1276 case ICMP_MASKREPLY : 1277 fin->fin_flx |= FI_ICMPQUERY; 1278 minicmpsz = 12; 1279 break; 1280 /* 1281 * type(1) + code(1) + cksum(2) + id(2) seq(2) + ip(20+) 1282 */ 1283 case ICMP_UNREACH : 1284#ifdef icmp_nextmtu 1285 if (icmp->icmp_code == ICMP_UNREACH_NEEDFRAG) { 1286 if (icmp->icmp_nextmtu < softc->ipf_icmpminfragmtu) 1287 fin->fin_flx |= FI_BAD; 1288 } 1289#endif 1290 case ICMP_SOURCEQUENCH : 1291 case ICMP_REDIRECT : 1292 case ICMP_TIMXCEED : 1293 case ICMP_PARAMPROB : 1294 fin->fin_flx |= FI_ICMPERR; 1295 if (ipf_coalesce(fin) != 1) { 1296 LBUMPD(ipf_stats[fin->fin_out], fr_icmp_coalesce); 1297 return; 1298 } 1299 1300 /* 1301 * ICMP error packets should not be generated for IP 1302 * packets that are a fragment that isn't the first 1303 * fragment. 1304 */ 1305 oip = (ip_t *)((char *)fin->fin_dp + ICMPERR_ICMPHLEN); 1306 if ((ntohs(oip->ip_off) & IP_OFFMASK) != 0) 1307 fin->fin_flx |= FI_BAD; 1308 1309 /* 1310 * If the destination of this packet doesn't match the 1311 * source of the original packet then this packet is 1312 * not correct. 1313 */ 1314 if (oip->ip_src.s_addr != fin->fin_daddr) 1315 fin->fin_flx |= FI_BAD; 1316 break; 1317 default : 1318 break; 1319 } 1320 1321 ipf_pr_short(fin, minicmpsz); 1322 1323 ipf_checkv4sum(fin); 1324} 1325 1326 1327/* ------------------------------------------------------------------------ */ 1328/* Function: ipf_pr_tcpcommon */ 1329/* Returns: int - 0 = header ok, 1 = bad packet, -1 = buffer error */ 1330/* Parameters: fin(I) - pointer to packet information */ 1331/* */ 1332/* TCP header sanity checking. Look for bad combinations of TCP flags, */ 1333/* and make some checks with how they interact with other fields. */ 1334/* If compiled with IPFILTER_CKSUM, check to see if the TCP checksum is */ 1335/* valid and mark the packet as bad if not. */ 1336/* ------------------------------------------------------------------------ */ 1337static INLINE int 1338ipf_pr_tcpcommon(fin) 1339 fr_info_t *fin; 1340{ 1341 ipf_main_softc_t *softc = fin->fin_main_soft; 1342 int flags, tlen; 1343 tcphdr_t *tcp; 1344 1345 fin->fin_flx |= FI_TCPUDP; 1346 if (fin->fin_off != 0) { 1347 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_frag); 1348 return 0; 1349 } 1350 1351 if (ipf_pr_pullup(fin, sizeof(*tcp)) == -1) { 1352 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_pullup); 1353 return -1; 1354 } 1355 1356 tcp = fin->fin_dp; 1357 if (fin->fin_dlen > 3) { 1358 fin->fin_sport = ntohs(tcp->th_sport); 1359 fin->fin_dport = ntohs(tcp->th_dport); 1360 } 1361 1362 if ((fin->fin_flx & FI_SHORT) != 0) { 1363 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_short); 1364 return 1; 1365 } 1366 1367 /* 1368 * Use of the TCP data offset *must* result in a value that is at 1369 * least the same size as the TCP header. 1370 */ 1371 tlen = TCP_OFF(tcp) << 2; 1372 if (tlen < sizeof(tcphdr_t)) { 1373 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_small); 1374 fin->fin_flx |= FI_BAD; 1375 return 1; 1376 } 1377 1378 flags = tcp->th_flags; 1379 fin->fin_tcpf = tcp->th_flags; 1380 1381 /* 1382 * If the urgent flag is set, then the urgent pointer must 1383 * also be set and vice versa. Good TCP packets do not have 1384 * just one of these set. 1385 */ 1386 if ((flags & TH_URG) != 0 && (tcp->th_urp == 0)) { 1387 fin->fin_flx |= FI_BAD; 1388#if 0 1389 } else if ((flags & TH_URG) == 0 && (tcp->th_urp != 0)) { 1390 /* 1391 * Ignore this case (#if 0) as it shows up in "real" 1392 * traffic with bogus values in the urgent pointer field. 1393 */ 1394 fin->fin_flx |= FI_BAD; 1395#endif 1396 } else if (((flags & (TH_SYN|TH_FIN)) != 0) && 1397 ((flags & (TH_RST|TH_ACK)) == TH_RST)) { 1398 /* TH_FIN|TH_RST|TH_ACK seems to appear "naturally" */ 1399 fin->fin_flx |= FI_BAD; 1400#if 1 1401 } else if (((flags & TH_SYN) != 0) && 1402 ((flags & (TH_URG|TH_PUSH)) != 0)) { 1403 /* 1404 * SYN with URG and PUSH set is not for normal TCP but it is 1405 * possible(?) with T/TCP...but who uses T/TCP? 1406 */ 1407 fin->fin_flx |= FI_BAD; 1408#endif 1409 } else if (!(flags & TH_ACK)) { 1410 /* 1411 * If the ack bit isn't set, then either the SYN or 1412 * RST bit must be set. If the SYN bit is set, then 1413 * we expect the ACK field to be 0. If the ACK is 1414 * not set and if URG, PSH or FIN are set, consdier 1415 * that to indicate a bad TCP packet. 1416 */ 1417 if ((flags == TH_SYN) && (tcp->th_ack != 0)) { 1418 /* 1419 * Cisco PIX sets the ACK field to a random value. 1420 * In light of this, do not set FI_BAD until a patch 1421 * is available from Cisco to ensure that 1422 * interoperability between existing systems is 1423 * achieved. 1424 */ 1425 /*fin->fin_flx |= FI_BAD*/; 1426 } else if (!(flags & (TH_RST|TH_SYN))) { 1427 fin->fin_flx |= FI_BAD; 1428 } else if ((flags & (TH_URG|TH_PUSH|TH_FIN)) != 0) { 1429 fin->fin_flx |= FI_BAD; 1430 } 1431 } 1432 if (fin->fin_flx & FI_BAD) { 1433 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_bad_flags); 1434 return 1; 1435 } 1436 1437 /* 1438 * At this point, it's not exactly clear what is to be gained by 1439 * marking up which TCP options are and are not present. The one we 1440 * are most interested in is the TCP window scale. This is only in 1441 * a SYN packet [RFC1323] so we don't need this here...? 1442 * Now if we were to analyse the header for passive fingerprinting, 1443 * then that might add some weight to adding this... 1444 */ 1445 if (tlen == sizeof(tcphdr_t)) { 1446 return 0; 1447 } 1448 1449 if (ipf_pr_pullup(fin, tlen) == -1) { 1450 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_pullup); 1451 return -1; 1452 } 1453 1454#if 0 1455 tcp = fin->fin_dp; 1456 ip = fin->fin_ip; 1457 s = (u_char *)(tcp + 1); 1458 off = IP_HL(ip) << 2; 1459# ifdef _KERNEL 1460 if (fin->fin_mp != NULL) { 1461 mb_t *m = *fin->fin_mp; 1462 1463 if (off + tlen > M_LEN(m)) 1464 return; 1465 } 1466# endif 1467 for (tlen -= (int)sizeof(*tcp); tlen > 0; ) { 1468 opt = *s; 1469 if (opt == '\0') 1470 break; 1471 else if (opt == TCPOPT_NOP) 1472 ol = 1; 1473 else { 1474 if (tlen < 2) 1475 break; 1476 ol = (int)*(s + 1); 1477 if (ol < 2 || ol > tlen) 1478 break; 1479 } 1480 1481 for (i = 9, mv = 4; mv >= 0; ) { 1482 op = ipopts + i; 1483 if (opt == (u_char)op->ol_val) { 1484 optmsk |= op->ol_bit; 1485 break; 1486 } 1487 } 1488 tlen -= ol; 1489 s += ol; 1490 } 1491#endif /* 0 */ 1492 1493 return 0; 1494} 1495 1496 1497 1498/* ------------------------------------------------------------------------ */ 1499/* Function: ipf_pr_udpcommon */ 1500/* Returns: int - 0 = header ok, 1 = bad packet */ 1501/* Parameters: fin(I) - pointer to packet information */ 1502/* */ 1503/* Extract the UDP source and destination ports, if present. If compiled */ 1504/* with IPFILTER_CKSUM, check to see if the UDP checksum is valid. */ 1505/* ------------------------------------------------------------------------ */ 1506static INLINE int 1507ipf_pr_udpcommon(fin) 1508 fr_info_t *fin; 1509{ 1510 udphdr_t *udp; 1511 1512 fin->fin_flx |= FI_TCPUDP; 1513 1514 if (!fin->fin_off && (fin->fin_dlen > 3)) { 1515 if (ipf_pr_pullup(fin, sizeof(*udp)) == -1) { 1516 ipf_main_softc_t *softc = fin->fin_main_soft; 1517 1518 fin->fin_flx |= FI_SHORT; 1519 LBUMPD(ipf_stats[fin->fin_out], fr_udp_pullup); 1520 return 1; 1521 } 1522 1523 udp = fin->fin_dp; 1524 1525 fin->fin_sport = ntohs(udp->uh_sport); 1526 fin->fin_dport = ntohs(udp->uh_dport); 1527 } 1528 1529 return 0; 1530} 1531 1532 1533/* ------------------------------------------------------------------------ */ 1534/* Function: ipf_pr_tcp */ 1535/* Returns: void */ 1536/* Parameters: fin(I) - pointer to packet information */ 1537/* */ 1538/* IPv4 Only */ 1539/* Analyse the packet for IPv4/TCP properties. */ 1540/* ------------------------------------------------------------------------ */ 1541static INLINE void 1542ipf_pr_tcp(fin) 1543 fr_info_t *fin; 1544{ 1545 1546 ipf_pr_short(fin, sizeof(tcphdr_t)); 1547 1548 if (ipf_pr_tcpcommon(fin) == 0) 1549 ipf_checkv4sum(fin); 1550} 1551 1552 1553/* ------------------------------------------------------------------------ */ 1554/* Function: ipf_pr_udp */ 1555/* Returns: void */ 1556/* Parameters: fin(I) - pointer to packet information */ 1557/* */ 1558/* IPv4 Only */ 1559/* Analyse the packet for IPv4/UDP properties. */ 1560/* ------------------------------------------------------------------------ */ 1561static INLINE void 1562ipf_pr_udp(fin) 1563 fr_info_t *fin; 1564{ 1565 1566 ipf_pr_short(fin, sizeof(udphdr_t)); 1567 1568 if (ipf_pr_udpcommon(fin) == 0) 1569 ipf_checkv4sum(fin); 1570} 1571 1572 1573/* ------------------------------------------------------------------------ */ 1574/* Function: ipf_pr_esp */ 1575/* Returns: void */ 1576/* Parameters: fin(I) - pointer to packet information */ 1577/* */ 1578/* Analyse the packet for ESP properties. */ 1579/* The minimum length is taken to be the SPI (32bits) plus a tail (32bits) */ 1580/* even though the newer ESP packets must also have a sequence number that */ 1581/* is 32bits as well, it is not possible(?) to determine the version from a */ 1582/* simple packet header. */ 1583/* ------------------------------------------------------------------------ */ 1584static INLINE void 1585ipf_pr_esp(fin) 1586 fr_info_t *fin; 1587{ 1588 1589 if (fin->fin_off == 0) { 1590 ipf_pr_short(fin, 8); 1591 if (ipf_pr_pullup(fin, 8) == -1) { 1592 ipf_main_softc_t *softc = fin->fin_main_soft; 1593 1594 LBUMPD(ipf_stats[fin->fin_out], fr_v4_esp_pullup); 1595 } 1596 } 1597} 1598 1599 1600/* ------------------------------------------------------------------------ */ 1601/* Function: ipf_pr_ah */ 1602/* Returns: int - value of the next header or IPPROTO_NONE if error */ 1603/* Parameters: fin(I) - pointer to packet information */ 1604/* */ 1605/* Analyse the packet for AH properties. */ 1606/* The minimum length is taken to be the combination of all fields in the */ 1607/* header being present and no authentication data (null algorithm used.) */ 1608/* ------------------------------------------------------------------------ */ 1609static INLINE int 1610ipf_pr_ah(fin) 1611 fr_info_t *fin; 1612{ 1613 ipf_main_softc_t *softc = fin->fin_main_soft; 1614 authhdr_t *ah; 1615 int len; 1616 1617 fin->fin_flx |= FI_AH; 1618 ipf_pr_short(fin, sizeof(*ah)); 1619 1620 if (((fin->fin_flx & FI_SHORT) != 0) || (fin->fin_off != 0)) { 1621 LBUMPD(ipf_stats[fin->fin_out], fr_v4_ah_bad); 1622 return IPPROTO_NONE; 1623 } 1624 1625 if (ipf_pr_pullup(fin, sizeof(*ah)) == -1) { 1626 DT(fr_v4_ah_pullup_1); 1627 LBUMP(ipf_stats[fin->fin_out].fr_v4_ah_pullup); 1628 return IPPROTO_NONE; 1629 } 1630 1631 ah = (authhdr_t *)fin->fin_dp; 1632 1633 len = (ah->ah_plen + 2) << 2; 1634 ipf_pr_short(fin, len); 1635 if (ipf_pr_pullup(fin, len) == -1) { 1636 DT(fr_v4_ah_pullup_2); 1637 LBUMP(ipf_stats[fin->fin_out].fr_v4_ah_pullup); 1638 return IPPROTO_NONE; 1639 } 1640 1641 /* 1642 * Adjust fin_dp and fin_dlen for skipping over the authentication 1643 * header. 1644 */ 1645 fin->fin_dp = (char *)fin->fin_dp + len; 1646 fin->fin_dlen -= len; 1647 return ah->ah_next; 1648} 1649 1650 1651/* ------------------------------------------------------------------------ */ 1652/* Function: ipf_pr_gre */ 1653/* Returns: void */ 1654/* Parameters: fin(I) - pointer to packet information */ 1655/* */ 1656/* Analyse the packet for GRE properties. */ 1657/* ------------------------------------------------------------------------ */ 1658static INLINE void 1659ipf_pr_gre(fin) 1660 fr_info_t *fin; 1661{ 1662 ipf_main_softc_t *softc = fin->fin_main_soft; 1663 grehdr_t *gre; 1664 1665 ipf_pr_short(fin, sizeof(grehdr_t)); 1666 1667 if (fin->fin_off != 0) { 1668 LBUMPD(ipf_stats[fin->fin_out], fr_v4_gre_frag); 1669 return; 1670 } 1671 1672 if (ipf_pr_pullup(fin, sizeof(grehdr_t)) == -1) { 1673 LBUMPD(ipf_stats[fin->fin_out], fr_v4_gre_pullup); 1674 return; 1675 } 1676 1677 gre = fin->fin_dp; 1678 if (GRE_REV(gre->gr_flags) == 1) 1679 fin->fin_data[0] = gre->gr_call; 1680} 1681 1682 1683/* ------------------------------------------------------------------------ */ 1684/* Function: ipf_pr_ipv4hdr */ 1685/* Returns: void */ 1686/* Parameters: fin(I) - pointer to packet information */ 1687/* */ 1688/* IPv4 Only */ 1689/* Analyze the IPv4 header and set fields in the fr_info_t structure. */ 1690/* Check all options present and flag their presence if any exist. */ 1691/* ------------------------------------------------------------------------ */ 1692static INLINE void 1693ipf_pr_ipv4hdr(fin) 1694 fr_info_t *fin; 1695{ 1696 u_short optmsk = 0, secmsk = 0, auth = 0; 1697 int hlen, ol, mv, p, i; 1698 const struct optlist *op; 1699 u_char *s, opt; 1700 u_short off; 1701 fr_ip_t *fi; 1702 ip_t *ip; 1703 1704 fi = &fin->fin_fi; 1705 hlen = fin->fin_hlen; 1706 1707 ip = fin->fin_ip; 1708 p = ip->ip_p; 1709 fi->fi_p = p; 1710 fin->fin_crc = p; 1711 fi->fi_tos = ip->ip_tos; 1712 fin->fin_id = ip->ip_id; 1713 off = ntohs(ip->ip_off); 1714 1715 /* Get both TTL and protocol */ 1716 fi->fi_p = ip->ip_p; 1717 fi->fi_ttl = ip->ip_ttl; 1718 1719 /* Zero out bits not used in IPv6 address */ 1720 fi->fi_src.i6[1] = 0; 1721 fi->fi_src.i6[2] = 0; 1722 fi->fi_src.i6[3] = 0; 1723 fi->fi_dst.i6[1] = 0; 1724 fi->fi_dst.i6[2] = 0; 1725 fi->fi_dst.i6[3] = 0; 1726 1727 fi->fi_saddr = ip->ip_src.s_addr; 1728 fin->fin_crc += fi->fi_saddr; 1729 fi->fi_daddr = ip->ip_dst.s_addr; 1730 fin->fin_crc += fi->fi_daddr; 1731 if (IN_CLASSD(ntohl(fi->fi_daddr))) 1732 fin->fin_flx |= FI_MULTICAST|FI_MBCAST; 1733 1734 /* 1735 * set packet attribute flags based on the offset and 1736 * calculate the byte offset that it represents. 1737 */ 1738 off &= IP_MF|IP_OFFMASK; 1739 if (off != 0) { 1740 int morefrag = off & IP_MF; 1741 1742 fi->fi_flx |= FI_FRAG; 1743 off &= IP_OFFMASK; 1744 if (off != 0) { 1745 fin->fin_flx |= FI_FRAGBODY; 1746 off <<= 3; 1747 if ((off + fin->fin_dlen > 65535) || 1748 (fin->fin_dlen == 0) || 1749 ((morefrag != 0) && ((fin->fin_dlen & 7) != 0))) { 1750 /* 1751 * The length of the packet, starting at its 1752 * offset cannot exceed 65535 (0xffff) as the 1753 * length of an IP packet is only 16 bits. 1754 * 1755 * Any fragment that isn't the last fragment 1756 * must have a length greater than 0 and it 1757 * must be an even multiple of 8. 1758 */ 1759 fi->fi_flx |= FI_BAD; 1760 } 1761 } 1762 } 1763 fin->fin_off = off; 1764 1765 /* 1766 * Call per-protocol setup and checking 1767 */ 1768 if (p == IPPROTO_AH) { 1769 /* 1770 * Treat AH differently because we expect there to be another 1771 * layer 4 header after it. 1772 */ 1773 p = ipf_pr_ah(fin); 1774 } 1775 1776 switch (p) 1777 { 1778 case IPPROTO_UDP : 1779 ipf_pr_udp(fin); 1780 break; 1781 case IPPROTO_TCP : 1782 ipf_pr_tcp(fin); 1783 break; 1784 case IPPROTO_ICMP : 1785 ipf_pr_icmp(fin); 1786 break; 1787 case IPPROTO_ESP : 1788 ipf_pr_esp(fin); 1789 break; 1790 case IPPROTO_GRE : 1791 ipf_pr_gre(fin); 1792 break; 1793 } 1794 1795 ip = fin->fin_ip; 1796 if (ip == NULL) 1797 return; 1798 1799 /* 1800 * If it is a standard IP header (no options), set the flag fields 1801 * which relate to options to 0. 1802 */ 1803 if (hlen == sizeof(*ip)) { 1804 fi->fi_optmsk = 0; 1805 fi->fi_secmsk = 0; 1806 fi->fi_auth = 0; 1807 return; 1808 } 1809 1810 /* 1811 * So the IP header has some IP options attached. Walk the entire 1812 * list of options present with this packet and set flags to indicate 1813 * which ones are here and which ones are not. For the somewhat out 1814 * of date and obscure security classification options, set a flag to 1815 * represent which classification is present. 1816 */ 1817 fi->fi_flx |= FI_OPTIONS; 1818 1819 for (s = (u_char *)(ip + 1), hlen -= (int)sizeof(*ip); hlen > 0; ) { 1820 opt = *s; 1821 if (opt == '\0') 1822 break; 1823 else if (opt == IPOPT_NOP) 1824 ol = 1; 1825 else { 1826 if (hlen < 2) 1827 break; 1828 ol = (int)*(s + 1); 1829 if (ol < 2 || ol > hlen) 1830 break; 1831 } 1832 for (i = 9, mv = 4; mv >= 0; ) { 1833 op = ipopts + i; 1834 1835 if ((opt == (u_char)op->ol_val) && (ol > 4)) { 1836 u_32_t doi; 1837 1838 switch (opt) 1839 { 1840 case IPOPT_SECURITY : 1841 if (optmsk & op->ol_bit) { 1842 fin->fin_flx |= FI_BAD; 1843 } else { 1844 doi = ipf_checkripso(s); 1845 secmsk = doi >> 16; 1846 auth = doi & 0xffff; 1847 } 1848 break; 1849 1850 case IPOPT_CIPSO : 1851 1852 if (optmsk & op->ol_bit) { 1853 fin->fin_flx |= FI_BAD; 1854 } else { 1855 doi = ipf_checkcipso(fin, 1856 s, ol); 1857 secmsk = doi >> 16; 1858 auth = doi & 0xffff; 1859 } 1860 break; 1861 } 1862 optmsk |= op->ol_bit; 1863 } 1864 1865 if (opt < op->ol_val) 1866 i -= mv; 1867 else 1868 i += mv; 1869 mv--; 1870 } 1871 hlen -= ol; 1872 s += ol; 1873 } 1874 1875 /* 1876 * 1877 */ 1878 if (auth && !(auth & 0x0100)) 1879 auth &= 0xff00; 1880 fi->fi_optmsk = optmsk; 1881 fi->fi_secmsk = secmsk; 1882 fi->fi_auth = auth; 1883} 1884 1885 1886/* ------------------------------------------------------------------------ */ 1887/* Function: ipf_checkripso */ 1888/* Returns: void */ 1889/* Parameters: s(I) - pointer to start of RIPSO option */ 1890/* */ 1891/* ------------------------------------------------------------------------ */ 1892static u_32_t 1893ipf_checkripso(s) 1894 u_char *s; 1895{ 1896 const struct optlist *sp; 1897 u_short secmsk = 0, auth = 0; 1898 u_char sec; 1899 int j, m; 1900 1901 sec = *(s + 2); /* classification */ 1902 for (j = 3, m = 2; m >= 0; ) { 1903 sp = secopt + j; 1904 if (sec == sp->ol_val) { 1905 secmsk |= sp->ol_bit; 1906 auth = *(s + 3); 1907 auth *= 256; 1908 auth += *(s + 4); 1909 break; 1910 } 1911 if (sec < sp->ol_val) 1912 j -= m; 1913 else 1914 j += m; 1915 m--; 1916 } 1917 1918 return (secmsk << 16) | auth; 1919} 1920 1921 1922/* ------------------------------------------------------------------------ */ 1923/* Function: ipf_checkcipso */ 1924/* Returns: u_32_t - 0 = failure, else the doi from the header */ 1925/* Parameters: fin(IO) - pointer to packet information */ 1926/* s(I) - pointer to start of CIPSO option */ 1927/* ol(I) - length of CIPSO option field */ 1928/* */ 1929/* This function returns the domain of integrity (DOI) field from the CIPSO */ 1930/* header and returns that whilst also storing the highest sensitivity */ 1931/* value found in the fr_info_t structure. */ 1932/* */ 1933/* No attempt is made to extract the category bitmaps as these are defined */ 1934/* by the user (rather than the protocol) and can be rather numerous on the */ 1935/* end nodes. */ 1936/* ------------------------------------------------------------------------ */ 1937static u_32_t 1938ipf_checkcipso(fin, s, ol) 1939 fr_info_t *fin; 1940 u_char *s; 1941 int ol; 1942{ 1943 ipf_main_softc_t *softc = fin->fin_main_soft; 1944 fr_ip_t *fi; 1945 u_32_t doi; 1946 u_char *t, tag, tlen, sensitivity; 1947 int len; 1948 1949 if (ol < 6 || ol > 40) { 1950 LBUMPD(ipf_stats[fin->fin_out], fr_v4_cipso_bad); 1951 fin->fin_flx |= FI_BAD; 1952 return 0; 1953 } 1954 1955 fi = &fin->fin_fi; 1956 fi->fi_sensitivity = 0; 1957 /* 1958 * The DOI field MUST be there. 1959 */ 1960 bcopy(s + 2, &doi, sizeof(doi)); 1961 1962 t = (u_char *)s + 6; 1963 for (len = ol - 6; len >= 2; len -= tlen, t+= tlen) { 1964 tag = *t; 1965 tlen = *(t + 1); 1966 if (tlen > len || tlen < 4 || tlen > 34) { 1967 LBUMPD(ipf_stats[fin->fin_out], fr_v4_cipso_tlen); 1968 fin->fin_flx |= FI_BAD; 1969 return 0; 1970 } 1971 1972 sensitivity = 0; 1973 /* 1974 * Tag numbers 0, 1, 2, 5 are laid out in the CIPSO Internet 1975 * draft (16 July 1992) that has expired. 1976 */ 1977 if (tag == 0) { 1978 fin->fin_flx |= FI_BAD; 1979 continue; 1980 } else if (tag == 1) { 1981 if (*(t + 2) != 0) { 1982 fin->fin_flx |= FI_BAD; 1983 continue; 1984 } 1985 sensitivity = *(t + 3); 1986 /* Category bitmap for categories 0-239 */ 1987 1988 } else if (tag == 4) { 1989 if (*(t + 2) != 0) { 1990 fin->fin_flx |= FI_BAD; 1991 continue; 1992 } 1993 sensitivity = *(t + 3); 1994 /* Enumerated categories, 16bits each, upto 15 */ 1995 1996 } else if (tag == 5) { 1997 if (*(t + 2) != 0) { 1998 fin->fin_flx |= FI_BAD; 1999 continue; 2000 } 2001 sensitivity = *(t + 3); 2002 /* Range of categories (2*16bits), up to 7 pairs */ 2003 2004 } else if (tag > 127) { 2005 /* Custom defined DOI */ 2006 ; 2007 } else { 2008 fin->fin_flx |= FI_BAD; 2009 continue; 2010 } 2011 2012 if (sensitivity > fi->fi_sensitivity) 2013 fi->fi_sensitivity = sensitivity; 2014 } 2015 2016 return doi; 2017} 2018 2019 2020/* ------------------------------------------------------------------------ */ 2021/* Function: ipf_makefrip */ 2022/* Returns: int - 0 == packet ok, -1 == packet freed */ 2023/* Parameters: hlen(I) - length of IP packet header */ 2024/* ip(I) - pointer to the IP header */ 2025/* fin(IO) - pointer to packet information */ 2026/* */ 2027/* Compact the IP header into a structure which contains just the info. */ 2028/* which is useful for comparing IP headers with and store this information */ 2029/* in the fr_info_t structure pointer to by fin. At present, it is assumed */ 2030/* this function will be called with either an IPv4 or IPv6 packet. */ 2031/* ------------------------------------------------------------------------ */ 2032int 2033ipf_makefrip(hlen, ip, fin) 2034 int hlen; 2035 ip_t *ip; 2036 fr_info_t *fin; 2037{ 2038 ipf_main_softc_t *softc = fin->fin_main_soft; 2039 int v; 2040 2041 fin->fin_depth = 0; 2042 fin->fin_hlen = (u_short)hlen; 2043 fin->fin_ip = ip; 2044 fin->fin_rule = 0xffffffff; 2045 fin->fin_group[0] = -1; 2046 fin->fin_group[1] = '\0'; 2047 fin->fin_dp = (char *)ip + hlen; 2048 2049 v = fin->fin_v; 2050 if (v == 4) { 2051 fin->fin_plen = ntohs(ip->ip_len); 2052 fin->fin_dlen = fin->fin_plen - hlen; 2053 ipf_pr_ipv4hdr(fin); 2054#ifdef USE_INET6 2055 } else if (v == 6) { 2056 fin->fin_plen = ntohs(((ip6_t *)ip)->ip6_plen); 2057 fin->fin_dlen = fin->fin_plen; 2058 fin->fin_plen += hlen; 2059 2060 ipf_pr_ipv6hdr(fin); 2061#endif 2062 } 2063 if (fin->fin_ip == NULL) { 2064 LBUMP(ipf_stats[fin->fin_out].fr_ip_freed); 2065 return -1; 2066 } 2067 return 0; 2068} 2069 2070 2071/* ------------------------------------------------------------------------ */ 2072/* Function: ipf_portcheck */ 2073/* Returns: int - 1 == port matched, 0 == port match failed */ 2074/* Parameters: frp(I) - pointer to port check `expression' */ 2075/* pop(I) - port number to evaluate */ 2076/* */ 2077/* Perform a comparison of a port number against some other(s), using a */ 2078/* structure with compare information stored in it. */ 2079/* ------------------------------------------------------------------------ */ 2080static INLINE int 2081ipf_portcheck(frp, pop) 2082 frpcmp_t *frp; 2083 u_32_t pop; 2084{ 2085 int err = 1; 2086 u_32_t po; 2087 2088 po = frp->frp_port; 2089 2090 /* 2091 * Do opposite test to that required and continue if that succeeds. 2092 */ 2093 switch (frp->frp_cmp) 2094 { 2095 case FR_EQUAL : 2096 if (pop != po) /* EQUAL */ 2097 err = 0; 2098 break; 2099 case FR_NEQUAL : 2100 if (pop == po) /* NOTEQUAL */ 2101 err = 0; 2102 break; 2103 case FR_LESST : 2104 if (pop >= po) /* LESSTHAN */ 2105 err = 0; 2106 break; 2107 case FR_GREATERT : 2108 if (pop <= po) /* GREATERTHAN */ 2109 err = 0; 2110 break; 2111 case FR_LESSTE : 2112 if (pop > po) /* LT or EQ */ 2113 err = 0; 2114 break; 2115 case FR_GREATERTE : 2116 if (pop < po) /* GT or EQ */ 2117 err = 0; 2118 break; 2119 case FR_OUTRANGE : 2120 if (pop >= po && pop <= frp->frp_top) /* Out of range */ 2121 err = 0; 2122 break; 2123 case FR_INRANGE : 2124 if (pop <= po || pop >= frp->frp_top) /* In range */ 2125 err = 0; 2126 break; 2127 case FR_INCRANGE : 2128 if (pop < po || pop > frp->frp_top) /* Inclusive range */ 2129 err = 0; 2130 break; 2131 default : 2132 break; 2133 } 2134 return err; 2135} 2136 2137 2138/* ------------------------------------------------------------------------ */ 2139/* Function: ipf_tcpudpchk */ 2140/* Returns: int - 1 == protocol matched, 0 == check failed */ 2141/* Parameters: fda(I) - pointer to packet information */ 2142/* ft(I) - pointer to structure with comparison data */ 2143/* */ 2144/* Compares the current pcket (assuming it is TCP/UDP) information with a */ 2145/* structure containing information that we want to match against. */ 2146/* ------------------------------------------------------------------------ */ 2147int 2148ipf_tcpudpchk(fi, ft) 2149 fr_ip_t *fi; 2150 frtuc_t *ft; 2151{ 2152 int err = 1; 2153 2154 /* 2155 * Both ports should *always* be in the first fragment. 2156 * So far, I cannot find any cases where they can not be. 2157 * 2158 * compare destination ports 2159 */ 2160 if (ft->ftu_dcmp) 2161 err = ipf_portcheck(&ft->ftu_dst, fi->fi_ports[1]); 2162 2163 /* 2164 * compare source ports 2165 */ 2166 if (err && ft->ftu_scmp) 2167 err = ipf_portcheck(&ft->ftu_src, fi->fi_ports[0]); 2168 2169 /* 2170 * If we don't have all the TCP/UDP header, then how can we 2171 * expect to do any sort of match on it ? If we were looking for 2172 * TCP flags, then NO match. If not, then match (which should 2173 * satisfy the "short" class too). 2174 */ 2175 if (err && (fi->fi_p == IPPROTO_TCP)) { 2176 if (fi->fi_flx & FI_SHORT) 2177 return !(ft->ftu_tcpf | ft->ftu_tcpfm); 2178 /* 2179 * Match the flags ? If not, abort this match. 2180 */ 2181 if (ft->ftu_tcpfm && 2182 ft->ftu_tcpf != (fi->fi_tcpf & ft->ftu_tcpfm)) { 2183 FR_DEBUG(("f. %#x & %#x != %#x\n", fi->fi_tcpf, 2184 ft->ftu_tcpfm, ft->ftu_tcpf)); 2185 err = 0; 2186 } 2187 } 2188 return err; 2189} 2190 2191 2192/* ------------------------------------------------------------------------ */ 2193/* Function: ipf_check_ipf */ 2194/* Returns: int - 0 == match, else no match */ 2195/* Parameters: fin(I) - pointer to packet information */ 2196/* fr(I) - pointer to filter rule */ 2197/* portcmp(I) - flag indicating whether to attempt matching on */ 2198/* TCP/UDP port data. */ 2199/* */ 2200/* Check to see if a packet matches an IPFilter rule. Checks of addresses, */ 2201/* port numbers, etc, for "standard" IPFilter rules are all orchestrated in */ 2202/* this function. */ 2203/* ------------------------------------------------------------------------ */ 2204static INLINE int 2205ipf_check_ipf(fin, fr, portcmp) 2206 fr_info_t *fin; 2207 frentry_t *fr; 2208 int portcmp; 2209{ 2210 u_32_t *ld, *lm, *lip; 2211 fripf_t *fri; 2212 fr_ip_t *fi; 2213 int i; 2214 2215 fi = &fin->fin_fi; 2216 fri = fr->fr_ipf; 2217 lip = (u_32_t *)fi; 2218 lm = (u_32_t *)&fri->fri_mip; 2219 ld = (u_32_t *)&fri->fri_ip; 2220 2221 /* 2222 * first 32 bits to check coversion: 2223 * IP version, TOS, TTL, protocol 2224 */ 2225 i = ((*lip & *lm) != *ld); 2226 FR_DEBUG(("0. %#08x & %#08x != %#08x\n", 2227 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2228 if (i) 2229 return 1; 2230 2231 /* 2232 * Next 32 bits is a constructed bitmask indicating which IP options 2233 * are present (if any) in this packet. 2234 */ 2235 lip++, lm++, ld++; 2236 i = ((*lip & *lm) != *ld); 2237 FR_DEBUG(("1. %#08x & %#08x != %#08x\n", 2238 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2239 if (i != 0) 2240 return 1; 2241 2242 lip++, lm++, ld++; 2243 /* 2244 * Unrolled loops (4 each, for 32 bits) for address checks. 2245 */ 2246 /* 2247 * Check the source address. 2248 */ 2249 if (fr->fr_satype == FRI_LOOKUP) { 2250 i = (*fr->fr_srcfunc)(fin->fin_main_soft, fr->fr_srcptr, 2251 fi->fi_v, lip, fin->fin_plen); 2252 if (i == -1) 2253 return 1; 2254 lip += 3; 2255 lm += 3; 2256 ld += 3; 2257 } else { 2258 i = ((*lip & *lm) != *ld); 2259 FR_DEBUG(("2a. %#08x & %#08x != %#08x\n", 2260 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2261 if (fi->fi_v == 6) { 2262 lip++, lm++, ld++; 2263 i |= ((*lip & *lm) != *ld); 2264 FR_DEBUG(("2b. %#08x & %#08x != %#08x\n", 2265 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2266 lip++, lm++, ld++; 2267 i |= ((*lip & *lm) != *ld); 2268 FR_DEBUG(("2c. %#08x & %#08x != %#08x\n", 2269 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2270 lip++, lm++, ld++; 2271 i |= ((*lip & *lm) != *ld); 2272 FR_DEBUG(("2d. %#08x & %#08x != %#08x\n", 2273 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2274 } else { 2275 lip += 3; 2276 lm += 3; 2277 ld += 3; 2278 } 2279 } 2280 i ^= (fr->fr_flags & FR_NOTSRCIP) >> 6; 2281 if (i != 0) 2282 return 1; 2283 2284 /* 2285 * Check the destination address. 2286 */ 2287 lip++, lm++, ld++; 2288 if (fr->fr_datype == FRI_LOOKUP) { 2289 i = (*fr->fr_dstfunc)(fin->fin_main_soft, fr->fr_dstptr, 2290 fi->fi_v, lip, fin->fin_plen); 2291 if (i == -1) 2292 return 1; 2293 lip += 3; 2294 lm += 3; 2295 ld += 3; 2296 } else { 2297 i = ((*lip & *lm) != *ld); 2298 FR_DEBUG(("3a. %#08x & %#08x != %#08x\n", 2299 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2300 if (fi->fi_v == 6) { 2301 lip++, lm++, ld++; 2302 i |= ((*lip & *lm) != *ld); 2303 FR_DEBUG(("3b. %#08x & %#08x != %#08x\n", 2304 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2305 lip++, lm++, ld++; 2306 i |= ((*lip & *lm) != *ld); 2307 FR_DEBUG(("3c. %#08x & %#08x != %#08x\n", 2308 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2309 lip++, lm++, ld++; 2310 i |= ((*lip & *lm) != *ld); 2311 FR_DEBUG(("3d. %#08x & %#08x != %#08x\n", 2312 ntohl(*lip), ntohl(*lm), ntohl(*ld))); 2313 } else { 2314 lip += 3; 2315 lm += 3; 2316 ld += 3; 2317 } 2318 } 2319 i ^= (fr->fr_flags & FR_NOTDSTIP) >> 7; 2320 if (i != 0) 2321 return 1; 2322 /* 2323 * IP addresses matched. The next 32bits contains: 2324 * mast of old IP header security & authentication bits. 2325 */ 2326 lip++, lm++, ld++; 2327 i = (*ld - (*lip & *lm)); 2328 FR_DEBUG(("4. %#08x & %#08x != %#08x\n", *lip, *lm, *ld)); 2329 2330 /* 2331 * Next we have 32 bits of packet flags. 2332 */ 2333 lip++, lm++, ld++; 2334 i |= (*ld - (*lip & *lm)); 2335 FR_DEBUG(("5. %#08x & %#08x != %#08x\n", *lip, *lm, *ld)); 2336 2337 if (i == 0) { 2338 /* 2339 * If a fragment, then only the first has what we're 2340 * looking for here... 2341 */ 2342 if (portcmp) { 2343 if (!ipf_tcpudpchk(&fin->fin_fi, &fr->fr_tuc)) 2344 i = 1; 2345 } else { 2346 if (fr->fr_dcmp || fr->fr_scmp || 2347 fr->fr_tcpf || fr->fr_tcpfm) 2348 i = 1; 2349 if (fr->fr_icmpm || fr->fr_icmp) { 2350 if (((fi->fi_p != IPPROTO_ICMP) && 2351 (fi->fi_p != IPPROTO_ICMPV6)) || 2352 fin->fin_off || (fin->fin_dlen < 2)) 2353 i = 1; 2354 else if ((fin->fin_data[0] & fr->fr_icmpm) != 2355 fr->fr_icmp) { 2356 FR_DEBUG(("i. %#x & %#x != %#x\n", 2357 fin->fin_data[0], 2358 fr->fr_icmpm, fr->fr_icmp)); 2359 i = 1; 2360 } 2361 } 2362 } 2363 } 2364 return i; 2365} 2366 2367 2368/* ------------------------------------------------------------------------ */ 2369/* Function: ipf_scanlist */ 2370/* Returns: int - result flags of scanning filter list */ 2371/* Parameters: fin(I) - pointer to packet information */ 2372/* pass(I) - default result to return for filtering */ 2373/* */ 2374/* Check the input/output list of rules for a match to the current packet. */ 2375/* If a match is found, the value of fr_flags from the rule becomes the */ 2376/* return value and fin->fin_fr points to the matched rule. */ 2377/* */ 2378/* This function may be called recusively upto 16 times (limit inbuilt.) */ 2379/* When unwinding, it should finish up with fin_depth as 0. */ 2380/* */ 2381/* Could be per interface, but this gets real nasty when you don't have, */ 2382/* or can't easily change, the kernel source code to . */ 2383/* ------------------------------------------------------------------------ */ 2384int 2385ipf_scanlist(fin, pass) 2386 fr_info_t *fin; 2387 u_32_t pass; 2388{ 2389 ipf_main_softc_t *softc = fin->fin_main_soft; 2390 int rulen, portcmp, off, skip; 2391 struct frentry *fr, *fnext; 2392 u_32_t passt, passo; 2393 2394 /* 2395 * Do not allow nesting deeper than 16 levels. 2396 */ 2397 if (fin->fin_depth >= 16) 2398 return pass; 2399 2400 fr = fin->fin_fr; 2401 2402 /* 2403 * If there are no rules in this list, return now. 2404 */ 2405 if (fr == NULL) 2406 return pass; 2407 2408 skip = 0; 2409 portcmp = 0; 2410 fin->fin_depth++; 2411 fin->fin_fr = NULL; 2412 off = fin->fin_off; 2413 2414 if ((fin->fin_flx & FI_TCPUDP) && (fin->fin_dlen > 3) && !off) 2415 portcmp = 1; 2416 2417 for (rulen = 0; fr; fr = fnext, rulen++) { 2418 fnext = fr->fr_next; 2419 if (skip != 0) { 2420 FR_VERBOSE(("SKIP %d (%#x)\n", skip, fr->fr_flags)); 2421 skip--; 2422 continue; 2423 } 2424 2425 /* 2426 * In all checks below, a null (zero) value in the 2427 * filter struture is taken to mean a wildcard. 2428 * 2429 * check that we are working for the right interface 2430 */ 2431#ifdef _KERNEL 2432 if (fr->fr_ifa && fr->fr_ifa != fin->fin_ifp) 2433 continue; 2434#else 2435 if (opts & (OPT_VERBOSE|OPT_DEBUG)) 2436 printf("\n"); 2437 FR_VERBOSE(("%c", FR_ISSKIP(pass) ? 's' : 2438 FR_ISPASS(pass) ? 'p' : 2439 FR_ISACCOUNT(pass) ? 'A' : 2440 FR_ISAUTH(pass) ? 'a' : 2441 (pass & FR_NOMATCH) ? 'n' :'b')); 2442 if (fr->fr_ifa && fr->fr_ifa != fin->fin_ifp) 2443 continue; 2444 FR_VERBOSE((":i")); 2445#endif 2446 2447 switch (fr->fr_type) 2448 { 2449 case FR_T_IPF : 2450 case FR_T_IPF_BUILTIN : 2451 if (ipf_check_ipf(fin, fr, portcmp)) 2452 continue; 2453 break; 2454#if defined(IPFILTER_BPF) 2455 case FR_T_BPFOPC : 2456 case FR_T_BPFOPC_BUILTIN : 2457 { 2458 u_char *mc; 2459 int wlen; 2460 2461 if (*fin->fin_mp == NULL) 2462 continue; 2463 if (fin->fin_family != fr->fr_family) 2464 continue; 2465 mc = (u_char *)fin->fin_m; 2466 wlen = fin->fin_dlen + fin->fin_hlen; 2467 if (!bpf_filter(fr->fr_data, mc, wlen, 0)) 2468 continue; 2469 break; 2470 } 2471#endif 2472 case FR_T_CALLFUNC_BUILTIN : 2473 { 2474 frentry_t *f; 2475 2476 f = (*fr->fr_func)(fin, &pass); 2477 if (f != NULL) 2478 fr = f; 2479 else 2480 continue; 2481 break; 2482 } 2483 2484 case FR_T_IPFEXPR : 2485 case FR_T_IPFEXPR_BUILTIN : 2486 if (fin->fin_family != fr->fr_family) 2487 continue; 2488 if (ipf_fr_matcharray(fin, fr->fr_data) == 0) 2489 continue; 2490 break; 2491 2492 default : 2493 break; 2494 } 2495 2496 if ((fin->fin_out == 0) && (fr->fr_nattag.ipt_num[0] != 0)) { 2497 if (fin->fin_nattag == NULL) 2498 continue; 2499 if (ipf_matchtag(&fr->fr_nattag, fin->fin_nattag) == 0) 2500 continue; 2501 } 2502 FR_VERBOSE(("=%d/%d.%d *", fr->fr_grhead, fr->fr_group, rulen)); 2503 2504 passt = fr->fr_flags; 2505 2506 /* 2507 * If the rule is a "call now" rule, then call the function 2508 * in the rule, if it exists and use the results from that. 2509 * If the function pointer is bad, just make like we ignore 2510 * it, except for increasing the hit counter. 2511 */ 2512 if ((passt & FR_CALLNOW) != 0) { 2513 frentry_t *frs; 2514 2515 ATOMIC_INC64(fr->fr_hits); 2516 if ((fr->fr_func == NULL) || 2517 (fr->fr_func == (ipfunc_t)-1)) 2518 continue; 2519 2520 frs = fin->fin_fr; 2521 fin->fin_fr = fr; 2522 fr = (*fr->fr_func)(fin, &passt); 2523 if (fr == NULL) { 2524 fin->fin_fr = frs; 2525 continue; 2526 } 2527 passt = fr->fr_flags; 2528 } 2529 fin->fin_fr = fr; 2530 2531#ifdef IPFILTER_LOG 2532 /* 2533 * Just log this packet... 2534 */ 2535 if ((passt & FR_LOGMASK) == FR_LOG) { 2536 if (ipf_log_pkt(fin, passt) == -1) { 2537 if (passt & FR_LOGORBLOCK) { 2538 DT(frb_logfail); 2539 passt &= ~FR_CMDMASK; 2540 passt |= FR_BLOCK|FR_QUICK; 2541 fin->fin_reason = FRB_LOGFAIL; 2542 } 2543 } 2544 } 2545#endif /* IPFILTER_LOG */ 2546 2547 MUTEX_ENTER(&fr->fr_lock); 2548 fr->fr_bytes += (U_QUAD_T)fin->fin_plen; 2549 fr->fr_hits++; 2550 MUTEX_EXIT(&fr->fr_lock); 2551 fin->fin_rule = rulen; 2552 2553 passo = pass; 2554 if (FR_ISSKIP(passt)) { 2555 skip = fr->fr_arg; 2556 continue; 2557 } else if (((passt & FR_LOGMASK) != FR_LOG) && 2558 ((passt & FR_LOGMASK) != FR_DECAPSULATE)) { 2559 pass = passt; 2560 } 2561 2562 if (passt & (FR_RETICMP|FR_FAKEICMP)) 2563 fin->fin_icode = fr->fr_icode; 2564 2565 if (fr->fr_group != -1) { 2566 (void) strncpy(fin->fin_group, 2567 FR_NAME(fr, fr_group), 2568 strlen(FR_NAME(fr, fr_group))); 2569 } else { 2570 fin->fin_group[0] = '\0'; 2571 } 2572 2573 FR_DEBUG(("pass %#x/%#x/%x\n", passo, pass, passt)); 2574 2575 if (fr->fr_grphead != NULL) { 2576 fin->fin_fr = fr->fr_grphead->fg_start; 2577 FR_VERBOSE(("group %s\n", FR_NAME(fr, fr_grhead))); 2578 2579 if (FR_ISDECAPS(passt)) 2580 passt = ipf_decaps(fin, pass, fr->fr_icode); 2581 else 2582 passt = ipf_scanlist(fin, pass); 2583 2584 if (fin->fin_fr == NULL) { 2585 fin->fin_rule = rulen; 2586 if (fr->fr_group != -1) 2587 (void) strncpy(fin->fin_group, 2588 fr->fr_names + 2589 fr->fr_group, 2590 strlen(fr->fr_names + 2591 fr->fr_group)); 2592 fin->fin_fr = fr; 2593 passt = pass; 2594 } 2595 pass = passt; 2596 } 2597 2598 if (pass & FR_QUICK) { 2599 /* 2600 * Finally, if we've asked to track state for this 2601 * packet, set it up. Add state for "quick" rules 2602 * here so that if the action fails we can consider 2603 * the rule to "not match" and keep on processing 2604 * filter rules. 2605 */ 2606 if ((pass & FR_KEEPSTATE) && !FR_ISAUTH(pass) && 2607 !(fin->fin_flx & FI_STATE)) { 2608 int out = fin->fin_out; 2609 2610 fin->fin_fr = fr; 2611 if (ipf_state_add(softc, fin, NULL, 0) == 0) { 2612 LBUMPD(ipf_stats[out], fr_ads); 2613 } else { 2614 LBUMPD(ipf_stats[out], fr_bads); 2615 pass = passo; 2616 continue; 2617 } 2618 } 2619 break; 2620 } 2621 } 2622 fin->fin_depth--; 2623 return pass; 2624} 2625 2626 2627/* ------------------------------------------------------------------------ */ 2628/* Function: ipf_acctpkt */ 2629/* Returns: frentry_t* - always returns NULL */ 2630/* Parameters: fin(I) - pointer to packet information */ 2631/* passp(IO) - pointer to current/new filter decision (unused) */ 2632/* */ 2633/* Checks a packet against accounting rules, if there are any for the given */ 2634/* IP protocol version. */ 2635/* */ 2636/* N.B.: this function returns NULL to match the prototype used by other */ 2637/* functions called from the IPFilter "mainline" in ipf_check(). */ 2638/* ------------------------------------------------------------------------ */ 2639frentry_t * 2640ipf_acctpkt(fin, passp) 2641 fr_info_t *fin; 2642 u_32_t *passp; 2643{ 2644 ipf_main_softc_t *softc = fin->fin_main_soft; 2645 char group[FR_GROUPLEN]; 2646 frentry_t *fr, *frsave; 2647 u_32_t pass, rulen; 2648 2649 passp = passp; 2650 fr = softc->ipf_acct[fin->fin_out][softc->ipf_active]; 2651 2652 if (fr != NULL) { 2653 frsave = fin->fin_fr; 2654 bcopy(fin->fin_group, group, FR_GROUPLEN); 2655 rulen = fin->fin_rule; 2656 fin->fin_fr = fr; 2657 pass = ipf_scanlist(fin, FR_NOMATCH); 2658 if (FR_ISACCOUNT(pass)) { 2659 LBUMPD(ipf_stats[0], fr_acct); 2660 } 2661 fin->fin_fr = frsave; 2662 bcopy(group, fin->fin_group, FR_GROUPLEN); 2663 fin->fin_rule = rulen; 2664 } 2665 return NULL; 2666} 2667 2668 2669/* ------------------------------------------------------------------------ */ 2670/* Function: ipf_firewall */ 2671/* Returns: frentry_t* - returns pointer to matched rule, if no matches */ 2672/* were found, returns NULL. */ 2673/* Parameters: fin(I) - pointer to packet information */ 2674/* passp(IO) - pointer to current/new filter decision (unused) */ 2675/* */ 2676/* Applies an appropriate set of firewall rules to the packet, to see if */ 2677/* there are any matches. The first check is to see if a match can be seen */ 2678/* in the cache. If not, then search an appropriate list of rules. Once a */ 2679/* matching rule is found, take any appropriate actions as defined by the */ 2680/* rule - except logging. */ 2681/* ------------------------------------------------------------------------ */ 2682static frentry_t * 2683ipf_firewall(fin, passp) 2684 fr_info_t *fin; 2685 u_32_t *passp; 2686{ 2687 ipf_main_softc_t *softc = fin->fin_main_soft; 2688 frentry_t *fr; 2689 u_32_t pass; 2690 int out; 2691 2692 out = fin->fin_out; 2693 pass = *passp; 2694 2695 /* 2696 * This rule cache will only affect packets that are not being 2697 * statefully filtered. 2698 */ 2699 fin->fin_fr = softc->ipf_rules[out][softc->ipf_active]; 2700 if (fin->fin_fr != NULL) 2701 pass = ipf_scanlist(fin, softc->ipf_pass); 2702 2703 if ((pass & FR_NOMATCH)) { 2704 LBUMPD(ipf_stats[out], fr_nom); 2705 } 2706 fr = fin->fin_fr; 2707 2708 /* 2709 * Apply packets per second rate-limiting to a rule as required. 2710 */ 2711 if ((fr != NULL) && (fr->fr_pps != 0) && 2712 !ppsratecheck(&fr->fr_lastpkt, &fr->fr_curpps, fr->fr_pps)) { 2713 DT2(frb_ppsrate, fr_info_t *, fin, frentry_t *, fr); 2714 pass &= ~(FR_CMDMASK|FR_RETICMP|FR_RETRST); 2715 pass |= FR_BLOCK; 2716 LBUMPD(ipf_stats[out], fr_ppshit); 2717 fin->fin_reason = FRB_PPSRATE; 2718 } 2719 2720 /* 2721 * If we fail to add a packet to the authorization queue, then we 2722 * drop the packet later. However, if it was added then pretend 2723 * we've dropped it already. 2724 */ 2725 if (FR_ISAUTH(pass)) { 2726 if (ipf_auth_new(fin->fin_m, fin) != 0) { 2727 DT1(frb_authnew, fr_info_t *, fin); 2728 fin->fin_m = *fin->fin_mp = NULL; 2729 fin->fin_reason = FRB_AUTHNEW; 2730 fin->fin_error = 0; 2731 } else { 2732 IPFERROR(1); 2733 fin->fin_error = ENOSPC; 2734 } 2735 } 2736 2737 if ((fr != NULL) && (fr->fr_func != NULL) && 2738 (fr->fr_func != (ipfunc_t)-1) && !(pass & FR_CALLNOW)) 2739 (void) (*fr->fr_func)(fin, &pass); 2740 2741 /* 2742 * If a rule is a pre-auth rule, check again in the list of rules 2743 * loaded for authenticated use. It does not particulary matter 2744 * if this search fails because a "preauth" result, from a rule, 2745 * is treated as "not a pass", hence the packet is blocked. 2746 */ 2747 if (FR_ISPREAUTH(pass)) { 2748 pass = ipf_auth_pre_scanlist(softc, fin, pass); 2749 } 2750 2751 /* 2752 * If the rule has "keep frag" and the packet is actually a fragment, 2753 * then create a fragment state entry. 2754 */ 2755 if ((pass & (FR_KEEPFRAG|FR_KEEPSTATE)) == FR_KEEPFRAG) { 2756 if (fin->fin_flx & FI_FRAG) { 2757 if (ipf_frag_new(softc, fin, pass) == -1) { 2758 LBUMP(ipf_stats[out].fr_bnfr); 2759 } else { 2760 LBUMP(ipf_stats[out].fr_nfr); 2761 } 2762 } else { 2763 LBUMP(ipf_stats[out].fr_cfr); 2764 } 2765 } 2766 2767 fr = fin->fin_fr; 2768 *passp = pass; 2769 2770 return fr; 2771} 2772 2773 2774/* ------------------------------------------------------------------------ */ 2775/* Function: ipf_check */ 2776/* Returns: int - 0 == packet allowed through, */ 2777/* User space: */ 2778/* -1 == packet blocked */ 2779/* 1 == packet not matched */ 2780/* -2 == requires authentication */ 2781/* Kernel: */ 2782/* > 0 == filter error # for packet */ 2783/* Parameters: ip(I) - pointer to start of IPv4/6 packet */ 2784/* hlen(I) - length of header */ 2785/* ifp(I) - pointer to interface this packet is on */ 2786/* out(I) - 0 == packet going in, 1 == packet going out */ 2787/* mp(IO) - pointer to caller's buffer pointer that holds this */ 2788/* IP packet. */ 2789/* Solaris & HP-UX ONLY : */ 2790/* qpi(I) - pointer to STREAMS queue information for this */ 2791/* interface & direction. */ 2792/* */ 2793/* ipf_check() is the master function for all IPFilter packet processing. */ 2794/* It orchestrates: Network Address Translation (NAT), checking for packet */ 2795/* authorisation (or pre-authorisation), presence of related state info., */ 2796/* generating log entries, IP packet accounting, routing of packets as */ 2797/* directed by firewall rules and of course whether or not to allow the */ 2798/* packet to be further processed by the kernel. */ 2799/* */ 2800/* For packets blocked, the contents of "mp" will be NULL'd and the buffer */ 2801/* freed. Packets passed may be returned with the pointer pointed to by */ 2802/* by "mp" changed to a new buffer. */ 2803/* ------------------------------------------------------------------------ */ 2804int 2805ipf_check(ctx, ip, hlen, ifp, out 2806#if defined(_KERNEL) && defined(MENTAT) 2807 , qif, mp) 2808 void *qif; 2809#else 2810 , mp) 2811#endif 2812 mb_t **mp; 2813 ip_t *ip; 2814 int hlen; 2815 void *ifp; 2816 int out; 2817 void *ctx; 2818{ 2819 /* 2820 * The above really sucks, but short of writing a diff 2821 */ 2822 ipf_main_softc_t *softc = ctx; 2823 fr_info_t frinfo; 2824 fr_info_t *fin = &frinfo; 2825 u_32_t pass = softc->ipf_pass; 2826 frentry_t *fr = NULL; 2827 int v = IP_V(ip); 2828 mb_t *mc = NULL; 2829 mb_t *m; 2830 /* 2831 * The first part of ipf_check() deals with making sure that what goes 2832 * into the filtering engine makes some sense. Information about the 2833 * the packet is distilled, collected into a fr_info_t structure and 2834 * the an attempt to ensure the buffer the packet is in is big enough 2835 * to hold all the required packet headers. 2836 */ 2837#ifdef _KERNEL 2838# ifdef MENTAT 2839 qpktinfo_t *qpi = qif; 2840 2841# ifdef __sparc 2842 if ((u_int)ip & 0x3) 2843 return 2; 2844# endif 2845# else 2846 SPL_INT(s); 2847# endif 2848 2849 if (softc->ipf_running <= 0) { 2850 return 0; 2851 } 2852 2853 bzero((char *)fin, sizeof(*fin)); 2854 2855# ifdef MENTAT 2856 if (qpi->qpi_flags & QF_BROADCAST) 2857 fin->fin_flx |= FI_MBCAST|FI_BROADCAST; 2858 if (qpi->qpi_flags & QF_MULTICAST) 2859 fin->fin_flx |= FI_MBCAST|FI_MULTICAST; 2860 m = qpi->qpi_m; 2861 fin->fin_qfm = m; 2862 fin->fin_qpi = qpi; 2863# else /* MENTAT */ 2864 2865 m = *mp; 2866 2867# if defined(M_MCAST) 2868 if ((m->m_flags & M_MCAST) != 0) 2869 fin->fin_flx |= FI_MBCAST|FI_MULTICAST; 2870# endif 2871# if defined(M_MLOOP) 2872 if ((m->m_flags & M_MLOOP) != 0) 2873 fin->fin_flx |= FI_MBCAST|FI_MULTICAST; 2874# endif 2875# if defined(M_BCAST) 2876 if ((m->m_flags & M_BCAST) != 0) 2877 fin->fin_flx |= FI_MBCAST|FI_BROADCAST; 2878# endif 2879# ifdef M_CANFASTFWD 2880 /* 2881 * XXX For now, IP Filter and fast-forwarding of cached flows 2882 * XXX are mutually exclusive. Eventually, IP Filter should 2883 * XXX get a "can-fast-forward" filter rule. 2884 */ 2885 m->m_flags &= ~M_CANFASTFWD; 2886# endif /* M_CANFASTFWD */ 2887# if defined(CSUM_DELAY_DATA) && (!defined(__FreeBSD_version) || \ 2888 (__FreeBSD_version < 501108)) 2889 /* 2890 * disable delayed checksums. 2891 */ 2892 if (m->m_pkthdr.csum_flags & CSUM_DELAY_DATA) { 2893 in_delayed_cksum(m); 2894 m->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA; 2895 } 2896# endif /* CSUM_DELAY_DATA */ 2897# endif /* MENTAT */ 2898#else 2899 bzero((char *)fin, sizeof(*fin)); 2900 m = *mp; 2901# if defined(M_MCAST) 2902 if ((m->m_flags & M_MCAST) != 0) 2903 fin->fin_flx |= FI_MBCAST|FI_MULTICAST; 2904# endif 2905# if defined(M_MLOOP) 2906 if ((m->m_flags & M_MLOOP) != 0) 2907 fin->fin_flx |= FI_MBCAST|FI_MULTICAST; 2908# endif 2909# if defined(M_BCAST) 2910 if ((m->m_flags & M_BCAST) != 0) 2911 fin->fin_flx |= FI_MBCAST|FI_BROADCAST; 2912# endif 2913#endif /* _KERNEL */ 2914 2915 fin->fin_v = v; 2916 fin->fin_m = m; 2917 fin->fin_ip = ip; 2918 fin->fin_mp = mp; 2919 fin->fin_out = out; 2920 fin->fin_ifp = ifp; 2921 fin->fin_error = ENETUNREACH; 2922 fin->fin_hlen = (u_short)hlen; 2923 fin->fin_dp = (char *)ip + hlen; 2924 fin->fin_main_soft = softc; 2925 2926 fin->fin_ipoff = (char *)ip - MTOD(m, char *); 2927 2928 SPL_NET(s); 2929 2930#ifdef USE_INET6 2931 if (v == 6) { 2932 LBUMP(ipf_stats[out].fr_ipv6); 2933 /* 2934 * Jumbo grams are quite likely too big for internal buffer 2935 * structures to handle comfortably, for now, so just drop 2936 * them. 2937 */ 2938 if (((ip6_t *)ip)->ip6_plen == 0) { 2939 DT1(frb_jumbo, ip6_t *, (ip6_t *)ip); 2940 pass = FR_BLOCK|FR_NOMATCH; 2941 fin->fin_reason = FRB_JUMBO; 2942 goto finished; 2943 } 2944 fin->fin_family = AF_INET6; 2945 } else 2946#endif 2947 { 2948 fin->fin_family = AF_INET; 2949 } 2950 2951 if (ipf_makefrip(hlen, ip, fin) == -1) { 2952 DT1(frb_makefrip, fr_info_t *, fin); 2953 pass = FR_BLOCK|FR_NOMATCH; 2954 fin->fin_reason = FRB_MAKEFRIP; 2955 goto finished; 2956 } 2957 2958 /* 2959 * For at least IPv6 packets, if a m_pullup() fails then this pointer 2960 * becomes NULL and so we have no packet to free. 2961 */ 2962 if (*fin->fin_mp == NULL) 2963 goto finished; 2964 2965 if (!out) { 2966 if (v == 4) { 2967 if (softc->ipf_chksrc && !ipf_verifysrc(fin)) { 2968 LBUMPD(ipf_stats[0], fr_v4_badsrc); 2969 fin->fin_flx |= FI_BADSRC; 2970 } 2971 if (fin->fin_ip->ip_ttl < softc->ipf_minttl) { 2972 LBUMPD(ipf_stats[0], fr_v4_badttl); 2973 fin->fin_flx |= FI_LOWTTL; 2974 } 2975 } 2976#ifdef USE_INET6 2977 else if (v == 6) { 2978 if (((ip6_t *)ip)->ip6_hlim < softc->ipf_minttl) { 2979 LBUMPD(ipf_stats[0], fr_v6_badttl); 2980 fin->fin_flx |= FI_LOWTTL; 2981 } 2982 } 2983#endif 2984 } 2985 2986 if (fin->fin_flx & FI_SHORT) { 2987 LBUMPD(ipf_stats[out], fr_short); 2988 } 2989 2990 READ_ENTER(&softc->ipf_mutex); 2991 2992 if (!out) { 2993 switch (fin->fin_v) 2994 { 2995 case 4 : 2996 if (ipf_nat_checkin(fin, &pass) == -1) { 2997 goto filterdone; 2998 } 2999 break; 3000#ifdef USE_INET6 3001 case 6 : 3002 if (ipf_nat6_checkin(fin, &pass) == -1) { 3003 goto filterdone; 3004 } 3005 break; 3006#endif 3007 default : 3008 break; 3009 } 3010 } 3011 /* 3012 * Check auth now. 3013 * If a packet is found in the auth table, then skip checking 3014 * the access lists for permission but we do need to consider 3015 * the result as if it were from the ACL's. In addition, being 3016 * found in the auth table means it has been seen before, so do 3017 * not pass it through accounting (again), lest it be counted twice. 3018 */ 3019 fr = ipf_auth_check(fin, &pass); 3020 if (!out && (fr == NULL)) 3021 (void) ipf_acctpkt(fin, NULL); 3022 3023 if (fr == NULL) { 3024 if ((fin->fin_flx & FI_FRAG) != 0) 3025 fr = ipf_frag_known(fin, &pass); 3026 3027 if (fr == NULL) 3028 fr = ipf_state_check(fin, &pass); 3029 } 3030 3031 if ((pass & FR_NOMATCH) || (fr == NULL)) 3032 fr = ipf_firewall(fin, &pass); 3033 3034 /* 3035 * If we've asked to track state for this packet, set it up. 3036 * Here rather than ipf_firewall because ipf_checkauth may decide 3037 * to return a packet for "keep state" 3038 */ 3039 if ((pass & FR_KEEPSTATE) && (fin->fin_m != NULL) && 3040 !(fin->fin_flx & FI_STATE)) { 3041 if (ipf_state_add(softc, fin, NULL, 0) == 0) { 3042 LBUMP(ipf_stats[out].fr_ads); 3043 } else { 3044 LBUMP(ipf_stats[out].fr_bads); 3045 if (FR_ISPASS(pass)) { 3046 DT(frb_stateadd); 3047 pass &= ~FR_CMDMASK; 3048 pass |= FR_BLOCK; 3049 fin->fin_reason = FRB_STATEADD; 3050 } 3051 } 3052 } 3053 3054 fin->fin_fr = fr; 3055 if ((fr != NULL) && !(fin->fin_flx & FI_STATE)) { 3056 fin->fin_dif = &fr->fr_dif; 3057 fin->fin_tif = &fr->fr_tifs[fin->fin_rev]; 3058 } 3059 3060 /* 3061 * Only count/translate packets which will be passed on, out the 3062 * interface. 3063 */ 3064 if (out && FR_ISPASS(pass)) { 3065 (void) ipf_acctpkt(fin, NULL); 3066 3067 switch (fin->fin_v) 3068 { 3069 case 4 : 3070 if (ipf_nat_checkout(fin, &pass) == -1) { 3071 ; 3072 } else if ((softc->ipf_update_ipid != 0) && (v == 4)) { 3073 if (ipf_updateipid(fin) == -1) { 3074 DT(frb_updateipid); 3075 LBUMP(ipf_stats[1].fr_ipud); 3076 pass &= ~FR_CMDMASK; 3077 pass |= FR_BLOCK; 3078 fin->fin_reason = FRB_UPDATEIPID; 3079 } else { 3080 LBUMP(ipf_stats[0].fr_ipud); 3081 } 3082 } 3083 break; 3084#ifdef USE_INET6 3085 case 6 : 3086 (void) ipf_nat6_checkout(fin, &pass); 3087 break; 3088#endif 3089 default : 3090 break; 3091 } 3092 } 3093 3094filterdone: 3095#ifdef IPFILTER_LOG 3096 if ((softc->ipf_flags & FF_LOGGING) || (pass & FR_LOGMASK)) { 3097 (void) ipf_dolog(fin, &pass); 3098 } 3099#endif 3100 3101 /* 3102 * The FI_STATE flag is cleared here so that calling ipf_state_check 3103 * will work when called from inside of fr_fastroute. Although 3104 * there is a similar flag, FI_NATED, for NAT, it does have the same 3105 * impact on code execution. 3106 */ 3107 fin->fin_flx &= ~FI_STATE; 3108 3109#if defined(FASTROUTE_RECURSION) 3110 /* 3111 * Up the reference on fr_lock and exit ipf_mutex. The generation of 3112 * a packet below can sometimes cause a recursive call into IPFilter. 3113 * On those platforms where that does happen, we need to hang onto 3114 * the filter rule just in case someone decides to remove or flush it 3115 * in the meantime. 3116 */ 3117 if (fr != NULL) { 3118 MUTEX_ENTER(&fr->fr_lock); 3119 fr->fr_ref++; 3120 MUTEX_EXIT(&fr->fr_lock); 3121 } 3122 3123 RWLOCK_EXIT(&softc->ipf_mutex); 3124#endif 3125 3126 if ((pass & FR_RETMASK) != 0) { 3127 /* 3128 * Should we return an ICMP packet to indicate error 3129 * status passing through the packet filter ? 3130 * WARNING: ICMP error packets AND TCP RST packets should 3131 * ONLY be sent in repsonse to incoming packets. Sending 3132 * them in response to outbound packets can result in a 3133 * panic on some operating systems. 3134 */ 3135 if (!out) { 3136 if (pass & FR_RETICMP) { 3137 int dst; 3138 3139 if ((pass & FR_RETMASK) == FR_FAKEICMP) 3140 dst = 1; 3141 else 3142 dst = 0; 3143 (void) ipf_send_icmp_err(ICMP_UNREACH, fin, 3144 dst); 3145 LBUMP(ipf_stats[0].fr_ret); 3146 } else if (((pass & FR_RETMASK) == FR_RETRST) && 3147 !(fin->fin_flx & FI_SHORT)) { 3148 if (((fin->fin_flx & FI_OOW) != 0) || 3149 (ipf_send_reset(fin) == 0)) { 3150 LBUMP(ipf_stats[1].fr_ret); 3151 } 3152 } 3153 3154 /* 3155 * When using return-* with auth rules, the auth code 3156 * takes over disposing of this packet. 3157 */ 3158 if (FR_ISAUTH(pass) && (fin->fin_m != NULL)) { 3159 DT1(frb_authcapture, fr_info_t *, fin); 3160 fin->fin_m = *fin->fin_mp = NULL; 3161 fin->fin_reason = FRB_AUTHCAPTURE; 3162 m = NULL; 3163 } 3164 } else { 3165 if (pass & FR_RETRST) { 3166 fin->fin_error = ECONNRESET; 3167 } 3168 } 3169 } 3170 3171 /* 3172 * After the above so that ICMP unreachables and TCP RSTs get 3173 * created properly. 3174 */ 3175 if (FR_ISBLOCK(pass) && (fin->fin_flx & FI_NEWNAT)) 3176 ipf_nat_uncreate(fin); 3177 3178 /* 3179 * If we didn't drop off the bottom of the list of rules (and thus 3180 * the 'current' rule fr is not NULL), then we may have some extra 3181 * instructions about what to do with a packet. 3182 * Once we're finished return to our caller, freeing the packet if 3183 * we are dropping it. 3184 */ 3185 if (fr != NULL) { 3186 frdest_t *fdp; 3187 3188 /* 3189 * Generate a duplicated packet first because ipf_fastroute 3190 * can lead to fin_m being free'd... not good. 3191 */ 3192 fdp = fin->fin_dif; 3193 if ((fdp != NULL) && (fdp->fd_ptr != NULL) && 3194 (fdp->fd_ptr != (void *)-1)) { 3195 mc = M_COPY(fin->fin_m); 3196 if (mc != NULL) 3197 ipf_fastroute(mc, &mc, fin, fdp); 3198 } 3199 3200 fdp = fin->fin_tif; 3201 if (!out && (pass & FR_FASTROUTE)) { 3202 /* 3203 * For fastroute rule, no destination interface defined 3204 * so pass NULL as the frdest_t parameter 3205 */ 3206 (void) ipf_fastroute(fin->fin_m, mp, fin, NULL); 3207 m = *mp = NULL; 3208 } else if ((fdp != NULL) && (fdp->fd_ptr != NULL) && 3209 (fdp->fd_ptr != (struct ifnet *)-1)) { 3210 /* this is for to rules: */ 3211 ipf_fastroute(fin->fin_m, mp, fin, fdp); 3212 m = *mp = NULL; 3213 } 3214 3215#if defined(FASTROUTE_RECURSION) 3216 (void) ipf_derefrule(softc, &fr); 3217#endif 3218 } 3219#if !defined(FASTROUTE_RECURSION) 3220 RWLOCK_EXIT(&softc->ipf_mutex); 3221#endif 3222 3223finished: 3224 if (!FR_ISPASS(pass)) { 3225 LBUMP(ipf_stats[out].fr_block); 3226 if (*mp != NULL) { 3227#ifdef _KERNEL 3228 FREE_MB_T(*mp); 3229#endif 3230 m = *mp = NULL; 3231 } 3232 } else { 3233 LBUMP(ipf_stats[out].fr_pass); 3234#if defined(_KERNEL) && defined(__sgi) 3235 if ((fin->fin_hbuf != NULL) && 3236 (mtod(fin->fin_m, struct ip *) != fin->fin_ip)) { 3237 COPYBACK(fin->fin_m, 0, fin->fin_plen, fin->fin_hbuf); 3238 } 3239#endif 3240 } 3241 3242 SPL_X(s); 3243 3244#ifdef _KERNEL 3245 if (FR_ISPASS(pass)) 3246 return 0; 3247 LBUMP(ipf_stats[out].fr_blocked[fin->fin_reason]); 3248 return fin->fin_error; 3249#else /* _KERNEL */ 3250 if (*mp != NULL) 3251 (*mp)->mb_ifp = fin->fin_ifp; 3252 blockreason = fin->fin_reason; 3253 FR_VERBOSE(("fin_flx %#x pass %#x ", fin->fin_flx, pass)); 3254 /*if ((pass & FR_CMDMASK) == (softc->ipf_pass & FR_CMDMASK))*/ 3255 if ((pass & FR_NOMATCH) != 0) 3256 return 1; 3257 3258 if ((pass & FR_RETMASK) != 0) 3259 switch (pass & FR_RETMASK) 3260 { 3261 case FR_RETRST : 3262 return 3; 3263 case FR_RETICMP : 3264 return 4; 3265 case FR_FAKEICMP : 3266 return 5; 3267 } 3268 3269 switch (pass & FR_CMDMASK) 3270 { 3271 case FR_PASS : 3272 return 0; 3273 case FR_BLOCK : 3274 return -1; 3275 case FR_AUTH : 3276 return -2; 3277 case FR_ACCOUNT : 3278 return -3; 3279 case FR_PREAUTH : 3280 return -4; 3281 } 3282 return 2; 3283#endif /* _KERNEL */ 3284} 3285 3286 3287#ifdef IPFILTER_LOG 3288/* ------------------------------------------------------------------------ */ 3289/* Function: ipf_dolog */ 3290/* Returns: frentry_t* - returns contents of fin_fr (no change made) */ 3291/* Parameters: fin(I) - pointer to packet information */ 3292/* passp(IO) - pointer to current/new filter decision (unused) */ 3293/* */ 3294/* Checks flags set to see how a packet should be logged, if it is to be */ 3295/* logged. Adjust statistics based on its success or not. */ 3296/* ------------------------------------------------------------------------ */ 3297frentry_t * 3298ipf_dolog(fin, passp) 3299 fr_info_t *fin; 3300 u_32_t *passp; 3301{ 3302 ipf_main_softc_t *softc = fin->fin_main_soft; 3303 u_32_t pass; 3304 int out; 3305 3306 out = fin->fin_out; 3307 pass = *passp; 3308 3309 if ((softc->ipf_flags & FF_LOGNOMATCH) && (pass & FR_NOMATCH)) { 3310 pass |= FF_LOGNOMATCH; 3311 LBUMPD(ipf_stats[out], fr_npkl); 3312 goto logit; 3313 3314 } else if (((pass & FR_LOGMASK) == FR_LOGP) || 3315 (FR_ISPASS(pass) && (softc->ipf_flags & FF_LOGPASS))) { 3316 if ((pass & FR_LOGMASK) != FR_LOGP) 3317 pass |= FF_LOGPASS; 3318 LBUMPD(ipf_stats[out], fr_ppkl); 3319 goto logit; 3320 3321 } else if (((pass & FR_LOGMASK) == FR_LOGB) || 3322 (FR_ISBLOCK(pass) && (softc->ipf_flags & FF_LOGBLOCK))) { 3323 if ((pass & FR_LOGMASK) != FR_LOGB) 3324 pass |= FF_LOGBLOCK; 3325 LBUMPD(ipf_stats[out], fr_bpkl); 3326 3327logit: 3328 if (ipf_log_pkt(fin, pass) == -1) { 3329 /* 3330 * If the "or-block" option has been used then 3331 * block the packet if we failed to log it. 3332 */ 3333 if ((pass & FR_LOGORBLOCK) && FR_ISPASS(pass)) { 3334 DT1(frb_logfail2, u_int, pass); 3335 pass &= ~FR_CMDMASK; 3336 pass |= FR_BLOCK; 3337 fin->fin_reason = FRB_LOGFAIL2; 3338 } 3339 } 3340 *passp = pass; 3341 } 3342 3343 return fin->fin_fr; 3344} 3345#endif /* IPFILTER_LOG */ 3346 3347 3348/* ------------------------------------------------------------------------ */ 3349/* Function: ipf_cksum */ 3350/* Returns: u_short - IP header checksum */ 3351/* Parameters: addr(I) - pointer to start of buffer to checksum */ 3352/* len(I) - length of buffer in bytes */ 3353/* */ 3354/* Calculate the two's complement 16 bit checksum of the buffer passed. */ 3355/* */ 3356/* N.B.: addr should be 16bit aligned. */ 3357/* ------------------------------------------------------------------------ */ 3358u_short 3359ipf_cksum(addr, len) 3360 u_short *addr; 3361 int len; 3362{ 3363 u_32_t sum = 0; 3364 3365 for (sum = 0; len > 1; len -= 2) 3366 sum += *addr++; 3367 3368 /* mop up an odd byte, if necessary */ 3369 if (len == 1) 3370 sum += *(u_char *)addr; 3371 3372 /* 3373 * add back carry outs from top 16 bits to low 16 bits 3374 */ 3375 sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */ 3376 sum += (sum >> 16); /* add carry */ 3377 return (u_short)(~sum); 3378} 3379 3380 3381/* ------------------------------------------------------------------------ */ 3382/* Function: fr_cksum */ 3383/* Returns: u_short - layer 4 checksum */ 3384/* Parameters: fin(I) - pointer to packet information */ 3385/* ip(I) - pointer to IP header */ 3386/* l4proto(I) - protocol to caclulate checksum for */ 3387/* l4hdr(I) - pointer to layer 4 header */ 3388/* */ 3389/* Calculates the TCP checksum for the packet held in "m", using the data */ 3390/* in the IP header "ip" to seed it. */ 3391/* */ 3392/* NB: This function assumes we've pullup'd enough for all of the IP header */ 3393/* and the TCP header. We also assume that data blocks aren't allocated in */ 3394/* odd sizes. */ 3395/* */ 3396/* Expects ip_len and ip_off to be in network byte order when called. */ 3397/* ------------------------------------------------------------------------ */ 3398u_short 3399fr_cksum(fin, ip, l4proto, l4hdr) 3400 fr_info_t *fin; 3401 ip_t *ip; 3402 int l4proto; 3403 void *l4hdr; 3404{ 3405 u_short *sp, slen, sumsave, *csump; 3406 u_int sum, sum2; 3407 int hlen; 3408 int off; 3409#ifdef USE_INET6 3410 ip6_t *ip6; 3411#endif 3412 3413 csump = NULL; 3414 sumsave = 0; 3415 sp = NULL; 3416 slen = 0; 3417 hlen = 0; 3418 sum = 0; 3419 3420 sum = htons((u_short)l4proto); 3421 /* 3422 * Add up IP Header portion 3423 */ 3424#ifdef USE_INET6 3425 if (IP_V(ip) == 4) { 3426#endif 3427 hlen = IP_HL(ip) << 2; 3428 off = hlen; 3429 sp = (u_short *)&ip->ip_src; 3430 sum += *sp++; /* ip_src */ 3431 sum += *sp++; 3432 sum += *sp++; /* ip_dst */ 3433 sum += *sp++; 3434#ifdef USE_INET6 3435 } else if (IP_V(ip) == 6) { 3436 ip6 = (ip6_t *)ip; 3437 hlen = sizeof(*ip6); 3438 off = ((char *)fin->fin_dp - (char *)fin->fin_ip); 3439 sp = (u_short *)&ip6->ip6_src; 3440 sum += *sp++; /* ip6_src */ 3441 sum += *sp++; 3442 sum += *sp++; 3443 sum += *sp++; 3444 sum += *sp++; 3445 sum += *sp++; 3446 sum += *sp++; 3447 sum += *sp++; 3448 /* This needs to be routing header aware. */ 3449 sum += *sp++; /* ip6_dst */ 3450 sum += *sp++; 3451 sum += *sp++; 3452 sum += *sp++; 3453 sum += *sp++; 3454 sum += *sp++; 3455 sum += *sp++; 3456 sum += *sp++; 3457 } else { 3458 return 0xffff; 3459 } 3460#endif 3461 slen = fin->fin_plen - off; 3462 sum += htons(slen); 3463 3464 switch (l4proto) 3465 { 3466 case IPPROTO_UDP : 3467 csump = &((udphdr_t *)l4hdr)->uh_sum; 3468 break; 3469 3470 case IPPROTO_TCP : 3471 csump = &((tcphdr_t *)l4hdr)->th_sum; 3472 break; 3473 case IPPROTO_ICMP : 3474 csump = &((icmphdr_t *)l4hdr)->icmp_cksum; 3475 sum = 0; /* Pseudo-checksum is not included */ 3476 break; 3477#ifdef USE_INET6 3478 case IPPROTO_ICMPV6 : 3479 csump = &((struct icmp6_hdr *)l4hdr)->icmp6_cksum; 3480 break; 3481#endif 3482 default : 3483 break; 3484 } 3485 3486 if (csump != NULL) { 3487 sumsave = *csump; 3488 *csump = 0; 3489 } 3490 3491 sum2 = ipf_pcksum(fin, off, sum); 3492 if (csump != NULL) 3493 *csump = sumsave; 3494 return sum2; 3495} 3496 3497 3498/* ------------------------------------------------------------------------ */ 3499/* Function: ipf_findgroup */ 3500/* Returns: frgroup_t * - NULL = group not found, else pointer to group */ 3501/* Parameters: softc(I) - pointer to soft context main structure */ 3502/* group(I) - group name to search for */ 3503/* unit(I) - device to which this group belongs */ 3504/* set(I) - which set of rules (inactive/inactive) this is */ 3505/* fgpp(O) - pointer to place to store pointer to the pointer */ 3506/* to where to add the next (last) group or where */ 3507/* to delete group from. */ 3508/* */ 3509/* Search amongst the defined groups for a particular group number. */ 3510/* ------------------------------------------------------------------------ */ 3511frgroup_t * 3512ipf_findgroup(softc, group, unit, set, fgpp) 3513 ipf_main_softc_t *softc; 3514 char *group; 3515 minor_t unit; 3516 int set; 3517 frgroup_t ***fgpp; 3518{ 3519 frgroup_t *fg, **fgp; 3520 3521 /* 3522 * Which list of groups to search in is dependent on which list of 3523 * rules are being operated on. 3524 */ 3525 fgp = &softc->ipf_groups[unit][set]; 3526 3527 while ((fg = *fgp) != NULL) { 3528 if (strncmp(group, fg->fg_name, FR_GROUPLEN) == 0) 3529 break; 3530 else 3531 fgp = &fg->fg_next; 3532 } 3533 if (fgpp != NULL) 3534 *fgpp = fgp; 3535 return fg; 3536} 3537 3538 3539/* ------------------------------------------------------------------------ */ 3540/* Function: ipf_group_add */ 3541/* Returns: frgroup_t * - NULL == did not create group, */ 3542/* != NULL == pointer to the group */ 3543/* Parameters: softc(I) - pointer to soft context main structure */ 3544/* num(I) - group number to add */ 3545/* head(I) - rule pointer that is using this as the head */ 3546/* flags(I) - rule flags which describe the type of rule it is */ 3547/* unit(I) - device to which this group will belong to */ 3548/* set(I) - which set of rules (inactive/inactive) this is */ 3549/* Write Locks: ipf_mutex */ 3550/* */ 3551/* Add a new group head, or if it already exists, increase the reference */ 3552/* count to it. */ 3553/* ------------------------------------------------------------------------ */ 3554frgroup_t * 3555ipf_group_add(softc, group, head, flags, unit, set) 3556 ipf_main_softc_t *softc; 3557 char *group; 3558 void *head; 3559 u_32_t flags; 3560 minor_t unit; 3561 int set; 3562{ 3563 frgroup_t *fg, **fgp; 3564 u_32_t gflags; 3565 3566 if (group == NULL) 3567 return NULL; 3568 3569 if (unit == IPL_LOGIPF && *group == '\0') 3570 return NULL; 3571 3572 fgp = NULL; 3573 gflags = flags & FR_INOUT; 3574 3575 fg = ipf_findgroup(softc, group, unit, set, &fgp); 3576 if (fg != NULL) { 3577 if (fg->fg_head == NULL && head != NULL) 3578 fg->fg_head = head; 3579 if (fg->fg_flags == 0) 3580 fg->fg_flags = gflags; 3581 else if (gflags != fg->fg_flags) 3582 return NULL; 3583 fg->fg_ref++; 3584 return fg; 3585 } 3586 3587 KMALLOC(fg, frgroup_t *); 3588 if (fg != NULL) { 3589 fg->fg_head = head; 3590 fg->fg_start = NULL; 3591 fg->fg_next = *fgp; 3592 bcopy(group, fg->fg_name, strlen(group) + 1); 3593 fg->fg_flags = gflags; 3594 fg->fg_ref = 1; 3595 fg->fg_set = &softc->ipf_groups[unit][set]; 3596 *fgp = fg; 3597 } 3598 return fg; 3599} 3600 3601 3602/* ------------------------------------------------------------------------ */ 3603/* Function: ipf_group_del */ 3604/* Returns: int - number of rules deleted */ 3605/* Parameters: softc(I) - pointer to soft context main structure */ 3606/* group(I) - group name to delete */ 3607/* fr(I) - filter rule from which group is referenced */ 3608/* Write Locks: ipf_mutex */ 3609/* */ 3610/* This function is called whenever a reference to a group is to be dropped */ 3611/* and thus its reference count needs to be lowered and the group free'd if */ 3612/* the reference count reaches zero. Passing in fr is really for the sole */ 3613/* purpose of knowing when the head rule is being deleted. */ 3614/* ------------------------------------------------------------------------ */ 3615void 3616ipf_group_del(softc, group, fr) 3617 ipf_main_softc_t *softc; 3618 frgroup_t *group; 3619 frentry_t *fr; 3620{ 3621 3622 if (group->fg_head == fr) 3623 group->fg_head = NULL; 3624 3625 group->fg_ref--; 3626 if ((group->fg_ref == 0) && (group->fg_start == NULL)) 3627 ipf_group_free(group); 3628} 3629 3630 3631/* ------------------------------------------------------------------------ */ 3632/* Function: ipf_group_free */ 3633/* Returns: Nil */ 3634/* Parameters: group(I) - pointer to filter rule group */ 3635/* */ 3636/* Remove the group from the list of groups and free it. */ 3637/* ------------------------------------------------------------------------ */ 3638static void 3639ipf_group_free(group) 3640 frgroup_t *group; 3641{ 3642 frgroup_t **gp; 3643 3644 for (gp = group->fg_set; *gp != NULL; gp = &(*gp)->fg_next) { 3645 if (*gp == group) { 3646 *gp = group->fg_next; 3647 break; 3648 } 3649 } 3650 KFREE(group); 3651} 3652 3653 3654/* ------------------------------------------------------------------------ */ 3655/* Function: ipf_group_flush */ 3656/* Returns: int - number of rules flush from group */ 3657/* Parameters: softc(I) - pointer to soft context main structure */ 3658/* Parameters: group(I) - pointer to filter rule group */ 3659/* */ 3660/* Remove all of the rules that currently are listed under the given group. */ 3661/* ------------------------------------------------------------------------ */ 3662static int 3663ipf_group_flush(softc, group) 3664 ipf_main_softc_t *softc; 3665 frgroup_t *group; 3666{ 3667 int gone = 0; 3668 3669 (void) ipf_flushlist(softc, &gone, &group->fg_start); 3670 3671 return gone; 3672} 3673 3674 3675/* ------------------------------------------------------------------------ */ 3676/* Function: ipf_getrulen */ 3677/* Returns: frentry_t * - NULL == not found, else pointer to rule n */ 3678/* Parameters: softc(I) - pointer to soft context main structure */ 3679/* Parameters: unit(I) - device for which to count the rule's number */ 3680/* flags(I) - which set of rules to find the rule in */ 3681/* group(I) - group name */ 3682/* n(I) - rule number to find */ 3683/* */ 3684/* Find rule # n in group # g and return a pointer to it. Return NULl if */ 3685/* group # g doesn't exist or there are less than n rules in the group. */ 3686/* ------------------------------------------------------------------------ */ 3687frentry_t * 3688ipf_getrulen(softc, unit, group, n) 3689 ipf_main_softc_t *softc; 3690 int unit; 3691 char *group; 3692 u_32_t n; 3693{ 3694 frentry_t *fr; 3695 frgroup_t *fg; 3696 3697 fg = ipf_findgroup(softc, group, unit, softc->ipf_active, NULL); 3698 if (fg == NULL) 3699 return NULL; 3700 for (fr = fg->fg_start; fr && n; fr = fr->fr_next, n--) 3701 ; 3702 if (n != 0) 3703 return NULL; 3704 return fr; 3705} 3706 3707 3708/* ------------------------------------------------------------------------ */ 3709/* Function: ipf_flushlist */ 3710/* Returns: int - >= 0 - number of flushed rules */ 3711/* Parameters: softc(I) - pointer to soft context main structure */ 3712/* nfreedp(O) - pointer to int where flush count is stored */ 3713/* listp(I) - pointer to list to flush pointer */ 3714/* Write Locks: ipf_mutex */ 3715/* */ 3716/* Recursively flush rules from the list, descending groups as they are */ 3717/* encountered. if a rule is the head of a group and it has lost all its */ 3718/* group members, then also delete the group reference. nfreedp is needed */ 3719/* to store the accumulating count of rules removed, whereas the returned */ 3720/* value is just the number removed from the current list. The latter is */ 3721/* needed to correctly adjust reference counts on rules that define groups. */ 3722/* */ 3723/* NOTE: Rules not loaded from user space cannot be flushed. */ 3724/* ------------------------------------------------------------------------ */ 3725static int 3726ipf_flushlist(softc, nfreedp, listp) 3727 ipf_main_softc_t *softc; 3728 int *nfreedp; 3729 frentry_t **listp; 3730{ 3731 int freed = 0; 3732 frentry_t *fp; 3733 3734 while ((fp = *listp) != NULL) { 3735 if ((fp->fr_type & FR_T_BUILTIN) || 3736 !(fp->fr_flags & FR_COPIED)) { 3737 listp = &fp->fr_next; 3738 continue; 3739 } 3740 *listp = fp->fr_next; 3741 if (fp->fr_next != NULL) 3742 fp->fr_next->fr_pnext = fp->fr_pnext; 3743 fp->fr_pnext = NULL; 3744 3745 if (fp->fr_grphead != NULL) { 3746 freed += ipf_group_flush(softc, fp->fr_grphead); 3747 fp->fr_names[fp->fr_grhead] = '\0'; 3748 } 3749 3750 if (fp->fr_icmpgrp != NULL) { 3751 freed += ipf_group_flush(softc, fp->fr_icmpgrp); 3752 fp->fr_names[fp->fr_icmphead] = '\0'; 3753 } 3754 3755 if (fp->fr_srctrack.ht_max_nodes) 3756 ipf_rb_ht_flush(&fp->fr_srctrack); 3757 3758 fp->fr_next = NULL; 3759 3760 ASSERT(fp->fr_ref > 0); 3761 if (ipf_derefrule(softc, &fp) == 0) 3762 freed++; 3763 } 3764 *nfreedp += freed; 3765 return freed; 3766} 3767 3768 3769/* ------------------------------------------------------------------------ */ 3770/* Function: ipf_flush */ 3771/* Returns: int - >= 0 - number of flushed rules */ 3772/* Parameters: softc(I) - pointer to soft context main structure */ 3773/* unit(I) - device for which to flush rules */ 3774/* flags(I) - which set of rules to flush */ 3775/* */ 3776/* Calls flushlist() for all filter rules (accounting, firewall - both IPv4 */ 3777/* and IPv6) as defined by the value of flags. */ 3778/* ------------------------------------------------------------------------ */ 3779int 3780ipf_flush(softc, unit, flags) 3781 ipf_main_softc_t *softc; 3782 minor_t unit; 3783 int flags; 3784{ 3785 int flushed = 0, set; 3786 3787 WRITE_ENTER(&softc->ipf_mutex); 3788 3789 set = softc->ipf_active; 3790 if ((flags & FR_INACTIVE) == FR_INACTIVE) 3791 set = 1 - set; 3792 3793 if (flags & FR_OUTQUE) { 3794 ipf_flushlist(softc, &flushed, &softc->ipf_rules[1][set]); 3795 ipf_flushlist(softc, &flushed, &softc->ipf_acct[1][set]); 3796 } 3797 if (flags & FR_INQUE) { 3798 ipf_flushlist(softc, &flushed, &softc->ipf_rules[0][set]); 3799 ipf_flushlist(softc, &flushed, &softc->ipf_acct[0][set]); 3800 } 3801 3802 flushed += ipf_flush_groups(softc, &softc->ipf_groups[unit][set], 3803 flags & (FR_INQUE|FR_OUTQUE)); 3804 3805 RWLOCK_EXIT(&softc->ipf_mutex); 3806 3807 if (unit == IPL_LOGIPF) { 3808 int tmp; 3809 3810 tmp = ipf_flush(softc, IPL_LOGCOUNT, flags); 3811 if (tmp >= 0) 3812 flushed += tmp; 3813 } 3814 return flushed; 3815} 3816 3817 3818/* ------------------------------------------------------------------------ */ 3819/* Function: ipf_flush_groups */ 3820/* Returns: int - >= 0 - number of flushed rules */ 3821/* Parameters: softc(I) - soft context pointerto work with */ 3822/* grhead(I) - pointer to the start of the group list to flush */ 3823/* flags(I) - which set of rules to flush */ 3824/* */ 3825/* Walk through all of the groups under the given group head and remove all */ 3826/* of those that match the flags passed in. The for loop here is bit more */ 3827/* complicated than usual because the removal of a rule with ipf_derefrule */ 3828/* may end up removing not only the structure pointed to by "fg" but also */ 3829/* what is fg_next and fg_next after that. So if a filter rule is actually */ 3830/* removed from the group then it is necessary to start again. */ 3831/* ------------------------------------------------------------------------ */ 3832static int 3833ipf_flush_groups(softc, grhead, flags) 3834 ipf_main_softc_t *softc; 3835 frgroup_t **grhead; 3836 int flags; 3837{ 3838 frentry_t *fr, **frp; 3839 frgroup_t *fg, **fgp; 3840 int flushed = 0; 3841 int removed = 0; 3842 3843 for (fgp = grhead; (fg = *fgp) != NULL; ) { 3844 while ((fg != NULL) && ((fg->fg_flags & flags) == 0)) 3845 fg = fg->fg_next; 3846 if (fg == NULL) 3847 break; 3848 removed = 0; 3849 frp = &fg->fg_start; 3850 while ((removed == 0) && ((fr = *frp) != NULL)) { 3851 if ((fr->fr_flags & flags) == 0) { 3852 frp = &fr->fr_next; 3853 } else { 3854 if (fr->fr_next != NULL) 3855 fr->fr_next->fr_pnext = fr->fr_pnext; 3856 *frp = fr->fr_next; 3857 fr->fr_pnext = NULL; 3858 fr->fr_next = NULL; 3859 (void) ipf_derefrule(softc, &fr); 3860 flushed++; 3861 removed++; 3862 } 3863 } 3864 if (removed == 0) 3865 fgp = &fg->fg_next; 3866 } 3867 return flushed; 3868} 3869 3870 3871/* ------------------------------------------------------------------------ */ 3872/* Function: memstr */ 3873/* Returns: char * - NULL if failed, != NULL pointer to matching bytes */ 3874/* Parameters: src(I) - pointer to byte sequence to match */ 3875/* dst(I) - pointer to byte sequence to search */ 3876/* slen(I) - match length */ 3877/* dlen(I) - length available to search in */ 3878/* */ 3879/* Search dst for a sequence of bytes matching those at src and extend for */ 3880/* slen bytes. */ 3881/* ------------------------------------------------------------------------ */ 3882char * 3883memstr(src, dst, slen, dlen) 3884 const char *src; 3885 char *dst; 3886 size_t slen, dlen; 3887{ 3888 char *s = NULL; 3889 3890 while (dlen >= slen) { 3891 if (bcmp(src, dst, slen) == 0) { 3892 s = dst; 3893 break; 3894 } 3895 dst++; 3896 dlen--; 3897 } 3898 return s; 3899} 3900/* ------------------------------------------------------------------------ */ 3901/* Function: ipf_fixskip */ 3902/* Returns: Nil */ 3903/* Parameters: listp(IO) - pointer to start of list with skip rule */ 3904/* rp(I) - rule added/removed with skip in it. */ 3905/* addremove(I) - adjustment (-1/+1) to make to skip count, */ 3906/* depending on whether a rule was just added */ 3907/* or removed. */ 3908/* */ 3909/* Adjust all the rules in a list which would have skip'd past the position */ 3910/* where we are inserting to skip to the right place given the change. */ 3911/* ------------------------------------------------------------------------ */ 3912void 3913ipf_fixskip(listp, rp, addremove) 3914 frentry_t **listp, *rp; 3915 int addremove; 3916{ 3917 int rules, rn; 3918 frentry_t *fp; 3919 3920 rules = 0; 3921 for (fp = *listp; (fp != NULL) && (fp != rp); fp = fp->fr_next) 3922 rules++; 3923 3924 if (!fp) 3925 return; 3926 3927 for (rn = 0, fp = *listp; fp && (fp != rp); fp = fp->fr_next, rn++) 3928 if (FR_ISSKIP(fp->fr_flags) && (rn + fp->fr_arg >= rules)) 3929 fp->fr_arg += addremove; 3930} 3931 3932 3933#ifdef _KERNEL 3934/* ------------------------------------------------------------------------ */ 3935/* Function: count4bits */ 3936/* Returns: int - >= 0 - number of consecutive bits in input */ 3937/* Parameters: ip(I) - 32bit IP address */ 3938/* */ 3939/* IPv4 ONLY */ 3940/* count consecutive 1's in bit mask. If the mask generated by counting */ 3941/* consecutive 1's is different to that passed, return -1, else return # */ 3942/* of bits. */ 3943/* ------------------------------------------------------------------------ */ 3944int 3945count4bits(ip) 3946 u_32_t ip; 3947{ 3948 u_32_t ipn; 3949 int cnt = 0, i, j; 3950 3951 ip = ipn = ntohl(ip); 3952 for (i = 32; i; i--, ipn *= 2) 3953 if (ipn & 0x80000000) 3954 cnt++; 3955 else 3956 break; 3957 ipn = 0; 3958 for (i = 32, j = cnt; i; i--, j--) { 3959 ipn *= 2; 3960 if (j > 0) 3961 ipn++; 3962 } 3963 if (ipn == ip) 3964 return cnt; 3965 return -1; 3966} 3967 3968 3969/* ------------------------------------------------------------------------ */ 3970/* Function: count6bits */ 3971/* Returns: int - >= 0 - number of consecutive bits in input */ 3972/* Parameters: msk(I) - pointer to start of IPv6 bitmask */ 3973/* */ 3974/* IPv6 ONLY */ 3975/* count consecutive 1's in bit mask. */ 3976/* ------------------------------------------------------------------------ */ 3977# ifdef USE_INET6 3978int 3979count6bits(msk) 3980 u_32_t *msk; 3981{ 3982 int i = 0, k; 3983 u_32_t j; 3984 3985 for (k = 3; k >= 0; k--) 3986 if (msk[k] == 0xffffffff) 3987 i += 32; 3988 else { 3989 for (j = msk[k]; j; j <<= 1) 3990 if (j & 0x80000000) 3991 i++; 3992 } 3993 return i; 3994} 3995# endif 3996#endif /* _KERNEL */ 3997 3998 3999/* ------------------------------------------------------------------------ */ 4000/* Function: ipf_synclist */ 4001/* Returns: int - 0 = no failures, else indication of first failure */ 4002/* Parameters: fr(I) - start of filter list to sync interface names for */ 4003/* ifp(I) - interface pointer for limiting sync lookups */ 4004/* Write Locks: ipf_mutex */ 4005/* */ 4006/* Walk through a list of filter rules and resolve any interface names into */ 4007/* pointers. Where dynamic addresses are used, also update the IP address */ 4008/* used in the rule. The interface pointer is used to limit the lookups to */ 4009/* a specific set of matching names if it is non-NULL. */ 4010/* Errors can occur when resolving the destination name of to/dup-to fields */ 4011/* when the name points to a pool and that pool doest not exist. If this */ 4012/* does happen then it is necessary to check if there are any lookup refs */ 4013/* that need to be dropped before returning with an error. */ 4014/* ------------------------------------------------------------------------ */ 4015static int 4016ipf_synclist(softc, fr, ifp) 4017 ipf_main_softc_t *softc; 4018 frentry_t *fr; 4019 void *ifp; 4020{ 4021 frentry_t *frt, *start = fr; 4022 frdest_t *fdp; 4023 char *name; 4024 int error; 4025 void *ifa; 4026 int v, i; 4027 4028 error = 0; 4029 4030 for (; fr; fr = fr->fr_next) { 4031 if (fr->fr_family == AF_INET) 4032 v = 4; 4033 else if (fr->fr_family == AF_INET6) 4034 v = 6; 4035 else 4036 v = 0; 4037 4038 /* 4039 * Lookup all the interface names that are part of the rule. 4040 */ 4041 for (i = 0; i < 4; i++) { 4042 if ((ifp != NULL) && (fr->fr_ifas[i] != ifp)) 4043 continue; 4044 if (fr->fr_ifnames[i] == -1) 4045 continue; 4046 name = FR_NAME(fr, fr_ifnames[i]); 4047 fr->fr_ifas[i] = ipf_resolvenic(softc, name, v); 4048 } 4049 4050 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) { 4051 if (fr->fr_satype != FRI_NORMAL && 4052 fr->fr_satype != FRI_LOOKUP) { 4053 ifa = ipf_resolvenic(softc, fr->fr_names + 4054 fr->fr_sifpidx, v); 4055 ipf_ifpaddr(softc, v, fr->fr_satype, ifa, 4056 &fr->fr_src6, &fr->fr_smsk6); 4057 } 4058 if (fr->fr_datype != FRI_NORMAL && 4059 fr->fr_datype != FRI_LOOKUP) { 4060 ifa = ipf_resolvenic(softc, fr->fr_names + 4061 fr->fr_sifpidx, v); 4062 ipf_ifpaddr(softc, v, fr->fr_datype, ifa, 4063 &fr->fr_dst6, &fr->fr_dmsk6); 4064 } 4065 } 4066 4067 fdp = &fr->fr_tifs[0]; 4068 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) { 4069 error = ipf_resolvedest(softc, fr->fr_names, fdp, v); 4070 if (error != 0) 4071 goto unwind; 4072 } 4073 4074 fdp = &fr->fr_tifs[1]; 4075 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) { 4076 error = ipf_resolvedest(softc, fr->fr_names, fdp, v); 4077 if (error != 0) 4078 goto unwind; 4079 } 4080 4081 fdp = &fr->fr_dif; 4082 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) { 4083 error = ipf_resolvedest(softc, fr->fr_names, fdp, v); 4084 if (error != 0) 4085 goto unwind; 4086 } 4087 4088 if (((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) && 4089 (fr->fr_satype == FRI_LOOKUP) && (fr->fr_srcptr == NULL)) { 4090 fr->fr_srcptr = ipf_lookup_res_num(softc, 4091 fr->fr_srctype, 4092 IPL_LOGIPF, 4093 fr->fr_srcnum, 4094 &fr->fr_srcfunc); 4095 } 4096 if (((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) && 4097 (fr->fr_datype == FRI_LOOKUP) && (fr->fr_dstptr == NULL)) { 4098 fr->fr_dstptr = ipf_lookup_res_num(softc, 4099 fr->fr_dsttype, 4100 IPL_LOGIPF, 4101 fr->fr_dstnum, 4102 &fr->fr_dstfunc); 4103 } 4104 } 4105 return 0; 4106 4107unwind: 4108 for (frt = start; frt != fr; fr = fr->fr_next) { 4109 if (((frt->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) && 4110 (frt->fr_satype == FRI_LOOKUP) && (frt->fr_srcptr != NULL)) 4111 ipf_lookup_deref(softc, frt->fr_srctype, 4112 frt->fr_srcptr); 4113 if (((frt->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) && 4114 (frt->fr_datype == FRI_LOOKUP) && (frt->fr_dstptr != NULL)) 4115 ipf_lookup_deref(softc, frt->fr_dsttype, 4116 frt->fr_dstptr); 4117 } 4118 return error; 4119} 4120 4121 4122/* ------------------------------------------------------------------------ */ 4123/* Function: ipf_sync */ 4124/* Returns: void */ 4125/* Parameters: Nil */ 4126/* */ 4127/* ipf_sync() is called when we suspect that the interface list or */ 4128/* information about interfaces (like IP#) has changed. Go through all */ 4129/* filter rules, NAT entries and the state table and check if anything */ 4130/* needs to be changed/updated. */ 4131/* ------------------------------------------------------------------------ */ 4132int 4133ipf_sync(softc, ifp) 4134 ipf_main_softc_t *softc; 4135 void *ifp; 4136{ 4137 int i; 4138 4139# if !SOLARIS 4140 ipf_nat_sync(softc, ifp); 4141 ipf_state_sync(softc, ifp); 4142 ipf_lookup_sync(softc, ifp); 4143# endif 4144 4145 WRITE_ENTER(&softc->ipf_mutex); 4146 (void) ipf_synclist(softc, softc->ipf_acct[0][softc->ipf_active], ifp); 4147 (void) ipf_synclist(softc, softc->ipf_acct[1][softc->ipf_active], ifp); 4148 (void) ipf_synclist(softc, softc->ipf_rules[0][softc->ipf_active], ifp); 4149 (void) ipf_synclist(softc, softc->ipf_rules[1][softc->ipf_active], ifp); 4150 4151 for (i = 0; i < IPL_LOGSIZE; i++) { 4152 frgroup_t *g; 4153 4154 for (g = softc->ipf_groups[i][0]; g != NULL; g = g->fg_next) 4155 (void) ipf_synclist(softc, g->fg_start, ifp); 4156 for (g = softc->ipf_groups[i][1]; g != NULL; g = g->fg_next) 4157 (void) ipf_synclist(softc, g->fg_start, ifp); 4158 } 4159 RWLOCK_EXIT(&softc->ipf_mutex); 4160 4161 return 0; 4162} 4163 4164 4165/* 4166 * In the functions below, bcopy() is called because the pointer being 4167 * copied _from_ in this instance is a pointer to a char buf (which could 4168 * end up being unaligned) and on the kernel's local stack. 4169 */ 4170/* ------------------------------------------------------------------------ */ 4171/* Function: copyinptr */ 4172/* Returns: int - 0 = success, else failure */ 4173/* Parameters: src(I) - pointer to the source address */ 4174/* dst(I) - destination address */ 4175/* size(I) - number of bytes to copy */ 4176/* */ 4177/* Copy a block of data in from user space, given a pointer to the pointer */ 4178/* to start copying from (src) and a pointer to where to store it (dst). */ 4179/* NB: src - pointer to user space pointer, dst - kernel space pointer */ 4180/* ------------------------------------------------------------------------ */ 4181int 4182copyinptr(softc, src, dst, size) 4183 ipf_main_softc_t *softc; 4184 void *src, *dst; 4185 size_t size; 4186{ 4187 caddr_t ca; 4188 int error; 4189 4190# if SOLARIS 4191 error = COPYIN(src, &ca, sizeof(ca)); 4192 if (error != 0) 4193 return error; 4194# else 4195 bcopy(src, (caddr_t)&ca, sizeof(ca)); 4196# endif 4197 error = COPYIN(ca, dst, size); 4198 if (error != 0) { 4199 IPFERROR(3); 4200 error = EFAULT; 4201 } 4202 return error; 4203} 4204 4205 4206/* ------------------------------------------------------------------------ */ 4207/* Function: copyoutptr */ 4208/* Returns: int - 0 = success, else failure */ 4209/* Parameters: src(I) - pointer to the source address */ 4210/* dst(I) - destination address */ 4211/* size(I) - number of bytes to copy */ 4212/* */ 4213/* Copy a block of data out to user space, given a pointer to the pointer */ 4214/* to start copying from (src) and a pointer to where to store it (dst). */ 4215/* NB: src - kernel space pointer, dst - pointer to user space pointer. */ 4216/* ------------------------------------------------------------------------ */ 4217int 4218copyoutptr(softc, src, dst, size) 4219 ipf_main_softc_t *softc; 4220 void *src, *dst; 4221 size_t size; 4222{ 4223 caddr_t ca; 4224 int error; 4225 4226 bcopy(dst, (caddr_t)&ca, sizeof(ca)); 4227 error = COPYOUT(src, ca, size); 4228 if (error != 0) { 4229 IPFERROR(4); 4230 error = EFAULT; 4231 } 4232 return error; 4233} 4234#ifdef _KERNEL 4235#endif 4236 4237 4238/* ------------------------------------------------------------------------ */ 4239/* Function: ipf_lock */ 4240/* Returns: int - 0 = success, else error */ 4241/* Parameters: data(I) - pointer to lock value to set */ 4242/* lockp(O) - pointer to location to store old lock value */ 4243/* */ 4244/* Get the new value for the lock integer, set it and return the old value */ 4245/* in *lockp. */ 4246/* ------------------------------------------------------------------------ */ 4247int 4248ipf_lock(data, lockp) 4249 caddr_t data; 4250 int *lockp; 4251{ 4252 int arg, err; 4253 4254 err = BCOPYIN(data, &arg, sizeof(arg)); 4255 if (err != 0) 4256 return EFAULT; 4257 err = BCOPYOUT(lockp, data, sizeof(*lockp)); 4258 if (err != 0) 4259 return EFAULT; 4260 *lockp = arg; 4261 return 0; 4262} 4263 4264 4265/* ------------------------------------------------------------------------ */ 4266/* Function: ipf_getstat */ 4267/* Returns: Nil */ 4268/* Parameters: softc(I) - pointer to soft context main structure */ 4269/* fiop(I) - pointer to ipfilter stats structure */ 4270/* rev(I) - version claim by program doing ioctl */ 4271/* */ 4272/* Stores a copy of current pointers, counters, etc, in the friostat */ 4273/* structure. */ 4274/* If IPFILTER_COMPAT is compiled, we pretend to be whatever version the */ 4275/* program is looking for. This ensure that validation of the version it */ 4276/* expects will always succeed. Thus kernels with IPFILTER_COMPAT will */ 4277/* allow older binaries to work but kernels without it will not. */ 4278/* ------------------------------------------------------------------------ */ 4279/*ARGSUSED*/ 4280static void 4281ipf_getstat(softc, fiop, rev) 4282 ipf_main_softc_t *softc; 4283 friostat_t *fiop; 4284 int rev; 4285{ 4286 int i; 4287 4288 bcopy((char *)softc->ipf_stats, (char *)fiop->f_st, 4289 sizeof(ipf_statistics_t) * 2); 4290 fiop->f_locks[IPL_LOGSTATE] = -1; 4291 fiop->f_locks[IPL_LOGNAT] = -1; 4292 fiop->f_locks[IPL_LOGIPF] = -1; 4293 fiop->f_locks[IPL_LOGAUTH] = -1; 4294 4295 fiop->f_ipf[0][0] = softc->ipf_rules[0][0]; 4296 fiop->f_acct[0][0] = softc->ipf_acct[0][0]; 4297 fiop->f_ipf[0][1] = softc->ipf_rules[0][1]; 4298 fiop->f_acct[0][1] = softc->ipf_acct[0][1]; 4299 fiop->f_ipf[1][0] = softc->ipf_rules[1][0]; 4300 fiop->f_acct[1][0] = softc->ipf_acct[1][0]; 4301 fiop->f_ipf[1][1] = softc->ipf_rules[1][1]; 4302 fiop->f_acct[1][1] = softc->ipf_acct[1][1]; 4303 4304 fiop->f_ticks = softc->ipf_ticks; 4305 fiop->f_active = softc->ipf_active; 4306 fiop->f_froute[0] = softc->ipf_frouteok[0]; 4307 fiop->f_froute[1] = softc->ipf_frouteok[1]; 4308 fiop->f_rb_no_mem = softc->ipf_rb_no_mem; 4309 fiop->f_rb_node_max = softc->ipf_rb_node_max; 4310 4311 fiop->f_running = softc->ipf_running; 4312 for (i = 0; i < IPL_LOGSIZE; i++) { 4313 fiop->f_groups[i][0] = softc->ipf_groups[i][0]; 4314 fiop->f_groups[i][1] = softc->ipf_groups[i][1]; 4315 } 4316#ifdef IPFILTER_LOG 4317 fiop->f_log_ok = ipf_log_logok(softc, IPL_LOGIPF); 4318 fiop->f_log_fail = ipf_log_failures(softc, IPL_LOGIPF); 4319 fiop->f_logging = 1; 4320#else 4321 fiop->f_log_ok = 0; 4322 fiop->f_log_fail = 0; 4323 fiop->f_logging = 0; 4324#endif 4325 fiop->f_defpass = softc->ipf_pass; 4326 fiop->f_features = ipf_features; 4327 4328#ifdef IPFILTER_COMPAT 4329 sprintf(fiop->f_version, "IP Filter: v%d.%d.%d", 4330 (rev / 1000000) % 100, 4331 (rev / 10000) % 100, 4332 (rev / 100) % 100); 4333#else 4334 rev = rev; 4335 (void) strncpy(fiop->f_version, ipfilter_version, 4336 sizeof(fiop->f_version)); 4337#endif 4338} 4339 4340 4341#ifdef USE_INET6 4342int icmptoicmp6types[ICMP_MAXTYPE+1] = { 4343 ICMP6_ECHO_REPLY, /* 0: ICMP_ECHOREPLY */ 4344 -1, /* 1: UNUSED */ 4345 -1, /* 2: UNUSED */ 4346 ICMP6_DST_UNREACH, /* 3: ICMP_UNREACH */ 4347 -1, /* 4: ICMP_SOURCEQUENCH */ 4348 ND_REDIRECT, /* 5: ICMP_REDIRECT */ 4349 -1, /* 6: UNUSED */ 4350 -1, /* 7: UNUSED */ 4351 ICMP6_ECHO_REQUEST, /* 8: ICMP_ECHO */ 4352 -1, /* 9: UNUSED */ 4353 -1, /* 10: UNUSED */ 4354 ICMP6_TIME_EXCEEDED, /* 11: ICMP_TIMXCEED */ 4355 ICMP6_PARAM_PROB, /* 12: ICMP_PARAMPROB */ 4356 -1, /* 13: ICMP_TSTAMP */ 4357 -1, /* 14: ICMP_TSTAMPREPLY */ 4358 -1, /* 15: ICMP_IREQ */ 4359 -1, /* 16: ICMP_IREQREPLY */ 4360 -1, /* 17: ICMP_MASKREQ */ 4361 -1, /* 18: ICMP_MASKREPLY */ 4362}; 4363 4364 4365int icmptoicmp6unreach[ICMP_MAX_UNREACH] = { 4366 ICMP6_DST_UNREACH_ADDR, /* 0: ICMP_UNREACH_NET */ 4367 ICMP6_DST_UNREACH_ADDR, /* 1: ICMP_UNREACH_HOST */ 4368 -1, /* 2: ICMP_UNREACH_PROTOCOL */ 4369 ICMP6_DST_UNREACH_NOPORT, /* 3: ICMP_UNREACH_PORT */ 4370 -1, /* 4: ICMP_UNREACH_NEEDFRAG */ 4371 ICMP6_DST_UNREACH_NOTNEIGHBOR, /* 5: ICMP_UNREACH_SRCFAIL */ 4372 ICMP6_DST_UNREACH_ADDR, /* 6: ICMP_UNREACH_NET_UNKNOWN */ 4373 ICMP6_DST_UNREACH_ADDR, /* 7: ICMP_UNREACH_HOST_UNKNOWN */ 4374 -1, /* 8: ICMP_UNREACH_ISOLATED */ 4375 ICMP6_DST_UNREACH_ADMIN, /* 9: ICMP_UNREACH_NET_PROHIB */ 4376 ICMP6_DST_UNREACH_ADMIN, /* 10: ICMP_UNREACH_HOST_PROHIB */ 4377 -1, /* 11: ICMP_UNREACH_TOSNET */ 4378 -1, /* 12: ICMP_UNREACH_TOSHOST */ 4379 ICMP6_DST_UNREACH_ADMIN, /* 13: ICMP_UNREACH_ADMIN_PROHIBIT */ 4380}; 4381int icmpreplytype6[ICMP6_MAXTYPE + 1]; 4382#endif 4383 4384int icmpreplytype4[ICMP_MAXTYPE + 1]; 4385 4386 4387/* ------------------------------------------------------------------------ */ 4388/* Function: ipf_matchicmpqueryreply */ 4389/* Returns: int - 1 if "icmp" is a valid reply to "ic" else 0. */ 4390/* Parameters: v(I) - IP protocol version (4 or 6) */ 4391/* ic(I) - ICMP information */ 4392/* icmp(I) - ICMP packet header */ 4393/* rev(I) - direction (0 = forward/1 = reverse) of packet */ 4394/* */ 4395/* Check if the ICMP packet defined by the header pointed to by icmp is a */ 4396/* reply to one as described by what's in ic. If it is a match, return 1, */ 4397/* else return 0 for no match. */ 4398/* ------------------------------------------------------------------------ */ 4399int 4400ipf_matchicmpqueryreply(v, ic, icmp, rev) 4401 int v; 4402 icmpinfo_t *ic; 4403 icmphdr_t *icmp; 4404 int rev; 4405{ 4406 int ictype; 4407 4408 ictype = ic->ici_type; 4409 4410 if (v == 4) { 4411 /* 4412 * If we matched its type on the way in, then when going out 4413 * it will still be the same type. 4414 */ 4415 if ((!rev && (icmp->icmp_type == ictype)) || 4416 (rev && (icmpreplytype4[ictype] == icmp->icmp_type))) { 4417 if (icmp->icmp_type != ICMP_ECHOREPLY) 4418 return 1; 4419 if (icmp->icmp_id == ic->ici_id) 4420 return 1; 4421 } 4422 } 4423#ifdef USE_INET6 4424 else if (v == 6) { 4425 if ((!rev && (icmp->icmp_type == ictype)) || 4426 (rev && (icmpreplytype6[ictype] == icmp->icmp_type))) { 4427 if (icmp->icmp_type != ICMP6_ECHO_REPLY) 4428 return 1; 4429 if (icmp->icmp_id == ic->ici_id) 4430 return 1; 4431 } 4432 } 4433#endif 4434 return 0; 4435} 4436 4437 4438/* ------------------------------------------------------------------------ */ 4439/* Function: ipf_rule_compare */ 4440/* Parameters: fr1(I) - first rule structure to compare */ 4441/* fr2(I) - second rule structure to compare */ 4442/* Returns: int - 0 == rules are the same, else mismatch */ 4443/* */ 4444/* Compare two rules and return 0 if they match or a number indicating */ 4445/* which of the individual checks failed. */ 4446/* ------------------------------------------------------------------------ */ 4447static int 4448ipf_rule_compare(frentry_t *fr1, frentry_t *fr2) 4449{ 4450 if (fr1->fr_cksum != fr2->fr_cksum) 4451 return 1; 4452 if (fr1->fr_size != fr2->fr_size) 4453 return 2; 4454 if (fr1->fr_dsize != fr2->fr_dsize) 4455 return 3; 4456 if (bcmp((char *)&fr1->fr_func, (char *)&fr2->fr_func, 4457 fr1->fr_size - offsetof(struct frentry, fr_func)) != 0) 4458 return 4; 4459 if (fr1->fr_data && !fr2->fr_data) 4460 return 5; 4461 if (!fr1->fr_data && fr2->fr_data) 4462 return 6; 4463 if (fr1->fr_data) { 4464 if (bcmp(fr1->fr_caddr, fr2->fr_caddr, fr1->fr_dsize)) 4465 return 7; 4466 } 4467 return 0; 4468} 4469 4470 4471/* ------------------------------------------------------------------------ */ 4472/* Function: frrequest */ 4473/* Returns: int - 0 == success, > 0 == errno value */ 4474/* Parameters: unit(I) - device for which this is for */ 4475/* req(I) - ioctl command (SIOC*) */ 4476/* data(I) - pointr to ioctl data */ 4477/* set(I) - 1 or 0 (filter set) */ 4478/* makecopy(I) - flag indicating whether data points to a rule */ 4479/* in kernel space & hence doesn't need copying. */ 4480/* */ 4481/* This function handles all the requests which operate on the list of */ 4482/* filter rules. This includes adding, deleting, insertion. It is also */ 4483/* responsible for creating groups when a "head" rule is loaded. Interface */ 4484/* names are resolved here and other sanity checks are made on the content */ 4485/* of the rule structure being loaded. If a rule has user defined timeouts */ 4486/* then make sure they are created and initialised before exiting. */ 4487/* ------------------------------------------------------------------------ */ 4488int 4489frrequest(softc, unit, req, data, set, makecopy) 4490 ipf_main_softc_t *softc; 4491 int unit; 4492 ioctlcmd_t req; 4493 int set, makecopy; 4494 caddr_t data; 4495{ 4496 int error = 0, in, family, addrem, need_free = 0; 4497 frentry_t frd, *fp, *f, **fprev, **ftail; 4498 void *ptr, *uptr, *cptr; 4499 u_int *p, *pp; 4500 frgroup_t *fg; 4501 char *group; 4502 4503 ptr = NULL; 4504 cptr = NULL; 4505 fg = NULL; 4506 fp = &frd; 4507 if (makecopy != 0) { 4508 bzero(fp, sizeof(frd)); 4509 error = ipf_inobj(softc, data, NULL, fp, IPFOBJ_FRENTRY); 4510 if (error) { 4511 return error; 4512 } 4513 if ((fp->fr_type & FR_T_BUILTIN) != 0) { 4514 IPFERROR(6); 4515 return EINVAL; 4516 } 4517 KMALLOCS(f, frentry_t *, fp->fr_size); 4518 if (f == NULL) { 4519 IPFERROR(131); 4520 return ENOMEM; 4521 } 4522 bzero(f, fp->fr_size); 4523 error = ipf_inobjsz(softc, data, f, IPFOBJ_FRENTRY, 4524 fp->fr_size); 4525 if (error) { 4526 KFREES(f, fp->fr_size); 4527 return error; 4528 } 4529 4530 fp = f; 4531 f = NULL; 4532 fp->fr_next = NULL; 4533 fp->fr_dnext = NULL; 4534 fp->fr_pnext = NULL; 4535 fp->fr_pdnext = NULL; 4536 fp->fr_grp = NULL; 4537 fp->fr_grphead = NULL; 4538 fp->fr_icmpgrp = NULL; 4539 fp->fr_isc = (void *)-1; 4540 fp->fr_ptr = NULL; 4541 fp->fr_ref = 0; 4542 fp->fr_flags |= FR_COPIED; 4543 } else { 4544 fp = (frentry_t *)data; 4545 if ((fp->fr_type & FR_T_BUILTIN) == 0) { 4546 IPFERROR(7); 4547 return EINVAL; 4548 } 4549 fp->fr_flags &= ~FR_COPIED; 4550 } 4551 4552 if (((fp->fr_dsize == 0) && (fp->fr_data != NULL)) || 4553 ((fp->fr_dsize != 0) && (fp->fr_data == NULL))) { 4554 IPFERROR(8); 4555 error = EINVAL; 4556 goto donenolock; 4557 } 4558 4559 family = fp->fr_family; 4560 uptr = fp->fr_data; 4561 4562 if (req == (ioctlcmd_t)SIOCINAFR || req == (ioctlcmd_t)SIOCINIFR || 4563 req == (ioctlcmd_t)SIOCADAFR || req == (ioctlcmd_t)SIOCADIFR) 4564 addrem = 0; 4565 else if (req == (ioctlcmd_t)SIOCRMAFR || req == (ioctlcmd_t)SIOCRMIFR) 4566 addrem = 1; 4567 else if (req == (ioctlcmd_t)SIOCZRLST) 4568 addrem = 2; 4569 else { 4570 IPFERROR(9); 4571 error = EINVAL; 4572 goto donenolock; 4573 } 4574 4575 /* 4576 * Only filter rules for IPv4 or IPv6 are accepted. 4577 */ 4578 if (family == AF_INET) { 4579 /*EMPTY*/; 4580#ifdef USE_INET6 4581 } else if (family == AF_INET6) { 4582 /*EMPTY*/; 4583#endif 4584 } else if (family != 0) { 4585 IPFERROR(10); 4586 error = EINVAL; 4587 goto donenolock; 4588 } 4589 4590 /* 4591 * If the rule is being loaded from user space, i.e. we had to copy it 4592 * into kernel space, then do not trust the function pointer in the 4593 * rule. 4594 */ 4595 if ((makecopy == 1) && (fp->fr_func != NULL)) { 4596 if (ipf_findfunc(fp->fr_func) == NULL) { 4597 IPFERROR(11); 4598 error = ESRCH; 4599 goto donenolock; 4600 } 4601 4602 if (addrem == 0) { 4603 error = ipf_funcinit(softc, fp); 4604 if (error != 0) 4605 goto donenolock; 4606 } 4607 } 4608 if ((fp->fr_flags & FR_CALLNOW) && 4609 ((fp->fr_func == NULL) || (fp->fr_func == (ipfunc_t)-1))) { 4610 IPFERROR(142); 4611 error = ESRCH; 4612 goto donenolock; 4613 } 4614 if (((fp->fr_flags & FR_CMDMASK) == FR_CALL) && 4615 ((fp->fr_func == NULL) || (fp->fr_func == (ipfunc_t)-1))) { 4616 IPFERROR(143); 4617 error = ESRCH; 4618 goto donenolock; 4619 } 4620 4621 ptr = NULL; 4622 cptr = NULL; 4623 4624 if (FR_ISACCOUNT(fp->fr_flags)) 4625 unit = IPL_LOGCOUNT; 4626 4627 /* 4628 * Check that each group name in the rule has a start index that 4629 * is valid. 4630 */ 4631 if (fp->fr_icmphead != -1) { 4632 if ((fp->fr_icmphead < 0) || 4633 (fp->fr_icmphead >= fp->fr_namelen)) { 4634 IPFERROR(136); 4635 error = EINVAL; 4636 goto donenolock; 4637 } 4638 if (!strcmp(FR_NAME(fp, fr_icmphead), "0")) 4639 fp->fr_names[fp->fr_icmphead] = '\0'; 4640 } 4641 4642 if (fp->fr_grhead != -1) { 4643 if ((fp->fr_grhead < 0) || 4644 (fp->fr_grhead >= fp->fr_namelen)) { 4645 IPFERROR(137); 4646 error = EINVAL; 4647 goto donenolock; 4648 } 4649 if (!strcmp(FR_NAME(fp, fr_grhead), "0")) 4650 fp->fr_names[fp->fr_grhead] = '\0'; 4651 } 4652 4653 if (fp->fr_group != -1) { 4654 if ((fp->fr_group < 0) || 4655 (fp->fr_group >= fp->fr_namelen)) { 4656 IPFERROR(138); 4657 error = EINVAL; 4658 goto donenolock; 4659 } 4660 if ((req != (int)SIOCZRLST) && (fp->fr_group != -1)) { 4661 /* 4662 * Allow loading rules that are in groups to cause 4663 * them to be created if they don't already exit. 4664 */ 4665 group = FR_NAME(fp, fr_group); 4666 if (addrem == 0) { 4667 fg = ipf_group_add(softc, group, NULL, 4668 fp->fr_flags, unit, set); 4669 fp->fr_grp = fg; 4670 } else { 4671 fg = ipf_findgroup(softc, group, unit, 4672 set, NULL); 4673 if (fg == NULL) { 4674 IPFERROR(12); 4675 error = ESRCH; 4676 goto donenolock; 4677 } 4678 } 4679 4680 if (fg->fg_flags == 0) { 4681 fg->fg_flags = fp->fr_flags & FR_INOUT; 4682 } else if (fg->fg_flags != (fp->fr_flags & FR_INOUT)) { 4683 IPFERROR(13); 4684 error = ESRCH; 4685 goto donenolock; 4686 } 4687 } 4688 } else { 4689 /* 4690 * If a rule is going to be part of a group then it does 4691 * not matter whether it is an in or out rule, but if it 4692 * isn't in a group, then it does... 4693 */ 4694 if ((fp->fr_flags & (FR_INQUE|FR_OUTQUE)) == 0) { 4695 IPFERROR(14); 4696 error = EINVAL; 4697 goto donenolock; 4698 } 4699 } 4700 in = (fp->fr_flags & FR_INQUE) ? 0 : 1; 4701 4702 /* 4703 * Work out which rule list this change is being applied to. 4704 */ 4705 ftail = NULL; 4706 fprev = NULL; 4707 if (unit == IPL_LOGAUTH) { 4708 if ((fp->fr_tifs[0].fd_ptr != NULL) || 4709 (fp->fr_tifs[1].fd_ptr != NULL) || 4710 (fp->fr_dif.fd_ptr != NULL) || 4711 (fp->fr_flags & FR_FASTROUTE)) { 4712 softc->ipf_interror = 145; 4713 error = EINVAL; 4714 goto donenolock; 4715 } 4716 fprev = ipf_auth_rulehead(softc); 4717 } else { 4718 if (FR_ISACCOUNT(fp->fr_flags)) 4719 fprev = &softc->ipf_acct[in][set]; 4720 else if ((fp->fr_flags & (FR_OUTQUE|FR_INQUE)) != 0) 4721 fprev = &softc->ipf_rules[in][set]; 4722 } 4723 if (fprev == NULL) { 4724 IPFERROR(15); 4725 error = ESRCH; 4726 goto donenolock; 4727 } 4728 4729 if (fg != NULL) 4730 fprev = &fg->fg_start; 4731 4732 /* 4733 * Copy in extra data for the rule. 4734 */ 4735 if (fp->fr_dsize != 0) { 4736 if (makecopy != 0) { 4737 KMALLOCS(ptr, void *, fp->fr_dsize); 4738 if (ptr == NULL) { 4739 IPFERROR(16); 4740 error = ENOMEM; 4741 goto donenolock; 4742 } 4743 4744 /* 4745 * The bcopy case is for when the data is appended 4746 * to the rule by ipf_in_compat(). 4747 */ 4748 if (uptr >= (void *)fp && 4749 uptr < (void *)((char *)fp + fp->fr_size)) { 4750 bcopy(uptr, ptr, fp->fr_dsize); 4751 error = 0; 4752 } else { 4753 error = COPYIN(uptr, ptr, fp->fr_dsize); 4754 if (error != 0) { 4755 IPFERROR(17); 4756 error = EFAULT; 4757 goto donenolock; 4758 } 4759 } 4760 } else { 4761 ptr = uptr; 4762 } 4763 fp->fr_data = ptr; 4764 } else { 4765 fp->fr_data = NULL; 4766 } 4767 4768 /* 4769 * Perform per-rule type sanity checks of their members. 4770 * All code after this needs to be aware that allocated memory 4771 * may need to be free'd before exiting. 4772 */ 4773 switch (fp->fr_type & ~FR_T_BUILTIN) 4774 { 4775#if defined(IPFILTER_BPF) 4776 case FR_T_BPFOPC : 4777 if (fp->fr_dsize == 0) { 4778 IPFERROR(19); 4779 error = EINVAL; 4780 break; 4781 } 4782 if (!bpf_validate(ptr, fp->fr_dsize/sizeof(struct bpf_insn))) { 4783 IPFERROR(20); 4784 error = EINVAL; 4785 break; 4786 } 4787 break; 4788#endif 4789 case FR_T_IPF : 4790 /* 4791 * Preparation for error case at the bottom of this function. 4792 */ 4793 if (fp->fr_datype == FRI_LOOKUP) 4794 fp->fr_dstptr = NULL; 4795 if (fp->fr_satype == FRI_LOOKUP) 4796 fp->fr_srcptr = NULL; 4797 4798 if (fp->fr_dsize != sizeof(fripf_t)) { 4799 IPFERROR(21); 4800 error = EINVAL; 4801 break; 4802 } 4803 4804 /* 4805 * Allowing a rule with both "keep state" and "with oow" is 4806 * pointless because adding a state entry to the table will 4807 * fail with the out of window (oow) flag set. 4808 */ 4809 if ((fp->fr_flags & FR_KEEPSTATE) && (fp->fr_flx & FI_OOW)) { 4810 IPFERROR(22); 4811 error = EINVAL; 4812 break; 4813 } 4814 4815 switch (fp->fr_satype) 4816 { 4817 case FRI_BROADCAST : 4818 case FRI_DYNAMIC : 4819 case FRI_NETWORK : 4820 case FRI_NETMASKED : 4821 case FRI_PEERADDR : 4822 if (fp->fr_sifpidx < 0) { 4823 IPFERROR(23); 4824 error = EINVAL; 4825 } 4826 break; 4827 case FRI_LOOKUP : 4828 fp->fr_srcptr = ipf_findlookup(softc, unit, fp, 4829 &fp->fr_src6, 4830 &fp->fr_smsk6); 4831 if (fp->fr_srcfunc == NULL) { 4832 IPFERROR(132); 4833 error = ESRCH; 4834 break; 4835 } 4836 break; 4837 case FRI_NORMAL : 4838 break; 4839 default : 4840 IPFERROR(133); 4841 error = EINVAL; 4842 break; 4843 } 4844 if (error != 0) 4845 break; 4846 4847 switch (fp->fr_datype) 4848 { 4849 case FRI_BROADCAST : 4850 case FRI_DYNAMIC : 4851 case FRI_NETWORK : 4852 case FRI_NETMASKED : 4853 case FRI_PEERADDR : 4854 if (fp->fr_difpidx < 0) { 4855 IPFERROR(24); 4856 error = EINVAL; 4857 } 4858 break; 4859 case FRI_LOOKUP : 4860 fp->fr_dstptr = ipf_findlookup(softc, unit, fp, 4861 &fp->fr_dst6, 4862 &fp->fr_dmsk6); 4863 if (fp->fr_dstfunc == NULL) { 4864 IPFERROR(134); 4865 error = ESRCH; 4866 } 4867 break; 4868 case FRI_NORMAL : 4869 break; 4870 default : 4871 IPFERROR(135); 4872 error = EINVAL; 4873 } 4874 break; 4875 4876 case FR_T_NONE : 4877 case FR_T_CALLFUNC : 4878 case FR_T_COMPIPF : 4879 break; 4880 4881 case FR_T_IPFEXPR : 4882 if (ipf_matcharray_verify(fp->fr_data, fp->fr_dsize) == -1) { 4883 IPFERROR(25); 4884 error = EINVAL; 4885 } 4886 break; 4887 4888 default : 4889 IPFERROR(26); 4890 error = EINVAL; 4891 break; 4892 } 4893 if (error != 0) 4894 goto donenolock; 4895 4896 if (fp->fr_tif.fd_name != -1) { 4897 if ((fp->fr_tif.fd_name < 0) || 4898 (fp->fr_tif.fd_name >= fp->fr_namelen)) { 4899 IPFERROR(139); 4900 error = EINVAL; 4901 goto donenolock; 4902 } 4903 } 4904 4905 if (fp->fr_dif.fd_name != -1) { 4906 if ((fp->fr_dif.fd_name < 0) || 4907 (fp->fr_dif.fd_name >= fp->fr_namelen)) { 4908 IPFERROR(140); 4909 error = EINVAL; 4910 goto donenolock; 4911 } 4912 } 4913 4914 if (fp->fr_rif.fd_name != -1) { 4915 if ((fp->fr_rif.fd_name < 0) || 4916 (fp->fr_rif.fd_name >= fp->fr_namelen)) { 4917 IPFERROR(141); 4918 error = EINVAL; 4919 goto donenolock; 4920 } 4921 } 4922 4923 /* 4924 * Lookup all the interface names that are part of the rule. 4925 */ 4926 error = ipf_synclist(softc, fp, NULL); 4927 if (error != 0) 4928 goto donenolock; 4929 fp->fr_statecnt = 0; 4930 if (fp->fr_srctrack.ht_max_nodes != 0) 4931 ipf_rb_ht_init(&fp->fr_srctrack); 4932 4933 /* 4934 * Look for an existing matching filter rule, but don't include the 4935 * next or interface pointer in the comparison (fr_next, fr_ifa). 4936 * This elminates rules which are indentical being loaded. Checksum 4937 * the constant part of the filter rule to make comparisons quicker 4938 * (this meaning no pointers are included). 4939 */ 4940 for (fp->fr_cksum = 0, p = (u_int *)&fp->fr_func, pp = &fp->fr_cksum; 4941 p < pp; p++) 4942 fp->fr_cksum += *p; 4943 pp = (u_int *)(fp->fr_caddr + fp->fr_dsize); 4944 for (p = (u_int *)fp->fr_data; p < pp; p++) 4945 fp->fr_cksum += *p; 4946 4947 WRITE_ENTER(&softc->ipf_mutex); 4948 4949 /* 4950 * Now that the filter rule lists are locked, we can walk the 4951 * chain of them without fear. 4952 */ 4953 ftail = fprev; 4954 for (f = *ftail; (f = *ftail) != NULL; ftail = &f->fr_next) { 4955 if (fp->fr_collect <= f->fr_collect) { 4956 ftail = fprev; 4957 f = NULL; 4958 break; 4959 } 4960 fprev = ftail; 4961 } 4962 4963 for (; (f = *ftail) != NULL; ftail = &f->fr_next) { 4964 if (ipf_rule_compare(fp, f) == 0) 4965 break; 4966 } 4967 4968 /* 4969 * If zero'ing statistics, copy current to caller and zero. 4970 */ 4971 if (addrem == 2) { 4972 if (f == NULL) { 4973 IPFERROR(27); 4974 error = ESRCH; 4975 } else { 4976 /* 4977 * Copy and reduce lock because of impending copyout. 4978 * Well we should, but if we do then the atomicity of 4979 * this call and the correctness of fr_hits and 4980 * fr_bytes cannot be guaranteed. As it is, this code 4981 * only resets them to 0 if they are successfully 4982 * copied out into user space. 4983 */ 4984 bcopy((char *)f, (char *)fp, f->fr_size); 4985 /* MUTEX_DOWNGRADE(&softc->ipf_mutex); */ 4986 4987 /* 4988 * When we copy this rule back out, set the data 4989 * pointer to be what it was in user space. 4990 */ 4991 fp->fr_data = uptr; 4992 error = ipf_outobj(softc, data, fp, IPFOBJ_FRENTRY); 4993 4994 if (error == 0) { 4995 if ((f->fr_dsize != 0) && (uptr != NULL)) 4996 error = COPYOUT(f->fr_data, uptr, 4997 f->fr_dsize); 4998 if (error != 0) { 4999 IPFERROR(28); 5000 error = EFAULT; 5001 } 5002 if (error == 0) { 5003 f->fr_hits = 0; 5004 f->fr_bytes = 0; 5005 } 5006 } 5007 } 5008 5009 if (makecopy != 0) { 5010 if (ptr != NULL) { 5011 KFREES(ptr, fp->fr_dsize); 5012 } 5013 KFREES(fp, fp->fr_size); 5014 } 5015 RWLOCK_EXIT(&softc->ipf_mutex); 5016 return error; 5017 } 5018 5019 if (!f) { 5020 /* 5021 * At the end of this, ftail must point to the place where the 5022 * new rule is to be saved/inserted/added. 5023 * For SIOCAD*FR, this should be the last rule in the group of 5024 * rules that have equal fr_collect fields. 5025 * For SIOCIN*FR, ... 5026 */ 5027 if (req == (ioctlcmd_t)SIOCADAFR || 5028 req == (ioctlcmd_t)SIOCADIFR) { 5029 5030 for (ftail = fprev; (f = *ftail) != NULL; ) { 5031 if (f->fr_collect > fp->fr_collect) 5032 break; 5033 ftail = &f->fr_next; 5034 fprev = ftail; 5035 } 5036 ftail = fprev; 5037 f = NULL; 5038 ptr = NULL; 5039 } else if (req == (ioctlcmd_t)SIOCINAFR || 5040 req == (ioctlcmd_t)SIOCINIFR) { 5041 while ((f = *fprev) != NULL) { 5042 if (f->fr_collect >= fp->fr_collect) 5043 break; 5044 fprev = &f->fr_next; 5045 } 5046 ftail = fprev; 5047 if (fp->fr_hits != 0) { 5048 while (fp->fr_hits && (f = *ftail)) { 5049 if (f->fr_collect != fp->fr_collect) 5050 break; 5051 fprev = ftail; 5052 ftail = &f->fr_next; 5053 fp->fr_hits--; 5054 } 5055 } 5056 f = NULL; 5057 ptr = NULL; 5058 } 5059 } 5060 5061 /* 5062 * Request to remove a rule. 5063 */ 5064 if (addrem == 1) { 5065 if (!f) { 5066 IPFERROR(29); 5067 error = ESRCH; 5068 } else { 5069 /* 5070 * Do not allow activity from user space to interfere 5071 * with rules not loaded that way. 5072 */ 5073 if ((makecopy == 1) && !(f->fr_flags & FR_COPIED)) { 5074 IPFERROR(30); 5075 error = EPERM; 5076 goto done; 5077 } 5078 5079 /* 5080 * Return EBUSY if the rule is being reference by 5081 * something else (eg state information.) 5082 */ 5083 if (f->fr_ref > 1) { 5084 IPFERROR(31); 5085 error = EBUSY; 5086 goto done; 5087 } 5088#ifdef IPFILTER_SCAN 5089 if (f->fr_isctag != -1 && 5090 (f->fr_isc != (struct ipscan *)-1)) 5091 ipf_scan_detachfr(f); 5092#endif 5093 5094 if (unit == IPL_LOGAUTH) { 5095 error = ipf_auth_precmd(softc, req, f, ftail); 5096 goto done; 5097 } 5098 5099 ipf_rule_delete(softc, f, unit, set); 5100 5101 need_free = makecopy; 5102 } 5103 } else { 5104 /* 5105 * Not removing, so we must be adding/inserting a rule. 5106 */ 5107 if (f != NULL) { 5108 IPFERROR(32); 5109 error = EEXIST; 5110 goto done; 5111 } 5112 if (unit == IPL_LOGAUTH) { 5113 error = ipf_auth_precmd(softc, req, fp, ftail); 5114 goto done; 5115 } 5116 5117 MUTEX_NUKE(&fp->fr_lock); 5118 MUTEX_INIT(&fp->fr_lock, "filter rule lock"); 5119 if (fp->fr_die != 0) 5120 ipf_rule_expire_insert(softc, fp, set); 5121 5122 fp->fr_hits = 0; 5123 if (makecopy != 0) 5124 fp->fr_ref = 1; 5125 fp->fr_pnext = ftail; 5126 fp->fr_next = *ftail; 5127 if (fp->fr_next != NULL) 5128 fp->fr_next->fr_pnext = &fp->fr_next; 5129 *ftail = fp; 5130 if (addrem == 0) 5131 ipf_fixskip(ftail, fp, 1); 5132 5133 fp->fr_icmpgrp = NULL; 5134 if (fp->fr_icmphead != -1) { 5135 group = FR_NAME(fp, fr_icmphead); 5136 fg = ipf_group_add(softc, group, fp, 0, unit, set); 5137 fp->fr_icmpgrp = fg; 5138 } 5139 5140 fp->fr_grphead = NULL; 5141 if (fp->fr_grhead != -1) { 5142 group = FR_NAME(fp, fr_grhead); 5143 fg = ipf_group_add(softc, group, fp, fp->fr_flags, 5144 unit, set); 5145 fp->fr_grphead = fg; 5146 } 5147 } 5148done: 5149 RWLOCK_EXIT(&softc->ipf_mutex); 5150donenolock: 5151 if (need_free || (error != 0)) { 5152 if ((fp->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) { 5153 if ((fp->fr_satype == FRI_LOOKUP) && 5154 (fp->fr_srcptr != NULL)) 5155 ipf_lookup_deref(softc, fp->fr_srctype, 5156 fp->fr_srcptr); 5157 if ((fp->fr_datype == FRI_LOOKUP) && 5158 (fp->fr_dstptr != NULL)) 5159 ipf_lookup_deref(softc, fp->fr_dsttype, 5160 fp->fr_dstptr); 5161 } 5162 if (fp->fr_grp != NULL) { 5163 WRITE_ENTER(&softc->ipf_mutex); 5164 ipf_group_del(softc, fp->fr_grp, fp); 5165 RWLOCK_EXIT(&softc->ipf_mutex); 5166 } 5167 if ((ptr != NULL) && (makecopy != 0)) { 5168 KFREES(ptr, fp->fr_dsize); 5169 } 5170 KFREES(fp, fp->fr_size); 5171 } 5172 return (error); 5173} 5174 5175 5176/* ------------------------------------------------------------------------ */ 5177/* Function: ipf_rule_delete */ 5178/* Returns: Nil */ 5179/* Parameters: softc(I) - pointer to soft context main structure */ 5180/* f(I) - pointer to the rule being deleted */ 5181/* ftail(I) - pointer to the pointer to f */ 5182/* unit(I) - device for which this is for */ 5183/* set(I) - 1 or 0 (filter set) */ 5184/* */ 5185/* This function attempts to do what it can to delete a filter rule: remove */ 5186/* it from any linked lists and remove any groups it is responsible for. */ 5187/* But in the end, removing a rule can only drop the reference count - we */ 5188/* must use that as the guide for whether or not it can be freed. */ 5189/* ------------------------------------------------------------------------ */ 5190static void 5191ipf_rule_delete(softc, f, unit, set) 5192 ipf_main_softc_t *softc; 5193 frentry_t *f; 5194 int unit, set; 5195{ 5196 5197 /* 5198 * If fr_pdnext is set, then the rule is on the expire list, so 5199 * remove it from there. 5200 */ 5201 if (f->fr_pdnext != NULL) { 5202 *f->fr_pdnext = f->fr_dnext; 5203 if (f->fr_dnext != NULL) 5204 f->fr_dnext->fr_pdnext = f->fr_pdnext; 5205 f->fr_pdnext = NULL; 5206 f->fr_dnext = NULL; 5207 } 5208 5209 ipf_fixskip(f->fr_pnext, f, -1); 5210 if (f->fr_pnext != NULL) 5211 *f->fr_pnext = f->fr_next; 5212 if (f->fr_next != NULL) 5213 f->fr_next->fr_pnext = f->fr_pnext; 5214 f->fr_pnext = NULL; 5215 f->fr_next = NULL; 5216 5217 (void) ipf_derefrule(softc, &f); 5218} 5219 5220/* ------------------------------------------------------------------------ */ 5221/* Function: ipf_rule_expire_insert */ 5222/* Returns: Nil */ 5223/* Parameters: softc(I) - pointer to soft context main structure */ 5224/* f(I) - pointer to rule to be added to expire list */ 5225/* set(I) - 1 or 0 (filter set) */ 5226/* */ 5227/* If the new rule has a given expiration time, insert it into the list of */ 5228/* expiring rules with the ones to be removed first added to the front of */ 5229/* the list. The insertion is O(n) but it is kept sorted for quick scans at */ 5230/* expiration interval checks. */ 5231/* ------------------------------------------------------------------------ */ 5232static void 5233ipf_rule_expire_insert(softc, f, set) 5234 ipf_main_softc_t *softc; 5235 frentry_t *f; 5236 int set; 5237{ 5238 frentry_t *fr; 5239 5240 /* 5241 */ 5242 5243 f->fr_die = softc->ipf_ticks + IPF_TTLVAL(f->fr_die); 5244 for (fr = softc->ipf_rule_explist[set]; fr != NULL; 5245 fr = fr->fr_dnext) { 5246 if (f->fr_die < fr->fr_die) 5247 break; 5248 if (fr->fr_dnext == NULL) { 5249 /* 5250 * We've got to the last rule and everything 5251 * wanted to be expired before this new node, 5252 * so we have to tack it on the end... 5253 */ 5254 fr->fr_dnext = f; 5255 f->fr_pdnext = &fr->fr_dnext; 5256 fr = NULL; 5257 break; 5258 } 5259 } 5260 5261 if (softc->ipf_rule_explist[set] == NULL) { 5262 softc->ipf_rule_explist[set] = f; 5263 f->fr_pdnext = &softc->ipf_rule_explist[set]; 5264 } else if (fr != NULL) { 5265 f->fr_dnext = fr; 5266 f->fr_pdnext = fr->fr_pdnext; 5267 fr->fr_pdnext = &f->fr_dnext; 5268 } 5269} 5270 5271 5272/* ------------------------------------------------------------------------ */ 5273/* Function: ipf_findlookup */ 5274/* Returns: NULL = failure, else success */ 5275/* Parameters: softc(I) - pointer to soft context main structure */ 5276/* unit(I) - ipf device we want to find match for */ 5277/* fp(I) - rule for which lookup is for */ 5278/* addrp(I) - pointer to lookup information in address struct */ 5279/* maskp(O) - pointer to lookup information for storage */ 5280/* */ 5281/* When using pools and hash tables to store addresses for matching in */ 5282/* rules, it is necessary to resolve both the object referred to by the */ 5283/* name or address (and return that pointer) and also provide the means by */ 5284/* which to determine if an address belongs to that object to make the */ 5285/* packet matching quicker. */ 5286/* ------------------------------------------------------------------------ */ 5287static void * 5288ipf_findlookup(softc, unit, fr, addrp, maskp) 5289 ipf_main_softc_t *softc; 5290 int unit; 5291 frentry_t *fr; 5292 i6addr_t *addrp, *maskp; 5293{ 5294 void *ptr = NULL; 5295 5296 switch (addrp->iplookupsubtype) 5297 { 5298 case 0 : 5299 ptr = ipf_lookup_res_num(softc, unit, addrp->iplookuptype, 5300 addrp->iplookupnum, 5301 &maskp->iplookupfunc); 5302 break; 5303 case 1 : 5304 if (addrp->iplookupname < 0) 5305 break; 5306 if (addrp->iplookupname >= fr->fr_namelen) 5307 break; 5308 ptr = ipf_lookup_res_name(softc, unit, addrp->iplookuptype, 5309 fr->fr_names + addrp->iplookupname, 5310 &maskp->iplookupfunc); 5311 break; 5312 default : 5313 break; 5314 } 5315 5316 return ptr; 5317} 5318 5319 5320/* ------------------------------------------------------------------------ */ 5321/* Function: ipf_funcinit */ 5322/* Returns: int - 0 == success, else ESRCH: cannot resolve rule details */ 5323/* Parameters: softc(I) - pointer to soft context main structure */ 5324/* fr(I) - pointer to filter rule */ 5325/* */ 5326/* If a rule is a call rule, then check if the function it points to needs */ 5327/* an init function to be called now the rule has been loaded. */ 5328/* ------------------------------------------------------------------------ */ 5329static int 5330ipf_funcinit(softc, fr) 5331 ipf_main_softc_t *softc; 5332 frentry_t *fr; 5333{ 5334 ipfunc_resolve_t *ft; 5335 int err; 5336 5337 IPFERROR(34); 5338 err = ESRCH; 5339 5340 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++) 5341 if (ft->ipfu_addr == fr->fr_func) { 5342 err = 0; 5343 if (ft->ipfu_init != NULL) 5344 err = (*ft->ipfu_init)(softc, fr); 5345 break; 5346 } 5347 return err; 5348} 5349 5350 5351/* ------------------------------------------------------------------------ */ 5352/* Function: ipf_funcfini */ 5353/* Returns: Nil */ 5354/* Parameters: softc(I) - pointer to soft context main structure */ 5355/* fr(I) - pointer to filter rule */ 5356/* */ 5357/* For a given filter rule, call the matching "fini" function if the rule */ 5358/* is using a known function that would have resulted in the "init" being */ 5359/* called for ealier. */ 5360/* ------------------------------------------------------------------------ */ 5361static void 5362ipf_funcfini(softc, fr) 5363 ipf_main_softc_t *softc; 5364 frentry_t *fr; 5365{ 5366 ipfunc_resolve_t *ft; 5367 5368 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++) 5369 if (ft->ipfu_addr == fr->fr_func) { 5370 if (ft->ipfu_fini != NULL) 5371 (void) (*ft->ipfu_fini)(softc, fr); 5372 break; 5373 } 5374} 5375 5376 5377/* ------------------------------------------------------------------------ */ 5378/* Function: ipf_findfunc */ 5379/* Returns: ipfunc_t - pointer to function if found, else NULL */ 5380/* Parameters: funcptr(I) - function pointer to lookup */ 5381/* */ 5382/* Look for a function in the table of known functions. */ 5383/* ------------------------------------------------------------------------ */ 5384static ipfunc_t 5385ipf_findfunc(funcptr) 5386 ipfunc_t funcptr; 5387{ 5388 ipfunc_resolve_t *ft; 5389 5390 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++) 5391 if (ft->ipfu_addr == funcptr) 5392 return funcptr; 5393 return NULL; 5394} 5395 5396 5397/* ------------------------------------------------------------------------ */ 5398/* Function: ipf_resolvefunc */ 5399/* Returns: int - 0 == success, else error */ 5400/* Parameters: data(IO) - ioctl data pointer to ipfunc_resolve_t struct */ 5401/* */ 5402/* Copy in a ipfunc_resolve_t structure and then fill in the missing field. */ 5403/* This will either be the function name (if the pointer is set) or the */ 5404/* function pointer if the name is set. When found, fill in the other one */ 5405/* so that the entire, complete, structure can be copied back to user space.*/ 5406/* ------------------------------------------------------------------------ */ 5407int 5408ipf_resolvefunc(softc, data) 5409 ipf_main_softc_t *softc; 5410 void *data; 5411{ 5412 ipfunc_resolve_t res, *ft; 5413 int error; 5414 5415 error = BCOPYIN(data, &res, sizeof(res)); 5416 if (error != 0) { 5417 IPFERROR(123); 5418 return EFAULT; 5419 } 5420 5421 if (res.ipfu_addr == NULL && res.ipfu_name[0] != '\0') { 5422 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++) 5423 if (strncmp(res.ipfu_name, ft->ipfu_name, 5424 sizeof(res.ipfu_name)) == 0) { 5425 res.ipfu_addr = ft->ipfu_addr; 5426 res.ipfu_init = ft->ipfu_init; 5427 if (COPYOUT(&res, data, sizeof(res)) != 0) { 5428 IPFERROR(35); 5429 return EFAULT; 5430 } 5431 return 0; 5432 } 5433 } 5434 if (res.ipfu_addr != NULL && res.ipfu_name[0] == '\0') { 5435 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++) 5436 if (ft->ipfu_addr == res.ipfu_addr) { 5437 (void) strncpy(res.ipfu_name, ft->ipfu_name, 5438 sizeof(res.ipfu_name)); 5439 res.ipfu_init = ft->ipfu_init; 5440 if (COPYOUT(&res, data, sizeof(res)) != 0) { 5441 IPFERROR(36); 5442 return EFAULT; 5443 } 5444 return 0; 5445 } 5446 } 5447 IPFERROR(37); 5448 return ESRCH; 5449} 5450 5451 5452#if !defined(_KERNEL) || (!defined(__NetBSD__) && !defined(__OpenBSD__) && \ 5453 !defined(__FreeBSD__)) || \ 5454 FREEBSD_LT_REV(501000) || NETBSD_LT_REV(105000000) || \ 5455 OPENBSD_LT_REV(200006) 5456/* 5457 * From: NetBSD 5458 * ppsratecheck(): packets (or events) per second limitation. 5459 */ 5460int 5461ppsratecheck(lasttime, curpps, maxpps) 5462 struct timeval *lasttime; 5463 int *curpps; 5464 int maxpps; /* maximum pps allowed */ 5465{ 5466 struct timeval tv, delta; 5467 int rv; 5468 5469 GETKTIME(&tv); 5470 5471 delta.tv_sec = tv.tv_sec - lasttime->tv_sec; 5472 delta.tv_usec = tv.tv_usec - lasttime->tv_usec; 5473 if (delta.tv_usec < 0) { 5474 delta.tv_sec--; 5475 delta.tv_usec += 1000000; 5476 } 5477 5478 /* 5479 * check for 0,0 is so that the message will be seen at least once. 5480 * if more than one second have passed since the last update of 5481 * lasttime, reset the counter. 5482 * 5483 * we do increment *curpps even in *curpps < maxpps case, as some may 5484 * try to use *curpps for stat purposes as well. 5485 */ 5486 if ((lasttime->tv_sec == 0 && lasttime->tv_usec == 0) || 5487 delta.tv_sec >= 1) { 5488 *lasttime = tv; 5489 *curpps = 0; 5490 rv = 1; 5491 } else if (maxpps < 0) 5492 rv = 1; 5493 else if (*curpps < maxpps) 5494 rv = 1; 5495 else 5496 rv = 0; 5497 *curpps = *curpps + 1; 5498 5499 return (rv); 5500} 5501#endif 5502 5503 5504/* ------------------------------------------------------------------------ */ 5505/* Function: ipf_derefrule */ 5506/* Returns: int - 0 == rule freed up, else rule not freed */ 5507/* Parameters: fr(I) - pointer to filter rule */ 5508/* */ 5509/* Decrement the reference counter to a rule by one. If it reaches zero, */ 5510/* free it and any associated storage space being used by it. */ 5511/* ------------------------------------------------------------------------ */ 5512int 5513ipf_derefrule(softc, frp) 5514 ipf_main_softc_t *softc; 5515 frentry_t **frp; 5516{ 5517 frentry_t *fr; 5518 frdest_t *fdp; 5519 5520 fr = *frp; 5521 *frp = NULL; 5522 5523 MUTEX_ENTER(&fr->fr_lock); 5524 fr->fr_ref--; 5525 if (fr->fr_ref == 0) { 5526 MUTEX_EXIT(&fr->fr_lock); 5527 MUTEX_DESTROY(&fr->fr_lock); 5528 5529 ipf_funcfini(softc, fr); 5530 5531 fdp = &fr->fr_tif; 5532 if (fdp->fd_type == FRD_DSTLIST) 5533 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr); 5534 5535 fdp = &fr->fr_rif; 5536 if (fdp->fd_type == FRD_DSTLIST) 5537 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr); 5538 5539 fdp = &fr->fr_dif; 5540 if (fdp->fd_type == FRD_DSTLIST) 5541 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr); 5542 5543 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF && 5544 fr->fr_satype == FRI_LOOKUP) 5545 ipf_lookup_deref(softc, fr->fr_srctype, fr->fr_srcptr); 5546 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF && 5547 fr->fr_datype == FRI_LOOKUP) 5548 ipf_lookup_deref(softc, fr->fr_dsttype, fr->fr_dstptr); 5549 5550 if (fr->fr_grp != NULL) 5551 ipf_group_del(softc, fr->fr_grp, fr); 5552 5553 if (fr->fr_grphead != NULL) 5554 ipf_group_del(softc, fr->fr_grphead, fr); 5555 5556 if (fr->fr_icmpgrp != NULL) 5557 ipf_group_del(softc, fr->fr_icmpgrp, fr); 5558 5559 if ((fr->fr_flags & FR_COPIED) != 0) { 5560 if (fr->fr_dsize) { 5561 KFREES(fr->fr_data, fr->fr_dsize); 5562 } 5563 KFREES(fr, fr->fr_size); 5564 return 0; 5565 } 5566 return 1; 5567 } else { 5568 MUTEX_EXIT(&fr->fr_lock); 5569 } 5570 return -1; 5571} 5572 5573 5574/* ------------------------------------------------------------------------ */ 5575/* Function: ipf_grpmapinit */ 5576/* Returns: int - 0 == success, else ESRCH because table entry not found*/ 5577/* Parameters: fr(I) - pointer to rule to find hash table for */ 5578/* */ 5579/* Looks for group hash table fr_arg and stores a pointer to it in fr_ptr. */ 5580/* fr_ptr is later used by ipf_srcgrpmap and ipf_dstgrpmap. */ 5581/* ------------------------------------------------------------------------ */ 5582static int 5583ipf_grpmapinit(softc, fr) 5584 ipf_main_softc_t *softc; 5585 frentry_t *fr; 5586{ 5587 char name[FR_GROUPLEN]; 5588 iphtable_t *iph; 5589 5590#if defined(SNPRINTF) && defined(_KERNEL) 5591 SNPRINTF(name, sizeof(name), "%d", fr->fr_arg); 5592#else 5593 (void) sprintf(name, "%d", fr->fr_arg); 5594#endif 5595 iph = ipf_lookup_find_htable(softc, IPL_LOGIPF, name); 5596 if (iph == NULL) { 5597 IPFERROR(38); 5598 return ESRCH; 5599 } 5600 if ((iph->iph_flags & FR_INOUT) != (fr->fr_flags & FR_INOUT)) { 5601 IPFERROR(39); 5602 return ESRCH; 5603 } 5604 iph->iph_ref++; 5605 fr->fr_ptr = iph; 5606 return 0; 5607} 5608 5609 5610/* ------------------------------------------------------------------------ */ 5611/* Function: ipf_grpmapfini */ 5612/* Returns: int - 0 == success, else ESRCH because table entry not found*/ 5613/* Parameters: softc(I) - pointer to soft context main structure */ 5614/* fr(I) - pointer to rule to release hash table for */ 5615/* */ 5616/* For rules that have had ipf_grpmapinit called, ipf_lookup_deref needs to */ 5617/* be called to undo what ipf_grpmapinit caused to be done. */ 5618/* ------------------------------------------------------------------------ */ 5619static int 5620ipf_grpmapfini(softc, fr) 5621 ipf_main_softc_t *softc; 5622 frentry_t *fr; 5623{ 5624 iphtable_t *iph; 5625 iph = fr->fr_ptr; 5626 if (iph != NULL) 5627 ipf_lookup_deref(softc, IPLT_HASH, iph); 5628 return 0; 5629} 5630 5631 5632/* ------------------------------------------------------------------------ */ 5633/* Function: ipf_srcgrpmap */ 5634/* Returns: frentry_t * - pointer to "new last matching" rule or NULL */ 5635/* Parameters: fin(I) - pointer to packet information */ 5636/* passp(IO) - pointer to current/new filter decision (unused) */ 5637/* */ 5638/* Look for a rule group head in a hash table, using the source address as */ 5639/* the key, and descend into that group and continue matching rules against */ 5640/* the packet. */ 5641/* ------------------------------------------------------------------------ */ 5642frentry_t * 5643ipf_srcgrpmap(fin, passp) 5644 fr_info_t *fin; 5645 u_32_t *passp; 5646{ 5647 frgroup_t *fg; 5648 void *rval; 5649 5650 rval = ipf_iphmfindgroup(fin->fin_main_soft, fin->fin_fr->fr_ptr, 5651 &fin->fin_src); 5652 if (rval == NULL) 5653 return NULL; 5654 5655 fg = rval; 5656 fin->fin_fr = fg->fg_start; 5657 (void) ipf_scanlist(fin, *passp); 5658 return fin->fin_fr; 5659} 5660 5661 5662/* ------------------------------------------------------------------------ */ 5663/* Function: ipf_dstgrpmap */ 5664/* Returns: frentry_t * - pointer to "new last matching" rule or NULL */ 5665/* Parameters: fin(I) - pointer to packet information */ 5666/* passp(IO) - pointer to current/new filter decision (unused) */ 5667/* */ 5668/* Look for a rule group head in a hash table, using the destination */ 5669/* address as the key, and descend into that group and continue matching */ 5670/* rules against the packet. */ 5671/* ------------------------------------------------------------------------ */ 5672frentry_t * 5673ipf_dstgrpmap(fin, passp) 5674 fr_info_t *fin; 5675 u_32_t *passp; 5676{ 5677 frgroup_t *fg; 5678 void *rval; 5679 5680 rval = ipf_iphmfindgroup(fin->fin_main_soft, fin->fin_fr->fr_ptr, 5681 &fin->fin_dst); 5682 if (rval == NULL) 5683 return NULL; 5684 5685 fg = rval; 5686 fin->fin_fr = fg->fg_start; 5687 (void) ipf_scanlist(fin, *passp); 5688 return fin->fin_fr; 5689} 5690 5691/* 5692 * Queue functions 5693 * =============== 5694 * These functions manage objects on queues for efficient timeouts. There 5695 * are a number of system defined queues as well as user defined timeouts. 5696 * It is expected that a lock is held in the domain in which the queue 5697 * belongs (i.e. either state or NAT) when calling any of these functions 5698 * that prevents ipf_freetimeoutqueue() from being called at the same time 5699 * as any other. 5700 */ 5701 5702 5703/* ------------------------------------------------------------------------ */ 5704/* Function: ipf_addtimeoutqueue */ 5705/* Returns: struct ifqtq * - NULL if malloc fails, else pointer to */ 5706/* timeout queue with given interval. */ 5707/* Parameters: parent(I) - pointer to pointer to parent node of this list */ 5708/* of interface queues. */ 5709/* seconds(I) - timeout value in seconds for this queue. */ 5710/* */ 5711/* This routine first looks for a timeout queue that matches the interval */ 5712/* being requested. If it finds one, increments the reference counter and */ 5713/* returns a pointer to it. If none are found, it allocates a new one and */ 5714/* inserts it at the top of the list. */ 5715/* */ 5716/* Locking. */ 5717/* It is assumed that the caller of this function has an appropriate lock */ 5718/* held (exclusively) in the domain that encompases 'parent'. */ 5719/* ------------------------------------------------------------------------ */ 5720ipftq_t * 5721ipf_addtimeoutqueue(softc, parent, seconds) 5722 ipf_main_softc_t *softc; 5723 ipftq_t **parent; 5724 u_int seconds; 5725{ 5726 ipftq_t *ifq; 5727 u_int period; 5728 5729 period = seconds * IPF_HZ_DIVIDE; 5730 5731 MUTEX_ENTER(&softc->ipf_timeoutlock); 5732 for (ifq = *parent; ifq != NULL; ifq = ifq->ifq_next) { 5733 if (ifq->ifq_ttl == period) { 5734 /* 5735 * Reset the delete flag, if set, so the structure 5736 * gets reused rather than freed and reallocated. 5737 */ 5738 MUTEX_ENTER(&ifq->ifq_lock); 5739 ifq->ifq_flags &= ~IFQF_DELETE; 5740 ifq->ifq_ref++; 5741 MUTEX_EXIT(&ifq->ifq_lock); 5742 MUTEX_EXIT(&softc->ipf_timeoutlock); 5743 5744 return ifq; 5745 } 5746 } 5747 5748 KMALLOC(ifq, ipftq_t *); 5749 if (ifq != NULL) { 5750 MUTEX_NUKE(&ifq->ifq_lock); 5751 IPFTQ_INIT(ifq, period, "ipftq mutex"); 5752 ifq->ifq_next = *parent; 5753 ifq->ifq_pnext = parent; 5754 ifq->ifq_flags = IFQF_USER; 5755 ifq->ifq_ref++; 5756 *parent = ifq; 5757 softc->ipf_userifqs++; 5758 } 5759 MUTEX_EXIT(&softc->ipf_timeoutlock); 5760 return ifq; 5761} 5762 5763 5764/* ------------------------------------------------------------------------ */ 5765/* Function: ipf_deletetimeoutqueue */ 5766/* Returns: int - new reference count value of the timeout queue */ 5767/* Parameters: ifq(I) - timeout queue which is losing a reference. */ 5768/* Locks: ifq->ifq_lock */ 5769/* */ 5770/* This routine must be called when we're discarding a pointer to a timeout */ 5771/* queue object, taking care of the reference counter. */ 5772/* */ 5773/* Now that this just sets a DELETE flag, it requires the expire code to */ 5774/* check the list of user defined timeout queues and call the free function */ 5775/* below (currently commented out) to stop memory leaking. It is done this */ 5776/* way because the locking may not be sufficient to safely do a free when */ 5777/* this function is called. */ 5778/* ------------------------------------------------------------------------ */ 5779int 5780ipf_deletetimeoutqueue(ifq) 5781 ipftq_t *ifq; 5782{ 5783 5784 ifq->ifq_ref--; 5785 if ((ifq->ifq_ref == 0) && ((ifq->ifq_flags & IFQF_USER) != 0)) { 5786 ifq->ifq_flags |= IFQF_DELETE; 5787 } 5788 5789 return ifq->ifq_ref; 5790} 5791 5792 5793/* ------------------------------------------------------------------------ */ 5794/* Function: ipf_freetimeoutqueue */ 5795/* Parameters: ifq(I) - timeout queue which is losing a reference. */ 5796/* Returns: Nil */ 5797/* */ 5798/* Locking: */ 5799/* It is assumed that the caller of this function has an appropriate lock */ 5800/* held (exclusively) in the domain that encompases the callers "domain". */ 5801/* The ifq_lock for this structure should not be held. */ 5802/* */ 5803/* Remove a user defined timeout queue from the list of queues it is in and */ 5804/* tidy up after this is done. */ 5805/* ------------------------------------------------------------------------ */ 5806void 5807ipf_freetimeoutqueue(softc, ifq) 5808 ipf_main_softc_t *softc; 5809 ipftq_t *ifq; 5810{ 5811 5812 if (((ifq->ifq_flags & IFQF_DELETE) == 0) || (ifq->ifq_ref != 0) || 5813 ((ifq->ifq_flags & IFQF_USER) == 0)) { 5814 printf("ipf_freetimeoutqueue(%lx) flags 0x%x ttl %d ref %d\n", 5815 (u_long)ifq, ifq->ifq_flags, ifq->ifq_ttl, 5816 ifq->ifq_ref); 5817 return; 5818 } 5819 5820 /* 5821 * Remove from its position in the list. 5822 */ 5823 *ifq->ifq_pnext = ifq->ifq_next; 5824 if (ifq->ifq_next != NULL) 5825 ifq->ifq_next->ifq_pnext = ifq->ifq_pnext; 5826 ifq->ifq_next = NULL; 5827 ifq->ifq_pnext = NULL; 5828 5829 MUTEX_DESTROY(&ifq->ifq_lock); 5830 ATOMIC_DEC(softc->ipf_userifqs); 5831 KFREE(ifq); 5832} 5833 5834 5835/* ------------------------------------------------------------------------ */ 5836/* Function: ipf_deletequeueentry */ 5837/* Returns: Nil */ 5838/* Parameters: tqe(I) - timeout queue entry to delete */ 5839/* */ 5840/* Remove a tail queue entry from its queue and make it an orphan. */ 5841/* ipf_deletetimeoutqueue is called to make sure the reference count on the */ 5842/* queue is correct. We can't, however, call ipf_freetimeoutqueue because */ 5843/* the correct lock(s) may not be held that would make it safe to do so. */ 5844/* ------------------------------------------------------------------------ */ 5845void 5846ipf_deletequeueentry(tqe) 5847 ipftqent_t *tqe; 5848{ 5849 ipftq_t *ifq; 5850 5851 ifq = tqe->tqe_ifq; 5852 5853 MUTEX_ENTER(&ifq->ifq_lock); 5854 5855 if (tqe->tqe_pnext != NULL) { 5856 *tqe->tqe_pnext = tqe->tqe_next; 5857 if (tqe->tqe_next != NULL) 5858 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext; 5859 else /* we must be the tail anyway */ 5860 ifq->ifq_tail = tqe->tqe_pnext; 5861 5862 tqe->tqe_pnext = NULL; 5863 tqe->tqe_ifq = NULL; 5864 } 5865 5866 (void) ipf_deletetimeoutqueue(ifq); 5867 ASSERT(ifq->ifq_ref > 0); 5868 5869 MUTEX_EXIT(&ifq->ifq_lock); 5870} 5871 5872 5873/* ------------------------------------------------------------------------ */ 5874/* Function: ipf_queuefront */ 5875/* Returns: Nil */ 5876/* Parameters: tqe(I) - pointer to timeout queue entry */ 5877/* */ 5878/* Move a queue entry to the front of the queue, if it isn't already there. */ 5879/* ------------------------------------------------------------------------ */ 5880void 5881ipf_queuefront(tqe) 5882 ipftqent_t *tqe; 5883{ 5884 ipftq_t *ifq; 5885 5886 ifq = tqe->tqe_ifq; 5887 if (ifq == NULL) 5888 return; 5889 5890 MUTEX_ENTER(&ifq->ifq_lock); 5891 if (ifq->ifq_head != tqe) { 5892 *tqe->tqe_pnext = tqe->tqe_next; 5893 if (tqe->tqe_next) 5894 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext; 5895 else 5896 ifq->ifq_tail = tqe->tqe_pnext; 5897 5898 tqe->tqe_next = ifq->ifq_head; 5899 ifq->ifq_head->tqe_pnext = &tqe->tqe_next; 5900 ifq->ifq_head = tqe; 5901 tqe->tqe_pnext = &ifq->ifq_head; 5902 } 5903 MUTEX_EXIT(&ifq->ifq_lock); 5904} 5905 5906 5907/* ------------------------------------------------------------------------ */ 5908/* Function: ipf_queueback */ 5909/* Returns: Nil */ 5910/* Parameters: ticks(I) - ipf tick time to use with this call */ 5911/* tqe(I) - pointer to timeout queue entry */ 5912/* */ 5913/* Move a queue entry to the back of the queue, if it isn't already there. */ 5914/* We use use ticks to calculate the expiration and mark for when we last */ 5915/* touched the structure. */ 5916/* ------------------------------------------------------------------------ */ 5917void 5918ipf_queueback(ticks, tqe) 5919 u_long ticks; 5920 ipftqent_t *tqe; 5921{ 5922 ipftq_t *ifq; 5923 5924 ifq = tqe->tqe_ifq; 5925 if (ifq == NULL) 5926 return; 5927 tqe->tqe_die = ticks + ifq->ifq_ttl; 5928 tqe->tqe_touched = ticks; 5929 5930 MUTEX_ENTER(&ifq->ifq_lock); 5931 if (tqe->tqe_next != NULL) { /* at the end already ? */ 5932 /* 5933 * Remove from list 5934 */ 5935 *tqe->tqe_pnext = tqe->tqe_next; 5936 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext; 5937 5938 /* 5939 * Make it the last entry. 5940 */ 5941 tqe->tqe_next = NULL; 5942 tqe->tqe_pnext = ifq->ifq_tail; 5943 *ifq->ifq_tail = tqe; 5944 ifq->ifq_tail = &tqe->tqe_next; 5945 } 5946 MUTEX_EXIT(&ifq->ifq_lock); 5947} 5948 5949 5950/* ------------------------------------------------------------------------ */ 5951/* Function: ipf_queueappend */ 5952/* Returns: Nil */ 5953/* Parameters: ticks(I) - ipf tick time to use with this call */ 5954/* tqe(I) - pointer to timeout queue entry */ 5955/* ifq(I) - pointer to timeout queue */ 5956/* parent(I) - owing object pointer */ 5957/* */ 5958/* Add a new item to this queue and put it on the very end. */ 5959/* We use use ticks to calculate the expiration and mark for when we last */ 5960/* touched the structure. */ 5961/* ------------------------------------------------------------------------ */ 5962void 5963ipf_queueappend(ticks, tqe, ifq, parent) 5964 u_long ticks; 5965 ipftqent_t *tqe; 5966 ipftq_t *ifq; 5967 void *parent; 5968{ 5969 5970 MUTEX_ENTER(&ifq->ifq_lock); 5971 tqe->tqe_parent = parent; 5972 tqe->tqe_pnext = ifq->ifq_tail; 5973 *ifq->ifq_tail = tqe; 5974 ifq->ifq_tail = &tqe->tqe_next; 5975 tqe->tqe_next = NULL; 5976 tqe->tqe_ifq = ifq; 5977 tqe->tqe_die = ticks + ifq->ifq_ttl; 5978 tqe->tqe_touched = ticks; 5979 ifq->ifq_ref++; 5980 MUTEX_EXIT(&ifq->ifq_lock); 5981} 5982 5983 5984/* ------------------------------------------------------------------------ */ 5985/* Function: ipf_movequeue */ 5986/* Returns: Nil */ 5987/* Parameters: tq(I) - pointer to timeout queue information */ 5988/* oifp(I) - old timeout queue entry was on */ 5989/* nifp(I) - new timeout queue to put entry on */ 5990/* */ 5991/* Move a queue entry from one timeout queue to another timeout queue. */ 5992/* If it notices that the current entry is already last and does not need */ 5993/* to move queue, the return. */ 5994/* ------------------------------------------------------------------------ */ 5995void 5996ipf_movequeue(ticks, tqe, oifq, nifq) 5997 u_long ticks; 5998 ipftqent_t *tqe; 5999 ipftq_t *oifq, *nifq; 6000{ 6001 6002 /* 6003 * If the queue hasn't changed and we last touched this entry at the 6004 * same ipf time, then we're not going to achieve anything by either 6005 * changing the ttl or moving it on the queue. 6006 */ 6007 if (oifq == nifq && tqe->tqe_touched == ticks) 6008 return; 6009 6010 /* 6011 * For any of this to be outside the lock, there is a risk that two 6012 * packets entering simultaneously, with one changing to a different 6013 * queue and one not, could end up with things in a bizarre state. 6014 */ 6015 MUTEX_ENTER(&oifq->ifq_lock); 6016 6017 tqe->tqe_touched = ticks; 6018 tqe->tqe_die = ticks + nifq->ifq_ttl; 6019 /* 6020 * Is the operation here going to be a no-op ? 6021 */ 6022 if (oifq == nifq) { 6023 if ((tqe->tqe_next == NULL) || 6024 (tqe->tqe_next->tqe_die == tqe->tqe_die)) { 6025 MUTEX_EXIT(&oifq->ifq_lock); 6026 return; 6027 } 6028 } 6029 6030 /* 6031 * Remove from the old queue 6032 */ 6033 *tqe->tqe_pnext = tqe->tqe_next; 6034 if (tqe->tqe_next) 6035 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext; 6036 else 6037 oifq->ifq_tail = tqe->tqe_pnext; 6038 tqe->tqe_next = NULL; 6039 6040 /* 6041 * If we're moving from one queue to another, release the 6042 * lock on the old queue and get a lock on the new queue. 6043 * For user defined queues, if we're moving off it, call 6044 * delete in case it can now be freed. 6045 */ 6046 if (oifq != nifq) { 6047 tqe->tqe_ifq = NULL; 6048 6049 (void) ipf_deletetimeoutqueue(oifq); 6050 6051 MUTEX_EXIT(&oifq->ifq_lock); 6052 6053 MUTEX_ENTER(&nifq->ifq_lock); 6054 6055 tqe->tqe_ifq = nifq; 6056 nifq->ifq_ref++; 6057 } 6058 6059 /* 6060 * Add to the bottom of the new queue 6061 */ 6062 tqe->tqe_pnext = nifq->ifq_tail; 6063 *nifq->ifq_tail = tqe; 6064 nifq->ifq_tail = &tqe->tqe_next; 6065 MUTEX_EXIT(&nifq->ifq_lock); 6066} 6067 6068 6069/* ------------------------------------------------------------------------ */ 6070/* Function: ipf_updateipid */ 6071/* Returns: int - 0 == success, -1 == error (packet should be droppped) */ 6072/* Parameters: fin(I) - pointer to packet information */ 6073/* */ 6074/* When we are doing NAT, change the IP of every packet to represent a */ 6075/* single sequence of packets coming from the host, hiding any host */ 6076/* specific sequencing that might otherwise be revealed. If the packet is */ 6077/* a fragment, then store the 'new' IPid in the fragment cache and look up */ 6078/* the fragment cache for non-leading fragments. If a non-leading fragment */ 6079/* has no match in the cache, return an error. */ 6080/* ------------------------------------------------------------------------ */ 6081static int 6082ipf_updateipid(fin) 6083 fr_info_t *fin; 6084{ 6085 u_short id, ido, sums; 6086 u_32_t sumd, sum; 6087 ip_t *ip; 6088 6089 if (fin->fin_off != 0) { 6090 sum = ipf_frag_ipidknown(fin); 6091 if (sum == 0xffffffff) 6092 return -1; 6093 sum &= 0xffff; 6094 id = (u_short)sum; 6095 } else { 6096 id = ipf_nextipid(fin); 6097 if (fin->fin_off == 0 && (fin->fin_flx & FI_FRAG) != 0) 6098 (void) ipf_frag_ipidnew(fin, (u_32_t)id); 6099 } 6100 6101 ip = fin->fin_ip; 6102 ido = ntohs(ip->ip_id); 6103 if (id == ido) 6104 return 0; 6105 ip->ip_id = htons(id); 6106 CALC_SUMD(ido, id, sumd); /* DESTRUCTIVE MACRO! id,ido change */ 6107 sum = (~ntohs(ip->ip_sum)) & 0xffff; 6108 sum += sumd; 6109 sum = (sum >> 16) + (sum & 0xffff); 6110 sum = (sum >> 16) + (sum & 0xffff); 6111 sums = ~(u_short)sum; 6112 ip->ip_sum = htons(sums); 6113 return 0; 6114} 6115 6116 6117#ifdef NEED_FRGETIFNAME 6118/* ------------------------------------------------------------------------ */ 6119/* Function: ipf_getifname */ 6120/* Returns: char * - pointer to interface name */ 6121/* Parameters: ifp(I) - pointer to network interface */ 6122/* buffer(O) - pointer to where to store interface name */ 6123/* */ 6124/* Constructs an interface name in the buffer passed. The buffer passed is */ 6125/* expected to be at least LIFNAMSIZ in bytes big. If buffer is passed in */ 6126/* as a NULL pointer then return a pointer to a static array. */ 6127/* ------------------------------------------------------------------------ */ 6128char * 6129ipf_getifname(ifp, buffer) 6130 struct ifnet *ifp; 6131 char *buffer; 6132{ 6133 static char namebuf[LIFNAMSIZ]; 6134# if defined(MENTAT) || defined(__FreeBSD__) || defined(__osf__) || \ 6135 defined(__sgi) || defined(linux) || defined(_AIX51) || \ 6136 (defined(sun) && !defined(__SVR4) && !defined(__svr4__)) 6137 int unit, space; 6138 char temp[20]; 6139 char *s; 6140# endif 6141 6142 if (buffer == NULL) 6143 buffer = namebuf; 6144 (void) strncpy(buffer, ifp->if_name, LIFNAMSIZ); 6145 buffer[LIFNAMSIZ - 1] = '\0'; 6146# if defined(MENTAT) || defined(__FreeBSD__) || defined(__osf__) || \ 6147 defined(__sgi) || defined(_AIX51) || \ 6148 (defined(sun) && !defined(__SVR4) && !defined(__svr4__)) 6149 for (s = buffer; *s; s++) 6150 ; 6151 unit = ifp->if_unit; 6152 space = LIFNAMSIZ - (s - buffer); 6153 if ((space > 0) && (unit >= 0)) { 6154# if defined(SNPRINTF) && defined(_KERNEL) 6155 SNPRINTF(temp, sizeof(temp), "%d", unit); 6156# else 6157 (void) sprintf(temp, "%d", unit); 6158# endif 6159 (void) strncpy(s, temp, space); 6160 } 6161# endif 6162 return buffer; 6163} 6164#endif 6165 6166 6167/* ------------------------------------------------------------------------ */ 6168/* Function: ipf_ioctlswitch */ 6169/* Returns: int - -1 continue processing, else ioctl return value */ 6170/* Parameters: unit(I) - device unit opened */ 6171/* data(I) - pointer to ioctl data */ 6172/* cmd(I) - ioctl command */ 6173/* mode(I) - mode value */ 6174/* uid(I) - uid making the ioctl call */ 6175/* ctx(I) - pointer to context data */ 6176/* */ 6177/* Based on the value of unit, call the appropriate ioctl handler or return */ 6178/* EIO if ipfilter is not running. Also checks if write perms are req'd */ 6179/* for the device in order to execute the ioctl. A special case is made */ 6180/* SIOCIPFINTERROR so that the same code isn't required in every handler. */ 6181/* The context data pointer is passed through as this is used as the key */ 6182/* for locating a matching token for continued access for walking lists, */ 6183/* etc. */ 6184/* ------------------------------------------------------------------------ */ 6185int 6186ipf_ioctlswitch(softc, unit, data, cmd, mode, uid, ctx) 6187 ipf_main_softc_t *softc; 6188 int unit, mode, uid; 6189 ioctlcmd_t cmd; 6190 void *data, *ctx; 6191{ 6192 int error = 0; 6193 6194 switch (cmd) 6195 { 6196 case SIOCIPFINTERROR : 6197 error = BCOPYOUT(&softc->ipf_interror, data, 6198 sizeof(softc->ipf_interror)); 6199 if (error != 0) { 6200 IPFERROR(40); 6201 error = EFAULT; 6202 } 6203 return error; 6204 default : 6205 break; 6206 } 6207 6208 switch (unit) 6209 { 6210 case IPL_LOGIPF : 6211 error = ipf_ipf_ioctl(softc, data, cmd, mode, uid, ctx); 6212 break; 6213 case IPL_LOGNAT : 6214 if (softc->ipf_running > 0) { 6215 error = ipf_nat_ioctl(softc, data, cmd, mode, 6216 uid, ctx); 6217 } else { 6218 IPFERROR(42); 6219 error = EIO; 6220 } 6221 break; 6222 case IPL_LOGSTATE : 6223 if (softc->ipf_running > 0) { 6224 error = ipf_state_ioctl(softc, data, cmd, mode, 6225 uid, ctx); 6226 } else { 6227 IPFERROR(43); 6228 error = EIO; 6229 } 6230 break; 6231 case IPL_LOGAUTH : 6232 if (softc->ipf_running > 0) { 6233 error = ipf_auth_ioctl(softc, data, cmd, mode, 6234 uid, ctx); 6235 } else { 6236 IPFERROR(44); 6237 error = EIO; 6238 } 6239 break; 6240 case IPL_LOGSYNC : 6241 if (softc->ipf_running > 0) { 6242 error = ipf_sync_ioctl(softc, data, cmd, mode, 6243 uid, ctx); 6244 } else { 6245 error = EIO; 6246 IPFERROR(45); 6247 } 6248 break; 6249 case IPL_LOGSCAN : 6250#ifdef IPFILTER_SCAN 6251 if (softc->ipf_running > 0) 6252 error = ipf_scan_ioctl(softc, data, cmd, mode, 6253 uid, ctx); 6254 else 6255#endif 6256 { 6257 error = EIO; 6258 IPFERROR(46); 6259 } 6260 break; 6261 case IPL_LOGLOOKUP : 6262 if (softc->ipf_running > 0) { 6263 error = ipf_lookup_ioctl(softc, data, cmd, mode, 6264 uid, ctx); 6265 } else { 6266 error = EIO; 6267 IPFERROR(47); 6268 } 6269 break; 6270 default : 6271 IPFERROR(48); 6272 error = EIO; 6273 break; 6274 } 6275 6276 return error; 6277} 6278 6279 6280/* 6281 * This array defines the expected size of objects coming into the kernel 6282 * for the various recognised object types. The first column is flags (see 6283 * below), 2nd column is current size, 3rd column is the version number of 6284 * when the current size became current. 6285 * Flags: 6286 * 1 = minimum size, not absolute size 6287 */ 6288static int ipf_objbytes[IPFOBJ_COUNT][3] = { 6289 { 1, sizeof(struct frentry), 5010000 }, /* 0 */ 6290 { 1, sizeof(struct friostat), 5010000 }, 6291 { 0, sizeof(struct fr_info), 5010000 }, 6292 { 0, sizeof(struct ipf_authstat), 4010100 }, 6293 { 0, sizeof(struct ipfrstat), 5010000 }, 6294 { 1, sizeof(struct ipnat), 5010000 }, /* 5 */ 6295 { 0, sizeof(struct natstat), 5010000 }, 6296 { 0, sizeof(struct ipstate_save), 5010000 }, 6297 { 1, sizeof(struct nat_save), 5010000 }, 6298 { 0, sizeof(struct natlookup), 5010000 }, 6299 { 1, sizeof(struct ipstate), 5010000 }, /* 10 */ 6300 { 0, sizeof(struct ips_stat), 5010000 }, 6301 { 0, sizeof(struct frauth), 5010000 }, 6302 { 0, sizeof(struct ipftune), 4010100 }, 6303 { 0, sizeof(struct nat), 5010000 }, 6304 { 0, sizeof(struct ipfruleiter), 4011400 }, /* 15 */ 6305 { 0, sizeof(struct ipfgeniter), 4011400 }, 6306 { 0, sizeof(struct ipftable), 4011400 }, 6307 { 0, sizeof(struct ipflookupiter), 4011400 }, 6308 { 0, sizeof(struct ipftq) * IPF_TCP_NSTATES }, 6309 { 1, 0, 0 }, /* IPFEXPR */ 6310 { 0, 0, 0 }, /* PROXYCTL */ 6311 { 0, sizeof (struct fripf), 5010000 } 6312}; 6313 6314 6315/* ------------------------------------------------------------------------ */ 6316/* Function: ipf_inobj */ 6317/* Returns: int - 0 = success, else failure */ 6318/* Parameters: softc(I) - soft context pointerto work with */ 6319/* data(I) - pointer to ioctl data */ 6320/* objp(O) - where to store ipfobj structure */ 6321/* ptr(I) - pointer to data to copy out */ 6322/* type(I) - type of structure being moved */ 6323/* */ 6324/* Copy in the contents of what the ipfobj_t points to. In future, we */ 6325/* add things to check for version numbers, sizes, etc, to make it backward */ 6326/* compatible at the ABI for user land. */ 6327/* If objp is not NULL then we assume that the caller wants to see what is */ 6328/* in the ipfobj_t structure being copied in. As an example, this can tell */ 6329/* the caller what version of ipfilter the ioctl program was written to. */ 6330/* ------------------------------------------------------------------------ */ 6331int 6332ipf_inobj(softc, data, objp, ptr, type) 6333 ipf_main_softc_t *softc; 6334 void *data; 6335 ipfobj_t *objp; 6336 void *ptr; 6337 int type; 6338{ 6339 ipfobj_t obj; 6340 int error; 6341 int size; 6342 6343 if ((type < 0) || (type >= IPFOBJ_COUNT)) { 6344 IPFERROR(49); 6345 return EINVAL; 6346 } 6347 6348 if (objp == NULL) 6349 objp = &obj; 6350 error = BCOPYIN(data, objp, sizeof(*objp)); 6351 if (error != 0) { 6352 IPFERROR(124); 6353 return EFAULT; 6354 } 6355 6356 if (objp->ipfo_type != type) { 6357 IPFERROR(50); 6358 return EINVAL; 6359 } 6360 6361 if (objp->ipfo_rev >= ipf_objbytes[type][2]) { 6362 if ((ipf_objbytes[type][0] & 1) != 0) { 6363 if (objp->ipfo_size < ipf_objbytes[type][1]) { 6364 IPFERROR(51); 6365 return EINVAL; 6366 } 6367 size = ipf_objbytes[type][1]; 6368 } else if (objp->ipfo_size == ipf_objbytes[type][1]) { 6369 size = objp->ipfo_size; 6370 } else { 6371 IPFERROR(52); 6372 return EINVAL; 6373 } 6374 error = COPYIN(objp->ipfo_ptr, ptr, size); 6375 if (error != 0) { 6376 IPFERROR(55); 6377 error = EFAULT; 6378 } 6379 } else { 6380#ifdef IPFILTER_COMPAT 6381 error = ipf_in_compat(softc, objp, ptr, 0); 6382#else 6383 IPFERROR(54); 6384 error = EINVAL; 6385#endif 6386 } 6387 return error; 6388} 6389 6390 6391/* ------------------------------------------------------------------------ */ 6392/* Function: ipf_inobjsz */ 6393/* Returns: int - 0 = success, else failure */ 6394/* Parameters: softc(I) - soft context pointerto work with */ 6395/* data(I) - pointer to ioctl data */ 6396/* ptr(I) - pointer to store real data in */ 6397/* type(I) - type of structure being moved */ 6398/* sz(I) - size of data to copy */ 6399/* */ 6400/* As per ipf_inobj, except the size of the object to copy in is passed in */ 6401/* but it must not be smaller than the size defined for the type and the */ 6402/* type must allow for varied sized objects. The extra requirement here is */ 6403/* that sz must match the size of the object being passed in - this is not */ 6404/* not possible nor required in ipf_inobj(). */ 6405/* ------------------------------------------------------------------------ */ 6406int 6407ipf_inobjsz(softc, data, ptr, type, sz) 6408 ipf_main_softc_t *softc; 6409 void *data; 6410 void *ptr; 6411 int type, sz; 6412{ 6413 ipfobj_t obj; 6414 int error; 6415 6416 if ((type < 0) || (type >= IPFOBJ_COUNT)) { 6417 IPFERROR(56); 6418 return EINVAL; 6419 } 6420 6421 error = BCOPYIN(data, &obj, sizeof(obj)); 6422 if (error != 0) { 6423 IPFERROR(125); 6424 return EFAULT; 6425 } 6426 6427 if (obj.ipfo_type != type) { 6428 IPFERROR(58); 6429 return EINVAL; 6430 } 6431 6432 if (obj.ipfo_rev >= ipf_objbytes[type][2]) { 6433 if (((ipf_objbytes[type][0] & 1) == 0) || 6434 (sz < ipf_objbytes[type][1])) { 6435 IPFERROR(57); 6436 return EINVAL; 6437 } 6438 error = COPYIN(obj.ipfo_ptr, ptr, sz); 6439 if (error != 0) { 6440 IPFERROR(61); 6441 error = EFAULT; 6442 } 6443 } else { 6444#ifdef IPFILTER_COMPAT 6445 error = ipf_in_compat(softc, &obj, ptr, sz); 6446#else 6447 IPFERROR(60); 6448 error = EINVAL; 6449#endif 6450 } 6451 return error; 6452} 6453 6454 6455/* ------------------------------------------------------------------------ */ 6456/* Function: ipf_outobjsz */ 6457/* Returns: int - 0 = success, else failure */ 6458/* Parameters: data(I) - pointer to ioctl data */ 6459/* ptr(I) - pointer to store real data in */ 6460/* type(I) - type of structure being moved */ 6461/* sz(I) - size of data to copy */ 6462/* */ 6463/* As per ipf_outobj, except the size of the object to copy out is passed in*/ 6464/* but it must not be smaller than the size defined for the type and the */ 6465/* type must allow for varied sized objects. The extra requirement here is */ 6466/* that sz must match the size of the object being passed in - this is not */ 6467/* not possible nor required in ipf_outobj(). */ 6468/* ------------------------------------------------------------------------ */ 6469int 6470ipf_outobjsz(softc, data, ptr, type, sz) 6471 ipf_main_softc_t *softc; 6472 void *data; 6473 void *ptr; 6474 int type, sz; 6475{ 6476 ipfobj_t obj; 6477 int error; 6478 6479 if ((type < 0) || (type >= IPFOBJ_COUNT)) { 6480 IPFERROR(62); 6481 return EINVAL; 6482 } 6483 6484 error = BCOPYIN(data, &obj, sizeof(obj)); 6485 if (error != 0) { 6486 IPFERROR(127); 6487 return EFAULT; 6488 } 6489 6490 if (obj.ipfo_type != type) { 6491 IPFERROR(63); 6492 return EINVAL; 6493 } 6494 6495 if (obj.ipfo_rev >= ipf_objbytes[type][2]) { 6496 if (((ipf_objbytes[type][0] & 1) == 0) || 6497 (sz < ipf_objbytes[type][1])) { 6498 IPFERROR(146); 6499 return EINVAL; 6500 } 6501 error = COPYOUT(ptr, obj.ipfo_ptr, sz); 6502 if (error != 0) { 6503 IPFERROR(66); 6504 error = EFAULT; 6505 } 6506 } else { 6507#ifdef IPFILTER_COMPAT 6508 error = ipf_out_compat(softc, &obj, ptr); 6509#else 6510 IPFERROR(65); 6511 error = EINVAL; 6512#endif 6513 } 6514 return error; 6515} 6516 6517 6518/* ------------------------------------------------------------------------ */ 6519/* Function: ipf_outobj */ 6520/* Returns: int - 0 = success, else failure */ 6521/* Parameters: data(I) - pointer to ioctl data */ 6522/* ptr(I) - pointer to store real data in */ 6523/* type(I) - type of structure being moved */ 6524/* */ 6525/* Copy out the contents of what ptr is to where ipfobj points to. In */ 6526/* future, we add things to check for version numbers, sizes, etc, to make */ 6527/* it backward compatible at the ABI for user land. */ 6528/* ------------------------------------------------------------------------ */ 6529int 6530ipf_outobj(softc, data, ptr, type) 6531 ipf_main_softc_t *softc; 6532 void *data; 6533 void *ptr; 6534 int type; 6535{ 6536 ipfobj_t obj; 6537 int error; 6538 6539 if ((type < 0) || (type >= IPFOBJ_COUNT)) { 6540 IPFERROR(67); 6541 return EINVAL; 6542 } 6543 6544 error = BCOPYIN(data, &obj, sizeof(obj)); 6545 if (error != 0) { 6546 IPFERROR(126); 6547 return EFAULT; 6548 } 6549 6550 if (obj.ipfo_type != type) { 6551 IPFERROR(68); 6552 return EINVAL; 6553 } 6554 6555 if (obj.ipfo_rev >= ipf_objbytes[type][2]) { 6556 if ((ipf_objbytes[type][0] & 1) != 0) { 6557 if (obj.ipfo_size < ipf_objbytes[type][1]) { 6558 IPFERROR(69); 6559 return EINVAL; 6560 } 6561 } else if (obj.ipfo_size != ipf_objbytes[type][1]) { 6562 IPFERROR(70); 6563 return EINVAL; 6564 } 6565 6566 error = COPYOUT(ptr, obj.ipfo_ptr, obj.ipfo_size); 6567 if (error != 0) { 6568 IPFERROR(73); 6569 error = EFAULT; 6570 } 6571 } else { 6572#ifdef IPFILTER_COMPAT 6573 error = ipf_out_compat(softc, &obj, ptr); 6574#else 6575 IPFERROR(72); 6576 error = EINVAL; 6577#endif 6578 } 6579 return error; 6580} 6581 6582 6583/* ------------------------------------------------------------------------ */ 6584/* Function: ipf_outobjk */ 6585/* Returns: int - 0 = success, else failure */ 6586/* Parameters: obj(I) - pointer to data description structure */ 6587/* ptr(I) - pointer to kernel data to copy out */ 6588/* */ 6589/* In the above functions, the ipfobj_t structure is copied into the kernel,*/ 6590/* telling ipfilter how to copy out data. In this instance, the ipfobj_t is */ 6591/* already populated with information and now we just need to use it. */ 6592/* There is no need for this function to have a "type" parameter as there */ 6593/* is no point in validating information that comes from the kernel with */ 6594/* itself. */ 6595/* ------------------------------------------------------------------------ */ 6596int 6597ipf_outobjk(softc, obj, ptr) 6598 ipf_main_softc_t *softc; 6599 ipfobj_t *obj; 6600 void *ptr; 6601{ 6602 int type = obj->ipfo_type; 6603 int error; 6604 6605 if ((type < 0) || (type >= IPFOBJ_COUNT)) { 6606 IPFERROR(147); 6607 return EINVAL; 6608 } 6609 6610 if (obj->ipfo_rev >= ipf_objbytes[type][2]) { 6611 if ((ipf_objbytes[type][0] & 1) != 0) { 6612 if (obj->ipfo_size < ipf_objbytes[type][1]) { 6613 IPFERROR(148); 6614 return EINVAL; 6615 } 6616 6617 } else if (obj->ipfo_size != ipf_objbytes[type][1]) { 6618 IPFERROR(149); 6619 return EINVAL; 6620 } 6621 6622 error = COPYOUT(ptr, obj->ipfo_ptr, obj->ipfo_size); 6623 if (error != 0) { 6624 IPFERROR(150); 6625 error = EFAULT; 6626 } 6627 } else { 6628#ifdef IPFILTER_COMPAT 6629 error = ipf_out_compat(softc, obj, ptr); 6630#else 6631 IPFERROR(151); 6632 error = EINVAL; 6633#endif 6634 } 6635 return error; 6636} 6637 6638 6639/* ------------------------------------------------------------------------ */ 6640/* Function: ipf_checkl4sum */ 6641/* Returns: int - 0 = good, -1 = bad, 1 = cannot check */ 6642/* Parameters: fin(I) - pointer to packet information */ 6643/* */ 6644/* If possible, calculate the layer 4 checksum for the packet. If this is */ 6645/* not possible, return without indicating a failure or success but in a */ 6646/* way that is ditinguishable. This function should only be called by the */ 6647/* ipf_checkv6sum() for each platform. */ 6648/* ------------------------------------------------------------------------ */ 6649INLINE int 6650ipf_checkl4sum(fin) 6651 fr_info_t *fin; 6652{ 6653 u_short sum, hdrsum, *csump; 6654 udphdr_t *udp; 6655 int dosum; 6656 6657 /* 6658 * If the TCP packet isn't a fragment, isn't too short and otherwise 6659 * isn't already considered "bad", then validate the checksum. If 6660 * this check fails then considered the packet to be "bad". 6661 */ 6662 if ((fin->fin_flx & (FI_FRAG|FI_SHORT|FI_BAD)) != 0) 6663 return 1; 6664 6665 csump = NULL; 6666 hdrsum = 0; 6667 dosum = 0; 6668 sum = 0; 6669 6670 switch (fin->fin_p) 6671 { 6672 case IPPROTO_TCP : 6673 csump = &((tcphdr_t *)fin->fin_dp)->th_sum; 6674 dosum = 1; 6675 break; 6676 6677 case IPPROTO_UDP : 6678 udp = fin->fin_dp; 6679 if (udp->uh_sum != 0) { 6680 csump = &udp->uh_sum; 6681 dosum = 1; 6682 } 6683 break; 6684 6685#ifdef USE_INET6 6686 case IPPROTO_ICMPV6 : 6687 csump = &((struct icmp6_hdr *)fin->fin_dp)->icmp6_cksum; 6688 dosum = 1; 6689 break; 6690#endif 6691 6692 case IPPROTO_ICMP : 6693 csump = &((struct icmp *)fin->fin_dp)->icmp_cksum; 6694 dosum = 1; 6695 break; 6696 6697 default : 6698 return 1; 6699 /*NOTREACHED*/ 6700 } 6701 6702 if (csump != NULL) 6703 hdrsum = *csump; 6704 6705 if (dosum) { 6706 sum = fr_cksum(fin, fin->fin_ip, fin->fin_p, fin->fin_dp); 6707 } 6708#if !defined(_KERNEL) 6709 if (sum == hdrsum) { 6710 FR_DEBUG(("checkl4sum: %hx == %hx\n", sum, hdrsum)); 6711 } else { 6712 FR_DEBUG(("checkl4sum: %hx != %hx\n", sum, hdrsum)); 6713 } 6714#endif 6715 DT2(l4sums, u_short, hdrsum, u_short, sum); 6716 if (hdrsum == sum) { 6717 fin->fin_cksum = FI_CK_SUMOK; 6718 return 0; 6719 } 6720 fin->fin_cksum = FI_CK_BAD; 6721 return -1; 6722} 6723 6724 6725/* ------------------------------------------------------------------------ */ 6726/* Function: ipf_ifpfillv4addr */ 6727/* Returns: int - 0 = address update, -1 = address not updated */ 6728/* Parameters: atype(I) - type of network address update to perform */ 6729/* sin(I) - pointer to source of address information */ 6730/* mask(I) - pointer to source of netmask information */ 6731/* inp(I) - pointer to destination address store */ 6732/* inpmask(I) - pointer to destination netmask store */ 6733/* */ 6734/* Given a type of network address update (atype) to perform, copy */ 6735/* information from sin/mask into inp/inpmask. If ipnmask is NULL then no */ 6736/* netmask update is performed unless FRI_NETMASKED is passed as atype, in */ 6737/* which case the operation fails. For all values of atype other than */ 6738/* FRI_NETMASKED, if inpmask is non-NULL then the mask is set to an all 1s */ 6739/* value. */ 6740/* ------------------------------------------------------------------------ */ 6741int 6742ipf_ifpfillv4addr(atype, sin, mask, inp, inpmask) 6743 int atype; 6744 struct sockaddr_in *sin, *mask; 6745 struct in_addr *inp, *inpmask; 6746{ 6747 if (inpmask != NULL && atype != FRI_NETMASKED) 6748 inpmask->s_addr = 0xffffffff; 6749 6750 if (atype == FRI_NETWORK || atype == FRI_NETMASKED) { 6751 if (atype == FRI_NETMASKED) { 6752 if (inpmask == NULL) 6753 return -1; 6754 inpmask->s_addr = mask->sin_addr.s_addr; 6755 } 6756 inp->s_addr = sin->sin_addr.s_addr & mask->sin_addr.s_addr; 6757 } else { 6758 inp->s_addr = sin->sin_addr.s_addr; 6759 } 6760 return 0; 6761} 6762 6763 6764#ifdef USE_INET6 6765/* ------------------------------------------------------------------------ */ 6766/* Function: ipf_ifpfillv6addr */ 6767/* Returns: int - 0 = address update, -1 = address not updated */ 6768/* Parameters: atype(I) - type of network address update to perform */ 6769/* sin(I) - pointer to source of address information */ 6770/* mask(I) - pointer to source of netmask information */ 6771/* inp(I) - pointer to destination address store */ 6772/* inpmask(I) - pointer to destination netmask store */ 6773/* */ 6774/* Given a type of network address update (atype) to perform, copy */ 6775/* information from sin/mask into inp/inpmask. If ipnmask is NULL then no */ 6776/* netmask update is performed unless FRI_NETMASKED is passed as atype, in */ 6777/* which case the operation fails. For all values of atype other than */ 6778/* FRI_NETMASKED, if inpmask is non-NULL then the mask is set to an all 1s */ 6779/* value. */ 6780/* ------------------------------------------------------------------------ */ 6781int 6782ipf_ifpfillv6addr(atype, sin, mask, inp, inpmask) 6783 int atype; 6784 struct sockaddr_in6 *sin, *mask; 6785 i6addr_t *inp, *inpmask; 6786{ 6787 i6addr_t *src, *and; 6788 6789 src = (i6addr_t *)&sin->sin6_addr; 6790 and = (i6addr_t *)&mask->sin6_addr; 6791 6792 if (inpmask != NULL && atype != FRI_NETMASKED) { 6793 inpmask->i6[0] = 0xffffffff; 6794 inpmask->i6[1] = 0xffffffff; 6795 inpmask->i6[2] = 0xffffffff; 6796 inpmask->i6[3] = 0xffffffff; 6797 } 6798 6799 if (atype == FRI_NETWORK || atype == FRI_NETMASKED) { 6800 if (atype == FRI_NETMASKED) { 6801 if (inpmask == NULL) 6802 return -1; 6803 inpmask->i6[0] = and->i6[0]; 6804 inpmask->i6[1] = and->i6[1]; 6805 inpmask->i6[2] = and->i6[2]; 6806 inpmask->i6[3] = and->i6[3]; 6807 } 6808 6809 inp->i6[0] = src->i6[0] & and->i6[0]; 6810 inp->i6[1] = src->i6[1] & and->i6[1]; 6811 inp->i6[2] = src->i6[2] & and->i6[2]; 6812 inp->i6[3] = src->i6[3] & and->i6[3]; 6813 } else { 6814 inp->i6[0] = src->i6[0]; 6815 inp->i6[1] = src->i6[1]; 6816 inp->i6[2] = src->i6[2]; 6817 inp->i6[3] = src->i6[3]; 6818 } 6819 return 0; 6820} 6821#endif 6822 6823 6824/* ------------------------------------------------------------------------ */ 6825/* Function: ipf_matchtag */ 6826/* Returns: 0 == mismatch, 1 == match. */ 6827/* Parameters: tag1(I) - pointer to first tag to compare */ 6828/* tag2(I) - pointer to second tag to compare */ 6829/* */ 6830/* Returns true (non-zero) or false(0) if the two tag structures can be */ 6831/* considered to be a match or not match, respectively. The tag is 16 */ 6832/* bytes long (16 characters) but that is overlayed with 4 32bit ints so */ 6833/* compare the ints instead, for speed. tag1 is the master of the */ 6834/* comparison. This function should only be called with both tag1 and tag2 */ 6835/* as non-NULL pointers. */ 6836/* ------------------------------------------------------------------------ */ 6837int 6838ipf_matchtag(tag1, tag2) 6839 ipftag_t *tag1, *tag2; 6840{ 6841 if (tag1 == tag2) 6842 return 1; 6843 6844 if ((tag1->ipt_num[0] == 0) && (tag2->ipt_num[0] == 0)) 6845 return 1; 6846 6847 if ((tag1->ipt_num[0] == tag2->ipt_num[0]) && 6848 (tag1->ipt_num[1] == tag2->ipt_num[1]) && 6849 (tag1->ipt_num[2] == tag2->ipt_num[2]) && 6850 (tag1->ipt_num[3] == tag2->ipt_num[3])) 6851 return 1; 6852 return 0; 6853} 6854 6855 6856/* ------------------------------------------------------------------------ */ 6857/* Function: ipf_coalesce */ 6858/* Returns: 1 == success, -1 == failure, 0 == no change */ 6859/* Parameters: fin(I) - pointer to packet information */ 6860/* */ 6861/* Attempt to get all of the packet data into a single, contiguous buffer. */ 6862/* If this call returns a failure then the buffers have also been freed. */ 6863/* ------------------------------------------------------------------------ */ 6864int 6865ipf_coalesce(fin) 6866 fr_info_t *fin; 6867{ 6868 6869 if ((fin->fin_flx & FI_COALESCE) != 0) 6870 return 1; 6871 6872 /* 6873 * If the mbuf pointers indicate that there is no mbuf to work with, 6874 * return but do not indicate success or failure. 6875 */ 6876 if (fin->fin_m == NULL || fin->fin_mp == NULL) 6877 return 0; 6878 6879#if defined(_KERNEL) 6880 if (ipf_pullup(fin->fin_m, fin, fin->fin_plen) == NULL) { 6881 ipf_main_softc_t *softc = fin->fin_main_soft; 6882 6883 DT1(frb_coalesce, fr_info_t *, fin); 6884 LBUMP(ipf_stats[fin->fin_out].fr_badcoalesces); 6885# ifdef MENTAT 6886 FREE_MB_T(*fin->fin_mp); 6887# endif 6888 fin->fin_reason = FRB_COALESCE; 6889 *fin->fin_mp = NULL; 6890 fin->fin_m = NULL; 6891 return -1; 6892 } 6893#else 6894 fin = fin; /* LINT */ 6895#endif 6896 return 1; 6897} 6898 6899 6900/* 6901 * The following table lists all of the tunable variables that can be 6902 * accessed via SIOCIPFGET/SIOCIPFSET/SIOCIPFGETNEXt. The format of each row 6903 * in the table below is as follows: 6904 * 6905 * pointer to value, name of value, minimum, maximum, size of the value's 6906 * container, value attribute flags 6907 * 6908 * For convienience, IPFT_RDONLY means the value is read-only, IPFT_WRDISABLED 6909 * means the value can only be written to when IPFilter is loaded but disabled. 6910 * The obvious implication is if neither of these are set then the value can be 6911 * changed at any time without harm. 6912 */ 6913 6914 6915/* ------------------------------------------------------------------------ */ 6916/* Function: ipf_tune_findbycookie */ 6917/* Returns: NULL = search failed, else pointer to tune struct */ 6918/* Parameters: cookie(I) - cookie value to search for amongst tuneables */ 6919/* next(O) - pointer to place to store the cookie for the */ 6920/* "next" tuneable, if it is desired. */ 6921/* */ 6922/* This function is used to walk through all of the existing tunables with */ 6923/* successive calls. It searches the known tunables for the one which has */ 6924/* a matching value for "cookie" - ie its address. When returning a match, */ 6925/* the next one to be found may be returned inside next. */ 6926/* ------------------------------------------------------------------------ */ 6927static ipftuneable_t * 6928ipf_tune_findbycookie(ptop, cookie, next) 6929 ipftuneable_t **ptop; 6930 void *cookie, **next; 6931{ 6932 ipftuneable_t *ta, **tap; 6933 6934 for (ta = *ptop; ta->ipft_name != NULL; ta++) 6935 if (ta == cookie) { 6936 if (next != NULL) { 6937 /* 6938 * If the next entry in the array has a name 6939 * present, then return a pointer to it for 6940 * where to go next, else return a pointer to 6941 * the dynaminc list as a key to search there 6942 * next. This facilitates a weak linking of 6943 * the two "lists" together. 6944 */ 6945 if ((ta + 1)->ipft_name != NULL) 6946 *next = ta + 1; 6947 else 6948 *next = ptop; 6949 } 6950 return ta; 6951 } 6952 6953 for (tap = ptop; (ta = *tap) != NULL; tap = &ta->ipft_next) 6954 if (tap == cookie) { 6955 if (next != NULL) 6956 *next = &ta->ipft_next; 6957 return ta; 6958 } 6959 6960 if (next != NULL) 6961 *next = NULL; 6962 return NULL; 6963} 6964 6965 6966/* ------------------------------------------------------------------------ */ 6967/* Function: ipf_tune_findbyname */ 6968/* Returns: NULL = search failed, else pointer to tune struct */ 6969/* Parameters: name(I) - name of the tuneable entry to find. */ 6970/* */ 6971/* Search the static array of tuneables and the list of dynamic tuneables */ 6972/* for an entry with a matching name. If we can find one, return a pointer */ 6973/* to the matching structure. */ 6974/* ------------------------------------------------------------------------ */ 6975static ipftuneable_t * 6976ipf_tune_findbyname(top, name) 6977 ipftuneable_t *top; 6978 const char *name; 6979{ 6980 ipftuneable_t *ta; 6981 6982 for (ta = top; ta != NULL; ta = ta->ipft_next) 6983 if (!strcmp(ta->ipft_name, name)) { 6984 return ta; 6985 } 6986 6987 return NULL; 6988} 6989 6990 6991/* ------------------------------------------------------------------------ */ 6992/* Function: ipf_tune_add_array */ 6993/* Returns: int - 0 == success, else failure */ 6994/* Parameters: newtune - pointer to new tune array to add to tuneables */ 6995/* */ 6996/* Appends tune structures from the array passed in (newtune) to the end of */ 6997/* the current list of "dynamic" tuneable parameters. */ 6998/* If any entry to be added is already present (by name) then the operation */ 6999/* is aborted - entries that have been added are removed before returning. */ 7000/* An entry with no name (NULL) is used as the indication that the end of */ 7001/* the array has been reached. */ 7002/* ------------------------------------------------------------------------ */ 7003int 7004ipf_tune_add_array(softc, newtune) 7005 ipf_main_softc_t *softc; 7006 ipftuneable_t *newtune; 7007{ 7008 ipftuneable_t *nt, *dt; 7009 int error = 0; 7010 7011 for (nt = newtune; nt->ipft_name != NULL; nt++) { 7012 error = ipf_tune_add(softc, nt); 7013 if (error != 0) { 7014 for (dt = newtune; dt != nt; dt++) { 7015 (void) ipf_tune_del(softc, dt); 7016 } 7017 } 7018 } 7019 7020 return error; 7021} 7022 7023 7024/* ------------------------------------------------------------------------ */ 7025/* Function: ipf_tune_array_link */ 7026/* Returns: 0 == success, -1 == failure */ 7027/* Parameters: softc(I) - soft context pointerto work with */ 7028/* array(I) - pointer to an array of tuneables */ 7029/* */ 7030/* Given an array of tunables (array), append them to the current list of */ 7031/* tuneables for this context (softc->ipf_tuners.) To properly prepare the */ 7032/* the array for being appended to the list, initialise all of the next */ 7033/* pointers so we don't need to walk parts of it with ++ and others with */ 7034/* next. The array is expected to have an entry with a NULL name as the */ 7035/* terminator. Trying to add an array with no non-NULL names will return as */ 7036/* a failure. */ 7037/* ------------------------------------------------------------------------ */ 7038int 7039ipf_tune_array_link(softc, array) 7040 ipf_main_softc_t *softc; 7041 ipftuneable_t *array; 7042{ 7043 ipftuneable_t *t, **p; 7044 7045 t = array; 7046 if (t->ipft_name == NULL) 7047 return -1; 7048 7049 for (; t[1].ipft_name != NULL; t++) 7050 t[0].ipft_next = &t[1]; 7051 t->ipft_next = NULL; 7052 7053 /* 7054 * Since a pointer to the last entry isn't kept, we need to find it 7055 * each time we want to add new variables to the list. 7056 */ 7057 for (p = &softc->ipf_tuners; (t = *p) != NULL; p = &t->ipft_next) 7058 if (t->ipft_name == NULL) 7059 break; 7060 *p = array; 7061 7062 return 0; 7063} 7064 7065 7066/* ------------------------------------------------------------------------ */ 7067/* Function: ipf_tune_array_unlink */ 7068/* Returns: 0 == success, -1 == failure */ 7069/* Parameters: softc(I) - soft context pointerto work with */ 7070/* array(I) - pointer to an array of tuneables */ 7071/* */ 7072/* ------------------------------------------------------------------------ */ 7073int 7074ipf_tune_array_unlink(softc, array) 7075 ipf_main_softc_t *softc; 7076 ipftuneable_t *array; 7077{ 7078 ipftuneable_t *t, **p; 7079 7080 for (p = &softc->ipf_tuners; (t = *p) != NULL; p = &t->ipft_next) 7081 if (t == array) 7082 break; 7083 if (t == NULL) 7084 return -1; 7085 7086 for (; t[1].ipft_name != NULL; t++) 7087 ; 7088 7089 *p = t->ipft_next; 7090 7091 return 0; 7092} 7093 7094 7095/* ------------------------------------------------------------------------ */ 7096/* Function: ipf_tune_array_copy */ 7097/* Returns: NULL = failure, else pointer to new array */ 7098/* Parameters: base(I) - pointer to structure base */ 7099/* size(I) - size of the array at template */ 7100/* template(I) - original array to copy */ 7101/* */ 7102/* Allocate memory for a new set of tuneable values and copy everything */ 7103/* from template into the new region of memory. The new region is full of */ 7104/* uninitialised pointers (ipft_next) so set them up. Now, ipftp_offset... */ 7105/* */ 7106/* NOTE: the following assumes that sizeof(long) == sizeof(void *) */ 7107/* In the array template, ipftp_offset is the offset (in bytes) of the */ 7108/* location of the tuneable value inside the structure pointed to by base. */ 7109/* As ipftp_offset is a union over the pointers to the tuneable values, if */ 7110/* we add base to the copy's ipftp_offset, copy ends up with a pointer in */ 7111/* ipftp_void that points to the stored value. */ 7112/* ------------------------------------------------------------------------ */ 7113ipftuneable_t * 7114ipf_tune_array_copy(base, size, template) 7115 void *base; 7116 size_t size; 7117 ipftuneable_t *template; 7118{ 7119 ipftuneable_t *copy; 7120 int i; 7121 7122 7123 KMALLOCS(copy, ipftuneable_t *, size); 7124 if (copy == NULL) { 7125 return NULL; 7126 } 7127 bcopy(template, copy, size); 7128 7129 for (i = 0; copy[i].ipft_name; i++) { 7130 copy[i].ipft_una.ipftp_offset += (u_long)base; 7131 copy[i].ipft_next = copy + i + 1; 7132 } 7133 7134 return copy; 7135} 7136 7137 7138/* ------------------------------------------------------------------------ */ 7139/* Function: ipf_tune_add */ 7140/* Returns: int - 0 == success, else failure */ 7141/* Parameters: newtune - pointer to new tune entry to add to tuneables */ 7142/* */ 7143/* Appends tune structures from the array passed in (newtune) to the end of */ 7144/* the current list of "dynamic" tuneable parameters. Once added, the */ 7145/* owner of the object is not expected to ever change "ipft_next". */ 7146/* ------------------------------------------------------------------------ */ 7147int 7148ipf_tune_add(softc, newtune) 7149 ipf_main_softc_t *softc; 7150 ipftuneable_t *newtune; 7151{ 7152 ipftuneable_t *ta, **tap; 7153 7154 ta = ipf_tune_findbyname(softc->ipf_tuners, newtune->ipft_name); 7155 if (ta != NULL) { 7156 IPFERROR(74); 7157 return EEXIST; 7158 } 7159 7160 for (tap = &softc->ipf_tuners; *tap != NULL; tap = &(*tap)->ipft_next) 7161 ; 7162 7163 newtune->ipft_next = NULL; 7164 *tap = newtune; 7165 return 0; 7166} 7167 7168 7169/* ------------------------------------------------------------------------ */ 7170/* Function: ipf_tune_del */ 7171/* Returns: int - 0 == success, else failure */ 7172/* Parameters: oldtune - pointer to tune entry to remove from the list of */ 7173/* current dynamic tuneables */ 7174/* */ 7175/* Search for the tune structure, by pointer, in the list of those that are */ 7176/* dynamically added at run time. If found, adjust the list so that this */ 7177/* structure is no longer part of it. */ 7178/* ------------------------------------------------------------------------ */ 7179int 7180ipf_tune_del(softc, oldtune) 7181 ipf_main_softc_t *softc; 7182 ipftuneable_t *oldtune; 7183{ 7184 ipftuneable_t *ta, **tap; 7185 int error = 0; 7186 7187 for (tap = &softc->ipf_tuners; (ta = *tap) != NULL; 7188 tap = &ta->ipft_next) { 7189 if (ta == oldtune) { 7190 *tap = oldtune->ipft_next; 7191 oldtune->ipft_next = NULL; 7192 break; 7193 } 7194 } 7195 7196 if (ta == NULL) { 7197 error = ESRCH; 7198 IPFERROR(75); 7199 } 7200 return error; 7201} 7202 7203 7204/* ------------------------------------------------------------------------ */ 7205/* Function: ipf_tune_del_array */ 7206/* Returns: int - 0 == success, else failure */ 7207/* Parameters: oldtune - pointer to tuneables array */ 7208/* */ 7209/* Remove each tuneable entry in the array from the list of "dynamic" */ 7210/* tunables. If one entry should fail to be found, an error will be */ 7211/* returned and no further ones removed. */ 7212/* An entry with a NULL name is used as the indicator of the last entry in */ 7213/* the array. */ 7214/* ------------------------------------------------------------------------ */ 7215int 7216ipf_tune_del_array(softc, oldtune) 7217 ipf_main_softc_t *softc; 7218 ipftuneable_t *oldtune; 7219{ 7220 ipftuneable_t *ot; 7221 int error = 0; 7222 7223 for (ot = oldtune; ot->ipft_name != NULL; ot++) { 7224 error = ipf_tune_del(softc, ot); 7225 if (error != 0) 7226 break; 7227 } 7228 7229 return error; 7230 7231} 7232 7233 7234/* ------------------------------------------------------------------------ */ 7235/* Function: ipf_tune */ 7236/* Returns: int - 0 == success, else failure */ 7237/* Parameters: cmd(I) - ioctl command number */ 7238/* data(I) - pointer to ioctl data structure */ 7239/* */ 7240/* Implement handling of SIOCIPFGETNEXT, SIOCIPFGET and SIOCIPFSET. These */ 7241/* three ioctls provide the means to access and control global variables */ 7242/* within IPFilter, allowing (for example) timeouts and table sizes to be */ 7243/* changed without rebooting, reloading or recompiling. The initialisation */ 7244/* and 'destruction' routines of the various components of ipfilter are all */ 7245/* each responsible for handling their own values being too big. */ 7246/* ------------------------------------------------------------------------ */ 7247int 7248ipf_ipftune(softc, cmd, data) 7249 ipf_main_softc_t *softc; 7250 ioctlcmd_t cmd; 7251 void *data; 7252{ 7253 ipftuneable_t *ta; 7254 ipftune_t tu; 7255 void *cookie; 7256 int error; 7257 7258 error = ipf_inobj(softc, data, NULL, &tu, IPFOBJ_TUNEABLE); 7259 if (error != 0) 7260 return error; 7261 7262 tu.ipft_name[sizeof(tu.ipft_name) - 1] = '\0'; 7263 cookie = tu.ipft_cookie; 7264 ta = NULL; 7265 7266 switch (cmd) 7267 { 7268 case SIOCIPFGETNEXT : 7269 /* 7270 * If cookie is non-NULL, assume it to be a pointer to the last 7271 * entry we looked at, so find it (if possible) and return a 7272 * pointer to the next one after it. The last entry in the 7273 * the table is a NULL entry, so when we get to it, set cookie 7274 * to NULL and return that, indicating end of list, erstwhile 7275 * if we come in with cookie set to NULL, we are starting anew 7276 * at the front of the list. 7277 */ 7278 if (cookie != NULL) { 7279 ta = ipf_tune_findbycookie(&softc->ipf_tuners, 7280 cookie, &tu.ipft_cookie); 7281 } else { 7282 ta = softc->ipf_tuners; 7283 tu.ipft_cookie = ta + 1; 7284 } 7285 if (ta != NULL) { 7286 /* 7287 * Entry found, but does the data pointed to by that 7288 * row fit in what we can return? 7289 */ 7290 if (ta->ipft_sz > sizeof(tu.ipft_un)) { 7291 IPFERROR(76); 7292 return EINVAL; 7293 } 7294 7295 tu.ipft_vlong = 0; 7296 if (ta->ipft_sz == sizeof(u_long)) 7297 tu.ipft_vlong = *ta->ipft_plong; 7298 else if (ta->ipft_sz == sizeof(u_int)) 7299 tu.ipft_vint = *ta->ipft_pint; 7300 else if (ta->ipft_sz == sizeof(u_short)) 7301 tu.ipft_vshort = *ta->ipft_pshort; 7302 else if (ta->ipft_sz == sizeof(u_char)) 7303 tu.ipft_vchar = *ta->ipft_pchar; 7304 7305 tu.ipft_sz = ta->ipft_sz; 7306 tu.ipft_min = ta->ipft_min; 7307 tu.ipft_max = ta->ipft_max; 7308 tu.ipft_flags = ta->ipft_flags; 7309 bcopy(ta->ipft_name, tu.ipft_name, 7310 MIN(sizeof(tu.ipft_name), 7311 strlen(ta->ipft_name) + 1)); 7312 } 7313 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE); 7314 break; 7315 7316 case SIOCIPFGET : 7317 case SIOCIPFSET : 7318 /* 7319 * Search by name or by cookie value for a particular entry 7320 * in the tuning paramter table. 7321 */ 7322 IPFERROR(77); 7323 error = ESRCH; 7324 if (cookie != NULL) { 7325 ta = ipf_tune_findbycookie(&softc->ipf_tuners, 7326 cookie, NULL); 7327 if (ta != NULL) 7328 error = 0; 7329 } else if (tu.ipft_name[0] != '\0') { 7330 ta = ipf_tune_findbyname(softc->ipf_tuners, 7331 tu.ipft_name); 7332 if (ta != NULL) 7333 error = 0; 7334 } 7335 if (error != 0) 7336 break; 7337 7338 if (cmd == (ioctlcmd_t)SIOCIPFGET) { 7339 /* 7340 * Fetch the tuning parameters for a particular value 7341 */ 7342 tu.ipft_vlong = 0; 7343 if (ta->ipft_sz == sizeof(u_long)) 7344 tu.ipft_vlong = *ta->ipft_plong; 7345 else if (ta->ipft_sz == sizeof(u_int)) 7346 tu.ipft_vint = *ta->ipft_pint; 7347 else if (ta->ipft_sz == sizeof(u_short)) 7348 tu.ipft_vshort = *ta->ipft_pshort; 7349 else if (ta->ipft_sz == sizeof(u_char)) 7350 tu.ipft_vchar = *ta->ipft_pchar; 7351 tu.ipft_cookie = ta; 7352 tu.ipft_sz = ta->ipft_sz; 7353 tu.ipft_min = ta->ipft_min; 7354 tu.ipft_max = ta->ipft_max; 7355 tu.ipft_flags = ta->ipft_flags; 7356 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE); 7357 7358 } else if (cmd == (ioctlcmd_t)SIOCIPFSET) { 7359 /* 7360 * Set an internal parameter. The hard part here is 7361 * getting the new value safely and correctly out of 7362 * the kernel (given we only know its size, not type.) 7363 */ 7364 u_long in; 7365 7366 if (((ta->ipft_flags & IPFT_WRDISABLED) != 0) && 7367 (softc->ipf_running > 0)) { 7368 IPFERROR(78); 7369 error = EBUSY; 7370 break; 7371 } 7372 7373 in = tu.ipft_vlong; 7374 if (in < ta->ipft_min || in > ta->ipft_max) { 7375 IPFERROR(79); 7376 error = EINVAL; 7377 break; 7378 } 7379 7380 if (ta->ipft_func != NULL) { 7381 SPL_INT(s); 7382 7383 SPL_NET(s); 7384 error = (*ta->ipft_func)(softc, ta, 7385 &tu.ipft_un); 7386 SPL_X(s); 7387 7388 } else if (ta->ipft_sz == sizeof(u_long)) { 7389 tu.ipft_vlong = *ta->ipft_plong; 7390 *ta->ipft_plong = in; 7391 7392 } else if (ta->ipft_sz == sizeof(u_int)) { 7393 tu.ipft_vint = *ta->ipft_pint; 7394 *ta->ipft_pint = (u_int)(in & 0xffffffff); 7395 7396 } else if (ta->ipft_sz == sizeof(u_short)) { 7397 tu.ipft_vshort = *ta->ipft_pshort; 7398 *ta->ipft_pshort = (u_short)(in & 0xffff); 7399 7400 } else if (ta->ipft_sz == sizeof(u_char)) { 7401 tu.ipft_vchar = *ta->ipft_pchar; 7402 *ta->ipft_pchar = (u_char)(in & 0xff); 7403 } 7404 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE); 7405 } 7406 break; 7407 7408 default : 7409 IPFERROR(80); 7410 error = EINVAL; 7411 break; 7412 } 7413 7414 return error; 7415} 7416 7417 7418/* ------------------------------------------------------------------------ */ 7419/* Function: ipf_zerostats */ 7420/* Returns: int - 0 = success, else failure */ 7421/* Parameters: data(O) - pointer to pointer for copying data back to */ 7422/* */ 7423/* Copies the current statistics out to userspace and then zero's the */ 7424/* current ones in the kernel. The lock is only held across the bzero() as */ 7425/* the copyout may result in paging (ie network activity.) */ 7426/* ------------------------------------------------------------------------ */ 7427int 7428ipf_zerostats(softc, data) 7429 ipf_main_softc_t *softc; 7430 caddr_t data; 7431{ 7432 friostat_t fio; 7433 ipfobj_t obj; 7434 int error; 7435 7436 error = ipf_inobj(softc, data, &obj, &fio, IPFOBJ_IPFSTAT); 7437 if (error != 0) 7438 return error; 7439 ipf_getstat(softc, &fio, obj.ipfo_rev); 7440 error = ipf_outobj(softc, data, &fio, IPFOBJ_IPFSTAT); 7441 if (error != 0) 7442 return error; 7443 7444 WRITE_ENTER(&softc->ipf_mutex); 7445 bzero(&softc->ipf_stats, sizeof(softc->ipf_stats)); 7446 RWLOCK_EXIT(&softc->ipf_mutex); 7447 7448 return 0; 7449} 7450 7451 7452/* ------------------------------------------------------------------------ */ 7453/* Function: ipf_resolvedest */ 7454/* Returns: Nil */ 7455/* Parameters: softc(I) - pointer to soft context main structure */ 7456/* base(I) - where strings are stored */ 7457/* fdp(IO) - pointer to destination information to resolve */ 7458/* v(I) - IP protocol version to match */ 7459/* */ 7460/* Looks up an interface name in the frdest structure pointed to by fdp and */ 7461/* if a matching name can be found for the particular IP protocol version */ 7462/* then store the interface pointer in the frdest struct. If no match is */ 7463/* found, then set the interface pointer to be -1 as NULL is considered to */ 7464/* indicate there is no information at all in the structure. */ 7465/* ------------------------------------------------------------------------ */ 7466int 7467ipf_resolvedest(softc, base, fdp, v) 7468 ipf_main_softc_t *softc; 7469 char *base; 7470 frdest_t *fdp; 7471 int v; 7472{ 7473 int errval = 0; 7474 void *ifp; 7475 7476 ifp = NULL; 7477 7478 if (fdp->fd_name != -1) { 7479 if (fdp->fd_type == FRD_DSTLIST) { 7480 ifp = ipf_lookup_res_name(softc, IPL_LOGIPF, 7481 IPLT_DSTLIST, 7482 base + fdp->fd_name, 7483 NULL); 7484 if (ifp == NULL) { 7485 IPFERROR(144); 7486 errval = ESRCH; 7487 } 7488 } else { 7489 ifp = GETIFP(base + fdp->fd_name, v); 7490 if (ifp == NULL) 7491 ifp = (void *)-1; 7492 } 7493 } 7494 fdp->fd_ptr = ifp; 7495 7496 if ((ifp != NULL) && (ifp != (void *)-1)) { 7497 fdp->fd_local = ipf_deliverlocal(softc, v, ifp, &fdp->fd_ip6); 7498 } 7499 7500 return errval; 7501} 7502 7503 7504/* ------------------------------------------------------------------------ */ 7505/* Function: ipf_resolvenic */ 7506/* Returns: void* - NULL = wildcard name, -1 = failed to find NIC, else */ 7507/* pointer to interface structure for NIC */ 7508/* Parameters: softc(I)- pointer to soft context main structure */ 7509/* name(I) - complete interface name */ 7510/* v(I) - IP protocol version */ 7511/* */ 7512/* Look for a network interface structure that firstly has a matching name */ 7513/* to that passed in and that is also being used for that IP protocol */ 7514/* version (necessary on some platforms where there are separate listings */ 7515/* for both IPv4 and IPv6 on the same physical NIC. */ 7516/* ------------------------------------------------------------------------ */ 7517void * 7518ipf_resolvenic(softc, name, v) 7519 ipf_main_softc_t *softc; 7520 char *name; 7521 int v; 7522{ 7523 void *nic; 7524 7525 softc = softc; /* gcc -Wextra */ 7526 if (name[0] == '\0') 7527 return NULL; 7528 7529 if ((name[1] == '\0') && ((name[0] == '-') || (name[0] == '*'))) { 7530 return NULL; 7531 } 7532 7533 nic = GETIFP(name, v); 7534 if (nic == NULL) 7535 nic = (void *)-1; 7536 return nic; 7537} 7538 7539 7540/* ------------------------------------------------------------------------ */ 7541/* Function: ipf_token_expire */ 7542/* Returns: None. */ 7543/* Parameters: softc(I) - pointer to soft context main structure */ 7544/* */ 7545/* This function is run every ipf tick to see if there are any tokens that */ 7546/* have been held for too long and need to be freed up. */ 7547/* ------------------------------------------------------------------------ */ 7548void 7549ipf_token_expire(softc) 7550 ipf_main_softc_t *softc; 7551{ 7552 ipftoken_t *it; 7553 7554 WRITE_ENTER(&softc->ipf_tokens); 7555 while ((it = softc->ipf_token_head) != NULL) { 7556 if (it->ipt_die > softc->ipf_ticks) 7557 break; 7558 7559 ipf_token_deref(softc, it); 7560 } 7561 RWLOCK_EXIT(&softc->ipf_tokens); 7562} 7563 7564 7565/* ------------------------------------------------------------------------ */ 7566/* Function: ipf_token_flush */ 7567/* Returns: None. */ 7568/* Parameters: softc(I) - pointer to soft context main structure */ 7569/* */ 7570/* Loop through all of the existing tokens and call deref to see if they */ 7571/* can be freed. Normally a function like this might just loop on */ 7572/* ipf_token_head but there is a chance that a token might have a ref count */ 7573/* of greater than one and in that case the the reference would drop twice */ 7574/* by code that is only entitled to drop it once. */ 7575/* ------------------------------------------------------------------------ */ 7576static void 7577ipf_token_flush(softc) 7578 ipf_main_softc_t *softc; 7579{ 7580 ipftoken_t *it, *next; 7581 7582 WRITE_ENTER(&softc->ipf_tokens); 7583 for (it = softc->ipf_token_head; it != NULL; it = next) { 7584 next = it->ipt_next; 7585 (void) ipf_token_deref(softc, it); 7586 } 7587 RWLOCK_EXIT(&softc->ipf_tokens); 7588} 7589 7590 7591/* ------------------------------------------------------------------------ */ 7592/* Function: ipf_token_del */ 7593/* Returns: int - 0 = success, else error */ 7594/* Parameters: softc(I)- pointer to soft context main structure */ 7595/* type(I) - the token type to match */ 7596/* uid(I) - uid owning the token */ 7597/* ptr(I) - context pointer for the token */ 7598/* */ 7599/* This function looks for a a token in the current list that matches up */ 7600/* the fields (type, uid, ptr). If none is found, ESRCH is returned, else */ 7601/* call ipf_token_dewref() to remove it from the list. In the event that */ 7602/* the token has a reference held elsewhere, setting ipt_complete to 2 */ 7603/* enables debugging to distinguish between the two paths that ultimately */ 7604/* lead to a token to be deleted. */ 7605/* ------------------------------------------------------------------------ */ 7606int 7607ipf_token_del(softc, type, uid, ptr) 7608 ipf_main_softc_t *softc; 7609 int type, uid; 7610 void *ptr; 7611{ 7612 ipftoken_t *it; 7613 int error; 7614 7615 IPFERROR(82); 7616 error = ESRCH; 7617 7618 WRITE_ENTER(&softc->ipf_tokens); 7619 for (it = softc->ipf_token_head; it != NULL; it = it->ipt_next) { 7620 if (ptr == it->ipt_ctx && type == it->ipt_type && 7621 uid == it->ipt_uid) { 7622 it->ipt_complete = 2; 7623 ipf_token_deref(softc, it); 7624 error = 0; 7625 break; 7626 } 7627 } 7628 RWLOCK_EXIT(&softc->ipf_tokens); 7629 7630 return error; 7631} 7632 7633 7634/* ------------------------------------------------------------------------ */ 7635/* Function: ipf_token_mark_complete */ 7636/* Returns: None. */ 7637/* Parameters: token(I) - pointer to token structure */ 7638/* */ 7639/* Mark a token as being ineligable for being found with ipf_token_find. */ 7640/* ------------------------------------------------------------------------ */ 7641void 7642ipf_token_mark_complete(token) 7643 ipftoken_t *token; 7644{ 7645 if (token->ipt_complete == 0) 7646 token->ipt_complete = 1; 7647} 7648 7649 7650/* ------------------------------------------------------------------------ */ 7651/* Function: ipf_token_find */ 7652/* Returns: ipftoken_t * - NULL if no memory, else pointer to token */ 7653/* Parameters: softc(I)- pointer to soft context main structure */ 7654/* type(I) - the token type to match */ 7655/* uid(I) - uid owning the token */ 7656/* ptr(I) - context pointer for the token */ 7657/* */ 7658/* This function looks for a live token in the list of current tokens that */ 7659/* matches the tuple (type, uid, ptr). If one cannot be found then one is */ 7660/* allocated. If one is found then it is moved to the top of the list of */ 7661/* currently active tokens. */ 7662/* ------------------------------------------------------------------------ */ 7663ipftoken_t * 7664ipf_token_find(softc, type, uid, ptr) 7665 ipf_main_softc_t *softc; 7666 int type, uid; 7667 void *ptr; 7668{ 7669 ipftoken_t *it, *new; 7670 7671 KMALLOC(new, ipftoken_t *); 7672 if (new != NULL) 7673 bzero((char *)new, sizeof(*new)); 7674 7675 WRITE_ENTER(&softc->ipf_tokens); 7676 for (it = softc->ipf_token_head; it != NULL; it = it->ipt_next) { 7677 if ((ptr == it->ipt_ctx) && (type == it->ipt_type) && 7678 (uid == it->ipt_uid) && (it->ipt_complete < 2)) 7679 break; 7680 } 7681 7682 if (it == NULL) { 7683 it = new; 7684 new = NULL; 7685 if (it == NULL) { 7686 RWLOCK_EXIT(&softc->ipf_tokens); 7687 return NULL; 7688 } 7689 it->ipt_ctx = ptr; 7690 it->ipt_uid = uid; 7691 it->ipt_type = type; 7692 it->ipt_ref = 1; 7693 } else { 7694 if (new != NULL) { 7695 KFREE(new); 7696 new = NULL; 7697 } 7698 7699 if (it->ipt_complete > 0) 7700 it = NULL; 7701 else 7702 ipf_token_unlink(softc, it); 7703 } 7704 7705 if (it != NULL) { 7706 it->ipt_pnext = softc->ipf_token_tail; 7707 *softc->ipf_token_tail = it; 7708 softc->ipf_token_tail = &it->ipt_next; 7709 it->ipt_next = NULL; 7710 it->ipt_ref++; 7711 7712 it->ipt_die = softc->ipf_ticks + 20; 7713 } 7714 7715 RWLOCK_EXIT(&softc->ipf_tokens); 7716 7717 return it; 7718} 7719 7720 7721/* ------------------------------------------------------------------------ */ 7722/* Function: ipf_token_unlink */ 7723/* Returns: None. */ 7724/* Parameters: softc(I) - pointer to soft context main structure */ 7725/* token(I) - pointer to token structure */ 7726/* Write Locks: ipf_tokens */ 7727/* */ 7728/* This function unlinks a token structure from the linked list of tokens */ 7729/* that "own" it. The head pointer never needs to be explicitly adjusted */ 7730/* but the tail does due to the linked list implementation. */ 7731/* ------------------------------------------------------------------------ */ 7732static void 7733ipf_token_unlink(softc, token) 7734 ipf_main_softc_t *softc; 7735 ipftoken_t *token; 7736{ 7737 7738 if (softc->ipf_token_tail == &token->ipt_next) 7739 softc->ipf_token_tail = token->ipt_pnext; 7740 7741 *token->ipt_pnext = token->ipt_next; 7742 if (token->ipt_next != NULL) 7743 token->ipt_next->ipt_pnext = token->ipt_pnext; 7744 token->ipt_next = NULL; 7745 token->ipt_pnext = NULL; 7746} 7747 7748 7749/* ------------------------------------------------------------------------ */ 7750/* Function: ipf_token_deref */ 7751/* Returns: int - 0 == token freed, else reference count */ 7752/* Parameters: softc(I) - pointer to soft context main structure */ 7753/* token(I) - pointer to token structure */ 7754/* Write Locks: ipf_tokens */ 7755/* */ 7756/* Drop the reference count on the token structure and if it drops to zero, */ 7757/* call the dereference function for the token type because it is then */ 7758/* possible to free the token data structure. */ 7759/* ------------------------------------------------------------------------ */ 7760int 7761ipf_token_deref(softc, token) 7762 ipf_main_softc_t *softc; 7763 ipftoken_t *token; 7764{ 7765 void *data, **datap; 7766 7767 ASSERT(token->ipt_ref > 0); 7768 token->ipt_ref--; 7769 if (token->ipt_ref > 0) 7770 return token->ipt_ref; 7771 7772 data = token->ipt_data; 7773 datap = &data; 7774 7775 if ((data != NULL) && (data != (void *)-1)) { 7776 switch (token->ipt_type) 7777 { 7778 case IPFGENITER_IPF : 7779 (void) ipf_derefrule(softc, (frentry_t **)datap); 7780 break; 7781 case IPFGENITER_IPNAT : 7782 WRITE_ENTER(&softc->ipf_nat); 7783 ipf_nat_rule_deref(softc, (ipnat_t **)datap); 7784 RWLOCK_EXIT(&softc->ipf_nat); 7785 break; 7786 case IPFGENITER_NAT : 7787 ipf_nat_deref(softc, (nat_t **)datap); 7788 break; 7789 case IPFGENITER_STATE : 7790 ipf_state_deref(softc, (ipstate_t **)datap); 7791 break; 7792 case IPFGENITER_FRAG : 7793 ipf_frag_pkt_deref(softc, (ipfr_t **)datap); 7794 break; 7795 case IPFGENITER_NATFRAG : 7796 ipf_frag_nat_deref(softc, (ipfr_t **)datap); 7797 break; 7798 case IPFGENITER_HOSTMAP : 7799 WRITE_ENTER(&softc->ipf_nat); 7800 ipf_nat_hostmapdel(softc, (hostmap_t **)datap); 7801 RWLOCK_EXIT(&softc->ipf_nat); 7802 break; 7803 default : 7804 ipf_lookup_iterderef(softc, token->ipt_type, data); 7805 break; 7806 } 7807 } 7808 7809 ipf_token_unlink(softc, token); 7810 KFREE(token); 7811 return 0; 7812} 7813 7814 7815/* ------------------------------------------------------------------------ */ 7816/* Function: ipf_nextrule */ 7817/* Returns: frentry_t * - NULL == no more rules, else pointer to next */ 7818/* Parameters: softc(I) - pointer to soft context main structure */ 7819/* fr(I) - pointer to filter rule */ 7820/* out(I) - 1 == out rules, 0 == input rules */ 7821/* */ 7822/* Starting with "fr", find the next rule to visit. This includes visiting */ 7823/* the list of rule groups if either fr is NULL (empty list) or it is the */ 7824/* last rule in the list. When walking rule lists, it is either input or */ 7825/* output rules that are returned, never both. */ 7826/* ------------------------------------------------------------------------ */ 7827static frentry_t * 7828ipf_nextrule(softc, active, unit, fr, out) 7829 ipf_main_softc_t *softc; 7830 int active, unit; 7831 frentry_t *fr; 7832 int out; 7833{ 7834 frentry_t *next; 7835 frgroup_t *fg; 7836 7837 if (fr != NULL && fr->fr_group != -1) { 7838 fg = ipf_findgroup(softc, fr->fr_names + fr->fr_group, 7839 unit, active, NULL); 7840 if (fg != NULL) 7841 fg = fg->fg_next; 7842 } else { 7843 fg = softc->ipf_groups[unit][active]; 7844 } 7845 7846 while (fg != NULL) { 7847 next = fg->fg_start; 7848 while (next != NULL) { 7849 if (out) { 7850 if (next->fr_flags & FR_OUTQUE) 7851 return next; 7852 } else if (next->fr_flags & FR_INQUE) { 7853 return next; 7854 } 7855 next = next->fr_next; 7856 } 7857 if (next == NULL) 7858 fg = fg->fg_next; 7859 } 7860 7861 return NULL; 7862} 7863 7864/* ------------------------------------------------------------------------ */ 7865/* Function: ipf_getnextrule */ 7866/* Returns: int - 0 = success, else error */ 7867/* Parameters: softc(I)- pointer to soft context main structure */ 7868/* t(I) - pointer to destination information to resolve */ 7869/* ptr(I) - pointer to ipfobj_t to copyin from user space */ 7870/* */ 7871/* This function's first job is to bring in the ipfruleiter_t structure via */ 7872/* the ipfobj_t structure to determine what should be the next rule to */ 7873/* return. Once the ipfruleiter_t has been brought in, it then tries to */ 7874/* find the 'next rule'. This may include searching rule group lists or */ 7875/* just be as simple as looking at the 'next' field in the rule structure. */ 7876/* When we have found the rule to return, increase its reference count and */ 7877/* if we used an existing rule to get here, decrease its reference count. */ 7878/* ------------------------------------------------------------------------ */ 7879int 7880ipf_getnextrule(softc, t, ptr) 7881 ipf_main_softc_t *softc; 7882 ipftoken_t *t; 7883 void *ptr; 7884{ 7885 frentry_t *fr, *next, zero; 7886 ipfruleiter_t it; 7887 int error, out; 7888 frgroup_t *fg; 7889 ipfobj_t obj; 7890 int predict; 7891 char *dst; 7892 int unit; 7893 7894 if (t == NULL || ptr == NULL) { 7895 IPFERROR(84); 7896 return EFAULT; 7897 } 7898 7899 error = ipf_inobj(softc, ptr, &obj, &it, IPFOBJ_IPFITER); 7900 if (error != 0) 7901 return error; 7902 7903 if ((it.iri_inout < 0) || (it.iri_inout > 3)) { 7904 IPFERROR(85); 7905 return EINVAL; 7906 } 7907 if ((it.iri_active != 0) && (it.iri_active != 1)) { 7908 IPFERROR(86); 7909 return EINVAL; 7910 } 7911 if (it.iri_nrules == 0) { 7912 IPFERROR(87); 7913 return ENOSPC; 7914 } 7915 if (it.iri_rule == NULL) { 7916 IPFERROR(88); 7917 return EFAULT; 7918 } 7919 7920 fg = NULL; 7921 fr = t->ipt_data; 7922 if ((it.iri_inout & F_OUT) != 0) 7923 out = 1; 7924 else 7925 out = 0; 7926 if ((it.iri_inout & F_ACIN) != 0) 7927 unit = IPL_LOGCOUNT; 7928 else 7929 unit = IPL_LOGIPF; 7930 7931 READ_ENTER(&softc->ipf_mutex); 7932 if (fr == NULL) { 7933 if (*it.iri_group == '\0') { 7934 if (unit == IPL_LOGCOUNT) { 7935 next = softc->ipf_acct[out][it.iri_active]; 7936 } else { 7937 next = softc->ipf_rules[out][it.iri_active]; 7938 } 7939 if (next == NULL) 7940 next = ipf_nextrule(softc, it.iri_active, 7941 unit, NULL, out); 7942 } else { 7943 fg = ipf_findgroup(softc, it.iri_group, unit, 7944 it.iri_active, NULL); 7945 if (fg != NULL) 7946 next = fg->fg_start; 7947 else 7948 next = NULL; 7949 } 7950 } else { 7951 next = fr->fr_next; 7952 if (next == NULL) 7953 next = ipf_nextrule(softc, it.iri_active, unit, 7954 fr, out); 7955 } 7956 7957 if (next != NULL && next->fr_next != NULL) 7958 predict = 1; 7959 else if (ipf_nextrule(softc, it.iri_active, unit, next, out) != NULL) 7960 predict = 1; 7961 else 7962 predict = 0; 7963 7964 if (fr != NULL) 7965 (void) ipf_derefrule(softc, &fr); 7966 7967 obj.ipfo_type = IPFOBJ_FRENTRY; 7968 dst = (char *)it.iri_rule; 7969 7970 if (next != NULL) { 7971 obj.ipfo_size = next->fr_size; 7972 MUTEX_ENTER(&next->fr_lock); 7973 next->fr_ref++; 7974 MUTEX_EXIT(&next->fr_lock); 7975 t->ipt_data = next; 7976 } else { 7977 obj.ipfo_size = sizeof(frentry_t); 7978 bzero(&zero, sizeof(zero)); 7979 next = &zero; 7980 t->ipt_data = NULL; 7981 } 7982 it.iri_rule = predict ? next : NULL; 7983 if (predict == 0) 7984 ipf_token_mark_complete(t); 7985 7986 RWLOCK_EXIT(&softc->ipf_mutex); 7987 7988 obj.ipfo_ptr = dst; 7989 error = ipf_outobjk(softc, &obj, next); 7990 if (error == 0 && t->ipt_data != NULL) { 7991 dst += obj.ipfo_size; 7992 if (next->fr_data != NULL) { 7993 ipfobj_t dobj; 7994 7995 if (next->fr_type == FR_T_IPFEXPR) 7996 dobj.ipfo_type = IPFOBJ_IPFEXPR; 7997 else 7998 dobj.ipfo_type = IPFOBJ_FRIPF; 7999 dobj.ipfo_size = next->fr_dsize; 8000 dobj.ipfo_rev = obj.ipfo_rev; 8001 dobj.ipfo_ptr = dst; 8002 error = ipf_outobjk(softc, &dobj, next->fr_data); 8003 } 8004 } 8005 8006 if ((fr != NULL) && (next == &zero)) 8007 (void) ipf_derefrule(softc, &fr); 8008 8009 return error; 8010} 8011 8012 8013/* ------------------------------------------------------------------------ */ 8014/* Function: ipf_frruleiter */ 8015/* Returns: int - 0 = success, else error */ 8016/* Parameters: softc(I)- pointer to soft context main structure */ 8017/* data(I) - the token type to match */ 8018/* uid(I) - uid owning the token */ 8019/* ptr(I) - context pointer for the token */ 8020/* */ 8021/* This function serves as a stepping stone between ipf_ipf_ioctl and */ 8022/* ipf_getnextrule. It's role is to find the right token in the kernel for */ 8023/* the process doing the ioctl and use that to ask for the next rule. */ 8024/* ------------------------------------------------------------------------ */ 8025static int 8026ipf_frruleiter(softc, data, uid, ctx) 8027 ipf_main_softc_t *softc; 8028 void *data, *ctx; 8029 int uid; 8030{ 8031 ipftoken_t *token; 8032 ipfruleiter_t it; 8033 ipfobj_t obj; 8034 int error; 8035 8036 token = ipf_token_find(softc, IPFGENITER_IPF, uid, ctx); 8037 if (token != NULL) { 8038 error = ipf_getnextrule(softc, token, data); 8039 WRITE_ENTER(&softc->ipf_tokens); 8040 ipf_token_deref(softc, token); 8041 RWLOCK_EXIT(&softc->ipf_tokens); 8042 } else { 8043 error = ipf_inobj(softc, data, &obj, &it, IPFOBJ_IPFITER); 8044 if (error != 0) 8045 return error; 8046 it.iri_rule = NULL; 8047 error = ipf_outobj(softc, data, &it, IPFOBJ_IPFITER); 8048 } 8049 8050 return error; 8051} 8052 8053 8054/* ------------------------------------------------------------------------ */ 8055/* Function: ipf_geniter */ 8056/* Returns: int - 0 = success, else error */ 8057/* Parameters: softc(I) - pointer to soft context main structure */ 8058/* token(I) - pointer to ipftoken_t structure */ 8059/* itp(I) - pointer to iterator data */ 8060/* */ 8061/* Decide which iterator function to call using information passed through */ 8062/* the ipfgeniter_t structure at itp. */ 8063/* ------------------------------------------------------------------------ */ 8064static int 8065ipf_geniter(softc, token, itp) 8066 ipf_main_softc_t *softc; 8067 ipftoken_t *token; 8068 ipfgeniter_t *itp; 8069{ 8070 int error; 8071 8072 switch (itp->igi_type) 8073 { 8074 case IPFGENITER_FRAG : 8075 error = ipf_frag_pkt_next(softc, token, itp); 8076 break; 8077 default : 8078 IPFERROR(92); 8079 error = EINVAL; 8080 break; 8081 } 8082 8083 return error; 8084} 8085 8086 8087/* ------------------------------------------------------------------------ */ 8088/* Function: ipf_genericiter */ 8089/* Returns: int - 0 = success, else error */ 8090/* Parameters: softc(I)- pointer to soft context main structure */ 8091/* data(I) - the token type to match */ 8092/* uid(I) - uid owning the token */ 8093/* ptr(I) - context pointer for the token */ 8094/* */ 8095/* Handle the SIOCGENITER ioctl for the ipfilter device. The primary role */ 8096/* ------------------------------------------------------------------------ */ 8097int 8098ipf_genericiter(softc, data, uid, ctx) 8099 ipf_main_softc_t *softc; 8100 void *data, *ctx; 8101 int uid; 8102{ 8103 ipftoken_t *token; 8104 ipfgeniter_t iter; 8105 int error; 8106 8107 error = ipf_inobj(softc, data, NULL, &iter, IPFOBJ_GENITER); 8108 if (error != 0) 8109 return error; 8110 8111 token = ipf_token_find(softc, iter.igi_type, uid, ctx); 8112 if (token != NULL) { 8113 token->ipt_subtype = iter.igi_type; 8114 error = ipf_geniter(softc, token, &iter); 8115 WRITE_ENTER(&softc->ipf_tokens); 8116 ipf_token_deref(softc, token); 8117 RWLOCK_EXIT(&softc->ipf_tokens); 8118 } else { 8119 IPFERROR(93); 8120 error = 0; 8121 } 8122 8123 return error; 8124} 8125 8126 8127/* ------------------------------------------------------------------------ */ 8128/* Function: ipf_ipf_ioctl */ 8129/* Returns: int - 0 = success, else error */ 8130/* Parameters: softc(I)- pointer to soft context main structure */ 8131/* data(I) - the token type to match */ 8132/* cmd(I) - the ioctl command number */ 8133/* mode(I) - mode flags for the ioctl */ 8134/* uid(I) - uid owning the token */ 8135/* ptr(I) - context pointer for the token */ 8136/* */ 8137/* This function handles all of the ioctl command that are actually isssued */ 8138/* to the /dev/ipl device. */ 8139/* ------------------------------------------------------------------------ */ 8140int 8141ipf_ipf_ioctl(softc, data, cmd, mode, uid, ctx) 8142 ipf_main_softc_t *softc; 8143 caddr_t data; 8144 ioctlcmd_t cmd; 8145 int mode, uid; 8146 void *ctx; 8147{ 8148 friostat_t fio; 8149 int error, tmp; 8150 ipfobj_t obj; 8151 SPL_INT(s); 8152 8153 switch (cmd) 8154 { 8155 case SIOCFRENB : 8156 if (!(mode & FWRITE)) { 8157 IPFERROR(94); 8158 error = EPERM; 8159 } else { 8160 error = BCOPYIN(data, &tmp, sizeof(tmp)); 8161 if (error != 0) { 8162 IPFERROR(95); 8163 error = EFAULT; 8164 break; 8165 } 8166 8167 WRITE_ENTER(&softc->ipf_global); 8168 if (tmp) { 8169 if (softc->ipf_running > 0) 8170 error = 0; 8171 else 8172 error = ipfattach(softc); 8173 if (error == 0) 8174 softc->ipf_running = 1; 8175 else 8176 (void) ipfdetach(softc); 8177 } else { 8178 if (softc->ipf_running == 1) 8179 error = ipfdetach(softc); 8180 else 8181 error = 0; 8182 if (error == 0) 8183 softc->ipf_running = -1; 8184 } 8185 RWLOCK_EXIT(&softc->ipf_global); 8186 } 8187 break; 8188 8189 case SIOCIPFSET : 8190 if (!(mode & FWRITE)) { 8191 IPFERROR(96); 8192 error = EPERM; 8193 break; 8194 } 8195 /* FALLTHRU */ 8196 case SIOCIPFGETNEXT : 8197 case SIOCIPFGET : 8198 error = ipf_ipftune(softc, cmd, (void *)data); 8199 break; 8200 8201 case SIOCSETFF : 8202 if (!(mode & FWRITE)) { 8203 IPFERROR(97); 8204 error = EPERM; 8205 } else { 8206 error = BCOPYIN(data, &softc->ipf_flags, 8207 sizeof(softc->ipf_flags)); 8208 if (error != 0) { 8209 IPFERROR(98); 8210 error = EFAULT; 8211 } 8212 } 8213 break; 8214 8215 case SIOCGETFF : 8216 error = BCOPYOUT(&softc->ipf_flags, data, 8217 sizeof(softc->ipf_flags)); 8218 if (error != 0) { 8219 IPFERROR(99); 8220 error = EFAULT; 8221 } 8222 break; 8223 8224 case SIOCFUNCL : 8225 error = ipf_resolvefunc(softc, (void *)data); 8226 break; 8227 8228 case SIOCINAFR : 8229 case SIOCRMAFR : 8230 case SIOCADAFR : 8231 case SIOCZRLST : 8232 if (!(mode & FWRITE)) { 8233 IPFERROR(100); 8234 error = EPERM; 8235 } else { 8236 error = frrequest(softc, IPL_LOGIPF, cmd, (caddr_t)data, 8237 softc->ipf_active, 1); 8238 } 8239 break; 8240 8241 case SIOCINIFR : 8242 case SIOCRMIFR : 8243 case SIOCADIFR : 8244 if (!(mode & FWRITE)) { 8245 IPFERROR(101); 8246 error = EPERM; 8247 } else { 8248 error = frrequest(softc, IPL_LOGIPF, cmd, (caddr_t)data, 8249 1 - softc->ipf_active, 1); 8250 } 8251 break; 8252 8253 case SIOCSWAPA : 8254 if (!(mode & FWRITE)) { 8255 IPFERROR(102); 8256 error = EPERM; 8257 } else { 8258 WRITE_ENTER(&softc->ipf_mutex); 8259 error = BCOPYOUT(&softc->ipf_active, data, 8260 sizeof(softc->ipf_active)); 8261 if (error != 0) { 8262 IPFERROR(103); 8263 error = EFAULT; 8264 } else { 8265 softc->ipf_active = 1 - softc->ipf_active; 8266 } 8267 RWLOCK_EXIT(&softc->ipf_mutex); 8268 } 8269 break; 8270 8271 case SIOCGETFS : 8272 error = ipf_inobj(softc, (void *)data, &obj, &fio, 8273 IPFOBJ_IPFSTAT); 8274 if (error != 0) 8275 break; 8276 ipf_getstat(softc, &fio, obj.ipfo_rev); 8277 error = ipf_outobj(softc, (void *)data, &fio, IPFOBJ_IPFSTAT); 8278 break; 8279 8280 case SIOCFRZST : 8281 if (!(mode & FWRITE)) { 8282 IPFERROR(104); 8283 error = EPERM; 8284 } else 8285 error = ipf_zerostats(softc, (caddr_t)data); 8286 break; 8287 8288 case SIOCIPFFL : 8289 if (!(mode & FWRITE)) { 8290 IPFERROR(105); 8291 error = EPERM; 8292 } else { 8293 error = BCOPYIN(data, &tmp, sizeof(tmp)); 8294 if (!error) { 8295 tmp = ipf_flush(softc, IPL_LOGIPF, tmp); 8296 error = BCOPYOUT(&tmp, data, sizeof(tmp)); 8297 if (error != 0) { 8298 IPFERROR(106); 8299 error = EFAULT; 8300 } 8301 } else { 8302 IPFERROR(107); 8303 error = EFAULT; 8304 } 8305 } 8306 break; 8307 8308#ifdef USE_INET6 8309 case SIOCIPFL6 : 8310 if (!(mode & FWRITE)) { 8311 IPFERROR(108); 8312 error = EPERM; 8313 } else { 8314 error = BCOPYIN(data, &tmp, sizeof(tmp)); 8315 if (!error) { 8316 tmp = ipf_flush(softc, IPL_LOGIPF, tmp); 8317 error = BCOPYOUT(&tmp, data, sizeof(tmp)); 8318 if (error != 0) { 8319 IPFERROR(109); 8320 error = EFAULT; 8321 } 8322 } else { 8323 IPFERROR(110); 8324 error = EFAULT; 8325 } 8326 } 8327 break; 8328#endif 8329 8330 case SIOCSTLCK : 8331 if (!(mode & FWRITE)) { 8332 IPFERROR(122); 8333 error = EPERM; 8334 } else { 8335 error = BCOPYIN(data, &tmp, sizeof(tmp)); 8336 if (error == 0) { 8337 ipf_state_setlock(softc->ipf_state_soft, tmp); 8338 ipf_nat_setlock(softc->ipf_nat_soft, tmp); 8339 ipf_frag_setlock(softc->ipf_frag_soft, tmp); 8340 ipf_auth_setlock(softc->ipf_auth_soft, tmp); 8341 } else { 8342 IPFERROR(111); 8343 error = EFAULT; 8344 } 8345 } 8346 break; 8347 8348#ifdef IPFILTER_LOG 8349 case SIOCIPFFB : 8350 if (!(mode & FWRITE)) { 8351 IPFERROR(112); 8352 error = EPERM; 8353 } else { 8354 tmp = ipf_log_clear(softc, IPL_LOGIPF); 8355 error = BCOPYOUT(&tmp, data, sizeof(tmp)); 8356 if (error) { 8357 IPFERROR(113); 8358 error = EFAULT; 8359 } 8360 } 8361 break; 8362#endif /* IPFILTER_LOG */ 8363 8364 case SIOCFRSYN : 8365 if (!(mode & FWRITE)) { 8366 IPFERROR(114); 8367 error = EPERM; 8368 } else { 8369 WRITE_ENTER(&softc->ipf_global); 8370#if (defined(MENTAT) && defined(_KERNEL)) && !defined(INSTANCES) 8371 error = ipfsync(); 8372#else 8373 ipf_sync(softc, NULL); 8374 error = 0; 8375#endif 8376 RWLOCK_EXIT(&softc->ipf_global); 8377 8378 } 8379 break; 8380 8381 case SIOCGFRST : 8382 error = ipf_outobj(softc, (void *)data, 8383 ipf_frag_stats(softc->ipf_frag_soft), 8384 IPFOBJ_FRAGSTAT); 8385 break; 8386 8387#ifdef IPFILTER_LOG 8388 case FIONREAD : 8389 tmp = ipf_log_bytesused(softc, IPL_LOGIPF); 8390 error = BCOPYOUT(&tmp, data, sizeof(tmp)); 8391 break; 8392#endif 8393 8394 case SIOCIPFITER : 8395 SPL_SCHED(s); 8396 error = ipf_frruleiter(softc, data, uid, ctx); 8397 SPL_X(s); 8398 break; 8399 8400 case SIOCGENITER : 8401 SPL_SCHED(s); 8402 error = ipf_genericiter(softc, data, uid, ctx); 8403 SPL_X(s); 8404 break; 8405 8406 case SIOCIPFDELTOK : 8407 error = BCOPYIN(data, &tmp, sizeof(tmp)); 8408 if (error == 0) { 8409 SPL_SCHED(s); 8410 error = ipf_token_del(softc, tmp, uid, ctx); 8411 SPL_X(s); 8412 } 8413 break; 8414 8415 default : 8416 IPFERROR(115); 8417 error = EINVAL; 8418 break; 8419 } 8420 8421 return error; 8422} 8423 8424 8425/* ------------------------------------------------------------------------ */ 8426/* Function: ipf_decaps */ 8427/* Returns: int - -1 == decapsulation failed, else bit mask of */ 8428/* flags indicating packet filtering decision. */ 8429/* Parameters: fin(I) - pointer to packet information */ 8430/* pass(I) - IP protocol version to match */ 8431/* l5proto(I) - layer 5 protocol to decode UDP data as. */ 8432/* */ 8433/* This function is called for packets that are wrapt up in other packets, */ 8434/* for example, an IP packet that is the entire data segment for another IP */ 8435/* packet. If the basic constraints for this are satisfied, change the */ 8436/* buffer to point to the start of the inner packet and start processing */ 8437/* rules belonging to the head group this rule specifies. */ 8438/* ------------------------------------------------------------------------ */ 8439u_32_t 8440ipf_decaps(fin, pass, l5proto) 8441 fr_info_t *fin; 8442 u_32_t pass; 8443 int l5proto; 8444{ 8445 fr_info_t fin2, *fino = NULL; 8446 int elen, hlen, nh; 8447 grehdr_t gre; 8448 ip_t *ip; 8449 mb_t *m; 8450 8451 if ((fin->fin_flx & FI_COALESCE) == 0) 8452 if (ipf_coalesce(fin) == -1) 8453 goto cantdecaps; 8454 8455 m = fin->fin_m; 8456 hlen = fin->fin_hlen; 8457 8458 switch (fin->fin_p) 8459 { 8460 case IPPROTO_UDP : 8461 /* 8462 * In this case, the specific protocol being decapsulated 8463 * inside UDP frames comes from the rule. 8464 */ 8465 nh = fin->fin_fr->fr_icode; 8466 break; 8467 8468 case IPPROTO_GRE : /* 47 */ 8469 bcopy(fin->fin_dp, (char *)&gre, sizeof(gre)); 8470 hlen += sizeof(grehdr_t); 8471 if (gre.gr_R|gre.gr_s) 8472 goto cantdecaps; 8473 if (gre.gr_C) 8474 hlen += 4; 8475 if (gre.gr_K) 8476 hlen += 4; 8477 if (gre.gr_S) 8478 hlen += 4; 8479 8480 nh = IPPROTO_IP; 8481 8482 /* 8483 * If the routing options flag is set, validate that it is 8484 * there and bounce over it. 8485 */ 8486#if 0 8487 /* This is really heavy weight and lots of room for error, */ 8488 /* so for now, put it off and get the simple stuff right. */ 8489 if (gre.gr_R) { 8490 u_char off, len, *s; 8491 u_short af; 8492 int end; 8493 8494 end = 0; 8495 s = fin->fin_dp; 8496 s += hlen; 8497 aplen = fin->fin_plen - hlen; 8498 while (aplen > 3) { 8499 af = (s[0] << 8) | s[1]; 8500 off = s[2]; 8501 len = s[3]; 8502 aplen -= 4; 8503 s += 4; 8504 if (af == 0 && len == 0) { 8505 end = 1; 8506 break; 8507 } 8508 if (aplen < len) 8509 break; 8510 s += len; 8511 aplen -= len; 8512 } 8513 if (end != 1) 8514 goto cantdecaps; 8515 hlen = s - (u_char *)fin->fin_dp; 8516 } 8517#endif 8518 break; 8519 8520#ifdef IPPROTO_IPIP 8521 case IPPROTO_IPIP : /* 4 */ 8522#endif 8523 nh = IPPROTO_IP; 8524 break; 8525 8526 default : /* Includes ESP, AH is special for IPv4 */ 8527 goto cantdecaps; 8528 } 8529 8530 switch (nh) 8531 { 8532 case IPPROTO_IP : 8533 case IPPROTO_IPV6 : 8534 break; 8535 default : 8536 goto cantdecaps; 8537 } 8538 8539 bcopy((char *)fin, (char *)&fin2, sizeof(fin2)); 8540 fino = fin; 8541 fin = &fin2; 8542 elen = hlen; 8543#if defined(MENTAT) && defined(_KERNEL) 8544 m->b_rptr += elen; 8545#else 8546 m->m_data += elen; 8547 m->m_len -= elen; 8548#endif 8549 fin->fin_plen -= elen; 8550 8551 ip = (ip_t *)((char *)fin->fin_ip + elen); 8552 8553 /* 8554 * Make sure we have at least enough data for the network layer 8555 * header. 8556 */ 8557 if (IP_V(ip) == 4) 8558 hlen = IP_HL(ip) << 2; 8559#ifdef USE_INET6 8560 else if (IP_V(ip) == 6) 8561 hlen = sizeof(ip6_t); 8562#endif 8563 else 8564 goto cantdecaps2; 8565 8566 if (fin->fin_plen < hlen) 8567 goto cantdecaps2; 8568 8569 fin->fin_dp = (char *)ip + hlen; 8570 8571 if (IP_V(ip) == 4) { 8572 /* 8573 * Perform IPv4 header checksum validation. 8574 */ 8575 if (ipf_cksum((u_short *)ip, hlen)) 8576 goto cantdecaps2; 8577 } 8578 8579 if (ipf_makefrip(hlen, ip, fin) == -1) { 8580cantdecaps2: 8581 if (m != NULL) { 8582#if defined(MENTAT) && defined(_KERNEL) 8583 m->b_rptr -= elen; 8584#else 8585 m->m_data -= elen; 8586 m->m_len += elen; 8587#endif 8588 } 8589cantdecaps: 8590 DT1(frb_decapfrip, fr_info_t *, fin); 8591 pass &= ~FR_CMDMASK; 8592 pass |= FR_BLOCK|FR_QUICK; 8593 fin->fin_reason = FRB_DECAPFRIP; 8594 return -1; 8595 } 8596 8597 pass = ipf_scanlist(fin, pass); 8598 8599 /* 8600 * Copy the packet filter "result" fields out of the fr_info_t struct 8601 * that is local to the decapsulation processing and back into the 8602 * one we were called with. 8603 */ 8604 fino->fin_flx = fin->fin_flx; 8605 fino->fin_rev = fin->fin_rev; 8606 fino->fin_icode = fin->fin_icode; 8607 fino->fin_rule = fin->fin_rule; 8608 (void) strncpy(fino->fin_group, fin->fin_group, FR_GROUPLEN); 8609 fino->fin_fr = fin->fin_fr; 8610 fino->fin_error = fin->fin_error; 8611 fino->fin_mp = fin->fin_mp; 8612 fino->fin_m = fin->fin_m; 8613 m = fin->fin_m; 8614 if (m != NULL) { 8615#if defined(MENTAT) && defined(_KERNEL) 8616 m->b_rptr -= elen; 8617#else 8618 m->m_data -= elen; 8619 m->m_len += elen; 8620#endif 8621 } 8622 return pass; 8623} 8624 8625 8626/* ------------------------------------------------------------------------ */ 8627/* Function: ipf_matcharray_load */ 8628/* Returns: int - 0 = success, else error */ 8629/* Parameters: softc(I) - pointer to soft context main structure */ 8630/* data(I) - pointer to ioctl data */ 8631/* objp(I) - ipfobj_t structure to load data into */ 8632/* arrayptr(I) - pointer to location to store array pointer */ 8633/* */ 8634/* This function loads in a mathing array through the ipfobj_t struct that */ 8635/* describes it. Sanity checking and array size limitations are enforced */ 8636/* in this function to prevent userspace from trying to load in something */ 8637/* that is insanely big. Once the size of the array is known, the memory */ 8638/* required is malloc'd and returned through changing *arrayptr. The */ 8639/* contents of the array are verified before returning. Only in the event */ 8640/* of a successful call is the caller required to free up the malloc area. */ 8641/* ------------------------------------------------------------------------ */ 8642int 8643ipf_matcharray_load(softc, data, objp, arrayptr) 8644 ipf_main_softc_t *softc; 8645 caddr_t data; 8646 ipfobj_t *objp; 8647 int **arrayptr; 8648{ 8649 int arraysize, *array, error; 8650 8651 *arrayptr = NULL; 8652 8653 error = BCOPYIN(data, objp, sizeof(*objp)); 8654 if (error != 0) { 8655 IPFERROR(116); 8656 return EFAULT; 8657 } 8658 8659 if (objp->ipfo_type != IPFOBJ_IPFEXPR) { 8660 IPFERROR(117); 8661 return EINVAL; 8662 } 8663 8664 if (((objp->ipfo_size & 3) != 0) || (objp->ipfo_size == 0) || 8665 (objp->ipfo_size > 1024)) { 8666 IPFERROR(118); 8667 return EINVAL; 8668 } 8669 8670 arraysize = objp->ipfo_size * sizeof(*array); 8671 KMALLOCS(array, int *, arraysize); 8672 if (array == NULL) { 8673 IPFERROR(119); 8674 return ENOMEM; 8675 } 8676 8677 error = COPYIN(objp->ipfo_ptr, array, arraysize); 8678 if (error != 0) { 8679 KFREES(array, arraysize); 8680 IPFERROR(120); 8681 return EFAULT; 8682 } 8683 8684 if (ipf_matcharray_verify(array, arraysize) != 0) { 8685 KFREES(array, arraysize); 8686 IPFERROR(121); 8687 return EINVAL; 8688 } 8689 8690 *arrayptr = array; 8691 return 0; 8692} 8693 8694 8695/* ------------------------------------------------------------------------ */ 8696/* Function: ipf_matcharray_verify */ 8697/* Returns: Nil */ 8698/* Parameters: array(I) - pointer to matching array */ 8699/* arraysize(I) - number of elements in the array */ 8700/* */ 8701/* Verify the contents of a matching array by stepping through each element */ 8702/* in it. The actual commands in the array are not verified for */ 8703/* correctness, only that all of the sizes are correctly within limits. */ 8704/* ------------------------------------------------------------------------ */ 8705int 8706ipf_matcharray_verify(array, arraysize) 8707 int *array, arraysize; 8708{ 8709 int i, nelem, maxidx; 8710 ipfexp_t *e; 8711 8712 nelem = arraysize / sizeof(*array); 8713 8714 /* 8715 * Currently, it makes no sense to have an array less than 6 8716 * elements long - the initial size at the from, a single operation 8717 * (minimum 4 in length) and a trailer, for a total of 6. 8718 */ 8719 if ((array[0] < 6) || (arraysize < 24) || (arraysize > 4096)) { 8720 return -1; 8721 } 8722 8723 /* 8724 * Verify the size of data pointed to by array with how long 8725 * the array claims to be itself. 8726 */ 8727 if (array[0] * sizeof(*array) != arraysize) { 8728 return -1; 8729 } 8730 8731 maxidx = nelem - 1; 8732 /* 8733 * The last opcode in this array should be an IPF_EXP_END. 8734 */ 8735 if (array[maxidx] != IPF_EXP_END) { 8736 return -1; 8737 } 8738 8739 for (i = 1; i < maxidx; ) { 8740 e = (ipfexp_t *)(array + i); 8741 8742 /* 8743 * The length of the bits to check must be at least 1 8744 * (or else there is nothing to comapre with!) and it 8745 * cannot exceed the length of the data present. 8746 */ 8747 if ((e->ipfe_size < 1 ) || 8748 (e->ipfe_size + i > maxidx)) { 8749 return -1; 8750 } 8751 i += e->ipfe_size; 8752 } 8753 return 0; 8754} 8755 8756 8757/* ------------------------------------------------------------------------ */ 8758/* Function: ipf_fr_matcharray */ 8759/* Returns: int - 0 = match failed, else positive match */ 8760/* Parameters: fin(I) - pointer to packet information */ 8761/* array(I) - pointer to matching array */ 8762/* */ 8763/* This function is used to apply a matching array against a packet and */ 8764/* return an indication of whether or not the packet successfully matches */ 8765/* all of the commands in it. */ 8766/* ------------------------------------------------------------------------ */ 8767static int 8768ipf_fr_matcharray(fin, array) 8769 fr_info_t *fin; 8770 int *array; 8771{ 8772 int i, n, *x, rv, p; 8773 ipfexp_t *e; 8774 8775 rv = 0; 8776 n = array[0]; 8777 x = array + 1; 8778 8779 for (; n > 0; x += 3 + x[3], rv = 0) { 8780 e = (ipfexp_t *)x; 8781 if (e->ipfe_cmd == IPF_EXP_END) 8782 break; 8783 n -= e->ipfe_size; 8784 8785 /* 8786 * The upper 16 bits currently store the protocol value. 8787 * This is currently used with TCP and UDP port compares and 8788 * allows "tcp.port = 80" without requiring an explicit 8789 " "ip.pr = tcp" first. 8790 */ 8791 p = e->ipfe_cmd >> 16; 8792 if ((p != 0) && (p != fin->fin_p)) 8793 break; 8794 8795 switch (e->ipfe_cmd) 8796 { 8797 case IPF_EXP_IP_PR : 8798 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8799 rv |= (fin->fin_p == e->ipfe_arg0[i]); 8800 } 8801 break; 8802 8803 case IPF_EXP_IP_SRCADDR : 8804 if (fin->fin_v != 4) 8805 break; 8806 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8807 rv |= ((fin->fin_saddr & 8808 e->ipfe_arg0[i * 2 + 1]) == 8809 e->ipfe_arg0[i * 2]); 8810 } 8811 break; 8812 8813 case IPF_EXP_IP_DSTADDR : 8814 if (fin->fin_v != 4) 8815 break; 8816 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8817 rv |= ((fin->fin_daddr & 8818 e->ipfe_arg0[i * 2 + 1]) == 8819 e->ipfe_arg0[i * 2]); 8820 } 8821 break; 8822 8823 case IPF_EXP_IP_ADDR : 8824 if (fin->fin_v != 4) 8825 break; 8826 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8827 rv |= ((fin->fin_saddr & 8828 e->ipfe_arg0[i * 2 + 1]) == 8829 e->ipfe_arg0[i * 2]) || 8830 ((fin->fin_daddr & 8831 e->ipfe_arg0[i * 2 + 1]) == 8832 e->ipfe_arg0[i * 2]); 8833 } 8834 break; 8835 8836#ifdef USE_INET6 8837 case IPF_EXP_IP6_SRCADDR : 8838 if (fin->fin_v != 6) 8839 break; 8840 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8841 rv |= IP6_MASKEQ(&fin->fin_src6, 8842 &e->ipfe_arg0[i * 8 + 4], 8843 &e->ipfe_arg0[i * 8]); 8844 } 8845 break; 8846 8847 case IPF_EXP_IP6_DSTADDR : 8848 if (fin->fin_v != 6) 8849 break; 8850 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8851 rv |= IP6_MASKEQ(&fin->fin_dst6, 8852 &e->ipfe_arg0[i * 8 + 4], 8853 &e->ipfe_arg0[i * 8]); 8854 } 8855 break; 8856 8857 case IPF_EXP_IP6_ADDR : 8858 if (fin->fin_v != 6) 8859 break; 8860 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8861 rv |= IP6_MASKEQ(&fin->fin_src6, 8862 &e->ipfe_arg0[i * 8 + 4], 8863 &e->ipfe_arg0[i * 8]) || 8864 IP6_MASKEQ(&fin->fin_dst6, 8865 &e->ipfe_arg0[i * 8 + 4], 8866 &e->ipfe_arg0[i * 8]); 8867 } 8868 break; 8869#endif 8870 8871 case IPF_EXP_UDP_PORT : 8872 case IPF_EXP_TCP_PORT : 8873 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8874 rv |= (fin->fin_sport == e->ipfe_arg0[i]) || 8875 (fin->fin_dport == e->ipfe_arg0[i]); 8876 } 8877 break; 8878 8879 case IPF_EXP_UDP_SPORT : 8880 case IPF_EXP_TCP_SPORT : 8881 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8882 rv |= (fin->fin_sport == e->ipfe_arg0[i]); 8883 } 8884 break; 8885 8886 case IPF_EXP_UDP_DPORT : 8887 case IPF_EXP_TCP_DPORT : 8888 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8889 rv |= (fin->fin_dport == e->ipfe_arg0[i]); 8890 } 8891 break; 8892 8893 case IPF_EXP_TCP_FLAGS : 8894 for (i = 0; !rv && i < e->ipfe_narg; i++) { 8895 rv |= ((fin->fin_tcpf & 8896 e->ipfe_arg0[i * 2 + 1]) == 8897 e->ipfe_arg0[i * 2]); 8898 } 8899 break; 8900 } 8901 rv ^= e->ipfe_not; 8902 8903 if (rv == 0) 8904 break; 8905 } 8906 8907 return rv; 8908} 8909 8910 8911/* ------------------------------------------------------------------------ */ 8912/* Function: ipf_queueflush */ 8913/* Returns: int - number of entries flushed (0 = none) */ 8914/* Parameters: softc(I) - pointer to soft context main structure */ 8915/* deletefn(I) - function to call to delete entry */ 8916/* ipfqs(I) - top of the list of ipf internal queues */ 8917/* userqs(I) - top of the list of user defined timeouts */ 8918/* */ 8919/* This fucntion gets called when the state/NAT hash tables fill up and we */ 8920/* need to try a bit harder to free up some space. The algorithm used here */ 8921/* split into two parts but both halves have the same goal: to reduce the */ 8922/* number of connections considered to be "active" to the low watermark. */ 8923/* There are two steps in doing this: */ 8924/* 1) Remove any TCP connections that are already considered to be "closed" */ 8925/* but have not yet been removed from the state table. The two states */ 8926/* TCPS_TIME_WAIT and TCPS_CLOSED are considered to be the perfect */ 8927/* candidates for this style of removal. If freeing up entries in */ 8928/* CLOSED or both CLOSED and TIME_WAIT brings us to the low watermark, */ 8929/* we do not go on to step 2. */ 8930/* */ 8931/* 2) Look for the oldest entries on each timeout queue and free them if */ 8932/* they are within the given window we are considering. Where the */ 8933/* window starts and the steps taken to increase its size depend upon */ 8934/* how long ipf has been running (ipf_ticks.) Anything modified in the */ 8935/* last 30 seconds is not touched. */ 8936/* touched */ 8937/* die ipf_ticks 30*1.5 1800*1.5 | 43200*1.5 */ 8938/* | | | | | | */ 8939/* future <--+----------+--------+-----------+-----+-----+-----------> past */ 8940/* now \_int=30s_/ \_int=1hr_/ \_int=12hr */ 8941/* */ 8942/* Points to note: */ 8943/* - tqe_die is the time, in the future, when entries die. */ 8944/* - tqe_die - ipf_ticks is how long left the connection has to live in ipf */ 8945/* ticks. */ 8946/* - tqe_touched is when the entry was last used by NAT/state */ 8947/* - the closer tqe_touched is to ipf_ticks, the further tqe_die will be */ 8948/* ipf_ticks any given timeout queue and vice versa. */ 8949/* - both tqe_die and tqe_touched increase over time */ 8950/* - timeout queues are sorted with the highest value of tqe_die at the */ 8951/* bottom and therefore the smallest values of each are at the top */ 8952/* - the pointer passed in as ipfqs should point to an array of timeout */ 8953/* queues representing each of the TCP states */ 8954/* */ 8955/* We start by setting up a maximum range to scan for things to move of */ 8956/* iend (newest) to istart (oldest) in chunks of "interval". If nothing is */ 8957/* found in that range, "interval" is adjusted (so long as it isn't 30) and */ 8958/* we start again with a new value for "iend" and "istart". This is */ 8959/* continued until we either finish the scan of 30 second intervals or the */ 8960/* low water mark is reached. */ 8961/* ------------------------------------------------------------------------ */ 8962int 8963ipf_queueflush(softc, deletefn, ipfqs, userqs, activep, size, low) 8964 ipf_main_softc_t *softc; 8965 ipftq_delete_fn_t deletefn; 8966 ipftq_t *ipfqs, *userqs; 8967 u_int *activep; 8968 int size, low; 8969{ 8970 u_long interval, istart, iend; 8971 ipftq_t *ifq, *ifqnext; 8972 ipftqent_t *tqe, *tqn; 8973 int removed = 0; 8974 8975 for (tqn = ipfqs[IPF_TCPS_CLOSED].ifq_head; ((tqe = tqn) != NULL); ) { 8976 tqn = tqe->tqe_next; 8977 if ((*deletefn)(softc, tqe->tqe_parent) == 0) 8978 removed++; 8979 } 8980 if ((*activep * 100 / size) > low) { 8981 for (tqn = ipfqs[IPF_TCPS_TIME_WAIT].ifq_head; 8982 ((tqe = tqn) != NULL); ) { 8983 tqn = tqe->tqe_next; 8984 if ((*deletefn)(softc, tqe->tqe_parent) == 0) 8985 removed++; 8986 } 8987 } 8988 8989 if ((*activep * 100 / size) <= low) { 8990 return removed; 8991 } 8992 8993 /* 8994 * NOTE: Use of "* 15 / 10" is required here because if "* 1.5" is 8995 * used then the operations are upgraded to floating point 8996 * and kernels don't like floating point... 8997 */ 8998 if (softc->ipf_ticks > IPF_TTLVAL(43200 * 15 / 10)) { 8999 istart = IPF_TTLVAL(86400 * 4); 9000 interval = IPF_TTLVAL(43200); 9001 } else if (softc->ipf_ticks > IPF_TTLVAL(1800 * 15 / 10)) { 9002 istart = IPF_TTLVAL(43200); 9003 interval = IPF_TTLVAL(1800); 9004 } else if (softc->ipf_ticks > IPF_TTLVAL(30 * 15 / 10)) { 9005 istart = IPF_TTLVAL(1800); 9006 interval = IPF_TTLVAL(30); 9007 } else { 9008 return 0; 9009 } 9010 if (istart > softc->ipf_ticks) { 9011 if (softc->ipf_ticks - interval < interval) 9012 istart = interval; 9013 else 9014 istart = (softc->ipf_ticks / interval) * interval; 9015 } 9016 9017 iend = softc->ipf_ticks - interval; 9018 9019 while ((*activep * 100 / size) > low) { 9020 u_long try; 9021 9022 try = softc->ipf_ticks - istart; 9023 9024 for (ifq = ipfqs; ifq != NULL; ifq = ifq->ifq_next) { 9025 for (tqn = ifq->ifq_head; ((tqe = tqn) != NULL); ) { 9026 if (try < tqe->tqe_touched) 9027 break; 9028 tqn = tqe->tqe_next; 9029 if ((*deletefn)(softc, tqe->tqe_parent) == 0) 9030 removed++; 9031 } 9032 } 9033 9034 for (ifq = userqs; ifq != NULL; ifq = ifqnext) { 9035 ifqnext = ifq->ifq_next; 9036 9037 for (tqn = ifq->ifq_head; ((tqe = tqn) != NULL); ) { 9038 if (try < tqe->tqe_touched) 9039 break; 9040 tqn = tqe->tqe_next; 9041 if ((*deletefn)(softc, tqe->tqe_parent) == 0) 9042 removed++; 9043 } 9044 } 9045 9046 if (try >= iend) { 9047 if (interval == IPF_TTLVAL(43200)) { 9048 interval = IPF_TTLVAL(1800); 9049 } else if (interval == IPF_TTLVAL(1800)) { 9050 interval = IPF_TTLVAL(30); 9051 } else { 9052 break; 9053 } 9054 if (interval >= softc->ipf_ticks) 9055 break; 9056 9057 iend = softc->ipf_ticks - interval; 9058 } 9059 istart -= interval; 9060 } 9061 9062 return removed; 9063} 9064 9065 9066/* ------------------------------------------------------------------------ */ 9067/* Function: ipf_deliverlocal */ 9068/* Returns: int - 1 = local address, 0 = non-local address */ 9069/* Parameters: softc(I) - pointer to soft context main structure */ 9070/* ipversion(I) - IP protocol version (4 or 6) */ 9071/* ifp(I) - network interface pointer */ 9072/* ipaddr(I) - IPv4/6 destination address */ 9073/* */ 9074/* This fucntion is used to determine in the address "ipaddr" belongs to */ 9075/* the network interface represented by ifp. */ 9076/* ------------------------------------------------------------------------ */ 9077int 9078ipf_deliverlocal(softc, ipversion, ifp, ipaddr) 9079 ipf_main_softc_t *softc; 9080 int ipversion; 9081 void *ifp; 9082 i6addr_t *ipaddr; 9083{ 9084 i6addr_t addr; 9085 int islocal = 0; 9086 9087 if (ipversion == 4) { 9088 if (ipf_ifpaddr(softc, 4, FRI_NORMAL, ifp, &addr, NULL) == 0) { 9089 if (addr.in4.s_addr == ipaddr->in4.s_addr) 9090 islocal = 1; 9091 } 9092 9093#ifdef USE_INET6 9094 } else if (ipversion == 6) { 9095 if (ipf_ifpaddr(softc, 6, FRI_NORMAL, ifp, &addr, NULL) == 0) { 9096 if (IP6_EQ(&addr, ipaddr)) 9097 islocal = 1; 9098 } 9099#endif 9100 } 9101 9102 return islocal; 9103} 9104 9105 9106/* ------------------------------------------------------------------------ */ 9107/* Function: ipf_settimeout */ 9108/* Returns: int - 0 = success, -1 = failure */ 9109/* Parameters: softc(I) - pointer to soft context main structure */ 9110/* t(I) - pointer to tuneable array entry */ 9111/* p(I) - pointer to values passed in to apply */ 9112/* */ 9113/* This function is called to set the timeout values for each distinct */ 9114/* queue timeout that is available. When called, it calls into both the */ 9115/* state and NAT code, telling them to update their timeout queues. */ 9116/* ------------------------------------------------------------------------ */ 9117static int 9118ipf_settimeout(softc, t, p) 9119 struct ipf_main_softc_s *softc; 9120 ipftuneable_t *t; 9121 ipftuneval_t *p; 9122{ 9123 9124 /* 9125 * ipf_interror should be set by the functions called here, not 9126 * by this function - it's just a middle man. 9127 */ 9128 if (ipf_state_settimeout(softc, t, p) == -1) 9129 return -1; 9130 if (ipf_nat_settimeout(softc, t, p) == -1) 9131 return -1; 9132 return 0; 9133} 9134 9135 9136/* ------------------------------------------------------------------------ */ 9137/* Function: ipf_apply_timeout */ 9138/* Returns: int - 0 = success, -1 = failure */ 9139/* Parameters: head(I) - pointer to tuneable array entry */ 9140/* seconds(I) - pointer to values passed in to apply */ 9141/* */ 9142/* This function applies a timeout of "seconds" to the timeout queue that */ 9143/* is pointed to by "head". All entries on this list have an expiration */ 9144/* set to be the current tick value of ipf plus the ttl. Given that this */ 9145/* function should only be called when the delta is non-zero, the task is */ 9146/* to walk the entire list and apply the change. The sort order will not */ 9147/* change. The only catch is that this is O(n) across the list, so if the */ 9148/* queue has lots of entries (10s of thousands or 100s of thousands), it */ 9149/* could take a relatively long time to work through them all. */ 9150/* ------------------------------------------------------------------------ */ 9151void 9152ipf_apply_timeout(head, seconds) 9153 ipftq_t *head; 9154 u_int seconds; 9155{ 9156 u_int oldtimeout, newtimeout; 9157 ipftqent_t *tqe; 9158 int delta; 9159 9160 MUTEX_ENTER(&head->ifq_lock); 9161 oldtimeout = head->ifq_ttl; 9162 newtimeout = IPF_TTLVAL(seconds); 9163 delta = oldtimeout - newtimeout; 9164 9165 head->ifq_ttl = newtimeout; 9166 9167 for (tqe = head->ifq_head; tqe != NULL; tqe = tqe->tqe_next) { 9168 tqe->tqe_die += delta; 9169 } 9170 MUTEX_EXIT(&head->ifq_lock); 9171} 9172 9173 9174/* ------------------------------------------------------------------------ */ 9175/* Function: ipf_settimeout_tcp */ 9176/* Returns: int - 0 = successfully applied, -1 = failed */ 9177/* Parameters: t(I) - pointer to tuneable to change */ 9178/* p(I) - pointer to new timeout information */ 9179/* tab(I) - pointer to table of TCP queues */ 9180/* */ 9181/* This function applies the new timeout (p) to the TCP tunable (t) and */ 9182/* updates all of the entries on the relevant timeout queue by calling */ 9183/* ipf_apply_timeout(). */ 9184/* ------------------------------------------------------------------------ */ 9185int 9186ipf_settimeout_tcp(t, p, tab) 9187 ipftuneable_t *t; 9188 ipftuneval_t *p; 9189 ipftq_t *tab; 9190{ 9191 if (!strcmp(t->ipft_name, "tcp_idle_timeout") || 9192 !strcmp(t->ipft_name, "tcp_established")) { 9193 ipf_apply_timeout(&tab[IPF_TCPS_ESTABLISHED], p->ipftu_int); 9194 } else if (!strcmp(t->ipft_name, "tcp_close_wait")) { 9195 ipf_apply_timeout(&tab[IPF_TCPS_CLOSE_WAIT], p->ipftu_int); 9196 } else if (!strcmp(t->ipft_name, "tcp_last_ack")) { 9197 ipf_apply_timeout(&tab[IPF_TCPS_LAST_ACK], p->ipftu_int); 9198 } else if (!strcmp(t->ipft_name, "tcp_timeout")) { 9199 ipf_apply_timeout(&tab[IPF_TCPS_LISTEN], p->ipftu_int); 9200 ipf_apply_timeout(&tab[IPF_TCPS_HALF_ESTAB], p->ipftu_int); 9201 ipf_apply_timeout(&tab[IPF_TCPS_CLOSING], p->ipftu_int); 9202 } else if (!strcmp(t->ipft_name, "tcp_listen")) { 9203 ipf_apply_timeout(&tab[IPF_TCPS_LISTEN], p->ipftu_int); 9204 } else if (!strcmp(t->ipft_name, "tcp_half_established")) { 9205 ipf_apply_timeout(&tab[IPF_TCPS_HALF_ESTAB], p->ipftu_int); 9206 } else if (!strcmp(t->ipft_name, "tcp_closing")) { 9207 ipf_apply_timeout(&tab[IPF_TCPS_CLOSING], p->ipftu_int); 9208 } else if (!strcmp(t->ipft_name, "tcp_syn_received")) { 9209 ipf_apply_timeout(&tab[IPF_TCPS_SYN_RECEIVED], p->ipftu_int); 9210 } else if (!strcmp(t->ipft_name, "tcp_syn_sent")) { 9211 ipf_apply_timeout(&tab[IPF_TCPS_SYN_SENT], p->ipftu_int); 9212 } else if (!strcmp(t->ipft_name, "tcp_closed")) { 9213 ipf_apply_timeout(&tab[IPF_TCPS_CLOSED], p->ipftu_int); 9214 } else if (!strcmp(t->ipft_name, "tcp_half_closed")) { 9215 ipf_apply_timeout(&tab[IPF_TCPS_CLOSED], p->ipftu_int); 9216 } else if (!strcmp(t->ipft_name, "tcp_time_wait")) { 9217 ipf_apply_timeout(&tab[IPF_TCPS_TIME_WAIT], p->ipftu_int); 9218 } else { 9219 /* 9220 * ipf_interror isn't set here because it should be set 9221 * by whatever called this function. 9222 */ 9223 return -1; 9224 } 9225 return 0; 9226} 9227 9228 9229/* ------------------------------------------------------------------------ */ 9230/* Function: ipf_main_soft_create */ 9231/* Returns: NULL = failure, else success */ 9232/* Parameters: arg(I) - pointer to soft context structure if already allocd */ 9233/* */ 9234/* Create the foundation soft context structure. In circumstances where it */ 9235/* is not required to dynamically allocate the context, a pointer can be */ 9236/* passed in (rather than NULL) to a structure to be initialised. */ 9237/* The main thing of interest is that a number of locks are initialised */ 9238/* here instead of in the where might be expected - in the relevant create */ 9239/* function elsewhere. This is done because the current locking design has */ 9240/* some areas where these locks are used outside of their module. */ 9241/* Possibly the most important exercise that is done here is setting of all */ 9242/* the timeout values, allowing them to be changed before init(). */ 9243/* ------------------------------------------------------------------------ */ 9244void * 9245ipf_main_soft_create(arg) 9246 void *arg; 9247{ 9248 ipf_main_softc_t *softc; 9249 9250 if (arg == NULL) { 9251 KMALLOC(softc, ipf_main_softc_t *); 9252 if (softc == NULL) 9253 return NULL; 9254 } else { 9255 softc = arg; 9256 } 9257 9258 bzero((char *)softc, sizeof(*softc)); 9259 9260 /* 9261 * This serves as a flag as to whether or not the softc should be 9262 * free'd when _destroy is called. 9263 */ 9264 softc->ipf_dynamic_softc = (arg == NULL) ? 1 : 0; 9265 9266 softc->ipf_tuners = ipf_tune_array_copy(softc, 9267 sizeof(ipf_main_tuneables), 9268 ipf_main_tuneables); 9269 if (softc->ipf_tuners == NULL) { 9270 ipf_main_soft_destroy(softc); 9271 return NULL; 9272 } 9273 9274 MUTEX_INIT(&softc->ipf_rw, "ipf rw mutex"); 9275 MUTEX_INIT(&softc->ipf_timeoutlock, "ipf timeout lock"); 9276 RWLOCK_INIT(&softc->ipf_global, "ipf filter load/unload mutex"); 9277 RWLOCK_INIT(&softc->ipf_mutex, "ipf filter rwlock"); 9278 RWLOCK_INIT(&softc->ipf_tokens, "ipf token rwlock"); 9279 RWLOCK_INIT(&softc->ipf_state, "ipf state rwlock"); 9280 RWLOCK_INIT(&softc->ipf_nat, "ipf IP NAT rwlock"); 9281 RWLOCK_INIT(&softc->ipf_poolrw, "ipf pool rwlock"); 9282 RWLOCK_INIT(&softc->ipf_frag, "ipf frag rwlock"); 9283 9284 softc->ipf_token_head = NULL; 9285 softc->ipf_token_tail = &softc->ipf_token_head; 9286 9287 softc->ipf_tcpidletimeout = FIVE_DAYS; 9288 softc->ipf_tcpclosewait = IPF_TTLVAL(2 * TCP_MSL); 9289 softc->ipf_tcplastack = IPF_TTLVAL(30); 9290 softc->ipf_tcptimewait = IPF_TTLVAL(2 * TCP_MSL); 9291 softc->ipf_tcptimeout = IPF_TTLVAL(2 * TCP_MSL); 9292 softc->ipf_tcpsynsent = IPF_TTLVAL(2 * TCP_MSL); 9293 softc->ipf_tcpsynrecv = IPF_TTLVAL(2 * TCP_MSL); 9294 softc->ipf_tcpclosed = IPF_TTLVAL(30); 9295 softc->ipf_tcphalfclosed = IPF_TTLVAL(2 * 3600); 9296 softc->ipf_udptimeout = IPF_TTLVAL(120); 9297 softc->ipf_udpacktimeout = IPF_TTLVAL(12); 9298 softc->ipf_icmptimeout = IPF_TTLVAL(60); 9299 softc->ipf_icmpacktimeout = IPF_TTLVAL(6); 9300 softc->ipf_iptimeout = IPF_TTLVAL(60); 9301 9302#if defined(IPFILTER_DEFAULT_BLOCK) 9303 softc->ipf_pass = FR_BLOCK|FR_NOMATCH; 9304#else 9305 softc->ipf_pass = (IPF_DEFAULT_PASS)|FR_NOMATCH; 9306#endif 9307 softc->ipf_minttl = 4; 9308 softc->ipf_icmpminfragmtu = 68; 9309 softc->ipf_flags = IPF_LOGGING; 9310 9311 return softc; 9312} 9313 9314/* ------------------------------------------------------------------------ */ 9315/* Function: ipf_main_soft_init */ 9316/* Returns: 0 = success, -1 = failure */ 9317/* Parameters: softc(I) - pointer to soft context main structure */ 9318/* */ 9319/* A null-op function that exists as a placeholder so that the flow in */ 9320/* other functions is obvious. */ 9321/* ------------------------------------------------------------------------ */ 9322/*ARGSUSED*/ 9323int 9324ipf_main_soft_init(softc) 9325 ipf_main_softc_t *softc; 9326{ 9327 return 0; 9328} 9329 9330 9331/* ------------------------------------------------------------------------ */ 9332/* Function: ipf_main_soft_destroy */ 9333/* Returns: void */ 9334/* Parameters: softc(I) - pointer to soft context main structure */ 9335/* */ 9336/* Undo everything that we did in ipf_main_soft_create. */ 9337/* */ 9338/* The most important check that needs to be made here is whether or not */ 9339/* the structure was allocated by ipf_main_soft_create() by checking what */ 9340/* value is stored in ipf_dynamic_main. */ 9341/* ------------------------------------------------------------------------ */ 9342/*ARGSUSED*/ 9343void 9344ipf_main_soft_destroy(softc) 9345 ipf_main_softc_t *softc; 9346{ 9347 9348 RW_DESTROY(&softc->ipf_frag); 9349 RW_DESTROY(&softc->ipf_poolrw); 9350 RW_DESTROY(&softc->ipf_nat); 9351 RW_DESTROY(&softc->ipf_state); 9352 RW_DESTROY(&softc->ipf_tokens); 9353 RW_DESTROY(&softc->ipf_mutex); 9354 RW_DESTROY(&softc->ipf_global); 9355 MUTEX_DESTROY(&softc->ipf_timeoutlock); 9356 MUTEX_DESTROY(&softc->ipf_rw); 9357 9358 if (softc->ipf_tuners != NULL) { 9359 KFREES(softc->ipf_tuners, sizeof(ipf_main_tuneables)); 9360 } 9361 if (softc->ipf_dynamic_softc == 1) { 9362 KFREE(softc); 9363 } 9364} 9365 9366 9367/* ------------------------------------------------------------------------ */ 9368/* Function: ipf_main_soft_fini */ 9369/* Returns: 0 = success, -1 = failure */ 9370/* Parameters: softc(I) - pointer to soft context main structure */ 9371/* */ 9372/* Clean out the rules which have been added since _init was last called, */ 9373/* the only dynamic part of the mainline. */ 9374/* ------------------------------------------------------------------------ */ 9375int 9376ipf_main_soft_fini(softc) 9377 ipf_main_softc_t *softc; 9378{ 9379 (void) ipf_flush(softc, IPL_LOGIPF, FR_INQUE|FR_OUTQUE|FR_INACTIVE); 9380 (void) ipf_flush(softc, IPL_LOGIPF, FR_INQUE|FR_OUTQUE); 9381 (void) ipf_flush(softc, IPL_LOGCOUNT, FR_INQUE|FR_OUTQUE|FR_INACTIVE); 9382 (void) ipf_flush(softc, IPL_LOGCOUNT, FR_INQUE|FR_OUTQUE); 9383 9384 return 0; 9385} 9386 9387 9388/* ------------------------------------------------------------------------ */ 9389/* Function: ipf_main_load */ 9390/* Returns: 0 = success, -1 = failure */ 9391/* Parameters: none */ 9392/* */ 9393/* Handle global initialisation that needs to be done for the base part of */ 9394/* IPFilter. At present this just amounts to initialising some ICMP lookup */ 9395/* arrays that get used by the state/NAT code. */ 9396/* ------------------------------------------------------------------------ */ 9397int 9398ipf_main_load() 9399{ 9400 int i; 9401 9402 /* fill icmp reply type table */ 9403 for (i = 0; i <= ICMP_MAXTYPE; i++) 9404 icmpreplytype4[i] = -1; 9405 icmpreplytype4[ICMP_ECHO] = ICMP_ECHOREPLY; 9406 icmpreplytype4[ICMP_TSTAMP] = ICMP_TSTAMPREPLY; 9407 icmpreplytype4[ICMP_IREQ] = ICMP_IREQREPLY; 9408 icmpreplytype4[ICMP_MASKREQ] = ICMP_MASKREPLY; 9409 9410#ifdef USE_INET6 9411 /* fill icmp reply type table */ 9412 for (i = 0; i <= ICMP6_MAXTYPE; i++) 9413 icmpreplytype6[i] = -1; 9414 icmpreplytype6[ICMP6_ECHO_REQUEST] = ICMP6_ECHO_REPLY; 9415 icmpreplytype6[ICMP6_MEMBERSHIP_QUERY] = ICMP6_MEMBERSHIP_REPORT; 9416 icmpreplytype6[ICMP6_NI_QUERY] = ICMP6_NI_REPLY; 9417 icmpreplytype6[ND_ROUTER_SOLICIT] = ND_ROUTER_ADVERT; 9418 icmpreplytype6[ND_NEIGHBOR_SOLICIT] = ND_NEIGHBOR_ADVERT; 9419#endif 9420 9421 return 0; 9422} 9423 9424 9425/* ------------------------------------------------------------------------ */ 9426/* Function: ipf_main_unload */ 9427/* Returns: 0 = success, -1 = failure */ 9428/* Parameters: none */ 9429/* */ 9430/* A null-op function that exists as a placeholder so that the flow in */ 9431/* other functions is obvious. */ 9432/* ------------------------------------------------------------------------ */ 9433int 9434ipf_main_unload() 9435{ 9436 return 0; 9437} 9438 9439 9440/* ------------------------------------------------------------------------ */ 9441/* Function: ipf_load_all */ 9442/* Returns: 0 = success, -1 = failure */ 9443/* Parameters: none */ 9444/* */ 9445/* Work through all of the subsystems inside IPFilter and call the load */ 9446/* function for each in an order that won't lead to a crash :) */ 9447/* ------------------------------------------------------------------------ */ 9448int 9449ipf_load_all() 9450{ 9451 if (ipf_main_load() == -1) 9452 return -1; 9453 9454 if (ipf_state_main_load() == -1) 9455 return -1; 9456 9457 if (ipf_nat_main_load() == -1) 9458 return -1; 9459 9460 if (ipf_frag_main_load() == -1) 9461 return -1; 9462 9463 if (ipf_auth_main_load() == -1) 9464 return -1; 9465 9466 if (ipf_proxy_main_load() == -1) 9467 return -1; 9468 9469 return 0; 9470} 9471 9472 9473/* ------------------------------------------------------------------------ */ 9474/* Function: ipf_unload_all */ 9475/* Returns: 0 = success, -1 = failure */ 9476/* Parameters: none */ 9477/* */ 9478/* Work through all of the subsystems inside IPFilter and call the unload */ 9479/* function for each in an order that won't lead to a crash :) */ 9480/* ------------------------------------------------------------------------ */ 9481int 9482ipf_unload_all() 9483{ 9484 if (ipf_proxy_main_unload() == -1) 9485 return -1; 9486 9487 if (ipf_auth_main_unload() == -1) 9488 return -1; 9489 9490 if (ipf_frag_main_unload() == -1) 9491 return -1; 9492 9493 if (ipf_nat_main_unload() == -1) 9494 return -1; 9495 9496 if (ipf_state_main_unload() == -1) 9497 return -1; 9498 9499 if (ipf_main_unload() == -1) 9500 return -1; 9501 9502 return 0; 9503} 9504 9505 9506/* ------------------------------------------------------------------------ */ 9507/* Function: ipf_create_all */ 9508/* Returns: NULL = failure, else success */ 9509/* Parameters: arg(I) - pointer to soft context main structure */ 9510/* */ 9511/* Work through all of the subsystems inside IPFilter and call the create */ 9512/* function for each in an order that won't lead to a crash :) */ 9513/* ------------------------------------------------------------------------ */ 9514ipf_main_softc_t * 9515ipf_create_all(arg) 9516 void *arg; 9517{ 9518 ipf_main_softc_t *softc; 9519 9520 softc = ipf_main_soft_create(arg); 9521 if (softc == NULL) 9522 return NULL; 9523 9524#ifdef IPFILTER_LOG 9525 softc->ipf_log_soft = ipf_log_soft_create(softc); 9526 if (softc->ipf_log_soft == NULL) { 9527 ipf_destroy_all(softc); 9528 return NULL; 9529 } 9530#endif 9531 9532 softc->ipf_lookup_soft = ipf_lookup_soft_create(softc); 9533 if (softc->ipf_lookup_soft == NULL) { 9534 ipf_destroy_all(softc); 9535 return NULL; 9536 } 9537 9538 softc->ipf_sync_soft = ipf_sync_soft_create(softc); 9539 if (softc->ipf_sync_soft == NULL) { 9540 ipf_destroy_all(softc); 9541 return NULL; 9542 } 9543 9544 softc->ipf_state_soft = ipf_state_soft_create(softc); 9545 if (softc->ipf_state_soft == NULL) { 9546 ipf_destroy_all(softc); 9547 return NULL; 9548 } 9549 9550 softc->ipf_nat_soft = ipf_nat_soft_create(softc); 9551 if (softc->ipf_nat_soft == NULL) { 9552 ipf_destroy_all(softc); 9553 return NULL; 9554 } 9555 9556 softc->ipf_frag_soft = ipf_frag_soft_create(softc); 9557 if (softc->ipf_frag_soft == NULL) { 9558 ipf_destroy_all(softc); 9559 return NULL; 9560 } 9561 9562 softc->ipf_auth_soft = ipf_auth_soft_create(softc); 9563 if (softc->ipf_auth_soft == NULL) { 9564 ipf_destroy_all(softc); 9565 return NULL; 9566 } 9567 9568 softc->ipf_proxy_soft = ipf_proxy_soft_create(softc); 9569 if (softc->ipf_proxy_soft == NULL) { 9570 ipf_destroy_all(softc); 9571 return NULL; 9572 } 9573 9574 return softc; 9575} 9576 9577 9578/* ------------------------------------------------------------------------ */ 9579/* Function: ipf_destroy_all */ 9580/* Returns: void */ 9581/* Parameters: softc(I) - pointer to soft context main structure */ 9582/* */ 9583/* Work through all of the subsystems inside IPFilter and call the destroy */ 9584/* function for each in an order that won't lead to a crash :) */ 9585/* */ 9586/* Every one of these functions is expected to succeed, so there is no */ 9587/* checking of return values. */ 9588/* ------------------------------------------------------------------------ */ 9589void 9590ipf_destroy_all(softc) 9591 ipf_main_softc_t *softc; 9592{ 9593 9594 if (softc->ipf_state_soft != NULL) { 9595 ipf_state_soft_destroy(softc, softc->ipf_state_soft); 9596 softc->ipf_state_soft = NULL; 9597 } 9598 9599 if (softc->ipf_nat_soft != NULL) { 9600 ipf_nat_soft_destroy(softc, softc->ipf_nat_soft); 9601 softc->ipf_nat_soft = NULL; 9602 } 9603 9604 if (softc->ipf_frag_soft != NULL) { 9605 ipf_frag_soft_destroy(softc, softc->ipf_frag_soft); 9606 softc->ipf_frag_soft = NULL; 9607 } 9608 9609 if (softc->ipf_auth_soft != NULL) { 9610 ipf_auth_soft_destroy(softc, softc->ipf_auth_soft); 9611 softc->ipf_auth_soft = NULL; 9612 } 9613 9614 if (softc->ipf_proxy_soft != NULL) { 9615 ipf_proxy_soft_destroy(softc, softc->ipf_proxy_soft); 9616 softc->ipf_proxy_soft = NULL; 9617 } 9618 9619 if (softc->ipf_sync_soft != NULL) { 9620 ipf_sync_soft_destroy(softc, softc->ipf_sync_soft); 9621 softc->ipf_sync_soft = NULL; 9622 } 9623 9624 if (softc->ipf_lookup_soft != NULL) { 9625 ipf_lookup_soft_destroy(softc, softc->ipf_lookup_soft); 9626 softc->ipf_lookup_soft = NULL; 9627 } 9628 9629#ifdef IPFILTER_LOG 9630 if (softc->ipf_log_soft != NULL) { 9631 ipf_log_soft_destroy(softc, softc->ipf_log_soft); 9632 softc->ipf_log_soft = NULL; 9633 } 9634#endif 9635 9636 ipf_main_soft_destroy(softc); 9637} 9638 9639 9640/* ------------------------------------------------------------------------ */ 9641/* Function: ipf_init_all */ 9642/* Returns: 0 = success, -1 = failure */ 9643/* Parameters: softc(I) - pointer to soft context main structure */ 9644/* */ 9645/* Work through all of the subsystems inside IPFilter and call the init */ 9646/* function for each in an order that won't lead to a crash :) */ 9647/* ------------------------------------------------------------------------ */ 9648int 9649ipf_init_all(softc) 9650 ipf_main_softc_t *softc; 9651{ 9652 9653 if (ipf_main_soft_init(softc) == -1) 9654 return -1; 9655 9656#ifdef IPFILTER_LOG 9657 if (ipf_log_soft_init(softc, softc->ipf_log_soft) == -1) 9658 return -1; 9659#endif 9660 9661 if (ipf_lookup_soft_init(softc, softc->ipf_lookup_soft) == -1) 9662 return -1; 9663 9664 if (ipf_sync_soft_init(softc, softc->ipf_sync_soft) == -1) 9665 return -1; 9666 9667 if (ipf_state_soft_init(softc, softc->ipf_state_soft) == -1) 9668 return -1; 9669 9670 if (ipf_nat_soft_init(softc, softc->ipf_nat_soft) == -1) 9671 return -1; 9672 9673 if (ipf_frag_soft_init(softc, softc->ipf_frag_soft) == -1) 9674 return -1; 9675 9676 if (ipf_auth_soft_init(softc, softc->ipf_auth_soft) == -1) 9677 return -1; 9678 9679 if (ipf_proxy_soft_init(softc, softc->ipf_proxy_soft) == -1) 9680 return -1; 9681 9682 return 0; 9683} 9684 9685 9686/* ------------------------------------------------------------------------ */ 9687/* Function: ipf_fini_all */ 9688/* Returns: 0 = success, -1 = failure */ 9689/* Parameters: softc(I) - pointer to soft context main structure */ 9690/* */ 9691/* Work through all of the subsystems inside IPFilter and call the fini */ 9692/* function for each in an order that won't lead to a crash :) */ 9693/* ------------------------------------------------------------------------ */ 9694int 9695ipf_fini_all(softc) 9696 ipf_main_softc_t *softc; 9697{ 9698 9699 ipf_token_flush(softc); 9700 9701 if (ipf_proxy_soft_fini(softc, softc->ipf_proxy_soft) == -1) 9702 return -1; 9703 9704 if (ipf_auth_soft_fini(softc, softc->ipf_auth_soft) == -1) 9705 return -1; 9706 9707 if (ipf_frag_soft_fini(softc, softc->ipf_frag_soft) == -1) 9708 return -1; 9709 9710 if (ipf_nat_soft_fini(softc, softc->ipf_nat_soft) == -1) 9711 return -1; 9712 9713 if (ipf_state_soft_fini(softc, softc->ipf_state_soft) == -1) 9714 return -1; 9715 9716 if (ipf_sync_soft_fini(softc, softc->ipf_sync_soft) == -1) 9717 return -1; 9718 9719 if (ipf_lookup_soft_fini(softc, softc->ipf_lookup_soft) == -1) 9720 return -1; 9721 9722#ifdef IPFILTER_LOG 9723 if (ipf_log_soft_fini(softc, softc->ipf_log_soft) == -1) 9724 return -1; 9725#endif 9726 9727 if (ipf_main_soft_fini(softc) == -1) 9728 return -1; 9729 9730 return 0; 9731} 9732 9733 9734/* ------------------------------------------------------------------------ */ 9735/* Function: ipf_rule_expire */ 9736/* Returns: Nil */ 9737/* Parameters: softc(I) - pointer to soft context main structure */ 9738/* */ 9739/* At present this function exists just to support temporary addition of */ 9740/* firewall rules. Both inactive and active lists are scanned for items to */ 9741/* purge, as by rights, the expiration is computed as soon as the rule is */ 9742/* loaded in. */ 9743/* ------------------------------------------------------------------------ */ 9744void 9745ipf_rule_expire(softc) 9746 ipf_main_softc_t *softc; 9747{ 9748 frentry_t *fr; 9749 9750 if ((softc->ipf_rule_explist[0] == NULL) && 9751 (softc->ipf_rule_explist[1] == NULL)) 9752 return; 9753 9754 WRITE_ENTER(&softc->ipf_mutex); 9755 9756 while ((fr = softc->ipf_rule_explist[0]) != NULL) { 9757 /* 9758 * Because the list is kept sorted on insertion, the fist 9759 * one that dies in the future means no more work to do. 9760 */ 9761 if (fr->fr_die > softc->ipf_ticks) 9762 break; 9763 ipf_rule_delete(softc, fr, IPL_LOGIPF, 0); 9764 } 9765 9766 while ((fr = softc->ipf_rule_explist[1]) != NULL) { 9767 /* 9768 * Because the list is kept sorted on insertion, the fist 9769 * one that dies in the future means no more work to do. 9770 */ 9771 if (fr->fr_die > softc->ipf_ticks) 9772 break; 9773 ipf_rule_delete(softc, fr, IPL_LOGIPF, 1); 9774 } 9775 9776 RWLOCK_EXIT(&softc->ipf_mutex); 9777} 9778 9779 9780static int ipf_ht_node_cmp __P((struct host_node_s *, struct host_node_s *)); 9781static void ipf_ht_node_make_key __P((host_track_t *, host_node_t *, int, 9782 i6addr_t *)); 9783 9784host_node_t RBI_ZERO(ipf_rb); 9785RBI_CODE(ipf_rb, host_node_t, hn_entry, ipf_ht_node_cmp) 9786 9787 9788/* ------------------------------------------------------------------------ */ 9789/* Function: ipf_ht_node_cmp */ 9790/* Returns: int - 0 == nodes are the same, .. */ 9791/* Parameters: k1(I) - pointer to first key to compare */ 9792/* k2(I) - pointer to second key to compare */ 9793/* */ 9794/* The "key" for the node is a combination of two fields: the address */ 9795/* family and the address itself. */ 9796/* */ 9797/* Because we're not actually interpreting the address data, it isn't */ 9798/* necessary to convert them to/from network/host byte order. The mask is */ 9799/* just used to remove bits that aren't significant - it doesn't matter */ 9800/* where they are, as long as they're always in the same place. */ 9801/* */ 9802/* As with IP6_EQ, comparing IPv6 addresses starts at the bottom because */ 9803/* this is where individual ones will differ the most - but not true for */ 9804/* for /48's, etc. */ 9805/* ------------------------------------------------------------------------ */ 9806static int 9807ipf_ht_node_cmp(k1, k2) 9808 struct host_node_s *k1, *k2; 9809{ 9810 int i; 9811 9812 i = (k2->hn_addr.adf_family - k1->hn_addr.adf_family); 9813 if (i != 0) 9814 return i; 9815 9816 if (k1->hn_addr.adf_family == AF_INET) 9817 return (k2->hn_addr.adf_addr.in4.s_addr - 9818 k1->hn_addr.adf_addr.in4.s_addr); 9819 9820 i = k2->hn_addr.adf_addr.i6[3] - k1->hn_addr.adf_addr.i6[3]; 9821 if (i != 0) 9822 return i; 9823 i = k2->hn_addr.adf_addr.i6[2] - k1->hn_addr.adf_addr.i6[2]; 9824 if (i != 0) 9825 return i; 9826 i = k2->hn_addr.adf_addr.i6[1] - k1->hn_addr.adf_addr.i6[1]; 9827 if (i != 0) 9828 return i; 9829 i = k2->hn_addr.adf_addr.i6[0] - k1->hn_addr.adf_addr.i6[0]; 9830 return i; 9831} 9832 9833 9834/* ------------------------------------------------------------------------ */ 9835/* Function: ipf_ht_node_make_key */ 9836/* Returns: Nil */ 9837/* parameters: htp(I) - pointer to address tracking structure */ 9838/* key(I) - where to store masked address for lookup */ 9839/* family(I) - protocol family of address */ 9840/* addr(I) - pointer to network address */ 9841/* */ 9842/* Using the "netmask" (number of bits) stored parent host tracking struct, */ 9843/* copy the address passed in into the key structure whilst masking out the */ 9844/* bits that we don't want. */ 9845/* */ 9846/* Because the parser will set ht_netmask to 128 if there is no protocol */ 9847/* specified (the parser doesn't know if it should be a v4 or v6 rule), we */ 9848/* have to be wary of that and not allow 32-128 to happen. */ 9849/* ------------------------------------------------------------------------ */ 9850static void 9851ipf_ht_node_make_key(htp, key, family, addr) 9852 host_track_t *htp; 9853 host_node_t *key; 9854 int family; 9855 i6addr_t *addr; 9856{ 9857 key->hn_addr.adf_family = family; 9858 if (family == AF_INET) { 9859 u_32_t mask; 9860 int bits; 9861 9862 key->hn_addr.adf_len = sizeof(key->hn_addr.adf_addr.in4); 9863 bits = htp->ht_netmask; 9864 if (bits >= 32) { 9865 mask = 0xffffffff; 9866 } else { 9867 mask = htonl(0xffffffff << (32 - bits)); 9868 } 9869 key->hn_addr.adf_addr.in4.s_addr = addr->in4.s_addr & mask; 9870#ifdef USE_INET6 9871 } else { 9872 int bits = htp->ht_netmask; 9873 9874 key->hn_addr.adf_len = sizeof(key->hn_addr.adf_addr.in6); 9875 if (bits > 96) { 9876 key->hn_addr.adf_addr.i6[3] = addr->i6[3] & 9877 htonl(0xffffffff << (128 - bits)); 9878 key->hn_addr.adf_addr.i6[2] = addr->i6[2]; 9879 key->hn_addr.adf_addr.i6[1] = addr->i6[2]; 9880 key->hn_addr.adf_addr.i6[0] = addr->i6[2]; 9881 } else if (bits > 64) { 9882 key->hn_addr.adf_addr.i6[3] = 0; 9883 key->hn_addr.adf_addr.i6[2] = addr->i6[2] & 9884 htonl(0xffffffff << (96 - bits)); 9885 key->hn_addr.adf_addr.i6[1] = addr->i6[1]; 9886 key->hn_addr.adf_addr.i6[0] = addr->i6[0]; 9887 } else if (bits > 32) { 9888 key->hn_addr.adf_addr.i6[3] = 0; 9889 key->hn_addr.adf_addr.i6[2] = 0; 9890 key->hn_addr.adf_addr.i6[1] = addr->i6[1] & 9891 htonl(0xffffffff << (64 - bits)); 9892 key->hn_addr.adf_addr.i6[0] = addr->i6[0]; 9893 } else { 9894 key->hn_addr.adf_addr.i6[3] = 0; 9895 key->hn_addr.adf_addr.i6[2] = 0; 9896 key->hn_addr.adf_addr.i6[1] = 0; 9897 key->hn_addr.adf_addr.i6[0] = addr->i6[0] & 9898 htonl(0xffffffff << (32 - bits)); 9899 } 9900#endif 9901 } 9902} 9903 9904 9905/* ------------------------------------------------------------------------ */ 9906/* Function: ipf_ht_node_add */ 9907/* Returns: int - 0 == success, -1 == failure */ 9908/* Parameters: softc(I) - pointer to soft context main structure */ 9909/* htp(I) - pointer to address tracking structure */ 9910/* family(I) - protocol family of address */ 9911/* addr(I) - pointer to network address */ 9912/* */ 9913/* NOTE: THIS FUNCTION MUST BE CALLED WITH AN EXCLUSIVE LOCK THAT PREVENTS */ 9914/* ipf_ht_node_del FROM RUNNING CONCURRENTLY ON THE SAME htp. */ 9915/* */ 9916/* After preparing the key with the address information to find, look in */ 9917/* the red-black tree to see if the address is known. A successful call to */ 9918/* this function can mean one of two things: a new node was added to the */ 9919/* tree or a matching node exists and we're able to bump up its activity. */ 9920/* ------------------------------------------------------------------------ */ 9921int 9922ipf_ht_node_add(softc, htp, family, addr) 9923 ipf_main_softc_t *softc; 9924 host_track_t *htp; 9925 int family; 9926 i6addr_t *addr; 9927{ 9928 host_node_t *h; 9929 host_node_t k; 9930 9931 ipf_ht_node_make_key(htp, &k, family, addr); 9932 9933 h = RBI_SEARCH(ipf_rb, &htp->ht_root, &k); 9934 if (h == NULL) { 9935 if (htp->ht_cur_nodes >= htp->ht_max_nodes) 9936 return -1; 9937 KMALLOC(h, host_node_t *); 9938 if (h == NULL) { 9939 DT(ipf_rb_no_mem); 9940 LBUMP(ipf_rb_no_mem); 9941 return -1; 9942 } 9943 9944 /* 9945 * If there was a macro to initialise the RB node then that 9946 * would get used here, but there isn't... 9947 */ 9948 bzero((char *)h, sizeof(*h)); 9949 h->hn_addr = k.hn_addr; 9950 h->hn_addr.adf_family = k.hn_addr.adf_family; 9951 RBI_INSERT(ipf_rb, &htp->ht_root, h); 9952 htp->ht_cur_nodes++; 9953 } else { 9954 if ((htp->ht_max_per_node != 0) && 9955 (h->hn_active >= htp->ht_max_per_node)) { 9956 DT(ipf_rb_node_max); 9957 LBUMP(ipf_rb_node_max); 9958 return -1; 9959 } 9960 } 9961 9962 h->hn_active++; 9963 9964 return 0; 9965} 9966 9967 9968/* ------------------------------------------------------------------------ */ 9969/* Function: ipf_ht_node_del */ 9970/* Returns: int - 0 == success, -1 == failure */ 9971/* parameters: htp(I) - pointer to address tracking structure */ 9972/* family(I) - protocol family of address */ 9973/* addr(I) - pointer to network address */ 9974/* */ 9975/* NOTE: THIS FUNCTION MUST BE CALLED WITH AN EXCLUSIVE LOCK THAT PREVENTS */ 9976/* ipf_ht_node_add FROM RUNNING CONCURRENTLY ON THE SAME htp. */ 9977/* */ 9978/* Try and find the address passed in amongst the leavese on this tree to */ 9979/* be friend. If found then drop the active account for that node drops by */ 9980/* one. If that count reaches 0, it is time to free it all up. */ 9981/* ------------------------------------------------------------------------ */ 9982int 9983ipf_ht_node_del(htp, family, addr) 9984 host_track_t *htp; 9985 int family; 9986 i6addr_t *addr; 9987{ 9988 host_node_t *h; 9989 host_node_t k; 9990 9991 ipf_ht_node_make_key(htp, &k, family, addr); 9992 9993 h = RBI_SEARCH(ipf_rb, &htp->ht_root, &k); 9994 if (h == NULL) { 9995 return -1; 9996 } else { 9997 h->hn_active--; 9998 if (h->hn_active == 0) { 9999 (void) RBI_DELETE(ipf_rb, &htp->ht_root, h); 10000 htp->ht_cur_nodes--; 10001 KFREE(h); 10002 } 10003 } 10004 10005 return 0; 10006} 10007 10008 10009/* ------------------------------------------------------------------------ */ 10010/* Function: ipf_rb_ht_init */ 10011/* Returns: Nil */ 10012/* Parameters: head(I) - pointer to host tracking structure */ 10013/* */ 10014/* Initialise the host tracking structure to be ready for use above. */ 10015/* ------------------------------------------------------------------------ */ 10016void 10017ipf_rb_ht_init(head) 10018 host_track_t *head; 10019{ 10020 RBI_INIT(ipf_rb, &head->ht_root); 10021} 10022 10023 10024/* ------------------------------------------------------------------------ */ 10025/* Function: ipf_rb_ht_freenode */ 10026/* Returns: Nil */ 10027/* Parameters: head(I) - pointer to host tracking structure */ 10028/* arg(I) - additional argument from walk caller */ 10029/* */ 10030/* Free an actual host_node_t structure. */ 10031/* ------------------------------------------------------------------------ */ 10032void 10033ipf_rb_ht_freenode(node, arg) 10034 host_node_t *node; 10035 void *arg; 10036{ 10037 KFREE(node); 10038} 10039 10040 10041/* ------------------------------------------------------------------------ */ 10042/* Function: ipf_rb_ht_flush */ 10043/* Returns: Nil */ 10044/* Parameters: head(I) - pointer to host tracking structure */ 10045/* */ 10046/* Remove all of the nodes in the tree tracking hosts by calling a walker */ 10047/* and free'ing each one. */ 10048/* ------------------------------------------------------------------------ */ 10049void 10050ipf_rb_ht_flush(head) 10051 host_track_t *head; 10052{ 10053 RBI_WALK(ipf_rb, &head->ht_root, ipf_rb_ht_freenode, NULL); 10054} 10055 10056 10057/* ------------------------------------------------------------------------ */ 10058/* Function: ipf_slowtimer */ 10059/* Returns: Nil */ 10060/* Parameters: ptr(I) - pointer to main ipf soft context structure */ 10061/* */ 10062/* Slowly expire held state for fragments. Timeouts are set * in */ 10063/* expectation of this being called twice per second. */ 10064/* ------------------------------------------------------------------------ */ 10065void 10066ipf_slowtimer(softc) 10067 ipf_main_softc_t *softc; 10068{ 10069 10070 ipf_token_expire(softc); 10071 ipf_frag_expire(softc); 10072 ipf_state_expire(softc); 10073 ipf_nat_expire(softc); 10074 ipf_auth_expire(softc); 10075 ipf_lookup_expire(softc); 10076 ipf_rule_expire(softc); 10077 ipf_sync_expire(softc); 10078 softc->ipf_ticks++; 10079# if defined(__OpenBSD__) 10080 timeout_add(&ipf_slowtimer_ch, hz/2); 10081# endif 10082} 10083 10084 10085/* ------------------------------------------------------------------------ */ 10086/* Function: ipf_inet_mask_add */ 10087/* Returns: Nil */ 10088/* Parameters: bits(I) - pointer to nat context information */ 10089/* mtab(I) - pointer to mask hash table structure */ 10090/* */ 10091/* When called, bits represents the mask of a new NAT rule that has just */ 10092/* been added. This function inserts a bitmask into the array of masks to */ 10093/* search when searching for a matching NAT rule for a packet. */ 10094/* Prevention of duplicate masks is achieved by checking the use count for */ 10095/* a given netmask. */ 10096/* ------------------------------------------------------------------------ */ 10097void 10098ipf_inet_mask_add(bits, mtab) 10099 int bits; 10100 ipf_v4_masktab_t *mtab; 10101{ 10102 u_32_t mask; 10103 int i, j; 10104 10105 mtab->imt4_masks[bits]++; 10106 if (mtab->imt4_masks[bits] > 1) 10107 return; 10108 10109 if (bits == 0) 10110 mask = 0; 10111 else 10112 mask = 0xffffffff << (32 - bits); 10113 10114 for (i = 0; i < 33; i++) { 10115 if (ntohl(mtab->imt4_active[i]) < mask) { 10116 for (j = 32; j > i; j--) 10117 mtab->imt4_active[j] = mtab->imt4_active[j - 1]; 10118 mtab->imt4_active[i] = htonl(mask); 10119 break; 10120 } 10121 } 10122 mtab->imt4_max++; 10123} 10124 10125 10126/* ------------------------------------------------------------------------ */ 10127/* Function: ipf_inet_mask_del */ 10128/* Returns: Nil */ 10129/* Parameters: bits(I) - number of bits set in the netmask */ 10130/* mtab(I) - pointer to mask hash table structure */ 10131/* */ 10132/* Remove the 32bit bitmask represented by "bits" from the collection of */ 10133/* netmasks stored inside of mtab. */ 10134/* ------------------------------------------------------------------------ */ 10135void 10136ipf_inet_mask_del(bits, mtab) 10137 int bits; 10138 ipf_v4_masktab_t *mtab; 10139{ 10140 u_32_t mask; 10141 int i, j; 10142 10143 mtab->imt4_masks[bits]--; 10144 if (mtab->imt4_masks[bits] > 0) 10145 return; 10146 10147 mask = htonl(0xffffffff << (32 - bits)); 10148 for (i = 0; i < 33; i++) { 10149 if (mtab->imt4_active[i] == mask) { 10150 for (j = i + 1; j < 33; j++) 10151 mtab->imt4_active[j - 1] = mtab->imt4_active[j]; 10152 break; 10153 } 10154 } 10155 mtab->imt4_max--; 10156 ASSERT(mtab->imt4_max >= 0); 10157} 10158 10159 10160#ifdef USE_INET6 10161/* ------------------------------------------------------------------------ */ 10162/* Function: ipf_inet6_mask_add */ 10163/* Returns: Nil */ 10164/* Parameters: bits(I) - number of bits set in mask */ 10165/* mask(I) - pointer to mask to add */ 10166/* mtab(I) - pointer to mask hash table structure */ 10167/* */ 10168/* When called, bitcount represents the mask of a IPv6 NAT map rule that */ 10169/* has just been added. This function inserts a bitmask into the array of */ 10170/* masks to search when searching for a matching NAT rule for a packet. */ 10171/* Prevention of duplicate masks is achieved by checking the use count for */ 10172/* a given netmask. */ 10173/* ------------------------------------------------------------------------ */ 10174void 10175ipf_inet6_mask_add(bits, mask, mtab) 10176 int bits; 10177 i6addr_t *mask; 10178 ipf_v6_masktab_t *mtab; 10179{ 10180 i6addr_t zero; 10181 int i, j; 10182 10183 mtab->imt6_masks[bits]++; 10184 if (mtab->imt6_masks[bits] > 1) 10185 return; 10186 10187 if (bits == 0) { 10188 mask = &zero; 10189 zero.i6[0] = 0; 10190 zero.i6[1] = 0; 10191 zero.i6[2] = 0; 10192 zero.i6[3] = 0; 10193 } 10194 10195 for (i = 0; i < 129; i++) { 10196 if (IP6_LT(&mtab->imt6_active[i], mask)) { 10197 for (j = 128; j > i; j--) 10198 mtab->imt6_active[j] = mtab->imt6_active[j - 1]; 10199 mtab->imt6_active[i] = *mask; 10200 break; 10201 } 10202 } 10203 mtab->imt6_max++; 10204} 10205 10206 10207/* ------------------------------------------------------------------------ */ 10208/* Function: ipf_inet6_mask_del */ 10209/* Returns: Nil */ 10210/* Parameters: bits(I) - number of bits set in mask */ 10211/* mask(I) - pointer to mask to remove */ 10212/* mtab(I) - pointer to mask hash table structure */ 10213/* */ 10214/* Remove the 128bit bitmask represented by "bits" from the collection of */ 10215/* netmasks stored inside of mtab. */ 10216/* ------------------------------------------------------------------------ */ 10217void 10218ipf_inet6_mask_del(bits, mask, mtab) 10219 int bits; 10220 i6addr_t *mask; 10221 ipf_v6_masktab_t *mtab; 10222{ 10223 i6addr_t zero; 10224 int i, j; 10225 10226 mtab->imt6_masks[bits]--; 10227 if (mtab->imt6_masks[bits] > 0) 10228 return; 10229 10230 if (bits == 0) 10231 mask = &zero; 10232 zero.i6[0] = 0; 10233 zero.i6[1] = 0; 10234 zero.i6[2] = 0; 10235 zero.i6[3] = 0; 10236 10237 for (i = 0; i < 129; i++) { 10238 if (IP6_EQ(&mtab->imt6_active[i], mask)) { 10239 for (j = i + 1; j < 129; j++) { 10240 mtab->imt6_active[j - 1] = mtab->imt6_active[j]; 10241 if (IP6_EQ(&mtab->imt6_active[j - 1], &zero)) 10242 break; 10243 } 10244 break; 10245 } 10246 } 10247 mtab->imt6_max--; 10248 ASSERT(mtab->imt6_max >= 0); 10249} 10250#endif 10251