filter/filter.h

   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 /* Not enough fields in f_inst for three args used by roa_check() */
  36 struct f_inst_roa_check {
  37   struct f_inst i;
  38   struct roa_table_config *rtc;
  39 };
  40
  41 struct f_prefix {
  42   net_addr_union net;
  43   u8 lo, hi;
  44 };
  45
  46 struct f_val {
  47   int type;
  48   union {
  49     uint i;
  50     u64 ec;
  51     ip_addr ip;
  52     const net_addr *net;
  53     char *s;
  54     struct f_tree *t;
  55     struct f_trie *ti;
  56     struct adata *ad;
  57     struct f_path_mask *path_mask;
  58   } val;
  59 };
  60
  61 struct filter {
  62   char *name;
  63   struct f_inst *root;
  64 };
  65
  66 struct f_inst *f_new_inst(void);
  67 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 */
  68 struct f_tree *f_new_tree(void);
  69 struct f_inst *f_generate_complex(int operation, int operation_aux, struct f_inst *dyn, struct f_inst *argument);
  70 struct f_inst *f_generate_roa_check(struct symbol *sym, struct f_inst *prefix, struct f_inst *asn);
  71
  72
  73 struct f_tree *build_tree(struct f_tree *);
  74 struct f_tree *find_tree(struct f_tree *t, struct f_val val);
  75 int same_tree(struct f_tree *t1, struct f_tree *t2);
  76 void tree_format(struct f_tree *t, buffer *buf);
  77
  78 struct f_trie *f_new_trie(linpool *lp, uint node_size);
  79 void *trie_add_prefix(struct f_trie *t, net_addr *n, uint l, uint h);
  80 int trie_match_net(struct f_trie *t, const net_addr *n);
  81 int trie_same(struct f_trie *t1, struct f_trie *t2);
  82 void trie_format(struct f_trie *t, buffer *buf);
  83
  84 struct ea_list;
  85 struct rte;
  86
  87 int f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags);
  88 struct f_val f_eval_rte(struct f_inst *expr, struct rte **rte, struct linpool *tmp_pool);
  89 struct f_val f_eval(struct f_inst *expr, struct linpool *tmp_pool);
  90 uint f_eval_int(struct f_inst *expr);
  91 u32 f_eval_asn(struct f_inst *expr);
  92
  93 char *filter_name(struct filter *filter);
  94 int filter_same(struct filter *new, struct filter *old);
  95
  96 int i_same(struct f_inst *f1, struct f_inst *f2);
  97
  98 int val_compare(struct f_val v1, struct f_val v2);
  99 int val_same(struct f_val v1, struct f_val v2);
 100
 101 void val_format(struct f_val v, buffer *buf);
 102
 103
 104 #define F_NOP 0
 105 #define F_NONL 1
 106 #define F_ACCEPT 2      /* Need to preserve ordering: accepts < rejects! */
 107 #define F_REJECT 3
 108 #define F_ERROR 4
 109 #define F_QUITBIRD 5
 110
 111 #define FILTER_ACCEPT NULL
 112 #define FILTER_REJECT ((void *) 1)
 113
 114 /* Type numbers must be in 0..0xff range */
 115 #define T_MASK 0xff
 116
 117 /* Internal types */
 118 /* Do not use type of zero, that way we'll see errors easier. */
 119 #define T_VOID 1
 120
 121 /* User visible types, which fit in int */
 122 #define T_INT 0x10
 123 #define T_BOOL 0x11
 124 #define T_PAIR 0x12  /* Notice that pair is stored as integer: first << 16 | second */
 125 #define T_QUAD 0x13
 126
 127 /* Put enumerational types in 0x30..0x3f range */
 128 #define T_ENUM_LO 0x30
 129 #define T_ENUM_HI 0x3f
 130
 131 #define T_ENUM_RTS 0x30
 132 #define T_ENUM_BGP_ORIGIN 0x31
 133 #define T_ENUM_SCOPE 0x32
 134 #define T_ENUM_RTC 0x33
 135 #define T_ENUM_RTD 0x34
 136 #define T_ENUM_ROA 0x35
 137 /* new enums go here */
 138 #define T_ENUM_EMPTY 0x3f       /* Special hack for atomic_aggr */
 139
 140 #define T_ENUM T_ENUM_LO ... T_ENUM_HI
 141
 142 /* Bigger ones */
 143 #define T_IP 0x20
 144 #define T_NET 0x21
 145 #define T_STRING 0x22
 146 #define T_PATH_MASK 0x23        /* mask for BGP path */
 147 #define T_PATH 0x24             /* BGP path */
 148 #define T_CLIST 0x25            /* Community list */
 149 #define T_ECLIST 0x26           /* Extended community list */
 150 #define T_EC 0x27               /* Extended community value, u64 */
 151
 152 #define T_RETURN 0x40
 153 #define T_SET 0x80
 154 #define T_PREFIX_SET 0x81
 155
 156
 157 #define SA_FROM          1
 158 #define SA_GW            2
 159 #define SA_NET           3
 160 #define SA_PROTO         4
 161 #define SA_SOURCE        5
 162 #define SA_SCOPE         6
 163 #define SA_CAST          7
 164 #define SA_DEST          8
 165 #define SA_IFNAME        9
 166 #define SA_IFINDEX      10
 167
 168
 169 struct f_tree {
 170   struct f_tree *left, *right;
 171   struct f_val from, to;
 172   void *data;
 173 };
 174
 175 struct f_trie_node
 176 {
 177   ip_addr addr, mask, accept;
 178   int plen;
 179   struct f_trie_node *c[2];
 180 };
 181
 182 struct f_trie
 183 {
 184   linpool *lp;
 185   int zero;
 186   uint node_size;
 187   struct f_trie_node root[0];           /* Root trie node follows */
 188 };
 189
 190 #define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val));
 191
 192 #define FF_FORCE_TMPATTR 1              /* Force all attributes to be temporary */
 193
 194 #endif