filter.c 19.1 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
#define LOCAL_DEBUG
13

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
#include "lib/unaligned.h"
20 21 22 23 24 25
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
#include "conf/conf.h"
#include "filter/filter.h"

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

28 29
struct f_inst *startup_func = NULL;

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

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

60 61 62
int 
val_simple_in_range(struct f_val v1, struct f_val v2)
{
63
  if ((v1.type == T_PATH) && (v2.type == T_PATH_MASK))
Martin Mareš's avatar
Martin Mareš committed
64
    return path_match(v1.val.ad->data, v1.val.ad->length, v2.val.path_mask);
65

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

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

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

  res = val_simple_in_range(v1, v2);

  if (res != CMP_ERROR)
    return res;

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

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

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;
134
  case T_IP: PRINTF( "%I", v.val.px.ip ); break;
135 136
  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;
137
  case T_SET: tree_print( v.val.t ); PRINTF( "\n" ); break;
Pavel Machek's avatar
Pavel Machek committed
138
  case T_ENUM: PRINTF( "(enum %x)%d", v.type, v.val.i ); break;
Martin Mareš's avatar
Martin Mareš committed
139
  case T_PATH: PRINTF( "%s", path_format(v.val.ad->data, v.val.ad->length)); break;
140
  case T_PATH_MASK: debug( "(path " ); { struct f_path_mask *p = v.val.s; while (p) { debug("%d ", p->val); p=p->next; } debug(")" ); } break;
141
  default: PRINTF( "[unknown type %x]", v.type );
142
#undef PRINTF
143
  }
144
  debug( buf );
145 146
}

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

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

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

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

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

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

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

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

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

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

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

    {
      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
374 375 376 377 378
      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" );
379 380
	l->attrs[0].u.data = v1.val.i;
	break;
381 382 383 384 385
      case EAF_TYPE_AS_PATH:
	if (v1.type != T_PATH)
	  runtime( "Setting path attribute to non-path value" );
	l->attrs[0].u.ptr = v1.val.ad;
	break;
Pavel Machek's avatar
Pavel Machek committed
386 387 388
      case EAF_TYPE_UNDEF:
	if (v1.type != T_VOID)
	  runtime( "Setting void attribute to non-void value" );
389 390
	l->attrs[0].u.data = 0;
	break;
391
      }
Pavel Machek's avatar
Pavel Machek committed
392

393 394
      if (!(what->aux & EAF_TEMP) && (!(f_flags & FF_FORCE_TMPATTR))) {
	*f_rte = rte_cow(*f_rte);
Pavel Machek's avatar
Pavel Machek committed
395 396 397 398 399 400
	l->next = (*f_rte)->attrs->eattrs;
	(*f_rte)->attrs->eattrs = l;
      } else {
	l->next = (*f_tmp_attrs);
	(*f_tmp_attrs) = l;
      }
401 402
    }
    break;
403

404
  case P('c','p'):	/* Convert prefix to ... */
405 406 407
    ONEARG;
    if (v1.type != T_PREFIX)
      runtime( "Can not convert non-prefix this way" );
408
    res.type = what->aux;
409 410
    switch(res.type) {
    case T_INT:	res.val.i = v1.val.px.len; break;
411
    case T_IP: res.val.px.ip = v1.val.px.ip; break;
412
    default: bug( "Unknown prefix to conversion" );
413 414
    }
    break;
415 416 417 418 419 420
  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  */
421 422
    ONEARG;
    res = interpret(what->a2.p);
423 424 425
    if (res.type == T_RETURN)
      return res;
    res.type &= ~T_RETURN;    
426
    break;
427
  case P('S','W'):
428
    ONEARG;
Pavel Machek's avatar
Pavel Machek committed
429 430 431 432 433 434
    {
      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) {
435
	  debug( "No else statement?\n ");
Pavel Machek's avatar
Pavel Machek committed
436 437 438 439
	  break;
	}
      }	
      if (!t->data)
440
	bug( "Impossible: no code associated!" );
Pavel Machek's avatar
Pavel Machek committed
441 442
      return interpret(t->data);
    }
443
    break;
444
  case P('i','M'): /* IP.MASK(val) */
445 446 447 448 449 450 451 452 453 454
    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);
    }
455
    break;
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471

  case 'E':	/* Create empty attribute */
    res.type = what->aux;
    res.val.ad = adata_empty(f_pool);
    break;
  case P('A','p'):	/* Path prepend */
    TWOARGS;
    if (v1.type != T_PATH)
      runtime("Can't prepend to non-path");
    if (v2.type != T_INT)
      runtime("Can't prepend non-integer");

    res.type = T_PATH;
    res.val.ad = as_path_prepend(f_pool, v1.val.ad, v2.val.i);
    break;

472 473 474 475 476 477 478 479
  default:
    bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
  }
  if (what->next)
    return interpret(what->next);
  return res;
}

480
#undef ARG
481 482 483 484 485 486 487 488 489 490 491 492 493 494 495
#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;
496 497
  if (!f1)
    return 1;
498 499 500 501
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;
502 503
  if (f1 == f2)		/* It looks strange, but it is possible with call rewriting trickery */
    return 1;
504 505 506 507 508

  switch(f1->code) {
  case ',': /* fall through */
  case '+':
  case '/':
509 510
  case P('!','='):
  case P('=','='):
511
  case '<':
512
  case P('<','='): TWOARGS; break;
513

Pavel Machek's avatar
Pavel Machek committed
514
  case '!': ONEARG; break;
515
  case '~': TWOARGS; break;
516
  case P('d','e'): ONEARG; break;
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537

  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;
538
  case '0': case 'E': break;
539
  case P('p',','): ONEARG; A2_SAME; break;
540
  case 'a': A2_SAME; break;
541 542
  case P('e','a'): A2_SAME; break;
  case P('e','S'): ONEARG; A2_SAME; break;
543

544 545
  case 'r': ONEARG; break;
  case P('c','p'): ONEARG; break;
546 547 548 549 550 551
  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;
552 553
  case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break;
  case P('i','M'): TWOARGS; break;
554
  case P('A','p'): TWOARGS; break;
555 556 557 558 559 560
  default:
    bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff);
  }
  return i_same(f1->next, f2->next);
}

561
int
562
f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags)
563 564 565
{
  struct f_inst *inst;
  struct f_val res;
566
  DBG( "Running filter `%s'...", filter->name );
567

568
  f_flags = flags;
Pavel Machek's avatar
Pavel Machek committed
569
  f_tmp_attrs = tmp_attrs;
570
  f_rte = rte;
571
  f_rte_old = *rte;
572
  f_pool = tmp_pool;
573 574 575 576
  inst = filter->root;
  res = interpret(inst);
  if (res.type != T_RETURN)
    return F_ERROR;
577
  DBG( "done (%d)\n", res.val.i );
578 579 580 581 582 583 584
  return res.val.i;
}

void
filters_postconfig(void)
{
  struct f_val res;
585
  if (startup_func) {
586
    debug( "Launching startup function...\n" );
587
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
588
    if (res.type == F_ERROR)
589
      die( "Startup function resulted in error." );
590
    debug( "done\n" );
591
  }
592
  self_test();
593
} 
594 595 596 597

int
filter_same(struct filter *new, struct filter *old)
{
598 599 600 601 602
  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;
603
  return i_same(new->root, old->root);
604
}
605

Pavel Machek's avatar
Pavel Machek committed
606 607 608 609 610
/* This should end up far away from here!
 *
 * FIXME: It should take struct adata *, not u8 * + length; but that makes it a little more difficult to test.
 * Or maybe both versions are usefull?
 */
611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627

int
path_getlen(u8 *p, int len)
{
  int res = 0;
  u8 *q = p+len;
  while (p<q) {
    switch (*p++) {
    case 1: len = *p++; res++;    p += 2*len; break;
    case 2: len = *p++; res+=len; p += 2*len; break;
    default: bug("This should not be in path");
    }
  }
  return res;
}


628
#define PRINTF(a...) { int l; bsnprintf( s, bigbuf+4090-s, a ); s += strlen(s); }
629 630 631 632 633
#define COMMA if (first) first = 0; else PRINTF( ", " );
char *
path_format(u8 *p, int len)
{
  char bigbuf[4096];	/* Keep it smaller than buf */
634
  char *s = bigbuf;
635 636 637 638 639 640 641 642
  int first = 1;
  int i;
  u8 *q = p+len;
  while (p<q) {
    switch (*p++) {
    case 1:	/* This is a set */
      len = *p++;
      COMMA;
643
      PRINTF( "{" );
644 645 646 647 648 649 650 651
      {
	int first = 1;
	for (i=0; i<len; i++) {
	  COMMA;
	  PRINTF( "%d", get_u16(p));
	  p+=2;
	}
      }
652
      PRINTF( "}" );
653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668
      break;

    case 2:	/* This is a sequence */
      len = *p++;
      for (i=0; i<len; i++) {
	int l;
	COMMA;
	PRINTF( "%d", get_u16(p));
	p+=2;
      }
      break;

    default:
      bug("This should not be in path");
    }
  }
Martin Mareš's avatar
Martin Mareš committed
669
  return strdup(bigbuf); /* FIXME: who frees this? */
670 671 672 673 674 675 676
}
#undef PRINTF
#undef COMMA

#define PM_END -1
#define PM_ASTERIX -2

677 678
#define MASK_PLUS do { mask = mask->next; if (mask->val == PM_END) return next == q; \
		       asterix = (mask->val == PM_ASTERIX); \
679
		       printf( "Asterix now %d\n", asterix ); \
680
                       if (asterix) { mask = mask->next; if (mask->val == PM_END) { printf( "Quick exit\n" ); return 1; } } \
681
		       } while(0)
682

683
int
684
path_match(u8 *p, int len, struct f_path_mask *mask)
685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700
{
  int i;
  int asterix = 0;
  u8 *q = p+len;
  u8 *next;

  while (p<q) {
    switch (*p++) {
    case 1:	/* This is a set */
      len = *p++;
      {
	u8 *p_save = p;
	next = p_save + 2*len;
      retry:
	p = p_save;
	for (i=0; i<len; i++) {
701
	  if (asterix && (get_u16(p) == mask->val)) {
702 703 704
	    MASK_PLUS;
	    goto retry;
	  }
705
	  if (!asterix && (get_u16(p) == mask->val)) {
706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721
	    p = next;
	    MASK_PLUS;
	    goto okay;
	  }
	  p+=2;
	}
	if (!asterix)
	  return 0;
      okay:
      }
      break;

    case 2:	/* This is a sequence */
      len = *p++;
      for (i=0; i<len; i++) {
	next = p+2;
722
	if (asterix && (get_u16(p) == mask->val))
723 724
	  MASK_PLUS;
	else if (!asterix) {
725
	  if (get_u16(p) != mask->val)
726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783
	    return 0;
	  MASK_PLUS;
	}
	p+=2;
      }
      break;

    default:
      bug("This should not be in path");
    }
  }
  return 0;
}

struct adata *
comlist_add(struct linpool *pool, struct adata *list, u32 val)
{
  struct adata *res = lp_alloc(pool, list->length + sizeof(struct adata) + 4);
  res->length = list->length+4;
  * (u32 *) res->data = val;
  memcpy((char *) res->data + 4, list->data, list->length);
  return res;
}

struct adata *
comlist_contains(struct adata *list, u32 val)
{
  u32 *l = &(list->data);
  int i;
  for (i=0; i<list->length/4; i++)
    if (*l++ == val)
      return 1;
  return 0;
}

struct adata *
comlist_del(struct linpool *pool, struct adata *list, u32 val)
{
  struct adata *res;
  u32 *l, *k;
  int i;

  if (!comlist_contains(list, val))
    return list;

  res = lp_alloc(pool, list->length + sizeof(struct adata) - 4);
  res->length = list->length-4;

  l = &(list->data);
  k = &(res->data);
  for (i=0; i<list->length/4; i++)
    if (l[i] != val)
      *k++ = l[i];

  return res;
}

struct adata *
784
adata_empty(struct linpool *pool)
785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801
{
  struct adata *res = lp_alloc(pool, sizeof(struct adata));
  res->length = 0;
  return res;
}

void
self_test(void)
{
  char path1[] = { 2, 5, 0, 5, 0, 4, 0, 3, 0, 2, 0, 1 };
  char path2[] = { 2, 5, 0, 5, 0, 4, 0, 3, 0, 2, 0, 1, 1, 5, 0, 5, 0, 4, 0, 3, 0, 2, 0, 1 };
  s32 match[] = { 5, PM_ASTERIX, 2, PM_ASTERIX, 1, 3, PM_END };

  DBG( "Filters self-testing:\n" );
  DBG( "%s\n", path_format(path1, sizeof(path1)) );
  DBG( "%s\n", path_format(path2, sizeof(path2)) );
  DBG( "5, 6 = %d, %d\n", path_getlen(path1, sizeof(path1)), path_getlen(path2, sizeof(path2)) );
802 803
//  DBG( "%d\n", path_match(path1, sizeof(path1), match));
//  DBG( "%d\n", path_match(path2, sizeof(path2), match));
804 805
//  die( "okay" );
}