config.Y 25 KB
Newer Older
1 2 3
/*
 *	BIRD - filters
 *
4
 *	Copyright 1998--2000 Pavel Machek
5 6
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
7
 *
Pavel Machek's avatar
Pavel Machek committed
8
	FIXME: priority of ! should be lower
9 10 11 12
 */

CF_HDR

13 14
CF_DEFINES

15
#define P(a,b) ((a << 8) | b)
16

17 18 19 20 21 22 23 24 25 26 27
static inline u32 pair(u32 a, u32 b) { return (a << 16) | b; }
static inline u32 pair_a(u32 p) { return p >> 16; }
static inline u32 pair_b(u32 p) { return p & 0xFFFF; }


/*
 * Sets and their items are during parsing handled as lists, linked
 * through left ptr. The first item in a list also contains a pointer
 * to the last item in a list (right ptr). For convenience, even items
 * are handled as one-item lists. Lists are merged by f_merge_items().
 */
28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44
static int
f_valid_set_type(int type)
{
  switch (type)
  {
  case T_INT:
  case T_PAIR:
  case T_QUAD:
  case T_ENUM:
  case T_IP:
  case T_EC:
    return 1;

  default:
    return 0;
  }
}
45 46 47

static inline struct f_tree *
f_new_item(struct f_val from, struct f_val to)
48
{
49 50 51 52 53 54
  struct f_tree *t = f_new_tree();
  t->right = t;
  t->from = from;
  t->to = to;
  return t;
}
55

56 57 58 59 60 61 62 63 64
static inline struct f_tree *
f_merge_items(struct f_tree *a, struct f_tree *b)
{
  if (!a) return b;
  a->right->left = b;
  a->right = b->right;
  b->right = NULL;
  return a;
}
65

66 67 68 69 70 71 72 73 74
static inline struct f_tree *
f_new_pair_item(int fa, int ta, int fb, int tb)
{
  struct f_tree *t = f_new_tree();
  t->right = t;
  t->from.type = t->to.type = T_PAIR;
  t->from.val.i = pair(fa, fb);
  t->to.val.i = pair(ta, tb);
  return t;
75 76
}

77 78
static inline struct f_tree *
f_new_pair_set(int fa, int ta, int fb, int tb)
79
{
80 81
  struct f_tree *lst = NULL;
  int i;
Ondřej Filip's avatar
Ondřej Filip committed
82

83 84 85 86 87
  if ((fa == ta) || ((fb == 0) && (tb == 0xFFFF)))
    return f_new_pair_item(fa, ta, fb, tb);
  
  if ((ta < fa) || (tb < fb))
    cf_error( "From value cannot be higher that To value in pair sets");
Ondřej Filip's avatar
Ondřej Filip committed
88

89 90 91 92
  for (i = fa; i <= ta; i++)
    lst = f_merge_items(lst, f_new_pair_item(i, i, fb, tb));

  return lst;
93 94
}

95 96 97 98 99 100 101 102 103 104 105 106 107 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 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 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 202 203 204 205 206 207 208 209 210 211 212
#define EC_ALL 0xFFFFFFFF

static struct f_tree *
f_new_ec_item(u32 kind, u32 ipv4_used, u32 key, u32 vf, u32 vt)
{
  u64 fm, to;

  if (ipv4_used || (key >= 0x10000)) {
    check_u16(vf);
    if (vt == EC_ALL)
      vt = 0xFFFF;
    else
      check_u16(vt);
  }

  if (kind == EC_GENERIC) {
    fm = ec_generic(key, vf);
    to = ec_generic(key, vt);
  }
  else if (ipv4_used) {
    fm = ec_ip4(kind, key, vf);
    to = ec_ip4(kind, key, vt);
  }
  else if (key < 0x10000) {
    fm = ec_as2(kind, key, vf);
    to = ec_as2(kind, key, vt);
  }
  else {
    fm = ec_as4(kind, key, vf);
    to = ec_as4(kind, key, vt);
  }

  struct f_tree *t = f_new_tree();
  t->right = t;
  t->from.type = t->to.type = T_EC;
  t->from.val.ec = fm;
  t->to.val.ec = to;
  return t;
}

static inline struct f_inst *
f_generate_empty(struct f_inst *dyn)
{ 
  struct f_inst *e = f_new_inst();
  e->code = 'E';

  switch (dyn->aux & EAF_TYPE_MASK) {
    case EAF_TYPE_AS_PATH:
      e->aux = T_PATH;
      break;
    case EAF_TYPE_INT_SET:
      e->aux = T_CLIST;
      break;
    case EAF_TYPE_EC_SET:
      e->aux = T_ECLIST;
      break;
    default:
      cf_error("Can't empty that attribute");
  }

  dyn->code = P('e','S');
  dyn->a1.p = e;
  return dyn;
}


static inline struct f_inst *
f_generate_dpair(struct f_inst *t1, struct f_inst *t2)
{
  struct f_inst *rv;

  if ((t1->code == 'c') && (t2->code == 'c')) {
    if ((t1->aux != T_INT) || (t2->aux != T_INT))
      cf_error( "Can't operate with value of non-integer type in pair constructor");

    check_u16(t1->a2.i);
    check_u16(t2->a2.i);

    rv = f_new_inst();
    rv->code = 'c';
    rv->aux = T_PAIR;
    rv->a2.i = pair(t1->a2.i, t2->a2.i);
  }
  else {
    rv = f_new_inst();
    rv->code = P('m', 'p');
    rv->a1.p = t1;
    rv->a2.p = t2;
  }

  return rv;
}

static inline struct f_inst *
f_generate_ec(u16 kind, struct f_inst *tk, struct f_inst *tv)
{
  struct f_inst *rv;
  int c1 = 0, c2 = 0, ipv4_used = 0;
  u32 key = 0, val2 = 0;

  if (tk->code == 'c') {
    c1 = 1;

    if (tk->aux == T_INT) {
      ipv4_used = 0; key = tk->a2.i;
    }
    else if (tk->aux == T_QUAD) {
      ipv4_used = 1; key = tk->a2.i;
    }
    else
      cf_error("Can't operate with key of non-integer/IPv4 type in EC constructor");
  }

#ifndef IPV6
  /* IP->Quad implicit conversion */
  else if (tk->code == 'C') {
    c1 = 1;
    struct f_val *val = tk->a1.p;
213 214 215 216 217 218 219 220

    if (val->type == T_INT) {
      ipv4_used = 0; key = val->val.i;
    }
    else if (val->type == T_QUAD) {
      ipv4_used = 1; key = val->val.i;
    }
    else if (val->type == T_IP) {
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268
      ipv4_used = 1; key = ipa_to_u32(val->val.px.ip);
    }
    else
      cf_error("Can't operate with key of non-integer/IPv4 type in EC constructor");
  }
#endif

  if (tv->code == 'c') {
    if (tv->aux != T_INT)
      cf_error("Can't operate with value of non-integer type in EC constructor");
    c2 = 1;
    val2 = tv->a2.i;
  }

  if (c1 && c2) {
    u64 ec;
  
    if (kind == EC_GENERIC) {
      ec = ec_generic(key, val2);
    }
    else if (ipv4_used) {
      check_u16(val2);
      ec = ec_ip4(kind, key, val2);
    }
    else if (key < 0x10000) {
      ec = ec_as2(kind, key, val2);
    }
    else {
      check_u16(val2);
      ec = ec_as4(kind, key, val2);
    }

    NEW_F_VAL;
    rv = f_new_inst();
    rv->code = 'C';
    rv->a1.p = val;    
    val->type = T_EC;
    val->val.ec = ec;
  }
  else {
    rv = f_new_inst();
    rv->code = P('m','c');
    rv->aux = kind;
    rv->a1.p = tk;
    rv->a2.p = tv;
  }

  return rv;
269
}
270 271 272



273 274
CF_DECLS

Pavel Machek's avatar
Pavel Machek committed
275
CF_KEYWORDS(FUNCTION, PRINT, PRINTN, UNSET, RETURN,
276
	ACCEPT, REJECT, ERROR, QUITBIRD,
277 278
	INT, BOOL, IP, PREFIX, PAIR, QUAD, EC,
	SET, STRING, BGPMASK, BGPPATH, CLIST, ECLIST,
279
	IF, THEN, ELSE, CASE,
280
	TRUE, FALSE, RT, RO, UNKNOWN, GENERIC,
281 282
	FROM, GW, NET, MASK, PROTO, SOURCE, SCOPE, CAST, DEST, IFNAME, IFINDEX,
	PREFERENCE,
283
	LEN,
284
	DEFINED,
285
	ADD, DELETE, CONTAINS, RESET,
286
	PREPEND, FIRST, LAST, LAST_NONAGGREGATED, MATCH,
287
	ROA_CHECK,
288
	EMPTY,
289
	FILTER, WHERE, EVAL)
290

291
%nonassoc THEN
292
%nonassoc ELSE
293

294
%type <x> term block cmds cmds_int cmd function_body constant constructor print_one print_list var_list var_listn dynamic_attr static_attr function_call symbol bgp_path_expr
295
%type <f> filter filter_body where_filter
296 297 298
%type <i> type break_command pair_expr ec_kind
%type <i32> pair_atom ec_expr
%type <e> pair_item ec_item set_item switch_item set_items switch_items switch_body
299
%type <trie> fprefix_set
300
%type <v> set_atom switch_atom fprefix fprefix_s fipa
301
%type <s> decls declsn one_decl function_params 
302
%type <h> bgp_path bgp_path_tail1 bgp_path_tail2
303 304 305

CF_GRAMMAR

306 307
CF_ADDTO(conf, filter_def)
filter_def:
308 309 310
   FILTER SYM { $2 = cf_define_symbol($2, SYM_FILTER, NULL); cf_push_scope( $2 ); }
     filter_body {
     $2->def = $4;
311
     $4->name = $2->name;
312
     DBG( "We have new filter defined (%s)\n", $2->name );
313
     cf_pop_scope();
314 315 316
   }
 ;

317 318 319 320 321
CF_ADDTO(conf, filter_eval)
filter_eval:
   EVAL term { f_eval_int($2); }
 ;

322 323 324 325 326 327
type:
   INT { $$ = T_INT; }
 | BOOL { $$ = T_BOOL; }
 | IP { $$ = T_IP; }
 | PREFIX { $$ = T_PREFIX; }
 | PAIR { $$ = T_PAIR; }
328
 | QUAD { $$ = T_QUAD; }
329
 | EC { $$ = T_EC; }
330
 | STRING { $$ = T_STRING; }
331 332 333
 | BGPMASK { $$ = T_PATH_MASK; }
 | BGPPATH { $$ = T_PATH; }
 | CLIST { $$ = T_CLIST; }
334
 | ECLIST { $$ = T_ECLIST; }
335 336
 | type SET { 
	switch ($1) {
337 338
	  case T_INT:
	  case T_PAIR:
339
	  case T_QUAD:
340
	  case T_EC:
341
	  case T_IP:
342 343 344 345 346 347 348
	       $$ = T_SET;
	       break;

	  case T_PREFIX:
	       $$ = T_PREFIX_SET;
	    break;

349
	  default:
Pavel Machek's avatar
Pavel Machek committed
350
		cf_error( "You can't create sets of this type." );
351
	}
352
   }
353 354
 ;

355 356
one_decl:
   type SYM {
357 358
     struct f_val * val = cfg_alloc(sizeof(struct f_val));
     val->type = T_VOID;
359
     $2 = cf_define_symbol($2, SYM_VARIABLE | $1, val);
360
     DBG( "New variable %s type %x\n", $2->name, $1 );
361
     $2->aux2 = NULL;
362
     $$=$2;
363 364 365
   }
 ;

366 367 368 369
/* Decls with ';' at the end */
decls: /* EMPTY */ { $$ = NULL; }
 | one_decl ';' decls {
     $$ = $1;
370
     $$->aux2 = $3;
371 372 373
   }
 ;

374
/* Declarations that have no ';' at the end. */
375
declsn: one_decl { $$ = $1; }
376
 | one_decl ';' declsn {
377
     $$ = $1;
378
     $$->aux2 = $3;
379 380 381
   }
 ;

382
filter_body:
383
   function_body {
384 385
     struct filter *f = cfg_alloc(sizeof(struct filter));
     f->name = NULL;
386
     f->root = $1;
387 388 389 390 391 392
     $$ = f;
   }
 ;

filter:
   SYM {
Pavel Machek's avatar
Pavel Machek committed
393
     if ($1->class != SYM_FILTER) cf_error("No such filter.");
394 395 396 397 398
     $$ = $1->def;
   }
 | filter_body
 ;

399 400 401 402 403 404
where_filter:
   WHERE term {
     /* Construct 'IF term THEN ACCEPT; REJECT;' */
     struct filter *f = cfg_alloc(sizeof(struct filter));
     struct f_inst *i, *acc, *rej;
     acc = f_new_inst();		/* ACCEPT */
405
     acc->code = P('p',',');
406 407 408
     acc->a1.p = NULL;
     acc->a2.i = F_ACCEPT;
     rej = f_new_inst();		/* REJECT */
409
     rej->code = P('p',',');
410 411 412 413 414 415 416 417 418 419 420 421 422
     rej->a1.p = NULL;
     rej->a2.i = F_REJECT;
     i = f_new_inst();			/* IF */
     i->code = '?';
     i->a1.p = $2;
     i->a2.p = acc;
     i->next = rej;
     f->name = NULL;
     f->root = i;
     $$ = f;
  }
 ;

423
function_params:
424
   '(' declsn ')' { DBG( "Have function parameters\n" ); $$=$2; }
425
 | '(' ')' { $$=NULL; }
426
 ;
427

428 429
function_body:
   decls '{' cmds '}' {
430 431 432 433 434 435 436 437
     if ($1) {
       /* Prepend instruction to clear local variables */
       $$ = f_new_inst();
       $$->code = P('c','v');
       $$->a1.p = $1;
       $$->next = $3;
     } else
       $$ = $3;
438
   }
439 440 441 442
 ;

CF_ADDTO(conf, function_def)
function_def:
443 444 445 446 447
   FUNCTION SYM { DBG( "Beginning of function %s\n", $2->name );
     $2 = cf_define_symbol($2, SYM_FUNCTION, NULL);
     cf_push_scope($2);
   } function_params function_body {
     $2->def = $5;
448
     $2->aux2 = $4;
449
     DBG("Hmm, we've got one function here - %s\n", $2->name); 
450
     cf_pop_scope();
451 452 453 454 455
   }
 ;

/* Programs */

456 457 458
/* Hack: $$ of cmds_int is the last node.
   $$->next of cmds_int is temporary used for the first node */

459
cmds: /* EMPTY */ { $$ = NULL; }
460 461 462 463 464
 | cmds_int { $$ = $1->next; $1->next = NULL; }
 ;

cmds_int: cmd { $$ = $1; $1->next = $1; }
 | cmds_int cmd { $$ = $2; $2->next = $1->next ; $1->next = $2; }
465 466
 ;

467
block:
468
   cmd {
469 470 471 472 473 474 475
     $$=$1;
   }
 | '{' cmds '}' {
     $$=$2;
   }
 ;

476 477 478
/*
 * Complex types, their bison value is struct f_val
 */
479
fipa:
480
   IPA %prec PREFIX_DUMMY { $$.type = T_IP; $$.val.px.ip = $1; }
481 482
 ;

483 484 485 486 487 488 489 490 491


/*
 * Set constants. They are also used in switch cases. We use separate
 * nonterminals for switch (set_atom/switch_atom, set_item/switch_item ...)
 * to elude a collision between symbol (in expr) in set_atom and symbol
 * as a function call in switch case cmds.
 */

492
set_atom:
493
   NUM   { $$.type = T_INT; $$.val.i = $1; }
494
 | RTRID { $$.type = T_QUAD; $$.val.i = $1; }
495
 | fipa  { $$ = $1; }
496
 | ENUM  { $$.type = pair_a($1); $$.val.i = pair_b($1); }
497 498 499 500 501 502 503 504 505
 | '(' term ')' {
     $$ = f_eval($2, cfg_mem);
     if (!f_valid_set_type($$.type)) cf_error("Set-incompatible type");
   }
 | SYM {
     if (!cf_symbol_is_constant($1)) cf_error("%s: constant expected", $1->name);
     if (!f_valid_set_type(SYM_TYPE($1))) cf_error("%s: set-incompatible type", $1->name);
     $$ = *(struct f_val *)($1->def);
   }
506
 ;
507

508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527
switch_atom:
   NUM   { $$.type = T_INT; $$.val.i = $1; }
 | '(' term ')' { $$.type = T_INT; $$.val.i = f_eval_int($2); }
 | RTRID { $$.type = T_QUAD; $$.val.i = $1; }
 | fipa  { $$ = $1; }
 | ENUM  { $$.type = pair_a($1); $$.val.i = pair_b($1); }
 ;

pair_expr:
   term { $$ = f_eval_int($1); check_u16($$); }

pair_atom:
   pair_expr { $$ = pair($1, $1); }
 | pair_expr DDOT pair_expr { $$ = pair($1, $3); }
 | '*' { $$ = 0xFFFF; }
 ;

pair_item:
   '(' pair_atom ',' pair_atom ')' {
     $$ = f_new_pair_set(pair_a($2), pair_b($2), pair_a($4), pair_b($4));
528
   }
529 530 531 532
 | '(' pair_atom ',' pair_atom ')' DDOT '(' pair_expr ',' pair_expr ')' {
     /* Hack: $2 and $4 should be pair_expr, but that would cause shift/reduce conflict */
     if ((pair_a($2) != pair_b($2)) || (pair_a($4) != pair_b($4)))
       cf_error("syntax error");
533
     $$ = f_new_pair_item(pair_b($2), $8, pair_b($4), $10); 
534
   }
535 536
 ;

537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552
ec_expr:
   term { $$ = f_eval_int($1); }

ec_kind:
   RT { $$ = EC_RT; }
 | RO { $$ = EC_RO; }
 | UNKNOWN NUM { $$ = $2; }
 | GENERIC { $$ = EC_GENERIC; }
 ;

ec_item:
   '(' ec_kind ',' ec_expr ',' ec_expr ')' { $$ = f_new_ec_item($2, 0, $4, $6, $6); }
 | '(' ec_kind ',' ec_expr ',' ec_expr DDOT ec_expr ')' { $$ = f_new_ec_item($2, 0, $4, $6, $8); }
 | '(' ec_kind ',' ec_expr ',' '*' ')' {  $$ = f_new_ec_item($2, 0, $4, 0, EC_ALL); }
 ;

553 554
set_item:
   pair_item
555
 | ec_item
556 557 558 559 560 561
 | set_atom { $$ = f_new_item($1, $1); }
 | set_atom DDOT set_atom { $$ = f_new_item($1, $3); }
 ;

switch_item:
   pair_item
562
 | ec_item
563 564 565 566
 | switch_atom { $$ = f_new_item($1, $1); }
 | switch_atom DDOT switch_atom { $$ = f_new_item($1, $3); }
 ;

567
set_items:
568 569 570 571 572 573 574
   set_item
 | set_items ',' set_item { $$ = f_merge_items($1, $3); }
 ;

switch_items:
   switch_item
 | switch_items ',' switch_item { $$ = f_merge_items($1, $3); }
575 576
 ;

577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594
fprefix_s:
   IPA '/' NUM %prec '/' {
     if (($3 < 0) || ($3 > MAX_PREFIX_LENGTH) || !ip_is_prefix($1, $3)) cf_error("Invalid network prefix: %I/%d.", $1, $3);
     $$.type = T_PREFIX; $$.val.px.ip = $1; $$.val.px.len = $3;
   }
 ;

fprefix:
   fprefix_s { $$ = $1; }
 | fprefix_s '+' { $$ = $1; $$.val.px.len |= LEN_PLUS; }
 | fprefix_s '-' { $$ = $1; $$.val.px.len |= LEN_MINUS; }
 | fprefix_s '{' NUM ',' NUM '}' { 
     if (! ((0 <= $3) && ($3 <= $5) && ($5 <= MAX_PREFIX_LENGTH))) cf_error("Invalid prefix pattern range: {%d, %d}.", $3, $5);
     $$ = $1; $$.val.px.len |= LEN_RANGE | ($3 << 16) | ($5 << 8);
   }
 ;

fprefix_set:
595
   fprefix { $$ = f_new_trie(cfg_mem, sizeof(struct f_trie_node)); trie_add_fprefix($$, &($1.val.px)); }
596
 | fprefix_set ',' fprefix { $$ = $1; trie_add_fprefix($$, &($3.val.px)); }
597 598
 ;

Pavel Machek's avatar
Pavel Machek committed
599
switch_body: /* EMPTY */ { $$ = NULL; }
600 601 602 603 604 605
 | switch_body switch_items ':' cmds  {
     /* Fill data fields */
     struct f_tree *t;
     for (t = $2; t; t = t->left)
       t->data = $4;
     $$ = f_merge_items($1, $2);
Pavel Machek's avatar
Pavel Machek committed
606
   }
607 608 609 610 611 612 613
 | switch_body ELSECOL cmds { 
     struct f_tree *t = f_new_tree();
     t->from.type = t->to.type = T_VOID;
     t->right = t;
     t->data = $3;
     $$ = f_merge_items($1, t);
 }
Pavel Machek's avatar
Pavel Machek committed
614
 ;
615

Pavel Machek's avatar
Pavel Machek committed
616 617
/* CONST '(' expr ')' { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_INT; $$->a2.i = $3; } */

618 619 620 621 622
bgp_path_expr:
   symbol       { $$ = $1; }   
 | '(' term ')' { $$ = $2; }
 ;

623
bgp_path:
624
   PO  bgp_path_tail1 PC  { $$ = $2; }
625 626 627 628
 | '/' bgp_path_tail2 '/' { $$ = $2; }
 ;

bgp_path_tail1:
629 630 631 632 633 634
   NUM bgp_path_tail1		{ $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN; $$->val = $1; }
 | NUM DDOT NUM bgp_path_tail1	{ $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $4; $$->kind = PM_ASN_RANGE; $$->val = $1; $$->val2 = $3; }
 | '*' bgp_path_tail1		{ $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASTERISK; }
 | '?' bgp_path_tail1		{ $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_QUESTION; }
 | bgp_path_expr bgp_path_tail1	{ $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN_EXPR; $$->val = (uintptr_t) $1; }
 | 				{ $$ = NULL; }
635
 ;
636

637
bgp_path_tail2:
638 639
   NUM bgp_path_tail2 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASN; $$->val = $1; }
 | '?' bgp_path_tail2 { $$ = cfg_allocz(sizeof(struct f_path_mask)); $$->next = $2; $$->kind = PM_ASTERISK; }
640
 | 		      { $$ = NULL; }
641 642
 ;

643
constant:
Pavel Machek's avatar
Pavel Machek committed
644
   NUM    { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_INT;  $$->a2.i = $1; }
645 646 647
 | TRUE   { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_BOOL; $$->a2.i = 1;  }
 | FALSE  { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_BOOL; $$->a2.i = 0;  }
 | TEXT   { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_STRING; $$->a2.p = $1; }
648
 | fipa	   { NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; $$->a1.p = val; *val = $1; }
649
 | fprefix_s {NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; $$->a1.p = val; *val = $1; }
650
 | RTRID  { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_QUAD;  $$->a2.i = $1; }
651
 | '[' set_items ']' { DBG( "We've got a set here..." ); $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_SET; $$->a2.p = build_tree($2); DBG( "ook\n" ); }
652
 | '[' fprefix_set ']' { $$ = f_new_inst(); $$->code = 'c'; $$->aux = T_PREFIX_SET;  $$->a2.p = $2; }
653
 | ENUM	  { $$ = f_new_inst(); $$->code = 'c'; $$->aux = $1 >> 16; $$->a2.i = $1 & 0xffff; }
654
 | bgp_path { NEW_F_VAL; $$ = f_new_inst(); $$->code = 'C'; val->type = T_PATH_MASK; val->val.path_mask = $1; $$->a1.p = val; }
655 656
 ;

657
constructor:
658 659
   '(' term ',' term ')' { $$ = f_generate_dpair($2, $4); }
 | '(' ec_kind ',' term ',' term ')' { $$ = f_generate_ec($2, $4, $6); }
660 661
 ;

662

663 664 665
/*
 *  Maybe there are no dynamic attributes defined by protocols.
 *  For such cases, we force the dynamic_attr list to contain
666
 *  at least an invalid token, so it is syntantically correct.
667 668
 */
CF_ADDTO(dynamic_attr, INVALID_TOKEN { $$ = NULL; })
669

Pavel Machek's avatar
Pavel Machek committed
670
rtadot: /* EMPTY, we are not permitted RTA. prefix */
671
 ;
672

673 674 675 676 677
function_call:
   SYM '(' var_list ')' {
     struct symbol *sym;
     struct f_inst *inst = $3;
     if ($1->class != SYM_FUNCTION)
Pavel Machek's avatar
Pavel Machek committed
678
       cf_error("You can't call something which is not a function. Really.");
679
     DBG("You are calling function %s\n", $1->name);
680 681 682
     $$ = f_new_inst();
     $$->code = P('c','a');
     $$->a1.p = inst;
683 684
     $$->a2.p = $1->def;
     sym = $1->aux2;
685 686
     while (sym || inst) {
       if (!sym || !inst)
Pavel Machek's avatar
Pavel Machek committed
687
	 cf_error("Wrong number of arguments for function %s.", $1->name);
688
       DBG( "You should pass parameter called %s\n", sym->name);
689
       inst->a1.p = sym;
690
       sym = sym->aux2;
691 692 693 694 695
       inst = inst->next;
     }
   }
 ;

696 697 698
symbol:
   SYM {
     $$ = f_new_inst();
699 700 701 702 703

     switch ($1->class & 0xff00) {
       case SYM_CONSTANT: $$->code = 'C'; break;
       case SYM_VARIABLE: $$->code = 'V'; break;
       default: cf_error("%s: variable expected.", $1->name);
704
     }
705 706 707

     $$->a1.p = $1->def;
     $$->a2.p = $1->name;
708 709
   }

710
static_attr:
711 712 713 714 715 716 717 718 719 720
   FROM    { $$ = f_new_inst(); $$->aux = T_IP;         $$->a2.i = SA_FROM;	$$->a1.i = 1; }
 | GW      { $$ = f_new_inst(); $$->aux = T_IP;         $$->a2.i = SA_GW;	$$->a1.i = 1; }
 | NET     { $$ = f_new_inst(); $$->aux = T_PREFIX;     $$->a2.i = SA_NET; }
 | PROTO   { $$ = f_new_inst(); $$->aux = T_STRING;     $$->a2.i = SA_PROTO; }
 | SOURCE  { $$ = f_new_inst(); $$->aux = T_ENUM_RTS;   $$->a2.i = SA_SOURCE; }
 | SCOPE   { $$ = f_new_inst(); $$->aux = T_ENUM_SCOPE; $$->a2.i = SA_SCOPE;	$$->a1.i = 1; }
 | CAST    { $$ = f_new_inst(); $$->aux = T_ENUM_RTC;   $$->a2.i = SA_CAST; }
 | DEST    { $$ = f_new_inst(); $$->aux = T_ENUM_RTD;   $$->a2.i = SA_DEST;	$$->a1.i = 1; }
 | IFNAME  { $$ = f_new_inst(); $$->aux = T_STRING;     $$->a2.i = SA_IFNAME; }
 | IFINDEX { $$ = f_new_inst(); $$->aux = T_INT;        $$->a2.i = SA_IFINDEX; }
721 722
 ;

723
term:
724
   '(' term ')'      { $$ = $2; }
725
 | term '+' term     { $$ = f_new_inst(); $$->code = '+';        $$->a1.p = $1; $$->a2.p = $3; }
726 727 728
 | term '-' term     { $$ = f_new_inst(); $$->code = '-';        $$->a1.p = $1; $$->a2.p = $3; }
 | term '*' term     { $$ = f_new_inst(); $$->code = '*';        $$->a1.p = $1; $$->a2.p = $3; }
 | term '/' term     { $$ = f_new_inst(); $$->code = '/';        $$->a1.p = $1; $$->a2.p = $3; }
Pavel Machek's avatar
Pavel Machek committed
729 730
 | term AND term     { $$ = f_new_inst(); $$->code = '&';        $$->a1.p = $1; $$->a2.p = $3; }
 | term OR  term     { $$ = f_new_inst(); $$->code = '|';        $$->a1.p = $1; $$->a2.p = $3; }
731
 | term '=' term     { $$ = f_new_inst(); $$->code = P('=','='); $$->a1.p = $1; $$->a2.p = $3; }
732 733 734 735 736 737
 | term NEQ term { $$ = f_new_inst(); $$->code = P('!','=');     $$->a1.p = $1; $$->a2.p = $3; }
 | term '<' term     { $$ = f_new_inst(); $$->code = '<';        $$->a1.p = $1; $$->a2.p = $3; }
 | term LEQ term { $$ = f_new_inst(); $$->code = P('<','=');     $$->a1.p = $1; $$->a2.p = $3; }
 | term '>' term     { $$ = f_new_inst(); $$->code = '<';        $$->a1.p = $3; $$->a2.p = $1; }
 | term GEQ term { $$ = f_new_inst(); $$->code = P('<','=');     $$->a1.p = $3; $$->a2.p = $1; }
 | term '~' term     { $$ = f_new_inst(); $$->code = '~';        $$->a1.p = $1; $$->a2.p = $3; }
738
 | term NMA term { $$ = f_new_inst(); $$->code = P('!','~');     $$->a1.p = $1; $$->a2.p = $3; }
739
 | '!' term { $$ = f_new_inst(); $$->code = '!'; $$->a1.p = $2; }
740
 | DEFINED '(' term ')' { $$ = f_new_inst(); $$->code = P('d','e');  $$->a1.p = $3; }
741

742
 | symbol   { $$ = $1; }
743
 | constant { $$ = $1; }
744
 | constructor { $$ = $1; }
745

746
 | PREFERENCE { $$ = f_new_inst(); $$->code = 'P'; }
747 748

 | rtadot static_attr { $$ = $2; $$->code = 'a'; }
749

750
 | rtadot dynamic_attr { $$ = $2; $$->code = P('e','a'); }
751

752
 | term '.' IP { $$ = f_new_inst(); $$->code = P('c','p'); $$->a1.p = $1; $$->aux = T_IP; }
753
 | term '.' LEN { $$ = f_new_inst(); $$->code = 'L'; $$->a1.p = $1; }
754
 | term '.' MASK '(' term ')' { $$ = f_new_inst(); $$->code = P('i','M'); $$->a1.p = $1; $$->a2.p = $5; }
755 756
 | term '.' FIRST { $$ = f_new_inst(); $$->code = P('a','f'); $$->a1.p = $1; }
 | term '.' LAST  { $$ = f_new_inst(); $$->code = P('a','l'); $$->a1.p = $1; }
757
 | term '.' LAST_NONAGGREGATED  { $$ = f_new_inst(); $$->code = P('a','L'); $$->a1.p = $1; }
758 759

/* Communities */
760 761 762 763
/* This causes one shift/reduce conflict
 | rtadot dynamic_attr '.' ADD '(' term ')' { }
 | rtadot dynamic_attr '.' DELETE '(' term ')' { }
 | rtadot dynamic_attr '.' CONTAINS '(' term ')' { }
764
 | rtadot dynamic_attr '.' RESET{ }
765
*/
766

767
 | '+' EMPTY '+' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_PATH; }
768
 | '-' EMPTY '-' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_CLIST; }
769
 | '-' '-' EMPTY '-' '-' { $$ = f_new_inst(); $$->code = 'E'; $$->aux = T_ECLIST; }
770
 | PREPEND '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('A','p'); $$->a1.p = $3; $$->a2.p = $5; } 
771 772
 | ADD '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'a'; } 
 | DELETE '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'd'; }
773
 | FILTER '(' term ',' term ')' { $$ = f_new_inst(); $$->code = P('C','a'); $$->a1.p = $3; $$->a2.p = $5; $$->aux = 'f'; }
774

775 776 777
 | ROA_CHECK '(' SYM ')' { $$ = f_generate_roa_check($3, NULL, NULL); }
 | ROA_CHECK '(' SYM ',' term ',' term ')' { $$ = f_generate_roa_check($3, $5, $7); }

778
/* | term '.' LEN { $$->code = P('P','l'); } */
779

780 781 782 783 784
/* function_call is inlined here */
 | SYM '(' var_list ')' {
     struct symbol *sym;
     struct f_inst *inst = $3;
     if ($1->class != SYM_FUNCTION)
Pavel Machek's avatar
Pavel Machek committed
785
       cf_error("You can't call something which is not a function. Really.");
786 787 788 789
     DBG("You are calling function %s\n", $1->name);
     $$ = f_new_inst();
     $$->code = P('c','a');
     $$->a1.p = inst;
790 791
     $$->a2.p = $1->def;
     sym = $1->aux2;
792 793
     while (sym || inst) {
       if (!sym || !inst)
Pavel Machek's avatar
Pavel Machek committed
794
	 cf_error("Wrong number of arguments for function %s.", $1->name);
795 796
       DBG( "You should pass parameter called %s\n", sym->name);
       inst->a1.p = sym;
797
       sym = sym->aux2;
798 799 800
       inst = inst->next;
     }
   }
801 802 803
 ;

break_command:
804 805 806 807 808 809
   QUITBIRD { $$ = F_QUITBIRD; }
 | ACCEPT { $$ = F_ACCEPT; }
 | REJECT { $$ = F_REJECT; }
 | ERROR { $$ = F_ERROR; }
 | PRINT { $$ = F_NOP; }
 | PRINTN { $$ = F_NONL; }
810 811
 ;

812
print_one:
813
   term { $$ = f_new_inst(); $$->code = 'p'; $$->a1.p = $1; $$->a2.p = NULL; }
814 815 816
 ;

print_list: /* EMPTY */ { $$ = NULL; }
817 818
 | print_one { $$ = $1; }
 | print_one ',' print_list {
819
     if ($1) {
820
       $1->next = $3;
821
       $$ = $1;
822
     } else $$ = $3;
823 824 825
   }
 ;

826
var_listn: term { 
827 828 829 830 831 832
     $$ = f_new_inst();
     $$->code = 's';
     $$->a1.p = NULL;
     $$->a2.p = $1;
     $$->next = NULL;
   }
833
 | term ',' var_listn {
834 835 836 837 838 839 840 841
     $$ = f_new_inst();
     $$->code = 's';
     $$->a1.p = NULL;
     $$->a2.p = $1;
     $$->next = $3;
   }
 ;

842 843 844 845
var_list: /* EMPTY */ { $$ = NULL; }
 | var_listn { $$ = $1; }
 ;

846
cmd:
847 848 849 850 851
   IF term THEN block {
     $$ = f_new_inst();
     $$->code = '?';
     $$->a1.p = $2;
     $$->a2.p = $4;
852
   }
853 854 855 856 857
 | IF term THEN block ELSE block {
     struct f_inst *i = f_new_inst();
     i->code = '?';
     i->a1.p = $2;
     i->a2.p = $4;
858 859
     $$ = f_new_inst();
     $$->code = '?';
860 861
     $$->a1.p = i;
     $$->a2.p = $6;
862
   }
863
 | SYM '=' term ';' {
864
     $$ = f_new_inst();
865
     DBG( "Ook, we'll set value\n" );
866
     if (($1->class & ~T_MASK) != SYM_VARIABLE)
Pavel Machek's avatar
Pavel Machek committed
867
       cf_error( "You may set only variables." );
868
     $$->code = 's';
869 870
     $$->a1.p = $1;
     $$->a2.p = $3;
871
   }
872 873
 | RETURN term ';' {
     $$ = f_new_inst();
874
     DBG( "Ook, we'll return the value\n" );
875 876 877
     $$->code = 'r';
     $$->a1.p = $2;
   }
878
 | rtadot dynamic_attr '=' term ';' {
879
     $$ = $2;
880
     $$->code = P('e','S');
881
     $$->a1.p = $4;
882
   }
883 884 885 886 887 888 889 890 891 892 893 894
 | rtadot static_attr '=' term ';' {
     $$ = $2;
     if (!$$->a1.i)
       cf_error( "This static attribute is read-only.");
     $$->code = P('a','S');
     $$->a1.p = $4;
   }
 | PREFERENCE '=' term ';' {
     $$ = f_new_inst();
     $$->code = P('P','S');
     $$->a1.p = $3;
   } 
895
 | UNSET '(' rtadot dynamic_attr ')' ';' {
896
     $$ = $4;
897
     $$->aux = EAF_TYPE_UNDEF | EAF_TEMP;
898
     $$->code = P('e','S');
899
     $$->a1.p = NULL;
900
   }
901 902
 | break_command print_list ';' { $$ = f_new_inst(); $$->code = P('p',','); $$->a1.p = $2; $$->a2.i = $1; }
 | function_call ';' { $$ = $1; }
903 904
 | CASE term '{' switch_body '}' {
      $$ = f_new_inst();
905
      $$->code = P('S','W');
906
      $$->a1.p = $2;
Pavel Machek's avatar
Pavel Machek committed
907
      $$->a2.p = build_tree( $4 );
908
   }
909 910


911
 | rtadot dynamic_attr '.' EMPTY ';' { $$ = f_generate_empty($2); }
912
 | rtadot dynamic_attr '.' PREPEND '(' term ')' ';'   { $$ = f_generate_complex( P('A','p'), 'x', $2, $6 ); }
913 914 915
 | rtadot dynamic_attr '.' ADD '(' term ')' ';'       { $$ = f_generate_complex( P('C','a'), 'a', $2, $6 ); }
 | rtadot dynamic_attr '.' DELETE '(' term ')' ';'    { $$ = f_generate_complex( P('C','a'), 'd', $2, $6 ); }
 | rtadot dynamic_attr '.' FILTER '(' term ')' ';'    { $$ = f_generate_complex( P('C','a'), 'f', $2, $6 ); }
916 917 918
 ;

CF_END