filter.c 8.14 KB
Newer Older
1 2 3 4 5 6
/*
 *	Filters: utility functions
 *
 *	Copyright 1998 Pavel Machek <pavel@ucw.cz>
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
7 8
 *
 *	FIXME: local namespace for functions
9 10
 *
 * 	Notice that pair is stored as integer: first << 16 | second
11 12 13 14 15 16 17 18 19 20 21 22
 */

#include <stdio.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/signal.h>
#include <setjmp.h>

#include "nest/bird.h"
#include "lib/lists.h"
#include "lib/resource.h"
#include "lib/socket.h"
23
#include "lib/string.h"
24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
#include "conf/conf.h"
#include "filter/filter.h"

struct f_inst *startup_func = NULL;

#define runtime(x) do { \
    log( L_ERR x ); \
    res.type = T_RETURN; \
    res.val.i = F_ERROR; \
    return res; \
  } while(0)

#define ARG(x,y) \
	x = interpret(what->y); \
	if (x.type == T_RETURN) \
		return x;

Pavel Machek's avatar
Pavel Machek committed
44 45 46
#define ONEARG ARG(v1, a1.p)
#define TWOARGS ARG(v1, a1.p) \
		ARG(v2, a2.p)
47 48 49 50
#define TWOARGS_C TWOARGS \
                  if (v1.type != v2.type) \
		    runtime( "Can not operate with values of incompatible types" );

51 52 53 54 55 56
#define CMP_ERROR 999

/* Compare two values, returns -1, 0, 1 compared, ERROR 999 */
int
val_compare(struct f_val v1, struct f_val v2)
{
57 58
  if (v1.type != v2.type)
    return CMP_ERROR;
59 60
  switch (v1.type) {
  case T_INT: 
61
  case T_PAIR:
62 63 64
    if (v1.val.i == v2.val.i) return 0;
    if (v1.val.i < v2.val.i) return -1;
    return 1;
65 66
  case T_IP:
    return ipa_compare(v1.val.ip, v2.val.ip);
67 68 69 70
  default: return CMP_ERROR;
  }
}

71 72 73 74 75 76 77 78
int
val_in_range(struct f_val v1, struct f_val v2)
{
  if (((v1.type == T_INT) || (v1.type == T_IP)) && (v2.type == T_SET))
    return !! find_tree(v2.val.t, v1);
  return CMP_ERROR;
}

79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
static void
tree_print(struct f_tree *t)
{
  if (!t) {
    printf( "() " );
    return;
  }
  printf( "[ " );
  tree_print( t->left );
  printf( ", " ); val_print( t->from ); printf( ".." ); val_print( t->to ); printf( ", " );
  tree_print( t->right );
  printf( "] " );
}

void
val_print(struct f_val v)
{
  char buf[2048];
#define PRINTF(a...) bsnprintf( buf, 2040, a )
  buf[0] = 0;
  switch (v.type) {
  case T_VOID: PRINTF( "(void)" ); break;
  case T_BOOL: PRINTF( v.val.i ? "TRUE" : "FALSE" ); break;
  case T_INT: PRINTF( "%d ", v.val.i ); break;
  case T_STRING: PRINTF( "%s", v.val.s ); break;
  case T_IP: PRINTF( "%I", v.val.ip ); break;
105 106
  case T_PREFIX: PRINTF( "%I/%d", v.val.px.ip, v.val.px.len ); break;
  case T_PAIR: PRINTF( "(%d,%d)", v.val.i >> 16, v.val.i & 0xffff ); break;
107 108 109 110 111 112
  case T_SET: tree_print( v.val.t ); PRINTF( "\n" ); break;
  default: PRINTF( "[unknown type %x]", v.type );
  }
  printf( buf );
}

113 114
static struct rte **f_rte;

115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
static struct f_val interpret(struct f_inst *what);

static struct f_val
interpret_switch(struct f_inst *what, struct f_val control)
{
  struct f_val this, res;
  int i;
  res.type = T_VOID;

  if (!what)
    return res;

  switch(what->code) {
  case 'el':
    return interpret(what->a2.p);

  case 'of':
    this = interpret(what->a1.p);
    i = val_compare(control, this);
    if (!i)
      return interpret(what->a2.p);
    if (i==CMP_ERROR) {
      i = val_in_range(control, this);
      if (i==1)
	return interpret(what->a2.p);
      if (i==CMP_ERROR)
	runtime( "incompatible types in case" );
    }
    break;
    
  default:
    bug( "This can not happen (%x)\n", what->code );
  }
  return interpret_switch(what->next, control);
}

151 152 153 154 155
static struct f_val
interpret(struct f_inst *what)
{
  struct symbol *sym;
  struct f_val v1, v2, res;
156
  int i,j,k;
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188

  res.type = T_VOID;
  if (!what)
    return res;

  switch(what->code) {
  case ',':
    TWOARGS;
    break;

/* Binary operators */
  case '+':
    TWOARGS_C;
    switch (res.type = v1.type) {
    case T_VOID: runtime( "Can not operate with values of type void" );
    case T_INT: res.val.i = v1.val.i + v2.val.i; break;
    default: runtime( "Usage of unknown type" );
    }
    break;
  case '/':
    TWOARGS_C;
    switch (res.type = v1.type) {
    case T_VOID: runtime( "Can not operate with values of type void" );
    case T_INT: res.val.i = v1.val.i / v2.val.i; break;
    case T_IP: if (v2.type != T_INT)
                 runtime( "Operator / is <ip>/<int>" );
               break;
    default: runtime( "Usage of unknown type" );
    }
    break;

/* Relational operators */
189 190 191 192 193 194 195 196

#define COMPARE(x) \
    TWOARGS_C; \
    res.type = T_BOOL; \
    i = val_compare(v1, v2); \
    if (i==CMP_ERROR) \
      runtime( "Error in comparation" ); \
    res.val.i = (x); \
197
    break;
198 199 200 201 202 203

  case '!=': COMPARE(i!=0);
  case '==': COMPARE(i==0);
  case '<': COMPARE(i==-1);
  case '<=': COMPARE(i!=1);

204
    /* FIXME: Should be able to work with prefixes of limited sizes */
205 206
  case '~':
    TWOARGS;
207
    res.type = T_BOOL;
208 209 210
    res.val.i = val_in_range(v1, v2);
    if (res.val.i == CMP_ERROR)
      runtime( "~ applied on unknown type pair" );
211 212
    break;

213
  /* Set to indirect value, a1 = variable, a2 = value */
214
  case 's':
Pavel Machek's avatar
Pavel Machek committed
215 216
    ARG(v2, a2.p);
    sym = what->a1.p;
217 218 219
    switch (res.type = v2.type) {
    case T_VOID: runtime( "Can not assign void values" );
    case T_INT: 
220 221 222 223
    case T_IP: 
    case T_PREFIX: 
    case T_PAIR: 
      if (sym->class != (SYM_VARIABLE | v2.type))
224
	runtime( "Variable of bad type" );
225
      * (struct f_val *) sym->aux2 = v2; 
226
      break;
227 228
    default:
      bug( "Set to invalid type\n" );
229 230 231
    }
    break;

232
  case 'c':	/* integer (or simple type) constant */
Pavel Machek's avatar
Pavel Machek committed
233
    res.type = what->a1.i;
234
    res.val.i = what->a2.i;
235
    break;
236 237 238
  case 'C':
    res = * ((struct f_val *) what->a1.p);
    break;
239 240
  case 'p':
    ONEARG;
241
    val_print(v1);
242 243 244 245 246 247
    break;
  case '?':	/* ? has really strange error value, so we can implement if ... else nicely :-) */
    ONEARG;
    if (v1.type != T_BOOL)
      runtime( "If requires bool expression" );
    if (v1.val.i) {
Pavel Machek's avatar
Pavel Machek committed
248
      ARG(res,a2.p);
249 250 251 252 253 254 255 256 257
      res.val.i = 0;
    } else res.val.i = 1;
    res.type = T_BOOL;
    break;
  case '0':
    printf( "No operation\n" );
    break;
  case 'p,':
    ONEARG;
258 259
    if (what->a2.i != F_NONL)
      printf( "\n" );
260

Pavel Machek's avatar
Pavel Machek committed
261
    switch (what->a2.i) {
262 263 264 265 266 267 268
    case F_QUITBIRD:
      die( "Filter asked me to die" );
    case F_ACCEPT:
      /* Should take care about turning ACCEPT into MODIFY */
    case F_ERROR:
    case F_REJECT:
      res.type = T_RETURN;
Pavel Machek's avatar
Pavel Machek committed
269
      res.val.i = what->a1.i;
270
      break;
271
    case F_NONL:
272 273 274 275 276 277
    case F_NOP:
      break;
    default:
      bug( "unknown return type: can not happen");
    }
    break;
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307
  case 'a':	/* rta access */
    {
      struct rta *rta = (*f_rte)->attrs;
      res.type = what->a1.i;
      switch(res.type) {
      case T_IP:
	res.val.ip = * (ip_addr *) ((char *) rta + what->a2.i);
	break;
      case T_PREFIX:	/* Warning: this works only for prefix of network */
	{
	  res.val.px.ip = (*f_rte)->net->n.prefix;
	  res.val.px.len = (*f_rte)->net->n.pxlen;
	  break;
	}
      default:
	bug( "Invalid type for rta access" );
      }
    }
    break;
  case 'cp':	/* Convert prefix to ... */
    ONEARG;
    if (v1.type != T_PREFIX)
      runtime( "Can not convert non-prefix this way" );
    res.type = what->a2.i;
    switch(res.type) {
    case T_INT:	res.val.i = v1.val.px.len; break;
    case T_IP: res.val.ip = v1.val.px.ip; break;
    default: bug( "Unknown prefix to conversion\n" );
    }
    break;
308 309 310 311
  case 'ca': /* CALL */
    ONEARG;
    res = interpret(what->a2.p);
    break;
312 313 314 315
  case 'sw': /* SWITCH alias CASE */
    ONEARG;
    interpret_switch(what->a2.p, v1);
    break;
316 317 318 319
  case 'iM': /* IP.MASK(val) */
    TWOARGS_C;
    bug( "Should implement ip.mask\n" );
    break;
320 321 322 323 324 325 326 327 328 329 330 331 332 333 334
  default:
    bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
  }
  if (what->next)
    return interpret(what->next);
  return res;
}

int
f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool)
{
  struct f_inst *inst;
  struct f_val res;
  debug( "Running filter `%s'...", filter->name );

335
  f_rte = rte;
336 337 338 339 340 341 342 343 344 345 346 347 348
  inst = filter->root;
  res = interpret(inst);
  if (res.type != T_RETURN)
    return F_ERROR;
  debug( "done (%d)\n", res.val.i );
  return res.val.i;
}


void
filters_postconfig(void)
{
  struct f_val res;
349 350
  if (startup_func) {
    printf( "Launching startup function...\n" );
351
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
352
    if (res.type == F_ERROR)
353 354 355
      die( "Startup function resulted in error." );
    printf( "done\n" );
  }
356
}