2 * Copyright (c) 2002-2009 Luigi Rizzo, Universita` di Pisa
4 * Supported by: Valeria Paoli
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 #include <sys/cdefs.h>
29 __FBSDID("$FreeBSD: head/sys/netinet/ipfw/ip_fw_sockopt.c 206339 2010-04-07 08:23:58Z luigi $");
32 * Sockopt support for ipfw. The routines here implement
33 * the upper half of the ipfw code.
36 #if !defined(KLD_MODULE)
38 #include "opt_ipdivert.h"
42 #error IPFIREWALL requires INET.
45 #include "opt_inet6.h"
46 #include "opt_ipsec.h"
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/malloc.h>
51 #include <sys/mbuf.h> /* struct m_tag used by nested headers */
52 #include <sys/kernel.h>
56 #include <sys/rwlock.h>
57 #include <sys/socket.h>
58 #include <sys/socketvar.h>
59 #include <sys/sysctl.h>
60 #include <sys/syslog.h>
62 #include <net/route.h>
65 #include <netinet/in.h>
66 #include <netinet/ip_var.h> /* hooks */
67 #include <netinet/ip_fw.h>
68 #include <netinet/ipfw/ip_fw_private.h>
71 #include <security/mac/mac_framework.h>
74 MALLOC_DEFINE(M_IPFW, "IpFw/IpAcct", "IpFw/IpAcct chain's");
77 * static variables followed by global ones (none in this file)
81 * Find the smallest rule >= key, id.
82 * We could use bsearch but it is so simple that we code it directly
85 ipfw_find_rule(struct ip_fw_chain *chain, uint32_t key, uint32_t id)
90 for (lo = 0, hi = chain->n_rules - 1; lo < hi;) {
94 lo = i + 1; /* continue from the next one */
95 else if (r->rulenum > key)
96 hi = i; /* this might be good */
98 lo = i + 1; /* continue from the next one */
99 else /* r->id >= id */
100 hi = i; /* this might be good */
106 * allocate a new map, returns the chain locked. extra is the number
107 * of entries to add or delete.
109 static struct ip_fw **
110 get_map(struct ip_fw_chain *chain, int extra, int locked)
117 i = chain->n_rules + extra;
118 map = malloc(i * sizeof(struct ip_fw *), M_IPFW,
119 locked ? M_NOWAIT : M_WAITOK);
121 printf("%s: cannot allocate map\n", __FUNCTION__);
125 IPFW_UH_WLOCK(chain);
126 if (i >= chain->n_rules + extra) /* good */
128 /* otherwise we lost the race, free and retry */
130 IPFW_UH_WUNLOCK(chain);
136 * swap the maps. It is supposed to be called with IPFW_UH_WLOCK
138 static struct ip_fw **
139 swap_map(struct ip_fw_chain *chain, struct ip_fw **new_map, int new_len)
141 struct ip_fw **old_map;
145 chain->n_rules = new_len;
146 old_map = chain->map;
147 chain->map = new_map;
153 * Add a new rule to the list. Copy the rule into a malloc'ed area, then
154 * possibly create a rule number and add the rule to the list.
155 * Update the rule_number in the input struct so the caller knows it as well.
156 * XXX DO NOT USE FOR THE DEFAULT RULE.
157 * Must be called without IPFW_UH held
160 ipfw_add_rule(struct ip_fw_chain *chain, struct ip_fw *input_rule)
163 int i, l, insert_before;
164 struct ip_fw **map; /* the new array of pointers */
166 if (chain->rules == NULL || input_rule->rulenum > IPFW_DEFAULT_RULE-1)
169 l = RULESIZE(input_rule);
170 rule = malloc(l, M_IPFW, M_WAITOK | M_ZERO);
173 /* get_map returns with IPFW_UH_WLOCK if successful */
174 map = get_map(chain, 1, 0 /* not locked */);
180 bcopy(input_rule, rule, l);
181 /* clear fields not settable from userland */
183 rule->next_rule = NULL;
188 if (V_autoinc_step < 1)
190 else if (V_autoinc_step > 1000)
191 V_autoinc_step = 1000;
192 /* find the insertion point, we will insert before */
193 insert_before = rule->rulenum ? rule->rulenum + 1 : IPFW_DEFAULT_RULE;
194 i = ipfw_find_rule(chain, insert_before, 0);
195 /* duplicate first part */
197 bcopy(chain->map, map, i * sizeof(struct ip_fw *));
199 /* duplicate remaining part, we always have the default rule */
200 bcopy(chain->map + i, map + i + 1,
201 sizeof(struct ip_fw *) *(chain->n_rules - i));
202 if (rule->rulenum == 0) {
203 /* write back the number */
204 rule->rulenum = i > 0 ? map[i-1]->rulenum : 0;
205 if (rule->rulenum < IPFW_DEFAULT_RULE - V_autoinc_step)
206 rule->rulenum += V_autoinc_step;
207 input_rule->rulenum = rule->rulenum;
210 rule->id = chain->id + 1;
211 map = swap_map(chain, map, chain->n_rules + 1);
212 chain->static_len += l;
213 IPFW_UH_WUNLOCK(chain);
220 * Reclaim storage associated with a list of rules. This is
221 * typically the list created using remove_rule.
222 * A NULL pointer on input is handled correctly.
225 ipfw_reap_rules(struct ip_fw *head)
229 while ((rule = head) != NULL) {
236 * Used by del_entry() to check if a rule should be kept.
237 * Returns 1 if the rule must be kept, 0 otherwise.
239 * Called with cmd = {0,1,5}.
240 * cmd == 0 matches on rule numbers, excludes rules in RESVD_SET if n == 0 ;
241 * cmd == 1 matches on set numbers only, rule numbers are ignored;
242 * cmd == 5 matches on rule and set numbers.
244 * n == 0 is a wildcard for rule numbers, there is no wildcard for sets.
247 * (default || reserved || !match_set || !match_number)
249 * default ::= (rule->rulenum == IPFW_DEFAULT_RULE)
250 * // the default rule is always protected
252 * reserved ::= (cmd == 0 && n == 0 && rule->set == RESVD_SET)
253 * // RESVD_SET is protected only if cmd == 0 and n == 0 ("ipfw flush")
255 * match_set ::= (cmd == 0 || rule->set == set)
256 * // set number is ignored for cmd == 0
258 * match_number ::= (cmd == 1 || n == 0 || n == rule->rulenum)
259 * // number is ignored for cmd == 1 or n == 0
263 keep_rule(struct ip_fw *rule, uint8_t cmd, uint8_t set, uint32_t n)
266 (rule->rulenum == IPFW_DEFAULT_RULE) ||
267 (cmd == 0 && n == 0 && rule->set == RESVD_SET) ||
268 !(cmd == 0 || rule->set == set) ||
269 !(cmd == 1 || n == 0 || n == rule->rulenum);
273 * Remove all rules with given number, or do set manipulation.
274 * Assumes chain != NULL && *chain != NULL.
276 * The argument is an uint32_t. The low 16 bit are the rule or set number;
277 * the next 8 bits are the new set; the top 8 bits indicate the command:
279 * 0 delete rules numbered "rulenum"
280 * 1 delete rules in set "rulenum"
281 * 2 move rules "rulenum" to set "new_set"
282 * 3 move rules from set "rulenum" to set "new_set"
283 * 4 swap sets "rulenum" and "new_set"
284 * 5 delete rules "rulenum" and set "new_set"
287 del_entry(struct ip_fw_chain *chain, uint32_t arg)
290 uint32_t num; /* rule number or old_set */
291 uint8_t cmd, new_set;
292 int start, end, i, ofs, n;
293 struct ip_fw **map = NULL;
297 cmd = (arg >> 24) & 0xff;
298 new_set = (arg >> 16) & 0xff;
300 if (cmd > 5 || new_set > RESVD_SET)
302 if (cmd == 0 || cmd == 2 || cmd == 5) {
303 if (num >= IPFW_DEFAULT_RULE)
306 if (num > RESVD_SET) /* old_set */
310 IPFW_UH_WLOCK(chain); /* arbitrate writers */
311 chain->reap = NULL; /* prepare for deletions */
314 case 0: /* delete rules "num" (num == 0 matches all) */
315 case 1: /* delete all rules in set N */
316 case 5: /* delete rules with number N and set "new_set". */
319 * Locate first rule to delete (start), the rule after
320 * the last one to delete (end), and count how many
321 * rules to delete (n). Always use keep_rule() to
322 * determine which rules to keep.
326 /* look for a specific set including RESVD_SET.
327 * Must scan the entire range, ignore num.
330 for (start = -1, end = i = 0; i < chain->n_rules; i++) {
331 if (keep_rule(chain->map[i], cmd, new_set, 0))
338 end++; /* first non-matching */
340 /* Optimized search on rule numbers */
341 start = ipfw_find_rule(chain, num, 0);
342 for (end = start; end < chain->n_rules; end++) {
343 rule = chain->map[end];
344 if (num > 0 && rule->rulenum != num)
346 if (!keep_rule(rule, cmd, new_set, num))
352 /* A flush request (arg == 0) on empty ruleset
353 * returns with no error. On the contrary,
354 * if there is no match on a specific request,
357 error = (arg == 0) ? 0 : EINVAL;
361 /* We have something to delete. Allocate the new map */
362 map = get_map(chain, -n, 1 /* locked */);
368 /* 1. bcopy the initial part of the map */
370 bcopy(chain->map, map, start * sizeof(struct ip_fw *));
371 /* 2. copy active rules between start and end */
372 for (i = ofs = start; i < end; i++) {
373 rule = chain->map[i];
374 if (keep_rule(rule, cmd, new_set, num))
377 /* 3. copy the final part of the map */
378 bcopy(chain->map + end, map + ofs,
379 (chain->n_rules - end) * sizeof(struct ip_fw *));
380 /* 4. swap the maps (under BH_LOCK) */
381 map = swap_map(chain, map, chain->n_rules - n);
382 /* 5. now remove the rules deleted from the old map */
383 for (i = start; i < end; i++) {
386 if (keep_rule(rule, cmd, new_set, num))
389 chain->static_len -= l;
390 ipfw_remove_dyn_children(rule);
391 rule->x_next = chain->reap;
397 * In the next 3 cases the loop stops at (n_rules - 1)
398 * because the default rule is never eligible..
401 case 2: /* move rules with given RULE number to new set */
402 for (i = 0; i < chain->n_rules - 1; i++) {
403 rule = chain->map[i];
404 if (rule->rulenum == num)
409 case 3: /* move rules with given SET number to new set */
410 for (i = 0; i < chain->n_rules - 1; i++) {
411 rule = chain->map[i];
412 if (rule->set == num)
417 case 4: /* swap two sets */
418 for (i = 0; i < chain->n_rules - 1; i++) {
419 rule = chain->map[i];
420 if (rule->set == num)
422 else if (rule->set == new_set)
430 IPFW_UH_WUNLOCK(chain);
431 ipfw_reap_rules(rule);
438 * Clear counters for a specific rule.
439 * Normally run under IPFW_UH_RLOCK, but these are idempotent ops
440 * so we only care that rules do not disappear.
443 clear_counters(struct ip_fw *rule, int log_only)
445 ipfw_insn_log *l = (ipfw_insn_log *)ACTION_PTR(rule);
448 rule->bcnt = rule->pcnt = 0;
451 if (l->o.opcode == O_LOG)
452 l->log_left = l->max_log;
456 * Reset some or all counters on firewall rules.
457 * The argument `arg' is an u_int32_t. The low 16 bit are the rule number,
458 * the next 8 bits are the set number, the top 8 bits are the command:
459 * 0 work with rules from all set's;
460 * 1 work with rules only from specified set.
461 * Specified rule number is zero if we want to clear all entries.
462 * log_only is 1 if we only want to reset logs, zero otherwise.
465 zero_entry(struct ip_fw_chain *chain, u_int32_t arg, int log_only)
471 uint16_t rulenum = arg & 0xffff;
472 uint8_t set = (arg >> 16) & 0xff;
473 uint8_t cmd = (arg >> 24) & 0xff;
477 if (cmd == 1 && set > RESVD_SET)
480 IPFW_UH_RLOCK(chain);
482 V_norule_counter = 0;
483 for (i = 0; i < chain->n_rules; i++) {
484 rule = chain->map[i];
485 /* Skip rules not in our set. */
486 if (cmd == 1 && rule->set != set)
488 clear_counters(rule, log_only);
490 msg = log_only ? "All logging counts reset" :
491 "Accounting cleared";
494 for (i = 0; i < chain->n_rules; i++) {
495 rule = chain->map[i];
496 if (rule->rulenum == rulenum) {
497 if (cmd == 0 || rule->set == set)
498 clear_counters(rule, log_only);
501 if (rule->rulenum > rulenum)
504 if (!cleared) { /* we did not find any matching rules */
505 IPFW_UH_RUNLOCK(chain);
508 msg = log_only ? "logging count reset" : "cleared";
510 IPFW_UH_RUNLOCK(chain);
513 int lev = LOG_SECURITY | LOG_NOTICE;
516 log(lev, "ipfw: Entry %d %s.\n", rulenum, msg);
518 log(lev, "ipfw: %s.\n", msg);
524 * Check validity of the structure before insert.
525 * Rules are simple, so this mostly need to check rule sizes.
528 check_ipfw_struct(struct ip_fw *rule, int size)
534 if (size < sizeof(*rule)) {
535 printf("ipfw: rule too short\n");
538 /* first, check for valid size */
541 printf("ipfw: size mismatch (have %d want %d)\n", size, l);
544 if (rule->act_ofs >= rule->cmd_len) {
545 printf("ipfw: bogus action offset (%u > %u)\n",
546 rule->act_ofs, rule->cmd_len - 1);
550 * Now go for the individual checks. Very simple ones, basically only
553 for (l = rule->cmd_len, cmd = rule->cmd ;
554 l > 0 ; l -= cmdlen, cmd += cmdlen) {
557 printf("ipfw: opcode %d size truncated\n",
561 switch (cmd->opcode) {
591 if (cmdlen != F_INSN_SIZE(ipfw_insn))
596 if (cmdlen != F_INSN_SIZE(ipfw_insn))
598 if (cmd->arg1 >= rt_numfibs) {
599 printf("ipfw: invalid fib number %d\n",
606 if (cmdlen != F_INSN_SIZE(ipfw_insn))
608 if (cmd->arg1 >= rt_numfibs) {
609 printf("ipfw: invalid fib number %d\n",
624 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32))
629 if (cmdlen != F_INSN_SIZE(ipfw_insn_limit))
634 if (cmdlen != F_INSN_SIZE(ipfw_insn_log))
637 ((ipfw_insn_log *)cmd)->log_left =
638 ((ipfw_insn_log *)cmd)->max_log;
644 /* only odd command lengths */
645 if ( !(cmdlen & 1) || cmdlen > 31)
651 if (cmd->arg1 == 0 || cmd->arg1 > 256) {
652 printf("ipfw: invalid set size %d\n",
656 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32) +
661 case O_IP_SRC_LOOKUP:
662 case O_IP_DST_LOOKUP:
663 if (cmd->arg1 >= IPFW_TABLES_MAX) {
664 printf("ipfw: invalid table number %d\n",
668 if (cmdlen != F_INSN_SIZE(ipfw_insn) &&
669 cmdlen != F_INSN_SIZE(ipfw_insn_u32) + 1 &&
670 cmdlen != F_INSN_SIZE(ipfw_insn_u32))
675 if (cmdlen != F_INSN_SIZE(ipfw_insn_mac))
685 if (cmdlen < 1 || cmdlen > 31)
691 case O_IP_DSTPORT: /* XXX artificial limit, 30 port pairs */
692 if (cmdlen < 2 || cmdlen > 31)
699 if (cmdlen != F_INSN_SIZE(ipfw_insn_if))
704 if (cmdlen != F_INSN_SIZE(ipfw_insn_altq))
710 if (cmdlen != F_INSN_SIZE(ipfw_insn))
715 #ifdef IPFIREWALL_FORWARD
716 if (cmdlen != F_INSN_SIZE(ipfw_insn_sa))
725 if (ip_divert_ptr == NULL)
731 if (ng_ipfw_input_p == NULL)
736 if (!IPFW_NAT_LOADED)
738 if (cmdlen != F_INSN_SIZE(ipfw_insn_nat))
741 case O_FORWARD_MAC: /* XXX not implemented yet */
753 if (cmdlen != F_INSN_SIZE(ipfw_insn))
757 printf("ipfw: opcode %d, multiple actions"
764 printf("ipfw: opcode %d, action must be"
773 if (cmdlen != F_INSN_SIZE(struct in6_addr) +
774 F_INSN_SIZE(ipfw_insn))
779 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32) +
780 ((ipfw_insn_u32 *)cmd)->o.arg1)
786 if ( !(cmdlen & 1) || cmdlen > 127)
790 if( cmdlen != F_INSN_SIZE( ipfw_insn_icmp6 ) )
796 switch (cmd->opcode) {
809 printf("ipfw: no IPv6 support in kernel\n");
810 return EPROTONOSUPPORT;
813 printf("ipfw: opcode %d, unknown opcode\n",
819 if (have_action == 0) {
820 printf("ipfw: missing action\n");
826 printf("ipfw: opcode %d size %d wrong\n",
827 cmd->opcode, cmdlen);
833 * Translation of requests for compatibility with FreeBSD 7.2/8.
834 * a static variable tells us if we have an old client from userland,
835 * and if necessary we translate requests and responses between the
841 struct ip_fw7 *next; /* linked list of rules */
842 struct ip_fw7 *next_rule; /* ptr to next [skipto] rule */
843 /* 'next_rule' is used to pass up 'set_disable' status */
845 uint16_t act_ofs; /* offset of action in 32-bit units */
846 uint16_t cmd_len; /* # of 32-bit words in cmd */
847 uint16_t rulenum; /* rule number */
848 uint8_t set; /* rule set (0..31) */
849 // #define RESVD_SET 31 /* set for default and persistent rules */
850 uint8_t _pad; /* padding */
851 // uint32_t id; /* rule id, only in v.8 */
852 /* These fields are present in all rules. */
853 uint64_t pcnt; /* Packet counter */
854 uint64_t bcnt; /* Byte counter */
855 uint32_t timestamp; /* tv_sec of last match */
857 ipfw_insn cmd[1]; /* storage for commands */
860 int convert_rule_to_7(struct ip_fw *rule);
861 int convert_rule_to_8(struct ip_fw *rule);
864 #define RULESIZE7(rule) (sizeof(struct ip_fw7) + \
865 ((struct ip_fw7 *)(rule))->cmd_len * 4 - 4)
870 * Copy the static and dynamic rules to the supplied buffer
871 * and return the amount of space actually used.
872 * Must be run under IPFW_UH_RLOCK
875 ipfw_getrules(struct ip_fw_chain *chain, void *buf, size_t space)
878 char *ep = bp + space;
879 struct ip_fw *rule, *dst;
883 boot_seconds = boottime.tv_sec;
884 for (i = 0; i < chain->n_rules; i++) {
885 rule = chain->map[i];
888 /* Convert rule to FreeBSd 7.2 format */
890 if (bp + l + sizeof(uint32_t) <= ep) {
892 bcopy(rule, bp, l + sizeof(uint32_t));
893 error = convert_rule_to_7((struct ip_fw *) bp);
895 return 0; /*XXX correct? */
897 * XXX HACK. Store the disable mask in the "next"
898 * pointer in a wild attempt to keep the ABI the same.
899 * Why do we do this on EVERY rule?
901 bcopy(&V_set_disable,
902 &(((struct ip_fw7 *)bp)->next_rule),
903 sizeof(V_set_disable));
904 if (((struct ip_fw7 *)bp)->timestamp)
905 ((struct ip_fw7 *)bp)->timestamp += boot_seconds;
908 continue; /* go to next rule */
911 /* normal mode, don't touch rules */
913 if (bp + l > ep) { /* should not happen */
914 printf("overflow dumping static rules\n");
917 dst = (struct ip_fw *)bp;
920 * XXX HACK. Store the disable mask in the "next"
921 * pointer in a wild attempt to keep the ABI the same.
922 * Why do we do this on EVERY rule?
924 bcopy(&V_set_disable, &dst->next_rule, sizeof(V_set_disable));
926 dst->timestamp += boot_seconds;
929 ipfw_get_dynamic(&bp, ep); /* protected by the dynamic lock */
930 return (bp - (char *)buf);
935 * {set|get}sockopt parser.
938 ipfw_ctl(struct sockopt *sopt)
940 #define RULE_MAXSIZE (256*sizeof(u_int32_t))
943 struct ip_fw *buf, *rule;
944 struct ip_fw_chain *chain;
945 u_int32_t rulenum[2];
947 error = priv_check(sopt->sopt_td, PRIV_NETINET_IPFW);
952 * Disallow modifications in really-really secure mode, but still allow
953 * the logging counters to be reset.
955 if (sopt->sopt_name == IP_FW_ADD ||
956 (sopt->sopt_dir == SOPT_SET && sopt->sopt_name != IP_FW_RESETLOG)) {
957 error = securelevel_ge(sopt->sopt_td->td_ucred, 3);
962 chain = &V_layer3_chain;
965 switch (sopt->sopt_name) {
968 * pass up a copy of the current rules. Static rules
969 * come first (the last of which has number IPFW_DEFAULT_RULE),
970 * followed by a possibly empty list of dynamic rule.
971 * The last dynamic rule has NULL in the "next" field.
973 * Note that the calculated size is used to bound the
974 * amount of data returned to the user. The rule set may
975 * change between calculating the size and returning the
976 * data in which case we'll just return what fits.
981 size = chain->static_len;
982 size += ipfw_dyn_len();
983 if (size >= sopt->sopt_valsize)
985 buf = malloc(size, M_TEMP, M_WAITOK);
988 IPFW_UH_RLOCK(chain);
989 /* check again how much space we need */
990 want = chain->static_len + ipfw_dyn_len();
992 len = ipfw_getrules(chain, buf, size);
993 IPFW_UH_RUNLOCK(chain);
995 error = sooptcopyout(sopt, buf, len);
1003 /* locking is done within del_entry() */
1004 error = del_entry(chain, 0); /* special case, rule=0, cmd=0 means all */
1008 rule = malloc(RULE_MAXSIZE, M_TEMP, M_WAITOK);
1009 error = sooptcopyin(sopt, rule, RULE_MAXSIZE,
1010 sizeof(struct ip_fw7) );
1013 * If the size of commands equals RULESIZE7 then we assume
1014 * a FreeBSD7.2 binary is talking to us (set is7=1).
1015 * is7 is persistent so the next 'ipfw list' command
1016 * will use this format.
1017 * NOTE: If wrong version is guessed (this can happen if
1018 * the first ipfw command is 'ipfw [pipe] list')
1019 * the ipfw binary may crash or loop infinitly...
1021 if (sopt->sopt_valsize == RULESIZE7(rule)) {
1023 error = convert_rule_to_8(rule);
1027 error = check_ipfw_struct(rule, RULESIZE(rule));
1031 error = check_ipfw_struct(rule, sopt->sopt_valsize);
1034 /* locking is done within ipfw_add_rule() */
1035 error = ipfw_add_rule(chain, rule);
1036 size = RULESIZE(rule);
1037 if (!error && sopt->sopt_dir == SOPT_GET) {
1039 error = convert_rule_to_7(rule);
1040 size = RULESIZE7(rule);
1044 error = sooptcopyout(sopt, rule, size);
1052 * IP_FW_DEL is used for deleting single rules or sets,
1053 * and (ab)used to atomically manipulate sets. Argument size
1054 * is used to distinguish between the two:
1056 * delete single rule or set of rules,
1057 * or reassign rules (or sets) to a different set.
1058 * 2*sizeof(u_int32_t)
1059 * atomic disable/enable sets.
1060 * first u_int32_t contains sets to be disabled,
1061 * second u_int32_t contains sets to be enabled.
1063 error = sooptcopyin(sopt, rulenum,
1064 2*sizeof(u_int32_t), sizeof(u_int32_t));
1067 size = sopt->sopt_valsize;
1068 if (size == sizeof(u_int32_t) && rulenum[0] != 0) {
1069 /* delete or reassign, locking done in del_entry() */
1070 error = del_entry(chain, rulenum[0]);
1071 } else if (size == 2*sizeof(u_int32_t)) { /* set enable/disable */
1072 IPFW_UH_WLOCK(chain);
1074 (V_set_disable | rulenum[0]) & ~rulenum[1] &
1075 ~(1<<RESVD_SET); /* set RESVD_SET always enabled */
1076 IPFW_UH_WUNLOCK(chain);
1082 case IP_FW_RESETLOG: /* argument is an u_int_32, the rule number */
1084 if (sopt->sopt_val != 0) {
1085 error = sooptcopyin(sopt, rulenum,
1086 sizeof(u_int32_t), sizeof(u_int32_t));
1090 error = zero_entry(chain, rulenum[0],
1091 sopt->sopt_name == IP_FW_RESETLOG);
1094 /*--- TABLE manipulations are protected by the IPFW_LOCK ---*/
1095 case IP_FW_TABLE_ADD:
1097 ipfw_table_entry ent;
1099 error = sooptcopyin(sopt, &ent,
1100 sizeof(ent), sizeof(ent));
1103 error = ipfw_add_table_entry(chain, ent.tbl,
1104 ent.addr, ent.masklen, ent.value);
1108 case IP_FW_TABLE_DEL:
1110 ipfw_table_entry ent;
1112 error = sooptcopyin(sopt, &ent,
1113 sizeof(ent), sizeof(ent));
1116 error = ipfw_del_table_entry(chain, ent.tbl,
1117 ent.addr, ent.masklen);
1121 case IP_FW_TABLE_FLUSH:
1125 error = sooptcopyin(sopt, &tbl,
1126 sizeof(tbl), sizeof(tbl));
1130 error = ipfw_flush_table(chain, tbl);
1131 IPFW_WUNLOCK(chain);
1135 case IP_FW_TABLE_GETSIZE:
1139 if ((error = sooptcopyin(sopt, &tbl, sizeof(tbl),
1143 error = ipfw_count_table(chain, tbl, &cnt);
1144 IPFW_RUNLOCK(chain);
1147 error = sooptcopyout(sopt, &cnt, sizeof(cnt));
1151 case IP_FW_TABLE_LIST:
1155 if (sopt->sopt_valsize < sizeof(*tbl)) {
1159 size = sopt->sopt_valsize;
1160 tbl = malloc(size, M_TEMP, M_WAITOK);
1161 error = sooptcopyin(sopt, tbl, size, sizeof(*tbl));
1166 tbl->size = (size - sizeof(*tbl)) /
1167 sizeof(ipfw_table_entry);
1169 error = ipfw_dump_table(chain, tbl);
1170 IPFW_RUNLOCK(chain);
1175 error = sooptcopyout(sopt, tbl, size);
1180 /*--- NAT operations are protected by the IPFW_LOCK ---*/
1182 if (IPFW_NAT_LOADED)
1183 error = ipfw_nat_cfg_ptr(sopt);
1185 printf("IP_FW_NAT_CFG: %s\n",
1186 "ipfw_nat not present, please load it");
1192 if (IPFW_NAT_LOADED)
1193 error = ipfw_nat_del_ptr(sopt);
1195 printf("IP_FW_NAT_DEL: %s\n",
1196 "ipfw_nat not present, please load it");
1201 case IP_FW_NAT_GET_CONFIG:
1202 if (IPFW_NAT_LOADED)
1203 error = ipfw_nat_get_cfg_ptr(sopt);
1205 printf("IP_FW_NAT_GET_CFG: %s\n",
1206 "ipfw_nat not present, please load it");
1211 case IP_FW_NAT_GET_LOG:
1212 if (IPFW_NAT_LOADED)
1213 error = ipfw_nat_get_log_ptr(sopt);
1215 printf("IP_FW_NAT_GET_LOG: %s\n",
1216 "ipfw_nat not present, please load it");
1222 printf("ipfw: ipfw_ctl invalid option %d\n", sopt->sopt_name);
1231 #define RULE_MAXSIZE (256*sizeof(u_int32_t))
1233 /* Functions to convert rules 7.2 <==> 8.0 */
1235 convert_rule_to_7(struct ip_fw *rule)
1237 /* Used to modify original rule */
1238 struct ip_fw7 *rule7 = (struct ip_fw7 *)rule;
1239 /* copy of original rule, version 8 */
1242 /* Used to copy commands */
1243 ipfw_insn *ccmd, *dst;
1244 int ll = 0, ccmdlen = 0;
1246 tmp = malloc(RULE_MAXSIZE, M_TEMP, M_NOWAIT | M_ZERO);
1248 return 1; //XXX error
1250 bcopy(rule, tmp, RULE_MAXSIZE);
1253 rule7->_pad = tmp->_pad;
1254 rule7->set = tmp->set;
1255 rule7->rulenum = tmp->rulenum;
1256 rule7->cmd_len = tmp->cmd_len;
1257 rule7->act_ofs = tmp->act_ofs;
1258 rule7->next_rule = (struct ip_fw7 *)tmp->next_rule;
1259 rule7->next = (struct ip_fw7 *)tmp->x_next;
1260 rule7->cmd_len = tmp->cmd_len;
1261 rule7->pcnt = tmp->pcnt;
1262 rule7->bcnt = tmp->bcnt;
1263 rule7->timestamp = tmp->timestamp;
1266 for (ll = tmp->cmd_len, ccmd = tmp->cmd, dst = rule7->cmd ;
1267 ll > 0 ; ll -= ccmdlen, ccmd += ccmdlen, dst += ccmdlen) {
1268 ccmdlen = F_LEN(ccmd);
1270 bcopy(ccmd, dst, F_LEN(ccmd)*sizeof(uint32_t));
1272 if (dst->opcode > O_NAT)
1273 /* O_REASS doesn't exists in 7.2 version, so
1274 * decrement opcode if it is after O_REASS
1279 printf("ipfw: opcode %d size truncated\n",
1290 convert_rule_to_8(struct ip_fw *rule)
1292 /* Used to modify original rule */
1293 struct ip_fw7 *rule7 = (struct ip_fw7 *) rule;
1295 /* Used to copy commands */
1296 ipfw_insn *ccmd, *dst;
1297 int ll = 0, ccmdlen = 0;
1299 /* Copy of original rule */
1300 struct ip_fw7 *tmp = malloc(RULE_MAXSIZE, M_TEMP, M_NOWAIT | M_ZERO);
1302 return 1; //XXX error
1305 bcopy(rule7, tmp, RULE_MAXSIZE);
1307 for (ll = tmp->cmd_len, ccmd = tmp->cmd, dst = rule->cmd ;
1308 ll > 0 ; ll -= ccmdlen, ccmd += ccmdlen, dst += ccmdlen) {
1309 ccmdlen = F_LEN(ccmd);
1311 bcopy(ccmd, dst, F_LEN(ccmd)*sizeof(uint32_t));
1313 if (dst->opcode > O_NAT)
1314 /* O_REASS doesn't exists in 7.2 version, so
1315 * increment opcode if it is after O_REASS
1320 printf("ipfw: opcode %d size truncated\n",
1326 rule->_pad = tmp->_pad;
1327 rule->set = tmp->set;
1328 rule->rulenum = tmp->rulenum;
1329 rule->cmd_len = tmp->cmd_len;
1330 rule->act_ofs = tmp->act_ofs;
1331 rule->next_rule = (struct ip_fw *)tmp->next_rule;
1332 rule->x_next = (struct ip_fw *)tmp->next;
1333 rule->cmd_len = tmp->cmd_len;
1334 rule->id = 0; /* XXX see if is ok = 0 */
1335 rule->pcnt = tmp->pcnt;
1336 rule->bcnt = tmp->bcnt;
1337 rule->timestamp = tmp->timestamp;