/* * Filters: utility functions * * Copyright 1998 Pavel Machek * 2017 Jan Maria Matejka * * Can be freely distributed and used under the terms of the GNU GPL. */ #include "nest/bird.h" #include "conf/conf.h" #include "filter/filter.h" #include "lib/idm.h" #include "nest/protocol.h" #include "nest/route.h" #define P(a,b) ((a<<8) | b) struct f_inst * f_new_inst(enum f_instruction_code fi_code) { struct f_inst * ret; ret = cfg_allocz(sizeof(struct f_inst)); ret->fi_code = fi_code; ret->lineno = ifs->lino; return ret; } struct f_inst * f_new_inst_da(enum f_instruction_code fi_code, struct f_dynamic_attr da) { struct f_inst *ret = f_new_inst(fi_code); ret->aux = (da.f_type << 8) | da.type; ret->a[1].i = da.ea_code; return ret; } struct f_inst * f_new_inst_sa(enum f_instruction_code fi_code, struct f_static_attr sa) { struct f_inst *ret = f_new_inst(fi_code); ret->aux = sa.f_type; ret->a[1].i = sa.sa_code; ret->a[0].i = sa.readonly; return ret; } /* * Generate set_dynamic( operation( get_dynamic(), argument ) ) */ struct f_inst * f_generate_complex(int operation, int operation_aux, struct f_dynamic_attr da, struct f_inst *argument) { struct f_inst *set_dyn = f_new_inst_da(FI_EA_SET, da), *oper = f_new_inst(operation), *get_dyn = f_new_inst_da(FI_EA_GET, da); oper->aux = operation_aux; oper->a[0].p = get_dyn; oper->a[1].p = argument; set_dyn->a[0].p = oper; return set_dyn; } struct f_inst * f_generate_roa_check(struct rtable_config *table, struct f_inst *prefix, struct f_inst *asn) { struct f_inst_roa_check *ret = cfg_allocz(sizeof(struct f_inst_roa_check)); ret->i.fi_code = FI_ROA_CHECK; ret->i.lineno = ifs->lino; ret->i.arg1 = prefix; ret->i.arg2 = asn; /* prefix == NULL <-> asn == NULL */ if (table->addr_type != NET_ROA4 && table->addr_type != NET_ROA6) cf_error("%s is not a ROA table", table->name); ret->rtc = table; return &ret->i; } static const char * const f_instruction_name_str[] = { #define F(c,a,b) \ [c] = #c, FI__LIST #undef F }; const char * f_instruction_name(enum f_instruction_code fi) { if (fi < FI__MAX) return f_instruction_name_str[fi]; else bug("Got unknown instruction code: %d", fi); } char * filter_name(struct filter *filter) { if (!filter) return "ACCEPT"; else if (filter == FILTER_REJECT) return "REJECT"; else if (!filter->name) return "(unnamed)"; else return filter->name; } #define CA_KEY(n) n->name, n->fda.type #define CA_NEXT(n) n->next #define CA_EQ(na,ta,nb,tb) (!strcmp(na,nb) && (ta == tb)) #define CA_FN(n,t) (mem_hash(n, strlen(n)) ^ (t*0xaae99453U)) #define CA_ORDER 8 /* Fixed */ struct ca_storage { struct ca_storage *next; struct f_dynamic_attr fda; u32 uc; char name[0]; }; HASH(struct ca_storage) ca_hash; static struct idm ca_idm; static struct ca_storage **ca_storage; static uint ca_storage_max; static void ca_free(resource *r) { struct custom_attribute *ca = (void *) r; struct ca_storage *cas = HASH_FIND(ca_hash, CA, ca->name, ca->fda->type); ASSERT(cas); ca->name = NULL; ca->fda = NULL; if (!--cas->uc) { uint id = EA_CUSTOM_ID(cas->fda.ea_code); idm_free(&ca_idm, id); HASH_REMOVE(ca_hash, CA, cas); ca_storage[id] = NULL; mb_free(cas); } } static void ca_dump(resource *r) { struct custom_attribute *ca = (void *) r; debug("name \"%s\" id 0x%04x ea_type 0x%02x f_type 0x%02x\n", ca->name, ca->fda->ea_code, ca->fda->type, ca->fda->f_type); } static struct resclass ca_class = { .name = "Custom attribute", .size = sizeof(struct custom_attribute), .free = ca_free, .dump = ca_dump, .lookup = NULL, .memsize = NULL, }; struct custom_attribute * ca_lookup(pool *p, const char *name, int f_type) { int ea_type; switch (f_type) { case T_INT: ea_type = EAF_TYPE_INT; break; case T_IP: ea_type = EAF_TYPE_IP_ADDRESS; break; case T_QUAD: ea_type = EAF_TYPE_ROUTER_ID; break; case T_PATH: ea_type = EAF_TYPE_AS_PATH; break; case T_CLIST: ea_type = EAF_TYPE_INT_SET; break; case T_ECLIST: ea_type = EAF_TYPE_EC_SET; break; case T_LCLIST: ea_type = EAF_TYPE_LC_SET; break; default: cf_error("Custom route attribute of unsupported type"); } static int inited = 0; if (!inited) { idm_init(&ca_idm, &root_pool, 8); HASH_INIT(ca_hash, &root_pool, CA_ORDER); ca_storage_max = 256; ca_storage = mb_allocz(&root_pool, sizeof(struct ca_storage *) * ca_storage_max); inited++; } struct ca_storage *cas = HASH_FIND(ca_hash, CA, name, ea_type); if (cas) { cas->uc++; } else { uint id = idm_alloc(&ca_idm); if (id >= EA_CUSTOM_BIT) cf_error("Too many custom attributes."); if (id >= ca_storage_max) { ca_storage_max *= 2; ca_storage = mb_realloc(ca_storage, sizeof(struct ca_storage *) * ca_storage_max * 2); } cas = mb_allocz(&root_pool, sizeof(struct ca_storage) + strlen(name) + 1); cas->fda = f_new_dynamic_attr(ea_type, f_type, EA_CUSTOM(id)); cas->uc = 1; strcpy(cas->name, name); ca_storage[id] = cas; HASH_INSERT(ca_hash, CA, cas); } struct custom_attribute *ca = ralloc(p, &ca_class); ca->fda = &(cas->fda); ca->name = cas->name; return ca; } const char * ea_custom_name(uint ea) { uint id = EA_CUSTOM_ID(ea); if (id >= ca_storage_max) return NULL; if (!ca_storage[id]) return NULL; return ca_storage[id]->name; }