446 lines
11 KiB
C
446 lines
11 KiB
C
/*
|
|
* Filters: utility functions
|
|
*
|
|
* Copyright 1998 Pavel Machek <pavel@ucw.cz>
|
|
*
|
|
* Can be freely distributed and used under the terms of the GNU GPL.
|
|
*
|
|
* Notice that pair is stored as integer: first << 16 | second
|
|
*
|
|
*/
|
|
|
|
#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"
|
|
#include "lib/string.h"
|
|
#include "nest/route.h"
|
|
#include "nest/protocol.h"
|
|
#include "nest/iface.h"
|
|
#include "conf/conf.h"
|
|
#include "filter/filter.h"
|
|
|
|
struct f_inst *startup_func = NULL;
|
|
|
|
#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); \
|
|
if (x.type == T_RETURN) \
|
|
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" );
|
|
|
|
#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)
|
|
{
|
|
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;
|
|
|
|
if (v1.type != v2.type)
|
|
return CMP_ERROR;
|
|
switch (v1.type) {
|
|
case T_ENUM:
|
|
case T_INT:
|
|
case T_PAIR:
|
|
if (v1.val.i == v2.val.i) return 0;
|
|
if (v1.val.i < v2.val.i) return -1;
|
|
return 1;
|
|
case T_IP:
|
|
case T_PREFIX:
|
|
return ipa_compare(v1.val.px.ip, v2.val.px.ip);
|
|
default: { printf( "Error comparing\n" ); return CMP_ERROR; }
|
|
}
|
|
}
|
|
|
|
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;
|
|
|
|
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;
|
|
}
|
|
|
|
int
|
|
val_in_range(struct f_val v1, struct f_val v2)
|
|
{
|
|
int res;
|
|
|
|
res = val_simple_in_range(v1, v2);
|
|
|
|
if (res != CMP_ERROR)
|
|
return res;
|
|
|
|
if (((v1.type == T_INT) || ((v1.type == T_IP) || (v1.type == T_PREFIX)) && (v2.type == T_SET))) {
|
|
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 */
|
|
}
|
|
return CMP_ERROR;
|
|
}
|
|
|
|
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;
|
|
case T_IP: PRINTF( "%I", v.val.px.ip ); break;
|
|
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;
|
|
case T_SET: tree_print( v.val.t ); PRINTF( "\n" ); break;
|
|
case T_ENUM: PRINTF( "(enum %x)%d", v.type, v.val.i ); break;
|
|
default: PRINTF( "[unknown type %x]", v.type );
|
|
}
|
|
printf( buf );
|
|
}
|
|
|
|
static struct rte **f_rte, *f_rte_old;
|
|
static struct linpool *f_pool;
|
|
|
|
static struct f_val interpret(struct f_inst *what);
|
|
|
|
static struct f_val
|
|
interpret(struct f_inst *what)
|
|
{
|
|
struct symbol *sym;
|
|
struct f_val v1, v2, res;
|
|
int i,j,k;
|
|
|
|
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 */
|
|
|
|
#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); \
|
|
break;
|
|
|
|
case '!=': COMPARE(i!=0);
|
|
case '==': COMPARE(i==0);
|
|
case '<': COMPARE(i==-1);
|
|
case '<=': COMPARE(i!=1);
|
|
|
|
case '~':
|
|
TWOARGS;
|
|
res.type = T_BOOL;
|
|
res.val.i = val_in_range(v1, v2);
|
|
if (res.val.i == CMP_ERROR)
|
|
runtime( "~ applied on unknown type pair" );
|
|
break;
|
|
case 'de':
|
|
ONEARG;
|
|
res.type = T_BOOL;
|
|
res.val.i = (v1.type != T_VOID);
|
|
break;
|
|
|
|
/* Set to indirect value, a1 = variable, a2 = value */
|
|
case 's':
|
|
ARG(v2, a2.p);
|
|
sym = what->a1.p;
|
|
switch (res.type = v2.type) {
|
|
case T_VOID: runtime( "Can not assign void values" );
|
|
case T_ENUM:
|
|
case T_INT:
|
|
case T_IP:
|
|
case T_PREFIX:
|
|
case T_PAIR:
|
|
if (sym->class != (SYM_VARIABLE | v2.type))
|
|
runtime( "Variable of bad type" );
|
|
* (struct f_val *) sym->aux2 = v2;
|
|
break;
|
|
default:
|
|
bug( "Set to invalid type\n" );
|
|
}
|
|
break;
|
|
|
|
case 'c': /* integer (or simple type) constant */
|
|
res.type = what->aux;
|
|
res.val.i = what->a2.i;
|
|
break;
|
|
case 'C':
|
|
res = * ((struct f_val *) what->a1.p);
|
|
break;
|
|
case 'p':
|
|
ONEARG;
|
|
val_print(v1);
|
|
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) {
|
|
ARG(res,a2.p);
|
|
res.val.i = 0;
|
|
} else res.val.i = 1;
|
|
res.type = T_BOOL;
|
|
break;
|
|
case '0':
|
|
printf( "No operation\n" );
|
|
break;
|
|
case 'p,':
|
|
ONEARG;
|
|
if (what->a2.i != F_NONL)
|
|
printf( "\n" );
|
|
|
|
switch (what->a2.i) {
|
|
case F_QUITBIRD:
|
|
die( "Filter asked me to die" );
|
|
case F_ACCEPT:
|
|
/* Should take care about turning ACCEPT into MODIFY */
|
|
case F_ERROR:
|
|
case F_REJECT: /* FIXME (noncritical) Should print compele route along with reason to reject route */
|
|
res.type = T_RETURN;
|
|
res.val.i = what->a1.i;
|
|
return res; /* We have to return now, no more processing. */
|
|
case F_NONL:
|
|
case F_NOP:
|
|
break;
|
|
default:
|
|
bug( "unknown return type: can not happen");
|
|
}
|
|
break;
|
|
case 'a': /* rta access */
|
|
{
|
|
struct rta *rta = (*f_rte)->attrs;
|
|
res.type = what->aux;
|
|
switch(res.type) {
|
|
case T_IP:
|
|
res.val.px.ip = * (ip_addr *) ((char *) rta + what->a2.i);
|
|
break;
|
|
case T_ENUM:
|
|
res.val.i = * ((char *) rta + what->a2.i);
|
|
break;
|
|
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:
|
|
bug( "Invalid type for rta access (%x)\n" );
|
|
}
|
|
}
|
|
break;
|
|
case 'ea': /* Access to extended attributes [hmm, but we need it read/write, do we?] */
|
|
{
|
|
eattr *e = ea_find( (*f_rte)->attrs->eattrs, what->a2.i );
|
|
if (!e) {
|
|
res.type = T_VOID;
|
|
break;
|
|
}
|
|
res.type = what->aux;
|
|
switch (what->a1.i) {
|
|
case T_INT:
|
|
res.val.i = e->u.data;
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
case 'eS':
|
|
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;
|
|
switch (what->aux) {
|
|
case T_INT:
|
|
l->attrs[0].type = EAF_TYPE_INT | EAF_INLINE;
|
|
l->attrs[0].u.data = v1.val.i;
|
|
break;
|
|
case T_VOID:
|
|
l->attrs[0].type = EAF_TYPE_UNDEF | EAF_INLINE;
|
|
l->attrs[0].u.data = 0;
|
|
break;
|
|
}
|
|
*f_rte = rte_do_cow(*f_rte);
|
|
l->next = (*f_rte)->attrs->eattrs;
|
|
(*f_rte)->attrs->eattrs = l;
|
|
}
|
|
break;
|
|
|
|
case 'cp': /* Convert prefix to ... */
|
|
ONEARG;
|
|
if (v1.type != T_PREFIX)
|
|
runtime( "Can not convert non-prefix this way" );
|
|
res.type = what->aux;
|
|
switch(res.type) {
|
|
case T_INT: res.val.i = v1.val.px.len; break;
|
|
case T_IP: res.val.px.ip = v1.val.px.ip; break;
|
|
default: bug( "Unknown prefix to conversion\n" );
|
|
}
|
|
break;
|
|
case 'ca': /* CALL */
|
|
ONEARG;
|
|
res = interpret(what->a2.p);
|
|
break;
|
|
case 'SW':
|
|
ONEARG;
|
|
{
|
|
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);
|
|
}
|
|
break;
|
|
case 'iM': /* IP.MASK(val) */
|
|
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);
|
|
}
|
|
break;
|
|
default:
|
|
bug( "Unknown instruction %d (%c)", what->code, what->code & 0xff);
|
|
}
|
|
if (what->next)
|
|
return interpret(what->next);
|
|
return res;
|
|
}
|
|
|
|
/* FIXME: tmp_attrs is unreferenced. That can't be right */
|
|
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 );
|
|
|
|
f_rte = rte;
|
|
f_rte_old = *rte;
|
|
f_pool = tmp_pool;
|
|
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;
|
|
if (startup_func) {
|
|
printf( "Launching startup function...\n" );
|
|
res = interpret(startup_func);
|
|
if (res.type == F_ERROR)
|
|
die( "Startup function resulted in error." );
|
|
printf( "done\n" );
|
|
}
|
|
}
|