filter.h 3.09 KB
Newer Older
1
/*
2
 *	BIRD Internet Routing Daemon -- Filters
3
 *
4
 *	(c) 1999 Pavel Machek <pavel@ucw.cz>
5 6 7 8 9 10 11 12
 *
 *	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"
13
#include "lib/ip.h"
14
#include "nest/attrs.h"
15

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

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

33 34 35
struct prefix {
  ip_addr ip;
  int len;
36
#define LEN_MASK 0xff
37 38 39 40
#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) */
41 42
};

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

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

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 65 66 67
struct f_tree *f_new_tree(void);

struct f_tree *build_tree(struct f_tree *);
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 71 72
struct ea_list;
struct rte;

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 78
int i_same(struct f_inst *f1, struct f_inst *f2);

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

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

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

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

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

/* User visible types, which fit in int */
#define T_INT 0x10
#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 110
#define T_ENUM_BGP_ORIGIN 0x31
/* 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 116 117 118

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

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

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

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

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

136
#endif