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$");
32 * Sockopt support for ipfw. The routines here implement
33 * the upper half of the ipfw code.
39 #error IPFIREWALL requires INET.
41 #include "opt_inet6.h"
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/malloc.h>
46 #include <sys/mbuf.h> /* struct m_tag used by nested headers */
47 #include <sys/kernel.h>
51 #include <sys/rwlock.h>
52 #include <sys/socket.h>
53 #include <sys/socketvar.h>
54 #include <sys/sysctl.h>
55 #include <sys/syslog.h>
57 #include <net/route.h>
60 #include <netinet/in.h>
61 #include <netinet/ip_var.h> /* hooks */
62 #include <netinet/ip_fw.h>
63 #include <netinet/ipfw/ip_fw_private.h>
66 #include <security/mac/mac_framework.h>
69 MALLOC_DEFINE(M_IPFW, "IpFw/IpAcct", "IpFw/IpAcct chain's");
72 * static variables followed by global ones (none in this file)
76 * Find the smallest rule >= key, id.
77 * We could use bsearch but it is so simple that we code it directly
80 ipfw_find_rule(struct ip_fw_chain *chain, uint32_t key, uint32_t id)
85 for (lo = 0, hi = chain->n_rules - 1; lo < hi;) {
89 lo = i + 1; /* continue from the next one */
90 else if (r->rulenum > key)
91 hi = i; /* this might be good */
93 lo = i + 1; /* continue from the next one */
94 else /* r->id >= id */
95 hi = i; /* this might be good */
101 * allocate a new map, returns the chain locked. extra is the number
102 * of entries to add or delete.
104 static struct ip_fw **
105 get_map(struct ip_fw_chain *chain, int extra, int locked)
112 i = chain->n_rules + extra;
113 map = malloc(i * sizeof(struct ip_fw *), M_IPFW,
114 locked ? M_NOWAIT : M_WAITOK);
116 printf("%s: cannot allocate map\n", __FUNCTION__);
120 IPFW_UH_WLOCK(chain);
121 if (i >= chain->n_rules + extra) /* good */
123 /* otherwise we lost the race, free and retry */
125 IPFW_UH_WUNLOCK(chain);
131 * swap the maps. It is supposed to be called with IPFW_UH_WLOCK
133 static struct ip_fw **
134 swap_map(struct ip_fw_chain *chain, struct ip_fw **new_map, int new_len)
136 struct ip_fw **old_map;
140 chain->n_rules = new_len;
141 old_map = chain->map;
142 chain->map = new_map;
148 * Add a new rule to the list. Copy the rule into a malloc'ed area, then
149 * possibly create a rule number and add the rule to the list.
150 * Update the rule_number in the input struct so the caller knows it as well.
151 * XXX DO NOT USE FOR THE DEFAULT RULE.
152 * Must be called without IPFW_UH held
155 ipfw_add_rule(struct ip_fw_chain *chain, struct ip_fw *input_rule)
158 int i, l, insert_before;
159 struct ip_fw **map; /* the new array of pointers */
161 if (chain->rules == NULL || input_rule->rulenum > IPFW_DEFAULT_RULE-1)
164 l = RULESIZE(input_rule);
165 rule = malloc(l, M_IPFW, M_WAITOK | M_ZERO);
168 /* get_map returns with IPFW_UH_WLOCK if successful */
169 map = get_map(chain, 1, 0 /* not locked */);
175 bcopy(input_rule, rule, l);
176 /* clear fields not settable from userland */
178 rule->next_rule = NULL;
183 if (V_autoinc_step < 1)
185 else if (V_autoinc_step > 1000)
186 V_autoinc_step = 1000;
187 /* find the insertion point, we will insert before */
188 insert_before = rule->rulenum ? rule->rulenum + 1 : IPFW_DEFAULT_RULE;
189 i = ipfw_find_rule(chain, insert_before, 0);
190 /* duplicate first part */
192 bcopy(chain->map, map, i * sizeof(struct ip_fw *));
194 /* duplicate remaining part, we always have the default rule */
195 bcopy(chain->map + i, map + i + 1,
196 sizeof(struct ip_fw *) *(chain->n_rules - i));
197 if (rule->rulenum == 0) {
198 /* write back the number */
199 rule->rulenum = i > 0 ? map[i-1]->rulenum : 0;
200 if (rule->rulenum < IPFW_DEFAULT_RULE - V_autoinc_step)
201 rule->rulenum += V_autoinc_step;
202 input_rule->rulenum = rule->rulenum;
205 rule->id = chain->id + 1;
206 map = swap_map(chain, map, chain->n_rules + 1);
207 chain->static_len += l;
208 IPFW_UH_WUNLOCK(chain);
215 * Reclaim storage associated with a list of rules. This is
216 * typically the list created using remove_rule.
217 * A NULL pointer on input is handled correctly.
220 ipfw_reap_rules(struct ip_fw *head)
224 while ((rule = head) != NULL) {
231 * Used by del_entry() to check if a rule should be kept.
232 * Returns 1 if the rule must be kept, 0 otherwise.
234 * Called with cmd = {0,1,5}.
235 * cmd == 0 matches on rule numbers, excludes rules in RESVD_SET if n == 0 ;
236 * cmd == 1 matches on set numbers only, rule numbers are ignored;
237 * cmd == 5 matches on rule and set numbers.
239 * n == 0 is a wildcard for rule numbers, there is no wildcard for sets.
242 * (default || reserved || !match_set || !match_number)
244 * default ::= (rule->rulenum == IPFW_DEFAULT_RULE)
245 * // the default rule is always protected
247 * reserved ::= (cmd == 0 && n == 0 && rule->set == RESVD_SET)
248 * // RESVD_SET is protected only if cmd == 0 and n == 0 ("ipfw flush")
250 * match_set ::= (cmd == 0 || rule->set == set)
251 * // set number is ignored for cmd == 0
253 * match_number ::= (cmd == 1 || n == 0 || n == rule->rulenum)
254 * // number is ignored for cmd == 1 or n == 0
258 keep_rule(struct ip_fw *rule, uint8_t cmd, uint8_t set, uint32_t n)
261 (rule->rulenum == IPFW_DEFAULT_RULE) ||
262 (cmd == 0 && n == 0 && rule->set == RESVD_SET) ||
263 !(cmd == 0 || rule->set == set) ||
264 !(cmd == 1 || n == 0 || n == rule->rulenum);
268 * Remove all rules with given number, or do set manipulation.
269 * Assumes chain != NULL && *chain != NULL.
271 * The argument is an uint32_t. The low 16 bit are the rule or set number;
272 * the next 8 bits are the new set; the top 8 bits indicate the command:
274 * 0 delete rules numbered "rulenum"
275 * 1 delete rules in set "rulenum"
276 * 2 move rules "rulenum" to set "new_set"
277 * 3 move rules from set "rulenum" to set "new_set"
278 * 4 swap sets "rulenum" and "new_set"
279 * 5 delete rules "rulenum" and set "new_set"
282 del_entry(struct ip_fw_chain *chain, uint32_t arg)
285 uint32_t num; /* rule number or old_set */
286 uint8_t cmd, new_set;
287 int start, end, i, ofs, n;
288 struct ip_fw **map = NULL;
292 cmd = (arg >> 24) & 0xff;
293 new_set = (arg >> 16) & 0xff;
295 if (cmd > 5 || new_set > RESVD_SET)
297 if (cmd == 0 || cmd == 2 || cmd == 5) {
298 if (num >= IPFW_DEFAULT_RULE)
301 if (num > RESVD_SET) /* old_set */
305 IPFW_UH_WLOCK(chain); /* arbitrate writers */
306 chain->reap = NULL; /* prepare for deletions */
309 case 0: /* delete rules "num" (num == 0 matches all) */
310 case 1: /* delete all rules in set N */
311 case 5: /* delete rules with number N and set "new_set". */
314 * Locate first rule to delete (start), the rule after
315 * the last one to delete (end), and count how many
316 * rules to delete (n). Always use keep_rule() to
317 * determine which rules to keep.
321 /* look for a specific set including RESVD_SET.
322 * Must scan the entire range, ignore num.
325 for (start = -1, end = i = 0; i < chain->n_rules; i++) {
326 if (keep_rule(chain->map[i], cmd, new_set, 0))
333 end++; /* first non-matching */
335 /* Optimized search on rule numbers */
336 start = ipfw_find_rule(chain, num, 0);
337 for (end = start; end < chain->n_rules; end++) {
338 rule = chain->map[end];
339 if (num > 0 && rule->rulenum != num)
341 if (!keep_rule(rule, cmd, new_set, num))
347 /* A flush request (arg == 0 or cmd == 1) on empty
348 * ruleset returns with no error. On the contrary,
349 * if there is no match on a specific request,
352 if (arg != 0 && cmd != 1)
357 /* We have something to delete. Allocate the new map */
358 map = get_map(chain, -n, 1 /* locked */);
364 /* 1. bcopy the initial part of the map */
366 bcopy(chain->map, map, start * sizeof(struct ip_fw *));
367 /* 2. copy active rules between start and end */
368 for (i = ofs = start; i < end; i++) {
369 rule = chain->map[i];
370 if (keep_rule(rule, cmd, new_set, num))
373 /* 3. copy the final part of the map */
374 bcopy(chain->map + end, map + ofs,
375 (chain->n_rules - end) * sizeof(struct ip_fw *));
376 /* 4. swap the maps (under BH_LOCK) */
377 map = swap_map(chain, map, chain->n_rules - n);
378 /* 5. now remove the rules deleted from the old map */
379 for (i = start; i < end; i++) {
382 if (keep_rule(rule, cmd, new_set, num))
385 chain->static_len -= l;
386 ipfw_remove_dyn_children(rule);
387 rule->x_next = chain->reap;
393 * In the next 3 cases the loop stops at (n_rules - 1)
394 * because the default rule is never eligible..
397 case 2: /* move rules with given RULE number to new set */
398 for (i = 0; i < chain->n_rules - 1; i++) {
399 rule = chain->map[i];
400 if (rule->rulenum == num)
405 case 3: /* move rules with given SET number to new set */
406 for (i = 0; i < chain->n_rules - 1; i++) {
407 rule = chain->map[i];
408 if (rule->set == num)
413 case 4: /* swap two sets */
414 for (i = 0; i < chain->n_rules - 1; i++) {
415 rule = chain->map[i];
416 if (rule->set == num)
418 else if (rule->set == new_set)
426 IPFW_UH_WUNLOCK(chain);
427 ipfw_reap_rules(rule);
434 * Clear counters for a specific rule.
435 * Normally run under IPFW_UH_RLOCK, but these are idempotent ops
436 * so we only care that rules do not disappear.
439 clear_counters(struct ip_fw *rule, int log_only)
441 ipfw_insn_log *l = (ipfw_insn_log *)ACTION_PTR(rule);
444 rule->bcnt = rule->pcnt = 0;
447 if (l->o.opcode == O_LOG)
448 l->log_left = l->max_log;
452 * Reset some or all counters on firewall rules.
453 * The argument `arg' is an u_int32_t. The low 16 bit are the rule number,
454 * the next 8 bits are the set number, the top 8 bits are the command:
455 * 0 work with rules from all set's;
456 * 1 work with rules only from specified set.
457 * Specified rule number is zero if we want to clear all entries.
458 * log_only is 1 if we only want to reset logs, zero otherwise.
461 zero_entry(struct ip_fw_chain *chain, u_int32_t arg, int log_only)
467 uint16_t rulenum = arg & 0xffff;
468 uint8_t set = (arg >> 16) & 0xff;
469 uint8_t cmd = (arg >> 24) & 0xff;
473 if (cmd == 1 && set > RESVD_SET)
476 IPFW_UH_RLOCK(chain);
478 V_norule_counter = 0;
479 for (i = 0; i < chain->n_rules; i++) {
480 rule = chain->map[i];
481 /* Skip rules not in our set. */
482 if (cmd == 1 && rule->set != set)
484 clear_counters(rule, log_only);
486 msg = log_only ? "All logging counts reset" :
487 "Accounting cleared";
490 for (i = 0; i < chain->n_rules; i++) {
491 rule = chain->map[i];
492 if (rule->rulenum == rulenum) {
493 if (cmd == 0 || rule->set == set)
494 clear_counters(rule, log_only);
497 if (rule->rulenum > rulenum)
500 if (!cleared) { /* we did not find any matching rules */
501 IPFW_UH_RUNLOCK(chain);
504 msg = log_only ? "logging count reset" : "cleared";
506 IPFW_UH_RUNLOCK(chain);
509 int lev = LOG_SECURITY | LOG_NOTICE;
512 log(lev, "ipfw: Entry %d %s.\n", rulenum, msg);
514 log(lev, "ipfw: %s.\n", msg);
520 * Check validity of the structure before insert.
521 * Rules are simple, so this mostly need to check rule sizes.
524 check_ipfw_struct(struct ip_fw *rule, int size)
530 if (size < sizeof(*rule)) {
531 printf("ipfw: rule too short\n");
534 /* first, check for valid size */
537 printf("ipfw: size mismatch (have %d want %d)\n", size, l);
540 if (rule->act_ofs >= rule->cmd_len) {
541 printf("ipfw: bogus action offset (%u > %u)\n",
542 rule->act_ofs, rule->cmd_len - 1);
546 * Now go for the individual checks. Very simple ones, basically only
549 for (l = rule->cmd_len, cmd = rule->cmd ;
550 l > 0 ; l -= cmdlen, cmd += cmdlen) {
553 printf("ipfw: opcode %d size truncated\n",
557 switch (cmd->opcode) {
588 if (cmdlen != F_INSN_SIZE(ipfw_insn))
593 if (cmdlen != F_INSN_SIZE(ipfw_insn))
595 if (cmd->arg1 >= rt_numfibs) {
596 printf("ipfw: invalid fib number %d\n",
603 if (cmdlen != F_INSN_SIZE(ipfw_insn))
605 if ((cmd->arg1 != IP_FW_TABLEARG) &&
606 (cmd->arg1 >= rt_numfibs)) {
607 printf("ipfw: invalid fib number %d\n",
622 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32))
627 if (cmdlen != F_INSN_SIZE(ipfw_insn_limit))
632 if (cmdlen != F_INSN_SIZE(ipfw_insn_log))
635 ((ipfw_insn_log *)cmd)->log_left =
636 ((ipfw_insn_log *)cmd)->max_log;
642 /* only odd command lengths */
643 if ( !(cmdlen & 1) || cmdlen > 31)
649 if (cmd->arg1 == 0 || cmd->arg1 > 256) {
650 printf("ipfw: invalid set size %d\n",
654 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32) +
659 case O_IP_SRC_LOOKUP:
660 case O_IP_DST_LOOKUP:
661 if (cmd->arg1 >= IPFW_TABLES_MAX) {
662 printf("ipfw: invalid table number %d\n",
666 if (cmdlen != F_INSN_SIZE(ipfw_insn) &&
667 cmdlen != F_INSN_SIZE(ipfw_insn_u32) + 1 &&
668 cmdlen != F_INSN_SIZE(ipfw_insn_u32))
673 if (cmdlen != F_INSN_SIZE(ipfw_insn_mac))
683 if (cmdlen < 1 || cmdlen > 31)
689 case O_IP_DSTPORT: /* XXX artificial limit, 30 port pairs */
690 if (cmdlen < 2 || cmdlen > 31)
697 if (cmdlen != F_INSN_SIZE(ipfw_insn_if))
702 if (cmdlen != F_INSN_SIZE(ipfw_insn_altq))
708 if (cmdlen != F_INSN_SIZE(ipfw_insn))
713 #ifdef IPFIREWALL_FORWARD
714 if (cmdlen != F_INSN_SIZE(ipfw_insn_sa))
723 #ifdef IPFIREWALL_FORWARD
724 if (cmdlen != F_INSN_SIZE(ipfw_insn_sa6))
734 if (ip_divert_ptr == NULL)
740 if (ng_ipfw_input_p == NULL)
745 if (!IPFW_NAT_LOADED)
747 if (cmdlen != F_INSN_SIZE(ipfw_insn_nat))
750 case O_FORWARD_MAC: /* XXX not implemented yet */
763 if (cmdlen != F_INSN_SIZE(ipfw_insn))
767 printf("ipfw: opcode %d, multiple actions"
774 printf("ipfw: opcode %d, action must be"
783 if (cmdlen != F_INSN_SIZE(struct in6_addr) +
784 F_INSN_SIZE(ipfw_insn))
789 if (cmdlen != F_INSN_SIZE(ipfw_insn_u32) +
790 ((ipfw_insn_u32 *)cmd)->o.arg1)
796 if ( !(cmdlen & 1) || cmdlen > 127)
800 if( cmdlen != F_INSN_SIZE( ipfw_insn_icmp6 ) )
806 switch (cmd->opcode) {
819 printf("ipfw: no IPv6 support in kernel\n");
820 return EPROTONOSUPPORT;
823 printf("ipfw: opcode %d, unknown opcode\n",
829 if (have_action == 0) {
830 printf("ipfw: missing action\n");
836 printf("ipfw: opcode %d size %d wrong\n",
837 cmd->opcode, cmdlen);
843 * Translation of requests for compatibility with FreeBSD 7.2/8.
844 * a static variable tells us if we have an old client from userland,
845 * and if necessary we translate requests and responses between the
851 struct ip_fw7 *next; /* linked list of rules */
852 struct ip_fw7 *next_rule; /* ptr to next [skipto] rule */
853 /* 'next_rule' is used to pass up 'set_disable' status */
855 uint16_t act_ofs; /* offset of action in 32-bit units */
856 uint16_t cmd_len; /* # of 32-bit words in cmd */
857 uint16_t rulenum; /* rule number */
858 uint8_t set; /* rule set (0..31) */
859 // #define RESVD_SET 31 /* set for default and persistent rules */
860 uint8_t _pad; /* padding */
861 // uint32_t id; /* rule id, only in v.8 */
862 /* These fields are present in all rules. */
863 uint64_t pcnt; /* Packet counter */
864 uint64_t bcnt; /* Byte counter */
865 uint32_t timestamp; /* tv_sec of last match */
867 ipfw_insn cmd[1]; /* storage for commands */
870 int convert_rule_to_7(struct ip_fw *rule);
871 int convert_rule_to_8(struct ip_fw *rule);
874 #define RULESIZE7(rule) (sizeof(struct ip_fw7) + \
875 ((struct ip_fw7 *)(rule))->cmd_len * 4 - 4)
880 * Copy the static and dynamic rules to the supplied buffer
881 * and return the amount of space actually used.
882 * Must be run under IPFW_UH_RLOCK
885 ipfw_getrules(struct ip_fw_chain *chain, void *buf, size_t space)
888 char *ep = bp + space;
889 struct ip_fw *rule, *dst;
893 boot_seconds = boottime.tv_sec;
894 for (i = 0; i < chain->n_rules; i++) {
895 rule = chain->map[i];
898 /* Convert rule to FreeBSd 7.2 format */
900 if (bp + l + sizeof(uint32_t) <= ep) {
902 bcopy(rule, bp, l + sizeof(uint32_t));
903 error = convert_rule_to_7((struct ip_fw *) bp);
905 return 0; /*XXX correct? */
907 * XXX HACK. Store the disable mask in the "next"
908 * pointer in a wild attempt to keep the ABI the same.
909 * Why do we do this on EVERY rule?
911 bcopy(&V_set_disable,
912 &(((struct ip_fw7 *)bp)->next_rule),
913 sizeof(V_set_disable));
914 if (((struct ip_fw7 *)bp)->timestamp)
915 ((struct ip_fw7 *)bp)->timestamp += boot_seconds;
918 continue; /* go to next rule */
921 /* normal mode, don't touch rules */
923 if (bp + l > ep) { /* should not happen */
924 printf("overflow dumping static rules\n");
927 dst = (struct ip_fw *)bp;
930 * XXX HACK. Store the disable mask in the "next"
931 * pointer in a wild attempt to keep the ABI the same.
932 * Why do we do this on EVERY rule?
934 bcopy(&V_set_disable, &dst->next_rule, sizeof(V_set_disable));
936 dst->timestamp += boot_seconds;
939 ipfw_get_dynamic(&bp, ep); /* protected by the dynamic lock */
940 return (bp - (char *)buf);
945 * {set|get}sockopt parser.
948 ipfw_ctl(struct sockopt *sopt)
950 #define RULE_MAXSIZE (256*sizeof(u_int32_t))
953 struct ip_fw *buf, *rule;
954 struct ip_fw_chain *chain;
955 u_int32_t rulenum[2];
957 error = priv_check(sopt->sopt_td, PRIV_NETINET_IPFW);
962 * Disallow modifications in really-really secure mode, but still allow
963 * the logging counters to be reset.
965 if (sopt->sopt_name == IP_FW_ADD ||
966 (sopt->sopt_dir == SOPT_SET && sopt->sopt_name != IP_FW_RESETLOG)) {
967 error = securelevel_ge(sopt->sopt_td->td_ucred, 3);
972 chain = &V_layer3_chain;
975 switch (sopt->sopt_name) {
978 * pass up a copy of the current rules. Static rules
979 * come first (the last of which has number IPFW_DEFAULT_RULE),
980 * followed by a possibly empty list of dynamic rule.
981 * The last dynamic rule has NULL in the "next" field.
983 * Note that the calculated size is used to bound the
984 * amount of data returned to the user. The rule set may
985 * change between calculating the size and returning the
986 * data in which case we'll just return what fits.
991 size = chain->static_len;
992 size += ipfw_dyn_len();
993 if (size >= sopt->sopt_valsize)
995 buf = malloc(size, M_TEMP, M_WAITOK);
998 IPFW_UH_RLOCK(chain);
999 /* check again how much space we need */
1000 want = chain->static_len + ipfw_dyn_len();
1002 len = ipfw_getrules(chain, buf, size);
1003 IPFW_UH_RUNLOCK(chain);
1005 error = sooptcopyout(sopt, buf, len);
1013 /* locking is done within del_entry() */
1014 error = del_entry(chain, 0); /* special case, rule=0, cmd=0 means all */
1018 rule = malloc(RULE_MAXSIZE, M_TEMP, M_WAITOK);
1019 error = sooptcopyin(sopt, rule, RULE_MAXSIZE,
1020 sizeof(struct ip_fw7) );
1023 * If the size of commands equals RULESIZE7 then we assume
1024 * a FreeBSD7.2 binary is talking to us (set is7=1).
1025 * is7 is persistent so the next 'ipfw list' command
1026 * will use this format.
1027 * NOTE: If wrong version is guessed (this can happen if
1028 * the first ipfw command is 'ipfw [pipe] list')
1029 * the ipfw binary may crash or loop infinitly...
1031 if (sopt->sopt_valsize == RULESIZE7(rule)) {
1033 error = convert_rule_to_8(rule);
1037 error = check_ipfw_struct(rule, RULESIZE(rule));
1041 error = check_ipfw_struct(rule, sopt->sopt_valsize);
1044 /* locking is done within ipfw_add_rule() */
1045 error = ipfw_add_rule(chain, rule);
1046 size = RULESIZE(rule);
1047 if (!error && sopt->sopt_dir == SOPT_GET) {
1049 error = convert_rule_to_7(rule);
1050 size = RULESIZE7(rule);
1054 error = sooptcopyout(sopt, rule, size);
1062 * IP_FW_DEL is used for deleting single rules or sets,
1063 * and (ab)used to atomically manipulate sets. Argument size
1064 * is used to distinguish between the two:
1066 * delete single rule or set of rules,
1067 * or reassign rules (or sets) to a different set.
1068 * 2*sizeof(u_int32_t)
1069 * atomic disable/enable sets.
1070 * first u_int32_t contains sets to be disabled,
1071 * second u_int32_t contains sets to be enabled.
1073 error = sooptcopyin(sopt, rulenum,
1074 2*sizeof(u_int32_t), sizeof(u_int32_t));
1077 size = sopt->sopt_valsize;
1078 if (size == sizeof(u_int32_t) && rulenum[0] != 0) {
1079 /* delete or reassign, locking done in del_entry() */
1080 error = del_entry(chain, rulenum[0]);
1081 } else if (size == 2*sizeof(u_int32_t)) { /* set enable/disable */
1082 IPFW_UH_WLOCK(chain);
1084 (V_set_disable | rulenum[0]) & ~rulenum[1] &
1085 ~(1<<RESVD_SET); /* set RESVD_SET always enabled */
1086 IPFW_UH_WUNLOCK(chain);
1092 case IP_FW_RESETLOG: /* argument is an u_int_32, the rule number */
1094 if (sopt->sopt_val != 0) {
1095 error = sooptcopyin(sopt, rulenum,
1096 sizeof(u_int32_t), sizeof(u_int32_t));
1100 error = zero_entry(chain, rulenum[0],
1101 sopt->sopt_name == IP_FW_RESETLOG);
1104 /*--- TABLE manipulations are protected by the IPFW_LOCK ---*/
1105 case IP_FW_TABLE_ADD:
1107 ipfw_table_entry ent;
1109 error = sooptcopyin(sopt, &ent,
1110 sizeof(ent), sizeof(ent));
1113 error = ipfw_add_table_entry(chain, ent.tbl,
1114 ent.addr, ent.masklen, ent.value);
1118 case IP_FW_TABLE_DEL:
1120 ipfw_table_entry ent;
1122 error = sooptcopyin(sopt, &ent,
1123 sizeof(ent), sizeof(ent));
1126 error = ipfw_del_table_entry(chain, ent.tbl,
1127 ent.addr, ent.masklen);
1131 case IP_FW_TABLE_FLUSH:
1135 error = sooptcopyin(sopt, &tbl,
1136 sizeof(tbl), sizeof(tbl));
1140 error = ipfw_flush_table(chain, tbl);
1141 IPFW_WUNLOCK(chain);
1145 case IP_FW_TABLE_GETSIZE:
1149 if ((error = sooptcopyin(sopt, &tbl, sizeof(tbl),
1153 error = ipfw_count_table(chain, tbl, &cnt);
1154 IPFW_RUNLOCK(chain);
1157 error = sooptcopyout(sopt, &cnt, sizeof(cnt));
1161 case IP_FW_TABLE_LIST:
1165 if (sopt->sopt_valsize < sizeof(*tbl)) {
1169 size = sopt->sopt_valsize;
1170 tbl = malloc(size, M_TEMP, M_WAITOK);
1171 error = sooptcopyin(sopt, tbl, size, sizeof(*tbl));
1176 tbl->size = (size - sizeof(*tbl)) /
1177 sizeof(ipfw_table_entry);
1179 error = ipfw_dump_table(chain, tbl);
1180 IPFW_RUNLOCK(chain);
1185 error = sooptcopyout(sopt, tbl, size);
1190 /*--- NAT operations are protected by the IPFW_LOCK ---*/
1192 if (IPFW_NAT_LOADED)
1193 error = ipfw_nat_cfg_ptr(sopt);
1195 printf("IP_FW_NAT_CFG: %s\n",
1196 "ipfw_nat not present, please load it");
1202 if (IPFW_NAT_LOADED)
1203 error = ipfw_nat_del_ptr(sopt);
1205 printf("IP_FW_NAT_DEL: %s\n",
1206 "ipfw_nat not present, please load it");
1211 case IP_FW_NAT_GET_CONFIG:
1212 if (IPFW_NAT_LOADED)
1213 error = ipfw_nat_get_cfg_ptr(sopt);
1215 printf("IP_FW_NAT_GET_CFG: %s\n",
1216 "ipfw_nat not present, please load it");
1221 case IP_FW_NAT_GET_LOG:
1222 if (IPFW_NAT_LOADED)
1223 error = ipfw_nat_get_log_ptr(sopt);
1225 printf("IP_FW_NAT_GET_LOG: %s\n",
1226 "ipfw_nat not present, please load it");
1232 printf("ipfw: ipfw_ctl invalid option %d\n", sopt->sopt_name);
1241 #define RULE_MAXSIZE (256*sizeof(u_int32_t))
1243 /* Functions to convert rules 7.2 <==> 8.0 */
1245 convert_rule_to_7(struct ip_fw *rule)
1247 /* Used to modify original rule */
1248 struct ip_fw7 *rule7 = (struct ip_fw7 *)rule;
1249 /* copy of original rule, version 8 */
1252 /* Used to copy commands */
1253 ipfw_insn *ccmd, *dst;
1254 int ll = 0, ccmdlen = 0;
1256 tmp = malloc(RULE_MAXSIZE, M_TEMP, M_NOWAIT | M_ZERO);
1258 return 1; //XXX error
1260 bcopy(rule, tmp, RULE_MAXSIZE);
1263 rule7->_pad = tmp->_pad;
1264 rule7->set = tmp->set;
1265 rule7->rulenum = tmp->rulenum;
1266 rule7->cmd_len = tmp->cmd_len;
1267 rule7->act_ofs = tmp->act_ofs;
1268 rule7->next_rule = (struct ip_fw7 *)tmp->next_rule;
1269 rule7->next = (struct ip_fw7 *)tmp->x_next;
1270 rule7->cmd_len = tmp->cmd_len;
1271 rule7->pcnt = tmp->pcnt;
1272 rule7->bcnt = tmp->bcnt;
1273 rule7->timestamp = tmp->timestamp;
1276 for (ll = tmp->cmd_len, ccmd = tmp->cmd, dst = rule7->cmd ;
1277 ll > 0 ; ll -= ccmdlen, ccmd += ccmdlen, dst += ccmdlen) {
1278 ccmdlen = F_LEN(ccmd);
1280 bcopy(ccmd, dst, F_LEN(ccmd)*sizeof(uint32_t));
1282 if (dst->opcode > O_NAT)
1283 /* O_REASS doesn't exists in 7.2 version, so
1284 * decrement opcode if it is after O_REASS
1289 printf("ipfw: opcode %d size truncated\n",
1300 convert_rule_to_8(struct ip_fw *rule)
1302 /* Used to modify original rule */
1303 struct ip_fw7 *rule7 = (struct ip_fw7 *) rule;
1305 /* Used to copy commands */
1306 ipfw_insn *ccmd, *dst;
1307 int ll = 0, ccmdlen = 0;
1309 /* Copy of original rule */
1310 struct ip_fw7 *tmp = malloc(RULE_MAXSIZE, M_TEMP, M_NOWAIT | M_ZERO);
1312 return 1; //XXX error
1315 bcopy(rule7, tmp, RULE_MAXSIZE);
1317 for (ll = tmp->cmd_len, ccmd = tmp->cmd, dst = rule->cmd ;
1318 ll > 0 ; ll -= ccmdlen, ccmd += ccmdlen, dst += ccmdlen) {
1319 ccmdlen = F_LEN(ccmd);
1321 bcopy(ccmd, dst, F_LEN(ccmd)*sizeof(uint32_t));
1323 if (dst->opcode > O_NAT)
1324 /* O_REASS doesn't exists in 7.2 version, so
1325 * increment opcode if it is after O_REASS
1330 printf("ipfw: opcode %d size truncated\n",
1336 rule->_pad = tmp->_pad;
1337 rule->set = tmp->set;
1338 rule->rulenum = tmp->rulenum;
1339 rule->cmd_len = tmp->cmd_len;
1340 rule->act_ofs = tmp->act_ofs;
1341 rule->next_rule = (struct ip_fw *)tmp->next_rule;
1342 rule->x_next = (struct ip_fw *)tmp->next;
1343 rule->cmd_len = tmp->cmd_len;
1344 rule->id = 0; /* XXX see if is ok = 0 */
1345 rule->pcnt = tmp->pcnt;
1346 rule->bcnt = tmp->bcnt;
1347 rule->timestamp = tmp->timestamp;