1 /* $OpenBSD: pfctl_radix.c,v 1.27 2005/05/21 21:03:58 henning Exp $ */
2
3 /*-
4 * SPDX-License-Identifier: BSD-2-Clause
5 *
6 * Copyright (c) 2002 Cedric Berger
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 */
34
35 #include <sys/types.h>
36 #include <sys/ioctl.h>
37 #include <sys/socket.h>
38
39 #include <net/if.h>
40 #include <net/pfvar.h>
41
42 #include <errno.h>
43 #include <string.h>
44 #include <ctype.h>
45 #include <stdio.h>
46 #include <stdlib.h>
47 #include <limits.h>
48 #include <err.h>
49
50 #include "pfctl.h"
51 #include "pfctl_parser.h"
52
53 #define BUF_SIZE 256
54
55 extern int dev;
56
57 static int pfr_next_token(char buf[BUF_SIZE], FILE *);
58
59 struct pfr_ktablehead pfr_ktables = { 0 };
60 RB_GENERATE(pfr_ktablehead, pfr_ktable, pfrkt_tree, pfr_ktable_compare);
61
62 int
pfr_ktable_compare(struct pfr_ktable * p,struct pfr_ktable * q)63 pfr_ktable_compare(struct pfr_ktable *p, struct pfr_ktable *q)
64 {
65 int d;
66
67 if ((d = strncmp(p->pfrkt_name, q->pfrkt_name, PF_TABLE_NAME_SIZE)))
68 return (d);
69 return (strcmp(p->pfrkt_anchor, q->pfrkt_anchor));
70 }
71
72 static void
pfr_report_error(struct pfr_table * tbl,struct pfioc_table * io,const char * err)73 pfr_report_error(struct pfr_table *tbl, struct pfioc_table *io,
74 const char *err)
75 {
76 unsigned long maxcount;
77 size_t s;
78
79 s = sizeof(maxcount);
80 if (sysctlbyname("net.pf.request_maxcount", &maxcount, &s, NULL,
81 0) == -1)
82 return;
83
84 if (io->pfrio_size > maxcount || io->pfrio_size2 > maxcount)
85 fprintf(stderr, "cannot %s %s: too many elements.\n"
86 "Consider increasing net.pf.request_maxcount.",
87 err, tbl->pfrt_name);
88 }
89
90 int
pfr_add_table(struct pfr_table * tbl,int * nadd,int flags)91 pfr_add_table(struct pfr_table *tbl, int *nadd, int flags)
92 {
93 return (pfctl_add_table(pfh, tbl, nadd, flags));
94 }
95
96 int
pfr_del_table(struct pfr_table * tbl,int * ndel,int flags)97 pfr_del_table(struct pfr_table *tbl, int *ndel, int flags)
98 {
99 return (pfctl_del_table(pfh, tbl, ndel, flags));
100 }
101
102 int
pfr_get_tables(struct pfr_table * filter,struct pfr_table * tbl,int * size,int flags)103 pfr_get_tables(struct pfr_table *filter, struct pfr_table *tbl, int *size,
104 int flags)
105 {
106 struct pfioc_table io;
107
108 if (size == NULL || *size < 0 || (*size && tbl == NULL)) {
109 errno = EINVAL;
110 return (-1);
111 }
112 bzero(&io, sizeof io);
113 io.pfrio_flags = flags;
114 if (filter != NULL)
115 io.pfrio_table = *filter;
116 io.pfrio_buffer = tbl;
117 io.pfrio_esize = sizeof(*tbl);
118 io.pfrio_size = *size;
119 if (ioctl(dev, DIOCRGETTABLES, &io)) {
120 pfr_report_error(tbl, &io, "get table");
121 return (-1);
122 }
123 *size = io.pfrio_size;
124 return (0);
125 }
126
127 int
pfr_clr_addrs(struct pfr_table * tbl,int * ndel,int flags)128 pfr_clr_addrs(struct pfr_table *tbl, int *ndel, int flags)
129 {
130 return (pfctl_clear_addrs(pfh, tbl, ndel, flags));
131 }
132
133 int
pfr_add_addrs(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * nadd,int flags)134 pfr_add_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
135 int *nadd, int flags)
136 {
137 int ret;
138
139 if (*nadd)
140 *nadd = 0;
141
142 ret = pfctl_table_add_addrs_h(pfh, tbl, addr, size, nadd, flags);
143 if (ret) {
144 errno = ret;
145 return (-1);
146 }
147 return (0);
148 }
149
150 int
pfr_del_addrs(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * ndel,int flags)151 pfr_del_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
152 int *ndel, int flags)
153 {
154 int ret;
155
156 ret = pfctl_table_del_addrs_h(pfh, tbl, addr, size, ndel, flags);
157 if (ret) {
158 errno = ret;
159 return (-1);
160 }
161 return (0);
162 }
163
164 int
pfr_set_addrs(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * nadd,int * ndel,int * nchange,int flags)165 pfr_set_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
166 int *nadd, int *ndel, int *nchange, int flags)
167 {
168 int ret;
169
170 ret = pfctl_table_set_addrs_h(pfh, tbl, addr, size, nadd, ndel,
171 nchange, flags);
172 if (ret) {
173 errno = ret;
174 return (-1);
175 }
176 return (0);
177 }
178
179 int
pfr_get_addrs(struct pfr_table * tbl,struct pfr_addr * addr,int * size,int flags)180 pfr_get_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int *size,
181 int flags)
182 {
183 int ret;
184
185 ret = pfctl_table_get_addrs_h(pfh, tbl, addr, size, flags);
186 if (ret) {
187 errno = ret;
188 return (-1);
189 }
190 return (0);
191 }
192
193 int
pfr_get_astats(struct pfr_table * tbl,struct pfr_astats * addr,int * size,int flags)194 pfr_get_astats(struct pfr_table *tbl, struct pfr_astats *addr, int *size,
195 int flags)
196 {
197 return (pfctl_get_astats(pfh, tbl, addr, size, flags));
198 }
199
200 int
pfr_clr_astats(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * nzero,int flags)201 pfr_clr_astats(struct pfr_table *tbl, struct pfr_addr *addr, int size,
202 int *nzero, int flags)
203 {
204 struct pfioc_table io;
205
206 if (size < 0 || !tbl || (size && !addr)) {
207 errno = EINVAL;
208 return (-1);
209 }
210 bzero(&io, sizeof io);
211 io.pfrio_flags = flags;
212 io.pfrio_table = *tbl;
213 io.pfrio_buffer = addr;
214 io.pfrio_esize = sizeof(*addr);
215 io.pfrio_size = size;
216 if (ioctl(dev, DIOCRCLRASTATS, &io) == -1)
217 return (-1);
218 if (nzero)
219 *nzero = io.pfrio_nzero;
220 return (0);
221 }
222
223 int
pfr_tst_addrs(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * nmatch,int flags)224 pfr_tst_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
225 int *nmatch, int flags)
226 {
227 struct pfioc_table io;
228
229 if (tbl == NULL || size < 0 || (size && addr == NULL)) {
230 errno = EINVAL;
231 return (-1);
232 }
233 bzero(&io, sizeof io);
234 io.pfrio_flags = flags;
235 io.pfrio_table = *tbl;
236 io.pfrio_buffer = addr;
237 io.pfrio_esize = sizeof(*addr);
238 io.pfrio_size = size;
239 if (ioctl(dev, DIOCRTSTADDRS, &io)) {
240 pfr_report_error(tbl, &io, "test addresses in");
241 return (-1);
242 }
243 if (nmatch)
244 *nmatch = io.pfrio_nmatch;
245 return (0);
246 }
247
248 int
pfr_ina_define(struct pfr_table * tbl,struct pfr_addr * addr,int size,int * nadd,int * naddr,int ticket,int flags)249 pfr_ina_define(struct pfr_table *tbl, struct pfr_addr *addr, int size,
250 int *nadd, int *naddr, int ticket, int flags)
251 {
252 struct pfioc_table io;
253
254 if (tbl == NULL || size < 0 || (size && addr == NULL)) {
255 DBGPRINT("%s %p %d %p\n", __func__, tbl, size, addr);
256 errno = EINVAL;
257 return (-1);
258 }
259 bzero(&io, sizeof io);
260 io.pfrio_flags = flags;
261 io.pfrio_table = *tbl;
262 io.pfrio_buffer = addr;
263 io.pfrio_esize = sizeof(*addr);
264 io.pfrio_size = size;
265 io.pfrio_ticket = ticket;
266 if (ioctl(dev, DIOCRINADEFINE, &io)) {
267 pfr_report_error(tbl, &io, "define inactive set table");
268 return (-1);
269 }
270 if (nadd != NULL)
271 *nadd = io.pfrio_nadd;
272 if (naddr != NULL)
273 *naddr = io.pfrio_naddr;
274 return (0);
275 }
276
277 /* interface management code */
278
279 int
pfi_get_ifaces(const char * filter,struct pfi_kif * buf,int * size)280 pfi_get_ifaces(const char *filter, struct pfi_kif *buf, int *size)
281 {
282 struct pfioc_iface io;
283
284 if (size == NULL || *size < 0 || (*size && buf == NULL)) {
285 errno = EINVAL;
286 return (-1);
287 }
288 bzero(&io, sizeof io);
289 if (filter != NULL)
290 if (strlcpy(io.pfiio_name, filter, sizeof(io.pfiio_name)) >=
291 sizeof(io.pfiio_name)) {
292 errno = EINVAL;
293 return (-1);
294 }
295 io.pfiio_buffer = buf;
296 io.pfiio_esize = sizeof(*buf);
297 io.pfiio_size = *size;
298 if (ioctl(dev, DIOCIGETIFACES, &io))
299 return (-1);
300 *size = io.pfiio_size;
301 return (0);
302 }
303
304 /* buffer management code */
305
306 const size_t buf_esize[PFRB_MAX] = { 0,
307 sizeof(struct pfr_table), sizeof(struct pfr_tstats),
308 sizeof(struct pfr_addr), sizeof(struct pfr_astats),
309 sizeof(struct pfi_kif), sizeof(struct pfioc_trans_e)
310 };
311
312 /*
313 * add one element to the buffer
314 */
315 int
pfr_buf_add(struct pfr_buffer * b,const void * e)316 pfr_buf_add(struct pfr_buffer *b, const void *e)
317 {
318 size_t bs;
319
320 if (b == NULL || b->pfrb_type <= 0 || b->pfrb_type >= PFRB_MAX ||
321 e == NULL) {
322 errno = EINVAL;
323 return (-1);
324 }
325 bs = buf_esize[b->pfrb_type];
326 if (b->pfrb_size == b->pfrb_msize)
327 if (pfr_buf_grow(b, 0))
328 return (-1);
329 memcpy(((caddr_t)b->pfrb_caddr) + bs * b->pfrb_size, e, bs);
330 b->pfrb_size++;
331 return (0);
332 }
333
334 /*
335 * return next element of the buffer (or first one if prev is NULL)
336 * see PFRB_FOREACH macro
337 */
338 void *
pfr_buf_next(struct pfr_buffer * b,const void * prev)339 pfr_buf_next(struct pfr_buffer *b, const void *prev)
340 {
341 size_t bs;
342
343 if (b == NULL || b->pfrb_type <= 0 || b->pfrb_type >= PFRB_MAX)
344 return (NULL);
345 if (b->pfrb_size == 0)
346 return (NULL);
347 if (prev == NULL)
348 return (b->pfrb_caddr);
349 bs = buf_esize[b->pfrb_type];
350 if ((((caddr_t)prev)-((caddr_t)b->pfrb_caddr)) / bs >= b->pfrb_size-1)
351 return (NULL);
352 return (((caddr_t)prev) + bs);
353 }
354
355 /*
356 * minsize:
357 * 0: make the buffer somewhat bigger
358 * n: make room for "n" entries in the buffer
359 */
360 int
pfr_buf_grow(struct pfr_buffer * b,int minsize)361 pfr_buf_grow(struct pfr_buffer *b, int minsize)
362 {
363 caddr_t p;
364 size_t bs;
365
366 if (b == NULL || b->pfrb_type <= 0 || b->pfrb_type >= PFRB_MAX) {
367 errno = EINVAL;
368 return (-1);
369 }
370 if (minsize != 0 && minsize <= b->pfrb_msize)
371 return (0);
372 bs = buf_esize[b->pfrb_type];
373 if (!b->pfrb_msize) {
374 if (minsize < 64)
375 minsize = 64;
376 }
377 if (minsize == 0)
378 minsize = b->pfrb_msize * 2;
379 p = reallocarray(b->pfrb_caddr, minsize, bs);
380 if (p == NULL)
381 return (-1);
382 bzero(p + b->pfrb_msize * bs, (minsize - b->pfrb_msize) * bs);
383 b->pfrb_caddr = p;
384 b->pfrb_msize = minsize;
385 return (0);
386 }
387
388 /*
389 * reset buffer and free memory.
390 */
391 void
pfr_buf_clear(struct pfr_buffer * b)392 pfr_buf_clear(struct pfr_buffer *b)
393 {
394 if (b == NULL)
395 return;
396 free(b->pfrb_caddr);
397 b->pfrb_caddr = NULL;
398 b->pfrb_size = b->pfrb_msize = 0;
399 }
400
401 int
pfr_buf_load(struct pfr_buffer * b,char * file,int nonetwork,int (* append_addr)(struct pfr_buffer *,char *,int,int),int opts)402 pfr_buf_load(struct pfr_buffer *b, char *file, int nonetwork,
403 int (*append_addr)(struct pfr_buffer *, char *, int, int), int opts)
404 {
405 FILE *fp;
406 char buf[BUF_SIZE];
407 int rv;
408
409 if (file == NULL)
410 return (0);
411 if (!strcmp(file, "-"))
412 fp = stdin;
413 else {
414 fp = pfctl_fopen(file, "r");
415 if (fp == NULL)
416 return (-1);
417 }
418 while ((rv = pfr_next_token(buf, fp)) == 1)
419 if (append_addr(b, buf, nonetwork, opts)) {
420 rv = -1;
421 break;
422 }
423 if (fp != stdin)
424 fclose(fp);
425 return (rv);
426 }
427
428 int
pfr_next_token(char buf[BUF_SIZE],FILE * fp)429 pfr_next_token(char buf[BUF_SIZE], FILE *fp)
430 {
431 static char next_ch = ' ';
432 int i = 0;
433
434 for (;;) {
435 /* skip spaces */
436 while (isspace(next_ch) && !feof(fp))
437 next_ch = fgetc(fp);
438 /* remove from '#' or ';' until end of line */
439 if (next_ch == '#' || next_ch == ';')
440 while (!feof(fp)) {
441 next_ch = fgetc(fp);
442 if (next_ch == '\n')
443 break;
444 }
445 else
446 break;
447 }
448 if (feof(fp)) {
449 next_ch = ' ';
450 return (0);
451 }
452 do {
453 if (i < BUF_SIZE)
454 buf[i++] = next_ch;
455 next_ch = fgetc(fp);
456 } while (!feof(fp) && !isspace(next_ch));
457 if (i >= BUF_SIZE) {
458 errno = EINVAL;
459 return (-1);
460 }
461 buf[i] = '\0';
462 return (1);
463 }
464