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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
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
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Routing component of the IPCP
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* 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 "routing"
#include <ouroboros/config.h>
#include <ouroboros/errno.h>
#include <ouroboros/list.h>
#include <ouroboros/logs.h>
#include "routing.h"
#include "ribmgr.h"
#include <assert.h>
#include <stdlib.h>
#include <inttypes.h>
struct edge {
struct vertex * ep;
qosspec_t qs;
};
struct vertex {
struct list_head next;
uint64_t addr;
struct list_head edges;
};
struct routing {
struct pff * pff;
struct nbs * nbs;
struct nb_notifier nb_notifier;
struct list_head vertices;
};
static int routing_neighbor_event(enum nb_event event,
struct conn conn)
{
(void) conn;
/* FIXME: React to events here */
switch (event) {
case NEIGHBOR_ADDED:
break;
case NEIGHBOR_REMOVED:
break;
case NEIGHBOR_QOS_CHANGE:
break;
default:
break;
}
return 0;
}
#if 0
/* FIXME: If zeroed since it is not used currently */
static int add_vertex(struct routing * instance,
uint64_t addr)
{
struct vertex * vertex;
vertex = malloc(sizeof(*vertex));
if (vertex == NULL)
return -1;
list_head_init(&vertex->next);
list_head_init(&vertex->edges);
vertex->addr = addr;
list_add(&vertex->next, &instance->vertices);
return 0;
}
#endif
struct routing * routing_create(struct pff * pff,
struct nbs * nbs)
{
struct routing * tmp;
assert(pff);
tmp = malloc(sizeof(*tmp));
if (tmp == NULL)
return NULL;
tmp->pff = pff;
tmp->nbs = nbs;
list_head_init(&tmp->vertices);
tmp->nb_notifier.notify_call = routing_neighbor_event;
if (nbs_reg_notifier(tmp->nbs, &tmp->nb_notifier)) {
free(tmp);
return NULL;
}
return tmp;
}
void routing_destroy(struct routing * instance)
{
assert(instance);
nbs_unreg_notifier(instance->nbs, &instance->nb_notifier);
free(instance);
}
|
