filter.c 13 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
 * 	Notice that pair is stored as integer: first << 16 | second
Pavel Machek's avatar
Pavel Machek committed
9
 *
10 11 12 13 14 15 16 17 18 19 20 21
 */

#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"
22
#include "lib/string.h"
23 24 25 26 27 28
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
#include "conf/conf.h"
#include "filter/filter.h"

29 30
#define P(a,b) ((a<<8) | b)

31 32
struct f_inst *startup_func = NULL;

33 34 35 36 37 38
#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)
{
Pavel Machek's avatar
Pavel Machek committed
39 40 41 42 43 44 45
  if ((v1.type == T_VOID) && (v2.type == T_VOID))
    return 0;
  if (v1.type == T_VOID)	/* Hack for else */
    return -1;
  if (v2.type == T_VOID)
    return 1;

46 47
  if (v1.type != v2.type)
    return CMP_ERROR;
48
  switch (v1.type) {
49
  case T_ENUM:
50
  case T_INT: 
51
  case T_PAIR:
52 53 54
    if (v1.val.i == v2.val.i) return 0;
    if (v1.val.i < v2.val.i) return -1;
    return 1;
55
  case T_IP:
56 57
  case T_PREFIX:
    return ipa_compare(v1.val.px.ip, v2.val.px.ip);
Pavel Machek's avatar
Pavel Machek committed
58
  default: { printf( "Error comparing\n" ); return CMP_ERROR; }
59 60 61
  }
}

62 63 64 65 66 67 68 69 70 71 72 73 74
int 
val_simple_in_range(struct f_val v1, struct f_val v2)
{
  if ((v1.type == T_IP) && (v2.type == T_PREFIX))
    return !(ipa_compare(ipa_and(v2.val.px.ip, ipa_mkmask(v2.val.px.len)), ipa_and(v1.val.px.ip, ipa_mkmask(v2.val.px.len))));

  if ((v1.type == T_PREFIX) && (v2.type == T_PREFIX)) {
    ip_addr mask;
    if (v1.val.px.len & (LEN_PLUS | LEN_MINUS | LEN_RANGE))
      return CMP_ERROR;
    mask = ipa_mkmask( v2.val.px.len & LEN_MASK );
    if (ipa_compare(ipa_and(v2.val.px.ip, mask), ipa_and(v1.val.px.ip, mask)))
      return 0;
75

76 77 78 79 80 81 82 83 84 85 86 87
    if ((v2.val.px.len & LEN_MINUS) && (v1.val.px.len <= (v2.val.px.len & LEN_MASK)))
      return 0;
    if ((v2.val.px.len & LEN_PLUS) && (v1.val.px.len < (v2.val.px.len & LEN_MASK)))
      return 0;
    if ((v2.val.px.len & LEN_RANGE) && ((v1.val.px.len < (0xff & (v2.val.px.len >> 16)))
					|| (v1.val.px.len > (0xff & (v2.val.px.len >> 8)))))
      return 0;
    return 1;    
  }
  return CMP_ERROR;
}

88 89 90
int
val_in_range(struct f_val v1, struct f_val v2)
{
91 92 93 94 95 96 97
  int res;

  res = val_simple_in_range(v1, v2);

  if (res != CMP_ERROR)
    return res;

Pavel Machek's avatar
Pavel Machek committed
98
  if (((v1.type == T_INT) || ((v1.type == T_IP) || (v1.type == T_PREFIX)) && (v2.type == T_SET))) {
99 100 101 102 103 104
    struct f_tree *n;
    n = find_tree(v2.val.t, v1);
    if (!n)
      return 0;
    return !! (val_simple_in_range(v1, n->from));	/* We turn CMP_ERROR into compared ok, and that's fine */
  }
105 106 107
  return CMP_ERROR;
}

108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132
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;
133
  case T_IP: PRINTF( "%I", v.val.px.ip ); break;
134 135
  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;
136
  case T_SET: tree_print( v.val.t ); PRINTF( "\n" ); break;
Pavel Machek's avatar
Pavel Machek committed
137
  case T_ENUM: PRINTF( "(enum %x)%d", v.type, v.val.i ); break;
138 139 140 141 142
  default: PRINTF( "[unknown type %x]", v.type );
  }
  printf( buf );
}

143
static struct rte **f_rte, *f_rte_old;
144
static struct linpool *f_pool;
Pavel Machek's avatar
Pavel Machek committed
145
static struct ea_list **f_tmp_attrs;
146

147 148 149 150 151 152 153 154 155
#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); \
156
	if (x.type & T_RETURN) \
157 158 159 160 161 162 163 164
		return x;

#define ONEARG ARG(v1, a1.p)
#define TWOARGS ARG(v1, a1.p) \
		ARG(v2, a2.p)
#define TWOARGS_C TWOARGS \
                  if (v1.type != v2.type) \
		    runtime( "Can not operate with values of incompatible types" );
165

166 167 168 169 170
static struct f_val
interpret(struct f_inst *what)
{
  struct symbol *sym;
  struct f_val v1, v2, res;
171
  int i,j,k;
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203

  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 */
204 205 206 207 208 209 210 211

#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); \
212
    break;
213

214 215
  case P('!','='): COMPARE(i!=0);
  case P('=','='): COMPARE(i==0);
216
  case '<': COMPARE(i==-1);
217
  case P('<','='): COMPARE(i!=1);
218 219 220

  case '~':
    TWOARGS;
221
    res.type = T_BOOL;
222 223 224
    res.val.i = val_in_range(v1, v2);
    if (res.val.i == CMP_ERROR)
      runtime( "~ applied on unknown type pair" );
225
    break;
226
  case P('d','e'):
227 228 229 230
    ONEARG;
    res.type = T_BOOL;
    res.val.i = (v1.type != T_VOID);
    break;
231

232
  /* Set to indirect value, a1 = variable, a2 = value */
233
  case 's':
Pavel Machek's avatar
Pavel Machek committed
234 235
    ARG(v2, a2.p);
    sym = what->a1.p;
236 237
    switch (res.type = v2.type) {
    case T_VOID: runtime( "Can not assign void values" );
238
    case T_ENUM:
239
    case T_INT: 
240 241 242 243
    case T_IP: 
    case T_PREFIX: 
    case T_PAIR: 
      if (sym->class != (SYM_VARIABLE | v2.type))
244
	runtime( "Variable of bad type" );
245
      * (struct f_val *) sym->aux2 = v2; 
246
      break;
247 248
    default:
      bug( "Set to invalid type\n" );
249 250 251
    }
    break;

252
  case 'c':	/* integer (or simple type) constant */
253
    res.type = what->aux;
254
    res.val.i = what->a2.i;
255
    break;
256 257 258
  case 'C':
    res = * ((struct f_val *) what->a1.p);
    break;
259 260
  case 'p':
    ONEARG;
261
    val_print(v1);
262 263 264 265 266 267
    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
268
      ARG(res,a2.p);
269 270 271 272 273 274 275
      res.val.i = 0;
    } else res.val.i = 1;
    res.type = T_BOOL;
    break;
  case '0':
    printf( "No operation\n" );
    break;
276
  case P('p',','):
277
    ONEARG;
278 279
    if (what->a2.i != F_NONL)
      printf( "\n" );
280

Pavel Machek's avatar
Pavel Machek committed
281
    switch (what->a2.i) {
282 283 284 285 286
    case F_QUITBIRD:
      die( "Filter asked me to die" );
    case F_ACCEPT:
      /* Should take care about turning ACCEPT into MODIFY */
    case F_ERROR:
287
    case F_REJECT:	/* FIXME (noncritical) Should print complete route along with reason to reject route */
288
      res.type = T_RETURN;
289
      res.val.i = what->a2.i;
290
      return res;	/* We have to return now, no more processing. */
291
    case F_NONL:
292 293 294 295 296 297
    case F_NOP:
      break;
    default:
      bug( "unknown return type: can not happen");
    }
    break;
298 299 300
  case 'a':	/* rta access */
    {
      struct rta *rta = (*f_rte)->attrs;
301
      res.type = what->aux;
302 303
      switch(res.type) {
      case T_IP:
304
	res.val.px.ip = * (ip_addr *) ((char *) rta + what->a2.i);
305
	break;
306 307 308
      case T_ENUM:
	res.val.i = * ((char *) rta + what->a2.i);
	break;
309 310 311 312 313 314 315
      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:
316
	bug( "Invalid type for rta access (%x)\n" );
317 318 319
      }
    }
    break;
320
  case P('e','a'):	/* Access to extended attributes */
321 322
    {
      eattr *e = ea_find( (*f_rte)->attrs->eattrs, what->a2.i );
Pavel Machek's avatar
Pavel Machek committed
323 324
      if (!e) 
	e = ea_find( (*f_tmp_attrs), what->a2.i );
325 326 327 328
      if (!e) {
	res.type = T_VOID;
	break;
      }
329
      res.type = what->aux;
330 331 332 333 334 335
      switch (what->a1.i) {
      case T_INT:
	res.val.i = e->u.data;
	break;
      }
    }
336
    break;
337
  case P('e','S'):
338 339 340 341 342 343 344 345 346 347 348 349
    ONEARG;
    if (v1.type != what->aux)
      runtime("Wrong type when setting dynamic attribute\n");

    {
      struct ea_list *l = lp_alloc(f_pool, sizeof(struct ea_list) + sizeof(eattr));

      l->next = NULL;
      l->flags = EALF_SORTED;
      l->count = 1;
      l->attrs[0].id = what->a2.i;
      l->attrs[0].flags = 0;
Pavel Machek's avatar
Pavel Machek committed
350 351 352 353 354
      l->attrs[0].type = what->aux;
      switch (what->aux & EAF_TYPE_MASK) {
      case EAF_TYPE_INT:
	if (v1.type != T_INT)
	  runtime( "Setting int attribute to non-int value" );
355 356
	l->attrs[0].u.data = v1.val.i;
	break;
Pavel Machek's avatar
Pavel Machek committed
357 358 359
      case EAF_TYPE_UNDEF:
	if (v1.type != T_VOID)
	  runtime( "Setting void attribute to non-void value" );
360 361
	l->attrs[0].u.data = 0;
	break;
362
      }
Pavel Machek's avatar
Pavel Machek committed
363 364 365 366 367 368 369 370 371

      if (what->aux & EAF_INLINE) {
	*f_rte = rte_do_cow(*f_rte);
	l->next = (*f_rte)->attrs->eattrs;
	(*f_rte)->attrs->eattrs = l;
      } else {
	l->next = (*f_tmp_attrs);
	(*f_tmp_attrs) = l;
      }
372 373
    }
    break;
374

375
  case P('c','p'):	/* Convert prefix to ... */
376 377 378
    ONEARG;
    if (v1.type != T_PREFIX)
      runtime( "Can not convert non-prefix this way" );
379
    res.type = what->aux;
380 381
    switch(res.type) {
    case T_INT:	res.val.i = v1.val.px.len; break;
382
    case T_IP: res.val.px.ip = v1.val.px.ip; break;
383 384 385
    default: bug( "Unknown prefix to conversion\n" );
    }
    break;
386 387 388 389 390 391
  case 'r':
    ONEARG;
    res = v1;
    res.type |= T_RETURN;
    break;
  case P('c','a'): /* CALL: this is special: if T_RETURN and returning some value, mask it out  */
392 393
    ONEARG;
    res = interpret(what->a2.p);
394 395 396
    if (res.type == T_RETURN)
      return res;
    res.type &= ~T_RETURN;    
397
    break;
398
  case P('S','W'):
399
    ONEARG;
Pavel Machek's avatar
Pavel Machek committed
400 401 402 403 404 405 406 407 408 409 410 411 412 413
    {
      struct f_tree *t = find_tree(what->a2.p, v1);
      if (!t) {
	v1.type = T_VOID;
	t = find_tree(what->a2.p, v1);
	if (!t) {
	  printf( "No else statement?\n ");
	  break;
	}
      }	
      if (!t->data)
	die( "Impossible: no code associated!\n" );
      return interpret(t->data);
    }
414
    break;
415
  case P('i','M'): /* IP.MASK(val) */
416 417 418 419 420 421 422 423 424 425
    TWOARGS;
    if (v2.type != T_INT)
      runtime( "Can not use this type for mask.");
    if (v1.type != T_IP)
      runtime( "You can mask only IP addresses." );
    {
      ip_addr mask = ipa_mkmask(v2.val.i);
      res.type = T_IP;
      res.val.px.ip = ipa_and(mask, v1.val.px.ip);
    }
426
    break;
427 428 429 430 431 432 433 434
  default:
    bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
  }
  if (what->next)
    return interpret(what->next);
  return res;
}

435
#undef ARG
436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461
#define ARG(x,y) \
	if (!i_same(f1->y, f2->y)) \
		return 0;

#define ONEARG ARG(v1, a1.p)
#define TWOARGS ARG(v1, a1.p) \
		ARG(v2, a2.p)

#define A2_SAME if (f1->a2.i != f2->a2.i) return 0;

int
i_same(struct f_inst *f1, struct f_inst *f2)
{
  if (!f1)
    return 1;
  if ((!!f1) != (!!f2))
    return 0;
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;

  switch(f1->code) {
  case ',': /* fall through */
  case '+':
  case '/':
462 463
  case P('!','='):
  case P('=','='):
464
  case '<':
465
  case P('<','='): TWOARGS; break;
466 467

  case '~': TWOARGS; break;
468
  case P('d','e'): ONEARG; break;
469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490

  case 's':
    ARG(v2, a2.p);
    {
      struct symbol *s1, *s2;
      s1 = f1->a1.p;
      s2 = f2->a1.p;
      if (strcmp(s1->name, s2->name))
	return 0;
      if (s1->class != s2->class)
	return 0;
    }
    break;

  case 'c': A2_SAME; break;
  case 'C': 
    if (val_compare(* (struct f_val *) f1->a1.p, * (struct f_val *) f2->a2.p))
      return 0;
    break;
  case 'p': ONEARG; break;
  case '?': TWOARGS; break;
  case '0': break;
491
  case P('p',','): ONEARG; A2_SAME; break;
492
  case 'a': A2_SAME; break;
493 494
  case P('e','a'): A2_SAME; break;
  case P('e','S'): ONEARG; A2_SAME; break;
495

496 497 498
  case 'r': ONEARG; break;
  case P('c','p'): ONEARG; break;
  case P('c','a'): /* CALL, FIXME: exponential in some cases */
499
             ONEARG; if (!i_same(f1->a2.p, f2->a2.p)) return 0; break;
500 501
  case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break;
  case P('i','M'): TWOARGS; break;
502 503 504 505 506 507
  default:
    bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff);
  }
  return i_same(f1->next, f2->next);
}

508 509 510 511 512 513 514
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 );

Pavel Machek's avatar
Pavel Machek committed
515
  f_tmp_attrs = tmp_attrs;
516
  f_rte = rte;
517
  f_rte_old = *rte;
518
  f_pool = tmp_pool;
519 520 521 522 523 524 525 526 527 528 529 530
  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;
531 532
  if (startup_func) {
    printf( "Launching startup function...\n" );
533
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
534
    if (res.type == F_ERROR)
535 536 537
      die( "Startup function resulted in error." );
    printf( "done\n" );
  }
538
} 
539 540 541 542

int
filter_same(struct filter *new, struct filter *old)
{
543
  return i_same(new->root, old->root);
544
}