summaryrefslogtreecommitdiff
path: root/src/ipcpd/unicast/routing/graph.h
blob: aaf1d947273fc3f020dc11e8005f346f542df9ba (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/*
 * Ouroboros - Copyright (C) 2016 - 2022
 *
 * Undirected graph structure
 *
 *    Dimitri Staessens <dimitri@ouroboros.rocks>
 *    Sander Vrijders   <sander@ouroboros.rocks>
 *
 * 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., http://www.fsf.org/about/contact/.
 */

#ifndef OUROBOROS_IPCPD_UNICAST_GRAPH_H
#define OUROBOROS_IPCPD_UNICAST_GRAPH_H

#include <ouroboros/list.h>
#include <ouroboros/qos.h>

#include <inttypes.h>

enum routing_algo {
         ROUTING_SIMPLE = 0,
         ROUTING_LFA,
         ROUTING_ECMP
};

struct nhop {
        struct list_head next;
        uint64_t         nhop;
};

struct routing_table {
        struct list_head next;
        uint64_t         dst;
        struct list_head nhops;
};

struct graph * graph_create(void);

void           graph_destroy(struct graph * graph);

int            graph_update_edge(struct graph * graph,
                                 uint64_t       s_addr,
                                 uint64_t       d_addr,
                                 qosspec_t      qs);

int            graph_del_edge(struct graph * graph,
                              uint64_t       s_addr,
                              uint64_t       d_addr);

int            graph_routing_table(struct graph *     graph,
                                   enum routing_algo  algo,
                                   uint64_t           s_addr,
                                   struct list_head * table);

void           graph_free_routing_table(struct graph *     graph,
                                        struct list_head * table);

#endif /* OUROBOROS_IPCPD_UNICAST_GRAPH_H */