filter.c 13.7 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
#include "nest/bird.h"
#include "lib/lists.h"
#include "lib/resource.h"
#include "lib/socket.h"
18
#include "lib/string.h"
19
20
21
22
23
24
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
#include "conf/conf.h"
#include "filter/filter.h"

25
26
#define P(a,b) ((a<<8) | b)

27
28
struct f_inst *startup_func = NULL;

29
30
31
32
33
34
#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
35
36
37
38
39
40
41
  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;

42
43
  if (v1.type != v2.type)
    return CMP_ERROR;
44
  switch (v1.type) {
45
  case T_ENUM:
46
  case T_INT: 
47
  case T_PAIR:
48
49
50
    if (v1.val.i == v2.val.i) return 0;
    if (v1.val.i < v2.val.i) return -1;
    return 1;
51
  case T_IP:
52
53
  case T_PREFIX:
    return ipa_compare(v1.val.px.ip, v2.val.px.ip);
54
55
  default:
    return CMP_ERROR;
56
57
58
  }
}

59
60
61
62
63
64
65
66
67
68
69
70
71
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;
72

73
74
75
76
77
78
79
80
81
82
83
84
    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;
}

85
86
87
int
val_in_range(struct f_val v1, struct f_val v2)
{
88
89
90
91
92
93
94
  int res;

  res = val_simple_in_range(v1, v2);

  if (res != CMP_ERROR)
    return res;

Pavel Machek's avatar
Pavel Machek committed
95
  if (((v1.type == T_INT) || ((v1.type == T_IP) || (v1.type == T_PREFIX)) && (v2.type == T_SET))) {
96
97
98
99
100
101
    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 */
  }
102
103
104
  return CMP_ERROR;
}

105
106
107
108
static void
tree_print(struct f_tree *t)
{
  if (!t) {
109
    debug( "() " );
110
111
    return;
  }
112
  debug( "[ " );
113
  tree_print( t->left );
114
  debug( ", " ); val_print( t->from ); debug( ".." ); val_print( t->to ); debug( ", " );
115
  tree_print( t->right );
116
  debug( "] " );
117
118
119
120
121
122
123
124
125
126
127
128
129
}

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;
130
  case T_IP: PRINTF( "%I", v.val.px.ip ); break;
131
132
  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;
133
  case T_SET: tree_print( v.val.t ); PRINTF( "\n" ); break;
Pavel Machek's avatar
Pavel Machek committed
134
  case T_ENUM: PRINTF( "(enum %x)%d", v.type, v.val.i ); break;
135
136
  default: PRINTF( "[unknown type %x]", v.type );
  }
137
  debug( buf );
138
139
}

140
static struct rte **f_rte, *f_rte_old;
141
static struct linpool *f_pool;
Pavel Machek's avatar
Pavel Machek committed
142
static struct ea_list **f_tmp_attrs;
143
static int f_flags;
144

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

164
165
166
167
168
static struct f_val
interpret(struct f_inst *what)
{
  struct symbol *sym;
  struct f_val v1, v2, res;
169
  int i,j,k;
170
171
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

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

#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); \
210
    break;
211

212
213
  case P('!','='): COMPARE(i!=0);
  case P('=','='): COMPARE(i==0);
214
  case '<': COMPARE(i==-1);
215
  case P('<','='): COMPARE(i!=1);
216

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

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

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

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

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

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

375
376
      if (!(what->aux & EAF_TEMP) && (!(f_flags & FF_FORCE_TMPATTR))) {
	*f_rte = rte_cow(*f_rte);
Pavel Machek's avatar
Pavel Machek committed
377
378
379
380
381
382
	l->next = (*f_rte)->attrs->eattrs;
	(*f_rte)->attrs->eattrs = l;
      } else {
	l->next = (*f_tmp_attrs);
	(*f_tmp_attrs) = l;
      }
383
384
    }
    break;
385

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

446
#undef ARG
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) != (!!f2))
    return 0;
462
463
  if (!f1)
    return 1;
464
465
466
467
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;
468
469
  if (f1 == f2)		/* It looks strange, but it is possible with call rewriting trickery */
    return 1;
470
471
472
473
474

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

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

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

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

526
int
527
f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags)
528
529
530
{
  struct f_inst *inst;
  struct f_val res;
531
  DBG( "Running filter `%s'...", filter->name );
532

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

void
filters_postconfig(void)
{
  struct f_val res;
550
  if (startup_func) {
551
    debug( "Launching startup function...\n" );
552
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
553
    if (res.type == F_ERROR)
554
      die( "Startup function resulted in error." );
555
    debug( "done\n" );
556
  }
557
} 
558
559
560
561

int
filter_same(struct filter *new, struct filter *old)
{
562
563
564
565
566
  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;
567
  return i_same(new->root, old->root);
568
}