4 * Copyright (C) 2012 by Darren Reed.
6 * See the IPFILTER.LICENCE file for details on licencing.
8 * Copyright 2008 Sun Microsystems.
13 #if defined(KERNEL) || defined(_KERNEL)
19 #include <sys/errno.h>
20 #include <sys/types.h>
21 #include <sys/param.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"
29 # if (__FreeBSD_version == 400019)
30 # define CSUM_DELAY_DATA
33 # include <sys/filio.h>
35 # include <sys/ioctl.h>
37 #if (defined(__SVR4) || defined(__svr4__)) && defined(sun)
38 # include <sys/filio.h>
41 # include <sys/fcntl.h>
44 # include <sys/systm.h>
45 # include <sys/file.h>
51 # include <sys/file.h>
59 #if !defined(__SVR4) && !defined(__svr4__) && !defined(__hpux) && \
61 # include <sys/mbuf.h>
64 # include <sys/byteorder.h>
66 # if (SOLARIS2 < 5) && defined(sun)
67 # include <sys/dditypes.h>
71 # define _NET_ROUTE_INCLUDED
74 # include <sys/protosw.h>
76 #include <sys/socket.h>
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>
88 #include <netinet/tcp.h>
89 #if (!defined(__sgi) && !defined(AIX)) || defined(_KERNEL)
90 # include <netinet/udp.h>
91 # include <netinet/ip_icmp.h>
94 # undef _NET_ROUTE_INCLUDED
99 #include "netinet/ip_compat.h"
101 # include <netinet/icmp6.h>
102 # if !SOLARIS && defined(_KERNEL) && !defined(__osf__) && !defined(__hpux)
103 # include <netinet6/in6_var.h>
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"
113 # include "netinet/ip_scan.h"
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"
122 #if defined(IPFILTER_BPF) && defined(_KERNEL)
123 # include <net/bpf.h>
125 #if defined(__FreeBSD_version) && (__FreeBSD_version >= 300000)
126 # include <sys/malloc.h>
128 #include "netinet/ipl.h"
130 #if defined(__NetBSD__) && (__NetBSD_Version__ >= 104230000)
131 # include <sys/callout.h>
132 extern struct callout ipf_slowtimer_ch;
134 #if defined(__OpenBSD__)
135 # include <sys/timeout.h>
136 extern struct timeout ipf_slowtimer_ch;
138 /* END OF INCLUDES */
141 static const char sccsid[] = "@(#)fil.c 1.36 6/5/96 (C) 1993-2000 Darren Reed";
142 static const char rcsid[] = "@(#)$FreeBSD$";
143 /* static const char rcsid[] = "@(#)$Id: fil.c,v 2.243.2.125 2007/10/10 09:27:20 darrenr Exp $"; */
150 extern int blockreason;
153 #define LBUMP(x) softc->x++
154 #define LBUMPD(x, y) do { softc->x.y++; DT(y); } while (0)
156 static INLINE int ipf_check_ipf __P((fr_info_t *, frentry_t *, int));
157 static u_32_t ipf_checkcipso __P((fr_info_t *, u_char *, int));
158 static u_32_t ipf_checkripso __P((u_char *));
159 static u_32_t ipf_decaps __P((fr_info_t *, u_32_t, int));
161 static frentry_t *ipf_dolog __P((fr_info_t *, u_32_t *));
163 static int ipf_flushlist __P((ipf_main_softc_t *, int *,
165 static int ipf_flush_groups __P((ipf_main_softc_t *, frgroup_t **,
167 static ipfunc_t ipf_findfunc __P((ipfunc_t));
168 static void *ipf_findlookup __P((ipf_main_softc_t *, int,
170 i6addr_t *, i6addr_t *));
171 static frentry_t *ipf_firewall __P((fr_info_t *, u_32_t *));
172 static int ipf_fr_matcharray __P((fr_info_t *, int *));
173 static int ipf_frruleiter __P((ipf_main_softc_t *, void *, int,
175 static void ipf_funcfini __P((ipf_main_softc_t *, frentry_t *));
176 static int ipf_funcinit __P((ipf_main_softc_t *, frentry_t *));
177 static int ipf_geniter __P((ipf_main_softc_t *, ipftoken_t *,
179 static void ipf_getstat __P((ipf_main_softc_t *,
180 struct friostat *, int));
181 static int ipf_group_flush __P((ipf_main_softc_t *, frgroup_t *));
182 static void ipf_group_free __P((frgroup_t *));
183 static int ipf_grpmapfini __P((struct ipf_main_softc_s *,
185 static int ipf_grpmapinit __P((struct ipf_main_softc_s *,
187 static frentry_t *ipf_nextrule __P((ipf_main_softc_t *, int, int,
189 static int ipf_portcheck __P((frpcmp_t *, u_32_t));
190 static INLINE int ipf_pr_ah __P((fr_info_t *));
191 static INLINE void ipf_pr_esp __P((fr_info_t *));
192 static INLINE void ipf_pr_gre __P((fr_info_t *));
193 static INLINE void ipf_pr_udp __P((fr_info_t *));
194 static INLINE void ipf_pr_tcp __P((fr_info_t *));
195 static INLINE void ipf_pr_icmp __P((fr_info_t *));
196 static INLINE void ipf_pr_ipv4hdr __P((fr_info_t *));
197 static INLINE void ipf_pr_short __P((fr_info_t *, int));
198 static INLINE int ipf_pr_tcpcommon __P((fr_info_t *));
199 static INLINE int ipf_pr_udpcommon __P((fr_info_t *));
200 static void ipf_rule_delete __P((ipf_main_softc_t *, frentry_t *f,
202 static void ipf_rule_expire_insert __P((ipf_main_softc_t *,
204 static int ipf_synclist __P((ipf_main_softc_t *, frentry_t *,
206 static void ipf_token_flush __P((ipf_main_softc_t *));
207 static void ipf_token_unlink __P((ipf_main_softc_t *,
209 static ipftuneable_t *ipf_tune_findbyname __P((ipftuneable_t *,
211 static ipftuneable_t *ipf_tune_findbycookie __P((ipftuneable_t **, void *,
213 static int ipf_updateipid __P((fr_info_t *));
214 static int ipf_settimeout __P((struct ipf_main_softc_s *,
215 struct ipftuneable *,
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)
221 static int ppsratecheck(struct timeval *, int *, int);
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.
231 static 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 },
255 static 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 },
270 * bit values for identifying presence of individual IP security options
272 static 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 }
283 char ipfilter_version[] = IPL_VERSION;
296 #ifdef IPFILTER_COMPILED
299 #ifdef IPFILTER_CKSUM
313 * Table of functions available for use with call rules.
315 static 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 }
321 static 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),
326 { { (void *)offsetof(struct ipf_main_softc_s, ipf_active) },
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),
334 { { (void *)offsetof(ipf_main_softc_t, ipf_update_ipid) },
336 stsizeof(ipf_main_softc_t, ipf_update_ipid),
338 { { (void *)offsetof(ipf_main_softc_t, ipf_chksrc) },
340 stsizeof(ipf_main_softc_t, ipf_chksrc),
342 { { (void *)offsetof(ipf_main_softc_t, ipf_minttl) },
344 stsizeof(ipf_main_softc_t, ipf_minttl),
346 { { (void *)offsetof(ipf_main_softc_t, ipf_icmpminfragmtu) },
347 "icmp_minfragmtu", 0, 1,
348 stsizeof(ipf_main_softc_t, ipf_icmpminfragmtu),
350 { { (void *)offsetof(ipf_main_softc_t, ipf_pass) },
351 "default_pass", 0, 0xffffffff,
352 stsizeof(ipf_main_softc_t, ipf_pass),
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 },
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.
433 static INLINE int ipf_pr_ah6 __P((fr_info_t *));
434 static INLINE void ipf_pr_esp6 __P((fr_info_t *));
435 static INLINE void ipf_pr_gre6 __P((fr_info_t *));
436 static INLINE void ipf_pr_udp6 __P((fr_info_t *));
437 static INLINE void ipf_pr_tcp6 __P((fr_info_t *));
438 static INLINE void ipf_pr_icmp6 __P((fr_info_t *));
439 static INLINE void ipf_pr_ipv6hdr __P((fr_info_t *));
440 static INLINE void ipf_pr_short6 __P((fr_info_t *, int));
441 static INLINE int ipf_pr_hopopts6 __P((fr_info_t *));
442 static INLINE int ipf_pr_mobility6 __P((fr_info_t *));
443 static INLINE int ipf_pr_routing6 __P((fr_info_t *));
444 static INLINE int ipf_pr_dstopts6 __P((fr_info_t *));
445 static INLINE int ipf_pr_fragment6 __P((fr_info_t *));
446 static INLINE struct ip6_ext *ipf_pr_ipv6exthdr __P((fr_info_t *, int, int));
449 /* ------------------------------------------------------------------------ */
450 /* Function: ipf_pr_short6 */
452 /* Parameters: fin(I) - pointer to packet information */
453 /* xmin(I) - minimum header size */
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 /* ------------------------------------------------------------------------ */
461 ipf_pr_short6(fin, xmin)
466 if (fin->fin_dlen < xmin)
467 fin->fin_flx |= FI_SHORT;
471 /* ------------------------------------------------------------------------ */
472 /* Function: ipf_pr_ipv6hdr */
474 /* Parameters: fin(I) - pointer to packet information */
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 /* ------------------------------------------------------------------------ */
486 ip6_t *ip6 = (ip6_t *)fin->fin_ip;
487 int p, go = 1, i, hdrcount;
488 fr_ip_t *fi = &fin->fin_fi;
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];
511 if (IN6_IS_ADDR_MULTICAST(&fi->fi_dst.in6))
512 fin->fin_flx |= FI_MULTICAST|FI_MBCAST;
515 while (go && !(fin->fin_flx & FI_SHORT)) {
528 case IPPROTO_ICMPV6 :
538 case IPPROTO_HOPOPTS :
539 p = ipf_pr_hopopts6(fin);
542 case IPPROTO_MOBILITY :
543 p = ipf_pr_mobility6(fin);
546 case IPPROTO_DSTOPTS :
547 p = ipf_pr_dstopts6(fin);
550 case IPPROTO_ROUTING :
551 p = ipf_pr_routing6(fin);
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;
576 case IPPROTO_FRAGMENT :
577 p = ipf_pr_fragment6(fin);
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.
584 if (fin->fin_off != 0)
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
603 if ((go != 0) && (p != IPPROTO_NONE) &&
604 (ipf_pr_pullup(fin, 0) == -1)) {
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.
615 if (fin->fin_m == NULL) {
616 ipf_main_softc_t *softc = fin->fin_main_soft;
618 LBUMPD(ipf_stats[fin->fin_out], fr_v6_bad);
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.
628 if ((go != 0) && (fin->fin_flx & FI_FRAG) && (fin->fin_off == 0)) {
629 ipf_main_softc_t *softc = fin->fin_main_soft;
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);
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 */
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 /* ------------------------------------------------------------------------ */
653 static INLINE struct ip6_ext *
654 ipf_pr_ipv6exthdr(fin, multiple, proto)
658 ipf_main_softc_t *softc = fin->fin_main_soft;
663 fin->fin_flx |= FI_V6EXTHDR;
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);
672 if (ipf_pr_pullup(fin, 8) == -1) {
673 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ext_pullup);
680 case IPPROTO_FRAGMENT :
684 shift = 8 + (hdr->ip6e_len << 3);
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);
694 fin->fin_dp = (char *)fin->fin_dp + shift;
695 fin->fin_dlen -= shift;
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.
702 if (fin->fin_flx & FI_FRAG)
705 for (i = 0; ip6exthdr[i].ol_bit != 0; i++)
706 if (ip6exthdr[i].ol_val == proto) {
708 * Most IPv6 extension headers are only allowed once.
710 if ((multiple == 0) &&
711 ((fin->fin_optmsk & ip6exthdr[i].ol_bit) != 0))
712 fin->fin_flx |= FI_BAD;
714 fin->fin_optmsk |= ip6exthdr[i].ol_bit;
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 */
728 /* This is function checks pending hop by hop options extension header */
729 /* ------------------------------------------------------------------------ */
736 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_HOPOPTS);
739 return hdr->ip6e_nxt;
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 */
749 /* This is function checks the IPv6 mobility extension header */
750 /* ------------------------------------------------------------------------ */
752 ipf_pr_mobility6(fin)
757 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_MOBILITY);
760 return hdr->ip6e_nxt;
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 */
770 /* This is function checks pending routing extension header */
771 /* ------------------------------------------------------------------------ */
776 struct ip6_routing *hdr;
778 hdr = (struct ip6_routing *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_ROUTING);
782 switch (hdr->ip6r_type)
786 * Nasty extension header length?
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;
792 fin->fin_flx |= FI_BAD;
793 LBUMPD(ipf_stats[fin->fin_out], fr_v6_rh_bad);
802 return hdr->ip6r_nxt;
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 */
812 /* Examine the IPv6 fragment header and extract fragment offset information.*/
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: */
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] */
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 */
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 /* ------------------------------------------------------------------------ */
836 ipf_pr_fragment6(fin)
839 ipf_main_softc_t *softc = fin->fin_main_soft;
840 struct ip6_frag *frag;
842 fin->fin_flx |= FI_FRAG;
844 frag = (struct ip6_frag *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_FRAGMENT);
846 LBUMPD(ipf_stats[fin->fin_out], fr_v6_frag_bad);
850 if ((frag->ip6f_offlg & IP6F_MORE_FRAG) != 0) {
852 * Any fragment that isn't the last fragment must have its
853 * length as a multiple of 8.
855 if ((fin->fin_plen & 7) != 0)
856 fin->fin_flx |= FI_BAD;
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;
866 * Jumbograms aren't handled, so the max. length is 64k
868 if ((fin->fin_off << 3) + fin->fin_dlen > 65535)
869 fin->fin_flx |= FI_BAD;
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
878 return frag->ip6f_nxt;
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 */
888 /* This is function checks pending destination options extension header */
889 /* ------------------------------------------------------------------------ */
894 ipf_main_softc_t *softc = fin->fin_main_soft;
897 hdr = ipf_pr_ipv6exthdr(fin, 0, IPPROTO_DSTOPTS);
899 LBUMPD(ipf_stats[fin->fin_out], fr_v6_dst_bad);
902 return hdr->ip6e_nxt;
906 /* ------------------------------------------------------------------------ */
907 /* Function: ipf_pr_icmp6 */
909 /* Parameters: fin(I) - pointer to packet information */
912 /* This routine is mainly concerned with determining the minimum valid size */
913 /* for an ICMPv6 packet. */
914 /* ------------------------------------------------------------------------ */
919 int minicmpsz = sizeof(struct icmp6_hdr);
920 struct icmp6_hdr *icmp6;
922 if (ipf_pr_pullup(fin, ICMP6ERR_MINPKTLEN - sizeof(ip6_t)) == -1) {
923 ipf_main_softc_t *softc = fin->fin_main_soft;
925 LBUMPD(ipf_stats[fin->fin_out], fr_v6_icmp6_pullup);
929 if (fin->fin_dlen > 1) {
934 fin->fin_data[0] = *(u_short *)icmp6;
936 if ((icmp6->icmp6_type & ICMP6_INFOMSG_MASK) != 0)
937 fin->fin_flx |= FI_ICMPQUERY;
939 switch (icmp6->icmp6_type)
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);
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)
957 if (M_LEN(fin->fin_m) < fin->fin_plen) {
958 if (ipf_coalesce(fin) != 1)
962 if (ipf_pr_pullup(fin, ICMP6ERR_MINPKTLEN) == -1)
966 * If the destination of this packet doesn't match the
967 * source of the original packet then this packet is
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;
981 ipf_pr_short6(fin, minicmpsz);
982 if ((fin->fin_flx & (FI_SHORT|FI_BAD)) == 0) {
983 u_char p = fin->fin_p;
985 fin->fin_p = IPPROTO_ICMPV6;
992 /* ------------------------------------------------------------------------ */
993 /* Function: ipf_pr_udp6 */
995 /* Parameters: fin(I) - pointer to packet information */
998 /* Analyse the packet for IPv6/UDP properties. */
999 /* Is not expected to be called for fragmented packets. */
1000 /* ------------------------------------------------------------------------ */
1006 if (ipf_pr_udpcommon(fin) == 0) {
1007 u_char p = fin->fin_p;
1009 fin->fin_p = IPPROTO_UDP;
1010 ipf_checkv6sum(fin);
1016 /* ------------------------------------------------------------------------ */
1017 /* Function: ipf_pr_tcp6 */
1019 /* Parameters: fin(I) - pointer to packet information */
1022 /* Analyse the packet for IPv6/TCP properties. */
1023 /* Is not expected to be called for fragmented packets. */
1024 /* ------------------------------------------------------------------------ */
1030 if (ipf_pr_tcpcommon(fin) == 0) {
1031 u_char p = fin->fin_p;
1033 fin->fin_p = IPPROTO_TCP;
1034 ipf_checkv6sum(fin);
1040 /* ------------------------------------------------------------------------ */
1041 /* Function: ipf_pr_esp6 */
1043 /* Parameters: fin(I) - pointer to packet information */
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 /* ------------------------------------------------------------------------ */
1057 if ((fin->fin_off == 0) && (ipf_pr_pullup(fin, 8) == -1)) {
1058 ipf_main_softc_t *softc = fin->fin_main_soft;
1060 LBUMPD(ipf_stats[fin->fin_out], fr_v6_esp_pullup);
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 */
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 /* ------------------------------------------------------------------------ */
1082 fin->fin_flx |= FI_AH;
1084 ah = (authhdr_t *)ipf_pr_ipv6exthdr(fin, 0, IPPROTO_HOPOPTS);
1086 ipf_main_softc_t *softc = fin->fin_main_soft;
1088 LBUMPD(ipf_stats[fin->fin_out], fr_v6_ah_bad);
1089 return IPPROTO_NONE;
1092 ipf_pr_short6(fin, sizeof(*ah));
1095 * No need for another pullup, ipf_pr_ipv6exthdr() will pullup
1096 * enough data to satisfy ah_next (the very first one.)
1102 /* ------------------------------------------------------------------------ */
1103 /* Function: ipf_pr_gre6 */
1105 /* Parameters: fin(I) - pointer to packet information */
1107 /* Analyse the packet for GRE properties. */
1108 /* ------------------------------------------------------------------------ */
1115 if (ipf_pr_pullup(fin, sizeof(grehdr_t)) == -1) {
1116 ipf_main_softc_t *softc = fin->fin_main_soft;
1118 LBUMPD(ipf_stats[fin->fin_out], fr_v6_gre_pullup);
1123 if (GRE_REV(gre->gr_flags) == 1)
1124 fin->fin_data[0] = gre->gr_call;
1126 #endif /* USE_INET6 */
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 */
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. */
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. */
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 /* ------------------------------------------------------------------------ */
1148 ipf_pr_pullup(fin, plen)
1152 ipf_main_softc_t *softc = fin->fin_main_soft;
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]);
1166 LBUMP(ipf_stats[fin->fin_out].fr_pull[0]);
1168 LBUMP(ipf_stats[fin->fin_out].fr_pull[1]);
1170 * Fake ipf_pullup failing
1172 fin->fin_reason = FRB_PULLUP;
1173 *fin->fin_mp = NULL;
1184 /* ------------------------------------------------------------------------ */
1185 /* Function: ipf_pr_short */
1187 /* Parameters: fin(I) - pointer to packet information */
1188 /* xmin(I) - minimum header size */
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 /* ------------------------------------------------------------------------ */
1197 ipf_pr_short(fin, xmin)
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;
1211 /* ------------------------------------------------------------------------ */
1212 /* Function: ipf_pr_icmp */
1214 /* Parameters: fin(I) - pointer to packet information */
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. */
1222 /* XXX - other ICMP sanity checks? */
1223 /* ------------------------------------------------------------------------ */
1228 ipf_main_softc_t *softc = fin->fin_main_soft;
1229 int minicmpsz = sizeof(struct icmp);
1233 ipf_pr_short(fin, ICMPERR_ICMPHLEN);
1235 if (fin->fin_off != 0) {
1236 LBUMPD(ipf_stats[fin->fin_out], fr_v4_icmp_frag);
1240 if (ipf_pr_pullup(fin, ICMPERR_ICMPHLEN) == -1) {
1241 LBUMPD(ipf_stats[fin->fin_out], fr_v4_icmp_pullup);
1247 fin->fin_data[0] = *(u_short *)icmp;
1248 fin->fin_data[1] = icmp->icmp_id;
1250 switch (icmp->icmp_type)
1252 case ICMP_ECHOREPLY :
1254 /* Router discovery messaes - RFC 1256 */
1255 case ICMP_ROUTERADVERT :
1256 case ICMP_ROUTERSOLICIT :
1257 fin->fin_flx |= FI_ICMPQUERY;
1258 minicmpsz = ICMP_MINLEN;
1261 * type(1) + code(1) + cksum(2) + id(2) seq(2) +
1262 * 3 * timestamp(3 * 4)
1265 case ICMP_TSTAMPREPLY :
1266 fin->fin_flx |= FI_ICMPQUERY;
1270 * type(1) + code(1) + cksum(2) + id(2) seq(2) +
1274 case ICMP_IREQREPLY :
1276 case ICMP_MASKREPLY :
1277 fin->fin_flx |= FI_ICMPQUERY;
1281 * type(1) + code(1) + cksum(2) + id(2) seq(2) + ip(20+)
1285 if (icmp->icmp_code == ICMP_UNREACH_NEEDFRAG) {
1286 if (icmp->icmp_nextmtu < softc->ipf_icmpminfragmtu)
1287 fin->fin_flx |= FI_BAD;
1291 case ICMP_SOURCEQUENCH :
1292 case ICMP_REDIRECT :
1293 case ICMP_TIMXCEED :
1294 case ICMP_PARAMPROB :
1295 fin->fin_flx |= FI_ICMPERR;
1296 if (ipf_coalesce(fin) != 1) {
1297 LBUMPD(ipf_stats[fin->fin_out], fr_icmp_coalesce);
1302 * ICMP error packets should not be generated for IP
1303 * packets that are a fragment that isn't the first
1306 oip = (ip_t *)((char *)fin->fin_dp + ICMPERR_ICMPHLEN);
1307 if ((ntohs(oip->ip_off) & IP_OFFMASK) != 0)
1308 fin->fin_flx |= FI_BAD;
1311 * If the destination of this packet doesn't match the
1312 * source of the original packet then this packet is
1315 if (oip->ip_src.s_addr != fin->fin_daddr)
1316 fin->fin_flx |= FI_BAD;
1322 ipf_pr_short(fin, minicmpsz);
1324 ipf_checkv4sum(fin);
1328 /* ------------------------------------------------------------------------ */
1329 /* Function: ipf_pr_tcpcommon */
1330 /* Returns: int - 0 = header ok, 1 = bad packet, -1 = buffer error */
1331 /* Parameters: fin(I) - pointer to packet information */
1333 /* TCP header sanity checking. Look for bad combinations of TCP flags, */
1334 /* and make some checks with how they interact with other fields. */
1335 /* If compiled with IPFILTER_CKSUM, check to see if the TCP checksum is */
1336 /* valid and mark the packet as bad if not. */
1337 /* ------------------------------------------------------------------------ */
1339 ipf_pr_tcpcommon(fin)
1342 ipf_main_softc_t *softc = fin->fin_main_soft;
1346 fin->fin_flx |= FI_TCPUDP;
1347 if (fin->fin_off != 0) {
1348 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_frag);
1352 if (ipf_pr_pullup(fin, sizeof(*tcp)) == -1) {
1353 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_pullup);
1358 if (fin->fin_dlen > 3) {
1359 fin->fin_sport = ntohs(tcp->th_sport);
1360 fin->fin_dport = ntohs(tcp->th_dport);
1363 if ((fin->fin_flx & FI_SHORT) != 0) {
1364 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_short);
1369 * Use of the TCP data offset *must* result in a value that is at
1370 * least the same size as the TCP header.
1372 tlen = TCP_OFF(tcp) << 2;
1373 if (tlen < sizeof(tcphdr_t)) {
1374 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_small);
1375 fin->fin_flx |= FI_BAD;
1379 flags = tcp->th_flags;
1380 fin->fin_tcpf = tcp->th_flags;
1383 * If the urgent flag is set, then the urgent pointer must
1384 * also be set and vice versa. Good TCP packets do not have
1385 * just one of these set.
1387 if ((flags & TH_URG) != 0 && (tcp->th_urp == 0)) {
1388 fin->fin_flx |= FI_BAD;
1390 } else if ((flags & TH_URG) == 0 && (tcp->th_urp != 0)) {
1392 * Ignore this case (#if 0) as it shows up in "real"
1393 * traffic with bogus values in the urgent pointer field.
1395 fin->fin_flx |= FI_BAD;
1397 } else if (((flags & (TH_SYN|TH_FIN)) != 0) &&
1398 ((flags & (TH_RST|TH_ACK)) == TH_RST)) {
1399 /* TH_FIN|TH_RST|TH_ACK seems to appear "naturally" */
1400 fin->fin_flx |= FI_BAD;
1402 } else if (((flags & TH_SYN) != 0) &&
1403 ((flags & (TH_URG|TH_PUSH)) != 0)) {
1405 * SYN with URG and PUSH set is not for normal TCP but it is
1406 * possible(?) with T/TCP...but who uses T/TCP?
1408 fin->fin_flx |= FI_BAD;
1410 } else if (!(flags & TH_ACK)) {
1412 * If the ack bit isn't set, then either the SYN or
1413 * RST bit must be set. If the SYN bit is set, then
1414 * we expect the ACK field to be 0. If the ACK is
1415 * not set and if URG, PSH or FIN are set, consdier
1416 * that to indicate a bad TCP packet.
1418 if ((flags == TH_SYN) && (tcp->th_ack != 0)) {
1420 * Cisco PIX sets the ACK field to a random value.
1421 * In light of this, do not set FI_BAD until a patch
1422 * is available from Cisco to ensure that
1423 * interoperability between existing systems is
1426 /*fin->fin_flx |= FI_BAD*/;
1427 } else if (!(flags & (TH_RST|TH_SYN))) {
1428 fin->fin_flx |= FI_BAD;
1429 } else if ((flags & (TH_URG|TH_PUSH|TH_FIN)) != 0) {
1430 fin->fin_flx |= FI_BAD;
1433 if (fin->fin_flx & FI_BAD) {
1434 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_bad_flags);
1439 * At this point, it's not exactly clear what is to be gained by
1440 * marking up which TCP options are and are not present. The one we
1441 * are most interested in is the TCP window scale. This is only in
1442 * a SYN packet [RFC1323] so we don't need this here...?
1443 * Now if we were to analyse the header for passive fingerprinting,
1444 * then that might add some weight to adding this...
1446 if (tlen == sizeof(tcphdr_t)) {
1450 if (ipf_pr_pullup(fin, tlen) == -1) {
1451 LBUMPD(ipf_stats[fin->fin_out], fr_tcp_pullup);
1458 s = (u_char *)(tcp + 1);
1459 off = IP_HL(ip) << 2;
1461 if (fin->fin_mp != NULL) {
1462 mb_t *m = *fin->fin_mp;
1464 if (off + tlen > M_LEN(m))
1468 for (tlen -= (int)sizeof(*tcp); tlen > 0; ) {
1472 else if (opt == TCPOPT_NOP)
1478 if (ol < 2 || ol > tlen)
1482 for (i = 9, mv = 4; mv >= 0; ) {
1484 if (opt == (u_char)op->ol_val) {
1485 optmsk |= op->ol_bit;
1499 /* ------------------------------------------------------------------------ */
1500 /* Function: ipf_pr_udpcommon */
1501 /* Returns: int - 0 = header ok, 1 = bad packet */
1502 /* Parameters: fin(I) - pointer to packet information */
1504 /* Extract the UDP source and destination ports, if present. If compiled */
1505 /* with IPFILTER_CKSUM, check to see if the UDP checksum is valid. */
1506 /* ------------------------------------------------------------------------ */
1508 ipf_pr_udpcommon(fin)
1513 fin->fin_flx |= FI_TCPUDP;
1515 if (!fin->fin_off && (fin->fin_dlen > 3)) {
1516 if (ipf_pr_pullup(fin, sizeof(*udp)) == -1) {
1517 ipf_main_softc_t *softc = fin->fin_main_soft;
1519 fin->fin_flx |= FI_SHORT;
1520 LBUMPD(ipf_stats[fin->fin_out], fr_udp_pullup);
1526 fin->fin_sport = ntohs(udp->uh_sport);
1527 fin->fin_dport = ntohs(udp->uh_dport);
1534 /* ------------------------------------------------------------------------ */
1535 /* Function: ipf_pr_tcp */
1537 /* Parameters: fin(I) - pointer to packet information */
1540 /* Analyse the packet for IPv4/TCP properties. */
1541 /* ------------------------------------------------------------------------ */
1547 ipf_pr_short(fin, sizeof(tcphdr_t));
1549 if (ipf_pr_tcpcommon(fin) == 0)
1550 ipf_checkv4sum(fin);
1554 /* ------------------------------------------------------------------------ */
1555 /* Function: ipf_pr_udp */
1557 /* Parameters: fin(I) - pointer to packet information */
1560 /* Analyse the packet for IPv4/UDP properties. */
1561 /* ------------------------------------------------------------------------ */
1567 ipf_pr_short(fin, sizeof(udphdr_t));
1569 if (ipf_pr_udpcommon(fin) == 0)
1570 ipf_checkv4sum(fin);
1574 /* ------------------------------------------------------------------------ */
1575 /* Function: ipf_pr_esp */
1577 /* Parameters: fin(I) - pointer to packet information */
1579 /* Analyse the packet for ESP properties. */
1580 /* The minimum length is taken to be the SPI (32bits) plus a tail (32bits) */
1581 /* even though the newer ESP packets must also have a sequence number that */
1582 /* is 32bits as well, it is not possible(?) to determine the version from a */
1583 /* simple packet header. */
1584 /* ------------------------------------------------------------------------ */
1590 if (fin->fin_off == 0) {
1591 ipf_pr_short(fin, 8);
1592 if (ipf_pr_pullup(fin, 8) == -1) {
1593 ipf_main_softc_t *softc = fin->fin_main_soft;
1595 LBUMPD(ipf_stats[fin->fin_out], fr_v4_esp_pullup);
1601 /* ------------------------------------------------------------------------ */
1602 /* Function: ipf_pr_ah */
1603 /* Returns: int - value of the next header or IPPROTO_NONE if error */
1604 /* Parameters: fin(I) - pointer to packet information */
1606 /* Analyse the packet for AH properties. */
1607 /* The minimum length is taken to be the combination of all fields in the */
1608 /* header being present and no authentication data (null algorithm used.) */
1609 /* ------------------------------------------------------------------------ */
1614 ipf_main_softc_t *softc = fin->fin_main_soft;
1618 fin->fin_flx |= FI_AH;
1619 ipf_pr_short(fin, sizeof(*ah));
1621 if (((fin->fin_flx & FI_SHORT) != 0) || (fin->fin_off != 0)) {
1622 LBUMPD(ipf_stats[fin->fin_out], fr_v4_ah_bad);
1623 return IPPROTO_NONE;
1626 if (ipf_pr_pullup(fin, sizeof(*ah)) == -1) {
1627 DT(fr_v4_ah_pullup_1);
1628 LBUMP(ipf_stats[fin->fin_out].fr_v4_ah_pullup);
1629 return IPPROTO_NONE;
1632 ah = (authhdr_t *)fin->fin_dp;
1634 len = (ah->ah_plen + 2) << 2;
1635 ipf_pr_short(fin, len);
1636 if (ipf_pr_pullup(fin, len) == -1) {
1637 DT(fr_v4_ah_pullup_2);
1638 LBUMP(ipf_stats[fin->fin_out].fr_v4_ah_pullup);
1639 return IPPROTO_NONE;
1643 * Adjust fin_dp and fin_dlen for skipping over the authentication
1646 fin->fin_dp = (char *)fin->fin_dp + len;
1647 fin->fin_dlen -= len;
1652 /* ------------------------------------------------------------------------ */
1653 /* Function: ipf_pr_gre */
1655 /* Parameters: fin(I) - pointer to packet information */
1657 /* Analyse the packet for GRE properties. */
1658 /* ------------------------------------------------------------------------ */
1663 ipf_main_softc_t *softc = fin->fin_main_soft;
1666 ipf_pr_short(fin, sizeof(grehdr_t));
1668 if (fin->fin_off != 0) {
1669 LBUMPD(ipf_stats[fin->fin_out], fr_v4_gre_frag);
1673 if (ipf_pr_pullup(fin, sizeof(grehdr_t)) == -1) {
1674 LBUMPD(ipf_stats[fin->fin_out], fr_v4_gre_pullup);
1679 if (GRE_REV(gre->gr_flags) == 1)
1680 fin->fin_data[0] = gre->gr_call;
1684 /* ------------------------------------------------------------------------ */
1685 /* Function: ipf_pr_ipv4hdr */
1687 /* Parameters: fin(I) - pointer to packet information */
1690 /* Analyze the IPv4 header and set fields in the fr_info_t structure. */
1691 /* Check all options present and flag their presence if any exist. */
1692 /* ------------------------------------------------------------------------ */
1697 u_short optmsk = 0, secmsk = 0, auth = 0;
1698 int hlen, ol, mv, p, i;
1699 const struct optlist *op;
1706 hlen = fin->fin_hlen;
1712 fi->fi_tos = ip->ip_tos;
1713 fin->fin_id = ip->ip_id;
1714 off = ntohs(ip->ip_off);
1716 /* Get both TTL and protocol */
1717 fi->fi_p = ip->ip_p;
1718 fi->fi_ttl = ip->ip_ttl;
1720 /* Zero out bits not used in IPv6 address */
1721 fi->fi_src.i6[1] = 0;
1722 fi->fi_src.i6[2] = 0;
1723 fi->fi_src.i6[3] = 0;
1724 fi->fi_dst.i6[1] = 0;
1725 fi->fi_dst.i6[2] = 0;
1726 fi->fi_dst.i6[3] = 0;
1728 fi->fi_saddr = ip->ip_src.s_addr;
1729 fin->fin_crc += fi->fi_saddr;
1730 fi->fi_daddr = ip->ip_dst.s_addr;
1731 fin->fin_crc += fi->fi_daddr;
1732 if (IN_CLASSD(ntohl(fi->fi_daddr)))
1733 fin->fin_flx |= FI_MULTICAST|FI_MBCAST;
1736 * set packet attribute flags based on the offset and
1737 * calculate the byte offset that it represents.
1739 off &= IP_MF|IP_OFFMASK;
1741 int morefrag = off & IP_MF;
1743 fi->fi_flx |= FI_FRAG;
1746 fin->fin_flx |= FI_FRAGBODY;
1748 if ((off + fin->fin_dlen > 65535) ||
1749 (fin->fin_dlen == 0) ||
1750 ((morefrag != 0) && ((fin->fin_dlen & 7) != 0))) {
1752 * The length of the packet, starting at its
1753 * offset cannot exceed 65535 (0xffff) as the
1754 * length of an IP packet is only 16 bits.
1756 * Any fragment that isn't the last fragment
1757 * must have a length greater than 0 and it
1758 * must be an even multiple of 8.
1760 fi->fi_flx |= FI_BAD;
1767 * Call per-protocol setup and checking
1769 if (p == IPPROTO_AH) {
1771 * Treat AH differently because we expect there to be another
1772 * layer 4 header after it.
1801 * If it is a standard IP header (no options), set the flag fields
1802 * which relate to options to 0.
1804 if (hlen == sizeof(*ip)) {
1812 * So the IP header has some IP options attached. Walk the entire
1813 * list of options present with this packet and set flags to indicate
1814 * which ones are here and which ones are not. For the somewhat out
1815 * of date and obscure security classification options, set a flag to
1816 * represent which classification is present.
1818 fi->fi_flx |= FI_OPTIONS;
1820 for (s = (u_char *)(ip + 1), hlen -= (int)sizeof(*ip); hlen > 0; ) {
1824 else if (opt == IPOPT_NOP)
1830 if (ol < 2 || ol > hlen)
1833 for (i = 9, mv = 4; mv >= 0; ) {
1836 if ((opt == (u_char)op->ol_val) && (ol > 4)) {
1841 case IPOPT_SECURITY :
1842 if (optmsk & op->ol_bit) {
1843 fin->fin_flx |= FI_BAD;
1845 doi = ipf_checkripso(s);
1847 auth = doi & 0xffff;
1853 if (optmsk & op->ol_bit) {
1854 fin->fin_flx |= FI_BAD;
1856 doi = ipf_checkcipso(fin,
1859 auth = doi & 0xffff;
1863 optmsk |= op->ol_bit;
1866 if (opt < op->ol_val)
1879 if (auth && !(auth & 0x0100))
1881 fi->fi_optmsk = optmsk;
1882 fi->fi_secmsk = secmsk;
1887 /* ------------------------------------------------------------------------ */
1888 /* Function: ipf_checkripso */
1890 /* Parameters: s(I) - pointer to start of RIPSO option */
1892 /* ------------------------------------------------------------------------ */
1897 const struct optlist *sp;
1898 u_short secmsk = 0, auth = 0;
1902 sec = *(s + 2); /* classification */
1903 for (j = 3, m = 2; m >= 0; ) {
1905 if (sec == sp->ol_val) {
1906 secmsk |= sp->ol_bit;
1912 if (sec < sp->ol_val)
1919 return (secmsk << 16) | auth;
1923 /* ------------------------------------------------------------------------ */
1924 /* Function: ipf_checkcipso */
1925 /* Returns: u_32_t - 0 = failure, else the doi from the header */
1926 /* Parameters: fin(IO) - pointer to packet information */
1927 /* s(I) - pointer to start of CIPSO option */
1928 /* ol(I) - length of CIPSO option field */
1930 /* This function returns the domain of integrity (DOI) field from the CIPSO */
1931 /* header and returns that whilst also storing the highest sensitivity */
1932 /* value found in the fr_info_t structure. */
1934 /* No attempt is made to extract the category bitmaps as these are defined */
1935 /* by the user (rather than the protocol) and can be rather numerous on the */
1937 /* ------------------------------------------------------------------------ */
1939 ipf_checkcipso(fin, s, ol)
1944 ipf_main_softc_t *softc = fin->fin_main_soft;
1947 u_char *t, tag, tlen, sensitivity;
1950 if (ol < 6 || ol > 40) {
1951 LBUMPD(ipf_stats[fin->fin_out], fr_v4_cipso_bad);
1952 fin->fin_flx |= FI_BAD;
1957 fi->fi_sensitivity = 0;
1959 * The DOI field MUST be there.
1961 bcopy(s + 2, &doi, sizeof(doi));
1963 t = (u_char *)s + 6;
1964 for (len = ol - 6; len >= 2; len -= tlen, t+= tlen) {
1967 if (tlen > len || tlen < 4 || tlen > 34) {
1968 LBUMPD(ipf_stats[fin->fin_out], fr_v4_cipso_tlen);
1969 fin->fin_flx |= FI_BAD;
1975 * Tag numbers 0, 1, 2, 5 are laid out in the CIPSO Internet
1976 * draft (16 July 1992) that has expired.
1979 fin->fin_flx |= FI_BAD;
1981 } else if (tag == 1) {
1982 if (*(t + 2) != 0) {
1983 fin->fin_flx |= FI_BAD;
1986 sensitivity = *(t + 3);
1987 /* Category bitmap for categories 0-239 */
1989 } else if (tag == 4) {
1990 if (*(t + 2) != 0) {
1991 fin->fin_flx |= FI_BAD;
1994 sensitivity = *(t + 3);
1995 /* Enumerated categories, 16bits each, upto 15 */
1997 } else if (tag == 5) {
1998 if (*(t + 2) != 0) {
1999 fin->fin_flx |= FI_BAD;
2002 sensitivity = *(t + 3);
2003 /* Range of categories (2*16bits), up to 7 pairs */
2005 } else if (tag > 127) {
2006 /* Custom defined DOI */
2009 fin->fin_flx |= FI_BAD;
2013 if (sensitivity > fi->fi_sensitivity)
2014 fi->fi_sensitivity = sensitivity;
2021 /* ------------------------------------------------------------------------ */
2022 /* Function: ipf_makefrip */
2023 /* Returns: int - 0 == packet ok, -1 == packet freed */
2024 /* Parameters: hlen(I) - length of IP packet header */
2025 /* ip(I) - pointer to the IP header */
2026 /* fin(IO) - pointer to packet information */
2028 /* Compact the IP header into a structure which contains just the info. */
2029 /* which is useful for comparing IP headers with and store this information */
2030 /* in the fr_info_t structure pointer to by fin. At present, it is assumed */
2031 /* this function will be called with either an IPv4 or IPv6 packet. */
2032 /* ------------------------------------------------------------------------ */
2034 ipf_makefrip(hlen, ip, fin)
2039 ipf_main_softc_t *softc = fin->fin_main_soft;
2043 fin->fin_hlen = (u_short)hlen;
2045 fin->fin_rule = 0xffffffff;
2046 fin->fin_group[0] = -1;
2047 fin->fin_group[1] = '\0';
2048 fin->fin_dp = (char *)ip + hlen;
2052 fin->fin_plen = ntohs(ip->ip_len);
2053 fin->fin_dlen = fin->fin_plen - hlen;
2054 ipf_pr_ipv4hdr(fin);
2056 } else if (v == 6) {
2057 fin->fin_plen = ntohs(((ip6_t *)ip)->ip6_plen);
2058 fin->fin_dlen = fin->fin_plen;
2059 fin->fin_plen += hlen;
2061 ipf_pr_ipv6hdr(fin);
2064 if (fin->fin_ip == NULL) {
2065 LBUMP(ipf_stats[fin->fin_out].fr_ip_freed);
2072 /* ------------------------------------------------------------------------ */
2073 /* Function: ipf_portcheck */
2074 /* Returns: int - 1 == port matched, 0 == port match failed */
2075 /* Parameters: frp(I) - pointer to port check `expression' */
2076 /* pop(I) - port number to evaluate */
2078 /* Perform a comparison of a port number against some other(s), using a */
2079 /* structure with compare information stored in it. */
2080 /* ------------------------------------------------------------------------ */
2082 ipf_portcheck(frp, pop)
2092 * Do opposite test to that required and continue if that succeeds.
2094 switch (frp->frp_cmp)
2097 if (pop != po) /* EQUAL */
2101 if (pop == po) /* NOTEQUAL */
2105 if (pop >= po) /* LESSTHAN */
2109 if (pop <= po) /* GREATERTHAN */
2113 if (pop > po) /* LT or EQ */
2117 if (pop < po) /* GT or EQ */
2121 if (pop >= po && pop <= frp->frp_top) /* Out of range */
2125 if (pop <= po || pop >= frp->frp_top) /* In range */
2129 if (pop < po || pop > frp->frp_top) /* Inclusive range */
2139 /* ------------------------------------------------------------------------ */
2140 /* Function: ipf_tcpudpchk */
2141 /* Returns: int - 1 == protocol matched, 0 == check failed */
2142 /* Parameters: fda(I) - pointer to packet information */
2143 /* ft(I) - pointer to structure with comparison data */
2145 /* Compares the current pcket (assuming it is TCP/UDP) information with a */
2146 /* structure containing information that we want to match against. */
2147 /* ------------------------------------------------------------------------ */
2149 ipf_tcpudpchk(fi, ft)
2156 * Both ports should *always* be in the first fragment.
2157 * So far, I cannot find any cases where they can not be.
2159 * compare destination ports
2162 err = ipf_portcheck(&ft->ftu_dst, fi->fi_ports[1]);
2165 * compare source ports
2167 if (err && ft->ftu_scmp)
2168 err = ipf_portcheck(&ft->ftu_src, fi->fi_ports[0]);
2171 * If we don't have all the TCP/UDP header, then how can we
2172 * expect to do any sort of match on it ? If we were looking for
2173 * TCP flags, then NO match. If not, then match (which should
2174 * satisfy the "short" class too).
2176 if (err && (fi->fi_p == IPPROTO_TCP)) {
2177 if (fi->fi_flx & FI_SHORT)
2178 return !(ft->ftu_tcpf | ft->ftu_tcpfm);
2180 * Match the flags ? If not, abort this match.
2182 if (ft->ftu_tcpfm &&
2183 ft->ftu_tcpf != (fi->fi_tcpf & ft->ftu_tcpfm)) {
2184 FR_DEBUG(("f. %#x & %#x != %#x\n", fi->fi_tcpf,
2185 ft->ftu_tcpfm, ft->ftu_tcpf));
2193 /* ------------------------------------------------------------------------ */
2194 /* Function: ipf_check_ipf */
2195 /* Returns: int - 0 == match, else no match */
2196 /* Parameters: fin(I) - pointer to packet information */
2197 /* fr(I) - pointer to filter rule */
2198 /* portcmp(I) - flag indicating whether to attempt matching on */
2199 /* TCP/UDP port data. */
2201 /* Check to see if a packet matches an IPFilter rule. Checks of addresses, */
2202 /* port numbers, etc, for "standard" IPFilter rules are all orchestrated in */
2203 /* this function. */
2204 /* ------------------------------------------------------------------------ */
2206 ipf_check_ipf(fin, fr, portcmp)
2211 u_32_t *ld, *lm, *lip;
2219 lm = (u_32_t *)&fri->fri_mip;
2220 ld = (u_32_t *)&fri->fri_ip;
2223 * first 32 bits to check coversion:
2224 * IP version, TOS, TTL, protocol
2226 i = ((*lip & *lm) != *ld);
2227 FR_DEBUG(("0. %#08x & %#08x != %#08x\n",
2228 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2233 * Next 32 bits is a constructed bitmask indicating which IP options
2234 * are present (if any) in this packet.
2237 i = ((*lip & *lm) != *ld);
2238 FR_DEBUG(("1. %#08x & %#08x != %#08x\n",
2239 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2245 * Unrolled loops (4 each, for 32 bits) for address checks.
2248 * Check the source address.
2250 if (fr->fr_satype == FRI_LOOKUP) {
2251 i = (*fr->fr_srcfunc)(fin->fin_main_soft, fr->fr_srcptr,
2252 fi->fi_v, lip, fin->fin_plen);
2259 i = ((*lip & *lm) != *ld);
2260 FR_DEBUG(("2a. %#08x & %#08x != %#08x\n",
2261 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2262 if (fi->fi_v == 6) {
2264 i |= ((*lip & *lm) != *ld);
2265 FR_DEBUG(("2b. %#08x & %#08x != %#08x\n",
2266 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2268 i |= ((*lip & *lm) != *ld);
2269 FR_DEBUG(("2c. %#08x & %#08x != %#08x\n",
2270 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2272 i |= ((*lip & *lm) != *ld);
2273 FR_DEBUG(("2d. %#08x & %#08x != %#08x\n",
2274 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2281 i ^= (fr->fr_flags & FR_NOTSRCIP) >> 6;
2286 * Check the destination address.
2289 if (fr->fr_datype == FRI_LOOKUP) {
2290 i = (*fr->fr_dstfunc)(fin->fin_main_soft, fr->fr_dstptr,
2291 fi->fi_v, lip, fin->fin_plen);
2298 i = ((*lip & *lm) != *ld);
2299 FR_DEBUG(("3a. %#08x & %#08x != %#08x\n",
2300 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2301 if (fi->fi_v == 6) {
2303 i |= ((*lip & *lm) != *ld);
2304 FR_DEBUG(("3b. %#08x & %#08x != %#08x\n",
2305 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2307 i |= ((*lip & *lm) != *ld);
2308 FR_DEBUG(("3c. %#08x & %#08x != %#08x\n",
2309 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2311 i |= ((*lip & *lm) != *ld);
2312 FR_DEBUG(("3d. %#08x & %#08x != %#08x\n",
2313 ntohl(*lip), ntohl(*lm), ntohl(*ld)));
2320 i ^= (fr->fr_flags & FR_NOTDSTIP) >> 7;
2324 * IP addresses matched. The next 32bits contains:
2325 * mast of old IP header security & authentication bits.
2328 i = (*ld - (*lip & *lm));
2329 FR_DEBUG(("4. %#08x & %#08x != %#08x\n", *lip, *lm, *ld));
2332 * Next we have 32 bits of packet flags.
2335 i |= (*ld - (*lip & *lm));
2336 FR_DEBUG(("5. %#08x & %#08x != %#08x\n", *lip, *lm, *ld));
2340 * If a fragment, then only the first has what we're
2341 * looking for here...
2344 if (!ipf_tcpudpchk(&fin->fin_fi, &fr->fr_tuc))
2347 if (fr->fr_dcmp || fr->fr_scmp ||
2348 fr->fr_tcpf || fr->fr_tcpfm)
2350 if (fr->fr_icmpm || fr->fr_icmp) {
2351 if (((fi->fi_p != IPPROTO_ICMP) &&
2352 (fi->fi_p != IPPROTO_ICMPV6)) ||
2353 fin->fin_off || (fin->fin_dlen < 2))
2355 else if ((fin->fin_data[0] & fr->fr_icmpm) !=
2357 FR_DEBUG(("i. %#x & %#x != %#x\n",
2359 fr->fr_icmpm, fr->fr_icmp));
2369 /* ------------------------------------------------------------------------ */
2370 /* Function: ipf_scanlist */
2371 /* Returns: int - result flags of scanning filter list */
2372 /* Parameters: fin(I) - pointer to packet information */
2373 /* pass(I) - default result to return for filtering */
2375 /* Check the input/output list of rules for a match to the current packet. */
2376 /* If a match is found, the value of fr_flags from the rule becomes the */
2377 /* return value and fin->fin_fr points to the matched rule. */
2379 /* This function may be called recusively upto 16 times (limit inbuilt.) */
2380 /* When unwinding, it should finish up with fin_depth as 0. */
2382 /* Could be per interface, but this gets real nasty when you don't have, */
2383 /* or can't easily change, the kernel source code to . */
2384 /* ------------------------------------------------------------------------ */
2386 ipf_scanlist(fin, pass)
2390 ipf_main_softc_t *softc = fin->fin_main_soft;
2391 int rulen, portcmp, off, skip;
2392 struct frentry *fr, *fnext;
2393 u_32_t passt, passo;
2396 * Do not allow nesting deeper than 16 levels.
2398 if (fin->fin_depth >= 16)
2404 * If there are no rules in this list, return now.
2415 if ((fin->fin_flx & FI_TCPUDP) && (fin->fin_dlen > 3) && !off)
2418 for (rulen = 0; fr; fr = fnext, rulen++) {
2419 fnext = fr->fr_next;
2421 FR_VERBOSE(("SKIP %d (%#x)\n", skip, fr->fr_flags));
2427 * In all checks below, a null (zero) value in the
2428 * filter struture is taken to mean a wildcard.
2430 * check that we are working for the right interface
2433 if (fr->fr_ifa && fr->fr_ifa != fin->fin_ifp)
2436 if (opts & (OPT_VERBOSE|OPT_DEBUG))
2438 FR_VERBOSE(("%c", FR_ISSKIP(pass) ? 's' :
2439 FR_ISPASS(pass) ? 'p' :
2440 FR_ISACCOUNT(pass) ? 'A' :
2441 FR_ISAUTH(pass) ? 'a' :
2442 (pass & FR_NOMATCH) ? 'n' :'b'));
2443 if (fr->fr_ifa && fr->fr_ifa != fin->fin_ifp)
2448 switch (fr->fr_type)
2451 case FR_T_IPF_BUILTIN :
2452 if (ipf_check_ipf(fin, fr, portcmp))
2455 #if defined(IPFILTER_BPF)
2457 case FR_T_BPFOPC_BUILTIN :
2462 if (*fin->fin_mp == NULL)
2464 if (fin->fin_family != fr->fr_family)
2466 mc = (u_char *)fin->fin_m;
2467 wlen = fin->fin_dlen + fin->fin_hlen;
2468 if (!bpf_filter(fr->fr_data, mc, wlen, 0))
2473 case FR_T_CALLFUNC_BUILTIN :
2477 f = (*fr->fr_func)(fin, &pass);
2486 case FR_T_IPFEXPR_BUILTIN :
2487 if (fin->fin_family != fr->fr_family)
2489 if (ipf_fr_matcharray(fin, fr->fr_data) == 0)
2497 if ((fin->fin_out == 0) && (fr->fr_nattag.ipt_num[0] != 0)) {
2498 if (fin->fin_nattag == NULL)
2500 if (ipf_matchtag(&fr->fr_nattag, fin->fin_nattag) == 0)
2503 FR_VERBOSE(("=%d/%d.%d *", fr->fr_grhead, fr->fr_group, rulen));
2505 passt = fr->fr_flags;
2508 * If the rule is a "call now" rule, then call the function
2509 * in the rule, if it exists and use the results from that.
2510 * If the function pointer is bad, just make like we ignore
2511 * it, except for increasing the hit counter.
2513 if ((passt & FR_CALLNOW) != 0) {
2516 ATOMIC_INC64(fr->fr_hits);
2517 if ((fr->fr_func == NULL) ||
2518 (fr->fr_func == (ipfunc_t)-1))
2523 fr = (*fr->fr_func)(fin, &passt);
2528 passt = fr->fr_flags;
2534 * Just log this packet...
2536 if ((passt & FR_LOGMASK) == FR_LOG) {
2537 if (ipf_log_pkt(fin, passt) == -1) {
2538 if (passt & FR_LOGORBLOCK) {
2540 passt &= ~FR_CMDMASK;
2541 passt |= FR_BLOCK|FR_QUICK;
2542 fin->fin_reason = FRB_LOGFAIL;
2546 #endif /* IPFILTER_LOG */
2548 MUTEX_ENTER(&fr->fr_lock);
2549 fr->fr_bytes += (U_QUAD_T)fin->fin_plen;
2551 MUTEX_EXIT(&fr->fr_lock);
2552 fin->fin_rule = rulen;
2555 if (FR_ISSKIP(passt)) {
2558 } else if (((passt & FR_LOGMASK) != FR_LOG) &&
2559 ((passt & FR_LOGMASK) != FR_DECAPSULATE)) {
2563 if (passt & (FR_RETICMP|FR_FAKEICMP))
2564 fin->fin_icode = fr->fr_icode;
2566 if (fr->fr_group != -1) {
2567 (void) strncpy(fin->fin_group,
2568 FR_NAME(fr, fr_group),
2569 strlen(FR_NAME(fr, fr_group)));
2571 fin->fin_group[0] = '\0';
2574 FR_DEBUG(("pass %#x/%#x/%x\n", passo, pass, passt));
2576 if (fr->fr_grphead != NULL) {
2577 fin->fin_fr = fr->fr_grphead->fg_start;
2578 FR_VERBOSE(("group %s\n", FR_NAME(fr, fr_grhead)));
2580 if (FR_ISDECAPS(passt))
2581 passt = ipf_decaps(fin, pass, fr->fr_icode);
2583 passt = ipf_scanlist(fin, pass);
2585 if (fin->fin_fr == NULL) {
2586 fin->fin_rule = rulen;
2587 if (fr->fr_group != -1)
2588 (void) strncpy(fin->fin_group,
2591 strlen(fr->fr_names +
2599 if (pass & FR_QUICK) {
2601 * Finally, if we've asked to track state for this
2602 * packet, set it up. Add state for "quick" rules
2603 * here so that if the action fails we can consider
2604 * the rule to "not match" and keep on processing
2607 if ((pass & FR_KEEPSTATE) && !FR_ISAUTH(pass) &&
2608 !(fin->fin_flx & FI_STATE)) {
2609 int out = fin->fin_out;
2612 if (ipf_state_add(softc, fin, NULL, 0) == 0) {
2613 LBUMPD(ipf_stats[out], fr_ads);
2615 LBUMPD(ipf_stats[out], fr_bads);
2628 /* ------------------------------------------------------------------------ */
2629 /* Function: ipf_acctpkt */
2630 /* Returns: frentry_t* - always returns NULL */
2631 /* Parameters: fin(I) - pointer to packet information */
2632 /* passp(IO) - pointer to current/new filter decision (unused) */
2634 /* Checks a packet against accounting rules, if there are any for the given */
2635 /* IP protocol version. */
2637 /* N.B.: this function returns NULL to match the prototype used by other */
2638 /* functions called from the IPFilter "mainline" in ipf_check(). */
2639 /* ------------------------------------------------------------------------ */
2641 ipf_acctpkt(fin, passp)
2645 ipf_main_softc_t *softc = fin->fin_main_soft;
2646 char group[FR_GROUPLEN];
2647 frentry_t *fr, *frsave;
2651 fr = softc->ipf_acct[fin->fin_out][softc->ipf_active];
2654 frsave = fin->fin_fr;
2655 bcopy(fin->fin_group, group, FR_GROUPLEN);
2656 rulen = fin->fin_rule;
2658 pass = ipf_scanlist(fin, FR_NOMATCH);
2659 if (FR_ISACCOUNT(pass)) {
2660 LBUMPD(ipf_stats[0], fr_acct);
2662 fin->fin_fr = frsave;
2663 bcopy(group, fin->fin_group, FR_GROUPLEN);
2664 fin->fin_rule = rulen;
2670 /* ------------------------------------------------------------------------ */
2671 /* Function: ipf_firewall */
2672 /* Returns: frentry_t* - returns pointer to matched rule, if no matches */
2673 /* were found, returns NULL. */
2674 /* Parameters: fin(I) - pointer to packet information */
2675 /* passp(IO) - pointer to current/new filter decision (unused) */
2677 /* Applies an appropriate set of firewall rules to the packet, to see if */
2678 /* there are any matches. The first check is to see if a match can be seen */
2679 /* in the cache. If not, then search an appropriate list of rules. Once a */
2680 /* matching rule is found, take any appropriate actions as defined by the */
2681 /* rule - except logging. */
2682 /* ------------------------------------------------------------------------ */
2684 ipf_firewall(fin, passp)
2688 ipf_main_softc_t *softc = fin->fin_main_soft;
2697 * This rule cache will only affect packets that are not being
2698 * statefully filtered.
2700 fin->fin_fr = softc->ipf_rules[out][softc->ipf_active];
2701 if (fin->fin_fr != NULL)
2702 pass = ipf_scanlist(fin, softc->ipf_pass);
2704 if ((pass & FR_NOMATCH)) {
2705 LBUMPD(ipf_stats[out], fr_nom);
2710 * Apply packets per second rate-limiting to a rule as required.
2712 if ((fr != NULL) && (fr->fr_pps != 0) &&
2713 !ppsratecheck(&fr->fr_lastpkt, &fr->fr_curpps, fr->fr_pps)) {
2714 DT2(frb_ppsrate, fr_info_t *, fin, frentry_t *, fr);
2715 pass &= ~(FR_CMDMASK|FR_RETICMP|FR_RETRST);
2717 LBUMPD(ipf_stats[out], fr_ppshit);
2718 fin->fin_reason = FRB_PPSRATE;
2722 * If we fail to add a packet to the authorization queue, then we
2723 * drop the packet later. However, if it was added then pretend
2724 * we've dropped it already.
2726 if (FR_ISAUTH(pass)) {
2727 if (ipf_auth_new(fin->fin_m, fin) != 0) {
2728 DT1(frb_authnew, fr_info_t *, fin);
2729 fin->fin_m = *fin->fin_mp = NULL;
2730 fin->fin_reason = FRB_AUTHNEW;
2734 fin->fin_error = ENOSPC;
2738 if ((fr != NULL) && (fr->fr_func != NULL) &&
2739 (fr->fr_func != (ipfunc_t)-1) && !(pass & FR_CALLNOW))
2740 (void) (*fr->fr_func)(fin, &pass);
2743 * If a rule is a pre-auth rule, check again in the list of rules
2744 * loaded for authenticated use. It does not particulary matter
2745 * if this search fails because a "preauth" result, from a rule,
2746 * is treated as "not a pass", hence the packet is blocked.
2748 if (FR_ISPREAUTH(pass)) {
2749 pass = ipf_auth_pre_scanlist(softc, fin, pass);
2753 * If the rule has "keep frag" and the packet is actually a fragment,
2754 * then create a fragment state entry.
2756 if (pass & FR_KEEPFRAG) {
2757 if (fin->fin_flx & FI_FRAG) {
2758 if (ipf_frag_new(softc, fin, pass) == -1) {
2759 LBUMP(ipf_stats[out].fr_bnfr);
2761 LBUMP(ipf_stats[out].fr_nfr);
2764 LBUMP(ipf_stats[out].fr_cfr);
2775 /* ------------------------------------------------------------------------ */
2776 /* Function: ipf_check */
2777 /* Returns: int - 0 == packet allowed through, */
2779 /* -1 == packet blocked */
2780 /* 1 == packet not matched */
2781 /* -2 == requires authentication */
2783 /* > 0 == filter error # for packet */
2784 /* Parameters: ip(I) - pointer to start of IPv4/6 packet */
2785 /* hlen(I) - length of header */
2786 /* ifp(I) - pointer to interface this packet is on */
2787 /* out(I) - 0 == packet going in, 1 == packet going out */
2788 /* mp(IO) - pointer to caller's buffer pointer that holds this */
2790 /* Solaris & HP-UX ONLY : */
2791 /* qpi(I) - pointer to STREAMS queue information for this */
2792 /* interface & direction. */
2794 /* ipf_check() is the master function for all IPFilter packet processing. */
2795 /* It orchestrates: Network Address Translation (NAT), checking for packet */
2796 /* authorisation (or pre-authorisation), presence of related state info., */
2797 /* generating log entries, IP packet accounting, routing of packets as */
2798 /* directed by firewall rules and of course whether or not to allow the */
2799 /* packet to be further processed by the kernel. */
2801 /* For packets blocked, the contents of "mp" will be NULL'd and the buffer */
2802 /* freed. Packets passed may be returned with the pointer pointed to by */
2803 /* by "mp" changed to a new buffer. */
2804 /* ------------------------------------------------------------------------ */
2806 ipf_check(ctx, ip, hlen, ifp, out
2807 #if defined(_KERNEL) && defined(MENTAT)
2821 * The above really sucks, but short of writing a diff
2823 ipf_main_softc_t *softc = ctx;
2825 fr_info_t *fin = &frinfo;
2826 u_32_t pass = softc->ipf_pass;
2827 frentry_t *fr = NULL;
2832 * The first part of ipf_check() deals with making sure that what goes
2833 * into the filtering engine makes some sense. Information about the
2834 * the packet is distilled, collected into a fr_info_t structure and
2835 * the an attempt to ensure the buffer the packet is in is big enough
2836 * to hold all the required packet headers.
2840 qpktinfo_t *qpi = qif;
2843 if ((u_int)ip & 0x3)
2850 if (softc->ipf_running <= 0) {
2854 bzero((char *)fin, sizeof(*fin));
2857 if (qpi->qpi_flags & QF_BROADCAST)
2858 fin->fin_flx |= FI_MBCAST|FI_BROADCAST;
2859 if (qpi->qpi_flags & QF_MULTICAST)
2860 fin->fin_flx |= FI_MBCAST|FI_MULTICAST;
2868 # if defined(M_MCAST)
2869 if ((m->m_flags & M_MCAST) != 0)
2870 fin->fin_flx |= FI_MBCAST|FI_MULTICAST;
2872 # if defined(M_MLOOP)
2873 if ((m->m_flags & M_MLOOP) != 0)
2874 fin->fin_flx |= FI_MBCAST|FI_MULTICAST;
2876 # if defined(M_BCAST)
2877 if ((m->m_flags & M_BCAST) != 0)
2878 fin->fin_flx |= FI_MBCAST|FI_BROADCAST;
2880 # ifdef M_CANFASTFWD
2882 * XXX For now, IP Filter and fast-forwarding of cached flows
2883 * XXX are mutually exclusive. Eventually, IP Filter should
2884 * XXX get a "can-fast-forward" filter rule.
2886 m->m_flags &= ~M_CANFASTFWD;
2887 # endif /* M_CANFASTFWD */
2888 # if defined(CSUM_DELAY_DATA) && (!defined(__FreeBSD_version) || \
2889 (__FreeBSD_version < 501108))
2891 * disable delayed checksums.
2893 if (m->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
2894 in_delayed_cksum(m);
2895 m->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
2897 # endif /* CSUM_DELAY_DATA */
2898 # endif /* MENTAT */
2900 bzero((char *)fin, sizeof(*fin));
2902 # if defined(M_MCAST)
2903 if ((m->m_flags & M_MCAST) != 0)
2904 fin->fin_flx |= FI_MBCAST|FI_MULTICAST;
2906 # if defined(M_MLOOP)
2907 if ((m->m_flags & M_MLOOP) != 0)
2908 fin->fin_flx |= FI_MBCAST|FI_MULTICAST;
2910 # if defined(M_BCAST)
2911 if ((m->m_flags & M_BCAST) != 0)
2912 fin->fin_flx |= FI_MBCAST|FI_BROADCAST;
2914 #endif /* _KERNEL */
2922 fin->fin_error = ENETUNREACH;
2923 fin->fin_hlen = (u_short)hlen;
2924 fin->fin_dp = (char *)ip + hlen;
2925 fin->fin_main_soft = softc;
2927 fin->fin_ipoff = (char *)ip - MTOD(m, char *);
2933 LBUMP(ipf_stats[out].fr_ipv6);
2935 * Jumbo grams are quite likely too big for internal buffer
2936 * structures to handle comfortably, for now, so just drop
2939 if (((ip6_t *)ip)->ip6_plen == 0) {
2940 DT1(frb_jumbo, ip6_t *, (ip6_t *)ip);
2941 pass = FR_BLOCK|FR_NOMATCH;
2942 fin->fin_reason = FRB_JUMBO;
2945 fin->fin_family = AF_INET6;
2949 fin->fin_family = AF_INET;
2952 if (ipf_makefrip(hlen, ip, fin) == -1) {
2953 DT1(frb_makefrip, fr_info_t *, fin);
2954 pass = FR_BLOCK|FR_NOMATCH;
2955 fin->fin_reason = FRB_MAKEFRIP;
2960 * For at least IPv6 packets, if a m_pullup() fails then this pointer
2961 * becomes NULL and so we have no packet to free.
2963 if (*fin->fin_mp == NULL)
2968 if (softc->ipf_chksrc && !ipf_verifysrc(fin)) {
2969 LBUMPD(ipf_stats[0], fr_v4_badsrc);
2970 fin->fin_flx |= FI_BADSRC;
2972 if (fin->fin_ip->ip_ttl < softc->ipf_minttl) {
2973 LBUMPD(ipf_stats[0], fr_v4_badttl);
2974 fin->fin_flx |= FI_LOWTTL;
2979 if (((ip6_t *)ip)->ip6_hlim < softc->ipf_minttl) {
2980 LBUMPD(ipf_stats[0], fr_v6_badttl);
2981 fin->fin_flx |= FI_LOWTTL;
2987 if (fin->fin_flx & FI_SHORT) {
2988 LBUMPD(ipf_stats[out], fr_short);
2991 READ_ENTER(&softc->ipf_mutex);
2997 if (ipf_nat_checkin(fin, &pass) == -1) {
3003 if (ipf_nat6_checkin(fin, &pass) == -1) {
3014 * If a packet is found in the auth table, then skip checking
3015 * the access lists for permission but we do need to consider
3016 * the result as if it were from the ACL's. In addition, being
3017 * found in the auth table means it has been seen before, so do
3018 * not pass it through accounting (again), lest it be counted twice.
3020 fr = ipf_auth_check(fin, &pass);
3021 if (!out && (fr == NULL))
3022 (void) ipf_acctpkt(fin, NULL);
3025 if ((fin->fin_flx & FI_FRAG) != 0)
3026 fr = ipf_frag_known(fin, &pass);
3029 fr = ipf_state_check(fin, &pass);
3032 if ((pass & FR_NOMATCH) || (fr == NULL))
3033 fr = ipf_firewall(fin, &pass);
3036 * If we've asked to track state for this packet, set it up.
3037 * Here rather than ipf_firewall because ipf_checkauth may decide
3038 * to return a packet for "keep state"
3040 if ((pass & FR_KEEPSTATE) && (fin->fin_m != NULL) &&
3041 !(fin->fin_flx & FI_STATE)) {
3042 if (ipf_state_add(softc, fin, NULL, 0) == 0) {
3043 LBUMP(ipf_stats[out].fr_ads);
3045 LBUMP(ipf_stats[out].fr_bads);
3046 if (FR_ISPASS(pass)) {
3048 pass &= ~FR_CMDMASK;
3050 fin->fin_reason = FRB_STATEADD;
3056 if ((fr != NULL) && !(fin->fin_flx & FI_STATE)) {
3057 fin->fin_dif = &fr->fr_dif;
3058 fin->fin_tif = &fr->fr_tifs[fin->fin_rev];
3062 * Only count/translate packets which will be passed on, out the
3065 if (out && FR_ISPASS(pass)) {
3066 (void) ipf_acctpkt(fin, NULL);
3071 if (ipf_nat_checkout(fin, &pass) == -1) {
3073 } else if ((softc->ipf_update_ipid != 0) && (v == 4)) {
3074 if (ipf_updateipid(fin) == -1) {
3076 LBUMP(ipf_stats[1].fr_ipud);
3077 pass &= ~FR_CMDMASK;
3079 fin->fin_reason = FRB_UPDATEIPID;
3081 LBUMP(ipf_stats[0].fr_ipud);
3087 (void) ipf_nat6_checkout(fin, &pass);
3097 if ((softc->ipf_flags & FF_LOGGING) || (pass & FR_LOGMASK)) {
3098 (void) ipf_dolog(fin, &pass);
3103 * The FI_STATE flag is cleared here so that calling ipf_state_check
3104 * will work when called from inside of fr_fastroute. Although
3105 * there is a similar flag, FI_NATED, for NAT, it does have the same
3106 * impact on code execution.
3108 fin->fin_flx &= ~FI_STATE;
3110 #if defined(FASTROUTE_RECURSION)
3112 * Up the reference on fr_lock and exit ipf_mutex. The generation of
3113 * a packet below can sometimes cause a recursive call into IPFilter.
3114 * On those platforms where that does happen, we need to hang onto
3115 * the filter rule just in case someone decides to remove or flush it
3119 MUTEX_ENTER(&fr->fr_lock);
3121 MUTEX_EXIT(&fr->fr_lock);
3124 RWLOCK_EXIT(&softc->ipf_mutex);
3127 if ((pass & FR_RETMASK) != 0) {
3129 * Should we return an ICMP packet to indicate error
3130 * status passing through the packet filter ?
3131 * WARNING: ICMP error packets AND TCP RST packets should
3132 * ONLY be sent in repsonse to incoming packets. Sending
3133 * them in response to outbound packets can result in a
3134 * panic on some operating systems.
3137 if (pass & FR_RETICMP) {
3140 if ((pass & FR_RETMASK) == FR_FAKEICMP)
3144 (void) ipf_send_icmp_err(ICMP_UNREACH, fin,
3146 LBUMP(ipf_stats[0].fr_ret);
3147 } else if (((pass & FR_RETMASK) == FR_RETRST) &&
3148 !(fin->fin_flx & FI_SHORT)) {
3149 if (((fin->fin_flx & FI_OOW) != 0) ||
3150 (ipf_send_reset(fin) == 0)) {
3151 LBUMP(ipf_stats[1].fr_ret);
3156 * When using return-* with auth rules, the auth code
3157 * takes over disposing of this packet.
3159 if (FR_ISAUTH(pass) && (fin->fin_m != NULL)) {
3160 DT1(frb_authcapture, fr_info_t *, fin);
3161 fin->fin_m = *fin->fin_mp = NULL;
3162 fin->fin_reason = FRB_AUTHCAPTURE;
3166 if (pass & FR_RETRST) {
3167 fin->fin_error = ECONNRESET;
3173 * After the above so that ICMP unreachables and TCP RSTs get
3176 if (FR_ISBLOCK(pass) && (fin->fin_flx & FI_NEWNAT))
3177 ipf_nat_uncreate(fin);
3180 * If we didn't drop off the bottom of the list of rules (and thus
3181 * the 'current' rule fr is not NULL), then we may have some extra
3182 * instructions about what to do with a packet.
3183 * Once we're finished return to our caller, freeing the packet if
3184 * we are dropping it.
3190 * Generate a duplicated packet first because ipf_fastroute
3191 * can lead to fin_m being free'd... not good.
3194 if ((fdp != NULL) && (fdp->fd_ptr != NULL) &&
3195 (fdp->fd_ptr != (void *)-1)) {
3196 mc = M_COPY(fin->fin_m);
3198 ipf_fastroute(mc, &mc, fin, fdp);
3202 if (!out && (pass & FR_FASTROUTE)) {
3204 * For fastroute rule, no destination interface defined
3205 * so pass NULL as the frdest_t parameter
3207 (void) ipf_fastroute(fin->fin_m, mp, fin, NULL);
3209 } else if ((fdp != NULL) && (fdp->fd_ptr != NULL) &&
3210 (fdp->fd_ptr != (struct ifnet *)-1)) {
3211 /* this is for to rules: */
3212 ipf_fastroute(fin->fin_m, mp, fin, fdp);
3216 #if defined(FASTROUTE_RECURSION)
3217 (void) ipf_derefrule(softc, &fr);
3220 #if !defined(FASTROUTE_RECURSION)
3221 RWLOCK_EXIT(&softc->ipf_mutex);
3225 if (!FR_ISPASS(pass)) {
3226 LBUMP(ipf_stats[out].fr_block);
3234 LBUMP(ipf_stats[out].fr_pass);
3235 #if defined(_KERNEL) && defined(__sgi)
3236 if ((fin->fin_hbuf != NULL) &&
3237 (mtod(fin->fin_m, struct ip *) != fin->fin_ip)) {
3238 COPYBACK(fin->fin_m, 0, fin->fin_plen, fin->fin_hbuf);
3246 if (FR_ISPASS(pass))
3248 LBUMP(ipf_stats[out].fr_blocked[fin->fin_reason]);
3249 return fin->fin_error;
3252 (*mp)->mb_ifp = fin->fin_ifp;
3253 blockreason = fin->fin_reason;
3254 FR_VERBOSE(("fin_flx %#x pass %#x ", fin->fin_flx, pass));
3255 /*if ((pass & FR_CMDMASK) == (softc->ipf_pass & FR_CMDMASK))*/
3256 if ((pass & FR_NOMATCH) != 0)
3259 if ((pass & FR_RETMASK) != 0)
3260 switch (pass & FR_RETMASK)
3270 switch (pass & FR_CMDMASK)
3284 #endif /* _KERNEL */
3289 /* ------------------------------------------------------------------------ */
3290 /* Function: ipf_dolog */
3291 /* Returns: frentry_t* - returns contents of fin_fr (no change made) */
3292 /* Parameters: fin(I) - pointer to packet information */
3293 /* passp(IO) - pointer to current/new filter decision (unused) */
3295 /* Checks flags set to see how a packet should be logged, if it is to be */
3296 /* logged. Adjust statistics based on its success or not. */
3297 /* ------------------------------------------------------------------------ */
3299 ipf_dolog(fin, passp)
3303 ipf_main_softc_t *softc = fin->fin_main_soft;
3310 if ((softc->ipf_flags & FF_LOGNOMATCH) && (pass & FR_NOMATCH)) {
3311 pass |= FF_LOGNOMATCH;
3312 LBUMPD(ipf_stats[out], fr_npkl);
3315 } else if (((pass & FR_LOGMASK) == FR_LOGP) ||
3316 (FR_ISPASS(pass) && (softc->ipf_flags & FF_LOGPASS))) {
3317 if ((pass & FR_LOGMASK) != FR_LOGP)
3319 LBUMPD(ipf_stats[out], fr_ppkl);
3322 } else if (((pass & FR_LOGMASK) == FR_LOGB) ||
3323 (FR_ISBLOCK(pass) && (softc->ipf_flags & FF_LOGBLOCK))) {
3324 if ((pass & FR_LOGMASK) != FR_LOGB)
3325 pass |= FF_LOGBLOCK;
3326 LBUMPD(ipf_stats[out], fr_bpkl);
3329 if (ipf_log_pkt(fin, pass) == -1) {
3331 * If the "or-block" option has been used then
3332 * block the packet if we failed to log it.
3334 if ((pass & FR_LOGORBLOCK) && FR_ISPASS(pass)) {
3335 DT1(frb_logfail2, u_int, pass);
3336 pass &= ~FR_CMDMASK;
3338 fin->fin_reason = FRB_LOGFAIL2;
3346 #endif /* IPFILTER_LOG */
3349 /* ------------------------------------------------------------------------ */
3350 /* Function: ipf_cksum */
3351 /* Returns: u_short - IP header checksum */
3352 /* Parameters: addr(I) - pointer to start of buffer to checksum */
3353 /* len(I) - length of buffer in bytes */
3355 /* Calculate the two's complement 16 bit checksum of the buffer passed. */
3357 /* N.B.: addr should be 16bit aligned. */
3358 /* ------------------------------------------------------------------------ */
3360 ipf_cksum(addr, len)
3366 for (sum = 0; len > 1; len -= 2)
3369 /* mop up an odd byte, if necessary */
3371 sum += *(u_char *)addr;
3374 * add back carry outs from top 16 bits to low 16 bits
3376 sum = (sum >> 16) + (sum & 0xffff); /* add hi 16 to low 16 */
3377 sum += (sum >> 16); /* add carry */
3378 return (u_short)(~sum);
3382 /* ------------------------------------------------------------------------ */
3383 /* Function: fr_cksum */
3384 /* Returns: u_short - layer 4 checksum */
3385 /* Parameters: fin(I) - pointer to packet information */
3386 /* ip(I) - pointer to IP header */
3387 /* l4proto(I) - protocol to caclulate checksum for */
3388 /* l4hdr(I) - pointer to layer 4 header */
3390 /* Calculates the TCP checksum for the packet held in "m", using the data */
3391 /* in the IP header "ip" to seed it. */
3393 /* NB: This function assumes we've pullup'd enough for all of the IP header */
3394 /* and the TCP header. We also assume that data blocks aren't allocated in */
3397 /* Expects ip_len and ip_off to be in network byte order when called. */
3398 /* ------------------------------------------------------------------------ */
3400 fr_cksum(fin, ip, l4proto, l4hdr)
3406 u_short *sp, slen, sumsave, *csump;
3421 sum = htons((u_short)l4proto);
3423 * Add up IP Header portion
3426 if (IP_V(ip) == 4) {
3428 hlen = IP_HL(ip) << 2;
3430 sp = (u_short *)&ip->ip_src;
3431 sum += *sp++; /* ip_src */
3433 sum += *sp++; /* ip_dst */
3436 } else if (IP_V(ip) == 6) {
3438 hlen = sizeof(*ip6);
3439 off = ((char *)fin->fin_dp - (char *)fin->fin_ip);
3440 sp = (u_short *)&ip6->ip6_src;
3441 sum += *sp++; /* ip6_src */
3449 /* This needs to be routing header aware. */
3450 sum += *sp++; /* ip6_dst */
3462 slen = fin->fin_plen - off;
3468 csump = &((udphdr_t *)l4hdr)->uh_sum;
3472 csump = &((tcphdr_t *)l4hdr)->th_sum;
3475 csump = &((icmphdr_t *)l4hdr)->icmp_cksum;
3476 sum = 0; /* Pseudo-checksum is not included */
3479 case IPPROTO_ICMPV6 :
3480 csump = &((struct icmp6_hdr *)l4hdr)->icmp6_cksum;
3487 if (csump != NULL) {
3492 sum2 = ipf_pcksum(fin, off, sum);
3499 /* ------------------------------------------------------------------------ */
3500 /* Function: ipf_findgroup */
3501 /* Returns: frgroup_t * - NULL = group not found, else pointer to group */
3502 /* Parameters: softc(I) - pointer to soft context main structure */
3503 /* group(I) - group name to search for */
3504 /* unit(I) - device to which this group belongs */
3505 /* set(I) - which set of rules (inactive/inactive) this is */
3506 /* fgpp(O) - pointer to place to store pointer to the pointer */
3507 /* to where to add the next (last) group or where */
3508 /* to delete group from. */
3510 /* Search amongst the defined groups for a particular group number. */
3511 /* ------------------------------------------------------------------------ */
3513 ipf_findgroup(softc, group, unit, set, fgpp)
3514 ipf_main_softc_t *softc;
3520 frgroup_t *fg, **fgp;
3523 * Which list of groups to search in is dependent on which list of
3524 * rules are being operated on.
3526 fgp = &softc->ipf_groups[unit][set];
3528 while ((fg = *fgp) != NULL) {
3529 if (strncmp(group, fg->fg_name, FR_GROUPLEN) == 0)
3540 /* ------------------------------------------------------------------------ */
3541 /* Function: ipf_group_add */
3542 /* Returns: frgroup_t * - NULL == did not create group, */
3543 /* != NULL == pointer to the group */
3544 /* Parameters: softc(I) - pointer to soft context main structure */
3545 /* num(I) - group number to add */
3546 /* head(I) - rule pointer that is using this as the head */
3547 /* flags(I) - rule flags which describe the type of rule it is */
3548 /* unit(I) - device to which this group will belong to */
3549 /* set(I) - which set of rules (inactive/inactive) this is */
3550 /* Write Locks: ipf_mutex */
3552 /* Add a new group head, or if it already exists, increase the reference */
3554 /* ------------------------------------------------------------------------ */
3556 ipf_group_add(softc, group, head, flags, unit, set)
3557 ipf_main_softc_t *softc;
3564 frgroup_t *fg, **fgp;
3570 if (unit == IPL_LOGIPF && *group == '\0')
3574 gflags = flags & FR_INOUT;
3576 fg = ipf_findgroup(softc, group, unit, set, &fgp);
3578 if (fg->fg_head == NULL && head != NULL)
3580 if (fg->fg_flags == 0)
3581 fg->fg_flags = gflags;
3582 else if (gflags != fg->fg_flags)
3588 KMALLOC(fg, frgroup_t *);
3591 fg->fg_start = NULL;
3593 bcopy(group, fg->fg_name, strlen(group) + 1);
3594 fg->fg_flags = gflags;
3596 fg->fg_set = &softc->ipf_groups[unit][set];
3603 /* ------------------------------------------------------------------------ */
3604 /* Function: ipf_group_del */
3605 /* Returns: int - number of rules deleted */
3606 /* Parameters: softc(I) - pointer to soft context main structure */
3607 /* group(I) - group name to delete */
3608 /* fr(I) - filter rule from which group is referenced */
3609 /* Write Locks: ipf_mutex */
3611 /* This function is called whenever a reference to a group is to be dropped */
3612 /* and thus its reference count needs to be lowered and the group free'd if */
3613 /* the reference count reaches zero. Passing in fr is really for the sole */
3614 /* purpose of knowing when the head rule is being deleted. */
3615 /* ------------------------------------------------------------------------ */
3617 ipf_group_del(softc, group, fr)
3618 ipf_main_softc_t *softc;
3623 if (group->fg_head == fr)
3624 group->fg_head = NULL;
3627 if ((group->fg_ref == 0) && (group->fg_start == NULL))
3628 ipf_group_free(group);
3632 /* ------------------------------------------------------------------------ */
3633 /* Function: ipf_group_free */
3635 /* Parameters: group(I) - pointer to filter rule group */
3637 /* Remove the group from the list of groups and free it. */
3638 /* ------------------------------------------------------------------------ */
3640 ipf_group_free(group)
3645 for (gp = group->fg_set; *gp != NULL; gp = &(*gp)->fg_next) {
3647 *gp = group->fg_next;
3655 /* ------------------------------------------------------------------------ */
3656 /* Function: ipf_group_flush */
3657 /* Returns: int - number of rules flush from group */
3658 /* Parameters: softc(I) - pointer to soft context main structure */
3659 /* Parameters: group(I) - pointer to filter rule group */
3661 /* Remove all of the rules that currently are listed under the given group. */
3662 /* ------------------------------------------------------------------------ */
3664 ipf_group_flush(softc, group)
3665 ipf_main_softc_t *softc;
3670 (void) ipf_flushlist(softc, &gone, &group->fg_start);
3676 /* ------------------------------------------------------------------------ */
3677 /* Function: ipf_getrulen */
3678 /* Returns: frentry_t * - NULL == not found, else pointer to rule n */
3679 /* Parameters: softc(I) - pointer to soft context main structure */
3680 /* Parameters: unit(I) - device for which to count the rule's number */
3681 /* flags(I) - which set of rules to find the rule in */
3682 /* group(I) - group name */
3683 /* n(I) - rule number to find */
3685 /* Find rule # n in group # g and return a pointer to it. Return NULl if */
3686 /* group # g doesn't exist or there are less than n rules in the group. */
3687 /* ------------------------------------------------------------------------ */
3689 ipf_getrulen(softc, unit, group, n)
3690 ipf_main_softc_t *softc;
3698 fg = ipf_findgroup(softc, group, unit, softc->ipf_active, NULL);
3701 for (fr = fg->fg_start; fr && n; fr = fr->fr_next, n--)
3709 /* ------------------------------------------------------------------------ */
3710 /* Function: ipf_flushlist */
3711 /* Returns: int - >= 0 - number of flushed rules */
3712 /* Parameters: softc(I) - pointer to soft context main structure */
3713 /* nfreedp(O) - pointer to int where flush count is stored */
3714 /* listp(I) - pointer to list to flush pointer */
3715 /* Write Locks: ipf_mutex */
3717 /* Recursively flush rules from the list, descending groups as they are */
3718 /* encountered. if a rule is the head of a group and it has lost all its */
3719 /* group members, then also delete the group reference. nfreedp is needed */
3720 /* to store the accumulating count of rules removed, whereas the returned */
3721 /* value is just the number removed from the current list. The latter is */
3722 /* needed to correctly adjust reference counts on rules that define groups. */
3724 /* NOTE: Rules not loaded from user space cannot be flushed. */
3725 /* ------------------------------------------------------------------------ */
3727 ipf_flushlist(softc, nfreedp, listp)
3728 ipf_main_softc_t *softc;
3735 while ((fp = *listp) != NULL) {
3736 if ((fp->fr_type & FR_T_BUILTIN) ||
3737 !(fp->fr_flags & FR_COPIED)) {
3738 listp = &fp->fr_next;
3741 *listp = fp->fr_next;
3742 if (fp->fr_next != NULL)
3743 fp->fr_next->fr_pnext = fp->fr_pnext;
3744 fp->fr_pnext = NULL;
3746 if (fp->fr_grphead != NULL) {
3747 freed += ipf_group_flush(softc, fp->fr_grphead);
3748 fp->fr_names[fp->fr_grhead] = '\0';
3751 if (fp->fr_icmpgrp != NULL) {
3752 freed += ipf_group_flush(softc, fp->fr_icmpgrp);
3753 fp->fr_names[fp->fr_icmphead] = '\0';
3756 if (fp->fr_srctrack.ht_max_nodes)
3757 ipf_rb_ht_flush(&fp->fr_srctrack);
3761 ASSERT(fp->fr_ref > 0);
3762 if (ipf_derefrule(softc, &fp) == 0)
3770 /* ------------------------------------------------------------------------ */
3771 /* Function: ipf_flush */
3772 /* Returns: int - >= 0 - number of flushed rules */
3773 /* Parameters: softc(I) - pointer to soft context main structure */
3774 /* unit(I) - device for which to flush rules */
3775 /* flags(I) - which set of rules to flush */
3777 /* Calls flushlist() for all filter rules (accounting, firewall - both IPv4 */
3778 /* and IPv6) as defined by the value of flags. */
3779 /* ------------------------------------------------------------------------ */
3781 ipf_flush(softc, unit, flags)
3782 ipf_main_softc_t *softc;
3786 int flushed = 0, set;
3788 WRITE_ENTER(&softc->ipf_mutex);
3790 set = softc->ipf_active;
3791 if ((flags & FR_INACTIVE) == FR_INACTIVE)
3794 if (flags & FR_OUTQUE) {
3795 ipf_flushlist(softc, &flushed, &softc->ipf_rules[1][set]);
3796 ipf_flushlist(softc, &flushed, &softc->ipf_acct[1][set]);
3798 if (flags & FR_INQUE) {
3799 ipf_flushlist(softc, &flushed, &softc->ipf_rules[0][set]);
3800 ipf_flushlist(softc, &flushed, &softc->ipf_acct[0][set]);
3803 flushed += ipf_flush_groups(softc, &softc->ipf_groups[unit][set],
3804 flags & (FR_INQUE|FR_OUTQUE));
3806 RWLOCK_EXIT(&softc->ipf_mutex);
3808 if (unit == IPL_LOGIPF) {
3811 tmp = ipf_flush(softc, IPL_LOGCOUNT, flags);
3819 /* ------------------------------------------------------------------------ */
3820 /* Function: ipf_flush_groups */
3821 /* Returns: int - >= 0 - number of flushed rules */
3822 /* Parameters: softc(I) - soft context pointerto work with */
3823 /* grhead(I) - pointer to the start of the group list to flush */
3824 /* flags(I) - which set of rules to flush */
3826 /* Walk through all of the groups under the given group head and remove all */
3827 /* of those that match the flags passed in. The for loop here is bit more */
3828 /* complicated than usual because the removal of a rule with ipf_derefrule */
3829 /* may end up removing not only the structure pointed to by "fg" but also */
3830 /* what is fg_next and fg_next after that. So if a filter rule is actually */
3831 /* removed from the group then it is necessary to start again. */
3832 /* ------------------------------------------------------------------------ */
3834 ipf_flush_groups(softc, grhead, flags)
3835 ipf_main_softc_t *softc;
3839 frentry_t *fr, **frp;
3840 frgroup_t *fg, **fgp;
3844 for (fgp = grhead; (fg = *fgp) != NULL; ) {
3845 while ((fg != NULL) && ((fg->fg_flags & flags) == 0))
3850 frp = &fg->fg_start;
3851 while ((removed == 0) && ((fr = *frp) != NULL)) {
3852 if ((fr->fr_flags & flags) == 0) {
3855 if (fr->fr_next != NULL)
3856 fr->fr_next->fr_pnext = fr->fr_pnext;
3858 fr->fr_pnext = NULL;
3860 (void) ipf_derefrule(softc, &fr);
3872 /* ------------------------------------------------------------------------ */
3873 /* Function: memstr */
3874 /* Returns: char * - NULL if failed, != NULL pointer to matching bytes */
3875 /* Parameters: src(I) - pointer to byte sequence to match */
3876 /* dst(I) - pointer to byte sequence to search */
3877 /* slen(I) - match length */
3878 /* dlen(I) - length available to search in */
3880 /* Search dst for a sequence of bytes matching those at src and extend for */
3882 /* ------------------------------------------------------------------------ */
3884 memstr(src, dst, slen, dlen)
3891 while (dlen >= slen) {
3892 if (bcmp(src, dst, slen) == 0) {
3901 /* ------------------------------------------------------------------------ */
3902 /* Function: ipf_fixskip */
3904 /* Parameters: listp(IO) - pointer to start of list with skip rule */
3905 /* rp(I) - rule added/removed with skip in it. */
3906 /* addremove(I) - adjustment (-1/+1) to make to skip count, */
3907 /* depending on whether a rule was just added */
3910 /* Adjust all the rules in a list which would have skip'd past the position */
3911 /* where we are inserting to skip to the right place given the change. */
3912 /* ------------------------------------------------------------------------ */
3914 ipf_fixskip(listp, rp, addremove)
3915 frentry_t **listp, *rp;
3922 for (fp = *listp; (fp != NULL) && (fp != rp); fp = fp->fr_next)
3928 for (rn = 0, fp = *listp; fp && (fp != rp); fp = fp->fr_next, rn++)
3929 if (FR_ISSKIP(fp->fr_flags) && (rn + fp->fr_arg >= rules))
3930 fp->fr_arg += addremove;
3935 /* ------------------------------------------------------------------------ */
3936 /* Function: count4bits */
3937 /* Returns: int - >= 0 - number of consecutive bits in input */
3938 /* Parameters: ip(I) - 32bit IP address */
3941 /* count consecutive 1's in bit mask. If the mask generated by counting */
3942 /* consecutive 1's is different to that passed, return -1, else return # */
3944 /* ------------------------------------------------------------------------ */
3952 ip = ipn = ntohl(ip);
3953 for (i = 32; i; i--, ipn *= 2)
3954 if (ipn & 0x80000000)
3959 for (i = 32, j = cnt; i; i--, j--) {
3970 /* ------------------------------------------------------------------------ */
3971 /* Function: count6bits */
3972 /* Returns: int - >= 0 - number of consecutive bits in input */
3973 /* Parameters: msk(I) - pointer to start of IPv6 bitmask */
3976 /* count consecutive 1's in bit mask. */
3977 /* ------------------------------------------------------------------------ */
3986 for (k = 3; k >= 0; k--)
3987 if (msk[k] == 0xffffffff)
3990 for (j = msk[k]; j; j <<= 1)
3997 #endif /* _KERNEL */
4000 /* ------------------------------------------------------------------------ */
4001 /* Function: ipf_synclist */
4002 /* Returns: int - 0 = no failures, else indication of first failure */
4003 /* Parameters: fr(I) - start of filter list to sync interface names for */
4004 /* ifp(I) - interface pointer for limiting sync lookups */
4005 /* Write Locks: ipf_mutex */
4007 /* Walk through a list of filter rules and resolve any interface names into */
4008 /* pointers. Where dynamic addresses are used, also update the IP address */
4009 /* used in the rule. The interface pointer is used to limit the lookups to */
4010 /* a specific set of matching names if it is non-NULL. */
4011 /* Errors can occur when resolving the destination name of to/dup-to fields */
4012 /* when the name points to a pool and that pool doest not exist. If this */
4013 /* does happen then it is necessary to check if there are any lookup refs */
4014 /* that need to be dropped before returning with an error. */
4015 /* ------------------------------------------------------------------------ */
4017 ipf_synclist(softc, fr, ifp)
4018 ipf_main_softc_t *softc;
4022 frentry_t *frt, *start = fr;
4031 for (; fr; fr = fr->fr_next) {
4032 if (fr->fr_family == AF_INET)
4034 else if (fr->fr_family == AF_INET6)
4040 * Lookup all the interface names that are part of the rule.
4042 for (i = 0; i < 4; i++) {
4043 if ((ifp != NULL) && (fr->fr_ifas[i] != ifp))
4045 if (fr->fr_ifnames[i] == -1)
4047 name = FR_NAME(fr, fr_ifnames[i]);
4048 fr->fr_ifas[i] = ipf_resolvenic(softc, name, v);
4051 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) {
4052 if (fr->fr_satype != FRI_NORMAL &&
4053 fr->fr_satype != FRI_LOOKUP) {
4054 ifa = ipf_resolvenic(softc, fr->fr_names +
4056 ipf_ifpaddr(softc, v, fr->fr_satype, ifa,
4057 &fr->fr_src6, &fr->fr_smsk6);
4059 if (fr->fr_datype != FRI_NORMAL &&
4060 fr->fr_datype != FRI_LOOKUP) {
4061 ifa = ipf_resolvenic(softc, fr->fr_names +
4063 ipf_ifpaddr(softc, v, fr->fr_datype, ifa,
4064 &fr->fr_dst6, &fr->fr_dmsk6);
4068 fdp = &fr->fr_tifs[0];
4069 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) {
4070 error = ipf_resolvedest(softc, fr->fr_names, fdp, v);
4075 fdp = &fr->fr_tifs[1];
4076 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) {
4077 error = ipf_resolvedest(softc, fr->fr_names, fdp, v);
4083 if ((ifp == NULL) || (fdp->fd_ptr == ifp)) {
4084 error = ipf_resolvedest(softc, fr->fr_names, fdp, v);
4089 if (((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) &&
4090 (fr->fr_satype == FRI_LOOKUP) && (fr->fr_srcptr == NULL)) {
4091 fr->fr_srcptr = ipf_lookup_res_num(softc,
4097 if (((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) &&
4098 (fr->fr_datype == FRI_LOOKUP) && (fr->fr_dstptr == NULL)) {
4099 fr->fr_dstptr = ipf_lookup_res_num(softc,
4109 for (frt = start; frt != fr; fr = fr->fr_next) {
4110 if (((frt->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) &&
4111 (frt->fr_satype == FRI_LOOKUP) && (frt->fr_srcptr != NULL))
4112 ipf_lookup_deref(softc, frt->fr_srctype,
4114 if (((frt->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) &&
4115 (frt->fr_datype == FRI_LOOKUP) && (frt->fr_dstptr != NULL))
4116 ipf_lookup_deref(softc, frt->fr_dsttype,
4123 /* ------------------------------------------------------------------------ */
4124 /* Function: ipf_sync */
4126 /* Parameters: Nil */
4128 /* ipf_sync() is called when we suspect that the interface list or */
4129 /* information about interfaces (like IP#) has changed. Go through all */
4130 /* filter rules, NAT entries and the state table and check if anything */
4131 /* needs to be changed/updated. */
4132 /* ------------------------------------------------------------------------ */
4134 ipf_sync(softc, ifp)
4135 ipf_main_softc_t *softc;
4141 ipf_nat_sync(softc, ifp);
4142 ipf_state_sync(softc, ifp);
4143 ipf_lookup_sync(softc, ifp);
4146 WRITE_ENTER(&softc->ipf_mutex);
4147 (void) ipf_synclist(softc, softc->ipf_acct[0][softc->ipf_active], ifp);
4148 (void) ipf_synclist(softc, softc->ipf_acct[1][softc->ipf_active], ifp);
4149 (void) ipf_synclist(softc, softc->ipf_rules[0][softc->ipf_active], ifp);
4150 (void) ipf_synclist(softc, softc->ipf_rules[1][softc->ipf_active], ifp);
4152 for (i = 0; i < IPL_LOGSIZE; i++) {
4155 for (g = softc->ipf_groups[i][0]; g != NULL; g = g->fg_next)
4156 (void) ipf_synclist(softc, g->fg_start, ifp);
4157 for (g = softc->ipf_groups[i][1]; g != NULL; g = g->fg_next)
4158 (void) ipf_synclist(softc, g->fg_start, ifp);
4160 RWLOCK_EXIT(&softc->ipf_mutex);
4167 * In the functions below, bcopy() is called because the pointer being
4168 * copied _from_ in this instance is a pointer to a char buf (which could
4169 * end up being unaligned) and on the kernel's local stack.
4171 /* ------------------------------------------------------------------------ */
4172 /* Function: copyinptr */
4173 /* Returns: int - 0 = success, else failure */
4174 /* Parameters: src(I) - pointer to the source address */
4175 /* dst(I) - destination address */
4176 /* size(I) - number of bytes to copy */
4178 /* Copy a block of data in from user space, given a pointer to the pointer */
4179 /* to start copying from (src) and a pointer to where to store it (dst). */
4180 /* NB: src - pointer to user space pointer, dst - kernel space pointer */
4181 /* ------------------------------------------------------------------------ */
4183 copyinptr(softc, src, dst, size)
4184 ipf_main_softc_t *softc;
4192 error = COPYIN(src, &ca, sizeof(ca));
4196 bcopy(src, (caddr_t)&ca, sizeof(ca));
4198 error = COPYIN(ca, dst, size);
4207 /* ------------------------------------------------------------------------ */
4208 /* Function: copyoutptr */
4209 /* Returns: int - 0 = success, else failure */
4210 /* Parameters: src(I) - pointer to the source address */
4211 /* dst(I) - destination address */
4212 /* size(I) - number of bytes to copy */
4214 /* Copy a block of data out to user space, given a pointer to the pointer */
4215 /* to start copying from (src) and a pointer to where to store it (dst). */
4216 /* NB: src - kernel space pointer, dst - pointer to user space pointer. */
4217 /* ------------------------------------------------------------------------ */
4219 copyoutptr(softc, src, dst, size)
4220 ipf_main_softc_t *softc;
4227 bcopy(dst, (caddr_t)&ca, sizeof(ca));
4228 error = COPYOUT(src, ca, size);
4237 /* ------------------------------------------------------------------------ */
4238 /* Function: ipf_lock */
4239 /* Returns: int - 0 = success, else error */
4240 /* Parameters: data(I) - pointer to lock value to set */
4241 /* lockp(O) - pointer to location to store old lock value */
4243 /* Get the new value for the lock integer, set it and return the old value */
4245 /* ------------------------------------------------------------------------ */
4247 ipf_lock(data, lockp)
4253 err = BCOPYIN(data, &arg, sizeof(arg));
4256 err = BCOPYOUT(lockp, data, sizeof(*lockp));
4264 /* ------------------------------------------------------------------------ */
4265 /* Function: ipf_getstat */
4267 /* Parameters: softc(I) - pointer to soft context main structure */
4268 /* fiop(I) - pointer to ipfilter stats structure */
4269 /* rev(I) - version claim by program doing ioctl */
4271 /* Stores a copy of current pointers, counters, etc, in the friostat */
4273 /* If IPFILTER_COMPAT is compiled, we pretend to be whatever version the */
4274 /* program is looking for. This ensure that validation of the version it */
4275 /* expects will always succeed. Thus kernels with IPFILTER_COMPAT will */
4276 /* allow older binaries to work but kernels without it will not. */
4277 /* ------------------------------------------------------------------------ */
4280 ipf_getstat(softc, fiop, rev)
4281 ipf_main_softc_t *softc;
4287 bcopy((char *)softc->ipf_stats, (char *)fiop->f_st,
4288 sizeof(ipf_statistics_t) * 2);
4289 fiop->f_locks[IPL_LOGSTATE] = -1;
4290 fiop->f_locks[IPL_LOGNAT] = -1;
4291 fiop->f_locks[IPL_LOGIPF] = -1;
4292 fiop->f_locks[IPL_LOGAUTH] = -1;
4294 fiop->f_ipf[0][0] = softc->ipf_rules[0][0];
4295 fiop->f_acct[0][0] = softc->ipf_acct[0][0];
4296 fiop->f_ipf[0][1] = softc->ipf_rules[0][1];
4297 fiop->f_acct[0][1] = softc->ipf_acct[0][1];
4298 fiop->f_ipf[1][0] = softc->ipf_rules[1][0];
4299 fiop->f_acct[1][0] = softc->ipf_acct[1][0];
4300 fiop->f_ipf[1][1] = softc->ipf_rules[1][1];
4301 fiop->f_acct[1][1] = softc->ipf_acct[1][1];
4303 fiop->f_ticks = softc->ipf_ticks;
4304 fiop->f_active = softc->ipf_active;
4305 fiop->f_froute[0] = softc->ipf_frouteok[0];
4306 fiop->f_froute[1] = softc->ipf_frouteok[1];
4307 fiop->f_rb_no_mem = softc->ipf_rb_no_mem;
4308 fiop->f_rb_node_max = softc->ipf_rb_node_max;
4310 fiop->f_running = softc->ipf_running;
4311 for (i = 0; i < IPL_LOGSIZE; i++) {
4312 fiop->f_groups[i][0] = softc->ipf_groups[i][0];
4313 fiop->f_groups[i][1] = softc->ipf_groups[i][1];
4316 fiop->f_log_ok = ipf_log_logok(softc, IPL_LOGIPF);
4317 fiop->f_log_fail = ipf_log_failures(softc, IPL_LOGIPF);
4318 fiop->f_logging = 1;
4321 fiop->f_log_fail = 0;
4322 fiop->f_logging = 0;
4324 fiop->f_defpass = softc->ipf_pass;
4325 fiop->f_features = ipf_features;
4327 #ifdef IPFILTER_COMPAT
4328 sprintf(fiop->f_version, "IP Filter: v%d.%d.%d",
4329 (rev / 1000000) % 100,
4330 (rev / 10000) % 100,
4334 (void) strncpy(fiop->f_version, ipfilter_version,
4335 sizeof(fiop->f_version));
4341 int icmptoicmp6types[ICMP_MAXTYPE+1] = {
4342 ICMP6_ECHO_REPLY, /* 0: ICMP_ECHOREPLY */
4345 ICMP6_DST_UNREACH, /* 3: ICMP_UNREACH */
4346 -1, /* 4: ICMP_SOURCEQUENCH */
4347 ND_REDIRECT, /* 5: ICMP_REDIRECT */
4350 ICMP6_ECHO_REQUEST, /* 8: ICMP_ECHO */
4352 -1, /* 10: UNUSED */
4353 ICMP6_TIME_EXCEEDED, /* 11: ICMP_TIMXCEED */
4354 ICMP6_PARAM_PROB, /* 12: ICMP_PARAMPROB */
4355 -1, /* 13: ICMP_TSTAMP */
4356 -1, /* 14: ICMP_TSTAMPREPLY */
4357 -1, /* 15: ICMP_IREQ */
4358 -1, /* 16: ICMP_IREQREPLY */
4359 -1, /* 17: ICMP_MASKREQ */
4360 -1, /* 18: ICMP_MASKREPLY */
4364 int icmptoicmp6unreach[ICMP_MAX_UNREACH] = {
4365 ICMP6_DST_UNREACH_ADDR, /* 0: ICMP_UNREACH_NET */
4366 ICMP6_DST_UNREACH_ADDR, /* 1: ICMP_UNREACH_HOST */
4367 -1, /* 2: ICMP_UNREACH_PROTOCOL */
4368 ICMP6_DST_UNREACH_NOPORT, /* 3: ICMP_UNREACH_PORT */
4369 -1, /* 4: ICMP_UNREACH_NEEDFRAG */
4370 ICMP6_DST_UNREACH_NOTNEIGHBOR, /* 5: ICMP_UNREACH_SRCFAIL */
4371 ICMP6_DST_UNREACH_ADDR, /* 6: ICMP_UNREACH_NET_UNKNOWN */
4372 ICMP6_DST_UNREACH_ADDR, /* 7: ICMP_UNREACH_HOST_UNKNOWN */
4373 -1, /* 8: ICMP_UNREACH_ISOLATED */
4374 ICMP6_DST_UNREACH_ADMIN, /* 9: ICMP_UNREACH_NET_PROHIB */
4375 ICMP6_DST_UNREACH_ADMIN, /* 10: ICMP_UNREACH_HOST_PROHIB */
4376 -1, /* 11: ICMP_UNREACH_TOSNET */
4377 -1, /* 12: ICMP_UNREACH_TOSHOST */
4378 ICMP6_DST_UNREACH_ADMIN, /* 13: ICMP_UNREACH_ADMIN_PROHIBIT */
4380 int icmpreplytype6[ICMP6_MAXTYPE + 1];
4383 int icmpreplytype4[ICMP_MAXTYPE + 1];
4386 /* ------------------------------------------------------------------------ */
4387 /* Function: ipf_matchicmpqueryreply */
4388 /* Returns: int - 1 if "icmp" is a valid reply to "ic" else 0. */
4389 /* Parameters: v(I) - IP protocol version (4 or 6) */
4390 /* ic(I) - ICMP information */
4391 /* icmp(I) - ICMP packet header */
4392 /* rev(I) - direction (0 = forward/1 = reverse) of packet */
4394 /* Check if the ICMP packet defined by the header pointed to by icmp is a */
4395 /* reply to one as described by what's in ic. If it is a match, return 1, */
4396 /* else return 0 for no match. */
4397 /* ------------------------------------------------------------------------ */
4399 ipf_matchicmpqueryreply(v, ic, icmp, rev)
4407 ictype = ic->ici_type;
4411 * If we matched its type on the way in, then when going out
4412 * it will still be the same type.
4414 if ((!rev && (icmp->icmp_type == ictype)) ||
4415 (rev && (icmpreplytype4[ictype] == icmp->icmp_type))) {
4416 if (icmp->icmp_type != ICMP_ECHOREPLY)
4418 if (icmp->icmp_id == ic->ici_id)
4424 if ((!rev && (icmp->icmp_type == ictype)) ||
4425 (rev && (icmpreplytype6[ictype] == icmp->icmp_type))) {
4426 if (icmp->icmp_type != ICMP6_ECHO_REPLY)
4428 if (icmp->icmp_id == ic->ici_id)
4437 /* ------------------------------------------------------------------------ */
4438 /* Function: ipf_rule_compare */
4439 /* Parameters: fr1(I) - first rule structure to compare */
4440 /* fr2(I) - second rule structure to compare */
4441 /* Returns: int - 0 == rules are the same, else mismatch */
4443 /* Compare two rules and return 0 if they match or a number indicating */
4444 /* which of the individual checks failed. */
4445 /* ------------------------------------------------------------------------ */
4447 ipf_rule_compare(frentry_t *fr1, frentry_t *fr2)
4449 if (fr1->fr_cksum != fr2->fr_cksum)
4451 if (fr1->fr_size != fr2->fr_size)
4453 if (fr1->fr_dsize != fr2->fr_dsize)
4455 if (bcmp((char *)&fr1->fr_func, (char *)&fr2->fr_func,
4456 fr1->fr_size - offsetof(struct frentry, fr_func)) != 0)
4458 if (fr1->fr_data && !fr2->fr_data)
4460 if (!fr1->fr_data && fr2->fr_data)
4463 if (bcmp(fr1->fr_caddr, fr2->fr_caddr, fr1->fr_dsize))
4470 /* ------------------------------------------------------------------------ */
4471 /* Function: frrequest */
4472 /* Returns: int - 0 == success, > 0 == errno value */
4473 /* Parameters: unit(I) - device for which this is for */
4474 /* req(I) - ioctl command (SIOC*) */
4475 /* data(I) - pointr to ioctl data */
4476 /* set(I) - 1 or 0 (filter set) */
4477 /* makecopy(I) - flag indicating whether data points to a rule */
4478 /* in kernel space & hence doesn't need copying. */
4480 /* This function handles all the requests which operate on the list of */
4481 /* filter rules. This includes adding, deleting, insertion. It is also */
4482 /* responsible for creating groups when a "head" rule is loaded. Interface */
4483 /* names are resolved here and other sanity checks are made on the content */
4484 /* of the rule structure being loaded. If a rule has user defined timeouts */
4485 /* then make sure they are created and initialised before exiting. */
4486 /* ------------------------------------------------------------------------ */
4488 frrequest(softc, unit, req, data, set, makecopy)
4489 ipf_main_softc_t *softc;
4495 int error = 0, in, family, addrem, need_free = 0;
4496 frentry_t frd, *fp, *f, **fprev, **ftail;
4497 void *ptr, *uptr, *cptr;
4506 if (makecopy != 0) {
4507 bzero(fp, sizeof(frd));
4508 error = ipf_inobj(softc, data, NULL, fp, IPFOBJ_FRENTRY);
4512 if ((fp->fr_type & FR_T_BUILTIN) != 0) {
4516 KMALLOCS(f, frentry_t *, fp->fr_size);
4521 bzero(f, fp->fr_size);
4522 error = ipf_inobjsz(softc, data, f, IPFOBJ_FRENTRY,
4525 KFREES(f, fp->fr_size);
4532 fp->fr_dnext = NULL;
4533 fp->fr_pnext = NULL;
4534 fp->fr_pdnext = NULL;
4536 fp->fr_grphead = NULL;
4537 fp->fr_icmpgrp = NULL;
4538 fp->fr_isc = (void *)-1;
4541 fp->fr_flags |= FR_COPIED;
4543 fp = (frentry_t *)data;
4544 if ((fp->fr_type & FR_T_BUILTIN) == 0) {
4548 fp->fr_flags &= ~FR_COPIED;
4551 if (((fp->fr_dsize == 0) && (fp->fr_data != NULL)) ||
4552 ((fp->fr_dsize != 0) && (fp->fr_data == NULL))) {
4558 family = fp->fr_family;
4561 if (req == (ioctlcmd_t)SIOCINAFR || req == (ioctlcmd_t)SIOCINIFR ||
4562 req == (ioctlcmd_t)SIOCADAFR || req == (ioctlcmd_t)SIOCADIFR)
4564 else if (req == (ioctlcmd_t)SIOCRMAFR || req == (ioctlcmd_t)SIOCRMIFR)
4566 else if (req == (ioctlcmd_t)SIOCZRLST)
4575 * Only filter rules for IPv4 or IPv6 are accepted.
4577 if (family == AF_INET) {
4580 } else if (family == AF_INET6) {
4583 } else if (family != 0) {
4590 * If the rule is being loaded from user space, i.e. we had to copy it
4591 * into kernel space, then do not trust the function pointer in the
4594 if ((makecopy == 1) && (fp->fr_func != NULL)) {
4595 if (ipf_findfunc(fp->fr_func) == NULL) {
4602 error = ipf_funcinit(softc, fp);
4607 if ((fp->fr_flags & FR_CALLNOW) &&
4608 ((fp->fr_func == NULL) || (fp->fr_func == (ipfunc_t)-1))) {
4613 if (((fp->fr_flags & FR_CMDMASK) == FR_CALL) &&
4614 ((fp->fr_func == NULL) || (fp->fr_func == (ipfunc_t)-1))) {
4623 if (FR_ISACCOUNT(fp->fr_flags))
4624 unit = IPL_LOGCOUNT;
4627 * Check that each group name in the rule has a start index that
4630 if (fp->fr_icmphead != -1) {
4631 if ((fp->fr_icmphead < 0) ||
4632 (fp->fr_icmphead >= fp->fr_namelen)) {
4637 if (!strcmp(FR_NAME(fp, fr_icmphead), "0"))
4638 fp->fr_names[fp->fr_icmphead] = '\0';
4641 if (fp->fr_grhead != -1) {
4642 if ((fp->fr_grhead < 0) ||
4643 (fp->fr_grhead >= fp->fr_namelen)) {
4648 if (!strcmp(FR_NAME(fp, fr_grhead), "0"))
4649 fp->fr_names[fp->fr_grhead] = '\0';
4652 if (fp->fr_group != -1) {
4653 if ((fp->fr_group < 0) ||
4654 (fp->fr_group >= fp->fr_namelen)) {
4659 if ((req != (int)SIOCZRLST) && (fp->fr_group != -1)) {
4661 * Allow loading rules that are in groups to cause
4662 * them to be created if they don't already exit.
4664 group = FR_NAME(fp, fr_group);
4666 fg = ipf_group_add(softc, group, NULL,
4667 fp->fr_flags, unit, set);
4670 fg = ipf_findgroup(softc, group, unit,
4679 if (fg->fg_flags == 0) {
4680 fg->fg_flags = fp->fr_flags & FR_INOUT;
4681 } else if (fg->fg_flags != (fp->fr_flags & FR_INOUT)) {
4689 * If a rule is going to be part of a group then it does
4690 * not matter whether it is an in or out rule, but if it
4691 * isn't in a group, then it does...
4693 if ((fp->fr_flags & (FR_INQUE|FR_OUTQUE)) == 0) {
4699 in = (fp->fr_flags & FR_INQUE) ? 0 : 1;
4702 * Work out which rule list this change is being applied to.
4706 if (unit == IPL_LOGAUTH) {
4707 if ((fp->fr_tifs[0].fd_ptr != NULL) ||
4708 (fp->fr_tifs[1].fd_ptr != NULL) ||
4709 (fp->fr_dif.fd_ptr != NULL) ||
4710 (fp->fr_flags & FR_FASTROUTE)) {
4711 softc->ipf_interror = 145;
4715 fprev = ipf_auth_rulehead(softc);
4717 if (FR_ISACCOUNT(fp->fr_flags))
4718 fprev = &softc->ipf_acct[in][set];
4719 else if ((fp->fr_flags & (FR_OUTQUE|FR_INQUE)) != 0)
4720 fprev = &softc->ipf_rules[in][set];
4722 if (fprev == NULL) {
4729 fprev = &fg->fg_start;
4732 * Copy in extra data for the rule.
4734 if (fp->fr_dsize != 0) {
4735 if (makecopy != 0) {
4736 KMALLOCS(ptr, void *, fp->fr_dsize);
4744 * The bcopy case is for when the data is appended
4745 * to the rule by ipf_in_compat().
4747 if (uptr >= (void *)fp &&
4748 uptr < (void *)((char *)fp + fp->fr_size)) {
4749 bcopy(uptr, ptr, fp->fr_dsize);
4752 error = COPYIN(uptr, ptr, fp->fr_dsize);
4768 * Perform per-rule type sanity checks of their members.
4769 * All code after this needs to be aware that allocated memory
4770 * may need to be free'd before exiting.
4772 switch (fp->fr_type & ~FR_T_BUILTIN)
4774 #if defined(IPFILTER_BPF)
4776 if (fp->fr_dsize == 0) {
4781 if (!bpf_validate(ptr, fp->fr_dsize/sizeof(struct bpf_insn))) {
4790 * Preparation for error case at the bottom of this function.
4792 if (fp->fr_datype == FRI_LOOKUP)
4793 fp->fr_dstptr = NULL;
4794 if (fp->fr_satype == FRI_LOOKUP)
4795 fp->fr_srcptr = NULL;
4797 if (fp->fr_dsize != sizeof(fripf_t)) {
4804 * Allowing a rule with both "keep state" and "with oow" is
4805 * pointless because adding a state entry to the table will
4806 * fail with the out of window (oow) flag set.
4808 if ((fp->fr_flags & FR_KEEPSTATE) && (fp->fr_flx & FI_OOW)) {
4814 switch (fp->fr_satype)
4816 case FRI_BROADCAST :
4819 case FRI_NETMASKED :
4821 if (fp->fr_sifpidx < 0) {
4827 fp->fr_srcptr = ipf_findlookup(softc, unit, fp,
4830 if (fp->fr_srcfunc == NULL) {
4846 switch (fp->fr_datype)
4848 case FRI_BROADCAST :
4851 case FRI_NETMASKED :
4853 if (fp->fr_difpidx < 0) {
4859 fp->fr_dstptr = ipf_findlookup(softc, unit, fp,
4862 if (fp->fr_dstfunc == NULL) {
4876 case FR_T_CALLFUNC :
4881 if (ipf_matcharray_verify(fp->fr_data, fp->fr_dsize) == -1) {
4895 if (fp->fr_tif.fd_name != -1) {
4896 if ((fp->fr_tif.fd_name < 0) ||
4897 (fp->fr_tif.fd_name >= fp->fr_namelen)) {
4904 if (fp->fr_dif.fd_name != -1) {
4905 if ((fp->fr_dif.fd_name < 0) ||
4906 (fp->fr_dif.fd_name >= fp->fr_namelen)) {
4913 if (fp->fr_rif.fd_name != -1) {
4914 if ((fp->fr_rif.fd_name < 0) ||
4915 (fp->fr_rif.fd_name >= fp->fr_namelen)) {
4923 * Lookup all the interface names that are part of the rule.
4925 error = ipf_synclist(softc, fp, NULL);
4928 fp->fr_statecnt = 0;
4929 if (fp->fr_srctrack.ht_max_nodes != 0)
4930 ipf_rb_ht_init(&fp->fr_srctrack);
4933 * Look for an existing matching filter rule, but don't include the
4934 * next or interface pointer in the comparison (fr_next, fr_ifa).
4935 * This elminates rules which are indentical being loaded. Checksum
4936 * the constant part of the filter rule to make comparisons quicker
4937 * (this meaning no pointers are included).
4939 for (fp->fr_cksum = 0, p = (u_int *)&fp->fr_func, pp = &fp->fr_cksum;
4942 pp = (u_int *)(fp->fr_caddr + fp->fr_dsize);
4943 for (p = (u_int *)fp->fr_data; p < pp; p++)
4946 WRITE_ENTER(&softc->ipf_mutex);
4949 * Now that the filter rule lists are locked, we can walk the
4950 * chain of them without fear.
4953 for (f = *ftail; (f = *ftail) != NULL; ftail = &f->fr_next) {
4954 if (fp->fr_collect <= f->fr_collect) {
4962 for (; (f = *ftail) != NULL; ftail = &f->fr_next) {
4963 if (ipf_rule_compare(fp, f) == 0)
4968 * If zero'ing statistics, copy current to caller and zero.
4976 * Copy and reduce lock because of impending copyout.
4977 * Well we should, but if we do then the atomicity of
4978 * this call and the correctness of fr_hits and
4979 * fr_bytes cannot be guaranteed. As it is, this code
4980 * only resets them to 0 if they are successfully
4981 * copied out into user space.
4983 bcopy((char *)f, (char *)fp, f->fr_size);
4984 /* MUTEX_DOWNGRADE(&softc->ipf_mutex); */
4987 * When we copy this rule back out, set the data
4988 * pointer to be what it was in user space.
4991 error = ipf_outobj(softc, data, fp, IPFOBJ_FRENTRY);
4994 if ((f->fr_dsize != 0) && (uptr != NULL))
4995 error = COPYOUT(f->fr_data, uptr,
5008 if (makecopy != 0) {
5010 KFREES(ptr, fp->fr_dsize);
5012 KFREES(fp, fp->fr_size);
5014 RWLOCK_EXIT(&softc->ipf_mutex);
5020 * At the end of this, ftail must point to the place where the
5021 * new rule is to be saved/inserted/added.
5022 * For SIOCAD*FR, this should be the last rule in the group of
5023 * rules that have equal fr_collect fields.
5024 * For SIOCIN*FR, ...
5026 if (req == (ioctlcmd_t)SIOCADAFR ||
5027 req == (ioctlcmd_t)SIOCADIFR) {
5029 for (ftail = fprev; (f = *ftail) != NULL; ) {
5030 if (f->fr_collect > fp->fr_collect)
5032 ftail = &f->fr_next;
5038 } else if (req == (ioctlcmd_t)SIOCINAFR ||
5039 req == (ioctlcmd_t)SIOCINIFR) {
5040 while ((f = *fprev) != NULL) {
5041 if (f->fr_collect >= fp->fr_collect)
5043 fprev = &f->fr_next;
5046 if (fp->fr_hits != 0) {
5047 while (fp->fr_hits && (f = *ftail)) {
5048 if (f->fr_collect != fp->fr_collect)
5051 ftail = &f->fr_next;
5061 * Request to remove a rule.
5069 * Do not allow activity from user space to interfere
5070 * with rules not loaded that way.
5072 if ((makecopy == 1) && !(f->fr_flags & FR_COPIED)) {
5079 * Return EBUSY if the rule is being reference by
5080 * something else (eg state information.)
5082 if (f->fr_ref > 1) {
5087 #ifdef IPFILTER_SCAN
5088 if (f->fr_isctag != -1 &&
5089 (f->fr_isc != (struct ipscan *)-1))
5090 ipf_scan_detachfr(f);
5093 if (unit == IPL_LOGAUTH) {
5094 error = ipf_auth_precmd(softc, req, f, ftail);
5098 ipf_rule_delete(softc, f, unit, set);
5100 need_free = makecopy;
5104 * Not removing, so we must be adding/inserting a rule.
5111 if (unit == IPL_LOGAUTH) {
5112 error = ipf_auth_precmd(softc, req, fp, ftail);
5116 MUTEX_NUKE(&fp->fr_lock);
5117 MUTEX_INIT(&fp->fr_lock, "filter rule lock");
5118 if (fp->fr_die != 0)
5119 ipf_rule_expire_insert(softc, fp, set);
5124 fp->fr_pnext = ftail;
5125 fp->fr_next = *ftail;
5126 if (fp->fr_next != NULL)
5127 fp->fr_next->fr_pnext = &fp->fr_next;
5130 ipf_fixskip(ftail, fp, 1);
5132 fp->fr_icmpgrp = NULL;
5133 if (fp->fr_icmphead != -1) {
5134 group = FR_NAME(fp, fr_icmphead);
5135 fg = ipf_group_add(softc, group, fp, 0, unit, set);
5136 fp->fr_icmpgrp = fg;
5139 fp->fr_grphead = NULL;
5140 if (fp->fr_grhead != -1) {
5141 group = FR_NAME(fp, fr_grhead);
5142 fg = ipf_group_add(softc, group, fp, fp->fr_flags,
5144 fp->fr_grphead = fg;
5148 RWLOCK_EXIT(&softc->ipf_mutex);
5150 if (need_free || (error != 0)) {
5151 if ((fp->fr_type & ~FR_T_BUILTIN) == FR_T_IPF) {
5152 if ((fp->fr_satype == FRI_LOOKUP) &&
5153 (fp->fr_srcptr != NULL))
5154 ipf_lookup_deref(softc, fp->fr_srctype,
5156 if ((fp->fr_datype == FRI_LOOKUP) &&
5157 (fp->fr_dstptr != NULL))
5158 ipf_lookup_deref(softc, fp->fr_dsttype,
5161 if (fp->fr_grp != NULL) {
5162 WRITE_ENTER(&softc->ipf_mutex);
5163 ipf_group_del(softc, fp->fr_grp, fp);
5164 RWLOCK_EXIT(&softc->ipf_mutex);
5166 if ((ptr != NULL) && (makecopy != 0)) {
5167 KFREES(ptr, fp->fr_dsize);
5169 KFREES(fp, fp->fr_size);
5175 /* ------------------------------------------------------------------------ */
5176 /* Function: ipf_rule_delete */
5178 /* Parameters: softc(I) - pointer to soft context main structure */
5179 /* f(I) - pointer to the rule being deleted */
5180 /* ftail(I) - pointer to the pointer to f */
5181 /* unit(I) - device for which this is for */
5182 /* set(I) - 1 or 0 (filter set) */
5184 /* This function attempts to do what it can to delete a filter rule: remove */
5185 /* it from any linked lists and remove any groups it is responsible for. */
5186 /* But in the end, removing a rule can only drop the reference count - we */
5187 /* must use that as the guide for whether or not it can be freed. */
5188 /* ------------------------------------------------------------------------ */
5190 ipf_rule_delete(softc, f, unit, set)
5191 ipf_main_softc_t *softc;
5197 * If fr_pdnext is set, then the rule is on the expire list, so
5198 * remove it from there.
5200 if (f->fr_pdnext != NULL) {
5201 *f->fr_pdnext = f->fr_dnext;
5202 if (f->fr_dnext != NULL)
5203 f->fr_dnext->fr_pdnext = f->fr_pdnext;
5204 f->fr_pdnext = NULL;
5208 ipf_fixskip(f->fr_pnext, f, -1);
5209 if (f->fr_pnext != NULL)
5210 *f->fr_pnext = f->fr_next;
5211 if (f->fr_next != NULL)
5212 f->fr_next->fr_pnext = f->fr_pnext;
5216 (void) ipf_derefrule(softc, &f);
5219 /* ------------------------------------------------------------------------ */
5220 /* Function: ipf_rule_expire_insert */
5222 /* Parameters: softc(I) - pointer to soft context main structure */
5223 /* f(I) - pointer to rule to be added to expire list */
5224 /* set(I) - 1 or 0 (filter set) */
5226 /* If the new rule has a given expiration time, insert it into the list of */
5227 /* expiring rules with the ones to be removed first added to the front of */
5228 /* the list. The insertion is O(n) but it is kept sorted for quick scans at */
5229 /* expiration interval checks. */
5230 /* ------------------------------------------------------------------------ */
5232 ipf_rule_expire_insert(softc, f, set)
5233 ipf_main_softc_t *softc;
5242 f->fr_die = softc->ipf_ticks + IPF_TTLVAL(f->fr_die);
5243 for (fr = softc->ipf_rule_explist[set]; fr != NULL;
5244 fr = fr->fr_dnext) {
5245 if (f->fr_die < fr->fr_die)
5247 if (fr->fr_dnext == NULL) {
5249 * We've got to the last rule and everything
5250 * wanted to be expired before this new node,
5251 * so we have to tack it on the end...
5254 f->fr_pdnext = &fr->fr_dnext;
5260 if (softc->ipf_rule_explist[set] == NULL) {
5261 softc->ipf_rule_explist[set] = f;
5262 f->fr_pdnext = &softc->ipf_rule_explist[set];
5263 } else if (fr != NULL) {
5265 f->fr_pdnext = fr->fr_pdnext;
5266 fr->fr_pdnext = &f->fr_dnext;
5271 /* ------------------------------------------------------------------------ */
5272 /* Function: ipf_findlookup */
5273 /* Returns: NULL = failure, else success */
5274 /* Parameters: softc(I) - pointer to soft context main structure */
5275 /* unit(I) - ipf device we want to find match for */
5276 /* fp(I) - rule for which lookup is for */
5277 /* addrp(I) - pointer to lookup information in address struct */
5278 /* maskp(O) - pointer to lookup information for storage */
5280 /* When using pools and hash tables to store addresses for matching in */
5281 /* rules, it is necessary to resolve both the object referred to by the */
5282 /* name or address (and return that pointer) and also provide the means by */
5283 /* which to determine if an address belongs to that object to make the */
5284 /* packet matching quicker. */
5285 /* ------------------------------------------------------------------------ */
5287 ipf_findlookup(softc, unit, fr, addrp, maskp)
5288 ipf_main_softc_t *softc;
5291 i6addr_t *addrp, *maskp;
5295 switch (addrp->iplookupsubtype)
5298 ptr = ipf_lookup_res_num(softc, unit, addrp->iplookuptype,
5300 &maskp->iplookupfunc);
5303 if (addrp->iplookupname < 0)
5305 if (addrp->iplookupname >= fr->fr_namelen)
5307 ptr = ipf_lookup_res_name(softc, unit, addrp->iplookuptype,
5308 fr->fr_names + addrp->iplookupname,
5309 &maskp->iplookupfunc);
5319 /* ------------------------------------------------------------------------ */
5320 /* Function: ipf_funcinit */
5321 /* Returns: int - 0 == success, else ESRCH: cannot resolve rule details */
5322 /* Parameters: softc(I) - pointer to soft context main structure */
5323 /* fr(I) - pointer to filter rule */
5325 /* If a rule is a call rule, then check if the function it points to needs */
5326 /* an init function to be called now the rule has been loaded. */
5327 /* ------------------------------------------------------------------------ */
5329 ipf_funcinit(softc, fr)
5330 ipf_main_softc_t *softc;
5333 ipfunc_resolve_t *ft;
5339 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++)
5340 if (ft->ipfu_addr == fr->fr_func) {
5342 if (ft->ipfu_init != NULL)
5343 err = (*ft->ipfu_init)(softc, fr);
5350 /* ------------------------------------------------------------------------ */
5351 /* Function: ipf_funcfini */
5353 /* Parameters: softc(I) - pointer to soft context main structure */
5354 /* fr(I) - pointer to filter rule */
5356 /* For a given filter rule, call the matching "fini" function if the rule */
5357 /* is using a known function that would have resulted in the "init" being */
5358 /* called for ealier. */
5359 /* ------------------------------------------------------------------------ */
5361 ipf_funcfini(softc, fr)
5362 ipf_main_softc_t *softc;
5365 ipfunc_resolve_t *ft;
5367 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++)
5368 if (ft->ipfu_addr == fr->fr_func) {
5369 if (ft->ipfu_fini != NULL)
5370 (void) (*ft->ipfu_fini)(softc, fr);
5376 /* ------------------------------------------------------------------------ */
5377 /* Function: ipf_findfunc */
5378 /* Returns: ipfunc_t - pointer to function if found, else NULL */
5379 /* Parameters: funcptr(I) - function pointer to lookup */
5381 /* Look for a function in the table of known functions. */
5382 /* ------------------------------------------------------------------------ */
5384 ipf_findfunc(funcptr)
5387 ipfunc_resolve_t *ft;
5389 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++)
5390 if (ft->ipfu_addr == funcptr)
5396 /* ------------------------------------------------------------------------ */
5397 /* Function: ipf_resolvefunc */
5398 /* Returns: int - 0 == success, else error */
5399 /* Parameters: data(IO) - ioctl data pointer to ipfunc_resolve_t struct */
5401 /* Copy in a ipfunc_resolve_t structure and then fill in the missing field. */
5402 /* This will either be the function name (if the pointer is set) or the */
5403 /* function pointer if the name is set. When found, fill in the other one */
5404 /* so that the entire, complete, structure can be copied back to user space.*/
5405 /* ------------------------------------------------------------------------ */
5407 ipf_resolvefunc(softc, data)
5408 ipf_main_softc_t *softc;
5411 ipfunc_resolve_t res, *ft;
5414 error = BCOPYIN(data, &res, sizeof(res));
5420 if (res.ipfu_addr == NULL && res.ipfu_name[0] != '\0') {
5421 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++)
5422 if (strncmp(res.ipfu_name, ft->ipfu_name,
5423 sizeof(res.ipfu_name)) == 0) {
5424 res.ipfu_addr = ft->ipfu_addr;
5425 res.ipfu_init = ft->ipfu_init;
5426 if (COPYOUT(&res, data, sizeof(res)) != 0) {
5433 if (res.ipfu_addr != NULL && res.ipfu_name[0] == '\0') {
5434 for (ft = ipf_availfuncs; ft->ipfu_addr != NULL; ft++)
5435 if (ft->ipfu_addr == res.ipfu_addr) {
5436 (void) strncpy(res.ipfu_name, ft->ipfu_name,
5437 sizeof(res.ipfu_name));
5438 res.ipfu_init = ft->ipfu_init;
5439 if (COPYOUT(&res, data, sizeof(res)) != 0) {
5451 #if !defined(_KERNEL) || (!defined(__NetBSD__) && !defined(__OpenBSD__) && \
5452 !defined(__FreeBSD__)) || \
5453 FREEBSD_LT_REV(501000) || NETBSD_LT_REV(105000000) || \
5454 OPENBSD_LT_REV(200006)
5457 * ppsratecheck(): packets (or events) per second limitation.
5460 ppsratecheck(lasttime, curpps, maxpps)
5461 struct timeval *lasttime;
5463 int maxpps; /* maximum pps allowed */
5465 struct timeval tv, delta;
5470 delta.tv_sec = tv.tv_sec - lasttime->tv_sec;
5471 delta.tv_usec = tv.tv_usec - lasttime->tv_usec;
5472 if (delta.tv_usec < 0) {
5474 delta.tv_usec += 1000000;
5478 * check for 0,0 is so that the message will be seen at least once.
5479 * if more than one second have passed since the last update of
5480 * lasttime, reset the counter.
5482 * we do increment *curpps even in *curpps < maxpps case, as some may
5483 * try to use *curpps for stat purposes as well.
5485 if ((lasttime->tv_sec == 0 && lasttime->tv_usec == 0) ||
5486 delta.tv_sec >= 1) {
5490 } else if (maxpps < 0)
5492 else if (*curpps < maxpps)
5496 *curpps = *curpps + 1;
5503 /* ------------------------------------------------------------------------ */
5504 /* Function: ipf_derefrule */
5505 /* Returns: int - 0 == rule freed up, else rule not freed */
5506 /* Parameters: fr(I) - pointer to filter rule */
5508 /* Decrement the reference counter to a rule by one. If it reaches zero, */
5509 /* free it and any associated storage space being used by it. */
5510 /* ------------------------------------------------------------------------ */
5512 ipf_derefrule(softc, frp)
5513 ipf_main_softc_t *softc;
5522 MUTEX_ENTER(&fr->fr_lock);
5524 if (fr->fr_ref == 0) {
5525 MUTEX_EXIT(&fr->fr_lock);
5526 MUTEX_DESTROY(&fr->fr_lock);
5528 ipf_funcfini(softc, fr);
5531 if (fdp->fd_type == FRD_DSTLIST)
5532 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr);
5535 if (fdp->fd_type == FRD_DSTLIST)
5536 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr);
5539 if (fdp->fd_type == FRD_DSTLIST)
5540 ipf_lookup_deref(softc, IPLT_DSTLIST, fdp->fd_ptr);
5542 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF &&
5543 fr->fr_satype == FRI_LOOKUP)
5544 ipf_lookup_deref(softc, fr->fr_srctype, fr->fr_srcptr);
5545 if ((fr->fr_type & ~FR_T_BUILTIN) == FR_T_IPF &&
5546 fr->fr_datype == FRI_LOOKUP)
5547 ipf_lookup_deref(softc, fr->fr_dsttype, fr->fr_dstptr);
5549 if (fr->fr_grp != NULL)
5550 ipf_group_del(softc, fr->fr_grp, fr);
5552 if (fr->fr_grphead != NULL)
5553 ipf_group_del(softc, fr->fr_grphead, fr);
5555 if (fr->fr_icmpgrp != NULL)
5556 ipf_group_del(softc, fr->fr_icmpgrp, fr);
5558 if ((fr->fr_flags & FR_COPIED) != 0) {
5560 KFREES(fr->fr_data, fr->fr_dsize);
5562 KFREES(fr, fr->fr_size);
5567 MUTEX_EXIT(&fr->fr_lock);
5573 /* ------------------------------------------------------------------------ */
5574 /* Function: ipf_grpmapinit */
5575 /* Returns: int - 0 == success, else ESRCH because table entry not found*/
5576 /* Parameters: fr(I) - pointer to rule to find hash table for */
5578 /* Looks for group hash table fr_arg and stores a pointer to it in fr_ptr. */
5579 /* fr_ptr is later used by ipf_srcgrpmap and ipf_dstgrpmap. */
5580 /* ------------------------------------------------------------------------ */
5582 ipf_grpmapinit(softc, fr)
5583 ipf_main_softc_t *softc;
5586 char name[FR_GROUPLEN];
5589 #if defined(SNPRINTF) && defined(_KERNEL)
5590 SNPRINTF(name, sizeof(name), "%d", fr->fr_arg);
5592 (void) sprintf(name, "%d", fr->fr_arg);
5594 iph = ipf_lookup_find_htable(softc, IPL_LOGIPF, name);
5599 if ((iph->iph_flags & FR_INOUT) != (fr->fr_flags & FR_INOUT)) {
5609 /* ------------------------------------------------------------------------ */
5610 /* Function: ipf_grpmapfini */
5611 /* Returns: int - 0 == success, else ESRCH because table entry not found*/
5612 /* Parameters: softc(I) - pointer to soft context main structure */
5613 /* fr(I) - pointer to rule to release hash table for */
5615 /* For rules that have had ipf_grpmapinit called, ipf_lookup_deref needs to */
5616 /* be called to undo what ipf_grpmapinit caused to be done. */
5617 /* ------------------------------------------------------------------------ */
5619 ipf_grpmapfini(softc, fr)
5620 ipf_main_softc_t *softc;
5626 ipf_lookup_deref(softc, IPLT_HASH, iph);
5631 /* ------------------------------------------------------------------------ */
5632 /* Function: ipf_srcgrpmap */
5633 /* Returns: frentry_t * - pointer to "new last matching" rule or NULL */
5634 /* Parameters: fin(I) - pointer to packet information */
5635 /* passp(IO) - pointer to current/new filter decision (unused) */
5637 /* Look for a rule group head in a hash table, using the source address as */
5638 /* the key, and descend into that group and continue matching rules against */
5640 /* ------------------------------------------------------------------------ */
5642 ipf_srcgrpmap(fin, passp)
5649 rval = ipf_iphmfindgroup(fin->fin_main_soft, fin->fin_fr->fr_ptr,
5655 fin->fin_fr = fg->fg_start;
5656 (void) ipf_scanlist(fin, *passp);
5661 /* ------------------------------------------------------------------------ */
5662 /* Function: ipf_dstgrpmap */
5663 /* Returns: frentry_t * - pointer to "new last matching" rule or NULL */
5664 /* Parameters: fin(I) - pointer to packet information */
5665 /* passp(IO) - pointer to current/new filter decision (unused) */
5667 /* Look for a rule group head in a hash table, using the destination */
5668 /* address as the key, and descend into that group and continue matching */
5669 /* rules against the packet. */
5670 /* ------------------------------------------------------------------------ */
5672 ipf_dstgrpmap(fin, passp)
5679 rval = ipf_iphmfindgroup(fin->fin_main_soft, fin->fin_fr->fr_ptr,
5685 fin->fin_fr = fg->fg_start;
5686 (void) ipf_scanlist(fin, *passp);
5693 * These functions manage objects on queues for efficient timeouts. There
5694 * are a number of system defined queues as well as user defined timeouts.
5695 * It is expected that a lock is held in the domain in which the queue
5696 * belongs (i.e. either state or NAT) when calling any of these functions
5697 * that prevents ipf_freetimeoutqueue() from being called at the same time
5702 /* ------------------------------------------------------------------------ */
5703 /* Function: ipf_addtimeoutqueue */
5704 /* Returns: struct ifqtq * - NULL if malloc fails, else pointer to */
5705 /* timeout queue with given interval. */
5706 /* Parameters: parent(I) - pointer to pointer to parent node of this list */
5707 /* of interface queues. */
5708 /* seconds(I) - timeout value in seconds for this queue. */
5710 /* This routine first looks for a timeout queue that matches the interval */
5711 /* being requested. If it finds one, increments the reference counter and */
5712 /* returns a pointer to it. If none are found, it allocates a new one and */
5713 /* inserts it at the top of the list. */
5716 /* It is assumed that the caller of this function has an appropriate lock */
5717 /* held (exclusively) in the domain that encompases 'parent'. */
5718 /* ------------------------------------------------------------------------ */
5720 ipf_addtimeoutqueue(softc, parent, seconds)
5721 ipf_main_softc_t *softc;
5728 period = seconds * IPF_HZ_DIVIDE;
5730 MUTEX_ENTER(&softc->ipf_timeoutlock);
5731 for (ifq = *parent; ifq != NULL; ifq = ifq->ifq_next) {
5732 if (ifq->ifq_ttl == period) {
5734 * Reset the delete flag, if set, so the structure
5735 * gets reused rather than freed and reallocated.
5737 MUTEX_ENTER(&ifq->ifq_lock);
5738 ifq->ifq_flags &= ~IFQF_DELETE;
5740 MUTEX_EXIT(&ifq->ifq_lock);
5741 MUTEX_EXIT(&softc->ipf_timeoutlock);
5747 KMALLOC(ifq, ipftq_t *);
5749 MUTEX_NUKE(&ifq->ifq_lock);
5750 IPFTQ_INIT(ifq, period, "ipftq mutex");
5751 ifq->ifq_next = *parent;
5752 ifq->ifq_pnext = parent;
5753 ifq->ifq_flags = IFQF_USER;
5756 softc->ipf_userifqs++;
5758 MUTEX_EXIT(&softc->ipf_timeoutlock);
5763 /* ------------------------------------------------------------------------ */
5764 /* Function: ipf_deletetimeoutqueue */
5765 /* Returns: int - new reference count value of the timeout queue */
5766 /* Parameters: ifq(I) - timeout queue which is losing a reference. */
5767 /* Locks: ifq->ifq_lock */
5769 /* This routine must be called when we're discarding a pointer to a timeout */
5770 /* queue object, taking care of the reference counter. */
5772 /* Now that this just sets a DELETE flag, it requires the expire code to */
5773 /* check the list of user defined timeout queues and call the free function */
5774 /* below (currently commented out) to stop memory leaking. It is done this */
5775 /* way because the locking may not be sufficient to safely do a free when */
5776 /* this function is called. */
5777 /* ------------------------------------------------------------------------ */
5779 ipf_deletetimeoutqueue(ifq)
5784 if ((ifq->ifq_ref == 0) && ((ifq->ifq_flags & IFQF_USER) != 0)) {
5785 ifq->ifq_flags |= IFQF_DELETE;
5788 return ifq->ifq_ref;
5792 /* ------------------------------------------------------------------------ */
5793 /* Function: ipf_freetimeoutqueue */
5794 /* Parameters: ifq(I) - timeout queue which is losing a reference. */
5798 /* It is assumed that the caller of this function has an appropriate lock */
5799 /* held (exclusively) in the domain that encompases the callers "domain". */
5800 /* The ifq_lock for this structure should not be held. */
5802 /* Remove a user defined timeout queue from the list of queues it is in and */
5803 /* tidy up after this is done. */
5804 /* ------------------------------------------------------------------------ */
5806 ipf_freetimeoutqueue(softc, ifq)
5807 ipf_main_softc_t *softc;
5811 if (((ifq->ifq_flags & IFQF_DELETE) == 0) || (ifq->ifq_ref != 0) ||
5812 ((ifq->ifq_flags & IFQF_USER) == 0)) {
5813 printf("ipf_freetimeoutqueue(%lx) flags 0x%x ttl %d ref %d\n",
5814 (u_long)ifq, ifq->ifq_flags, ifq->ifq_ttl,
5820 * Remove from its position in the list.
5822 *ifq->ifq_pnext = ifq->ifq_next;
5823 if (ifq->ifq_next != NULL)
5824 ifq->ifq_next->ifq_pnext = ifq->ifq_pnext;
5825 ifq->ifq_next = NULL;
5826 ifq->ifq_pnext = NULL;
5828 MUTEX_DESTROY(&ifq->ifq_lock);
5829 ATOMIC_DEC(softc->ipf_userifqs);
5834 /* ------------------------------------------------------------------------ */
5835 /* Function: ipf_deletequeueentry */
5837 /* Parameters: tqe(I) - timeout queue entry to delete */
5839 /* Remove a tail queue entry from its queue and make it an orphan. */
5840 /* ipf_deletetimeoutqueue is called to make sure the reference count on the */
5841 /* queue is correct. We can't, however, call ipf_freetimeoutqueue because */
5842 /* the correct lock(s) may not be held that would make it safe to do so. */
5843 /* ------------------------------------------------------------------------ */
5845 ipf_deletequeueentry(tqe)
5852 MUTEX_ENTER(&ifq->ifq_lock);
5854 if (tqe->tqe_pnext != NULL) {
5855 *tqe->tqe_pnext = tqe->tqe_next;
5856 if (tqe->tqe_next != NULL)
5857 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext;
5858 else /* we must be the tail anyway */
5859 ifq->ifq_tail = tqe->tqe_pnext;
5861 tqe->tqe_pnext = NULL;
5862 tqe->tqe_ifq = NULL;
5865 (void) ipf_deletetimeoutqueue(ifq);
5866 ASSERT(ifq->ifq_ref > 0);
5868 MUTEX_EXIT(&ifq->ifq_lock);
5872 /* ------------------------------------------------------------------------ */
5873 /* Function: ipf_queuefront */
5875 /* Parameters: tqe(I) - pointer to timeout queue entry */
5877 /* Move a queue entry to the front of the queue, if it isn't already there. */
5878 /* ------------------------------------------------------------------------ */
5889 MUTEX_ENTER(&ifq->ifq_lock);
5890 if (ifq->ifq_head != tqe) {
5891 *tqe->tqe_pnext = tqe->tqe_next;
5893 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext;
5895 ifq->ifq_tail = tqe->tqe_pnext;
5897 tqe->tqe_next = ifq->ifq_head;
5898 ifq->ifq_head->tqe_pnext = &tqe->tqe_next;
5899 ifq->ifq_head = tqe;
5900 tqe->tqe_pnext = &ifq->ifq_head;
5902 MUTEX_EXIT(&ifq->ifq_lock);
5906 /* ------------------------------------------------------------------------ */
5907 /* Function: ipf_queueback */
5909 /* Parameters: ticks(I) - ipf tick time to use with this call */
5910 /* tqe(I) - pointer to timeout queue entry */
5912 /* Move a queue entry to the back of the queue, if it isn't already there. */
5913 /* We use use ticks to calculate the expiration and mark for when we last */
5914 /* touched the structure. */
5915 /* ------------------------------------------------------------------------ */
5917 ipf_queueback(ticks, tqe)
5926 tqe->tqe_die = ticks + ifq->ifq_ttl;
5927 tqe->tqe_touched = ticks;
5929 MUTEX_ENTER(&ifq->ifq_lock);
5930 if (tqe->tqe_next != NULL) { /* at the end already ? */
5934 *tqe->tqe_pnext = tqe->tqe_next;
5935 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext;
5938 * Make it the last entry.
5940 tqe->tqe_next = NULL;
5941 tqe->tqe_pnext = ifq->ifq_tail;
5942 *ifq->ifq_tail = tqe;
5943 ifq->ifq_tail = &tqe->tqe_next;
5945 MUTEX_EXIT(&ifq->ifq_lock);
5949 /* ------------------------------------------------------------------------ */
5950 /* Function: ipf_queueappend */
5952 /* Parameters: ticks(I) - ipf tick time to use with this call */
5953 /* tqe(I) - pointer to timeout queue entry */
5954 /* ifq(I) - pointer to timeout queue */
5955 /* parent(I) - owing object pointer */
5957 /* Add a new item to this queue and put it on the very end. */
5958 /* We use use ticks to calculate the expiration and mark for when we last */
5959 /* touched the structure. */
5960 /* ------------------------------------------------------------------------ */
5962 ipf_queueappend(ticks, tqe, ifq, parent)
5969 MUTEX_ENTER(&ifq->ifq_lock);
5970 tqe->tqe_parent = parent;
5971 tqe->tqe_pnext = ifq->ifq_tail;
5972 *ifq->ifq_tail = tqe;
5973 ifq->ifq_tail = &tqe->tqe_next;
5974 tqe->tqe_next = NULL;
5976 tqe->tqe_die = ticks + ifq->ifq_ttl;
5977 tqe->tqe_touched = ticks;
5979 MUTEX_EXIT(&ifq->ifq_lock);
5983 /* ------------------------------------------------------------------------ */
5984 /* Function: ipf_movequeue */
5986 /* Parameters: tq(I) - pointer to timeout queue information */
5987 /* oifp(I) - old timeout queue entry was on */
5988 /* nifp(I) - new timeout queue to put entry on */
5990 /* Move a queue entry from one timeout queue to another timeout queue. */
5991 /* If it notices that the current entry is already last and does not need */
5992 /* to move queue, the return. */
5993 /* ------------------------------------------------------------------------ */
5995 ipf_movequeue(ticks, tqe, oifq, nifq)
5998 ipftq_t *oifq, *nifq;
6002 * If the queue hasn't changed and we last touched this entry at the
6003 * same ipf time, then we're not going to achieve anything by either
6004 * changing the ttl or moving it on the queue.
6006 if (oifq == nifq && tqe->tqe_touched == ticks)
6010 * For any of this to be outside the lock, there is a risk that two
6011 * packets entering simultaneously, with one changing to a different
6012 * queue and one not, could end up with things in a bizarre state.
6014 MUTEX_ENTER(&oifq->ifq_lock);
6016 tqe->tqe_touched = ticks;
6017 tqe->tqe_die = ticks + nifq->ifq_ttl;
6019 * Is the operation here going to be a no-op ?
6022 if ((tqe->tqe_next == NULL) ||
6023 (tqe->tqe_next->tqe_die == tqe->tqe_die)) {
6024 MUTEX_EXIT(&oifq->ifq_lock);
6030 * Remove from the old queue
6032 *tqe->tqe_pnext = tqe->tqe_next;
6034 tqe->tqe_next->tqe_pnext = tqe->tqe_pnext;
6036 oifq->ifq_tail = tqe->tqe_pnext;
6037 tqe->tqe_next = NULL;
6040 * If we're moving from one queue to another, release the
6041 * lock on the old queue and get a lock on the new queue.
6042 * For user defined queues, if we're moving off it, call
6043 * delete in case it can now be freed.
6046 tqe->tqe_ifq = NULL;
6048 (void) ipf_deletetimeoutqueue(oifq);
6050 MUTEX_EXIT(&oifq->ifq_lock);
6052 MUTEX_ENTER(&nifq->ifq_lock);
6054 tqe->tqe_ifq = nifq;
6059 * Add to the bottom of the new queue
6061 tqe->tqe_pnext = nifq->ifq_tail;
6062 *nifq->ifq_tail = tqe;
6063 nifq->ifq_tail = &tqe->tqe_next;
6064 MUTEX_EXIT(&nifq->ifq_lock);
6068 /* ------------------------------------------------------------------------ */
6069 /* Function: ipf_updateipid */
6070 /* Returns: int - 0 == success, -1 == error (packet should be droppped) */
6071 /* Parameters: fin(I) - pointer to packet information */
6073 /* When we are doing NAT, change the IP of every packet to represent a */
6074 /* single sequence of packets coming from the host, hiding any host */
6075 /* specific sequencing that might otherwise be revealed. If the packet is */
6076 /* a fragment, then store the 'new' IPid in the fragment cache and look up */
6077 /* the fragment cache for non-leading fragments. If a non-leading fragment */
6078 /* has no match in the cache, return an error. */
6079 /* ------------------------------------------------------------------------ */
6084 u_short id, ido, sums;
6088 if (fin->fin_off != 0) {
6089 sum = ipf_frag_ipidknown(fin);
6090 if (sum == 0xffffffff)
6095 id = ipf_nextipid(fin);
6096 if (fin->fin_off == 0 && (fin->fin_flx & FI_FRAG) != 0)
6097 (void) ipf_frag_ipidnew(fin, (u_32_t)id);
6101 ido = ntohs(ip->ip_id);
6104 ip->ip_id = htons(id);
6105 CALC_SUMD(ido, id, sumd); /* DESTRUCTIVE MACRO! id,ido change */
6106 sum = (~ntohs(ip->ip_sum)) & 0xffff;
6108 sum = (sum >> 16) + (sum & 0xffff);
6109 sum = (sum >> 16) + (sum & 0xffff);
6110 sums = ~(u_short)sum;
6111 ip->ip_sum = htons(sums);
6116 #ifdef NEED_FRGETIFNAME
6117 /* ------------------------------------------------------------------------ */
6118 /* Function: ipf_getifname */
6119 /* Returns: char * - pointer to interface name */
6120 /* Parameters: ifp(I) - pointer to network interface */
6121 /* buffer(O) - pointer to where to store interface name */
6123 /* Constructs an interface name in the buffer passed. The buffer passed is */
6124 /* expected to be at least LIFNAMSIZ in bytes big. If buffer is passed in */
6125 /* as a NULL pointer then return a pointer to a static array. */
6126 /* ------------------------------------------------------------------------ */
6128 ipf_getifname(ifp, buffer)
6132 static char namebuf[LIFNAMSIZ];
6133 # if defined(MENTAT) || defined(__FreeBSD__) || defined(__osf__) || \
6134 defined(__sgi) || defined(linux) || defined(_AIX51) || \
6135 (defined(sun) && !defined(__SVR4) && !defined(__svr4__))
6143 (void) strncpy(buffer, ifp->if_name, LIFNAMSIZ);
6144 buffer[LIFNAMSIZ - 1] = '\0';
6145 # if defined(MENTAT) || defined(__FreeBSD__) || defined(__osf__) || \
6146 defined(__sgi) || defined(_AIX51) || \
6147 (defined(sun) && !defined(__SVR4) && !defined(__svr4__))
6148 for (s = buffer; *s; s++)
6150 unit = ifp->if_unit;
6151 space = LIFNAMSIZ - (s - buffer);
6152 if ((space > 0) && (unit >= 0)) {
6153 # if defined(SNPRINTF) && defined(_KERNEL)
6154 SNPRINTF(temp, sizeof(temp), "%d", unit);
6156 (void) sprintf(temp, "%d", unit);
6158 (void) strncpy(s, temp, space);
6166 /* ------------------------------------------------------------------------ */
6167 /* Function: ipf_ioctlswitch */
6168 /* Returns: int - -1 continue processing, else ioctl return value */
6169 /* Parameters: unit(I) - device unit opened */
6170 /* data(I) - pointer to ioctl data */
6171 /* cmd(I) - ioctl command */
6172 /* mode(I) - mode value */
6173 /* uid(I) - uid making the ioctl call */
6174 /* ctx(I) - pointer to context data */
6176 /* Based on the value of unit, call the appropriate ioctl handler or return */
6177 /* EIO if ipfilter is not running. Also checks if write perms are req'd */
6178 /* for the device in order to execute the ioctl. A special case is made */
6179 /* SIOCIPFINTERROR so that the same code isn't required in every handler. */
6180 /* The context data pointer is passed through as this is used as the key */
6181 /* for locating a matching token for continued access for walking lists, */
6183 /* ------------------------------------------------------------------------ */
6185 ipf_ioctlswitch(softc, unit, data, cmd, mode, uid, ctx)
6186 ipf_main_softc_t *softc;
6187 int unit, mode, uid;
6195 case SIOCIPFINTERROR :
6196 error = BCOPYOUT(&softc->ipf_interror, data,
6197 sizeof(softc->ipf_interror));
6210 error = ipf_ipf_ioctl(softc, data, cmd, mode, uid, ctx);
6213 if (softc->ipf_running > 0) {
6214 error = ipf_nat_ioctl(softc, data, cmd, mode,
6222 if (softc->ipf_running > 0) {
6223 error = ipf_state_ioctl(softc, data, cmd, mode,
6231 if (softc->ipf_running > 0) {
6232 error = ipf_auth_ioctl(softc, data, cmd, mode,
6240 if (softc->ipf_running > 0) {
6241 error = ipf_sync_ioctl(softc, data, cmd, mode,
6249 #ifdef IPFILTER_SCAN
6250 if (softc->ipf_running > 0)
6251 error = ipf_scan_ioctl(softc, data, cmd, mode,
6260 case IPL_LOGLOOKUP :
6261 if (softc->ipf_running > 0) {
6262 error = ipf_lookup_ioctl(softc, data, cmd, mode,
6280 * This array defines the expected size of objects coming into the kernel
6281 * for the various recognised object types. The first column is flags (see
6282 * below), 2nd column is current size, 3rd column is the version number of
6283 * when the current size became current.
6285 * 1 = minimum size, not absolute size
6287 static int ipf_objbytes[IPFOBJ_COUNT][3] = {
6288 { 1, sizeof(struct frentry), 5010000 }, /* 0 */
6289 { 1, sizeof(struct friostat), 5010000 },
6290 { 0, sizeof(struct fr_info), 5010000 },
6291 { 0, sizeof(struct ipf_authstat), 4010100 },
6292 { 0, sizeof(struct ipfrstat), 5010000 },
6293 { 1, sizeof(struct ipnat), 5010000 }, /* 5 */
6294 { 0, sizeof(struct natstat), 5010000 },
6295 { 0, sizeof(struct ipstate_save), 5010000 },
6296 { 1, sizeof(struct nat_save), 5010000 },
6297 { 0, sizeof(struct natlookup), 5010000 },
6298 { 1, sizeof(struct ipstate), 5010000 }, /* 10 */
6299 { 0, sizeof(struct ips_stat), 5010000 },
6300 { 0, sizeof(struct frauth), 5010000 },
6301 { 0, sizeof(struct ipftune), 4010100 },
6302 { 0, sizeof(struct nat), 5010000 },
6303 { 0, sizeof(struct ipfruleiter), 4011400 }, /* 15 */
6304 { 0, sizeof(struct ipfgeniter), 4011400 },
6305 { 0, sizeof(struct ipftable), 4011400 },
6306 { 0, sizeof(struct ipflookupiter), 4011400 },
6307 { 0, sizeof(struct ipftq) * IPF_TCP_NSTATES },
6308 { 1, 0, 0 }, /* IPFEXPR */
6309 { 0, 0, 0 }, /* PROXYCTL */
6310 { 0, sizeof (struct fripf), 5010000 }
6314 /* ------------------------------------------------------------------------ */
6315 /* Function: ipf_inobj */
6316 /* Returns: int - 0 = success, else failure */
6317 /* Parameters: softc(I) - soft context pointerto work with */
6318 /* data(I) - pointer to ioctl data */
6319 /* objp(O) - where to store ipfobj structure */
6320 /* ptr(I) - pointer to data to copy out */
6321 /* type(I) - type of structure being moved */
6323 /* Copy in the contents of what the ipfobj_t points to. In future, we */
6324 /* add things to check for version numbers, sizes, etc, to make it backward */
6325 /* compatible at the ABI for user land. */
6326 /* If objp is not NULL then we assume that the caller wants to see what is */
6327 /* in the ipfobj_t structure being copied in. As an example, this can tell */
6328 /* the caller what version of ipfilter the ioctl program was written to. */
6329 /* ------------------------------------------------------------------------ */
6331 ipf_inobj(softc, data, objp, ptr, type)
6332 ipf_main_softc_t *softc;
6342 if ((type < 0) || (type >= IPFOBJ_COUNT)) {
6349 error = BCOPYIN(data, objp, sizeof(*objp));
6355 if (objp->ipfo_type != type) {
6360 if (objp->ipfo_rev >= ipf_objbytes[type][2]) {
6361 if ((ipf_objbytes[type][0] & 1) != 0) {
6362 if (objp->ipfo_size < ipf_objbytes[type][1]) {
6366 size = ipf_objbytes[type][1];
6367 } else if (objp->ipfo_size == ipf_objbytes[type][1]) {
6368 size = objp->ipfo_size;
6373 error = COPYIN(objp->ipfo_ptr, ptr, size);
6379 #ifdef IPFILTER_COMPAT
6380 error = ipf_in_compat(softc, objp, ptr, 0);
6390 /* ------------------------------------------------------------------------ */
6391 /* Function: ipf_inobjsz */
6392 /* Returns: int - 0 = success, else failure */
6393 /* Parameters: softc(I) - soft context pointerto work with */
6394 /* data(I) - pointer to ioctl data */
6395 /* ptr(I) - pointer to store real data in */
6396 /* type(I) - type of structure being moved */
6397 /* sz(I) - size of data to copy */
6399 /* As per ipf_inobj, except the size of the object to copy in is passed in */
6400 /* but it must not be smaller than the size defined for the type and the */
6401 /* type must allow for varied sized objects. The extra requirement here is */
6402 /* that sz must match the size of the object being passed in - this is not */
6403 /* not possible nor required in ipf_inobj(). */
6404 /* ------------------------------------------------------------------------ */
6406 ipf_inobjsz(softc, data, ptr, type, sz)
6407 ipf_main_softc_t *softc;
6415 if ((type < 0) || (type >= IPFOBJ_COUNT)) {
6420 error = BCOPYIN(data, &obj, sizeof(obj));
6426 if (obj.ipfo_type != type) {
6431 if (obj.ipfo_rev >= ipf_objbytes[type][2]) {
6432 if (((ipf_objbytes[type][0] & 1) == 0) ||
6433 (sz < ipf_objbytes[type][1])) {
6437 error = COPYIN(obj.ipfo_ptr, ptr, sz);
6443 #ifdef IPFILTER_COMPAT
6444 error = ipf_in_compat(softc, &obj, ptr, sz);
6454 /* ------------------------------------------------------------------------ */
6455 /* Function: ipf_outobjsz */
6456 /* Returns: int - 0 = success, else failure */
6457 /* Parameters: data(I) - pointer to ioctl data */
6458 /* ptr(I) - pointer to store real data in */
6459 /* type(I) - type of structure being moved */
6460 /* sz(I) - size of data to copy */
6462 /* As per ipf_outobj, except the size of the object to copy out is passed in*/
6463 /* but it must not be smaller than the size defined for the type and the */
6464 /* type must allow for varied sized objects. The extra requirement here is */
6465 /* that sz must match the size of the object being passed in - this is not */
6466 /* not possible nor required in ipf_outobj(). */
6467 /* ------------------------------------------------------------------------ */
6469 ipf_outobjsz(softc, data, ptr, type, sz)
6470 ipf_main_softc_t *softc;
6478 if ((type < 0) || (type >= IPFOBJ_COUNT)) {
6483 error = BCOPYIN(data, &obj, sizeof(obj));
6489 if (obj.ipfo_type != type) {
6494 if (obj.ipfo_rev >= ipf_objbytes[type][2]) {
6495 if (((ipf_objbytes[type][0] & 1) == 0) ||
6496 (sz < ipf_objbytes[type][1])) {
6500 error = COPYOUT(ptr, obj.ipfo_ptr, sz);
6506 #ifdef IPFILTER_COMPAT
6507 error = ipf_out_compat(softc, &obj, ptr);
6517 /* ------------------------------------------------------------------------ */
6518 /* Function: ipf_outobj */
6519 /* Returns: int - 0 = success, else failure */
6520 /* Parameters: data(I) - pointer to ioctl data */
6521 /* ptr(I) - pointer to store real data in */
6522 /* type(I) - type of structure being moved */
6524 /* Copy out the contents of what ptr is to where ipfobj points to. In */
6525 /* future, we add things to check for version numbers, sizes, etc, to make */
6526 /* it backward compatible at the ABI for user land. */
6527 /* ------------------------------------------------------------------------ */
6529 ipf_outobj(softc, data, ptr, type)
6530 ipf_main_softc_t *softc;
6538 if ((type < 0) || (type >= IPFOBJ_COUNT)) {
6543 error = BCOPYIN(data, &obj, sizeof(obj));
6549 if (obj.ipfo_type != type) {
6554 if (obj.ipfo_rev >= ipf_objbytes[type][2]) {
6555 if ((ipf_objbytes[type][0] & 1) != 0) {
6556 if (obj.ipfo_size < ipf_objbytes[type][1]) {
6560 } else if (obj.ipfo_size != ipf_objbytes[type][1]) {
6565 error = COPYOUT(ptr, obj.ipfo_ptr, obj.ipfo_size);
6571 #ifdef IPFILTER_COMPAT
6572 error = ipf_out_compat(softc, &obj, ptr);
6582 /* ------------------------------------------------------------------------ */
6583 /* Function: ipf_outobjk */
6584 /* Returns: int - 0 = success, else failure */
6585 /* Parameters: obj(I) - pointer to data description structure */
6586 /* ptr(I) - pointer to kernel data to copy out */
6588 /* In the above functions, the ipfobj_t structure is copied into the kernel,*/
6589 /* telling ipfilter how to copy out data. In this instance, the ipfobj_t is */
6590 /* already populated with information and now we just need to use it. */
6591 /* There is no need for this function to have a "type" parameter as there */
6592 /* is no point in validating information that comes from the kernel with */
6594 /* ------------------------------------------------------------------------ */
6596 ipf_outobjk(softc, obj, ptr)
6597 ipf_main_softc_t *softc;
6601 int type = obj->ipfo_type;
6604 if ((type < 0) || (type >= IPFOBJ_COUNT)) {
6609 if (obj->ipfo_rev >= ipf_objbytes[type][2]) {
6610 if ((ipf_objbytes[type][0] & 1) != 0) {
6611 if (obj->ipfo_size < ipf_objbytes[type][1]) {
6616 } else if (obj->ipfo_size != ipf_objbytes[type][1]) {
6621 error = COPYOUT(ptr, obj->ipfo_ptr, obj->ipfo_size);
6627 #ifdef IPFILTER_COMPAT
6628 error = ipf_out_compat(softc, obj, ptr);
6638 /* ------------------------------------------------------------------------ */
6639 /* Function: ipf_checkl4sum */
6640 /* Returns: int - 0 = good, -1 = bad, 1 = cannot check */
6641 /* Parameters: fin(I) - pointer to packet information */
6643 /* If possible, calculate the layer 4 checksum for the packet. If this is */
6644 /* not possible, return without indicating a failure or success but in a */
6645 /* way that is ditinguishable. This function should only be called by the */
6646 /* ipf_checkv6sum() for each platform. */
6647 /* ------------------------------------------------------------------------ */
6652 u_short sum, hdrsum, *csump;
6657 * If the TCP packet isn't a fragment, isn't too short and otherwise
6658 * isn't already considered "bad", then validate the checksum. If
6659 * this check fails then considered the packet to be "bad".
6661 if ((fin->fin_flx & (FI_FRAG|FI_SHORT|FI_BAD)) != 0)
6672 csump = &((tcphdr_t *)fin->fin_dp)->th_sum;
6678 if (udp->uh_sum != 0) {
6679 csump = &udp->uh_sum;
6685 case IPPROTO_ICMPV6 :
6686 csump = &((struct icmp6_hdr *)fin->fin_dp)->icmp6_cksum;
6692 csump = &((struct icmp *)fin->fin_dp)->icmp_cksum;
6705 sum = fr_cksum(fin, fin->fin_ip, fin->fin_p, fin->fin_dp);
6707 #if !defined(_KERNEL)
6708 if (sum == hdrsum) {
6709 FR_DEBUG(("checkl4sum: %hx == %hx\n", sum, hdrsum));
6711 FR_DEBUG(("checkl4sum: %hx != %hx\n", sum, hdrsum));
6714 DT2(l4sums, u_short, hdrsum, u_short, sum);
6715 if (hdrsum == sum) {
6716 fin->fin_cksum = FI_CK_SUMOK;
6719 fin->fin_cksum = FI_CK_BAD;
6724 /* ------------------------------------------------------------------------ */
6725 /* Function: ipf_ifpfillv4addr */
6726 /* Returns: int - 0 = address update, -1 = address not updated */
6727 /* Parameters: atype(I) - type of network address update to perform */
6728 /* sin(I) - pointer to source of address information */
6729 /* mask(I) - pointer to source of netmask information */
6730 /* inp(I) - pointer to destination address store */
6731 /* inpmask(I) - pointer to destination netmask store */
6733 /* Given a type of network address update (atype) to perform, copy */
6734 /* information from sin/mask into inp/inpmask. If ipnmask is NULL then no */
6735 /* netmask update is performed unless FRI_NETMASKED is passed as atype, in */
6736 /* which case the operation fails. For all values of atype other than */
6737 /* FRI_NETMASKED, if inpmask is non-NULL then the mask is set to an all 1s */
6739 /* ------------------------------------------------------------------------ */
6741 ipf_ifpfillv4addr(atype, sin, mask, inp, inpmask)
6743 struct sockaddr_in *sin, *mask;
6744 struct in_addr *inp, *inpmask;
6746 if (inpmask != NULL && atype != FRI_NETMASKED)
6747 inpmask->s_addr = 0xffffffff;
6749 if (atype == FRI_NETWORK || atype == FRI_NETMASKED) {
6750 if (atype == FRI_NETMASKED) {
6751 if (inpmask == NULL)
6753 inpmask->s_addr = mask->sin_addr.s_addr;
6755 inp->s_addr = sin->sin_addr.s_addr & mask->sin_addr.s_addr;
6757 inp->s_addr = sin->sin_addr.s_addr;
6764 /* ------------------------------------------------------------------------ */
6765 /* Function: ipf_ifpfillv6addr */
6766 /* Returns: int - 0 = address update, -1 = address not updated */
6767 /* Parameters: atype(I) - type of network address update to perform */
6768 /* sin(I) - pointer to source of address information */
6769 /* mask(I) - pointer to source of netmask information */
6770 /* inp(I) - pointer to destination address store */
6771 /* inpmask(I) - pointer to destination netmask store */
6773 /* Given a type of network address update (atype) to perform, copy */
6774 /* information from sin/mask into inp/inpmask. If ipnmask is NULL then no */
6775 /* netmask update is performed unless FRI_NETMASKED is passed as atype, in */
6776 /* which case the operation fails. For all values of atype other than */
6777 /* FRI_NETMASKED, if inpmask is non-NULL then the mask is set to an all 1s */
6779 /* ------------------------------------------------------------------------ */
6781 ipf_ifpfillv6addr(atype, sin, mask, inp, inpmask)
6783 struct sockaddr_in6 *sin, *mask;
6784 i6addr_t *inp, *inpmask;
6786 i6addr_t *src, *and;
6788 src = (i6addr_t *)&sin->sin6_addr;
6789 and = (i6addr_t *)&mask->sin6_addr;
6791 if (inpmask != NULL && atype != FRI_NETMASKED) {
6792 inpmask->i6[0] = 0xffffffff;
6793 inpmask->i6[1] = 0xffffffff;
6794 inpmask->i6[2] = 0xffffffff;
6795 inpmask->i6[3] = 0xffffffff;
6798 if (atype == FRI_NETWORK || atype == FRI_NETMASKED) {
6799 if (atype == FRI_NETMASKED) {
6800 if (inpmask == NULL)
6802 inpmask->i6[0] = and->i6[0];
6803 inpmask->i6[1] = and->i6[1];
6804 inpmask->i6[2] = and->i6[2];
6805 inpmask->i6[3] = and->i6[3];
6808 inp->i6[0] = src->i6[0] & and->i6[0];
6809 inp->i6[1] = src->i6[1] & and->i6[1];
6810 inp->i6[2] = src->i6[2] & and->i6[2];
6811 inp->i6[3] = src->i6[3] & and->i6[3];
6813 inp->i6[0] = src->i6[0];
6814 inp->i6[1] = src->i6[1];
6815 inp->i6[2] = src->i6[2];
6816 inp->i6[3] = src->i6[3];
6823 /* ------------------------------------------------------------------------ */
6824 /* Function: ipf_matchtag */
6825 /* Returns: 0 == mismatch, 1 == match. */
6826 /* Parameters: tag1(I) - pointer to first tag to compare */
6827 /* tag2(I) - pointer to second tag to compare */
6829 /* Returns true (non-zero) or false(0) if the two tag structures can be */
6830 /* considered to be a match or not match, respectively. The tag is 16 */
6831 /* bytes long (16 characters) but that is overlayed with 4 32bit ints so */
6832 /* compare the ints instead, for speed. tag1 is the master of the */
6833 /* comparison. This function should only be called with both tag1 and tag2 */
6834 /* as non-NULL pointers. */
6835 /* ------------------------------------------------------------------------ */
6837 ipf_matchtag(tag1, tag2)
6838 ipftag_t *tag1, *tag2;
6843 if ((tag1->ipt_num[0] == 0) && (tag2->ipt_num[0] == 0))
6846 if ((tag1->ipt_num[0] == tag2->ipt_num[0]) &&
6847 (tag1->ipt_num[1] == tag2->ipt_num[1]) &&
6848 (tag1->ipt_num[2] == tag2->ipt_num[2]) &&
6849 (tag1->ipt_num[3] == tag2->ipt_num[3]))
6855 /* ------------------------------------------------------------------------ */
6856 /* Function: ipf_coalesce */
6857 /* Returns: 1 == success, -1 == failure, 0 == no change */
6858 /* Parameters: fin(I) - pointer to packet information */
6860 /* Attempt to get all of the packet data into a single, contiguous buffer. */
6861 /* If this call returns a failure then the buffers have also been freed. */
6862 /* ------------------------------------------------------------------------ */
6868 if ((fin->fin_flx & FI_COALESCE) != 0)
6872 * If the mbuf pointers indicate that there is no mbuf to work with,
6873 * return but do not indicate success or failure.
6875 if (fin->fin_m == NULL || fin->fin_mp == NULL)
6878 #if defined(_KERNEL)
6879 if (ipf_pullup(fin->fin_m, fin, fin->fin_plen) == NULL) {
6880 ipf_main_softc_t *softc = fin->fin_main_soft;
6882 DT1(frb_coalesce, fr_info_t *, fin);
6883 LBUMP(ipf_stats[fin->fin_out].fr_badcoalesces);
6885 FREE_MB_T(*fin->fin_mp);
6887 fin->fin_reason = FRB_COALESCE;
6888 *fin->fin_mp = NULL;
6893 fin = fin; /* LINT */
6900 * The following table lists all of the tunable variables that can be
6901 * accessed via SIOCIPFGET/SIOCIPFSET/SIOCIPFGETNEXt. The format of each row
6902 * in the table below is as follows:
6904 * pointer to value, name of value, minimum, maximum, size of the value's
6905 * container, value attribute flags
6907 * For convienience, IPFT_RDONLY means the value is read-only, IPFT_WRDISABLED
6908 * means the value can only be written to when IPFilter is loaded but disabled.
6909 * The obvious implication is if neither of these are set then the value can be
6910 * changed at any time without harm.
6914 /* ------------------------------------------------------------------------ */
6915 /* Function: ipf_tune_findbycookie */
6916 /* Returns: NULL = search failed, else pointer to tune struct */
6917 /* Parameters: cookie(I) - cookie value to search for amongst tuneables */
6918 /* next(O) - pointer to place to store the cookie for the */
6919 /* "next" tuneable, if it is desired. */
6921 /* This function is used to walk through all of the existing tunables with */
6922 /* successive calls. It searches the known tunables for the one which has */
6923 /* a matching value for "cookie" - ie its address. When returning a match, */
6924 /* the next one to be found may be returned inside next. */
6925 /* ------------------------------------------------------------------------ */
6926 static ipftuneable_t *
6927 ipf_tune_findbycookie(ptop, cookie, next)
6928 ipftuneable_t **ptop;
6929 void *cookie, **next;
6931 ipftuneable_t *ta, **tap;
6933 for (ta = *ptop; ta->ipft_name != NULL; ta++)
6937 * If the next entry in the array has a name
6938 * present, then return a pointer to it for
6939 * where to go next, else return a pointer to
6940 * the dynaminc list as a key to search there
6941 * next. This facilitates a weak linking of
6942 * the two "lists" together.
6944 if ((ta + 1)->ipft_name != NULL)
6952 for (tap = ptop; (ta = *tap) != NULL; tap = &ta->ipft_next)
6953 if (tap == cookie) {
6955 *next = &ta->ipft_next;
6965 /* ------------------------------------------------------------------------ */
6966 /* Function: ipf_tune_findbyname */
6967 /* Returns: NULL = search failed, else pointer to tune struct */
6968 /* Parameters: name(I) - name of the tuneable entry to find. */
6970 /* Search the static array of tuneables and the list of dynamic tuneables */
6971 /* for an entry with a matching name. If we can find one, return a pointer */
6972 /* to the matching structure. */
6973 /* ------------------------------------------------------------------------ */
6974 static ipftuneable_t *
6975 ipf_tune_findbyname(top, name)
6981 for (ta = top; ta != NULL; ta = ta->ipft_next)
6982 if (!strcmp(ta->ipft_name, name)) {
6990 /* ------------------------------------------------------------------------ */
6991 /* Function: ipf_tune_add_array */
6992 /* Returns: int - 0 == success, else failure */
6993 /* Parameters: newtune - pointer to new tune array to add to tuneables */
6995 /* Appends tune structures from the array passed in (newtune) to the end of */
6996 /* the current list of "dynamic" tuneable parameters. */
6997 /* If any entry to be added is already present (by name) then the operation */
6998 /* is aborted - entries that have been added are removed before returning. */
6999 /* An entry with no name (NULL) is used as the indication that the end of */
7000 /* the array has been reached. */
7001 /* ------------------------------------------------------------------------ */
7003 ipf_tune_add_array(softc, newtune)
7004 ipf_main_softc_t *softc;
7005 ipftuneable_t *newtune;
7007 ipftuneable_t *nt, *dt;
7010 for (nt = newtune; nt->ipft_name != NULL; nt++) {
7011 error = ipf_tune_add(softc, nt);
7013 for (dt = newtune; dt != nt; dt++) {
7014 (void) ipf_tune_del(softc, dt);
7023 /* ------------------------------------------------------------------------ */
7024 /* Function: ipf_tune_array_link */
7025 /* Returns: 0 == success, -1 == failure */
7026 /* Parameters: softc(I) - soft context pointerto work with */
7027 /* array(I) - pointer to an array of tuneables */
7029 /* Given an array of tunables (array), append them to the current list of */
7030 /* tuneables for this context (softc->ipf_tuners.) To properly prepare the */
7031 /* the array for being appended to the list, initialise all of the next */
7032 /* pointers so we don't need to walk parts of it with ++ and others with */
7033 /* next. The array is expected to have an entry with a NULL name as the */
7034 /* terminator. Trying to add an array with no non-NULL names will return as */
7036 /* ------------------------------------------------------------------------ */
7038 ipf_tune_array_link(softc, array)
7039 ipf_main_softc_t *softc;
7040 ipftuneable_t *array;
7042 ipftuneable_t *t, **p;
7045 if (t->ipft_name == NULL)
7048 for (; t[1].ipft_name != NULL; t++)
7049 t[0].ipft_next = &t[1];
7050 t->ipft_next = NULL;
7053 * Since a pointer to the last entry isn't kept, we need to find it
7054 * each time we want to add new variables to the list.
7056 for (p = &softc->ipf_tuners; (t = *p) != NULL; p = &t->ipft_next)
7057 if (t->ipft_name == NULL)
7065 /* ------------------------------------------------------------------------ */
7066 /* Function: ipf_tune_array_unlink */
7067 /* Returns: 0 == success, -1 == failure */
7068 /* Parameters: softc(I) - soft context pointerto work with */
7069 /* array(I) - pointer to an array of tuneables */
7071 /* ------------------------------------------------------------------------ */
7073 ipf_tune_array_unlink(softc, array)
7074 ipf_main_softc_t *softc;
7075 ipftuneable_t *array;
7077 ipftuneable_t *t, **p;
7079 for (p = &softc->ipf_tuners; (t = *p) != NULL; p = &t->ipft_next)
7085 for (; t[1].ipft_name != NULL; t++)
7094 /* ------------------------------------------------------------------------ */
7095 /* Function: ipf_tune_array_copy */
7096 /* Returns: NULL = failure, else pointer to new array */
7097 /* Parameters: base(I) - pointer to structure base */
7098 /* size(I) - size of the array at template */
7099 /* template(I) - original array to copy */
7101 /* Allocate memory for a new set of tuneable values and copy everything */
7102 /* from template into the new region of memory. The new region is full of */
7103 /* uninitialised pointers (ipft_next) so set them up. Now, ipftp_offset... */
7105 /* NOTE: the following assumes that sizeof(long) == sizeof(void *) */
7106 /* In the array template, ipftp_offset is the offset (in bytes) of the */
7107 /* location of the tuneable value inside the structure pointed to by base. */
7108 /* As ipftp_offset is a union over the pointers to the tuneable values, if */
7109 /* we add base to the copy's ipftp_offset, copy ends up with a pointer in */
7110 /* ipftp_void that points to the stored value. */
7111 /* ------------------------------------------------------------------------ */
7113 ipf_tune_array_copy(base, size, template)
7116 ipftuneable_t *template;
7118 ipftuneable_t *copy;
7122 KMALLOCS(copy, ipftuneable_t *, size);
7126 bcopy(template, copy, size);
7128 for (i = 0; copy[i].ipft_name; i++) {
7129 copy[i].ipft_una.ipftp_offset += (u_long)base;
7130 copy[i].ipft_next = copy + i + 1;
7137 /* ------------------------------------------------------------------------ */
7138 /* Function: ipf_tune_add */
7139 /* Returns: int - 0 == success, else failure */
7140 /* Parameters: newtune - pointer to new tune entry to add to tuneables */
7142 /* Appends tune structures from the array passed in (newtune) to the end of */
7143 /* the current list of "dynamic" tuneable parameters. Once added, the */
7144 /* owner of the object is not expected to ever change "ipft_next". */
7145 /* ------------------------------------------------------------------------ */
7147 ipf_tune_add(softc, newtune)
7148 ipf_main_softc_t *softc;
7149 ipftuneable_t *newtune;
7151 ipftuneable_t *ta, **tap;
7153 ta = ipf_tune_findbyname(softc->ipf_tuners, newtune->ipft_name);
7159 for (tap = &softc->ipf_tuners; *tap != NULL; tap = &(*tap)->ipft_next)
7162 newtune->ipft_next = NULL;
7168 /* ------------------------------------------------------------------------ */
7169 /* Function: ipf_tune_del */
7170 /* Returns: int - 0 == success, else failure */
7171 /* Parameters: oldtune - pointer to tune entry to remove from the list of */
7172 /* current dynamic tuneables */
7174 /* Search for the tune structure, by pointer, in the list of those that are */
7175 /* dynamically added at run time. If found, adjust the list so that this */
7176 /* structure is no longer part of it. */
7177 /* ------------------------------------------------------------------------ */
7179 ipf_tune_del(softc, oldtune)
7180 ipf_main_softc_t *softc;
7181 ipftuneable_t *oldtune;
7183 ipftuneable_t *ta, **tap;
7186 for (tap = &softc->ipf_tuners; (ta = *tap) != NULL;
7187 tap = &ta->ipft_next) {
7188 if (ta == oldtune) {
7189 *tap = oldtune->ipft_next;
7190 oldtune->ipft_next = NULL;
7203 /* ------------------------------------------------------------------------ */
7204 /* Function: ipf_tune_del_array */
7205 /* Returns: int - 0 == success, else failure */
7206 /* Parameters: oldtune - pointer to tuneables array */
7208 /* Remove each tuneable entry in the array from the list of "dynamic" */
7209 /* tunables. If one entry should fail to be found, an error will be */
7210 /* returned and no further ones removed. */
7211 /* An entry with a NULL name is used as the indicator of the last entry in */
7213 /* ------------------------------------------------------------------------ */
7215 ipf_tune_del_array(softc, oldtune)
7216 ipf_main_softc_t *softc;
7217 ipftuneable_t *oldtune;
7222 for (ot = oldtune; ot->ipft_name != NULL; ot++) {
7223 error = ipf_tune_del(softc, ot);
7233 /* ------------------------------------------------------------------------ */
7234 /* Function: ipf_tune */
7235 /* Returns: int - 0 == success, else failure */
7236 /* Parameters: cmd(I) - ioctl command number */
7237 /* data(I) - pointer to ioctl data structure */
7239 /* Implement handling of SIOCIPFGETNEXT, SIOCIPFGET and SIOCIPFSET. These */
7240 /* three ioctls provide the means to access and control global variables */
7241 /* within IPFilter, allowing (for example) timeouts and table sizes to be */
7242 /* changed without rebooting, reloading or recompiling. The initialisation */
7243 /* and 'destruction' routines of the various components of ipfilter are all */
7244 /* each responsible for handling their own values being too big. */
7245 /* ------------------------------------------------------------------------ */
7247 ipf_ipftune(softc, cmd, data)
7248 ipf_main_softc_t *softc;
7257 error = ipf_inobj(softc, data, NULL, &tu, IPFOBJ_TUNEABLE);
7261 tu.ipft_name[sizeof(tu.ipft_name) - 1] = '\0';
7262 cookie = tu.ipft_cookie;
7267 case SIOCIPFGETNEXT :
7269 * If cookie is non-NULL, assume it to be a pointer to the last
7270 * entry we looked at, so find it (if possible) and return a
7271 * pointer to the next one after it. The last entry in the
7272 * the table is a NULL entry, so when we get to it, set cookie
7273 * to NULL and return that, indicating end of list, erstwhile
7274 * if we come in with cookie set to NULL, we are starting anew
7275 * at the front of the list.
7277 if (cookie != NULL) {
7278 ta = ipf_tune_findbycookie(&softc->ipf_tuners,
7279 cookie, &tu.ipft_cookie);
7281 ta = softc->ipf_tuners;
7282 tu.ipft_cookie = ta + 1;
7286 * Entry found, but does the data pointed to by that
7287 * row fit in what we can return?
7289 if (ta->ipft_sz > sizeof(tu.ipft_un)) {
7295 if (ta->ipft_sz == sizeof(u_long))
7296 tu.ipft_vlong = *ta->ipft_plong;
7297 else if (ta->ipft_sz == sizeof(u_int))
7298 tu.ipft_vint = *ta->ipft_pint;
7299 else if (ta->ipft_sz == sizeof(u_short))
7300 tu.ipft_vshort = *ta->ipft_pshort;
7301 else if (ta->ipft_sz == sizeof(u_char))
7302 tu.ipft_vchar = *ta->ipft_pchar;
7304 tu.ipft_sz = ta->ipft_sz;
7305 tu.ipft_min = ta->ipft_min;
7306 tu.ipft_max = ta->ipft_max;
7307 tu.ipft_flags = ta->ipft_flags;
7308 bcopy(ta->ipft_name, tu.ipft_name,
7309 MIN(sizeof(tu.ipft_name),
7310 strlen(ta->ipft_name) + 1));
7312 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE);
7318 * Search by name or by cookie value for a particular entry
7319 * in the tuning paramter table.
7323 if (cookie != NULL) {
7324 ta = ipf_tune_findbycookie(&softc->ipf_tuners,
7328 } else if (tu.ipft_name[0] != '\0') {
7329 ta = ipf_tune_findbyname(softc->ipf_tuners,
7337 if (cmd == (ioctlcmd_t)SIOCIPFGET) {
7339 * Fetch the tuning parameters for a particular value
7342 if (ta->ipft_sz == sizeof(u_long))
7343 tu.ipft_vlong = *ta->ipft_plong;
7344 else if (ta->ipft_sz == sizeof(u_int))
7345 tu.ipft_vint = *ta->ipft_pint;
7346 else if (ta->ipft_sz == sizeof(u_short))
7347 tu.ipft_vshort = *ta->ipft_pshort;
7348 else if (ta->ipft_sz == sizeof(u_char))
7349 tu.ipft_vchar = *ta->ipft_pchar;
7350 tu.ipft_cookie = ta;
7351 tu.ipft_sz = ta->ipft_sz;
7352 tu.ipft_min = ta->ipft_min;
7353 tu.ipft_max = ta->ipft_max;
7354 tu.ipft_flags = ta->ipft_flags;
7355 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE);
7357 } else if (cmd == (ioctlcmd_t)SIOCIPFSET) {
7359 * Set an internal parameter. The hard part here is
7360 * getting the new value safely and correctly out of
7361 * the kernel (given we only know its size, not type.)
7365 if (((ta->ipft_flags & IPFT_WRDISABLED) != 0) &&
7366 (softc->ipf_running > 0)) {
7373 if (in < ta->ipft_min || in > ta->ipft_max) {
7379 if (ta->ipft_func != NULL) {
7383 error = (*ta->ipft_func)(softc, ta,
7387 } else if (ta->ipft_sz == sizeof(u_long)) {
7388 tu.ipft_vlong = *ta->ipft_plong;
7389 *ta->ipft_plong = in;
7391 } else if (ta->ipft_sz == sizeof(u_int)) {
7392 tu.ipft_vint = *ta->ipft_pint;
7393 *ta->ipft_pint = (u_int)(in & 0xffffffff);
7395 } else if (ta->ipft_sz == sizeof(u_short)) {
7396 tu.ipft_vshort = *ta->ipft_pshort;
7397 *ta->ipft_pshort = (u_short)(in & 0xffff);
7399 } else if (ta->ipft_sz == sizeof(u_char)) {
7400 tu.ipft_vchar = *ta->ipft_pchar;
7401 *ta->ipft_pchar = (u_char)(in & 0xff);
7403 error = ipf_outobj(softc, data, &tu, IPFOBJ_TUNEABLE);
7417 /* ------------------------------------------------------------------------ */
7418 /* Function: ipf_zerostats */
7419 /* Returns: int - 0 = success, else failure */
7420 /* Parameters: data(O) - pointer to pointer for copying data back to */
7422 /* Copies the current statistics out to userspace and then zero's the */
7423 /* current ones in the kernel. The lock is only held across the bzero() as */
7424 /* the copyout may result in paging (ie network activity.) */
7425 /* ------------------------------------------------------------------------ */
7427 ipf_zerostats(softc, data)
7428 ipf_main_softc_t *softc;
7435 error = ipf_inobj(softc, data, &obj, &fio, IPFOBJ_IPFSTAT);
7438 ipf_getstat(softc, &fio, obj.ipfo_rev);
7439 error = ipf_outobj(softc, data, &fio, IPFOBJ_IPFSTAT);
7443 WRITE_ENTER(&softc->ipf_mutex);
7444 bzero(&softc->ipf_stats, sizeof(softc->ipf_stats));
7445 RWLOCK_EXIT(&softc->ipf_mutex);
7451 /* ------------------------------------------------------------------------ */
7452 /* Function: ipf_resolvedest */
7454 /* Parameters: softc(I) - pointer to soft context main structure */
7455 /* base(I) - where strings are stored */
7456 /* fdp(IO) - pointer to destination information to resolve */
7457 /* v(I) - IP protocol version to match */
7459 /* Looks up an interface name in the frdest structure pointed to by fdp and */
7460 /* if a matching name can be found for the particular IP protocol version */
7461 /* then store the interface pointer in the frdest struct. If no match is */
7462 /* found, then set the interface pointer to be -1 as NULL is considered to */
7463 /* indicate there is no information at all in the structure. */
7464 /* ------------------------------------------------------------------------ */
7466 ipf_resolvedest(softc, base, fdp, v)
7467 ipf_main_softc_t *softc;
7477 if (fdp->fd_name != -1) {
7478 if (fdp->fd_type == FRD_DSTLIST) {
7479 ifp = ipf_lookup_res_name(softc, IPL_LOGIPF,
7481 base + fdp->fd_name,
7488 ifp = GETIFP(base + fdp->fd_name, v);
7495 if ((ifp != NULL) && (ifp != (void *)-1)) {
7496 fdp->fd_local = ipf_deliverlocal(softc, v, ifp, &fdp->fd_ip6);
7503 /* ------------------------------------------------------------------------ */
7504 /* Function: ipf_resolvenic */
7505 /* Returns: void* - NULL = wildcard name, -1 = failed to find NIC, else */
7506 /* pointer to interface structure for NIC */
7507 /* Parameters: softc(I)- pointer to soft context main structure */
7508 /* name(I) - complete interface name */
7509 /* v(I) - IP protocol version */
7511 /* Look for a network interface structure that firstly has a matching name */
7512 /* to that passed in and that is also being used for that IP protocol */
7513 /* version (necessary on some platforms where there are separate listings */
7514 /* for both IPv4 and IPv6 on the same physical NIC. */
7515 /* ------------------------------------------------------------------------ */
7517 ipf_resolvenic(softc, name, v)
7518 ipf_main_softc_t *softc;
7524 softc = softc; /* gcc -Wextra */
7525 if (name[0] == '\0')
7528 if ((name[1] == '\0') && ((name[0] == '-') || (name[0] == '*'))) {
7532 nic = GETIFP(name, v);
7539 /* ------------------------------------------------------------------------ */
7540 /* Function: ipf_token_expire */
7541 /* Returns: None. */
7542 /* Parameters: softc(I) - pointer to soft context main structure */
7544 /* This function is run every ipf tick to see if there are any tokens that */
7545 /* have been held for too long and need to be freed up. */
7546 /* ------------------------------------------------------------------------ */
7548 ipf_token_expire(softc)
7549 ipf_main_softc_t *softc;
7553 WRITE_ENTER(&softc->ipf_tokens);
7554 while ((it = softc->ipf_token_head) != NULL) {
7555 if (it->ipt_die > softc->ipf_ticks)
7558 ipf_token_deref(softc, it);
7560 RWLOCK_EXIT(&softc->ipf_tokens);
7564 /* ------------------------------------------------------------------------ */
7565 /* Function: ipf_token_flush */
7566 /* Returns: None. */
7567 /* Parameters: softc(I) - pointer to soft context main structure */
7569 /* Loop through all of the existing tokens and call deref to see if they */
7570 /* can be freed. Normally a function like this might just loop on */
7571 /* ipf_token_head but there is a chance that a token might have a ref count */
7572 /* of greater than one and in that case the the reference would drop twice */
7573 /* by code that is only entitled to drop it once. */
7574 /* ------------------------------------------------------------------------ */
7576 ipf_token_flush(softc)
7577 ipf_main_softc_t *softc;
7579 ipftoken_t *it, *next;
7581 WRITE_ENTER(&softc->ipf_tokens);
7582 for (it = softc->ipf_token_head; it != NULL; it = next) {
7583 next = it->ipt_next;
7584 (void) ipf_token_deref(softc, it);
7586 RWLOCK_EXIT(&softc->ipf_tokens);
7590 /* ------------------------------------------------------------------------ */
7591 /* Function: ipf_token_del */
7592 /* Returns: int - 0 = success, else error */
7593 /* Parameters: softc(I)- pointer to soft context main structure */
7594 /* type(I) - the token type to match */
7595 /* uid(I) - uid owning the token */
7596 /* ptr(I) - context pointer for the token */
7598 /* This function looks for a a token in the current list that matches up */
7599 /* the fields (type, uid, ptr). If none is found, ESRCH is returned, else */
7600 /* call ipf_token_dewref() to remove it from the list. In the event that */
7601 /* the token has a reference held elsewhere, setting ipt_complete to 2 */
7602 /* enables debugging to distinguish between the two paths that ultimately */
7603 /* lead to a token to be deleted. */
7604 /* ------------------------------------------------------------------------ */
7606 ipf_token_del(softc, type, uid, ptr)
7607 ipf_main_softc_t *softc;
7617 WRITE_ENTER(&softc->ipf_tokens);
7618 for (it = softc->ipf_token_head; it != NULL; it = it->ipt_next) {
7619 if (ptr == it->ipt_ctx && type == it->ipt_type &&
7620 uid == it->ipt_uid) {
7621 it->ipt_complete = 2;
7622 ipf_token_deref(softc, it);
7627 RWLOCK_EXIT(&softc->ipf_tokens);
7633 /* ------------------------------------------------------------------------ */
7634 /* Function: ipf_token_mark_complete */
7635 /* Returns: None. */
7636 /* Parameters: token(I) - pointer to token structure */
7638 /* Mark a token as being ineligable for being found with ipf_token_find. */
7639 /* ------------------------------------------------------------------------ */
7641 ipf_token_mark_complete(token)
7644 if (token->ipt_complete == 0)
7645 token->ipt_complete = 1;
7649 /* ------------------------------------------------------------------------ */
7650 /* Function: ipf_token_find */
7651 /* Returns: ipftoken_t * - NULL if no memory, else pointer to token */
7652 /* Parameters: softc(I)- pointer to soft context main structure */
7653 /* type(I) - the token type to match */
7654 /* uid(I) - uid owning the token */
7655 /* ptr(I) - context pointer for the token */
7657 /* This function looks for a live token in the list of current tokens that */
7658 /* matches the tuple (type, uid, ptr). If one cannot be found then one is */
7659 /* allocated. If one is found then it is moved to the top of the list of */
7660 /* currently active tokens. */
7661 /* ------------------------------------------------------------------------ */
7663 ipf_token_find(softc, type, uid, ptr)
7664 ipf_main_softc_t *softc;
7668 ipftoken_t *it, *new;
7670 KMALLOC(new, ipftoken_t *);
7672 bzero((char *)new, sizeof(*new));
7674 WRITE_ENTER(&softc->ipf_tokens);
7675 for (it = softc->ipf_token_head; it != NULL; it = it->ipt_next) {
7676 if ((ptr == it->ipt_ctx) && (type == it->ipt_type) &&
7677 (uid == it->ipt_uid) && (it->ipt_complete < 2))
7685 RWLOCK_EXIT(&softc->ipf_tokens);
7690 it->ipt_type = type;
7698 if (it->ipt_complete > 0)
7701 ipf_token_unlink(softc, it);
7705 it->ipt_pnext = softc->ipf_token_tail;
7706 *softc->ipf_token_tail = it;
7707 softc->ipf_token_tail = &it->ipt_next;
7708 it->ipt_next = NULL;
7711 it->ipt_die = softc->ipf_ticks + 20;
7714 RWLOCK_EXIT(&softc->ipf_tokens);
7720 /* ------------------------------------------------------------------------ */
7721 /* Function: ipf_token_unlink */
7722 /* Returns: None. */
7723 /* Parameters: softc(I) - pointer to soft context main structure */
7724 /* token(I) - pointer to token structure */
7725 /* Write Locks: ipf_tokens */
7727 /* This function unlinks a token structure from the linked list of tokens */
7728 /* that "own" it. The head pointer never needs to be explicitly adjusted */
7729 /* but the tail does due to the linked list implementation. */
7730 /* ------------------------------------------------------------------------ */
7732 ipf_token_unlink(softc, token)
7733 ipf_main_softc_t *softc;
7737 if (softc->ipf_token_tail == &token->ipt_next)
7738 softc->ipf_token_tail = token->ipt_pnext;
7740 *token->ipt_pnext = token->ipt_next;
7741 if (token->ipt_next != NULL)
7742 token->ipt_next->ipt_pnext = token->ipt_pnext;
7743 token->ipt_next = NULL;
7744 token->ipt_pnext = NULL;
7748 /* ------------------------------------------------------------------------ */
7749 /* Function: ipf_token_deref */
7750 /* Returns: int - 0 == token freed, else reference count */
7751 /* Parameters: softc(I) - pointer to soft context main structure */
7752 /* token(I) - pointer to token structure */
7753 /* Write Locks: ipf_tokens */
7755 /* Drop the reference count on the token structure and if it drops to zero, */
7756 /* call the dereference function for the token type because it is then */
7757 /* possible to free the token data structure. */
7758 /* ------------------------------------------------------------------------ */
7760 ipf_token_deref(softc, token)
7761 ipf_main_softc_t *softc;
7764 void *data, **datap;
7766 ASSERT(token->ipt_ref > 0);
7768 if (token->ipt_ref > 0)
7769 return token->ipt_ref;
7771 data = token->ipt_data;
7774 if ((data != NULL) && (data != (void *)-1)) {
7775 switch (token->ipt_type)
7777 case IPFGENITER_IPF :
7778 (void) ipf_derefrule(softc, (frentry_t **)datap);
7780 case IPFGENITER_IPNAT :
7781 WRITE_ENTER(&softc->ipf_nat);
7782 ipf_nat_rule_deref(softc, (ipnat_t **)datap);
7783 RWLOCK_EXIT(&softc->ipf_nat);
7785 case IPFGENITER_NAT :
7786 ipf_nat_deref(softc, (nat_t **)datap);
7788 case IPFGENITER_STATE :
7789 ipf_state_deref(softc, (ipstate_t **)datap);
7791 case IPFGENITER_FRAG :
7792 ipf_frag_pkt_deref(softc, (ipfr_t **)datap);
7794 case IPFGENITER_NATFRAG :
7795 ipf_frag_nat_deref(softc, (ipfr_t **)datap);
7797 case IPFGENITER_HOSTMAP :
7798 WRITE_ENTER(&softc->ipf_nat);
7799 ipf_nat_hostmapdel(softc, (hostmap_t **)datap);
7800 RWLOCK_EXIT(&softc->ipf_nat);
7803 ipf_lookup_iterderef(softc, token->ipt_type, data);
7808 ipf_token_unlink(softc, token);
7814 /* ------------------------------------------------------------------------ */
7815 /* Function: ipf_nextrule */
7816 /* Returns: frentry_t * - NULL == no more rules, else pointer to next */
7817 /* Parameters: softc(I) - pointer to soft context main structure */
7818 /* fr(I) - pointer to filter rule */
7819 /* out(I) - 1 == out rules, 0 == input rules */
7821 /* Starting with "fr", find the next rule to visit. This includes visiting */
7822 /* the list of rule groups if either fr is NULL (empty list) or it is the */
7823 /* last rule in the list. When walking rule lists, it is either input or */
7824 /* output rules that are returned, never both. */
7825 /* ------------------------------------------------------------------------ */
7827 ipf_nextrule(softc, active, unit, fr, out)
7828 ipf_main_softc_t *softc;
7836 if (fr != NULL && fr->fr_group != -1) {
7837 fg = ipf_findgroup(softc, fr->fr_names + fr->fr_group,
7838 unit, active, NULL);
7842 fg = softc->ipf_groups[unit][active];
7845 while (fg != NULL) {
7846 next = fg->fg_start;
7847 while (next != NULL) {
7849 if (next->fr_flags & FR_OUTQUE)
7851 } else if (next->fr_flags & FR_INQUE) {
7854 next = next->fr_next;
7863 /* ------------------------------------------------------------------------ */
7864 /* Function: ipf_getnextrule */
7865 /* Returns: int - 0 = success, else error */
7866 /* Parameters: softc(I)- pointer to soft context main structure */
7867 /* t(I) - pointer to destination information to resolve */
7868 /* ptr(I) - pointer to ipfobj_t to copyin from user space */
7870 /* This function's first job is to bring in the ipfruleiter_t structure via */
7871 /* the ipfobj_t structure to determine what should be the next rule to */
7872 /* return. Once the ipfruleiter_t has been brought in, it then tries to */
7873 /* find the 'next rule'. This may include searching rule group lists or */
7874 /* just be as simple as looking at the 'next' field in the rule structure. */
7875 /* When we have found the rule to return, increase its reference count and */
7876 /* if we used an existing rule to get here, decrease its reference count. */
7877 /* ------------------------------------------------------------------------ */
7879 ipf_getnextrule(softc, t, ptr)
7880 ipf_main_softc_t *softc;
7884 frentry_t *fr, *next, zero;
7893 if (t == NULL || ptr == NULL) {
7898 error = ipf_inobj(softc, ptr, &obj, &it, IPFOBJ_IPFITER);
7902 if ((it.iri_inout < 0) || (it.iri_inout > 3)) {
7906 if ((it.iri_active != 0) && (it.iri_active != 1)) {
7910 if (it.iri_nrules == 0) {
7914 if (it.iri_rule == NULL) {
7921 if ((it.iri_inout & F_OUT) != 0)
7925 if ((it.iri_inout & F_ACIN) != 0)
7926 unit = IPL_LOGCOUNT;
7930 READ_ENTER(&softc->ipf_mutex);
7932 if (*it.iri_group == '\0') {
7933 if (unit == IPL_LOGCOUNT) {
7934 next = softc->ipf_acct[out][it.iri_active];
7936 next = softc->ipf_rules[out][it.iri_active];
7939 next = ipf_nextrule(softc, it.iri_active,
7942 fg = ipf_findgroup(softc, it.iri_group, unit,
7943 it.iri_active, NULL);
7945 next = fg->fg_start;
7952 next = ipf_nextrule(softc, it.iri_active, unit,
7956 if (next != NULL && next->fr_next != NULL)
7958 else if (ipf_nextrule(softc, it.iri_active, unit, next, out) != NULL)
7964 (void) ipf_derefrule(softc, &fr);
7966 obj.ipfo_type = IPFOBJ_FRENTRY;
7967 dst = (char *)it.iri_rule;
7970 obj.ipfo_size = next->fr_size;
7971 MUTEX_ENTER(&next->fr_lock);
7973 MUTEX_EXIT(&next->fr_lock);
7976 obj.ipfo_size = sizeof(frentry_t);
7977 bzero(&zero, sizeof(zero));
7981 it.iri_rule = predict ? next : NULL;
7983 ipf_token_mark_complete(t);
7985 RWLOCK_EXIT(&softc->ipf_mutex);
7988 error = ipf_outobjk(softc, &obj, next);
7989 if (error == 0 && t->ipt_data != NULL) {
7990 dst += obj.ipfo_size;
7991 if (next->fr_data != NULL) {
7994 if (next->fr_type == FR_T_IPFEXPR)
7995 dobj.ipfo_type = IPFOBJ_IPFEXPR;
7997 dobj.ipfo_type = IPFOBJ_FRIPF;
7998 dobj.ipfo_size = next->fr_dsize;
7999 dobj.ipfo_rev = obj.ipfo_rev;
8000 dobj.ipfo_ptr = dst;
8001 error = ipf_outobjk(softc, &dobj, next->fr_data);
8005 if ((fr != NULL) && (next == &zero))
8006 (void) ipf_derefrule(softc, &fr);
8012 /* ------------------------------------------------------------------------ */
8013 /* Function: ipf_frruleiter */
8014 /* Returns: int - 0 = success, else error */
8015 /* Parameters: softc(I)- pointer to soft context main structure */
8016 /* data(I) - the token type to match */
8017 /* uid(I) - uid owning the token */
8018 /* ptr(I) - context pointer for the token */
8020 /* This function serves as a stepping stone between ipf_ipf_ioctl and */
8021 /* ipf_getnextrule. It's role is to find the right token in the kernel for */
8022 /* the process doing the ioctl and use that to ask for the next rule. */
8023 /* ------------------------------------------------------------------------ */
8025 ipf_frruleiter(softc, data, uid, ctx)
8026 ipf_main_softc_t *softc;
8035 token = ipf_token_find(softc, IPFGENITER_IPF, uid, ctx);
8036 if (token != NULL) {
8037 error = ipf_getnextrule(softc, token, data);
8038 WRITE_ENTER(&softc->ipf_tokens);
8039 ipf_token_deref(softc, token);
8040 RWLOCK_EXIT(&softc->ipf_tokens);
8042 error = ipf_inobj(softc, data, &obj, &it, IPFOBJ_IPFITER);
8046 error = ipf_outobj(softc, data, &it, IPFOBJ_IPFITER);
8053 /* ------------------------------------------------------------------------ */
8054 /* Function: ipf_geniter */
8055 /* Returns: int - 0 = success, else error */
8056 /* Parameters: softc(I) - pointer to soft context main structure */
8057 /* token(I) - pointer to ipftoken_t structure */
8058 /* itp(I) - pointer to iterator data */
8060 /* Decide which iterator function to call using information passed through */
8061 /* the ipfgeniter_t structure at itp. */
8062 /* ------------------------------------------------------------------------ */
8064 ipf_geniter(softc, token, itp)
8065 ipf_main_softc_t *softc;
8071 switch (itp->igi_type)
8073 case IPFGENITER_FRAG :
8074 error = ipf_frag_pkt_next(softc, token, itp);
8086 /* ------------------------------------------------------------------------ */
8087 /* Function: ipf_genericiter */
8088 /* Returns: int - 0 = success, else error */
8089 /* Parameters: softc(I)- pointer to soft context main structure */
8090 /* data(I) - the token type to match */
8091 /* uid(I) - uid owning the token */
8092 /* ptr(I) - context pointer for the token */
8094 /* Handle the SIOCGENITER ioctl for the ipfilter device. The primary role */
8095 /* ------------------------------------------------------------------------ */
8097 ipf_genericiter(softc, data, uid, ctx)
8098 ipf_main_softc_t *softc;
8106 error = ipf_inobj(softc, data, NULL, &iter, IPFOBJ_GENITER);
8110 token = ipf_token_find(softc, iter.igi_type, uid, ctx);
8111 if (token != NULL) {
8112 token->ipt_subtype = iter.igi_type;
8113 error = ipf_geniter(softc, token, &iter);
8114 WRITE_ENTER(&softc->ipf_tokens);
8115 ipf_token_deref(softc, token);
8116 RWLOCK_EXIT(&softc->ipf_tokens);
8126 /* ------------------------------------------------------------------------ */
8127 /* Function: ipf_ipf_ioctl */
8128 /* Returns: int - 0 = success, else error */
8129 /* Parameters: softc(I)- pointer to soft context main structure */
8130 /* data(I) - the token type to match */
8131 /* cmd(I) - the ioctl command number */
8132 /* mode(I) - mode flags for the ioctl */
8133 /* uid(I) - uid owning the token */
8134 /* ptr(I) - context pointer for the token */
8136 /* This function handles all of the ioctl command that are actually isssued */
8137 /* to the /dev/ipl device. */
8138 /* ------------------------------------------------------------------------ */
8140 ipf_ipf_ioctl(softc, data, cmd, mode, uid, ctx)
8141 ipf_main_softc_t *softc;
8155 if (!(mode & FWRITE)) {
8159 error = BCOPYIN(data, &tmp, sizeof(tmp));
8166 WRITE_ENTER(&softc->ipf_global);
8168 if (softc->ipf_running > 0)
8171 error = ipfattach(softc);
8173 softc->ipf_running = 1;
8175 (void) ipfdetach(softc);
8177 if (softc->ipf_running == 1)
8178 error = ipfdetach(softc);
8182 softc->ipf_running = -1;
8184 RWLOCK_EXIT(&softc->ipf_global);
8189 if (!(mode & FWRITE)) {
8195 case SIOCIPFGETNEXT :
8197 error = ipf_ipftune(softc, cmd, (void *)data);
8201 if (!(mode & FWRITE)) {
8205 error = BCOPYIN(data, &softc->ipf_flags,
8206 sizeof(softc->ipf_flags));
8215 error = BCOPYOUT(&softc->ipf_flags, data,
8216 sizeof(softc->ipf_flags));
8224 error = ipf_resolvefunc(softc, (void *)data);
8231 if (!(mode & FWRITE)) {
8235 error = frrequest(softc, IPL_LOGIPF, cmd, (caddr_t)data,
8236 softc->ipf_active, 1);
8243 if (!(mode & FWRITE)) {
8247 error = frrequest(softc, IPL_LOGIPF, cmd, (caddr_t)data,
8248 1 - softc->ipf_active, 1);
8253 if (!(mode & FWRITE)) {
8257 WRITE_ENTER(&softc->ipf_mutex);
8258 error = BCOPYOUT(&softc->ipf_active, data,
8259 sizeof(softc->ipf_active));
8264 softc->ipf_active = 1 - softc->ipf_active;
8266 RWLOCK_EXIT(&softc->ipf_mutex);
8271 error = ipf_inobj(softc, (void *)data, &obj, &fio,
8275 ipf_getstat(softc, &fio, obj.ipfo_rev);
8276 error = ipf_outobj(softc, (void *)data, &fio, IPFOBJ_IPFSTAT);
8280 if (!(mode & FWRITE)) {
8284 error = ipf_zerostats(softc, (caddr_t)data);
8288 if (!(mode & FWRITE)) {
8292 error = BCOPYIN(data, &tmp, sizeof(tmp));
8294 tmp = ipf_flush(softc, IPL_LOGIPF, tmp);
8295 error = BCOPYOUT(&tmp, data, sizeof(tmp));
8309 if (!(mode & FWRITE)) {
8313 error = BCOPYIN(data, &tmp, sizeof(tmp));
8315 tmp = ipf_flush(softc, IPL_LOGIPF, tmp);
8316 error = BCOPYOUT(&tmp, data, sizeof(tmp));
8330 if (!(mode & FWRITE)) {
8334 error = BCOPYIN(data, &tmp, sizeof(tmp));
8336 ipf_state_setlock(softc->ipf_state_soft, tmp);
8337 ipf_nat_setlock(softc->ipf_nat_soft, tmp);
8338 ipf_frag_setlock(softc->ipf_frag_soft, tmp);
8339 ipf_auth_setlock(softc->ipf_auth_soft, tmp);
8349 if (!(mode & FWRITE)) {
8353 tmp = ipf_log_clear(softc, IPL_LOGIPF);
8354 error = BCOPYOUT(&tmp, data, sizeof(tmp));
8361 #endif /* IPFILTER_LOG */
8364 if (!(mode & FWRITE)) {
8368 WRITE_ENTER(&softc->ipf_global);
8369 #if (defined(MENTAT) && defined(_KERNEL)) && !defined(INSTANCES)
8372 ipf_sync(softc, NULL);
8375 RWLOCK_EXIT(&softc->ipf_global);
8381 error = ipf_outobj(softc, (void *)data,
8382 ipf_frag_stats(softc->ipf_frag_soft),
8388 tmp = ipf_log_bytesused(softc, IPL_LOGIPF);
8389 error = BCOPYOUT(&tmp, data, sizeof(tmp));
8395 error = ipf_frruleiter(softc, data, uid, ctx);
8401 error = ipf_genericiter(softc, data, uid, ctx);
8405 case SIOCIPFDELTOK :
8406 error = BCOPYIN(data, &tmp, sizeof(tmp));
8409 error = ipf_token_del(softc, tmp, uid, ctx);
8424 /* ------------------------------------------------------------------------ */
8425 /* Function: ipf_decaps */
8426 /* Returns: int - -1 == decapsulation failed, else bit mask of */
8427 /* flags indicating packet filtering decision. */
8428 /* Parameters: fin(I) - pointer to packet information */
8429 /* pass(I) - IP protocol version to match */
8430 /* l5proto(I) - layer 5 protocol to decode UDP data as. */
8432 /* This function is called for packets that are wrapt up in other packets, */
8433 /* for example, an IP packet that is the entire data segment for another IP */
8434 /* packet. If the basic constraints for this are satisfied, change the */
8435 /* buffer to point to the start of the inner packet and start processing */
8436 /* rules belonging to the head group this rule specifies. */
8437 /* ------------------------------------------------------------------------ */
8439 ipf_decaps(fin, pass, l5proto)
8444 fr_info_t fin2, *fino = NULL;
8450 if ((fin->fin_flx & FI_COALESCE) == 0)
8451 if (ipf_coalesce(fin) == -1)
8455 hlen = fin->fin_hlen;
8461 * In this case, the specific protocol being decapsulated
8462 * inside UDP frames comes from the rule.
8464 nh = fin->fin_fr->fr_icode;
8467 case IPPROTO_GRE : /* 47 */
8468 bcopy(fin->fin_dp, (char *)&gre, sizeof(gre));
8469 hlen += sizeof(grehdr_t);
8470 if (gre.gr_R|gre.gr_s)
8482 * If the routing options flag is set, validate that it is
8483 * there and bounce over it.
8486 /* This is really heavy weight and lots of room for error, */
8487 /* so for now, put it off and get the simple stuff right. */
8489 u_char off, len, *s;
8496 aplen = fin->fin_plen - hlen;
8498 af = (s[0] << 8) | s[1];
8503 if (af == 0 && len == 0) {
8514 hlen = s - (u_char *)fin->fin_dp;
8520 case IPPROTO_IPIP : /* 4 */
8525 default : /* Includes ESP, AH is special for IPv4 */
8538 bcopy((char *)fin, (char *)&fin2, sizeof(fin2));
8542 #if defined(MENTAT) && defined(_KERNEL)
8548 fin->fin_plen -= elen;
8550 ip = (ip_t *)((char *)fin->fin_ip + elen);
8553 * Make sure we have at least enough data for the network layer
8557 hlen = IP_HL(ip) << 2;
8559 else if (IP_V(ip) == 6)
8560 hlen = sizeof(ip6_t);
8565 if (fin->fin_plen < hlen)
8568 fin->fin_dp = (char *)ip + hlen;
8570 if (IP_V(ip) == 4) {
8572 * Perform IPv4 header checksum validation.
8574 if (ipf_cksum((u_short *)ip, hlen))
8578 if (ipf_makefrip(hlen, ip, fin) == -1) {
8581 #if defined(MENTAT) && defined(_KERNEL)
8589 DT1(frb_decapfrip, fr_info_t *, fin);
8590 pass &= ~FR_CMDMASK;
8591 pass |= FR_BLOCK|FR_QUICK;
8592 fin->fin_reason = FRB_DECAPFRIP;
8596 pass = ipf_scanlist(fin, pass);
8599 * Copy the packet filter "result" fields out of the fr_info_t struct
8600 * that is local to the decapsulation processing and back into the
8601 * one we were called with.
8603 fino->fin_flx = fin->fin_flx;
8604 fino->fin_rev = fin->fin_rev;
8605 fino->fin_icode = fin->fin_icode;
8606 fino->fin_rule = fin->fin_rule;
8607 (void) strncpy(fino->fin_group, fin->fin_group, FR_GROUPLEN);
8608 fino->fin_fr = fin->fin_fr;
8609 fino->fin_error = fin->fin_error;
8610 fino->fin_mp = fin->fin_mp;
8611 fino->fin_m = fin->fin_m;
8614 #if defined(MENTAT) && defined(_KERNEL)
8625 /* ------------------------------------------------------------------------ */
8626 /* Function: ipf_matcharray_load */
8627 /* Returns: int - 0 = success, else error */
8628 /* Parameters: softc(I) - pointer to soft context main structure */
8629 /* data(I) - pointer to ioctl data */
8630 /* objp(I) - ipfobj_t structure to load data into */
8631 /* arrayptr(I) - pointer to location to store array pointer */
8633 /* This function loads in a mathing array through the ipfobj_t struct that */
8634 /* describes it. Sanity checking and array size limitations are enforced */
8635 /* in this function to prevent userspace from trying to load in something */
8636 /* that is insanely big. Once the size of the array is known, the memory */
8637 /* required is malloc'd and returned through changing *arrayptr. The */
8638 /* contents of the array are verified before returning. Only in the event */
8639 /* of a successful call is the caller required to free up the malloc area. */
8640 /* ------------------------------------------------------------------------ */
8642 ipf_matcharray_load(softc, data, objp, arrayptr)
8643 ipf_main_softc_t *softc;
8648 int arraysize, *array, error;
8652 error = BCOPYIN(data, objp, sizeof(*objp));
8658 if (objp->ipfo_type != IPFOBJ_IPFEXPR) {
8663 if (((objp->ipfo_size & 3) != 0) || (objp->ipfo_size == 0) ||
8664 (objp->ipfo_size > 1024)) {
8669 arraysize = objp->ipfo_size * sizeof(*array);
8670 KMALLOCS(array, int *, arraysize);
8671 if (array == NULL) {
8676 error = COPYIN(objp->ipfo_ptr, array, arraysize);
8678 KFREES(array, arraysize);
8683 if (ipf_matcharray_verify(array, arraysize) != 0) {
8684 KFREES(array, arraysize);
8694 /* ------------------------------------------------------------------------ */
8695 /* Function: ipf_matcharray_verify */
8697 /* Parameters: array(I) - pointer to matching array */
8698 /* arraysize(I) - number of elements in the array */
8700 /* Verify the contents of a matching array by stepping through each element */
8701 /* in it. The actual commands in the array are not verified for */
8702 /* correctness, only that all of the sizes are correctly within limits. */
8703 /* ------------------------------------------------------------------------ */
8705 ipf_matcharray_verify(array, arraysize)
8706 int *array, arraysize;
8708 int i, nelem, maxidx;
8711 nelem = arraysize / sizeof(*array);
8714 * Currently, it makes no sense to have an array less than 6
8715 * elements long - the initial size at the from, a single operation
8716 * (minimum 4 in length) and a trailer, for a total of 6.
8718 if ((array[0] < 6) || (arraysize < 24) || (arraysize > 4096)) {
8723 * Verify the size of data pointed to by array with how long
8724 * the array claims to be itself.
8726 if (array[0] * sizeof(*array) != arraysize) {
8732 * The last opcode in this array should be an IPF_EXP_END.
8734 if (array[maxidx] != IPF_EXP_END) {
8738 for (i = 1; i < maxidx; ) {
8739 e = (ipfexp_t *)(array + i);
8742 * The length of the bits to check must be at least 1
8743 * (or else there is nothing to comapre with!) and it
8744 * cannot exceed the length of the data present.
8746 if ((e->ipfe_size < 1 ) ||
8747 (e->ipfe_size + i > maxidx)) {
8756 /* ------------------------------------------------------------------------ */
8757 /* Function: ipf_fr_matcharray */
8758 /* Returns: int - 0 = match failed, else positive match */
8759 /* Parameters: fin(I) - pointer to packet information */
8760 /* array(I) - pointer to matching array */
8762 /* This function is used to apply a matching array against a packet and */
8763 /* return an indication of whether or not the packet successfully matches */
8764 /* all of the commands in it. */
8765 /* ------------------------------------------------------------------------ */
8767 ipf_fr_matcharray(fin, array)
8771 int i, n, *x, rv, p;
8778 for (; n > 0; x += 3 + x[3], rv = 0) {
8780 if (e->ipfe_cmd == IPF_EXP_END)
8785 * The upper 16 bits currently store the protocol value.
8786 * This is currently used with TCP and UDP port compares and
8787 * allows "tcp.port = 80" without requiring an explicit
8788 " "ip.pr = tcp" first.
8790 p = e->ipfe_cmd >> 16;
8791 if ((p != 0) && (p != fin->fin_p))
8794 switch (e->ipfe_cmd)
8796 case IPF_EXP_IP_PR :
8797 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8798 rv |= (fin->fin_p == e->ipfe_arg0[i]);
8802 case IPF_EXP_IP_SRCADDR :
8803 if (fin->fin_v != 4)
8805 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8806 rv |= ((fin->fin_saddr &
8807 e->ipfe_arg0[i * 2 + 1]) ==
8808 e->ipfe_arg0[i * 2]);
8812 case IPF_EXP_IP_DSTADDR :
8813 if (fin->fin_v != 4)
8815 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8816 rv |= ((fin->fin_daddr &
8817 e->ipfe_arg0[i * 2 + 1]) ==
8818 e->ipfe_arg0[i * 2]);
8822 case IPF_EXP_IP_ADDR :
8823 if (fin->fin_v != 4)
8825 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8826 rv |= ((fin->fin_saddr &
8827 e->ipfe_arg0[i * 2 + 1]) ==
8828 e->ipfe_arg0[i * 2]) ||
8830 e->ipfe_arg0[i * 2 + 1]) ==
8831 e->ipfe_arg0[i * 2]);
8836 case IPF_EXP_IP6_SRCADDR :
8837 if (fin->fin_v != 6)
8839 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8840 rv |= IP6_MASKEQ(&fin->fin_src6,
8841 &e->ipfe_arg0[i * 8 + 4],
8842 &e->ipfe_arg0[i * 8]);
8846 case IPF_EXP_IP6_DSTADDR :
8847 if (fin->fin_v != 6)
8849 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8850 rv |= IP6_MASKEQ(&fin->fin_dst6,
8851 &e->ipfe_arg0[i * 8 + 4],
8852 &e->ipfe_arg0[i * 8]);
8856 case IPF_EXP_IP6_ADDR :
8857 if (fin->fin_v != 6)
8859 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8860 rv |= IP6_MASKEQ(&fin->fin_src6,
8861 &e->ipfe_arg0[i * 8 + 4],
8862 &e->ipfe_arg0[i * 8]) ||
8863 IP6_MASKEQ(&fin->fin_dst6,
8864 &e->ipfe_arg0[i * 8 + 4],
8865 &e->ipfe_arg0[i * 8]);
8870 case IPF_EXP_UDP_PORT :
8871 case IPF_EXP_TCP_PORT :
8872 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8873 rv |= (fin->fin_sport == e->ipfe_arg0[i]) ||
8874 (fin->fin_dport == e->ipfe_arg0[i]);
8878 case IPF_EXP_UDP_SPORT :
8879 case IPF_EXP_TCP_SPORT :
8880 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8881 rv |= (fin->fin_sport == e->ipfe_arg0[i]);
8885 case IPF_EXP_UDP_DPORT :
8886 case IPF_EXP_TCP_DPORT :
8887 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8888 rv |= (fin->fin_dport == e->ipfe_arg0[i]);
8892 case IPF_EXP_TCP_FLAGS :
8893 for (i = 0; !rv && i < e->ipfe_narg; i++) {
8894 rv |= ((fin->fin_tcpf &
8895 e->ipfe_arg0[i * 2 + 1]) ==
8896 e->ipfe_arg0[i * 2]);
8910 /* ------------------------------------------------------------------------ */
8911 /* Function: ipf_queueflush */
8912 /* Returns: int - number of entries flushed (0 = none) */
8913 /* Parameters: softc(I) - pointer to soft context main structure */
8914 /* deletefn(I) - function to call to delete entry */
8915 /* ipfqs(I) - top of the list of ipf internal queues */
8916 /* userqs(I) - top of the list of user defined timeouts */
8918 /* This fucntion gets called when the state/NAT hash tables fill up and we */
8919 /* need to try a bit harder to free up some space. The algorithm used here */
8920 /* split into two parts but both halves have the same goal: to reduce the */
8921 /* number of connections considered to be "active" to the low watermark. */
8922 /* There are two steps in doing this: */
8923 /* 1) Remove any TCP connections that are already considered to be "closed" */
8924 /* but have not yet been removed from the state table. The two states */
8925 /* TCPS_TIME_WAIT and TCPS_CLOSED are considered to be the perfect */
8926 /* candidates for this style of removal. If freeing up entries in */
8927 /* CLOSED or both CLOSED and TIME_WAIT brings us to the low watermark, */
8928 /* we do not go on to step 2. */
8930 /* 2) Look for the oldest entries on each timeout queue and free them if */
8931 /* they are within the given window we are considering. Where the */
8932 /* window starts and the steps taken to increase its size depend upon */
8933 /* how long ipf has been running (ipf_ticks.) Anything modified in the */
8934 /* last 30 seconds is not touched. */
8936 /* die ipf_ticks 30*1.5 1800*1.5 | 43200*1.5 */
8938 /* future <--+----------+--------+-----------+-----+-----+-----------> past */
8939 /* now \_int=30s_/ \_int=1hr_/ \_int=12hr */
8941 /* Points to note: */
8942 /* - tqe_die is the time, in the future, when entries die. */
8943 /* - tqe_die - ipf_ticks is how long left the connection has to live in ipf */
8945 /* - tqe_touched is when the entry was last used by NAT/state */
8946 /* - the closer tqe_touched is to ipf_ticks, the further tqe_die will be */
8947 /* ipf_ticks any given timeout queue and vice versa. */
8948 /* - both tqe_die and tqe_touched increase over time */
8949 /* - timeout queues are sorted with the highest value of tqe_die at the */
8950 /* bottom and therefore the smallest values of each are at the top */
8951 /* - the pointer passed in as ipfqs should point to an array of timeout */
8952 /* queues representing each of the TCP states */
8954 /* We start by setting up a maximum range to scan for things to move of */
8955 /* iend (newest) to istart (oldest) in chunks of "interval". If nothing is */
8956 /* found in that range, "interval" is adjusted (so long as it isn't 30) and */
8957 /* we start again with a new value for "iend" and "istart". This is */
8958 /* continued until we either finish the scan of 30 second intervals or the */
8959 /* low water mark is reached. */
8960 /* ------------------------------------------------------------------------ */
8962 ipf_queueflush(softc, deletefn, ipfqs, userqs, activep, size, low)
8963 ipf_main_softc_t *softc;
8964 ipftq_delete_fn_t deletefn;
8965 ipftq_t *ipfqs, *userqs;
8969 u_long interval, istart, iend;
8970 ipftq_t *ifq, *ifqnext;
8971 ipftqent_t *tqe, *tqn;
8974 for (tqn = ipfqs[IPF_TCPS_CLOSED].ifq_head; ((tqe = tqn) != NULL); ) {
8975 tqn = tqe->tqe_next;
8976 if ((*deletefn)(softc, tqe->tqe_parent) == 0)
8979 if ((*activep * 100 / size) > low) {
8980 for (tqn = ipfqs[IPF_TCPS_TIME_WAIT].ifq_head;
8981 ((tqe = tqn) != NULL); ) {
8982 tqn = tqe->tqe_next;
8983 if ((*deletefn)(softc, tqe->tqe_parent) == 0)
8988 if ((*activep * 100 / size) <= low) {
8993 * NOTE: Use of "* 15 / 10" is required here because if "* 1.5" is
8994 * used then the operations are upgraded to floating point
8995 * and kernels don't like floating point...
8997 if (softc->ipf_ticks > IPF_TTLVAL(43200 * 15 / 10)) {
8998 istart = IPF_TTLVAL(86400 * 4);
8999 interval = IPF_TTLVAL(43200);
9000 } else if (softc->ipf_ticks > IPF_TTLVAL(1800 * 15 / 10)) {
9001 istart = IPF_TTLVAL(43200);
9002 interval = IPF_TTLVAL(1800);
9003 } else if (softc->ipf_ticks > IPF_TTLVAL(30 * 15 / 10)) {
9004 istart = IPF_TTLVAL(1800);
9005 interval = IPF_TTLVAL(30);
9009 if (istart > softc->ipf_ticks) {
9010 if (softc->ipf_ticks - interval < interval)
9013 istart = (softc->ipf_ticks / interval) * interval;
9016 iend = softc->ipf_ticks - interval;
9018 while ((*activep * 100 / size) > low) {
9021 try = softc->ipf_ticks - istart;
9023 for (ifq = ipfqs; ifq != NULL; ifq = ifq->ifq_next) {
9024 for (tqn = ifq->ifq_head; ((tqe = tqn) != NULL); ) {
9025 if (try < tqe->tqe_touched)
9027 tqn = tqe->tqe_next;
9028 if ((*deletefn)(softc, tqe->tqe_parent) == 0)
9033 for (ifq = userqs; ifq != NULL; ifq = ifqnext) {
9034 ifqnext = ifq->ifq_next;
9036 for (tqn = ifq->ifq_head; ((tqe = tqn) != NULL); ) {
9037 if (try < tqe->tqe_touched)
9039 tqn = tqe->tqe_next;
9040 if ((*deletefn)(softc, tqe->tqe_parent) == 0)
9046 if (interval == IPF_TTLVAL(43200)) {
9047 interval = IPF_TTLVAL(1800);
9048 } else if (interval == IPF_TTLVAL(1800)) {
9049 interval = IPF_TTLVAL(30);
9053 if (interval >= softc->ipf_ticks)
9056 iend = softc->ipf_ticks - interval;
9065 /* ------------------------------------------------------------------------ */
9066 /* Function: ipf_deliverlocal */
9067 /* Returns: int - 1 = local address, 0 = non-local address */
9068 /* Parameters: softc(I) - pointer to soft context main structure */
9069 /* ipversion(I) - IP protocol version (4 or 6) */
9070 /* ifp(I) - network interface pointer */
9071 /* ipaddr(I) - IPv4/6 destination address */
9073 /* This fucntion is used to determine in the address "ipaddr" belongs to */
9074 /* the network interface represented by ifp. */
9075 /* ------------------------------------------------------------------------ */
9077 ipf_deliverlocal(softc, ipversion, ifp, ipaddr)
9078 ipf_main_softc_t *softc;
9086 if (ipversion == 4) {
9087 if (ipf_ifpaddr(softc, 4, FRI_NORMAL, ifp, &addr, NULL) == 0) {
9088 if (addr.in4.s_addr == ipaddr->in4.s_addr)
9093 } else if (ipversion == 6) {
9094 if (ipf_ifpaddr(softc, 6, FRI_NORMAL, ifp, &addr, NULL) == 0) {
9095 if (IP6_EQ(&addr, ipaddr))
9105 /* ------------------------------------------------------------------------ */
9106 /* Function: ipf_settimeout */
9107 /* Returns: int - 0 = success, -1 = failure */
9108 /* Parameters: softc(I) - pointer to soft context main structure */
9109 /* t(I) - pointer to tuneable array entry */
9110 /* p(I) - pointer to values passed in to apply */
9112 /* This function is called to set the timeout values for each distinct */
9113 /* queue timeout that is available. When called, it calls into both the */
9114 /* state and NAT code, telling them to update their timeout queues. */
9115 /* ------------------------------------------------------------------------ */
9117 ipf_settimeout(softc, t, p)
9118 struct ipf_main_softc_s *softc;
9124 * ipf_interror should be set by the functions called here, not
9125 * by this function - it's just a middle man.
9127 if (ipf_state_settimeout(softc, t, p) == -1)
9129 if (ipf_nat_settimeout(softc, t, p) == -1)
9135 /* ------------------------------------------------------------------------ */
9136 /* Function: ipf_apply_timeout */
9137 /* Returns: int - 0 = success, -1 = failure */
9138 /* Parameters: head(I) - pointer to tuneable array entry */
9139 /* seconds(I) - pointer to values passed in to apply */
9141 /* This function applies a timeout of "seconds" to the timeout queue that */
9142 /* is pointed to by "head". All entries on this list have an expiration */
9143 /* set to be the current tick value of ipf plus the ttl. Given that this */
9144 /* function should only be called when the delta is non-zero, the task is */
9145 /* to walk the entire list and apply the change. The sort order will not */
9146 /* change. The only catch is that this is O(n) across the list, so if the */
9147 /* queue has lots of entries (10s of thousands or 100s of thousands), it */
9148 /* could take a relatively long time to work through them all. */
9149 /* ------------------------------------------------------------------------ */
9151 ipf_apply_timeout(head, seconds)
9155 u_int oldtimeout, newtimeout;
9159 MUTEX_ENTER(&head->ifq_lock);
9160 oldtimeout = head->ifq_ttl;
9161 newtimeout = IPF_TTLVAL(seconds);
9162 delta = oldtimeout - newtimeout;
9164 head->ifq_ttl = newtimeout;
9166 for (tqe = head->ifq_head; tqe != NULL; tqe = tqe->tqe_next) {
9167 tqe->tqe_die += delta;
9169 MUTEX_EXIT(&head->ifq_lock);
9173 /* ------------------------------------------------------------------------ */
9174 /* Function: ipf_settimeout_tcp */
9175 /* Returns: int - 0 = successfully applied, -1 = failed */
9176 /* Parameters: t(I) - pointer to tuneable to change */
9177 /* p(I) - pointer to new timeout information */
9178 /* tab(I) - pointer to table of TCP queues */
9180 /* This function applies the new timeout (p) to the TCP tunable (t) and */
9181 /* updates all of the entries on the relevant timeout queue by calling */
9182 /* ipf_apply_timeout(). */
9183 /* ------------------------------------------------------------------------ */
9185 ipf_settimeout_tcp(t, p, tab)
9190 if (!strcmp(t->ipft_name, "tcp_idle_timeout") ||
9191 !strcmp(t->ipft_name, "tcp_established")) {
9192 ipf_apply_timeout(&tab[IPF_TCPS_ESTABLISHED], p->ipftu_int);
9193 } else if (!strcmp(t->ipft_name, "tcp_close_wait")) {
9194 ipf_apply_timeout(&tab[IPF_TCPS_CLOSE_WAIT], p->ipftu_int);
9195 } else if (!strcmp(t->ipft_name, "tcp_last_ack")) {
9196 ipf_apply_timeout(&tab[IPF_TCPS_LAST_ACK], p->ipftu_int);
9197 } else if (!strcmp(t->ipft_name, "tcp_timeout")) {
9198 ipf_apply_timeout(&tab[IPF_TCPS_LISTEN], p->ipftu_int);
9199 ipf_apply_timeout(&tab[IPF_TCPS_HALF_ESTAB], p->ipftu_int);
9200 ipf_apply_timeout(&tab[IPF_TCPS_CLOSING], p->ipftu_int);
9201 } else if (!strcmp(t->ipft_name, "tcp_listen")) {
9202 ipf_apply_timeout(&tab[IPF_TCPS_LISTEN], p->ipftu_int);
9203 } else if (!strcmp(t->ipft_name, "tcp_half_established")) {
9204 ipf_apply_timeout(&tab[IPF_TCPS_HALF_ESTAB], p->ipftu_int);
9205 } else if (!strcmp(t->ipft_name, "tcp_closing")) {
9206 ipf_apply_timeout(&tab[IPF_TCPS_CLOSING], p->ipftu_int);
9207 } else if (!strcmp(t->ipft_name, "tcp_syn_received")) {
9208 ipf_apply_timeout(&tab[IPF_TCPS_SYN_RECEIVED], p->ipftu_int);
9209 } else if (!strcmp(t->ipft_name, "tcp_syn_sent")) {
9210 ipf_apply_timeout(&tab[IPF_TCPS_SYN_SENT], p->ipftu_int);
9211 } else if (!strcmp(t->ipft_name, "tcp_closed")) {
9212 ipf_apply_timeout(&tab[IPF_TCPS_CLOSED], p->ipftu_int);
9213 } else if (!strcmp(t->ipft_name, "tcp_half_closed")) {
9214 ipf_apply_timeout(&tab[IPF_TCPS_CLOSED], p->ipftu_int);
9215 } else if (!strcmp(t->ipft_name, "tcp_time_wait")) {
9216 ipf_apply_timeout(&tab[IPF_TCPS_TIME_WAIT], p->ipftu_int);
9219 * ipf_interror isn't set here because it should be set
9220 * by whatever called this function.
9228 /* ------------------------------------------------------------------------ */
9229 /* Function: ipf_main_soft_create */
9230 /* Returns: NULL = failure, else success */
9231 /* Parameters: arg(I) - pointer to soft context structure if already allocd */
9233 /* Create the foundation soft context structure. In circumstances where it */
9234 /* is not required to dynamically allocate the context, a pointer can be */
9235 /* passed in (rather than NULL) to a structure to be initialised. */
9236 /* The main thing of interest is that a number of locks are initialised */
9237 /* here instead of in the where might be expected - in the relevant create */
9238 /* function elsewhere. This is done because the current locking design has */
9239 /* some areas where these locks are used outside of their module. */
9240 /* Possibly the most important exercise that is done here is setting of all */
9241 /* the timeout values, allowing them to be changed before init(). */
9242 /* ------------------------------------------------------------------------ */
9244 ipf_main_soft_create(arg)
9247 ipf_main_softc_t *softc;
9250 KMALLOC(softc, ipf_main_softc_t *);
9257 bzero((char *)softc, sizeof(*softc));
9260 * This serves as a flag as to whether or not the softc should be
9261 * free'd when _destroy is called.
9263 softc->ipf_dynamic_softc = (arg == NULL) ? 1 : 0;
9265 softc->ipf_tuners = ipf_tune_array_copy(softc,
9266 sizeof(ipf_main_tuneables),
9267 ipf_main_tuneables);
9268 if (softc->ipf_tuners == NULL) {
9269 ipf_main_soft_destroy(softc);
9273 MUTEX_INIT(&softc->ipf_rw, "ipf rw mutex");
9274 MUTEX_INIT(&softc->ipf_timeoutlock, "ipf timeout lock");
9275 RWLOCK_INIT(&softc->ipf_global, "ipf filter load/unload mutex");
9276 RWLOCK_INIT(&softc->ipf_mutex, "ipf filter rwlock");
9277 RWLOCK_INIT(&softc->ipf_tokens, "ipf token rwlock");
9278 RWLOCK_INIT(&softc->ipf_state, "ipf state rwlock");
9279 RWLOCK_INIT(&softc->ipf_nat, "ipf IP NAT rwlock");
9280 RWLOCK_INIT(&softc->ipf_poolrw, "ipf pool rwlock");
9281 RWLOCK_INIT(&softc->ipf_frag, "ipf frag rwlock");
9283 softc->ipf_token_head = NULL;
9284 softc->ipf_token_tail = &softc->ipf_token_head;
9286 softc->ipf_tcpidletimeout = FIVE_DAYS;
9287 softc->ipf_tcpclosewait = IPF_TTLVAL(2 * TCP_MSL);
9288 softc->ipf_tcplastack = IPF_TTLVAL(30);
9289 softc->ipf_tcptimewait = IPF_TTLVAL(2 * TCP_MSL);
9290 softc->ipf_tcptimeout = IPF_TTLVAL(2 * TCP_MSL);
9291 softc->ipf_tcpsynsent = IPF_TTLVAL(2 * TCP_MSL);
9292 softc->ipf_tcpsynrecv = IPF_TTLVAL(2 * TCP_MSL);
9293 softc->ipf_tcpclosed = IPF_TTLVAL(30);
9294 softc->ipf_tcphalfclosed = IPF_TTLVAL(2 * 3600);
9295 softc->ipf_udptimeout = IPF_TTLVAL(120);
9296 softc->ipf_udpacktimeout = IPF_TTLVAL(12);
9297 softc->ipf_icmptimeout = IPF_TTLVAL(60);
9298 softc->ipf_icmpacktimeout = IPF_TTLVAL(6);
9299 softc->ipf_iptimeout = IPF_TTLVAL(60);
9301 #if defined(IPFILTER_DEFAULT_BLOCK)
9302 softc->ipf_pass = FR_BLOCK|FR_NOMATCH;
9304 softc->ipf_pass = (IPF_DEFAULT_PASS)|FR_NOMATCH;
9306 softc->ipf_minttl = 4;
9307 softc->ipf_icmpminfragmtu = 68;
9308 softc->ipf_flags = IPF_LOGGING;
9313 /* ------------------------------------------------------------------------ */
9314 /* Function: ipf_main_soft_init */
9315 /* Returns: 0 = success, -1 = failure */
9316 /* Parameters: softc(I) - pointer to soft context main structure */
9318 /* A null-op function that exists as a placeholder so that the flow in */
9319 /* other functions is obvious. */
9320 /* ------------------------------------------------------------------------ */
9323 ipf_main_soft_init(softc)
9324 ipf_main_softc_t *softc;
9330 /* ------------------------------------------------------------------------ */
9331 /* Function: ipf_main_soft_destroy */
9333 /* Parameters: softc(I) - pointer to soft context main structure */
9335 /* Undo everything that we did in ipf_main_soft_create. */
9337 /* The most important check that needs to be made here is whether or not */
9338 /* the structure was allocated by ipf_main_soft_create() by checking what */
9339 /* value is stored in ipf_dynamic_main. */
9340 /* ------------------------------------------------------------------------ */
9343 ipf_main_soft_destroy(softc)
9344 ipf_main_softc_t *softc;
9347 RW_DESTROY(&softc->ipf_frag);
9348 RW_DESTROY(&softc->ipf_poolrw);
9349 RW_DESTROY(&softc->ipf_nat);
9350 RW_DESTROY(&softc->ipf_state);
9351 RW_DESTROY(&softc->ipf_tokens);
9352 RW_DESTROY(&softc->ipf_mutex);
9353 RW_DESTROY(&softc->ipf_global);
9354 MUTEX_DESTROY(&softc->ipf_timeoutlock);
9355 MUTEX_DESTROY(&softc->ipf_rw);
9357 if (softc->ipf_tuners != NULL) {
9358 KFREES(softc->ipf_tuners, sizeof(ipf_main_tuneables));
9360 if (softc->ipf_dynamic_softc == 1) {
9366 /* ------------------------------------------------------------------------ */
9367 /* Function: ipf_main_soft_fini */
9368 /* Returns: 0 = success, -1 = failure */
9369 /* Parameters: softc(I) - pointer to soft context main structure */
9371 /* Clean out the rules which have been added since _init was last called, */
9372 /* the only dynamic part of the mainline. */
9373 /* ------------------------------------------------------------------------ */
9375 ipf_main_soft_fini(softc)
9376 ipf_main_softc_t *softc;
9378 (void) ipf_flush(softc, IPL_LOGIPF, FR_INQUE|FR_OUTQUE|FR_INACTIVE);
9379 (void) ipf_flush(softc, IPL_LOGIPF, FR_INQUE|FR_OUTQUE);
9380 (void) ipf_flush(softc, IPL_LOGCOUNT, FR_INQUE|FR_OUTQUE|FR_INACTIVE);
9381 (void) ipf_flush(softc, IPL_LOGCOUNT, FR_INQUE|FR_OUTQUE);
9387 /* ------------------------------------------------------------------------ */
9388 /* Function: ipf_main_load */
9389 /* Returns: 0 = success, -1 = failure */
9390 /* Parameters: none */
9392 /* Handle global initialisation that needs to be done for the base part of */
9393 /* IPFilter. At present this just amounts to initialising some ICMP lookup */
9394 /* arrays that get used by the state/NAT code. */
9395 /* ------------------------------------------------------------------------ */
9401 /* fill icmp reply type table */
9402 for (i = 0; i <= ICMP_MAXTYPE; i++)
9403 icmpreplytype4[i] = -1;
9404 icmpreplytype4[ICMP_ECHO] = ICMP_ECHOREPLY;
9405 icmpreplytype4[ICMP_TSTAMP] = ICMP_TSTAMPREPLY;
9406 icmpreplytype4[ICMP_IREQ] = ICMP_IREQREPLY;
9407 icmpreplytype4[ICMP_MASKREQ] = ICMP_MASKREPLY;
9410 /* fill icmp reply type table */
9411 for (i = 0; i <= ICMP6_MAXTYPE; i++)
9412 icmpreplytype6[i] = -1;
9413 icmpreplytype6[ICMP6_ECHO_REQUEST] = ICMP6_ECHO_REPLY;
9414 icmpreplytype6[ICMP6_MEMBERSHIP_QUERY] = ICMP6_MEMBERSHIP_REPORT;
9415 icmpreplytype6[ICMP6_NI_QUERY] = ICMP6_NI_REPLY;
9416 icmpreplytype6[ND_ROUTER_SOLICIT] = ND_ROUTER_ADVERT;
9417 icmpreplytype6[ND_NEIGHBOR_SOLICIT] = ND_NEIGHBOR_ADVERT;
9424 /* ------------------------------------------------------------------------ */
9425 /* Function: ipf_main_unload */
9426 /* Returns: 0 = success, -1 = failure */
9427 /* Parameters: none */
9429 /* A null-op function that exists as a placeholder so that the flow in */
9430 /* other functions is obvious. */
9431 /* ------------------------------------------------------------------------ */
9439 /* ------------------------------------------------------------------------ */
9440 /* Function: ipf_load_all */
9441 /* Returns: 0 = success, -1 = failure */
9442 /* Parameters: none */
9444 /* Work through all of the subsystems inside IPFilter and call the load */
9445 /* function for each in an order that won't lead to a crash :) */
9446 /* ------------------------------------------------------------------------ */
9450 if (ipf_main_load() == -1)
9453 if (ipf_state_main_load() == -1)
9456 if (ipf_nat_main_load() == -1)
9459 if (ipf_frag_main_load() == -1)
9462 if (ipf_auth_main_load() == -1)
9465 if (ipf_proxy_main_load() == -1)
9472 /* ------------------------------------------------------------------------ */
9473 /* Function: ipf_unload_all */
9474 /* Returns: 0 = success, -1 = failure */
9475 /* Parameters: none */
9477 /* Work through all of the subsystems inside IPFilter and call the unload */
9478 /* function for each in an order that won't lead to a crash :) */
9479 /* ------------------------------------------------------------------------ */
9483 if (ipf_proxy_main_unload() == -1)
9486 if (ipf_auth_main_unload() == -1)
9489 if (ipf_frag_main_unload() == -1)
9492 if (ipf_nat_main_unload() == -1)
9495 if (ipf_state_main_unload() == -1)
9498 if (ipf_main_unload() == -1)
9505 /* ------------------------------------------------------------------------ */
9506 /* Function: ipf_create_all */
9507 /* Returns: NULL = failure, else success */
9508 /* Parameters: arg(I) - pointer to soft context main structure */
9510 /* Work through all of the subsystems inside IPFilter and call the create */
9511 /* function for each in an order that won't lead to a crash :) */
9512 /* ------------------------------------------------------------------------ */
9517 ipf_main_softc_t *softc;
9519 softc = ipf_main_soft_create(arg);
9524 softc->ipf_log_soft = ipf_log_soft_create(softc);
9525 if (softc->ipf_log_soft == NULL) {
9526 ipf_destroy_all(softc);
9531 softc->ipf_lookup_soft = ipf_lookup_soft_create(softc);
9532 if (softc->ipf_lookup_soft == NULL) {
9533 ipf_destroy_all(softc);
9537 softc->ipf_sync_soft = ipf_sync_soft_create(softc);
9538 if (softc->ipf_sync_soft == NULL) {
9539 ipf_destroy_all(softc);
9543 softc->ipf_state_soft = ipf_state_soft_create(softc);
9544 if (softc->ipf_state_soft == NULL) {
9545 ipf_destroy_all(softc);
9549 softc->ipf_nat_soft = ipf_nat_soft_create(softc);
9550 if (softc->ipf_nat_soft == NULL) {
9551 ipf_destroy_all(softc);
9555 softc->ipf_frag_soft = ipf_frag_soft_create(softc);
9556 if (softc->ipf_frag_soft == NULL) {
9557 ipf_destroy_all(softc);
9561 softc->ipf_auth_soft = ipf_auth_soft_create(softc);
9562 if (softc->ipf_auth_soft == NULL) {
9563 ipf_destroy_all(softc);
9567 softc->ipf_proxy_soft = ipf_proxy_soft_create(softc);
9568 if (softc->ipf_proxy_soft == NULL) {
9569 ipf_destroy_all(softc);
9577 /* ------------------------------------------------------------------------ */
9578 /* Function: ipf_destroy_all */
9580 /* Parameters: softc(I) - pointer to soft context main structure */
9582 /* Work through all of the subsystems inside IPFilter and call the destroy */
9583 /* function for each in an order that won't lead to a crash :) */
9585 /* Every one of these functions is expected to succeed, so there is no */
9586 /* checking of return values. */
9587 /* ------------------------------------------------------------------------ */
9589 ipf_destroy_all(softc)
9590 ipf_main_softc_t *softc;
9593 if (softc->ipf_state_soft != NULL) {
9594 ipf_state_soft_destroy(softc, softc->ipf_state_soft);
9595 softc->ipf_state_soft = NULL;
9598 if (softc->ipf_nat_soft != NULL) {
9599 ipf_nat_soft_destroy(softc, softc->ipf_nat_soft);
9600 softc->ipf_nat_soft = NULL;
9603 if (softc->ipf_frag_soft != NULL) {
9604 ipf_frag_soft_destroy(softc, softc->ipf_frag_soft);
9605 softc->ipf_frag_soft = NULL;
9608 if (softc->ipf_auth_soft != NULL) {
9609 ipf_auth_soft_destroy(softc, softc->ipf_auth_soft);
9610 softc->ipf_auth_soft = NULL;
9613 if (softc->ipf_proxy_soft != NULL) {
9614 ipf_proxy_soft_destroy(softc, softc->ipf_proxy_soft);
9615 softc->ipf_proxy_soft = NULL;
9618 if (softc->ipf_sync_soft != NULL) {
9619 ipf_sync_soft_destroy(softc, softc->ipf_sync_soft);
9620 softc->ipf_sync_soft = NULL;
9623 if (softc->ipf_lookup_soft != NULL) {
9624 ipf_lookup_soft_destroy(softc, softc->ipf_lookup_soft);
9625 softc->ipf_lookup_soft = NULL;
9629 if (softc->ipf_log_soft != NULL) {
9630 ipf_log_soft_destroy(softc, softc->ipf_log_soft);
9631 softc->ipf_log_soft = NULL;
9635 ipf_main_soft_destroy(softc);
9639 /* ------------------------------------------------------------------------ */
9640 /* Function: ipf_init_all */
9641 /* Returns: 0 = success, -1 = failure */
9642 /* Parameters: softc(I) - pointer to soft context main structure */
9644 /* Work through all of the subsystems inside IPFilter and call the init */
9645 /* function for each in an order that won't lead to a crash :) */
9646 /* ------------------------------------------------------------------------ */
9649 ipf_main_softc_t *softc;
9652 if (ipf_main_soft_init(softc) == -1)
9656 if (ipf_log_soft_init(softc, softc->ipf_log_soft) == -1)
9660 if (ipf_lookup_soft_init(softc, softc->ipf_lookup_soft) == -1)
9663 if (ipf_sync_soft_init(softc, softc->ipf_sync_soft) == -1)
9666 if (ipf_state_soft_init(softc, softc->ipf_state_soft) == -1)
9669 if (ipf_nat_soft_init(softc, softc->ipf_nat_soft) == -1)
9672 if (ipf_frag_soft_init(softc, softc->ipf_frag_soft) == -1)
9675 if (ipf_auth_soft_init(softc, softc->ipf_auth_soft) == -1)
9678 if (ipf_proxy_soft_init(softc, softc->ipf_proxy_soft) == -1)
9685 /* ------------------------------------------------------------------------ */
9686 /* Function: ipf_fini_all */
9687 /* Returns: 0 = success, -1 = failure */
9688 /* Parameters: softc(I) - pointer to soft context main structure */
9690 /* Work through all of the subsystems inside IPFilter and call the fini */
9691 /* function for each in an order that won't lead to a crash :) */
9692 /* ------------------------------------------------------------------------ */
9695 ipf_main_softc_t *softc;
9698 ipf_token_flush(softc);
9700 if (ipf_proxy_soft_fini(softc, softc->ipf_proxy_soft) == -1)
9703 if (ipf_auth_soft_fini(softc, softc->ipf_auth_soft) == -1)
9706 if (ipf_frag_soft_fini(softc, softc->ipf_frag_soft) == -1)
9709 if (ipf_nat_soft_fini(softc, softc->ipf_nat_soft) == -1)
9712 if (ipf_state_soft_fini(softc, softc->ipf_state_soft) == -1)
9715 if (ipf_sync_soft_fini(softc, softc->ipf_sync_soft) == -1)
9718 if (ipf_lookup_soft_fini(softc, softc->ipf_lookup_soft) == -1)
9722 if (ipf_log_soft_fini(softc, softc->ipf_log_soft) == -1)
9726 if (ipf_main_soft_fini(softc) == -1)
9733 /* ------------------------------------------------------------------------ */
9734 /* Function: ipf_rule_expire */
9736 /* Parameters: softc(I) - pointer to soft context main structure */
9738 /* At present this function exists just to support temporary addition of */
9739 /* firewall rules. Both inactive and active lists are scanned for items to */
9740 /* purge, as by rights, the expiration is computed as soon as the rule is */
9742 /* ------------------------------------------------------------------------ */
9744 ipf_rule_expire(softc)
9745 ipf_main_softc_t *softc;
9749 if ((softc->ipf_rule_explist[0] == NULL) &&
9750 (softc->ipf_rule_explist[1] == NULL))
9753 WRITE_ENTER(&softc->ipf_mutex);
9755 while ((fr = softc->ipf_rule_explist[0]) != NULL) {
9757 * Because the list is kept sorted on insertion, the fist
9758 * one that dies in the future means no more work to do.
9760 if (fr->fr_die > softc->ipf_ticks)
9762 ipf_rule_delete(softc, fr, IPL_LOGIPF, 0);
9765 while ((fr = softc->ipf_rule_explist[1]) != NULL) {
9767 * Because the list is kept sorted on insertion, the fist
9768 * one that dies in the future means no more work to do.
9770 if (fr->fr_die > softc->ipf_ticks)
9772 ipf_rule_delete(softc, fr, IPL_LOGIPF, 1);
9775 RWLOCK_EXIT(&softc->ipf_mutex);
9779 static int ipf_ht_node_cmp __P((struct host_node_s *, struct host_node_s *));
9780 static void ipf_ht_node_make_key __P((host_track_t *, host_node_t *, int,
9783 host_node_t RBI_ZERO(ipf_rb);
9784 RBI_CODE(ipf_rb, host_node_t, hn_entry, ipf_ht_node_cmp)
9787 /* ------------------------------------------------------------------------ */
9788 /* Function: ipf_ht_node_cmp */
9789 /* Returns: int - 0 == nodes are the same, .. */
9790 /* Parameters: k1(I) - pointer to first key to compare */
9791 /* k2(I) - pointer to second key to compare */
9793 /* The "key" for the node is a combination of two fields: the address */
9794 /* family and the address itself. */
9796 /* Because we're not actually interpreting the address data, it isn't */
9797 /* necessary to convert them to/from network/host byte order. The mask is */
9798 /* just used to remove bits that aren't significant - it doesn't matter */
9799 /* where they are, as long as they're always in the same place. */
9801 /* As with IP6_EQ, comparing IPv6 addresses starts at the bottom because */
9802 /* this is where individual ones will differ the most - but not true for */
9803 /* for /48's, etc. */
9804 /* ------------------------------------------------------------------------ */
9806 ipf_ht_node_cmp(k1, k2)
9807 struct host_node_s *k1, *k2;
9811 i = (k2->hn_addr.adf_family - k1->hn_addr.adf_family);
9815 if (k1->hn_addr.adf_family == AF_INET)
9816 return (k2->hn_addr.adf_addr.in4.s_addr -
9817 k1->hn_addr.adf_addr.in4.s_addr);
9819 i = k2->hn_addr.adf_addr.i6[3] - k1->hn_addr.adf_addr.i6[3];
9822 i = k2->hn_addr.adf_addr.i6[2] - k1->hn_addr.adf_addr.i6[2];
9825 i = k2->hn_addr.adf_addr.i6[1] - k1->hn_addr.adf_addr.i6[1];
9828 i = k2->hn_addr.adf_addr.i6[0] - k1->hn_addr.adf_addr.i6[0];
9833 /* ------------------------------------------------------------------------ */
9834 /* Function: ipf_ht_node_make_key */
9836 /* parameters: htp(I) - pointer to address tracking structure */
9837 /* key(I) - where to store masked address for lookup */
9838 /* family(I) - protocol family of address */
9839 /* addr(I) - pointer to network address */
9841 /* Using the "netmask" (number of bits) stored parent host tracking struct, */
9842 /* copy the address passed in into the key structure whilst masking out the */
9843 /* bits that we don't want. */
9845 /* Because the parser will set ht_netmask to 128 if there is no protocol */
9846 /* specified (the parser doesn't know if it should be a v4 or v6 rule), we */
9847 /* have to be wary of that and not allow 32-128 to happen. */
9848 /* ------------------------------------------------------------------------ */
9850 ipf_ht_node_make_key(htp, key, family, addr)
9856 key->hn_addr.adf_family = family;
9857 if (family == AF_INET) {
9861 key->hn_addr.adf_len = sizeof(key->hn_addr.adf_addr.in4);
9862 bits = htp->ht_netmask;
9866 mask = htonl(0xffffffff << (32 - bits));
9868 key->hn_addr.adf_addr.in4.s_addr = addr->in4.s_addr & mask;
9871 int bits = htp->ht_netmask;
9873 key->hn_addr.adf_len = sizeof(key->hn_addr.adf_addr.in6);
9875 key->hn_addr.adf_addr.i6[3] = addr->i6[3] &
9876 htonl(0xffffffff << (128 - bits));
9877 key->hn_addr.adf_addr.i6[2] = addr->i6[2];
9878 key->hn_addr.adf_addr.i6[1] = addr->i6[2];
9879 key->hn_addr.adf_addr.i6[0] = addr->i6[2];
9880 } else if (bits > 64) {
9881 key->hn_addr.adf_addr.i6[3] = 0;
9882 key->hn_addr.adf_addr.i6[2] = addr->i6[2] &
9883 htonl(0xffffffff << (96 - bits));
9884 key->hn_addr.adf_addr.i6[1] = addr->i6[1];
9885 key->hn_addr.adf_addr.i6[0] = addr->i6[0];
9886 } else if (bits > 32) {
9887 key->hn_addr.adf_addr.i6[3] = 0;
9888 key->hn_addr.adf_addr.i6[2] = 0;
9889 key->hn_addr.adf_addr.i6[1] = addr->i6[1] &
9890 htonl(0xffffffff << (64 - bits));
9891 key->hn_addr.adf_addr.i6[0] = addr->i6[0];
9893 key->hn_addr.adf_addr.i6[3] = 0;
9894 key->hn_addr.adf_addr.i6[2] = 0;
9895 key->hn_addr.adf_addr.i6[1] = 0;
9896 key->hn_addr.adf_addr.i6[0] = addr->i6[0] &
9897 htonl(0xffffffff << (32 - bits));
9904 /* ------------------------------------------------------------------------ */
9905 /* Function: ipf_ht_node_add */
9906 /* Returns: int - 0 == success, -1 == failure */
9907 /* Parameters: softc(I) - pointer to soft context main structure */
9908 /* htp(I) - pointer to address tracking structure */
9909 /* family(I) - protocol family of address */
9910 /* addr(I) - pointer to network address */
9912 /* NOTE: THIS FUNCTION MUST BE CALLED WITH AN EXCLUSIVE LOCK THAT PREVENTS */
9913 /* ipf_ht_node_del FROM RUNNING CONCURRENTLY ON THE SAME htp. */
9915 /* After preparing the key with the address information to find, look in */
9916 /* the red-black tree to see if the address is known. A successful call to */
9917 /* this function can mean one of two things: a new node was added to the */
9918 /* tree or a matching node exists and we're able to bump up its activity. */
9919 /* ------------------------------------------------------------------------ */
9921 ipf_ht_node_add(softc, htp, family, addr)
9922 ipf_main_softc_t *softc;
9930 ipf_ht_node_make_key(htp, &k, family, addr);
9932 h = RBI_SEARCH(ipf_rb, &htp->ht_root, &k);
9934 if (htp->ht_cur_nodes >= htp->ht_max_nodes)
9936 KMALLOC(h, host_node_t *);
9939 LBUMP(ipf_rb_no_mem);
9944 * If there was a macro to initialise the RB node then that
9945 * would get used here, but there isn't...
9947 bzero((char *)h, sizeof(*h));
9948 h->hn_addr = k.hn_addr;
9949 h->hn_addr.adf_family = k.hn_addr.adf_family;
9950 RBI_INSERT(ipf_rb, &htp->ht_root, h);
9951 htp->ht_cur_nodes++;
9953 if ((htp->ht_max_per_node != 0) &&
9954 (h->hn_active >= htp->ht_max_per_node)) {
9955 DT(ipf_rb_node_max);
9956 LBUMP(ipf_rb_node_max);
9967 /* ------------------------------------------------------------------------ */
9968 /* Function: ipf_ht_node_del */
9969 /* Returns: int - 0 == success, -1 == failure */
9970 /* parameters: htp(I) - pointer to address tracking structure */
9971 /* family(I) - protocol family of address */
9972 /* addr(I) - pointer to network address */
9974 /* NOTE: THIS FUNCTION MUST BE CALLED WITH AN EXCLUSIVE LOCK THAT PREVENTS */
9975 /* ipf_ht_node_add FROM RUNNING CONCURRENTLY ON THE SAME htp. */
9977 /* Try and find the address passed in amongst the leavese on this tree to */
9978 /* be friend. If found then drop the active account for that node drops by */
9979 /* one. If that count reaches 0, it is time to free it all up. */
9980 /* ------------------------------------------------------------------------ */
9982 ipf_ht_node_del(htp, family, addr)
9990 ipf_ht_node_make_key(htp, &k, family, addr);
9992 h = RBI_SEARCH(ipf_rb, &htp->ht_root, &k);
9997 if (h->hn_active == 0) {
9998 (void) RBI_DELETE(ipf_rb, &htp->ht_root, h);
9999 htp->ht_cur_nodes--;
10008 /* ------------------------------------------------------------------------ */
10009 /* Function: ipf_rb_ht_init */
10011 /* Parameters: head(I) - pointer to host tracking structure */
10013 /* Initialise the host tracking structure to be ready for use above. */
10014 /* ------------------------------------------------------------------------ */
10016 ipf_rb_ht_init(head)
10017 host_track_t *head;
10019 RBI_INIT(ipf_rb, &head->ht_root);
10023 /* ------------------------------------------------------------------------ */
10024 /* Function: ipf_rb_ht_freenode */
10026 /* Parameters: head(I) - pointer to host tracking structure */
10027 /* arg(I) - additional argument from walk caller */
10029 /* Free an actual host_node_t structure. */
10030 /* ------------------------------------------------------------------------ */
10032 ipf_rb_ht_freenode(node, arg)
10040 /* ------------------------------------------------------------------------ */
10041 /* Function: ipf_rb_ht_flush */
10043 /* Parameters: head(I) - pointer to host tracking structure */
10045 /* Remove all of the nodes in the tree tracking hosts by calling a walker */
10046 /* and free'ing each one. */
10047 /* ------------------------------------------------------------------------ */
10049 ipf_rb_ht_flush(head)
10050 host_track_t *head;
10052 RBI_WALK(ipf_rb, &head->ht_root, ipf_rb_ht_freenode, NULL);
10056 /* ------------------------------------------------------------------------ */
10057 /* Function: ipf_slowtimer */
10059 /* Parameters: ptr(I) - pointer to main ipf soft context structure */
10061 /* Slowly expire held state for fragments. Timeouts are set * in */
10062 /* expectation of this being called twice per second. */
10063 /* ------------------------------------------------------------------------ */
10065 ipf_slowtimer(softc)
10066 ipf_main_softc_t *softc;
10069 ipf_token_expire(softc);
10070 ipf_frag_expire(softc);
10071 ipf_state_expire(softc);
10072 ipf_nat_expire(softc);
10073 ipf_auth_expire(softc);
10074 ipf_lookup_expire(softc);
10075 ipf_rule_expire(softc);
10076 ipf_sync_expire(softc);
10077 softc->ipf_ticks++;
10078 # if defined(__OpenBSD__)
10079 timeout_add(&ipf_slowtimer_ch, hz/2);
10084 /* ------------------------------------------------------------------------ */
10085 /* Function: ipf_inet_mask_add */
10087 /* Parameters: bits(I) - pointer to nat context information */
10088 /* mtab(I) - pointer to mask hash table structure */
10090 /* When called, bits represents the mask of a new NAT rule that has just */
10091 /* been added. This function inserts a bitmask into the array of masks to */
10092 /* search when searching for a matching NAT rule for a packet. */
10093 /* Prevention of duplicate masks is achieved by checking the use count for */
10094 /* a given netmask. */
10095 /* ------------------------------------------------------------------------ */
10097 ipf_inet_mask_add(bits, mtab)
10099 ipf_v4_masktab_t *mtab;
10104 mtab->imt4_masks[bits]++;
10105 if (mtab->imt4_masks[bits] > 1)
10111 mask = 0xffffffff << (32 - bits);
10113 for (i = 0; i < 33; i++) {
10114 if (ntohl(mtab->imt4_active[i]) < mask) {
10115 for (j = 32; j > i; j--)
10116 mtab->imt4_active[j] = mtab->imt4_active[j - 1];
10117 mtab->imt4_active[i] = htonl(mask);
10125 /* ------------------------------------------------------------------------ */
10126 /* Function: ipf_inet_mask_del */
10128 /* Parameters: bits(I) - number of bits set in the netmask */
10129 /* mtab(I) - pointer to mask hash table structure */
10131 /* Remove the 32bit bitmask represented by "bits" from the collection of */
10132 /* netmasks stored inside of mtab. */
10133 /* ------------------------------------------------------------------------ */
10135 ipf_inet_mask_del(bits, mtab)
10137 ipf_v4_masktab_t *mtab;
10142 mtab->imt4_masks[bits]--;
10143 if (mtab->imt4_masks[bits] > 0)
10146 mask = htonl(0xffffffff << (32 - bits));
10147 for (i = 0; i < 33; i++) {
10148 if (mtab->imt4_active[i] == mask) {
10149 for (j = i + 1; j < 33; j++)
10150 mtab->imt4_active[j - 1] = mtab->imt4_active[j];
10155 ASSERT(mtab->imt4_max >= 0);
10160 /* ------------------------------------------------------------------------ */
10161 /* Function: ipf_inet6_mask_add */
10163 /* Parameters: bits(I) - number of bits set in mask */
10164 /* mask(I) - pointer to mask to add */
10165 /* mtab(I) - pointer to mask hash table structure */
10167 /* When called, bitcount represents the mask of a IPv6 NAT map rule that */
10168 /* has just been added. This function inserts a bitmask into the array of */
10169 /* masks to search when searching for a matching NAT rule for a packet. */
10170 /* Prevention of duplicate masks is achieved by checking the use count for */
10171 /* a given netmask. */
10172 /* ------------------------------------------------------------------------ */
10174 ipf_inet6_mask_add(bits, mask, mtab)
10177 ipf_v6_masktab_t *mtab;
10182 mtab->imt6_masks[bits]++;
10183 if (mtab->imt6_masks[bits] > 1)
10194 for (i = 0; i < 129; i++) {
10195 if (IP6_LT(&mtab->imt6_active[i], mask)) {
10196 for (j = 128; j > i; j--)
10197 mtab->imt6_active[j] = mtab->imt6_active[j - 1];
10198 mtab->imt6_active[i] = *mask;
10206 /* ------------------------------------------------------------------------ */
10207 /* Function: ipf_inet6_mask_del */
10209 /* Parameters: bits(I) - number of bits set in mask */
10210 /* mask(I) - pointer to mask to remove */
10211 /* mtab(I) - pointer to mask hash table structure */
10213 /* Remove the 128bit bitmask represented by "bits" from the collection of */
10214 /* netmasks stored inside of mtab. */
10215 /* ------------------------------------------------------------------------ */
10217 ipf_inet6_mask_del(bits, mask, mtab)
10220 ipf_v6_masktab_t *mtab;
10225 mtab->imt6_masks[bits]--;
10226 if (mtab->imt6_masks[bits] > 0)
10236 for (i = 0; i < 129; i++) {
10237 if (IP6_EQ(&mtab->imt6_active[i], mask)) {
10238 for (j = i + 1; j < 129; j++) {
10239 mtab->imt6_active[j - 1] = mtab->imt6_active[j];
10240 if (IP6_EQ(&mtab->imt6_active[j - 1], &zero))
10247 ASSERT(mtab->imt6_max >= 0);