From 5d87cec1757c4e1c23ae778f2814363c1e39b43c Mon Sep 17 00:00:00 2001 From: Sander Vrijders Date: Mon, 15 May 2017 18:08:53 +0200 Subject: ipcpd: normal: Make routing a policy This makes the routing component into a policy since different approaches may exist to do this, depending on how high the rank of the DIF is. --- src/ipcpd/normal/pol/link_state.c | 360 ++++++++++++++++++++++++++++++++++++++ 1 file changed, 360 insertions(+) create mode 100644 src/ipcpd/normal/pol/link_state.c (limited to 'src/ipcpd/normal/pol/link_state.c') diff --git a/src/ipcpd/normal/pol/link_state.c b/src/ipcpd/normal/pol/link_state.c new file mode 100644 index 00000000..3e0a63d6 --- /dev/null +++ b/src/ipcpd/normal/pol/link_state.c @@ -0,0 +1,360 @@ +/* + * Ouroboros - Copyright (C) 2016 - 2017 + * + * Link state routing policy + * + * Dimitri Staessens + * Sander Vrijders + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 as + * published by the Free Software Foundation. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + */ + +#define OUROBOROS_PREFIX "link-state-routing" + +#include +#include +#include +#include +#include +#include + +#include "ribmgr.h" +#include "ribconfig.h" +#include "graph.h" +#include "neighbors.h" +#include "ipcp.h" +#include "pff.h" + +#include +#include +#include +#include +#include + +#include "fso.pb-c.h" +typedef Fso fso_t; + +#define BUF_SIZE 256 +#define RECALC_TIME 4 + +struct routing_i { + struct pff * pff; + pthread_t calculator; +}; + +struct { + struct nbs * nbs; + struct nb_notifier nb_notifier; + + struct graph * graph; + + ro_set_t * set; + rqueue_t * queue; + pthread_t rib_listener; +} link_state; + +/* Take under neighbors lock */ +static int addr_to_fd(uint64_t addr) +{ + struct list_head * p = NULL; + + list_for_each(p, &link_state.nbs->list) { + struct nb * e = list_entry(p, struct nb, next); + if (e->conn.conn_info.addr == addr) + return e->conn.flow_info.fd; + } + + return -1; +} + +static void * calculate_pff(void * o) +{ + struct routing_i * instance; + struct routing_table ** table; + ssize_t n_table; + int i; + int fd; + + instance = (struct routing_i *) o; + + while (true) { + table = NULL; + n_table = graph_routing_table(link_state.graph, + ipcpi.dt_addr, &table); + if (n_table < 0) { + sleep(RECALC_TIME); + continue; + } + + pthread_mutex_lock(&link_state.nbs->list_lock); + pff_lock(instance->pff); + + pff_flush(instance->pff); + + for (i = 0; i < n_table; i++) { + fd = addr_to_fd(table[i]->nhop); + if (fd == -1) + continue; + + pff_add(instance->pff, table[i]->dst, fd); + } + + pff_unlock(instance->pff); + pthread_mutex_unlock(&link_state.nbs->list_lock); + + freepp(struct routing_table, table, n_table); + sleep(RECALC_TIME); + } + + return (void *) 0; +} + +static int link_state_neighbor_event(enum nb_event event, + struct conn conn) +{ + char path[RIB_MAX_PATH_LEN + 1]; + char fso_name[RIB_MAX_PATH_LEN + 1]; + fso_t fso = FSO__INIT; + size_t len; + uint8_t * data; + + /* Only announce the flow if our address is bigger */ + if (ipcpi.dt_addr < conn.conn_info.addr) + return 0; + + path[0] = '\0'; + sprintf(fso_name, "%" PRIu64 "-%" PRIu64, + ipcpi.dt_addr, conn.conn_info.addr); + rib_path_append(rib_path_append(path, ROUTING_NAME), fso_name); + + switch (event) { + case NEIGHBOR_ADDED: + fso.s_addr = ipcpi.dt_addr; + fso.d_addr = conn.conn_info.addr; + + len = fso__get_packed_size(&fso); + if (len == 0) + return -1; + + data = malloc(len); + if (data == NULL) + return -1; + + fso__pack(&fso, data); + + if (rib_add(ROUTING_PATH, fso_name)) { + log_err("Failed to add FSO."); + free(data); + return -1; + } + + if (rib_put(path, data, len)) { + log_err("Failed to put FSO in RIB."); + rib_del(path); + free(data); + return -1; + } + + log_dbg("Added %s to RIB.", path); + + break; + case NEIGHBOR_REMOVED: + if (rib_del(path)) { + log_err("Failed to remove FSO."); + return -1; + } + + log_dbg("Removed %s from RIB.", path); + + break; + case NEIGHBOR_QOS_CHANGE: + log_info("Not currently supported."); + break; + default: + log_info("Unsupported event for routing."); + break; + } + + return 0; +} + +static int read_fso(char * path, + int32_t flag) +{ + ssize_t len; + uint8_t ro[BUF_SIZE]; + fso_t * fso; + qosspec_t qs; + + memset(&qs, 0, sizeof(qs)); + + len = rib_read(path, ro, BUF_SIZE); + if (len < 0) { + log_err("Failed to read FSO."); + return -1; + } + + fso = fso__unpack(NULL, len, ro); + if (fso == NULL) { + log_err("Failed to unpack."); + return -1; + } + + if (flag & RO_MODIFY) { + if (graph_update_edge(link_state.graph, + fso->s_addr, fso->d_addr, qs)) { + fso__free_unpacked(fso, NULL); + return -1; + } + } else if (flag & RO_DELETE) { + if (graph_del_edge(link_state.graph, fso->s_addr, fso->d_addr)) { + fso__free_unpacked(fso, NULL); + return -1; + } + } + + fso__free_unpacked(fso, NULL); + + return 0; +} + +static void * rib_listener(void * o) +{ + int32_t flag; + char path[RIB_MAX_PATH_LEN + 1]; + char ** children; + ssize_t len; + int i; + + (void) o; + + if (ro_set_add(link_state.set, ROUTING_PATH, RO_MODIFY | RO_DELETE)) { + log_err("Failed to add to RO set"); + return (void * ) -1; + } + + len = rib_children(ROUTING_PATH, &children); + if (len < 0) { + log_err("Failed to retrieve children."); + return (void *) -1; + } + + for (i = 0; i < len; i++) { + if (read_fso(children[i], RO_CREATE)) { + log_err("Failed to parse FSO."); + continue; + } + } + + while (rib_event_wait(link_state.set, link_state.queue, NULL) == 0) { + path[0] = '\0'; + flag = rqueue_next(link_state.queue, path); + if (flag < 0) + continue; + + if (read_fso(path, flag)) { + log_err("Failed to parse FSO."); + continue; + } + } + + return (void *) 0; +} + +struct routing_i * link_state_routing_i_create(struct pff * pff) +{ + struct routing_i * tmp; + + assert(pff); + + tmp = malloc(sizeof(*tmp)); + if (tmp == NULL) + return NULL; + + tmp->pff = pff; + + pthread_create(&tmp->calculator, NULL, calculate_pff, (void *) tmp); + + return tmp; +} + +void link_state_routing_i_destroy(struct routing_i * instance) +{ + assert(instance); + + pthread_cancel(instance->calculator); + + pthread_join(instance->calculator, NULL); + + free(instance); +} + +int link_state_init(struct nbs * nbs) +{ + link_state.graph = graph_create(); + if (link_state.graph == NULL) + return -1; + + if (rib_add(RIB_ROOT, ROUTING_NAME)) { + graph_destroy(link_state.graph); + return -1; + } + + link_state.nbs = nbs; + + link_state.nb_notifier.notify_call = link_state_neighbor_event; + if (nbs_reg_notifier(link_state.nbs, &link_state.nb_notifier)) { + graph_destroy(link_state.graph); + rib_del(ROUTING_PATH); + return -1; + } + + link_state.set = ro_set_create(); + if (link_state.set == NULL) { + nbs_unreg_notifier(link_state.nbs, &link_state.nb_notifier); + graph_destroy(link_state.graph); + rib_del(ROUTING_PATH); + return -1; + } + + link_state.queue = rqueue_create(); + if (link_state.queue == NULL) { + ro_set_destroy(link_state.set); + nbs_unreg_notifier(link_state.nbs, &link_state.nb_notifier); + graph_destroy(link_state.graph); + rib_del(ROUTING_PATH); + return -1; + } + + pthread_create(&link_state.rib_listener, NULL, rib_listener, NULL); + + return 0; +} + +void link_state_fini(void) +{ + pthread_cancel(link_state.rib_listener); + + pthread_join(link_state.rib_listener, NULL); + + rqueue_destroy(link_state.queue); + + ro_set_destroy(link_state.set); + + graph_destroy(link_state.graph); + + rib_del(ROUTING_PATH); + + nbs_unreg_notifier(link_state.nbs, &link_state.nb_notifier); +} -- cgit v1.2.3