filter.c 16.9 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
#include "nest/route.h"
#include "nest/protocol.h"
#include "nest/iface.h"
23
#include "nest/attrs.h"
24 25 26
#include "conf/conf.h"
#include "filter/filter.h"

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

29 30
struct f_inst *startup_func = NULL;

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

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

61 62 63
int 
val_simple_in_range(struct f_val v1, struct f_val v2)
{
64
  if ((v1.type == T_PATH) && (v2.type == T_PATH_MASK))
Pavel Machek's avatar
Pavel Machek committed
65
    return as_path_match(v1.val.ad, v2.val.path_mask);
66

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

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

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

  res = val_simple_in_range(v1, v2);

  if (res != CMP_ERROR)
    return res;

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

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

void
val_print(struct f_val v)
{
  char buf[2048];
128
  char buf2[1024];
129 130 131 132 133 134 135
#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
  case T_PATH: as_path_format(v.val.ad, buf2, 1020); PRINTF( "(path %s)", buf2 ); break;
142
  case T_CLIST: int_set_format(v.val.ad, buf2, 1020); PRINTF( "(clist %s)", buf2 ); break;
143
  case T_PATH_MASK: debug( "(pathmask " ); { struct f_path_mask *p = v.val.s; while (p) { debug("%d ", p->val); p=p->next; } debug(")" ); } break;
144
  default: PRINTF( "[unknown type %x]", v.type );
145
#undef PRINTF
146
  }
147
  debug( buf );
148 149
}

150
static struct rte **f_rte, *f_rte_old;
151
static struct linpool *f_pool;
Pavel Machek's avatar
Pavel Machek committed
152
static struct ea_list **f_tmp_attrs;
153
static int f_flags;
154

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

174 175 176 177 178
static struct f_val
interpret(struct f_inst *what)
{
  struct symbol *sym;
  struct f_val v1, v2, res;
179
  int i,j,k;
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 209 210 211

  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 */
212 213 214 215 216 217 218 219

#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); \
220
    break;
221

222 223
  case P('!','='): COMPARE(i!=0);
  case P('=','='): COMPARE(i==0);
224
  case '<': COMPARE(i==-1);
225
  case P('<','='): COMPARE(i!=1);
226

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

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

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

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

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

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

398 399
      if (!(what->aux & EAF_TEMP) && (!(f_flags & FF_FORCE_TMPATTR))) {
	*f_rte = rte_cow(*f_rte);
Pavel Machek's avatar
Pavel Machek committed
400 401 402 403 404 405
	l->next = (*f_rte)->attrs->eattrs;
	(*f_rte)->attrs->eattrs = l;
      } else {
	l->next = (*f_tmp_attrs);
	(*f_tmp_attrs) = l;
      }
406 407
    }
    break;
408

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

  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;

486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
  case P('C','a'):	/* Community list add or delete */
    TWOARGS;
    if (v1.type != T_CLIST)
      runtime("Can't add/delete to non-clist");
    if (v2.type != T_PAIR)
      runtime("Can't add/delete non-pair");

    res.type = T_CLIST;
    switch (what->aux) {
    case 'a': res.val.ad = int_set_add(f_pool, v1.val.ad, v2.val.i); break;
    case 'd': res.val.ad = int_set_del(f_pool, v1.val.ad, v2.val.i); break;
    default: bug("unknown Ca operation");
    }
    break;

501 502 503 504 505 506 507 508
  default:
    bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
  }
  if (what->next)
    return interpret(what->next);
  return res;
}

509
#undef ARG
510 511 512 513 514 515 516 517 518 519 520 521 522 523 524
#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;
525 526
  if (!f1)
    return 1;
527 528 529 530
  if (f1->aux != f2->aux)
    return 0;
  if (f1->code != f2->code)
    return 0;
531 532
  if (f1 == f2)		/* It looks strange, but it is possible with call rewriting trickery */
    return 1;
533 534 535 536 537

  switch(f1->code) {
  case ',': /* fall through */
  case '+':
  case '/':
538 539
  case P('!','='):
  case P('=','='):
540
  case '<':
541
  case P('<','='): TWOARGS; break;
542

Pavel Machek's avatar
Pavel Machek committed
543
  case '!': ONEARG; break;
544
  case '~': TWOARGS; break;
545
  case P('d','e'): ONEARG; break;
546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564

  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;
565
  case 'p': case 'L': ONEARG; break;
566
  case '?': TWOARGS; break;
567
  case '0': case 'E': break;
568
  case P('p',','): ONEARG; A2_SAME; break;
569
  case 'a': A2_SAME; break;
570 571
  case P('e','a'): A2_SAME; break;
  case P('e','S'): ONEARG; A2_SAME; break;
572

573 574
  case 'r': ONEARG; break;
  case P('c','p'): ONEARG; break;
575 576 577 578 579 580
  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;
581 582
  case P('S','W'): ONEARG; if (!same_tree(f1->a2.p, f2->a2.p)) return 0; break;
  case P('i','M'): TWOARGS; break;
583
  case P('A','p'): TWOARGS; break;
584
  case P('C','a'): TWOARGS; break;
585 586 587 588 589 590
  default:
    bug( "Unknown instruction %d in same (%c)", f1->code, f1->code & 0xff);
  }
  return i_same(f1->next, f2->next);
}

591
int
592
f_run(struct filter *filter, struct rte **rte, struct ea_list **tmp_attrs, struct linpool *tmp_pool, int flags)
593 594 595
{
  struct f_inst *inst;
  struct f_val res;
596
  DBG( "Running filter `%s'...", filter->name );
597

598
  f_flags = flags;
Pavel Machek's avatar
Pavel Machek committed
599
  f_tmp_attrs = tmp_attrs;
600
  f_rte = rte;
601
  f_rte_old = *rte;
602
  f_pool = tmp_pool;
603 604 605 606
  inst = filter->root;
  res = interpret(inst);
  if (res.type != T_RETURN)
    return F_ERROR;
607
  DBG( "done (%d)\n", res.val.i );
608 609 610 611 612 613 614
  return res.val.i;
}

void
filters_postconfig(void)
{
  struct f_val res;
615
  if (startup_func) {
616
    debug( "Launching startup function...\n" );
617
    f_pool = lp_new(&root_pool, 1024);
618
    res = interpret(startup_func);
Pavel Machek's avatar
Pavel Machek committed
619
    if (res.type == F_ERROR)
620
      die( "Startup function resulted in error." );
621
    debug( "done\n" );
622
  }
623
} 
624 625 626 627

int
filter_same(struct filter *new, struct filter *old)
{
628 629 630 631 632
  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;
633
  return i_same(new->root, old->root);
634
}
635

Pavel Machek's avatar
Pavel Machek committed
636 637
/* This should end up far away from here!
 */
638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681
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 *
682
adata_empty(struct linpool *pool)
683 684 685 686 687
{
  struct adata *res = lp_alloc(pool, sizeof(struct adata));
  res->length = 0;
  return res;
}