Statistics
| Branch: | Revision:

iof-bird-daemon / filter / filter.h @ 758458be

History | View | Annotate | Download (3.1 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/attrs.h"
15

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

    
30
#define arg1 a1.p
31
#define arg2 a2.p
32

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

    
43
struct f_val {
44
  int type;
45
  union {
46
    int i;
47
    /*    ip_addr ip; Folded into prefix */        
48
    struct f_prefix px;
49
    char *s;
50
    struct f_tree *t;
51
    struct adata *ad;
52
    struct f_path_mask *path_mask;
53
  } val;
54
};
55

    
56
struct filter {
57
  char *name;
58
  struct f_inst *root;
59
};
60

    
61
void filters_postconfig(void);
62
struct f_inst *f_new_inst(void);
63
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 */
64
struct f_tree *f_new_tree(void);
65

    
66
struct f_tree *build_tree(struct f_tree *);
67
struct f_tree *find_tree(struct f_tree *t, struct f_val val);
68
int same_tree(struct f_tree *t1, struct f_tree *t2);
69

    
70
struct ea_list;
71
struct rte;
72

    
73
int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags);
74
char *filter_name(struct filter *filter);
75
int filter_same(struct filter *new, struct filter *old);
76

    
77
int i_same(struct f_inst *f1, struct f_inst *f2);
78

    
79
int val_compare(struct f_val v1, struct f_val v2);
80
void val_print(struct f_val v);
81

    
82
#define F_NOP 0
83
#define F_NONL 1
84
#define F_ACCEPT 2        /* Need to preserve ordering: accepts < rejects! */
85
#define F_REJECT 3
86
#define F_ERROR 4
87
#define F_QUITBIRD 5
88

    
89
#define FILTER_ACCEPT NULL
90
#define FILTER_REJECT ((void *) 1)
91

    
92
/* Type numbers must be in 0..0xff range */
93
#define T_MASK 0xff
94

    
95
/* Internal types */
96
/* Do not use type of zero, that way we'll see errors easier. */
97
#define T_VOID 1
98

    
99
/* User visible types, which fit in int */
100
#define T_INT 0x10
101
#define T_BOOL 0x11
102
#define T_PAIR 0x12  /*        Notice that pair is stored as integer: first << 16 | second */
103

    
104
/* Put enumerational types in 0x30..0x3f range */
105
#define T_ENUM_LO 0x30
106
#define T_ENUM_HI 0x3f
107

    
108
#define T_ENUM_RTS 0x30
109
#define T_ENUM_BGP_ORIGIN 0x31
110
/* new enums go here */
111
#define T_ENUM_EMPTY 0x3f        /* Special hack for atomic_aggr */
112

    
113
#define T_ENUM T_ENUM_LO ... T_ENUM_HI
114

    
115
/* Bigger ones */
116
#define T_IP 0x20
117
#define T_PREFIX 0x21
118
#define T_STRING 0x22
119
#define T_PATH_MASK 0x23        /* mask for BGP path */
120
#define T_PATH 0x24                /* BGP path */
121
#define T_CLIST 0x25                /* Community list */
122

    
123
#define T_RETURN 0x40
124
#define T_SET 0x80
125

    
126
struct f_tree {
127
  struct f_tree *left, *right;
128
  struct f_val from, to;
129
  void *data;
130
};
131

    
132
#define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val));
133

    
134
#define FF_FORCE_TMPATTR 1                /* Force all attributes to be temporary */
135

    
136
#endif