Statistics
| Branch: | Revision:

iof-bird-daemon / filter / filter.h @ 42a0c054

History | View | Annotate | Download (4.37 KB)

1
/*
2
 *        BIRD Internet Routing Daemon -- Filters
3
 *
4
 *        (c) 1999 Pavel Machek <pavel@ucw.cz>
5
 *
6
 *        Can be freely distributed and used under the terms of the GNU GPL.
7
 */
8

    
9
#ifndef _BIRD_FILT_H_
10
#define _BIRD_FILT_H_
11

    
12
#include "lib/resource.h"
13
#include "lib/ip.h"
14
#include "nest/route.h"
15
#include "nest/attrs.h"
16

    
17
struct f_inst {                /* Instruction */
18
  struct f_inst *next;        /* Structure is 16 bytes, anyway */
19
  u16 code;
20
  u16 aux;
21
  union {
22
    int i;
23
    void *p;
24
  } a1;
25
  union {
26
    int i;
27
    void *p;
28
  } a2;
29
  int lineno;
30
};
31

    
32
#define arg1 a1.p
33
#define arg2 a2.p
34

    
35
struct f_prefix {
36
  ip_addr ip;
37
  int len;
38
#define LEN_MASK 0xff
39
#define LEN_PLUS  0x1000000
40
#define LEN_MINUS 0x2000000
41
#define LEN_RANGE 0x4000000
42
  /* If range then prefix must be in range (len >> 16 & 0xff, len >> 8 & 0xff) */
43
};
44

    
45
struct f_val {
46
  int type;
47
  union {
48
    int i;
49
    u64 ec;
50
    /*    ip_addr ip; Folded into prefix */        
51
    struct f_prefix px;
52
    char *s;
53
    struct f_tree *t;
54
    struct f_trie *ti;
55
    struct adata *ad;
56
    struct f_path_mask *path_mask;
57
  } val;
58
};
59

    
60
struct filter {
61
  char *name;
62
  struct f_inst *root;
63
};
64

    
65
struct f_inst *f_new_inst(void);
66
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 */
67
struct f_tree *f_new_tree(void);
68
struct f_inst *f_generate_complex(int operation, int operation_aux, struct f_inst *dyn, struct f_inst *argument);
69

    
70
struct f_tree *build_tree(struct f_tree *);
71
struct f_tree *find_tree(struct f_tree *t, struct f_val val);
72
int same_tree(struct f_tree *t1, struct f_tree *t2);
73

    
74
struct f_trie *f_new_trie(linpool *lp);
75
void trie_add_prefix(struct f_trie *t, ip_addr px, int plen, int l, int h);
76
int trie_match_prefix(struct f_trie *t, ip_addr px, int plen);
77
int trie_same(struct f_trie *t1, struct f_trie *t2);
78
void trie_print(struct f_trie *t);
79

    
80
void fprefix_get_bounds(struct f_prefix *px, int *l, int *h);
81

    
82
static inline void
83
trie_add_fprefix(struct f_trie *t, struct f_prefix *px)
84
{
85
  int l, h;
86
  fprefix_get_bounds(px, &l, &h);
87
  trie_add_prefix(t, px->ip, px->len & LEN_MASK, l, h);
88
}
89

    
90
static inline int
91
trie_match_fprefix(struct f_trie *t, struct f_prefix *px)
92
{
93
  return trie_match_prefix(t, px->ip, px->len & LEN_MASK);
94
}
95

    
96

    
97
struct ea_list;
98
struct rte;
99

    
100
int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags);
101
int f_eval_int(struct f_inst *expr);
102
u32 f_eval_asn(struct f_inst *expr);
103

    
104
char *filter_name(struct filter *filter);
105
int filter_same(struct filter *new, struct filter *old);
106

    
107
int i_same(struct f_inst *f1, struct f_inst *f2);
108

    
109
int val_compare(struct f_val v1, struct f_val v2);
110
int tree_compare(const void *p1, const void *p2);
111

    
112
#define F_NOP 0
113
#define F_NONL 1
114
#define F_ACCEPT 2        /* Need to preserve ordering: accepts < rejects! */
115
#define F_REJECT 3
116
#define F_ERROR 4
117
#define F_QUITBIRD 5
118

    
119
#define FILTER_ACCEPT NULL
120
#define FILTER_REJECT ((void *) 1)
121

    
122
/* Type numbers must be in 0..0xff range */
123
#define T_MASK 0xff
124

    
125
/* Internal types */
126
/* Do not use type of zero, that way we'll see errors easier. */
127
#define T_VOID 1
128

    
129
/* User visible types, which fit in int */
130
#define T_INT 0x10
131
#define T_BOOL 0x11
132
#define T_PAIR 0x12  /*        Notice that pair is stored as integer: first << 16 | second */
133
#define T_QUAD 0x13
134

    
135
/* Put enumerational types in 0x30..0x3f range */
136
#define T_ENUM_LO 0x30
137
#define T_ENUM_HI 0x3f
138

    
139
#define T_ENUM_RTS 0x30
140
#define T_ENUM_BGP_ORIGIN 0x31
141
#define T_ENUM_SCOPE 0x32
142
#define T_ENUM_RTC 0x33
143
#define T_ENUM_RTD 0x34
144
/* new enums go here */
145
#define T_ENUM_EMPTY 0x3f        /* Special hack for atomic_aggr */
146

    
147
#define T_ENUM T_ENUM_LO ... T_ENUM_HI
148

    
149
/* Bigger ones */
150
#define T_IP 0x20
151
#define T_PREFIX 0x21
152
#define T_STRING 0x22
153
#define T_PATH_MASK 0x23        /* mask for BGP path */
154
#define T_PATH 0x24                /* BGP path */
155
#define T_CLIST 0x25                /* Community list */
156
#define T_ECLIST 0x26                /* Extended community list */
157
#define T_EC 0x27                /* Extended community value, u64 */
158

    
159
#define T_RETURN 0x40
160
#define T_SET 0x80
161
#define T_PREFIX_SET 0x81
162

    
163
struct f_tree {
164
  struct f_tree *left, *right;
165
  struct f_val from, to;
166
  void *data;
167
};
168

    
169
struct f_trie_node
170
{
171
  ip_addr addr, mask, accept;
172
  int plen;
173
  struct f_trie_node *c[2];
174
};
175

    
176
struct f_trie
177
{
178
  linpool *lp;
179
  int zero;
180
  struct f_trie_node root;
181
};
182

    
183
#define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val));
184

    
185
#define FF_FORCE_TMPATTR 1                /* Force all attributes to be temporary */
186

    
187
#endif