]>
Commit | Line | Data |
---|---|---|
b0d623f7 A |
1 | /* |
2 | * Copyright (c) 2008 Apple Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_OSREFERENCE_LICENSE_HEADER_START@ | |
5 | * | |
6 | * This file contains Original Code and/or Modifications of Original Code | |
7 | * as defined in and that are subject to the Apple Public Source License | |
8 | * Version 2.0 (the 'License'). You may not use this file except in | |
9 | * compliance with the License. The rights granted to you under the License | |
10 | * may not be used to create, or enable the creation or redistribution of, | |
11 | * unlawful or unlicensed copies of an Apple operating system, or to | |
12 | * circumvent, violate, or enable the circumvention or violation of, any | |
13 | * terms of an Apple operating system software license agreement. | |
14 | * | |
15 | * Please obtain a copy of the License at | |
16 | * http://www.opensource.apple.com/apsl/ and read it before using this file. | |
17 | * | |
18 | * The Original Code and all software distributed under the License are | |
19 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
20 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
21 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
22 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. | |
23 | * Please see the License for the specific language governing rights and | |
24 | * limitations under the License. | |
25 | * | |
26 | * @APPLE_OSREFERENCE_LICENSE_HEADER_END@ | |
27 | */ | |
28 | ||
29 | /* $apfw: pf_if.c,v 1.4 2008/08/27 00:01:32 jhw Exp $ */ | |
30 | /* $OpenBSD: pf_if.c,v 1.46 2006/12/13 09:01:59 itojun Exp $ */ | |
31 | ||
32 | /* | |
33 | * Copyright 2005 Henning Brauer <henning@openbsd.org> | |
34 | * Copyright 2005 Ryan McBride <mcbride@openbsd.org> | |
35 | * Copyright (c) 2001 Daniel Hartmeier | |
36 | * Copyright (c) 2003 Cedric Berger | |
37 | * All rights reserved. | |
38 | * | |
39 | * Redistribution and use in source and binary forms, with or without | |
40 | * modification, are permitted provided that the following conditions | |
41 | * are met: | |
42 | * | |
43 | * - Redistributions of source code must retain the above copyright | |
44 | * notice, this list of conditions and the following disclaimer. | |
45 | * - Redistributions in binary form must reproduce the above | |
46 | * copyright notice, this list of conditions and the following | |
47 | * disclaimer in the documentation and/or other materials provided | |
48 | * with the distribution. | |
49 | * | |
50 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
51 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
52 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS | |
53 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE | |
54 | * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, | |
55 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, | |
56 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | |
57 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER | |
58 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
59 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN | |
60 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
61 | * POSSIBILITY OF SUCH DAMAGE. | |
62 | */ | |
63 | ||
64 | #include <sys/param.h> | |
65 | #include <sys/systm.h> | |
66 | #include <sys/mbuf.h> | |
67 | #include <sys/filio.h> | |
68 | #include <sys/socket.h> | |
69 | #include <sys/socketvar.h> | |
70 | #include <sys/kernel.h> | |
71 | #include <sys/time.h> | |
72 | #include <sys/malloc.h> | |
73 | ||
74 | #include <net/if.h> | |
75 | #include <net/if_types.h> | |
76 | #include <net/if_var.h> | |
77 | ||
78 | #include <netinet/in.h> | |
79 | #include <netinet/in_var.h> | |
80 | #include <netinet/in_systm.h> | |
81 | #include <netinet/ip.h> | |
82 | #include <netinet/ip_var.h> | |
83 | ||
84 | #if INET6 | |
85 | #include <netinet/ip6.h> | |
86 | #endif /* INET6 */ | |
87 | ||
88 | #include <net/pfvar.h> | |
89 | ||
90 | struct pfi_kif *pfi_all = NULL; | |
91 | ||
92 | static struct pool pfi_addr_pl; | |
93 | static struct pfi_ifhead pfi_ifs; | |
94 | static u_int32_t pfi_update = 1; | |
95 | static struct pfr_addr *pfi_buffer; | |
96 | static int pfi_buffer_cnt; | |
97 | static int pfi_buffer_max; | |
98 | ||
99 | __private_extern__ void pfi_kifaddr_update(void *); | |
100 | ||
101 | static void pfi_kif_update(struct pfi_kif *); | |
102 | static void pfi_dynaddr_update(struct pfi_dynaddr *dyn); | |
103 | static void pfi_table_update(struct pfr_ktable *, struct pfi_kif *, int, int); | |
104 | static void pfi_instance_add(struct ifnet *, int, int); | |
105 | static void pfi_address_add(struct sockaddr *, int, int); | |
106 | static int pfi_if_compare(struct pfi_kif *, struct pfi_kif *); | |
107 | static int pfi_skip_if(const char *, struct pfi_kif *); | |
108 | static int pfi_unmask(void *); | |
109 | ||
110 | RB_PROTOTYPE_SC(static, pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); | |
111 | RB_GENERATE(pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); | |
112 | ||
113 | #define PFI_BUFFER_MAX 0x10000 | |
114 | #define PFI_MTYPE M_IFADDR | |
115 | ||
116 | #define IFG_ALL "ALL" | |
117 | ||
118 | void | |
119 | pfi_initialize(void) | |
120 | { | |
121 | if (pfi_all != NULL) /* already initialized */ | |
122 | return; | |
123 | ||
124 | pool_init(&pfi_addr_pl, sizeof (struct pfi_dynaddr), 0, 0, 0, | |
125 | "pfiaddrpl", NULL); | |
126 | pfi_buffer_max = 64; | |
127 | pfi_buffer = _MALLOC(pfi_buffer_max * sizeof (*pfi_buffer), | |
128 | PFI_MTYPE, M_WAITOK); | |
129 | ||
130 | if ((pfi_all = pfi_kif_get(IFG_ALL)) == NULL) | |
131 | panic("pfi_kif_get for pfi_all failed"); | |
132 | } | |
133 | ||
134 | #if 0 | |
135 | void | |
136 | pfi_destroy(void) | |
137 | { | |
138 | pool_destroy(&pfi_addr_pl); | |
139 | _FREE(pfi_buffer, PFI_MTYPE); | |
140 | } | |
141 | #endif | |
142 | ||
143 | struct pfi_kif * | |
144 | pfi_kif_get(const char *kif_name) | |
145 | { | |
146 | struct pfi_kif *kif; | |
147 | struct pfi_kif_cmp s; | |
148 | ||
149 | bzero(&s, sizeof (s)); | |
150 | strlcpy(s.pfik_name, kif_name, sizeof (s.pfik_name)); | |
151 | if ((kif = RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&s)) != NULL) | |
152 | return (kif); | |
153 | ||
154 | /* create new one */ | |
155 | if ((kif = _MALLOC(sizeof (*kif), PFI_MTYPE, M_WAITOK|M_ZERO)) == NULL) | |
156 | return (NULL); | |
157 | ||
158 | strlcpy(kif->pfik_name, kif_name, sizeof (kif->pfik_name)); | |
159 | kif->pfik_tzero = pf_time_second(); | |
160 | TAILQ_INIT(&kif->pfik_dynaddrs); | |
161 | ||
162 | RB_INSERT(pfi_ifhead, &pfi_ifs, kif); | |
163 | return (kif); | |
164 | } | |
165 | ||
166 | void | |
167 | pfi_kif_ref(struct pfi_kif *kif, enum pfi_kif_refs what) | |
168 | { | |
169 | switch (what) { | |
170 | case PFI_KIF_REF_RULE: | |
171 | kif->pfik_rules++; | |
172 | break; | |
173 | case PFI_KIF_REF_STATE: | |
174 | kif->pfik_states++; | |
175 | break; | |
176 | default: | |
177 | panic("pfi_kif_ref with unknown type"); | |
178 | } | |
179 | } | |
180 | ||
181 | void | |
182 | pfi_kif_unref(struct pfi_kif *kif, enum pfi_kif_refs what) | |
183 | { | |
184 | if (kif == NULL) | |
185 | return; | |
186 | ||
187 | switch (what) { | |
188 | case PFI_KIF_REF_NONE: | |
189 | break; | |
190 | case PFI_KIF_REF_RULE: | |
191 | if (kif->pfik_rules <= 0) { | |
192 | printf("pfi_kif_unref: rules refcount <= 0\n"); | |
193 | return; | |
194 | } | |
195 | kif->pfik_rules--; | |
196 | break; | |
197 | case PFI_KIF_REF_STATE: | |
198 | if (kif->pfik_states <= 0) { | |
199 | printf("pfi_kif_unref: state refcount <= 0\n"); | |
200 | return; | |
201 | } | |
202 | kif->pfik_states--; | |
203 | break; | |
204 | default: | |
205 | panic("pfi_kif_unref with unknown type"); | |
206 | } | |
207 | ||
208 | if (kif->pfik_ifp != NULL || kif == pfi_all) | |
209 | return; | |
210 | ||
211 | if (kif->pfik_rules || kif->pfik_states) | |
212 | return; | |
213 | ||
214 | RB_REMOVE(pfi_ifhead, &pfi_ifs, kif); | |
215 | _FREE(kif, PFI_MTYPE); | |
216 | } | |
217 | ||
218 | int | |
219 | pfi_kif_match(struct pfi_kif *rule_kif, struct pfi_kif *packet_kif) | |
220 | { | |
221 | ||
222 | if (rule_kif == NULL || rule_kif == packet_kif) | |
223 | return (1); | |
224 | ||
225 | return (0); | |
226 | } | |
227 | ||
228 | void | |
229 | pfi_attach_ifnet(struct ifnet *ifp) | |
230 | { | |
231 | struct pfi_kif *kif; | |
232 | char if_name[IFNAMSIZ]; | |
233 | ||
234 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
235 | ||
236 | pfi_update++; | |
237 | (void) snprintf(if_name, sizeof (if_name), "%s%d", | |
238 | ifp->if_name, ifp->if_unit); | |
239 | if ((kif = pfi_kif_get(if_name)) == NULL) | |
240 | panic("pfi_kif_get failed"); | |
241 | ||
242 | ifnet_lock_exclusive(ifp); | |
243 | kif->pfik_ifp = ifp; | |
244 | ifp->if_pf_kif = kif; | |
245 | ifnet_lock_done(ifp); | |
246 | ||
247 | pfi_kif_update(kif); | |
248 | } | |
249 | ||
250 | /* | |
251 | * Caller holds ifnet lock as writer (exclusive); | |
252 | */ | |
253 | void | |
254 | pfi_detach_ifnet(struct ifnet *ifp) | |
255 | { | |
256 | struct pfi_kif *kif; | |
257 | ||
258 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
259 | ||
260 | if ((kif = (struct pfi_kif *)ifp->if_pf_kif) == NULL) | |
261 | return; | |
262 | ||
263 | pfi_update++; | |
264 | pfi_kif_update(kif); | |
265 | ||
266 | ifnet_lock_exclusive(ifp); | |
267 | kif->pfik_ifp = NULL; | |
268 | ifp->if_pf_kif = NULL; | |
269 | ifnet_lock_done(ifp); | |
270 | ||
271 | pfi_kif_unref(kif, PFI_KIF_REF_NONE); | |
272 | } | |
273 | ||
274 | int | |
275 | pfi_match_addr(struct pfi_dynaddr *dyn, struct pf_addr *a, sa_family_t af) | |
276 | { | |
277 | switch (af) { | |
278 | #if INET | |
279 | case AF_INET: | |
280 | switch (dyn->pfid_acnt4) { | |
281 | case 0: | |
282 | return (0); | |
283 | case 1: | |
284 | return (PF_MATCHA(0, &dyn->pfid_addr4, | |
285 | &dyn->pfid_mask4, a, AF_INET)); | |
286 | default: | |
287 | return (pfr_match_addr(dyn->pfid_kt, a, AF_INET)); | |
288 | } | |
289 | break; | |
290 | #endif /* INET */ | |
291 | #if INET6 | |
292 | case AF_INET6: | |
293 | switch (dyn->pfid_acnt6) { | |
294 | case 0: | |
295 | return (0); | |
296 | case 1: | |
297 | return (PF_MATCHA(0, &dyn->pfid_addr6, | |
298 | &dyn->pfid_mask6, a, AF_INET6)); | |
299 | default: | |
300 | return (pfr_match_addr(dyn->pfid_kt, a, AF_INET6)); | |
301 | } | |
302 | break; | |
303 | #endif /* INET6 */ | |
304 | default: | |
305 | return (0); | |
306 | } | |
307 | } | |
308 | ||
309 | int | |
310 | pfi_dynaddr_setup(struct pf_addr_wrap *aw, sa_family_t af) | |
311 | { | |
312 | struct pfi_dynaddr *dyn; | |
313 | char tblname[PF_TABLE_NAME_SIZE]; | |
314 | struct pf_ruleset *ruleset = NULL; | |
315 | int rv = 0; | |
316 | ||
317 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
318 | ||
319 | if (aw->type != PF_ADDR_DYNIFTL) | |
320 | return (0); | |
321 | if ((dyn = pool_get(&pfi_addr_pl, PR_WAITOK)) == NULL) | |
322 | return (1); | |
323 | bzero(dyn, sizeof (*dyn)); | |
324 | ||
325 | if (strcmp(aw->v.ifname, "self") == 0) | |
326 | dyn->pfid_kif = pfi_kif_get(IFG_ALL); | |
327 | else | |
328 | dyn->pfid_kif = pfi_kif_get(aw->v.ifname); | |
329 | if (dyn->pfid_kif == NULL) { | |
330 | rv = 1; | |
331 | goto _bad; | |
332 | } | |
333 | pfi_kif_ref(dyn->pfid_kif, PFI_KIF_REF_RULE); | |
334 | ||
335 | dyn->pfid_net = pfi_unmask(&aw->v.a.mask); | |
336 | if (af == AF_INET && dyn->pfid_net == 32) | |
337 | dyn->pfid_net = 128; | |
338 | strlcpy(tblname, aw->v.ifname, sizeof (tblname)); | |
339 | if (aw->iflags & PFI_AFLAG_NETWORK) | |
340 | strlcat(tblname, ":network", sizeof (tblname)); | |
341 | if (aw->iflags & PFI_AFLAG_BROADCAST) | |
342 | strlcat(tblname, ":broadcast", sizeof (tblname)); | |
343 | if (aw->iflags & PFI_AFLAG_PEER) | |
344 | strlcat(tblname, ":peer", sizeof (tblname)); | |
345 | if (aw->iflags & PFI_AFLAG_NOALIAS) | |
346 | strlcat(tblname, ":0", sizeof (tblname)); | |
347 | if (dyn->pfid_net != 128) | |
348 | snprintf(tblname + strlen(tblname), | |
349 | sizeof (tblname) - strlen(tblname), "/%d", dyn->pfid_net); | |
350 | if ((ruleset = pf_find_or_create_ruleset(PF_RESERVED_ANCHOR)) == NULL) { | |
351 | rv = 1; | |
352 | goto _bad; | |
353 | } | |
354 | ||
355 | if ((dyn->pfid_kt = pfr_attach_table(ruleset, tblname)) == NULL) { | |
356 | rv = 1; | |
357 | goto _bad; | |
358 | } | |
359 | ||
360 | dyn->pfid_kt->pfrkt_flags |= PFR_TFLAG_ACTIVE; | |
361 | dyn->pfid_iflags = aw->iflags; | |
362 | dyn->pfid_af = af; | |
363 | ||
364 | TAILQ_INSERT_TAIL(&dyn->pfid_kif->pfik_dynaddrs, dyn, entry); | |
365 | aw->p.dyn = dyn; | |
366 | pfi_kif_update(dyn->pfid_kif); | |
367 | return (0); | |
368 | ||
369 | _bad: | |
370 | if (dyn->pfid_kt != NULL) | |
371 | pfr_detach_table(dyn->pfid_kt); | |
372 | if (ruleset != NULL) | |
373 | pf_remove_if_empty_ruleset(ruleset); | |
374 | if (dyn->pfid_kif != NULL) | |
375 | pfi_kif_unref(dyn->pfid_kif, PFI_KIF_REF_RULE); | |
376 | pool_put(&pfi_addr_pl, dyn); | |
377 | return (rv); | |
378 | } | |
379 | ||
380 | void | |
381 | pfi_kif_update(struct pfi_kif *kif) | |
382 | { | |
383 | struct pfi_dynaddr *p; | |
384 | ||
385 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
386 | ||
387 | /* update all dynaddr */ | |
388 | TAILQ_FOREACH(p, &kif->pfik_dynaddrs, entry) | |
389 | pfi_dynaddr_update(p); | |
390 | } | |
391 | ||
392 | void | |
393 | pfi_dynaddr_update(struct pfi_dynaddr *dyn) | |
394 | { | |
395 | struct pfi_kif *kif; | |
396 | struct pfr_ktable *kt; | |
397 | ||
398 | if (dyn == NULL || dyn->pfid_kif == NULL || dyn->pfid_kt == NULL) | |
399 | panic("pfi_dynaddr_update"); | |
400 | ||
401 | kif = dyn->pfid_kif; | |
402 | kt = dyn->pfid_kt; | |
403 | ||
404 | if (kt->pfrkt_larg != pfi_update) { | |
405 | /* this table needs to be brought up-to-date */ | |
406 | pfi_table_update(kt, kif, dyn->pfid_net, dyn->pfid_iflags); | |
407 | kt->pfrkt_larg = pfi_update; | |
408 | } | |
409 | pfr_dynaddr_update(kt, dyn); | |
410 | } | |
411 | ||
412 | void | |
413 | pfi_table_update(struct pfr_ktable *kt, struct pfi_kif *kif, int net, int flags) | |
414 | { | |
415 | int e, size2 = 0; | |
416 | ||
417 | pfi_buffer_cnt = 0; | |
418 | ||
419 | if (kif->pfik_ifp != NULL) | |
420 | pfi_instance_add(kif->pfik_ifp, net, flags); | |
421 | ||
422 | if ((e = pfr_set_addrs(&kt->pfrkt_t, pfi_buffer, pfi_buffer_cnt, &size2, | |
423 | NULL, NULL, NULL, 0, PFR_TFLAG_ALLMASK))) | |
424 | printf("pfi_table_update: cannot set %d new addresses " | |
425 | "into table %s: %d\n", pfi_buffer_cnt, kt->pfrkt_name, e); | |
426 | } | |
427 | ||
428 | void | |
429 | pfi_instance_add(struct ifnet *ifp, int net, int flags) | |
430 | { | |
431 | struct ifaddr *ia; | |
432 | int got4 = 0, got6 = 0; | |
433 | int net2, af; | |
434 | ||
435 | if (ifp == NULL) | |
436 | return; | |
437 | ifnet_lock_shared(ifp); | |
438 | TAILQ_FOREACH(ia, &ifp->if_addrhead, ifa_link) { | |
439 | if (ia->ifa_addr == NULL) | |
440 | continue; | |
441 | af = ia->ifa_addr->sa_family; | |
442 | if (af != AF_INET && af != AF_INET6) | |
443 | continue; | |
444 | if ((flags & PFI_AFLAG_BROADCAST) && af == AF_INET6) | |
445 | continue; | |
446 | if ((flags & PFI_AFLAG_BROADCAST) && | |
447 | !(ifp->if_flags & IFF_BROADCAST)) | |
448 | continue; | |
449 | if ((flags & PFI_AFLAG_PEER) && | |
450 | !(ifp->if_flags & IFF_POINTOPOINT)) | |
451 | continue; | |
452 | if ((flags & PFI_AFLAG_NETWORK) && af == AF_INET6 && | |
453 | IN6_IS_ADDR_LINKLOCAL( | |
454 | &((struct sockaddr_in6 *)ia->ifa_addr)->sin6_addr)) | |
455 | continue; | |
456 | if (flags & PFI_AFLAG_NOALIAS) { | |
457 | if (af == AF_INET && got4) | |
458 | continue; | |
459 | if (af == AF_INET6 && got6) | |
460 | continue; | |
461 | } | |
462 | if (af == AF_INET) | |
463 | got4 = 1; | |
464 | else if (af == AF_INET6) | |
465 | got6 = 1; | |
466 | net2 = net; | |
467 | if (net2 == 128 && (flags & PFI_AFLAG_NETWORK)) { | |
468 | if (af == AF_INET) | |
469 | net2 = pfi_unmask(&((struct sockaddr_in *) | |
470 | ia->ifa_netmask)->sin_addr); | |
471 | else if (af == AF_INET6) | |
472 | net2 = pfi_unmask(&((struct sockaddr_in6 *) | |
473 | ia->ifa_netmask)->sin6_addr); | |
474 | } | |
475 | if (af == AF_INET && net2 > 32) | |
476 | net2 = 32; | |
477 | if (flags & PFI_AFLAG_BROADCAST) | |
478 | pfi_address_add(ia->ifa_broadaddr, af, net2); | |
479 | else if (flags & PFI_AFLAG_PEER) | |
480 | pfi_address_add(ia->ifa_dstaddr, af, net2); | |
481 | else | |
482 | pfi_address_add(ia->ifa_addr, af, net2); | |
483 | } | |
484 | ifnet_lock_done(ifp); | |
485 | } | |
486 | ||
487 | void | |
488 | pfi_address_add(struct sockaddr *sa, int af, int net) | |
489 | { | |
490 | struct pfr_addr *p; | |
491 | int i; | |
492 | ||
493 | if (pfi_buffer_cnt >= pfi_buffer_max) { | |
494 | int new_max = pfi_buffer_max * 2; | |
495 | ||
496 | if (new_max > PFI_BUFFER_MAX) { | |
497 | printf("pfi_address_add: address buffer full (%d/%d)\n", | |
498 | pfi_buffer_cnt, PFI_BUFFER_MAX); | |
499 | return; | |
500 | } | |
501 | p = _MALLOC(new_max * sizeof (*pfi_buffer), PFI_MTYPE, | |
502 | M_WAITOK); | |
503 | if (p == NULL) { | |
504 | printf("pfi_address_add: no memory to grow buffer " | |
505 | "(%d/%d)\n", pfi_buffer_cnt, PFI_BUFFER_MAX); | |
506 | return; | |
507 | } | |
508 | memcpy(pfi_buffer, p, pfi_buffer_cnt * sizeof (*pfi_buffer)); | |
509 | /* no need to zero buffer */ | |
510 | _FREE(pfi_buffer, PFI_MTYPE); | |
511 | pfi_buffer = p; | |
512 | pfi_buffer_max = new_max; | |
513 | } | |
514 | if (af == AF_INET && net > 32) | |
515 | net = 128; | |
516 | p = pfi_buffer + pfi_buffer_cnt++; | |
517 | bzero(p, sizeof (*p)); | |
518 | p->pfra_af = af; | |
519 | p->pfra_net = net; | |
520 | if (af == AF_INET) | |
521 | p->pfra_ip4addr = ((struct sockaddr_in *)sa)->sin_addr; | |
522 | else if (af == AF_INET6) { | |
523 | p->pfra_ip6addr = ((struct sockaddr_in6 *)sa)->sin6_addr; | |
524 | if (IN6_IS_SCOPE_EMBED(&p->pfra_ip6addr)) | |
525 | p->pfra_ip6addr.s6_addr16[1] = 0; | |
526 | } | |
527 | /* mask network address bits */ | |
528 | if (net < 128) | |
529 | ((caddr_t)p)[p->pfra_net/8] &= ~(0xFF >> (p->pfra_net%8)); | |
530 | for (i = (p->pfra_net+7)/8; i < (int)sizeof (p->pfra_u); i++) | |
531 | ((caddr_t)p)[i] = 0; | |
532 | } | |
533 | ||
534 | void | |
535 | pfi_dynaddr_remove(struct pf_addr_wrap *aw) | |
536 | { | |
537 | if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || | |
538 | aw->p.dyn->pfid_kif == NULL || aw->p.dyn->pfid_kt == NULL) | |
539 | return; | |
540 | ||
541 | TAILQ_REMOVE(&aw->p.dyn->pfid_kif->pfik_dynaddrs, aw->p.dyn, entry); | |
542 | pfi_kif_unref(aw->p.dyn->pfid_kif, PFI_KIF_REF_RULE); | |
543 | aw->p.dyn->pfid_kif = NULL; | |
544 | pfr_detach_table(aw->p.dyn->pfid_kt); | |
545 | aw->p.dyn->pfid_kt = NULL; | |
546 | pool_put(&pfi_addr_pl, aw->p.dyn); | |
547 | aw->p.dyn = NULL; | |
548 | } | |
549 | ||
550 | void | |
551 | pfi_dynaddr_copyout(struct pf_addr_wrap *aw) | |
552 | { | |
553 | if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || | |
554 | aw->p.dyn->pfid_kif == NULL) | |
555 | return; | |
556 | aw->p.dyncnt = aw->p.dyn->pfid_acnt4 + aw->p.dyn->pfid_acnt6; | |
557 | } | |
558 | ||
559 | void | |
560 | pfi_kifaddr_update(void *v) | |
561 | { | |
562 | struct pfi_kif *kif = (struct pfi_kif *)v; | |
563 | ||
564 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
565 | ||
566 | pfi_update++; | |
567 | pfi_kif_update(kif); | |
568 | } | |
569 | ||
570 | int | |
571 | pfi_if_compare(struct pfi_kif *p, struct pfi_kif *q) | |
572 | { | |
573 | return (strncmp(p->pfik_name, q->pfik_name, IFNAMSIZ)); | |
574 | } | |
575 | ||
576 | void | |
577 | pfi_update_status(const char *name, struct pf_status *pfs) | |
578 | { | |
579 | struct pfi_kif *p; | |
580 | struct pfi_kif_cmp key; | |
581 | int i, j, k; | |
582 | ||
583 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
584 | ||
585 | strlcpy(key.pfik_name, name, sizeof (key.pfik_name)); | |
586 | p = RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&key); | |
587 | if (p == NULL) | |
588 | return; | |
589 | ||
590 | if (pfs) { | |
591 | bzero(pfs->pcounters, sizeof (pfs->pcounters)); | |
592 | bzero(pfs->bcounters, sizeof (pfs->bcounters)); | |
593 | } | |
594 | /* just clear statistics */ | |
595 | if (pfs == NULL) { | |
596 | bzero(p->pfik_packets, sizeof (p->pfik_packets)); | |
597 | bzero(p->pfik_bytes, sizeof (p->pfik_bytes)); | |
598 | p->pfik_tzero = pf_time_second(); | |
599 | } | |
600 | for (i = 0; i < 2; i++) | |
601 | for (j = 0; j < 2; j++) | |
602 | for (k = 0; k < 2; k++) { | |
603 | pfs->pcounters[i][j][k] += | |
604 | p->pfik_packets[i][j][k]; | |
605 | pfs->bcounters[i][j] += | |
606 | p->pfik_bytes[i][j][k]; | |
607 | } | |
608 | } | |
609 | ||
610 | int | |
611 | pfi_get_ifaces(const char *name, struct pfi_kif *buf, int *size) | |
612 | { | |
613 | struct pfi_kif *p, *nextp; | |
614 | int n = 0; | |
615 | ||
616 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
617 | ||
618 | for (p = RB_MIN(pfi_ifhead, &pfi_ifs); p; p = nextp) { | |
619 | nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); | |
620 | if (pfi_skip_if(name, p)) | |
621 | continue; | |
622 | if (*size > n++) { | |
623 | if (!p->pfik_tzero) | |
624 | p->pfik_tzero = pf_time_second(); | |
625 | pfi_kif_ref(p, PFI_KIF_REF_RULE); | |
626 | buf++; | |
627 | if (copyout(p, CAST_USER_ADDR_T(buf), sizeof (*buf))) { | |
628 | pfi_kif_unref(p, PFI_KIF_REF_RULE); | |
629 | return (EFAULT); | |
630 | } | |
631 | nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); | |
632 | pfi_kif_unref(p, PFI_KIF_REF_RULE); | |
633 | } | |
634 | } | |
635 | *size = n; | |
636 | return (0); | |
637 | } | |
638 | ||
639 | int | |
640 | pfi_skip_if(const char *filter, struct pfi_kif *p) | |
641 | { | |
642 | int n; | |
643 | ||
644 | if (filter == NULL || !*filter) | |
645 | return (0); | |
646 | if (strcmp(p->pfik_name, filter) == 0) | |
647 | return (0); /* exact match */ | |
648 | n = strlen(filter); | |
649 | if (n < 1 || n >= IFNAMSIZ) | |
650 | return (1); /* sanity check */ | |
651 | if (filter[n-1] >= '0' && filter[n-1] <= '9') | |
652 | return (1); /* only do exact match in that case */ | |
653 | if (strncmp(p->pfik_name, filter, n)) | |
654 | return (1); /* prefix doesn't match */ | |
655 | return (p->pfik_name[n] < '0' || p->pfik_name[n] > '9'); | |
656 | } | |
657 | ||
658 | int | |
659 | pfi_set_flags(const char *name, int flags) | |
660 | { | |
661 | struct pfi_kif *p; | |
662 | ||
663 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
664 | ||
665 | RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { | |
666 | if (pfi_skip_if(name, p)) | |
667 | continue; | |
668 | p->pfik_flags |= flags; | |
669 | } | |
670 | return (0); | |
671 | } | |
672 | ||
673 | int | |
674 | pfi_clear_flags(const char *name, int flags) | |
675 | { | |
676 | struct pfi_kif *p; | |
677 | ||
678 | lck_mtx_assert(pf_lock, LCK_MTX_ASSERT_OWNED); | |
679 | ||
680 | RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { | |
681 | if (pfi_skip_if(name, p)) | |
682 | continue; | |
683 | p->pfik_flags &= ~flags; | |
684 | } | |
685 | return (0); | |
686 | } | |
687 | ||
688 | /* from pf_print_state.c */ | |
689 | int | |
690 | pfi_unmask(void *addr) | |
691 | { | |
692 | struct pf_addr *m = addr; | |
693 | int i = 31, j = 0, b = 0; | |
694 | u_int32_t tmp; | |
695 | ||
696 | while (j < 4 && m->addr32[j] == 0xffffffff) { | |
697 | b += 32; | |
698 | j++; | |
699 | } | |
700 | if (j < 4) { | |
701 | tmp = ntohl(m->addr32[j]); | |
702 | for (i = 31; tmp & (1 << i); --i) | |
703 | b++; | |
704 | } | |
705 | return (b); | |
706 | } |