1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
3 *
4 * Copyright (c) 2001 Daniel Hartmeier
5 * Copyright (c) 2002,2003 Henning Brauer
6 * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org>
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 *
13 * - Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * - Redistributions in binary form must reproduce the above
16 * copyright notice, this list of conditions and the following
17 * disclaimer in the documentation and/or other materials provided
18 * with the distribution.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
28 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
30 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
31 * POSSIBILITY OF SUCH DAMAGE.
32 *
33 * Effort sponsored in part by the Defense Advanced Research Projects
34 * Agency (DARPA) and Air Force Research Laboratory, Air Force
35 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
36 *
37 * $OpenBSD: pf_ioctl.c,v 1.213 2009/02/15 21:46:12 mbalmer Exp $
38 */
39
40 #include <sys/cdefs.h>
41 #include "opt_inet.h"
42 #include "opt_inet6.h"
43 #include "opt_bpf.h"
44 #include "opt_pf.h"
45
46 #include <sys/param.h>
47 #include <sys/_bitset.h>
48 #include <sys/bitset.h>
49 #include <sys/bus.h>
50 #include <sys/conf.h>
51 #include <sys/endian.h>
52 #include <sys/fcntl.h>
53 #include <sys/filio.h>
54 #include <sys/hash.h>
55 #include <sys/interrupt.h>
56 #include <sys/jail.h>
57 #include <sys/kernel.h>
58 #include <sys/kthread.h>
59 #include <sys/lock.h>
60 #include <sys/mbuf.h>
61 #include <sys/module.h>
62 #include <sys/nv.h>
63 #include <sys/proc.h>
64 #include <sys/sdt.h>
65 #include <sys/smp.h>
66 #include <sys/socket.h>
67 #include <sys/sysctl.h>
68 #include <sys/md5.h>
69 #include <sys/ucred.h>
70
71 #include <net/if.h>
72 #include <net/if_var.h>
73 #include <net/if_private.h>
74 #include <net/vnet.h>
75 #include <net/route.h>
76 #include <net/pfil.h>
77 #include <net/pfvar.h>
78 #include <net/if_pfsync.h>
79 #include <net/if_pflog.h>
80
81 #include <netinet/in.h>
82 #include <netinet/ip.h>
83 #include <netinet/ip_var.h>
84 #include <netinet6/ip6_var.h>
85 #include <netinet/ip_icmp.h>
86 #include <netpfil/pf/pf_nl.h>
87 #include <netpfil/pf/pf_nv.h>
88
89 #ifdef INET6
90 #include <netinet/ip6.h>
91 #endif /* INET6 */
92
93 #ifdef ALTQ
94 #include <net/altq/altq.h>
95 #endif
96
97 SDT_PROBE_DEFINE3(pf, ioctl, ioctl, error, "int", "int", "int");
98 SDT_PROBE_DEFINE3(pf, ioctl, function, error, "char *", "int", "int");
99 SDT_PROBE_DEFINE2(pf, ioctl, addrule, error, "int", "int");
100 SDT_PROBE_DEFINE2(pf, ioctl, nvchk, error, "int", "int");
101
102 static struct pf_kpool *pf_get_kpool(const char *, u_int32_t, u_int8_t,
103 u_int32_t, u_int8_t, u_int8_t, u_int8_t, int);
104
105 static void pf_mv_kpool(struct pf_kpalist *, struct pf_kpalist *);
106 static void pf_empty_kpool(struct pf_kpalist *);
107 static int pfioctl(struct cdev *, u_long, caddr_t, int,
108 struct thread *);
109 static int pf_begin_eth(uint32_t *, const char *);
110 static int pf_rollback_eth(uint32_t, const char *);
111 static int pf_commit_eth(uint32_t, const char *);
112 static void pf_free_eth_rule(struct pf_keth_rule *);
113 #ifdef ALTQ
114 static int pf_begin_altq(u_int32_t *);
115 static int pf_rollback_altq(u_int32_t);
116 static int pf_commit_altq(u_int32_t);
117 static int pf_enable_altq(struct pf_altq *);
118 static int pf_disable_altq(struct pf_altq *);
119 static uint16_t pf_qname2qid(const char *);
120 static void pf_qid_unref(uint16_t);
121 #endif /* ALTQ */
122 static int pf_begin_rules(u_int32_t *, int, const char *);
123 static int pf_rollback_rules(u_int32_t, int, char *);
124 static int pf_setup_pfsync_matching(struct pf_kruleset *);
125 static void pf_hash_rule_rolling(MD5_CTX *, struct pf_krule *);
126 static void pf_hash_rule(struct pf_krule *);
127 static void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
128 static int pf_commit_rules(u_int32_t, int, char *);
129 static int pf_addr_setup(struct pf_kruleset *,
130 struct pf_addr_wrap *, sa_family_t);
131 static void pf_src_node_copy(const struct pf_ksrc_node *,
132 struct pf_src_node *);
133 #ifdef ALTQ
134 static int pf_export_kaltq(struct pf_altq *,
135 struct pfioc_altq_v1 *, size_t);
136 static int pf_import_kaltq(struct pfioc_altq_v1 *,
137 struct pf_altq *, size_t);
138 #endif /* ALTQ */
139
140 VNET_DEFINE(struct pf_krule, pf_default_rule);
141
142 static __inline int pf_krule_compare(struct pf_krule *,
143 struct pf_krule *);
144
145 RB_GENERATE(pf_krule_global, pf_krule, entry_global, pf_krule_compare);
146
147 #ifdef ALTQ
148 VNET_DEFINE_STATIC(int, pf_altq_running);
149 #define V_pf_altq_running VNET(pf_altq_running)
150 #endif
151
152 #define TAGID_MAX 50000
153 struct pf_tagname {
154 TAILQ_ENTRY(pf_tagname) namehash_entries;
155 TAILQ_ENTRY(pf_tagname) taghash_entries;
156 char name[PF_TAG_NAME_SIZE];
157 uint16_t tag;
158 int ref;
159 };
160
161 struct pf_tagset {
162 TAILQ_HEAD(, pf_tagname) *namehash;
163 TAILQ_HEAD(, pf_tagname) *taghash;
164 unsigned int mask;
165 uint32_t seed;
166 BITSET_DEFINE(, TAGID_MAX) avail;
167 };
168
169 VNET_DEFINE(struct pf_tagset, pf_tags);
170 #define V_pf_tags VNET(pf_tags)
171 static unsigned int pf_rule_tag_hashsize;
172 #define PF_RULE_TAG_HASH_SIZE_DEFAULT 128
173 SYSCTL_UINT(_net_pf, OID_AUTO, rule_tag_hashsize, CTLFLAG_RDTUN,
174 &pf_rule_tag_hashsize, PF_RULE_TAG_HASH_SIZE_DEFAULT,
175 "Size of pf(4) rule tag hashtable");
176
177 #ifdef ALTQ
178 VNET_DEFINE(struct pf_tagset, pf_qids);
179 #define V_pf_qids VNET(pf_qids)
180 static unsigned int pf_queue_tag_hashsize;
181 #define PF_QUEUE_TAG_HASH_SIZE_DEFAULT 128
182 SYSCTL_UINT(_net_pf, OID_AUTO, queue_tag_hashsize, CTLFLAG_RDTUN,
183 &pf_queue_tag_hashsize, PF_QUEUE_TAG_HASH_SIZE_DEFAULT,
184 "Size of pf(4) queue tag hashtable");
185 #endif
186 VNET_DEFINE(uma_zone_t, pf_tag_z);
187 #define V_pf_tag_z VNET(pf_tag_z)
188 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db");
189 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules");
190
191 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
192 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
193 #endif
194
195 VNET_DEFINE_STATIC(bool, pf_filter_local) = false;
196 #define V_pf_filter_local VNET(pf_filter_local)
197 SYSCTL_BOOL(_net_pf, OID_AUTO, filter_local, CTLFLAG_VNET | CTLFLAG_RW,
198 &VNET_NAME(pf_filter_local), false,
199 "Enable filtering for packets delivered to local network stack");
200
201 #ifdef PF_DEFAULT_TO_DROP
202 VNET_DEFINE_STATIC(bool, default_to_drop) = true;
203 #else
204 VNET_DEFINE_STATIC(bool, default_to_drop);
205 #endif
206 #define V_default_to_drop VNET(default_to_drop)
207 SYSCTL_BOOL(_net_pf, OID_AUTO, default_to_drop, CTLFLAG_RDTUN | CTLFLAG_VNET,
208 &VNET_NAME(default_to_drop), false,
209 "Make the default rule drop all packets.");
210
211 static void pf_init_tagset(struct pf_tagset *, unsigned int *,
212 unsigned int);
213 static void pf_cleanup_tagset(struct pf_tagset *);
214 static uint16_t tagname2hashindex(const struct pf_tagset *, const char *);
215 static uint16_t tag2hashindex(const struct pf_tagset *, uint16_t);
216 static u_int16_t tagname2tag(struct pf_tagset *, const char *);
217 static u_int16_t pf_tagname2tag(const char *);
218 static void tag_unref(struct pf_tagset *, u_int16_t);
219
220 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
221
222 struct cdev *pf_dev;
223
224 /*
225 * XXX - These are new and need to be checked when moveing to a new version
226 */
227 static void pf_clear_all_states(void);
228 static int pf_killstates_row(struct pf_kstate_kill *,
229 struct pf_idhash *);
230 static int pf_killstates_nv(struct pfioc_nv *);
231 static int pf_clearstates_nv(struct pfioc_nv *);
232 static int pf_getstate(struct pfioc_nv *);
233 static int pf_getstatus(struct pfioc_nv *);
234 static int pf_clear_tables(void);
235 static void pf_kill_srcnodes(struct pfioc_src_node_kill *);
236 static int pf_keepcounters(struct pfioc_nv *);
237 static void pf_tbladdr_copyout(struct pf_addr_wrap *);
238
239 /*
240 * Wrapper functions for pfil(9) hooks
241 */
242 static pfil_return_t pf_eth_check_in(struct mbuf **m, struct ifnet *ifp,
243 int flags, void *ruleset __unused, struct inpcb *inp);
244 static pfil_return_t pf_eth_check_out(struct mbuf **m, struct ifnet *ifp,
245 int flags, void *ruleset __unused, struct inpcb *inp);
246 #ifdef INET
247 static pfil_return_t pf_check_in(struct mbuf **m, struct ifnet *ifp,
248 int flags, void *ruleset __unused, struct inpcb *inp);
249 static pfil_return_t pf_check_out(struct mbuf **m, struct ifnet *ifp,
250 int flags, void *ruleset __unused, struct inpcb *inp);
251 #endif
252 #ifdef INET6
253 static pfil_return_t pf_check6_in(struct mbuf **m, struct ifnet *ifp,
254 int flags, void *ruleset __unused, struct inpcb *inp);
255 static pfil_return_t pf_check6_out(struct mbuf **m, struct ifnet *ifp,
256 int flags, void *ruleset __unused, struct inpcb *inp);
257 #endif
258
259 static void hook_pf_eth(void);
260 static void hook_pf(void);
261 static void dehook_pf_eth(void);
262 static void dehook_pf(void);
263 static int shutdown_pf(void);
264 static int pf_load(void);
265 static void pf_unload(void);
266
267 static struct cdevsw pf_cdevsw = {
268 .d_ioctl = pfioctl,
269 .d_name = PF_NAME,
270 .d_version = D_VERSION,
271 };
272
273 VNET_DEFINE_STATIC(bool, pf_pfil_hooked);
274 #define V_pf_pfil_hooked VNET(pf_pfil_hooked)
275 VNET_DEFINE_STATIC(bool, pf_pfil_eth_hooked);
276 #define V_pf_pfil_eth_hooked VNET(pf_pfil_eth_hooked)
277
278 /*
279 * We need a flag that is neither hooked nor running to know when
280 * the VNET is "valid". We primarily need this to control (global)
281 * external event, e.g., eventhandlers.
282 */
283 VNET_DEFINE(int, pf_vnet_active);
284 #define V_pf_vnet_active VNET(pf_vnet_active)
285
286 int pf_end_threads;
287 struct proc *pf_purge_proc;
288
289 VNET_DEFINE(struct rmlock, pf_rules_lock);
290 VNET_DEFINE_STATIC(struct sx, pf_ioctl_lock);
291 #define V_pf_ioctl_lock VNET(pf_ioctl_lock)
292 struct sx pf_end_lock;
293
294 /* pfsync */
295 VNET_DEFINE(pfsync_state_import_t *, pfsync_state_import_ptr);
296 VNET_DEFINE(pfsync_insert_state_t *, pfsync_insert_state_ptr);
297 VNET_DEFINE(pfsync_update_state_t *, pfsync_update_state_ptr);
298 VNET_DEFINE(pfsync_delete_state_t *, pfsync_delete_state_ptr);
299 VNET_DEFINE(pfsync_clear_states_t *, pfsync_clear_states_ptr);
300 VNET_DEFINE(pfsync_defer_t *, pfsync_defer_ptr);
301 VNET_DEFINE(pflow_export_state_t *, pflow_export_state_ptr);
302 pfsync_detach_ifnet_t *pfsync_detach_ifnet_ptr;
303
304 /* pflog */
305 pflog_packet_t *pflog_packet_ptr = NULL;
306
307 /*
308 * Copy a user-provided string, returning an error if truncation would occur.
309 * Avoid scanning past "sz" bytes in the source string since there's no
310 * guarantee that it's nul-terminated.
311 */
312 static int
pf_user_strcpy(char * dst,const char * src,size_t sz)313 pf_user_strcpy(char *dst, const char *src, size_t sz)
314 {
315 if (strnlen(src, sz) == sz)
316 return (EINVAL);
317 (void)strlcpy(dst, src, sz);
318 return (0);
319 }
320
321 static void
pfattach_vnet(void)322 pfattach_vnet(void)
323 {
324 u_int32_t *my_timeout = V_pf_default_rule.timeout;
325
326 bzero(&V_pf_status, sizeof(V_pf_status));
327
328 pf_initialize();
329 pfr_initialize();
330 pfi_initialize_vnet();
331 pf_normalize_init();
332 pf_syncookies_init();
333
334 V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
335 V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT;
336
337 RB_INIT(&V_pf_anchors);
338 pf_init_kruleset(&pf_main_ruleset);
339
340 pf_init_keth(V_pf_keth);
341
342 /* default rule should never be garbage collected */
343 V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next;
344 V_pf_default_rule.action = V_default_to_drop ? PF_DROP : PF_PASS;
345 V_pf_default_rule.nr = (uint32_t)-1;
346 V_pf_default_rule.rtableid = -1;
347
348 pf_counter_u64_init(&V_pf_default_rule.evaluations, M_WAITOK);
349 for (int i = 0; i < 2; i++) {
350 pf_counter_u64_init(&V_pf_default_rule.packets[i], M_WAITOK);
351 pf_counter_u64_init(&V_pf_default_rule.bytes[i], M_WAITOK);
352 }
353 V_pf_default_rule.states_cur = counter_u64_alloc(M_WAITOK);
354 V_pf_default_rule.states_tot = counter_u64_alloc(M_WAITOK);
355 for (pf_sn_types_t sn_type = 0; sn_type<PF_SN_MAX; sn_type++)
356 V_pf_default_rule.src_nodes[sn_type] = counter_u64_alloc(M_WAITOK);
357
358 V_pf_default_rule.timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
359 M_WAITOK | M_ZERO);
360
361 #ifdef PF_WANT_32_TO_64_COUNTER
362 V_pf_kifmarker = malloc(sizeof(*V_pf_kifmarker), PFI_MTYPE, M_WAITOK | M_ZERO);
363 V_pf_rulemarker = malloc(sizeof(*V_pf_rulemarker), M_PFRULE, M_WAITOK | M_ZERO);
364 PF_RULES_WLOCK();
365 LIST_INSERT_HEAD(&V_pf_allkiflist, V_pf_kifmarker, pfik_allkiflist);
366 LIST_INSERT_HEAD(&V_pf_allrulelist, &V_pf_default_rule, allrulelist);
367 V_pf_allrulecount++;
368 LIST_INSERT_HEAD(&V_pf_allrulelist, V_pf_rulemarker, allrulelist);
369 PF_RULES_WUNLOCK();
370 #endif
371
372 /* initialize default timeouts */
373 my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
374 my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL;
375 my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
376 my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL;
377 my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL;
378 my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL;
379 my_timeout[PFTM_SCTP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
380 my_timeout[PFTM_SCTP_OPENING] = PFTM_TCP_OPENING_VAL;
381 my_timeout[PFTM_SCTP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
382 my_timeout[PFTM_SCTP_CLOSING] = PFTM_TCP_CLOSING_VAL;
383 my_timeout[PFTM_SCTP_CLOSED] = PFTM_TCP_CLOSED_VAL;
384 my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL;
385 my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL;
386 my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL;
387 my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL;
388 my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL;
389 my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL;
390 my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL;
391 my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL;
392 my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL;
393 my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL;
394 my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL;
395 my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL;
396 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
397 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
398
399 V_pf_status.debug = PF_DEBUG_URGENT;
400 /*
401 * XXX This is different than in OpenBSD where reassembly is enabled by
402 * defult. In FreeBSD we expect people to still use scrub rules and
403 * switch to the new syntax later. Only when they switch they must
404 * explicitly enable reassemle. We could change the default once the
405 * scrub rule functionality is hopefully removed some day in future.
406 */
407 V_pf_status.reass = 0;
408
409 V_pf_pfil_hooked = false;
410 V_pf_pfil_eth_hooked = false;
411
412 /* XXX do our best to avoid a conflict */
413 V_pf_status.hostid = arc4random();
414
415 for (int i = 0; i < PFRES_MAX; i++)
416 V_pf_status.counters[i] = counter_u64_alloc(M_WAITOK);
417 for (int i = 0; i < KLCNT_MAX; i++)
418 V_pf_status.lcounters[i] = counter_u64_alloc(M_WAITOK);
419 for (int i = 0; i < FCNT_MAX; i++)
420 pf_counter_u64_init(&V_pf_status.fcounters[i], M_WAITOK);
421 for (int i = 0; i < SCNT_MAX; i++)
422 V_pf_status.scounters[i] = counter_u64_alloc(M_WAITOK);
423
424 if (swi_add(&V_pf_swi_ie, "pf send", pf_intr, curvnet, SWI_NET,
425 INTR_MPSAFE, &V_pf_swi_cookie) != 0)
426 /* XXXGL: leaked all above. */
427 return;
428 }
429
430 static struct pf_kpool *
pf_get_kpool(const char * anchor,u_int32_t ticket,u_int8_t rule_action,u_int32_t rule_number,u_int8_t r_last,u_int8_t active,u_int8_t check_ticket,int which)431 pf_get_kpool(const char *anchor, u_int32_t ticket, u_int8_t rule_action,
432 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
433 u_int8_t check_ticket, int which)
434 {
435 struct pf_kruleset *ruleset;
436 struct pf_krule *rule;
437 int rs_num;
438
439 MPASS(which == PF_RDR || which == PF_NAT || which == PF_RT);
440
441 ruleset = pf_find_kruleset(anchor);
442 if (ruleset == NULL)
443 return (NULL);
444 rs_num = pf_get_ruleset_number(rule_action);
445 if (rs_num >= PF_RULESET_MAX)
446 return (NULL);
447 if (active) {
448 if (check_ticket && ticket !=
449 ruleset->rules[rs_num].active.ticket)
450 return (NULL);
451 if (r_last)
452 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
453 pf_krulequeue);
454 else
455 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
456 } else {
457 if (check_ticket && ticket !=
458 ruleset->rules[rs_num].inactive.ticket)
459 return (NULL);
460 if (r_last)
461 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
462 pf_krulequeue);
463 else
464 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
465 }
466 if (!r_last) {
467 while ((rule != NULL) && (rule->nr != rule_number))
468 rule = TAILQ_NEXT(rule, entries);
469 }
470 if (rule == NULL)
471 return (NULL);
472
473 switch (which) {
474 case PF_RDR:
475 return (&rule->rdr);
476 case PF_NAT:
477 return (&rule->nat);
478 case PF_RT:
479 return (&rule->route);
480 default:
481 panic("Unknow pool type %d", which);
482 }
483 }
484
485 static void
pf_mv_kpool(struct pf_kpalist * poola,struct pf_kpalist * poolb)486 pf_mv_kpool(struct pf_kpalist *poola, struct pf_kpalist *poolb)
487 {
488 struct pf_kpooladdr *mv_pool_pa;
489
490 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
491 TAILQ_REMOVE(poola, mv_pool_pa, entries);
492 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
493 }
494 }
495
496 static void
pf_empty_kpool(struct pf_kpalist * poola)497 pf_empty_kpool(struct pf_kpalist *poola)
498 {
499 struct pf_kpooladdr *pa;
500
501 while ((pa = TAILQ_FIRST(poola)) != NULL) {
502 switch (pa->addr.type) {
503 case PF_ADDR_DYNIFTL:
504 pfi_dynaddr_remove(pa->addr.p.dyn);
505 break;
506 case PF_ADDR_TABLE:
507 /* XXX: this could be unfinished pooladdr on pabuf */
508 if (pa->addr.p.tbl != NULL)
509 pfr_detach_table(pa->addr.p.tbl);
510 break;
511 }
512 if (pa->kif)
513 pfi_kkif_unref(pa->kif);
514 TAILQ_REMOVE(poola, pa, entries);
515 free(pa, M_PFRULE);
516 }
517 }
518
519 static void
pf_unlink_rule_locked(struct pf_krulequeue * rulequeue,struct pf_krule * rule)520 pf_unlink_rule_locked(struct pf_krulequeue *rulequeue, struct pf_krule *rule)
521 {
522
523 PF_RULES_WASSERT();
524 PF_UNLNKDRULES_ASSERT();
525
526 TAILQ_REMOVE(rulequeue, rule, entries);
527
528 rule->rule_ref |= PFRULE_REFS;
529 TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries);
530 }
531
532 static void
pf_unlink_rule(struct pf_krulequeue * rulequeue,struct pf_krule * rule)533 pf_unlink_rule(struct pf_krulequeue *rulequeue, struct pf_krule *rule)
534 {
535
536 PF_RULES_WASSERT();
537
538 PF_UNLNKDRULES_LOCK();
539 pf_unlink_rule_locked(rulequeue, rule);
540 PF_UNLNKDRULES_UNLOCK();
541 }
542
543 static void
pf_free_eth_rule(struct pf_keth_rule * rule)544 pf_free_eth_rule(struct pf_keth_rule *rule)
545 {
546 PF_RULES_WASSERT();
547
548 if (rule == NULL)
549 return;
550
551 if (rule->tag)
552 tag_unref(&V_pf_tags, rule->tag);
553 if (rule->match_tag)
554 tag_unref(&V_pf_tags, rule->match_tag);
555 #ifdef ALTQ
556 pf_qid_unref(rule->qid);
557 #endif
558
559 if (rule->bridge_to)
560 pfi_kkif_unref(rule->bridge_to);
561 if (rule->kif)
562 pfi_kkif_unref(rule->kif);
563
564 if (rule->ipsrc.addr.type == PF_ADDR_TABLE)
565 pfr_detach_table(rule->ipsrc.addr.p.tbl);
566 if (rule->ipdst.addr.type == PF_ADDR_TABLE)
567 pfr_detach_table(rule->ipdst.addr.p.tbl);
568
569 counter_u64_free(rule->evaluations);
570 for (int i = 0; i < 2; i++) {
571 counter_u64_free(rule->packets[i]);
572 counter_u64_free(rule->bytes[i]);
573 }
574 uma_zfree_pcpu(pf_timestamp_pcpu_zone, rule->timestamp);
575 pf_keth_anchor_remove(rule);
576
577 free(rule, M_PFRULE);
578 }
579
580 void
pf_free_rule(struct pf_krule * rule)581 pf_free_rule(struct pf_krule *rule)
582 {
583
584 PF_RULES_WASSERT();
585 PF_CONFIG_ASSERT();
586
587 if (rule->tag)
588 tag_unref(&V_pf_tags, rule->tag);
589 if (rule->match_tag)
590 tag_unref(&V_pf_tags, rule->match_tag);
591 #ifdef ALTQ
592 if (rule->pqid != rule->qid)
593 pf_qid_unref(rule->pqid);
594 pf_qid_unref(rule->qid);
595 #endif
596 switch (rule->src.addr.type) {
597 case PF_ADDR_DYNIFTL:
598 pfi_dynaddr_remove(rule->src.addr.p.dyn);
599 break;
600 case PF_ADDR_TABLE:
601 pfr_detach_table(rule->src.addr.p.tbl);
602 break;
603 }
604 switch (rule->dst.addr.type) {
605 case PF_ADDR_DYNIFTL:
606 pfi_dynaddr_remove(rule->dst.addr.p.dyn);
607 break;
608 case PF_ADDR_TABLE:
609 pfr_detach_table(rule->dst.addr.p.tbl);
610 break;
611 }
612 if (rule->overload_tbl)
613 pfr_detach_table(rule->overload_tbl);
614 if (rule->kif)
615 pfi_kkif_unref(rule->kif);
616 if (rule->rcv_kif)
617 pfi_kkif_unref(rule->rcv_kif);
618 pf_kanchor_remove(rule);
619 pf_empty_kpool(&rule->rdr.list);
620 pf_empty_kpool(&rule->nat.list);
621 pf_empty_kpool(&rule->route.list);
622
623 pf_krule_free(rule);
624 }
625
626 static void
pf_init_tagset(struct pf_tagset * ts,unsigned int * tunable_size,unsigned int default_size)627 pf_init_tagset(struct pf_tagset *ts, unsigned int *tunable_size,
628 unsigned int default_size)
629 {
630 unsigned int i;
631 unsigned int hashsize;
632
633 if (*tunable_size == 0 || !powerof2(*tunable_size))
634 *tunable_size = default_size;
635
636 hashsize = *tunable_size;
637 ts->namehash = mallocarray(hashsize, sizeof(*ts->namehash), M_PFHASH,
638 M_WAITOK);
639 ts->taghash = mallocarray(hashsize, sizeof(*ts->taghash), M_PFHASH,
640 M_WAITOK);
641 ts->mask = hashsize - 1;
642 ts->seed = arc4random();
643 for (i = 0; i < hashsize; i++) {
644 TAILQ_INIT(&ts->namehash[i]);
645 TAILQ_INIT(&ts->taghash[i]);
646 }
647 BIT_FILL(TAGID_MAX, &ts->avail);
648 }
649
650 static void
pf_cleanup_tagset(struct pf_tagset * ts)651 pf_cleanup_tagset(struct pf_tagset *ts)
652 {
653 unsigned int i;
654 unsigned int hashsize;
655 struct pf_tagname *t, *tmp;
656
657 /*
658 * Only need to clean up one of the hashes as each tag is hashed
659 * into each table.
660 */
661 hashsize = ts->mask + 1;
662 for (i = 0; i < hashsize; i++)
663 TAILQ_FOREACH_SAFE(t, &ts->namehash[i], namehash_entries, tmp)
664 uma_zfree(V_pf_tag_z, t);
665
666 free(ts->namehash, M_PFHASH);
667 free(ts->taghash, M_PFHASH);
668 }
669
670 static uint16_t
tagname2hashindex(const struct pf_tagset * ts,const char * tagname)671 tagname2hashindex(const struct pf_tagset *ts, const char *tagname)
672 {
673 size_t len;
674
675 len = strnlen(tagname, PF_TAG_NAME_SIZE - 1);
676 return (murmur3_32_hash(tagname, len, ts->seed) & ts->mask);
677 }
678
679 static uint16_t
tag2hashindex(const struct pf_tagset * ts,uint16_t tag)680 tag2hashindex(const struct pf_tagset *ts, uint16_t tag)
681 {
682
683 return (tag & ts->mask);
684 }
685
686 static u_int16_t
tagname2tag(struct pf_tagset * ts,const char * tagname)687 tagname2tag(struct pf_tagset *ts, const char *tagname)
688 {
689 struct pf_tagname *tag;
690 u_int32_t index;
691 u_int16_t new_tagid;
692
693 PF_RULES_WASSERT();
694
695 index = tagname2hashindex(ts, tagname);
696 TAILQ_FOREACH(tag, &ts->namehash[index], namehash_entries)
697 if (strcmp(tagname, tag->name) == 0) {
698 tag->ref++;
699 return (tag->tag);
700 }
701
702 /*
703 * new entry
704 *
705 * to avoid fragmentation, we do a linear search from the beginning
706 * and take the first free slot we find.
707 */
708 new_tagid = BIT_FFS(TAGID_MAX, &ts->avail);
709 /*
710 * Tags are 1-based, with valid tags in the range [1..TAGID_MAX].
711 * BIT_FFS() returns a 1-based bit number, with 0 indicating no bits
712 * set. It may also return a bit number greater than TAGID_MAX due
713 * to rounding of the number of bits in the vector up to a multiple
714 * of the vector word size at declaration/allocation time.
715 */
716 if ((new_tagid == 0) || (new_tagid > TAGID_MAX))
717 return (0);
718
719 /* Mark the tag as in use. Bits are 0-based for BIT_CLR() */
720 BIT_CLR(TAGID_MAX, new_tagid - 1, &ts->avail);
721
722 /* allocate and fill new struct pf_tagname */
723 tag = uma_zalloc(V_pf_tag_z, M_NOWAIT);
724 if (tag == NULL)
725 return (0);
726 strlcpy(tag->name, tagname, sizeof(tag->name));
727 tag->tag = new_tagid;
728 tag->ref = 1;
729
730 /* Insert into namehash */
731 TAILQ_INSERT_TAIL(&ts->namehash[index], tag, namehash_entries);
732
733 /* Insert into taghash */
734 index = tag2hashindex(ts, new_tagid);
735 TAILQ_INSERT_TAIL(&ts->taghash[index], tag, taghash_entries);
736
737 return (tag->tag);
738 }
739
740 static void
tag_unref(struct pf_tagset * ts,u_int16_t tag)741 tag_unref(struct pf_tagset *ts, u_int16_t tag)
742 {
743 struct pf_tagname *t;
744 uint16_t index;
745
746 PF_RULES_WASSERT();
747
748 index = tag2hashindex(ts, tag);
749 TAILQ_FOREACH(t, &ts->taghash[index], taghash_entries)
750 if (tag == t->tag) {
751 if (--t->ref == 0) {
752 TAILQ_REMOVE(&ts->taghash[index], t,
753 taghash_entries);
754 index = tagname2hashindex(ts, t->name);
755 TAILQ_REMOVE(&ts->namehash[index], t,
756 namehash_entries);
757 /* Bits are 0-based for BIT_SET() */
758 BIT_SET(TAGID_MAX, tag - 1, &ts->avail);
759 uma_zfree(V_pf_tag_z, t);
760 }
761 break;
762 }
763 }
764
765 static uint16_t
pf_tagname2tag(const char * tagname)766 pf_tagname2tag(const char *tagname)
767 {
768 return (tagname2tag(&V_pf_tags, tagname));
769 }
770
771 static int
pf_begin_eth(uint32_t * ticket,const char * anchor)772 pf_begin_eth(uint32_t *ticket, const char *anchor)
773 {
774 struct pf_keth_rule *rule, *tmp;
775 struct pf_keth_ruleset *rs;
776
777 PF_RULES_WASSERT();
778
779 rs = pf_find_or_create_keth_ruleset(anchor);
780 if (rs == NULL)
781 return (EINVAL);
782
783 /* Purge old inactive rules. */
784 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
785 tmp) {
786 TAILQ_REMOVE(rs->inactive.rules, rule,
787 entries);
788 pf_free_eth_rule(rule);
789 }
790
791 *ticket = ++rs->inactive.ticket;
792 rs->inactive.open = 1;
793
794 return (0);
795 }
796
797 static int
pf_rollback_eth(uint32_t ticket,const char * anchor)798 pf_rollback_eth(uint32_t ticket, const char *anchor)
799 {
800 struct pf_keth_rule *rule, *tmp;
801 struct pf_keth_ruleset *rs;
802
803 PF_RULES_WASSERT();
804
805 rs = pf_find_keth_ruleset(anchor);
806 if (rs == NULL)
807 return (EINVAL);
808
809 if (!rs->inactive.open ||
810 ticket != rs->inactive.ticket)
811 return (0);
812
813 /* Purge old inactive rules. */
814 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
815 tmp) {
816 TAILQ_REMOVE(rs->inactive.rules, rule, entries);
817 pf_free_eth_rule(rule);
818 }
819
820 rs->inactive.open = 0;
821
822 pf_remove_if_empty_keth_ruleset(rs);
823
824 return (0);
825 }
826
827 #define PF_SET_SKIP_STEPS(i) \
828 do { \
829 while (head[i] != cur) { \
830 head[i]->skip[i].ptr = cur; \
831 head[i] = TAILQ_NEXT(head[i], entries); \
832 } \
833 } while (0)
834
835 static void
pf_eth_calc_skip_steps(struct pf_keth_ruleq * rules)836 pf_eth_calc_skip_steps(struct pf_keth_ruleq *rules)
837 {
838 struct pf_keth_rule *cur, *prev, *head[PFE_SKIP_COUNT];
839 int i;
840
841 cur = TAILQ_FIRST(rules);
842 prev = cur;
843 for (i = 0; i < PFE_SKIP_COUNT; ++i)
844 head[i] = cur;
845 while (cur != NULL) {
846 if (cur->kif != prev->kif || cur->ifnot != prev->ifnot)
847 PF_SET_SKIP_STEPS(PFE_SKIP_IFP);
848 if (cur->direction != prev->direction)
849 PF_SET_SKIP_STEPS(PFE_SKIP_DIR);
850 if (cur->proto != prev->proto)
851 PF_SET_SKIP_STEPS(PFE_SKIP_PROTO);
852 if (memcmp(&cur->src, &prev->src, sizeof(cur->src)) != 0)
853 PF_SET_SKIP_STEPS(PFE_SKIP_SRC_ADDR);
854 if (memcmp(&cur->dst, &prev->dst, sizeof(cur->dst)) != 0)
855 PF_SET_SKIP_STEPS(PFE_SKIP_DST_ADDR);
856 if (cur->ipsrc.neg != prev->ipsrc.neg ||
857 pf_addr_wrap_neq(&cur->ipsrc.addr, &prev->ipsrc.addr))
858 PF_SET_SKIP_STEPS(PFE_SKIP_SRC_IP_ADDR);
859 if (cur->ipdst.neg != prev->ipdst.neg ||
860 pf_addr_wrap_neq(&cur->ipdst.addr, &prev->ipdst.addr))
861 PF_SET_SKIP_STEPS(PFE_SKIP_DST_IP_ADDR);
862
863 prev = cur;
864 cur = TAILQ_NEXT(cur, entries);
865 }
866 for (i = 0; i < PFE_SKIP_COUNT; ++i)
867 PF_SET_SKIP_STEPS(i);
868 }
869
870 static int
pf_commit_eth(uint32_t ticket,const char * anchor)871 pf_commit_eth(uint32_t ticket, const char *anchor)
872 {
873 struct pf_keth_ruleq *rules;
874 struct pf_keth_ruleset *rs;
875
876 rs = pf_find_keth_ruleset(anchor);
877 if (rs == NULL) {
878 return (EINVAL);
879 }
880
881 if (!rs->inactive.open ||
882 ticket != rs->inactive.ticket)
883 return (EBUSY);
884
885 PF_RULES_WASSERT();
886
887 pf_eth_calc_skip_steps(rs->inactive.rules);
888
889 rules = rs->active.rules;
890 atomic_store_ptr(&rs->active.rules, rs->inactive.rules);
891 rs->inactive.rules = rules;
892 rs->inactive.ticket = rs->active.ticket;
893
894 return (pf_rollback_eth(rs->inactive.ticket,
895 rs->anchor ? rs->anchor->path : ""));
896 }
897
898 #ifdef ALTQ
899 static uint16_t
pf_qname2qid(const char * qname)900 pf_qname2qid(const char *qname)
901 {
902 return (tagname2tag(&V_pf_qids, qname));
903 }
904
905 static void
pf_qid_unref(uint16_t qid)906 pf_qid_unref(uint16_t qid)
907 {
908 tag_unref(&V_pf_qids, qid);
909 }
910
911 static int
pf_begin_altq(u_int32_t * ticket)912 pf_begin_altq(u_int32_t *ticket)
913 {
914 struct pf_altq *altq, *tmp;
915 int error = 0;
916
917 PF_RULES_WASSERT();
918
919 /* Purge the old altq lists */
920 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
921 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
922 /* detach and destroy the discipline */
923 error = altq_remove(altq);
924 }
925 free(altq, M_PFALTQ);
926 }
927 TAILQ_INIT(V_pf_altq_ifs_inactive);
928 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
929 pf_qid_unref(altq->qid);
930 free(altq, M_PFALTQ);
931 }
932 TAILQ_INIT(V_pf_altqs_inactive);
933 if (error)
934 return (error);
935 *ticket = ++V_ticket_altqs_inactive;
936 V_altqs_inactive_open = 1;
937 return (0);
938 }
939
940 static int
pf_rollback_altq(u_int32_t ticket)941 pf_rollback_altq(u_int32_t ticket)
942 {
943 struct pf_altq *altq, *tmp;
944 int error = 0;
945
946 PF_RULES_WASSERT();
947
948 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
949 return (0);
950 /* Purge the old altq lists */
951 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
952 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
953 /* detach and destroy the discipline */
954 error = altq_remove(altq);
955 }
956 free(altq, M_PFALTQ);
957 }
958 TAILQ_INIT(V_pf_altq_ifs_inactive);
959 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
960 pf_qid_unref(altq->qid);
961 free(altq, M_PFALTQ);
962 }
963 TAILQ_INIT(V_pf_altqs_inactive);
964 V_altqs_inactive_open = 0;
965 return (error);
966 }
967
968 static int
pf_commit_altq(u_int32_t ticket)969 pf_commit_altq(u_int32_t ticket)
970 {
971 struct pf_altqqueue *old_altqs, *old_altq_ifs;
972 struct pf_altq *altq, *tmp;
973 int err, error = 0;
974
975 PF_RULES_WASSERT();
976
977 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
978 return (EBUSY);
979
980 /* swap altqs, keep the old. */
981 old_altqs = V_pf_altqs_active;
982 old_altq_ifs = V_pf_altq_ifs_active;
983 V_pf_altqs_active = V_pf_altqs_inactive;
984 V_pf_altq_ifs_active = V_pf_altq_ifs_inactive;
985 V_pf_altqs_inactive = old_altqs;
986 V_pf_altq_ifs_inactive = old_altq_ifs;
987 V_ticket_altqs_active = V_ticket_altqs_inactive;
988
989 /* Attach new disciplines */
990 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
991 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
992 /* attach the discipline */
993 error = altq_pfattach(altq);
994 if (error == 0 && V_pf_altq_running)
995 error = pf_enable_altq(altq);
996 if (error != 0)
997 return (error);
998 }
999 }
1000
1001 /* Purge the old altq lists */
1002 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
1003 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
1004 /* detach and destroy the discipline */
1005 if (V_pf_altq_running)
1006 error = pf_disable_altq(altq);
1007 err = altq_pfdetach(altq);
1008 if (err != 0 && error == 0)
1009 error = err;
1010 err = altq_remove(altq);
1011 if (err != 0 && error == 0)
1012 error = err;
1013 }
1014 free(altq, M_PFALTQ);
1015 }
1016 TAILQ_INIT(V_pf_altq_ifs_inactive);
1017 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
1018 pf_qid_unref(altq->qid);
1019 free(altq, M_PFALTQ);
1020 }
1021 TAILQ_INIT(V_pf_altqs_inactive);
1022
1023 V_altqs_inactive_open = 0;
1024 return (error);
1025 }
1026
1027 static int
pf_enable_altq(struct pf_altq * altq)1028 pf_enable_altq(struct pf_altq *altq)
1029 {
1030 struct ifnet *ifp;
1031 struct tb_profile tb;
1032 int error = 0;
1033
1034 if ((ifp = ifunit(altq->ifname)) == NULL)
1035 return (EINVAL);
1036
1037 if (ifp->if_snd.altq_type != ALTQT_NONE)
1038 error = altq_enable(&ifp->if_snd);
1039
1040 /* set tokenbucket regulator */
1041 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
1042 tb.rate = altq->ifbandwidth;
1043 tb.depth = altq->tbrsize;
1044 error = tbr_set(&ifp->if_snd, &tb);
1045 }
1046
1047 return (error);
1048 }
1049
1050 static int
pf_disable_altq(struct pf_altq * altq)1051 pf_disable_altq(struct pf_altq *altq)
1052 {
1053 struct ifnet *ifp;
1054 struct tb_profile tb;
1055 int error;
1056
1057 if ((ifp = ifunit(altq->ifname)) == NULL)
1058 return (EINVAL);
1059
1060 /*
1061 * when the discipline is no longer referenced, it was overridden
1062 * by a new one. if so, just return.
1063 */
1064 if (altq->altq_disc != ifp->if_snd.altq_disc)
1065 return (0);
1066
1067 error = altq_disable(&ifp->if_snd);
1068
1069 if (error == 0) {
1070 /* clear tokenbucket regulator */
1071 tb.rate = 0;
1072 error = tbr_set(&ifp->if_snd, &tb);
1073 }
1074
1075 return (error);
1076 }
1077
1078 static int
pf_altq_ifnet_event_add(struct ifnet * ifp,int remove,u_int32_t ticket,struct pf_altq * altq)1079 pf_altq_ifnet_event_add(struct ifnet *ifp, int remove, u_int32_t ticket,
1080 struct pf_altq *altq)
1081 {
1082 struct ifnet *ifp1;
1083 int error = 0;
1084
1085 /* Deactivate the interface in question */
1086 altq->local_flags &= ~PFALTQ_FLAG_IF_REMOVED;
1087 if ((ifp1 = ifunit(altq->ifname)) == NULL ||
1088 (remove && ifp1 == ifp)) {
1089 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
1090 } else {
1091 error = altq_add(ifp1, altq);
1092
1093 if (ticket != V_ticket_altqs_inactive)
1094 error = EBUSY;
1095
1096 if (error)
1097 free(altq, M_PFALTQ);
1098 }
1099
1100 return (error);
1101 }
1102
1103 void
pf_altq_ifnet_event(struct ifnet * ifp,int remove)1104 pf_altq_ifnet_event(struct ifnet *ifp, int remove)
1105 {
1106 struct pf_altq *a1, *a2, *a3;
1107 u_int32_t ticket;
1108 int error = 0;
1109
1110 /*
1111 * No need to re-evaluate the configuration for events on interfaces
1112 * that do not support ALTQ, as it's not possible for such
1113 * interfaces to be part of the configuration.
1114 */
1115 if (!ALTQ_IS_READY(&ifp->if_snd))
1116 return;
1117
1118 /* Interrupt userland queue modifications */
1119 if (V_altqs_inactive_open)
1120 pf_rollback_altq(V_ticket_altqs_inactive);
1121
1122 /* Start new altq ruleset */
1123 if (pf_begin_altq(&ticket))
1124 return;
1125
1126 /* Copy the current active set */
1127 TAILQ_FOREACH(a1, V_pf_altq_ifs_active, entries) {
1128 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
1129 if (a2 == NULL) {
1130 error = ENOMEM;
1131 break;
1132 }
1133 bcopy(a1, a2, sizeof(struct pf_altq));
1134
1135 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
1136 if (error)
1137 break;
1138
1139 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, a2, entries);
1140 }
1141 if (error)
1142 goto out;
1143 TAILQ_FOREACH(a1, V_pf_altqs_active, entries) {
1144 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
1145 if (a2 == NULL) {
1146 error = ENOMEM;
1147 break;
1148 }
1149 bcopy(a1, a2, sizeof(struct pf_altq));
1150
1151 if ((a2->qid = pf_qname2qid(a2->qname)) == 0) {
1152 error = EBUSY;
1153 free(a2, M_PFALTQ);
1154 break;
1155 }
1156 a2->altq_disc = NULL;
1157 TAILQ_FOREACH(a3, V_pf_altq_ifs_inactive, entries) {
1158 if (strncmp(a3->ifname, a2->ifname,
1159 IFNAMSIZ) == 0) {
1160 a2->altq_disc = a3->altq_disc;
1161 break;
1162 }
1163 }
1164 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
1165 if (error)
1166 break;
1167
1168 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries);
1169 }
1170
1171 out:
1172 if (error != 0)
1173 pf_rollback_altq(ticket);
1174 else
1175 pf_commit_altq(ticket);
1176 }
1177 #endif /* ALTQ */
1178
1179 static struct pf_krule_global *
pf_rule_tree_alloc(int flags)1180 pf_rule_tree_alloc(int flags)
1181 {
1182 struct pf_krule_global *tree;
1183
1184 tree = malloc(sizeof(struct pf_krule_global), M_TEMP, flags);
1185 if (tree == NULL)
1186 return (NULL);
1187 RB_INIT(tree);
1188 return (tree);
1189 }
1190
1191 static void
pf_rule_tree_free(struct pf_krule_global * tree)1192 pf_rule_tree_free(struct pf_krule_global *tree)
1193 {
1194
1195 free(tree, M_TEMP);
1196 }
1197
1198 static int
pf_begin_rules(u_int32_t * ticket,int rs_num,const char * anchor)1199 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
1200 {
1201 struct pf_krule_global *tree;
1202 struct pf_kruleset *rs;
1203 struct pf_krule *rule;
1204
1205 PF_RULES_WASSERT();
1206
1207 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1208 return (EINVAL);
1209 tree = pf_rule_tree_alloc(M_NOWAIT);
1210 if (tree == NULL)
1211 return (ENOMEM);
1212 rs = pf_find_or_create_kruleset(anchor);
1213 if (rs == NULL) {
1214 free(tree, M_TEMP);
1215 return (EINVAL);
1216 }
1217 pf_rule_tree_free(rs->rules[rs_num].inactive.tree);
1218 rs->rules[rs_num].inactive.tree = tree;
1219
1220 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1221 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1222 rs->rules[rs_num].inactive.rcount--;
1223 }
1224 *ticket = ++rs->rules[rs_num].inactive.ticket;
1225 rs->rules[rs_num].inactive.open = 1;
1226 return (0);
1227 }
1228
1229 static int
pf_rollback_rules(u_int32_t ticket,int rs_num,char * anchor)1230 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
1231 {
1232 struct pf_kruleset *rs;
1233 struct pf_krule *rule;
1234
1235 PF_RULES_WASSERT();
1236
1237 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1238 return (EINVAL);
1239 rs = pf_find_kruleset(anchor);
1240 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1241 rs->rules[rs_num].inactive.ticket != ticket)
1242 return (0);
1243 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1244 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1245 rs->rules[rs_num].inactive.rcount--;
1246 }
1247 rs->rules[rs_num].inactive.open = 0;
1248 return (0);
1249 }
1250
1251 #define PF_MD5_UPD(st, elm) \
1252 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
1253
1254 #define PF_MD5_UPD_STR(st, elm) \
1255 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
1256
1257 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
1258 (stor) = htonl((st)->elm); \
1259 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
1260 } while (0)
1261
1262 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
1263 (stor) = htons((st)->elm); \
1264 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
1265 } while (0)
1266
1267 static void
pf_hash_rule_addr(MD5_CTX * ctx,struct pf_rule_addr * pfr)1268 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
1269 {
1270 PF_MD5_UPD(pfr, addr.type);
1271 switch (pfr->addr.type) {
1272 case PF_ADDR_DYNIFTL:
1273 PF_MD5_UPD(pfr, addr.v.ifname);
1274 PF_MD5_UPD(pfr, addr.iflags);
1275 break;
1276 case PF_ADDR_TABLE:
1277 PF_MD5_UPD(pfr, addr.v.tblname);
1278 break;
1279 case PF_ADDR_ADDRMASK:
1280 /* XXX ignore af? */
1281 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
1282 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
1283 break;
1284 }
1285
1286 PF_MD5_UPD(pfr, port[0]);
1287 PF_MD5_UPD(pfr, port[1]);
1288 PF_MD5_UPD(pfr, neg);
1289 PF_MD5_UPD(pfr, port_op);
1290 }
1291
1292 static void
pf_hash_rule_rolling(MD5_CTX * ctx,struct pf_krule * rule)1293 pf_hash_rule_rolling(MD5_CTX *ctx, struct pf_krule *rule)
1294 {
1295 u_int16_t x;
1296 u_int32_t y;
1297
1298 pf_hash_rule_addr(ctx, &rule->src);
1299 pf_hash_rule_addr(ctx, &rule->dst);
1300 for (int i = 0; i < PF_RULE_MAX_LABEL_COUNT; i++)
1301 PF_MD5_UPD_STR(rule, label[i]);
1302 PF_MD5_UPD_STR(rule, ifname);
1303 PF_MD5_UPD_STR(rule, rcv_ifname);
1304 PF_MD5_UPD_STR(rule, match_tagname);
1305 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
1306 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
1307 PF_MD5_UPD_HTONL(rule, prob, y);
1308 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
1309 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
1310 PF_MD5_UPD(rule, uid.op);
1311 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
1312 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
1313 PF_MD5_UPD(rule, gid.op);
1314 PF_MD5_UPD_HTONL(rule, rule_flag, y);
1315 PF_MD5_UPD(rule, action);
1316 PF_MD5_UPD(rule, direction);
1317 PF_MD5_UPD(rule, af);
1318 PF_MD5_UPD(rule, quick);
1319 PF_MD5_UPD(rule, ifnot);
1320 PF_MD5_UPD(rule, rcvifnot);
1321 PF_MD5_UPD(rule, match_tag_not);
1322 PF_MD5_UPD(rule, natpass);
1323 PF_MD5_UPD(rule, keep_state);
1324 PF_MD5_UPD(rule, proto);
1325 PF_MD5_UPD(rule, type);
1326 PF_MD5_UPD(rule, code);
1327 PF_MD5_UPD(rule, flags);
1328 PF_MD5_UPD(rule, flagset);
1329 PF_MD5_UPD(rule, allow_opts);
1330 PF_MD5_UPD(rule, rt);
1331 PF_MD5_UPD(rule, tos);
1332 PF_MD5_UPD(rule, scrub_flags);
1333 PF_MD5_UPD(rule, min_ttl);
1334 PF_MD5_UPD(rule, set_tos);
1335 if (rule->anchor != NULL)
1336 PF_MD5_UPD_STR(rule, anchor->path);
1337 }
1338
1339 static void
pf_hash_rule(struct pf_krule * rule)1340 pf_hash_rule(struct pf_krule *rule)
1341 {
1342 MD5_CTX ctx;
1343
1344 MD5Init(&ctx);
1345 pf_hash_rule_rolling(&ctx, rule);
1346 MD5Final(rule->md5sum, &ctx);
1347 }
1348
1349 static int
pf_krule_compare(struct pf_krule * a,struct pf_krule * b)1350 pf_krule_compare(struct pf_krule *a, struct pf_krule *b)
1351 {
1352
1353 return (memcmp(a->md5sum, b->md5sum, PF_MD5_DIGEST_LENGTH));
1354 }
1355
1356 static int
pf_commit_rules(u_int32_t ticket,int rs_num,char * anchor)1357 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
1358 {
1359 struct pf_kruleset *rs;
1360 struct pf_krule *rule, **old_array, *old_rule;
1361 struct pf_krulequeue *old_rules;
1362 struct pf_krule_global *old_tree;
1363 int error;
1364 u_int32_t old_rcount;
1365
1366 PF_RULES_WASSERT();
1367
1368 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1369 return (EINVAL);
1370 rs = pf_find_kruleset(anchor);
1371 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1372 ticket != rs->rules[rs_num].inactive.ticket)
1373 return (EBUSY);
1374
1375 /* Calculate checksum for the main ruleset */
1376 if (rs == &pf_main_ruleset) {
1377 error = pf_setup_pfsync_matching(rs);
1378 if (error != 0)
1379 return (error);
1380 }
1381
1382 /* Swap rules, keep the old. */
1383 old_rules = rs->rules[rs_num].active.ptr;
1384 old_rcount = rs->rules[rs_num].active.rcount;
1385 old_array = rs->rules[rs_num].active.ptr_array;
1386 old_tree = rs->rules[rs_num].active.tree;
1387
1388 rs->rules[rs_num].active.ptr =
1389 rs->rules[rs_num].inactive.ptr;
1390 rs->rules[rs_num].active.ptr_array =
1391 rs->rules[rs_num].inactive.ptr_array;
1392 rs->rules[rs_num].active.tree =
1393 rs->rules[rs_num].inactive.tree;
1394 rs->rules[rs_num].active.rcount =
1395 rs->rules[rs_num].inactive.rcount;
1396
1397 /* Attempt to preserve counter information. */
1398 if (V_pf_status.keep_counters && old_tree != NULL) {
1399 TAILQ_FOREACH(rule, rs->rules[rs_num].active.ptr,
1400 entries) {
1401 old_rule = RB_FIND(pf_krule_global, old_tree, rule);
1402 if (old_rule == NULL) {
1403 continue;
1404 }
1405 pf_counter_u64_critical_enter();
1406 pf_counter_u64_rollup_protected(&rule->evaluations,
1407 pf_counter_u64_fetch(&old_rule->evaluations));
1408 pf_counter_u64_rollup_protected(&rule->packets[0],
1409 pf_counter_u64_fetch(&old_rule->packets[0]));
1410 pf_counter_u64_rollup_protected(&rule->packets[1],
1411 pf_counter_u64_fetch(&old_rule->packets[1]));
1412 pf_counter_u64_rollup_protected(&rule->bytes[0],
1413 pf_counter_u64_fetch(&old_rule->bytes[0]));
1414 pf_counter_u64_rollup_protected(&rule->bytes[1],
1415 pf_counter_u64_fetch(&old_rule->bytes[1]));
1416 pf_counter_u64_critical_exit();
1417 }
1418 }
1419
1420 rs->rules[rs_num].inactive.ptr = old_rules;
1421 rs->rules[rs_num].inactive.ptr_array = old_array;
1422 rs->rules[rs_num].inactive.tree = NULL; /* important for pf_ioctl_addrule */
1423 rs->rules[rs_num].inactive.rcount = old_rcount;
1424
1425 rs->rules[rs_num].active.ticket =
1426 rs->rules[rs_num].inactive.ticket;
1427 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1428
1429 /* Purge the old rule list. */
1430 PF_UNLNKDRULES_LOCK();
1431 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
1432 pf_unlink_rule_locked(old_rules, rule);
1433 PF_UNLNKDRULES_UNLOCK();
1434 if (rs->rules[rs_num].inactive.ptr_array)
1435 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1436 rs->rules[rs_num].inactive.ptr_array = NULL;
1437 rs->rules[rs_num].inactive.rcount = 0;
1438 rs->rules[rs_num].inactive.open = 0;
1439 pf_remove_if_empty_kruleset(rs);
1440 free(old_tree, M_TEMP);
1441
1442 return (0);
1443 }
1444
1445 static int
pf_setup_pfsync_matching(struct pf_kruleset * rs)1446 pf_setup_pfsync_matching(struct pf_kruleset *rs)
1447 {
1448 MD5_CTX ctx;
1449 struct pf_krule *rule;
1450 int rs_cnt;
1451 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
1452
1453 MD5Init(&ctx);
1454 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
1455 /* XXX PF_RULESET_SCRUB as well? */
1456 if (rs_cnt == PF_RULESET_SCRUB)
1457 continue;
1458
1459 if (rs->rules[rs_cnt].inactive.ptr_array)
1460 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1461 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1462
1463 if (rs->rules[rs_cnt].inactive.rcount) {
1464 rs->rules[rs_cnt].inactive.ptr_array =
1465 mallocarray(rs->rules[rs_cnt].inactive.rcount,
1466 sizeof(struct pf_rule **),
1467 M_TEMP, M_NOWAIT);
1468
1469 if (!rs->rules[rs_cnt].inactive.ptr_array)
1470 return (ENOMEM);
1471 }
1472
1473 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1474 entries) {
1475 pf_hash_rule_rolling(&ctx, rule);
1476 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
1477 }
1478 }
1479
1480 MD5Final(digest, &ctx);
1481 memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum));
1482 return (0);
1483 }
1484
1485 static int
pf_eth_addr_setup(struct pf_keth_ruleset * ruleset,struct pf_addr_wrap * addr)1486 pf_eth_addr_setup(struct pf_keth_ruleset *ruleset, struct pf_addr_wrap *addr)
1487 {
1488 int error = 0;
1489
1490 switch (addr->type) {
1491 case PF_ADDR_TABLE:
1492 addr->p.tbl = pfr_eth_attach_table(ruleset, addr->v.tblname);
1493 if (addr->p.tbl == NULL)
1494 error = ENOMEM;
1495 break;
1496 default:
1497 error = EINVAL;
1498 }
1499
1500 return (error);
1501 }
1502
1503 static int
pf_addr_setup(struct pf_kruleset * ruleset,struct pf_addr_wrap * addr,sa_family_t af)1504 pf_addr_setup(struct pf_kruleset *ruleset, struct pf_addr_wrap *addr,
1505 sa_family_t af)
1506 {
1507 int error = 0;
1508
1509 switch (addr->type) {
1510 case PF_ADDR_TABLE:
1511 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname);
1512 if (addr->p.tbl == NULL)
1513 error = ENOMEM;
1514 break;
1515 case PF_ADDR_DYNIFTL:
1516 error = pfi_dynaddr_setup(addr, af);
1517 break;
1518 }
1519
1520 return (error);
1521 }
1522
1523 void
pf_addr_copyout(struct pf_addr_wrap * addr)1524 pf_addr_copyout(struct pf_addr_wrap *addr)
1525 {
1526
1527 switch (addr->type) {
1528 case PF_ADDR_DYNIFTL:
1529 pfi_dynaddr_copyout(addr);
1530 break;
1531 case PF_ADDR_TABLE:
1532 pf_tbladdr_copyout(addr);
1533 break;
1534 }
1535 }
1536
1537 static void
pf_src_node_copy(const struct pf_ksrc_node * in,struct pf_src_node * out)1538 pf_src_node_copy(const struct pf_ksrc_node *in, struct pf_src_node *out)
1539 {
1540 int secs = time_uptime, diff;
1541
1542 bzero(out, sizeof(struct pf_src_node));
1543
1544 bcopy(&in->addr, &out->addr, sizeof(struct pf_addr));
1545 bcopy(&in->raddr, &out->raddr, sizeof(struct pf_addr));
1546
1547 if (in->rule != NULL)
1548 out->rule.nr = in->rule->nr;
1549
1550 for (int i = 0; i < 2; i++) {
1551 out->bytes[i] = counter_u64_fetch(in->bytes[i]);
1552 out->packets[i] = counter_u64_fetch(in->packets[i]);
1553 }
1554
1555 out->states = in->states;
1556 out->conn = in->conn;
1557 out->af = in->af;
1558 out->ruletype = in->ruletype;
1559
1560 out->creation = secs - in->creation;
1561 if (out->expire > secs)
1562 out->expire -= secs;
1563 else
1564 out->expire = 0;
1565
1566 /* Adjust the connection rate estimate. */
1567 out->conn_rate = in->conn_rate;
1568 diff = secs - in->conn_rate.last;
1569 if (diff >= in->conn_rate.seconds)
1570 out->conn_rate.count = 0;
1571 else
1572 out->conn_rate.count -=
1573 in->conn_rate.count * diff /
1574 in->conn_rate.seconds;
1575 }
1576
1577 #ifdef ALTQ
1578 /*
1579 * Handle export of struct pf_kaltq to user binaries that may be using any
1580 * version of struct pf_altq.
1581 */
1582 static int
pf_export_kaltq(struct pf_altq * q,struct pfioc_altq_v1 * pa,size_t ioc_size)1583 pf_export_kaltq(struct pf_altq *q, struct pfioc_altq_v1 *pa, size_t ioc_size)
1584 {
1585 u_int32_t version;
1586
1587 if (ioc_size == sizeof(struct pfioc_altq_v0))
1588 version = 0;
1589 else
1590 version = pa->version;
1591
1592 if (version > PFIOC_ALTQ_VERSION)
1593 return (EINVAL);
1594
1595 #define ASSIGN(x) exported_q->x = q->x
1596 #define COPY(x) \
1597 bcopy(&q->x, &exported_q->x, min(sizeof(q->x), sizeof(exported_q->x)))
1598 #define SATU16(x) (u_int32_t)uqmin((x), USHRT_MAX)
1599 #define SATU32(x) (u_int32_t)uqmin((x), UINT_MAX)
1600
1601 switch (version) {
1602 case 0: {
1603 struct pf_altq_v0 *exported_q =
1604 &((struct pfioc_altq_v0 *)pa)->altq;
1605
1606 COPY(ifname);
1607
1608 ASSIGN(scheduler);
1609 ASSIGN(tbrsize);
1610 exported_q->tbrsize = SATU16(q->tbrsize);
1611 exported_q->ifbandwidth = SATU32(q->ifbandwidth);
1612
1613 COPY(qname);
1614 COPY(parent);
1615 ASSIGN(parent_qid);
1616 exported_q->bandwidth = SATU32(q->bandwidth);
1617 ASSIGN(priority);
1618 ASSIGN(local_flags);
1619
1620 ASSIGN(qlimit);
1621 ASSIGN(flags);
1622
1623 if (q->scheduler == ALTQT_HFSC) {
1624 #define ASSIGN_OPT(x) exported_q->pq_u.hfsc_opts.x = q->pq_u.hfsc_opts.x
1625 #define ASSIGN_OPT_SATU32(x) exported_q->pq_u.hfsc_opts.x = \
1626 SATU32(q->pq_u.hfsc_opts.x)
1627
1628 ASSIGN_OPT_SATU32(rtsc_m1);
1629 ASSIGN_OPT(rtsc_d);
1630 ASSIGN_OPT_SATU32(rtsc_m2);
1631
1632 ASSIGN_OPT_SATU32(lssc_m1);
1633 ASSIGN_OPT(lssc_d);
1634 ASSIGN_OPT_SATU32(lssc_m2);
1635
1636 ASSIGN_OPT_SATU32(ulsc_m1);
1637 ASSIGN_OPT(ulsc_d);
1638 ASSIGN_OPT_SATU32(ulsc_m2);
1639
1640 ASSIGN_OPT(flags);
1641
1642 #undef ASSIGN_OPT
1643 #undef ASSIGN_OPT_SATU32
1644 } else
1645 COPY(pq_u);
1646
1647 ASSIGN(qid);
1648 break;
1649 }
1650 case 1: {
1651 struct pf_altq_v1 *exported_q =
1652 &((struct pfioc_altq_v1 *)pa)->altq;
1653
1654 COPY(ifname);
1655
1656 ASSIGN(scheduler);
1657 ASSIGN(tbrsize);
1658 ASSIGN(ifbandwidth);
1659
1660 COPY(qname);
1661 COPY(parent);
1662 ASSIGN(parent_qid);
1663 ASSIGN(bandwidth);
1664 ASSIGN(priority);
1665 ASSIGN(local_flags);
1666
1667 ASSIGN(qlimit);
1668 ASSIGN(flags);
1669 COPY(pq_u);
1670
1671 ASSIGN(qid);
1672 break;
1673 }
1674 default:
1675 panic("%s: unhandled struct pfioc_altq version", __func__);
1676 break;
1677 }
1678
1679 #undef ASSIGN
1680 #undef COPY
1681 #undef SATU16
1682 #undef SATU32
1683
1684 return (0);
1685 }
1686
1687 /*
1688 * Handle import to struct pf_kaltq of struct pf_altq from user binaries
1689 * that may be using any version of it.
1690 */
1691 static int
pf_import_kaltq(struct pfioc_altq_v1 * pa,struct pf_altq * q,size_t ioc_size)1692 pf_import_kaltq(struct pfioc_altq_v1 *pa, struct pf_altq *q, size_t ioc_size)
1693 {
1694 u_int32_t version;
1695
1696 if (ioc_size == sizeof(struct pfioc_altq_v0))
1697 version = 0;
1698 else
1699 version = pa->version;
1700
1701 if (version > PFIOC_ALTQ_VERSION)
1702 return (EINVAL);
1703
1704 #define ASSIGN(x) q->x = imported_q->x
1705 #define COPY(x) \
1706 bcopy(&imported_q->x, &q->x, min(sizeof(imported_q->x), sizeof(q->x)))
1707
1708 switch (version) {
1709 case 0: {
1710 struct pf_altq_v0 *imported_q =
1711 &((struct pfioc_altq_v0 *)pa)->altq;
1712
1713 COPY(ifname);
1714
1715 ASSIGN(scheduler);
1716 ASSIGN(tbrsize); /* 16-bit -> 32-bit */
1717 ASSIGN(ifbandwidth); /* 32-bit -> 64-bit */
1718
1719 COPY(qname);
1720 COPY(parent);
1721 ASSIGN(parent_qid);
1722 ASSIGN(bandwidth); /* 32-bit -> 64-bit */
1723 ASSIGN(priority);
1724 ASSIGN(local_flags);
1725
1726 ASSIGN(qlimit);
1727 ASSIGN(flags);
1728
1729 if (imported_q->scheduler == ALTQT_HFSC) {
1730 #define ASSIGN_OPT(x) q->pq_u.hfsc_opts.x = imported_q->pq_u.hfsc_opts.x
1731
1732 /*
1733 * The m1 and m2 parameters are being copied from
1734 * 32-bit to 64-bit.
1735 */
1736 ASSIGN_OPT(rtsc_m1);
1737 ASSIGN_OPT(rtsc_d);
1738 ASSIGN_OPT(rtsc_m2);
1739
1740 ASSIGN_OPT(lssc_m1);
1741 ASSIGN_OPT(lssc_d);
1742 ASSIGN_OPT(lssc_m2);
1743
1744 ASSIGN_OPT(ulsc_m1);
1745 ASSIGN_OPT(ulsc_d);
1746 ASSIGN_OPT(ulsc_m2);
1747
1748 ASSIGN_OPT(flags);
1749
1750 #undef ASSIGN_OPT
1751 } else
1752 COPY(pq_u);
1753
1754 ASSIGN(qid);
1755 break;
1756 }
1757 case 1: {
1758 struct pf_altq_v1 *imported_q =
1759 &((struct pfioc_altq_v1 *)pa)->altq;
1760
1761 COPY(ifname);
1762
1763 ASSIGN(scheduler);
1764 ASSIGN(tbrsize);
1765 ASSIGN(ifbandwidth);
1766
1767 COPY(qname);
1768 COPY(parent);
1769 ASSIGN(parent_qid);
1770 ASSIGN(bandwidth);
1771 ASSIGN(priority);
1772 ASSIGN(local_flags);
1773
1774 ASSIGN(qlimit);
1775 ASSIGN(flags);
1776 COPY(pq_u);
1777
1778 ASSIGN(qid);
1779 break;
1780 }
1781 default:
1782 panic("%s: unhandled struct pfioc_altq version", __func__);
1783 break;
1784 }
1785
1786 #undef ASSIGN
1787 #undef COPY
1788
1789 return (0);
1790 }
1791
1792 static struct pf_altq *
pf_altq_get_nth_active(u_int32_t n)1793 pf_altq_get_nth_active(u_int32_t n)
1794 {
1795 struct pf_altq *altq;
1796 u_int32_t nr;
1797
1798 nr = 0;
1799 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
1800 if (nr == n)
1801 return (altq);
1802 nr++;
1803 }
1804
1805 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
1806 if (nr == n)
1807 return (altq);
1808 nr++;
1809 }
1810
1811 return (NULL);
1812 }
1813 #endif /* ALTQ */
1814
1815 struct pf_krule *
pf_krule_alloc(void)1816 pf_krule_alloc(void)
1817 {
1818 struct pf_krule *rule;
1819
1820 rule = malloc(sizeof(struct pf_krule), M_PFRULE, M_WAITOK | M_ZERO);
1821 mtx_init(&rule->nat.mtx, "pf_krule_nat_pool", NULL, MTX_DEF);
1822 mtx_init(&rule->rdr.mtx, "pf_krule_rdr_pool", NULL, MTX_DEF);
1823 mtx_init(&rule->route.mtx, "pf_krule_route_pool", NULL, MTX_DEF);
1824 rule->timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
1825 M_WAITOK | M_ZERO);
1826 return (rule);
1827 }
1828
1829 void
pf_krule_free(struct pf_krule * rule)1830 pf_krule_free(struct pf_krule *rule)
1831 {
1832 #ifdef PF_WANT_32_TO_64_COUNTER
1833 bool wowned;
1834 #endif
1835
1836 if (rule == NULL)
1837 return;
1838
1839 #ifdef PF_WANT_32_TO_64_COUNTER
1840 if (rule->allrulelinked) {
1841 wowned = PF_RULES_WOWNED();
1842 if (!wowned)
1843 PF_RULES_WLOCK();
1844 LIST_REMOVE(rule, allrulelist);
1845 V_pf_allrulecount--;
1846 if (!wowned)
1847 PF_RULES_WUNLOCK();
1848 }
1849 #endif
1850
1851 pf_counter_u64_deinit(&rule->evaluations);
1852 for (int i = 0; i < 2; i++) {
1853 pf_counter_u64_deinit(&rule->packets[i]);
1854 pf_counter_u64_deinit(&rule->bytes[i]);
1855 }
1856 counter_u64_free(rule->states_cur);
1857 counter_u64_free(rule->states_tot);
1858 for (pf_sn_types_t sn_type=0; sn_type<PF_SN_MAX; sn_type++)
1859 counter_u64_free(rule->src_nodes[sn_type]);
1860 uma_zfree_pcpu(pf_timestamp_pcpu_zone, rule->timestamp);
1861
1862 mtx_destroy(&rule->nat.mtx);
1863 mtx_destroy(&rule->rdr.mtx);
1864 mtx_destroy(&rule->route.mtx);
1865 free(rule, M_PFRULE);
1866 }
1867
1868 void
pf_krule_clear_counters(struct pf_krule * rule)1869 pf_krule_clear_counters(struct pf_krule *rule)
1870 {
1871 pf_counter_u64_zero(&rule->evaluations);
1872 for (int i = 0; i < 2; i++) {
1873 pf_counter_u64_zero(&rule->packets[i]);
1874 pf_counter_u64_zero(&rule->bytes[i]);
1875 }
1876 counter_u64_zero(rule->states_tot);
1877 }
1878
1879 static void
pf_kpooladdr_to_pooladdr(const struct pf_kpooladdr * kpool,struct pf_pooladdr * pool)1880 pf_kpooladdr_to_pooladdr(const struct pf_kpooladdr *kpool,
1881 struct pf_pooladdr *pool)
1882 {
1883
1884 bzero(pool, sizeof(*pool));
1885 bcopy(&kpool->addr, &pool->addr, sizeof(pool->addr));
1886 strlcpy(pool->ifname, kpool->ifname, sizeof(pool->ifname));
1887 }
1888
1889 static int
pf_pooladdr_to_kpooladdr(const struct pf_pooladdr * pool,struct pf_kpooladdr * kpool)1890 pf_pooladdr_to_kpooladdr(const struct pf_pooladdr *pool,
1891 struct pf_kpooladdr *kpool)
1892 {
1893 int ret;
1894
1895 bzero(kpool, sizeof(*kpool));
1896 bcopy(&pool->addr, &kpool->addr, sizeof(kpool->addr));
1897 ret = pf_user_strcpy(kpool->ifname, pool->ifname,
1898 sizeof(kpool->ifname));
1899 return (ret);
1900 }
1901
1902 static void
pf_pool_to_kpool(const struct pf_pool * pool,struct pf_kpool * kpool)1903 pf_pool_to_kpool(const struct pf_pool *pool, struct pf_kpool *kpool)
1904 {
1905 _Static_assert(sizeof(pool->key) == sizeof(kpool->key), "");
1906 _Static_assert(sizeof(pool->counter) == sizeof(kpool->counter), "");
1907
1908 bcopy(&pool->key, &kpool->key, sizeof(kpool->key));
1909 bcopy(&pool->counter, &kpool->counter, sizeof(kpool->counter));
1910
1911 kpool->tblidx = pool->tblidx;
1912 kpool->proxy_port[0] = pool->proxy_port[0];
1913 kpool->proxy_port[1] = pool->proxy_port[1];
1914 kpool->opts = pool->opts;
1915 }
1916
1917 static int
pf_rule_to_krule(const struct pf_rule * rule,struct pf_krule * krule)1918 pf_rule_to_krule(const struct pf_rule *rule, struct pf_krule *krule)
1919 {
1920 int ret;
1921
1922 #ifndef INET
1923 if (rule->af == AF_INET) {
1924 return (EAFNOSUPPORT);
1925 }
1926 #endif /* INET */
1927 #ifndef INET6
1928 if (rule->af == AF_INET6) {
1929 return (EAFNOSUPPORT);
1930 }
1931 #endif /* INET6 */
1932
1933 ret = pf_check_rule_addr(&rule->src);
1934 if (ret != 0)
1935 return (ret);
1936 ret = pf_check_rule_addr(&rule->dst);
1937 if (ret != 0)
1938 return (ret);
1939
1940 bcopy(&rule->src, &krule->src, sizeof(rule->src));
1941 bcopy(&rule->dst, &krule->dst, sizeof(rule->dst));
1942
1943 ret = pf_user_strcpy(krule->label[0], rule->label, sizeof(rule->label));
1944 if (ret != 0)
1945 return (ret);
1946 ret = pf_user_strcpy(krule->ifname, rule->ifname, sizeof(rule->ifname));
1947 if (ret != 0)
1948 return (ret);
1949 ret = pf_user_strcpy(krule->qname, rule->qname, sizeof(rule->qname));
1950 if (ret != 0)
1951 return (ret);
1952 ret = pf_user_strcpy(krule->pqname, rule->pqname, sizeof(rule->pqname));
1953 if (ret != 0)
1954 return (ret);
1955 ret = pf_user_strcpy(krule->tagname, rule->tagname,
1956 sizeof(rule->tagname));
1957 if (ret != 0)
1958 return (ret);
1959 ret = pf_user_strcpy(krule->match_tagname, rule->match_tagname,
1960 sizeof(rule->match_tagname));
1961 if (ret != 0)
1962 return (ret);
1963 ret = pf_user_strcpy(krule->overload_tblname, rule->overload_tblname,
1964 sizeof(rule->overload_tblname));
1965 if (ret != 0)
1966 return (ret);
1967
1968 pf_pool_to_kpool(&rule->rpool, &krule->rdr);
1969
1970 /* Don't allow userspace to set evaluations, packets or bytes. */
1971 /* kif, anchor, overload_tbl are not copied over. */
1972
1973 krule->os_fingerprint = rule->os_fingerprint;
1974
1975 krule->rtableid = rule->rtableid;
1976 /* pf_rule->timeout is smaller than pf_krule->timeout */
1977 bcopy(rule->timeout, krule->timeout, sizeof(rule->timeout));
1978 krule->max_states = rule->max_states;
1979 krule->max_src_nodes = rule->max_src_nodes;
1980 krule->max_src_states = rule->max_src_states;
1981 krule->max_src_conn = rule->max_src_conn;
1982 krule->max_src_conn_rate.limit = rule->max_src_conn_rate.limit;
1983 krule->max_src_conn_rate.seconds = rule->max_src_conn_rate.seconds;
1984 krule->qid = rule->qid;
1985 krule->pqid = rule->pqid;
1986 krule->nr = rule->nr;
1987 krule->prob = rule->prob;
1988 krule->cuid = rule->cuid;
1989 krule->cpid = rule->cpid;
1990
1991 krule->return_icmp = rule->return_icmp;
1992 krule->return_icmp6 = rule->return_icmp6;
1993 krule->max_mss = rule->max_mss;
1994 krule->tag = rule->tag;
1995 krule->match_tag = rule->match_tag;
1996 krule->scrub_flags = rule->scrub_flags;
1997
1998 bcopy(&rule->uid, &krule->uid, sizeof(krule->uid));
1999 bcopy(&rule->gid, &krule->gid, sizeof(krule->gid));
2000
2001 krule->rule_flag = rule->rule_flag;
2002 krule->action = rule->action;
2003 krule->direction = rule->direction;
2004 krule->log = rule->log;
2005 krule->logif = rule->logif;
2006 krule->quick = rule->quick;
2007 krule->ifnot = rule->ifnot;
2008 krule->match_tag_not = rule->match_tag_not;
2009 krule->natpass = rule->natpass;
2010
2011 krule->keep_state = rule->keep_state;
2012 krule->af = rule->af;
2013 krule->proto = rule->proto;
2014 krule->type = rule->type;
2015 krule->code = rule->code;
2016 krule->flags = rule->flags;
2017 krule->flagset = rule->flagset;
2018 krule->min_ttl = rule->min_ttl;
2019 krule->allow_opts = rule->allow_opts;
2020 krule->rt = rule->rt;
2021 krule->return_ttl = rule->return_ttl;
2022 krule->tos = rule->tos;
2023 krule->set_tos = rule->set_tos;
2024
2025 krule->flush = rule->flush;
2026 krule->prio = rule->prio;
2027 krule->set_prio[0] = rule->set_prio[0];
2028 krule->set_prio[1] = rule->set_prio[1];
2029
2030 bcopy(&rule->divert, &krule->divert, sizeof(krule->divert));
2031
2032 return (0);
2033 }
2034
2035 int
pf_ioctl_getrules(struct pfioc_rule * pr)2036 pf_ioctl_getrules(struct pfioc_rule *pr)
2037 {
2038 struct pf_kruleset *ruleset;
2039 struct pf_krule *tail;
2040 int rs_num;
2041
2042 PF_RULES_WLOCK();
2043 ruleset = pf_find_kruleset(pr->anchor);
2044 if (ruleset == NULL) {
2045 PF_RULES_WUNLOCK();
2046 return (EINVAL);
2047 }
2048 rs_num = pf_get_ruleset_number(pr->rule.action);
2049 if (rs_num >= PF_RULESET_MAX) {
2050 PF_RULES_WUNLOCK();
2051 return (EINVAL);
2052 }
2053 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
2054 pf_krulequeue);
2055 if (tail)
2056 pr->nr = tail->nr + 1;
2057 else
2058 pr->nr = 0;
2059 pr->ticket = ruleset->rules[rs_num].active.ticket;
2060 PF_RULES_WUNLOCK();
2061
2062 return (0);
2063 }
2064
2065 int
pf_ioctl_addrule(struct pf_krule * rule,uint32_t ticket,uint32_t pool_ticket,const char * anchor,const char * anchor_call,uid_t uid,pid_t pid)2066 pf_ioctl_addrule(struct pf_krule *rule, uint32_t ticket,
2067 uint32_t pool_ticket, const char *anchor, const char *anchor_call,
2068 uid_t uid, pid_t pid)
2069 {
2070 struct pf_kruleset *ruleset;
2071 struct pf_krule *tail;
2072 struct pf_kpooladdr *pa;
2073 struct pfi_kkif *kif = NULL, *rcv_kif = NULL;
2074 int rs_num;
2075 int error = 0;
2076
2077 if ((rule->return_icmp >> 8) > ICMP_MAXTYPE) {
2078 error = EINVAL;
2079 goto errout_unlocked;
2080 }
2081
2082 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
2083
2084 if (rule->ifname[0])
2085 kif = pf_kkif_create(M_WAITOK);
2086 if (rule->rcv_ifname[0])
2087 rcv_kif = pf_kkif_create(M_WAITOK);
2088 pf_counter_u64_init(&rule->evaluations, M_WAITOK);
2089 for (int i = 0; i < 2; i++) {
2090 pf_counter_u64_init(&rule->packets[i], M_WAITOK);
2091 pf_counter_u64_init(&rule->bytes[i], M_WAITOK);
2092 }
2093 rule->states_cur = counter_u64_alloc(M_WAITOK);
2094 rule->states_tot = counter_u64_alloc(M_WAITOK);
2095 for (pf_sn_types_t sn_type=0; sn_type<PF_SN_MAX; sn_type++)
2096 rule->src_nodes[sn_type] = counter_u64_alloc(M_WAITOK);
2097 rule->cuid = uid;
2098 rule->cpid = pid;
2099 TAILQ_INIT(&rule->rdr.list);
2100 TAILQ_INIT(&rule->nat.list);
2101 TAILQ_INIT(&rule->route.list);
2102
2103 PF_CONFIG_LOCK();
2104 PF_RULES_WLOCK();
2105 #ifdef PF_WANT_32_TO_64_COUNTER
2106 LIST_INSERT_HEAD(&V_pf_allrulelist, rule, allrulelist);
2107 MPASS(!rule->allrulelinked);
2108 rule->allrulelinked = true;
2109 V_pf_allrulecount++;
2110 #endif
2111 ruleset = pf_find_kruleset(anchor);
2112 if (ruleset == NULL)
2113 ERROUT(EINVAL);
2114 rs_num = pf_get_ruleset_number(rule->action);
2115 if (rs_num >= PF_RULESET_MAX)
2116 ERROUT(EINVAL);
2117 if (ticket != ruleset->rules[rs_num].inactive.ticket) {
2118 DPFPRINTF(PF_DEBUG_MISC,
2119 ("ticket: %d != [%d]%d\n", ticket, rs_num,
2120 ruleset->rules[rs_num].inactive.ticket));
2121 ERROUT(EBUSY);
2122 }
2123 if (pool_ticket != V_ticket_pabuf) {
2124 DPFPRINTF(PF_DEBUG_MISC,
2125 ("pool_ticket: %d != %d\n", pool_ticket,
2126 V_ticket_pabuf));
2127 ERROUT(EBUSY);
2128 }
2129 /*
2130 * XXXMJG hack: there is no mechanism to ensure they started the
2131 * transaction. Ticket checked above may happen to match by accident,
2132 * even if nobody called DIOCXBEGIN, let alone this process.
2133 * Partially work around it by checking if the RB tree got allocated,
2134 * see pf_begin_rules.
2135 */
2136 if (ruleset->rules[rs_num].inactive.tree == NULL) {
2137 ERROUT(EINVAL);
2138 }
2139
2140 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
2141 pf_krulequeue);
2142 if (tail)
2143 rule->nr = tail->nr + 1;
2144 else
2145 rule->nr = 0;
2146 if (rule->ifname[0]) {
2147 rule->kif = pfi_kkif_attach(kif, rule->ifname);
2148 kif = NULL;
2149 pfi_kkif_ref(rule->kif);
2150 } else
2151 rule->kif = NULL;
2152
2153 if (rule->rcv_ifname[0]) {
2154 rule->rcv_kif = pfi_kkif_attach(rcv_kif, rule->rcv_ifname);
2155 rcv_kif = NULL;
2156 pfi_kkif_ref(rule->rcv_kif);
2157 } else
2158 rule->rcv_kif = NULL;
2159
2160 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs)
2161 error = EBUSY;
2162
2163 #ifdef ALTQ
2164 /* set queue IDs */
2165 if (rule->qname[0] != 0) {
2166 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
2167 error = EBUSY;
2168 else if (rule->pqname[0] != 0) {
2169 if ((rule->pqid =
2170 pf_qname2qid(rule->pqname)) == 0)
2171 error = EBUSY;
2172 } else
2173 rule->pqid = rule->qid;
2174 }
2175 #endif
2176 if (rule->tagname[0])
2177 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
2178 error = EBUSY;
2179 if (rule->match_tagname[0])
2180 if ((rule->match_tag =
2181 pf_tagname2tag(rule->match_tagname)) == 0)
2182 error = EBUSY;
2183 if (rule->rt && !rule->direction)
2184 error = EINVAL;
2185 if (!rule->log)
2186 rule->logif = 0;
2187 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
2188 error = ENOMEM;
2189 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
2190 error = ENOMEM;
2191 if (pf_kanchor_setup(rule, ruleset, anchor_call))
2192 error = EINVAL;
2193 if (rule->scrub_flags & PFSTATE_SETPRIO &&
2194 (rule->set_prio[0] > PF_PRIO_MAX ||
2195 rule->set_prio[1] > PF_PRIO_MAX))
2196 error = EINVAL;
2197 for (int i = 0; i < 3; i++) {
2198 TAILQ_FOREACH(pa, &V_pf_pabuf[i], entries)
2199 if (pa->addr.type == PF_ADDR_TABLE) {
2200 pa->addr.p.tbl = pfr_attach_table(ruleset,
2201 pa->addr.v.tblname);
2202 if (pa->addr.p.tbl == NULL)
2203 error = ENOMEM;
2204 }
2205 }
2206
2207 rule->overload_tbl = NULL;
2208 if (rule->overload_tblname[0]) {
2209 if ((rule->overload_tbl = pfr_attach_table(ruleset,
2210 rule->overload_tblname)) == NULL)
2211 error = EINVAL;
2212 else
2213 rule->overload_tbl->pfrkt_flags |=
2214 PFR_TFLAG_ACTIVE;
2215 }
2216
2217 pf_mv_kpool(&V_pf_pabuf[0], &rule->nat.list);
2218 pf_mv_kpool(&V_pf_pabuf[1], &rule->rdr.list);
2219 pf_mv_kpool(&V_pf_pabuf[2], &rule->route.list);
2220 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
2221 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
2222 (rule->rt > PF_NOPFROUTE)) &&
2223 (TAILQ_FIRST(&rule->rdr.list) == NULL &&
2224 TAILQ_FIRST(&rule->route.list) == NULL))
2225 error = EINVAL;
2226
2227 if (rule->action == PF_PASS && rule->rdr.opts & PF_POOL_STICKYADDR &&
2228 !rule->keep_state) {
2229 error = EINVAL;
2230 }
2231
2232 if (error) {
2233 pf_free_rule(rule);
2234 rule = NULL;
2235 ERROUT(error);
2236 }
2237
2238 rule->nat.cur = TAILQ_FIRST(&rule->nat.list);
2239 rule->rdr.cur = TAILQ_FIRST(&rule->rdr.list);
2240 rule->route.cur = TAILQ_FIRST(&rule->route.list);
2241 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
2242 rule, entries);
2243 ruleset->rules[rs_num].inactive.rcount++;
2244
2245 PF_RULES_WUNLOCK();
2246 pf_hash_rule(rule);
2247 if (RB_INSERT(pf_krule_global, ruleset->rules[rs_num].inactive.tree, rule) != NULL) {
2248 PF_RULES_WLOCK();
2249 TAILQ_REMOVE(ruleset->rules[rs_num].inactive.ptr, rule, entries);
2250 ruleset->rules[rs_num].inactive.rcount--;
2251 pf_free_rule(rule);
2252 rule = NULL;
2253 ERROUT(EEXIST);
2254 }
2255 PF_CONFIG_UNLOCK();
2256
2257 return (0);
2258
2259 #undef ERROUT
2260 errout:
2261 PF_RULES_WUNLOCK();
2262 PF_CONFIG_UNLOCK();
2263 errout_unlocked:
2264 pf_kkif_free(rcv_kif);
2265 pf_kkif_free(kif);
2266 pf_krule_free(rule);
2267 return (error);
2268 }
2269
2270 static bool
pf_label_match(const struct pf_krule * rule,const char * label)2271 pf_label_match(const struct pf_krule *rule, const char *label)
2272 {
2273 int i = 0;
2274
2275 while (*rule->label[i]) {
2276 if (strcmp(rule->label[i], label) == 0)
2277 return (true);
2278 i++;
2279 }
2280
2281 return (false);
2282 }
2283
2284 static unsigned int
pf_kill_matching_state(struct pf_state_key_cmp * key,int dir)2285 pf_kill_matching_state(struct pf_state_key_cmp *key, int dir)
2286 {
2287 struct pf_kstate *s;
2288 int more = 0;
2289
2290 s = pf_find_state_all(key, dir, &more);
2291 if (s == NULL)
2292 return (0);
2293
2294 if (more) {
2295 PF_STATE_UNLOCK(s);
2296 return (0);
2297 }
2298
2299 pf_remove_state(s);
2300 return (1);
2301 }
2302
2303 static int
pf_killstates_row(struct pf_kstate_kill * psk,struct pf_idhash * ih)2304 pf_killstates_row(struct pf_kstate_kill *psk, struct pf_idhash *ih)
2305 {
2306 struct pf_kstate *s;
2307 struct pf_state_key *sk;
2308 struct pf_addr *srcaddr, *dstaddr;
2309 struct pf_state_key_cmp match_key;
2310 int idx, killed = 0;
2311 unsigned int dir;
2312 u_int16_t srcport, dstport;
2313 struct pfi_kkif *kif;
2314
2315 relock_DIOCKILLSTATES:
2316 PF_HASHROW_LOCK(ih);
2317 LIST_FOREACH(s, &ih->states, entry) {
2318 /* For floating states look at the original kif. */
2319 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif;
2320
2321 sk = s->key[psk->psk_nat ? PF_SK_STACK : PF_SK_WIRE];
2322 if (s->direction == PF_OUT) {
2323 srcaddr = &sk->addr[1];
2324 dstaddr = &sk->addr[0];
2325 srcport = sk->port[1];
2326 dstport = sk->port[0];
2327 } else {
2328 srcaddr = &sk->addr[0];
2329 dstaddr = &sk->addr[1];
2330 srcport = sk->port[0];
2331 dstport = sk->port[1];
2332 }
2333
2334 if (psk->psk_af && sk->af != psk->psk_af)
2335 continue;
2336
2337 if (psk->psk_proto && psk->psk_proto != sk->proto)
2338 continue;
2339
2340 if (! PF_MATCHA(psk->psk_src.neg, &psk->psk_src.addr.v.a.addr,
2341 &psk->psk_src.addr.v.a.mask, srcaddr, sk->af))
2342 continue;
2343
2344 if (! PF_MATCHA(psk->psk_dst.neg, &psk->psk_dst.addr.v.a.addr,
2345 &psk->psk_dst.addr.v.a.mask, dstaddr, sk->af))
2346 continue;
2347
2348 if (! PF_MATCHA(psk->psk_rt_addr.neg,
2349 &psk->psk_rt_addr.addr.v.a.addr,
2350 &psk->psk_rt_addr.addr.v.a.mask,
2351 &s->act.rt_addr, sk->af))
2352 continue;
2353
2354 if (psk->psk_src.port_op != 0 &&
2355 ! pf_match_port(psk->psk_src.port_op,
2356 psk->psk_src.port[0], psk->psk_src.port[1], srcport))
2357 continue;
2358
2359 if (psk->psk_dst.port_op != 0 &&
2360 ! pf_match_port(psk->psk_dst.port_op,
2361 psk->psk_dst.port[0], psk->psk_dst.port[1], dstport))
2362 continue;
2363
2364 if (psk->psk_label[0] &&
2365 ! pf_label_match(s->rule, psk->psk_label))
2366 continue;
2367
2368 if (psk->psk_ifname[0] && strcmp(psk->psk_ifname,
2369 kif->pfik_name))
2370 continue;
2371
2372 if (psk->psk_kill_match) {
2373 /* Create the key to find matching states, with lock
2374 * held. */
2375
2376 bzero(&match_key, sizeof(match_key));
2377
2378 if (s->direction == PF_OUT) {
2379 dir = PF_IN;
2380 idx = psk->psk_nat ? PF_SK_WIRE : PF_SK_STACK;
2381 } else {
2382 dir = PF_OUT;
2383 idx = psk->psk_nat ? PF_SK_STACK : PF_SK_WIRE;
2384 }
2385
2386 match_key.af = s->key[idx]->af;
2387 match_key.proto = s->key[idx]->proto;
2388 PF_ACPY(&match_key.addr[0],
2389 &s->key[idx]->addr[1], match_key.af);
2390 match_key.port[0] = s->key[idx]->port[1];
2391 PF_ACPY(&match_key.addr[1],
2392 &s->key[idx]->addr[0], match_key.af);
2393 match_key.port[1] = s->key[idx]->port[0];
2394 }
2395
2396 pf_remove_state(s);
2397 killed++;
2398
2399 if (psk->psk_kill_match)
2400 killed += pf_kill_matching_state(&match_key, dir);
2401
2402 goto relock_DIOCKILLSTATES;
2403 }
2404 PF_HASHROW_UNLOCK(ih);
2405
2406 return (killed);
2407 }
2408
2409 void
unhandled_af(int af)2410 unhandled_af(int af)
2411 {
2412 panic("unhandled af %d", af);
2413 }
2414
2415 int
pf_start(void)2416 pf_start(void)
2417 {
2418 int error = 0;
2419
2420 sx_xlock(&V_pf_ioctl_lock);
2421 if (V_pf_status.running)
2422 error = EEXIST;
2423 else {
2424 hook_pf();
2425 if (! TAILQ_EMPTY(V_pf_keth->active.rules))
2426 hook_pf_eth();
2427 V_pf_status.running = 1;
2428 V_pf_status.since = time_second;
2429 new_unrhdr64(&V_pf_stateid, time_second);
2430
2431 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
2432 }
2433 sx_xunlock(&V_pf_ioctl_lock);
2434
2435 return (error);
2436 }
2437
2438 int
pf_stop(void)2439 pf_stop(void)
2440 {
2441 int error = 0;
2442
2443 sx_xlock(&V_pf_ioctl_lock);
2444 if (!V_pf_status.running)
2445 error = ENOENT;
2446 else {
2447 V_pf_status.running = 0;
2448 dehook_pf();
2449 dehook_pf_eth();
2450 V_pf_status.since = time_second;
2451 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
2452 }
2453 sx_xunlock(&V_pf_ioctl_lock);
2454
2455 return (error);
2456 }
2457
2458 void
pf_ioctl_clear_status(void)2459 pf_ioctl_clear_status(void)
2460 {
2461 PF_RULES_WLOCK();
2462 for (int i = 0; i < PFRES_MAX; i++)
2463 counter_u64_zero(V_pf_status.counters[i]);
2464 for (int i = 0; i < FCNT_MAX; i++)
2465 pf_counter_u64_zero(&V_pf_status.fcounters[i]);
2466 for (int i = 0; i < SCNT_MAX; i++)
2467 counter_u64_zero(V_pf_status.scounters[i]);
2468 for (int i = 0; i < KLCNT_MAX; i++)
2469 counter_u64_zero(V_pf_status.lcounters[i]);
2470 V_pf_status.since = time_second;
2471 if (*V_pf_status.ifname)
2472 pfi_update_status(V_pf_status.ifname, NULL);
2473 PF_RULES_WUNLOCK();
2474 }
2475
2476 int
pf_ioctl_set_timeout(int timeout,int seconds,int * prev_seconds)2477 pf_ioctl_set_timeout(int timeout, int seconds, int *prev_seconds)
2478 {
2479 uint32_t old;
2480
2481 if (timeout < 0 || timeout >= PFTM_MAX ||
2482 seconds < 0)
2483 return (EINVAL);
2484
2485 PF_RULES_WLOCK();
2486 old = V_pf_default_rule.timeout[timeout];
2487 if (timeout == PFTM_INTERVAL && seconds == 0)
2488 seconds = 1;
2489 V_pf_default_rule.timeout[timeout] = seconds;
2490 if (timeout == PFTM_INTERVAL && seconds < old)
2491 wakeup(pf_purge_thread);
2492
2493 if (prev_seconds != NULL)
2494 *prev_seconds = old;
2495
2496 PF_RULES_WUNLOCK();
2497
2498 return (0);
2499 }
2500
2501 int
pf_ioctl_get_timeout(int timeout,int * seconds)2502 pf_ioctl_get_timeout(int timeout, int *seconds)
2503 {
2504 PF_RULES_RLOCK_TRACKER;
2505
2506 if (timeout < 0 || timeout >= PFTM_MAX)
2507 return (EINVAL);
2508
2509 PF_RULES_RLOCK();
2510 *seconds = V_pf_default_rule.timeout[timeout];
2511 PF_RULES_RUNLOCK();
2512
2513 return (0);
2514 }
2515
2516 int
pf_ioctl_set_limit(int index,unsigned int limit,unsigned int * old_limit)2517 pf_ioctl_set_limit(int index, unsigned int limit, unsigned int *old_limit)
2518 {
2519
2520 PF_RULES_WLOCK();
2521 if (index < 0 || index >= PF_LIMIT_MAX ||
2522 V_pf_limits[index].zone == NULL) {
2523 PF_RULES_WUNLOCK();
2524 return (EINVAL);
2525 }
2526 uma_zone_set_max(V_pf_limits[index].zone, limit);
2527 if (old_limit != NULL)
2528 *old_limit = V_pf_limits[index].limit;
2529 V_pf_limits[index].limit = limit;
2530 PF_RULES_WUNLOCK();
2531
2532 return (0);
2533 }
2534
2535 int
pf_ioctl_get_limit(int index,unsigned int * limit)2536 pf_ioctl_get_limit(int index, unsigned int *limit)
2537 {
2538 PF_RULES_RLOCK_TRACKER;
2539
2540 if (index < 0 || index >= PF_LIMIT_MAX)
2541 return (EINVAL);
2542
2543 PF_RULES_RLOCK();
2544 *limit = V_pf_limits[index].limit;
2545 PF_RULES_RUNLOCK();
2546
2547 return (0);
2548 }
2549
2550 int
pf_ioctl_begin_addrs(uint32_t * ticket)2551 pf_ioctl_begin_addrs(uint32_t *ticket)
2552 {
2553 PF_RULES_WLOCK();
2554 pf_empty_kpool(&V_pf_pabuf[0]);
2555 pf_empty_kpool(&V_pf_pabuf[1]);
2556 pf_empty_kpool(&V_pf_pabuf[2]);
2557 *ticket = ++V_ticket_pabuf;
2558 PF_RULES_WUNLOCK();
2559
2560 return (0);
2561 }
2562
2563 int
pf_ioctl_add_addr(struct pf_nl_pooladdr * pp)2564 pf_ioctl_add_addr(struct pf_nl_pooladdr *pp)
2565 {
2566 struct pf_kpooladdr *pa = NULL;
2567 struct pfi_kkif *kif = NULL;
2568 int error;
2569
2570 if (pp->which != PF_RDR && pp->which != PF_NAT &&
2571 pp->which != PF_RT)
2572 return (EINVAL);
2573
2574 switch (pp->af) {
2575 #ifdef INET
2576 case AF_INET:
2577 /* FALLTHROUGH */
2578 #endif /* INET */
2579 #ifdef INET6
2580 case AF_INET6:
2581 /* FALLTHROUGH */
2582 #endif /* INET6 */
2583 case AF_UNSPEC:
2584 break;
2585 default:
2586 return (EAFNOSUPPORT);
2587 }
2588
2589 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2590 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2591 pp->addr.addr.type != PF_ADDR_TABLE)
2592 return (EINVAL);
2593
2594 if (pp->addr.addr.p.dyn != NULL)
2595 return (EINVAL);
2596
2597 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK);
2598 error = pf_pooladdr_to_kpooladdr(&pp->addr, pa);
2599 if (error != 0)
2600 goto out;
2601 if (pa->ifname[0])
2602 kif = pf_kkif_create(M_WAITOK);
2603 PF_RULES_WLOCK();
2604 if (pp->ticket != V_ticket_pabuf) {
2605 PF_RULES_WUNLOCK();
2606 if (pa->ifname[0])
2607 pf_kkif_free(kif);
2608 error = EBUSY;
2609 goto out;
2610 }
2611 if (pa->ifname[0]) {
2612 pa->kif = pfi_kkif_attach(kif, pa->ifname);
2613 kif = NULL;
2614 pfi_kkif_ref(pa->kif);
2615 } else
2616 pa->kif = NULL;
2617 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error =
2618 pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) {
2619 if (pa->ifname[0])
2620 pfi_kkif_unref(pa->kif);
2621 PF_RULES_WUNLOCK();
2622 goto out;
2623 }
2624 switch (pp->which) {
2625 case PF_NAT:
2626 TAILQ_INSERT_TAIL(&V_pf_pabuf[0], pa, entries);
2627 break;
2628 case PF_RDR:
2629 TAILQ_INSERT_TAIL(&V_pf_pabuf[1], pa, entries);
2630 break;
2631 case PF_RT:
2632 TAILQ_INSERT_TAIL(&V_pf_pabuf[2], pa, entries);
2633 break;
2634 }
2635 PF_RULES_WUNLOCK();
2636
2637 return (0);
2638
2639 out:
2640 free(pa, M_PFRULE);
2641 return (error);
2642 }
2643
2644 int
pf_ioctl_get_addrs(struct pf_nl_pooladdr * pp)2645 pf_ioctl_get_addrs(struct pf_nl_pooladdr *pp)
2646 {
2647 struct pf_kpool *pool;
2648 struct pf_kpooladdr *pa;
2649
2650 PF_RULES_RLOCK_TRACKER;
2651
2652 if (pp->which != PF_RDR && pp->which != PF_NAT &&
2653 pp->which != PF_RT)
2654 return (EINVAL);
2655
2656 pp->anchor[sizeof(pp->anchor) - 1] = 0;
2657 pp->nr = 0;
2658
2659 PF_RULES_RLOCK();
2660 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action,
2661 pp->r_num, 0, 1, 0, pp->which);
2662 if (pool == NULL) {
2663 PF_RULES_RUNLOCK();
2664 return (EBUSY);
2665 }
2666 TAILQ_FOREACH(pa, &pool->list, entries)
2667 pp->nr++;
2668 PF_RULES_RUNLOCK();
2669
2670 return (0);
2671 }
2672
2673 int
pf_ioctl_get_addr(struct pf_nl_pooladdr * pp)2674 pf_ioctl_get_addr(struct pf_nl_pooladdr *pp)
2675 {
2676 struct pf_kpool *pool;
2677 struct pf_kpooladdr *pa;
2678 u_int32_t nr = 0;
2679
2680 if (pp->which != PF_RDR && pp->which != PF_NAT &&
2681 pp->which != PF_RT)
2682 return (EINVAL);
2683
2684 PF_RULES_RLOCK_TRACKER;
2685
2686 pp->anchor[sizeof(pp->anchor) - 1] = 0;
2687
2688 PF_RULES_RLOCK();
2689 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action,
2690 pp->r_num, 0, 1, 1, pp->which);
2691 if (pool == NULL) {
2692 PF_RULES_RUNLOCK();
2693 return (EBUSY);
2694 }
2695 pa = TAILQ_FIRST(&pool->list);
2696 while ((pa != NULL) && (nr < pp->nr)) {
2697 pa = TAILQ_NEXT(pa, entries);
2698 nr++;
2699 }
2700 if (pa == NULL) {
2701 PF_RULES_RUNLOCK();
2702 return (EBUSY);
2703 }
2704 pf_kpooladdr_to_pooladdr(pa, &pp->addr);
2705 pf_addr_copyout(&pp->addr.addr);
2706 PF_RULES_RUNLOCK();
2707
2708 return (0);
2709 }
2710
2711 int
pf_ioctl_get_rulesets(struct pfioc_ruleset * pr)2712 pf_ioctl_get_rulesets(struct pfioc_ruleset *pr)
2713 {
2714 struct pf_kruleset *ruleset;
2715 struct pf_kanchor *anchor;
2716
2717 PF_RULES_RLOCK_TRACKER;
2718
2719 pr->path[sizeof(pr->path) - 1] = 0;
2720
2721 PF_RULES_RLOCK();
2722 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) {
2723 PF_RULES_RUNLOCK();
2724 return (ENOENT);
2725 }
2726 pr->nr = 0;
2727 if (ruleset->anchor == NULL) {
2728 /* XXX kludge for pf_main_ruleset */
2729 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors)
2730 if (anchor->parent == NULL)
2731 pr->nr++;
2732 } else {
2733 RB_FOREACH(anchor, pf_kanchor_node,
2734 &ruleset->anchor->children)
2735 pr->nr++;
2736 }
2737 PF_RULES_RUNLOCK();
2738
2739 return (0);
2740 }
2741
2742 int
pf_ioctl_get_ruleset(struct pfioc_ruleset * pr)2743 pf_ioctl_get_ruleset(struct pfioc_ruleset *pr)
2744 {
2745 struct pf_kruleset *ruleset;
2746 struct pf_kanchor *anchor;
2747 u_int32_t nr = 0;
2748 int error = 0;
2749
2750 PF_RULES_RLOCK_TRACKER;
2751
2752 PF_RULES_RLOCK();
2753 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) {
2754 PF_RULES_RUNLOCK();
2755 return (ENOENT);
2756 }
2757
2758 pr->name[0] = 0;
2759 if (ruleset->anchor == NULL) {
2760 /* XXX kludge for pf_main_ruleset */
2761 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors)
2762 if (anchor->parent == NULL && nr++ == pr->nr) {
2763 strlcpy(pr->name, anchor->name,
2764 sizeof(pr->name));
2765 break;
2766 }
2767 } else {
2768 RB_FOREACH(anchor, pf_kanchor_node,
2769 &ruleset->anchor->children)
2770 if (nr++ == pr->nr) {
2771 strlcpy(pr->name, anchor->name,
2772 sizeof(pr->name));
2773 break;
2774 }
2775 }
2776 if (!pr->name[0])
2777 error = EBUSY;
2778 PF_RULES_RUNLOCK();
2779
2780 return (error);
2781 }
2782
2783 static int
pfioctl(struct cdev * dev,u_long cmd,caddr_t addr,int flags,struct thread * td)2784 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td)
2785 {
2786 int error = 0;
2787 PF_RULES_RLOCK_TRACKER;
2788
2789 #define ERROUT_IOCTL(target, x) \
2790 do { \
2791 error = (x); \
2792 SDT_PROBE3(pf, ioctl, ioctl, error, cmd, error, __LINE__); \
2793 goto target; \
2794 } while (0)
2795
2796
2797 /* XXX keep in sync with switch() below */
2798 if (securelevel_gt(td->td_ucred, 2))
2799 switch (cmd) {
2800 case DIOCGETRULES:
2801 case DIOCGETRULENV:
2802 case DIOCGETADDRS:
2803 case DIOCGETADDR:
2804 case DIOCGETSTATE:
2805 case DIOCGETSTATENV:
2806 case DIOCSETSTATUSIF:
2807 case DIOCGETSTATUSNV:
2808 case DIOCCLRSTATUS:
2809 case DIOCNATLOOK:
2810 case DIOCSETDEBUG:
2811 #ifdef COMPAT_FREEBSD14
2812 case DIOCGETSTATES:
2813 case DIOCGETSTATESV2:
2814 #endif
2815 case DIOCGETTIMEOUT:
2816 case DIOCCLRRULECTRS:
2817 case DIOCGETLIMIT:
2818 case DIOCGETALTQSV0:
2819 case DIOCGETALTQSV1:
2820 case DIOCGETALTQV0:
2821 case DIOCGETALTQV1:
2822 case DIOCGETQSTATSV0:
2823 case DIOCGETQSTATSV1:
2824 case DIOCGETRULESETS:
2825 case DIOCGETRULESET:
2826 case DIOCRGETTABLES:
2827 case DIOCRGETTSTATS:
2828 case DIOCRCLRTSTATS:
2829 case DIOCRCLRADDRS:
2830 case DIOCRADDADDRS:
2831 case DIOCRDELADDRS:
2832 case DIOCRSETADDRS:
2833 case DIOCRGETADDRS:
2834 case DIOCRGETASTATS:
2835 case DIOCRCLRASTATS:
2836 case DIOCRTSTADDRS:
2837 case DIOCOSFPGET:
2838 case DIOCGETSRCNODES:
2839 case DIOCCLRSRCNODES:
2840 case DIOCGETSYNCOOKIES:
2841 case DIOCIGETIFACES:
2842 case DIOCGIFSPEEDV0:
2843 case DIOCGIFSPEEDV1:
2844 case DIOCSETIFFLAG:
2845 case DIOCCLRIFFLAG:
2846 case DIOCGETETHRULES:
2847 case DIOCGETETHRULE:
2848 case DIOCGETETHRULESETS:
2849 case DIOCGETETHRULESET:
2850 break;
2851 case DIOCRCLRTABLES:
2852 case DIOCRADDTABLES:
2853 case DIOCRDELTABLES:
2854 case DIOCRSETTFLAGS:
2855 if (((struct pfioc_table *)addr)->pfrio_flags &
2856 PFR_FLAG_DUMMY)
2857 break; /* dummy operation ok */
2858 return (EPERM);
2859 default:
2860 return (EPERM);
2861 }
2862
2863 if (!(flags & FWRITE))
2864 switch (cmd) {
2865 case DIOCGETRULES:
2866 case DIOCGETADDRS:
2867 case DIOCGETADDR:
2868 case DIOCGETSTATE:
2869 case DIOCGETSTATENV:
2870 case DIOCGETSTATUSNV:
2871 #ifdef COMPAT_FREEBSD14
2872 case DIOCGETSTATES:
2873 case DIOCGETSTATESV2:
2874 #endif
2875 case DIOCGETTIMEOUT:
2876 case DIOCGETLIMIT:
2877 case DIOCGETALTQSV0:
2878 case DIOCGETALTQSV1:
2879 case DIOCGETALTQV0:
2880 case DIOCGETALTQV1:
2881 case DIOCGETQSTATSV0:
2882 case DIOCGETQSTATSV1:
2883 case DIOCGETRULESETS:
2884 case DIOCGETRULESET:
2885 case DIOCNATLOOK:
2886 case DIOCRGETTABLES:
2887 case DIOCRGETTSTATS:
2888 case DIOCRGETADDRS:
2889 case DIOCRGETASTATS:
2890 case DIOCRTSTADDRS:
2891 case DIOCOSFPGET:
2892 case DIOCGETSRCNODES:
2893 case DIOCGETSYNCOOKIES:
2894 case DIOCIGETIFACES:
2895 case DIOCGIFSPEEDV1:
2896 case DIOCGIFSPEEDV0:
2897 case DIOCGETRULENV:
2898 case DIOCGETETHRULES:
2899 case DIOCGETETHRULE:
2900 case DIOCGETETHRULESETS:
2901 case DIOCGETETHRULESET:
2902 break;
2903 case DIOCRCLRTABLES:
2904 case DIOCRADDTABLES:
2905 case DIOCRDELTABLES:
2906 case DIOCRCLRTSTATS:
2907 case DIOCRCLRADDRS:
2908 case DIOCRADDADDRS:
2909 case DIOCRDELADDRS:
2910 case DIOCRSETADDRS:
2911 case DIOCRSETTFLAGS:
2912 if (((struct pfioc_table *)addr)->pfrio_flags &
2913 PFR_FLAG_DUMMY) {
2914 flags |= FWRITE; /* need write lock for dummy */
2915 break; /* dummy operation ok */
2916 }
2917 return (EACCES);
2918 default:
2919 return (EACCES);
2920 }
2921
2922 CURVNET_SET(TD_TO_VNET(td));
2923
2924 switch (cmd) {
2925 #ifdef COMPAT_FREEBSD14
2926 case DIOCSTART:
2927 error = pf_start();
2928 break;
2929
2930 case DIOCSTOP:
2931 error = pf_stop();
2932 break;
2933 #endif
2934
2935 case DIOCGETETHRULES: {
2936 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
2937 nvlist_t *nvl;
2938 void *packed;
2939 struct pf_keth_rule *tail;
2940 struct pf_keth_ruleset *rs;
2941 u_int32_t ticket, nr;
2942 const char *anchor = "";
2943
2944 nvl = NULL;
2945 packed = NULL;
2946
2947 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULES_error, x)
2948
2949 if (nv->len > pf_ioctl_maxcount)
2950 ERROUT(ENOMEM);
2951
2952 /* Copy the request in */
2953 packed = malloc(nv->len, M_NVLIST, M_WAITOK);
2954 error = copyin(nv->data, packed, nv->len);
2955 if (error)
2956 ERROUT(error);
2957
2958 nvl = nvlist_unpack(packed, nv->len, 0);
2959 if (nvl == NULL)
2960 ERROUT(EBADMSG);
2961
2962 if (! nvlist_exists_string(nvl, "anchor"))
2963 ERROUT(EBADMSG);
2964
2965 anchor = nvlist_get_string(nvl, "anchor");
2966
2967 rs = pf_find_keth_ruleset(anchor);
2968
2969 nvlist_destroy(nvl);
2970 nvl = NULL;
2971 free(packed, M_NVLIST);
2972 packed = NULL;
2973
2974 if (rs == NULL)
2975 ERROUT(ENOENT);
2976
2977 /* Reply */
2978 nvl = nvlist_create(0);
2979 if (nvl == NULL)
2980 ERROUT(ENOMEM);
2981
2982 PF_RULES_RLOCK();
2983
2984 ticket = rs->active.ticket;
2985 tail = TAILQ_LAST(rs->active.rules, pf_keth_ruleq);
2986 if (tail)
2987 nr = tail->nr + 1;
2988 else
2989 nr = 0;
2990
2991 PF_RULES_RUNLOCK();
2992
2993 nvlist_add_number(nvl, "ticket", ticket);
2994 nvlist_add_number(nvl, "nr", nr);
2995
2996 packed = nvlist_pack(nvl, &nv->len);
2997 if (packed == NULL)
2998 ERROUT(ENOMEM);
2999
3000 if (nv->size == 0)
3001 ERROUT(0);
3002 else if (nv->size < nv->len)
3003 ERROUT(ENOSPC);
3004
3005 error = copyout(packed, nv->data, nv->len);
3006
3007 #undef ERROUT
3008 DIOCGETETHRULES_error:
3009 free(packed, M_NVLIST);
3010 nvlist_destroy(nvl);
3011 break;
3012 }
3013
3014 case DIOCGETETHRULE: {
3015 struct epoch_tracker et;
3016 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3017 nvlist_t *nvl = NULL;
3018 void *nvlpacked = NULL;
3019 struct pf_keth_rule *rule = NULL;
3020 struct pf_keth_ruleset *rs;
3021 u_int32_t ticket, nr;
3022 bool clear = false;
3023 const char *anchor;
3024
3025 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULE_error, x)
3026
3027 if (nv->len > pf_ioctl_maxcount)
3028 ERROUT(ENOMEM);
3029
3030 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3031 error = copyin(nv->data, nvlpacked, nv->len);
3032 if (error)
3033 ERROUT(error);
3034
3035 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3036 if (nvl == NULL)
3037 ERROUT(EBADMSG);
3038 if (! nvlist_exists_number(nvl, "ticket"))
3039 ERROUT(EBADMSG);
3040 ticket = nvlist_get_number(nvl, "ticket");
3041 if (! nvlist_exists_string(nvl, "anchor"))
3042 ERROUT(EBADMSG);
3043 anchor = nvlist_get_string(nvl, "anchor");
3044
3045 if (nvlist_exists_bool(nvl, "clear"))
3046 clear = nvlist_get_bool(nvl, "clear");
3047
3048 if (clear && !(flags & FWRITE))
3049 ERROUT(EACCES);
3050
3051 if (! nvlist_exists_number(nvl, "nr"))
3052 ERROUT(EBADMSG);
3053 nr = nvlist_get_number(nvl, "nr");
3054
3055 PF_RULES_RLOCK();
3056 rs = pf_find_keth_ruleset(anchor);
3057 if (rs == NULL) {
3058 PF_RULES_RUNLOCK();
3059 ERROUT(ENOENT);
3060 }
3061 if (ticket != rs->active.ticket) {
3062 PF_RULES_RUNLOCK();
3063 ERROUT(EBUSY);
3064 }
3065
3066 nvlist_destroy(nvl);
3067 nvl = NULL;
3068 free(nvlpacked, M_NVLIST);
3069 nvlpacked = NULL;
3070
3071 rule = TAILQ_FIRST(rs->active.rules);
3072 while ((rule != NULL) && (rule->nr != nr))
3073 rule = TAILQ_NEXT(rule, entries);
3074 if (rule == NULL) {
3075 PF_RULES_RUNLOCK();
3076 ERROUT(ENOENT);
3077 }
3078 /* Make sure rule can't go away. */
3079 NET_EPOCH_ENTER(et);
3080 PF_RULES_RUNLOCK();
3081 nvl = pf_keth_rule_to_nveth_rule(rule);
3082 if (pf_keth_anchor_nvcopyout(rs, rule, nvl)) {
3083 NET_EPOCH_EXIT(et);
3084 ERROUT(EBUSY);
3085 }
3086 NET_EPOCH_EXIT(et);
3087 if (nvl == NULL)
3088 ERROUT(ENOMEM);
3089
3090 nvlpacked = nvlist_pack(nvl, &nv->len);
3091 if (nvlpacked == NULL)
3092 ERROUT(ENOMEM);
3093
3094 if (nv->size == 0)
3095 ERROUT(0);
3096 else if (nv->size < nv->len)
3097 ERROUT(ENOSPC);
3098
3099 error = copyout(nvlpacked, nv->data, nv->len);
3100 if (error == 0 && clear) {
3101 counter_u64_zero(rule->evaluations);
3102 for (int i = 0; i < 2; i++) {
3103 counter_u64_zero(rule->packets[i]);
3104 counter_u64_zero(rule->bytes[i]);
3105 }
3106 }
3107
3108 #undef ERROUT
3109 DIOCGETETHRULE_error:
3110 free(nvlpacked, M_NVLIST);
3111 nvlist_destroy(nvl);
3112 break;
3113 }
3114
3115 case DIOCADDETHRULE: {
3116 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3117 nvlist_t *nvl = NULL;
3118 void *nvlpacked = NULL;
3119 struct pf_keth_rule *rule = NULL, *tail = NULL;
3120 struct pf_keth_ruleset *ruleset = NULL;
3121 struct pfi_kkif *kif = NULL, *bridge_to_kif = NULL;
3122 const char *anchor = "", *anchor_call = "";
3123
3124 #define ERROUT(x) ERROUT_IOCTL(DIOCADDETHRULE_error, x)
3125
3126 if (nv->len > pf_ioctl_maxcount)
3127 ERROUT(ENOMEM);
3128
3129 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3130 error = copyin(nv->data, nvlpacked, nv->len);
3131 if (error)
3132 ERROUT(error);
3133
3134 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3135 if (nvl == NULL)
3136 ERROUT(EBADMSG);
3137
3138 if (! nvlist_exists_number(nvl, "ticket"))
3139 ERROUT(EBADMSG);
3140
3141 if (nvlist_exists_string(nvl, "anchor"))
3142 anchor = nvlist_get_string(nvl, "anchor");
3143 if (nvlist_exists_string(nvl, "anchor_call"))
3144 anchor_call = nvlist_get_string(nvl, "anchor_call");
3145
3146 ruleset = pf_find_keth_ruleset(anchor);
3147 if (ruleset == NULL)
3148 ERROUT(EINVAL);
3149
3150 if (nvlist_get_number(nvl, "ticket") !=
3151 ruleset->inactive.ticket) {
3152 DPFPRINTF(PF_DEBUG_MISC,
3153 ("ticket: %d != %d\n",
3154 (u_int32_t)nvlist_get_number(nvl, "ticket"),
3155 ruleset->inactive.ticket));
3156 ERROUT(EBUSY);
3157 }
3158
3159 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK);
3160 rule->timestamp = NULL;
3161
3162 error = pf_nveth_rule_to_keth_rule(nvl, rule);
3163 if (error != 0)
3164 ERROUT(error);
3165
3166 if (rule->ifname[0])
3167 kif = pf_kkif_create(M_WAITOK);
3168 if (rule->bridge_to_name[0])
3169 bridge_to_kif = pf_kkif_create(M_WAITOK);
3170 rule->evaluations = counter_u64_alloc(M_WAITOK);
3171 for (int i = 0; i < 2; i++) {
3172 rule->packets[i] = counter_u64_alloc(M_WAITOK);
3173 rule->bytes[i] = counter_u64_alloc(M_WAITOK);
3174 }
3175 rule->timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
3176 M_WAITOK | M_ZERO);
3177
3178 PF_RULES_WLOCK();
3179
3180 if (rule->ifname[0]) {
3181 rule->kif = pfi_kkif_attach(kif, rule->ifname);
3182 pfi_kkif_ref(rule->kif);
3183 } else
3184 rule->kif = NULL;
3185 if (rule->bridge_to_name[0]) {
3186 rule->bridge_to = pfi_kkif_attach(bridge_to_kif,
3187 rule->bridge_to_name);
3188 pfi_kkif_ref(rule->bridge_to);
3189 } else
3190 rule->bridge_to = NULL;
3191
3192 #ifdef ALTQ
3193 /* set queue IDs */
3194 if (rule->qname[0] != 0) {
3195 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
3196 error = EBUSY;
3197 else
3198 rule->qid = rule->qid;
3199 }
3200 #endif
3201 if (rule->tagname[0])
3202 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
3203 error = EBUSY;
3204 if (rule->match_tagname[0])
3205 if ((rule->match_tag = pf_tagname2tag(
3206 rule->match_tagname)) == 0)
3207 error = EBUSY;
3208
3209 if (error == 0 && rule->ipdst.addr.type == PF_ADDR_TABLE)
3210 error = pf_eth_addr_setup(ruleset, &rule->ipdst.addr);
3211 if (error == 0 && rule->ipsrc.addr.type == PF_ADDR_TABLE)
3212 error = pf_eth_addr_setup(ruleset, &rule->ipsrc.addr);
3213
3214 if (error) {
3215 pf_free_eth_rule(rule);
3216 PF_RULES_WUNLOCK();
3217 ERROUT(error);
3218 }
3219
3220 if (pf_keth_anchor_setup(rule, ruleset, anchor_call)) {
3221 pf_free_eth_rule(rule);
3222 PF_RULES_WUNLOCK();
3223 ERROUT(EINVAL);
3224 }
3225
3226 tail = TAILQ_LAST(ruleset->inactive.rules, pf_keth_ruleq);
3227 if (tail)
3228 rule->nr = tail->nr + 1;
3229 else
3230 rule->nr = 0;
3231
3232 TAILQ_INSERT_TAIL(ruleset->inactive.rules, rule, entries);
3233
3234 PF_RULES_WUNLOCK();
3235
3236 #undef ERROUT
3237 DIOCADDETHRULE_error:
3238 nvlist_destroy(nvl);
3239 free(nvlpacked, M_NVLIST);
3240 break;
3241 }
3242
3243 case DIOCGETETHRULESETS: {
3244 struct epoch_tracker et;
3245 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3246 nvlist_t *nvl = NULL;
3247 void *nvlpacked = NULL;
3248 struct pf_keth_ruleset *ruleset;
3249 struct pf_keth_anchor *anchor;
3250 int nr = 0;
3251
3252 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULESETS_error, x)
3253
3254 if (nv->len > pf_ioctl_maxcount)
3255 ERROUT(ENOMEM);
3256
3257 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3258 error = copyin(nv->data, nvlpacked, nv->len);
3259 if (error)
3260 ERROUT(error);
3261
3262 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3263 if (nvl == NULL)
3264 ERROUT(EBADMSG);
3265 if (! nvlist_exists_string(nvl, "path"))
3266 ERROUT(EBADMSG);
3267
3268 NET_EPOCH_ENTER(et);
3269
3270 if ((ruleset = pf_find_keth_ruleset(
3271 nvlist_get_string(nvl, "path"))) == NULL) {
3272 NET_EPOCH_EXIT(et);
3273 ERROUT(ENOENT);
3274 }
3275
3276 if (ruleset->anchor == NULL) {
3277 RB_FOREACH(anchor, pf_keth_anchor_global, &V_pf_keth_anchors)
3278 if (anchor->parent == NULL)
3279 nr++;
3280 } else {
3281 RB_FOREACH(anchor, pf_keth_anchor_node,
3282 &ruleset->anchor->children)
3283 nr++;
3284 }
3285
3286 NET_EPOCH_EXIT(et);
3287
3288 nvlist_destroy(nvl);
3289 nvl = NULL;
3290 free(nvlpacked, M_NVLIST);
3291 nvlpacked = NULL;
3292
3293 nvl = nvlist_create(0);
3294 if (nvl == NULL)
3295 ERROUT(ENOMEM);
3296
3297 nvlist_add_number(nvl, "nr", nr);
3298
3299 nvlpacked = nvlist_pack(nvl, &nv->len);
3300 if (nvlpacked == NULL)
3301 ERROUT(ENOMEM);
3302
3303 if (nv->size == 0)
3304 ERROUT(0);
3305 else if (nv->size < nv->len)
3306 ERROUT(ENOSPC);
3307
3308 error = copyout(nvlpacked, nv->data, nv->len);
3309
3310 #undef ERROUT
3311 DIOCGETETHRULESETS_error:
3312 free(nvlpacked, M_NVLIST);
3313 nvlist_destroy(nvl);
3314 break;
3315 }
3316
3317 case DIOCGETETHRULESET: {
3318 struct epoch_tracker et;
3319 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3320 nvlist_t *nvl = NULL;
3321 void *nvlpacked = NULL;
3322 struct pf_keth_ruleset *ruleset;
3323 struct pf_keth_anchor *anchor;
3324 int nr = 0, req_nr = 0;
3325 bool found = false;
3326
3327 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULESET_error, x)
3328
3329 if (nv->len > pf_ioctl_maxcount)
3330 ERROUT(ENOMEM);
3331
3332 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3333 error = copyin(nv->data, nvlpacked, nv->len);
3334 if (error)
3335 ERROUT(error);
3336
3337 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3338 if (nvl == NULL)
3339 ERROUT(EBADMSG);
3340 if (! nvlist_exists_string(nvl, "path"))
3341 ERROUT(EBADMSG);
3342 if (! nvlist_exists_number(nvl, "nr"))
3343 ERROUT(EBADMSG);
3344
3345 req_nr = nvlist_get_number(nvl, "nr");
3346
3347 NET_EPOCH_ENTER(et);
3348
3349 if ((ruleset = pf_find_keth_ruleset(
3350 nvlist_get_string(nvl, "path"))) == NULL) {
3351 NET_EPOCH_EXIT(et);
3352 ERROUT(ENOENT);
3353 }
3354
3355 nvlist_destroy(nvl);
3356 nvl = NULL;
3357 free(nvlpacked, M_NVLIST);
3358 nvlpacked = NULL;
3359
3360 nvl = nvlist_create(0);
3361 if (nvl == NULL) {
3362 NET_EPOCH_EXIT(et);
3363 ERROUT(ENOMEM);
3364 }
3365
3366 if (ruleset->anchor == NULL) {
3367 RB_FOREACH(anchor, pf_keth_anchor_global,
3368 &V_pf_keth_anchors) {
3369 if (anchor->parent == NULL && nr++ == req_nr) {
3370 found = true;
3371 break;
3372 }
3373 }
3374 } else {
3375 RB_FOREACH(anchor, pf_keth_anchor_node,
3376 &ruleset->anchor->children) {
3377 if (nr++ == req_nr) {
3378 found = true;
3379 break;
3380 }
3381 }
3382 }
3383
3384 NET_EPOCH_EXIT(et);
3385 if (found) {
3386 nvlist_add_number(nvl, "nr", nr);
3387 nvlist_add_string(nvl, "name", anchor->name);
3388 if (ruleset->anchor)
3389 nvlist_add_string(nvl, "path",
3390 ruleset->anchor->path);
3391 else
3392 nvlist_add_string(nvl, "path", "");
3393 } else {
3394 ERROUT(EBUSY);
3395 }
3396
3397 nvlpacked = nvlist_pack(nvl, &nv->len);
3398 if (nvlpacked == NULL)
3399 ERROUT(ENOMEM);
3400
3401 if (nv->size == 0)
3402 ERROUT(0);
3403 else if (nv->size < nv->len)
3404 ERROUT(ENOSPC);
3405
3406 error = copyout(nvlpacked, nv->data, nv->len);
3407
3408 #undef ERROUT
3409 DIOCGETETHRULESET_error:
3410 free(nvlpacked, M_NVLIST);
3411 nvlist_destroy(nvl);
3412 break;
3413 }
3414
3415 case DIOCADDRULENV: {
3416 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3417 nvlist_t *nvl = NULL;
3418 void *nvlpacked = NULL;
3419 struct pf_krule *rule = NULL;
3420 const char *anchor = "", *anchor_call = "";
3421 uint32_t ticket = 0, pool_ticket = 0;
3422
3423 #define ERROUT(x) ERROUT_IOCTL(DIOCADDRULENV_error, x)
3424
3425 if (nv->len > pf_ioctl_maxcount)
3426 ERROUT(ENOMEM);
3427
3428 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3429 error = copyin(nv->data, nvlpacked, nv->len);
3430 if (error)
3431 ERROUT(error);
3432
3433 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3434 if (nvl == NULL)
3435 ERROUT(EBADMSG);
3436
3437 if (! nvlist_exists_number(nvl, "ticket"))
3438 ERROUT(EINVAL);
3439 ticket = nvlist_get_number(nvl, "ticket");
3440
3441 if (! nvlist_exists_number(nvl, "pool_ticket"))
3442 ERROUT(EINVAL);
3443 pool_ticket = nvlist_get_number(nvl, "pool_ticket");
3444
3445 if (! nvlist_exists_nvlist(nvl, "rule"))
3446 ERROUT(EINVAL);
3447
3448 rule = pf_krule_alloc();
3449 error = pf_nvrule_to_krule(nvlist_get_nvlist(nvl, "rule"),
3450 rule);
3451 if (error)
3452 ERROUT(error);
3453
3454 if (nvlist_exists_string(nvl, "anchor"))
3455 anchor = nvlist_get_string(nvl, "anchor");
3456 if (nvlist_exists_string(nvl, "anchor_call"))
3457 anchor_call = nvlist_get_string(nvl, "anchor_call");
3458
3459 if ((error = nvlist_error(nvl)))
3460 ERROUT(error);
3461
3462 /* Frees rule on error */
3463 error = pf_ioctl_addrule(rule, ticket, pool_ticket, anchor,
3464 anchor_call, td->td_ucred->cr_ruid,
3465 td->td_proc ? td->td_proc->p_pid : 0);
3466
3467 nvlist_destroy(nvl);
3468 free(nvlpacked, M_NVLIST);
3469 break;
3470 #undef ERROUT
3471 DIOCADDRULENV_error:
3472 pf_krule_free(rule);
3473 nvlist_destroy(nvl);
3474 free(nvlpacked, M_NVLIST);
3475
3476 break;
3477 }
3478 case DIOCADDRULE: {
3479 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
3480 struct pf_krule *rule;
3481
3482 rule = pf_krule_alloc();
3483 error = pf_rule_to_krule(&pr->rule, rule);
3484 if (error != 0) {
3485 pf_krule_free(rule);
3486 break;
3487 }
3488
3489 pr->anchor[sizeof(pr->anchor) - 1] = 0;
3490
3491 /* Frees rule on error */
3492 error = pf_ioctl_addrule(rule, pr->ticket, pr->pool_ticket,
3493 pr->anchor, pr->anchor_call, td->td_ucred->cr_ruid,
3494 td->td_proc ? td->td_proc->p_pid : 0);
3495 break;
3496 }
3497
3498 case DIOCGETRULES: {
3499 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
3500
3501 pr->anchor[sizeof(pr->anchor) - 1] = 0;
3502
3503 error = pf_ioctl_getrules(pr);
3504
3505 break;
3506 }
3507
3508 case DIOCGETRULENV: {
3509 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3510 nvlist_t *nvrule = NULL;
3511 nvlist_t *nvl = NULL;
3512 struct pf_kruleset *ruleset;
3513 struct pf_krule *rule;
3514 void *nvlpacked = NULL;
3515 int rs_num, nr;
3516 bool clear_counter = false;
3517
3518 #define ERROUT(x) ERROUT_IOCTL(DIOCGETRULENV_error, x)
3519
3520 if (nv->len > pf_ioctl_maxcount)
3521 ERROUT(ENOMEM);
3522
3523 /* Copy the request in */
3524 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3525 error = copyin(nv->data, nvlpacked, nv->len);
3526 if (error)
3527 ERROUT(error);
3528
3529 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3530 if (nvl == NULL)
3531 ERROUT(EBADMSG);
3532
3533 if (! nvlist_exists_string(nvl, "anchor"))
3534 ERROUT(EBADMSG);
3535 if (! nvlist_exists_number(nvl, "ruleset"))
3536 ERROUT(EBADMSG);
3537 if (! nvlist_exists_number(nvl, "ticket"))
3538 ERROUT(EBADMSG);
3539 if (! nvlist_exists_number(nvl, "nr"))
3540 ERROUT(EBADMSG);
3541
3542 if (nvlist_exists_bool(nvl, "clear_counter"))
3543 clear_counter = nvlist_get_bool(nvl, "clear_counter");
3544
3545 if (clear_counter && !(flags & FWRITE))
3546 ERROUT(EACCES);
3547
3548 nr = nvlist_get_number(nvl, "nr");
3549
3550 PF_RULES_WLOCK();
3551 ruleset = pf_find_kruleset(nvlist_get_string(nvl, "anchor"));
3552 if (ruleset == NULL) {
3553 PF_RULES_WUNLOCK();
3554 ERROUT(ENOENT);
3555 }
3556
3557 rs_num = pf_get_ruleset_number(nvlist_get_number(nvl, "ruleset"));
3558 if (rs_num >= PF_RULESET_MAX) {
3559 PF_RULES_WUNLOCK();
3560 ERROUT(EINVAL);
3561 }
3562
3563 if (nvlist_get_number(nvl, "ticket") !=
3564 ruleset->rules[rs_num].active.ticket) {
3565 PF_RULES_WUNLOCK();
3566 ERROUT(EBUSY);
3567 }
3568
3569 if ((error = nvlist_error(nvl))) {
3570 PF_RULES_WUNLOCK();
3571 ERROUT(error);
3572 }
3573
3574 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
3575 while ((rule != NULL) && (rule->nr != nr))
3576 rule = TAILQ_NEXT(rule, entries);
3577 if (rule == NULL) {
3578 PF_RULES_WUNLOCK();
3579 ERROUT(EBUSY);
3580 }
3581
3582 nvrule = pf_krule_to_nvrule(rule);
3583
3584 nvlist_destroy(nvl);
3585 nvl = nvlist_create(0);
3586 if (nvl == NULL) {
3587 PF_RULES_WUNLOCK();
3588 ERROUT(ENOMEM);
3589 }
3590 nvlist_add_number(nvl, "nr", nr);
3591 nvlist_add_nvlist(nvl, "rule", nvrule);
3592 nvlist_destroy(nvrule);
3593 nvrule = NULL;
3594 if (pf_kanchor_nvcopyout(ruleset, rule, nvl)) {
3595 PF_RULES_WUNLOCK();
3596 ERROUT(EBUSY);
3597 }
3598
3599 free(nvlpacked, M_NVLIST);
3600 nvlpacked = nvlist_pack(nvl, &nv->len);
3601 if (nvlpacked == NULL) {
3602 PF_RULES_WUNLOCK();
3603 ERROUT(ENOMEM);
3604 }
3605
3606 if (nv->size == 0) {
3607 PF_RULES_WUNLOCK();
3608 ERROUT(0);
3609 }
3610 else if (nv->size < nv->len) {
3611 PF_RULES_WUNLOCK();
3612 ERROUT(ENOSPC);
3613 }
3614
3615 if (clear_counter)
3616 pf_krule_clear_counters(rule);
3617
3618 PF_RULES_WUNLOCK();
3619
3620 error = copyout(nvlpacked, nv->data, nv->len);
3621
3622 #undef ERROUT
3623 DIOCGETRULENV_error:
3624 free(nvlpacked, M_NVLIST);
3625 nvlist_destroy(nvrule);
3626 nvlist_destroy(nvl);
3627
3628 break;
3629 }
3630
3631 case DIOCCHANGERULE: {
3632 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
3633 struct pf_kruleset *ruleset;
3634 struct pf_krule *oldrule = NULL, *newrule = NULL;
3635 struct pfi_kkif *kif = NULL;
3636 struct pf_kpooladdr *pa;
3637 u_int32_t nr = 0;
3638 int rs_num;
3639
3640 pcr->anchor[sizeof(pcr->anchor) - 1] = 0;
3641
3642 if (pcr->action < PF_CHANGE_ADD_HEAD ||
3643 pcr->action > PF_CHANGE_GET_TICKET) {
3644 error = EINVAL;
3645 break;
3646 }
3647 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
3648 error = EINVAL;
3649 break;
3650 }
3651
3652 if (pcr->action != PF_CHANGE_REMOVE) {
3653 newrule = pf_krule_alloc();
3654 error = pf_rule_to_krule(&pcr->rule, newrule);
3655 if (error != 0) {
3656 pf_krule_free(newrule);
3657 break;
3658 }
3659
3660 if (newrule->ifname[0])
3661 kif = pf_kkif_create(M_WAITOK);
3662 pf_counter_u64_init(&newrule->evaluations, M_WAITOK);
3663 for (int i = 0; i < 2; i++) {
3664 pf_counter_u64_init(&newrule->packets[i], M_WAITOK);
3665 pf_counter_u64_init(&newrule->bytes[i], M_WAITOK);
3666 }
3667 newrule->states_cur = counter_u64_alloc(M_WAITOK);
3668 newrule->states_tot = counter_u64_alloc(M_WAITOK);
3669 for (pf_sn_types_t sn_type=0; sn_type<PF_SN_MAX; sn_type++)
3670 newrule->src_nodes[sn_type] = counter_u64_alloc(M_WAITOK);
3671 newrule->cuid = td->td_ucred->cr_ruid;
3672 newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
3673 TAILQ_INIT(&newrule->nat.list);
3674 TAILQ_INIT(&newrule->rdr.list);
3675 TAILQ_INIT(&newrule->route.list);
3676 }
3677 #define ERROUT(x) ERROUT_IOCTL(DIOCCHANGERULE_error, x)
3678
3679 PF_CONFIG_LOCK();
3680 PF_RULES_WLOCK();
3681 #ifdef PF_WANT_32_TO_64_COUNTER
3682 if (newrule != NULL) {
3683 LIST_INSERT_HEAD(&V_pf_allrulelist, newrule, allrulelist);
3684 newrule->allrulelinked = true;
3685 V_pf_allrulecount++;
3686 }
3687 #endif
3688
3689 if (!(pcr->action == PF_CHANGE_REMOVE ||
3690 pcr->action == PF_CHANGE_GET_TICKET) &&
3691 pcr->pool_ticket != V_ticket_pabuf)
3692 ERROUT(EBUSY);
3693
3694 ruleset = pf_find_kruleset(pcr->anchor);
3695 if (ruleset == NULL)
3696 ERROUT(EINVAL);
3697
3698 rs_num = pf_get_ruleset_number(pcr->rule.action);
3699 if (rs_num >= PF_RULESET_MAX)
3700 ERROUT(EINVAL);
3701
3702 /*
3703 * XXXMJG: there is no guarantee that the ruleset was
3704 * created by the usual route of calling DIOCXBEGIN.
3705 * As a result it is possible the rule tree will not
3706 * be allocated yet. Hack around it by doing it here.
3707 * Note it is fine to let the tree persist in case of
3708 * error as it will be freed down the road on future
3709 * updates (if need be).
3710 */
3711 if (ruleset->rules[rs_num].active.tree == NULL) {
3712 ruleset->rules[rs_num].active.tree = pf_rule_tree_alloc(M_NOWAIT);
3713 if (ruleset->rules[rs_num].active.tree == NULL) {
3714 ERROUT(ENOMEM);
3715 }
3716 }
3717
3718 if (pcr->action == PF_CHANGE_GET_TICKET) {
3719 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
3720 ERROUT(0);
3721 } else if (pcr->ticket !=
3722 ruleset->rules[rs_num].active.ticket)
3723 ERROUT(EINVAL);
3724
3725 if (pcr->action != PF_CHANGE_REMOVE) {
3726 if (newrule->ifname[0]) {
3727 newrule->kif = pfi_kkif_attach(kif,
3728 newrule->ifname);
3729 kif = NULL;
3730 pfi_kkif_ref(newrule->kif);
3731 } else
3732 newrule->kif = NULL;
3733
3734 if (newrule->rtableid > 0 &&
3735 newrule->rtableid >= rt_numfibs)
3736 error = EBUSY;
3737
3738 #ifdef ALTQ
3739 /* set queue IDs */
3740 if (newrule->qname[0] != 0) {
3741 if ((newrule->qid =
3742 pf_qname2qid(newrule->qname)) == 0)
3743 error = EBUSY;
3744 else if (newrule->pqname[0] != 0) {
3745 if ((newrule->pqid =
3746 pf_qname2qid(newrule->pqname)) == 0)
3747 error = EBUSY;
3748 } else
3749 newrule->pqid = newrule->qid;
3750 }
3751 #endif /* ALTQ */
3752 if (newrule->tagname[0])
3753 if ((newrule->tag =
3754 pf_tagname2tag(newrule->tagname)) == 0)
3755 error = EBUSY;
3756 if (newrule->match_tagname[0])
3757 if ((newrule->match_tag = pf_tagname2tag(
3758 newrule->match_tagname)) == 0)
3759 error = EBUSY;
3760 if (newrule->rt && !newrule->direction)
3761 error = EINVAL;
3762 if (!newrule->log)
3763 newrule->logif = 0;
3764 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
3765 error = ENOMEM;
3766 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
3767 error = ENOMEM;
3768 if (pf_kanchor_setup(newrule, ruleset, pcr->anchor_call))
3769 error = EINVAL;
3770 for (int i = 0; i < 3; i++) {
3771 TAILQ_FOREACH(pa, &V_pf_pabuf[i], entries)
3772 if (pa->addr.type == PF_ADDR_TABLE) {
3773 pa->addr.p.tbl =
3774 pfr_attach_table(ruleset,
3775 pa->addr.v.tblname);
3776 if (pa->addr.p.tbl == NULL)
3777 error = ENOMEM;
3778 }
3779 }
3780
3781 newrule->overload_tbl = NULL;
3782 if (newrule->overload_tblname[0]) {
3783 if ((newrule->overload_tbl = pfr_attach_table(
3784 ruleset, newrule->overload_tblname)) ==
3785 NULL)
3786 error = EINVAL;
3787 else
3788 newrule->overload_tbl->pfrkt_flags |=
3789 PFR_TFLAG_ACTIVE;
3790 }
3791
3792 pf_mv_kpool(&V_pf_pabuf[0], &newrule->nat.list);
3793 pf_mv_kpool(&V_pf_pabuf[1], &newrule->rdr.list);
3794 pf_mv_kpool(&V_pf_pabuf[2], &newrule->route.list);
3795 if (((((newrule->action == PF_NAT) ||
3796 (newrule->action == PF_RDR) ||
3797 (newrule->action == PF_BINAT) ||
3798 (newrule->rt > PF_NOPFROUTE)) &&
3799 !newrule->anchor)) &&
3800 (TAILQ_FIRST(&newrule->rdr.list) == NULL))
3801 error = EINVAL;
3802
3803 if (error) {
3804 pf_free_rule(newrule);
3805 PF_RULES_WUNLOCK();
3806 PF_CONFIG_UNLOCK();
3807 break;
3808 }
3809
3810 newrule->nat.cur = TAILQ_FIRST(&newrule->nat.list);
3811 newrule->rdr.cur = TAILQ_FIRST(&newrule->rdr.list);
3812 }
3813 pf_empty_kpool(&V_pf_pabuf[0]);
3814 pf_empty_kpool(&V_pf_pabuf[1]);
3815 pf_empty_kpool(&V_pf_pabuf[2]);
3816
3817 if (pcr->action == PF_CHANGE_ADD_HEAD)
3818 oldrule = TAILQ_FIRST(
3819 ruleset->rules[rs_num].active.ptr);
3820 else if (pcr->action == PF_CHANGE_ADD_TAIL)
3821 oldrule = TAILQ_LAST(
3822 ruleset->rules[rs_num].active.ptr, pf_krulequeue);
3823 else {
3824 oldrule = TAILQ_FIRST(
3825 ruleset->rules[rs_num].active.ptr);
3826 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
3827 oldrule = TAILQ_NEXT(oldrule, entries);
3828 if (oldrule == NULL) {
3829 if (newrule != NULL)
3830 pf_free_rule(newrule);
3831 PF_RULES_WUNLOCK();
3832 PF_CONFIG_UNLOCK();
3833 error = EINVAL;
3834 break;
3835 }
3836 }
3837
3838 if (pcr->action == PF_CHANGE_REMOVE) {
3839 pf_unlink_rule(ruleset->rules[rs_num].active.ptr,
3840 oldrule);
3841 RB_REMOVE(pf_krule_global,
3842 ruleset->rules[rs_num].active.tree, oldrule);
3843 ruleset->rules[rs_num].active.rcount--;
3844 } else {
3845 pf_hash_rule(newrule);
3846 if (RB_INSERT(pf_krule_global,
3847 ruleset->rules[rs_num].active.tree, newrule) != NULL) {
3848 pf_free_rule(newrule);
3849 PF_RULES_WUNLOCK();
3850 PF_CONFIG_UNLOCK();
3851 error = EEXIST;
3852 break;
3853 }
3854
3855 if (oldrule == NULL)
3856 TAILQ_INSERT_TAIL(
3857 ruleset->rules[rs_num].active.ptr,
3858 newrule, entries);
3859 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
3860 pcr->action == PF_CHANGE_ADD_BEFORE)
3861 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
3862 else
3863 TAILQ_INSERT_AFTER(
3864 ruleset->rules[rs_num].active.ptr,
3865 oldrule, newrule, entries);
3866 ruleset->rules[rs_num].active.rcount++;
3867 }
3868
3869 nr = 0;
3870 TAILQ_FOREACH(oldrule,
3871 ruleset->rules[rs_num].active.ptr, entries)
3872 oldrule->nr = nr++;
3873
3874 ruleset->rules[rs_num].active.ticket++;
3875
3876 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
3877 pf_remove_if_empty_kruleset(ruleset);
3878
3879 PF_RULES_WUNLOCK();
3880 PF_CONFIG_UNLOCK();
3881 break;
3882
3883 #undef ERROUT
3884 DIOCCHANGERULE_error:
3885 PF_RULES_WUNLOCK();
3886 PF_CONFIG_UNLOCK();
3887 pf_krule_free(newrule);
3888 pf_kkif_free(kif);
3889 break;
3890 }
3891
3892 case DIOCCLRSTATESNV: {
3893 error = pf_clearstates_nv((struct pfioc_nv *)addr);
3894 break;
3895 }
3896
3897 case DIOCKILLSTATESNV: {
3898 error = pf_killstates_nv((struct pfioc_nv *)addr);
3899 break;
3900 }
3901
3902 case DIOCADDSTATE: {
3903 struct pfioc_state *ps = (struct pfioc_state *)addr;
3904 struct pfsync_state_1301 *sp = &ps->state;
3905
3906 if (sp->timeout >= PFTM_MAX) {
3907 error = EINVAL;
3908 break;
3909 }
3910 if (V_pfsync_state_import_ptr != NULL) {
3911 PF_RULES_RLOCK();
3912 error = V_pfsync_state_import_ptr(
3913 (union pfsync_state_union *)sp, PFSYNC_SI_IOCTL,
3914 PFSYNC_MSG_VERSION_1301);
3915 PF_RULES_RUNLOCK();
3916 } else
3917 error = EOPNOTSUPP;
3918 break;
3919 }
3920
3921 case DIOCGETSTATE: {
3922 struct pfioc_state *ps = (struct pfioc_state *)addr;
3923 struct pf_kstate *s;
3924
3925 s = pf_find_state_byid(ps->state.id, ps->state.creatorid);
3926 if (s == NULL) {
3927 error = ENOENT;
3928 break;
3929 }
3930
3931 pfsync_state_export((union pfsync_state_union*)&ps->state,
3932 s, PFSYNC_MSG_VERSION_1301);
3933 PF_STATE_UNLOCK(s);
3934 break;
3935 }
3936
3937 case DIOCGETSTATENV: {
3938 error = pf_getstate((struct pfioc_nv *)addr);
3939 break;
3940 }
3941
3942 #ifdef COMPAT_FREEBSD14
3943 case DIOCGETSTATES: {
3944 struct pfioc_states *ps = (struct pfioc_states *)addr;
3945 struct pf_kstate *s;
3946 struct pfsync_state_1301 *pstore, *p;
3947 int i, nr;
3948 size_t slice_count = 16, count;
3949 void *out;
3950
3951 if (ps->ps_len <= 0) {
3952 nr = uma_zone_get_cur(V_pf_state_z);
3953 ps->ps_len = sizeof(struct pfsync_state_1301) * nr;
3954 break;
3955 }
3956
3957 out = ps->ps_states;
3958 pstore = mallocarray(slice_count,
3959 sizeof(struct pfsync_state_1301), M_TEMP, M_WAITOK | M_ZERO);
3960 nr = 0;
3961
3962 for (i = 0; i <= V_pf_hashmask; i++) {
3963 struct pf_idhash *ih = &V_pf_idhash[i];
3964
3965 DIOCGETSTATES_retry:
3966 p = pstore;
3967
3968 if (LIST_EMPTY(&ih->states))
3969 continue;
3970
3971 PF_HASHROW_LOCK(ih);
3972 count = 0;
3973 LIST_FOREACH(s, &ih->states, entry) {
3974 if (s->timeout == PFTM_UNLINKED)
3975 continue;
3976 count++;
3977 }
3978
3979 if (count > slice_count) {
3980 PF_HASHROW_UNLOCK(ih);
3981 free(pstore, M_TEMP);
3982 slice_count = count * 2;
3983 pstore = mallocarray(slice_count,
3984 sizeof(struct pfsync_state_1301), M_TEMP,
3985 M_WAITOK | M_ZERO);
3986 goto DIOCGETSTATES_retry;
3987 }
3988
3989 if ((nr+count) * sizeof(*p) > ps->ps_len) {
3990 PF_HASHROW_UNLOCK(ih);
3991 goto DIOCGETSTATES_full;
3992 }
3993
3994 LIST_FOREACH(s, &ih->states, entry) {
3995 if (s->timeout == PFTM_UNLINKED)
3996 continue;
3997
3998 pfsync_state_export((union pfsync_state_union*)p,
3999 s, PFSYNC_MSG_VERSION_1301);
4000 p++;
4001 nr++;
4002 }
4003 PF_HASHROW_UNLOCK(ih);
4004 error = copyout(pstore, out,
4005 sizeof(struct pfsync_state_1301) * count);
4006 if (error)
4007 break;
4008 out = ps->ps_states + nr;
4009 }
4010 DIOCGETSTATES_full:
4011 ps->ps_len = sizeof(struct pfsync_state_1301) * nr;
4012 free(pstore, M_TEMP);
4013
4014 break;
4015 }
4016
4017 case DIOCGETSTATESV2: {
4018 struct pfioc_states_v2 *ps = (struct pfioc_states_v2 *)addr;
4019 struct pf_kstate *s;
4020 struct pf_state_export *pstore, *p;
4021 int i, nr;
4022 size_t slice_count = 16, count;
4023 void *out;
4024
4025 if (ps->ps_req_version > PF_STATE_VERSION) {
4026 error = ENOTSUP;
4027 break;
4028 }
4029
4030 if (ps->ps_len <= 0) {
4031 nr = uma_zone_get_cur(V_pf_state_z);
4032 ps->ps_len = sizeof(struct pf_state_export) * nr;
4033 break;
4034 }
4035
4036 out = ps->ps_states;
4037 pstore = mallocarray(slice_count,
4038 sizeof(struct pf_state_export), M_TEMP, M_WAITOK | M_ZERO);
4039 nr = 0;
4040
4041 for (i = 0; i <= V_pf_hashmask; i++) {
4042 struct pf_idhash *ih = &V_pf_idhash[i];
4043
4044 DIOCGETSTATESV2_retry:
4045 p = pstore;
4046
4047 if (LIST_EMPTY(&ih->states))
4048 continue;
4049
4050 PF_HASHROW_LOCK(ih);
4051 count = 0;
4052 LIST_FOREACH(s, &ih->states, entry) {
4053 if (s->timeout == PFTM_UNLINKED)
4054 continue;
4055 count++;
4056 }
4057
4058 if (count > slice_count) {
4059 PF_HASHROW_UNLOCK(ih);
4060 free(pstore, M_TEMP);
4061 slice_count = count * 2;
4062 pstore = mallocarray(slice_count,
4063 sizeof(struct pf_state_export), M_TEMP,
4064 M_WAITOK | M_ZERO);
4065 goto DIOCGETSTATESV2_retry;
4066 }
4067
4068 if ((nr+count) * sizeof(*p) > ps->ps_len) {
4069 PF_HASHROW_UNLOCK(ih);
4070 goto DIOCGETSTATESV2_full;
4071 }
4072
4073 LIST_FOREACH(s, &ih->states, entry) {
4074 if (s->timeout == PFTM_UNLINKED)
4075 continue;
4076
4077 pf_state_export(p, s);
4078 p++;
4079 nr++;
4080 }
4081 PF_HASHROW_UNLOCK(ih);
4082 error = copyout(pstore, out,
4083 sizeof(struct pf_state_export) * count);
4084 if (error)
4085 break;
4086 out = ps->ps_states + nr;
4087 }
4088 DIOCGETSTATESV2_full:
4089 ps->ps_len = nr * sizeof(struct pf_state_export);
4090 free(pstore, M_TEMP);
4091
4092 break;
4093 }
4094 #endif
4095 case DIOCGETSTATUSNV: {
4096 error = pf_getstatus((struct pfioc_nv *)addr);
4097 break;
4098 }
4099
4100 case DIOCSETSTATUSIF: {
4101 struct pfioc_if *pi = (struct pfioc_if *)addr;
4102
4103 if (pi->ifname[0] == 0) {
4104 bzero(V_pf_status.ifname, IFNAMSIZ);
4105 break;
4106 }
4107 PF_RULES_WLOCK();
4108 error = pf_user_strcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ);
4109 PF_RULES_WUNLOCK();
4110 break;
4111 }
4112
4113 case DIOCCLRSTATUS: {
4114 pf_ioctl_clear_status();
4115 break;
4116 }
4117
4118 case DIOCNATLOOK: {
4119 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
4120 struct pf_state_key *sk;
4121 struct pf_kstate *state;
4122 struct pf_state_key_cmp key;
4123 int m = 0, direction = pnl->direction;
4124 int sidx, didx;
4125
4126 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
4127 sidx = (direction == PF_IN) ? 1 : 0;
4128 didx = (direction == PF_IN) ? 0 : 1;
4129
4130 if (!pnl->proto ||
4131 PF_AZERO(&pnl->saddr, pnl->af) ||
4132 PF_AZERO(&pnl->daddr, pnl->af) ||
4133 ((pnl->proto == IPPROTO_TCP ||
4134 pnl->proto == IPPROTO_UDP) &&
4135 (!pnl->dport || !pnl->sport)))
4136 error = EINVAL;
4137 else {
4138 bzero(&key, sizeof(key));
4139 key.af = pnl->af;
4140 key.proto = pnl->proto;
4141 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
4142 key.port[sidx] = pnl->sport;
4143 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
4144 key.port[didx] = pnl->dport;
4145
4146 state = pf_find_state_all(&key, direction, &m);
4147 if (state == NULL) {
4148 error = ENOENT;
4149 } else {
4150 if (m > 1) {
4151 PF_STATE_UNLOCK(state);
4152 error = E2BIG; /* more than one state */
4153 } else {
4154 sk = state->key[sidx];
4155 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
4156 pnl->rsport = sk->port[sidx];
4157 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
4158 pnl->rdport = sk->port[didx];
4159 PF_STATE_UNLOCK(state);
4160 }
4161 }
4162 }
4163 break;
4164 }
4165
4166 case DIOCSETTIMEOUT: {
4167 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
4168
4169 error = pf_ioctl_set_timeout(pt->timeout, pt->seconds,
4170 &pt->seconds);
4171 break;
4172 }
4173
4174 case DIOCGETTIMEOUT: {
4175 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
4176
4177 error = pf_ioctl_get_timeout(pt->timeout, &pt->seconds);
4178 break;
4179 }
4180
4181 case DIOCGETLIMIT: {
4182 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
4183
4184 error = pf_ioctl_get_limit(pl->index, &pl->limit);
4185 break;
4186 }
4187
4188 case DIOCSETLIMIT: {
4189 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
4190 unsigned int old_limit;
4191
4192 error = pf_ioctl_set_limit(pl->index, pl->limit, &old_limit);
4193 pl->limit = old_limit;
4194 break;
4195 }
4196
4197 case DIOCSETDEBUG: {
4198 u_int32_t *level = (u_int32_t *)addr;
4199
4200 PF_RULES_WLOCK();
4201 V_pf_status.debug = *level;
4202 PF_RULES_WUNLOCK();
4203 break;
4204 }
4205
4206 case DIOCCLRRULECTRS: {
4207 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
4208 struct pf_kruleset *ruleset = &pf_main_ruleset;
4209 struct pf_krule *rule;
4210
4211 PF_RULES_WLOCK();
4212 TAILQ_FOREACH(rule,
4213 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
4214 pf_counter_u64_zero(&rule->evaluations);
4215 for (int i = 0; i < 2; i++) {
4216 pf_counter_u64_zero(&rule->packets[i]);
4217 pf_counter_u64_zero(&rule->bytes[i]);
4218 }
4219 }
4220 PF_RULES_WUNLOCK();
4221 break;
4222 }
4223
4224 case DIOCGIFSPEEDV0:
4225 case DIOCGIFSPEEDV1: {
4226 struct pf_ifspeed_v1 *psp = (struct pf_ifspeed_v1 *)addr;
4227 struct pf_ifspeed_v1 ps;
4228 struct ifnet *ifp;
4229
4230 if (psp->ifname[0] == '\0') {
4231 error = EINVAL;
4232 break;
4233 }
4234
4235 error = pf_user_strcpy(ps.ifname, psp->ifname, IFNAMSIZ);
4236 if (error != 0)
4237 break;
4238 ifp = ifunit(ps.ifname);
4239 if (ifp != NULL) {
4240 psp->baudrate32 =
4241 (u_int32_t)uqmin(ifp->if_baudrate, UINT_MAX);
4242 if (cmd == DIOCGIFSPEEDV1)
4243 psp->baudrate = ifp->if_baudrate;
4244 } else {
4245 error = EINVAL;
4246 }
4247 break;
4248 }
4249
4250 #ifdef ALTQ
4251 case DIOCSTARTALTQ: {
4252 struct pf_altq *altq;
4253
4254 PF_RULES_WLOCK();
4255 /* enable all altq interfaces on active list */
4256 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
4257 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
4258 error = pf_enable_altq(altq);
4259 if (error != 0)
4260 break;
4261 }
4262 }
4263 if (error == 0)
4264 V_pf_altq_running = 1;
4265 PF_RULES_WUNLOCK();
4266 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
4267 break;
4268 }
4269
4270 case DIOCSTOPALTQ: {
4271 struct pf_altq *altq;
4272
4273 PF_RULES_WLOCK();
4274 /* disable all altq interfaces on active list */
4275 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
4276 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
4277 error = pf_disable_altq(altq);
4278 if (error != 0)
4279 break;
4280 }
4281 }
4282 if (error == 0)
4283 V_pf_altq_running = 0;
4284 PF_RULES_WUNLOCK();
4285 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
4286 break;
4287 }
4288
4289 case DIOCADDALTQV0:
4290 case DIOCADDALTQV1: {
4291 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4292 struct pf_altq *altq, *a;
4293 struct ifnet *ifp;
4294
4295 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK | M_ZERO);
4296 error = pf_import_kaltq(pa, altq, IOCPARM_LEN(cmd));
4297 if (error)
4298 break;
4299 altq->local_flags = 0;
4300
4301 PF_RULES_WLOCK();
4302 if (pa->ticket != V_ticket_altqs_inactive) {
4303 PF_RULES_WUNLOCK();
4304 free(altq, M_PFALTQ);
4305 error = EBUSY;
4306 break;
4307 }
4308
4309 /*
4310 * if this is for a queue, find the discipline and
4311 * copy the necessary fields
4312 */
4313 if (altq->qname[0] != 0) {
4314 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
4315 PF_RULES_WUNLOCK();
4316 error = EBUSY;
4317 free(altq, M_PFALTQ);
4318 break;
4319 }
4320 altq->altq_disc = NULL;
4321 TAILQ_FOREACH(a, V_pf_altq_ifs_inactive, entries) {
4322 if (strncmp(a->ifname, altq->ifname,
4323 IFNAMSIZ) == 0) {
4324 altq->altq_disc = a->altq_disc;
4325 break;
4326 }
4327 }
4328 }
4329
4330 if ((ifp = ifunit(altq->ifname)) == NULL)
4331 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
4332 else
4333 error = altq_add(ifp, altq);
4334
4335 if (error) {
4336 PF_RULES_WUNLOCK();
4337 free(altq, M_PFALTQ);
4338 break;
4339 }
4340
4341 if (altq->qname[0] != 0)
4342 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries);
4343 else
4344 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, altq, entries);
4345 /* version error check done on import above */
4346 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
4347 PF_RULES_WUNLOCK();
4348 break;
4349 }
4350
4351 case DIOCGETALTQSV0:
4352 case DIOCGETALTQSV1: {
4353 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4354 struct pf_altq *altq;
4355
4356 PF_RULES_RLOCK();
4357 pa->nr = 0;
4358 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries)
4359 pa->nr++;
4360 TAILQ_FOREACH(altq, V_pf_altqs_active, entries)
4361 pa->nr++;
4362 pa->ticket = V_ticket_altqs_active;
4363 PF_RULES_RUNLOCK();
4364 break;
4365 }
4366
4367 case DIOCGETALTQV0:
4368 case DIOCGETALTQV1: {
4369 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4370 struct pf_altq *altq;
4371
4372 PF_RULES_RLOCK();
4373 if (pa->ticket != V_ticket_altqs_active) {
4374 PF_RULES_RUNLOCK();
4375 error = EBUSY;
4376 break;
4377 }
4378 altq = pf_altq_get_nth_active(pa->nr);
4379 if (altq == NULL) {
4380 PF_RULES_RUNLOCK();
4381 error = EBUSY;
4382 break;
4383 }
4384 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
4385 PF_RULES_RUNLOCK();
4386 break;
4387 }
4388
4389 case DIOCCHANGEALTQV0:
4390 case DIOCCHANGEALTQV1:
4391 /* CHANGEALTQ not supported yet! */
4392 error = ENODEV;
4393 break;
4394
4395 case DIOCGETQSTATSV0:
4396 case DIOCGETQSTATSV1: {
4397 struct pfioc_qstats_v1 *pq = (struct pfioc_qstats_v1 *)addr;
4398 struct pf_altq *altq;
4399 int nbytes;
4400 u_int32_t version;
4401
4402 PF_RULES_RLOCK();
4403 if (pq->ticket != V_ticket_altqs_active) {
4404 PF_RULES_RUNLOCK();
4405 error = EBUSY;
4406 break;
4407 }
4408 nbytes = pq->nbytes;
4409 altq = pf_altq_get_nth_active(pq->nr);
4410 if (altq == NULL) {
4411 PF_RULES_RUNLOCK();
4412 error = EBUSY;
4413 break;
4414 }
4415
4416 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) {
4417 PF_RULES_RUNLOCK();
4418 error = ENXIO;
4419 break;
4420 }
4421 PF_RULES_RUNLOCK();
4422 if (cmd == DIOCGETQSTATSV0)
4423 version = 0; /* DIOCGETQSTATSV0 means stats struct v0 */
4424 else
4425 version = pq->version;
4426 error = altq_getqstats(altq, pq->buf, &nbytes, version);
4427 if (error == 0) {
4428 pq->scheduler = altq->scheduler;
4429 pq->nbytes = nbytes;
4430 }
4431 break;
4432 }
4433 #endif /* ALTQ */
4434
4435 case DIOCBEGINADDRS: {
4436 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4437
4438 error = pf_ioctl_begin_addrs(&pp->ticket);
4439 break;
4440 }
4441
4442 case DIOCADDADDR: {
4443 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4444 struct pf_nl_pooladdr npp = {};
4445
4446 npp.which = PF_RDR;
4447 memcpy(&npp, pp, sizeof(*pp));
4448 error = pf_ioctl_add_addr(&npp);
4449 break;
4450 }
4451
4452 case DIOCGETADDRS: {
4453 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4454 struct pf_nl_pooladdr npp = {};
4455
4456 npp.which = PF_RDR;
4457 memcpy(&npp, pp, sizeof(*pp));
4458 error = pf_ioctl_get_addrs(&npp);
4459 memcpy(pp, &npp, sizeof(*pp));
4460
4461 break;
4462 }
4463
4464 case DIOCGETADDR: {
4465 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4466 struct pf_nl_pooladdr npp = {};
4467
4468 npp.which = PF_RDR;
4469 memcpy(&npp, pp, sizeof(*pp));
4470 error = pf_ioctl_get_addr(&npp);
4471 memcpy(pp, &npp, sizeof(*pp));
4472
4473 break;
4474 }
4475
4476 case DIOCCHANGEADDR: {
4477 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
4478 struct pf_kpool *pool;
4479 struct pf_kpooladdr *oldpa = NULL, *newpa = NULL;
4480 struct pf_kruleset *ruleset;
4481 struct pfi_kkif *kif = NULL;
4482
4483 pca->anchor[sizeof(pca->anchor) - 1] = 0;
4484
4485 if (pca->action < PF_CHANGE_ADD_HEAD ||
4486 pca->action > PF_CHANGE_REMOVE) {
4487 error = EINVAL;
4488 break;
4489 }
4490 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
4491 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
4492 pca->addr.addr.type != PF_ADDR_TABLE) {
4493 error = EINVAL;
4494 break;
4495 }
4496 if (pca->addr.addr.p.dyn != NULL) {
4497 error = EINVAL;
4498 break;
4499 }
4500
4501 if (pca->action != PF_CHANGE_REMOVE) {
4502 #ifndef INET
4503 if (pca->af == AF_INET) {
4504 error = EAFNOSUPPORT;
4505 break;
4506 }
4507 #endif /* INET */
4508 #ifndef INET6
4509 if (pca->af == AF_INET6) {
4510 error = EAFNOSUPPORT;
4511 break;
4512 }
4513 #endif /* INET6 */
4514 newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK);
4515 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
4516 if (newpa->ifname[0])
4517 kif = pf_kkif_create(M_WAITOK);
4518 newpa->kif = NULL;
4519 }
4520 #define ERROUT(x) ERROUT_IOCTL(DIOCCHANGEADDR_error, x)
4521 PF_RULES_WLOCK();
4522 ruleset = pf_find_kruleset(pca->anchor);
4523 if (ruleset == NULL)
4524 ERROUT(EBUSY);
4525
4526 pool = pf_get_kpool(pca->anchor, pca->ticket, pca->r_action,
4527 pca->r_num, pca->r_last, 1, 1, PF_RDR);
4528 if (pool == NULL)
4529 ERROUT(EBUSY);
4530
4531 if (pca->action != PF_CHANGE_REMOVE) {
4532 if (newpa->ifname[0]) {
4533 newpa->kif = pfi_kkif_attach(kif, newpa->ifname);
4534 pfi_kkif_ref(newpa->kif);
4535 kif = NULL;
4536 }
4537
4538 switch (newpa->addr.type) {
4539 case PF_ADDR_DYNIFTL:
4540 error = pfi_dynaddr_setup(&newpa->addr,
4541 pca->af);
4542 break;
4543 case PF_ADDR_TABLE:
4544 newpa->addr.p.tbl = pfr_attach_table(ruleset,
4545 newpa->addr.v.tblname);
4546 if (newpa->addr.p.tbl == NULL)
4547 error = ENOMEM;
4548 break;
4549 }
4550 if (error)
4551 goto DIOCCHANGEADDR_error;
4552 }
4553
4554 switch (pca->action) {
4555 case PF_CHANGE_ADD_HEAD:
4556 oldpa = TAILQ_FIRST(&pool->list);
4557 break;
4558 case PF_CHANGE_ADD_TAIL:
4559 oldpa = TAILQ_LAST(&pool->list, pf_kpalist);
4560 break;
4561 default:
4562 oldpa = TAILQ_FIRST(&pool->list);
4563 for (int i = 0; oldpa && i < pca->nr; i++)
4564 oldpa = TAILQ_NEXT(oldpa, entries);
4565
4566 if (oldpa == NULL)
4567 ERROUT(EINVAL);
4568 }
4569
4570 if (pca->action == PF_CHANGE_REMOVE) {
4571 TAILQ_REMOVE(&pool->list, oldpa, entries);
4572 switch (oldpa->addr.type) {
4573 case PF_ADDR_DYNIFTL:
4574 pfi_dynaddr_remove(oldpa->addr.p.dyn);
4575 break;
4576 case PF_ADDR_TABLE:
4577 pfr_detach_table(oldpa->addr.p.tbl);
4578 break;
4579 }
4580 if (oldpa->kif)
4581 pfi_kkif_unref(oldpa->kif);
4582 free(oldpa, M_PFRULE);
4583 } else {
4584 if (oldpa == NULL)
4585 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
4586 else if (pca->action == PF_CHANGE_ADD_HEAD ||
4587 pca->action == PF_CHANGE_ADD_BEFORE)
4588 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
4589 else
4590 TAILQ_INSERT_AFTER(&pool->list, oldpa,
4591 newpa, entries);
4592 }
4593
4594 pool->cur = TAILQ_FIRST(&pool->list);
4595 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, pca->af);
4596 PF_RULES_WUNLOCK();
4597 break;
4598
4599 #undef ERROUT
4600 DIOCCHANGEADDR_error:
4601 if (newpa != NULL) {
4602 if (newpa->kif)
4603 pfi_kkif_unref(newpa->kif);
4604 free(newpa, M_PFRULE);
4605 }
4606 PF_RULES_WUNLOCK();
4607 pf_kkif_free(kif);
4608 break;
4609 }
4610
4611 case DIOCGETRULESETS: {
4612 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
4613
4614 pr->path[sizeof(pr->path) - 1] = 0;
4615
4616 error = pf_ioctl_get_rulesets(pr);
4617 break;
4618 }
4619
4620 case DIOCGETRULESET: {
4621 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
4622
4623 pr->path[sizeof(pr->path) - 1] = 0;
4624
4625 error = pf_ioctl_get_ruleset(pr);
4626 break;
4627 }
4628
4629 case DIOCRCLRTABLES: {
4630 struct pfioc_table *io = (struct pfioc_table *)addr;
4631
4632 if (io->pfrio_esize != 0) {
4633 error = ENODEV;
4634 break;
4635 }
4636 PF_RULES_WLOCK();
4637 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
4638 io->pfrio_flags | PFR_FLAG_USERIOCTL);
4639 PF_RULES_WUNLOCK();
4640 break;
4641 }
4642
4643 case DIOCRADDTABLES: {
4644 struct pfioc_table *io = (struct pfioc_table *)addr;
4645 struct pfr_table *pfrts;
4646 size_t totlen;
4647
4648 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4649 error = ENODEV;
4650 break;
4651 }
4652
4653 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4654 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4655 error = ENOMEM;
4656 break;
4657 }
4658
4659 totlen = io->pfrio_size * sizeof(struct pfr_table);
4660 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4661 M_TEMP, M_WAITOK);
4662 error = copyin(io->pfrio_buffer, pfrts, totlen);
4663 if (error) {
4664 free(pfrts, M_TEMP);
4665 break;
4666 }
4667 PF_RULES_WLOCK();
4668 error = pfr_add_tables(pfrts, io->pfrio_size,
4669 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4670 PF_RULES_WUNLOCK();
4671 free(pfrts, M_TEMP);
4672 break;
4673 }
4674
4675 case DIOCRDELTABLES: {
4676 struct pfioc_table *io = (struct pfioc_table *)addr;
4677 struct pfr_table *pfrts;
4678 size_t totlen;
4679
4680 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4681 error = ENODEV;
4682 break;
4683 }
4684
4685 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4686 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4687 error = ENOMEM;
4688 break;
4689 }
4690
4691 totlen = io->pfrio_size * sizeof(struct pfr_table);
4692 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4693 M_TEMP, M_WAITOK);
4694 error = copyin(io->pfrio_buffer, pfrts, totlen);
4695 if (error) {
4696 free(pfrts, M_TEMP);
4697 break;
4698 }
4699 PF_RULES_WLOCK();
4700 error = pfr_del_tables(pfrts, io->pfrio_size,
4701 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4702 PF_RULES_WUNLOCK();
4703 free(pfrts, M_TEMP);
4704 break;
4705 }
4706
4707 case DIOCRGETTABLES: {
4708 struct pfioc_table *io = (struct pfioc_table *)addr;
4709 struct pfr_table *pfrts;
4710 size_t totlen;
4711 int n;
4712
4713 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4714 error = ENODEV;
4715 break;
4716 }
4717 PF_RULES_RLOCK();
4718 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4719 if (n < 0) {
4720 PF_RULES_RUNLOCK();
4721 error = EINVAL;
4722 break;
4723 }
4724 io->pfrio_size = min(io->pfrio_size, n);
4725
4726 totlen = io->pfrio_size * sizeof(struct pfr_table);
4727
4728 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4729 M_TEMP, M_NOWAIT | M_ZERO);
4730 if (pfrts == NULL) {
4731 error = ENOMEM;
4732 PF_RULES_RUNLOCK();
4733 break;
4734 }
4735 error = pfr_get_tables(&io->pfrio_table, pfrts,
4736 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4737 PF_RULES_RUNLOCK();
4738 if (error == 0)
4739 error = copyout(pfrts, io->pfrio_buffer, totlen);
4740 free(pfrts, M_TEMP);
4741 break;
4742 }
4743
4744 case DIOCRGETTSTATS: {
4745 struct pfioc_table *io = (struct pfioc_table *)addr;
4746 struct pfr_tstats *pfrtstats;
4747 size_t totlen;
4748 int n;
4749
4750 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
4751 error = ENODEV;
4752 break;
4753 }
4754 PF_TABLE_STATS_LOCK();
4755 PF_RULES_RLOCK();
4756 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4757 if (n < 0) {
4758 PF_RULES_RUNLOCK();
4759 PF_TABLE_STATS_UNLOCK();
4760 error = EINVAL;
4761 break;
4762 }
4763 io->pfrio_size = min(io->pfrio_size, n);
4764
4765 totlen = io->pfrio_size * sizeof(struct pfr_tstats);
4766 pfrtstats = mallocarray(io->pfrio_size,
4767 sizeof(struct pfr_tstats), M_TEMP, M_NOWAIT | M_ZERO);
4768 if (pfrtstats == NULL) {
4769 error = ENOMEM;
4770 PF_RULES_RUNLOCK();
4771 PF_TABLE_STATS_UNLOCK();
4772 break;
4773 }
4774 error = pfr_get_tstats(&io->pfrio_table, pfrtstats,
4775 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4776 PF_RULES_RUNLOCK();
4777 PF_TABLE_STATS_UNLOCK();
4778 if (error == 0)
4779 error = copyout(pfrtstats, io->pfrio_buffer, totlen);
4780 free(pfrtstats, M_TEMP);
4781 break;
4782 }
4783
4784 case DIOCRCLRTSTATS: {
4785 struct pfioc_table *io = (struct pfioc_table *)addr;
4786 struct pfr_table *pfrts;
4787 size_t totlen;
4788
4789 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4790 error = ENODEV;
4791 break;
4792 }
4793
4794 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4795 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4796 /* We used to count tables and use the minimum required
4797 * size, so we didn't fail on overly large requests.
4798 * Keep doing so. */
4799 io->pfrio_size = pf_ioctl_maxcount;
4800 break;
4801 }
4802
4803 totlen = io->pfrio_size * sizeof(struct pfr_table);
4804 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4805 M_TEMP, M_WAITOK);
4806 error = copyin(io->pfrio_buffer, pfrts, totlen);
4807 if (error) {
4808 free(pfrts, M_TEMP);
4809 break;
4810 }
4811
4812 PF_TABLE_STATS_LOCK();
4813 PF_RULES_RLOCK();
4814 error = pfr_clr_tstats(pfrts, io->pfrio_size,
4815 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4816 PF_RULES_RUNLOCK();
4817 PF_TABLE_STATS_UNLOCK();
4818 free(pfrts, M_TEMP);
4819 break;
4820 }
4821
4822 case DIOCRSETTFLAGS: {
4823 struct pfioc_table *io = (struct pfioc_table *)addr;
4824 struct pfr_table *pfrts;
4825 size_t totlen;
4826 int n;
4827
4828 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4829 error = ENODEV;
4830 break;
4831 }
4832
4833 PF_RULES_RLOCK();
4834 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4835 if (n < 0) {
4836 PF_RULES_RUNLOCK();
4837 error = EINVAL;
4838 break;
4839 }
4840
4841 io->pfrio_size = min(io->pfrio_size, n);
4842 PF_RULES_RUNLOCK();
4843
4844 totlen = io->pfrio_size * sizeof(struct pfr_table);
4845 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4846 M_TEMP, M_WAITOK);
4847 error = copyin(io->pfrio_buffer, pfrts, totlen);
4848 if (error) {
4849 free(pfrts, M_TEMP);
4850 break;
4851 }
4852 PF_RULES_WLOCK();
4853 error = pfr_set_tflags(pfrts, io->pfrio_size,
4854 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
4855 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4856 PF_RULES_WUNLOCK();
4857 free(pfrts, M_TEMP);
4858 break;
4859 }
4860
4861 case DIOCRCLRADDRS: {
4862 struct pfioc_table *io = (struct pfioc_table *)addr;
4863
4864 if (io->pfrio_esize != 0) {
4865 error = ENODEV;
4866 break;
4867 }
4868 PF_RULES_WLOCK();
4869 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
4870 io->pfrio_flags | PFR_FLAG_USERIOCTL);
4871 PF_RULES_WUNLOCK();
4872 break;
4873 }
4874
4875 case DIOCRADDADDRS: {
4876 struct pfioc_table *io = (struct pfioc_table *)addr;
4877 struct pfr_addr *pfras;
4878 size_t totlen;
4879
4880 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4881 error = ENODEV;
4882 break;
4883 }
4884 if (io->pfrio_size < 0 ||
4885 io->pfrio_size > pf_ioctl_maxcount ||
4886 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
4887 error = EINVAL;
4888 break;
4889 }
4890 totlen = io->pfrio_size * sizeof(struct pfr_addr);
4891 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
4892 M_TEMP, M_WAITOK);
4893 error = copyin(io->pfrio_buffer, pfras, totlen);
4894 if (error) {
4895 free(pfras, M_TEMP);
4896 break;
4897 }
4898 PF_RULES_WLOCK();
4899 error = pfr_add_addrs(&io->pfrio_table, pfras,
4900 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
4901 PFR_FLAG_USERIOCTL);
4902 PF_RULES_WUNLOCK();
4903 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
4904 error = copyout(pfras, io->pfrio_buffer, totlen);
4905 free(pfras, M_TEMP);
4906 break;
4907 }
4908
4909 case DIOCRDELADDRS: {
4910 struct pfioc_table *io = (struct pfioc_table *)addr;
4911 struct pfr_addr *pfras;
4912 size_t totlen;
4913
4914 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4915 error = ENODEV;
4916 break;
4917 }
4918 if (io->pfrio_size < 0 ||
4919 io->pfrio_size > pf_ioctl_maxcount ||
4920 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
4921 error = EINVAL;
4922 break;
4923 }
4924 totlen = io->pfrio_size * sizeof(struct pfr_addr);
4925 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
4926 M_TEMP, M_WAITOK);
4927 error = copyin(io->pfrio_buffer, pfras, totlen);
4928 if (error) {
4929 free(pfras, M_TEMP);
4930 break;
4931 }
4932 PF_RULES_WLOCK();
4933 error = pfr_del_addrs(&io->pfrio_table, pfras,
4934 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
4935 PFR_FLAG_USERIOCTL);
4936 PF_RULES_WUNLOCK();
4937 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
4938 error = copyout(pfras, io->pfrio_buffer, totlen);
4939 free(pfras, M_TEMP);
4940 break;
4941 }
4942
4943 case DIOCRSETADDRS: {
4944 struct pfioc_table *io = (struct pfioc_table *)addr;
4945 struct pfr_addr *pfras;
4946 size_t totlen, count;
4947
4948 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4949 error = ENODEV;
4950 break;
4951 }
4952 if (io->pfrio_size < 0 || io->pfrio_size2 < 0) {
4953 error = EINVAL;
4954 break;
4955 }
4956 count = max(io->pfrio_size, io->pfrio_size2);
4957 if (count > pf_ioctl_maxcount ||
4958 WOULD_OVERFLOW(count, sizeof(struct pfr_addr))) {
4959 error = EINVAL;
4960 break;
4961 }
4962 totlen = count * sizeof(struct pfr_addr);
4963 pfras = mallocarray(count, sizeof(struct pfr_addr), M_TEMP,
4964 M_WAITOK);
4965 error = copyin(io->pfrio_buffer, pfras, totlen);
4966 if (error) {
4967 free(pfras, M_TEMP);
4968 break;
4969 }
4970 PF_RULES_WLOCK();
4971 error = pfr_set_addrs(&io->pfrio_table, pfras,
4972 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
4973 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
4974 PFR_FLAG_USERIOCTL, 0);
4975 PF_RULES_WUNLOCK();
4976 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
4977 error = copyout(pfras, io->pfrio_buffer, totlen);
4978 free(pfras, M_TEMP);
4979 break;
4980 }
4981
4982 case DIOCRGETADDRS: {
4983 struct pfioc_table *io = (struct pfioc_table *)addr;
4984 struct pfr_addr *pfras;
4985 size_t totlen;
4986
4987 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4988 error = ENODEV;
4989 break;
4990 }
4991 if (io->pfrio_size < 0 ||
4992 io->pfrio_size > pf_ioctl_maxcount ||
4993 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
4994 error = EINVAL;
4995 break;
4996 }
4997 totlen = io->pfrio_size * sizeof(struct pfr_addr);
4998 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
4999 M_TEMP, M_WAITOK | M_ZERO);
5000 PF_RULES_RLOCK();
5001 error = pfr_get_addrs(&io->pfrio_table, pfras,
5002 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5003 PF_RULES_RUNLOCK();
5004 if (error == 0)
5005 error = copyout(pfras, io->pfrio_buffer, totlen);
5006 free(pfras, M_TEMP);
5007 break;
5008 }
5009
5010 case DIOCRGETASTATS: {
5011 struct pfioc_table *io = (struct pfioc_table *)addr;
5012 struct pfr_astats *pfrastats;
5013 size_t totlen;
5014
5015 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
5016 error = ENODEV;
5017 break;
5018 }
5019 if (io->pfrio_size < 0 ||
5020 io->pfrio_size > pf_ioctl_maxcount ||
5021 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_astats))) {
5022 error = EINVAL;
5023 break;
5024 }
5025 totlen = io->pfrio_size * sizeof(struct pfr_astats);
5026 pfrastats = mallocarray(io->pfrio_size,
5027 sizeof(struct pfr_astats), M_TEMP, M_WAITOK | M_ZERO);
5028 PF_RULES_RLOCK();
5029 error = pfr_get_astats(&io->pfrio_table, pfrastats,
5030 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5031 PF_RULES_RUNLOCK();
5032 if (error == 0)
5033 error = copyout(pfrastats, io->pfrio_buffer, totlen);
5034 free(pfrastats, M_TEMP);
5035 break;
5036 }
5037
5038 case DIOCRCLRASTATS: {
5039 struct pfioc_table *io = (struct pfioc_table *)addr;
5040 struct pfr_addr *pfras;
5041 size_t totlen;
5042
5043 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5044 error = ENODEV;
5045 break;
5046 }
5047 if (io->pfrio_size < 0 ||
5048 io->pfrio_size > pf_ioctl_maxcount ||
5049 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5050 error = EINVAL;
5051 break;
5052 }
5053 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5054 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5055 M_TEMP, M_WAITOK);
5056 error = copyin(io->pfrio_buffer, pfras, totlen);
5057 if (error) {
5058 free(pfras, M_TEMP);
5059 break;
5060 }
5061 PF_RULES_WLOCK();
5062 error = pfr_clr_astats(&io->pfrio_table, pfras,
5063 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
5064 PFR_FLAG_USERIOCTL);
5065 PF_RULES_WUNLOCK();
5066 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
5067 error = copyout(pfras, io->pfrio_buffer, totlen);
5068 free(pfras, M_TEMP);
5069 break;
5070 }
5071
5072 case DIOCRTSTADDRS: {
5073 struct pfioc_table *io = (struct pfioc_table *)addr;
5074 struct pfr_addr *pfras;
5075 size_t totlen;
5076
5077 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5078 error = ENODEV;
5079 break;
5080 }
5081 if (io->pfrio_size < 0 ||
5082 io->pfrio_size > pf_ioctl_maxcount ||
5083 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5084 error = EINVAL;
5085 break;
5086 }
5087 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5088 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5089 M_TEMP, M_WAITOK);
5090 error = copyin(io->pfrio_buffer, pfras, totlen);
5091 if (error) {
5092 free(pfras, M_TEMP);
5093 break;
5094 }
5095 PF_RULES_RLOCK();
5096 error = pfr_tst_addrs(&io->pfrio_table, pfras,
5097 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
5098 PFR_FLAG_USERIOCTL);
5099 PF_RULES_RUNLOCK();
5100 if (error == 0)
5101 error = copyout(pfras, io->pfrio_buffer, totlen);
5102 free(pfras, M_TEMP);
5103 break;
5104 }
5105
5106 case DIOCRINADEFINE: {
5107 struct pfioc_table *io = (struct pfioc_table *)addr;
5108 struct pfr_addr *pfras;
5109 size_t totlen;
5110
5111 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5112 error = ENODEV;
5113 break;
5114 }
5115 if (io->pfrio_size < 0 ||
5116 io->pfrio_size > pf_ioctl_maxcount ||
5117 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5118 error = EINVAL;
5119 break;
5120 }
5121 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5122 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5123 M_TEMP, M_WAITOK);
5124 error = copyin(io->pfrio_buffer, pfras, totlen);
5125 if (error) {
5126 free(pfras, M_TEMP);
5127 break;
5128 }
5129 PF_RULES_WLOCK();
5130 error = pfr_ina_define(&io->pfrio_table, pfras,
5131 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
5132 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5133 PF_RULES_WUNLOCK();
5134 free(pfras, M_TEMP);
5135 break;
5136 }
5137
5138 case DIOCOSFPADD: {
5139 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
5140 PF_RULES_WLOCK();
5141 error = pf_osfp_add(io);
5142 PF_RULES_WUNLOCK();
5143 break;
5144 }
5145
5146 case DIOCOSFPGET: {
5147 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
5148 PF_RULES_RLOCK();
5149 error = pf_osfp_get(io);
5150 PF_RULES_RUNLOCK();
5151 break;
5152 }
5153
5154 case DIOCXBEGIN: {
5155 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5156 struct pfioc_trans_e *ioes, *ioe;
5157 size_t totlen;
5158 int i;
5159
5160 if (io->esize != sizeof(*ioe)) {
5161 error = ENODEV;
5162 break;
5163 }
5164 if (io->size < 0 ||
5165 io->size > pf_ioctl_maxcount ||
5166 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5167 error = EINVAL;
5168 break;
5169 }
5170 totlen = sizeof(struct pfioc_trans_e) * io->size;
5171 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5172 M_TEMP, M_WAITOK);
5173 error = copyin(io->array, ioes, totlen);
5174 if (error) {
5175 free(ioes, M_TEMP);
5176 break;
5177 }
5178 PF_RULES_WLOCK();
5179 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5180 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0';
5181 switch (ioe->rs_num) {
5182 case PF_RULESET_ETH:
5183 if ((error = pf_begin_eth(&ioe->ticket, ioe->anchor))) {
5184 PF_RULES_WUNLOCK();
5185 free(ioes, M_TEMP);
5186 goto fail;
5187 }
5188 break;
5189 #ifdef ALTQ
5190 case PF_RULESET_ALTQ:
5191 if (ioe->anchor[0]) {
5192 PF_RULES_WUNLOCK();
5193 free(ioes, M_TEMP);
5194 error = EINVAL;
5195 goto fail;
5196 }
5197 if ((error = pf_begin_altq(&ioe->ticket))) {
5198 PF_RULES_WUNLOCK();
5199 free(ioes, M_TEMP);
5200 goto fail;
5201 }
5202 break;
5203 #endif /* ALTQ */
5204 case PF_RULESET_TABLE:
5205 {
5206 struct pfr_table table;
5207
5208 bzero(&table, sizeof(table));
5209 strlcpy(table.pfrt_anchor, ioe->anchor,
5210 sizeof(table.pfrt_anchor));
5211 if ((error = pfr_ina_begin(&table,
5212 &ioe->ticket, NULL, 0))) {
5213 PF_RULES_WUNLOCK();
5214 free(ioes, M_TEMP);
5215 goto fail;
5216 }
5217 break;
5218 }
5219 default:
5220 if ((error = pf_begin_rules(&ioe->ticket,
5221 ioe->rs_num, ioe->anchor))) {
5222 PF_RULES_WUNLOCK();
5223 free(ioes, M_TEMP);
5224 goto fail;
5225 }
5226 break;
5227 }
5228 }
5229 PF_RULES_WUNLOCK();
5230 error = copyout(ioes, io->array, totlen);
5231 free(ioes, M_TEMP);
5232 break;
5233 }
5234
5235 case DIOCXROLLBACK: {
5236 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5237 struct pfioc_trans_e *ioe, *ioes;
5238 size_t totlen;
5239 int i;
5240
5241 if (io->esize != sizeof(*ioe)) {
5242 error = ENODEV;
5243 break;
5244 }
5245 if (io->size < 0 ||
5246 io->size > pf_ioctl_maxcount ||
5247 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5248 error = EINVAL;
5249 break;
5250 }
5251 totlen = sizeof(struct pfioc_trans_e) * io->size;
5252 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5253 M_TEMP, M_WAITOK);
5254 error = copyin(io->array, ioes, totlen);
5255 if (error) {
5256 free(ioes, M_TEMP);
5257 break;
5258 }
5259 PF_RULES_WLOCK();
5260 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5261 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0';
5262 switch (ioe->rs_num) {
5263 case PF_RULESET_ETH:
5264 if ((error = pf_rollback_eth(ioe->ticket,
5265 ioe->anchor))) {
5266 PF_RULES_WUNLOCK();
5267 free(ioes, M_TEMP);
5268 goto fail; /* really bad */
5269 }
5270 break;
5271 #ifdef ALTQ
5272 case PF_RULESET_ALTQ:
5273 if (ioe->anchor[0]) {
5274 PF_RULES_WUNLOCK();
5275 free(ioes, M_TEMP);
5276 error = EINVAL;
5277 goto fail;
5278 }
5279 if ((error = pf_rollback_altq(ioe->ticket))) {
5280 PF_RULES_WUNLOCK();
5281 free(ioes, M_TEMP);
5282 goto fail; /* really bad */
5283 }
5284 break;
5285 #endif /* ALTQ */
5286 case PF_RULESET_TABLE:
5287 {
5288 struct pfr_table table;
5289
5290 bzero(&table, sizeof(table));
5291 strlcpy(table.pfrt_anchor, ioe->anchor,
5292 sizeof(table.pfrt_anchor));
5293 if ((error = pfr_ina_rollback(&table,
5294 ioe->ticket, NULL, 0))) {
5295 PF_RULES_WUNLOCK();
5296 free(ioes, M_TEMP);
5297 goto fail; /* really bad */
5298 }
5299 break;
5300 }
5301 default:
5302 if ((error = pf_rollback_rules(ioe->ticket,
5303 ioe->rs_num, ioe->anchor))) {
5304 PF_RULES_WUNLOCK();
5305 free(ioes, M_TEMP);
5306 goto fail; /* really bad */
5307 }
5308 break;
5309 }
5310 }
5311 PF_RULES_WUNLOCK();
5312 free(ioes, M_TEMP);
5313 break;
5314 }
5315
5316 case DIOCXCOMMIT: {
5317 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5318 struct pfioc_trans_e *ioe, *ioes;
5319 struct pf_kruleset *rs;
5320 struct pf_keth_ruleset *ers;
5321 size_t totlen;
5322 int i;
5323
5324 if (io->esize != sizeof(*ioe)) {
5325 error = ENODEV;
5326 break;
5327 }
5328
5329 if (io->size < 0 ||
5330 io->size > pf_ioctl_maxcount ||
5331 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5332 error = EINVAL;
5333 break;
5334 }
5335
5336 totlen = sizeof(struct pfioc_trans_e) * io->size;
5337 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5338 M_TEMP, M_WAITOK);
5339 error = copyin(io->array, ioes, totlen);
5340 if (error) {
5341 free(ioes, M_TEMP);
5342 break;
5343 }
5344 PF_RULES_WLOCK();
5345 /* First makes sure everything will succeed. */
5346 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5347 ioe->anchor[sizeof(ioe->anchor) - 1] = 0;
5348 switch (ioe->rs_num) {
5349 case PF_RULESET_ETH:
5350 ers = pf_find_keth_ruleset(ioe->anchor);
5351 if (ers == NULL || ioe->ticket == 0 ||
5352 ioe->ticket != ers->inactive.ticket) {
5353 PF_RULES_WUNLOCK();
5354 free(ioes, M_TEMP);
5355 error = EINVAL;
5356 goto fail;
5357 }
5358 break;
5359 #ifdef ALTQ
5360 case PF_RULESET_ALTQ:
5361 if (ioe->anchor[0]) {
5362 PF_RULES_WUNLOCK();
5363 free(ioes, M_TEMP);
5364 error = EINVAL;
5365 goto fail;
5366 }
5367 if (!V_altqs_inactive_open || ioe->ticket !=
5368 V_ticket_altqs_inactive) {
5369 PF_RULES_WUNLOCK();
5370 free(ioes, M_TEMP);
5371 error = EBUSY;
5372 goto fail;
5373 }
5374 break;
5375 #endif /* ALTQ */
5376 case PF_RULESET_TABLE:
5377 rs = pf_find_kruleset(ioe->anchor);
5378 if (rs == NULL || !rs->topen || ioe->ticket !=
5379 rs->tticket) {
5380 PF_RULES_WUNLOCK();
5381 free(ioes, M_TEMP);
5382 error = EBUSY;
5383 goto fail;
5384 }
5385 break;
5386 default:
5387 if (ioe->rs_num < 0 || ioe->rs_num >=
5388 PF_RULESET_MAX) {
5389 PF_RULES_WUNLOCK();
5390 free(ioes, M_TEMP);
5391 error = EINVAL;
5392 goto fail;
5393 }
5394 rs = pf_find_kruleset(ioe->anchor);
5395 if (rs == NULL ||
5396 !rs->rules[ioe->rs_num].inactive.open ||
5397 rs->rules[ioe->rs_num].inactive.ticket !=
5398 ioe->ticket) {
5399 PF_RULES_WUNLOCK();
5400 free(ioes, M_TEMP);
5401 error = EBUSY;
5402 goto fail;
5403 }
5404 break;
5405 }
5406 }
5407 /* Now do the commit - no errors should happen here. */
5408 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5409 switch (ioe->rs_num) {
5410 case PF_RULESET_ETH:
5411 if ((error = pf_commit_eth(ioe->ticket, ioe->anchor))) {
5412 PF_RULES_WUNLOCK();
5413 free(ioes, M_TEMP);
5414 goto fail; /* really bad */
5415 }
5416 break;
5417 #ifdef ALTQ
5418 case PF_RULESET_ALTQ:
5419 if ((error = pf_commit_altq(ioe->ticket))) {
5420 PF_RULES_WUNLOCK();
5421 free(ioes, M_TEMP);
5422 goto fail; /* really bad */
5423 }
5424 break;
5425 #endif /* ALTQ */
5426 case PF_RULESET_TABLE:
5427 {
5428 struct pfr_table table;
5429
5430 bzero(&table, sizeof(table));
5431 (void)strlcpy(table.pfrt_anchor, ioe->anchor,
5432 sizeof(table.pfrt_anchor));
5433 if ((error = pfr_ina_commit(&table,
5434 ioe->ticket, NULL, NULL, 0))) {
5435 PF_RULES_WUNLOCK();
5436 free(ioes, M_TEMP);
5437 goto fail; /* really bad */
5438 }
5439 break;
5440 }
5441 default:
5442 if ((error = pf_commit_rules(ioe->ticket,
5443 ioe->rs_num, ioe->anchor))) {
5444 PF_RULES_WUNLOCK();
5445 free(ioes, M_TEMP);
5446 goto fail; /* really bad */
5447 }
5448 break;
5449 }
5450 }
5451 PF_RULES_WUNLOCK();
5452
5453 /* Only hook into EtherNet taffic if we've got rules for it. */
5454 if (! TAILQ_EMPTY(V_pf_keth->active.rules))
5455 hook_pf_eth();
5456 else
5457 dehook_pf_eth();
5458
5459 free(ioes, M_TEMP);
5460 break;
5461 }
5462
5463 case DIOCGETSRCNODES: {
5464 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
5465 struct pf_srchash *sh;
5466 struct pf_ksrc_node *n;
5467 struct pf_src_node *p, *pstore;
5468 uint32_t i, nr = 0;
5469
5470 for (i = 0, sh = V_pf_srchash; i <= V_pf_srchashmask;
5471 i++, sh++) {
5472 PF_HASHROW_LOCK(sh);
5473 LIST_FOREACH(n, &sh->nodes, entry)
5474 nr++;
5475 PF_HASHROW_UNLOCK(sh);
5476 }
5477
5478 psn->psn_len = min(psn->psn_len,
5479 sizeof(struct pf_src_node) * nr);
5480
5481 if (psn->psn_len == 0) {
5482 psn->psn_len = sizeof(struct pf_src_node) * nr;
5483 break;
5484 }
5485
5486 nr = 0;
5487
5488 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK | M_ZERO);
5489 for (i = 0, sh = V_pf_srchash; i <= V_pf_srchashmask;
5490 i++, sh++) {
5491 PF_HASHROW_LOCK(sh);
5492 LIST_FOREACH(n, &sh->nodes, entry) {
5493
5494 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
5495 break;
5496
5497 pf_src_node_copy(n, p);
5498
5499 p++;
5500 nr++;
5501 }
5502 PF_HASHROW_UNLOCK(sh);
5503 }
5504 error = copyout(pstore, psn->psn_src_nodes,
5505 sizeof(struct pf_src_node) * nr);
5506 if (error) {
5507 free(pstore, M_TEMP);
5508 break;
5509 }
5510 psn->psn_len = sizeof(struct pf_src_node) * nr;
5511 free(pstore, M_TEMP);
5512 break;
5513 }
5514
5515 case DIOCCLRSRCNODES: {
5516 pf_kill_srcnodes(NULL);
5517 break;
5518 }
5519
5520 case DIOCKILLSRCNODES:
5521 pf_kill_srcnodes((struct pfioc_src_node_kill *)addr);
5522 break;
5523
5524 #ifdef COMPAT_FREEBSD13
5525 case DIOCKEEPCOUNTERS_FREEBSD13:
5526 #endif
5527 case DIOCKEEPCOUNTERS:
5528 error = pf_keepcounters((struct pfioc_nv *)addr);
5529 break;
5530
5531 case DIOCGETSYNCOOKIES:
5532 error = pf_get_syncookies((struct pfioc_nv *)addr);
5533 break;
5534
5535 case DIOCSETSYNCOOKIES:
5536 error = pf_set_syncookies((struct pfioc_nv *)addr);
5537 break;
5538
5539 case DIOCSETHOSTID: {
5540 u_int32_t *hostid = (u_int32_t *)addr;
5541
5542 PF_RULES_WLOCK();
5543 if (*hostid == 0)
5544 V_pf_status.hostid = arc4random();
5545 else
5546 V_pf_status.hostid = *hostid;
5547 PF_RULES_WUNLOCK();
5548 break;
5549 }
5550
5551 case DIOCOSFPFLUSH:
5552 PF_RULES_WLOCK();
5553 pf_osfp_flush();
5554 PF_RULES_WUNLOCK();
5555 break;
5556
5557 case DIOCIGETIFACES: {
5558 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5559 struct pfi_kif *ifstore;
5560 size_t bufsiz;
5561
5562 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
5563 error = ENODEV;
5564 break;
5565 }
5566
5567 if (io->pfiio_size < 0 ||
5568 io->pfiio_size > pf_ioctl_maxcount ||
5569 WOULD_OVERFLOW(io->pfiio_size, sizeof(struct pfi_kif))) {
5570 error = EINVAL;
5571 break;
5572 }
5573
5574 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5575
5576 bufsiz = io->pfiio_size * sizeof(struct pfi_kif);
5577 ifstore = mallocarray(io->pfiio_size, sizeof(struct pfi_kif),
5578 M_TEMP, M_WAITOK | M_ZERO);
5579
5580 PF_RULES_RLOCK();
5581 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size);
5582 PF_RULES_RUNLOCK();
5583 error = copyout(ifstore, io->pfiio_buffer, bufsiz);
5584 free(ifstore, M_TEMP);
5585 break;
5586 }
5587
5588 case DIOCSETIFFLAG: {
5589 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5590
5591 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5592
5593 PF_RULES_WLOCK();
5594 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
5595 PF_RULES_WUNLOCK();
5596 break;
5597 }
5598
5599 case DIOCCLRIFFLAG: {
5600 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5601
5602 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5603
5604 PF_RULES_WLOCK();
5605 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
5606 PF_RULES_WUNLOCK();
5607 break;
5608 }
5609
5610 case DIOCSETREASS: {
5611 u_int32_t *reass = (u_int32_t *)addr;
5612
5613 V_pf_status.reass = *reass & (PF_REASS_ENABLED|PF_REASS_NODF);
5614 /* Removal of DF flag without reassembly enabled is not a
5615 * valid combination. Disable reassembly in such case. */
5616 if (!(V_pf_status.reass & PF_REASS_ENABLED))
5617 V_pf_status.reass = 0;
5618 break;
5619 }
5620
5621 default:
5622 error = ENODEV;
5623 break;
5624 }
5625 fail:
5626 CURVNET_RESTORE();
5627
5628 #undef ERROUT_IOCTL
5629
5630 return (error);
5631 }
5632
5633 void
pfsync_state_export(union pfsync_state_union * sp,struct pf_kstate * st,int msg_version)5634 pfsync_state_export(union pfsync_state_union *sp, struct pf_kstate *st, int msg_version)
5635 {
5636 bzero(sp, sizeof(union pfsync_state_union));
5637
5638 /* copy from state key */
5639 sp->pfs_1301.key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
5640 sp->pfs_1301.key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
5641 sp->pfs_1301.key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
5642 sp->pfs_1301.key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
5643 sp->pfs_1301.key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
5644 sp->pfs_1301.key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
5645 sp->pfs_1301.key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
5646 sp->pfs_1301.key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
5647 sp->pfs_1301.proto = st->key[PF_SK_WIRE]->proto;
5648 sp->pfs_1301.af = st->key[PF_SK_WIRE]->af;
5649
5650 /* copy from state */
5651 strlcpy(sp->pfs_1301.ifname, st->kif->pfik_name, sizeof(sp->pfs_1301.ifname));
5652 bcopy(&st->act.rt_addr, &sp->pfs_1301.rt_addr, sizeof(sp->pfs_1301.rt_addr));
5653 sp->pfs_1301.creation = htonl(time_uptime - (st->creation / 1000));
5654 sp->pfs_1301.expire = pf_state_expires(st);
5655 if (sp->pfs_1301.expire <= time_uptime)
5656 sp->pfs_1301.expire = htonl(0);
5657 else
5658 sp->pfs_1301.expire = htonl(sp->pfs_1301.expire - time_uptime);
5659
5660 sp->pfs_1301.direction = st->direction;
5661 sp->pfs_1301.log = st->act.log;
5662 sp->pfs_1301.timeout = st->timeout;
5663
5664 switch (msg_version) {
5665 case PFSYNC_MSG_VERSION_1301:
5666 sp->pfs_1301.state_flags = st->state_flags;
5667 break;
5668 case PFSYNC_MSG_VERSION_1400:
5669 sp->pfs_1400.state_flags = htons(st->state_flags);
5670 sp->pfs_1400.qid = htons(st->act.qid);
5671 sp->pfs_1400.pqid = htons(st->act.pqid);
5672 sp->pfs_1400.dnpipe = htons(st->act.dnpipe);
5673 sp->pfs_1400.dnrpipe = htons(st->act.dnrpipe);
5674 sp->pfs_1400.rtableid = htonl(st->act.rtableid);
5675 sp->pfs_1400.min_ttl = st->act.min_ttl;
5676 sp->pfs_1400.set_tos = st->act.set_tos;
5677 sp->pfs_1400.max_mss = htons(st->act.max_mss);
5678 sp->pfs_1400.set_prio[0] = st->act.set_prio[0];
5679 sp->pfs_1400.set_prio[1] = st->act.set_prio[1];
5680 sp->pfs_1400.rt = st->act.rt;
5681 if (st->act.rt_kif)
5682 strlcpy(sp->pfs_1400.rt_ifname,
5683 st->act.rt_kif->pfik_name,
5684 sizeof(sp->pfs_1400.rt_ifname));
5685 break;
5686 default:
5687 panic("%s: Unsupported pfsync_msg_version %d",
5688 __func__, msg_version);
5689 }
5690
5691 /*
5692 * XXX Why do we bother pfsyncing source node information if source
5693 * nodes are not synced? Showing users that there is source tracking
5694 * when there is none seems useless.
5695 */
5696 if (st->sns[PF_SN_LIMIT] != NULL)
5697 sp->pfs_1301.sync_flags |= PFSYNC_FLAG_SRCNODE;
5698 if (st->sns[PF_SN_NAT] != NULL || st->sns[PF_SN_ROUTE])
5699 sp->pfs_1301.sync_flags |= PFSYNC_FLAG_NATSRCNODE;
5700
5701 sp->pfs_1301.id = st->id;
5702 sp->pfs_1301.creatorid = st->creatorid;
5703 pf_state_peer_hton(&st->src, &sp->pfs_1301.src);
5704 pf_state_peer_hton(&st->dst, &sp->pfs_1301.dst);
5705
5706 if (st->rule == NULL)
5707 sp->pfs_1301.rule = htonl(-1);
5708 else
5709 sp->pfs_1301.rule = htonl(st->rule->nr);
5710 if (st->anchor == NULL)
5711 sp->pfs_1301.anchor = htonl(-1);
5712 else
5713 sp->pfs_1301.anchor = htonl(st->anchor->nr);
5714 if (st->nat_rule == NULL)
5715 sp->pfs_1301.nat_rule = htonl(-1);
5716 else
5717 sp->pfs_1301.nat_rule = htonl(st->nat_rule->nr);
5718
5719 pf_state_counter_hton(st->packets[0], sp->pfs_1301.packets[0]);
5720 pf_state_counter_hton(st->packets[1], sp->pfs_1301.packets[1]);
5721 pf_state_counter_hton(st->bytes[0], sp->pfs_1301.bytes[0]);
5722 pf_state_counter_hton(st->bytes[1], sp->pfs_1301.bytes[1]);
5723 }
5724
5725 void
pf_state_export(struct pf_state_export * sp,struct pf_kstate * st)5726 pf_state_export(struct pf_state_export *sp, struct pf_kstate *st)
5727 {
5728 bzero(sp, sizeof(*sp));
5729
5730 sp->version = PF_STATE_VERSION;
5731
5732 /* copy from state key */
5733 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
5734 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
5735 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
5736 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
5737 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
5738 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
5739 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
5740 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
5741 sp->proto = st->key[PF_SK_WIRE]->proto;
5742 sp->af = st->key[PF_SK_WIRE]->af;
5743
5744 /* copy from state */
5745 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname));
5746 strlcpy(sp->orig_ifname, st->orig_kif->pfik_name,
5747 sizeof(sp->orig_ifname));
5748 memcpy(&sp->rt_addr, &st->act.rt_addr, sizeof(sp->rt_addr));
5749 sp->creation = htonl(time_uptime - (st->creation / 1000));
5750 sp->expire = pf_state_expires(st);
5751 if (sp->expire <= time_uptime)
5752 sp->expire = htonl(0);
5753 else
5754 sp->expire = htonl(sp->expire - time_uptime);
5755
5756 sp->direction = st->direction;
5757 sp->log = st->act.log;
5758 sp->timeout = st->timeout;
5759 /* 8 bits for the old libpfctl, 16 bits for the new libpfctl */
5760 sp->state_flags_compat = st->state_flags;
5761 sp->state_flags = htons(st->state_flags);
5762 if (st->sns[PF_SN_LIMIT] != NULL)
5763 sp->sync_flags |= PFSYNC_FLAG_SRCNODE;
5764 if (st->sns[PF_SN_NAT] != NULL || st->sns[PF_SN_ROUTE] != NULL)
5765 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE;
5766 sp->id = st->id;
5767 sp->creatorid = st->creatorid;
5768 pf_state_peer_hton(&st->src, &sp->src);
5769 pf_state_peer_hton(&st->dst, &sp->dst);
5770
5771 if (st->rule == NULL)
5772 sp->rule = htonl(-1);
5773 else
5774 sp->rule = htonl(st->rule->nr);
5775 if (st->anchor == NULL)
5776 sp->anchor = htonl(-1);
5777 else
5778 sp->anchor = htonl(st->anchor->nr);
5779 if (st->nat_rule == NULL)
5780 sp->nat_rule = htonl(-1);
5781 else
5782 sp->nat_rule = htonl(st->nat_rule->nr);
5783
5784 sp->packets[0] = st->packets[0];
5785 sp->packets[1] = st->packets[1];
5786 sp->bytes[0] = st->bytes[0];
5787 sp->bytes[1] = st->bytes[1];
5788
5789 sp->qid = htons(st->act.qid);
5790 sp->pqid = htons(st->act.pqid);
5791 sp->dnpipe = htons(st->act.dnpipe);
5792 sp->dnrpipe = htons(st->act.dnrpipe);
5793 sp->rtableid = htonl(st->act.rtableid);
5794 sp->min_ttl = st->act.min_ttl;
5795 sp->set_tos = st->act.set_tos;
5796 sp->max_mss = htons(st->act.max_mss);
5797 sp->rt = st->act.rt;
5798 if (st->act.rt_kif)
5799 strlcpy(sp->rt_ifname, st->act.rt_kif->pfik_name,
5800 sizeof(sp->rt_ifname));
5801 sp->set_prio[0] = st->act.set_prio[0];
5802 sp->set_prio[1] = st->act.set_prio[1];
5803
5804 }
5805
5806 static void
pf_tbladdr_copyout(struct pf_addr_wrap * aw)5807 pf_tbladdr_copyout(struct pf_addr_wrap *aw)
5808 {
5809 struct pfr_ktable *kt;
5810
5811 KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type));
5812
5813 kt = aw->p.tbl;
5814 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
5815 kt = kt->pfrkt_root;
5816 aw->p.tbl = NULL;
5817 aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
5818 kt->pfrkt_cnt : -1;
5819 }
5820
5821 static int
pf_add_status_counters(nvlist_t * nvl,const char * name,counter_u64_t * counters,size_t number,char ** names)5822 pf_add_status_counters(nvlist_t *nvl, const char *name, counter_u64_t *counters,
5823 size_t number, char **names)
5824 {
5825 nvlist_t *nvc;
5826
5827 nvc = nvlist_create(0);
5828 if (nvc == NULL)
5829 return (ENOMEM);
5830
5831 for (int i = 0; i < number; i++) {
5832 nvlist_append_number_array(nvc, "counters",
5833 counter_u64_fetch(counters[i]));
5834 nvlist_append_string_array(nvc, "names",
5835 names[i]);
5836 nvlist_append_number_array(nvc, "ids",
5837 i);
5838 }
5839 nvlist_add_nvlist(nvl, name, nvc);
5840 nvlist_destroy(nvc);
5841
5842 return (0);
5843 }
5844
5845 static int
pf_getstatus(struct pfioc_nv * nv)5846 pf_getstatus(struct pfioc_nv *nv)
5847 {
5848 nvlist_t *nvl = NULL, *nvc = NULL;
5849 void *nvlpacked = NULL;
5850 int error;
5851 struct pf_status s;
5852 char *pf_reasons[PFRES_MAX+1] = PFRES_NAMES;
5853 char *pf_lcounter[KLCNT_MAX+1] = KLCNT_NAMES;
5854 char *pf_fcounter[FCNT_MAX+1] = FCNT_NAMES;
5855 PF_RULES_RLOCK_TRACKER;
5856
5857 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
5858
5859 PF_RULES_RLOCK();
5860
5861 nvl = nvlist_create(0);
5862 if (nvl == NULL)
5863 ERROUT(ENOMEM);
5864
5865 nvlist_add_bool(nvl, "running", V_pf_status.running);
5866 nvlist_add_number(nvl, "since", V_pf_status.since);
5867 nvlist_add_number(nvl, "debug", V_pf_status.debug);
5868 nvlist_add_number(nvl, "hostid", V_pf_status.hostid);
5869 nvlist_add_number(nvl, "states", V_pf_status.states);
5870 nvlist_add_number(nvl, "src_nodes", V_pf_status.src_nodes);
5871 nvlist_add_number(nvl, "reass", V_pf_status.reass);
5872 nvlist_add_bool(nvl, "syncookies_active",
5873 V_pf_status.syncookies_active);
5874 nvlist_add_number(nvl, "halfopen_states", V_pf_status.states_halfopen);
5875
5876 /* counters */
5877 error = pf_add_status_counters(nvl, "counters", V_pf_status.counters,
5878 PFRES_MAX, pf_reasons);
5879 if (error != 0)
5880 ERROUT(error);
5881
5882 /* lcounters */
5883 error = pf_add_status_counters(nvl, "lcounters", V_pf_status.lcounters,
5884 KLCNT_MAX, pf_lcounter);
5885 if (error != 0)
5886 ERROUT(error);
5887
5888 /* fcounters */
5889 nvc = nvlist_create(0);
5890 if (nvc == NULL)
5891 ERROUT(ENOMEM);
5892
5893 for (int i = 0; i < FCNT_MAX; i++) {
5894 nvlist_append_number_array(nvc, "counters",
5895 pf_counter_u64_fetch(&V_pf_status.fcounters[i]));
5896 nvlist_append_string_array(nvc, "names",
5897 pf_fcounter[i]);
5898 nvlist_append_number_array(nvc, "ids",
5899 i);
5900 }
5901 nvlist_add_nvlist(nvl, "fcounters", nvc);
5902 nvlist_destroy(nvc);
5903 nvc = NULL;
5904
5905 /* scounters */
5906 error = pf_add_status_counters(nvl, "scounters", V_pf_status.scounters,
5907 SCNT_MAX, pf_fcounter);
5908 if (error != 0)
5909 ERROUT(error);
5910
5911 nvlist_add_string(nvl, "ifname", V_pf_status.ifname);
5912 nvlist_add_binary(nvl, "chksum", V_pf_status.pf_chksum,
5913 PF_MD5_DIGEST_LENGTH);
5914
5915 pfi_update_status(V_pf_status.ifname, &s);
5916
5917 /* pcounters / bcounters */
5918 for (int i = 0; i < 2; i++) {
5919 for (int j = 0; j < 2; j++) {
5920 for (int k = 0; k < 2; k++) {
5921 nvlist_append_number_array(nvl, "pcounters",
5922 s.pcounters[i][j][k]);
5923 }
5924 nvlist_append_number_array(nvl, "bcounters",
5925 s.bcounters[i][j]);
5926 }
5927 }
5928
5929 nvlpacked = nvlist_pack(nvl, &nv->len);
5930 if (nvlpacked == NULL)
5931 ERROUT(ENOMEM);
5932
5933 if (nv->size == 0)
5934 ERROUT(0);
5935 else if (nv->size < nv->len)
5936 ERROUT(ENOSPC);
5937
5938 PF_RULES_RUNLOCK();
5939 error = copyout(nvlpacked, nv->data, nv->len);
5940 goto done;
5941
5942 #undef ERROUT
5943 errout:
5944 PF_RULES_RUNLOCK();
5945 done:
5946 free(nvlpacked, M_NVLIST);
5947 nvlist_destroy(nvc);
5948 nvlist_destroy(nvl);
5949
5950 return (error);
5951 }
5952
5953 /*
5954 * XXX - Check for version mismatch!!!
5955 */
5956 static void
pf_clear_all_states(void)5957 pf_clear_all_states(void)
5958 {
5959 struct epoch_tracker et;
5960 struct pf_kstate *s;
5961 u_int i;
5962
5963 NET_EPOCH_ENTER(et);
5964 for (i = 0; i <= V_pf_hashmask; i++) {
5965 struct pf_idhash *ih = &V_pf_idhash[i];
5966 relock:
5967 PF_HASHROW_LOCK(ih);
5968 LIST_FOREACH(s, &ih->states, entry) {
5969 s->timeout = PFTM_PURGE;
5970 /* Don't send out individual delete messages. */
5971 s->state_flags |= PFSTATE_NOSYNC;
5972 pf_remove_state(s);
5973 goto relock;
5974 }
5975 PF_HASHROW_UNLOCK(ih);
5976 }
5977 NET_EPOCH_EXIT(et);
5978 }
5979
5980 static int
pf_clear_tables(void)5981 pf_clear_tables(void)
5982 {
5983 struct pfioc_table io;
5984 int error;
5985
5986 bzero(&io, sizeof(io));
5987 io.pfrio_flags |= PFR_FLAG_ALLRSETS;
5988
5989 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
5990 io.pfrio_flags);
5991
5992 return (error);
5993 }
5994
5995 static void
pf_kill_srcnodes(struct pfioc_src_node_kill * psnk)5996 pf_kill_srcnodes(struct pfioc_src_node_kill *psnk)
5997 {
5998 struct pf_ksrc_node_list kill;
5999 u_int killed;
6000
6001 LIST_INIT(&kill);
6002 for (int i = 0; i <= V_pf_srchashmask; i++) {
6003 struct pf_srchash *sh = &V_pf_srchash[i];
6004 struct pf_ksrc_node *sn, *tmp;
6005
6006 PF_HASHROW_LOCK(sh);
6007 LIST_FOREACH_SAFE(sn, &sh->nodes, entry, tmp)
6008 if (psnk == NULL ||
6009 (PF_MATCHA(psnk->psnk_src.neg,
6010 &psnk->psnk_src.addr.v.a.addr,
6011 &psnk->psnk_src.addr.v.a.mask,
6012 &sn->addr, sn->af) &&
6013 PF_MATCHA(psnk->psnk_dst.neg,
6014 &psnk->psnk_dst.addr.v.a.addr,
6015 &psnk->psnk_dst.addr.v.a.mask,
6016 &sn->raddr, sn->af))) {
6017 pf_unlink_src_node(sn);
6018 LIST_INSERT_HEAD(&kill, sn, entry);
6019 sn->expire = 1;
6020 }
6021 PF_HASHROW_UNLOCK(sh);
6022 }
6023
6024 for (int i = 0; i <= V_pf_hashmask; i++) {
6025 struct pf_idhash *ih = &V_pf_idhash[i];
6026 struct pf_kstate *s;
6027
6028 PF_HASHROW_LOCK(ih);
6029 LIST_FOREACH(s, &ih->states, entry) {
6030 for(pf_sn_types_t sn_type=0; sn_type<PF_SN_MAX;
6031 sn_type++) {
6032 if (s->sns[sn_type] &&
6033 s->sns[sn_type]->expire == 1) {
6034 s->sns[sn_type] = NULL;
6035 }
6036 }
6037 }
6038 PF_HASHROW_UNLOCK(ih);
6039 }
6040
6041 killed = pf_free_src_nodes(&kill);
6042
6043 if (psnk != NULL)
6044 psnk->psnk_killed = killed;
6045 }
6046
6047 static int
pf_keepcounters(struct pfioc_nv * nv)6048 pf_keepcounters(struct pfioc_nv *nv)
6049 {
6050 nvlist_t *nvl = NULL;
6051 void *nvlpacked = NULL;
6052 int error = 0;
6053
6054 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6055
6056 if (nv->len > pf_ioctl_maxcount)
6057 ERROUT(ENOMEM);
6058
6059 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6060 error = copyin(nv->data, nvlpacked, nv->len);
6061 if (error)
6062 ERROUT(error);
6063
6064 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6065 if (nvl == NULL)
6066 ERROUT(EBADMSG);
6067
6068 if (! nvlist_exists_bool(nvl, "keep_counters"))
6069 ERROUT(EBADMSG);
6070
6071 V_pf_status.keep_counters = nvlist_get_bool(nvl, "keep_counters");
6072
6073 on_error:
6074 nvlist_destroy(nvl);
6075 free(nvlpacked, M_NVLIST);
6076 return (error);
6077 }
6078
6079 unsigned int
pf_clear_states(const struct pf_kstate_kill * kill)6080 pf_clear_states(const struct pf_kstate_kill *kill)
6081 {
6082 struct pf_state_key_cmp match_key;
6083 struct pf_kstate *s;
6084 struct pfi_kkif *kif;
6085 int idx;
6086 unsigned int killed = 0, dir;
6087
6088 NET_EPOCH_ASSERT();
6089
6090 for (unsigned int i = 0; i <= V_pf_hashmask; i++) {
6091 struct pf_idhash *ih = &V_pf_idhash[i];
6092
6093 relock_DIOCCLRSTATES:
6094 PF_HASHROW_LOCK(ih);
6095 LIST_FOREACH(s, &ih->states, entry) {
6096 /* For floating states look at the original kif. */
6097 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif;
6098
6099 if (kill->psk_ifname[0] &&
6100 strcmp(kill->psk_ifname,
6101 kif->pfik_name))
6102 continue;
6103
6104 if (kill->psk_kill_match) {
6105 bzero(&match_key, sizeof(match_key));
6106
6107 if (s->direction == PF_OUT) {
6108 dir = PF_IN;
6109 idx = PF_SK_STACK;
6110 } else {
6111 dir = PF_OUT;
6112 idx = PF_SK_WIRE;
6113 }
6114
6115 match_key.af = s->key[idx]->af;
6116 match_key.proto = s->key[idx]->proto;
6117 PF_ACPY(&match_key.addr[0],
6118 &s->key[idx]->addr[1], match_key.af);
6119 match_key.port[0] = s->key[idx]->port[1];
6120 PF_ACPY(&match_key.addr[1],
6121 &s->key[idx]->addr[0], match_key.af);
6122 match_key.port[1] = s->key[idx]->port[0];
6123 }
6124
6125 /*
6126 * Don't send out individual
6127 * delete messages.
6128 */
6129 s->state_flags |= PFSTATE_NOSYNC;
6130 pf_remove_state(s);
6131 killed++;
6132
6133 if (kill->psk_kill_match)
6134 killed += pf_kill_matching_state(&match_key,
6135 dir);
6136
6137 goto relock_DIOCCLRSTATES;
6138 }
6139 PF_HASHROW_UNLOCK(ih);
6140 }
6141
6142 if (V_pfsync_clear_states_ptr != NULL)
6143 V_pfsync_clear_states_ptr(V_pf_status.hostid, kill->psk_ifname);
6144
6145 return (killed);
6146 }
6147
6148 void
pf_killstates(struct pf_kstate_kill * kill,unsigned int * killed)6149 pf_killstates(struct pf_kstate_kill *kill, unsigned int *killed)
6150 {
6151 struct pf_kstate *s;
6152
6153 NET_EPOCH_ASSERT();
6154 if (kill->psk_pfcmp.id) {
6155 if (kill->psk_pfcmp.creatorid == 0)
6156 kill->psk_pfcmp.creatorid = V_pf_status.hostid;
6157 if ((s = pf_find_state_byid(kill->psk_pfcmp.id,
6158 kill->psk_pfcmp.creatorid))) {
6159 pf_remove_state(s);
6160 *killed = 1;
6161 }
6162 return;
6163 }
6164
6165 for (unsigned int i = 0; i <= V_pf_hashmask; i++)
6166 *killed += pf_killstates_row(kill, &V_pf_idhash[i]);
6167 }
6168
6169 static int
pf_killstates_nv(struct pfioc_nv * nv)6170 pf_killstates_nv(struct pfioc_nv *nv)
6171 {
6172 struct pf_kstate_kill kill;
6173 struct epoch_tracker et;
6174 nvlist_t *nvl = NULL;
6175 void *nvlpacked = NULL;
6176 int error = 0;
6177 unsigned int killed = 0;
6178
6179 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6180
6181 if (nv->len > pf_ioctl_maxcount)
6182 ERROUT(ENOMEM);
6183
6184 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6185 error = copyin(nv->data, nvlpacked, nv->len);
6186 if (error)
6187 ERROUT(error);
6188
6189 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6190 if (nvl == NULL)
6191 ERROUT(EBADMSG);
6192
6193 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill);
6194 if (error)
6195 ERROUT(error);
6196
6197 NET_EPOCH_ENTER(et);
6198 pf_killstates(&kill, &killed);
6199 NET_EPOCH_EXIT(et);
6200
6201 free(nvlpacked, M_NVLIST);
6202 nvlpacked = NULL;
6203 nvlist_destroy(nvl);
6204 nvl = nvlist_create(0);
6205 if (nvl == NULL)
6206 ERROUT(ENOMEM);
6207
6208 nvlist_add_number(nvl, "killed", killed);
6209
6210 nvlpacked = nvlist_pack(nvl, &nv->len);
6211 if (nvlpacked == NULL)
6212 ERROUT(ENOMEM);
6213
6214 if (nv->size == 0)
6215 ERROUT(0);
6216 else if (nv->size < nv->len)
6217 ERROUT(ENOSPC);
6218
6219 error = copyout(nvlpacked, nv->data, nv->len);
6220
6221 on_error:
6222 nvlist_destroy(nvl);
6223 free(nvlpacked, M_NVLIST);
6224 return (error);
6225 }
6226
6227 static int
pf_clearstates_nv(struct pfioc_nv * nv)6228 pf_clearstates_nv(struct pfioc_nv *nv)
6229 {
6230 struct pf_kstate_kill kill;
6231 struct epoch_tracker et;
6232 nvlist_t *nvl = NULL;
6233 void *nvlpacked = NULL;
6234 int error = 0;
6235 unsigned int killed;
6236
6237 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6238
6239 if (nv->len > pf_ioctl_maxcount)
6240 ERROUT(ENOMEM);
6241
6242 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6243 error = copyin(nv->data, nvlpacked, nv->len);
6244 if (error)
6245 ERROUT(error);
6246
6247 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6248 if (nvl == NULL)
6249 ERROUT(EBADMSG);
6250
6251 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill);
6252 if (error)
6253 ERROUT(error);
6254
6255 NET_EPOCH_ENTER(et);
6256 killed = pf_clear_states(&kill);
6257 NET_EPOCH_EXIT(et);
6258
6259 free(nvlpacked, M_NVLIST);
6260 nvlpacked = NULL;
6261 nvlist_destroy(nvl);
6262 nvl = nvlist_create(0);
6263 if (nvl == NULL)
6264 ERROUT(ENOMEM);
6265
6266 nvlist_add_number(nvl, "killed", killed);
6267
6268 nvlpacked = nvlist_pack(nvl, &nv->len);
6269 if (nvlpacked == NULL)
6270 ERROUT(ENOMEM);
6271
6272 if (nv->size == 0)
6273 ERROUT(0);
6274 else if (nv->size < nv->len)
6275 ERROUT(ENOSPC);
6276
6277 error = copyout(nvlpacked, nv->data, nv->len);
6278
6279 #undef ERROUT
6280 on_error:
6281 nvlist_destroy(nvl);
6282 free(nvlpacked, M_NVLIST);
6283 return (error);
6284 }
6285
6286 static int
pf_getstate(struct pfioc_nv * nv)6287 pf_getstate(struct pfioc_nv *nv)
6288 {
6289 nvlist_t *nvl = NULL, *nvls;
6290 void *nvlpacked = NULL;
6291 struct pf_kstate *s = NULL;
6292 int error = 0;
6293 uint64_t id, creatorid;
6294
6295 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
6296
6297 if (nv->len > pf_ioctl_maxcount)
6298 ERROUT(ENOMEM);
6299
6300 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6301 error = copyin(nv->data, nvlpacked, nv->len);
6302 if (error)
6303 ERROUT(error);
6304
6305 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6306 if (nvl == NULL)
6307 ERROUT(EBADMSG);
6308
6309 PFNV_CHK(pf_nvuint64(nvl, "id", &id));
6310 PFNV_CHK(pf_nvuint64(nvl, "creatorid", &creatorid));
6311
6312 s = pf_find_state_byid(id, creatorid);
6313 if (s == NULL)
6314 ERROUT(ENOENT);
6315
6316 free(nvlpacked, M_NVLIST);
6317 nvlpacked = NULL;
6318 nvlist_destroy(nvl);
6319 nvl = nvlist_create(0);
6320 if (nvl == NULL)
6321 ERROUT(ENOMEM);
6322
6323 nvls = pf_state_to_nvstate(s);
6324 if (nvls == NULL)
6325 ERROUT(ENOMEM);
6326
6327 nvlist_add_nvlist(nvl, "state", nvls);
6328 nvlist_destroy(nvls);
6329
6330 nvlpacked = nvlist_pack(nvl, &nv->len);
6331 if (nvlpacked == NULL)
6332 ERROUT(ENOMEM);
6333
6334 if (nv->size == 0)
6335 ERROUT(0);
6336 else if (nv->size < nv->len)
6337 ERROUT(ENOSPC);
6338
6339 error = copyout(nvlpacked, nv->data, nv->len);
6340
6341 #undef ERROUT
6342 errout:
6343 if (s != NULL)
6344 PF_STATE_UNLOCK(s);
6345 free(nvlpacked, M_NVLIST);
6346 nvlist_destroy(nvl);
6347 return (error);
6348 }
6349
6350 /*
6351 * XXX - Check for version mismatch!!!
6352 */
6353
6354 /*
6355 * Duplicate pfctl -Fa operation to get rid of as much as we can.
6356 */
6357 static int
shutdown_pf(void)6358 shutdown_pf(void)
6359 {
6360 int error = 0;
6361 u_int32_t t[5];
6362 char nn = '\0';
6363 struct pf_kanchor *anchor;
6364 struct pf_keth_anchor *eth_anchor;
6365 int rs_num;
6366
6367 do {
6368 /* Unlink rules of all user defined anchors */
6369 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors) {
6370 /* Wildcard based anchors may not have a respective
6371 * explicit anchor rule or they may be left empty
6372 * without rules. It leads to anchor.refcnt=0, and the
6373 * rest of the logic does not expect it. */
6374 if (anchor->refcnt == 0)
6375 anchor->refcnt = 1;
6376 for (rs_num = 0; rs_num < PF_RULESET_MAX; ++rs_num) {
6377 if ((error = pf_begin_rules(&t[rs_num], rs_num,
6378 anchor->path)) != 0) {
6379 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: "
6380 "anchor.path=%s rs_num=%d\n",
6381 anchor->path, rs_num));
6382 goto error; /* XXX: rollback? */
6383 }
6384 }
6385 for (rs_num = 0; rs_num < PF_RULESET_MAX; ++rs_num) {
6386 error = pf_commit_rules(t[rs_num], rs_num,
6387 anchor->path);
6388 MPASS(error == 0);
6389 }
6390 }
6391
6392 /* Unlink rules of all user defined ether anchors */
6393 RB_FOREACH(eth_anchor, pf_keth_anchor_global,
6394 &V_pf_keth_anchors) {
6395 /* Wildcard based anchors may not have a respective
6396 * explicit anchor rule or they may be left empty
6397 * without rules. It leads to anchor.refcnt=0, and the
6398 * rest of the logic does not expect it. */
6399 if (eth_anchor->refcnt == 0)
6400 eth_anchor->refcnt = 1;
6401 if ((error = pf_begin_eth(&t[0], eth_anchor->path))
6402 != 0) {
6403 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: eth "
6404 "anchor.path=%s\n", eth_anchor->path));
6405 goto error;
6406 }
6407 error = pf_commit_eth(t[0], eth_anchor->path);
6408 MPASS(error == 0);
6409 }
6410
6411 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn))
6412 != 0) {
6413 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
6414 break;
6415 }
6416 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn))
6417 != 0) {
6418 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
6419 break; /* XXX: rollback? */
6420 }
6421 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn))
6422 != 0) {
6423 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
6424 break; /* XXX: rollback? */
6425 }
6426 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
6427 != 0) {
6428 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
6429 break; /* XXX: rollback? */
6430 }
6431 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
6432 != 0) {
6433 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
6434 break; /* XXX: rollback? */
6435 }
6436
6437 error = pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
6438 MPASS(error == 0);
6439 error = pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
6440 MPASS(error == 0);
6441 error = pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
6442 MPASS(error == 0);
6443 error = pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
6444 MPASS(error == 0);
6445 error = pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
6446 MPASS(error == 0);
6447
6448 if ((error = pf_clear_tables()) != 0)
6449 break;
6450
6451 if ((error = pf_begin_eth(&t[0], &nn)) != 0) {
6452 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: eth\n"));
6453 break;
6454 }
6455 error = pf_commit_eth(t[0], &nn);
6456 MPASS(error == 0);
6457
6458 #ifdef ALTQ
6459 if ((error = pf_begin_altq(&t[0])) != 0) {
6460 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
6461 break;
6462 }
6463 pf_commit_altq(t[0]);
6464 #endif
6465
6466 pf_clear_all_states();
6467
6468 pf_kill_srcnodes(NULL);
6469
6470 /* status does not use malloced mem so no need to cleanup */
6471 /* fingerprints and interfaces have their own cleanup code */
6472 } while(0);
6473
6474 error:
6475 return (error);
6476 }
6477
6478 static pfil_return_t
pf_check_return(int chk,struct mbuf ** m)6479 pf_check_return(int chk, struct mbuf **m)
6480 {
6481
6482 switch (chk) {
6483 case PF_PASS:
6484 if (*m == NULL)
6485 return (PFIL_CONSUMED);
6486 else
6487 return (PFIL_PASS);
6488 break;
6489 default:
6490 if (*m != NULL) {
6491 m_freem(*m);
6492 *m = NULL;
6493 }
6494 return (PFIL_DROPPED);
6495 }
6496 }
6497
6498 static pfil_return_t
pf_eth_check_in(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6499 pf_eth_check_in(struct mbuf **m, struct ifnet *ifp, int flags,
6500 void *ruleset __unused, struct inpcb *inp)
6501 {
6502 int chk;
6503
6504 CURVNET_ASSERT_SET();
6505
6506 chk = pf_test_eth(PF_IN, flags, ifp, m, inp);
6507
6508 return (pf_check_return(chk, m));
6509 }
6510
6511 static pfil_return_t
pf_eth_check_out(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6512 pf_eth_check_out(struct mbuf **m, struct ifnet *ifp, int flags,
6513 void *ruleset __unused, struct inpcb *inp)
6514 {
6515 int chk;
6516
6517 CURVNET_ASSERT_SET();
6518
6519 chk = pf_test_eth(PF_OUT, flags, ifp, m, inp);
6520
6521 return (pf_check_return(chk, m));
6522 }
6523
6524 #ifdef INET
6525 static pfil_return_t
pf_check_in(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6526 pf_check_in(struct mbuf **m, struct ifnet *ifp, int flags,
6527 void *ruleset __unused, struct inpcb *inp)
6528 {
6529 int chk;
6530
6531 CURVNET_ASSERT_SET();
6532
6533 chk = pf_test(AF_INET, PF_IN, flags, ifp, m, inp, NULL);
6534
6535 return (pf_check_return(chk, m));
6536 }
6537
6538 static pfil_return_t
pf_check_out(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6539 pf_check_out(struct mbuf **m, struct ifnet *ifp, int flags,
6540 void *ruleset __unused, struct inpcb *inp)
6541 {
6542 int chk;
6543
6544 CURVNET_ASSERT_SET();
6545
6546 chk = pf_test(AF_INET, PF_OUT, flags, ifp, m, inp, NULL);
6547
6548 return (pf_check_return(chk, m));
6549 }
6550 #endif
6551
6552 #ifdef INET6
6553 static pfil_return_t
pf_check6_in(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6554 pf_check6_in(struct mbuf **m, struct ifnet *ifp, int flags,
6555 void *ruleset __unused, struct inpcb *inp)
6556 {
6557 int chk;
6558
6559 CURVNET_ASSERT_SET();
6560
6561 /*
6562 * In case of loopback traffic IPv6 uses the real interface in
6563 * order to support scoped addresses. In order to support stateful
6564 * filtering we have change this to lo0 as it is the case in IPv4.
6565 */
6566 chk = pf_test(AF_INET6, PF_IN, flags, (*m)->m_flags & M_LOOP ? V_loif : ifp,
6567 m, inp, NULL);
6568
6569 return (pf_check_return(chk, m));
6570 }
6571
6572 static pfil_return_t
pf_check6_out(struct mbuf ** m,struct ifnet * ifp,int flags,void * ruleset __unused,struct inpcb * inp)6573 pf_check6_out(struct mbuf **m, struct ifnet *ifp, int flags,
6574 void *ruleset __unused, struct inpcb *inp)
6575 {
6576 int chk;
6577
6578 CURVNET_ASSERT_SET();
6579
6580 chk = pf_test(AF_INET6, PF_OUT, flags, ifp, m, inp, NULL);
6581
6582 return (pf_check_return(chk, m));
6583 }
6584 #endif /* INET6 */
6585
6586 VNET_DEFINE_STATIC(pfil_hook_t, pf_eth_in_hook);
6587 VNET_DEFINE_STATIC(pfil_hook_t, pf_eth_out_hook);
6588 #define V_pf_eth_in_hook VNET(pf_eth_in_hook)
6589 #define V_pf_eth_out_hook VNET(pf_eth_out_hook)
6590
6591 #ifdef INET
6592 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_in_hook);
6593 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_out_hook);
6594 #define V_pf_ip4_in_hook VNET(pf_ip4_in_hook)
6595 #define V_pf_ip4_out_hook VNET(pf_ip4_out_hook)
6596 #endif
6597 #ifdef INET6
6598 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_in_hook);
6599 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_out_hook);
6600 #define V_pf_ip6_in_hook VNET(pf_ip6_in_hook)
6601 #define V_pf_ip6_out_hook VNET(pf_ip6_out_hook)
6602 #endif
6603
6604 static void
hook_pf_eth(void)6605 hook_pf_eth(void)
6606 {
6607 struct pfil_hook_args pha = {
6608 .pa_version = PFIL_VERSION,
6609 .pa_modname = "pf",
6610 .pa_type = PFIL_TYPE_ETHERNET,
6611 };
6612 struct pfil_link_args pla = {
6613 .pa_version = PFIL_VERSION,
6614 };
6615 int ret __diagused;
6616
6617 if (atomic_load_bool(&V_pf_pfil_eth_hooked))
6618 return;
6619
6620 pha.pa_mbuf_chk = pf_eth_check_in;
6621 pha.pa_flags = PFIL_IN;
6622 pha.pa_rulname = "eth-in";
6623 V_pf_eth_in_hook = pfil_add_hook(&pha);
6624 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6625 pla.pa_head = V_link_pfil_head;
6626 pla.pa_hook = V_pf_eth_in_hook;
6627 ret = pfil_link(&pla);
6628 MPASS(ret == 0);
6629 pha.pa_mbuf_chk = pf_eth_check_out;
6630 pha.pa_flags = PFIL_OUT;
6631 pha.pa_rulname = "eth-out";
6632 V_pf_eth_out_hook = pfil_add_hook(&pha);
6633 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6634 pla.pa_head = V_link_pfil_head;
6635 pla.pa_hook = V_pf_eth_out_hook;
6636 ret = pfil_link(&pla);
6637 MPASS(ret == 0);
6638
6639 atomic_store_bool(&V_pf_pfil_eth_hooked, true);
6640 }
6641
6642 static void
hook_pf(void)6643 hook_pf(void)
6644 {
6645 struct pfil_hook_args pha = {
6646 .pa_version = PFIL_VERSION,
6647 .pa_modname = "pf",
6648 };
6649 struct pfil_link_args pla = {
6650 .pa_version = PFIL_VERSION,
6651 };
6652 int ret __diagused;
6653
6654 if (atomic_load_bool(&V_pf_pfil_hooked))
6655 return;
6656
6657 #ifdef INET
6658 pha.pa_type = PFIL_TYPE_IP4;
6659 pha.pa_mbuf_chk = pf_check_in;
6660 pha.pa_flags = PFIL_IN;
6661 pha.pa_rulname = "default-in";
6662 V_pf_ip4_in_hook = pfil_add_hook(&pha);
6663 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6664 pla.pa_head = V_inet_pfil_head;
6665 pla.pa_hook = V_pf_ip4_in_hook;
6666 ret = pfil_link(&pla);
6667 MPASS(ret == 0);
6668 pha.pa_mbuf_chk = pf_check_out;
6669 pha.pa_flags = PFIL_OUT;
6670 pha.pa_rulname = "default-out";
6671 V_pf_ip4_out_hook = pfil_add_hook(&pha);
6672 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6673 pla.pa_head = V_inet_pfil_head;
6674 pla.pa_hook = V_pf_ip4_out_hook;
6675 ret = pfil_link(&pla);
6676 MPASS(ret == 0);
6677 if (V_pf_filter_local) {
6678 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6679 pla.pa_head = V_inet_local_pfil_head;
6680 pla.pa_hook = V_pf_ip4_out_hook;
6681 ret = pfil_link(&pla);
6682 MPASS(ret == 0);
6683 }
6684 #endif
6685 #ifdef INET6
6686 pha.pa_type = PFIL_TYPE_IP6;
6687 pha.pa_mbuf_chk = pf_check6_in;
6688 pha.pa_flags = PFIL_IN;
6689 pha.pa_rulname = "default-in6";
6690 V_pf_ip6_in_hook = pfil_add_hook(&pha);
6691 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6692 pla.pa_head = V_inet6_pfil_head;
6693 pla.pa_hook = V_pf_ip6_in_hook;
6694 ret = pfil_link(&pla);
6695 MPASS(ret == 0);
6696 pha.pa_mbuf_chk = pf_check6_out;
6697 pha.pa_rulname = "default-out6";
6698 pha.pa_flags = PFIL_OUT;
6699 V_pf_ip6_out_hook = pfil_add_hook(&pha);
6700 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6701 pla.pa_head = V_inet6_pfil_head;
6702 pla.pa_hook = V_pf_ip6_out_hook;
6703 ret = pfil_link(&pla);
6704 MPASS(ret == 0);
6705 if (V_pf_filter_local) {
6706 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6707 pla.pa_head = V_inet6_local_pfil_head;
6708 pla.pa_hook = V_pf_ip6_out_hook;
6709 ret = pfil_link(&pla);
6710 MPASS(ret == 0);
6711 }
6712 #endif
6713
6714 atomic_store_bool(&V_pf_pfil_hooked, true);
6715 }
6716
6717 static void
dehook_pf_eth(void)6718 dehook_pf_eth(void)
6719 {
6720
6721 if (!atomic_load_bool(&V_pf_pfil_eth_hooked))
6722 return;
6723
6724 pfil_remove_hook(V_pf_eth_in_hook);
6725 pfil_remove_hook(V_pf_eth_out_hook);
6726
6727 atomic_store_bool(&V_pf_pfil_eth_hooked, false);
6728 }
6729
6730 static void
dehook_pf(void)6731 dehook_pf(void)
6732 {
6733
6734 if (!atomic_load_bool(&V_pf_pfil_hooked))
6735 return;
6736
6737 #ifdef INET
6738 pfil_remove_hook(V_pf_ip4_in_hook);
6739 pfil_remove_hook(V_pf_ip4_out_hook);
6740 #endif
6741 #ifdef INET6
6742 pfil_remove_hook(V_pf_ip6_in_hook);
6743 pfil_remove_hook(V_pf_ip6_out_hook);
6744 #endif
6745
6746 atomic_store_bool(&V_pf_pfil_hooked, false);
6747 }
6748
6749 static void
pf_load_vnet(void)6750 pf_load_vnet(void)
6751 {
6752 V_pf_tag_z = uma_zcreate("pf tags", sizeof(struct pf_tagname),
6753 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
6754
6755 rm_init_flags(&V_pf_rules_lock, "pf rulesets", RM_RECURSE);
6756 sx_init(&V_pf_ioctl_lock, "pf ioctl");
6757
6758 pf_init_tagset(&V_pf_tags, &pf_rule_tag_hashsize,
6759 PF_RULE_TAG_HASH_SIZE_DEFAULT);
6760 #ifdef ALTQ
6761 pf_init_tagset(&V_pf_qids, &pf_queue_tag_hashsize,
6762 PF_QUEUE_TAG_HASH_SIZE_DEFAULT);
6763 #endif
6764
6765 V_pf_keth = &V_pf_main_keth_anchor.ruleset;
6766
6767 pfattach_vnet();
6768 V_pf_vnet_active = 1;
6769 }
6770
6771 static int
pf_load(void)6772 pf_load(void)
6773 {
6774 int error;
6775
6776 sx_init(&pf_end_lock, "pf end thread");
6777
6778 pf_mtag_initialize();
6779
6780 pf_dev = make_dev(&pf_cdevsw, 0, UID_ROOT, GID_WHEEL, 0600, PF_NAME);
6781 if (pf_dev == NULL)
6782 return (ENOMEM);
6783
6784 pf_end_threads = 0;
6785 error = kproc_create(pf_purge_thread, NULL, &pf_purge_proc, 0, 0, "pf purge");
6786 if (error != 0)
6787 return (error);
6788
6789 pfi_initialize();
6790
6791 return (0);
6792 }
6793
6794 static void
pf_unload_vnet(void)6795 pf_unload_vnet(void)
6796 {
6797 int ret __diagused;
6798
6799 V_pf_vnet_active = 0;
6800 V_pf_status.running = 0;
6801 dehook_pf();
6802 dehook_pf_eth();
6803
6804 PF_RULES_WLOCK();
6805 pf_syncookies_cleanup();
6806 shutdown_pf();
6807 PF_RULES_WUNLOCK();
6808
6809 ret = swi_remove(V_pf_swi_cookie);
6810 MPASS(ret == 0);
6811 ret = intr_event_destroy(V_pf_swi_ie);
6812 MPASS(ret == 0);
6813
6814 pf_unload_vnet_purge();
6815
6816 pf_normalize_cleanup();
6817 PF_RULES_WLOCK();
6818 pfi_cleanup_vnet();
6819 PF_RULES_WUNLOCK();
6820 pfr_cleanup();
6821 pf_osfp_flush();
6822 pf_cleanup();
6823 if (IS_DEFAULT_VNET(curvnet))
6824 pf_mtag_cleanup();
6825
6826 pf_cleanup_tagset(&V_pf_tags);
6827 #ifdef ALTQ
6828 pf_cleanup_tagset(&V_pf_qids);
6829 #endif
6830 uma_zdestroy(V_pf_tag_z);
6831
6832 #ifdef PF_WANT_32_TO_64_COUNTER
6833 PF_RULES_WLOCK();
6834 LIST_REMOVE(V_pf_kifmarker, pfik_allkiflist);
6835
6836 MPASS(LIST_EMPTY(&V_pf_allkiflist));
6837 MPASS(V_pf_allkifcount == 0);
6838
6839 LIST_REMOVE(&V_pf_default_rule, allrulelist);
6840 V_pf_allrulecount--;
6841 LIST_REMOVE(V_pf_rulemarker, allrulelist);
6842
6843 MPASS(LIST_EMPTY(&V_pf_allrulelist));
6844 MPASS(V_pf_allrulecount == 0);
6845
6846 PF_RULES_WUNLOCK();
6847
6848 free(V_pf_kifmarker, PFI_MTYPE);
6849 free(V_pf_rulemarker, M_PFRULE);
6850 #endif
6851
6852 /* Free counters last as we updated them during shutdown. */
6853 pf_counter_u64_deinit(&V_pf_default_rule.evaluations);
6854 for (int i = 0; i < 2; i++) {
6855 pf_counter_u64_deinit(&V_pf_default_rule.packets[i]);
6856 pf_counter_u64_deinit(&V_pf_default_rule.bytes[i]);
6857 }
6858 counter_u64_free(V_pf_default_rule.states_cur);
6859 counter_u64_free(V_pf_default_rule.states_tot);
6860 for (pf_sn_types_t sn_type=0; sn_type<PF_SN_MAX; sn_type++)
6861 counter_u64_free(V_pf_default_rule.src_nodes[sn_type]);
6862 uma_zfree_pcpu(pf_timestamp_pcpu_zone, V_pf_default_rule.timestamp);
6863
6864 for (int i = 0; i < PFRES_MAX; i++)
6865 counter_u64_free(V_pf_status.counters[i]);
6866 for (int i = 0; i < KLCNT_MAX; i++)
6867 counter_u64_free(V_pf_status.lcounters[i]);
6868 for (int i = 0; i < FCNT_MAX; i++)
6869 pf_counter_u64_deinit(&V_pf_status.fcounters[i]);
6870 for (int i = 0; i < SCNT_MAX; i++)
6871 counter_u64_free(V_pf_status.scounters[i]);
6872
6873 rm_destroy(&V_pf_rules_lock);
6874 sx_destroy(&V_pf_ioctl_lock);
6875 }
6876
6877 static void
pf_unload(void)6878 pf_unload(void)
6879 {
6880
6881 sx_xlock(&pf_end_lock);
6882 pf_end_threads = 1;
6883 while (pf_end_threads < 2) {
6884 wakeup_one(pf_purge_thread);
6885 sx_sleep(pf_purge_proc, &pf_end_lock, 0, "pftmo", 0);
6886 }
6887 sx_xunlock(&pf_end_lock);
6888
6889 pf_nl_unregister();
6890
6891 if (pf_dev != NULL)
6892 destroy_dev(pf_dev);
6893
6894 pfi_cleanup();
6895
6896 sx_destroy(&pf_end_lock);
6897 }
6898
6899 static void
vnet_pf_init(void * unused __unused)6900 vnet_pf_init(void *unused __unused)
6901 {
6902
6903 pf_load_vnet();
6904 }
6905 VNET_SYSINIT(vnet_pf_init, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
6906 vnet_pf_init, NULL);
6907
6908 static void
vnet_pf_uninit(const void * unused __unused)6909 vnet_pf_uninit(const void *unused __unused)
6910 {
6911
6912 pf_unload_vnet();
6913 }
6914 SYSUNINIT(pf_unload, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND, pf_unload, NULL);
6915 VNET_SYSUNINIT(vnet_pf_uninit, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
6916 vnet_pf_uninit, NULL);
6917
6918 static int
pf_modevent(module_t mod,int type,void * data)6919 pf_modevent(module_t mod, int type, void *data)
6920 {
6921 int error = 0;
6922
6923 switch(type) {
6924 case MOD_LOAD:
6925 error = pf_load();
6926 pf_nl_register();
6927 break;
6928 case MOD_UNLOAD:
6929 /* Handled in SYSUNINIT(pf_unload) to ensure it's done after
6930 * the vnet_pf_uninit()s */
6931 break;
6932 default:
6933 error = EINVAL;
6934 break;
6935 }
6936
6937 return (error);
6938 }
6939
6940 static moduledata_t pf_mod = {
6941 "pf",
6942 pf_modevent,
6943 0
6944 };
6945
6946 DECLARE_MODULE(pf, pf_mod, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND);
6947 MODULE_DEPEND(pf, netlink, 1, 1, 1);
6948 MODULE_DEPEND(pf, crypto, 1, 1, 1);
6949 MODULE_VERSION(pf, PF_MODVER);
6950