2004-02-28 18:32:53 +01:00
|
|
|
/* $FreeBSD$ */
|
2004-02-28 17:52:45 +01:00
|
|
|
/* $OpenBSD: pfctl.h,v 1.25 2003/08/29 21:47:36 cedric Exp $ */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 2001 Daniel Hartmeier
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* - Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* - Redistributions in binary form must reproduce the above
|
|
|
|
* copyright notice, this list of conditions and the following
|
|
|
|
* disclaimer in the documentation and/or other materials provided
|
|
|
|
* with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
* COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _PFCTL_H_
|
|
|
|
#define _PFCTL_H_
|
|
|
|
|
|
|
|
enum { PFRB_TABLES = 1, PFRB_TSTATS, PFRB_ADDRS, PFRB_ASTATS, PFRB_MAX };
|
|
|
|
struct pfr_buffer {
|
|
|
|
int pfrb_type; /* type of content, see enum above */
|
|
|
|
int pfrb_size; /* number of objects in buffer */
|
|
|
|
int pfrb_msize; /* maximum number of objects in buffer */
|
|
|
|
void *pfrb_caddr; /* malloc'ated memory area */
|
|
|
|
};
|
|
|
|
#define PFRB_FOREACH(var, buf) \
|
|
|
|
for ((var) = pfr_buf_next((buf), NULL); \
|
|
|
|
(var) != NULL; \
|
|
|
|
(var) = pfr_buf_next((buf), (var)))
|
|
|
|
|
|
|
|
void pfr_set_fd(int);
|
|
|
|
int pfr_get_fd(void);
|
|
|
|
int pfr_clr_tables(struct pfr_table *, int *, int);
|
|
|
|
int pfr_add_tables(struct pfr_table *, int, int *, int);
|
|
|
|
int pfr_del_tables(struct pfr_table *, int, int *, int);
|
|
|
|
int pfr_get_tables(struct pfr_table *, struct pfr_table *, int *, int);
|
|
|
|
int pfr_get_tstats(struct pfr_table *, struct pfr_tstats *, int *, int);
|
|
|
|
int pfr_clr_tstats(struct pfr_table *, int, int *, int);
|
|
|
|
int pfr_clr_addrs(struct pfr_table *, int *, int);
|
|
|
|
int pfr_add_addrs(struct pfr_table *, struct pfr_addr *, int, int *, int);
|
|
|
|
int pfr_del_addrs(struct pfr_table *, struct pfr_addr *, int, int *, int);
|
|
|
|
int pfr_set_addrs(struct pfr_table *, struct pfr_addr *, int, int *,
|
|
|
|
int *, int *, int *, int);
|
|
|
|
int pfr_get_addrs(struct pfr_table *, struct pfr_addr *, int *, int);
|
|
|
|
int pfr_get_astats(struct pfr_table *, struct pfr_astats *, int *, int);
|
|
|
|
int pfr_clr_astats(struct pfr_table *, struct pfr_addr *, int, int *, int);
|
|
|
|
int pfr_tst_addrs(struct pfr_table *, struct pfr_addr *, int, int *, int);
|
|
|
|
int pfr_set_tflags(struct pfr_table *, int, int, int, int *, int *, int);
|
|
|
|
int pfr_ina_begin(struct pfr_table *, int *, int *, int);
|
|
|
|
int pfr_ina_commit(struct pfr_table *, int, int *, int *, int);
|
|
|
|
int pfr_ina_define(struct pfr_table *, struct pfr_addr *, int, int *,
|
|
|
|
int *, int, int);
|
|
|
|
void pfr_buf_clear(struct pfr_buffer *);
|
|
|
|
int pfr_buf_add(struct pfr_buffer *, const void *);
|
|
|
|
void *pfr_buf_next(struct pfr_buffer *, const void *);
|
|
|
|
int pfr_buf_grow(struct pfr_buffer *, int);
|
|
|
|
int pfr_buf_load(struct pfr_buffer *, char *, int,
|
|
|
|
int (*)(struct pfr_buffer *, char *, int));
|
|
|
|
char *pfr_strerror(int);
|
|
|
|
|
|
|
|
int pfctl_clear_tables(const char *, const char *, int);
|
|
|
|
int pfctl_show_tables(const char *, const char *, int);
|
|
|
|
int pfctl_command_tables(int, char *[], char *, const char *, char *,
|
|
|
|
const char *, const char *, int);
|
|
|
|
int pfctl_show_altq(int, int, int);
|
|
|
|
void warn_namespace_collision(const char *);
|
|
|
|
|
2004-03-15 14:41:17 +01:00
|
|
|
#ifdef __FreeBSD__
|
2004-02-28 18:32:53 +01:00
|
|
|
extern int altqsupport;
|
|
|
|
#endif
|
|
|
|
|
2004-02-28 17:52:45 +01:00
|
|
|
#ifndef DEFAULT_PRIORITY
|
|
|
|
#define DEFAULT_PRIORITY 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef DEFAULT_QLIMIT
|
|
|
|
#define DEFAULT_QLIMIT 50
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* generalized service curve used for admission control
|
|
|
|
*/
|
|
|
|
struct segment {
|
|
|
|
LIST_ENTRY(segment) _next;
|
|
|
|
double x, y, d, m;
|
|
|
|
};
|
|
|
|
|
|
|
|
int check_commit_altq(int, int);
|
|
|
|
void pfaltq_store(struct pf_altq *);
|
|
|
|
void pfaltq_free(struct pf_altq *);
|
|
|
|
struct pf_altq *pfaltq_lookup(const char *);
|
|
|
|
char *rate2str(double);
|
|
|
|
|
|
|
|
void print_addr(struct pf_addr_wrap *, sa_family_t, int);
|
|
|
|
void print_host(struct pf_state_host *, sa_family_t, int);
|
|
|
|
void print_seq(struct pf_state_peer *);
|
|
|
|
void print_state(struct pf_state *, int);
|
|
|
|
int unmask(struct pf_addr *, sa_family_t);
|
|
|
|
|
|
|
|
int pfctl_cmdline_symset(char *);
|
|
|
|
|
|
|
|
#endif /* _PFCTL_H_ */
|