filter.c 13.4 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

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

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

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

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

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

372
      if (!(what->aux & EAF_TEMP)) {
Pavel Machek's avatar
Pavel Machek committed
373 374 375 376 377 378 379
	*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;
      }
380 381
    }
    break;
382

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

443
#undef ARG
444 445 446 447 448 449 450 451 452 453 454 455 456 457 458
#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;
459 460
  if (!f1)
    return 1;
461 462 463 464
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;
465 466
  if (f1 == f2)		/* It looks strange, but it is possible with call rewriting trickery */
    return 1;
467 468 469 470 471

  switch(f1->code) {
  case ',': /* fall through */
  case '+':
  case '/':
472 473
  case P('!','='):
  case P('=','='):
474
  case '<':
475
  case P('<','='): TWOARGS; break;
476

Pavel Machek's avatar
Pavel Machek committed
477
  case '!': ONEARG; break;
478
  case '~': TWOARGS; break;
479
  case P('d','e'): ONEARG; break;
480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501

  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;
502
  case P('p',','): ONEARG; A2_SAME; break;
503
  case 'a': A2_SAME; break;
504 505
  case P('e','a'): A2_SAME; break;
  case P('e','S'): ONEARG; A2_SAME; break;
506

507 508
  case 'r': ONEARG; break;
  case P('c','p'): ONEARG; break;
509 510 511 512 513 514
  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;
515 516
  case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break;
  case P('i','M'): TWOARGS; break;
517 518 519 520 521 522
  default:
    bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff);
  }
  return i_same(f1->next, f2->next);
}

523 524 525 526 527 528 529
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
530
  f_tmp_attrs = tmp_attrs;
531
  f_rte = rte;
532
  f_rte_old = *rte;
533
  f_pool = tmp_pool;
534 535 536 537 538 539 540 541 542 543 544 545
  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;
546 547
  if (startup_func) {
    printf( "Launching startup function...\n" );
548
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
549
    if (res.type == F_ERROR)
550 551 552
      die( "Startup function resulted in error." );
    printf( "done\n" );
  }
553
} 
554 555 556 557

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