filter.c 13.8 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
#undef LOCAL_DEBUG

14 15 16 17 18 19 20 21 22 23
#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"
24
#include "lib/string.h"
25 26 27 28 29 30
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
#include "conf/conf.h"
#include "filter/filter.h"

31 32
#define P(a,b) ((a<<8) | b)

33 34
struct f_inst *startup_func = NULL;

35 36 37 38 39 40
#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
41 42 43 44 45 46 47
  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;

48 49
  if (v1.type != v2.type)
    return CMP_ERROR;
50
  switch (v1.type) {
51
  case T_ENUM:
52
  case T_INT: 
53
  case T_PAIR:
54 55 56
    if (v1.val.i == v2.val.i) return 0;
    if (v1.val.i < v2.val.i) return -1;
    return 1;
57
  case T_IP:
58 59
  case T_PREFIX:
    return ipa_compare(v1.val.px.ip, v2.val.px.ip);
60 61
  default:
    return CMP_ERROR;
62 63 64
  }
}

65 66 67 68 69 70 71 72 73 74 75 76 77
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;
78

79 80 81 82 83 84 85 86 87 88 89 90
    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;
}

91 92 93
int
val_in_range(struct f_val v1, struct f_val v2)
{
94 95 96 97 98 99 100
  int res;

  res = val_simple_in_range(v1, v2);

  if (res != CMP_ERROR)
    return res;

Pavel Machek's avatar
Pavel Machek committed
101
  if (((v1.type == T_INT) || ((v1.type == T_IP) || (v1.type == T_PREFIX)) && (v2.type == T_SET))) {
102 103 104 105 106 107
    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 */
  }
108 109 110
  return CMP_ERROR;
}

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

146
static struct rte **f_rte, *f_rte_old;
147
static struct linpool *f_pool;
Pavel Machek's avatar
Pavel Machek committed
148
static struct ea_list **f_tmp_attrs;
149
static int f_flags;
150

151 152 153 154 155 156 157 158 159
#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); \
160
	if (x.type & T_RETURN) \
161 162 163 164 165 166 167 168
		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" );
169

170 171 172 173 174
static struct f_val
interpret(struct f_inst *what)
{
  struct symbol *sym;
  struct f_val v1, v2, res;
175
  int i,j,k;
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 204 205 206 207

  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 */
208 209 210 211 212 213 214 215

#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); \
216
    break;
217

218 219
  case P('!','='): COMPARE(i!=0);
  case P('=','='): COMPARE(i==0);
220
  case '<': COMPARE(i==-1);
221
  case P('<','='): COMPARE(i!=1);
222

Pavel Machek's avatar
Pavel Machek committed
223 224 225 226 227 228 229 230
  case '!':
    ONEARG;
    if (v1.type != T_BOOL)
      runtime( "not applied to non-boolean" );
    res = v1;
    res.val.i = !res.val.i;
    break;

231 232
  case '~':
    TWOARGS;
233
    res.type = T_BOOL;
234 235 236
    res.val.i = val_in_range(v1, v2);
    if (res.val.i == CMP_ERROR)
      runtime( "~ applied on unknown type pair" );
237
    break;
238
  case P('d','e'):
239 240 241 242
    ONEARG;
    res.type = T_BOOL;
    res.val.i = (v1.type != T_VOID);
    break;
243

244
  /* Set to indirect value, a1 = variable, a2 = value */
245
  case 's':
Pavel Machek's avatar
Pavel Machek committed
246 247
    ARG(v2, a2.p);
    sym = what->a1.p;
248 249
    switch (res.type = v2.type) {
    case T_VOID: runtime( "Can not assign void values" );
250
    case T_ENUM:
251
    case T_INT: 
252 253 254 255
    case T_IP: 
    case T_PREFIX: 
    case T_PAIR: 
      if (sym->class != (SYM_VARIABLE | v2.type))
256
	runtime( "Variable of bad type" );
257
      * (struct f_val *) sym->aux2 = v2; 
258
      break;
259
    default:
260
      bug( "Set to invalid type" );
261 262 263
    }
    break;

264
  case 'c':	/* integer (or simple type) constant */
265
    res.type = what->aux;
266
    res.val.i = what->a2.i;
267
    break;
268 269 270
  case 'C':
    res = * ((struct f_val *) what->a1.p);
    break;
271 272
  case 'p':
    ONEARG;
273
    val_print(v1);
274 275 276 277 278 279
    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
280
      ARG(res,a2.p);
281 282 283 284 285 286 287
      res.val.i = 0;
    } else res.val.i = 1;
    res.type = T_BOOL;
    break;
  case '0':
    printf( "No operation\n" );
    break;
288
  case P('p',','):
289
    ONEARG;
290 291
    if (what->a2.i != F_NONL)
      printf( "\n" );
292

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

    {
      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
367 368 369 370 371
      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" );
372 373
	l->attrs[0].u.data = v1.val.i;
	break;
Pavel Machek's avatar
Pavel Machek committed
374 375 376
      case EAF_TYPE_UNDEF:
	if (v1.type != T_VOID)
	  runtime( "Setting void attribute to non-void value" );
377 378
	l->attrs[0].u.data = 0;
	break;
379
      }
Pavel Machek's avatar
Pavel Machek committed
380

381 382
      if (!(what->aux & EAF_TEMP) && (!(f_flags & FF_FORCE_TMPATTR))) {
	*f_rte = rte_cow(*f_rte);
Pavel Machek's avatar
Pavel Machek committed
383 384 385 386 387 388
	l->next = (*f_rte)->attrs->eattrs;
	(*f_rte)->attrs->eattrs = l;
      } else {
	l->next = (*f_tmp_attrs);
	(*f_tmp_attrs) = l;
      }
389 390
    }
    break;
391

392
  case P('c','p'):	/* Convert prefix to ... */
393 394 395
    ONEARG;
    if (v1.type != T_PREFIX)
      runtime( "Can not convert non-prefix this way" );
396
    res.type = what->aux;
397 398
    switch(res.type) {
    case T_INT:	res.val.i = v1.val.px.len; break;
399
    case T_IP: res.val.px.ip = v1.val.px.ip; break;
400
    default: bug( "Unknown prefix to conversion" );
401 402
    }
    break;
403 404 405 406 407 408
  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  */
409 410
    ONEARG;
    res = interpret(what->a2.p);
411 412 413
    if (res.type == T_RETURN)
      return res;
    res.type &= ~T_RETURN;    
414
    break;
415
  case P('S','W'):
416
    ONEARG;
Pavel Machek's avatar
Pavel Machek committed
417 418 419 420 421 422 423 424 425 426 427
    {
      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)
428
	bug( "Impossible: no code associated!" );
Pavel Machek's avatar
Pavel Machek committed
429 430
      return interpret(t->data);
    }
431
    break;
432
  case P('i','M'): /* IP.MASK(val) */
433 434 435 436 437 438 439 440 441 442
    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);
    }
443
    break;
444 445 446 447 448 449 450 451
  default:
    bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
  }
  if (what->next)
    return interpret(what->next);
  return res;
}

452
#undef ARG
453 454 455 456 457 458 459 460 461 462 463 464 465 466 467
#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) != (!!f2))
    return 0;
468 469
  if (!f1)
    return 1;
470 471 472 473
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;
474 475
  if (f1 == f2)		/* It looks strange, but it is possible with call rewriting trickery */
    return 1;
476 477 478 479 480

  switch(f1->code) {
  case ',': /* fall through */
  case '+':
  case '/':
481 482
  case P('!','='):
  case P('=','='):
483
  case '<':
484
  case P('<','='): TWOARGS; break;
485

Pavel Machek's avatar
Pavel Machek committed
486
  case '!': ONEARG; break;
487
  case '~': TWOARGS; break;
488
  case P('d','e'): ONEARG; break;
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510

  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;
511
  case P('p',','): ONEARG; A2_SAME; break;
512
  case 'a': A2_SAME; break;
513 514
  case P('e','a'): A2_SAME; break;
  case P('e','S'): ONEARG; A2_SAME; break;
515

516 517
  case 'r': ONEARG; break;
  case P('c','p'): ONEARG; break;
518 519 520 521 522 523
  case P('c','a'): /* Call rewriting trickery to avoid exponential behaviour */
             ONEARG; 
	     if (!i_same(f1->a2.p, f2->a2.p))
	       return 0; 
	     f2->a2.p = f1->a2.p;
	     break;
524 525
  case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break;
  case P('i','M'): TWOARGS; break;
526 527 528 529 530 531
  default:
    bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff);
  }
  return i_same(f1->next, f2->next);
}

532
int
533
f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags)
534 535 536
{
  struct f_inst *inst;
  struct f_val res;
537
  DBG( "Running filter `%s'...", filter->name );
538

539
  f_flags = flags;
Pavel Machek's avatar
Pavel Machek committed
540
  f_tmp_attrs = tmp_attrs;
541
  f_rte = rte;
542
  f_rte_old = *rte;
543
  f_pool = tmp_pool;
544 545 546 547
  inst = filter->root;
  res = interpret(inst);
  if (res.type != T_RETURN)
    return F_ERROR;
548
  DBG( "done (%d)\n", res.val.i );
549 550 551 552 553 554 555
  return res.val.i;
}

void
filters_postconfig(void)
{
  struct f_val res;
556 557
  if (startup_func) {
    printf( "Launching startup function...\n" );
558
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
559
    if (res.type == F_ERROR)
560 561 562
      die( "Startup function resulted in error." );
    printf( "done\n" );
  }
563
} 
564 565 566 567

int
filter_same(struct filter *new, struct filter *old)
{
568 569 570 571 572
  if (old == new)	/* Handle FILTER_ACCEPT and FILTER_REJECT */
    return 1;
  if (old == FILTER_ACCEPT || old == FILTER_REJECT ||
      new == FILTER_ACCEPT || new == FILTER_REJECT)
    return 0;
573
  return i_same(new->root, old->root);
574
}