1999-01-15 17:49:17 +01:00
|
|
|
/*
|
1999-03-17 15:29:39 +01:00
|
|
|
* BIRD Internet Routing Daemon -- Filters
|
1999-01-15 17:49:17 +01:00
|
|
|
*
|
1999-03-17 15:29:39 +01:00
|
|
|
* (c) 1999 Pavel Machek <pavel@ucw.cz>
|
1999-01-15 17:49:17 +01:00
|
|
|
*
|
|
|
|
* Can be freely distributed and used under the terms of the GNU GPL.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _BIRD_FILT_H_
|
|
|
|
#define _BIRD_FILT_H_
|
|
|
|
|
|
|
|
#include "lib/resource.h"
|
1999-04-07 14:11:08 +02:00
|
|
|
#include "lib/ip.h"
|
2008-10-26 22:45:09 +01:00
|
|
|
#include "nest/route.h"
|
2000-04-17 13:20:00 +02:00
|
|
|
#include "nest/attrs.h"
|
1999-01-15 17:49:17 +01:00
|
|
|
|
1999-03-08 21:30:06 +01:00
|
|
|
struct f_inst { /* Instruction */
|
|
|
|
struct f_inst *next; /* Structure is 16 bytes, anyway */
|
1999-11-18 15:01:36 +01:00
|
|
|
u16 code;
|
|
|
|
u16 aux;
|
1999-04-10 11:45:08 +02:00
|
|
|
union {
|
|
|
|
int i;
|
|
|
|
void *p;
|
|
|
|
} a1;
|
|
|
|
union {
|
|
|
|
int i;
|
|
|
|
void *p;
|
|
|
|
} a2;
|
2000-05-16 20:50:51 +02:00
|
|
|
int lineno;
|
1999-01-15 17:49:17 +01:00
|
|
|
};
|
|
|
|
|
1999-04-10 11:45:08 +02:00
|
|
|
#define arg1 a1.p
|
|
|
|
#define arg2 a2.p
|
|
|
|
|
2012-03-18 17:32:30 +01:00
|
|
|
/* Not enough fields in f_inst for three args used by roa_check() */
|
|
|
|
struct f_inst_roa_check {
|
|
|
|
struct f_inst i;
|
2016-11-08 17:46:29 +01:00
|
|
|
struct roa_table_config *rtc;
|
2012-03-18 17:32:30 +01:00
|
|
|
};
|
|
|
|
|
2016-10-01 12:50:29 +02:00
|
|
|
struct f_inst3 {
|
|
|
|
struct f_inst i;
|
|
|
|
union {
|
|
|
|
int i;
|
|
|
|
void *p;
|
|
|
|
} a3;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define INST3(x) (((struct f_inst3 *) x)->a3)
|
|
|
|
|
|
|
|
|
2000-05-17 00:37:53 +02:00
|
|
|
struct f_prefix {
|
1999-04-07 14:11:08 +02:00
|
|
|
ip_addr ip;
|
|
|
|
int len;
|
1999-10-12 08:27:42 +02:00
|
|
|
#define LEN_MASK 0xff
|
1999-11-03 23:23:01 +01:00
|
|
|
#define LEN_PLUS 0x1000000
|
|
|
|
#define LEN_MINUS 0x2000000
|
|
|
|
#define LEN_RANGE 0x4000000
|
|
|
|
/* If range then prefix must be in range (len >> 16 & 0xff, len >> 8 & 0xff) */
|
1999-04-07 14:11:08 +02:00
|
|
|
};
|
|
|
|
|
1999-03-08 21:30:06 +01:00
|
|
|
struct f_val {
|
|
|
|
int type;
|
|
|
|
union {
|
2013-11-24 00:17:02 +01:00
|
|
|
uint i;
|
2011-08-12 21:03:43 +02:00
|
|
|
u64 ec;
|
2016-10-01 12:50:29 +02:00
|
|
|
lcomm lc;
|
2016-11-08 17:46:29 +01:00
|
|
|
/* ip_addr ip; Folded into prefix */
|
2000-05-17 00:37:53 +02:00
|
|
|
struct f_prefix px;
|
1999-04-07 14:11:08 +02:00
|
|
|
char *s;
|
1999-04-12 21:58:18 +02:00
|
|
|
struct f_tree *t;
|
2009-03-31 12:55:57 +02:00
|
|
|
struct f_trie *ti;
|
2000-04-12 15:31:39 +02:00
|
|
|
struct adata *ad;
|
|
|
|
struct f_path_mask *path_mask;
|
1999-03-08 21:30:06 +01:00
|
|
|
} val;
|
|
|
|
};
|
|
|
|
|
1999-03-17 15:29:39 +01:00
|
|
|
struct filter {
|
|
|
|
char *name;
|
|
|
|
struct f_inst *root;
|
|
|
|
};
|
|
|
|
|
1999-03-08 21:30:06 +01:00
|
|
|
struct f_inst *f_new_inst(void);
|
2000-04-12 16:05:37 +02:00
|
|
|
struct f_inst *f_new_dynamic_attr(int type, int f_type, int code); /* Type as core knows it, type as filters know it, and code of dynamic attribute */
|
1999-04-12 21:58:18 +02:00
|
|
|
struct f_tree *f_new_tree(void);
|
2000-05-25 17:20:40 +02:00
|
|
|
struct f_inst *f_generate_complex(int operation, int operation_aux, struct f_inst *dyn, struct f_inst *argument);
|
2012-03-18 17:32:30 +01:00
|
|
|
struct f_inst *f_generate_roa_check(struct symbol *sym, struct f_inst *prefix, struct f_inst *asn);
|
|
|
|
|
1999-04-12 21:58:18 +02:00
|
|
|
|
|
|
|
struct f_tree *build_tree(struct f_tree *);
|
|
|
|
struct f_tree *find_tree(struct f_tree *t, struct f_val val);
|
2000-01-31 18:44:22 +01:00
|
|
|
int same_tree(struct f_tree *t1, struct f_tree *t2);
|
2013-10-05 20:12:28 +02:00
|
|
|
void tree_format(struct f_tree *t, buffer *buf);
|
1999-03-02 20:49:28 +01:00
|
|
|
|
2015-02-21 14:05:20 +01:00
|
|
|
struct f_trie *f_new_trie(linpool *lp, uint node_size);
|
|
|
|
void *trie_add_prefix(struct f_trie *t, ip_addr px, int plen, int l, int h);
|
2010-07-27 17:17:11 +02:00
|
|
|
int trie_match_prefix(struct f_trie *t, ip_addr px, int plen);
|
2009-03-31 12:55:57 +02:00
|
|
|
int trie_same(struct f_trie *t1, struct f_trie *t2);
|
2013-10-05 20:12:28 +02:00
|
|
|
void trie_format(struct f_trie *t, buffer *buf);
|
2009-03-31 12:55:57 +02:00
|
|
|
|
2010-07-27 17:17:11 +02:00
|
|
|
void fprefix_get_bounds(struct f_prefix *px, int *l, int *h);
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
trie_add_fprefix(struct f_trie *t, struct f_prefix *px)
|
|
|
|
{
|
|
|
|
int l, h;
|
|
|
|
fprefix_get_bounds(px, &l, &h);
|
|
|
|
trie_add_prefix(t, px->ip, px->len & LEN_MASK, l, h);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
trie_match_fprefix(struct f_trie *t, struct f_prefix *px)
|
|
|
|
{
|
|
|
|
return trie_match_prefix(t, px->ip, px->len & LEN_MASK);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1999-08-03 21:31:11 +02:00
|
|
|
struct ea_list;
|
|
|
|
struct rte;
|
|
|
|
|
2000-03-29 11:02:00 +02:00
|
|
|
int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags);
|
2015-07-20 11:12:02 +02:00
|
|
|
struct f_val f_eval_rte(struct f_inst *expr, struct rte **rte, struct linpool *tmp_pool);
|
2013-07-25 13:15:32 +02:00
|
|
|
struct f_val f_eval(struct f_inst *expr, struct linpool *tmp_pool);
|
2013-11-24 00:17:02 +01:00
|
|
|
uint f_eval_int(struct f_inst *expr);
|
2009-08-27 19:01:04 +02:00
|
|
|
u32 f_eval_asn(struct f_inst *expr);
|
|
|
|
|
1999-04-05 22:10:31 +02:00
|
|
|
char *filter_name(struct filter *filter);
|
2000-01-16 18:49:32 +01:00
|
|
|
int filter_same(struct filter *new, struct filter *old);
|
1999-03-17 15:29:39 +01:00
|
|
|
|
2000-01-31 18:44:22 +01:00
|
|
|
int i_same(struct f_inst *f1, struct f_inst *f2);
|
|
|
|
|
1999-04-12 21:58:18 +02:00
|
|
|
int val_compare(struct f_val v1, struct f_val v2);
|
2013-10-02 14:41:37 +02:00
|
|
|
int val_same(struct f_val v1, struct f_val v2);
|
1999-04-07 14:11:08 +02:00
|
|
|
|
2013-10-05 20:12:28 +02:00
|
|
|
void val_format(struct f_val v, buffer *buf);
|
|
|
|
|
2013-07-25 13:15:32 +02:00
|
|
|
|
1999-04-07 14:11:08 +02:00
|
|
|
#define F_NOP 0
|
1999-10-12 08:27:42 +02:00
|
|
|
#define F_NONL 1
|
|
|
|
#define F_ACCEPT 2 /* Need to preserve ordering: accepts < rejects! */
|
1999-12-16 13:18:19 +01:00
|
|
|
#define F_REJECT 3
|
|
|
|
#define F_ERROR 4
|
|
|
|
#define F_QUITBIRD 5
|
1999-01-15 19:13:55 +01:00
|
|
|
|
1999-04-05 22:10:31 +02:00
|
|
|
#define FILTER_ACCEPT NULL
|
|
|
|
#define FILTER_REJECT ((void *) 1)
|
|
|
|
|
1999-03-29 22:21:28 +02:00
|
|
|
/* Type numbers must be in 0..0xff range */
|
|
|
|
#define T_MASK 0xff
|
|
|
|
|
|
|
|
/* Internal types */
|
1999-11-18 15:01:36 +01:00
|
|
|
/* Do not use type of zero, that way we'll see errors easier. */
|
|
|
|
#define T_VOID 1
|
1999-03-29 22:21:28 +02:00
|
|
|
|
|
|
|
/* User visible types, which fit in int */
|
|
|
|
#define T_INT 0x10
|
|
|
|
#define T_BOOL 0x11
|
2000-04-26 10:03:50 +02:00
|
|
|
#define T_PAIR 0x12 /* Notice that pair is stored as integer: first << 16 | second */
|
2010-03-29 19:29:03 +02:00
|
|
|
#define T_QUAD 0x13
|
1999-11-10 13:44:07 +01:00
|
|
|
|
2000-02-25 12:15:26 +01:00
|
|
|
/* Put enumerational types in 0x30..0x3f range */
|
1999-11-10 13:44:07 +01:00
|
|
|
#define T_ENUM_LO 0x30
|
2000-02-25 12:15:26 +01:00
|
|
|
#define T_ENUM_HI 0x3f
|
1999-11-10 13:44:07 +01:00
|
|
|
|
1999-11-10 14:44:29 +01:00
|
|
|
#define T_ENUM_RTS 0x30
|
2000-04-26 09:47:47 +02:00
|
|
|
#define T_ENUM_BGP_ORIGIN 0x31
|
2000-05-30 12:42:39 +02:00
|
|
|
#define T_ENUM_SCOPE 0x32
|
|
|
|
#define T_ENUM_RTC 0x33
|
|
|
|
#define T_ENUM_RTD 0x34
|
2012-03-18 17:32:30 +01:00
|
|
|
#define T_ENUM_ROA 0x35
|
2000-04-26 09:47:47 +02:00
|
|
|
/* new enums go here */
|
2000-04-17 14:40:38 +02:00
|
|
|
#define T_ENUM_EMPTY 0x3f /* Special hack for atomic_aggr */
|
1999-11-10 14:44:29 +01:00
|
|
|
|
1999-11-10 13:44:07 +01:00
|
|
|
#define T_ENUM T_ENUM_LO ... T_ENUM_HI
|
1999-03-29 22:21:28 +02:00
|
|
|
|
|
|
|
/* Bigger ones */
|
|
|
|
#define T_IP 0x20
|
|
|
|
#define T_PREFIX 0x21
|
|
|
|
#define T_STRING 0x22
|
2000-04-12 15:07:53 +02:00
|
|
|
#define T_PATH_MASK 0x23 /* mask for BGP path */
|
2000-04-12 15:31:39 +02:00
|
|
|
#define T_PATH 0x24 /* BGP path */
|
|
|
|
#define T_CLIST 0x25 /* Community list */
|
2016-10-01 12:50:29 +02:00
|
|
|
#define T_EC 0x26 /* Extended community value, u64 */
|
|
|
|
#define T_ECLIST 0x27 /* Extended community list */
|
|
|
|
#define T_LC 0x28 /* Large community value, lcomm */
|
|
|
|
#define T_LCLIST 0x29 /* Large community list */
|
1999-03-29 22:21:28 +02:00
|
|
|
|
2000-02-25 12:15:26 +01:00
|
|
|
#define T_RETURN 0x40
|
1999-03-29 22:21:28 +02:00
|
|
|
#define T_SET 0x80
|
2009-03-31 12:55:57 +02:00
|
|
|
#define T_PREFIX_SET 0x81
|
1999-03-17 11:19:07 +01:00
|
|
|
|
2013-09-26 22:08:21 +02:00
|
|
|
|
2016-11-08 17:46:29 +01:00
|
|
|
#define SA_FROM 1
|
|
|
|
#define SA_GW 2
|
|
|
|
#define SA_NET 3
|
|
|
|
#define SA_PROTO 4
|
|
|
|
#define SA_SOURCE 5
|
|
|
|
#define SA_SCOPE 6
|
|
|
|
#define SA_CAST 7
|
|
|
|
#define SA_DEST 8
|
|
|
|
#define SA_IFNAME 9
|
|
|
|
#define SA_IFINDEX 10
|
2013-09-26 22:08:21 +02:00
|
|
|
|
|
|
|
|
1999-04-12 21:58:18 +02:00
|
|
|
struct f_tree {
|
|
|
|
struct f_tree *left, *right;
|
|
|
|
struct f_val from, to;
|
|
|
|
void *data;
|
|
|
|
};
|
|
|
|
|
2009-03-31 12:55:57 +02:00
|
|
|
struct f_trie_node
|
|
|
|
{
|
|
|
|
ip_addr addr, mask, accept;
|
|
|
|
int plen;
|
|
|
|
struct f_trie_node *c[2];
|
|
|
|
};
|
|
|
|
|
|
|
|
struct f_trie
|
|
|
|
{
|
2010-07-27 17:17:11 +02:00
|
|
|
linpool *lp;
|
2009-03-31 12:55:57 +02:00
|
|
|
int zero;
|
2015-02-21 14:05:20 +01:00
|
|
|
uint node_size;
|
|
|
|
struct f_trie_node root[0]; /* Root trie node follows */
|
2009-03-31 12:55:57 +02:00
|
|
|
};
|
|
|
|
|
1999-10-12 08:27:42 +02:00
|
|
|
#define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val));
|
|
|
|
|
2000-03-30 10:50:30 +02:00
|
|
|
#define FF_FORCE_TMPATTR 1 /* Force all attributes to be temporary */
|
2000-03-29 11:02:00 +02:00
|
|
|
|
1999-01-15 17:49:17 +01:00
|
|
|
#endif
|