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
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Graph structure
*
* 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.
*/
#ifndef OUROBOROS_IPCPD_NORMAL_GRAPH_H
#define OUROBOROS_IPCPD_NORMAL_GRAPH_H
#include <ouroboros/list.h>
#include <ouroboros/qos.h>
#include <inttypes.h>
struct edge {
struct list_head next;
uint64_t dst_addr;
qosspec_t qs;
};
struct vertex {
struct list_head next;
uint64_t addr;
struct list_head edges;
};
struct graph {
size_t nr_vertices;
struct list_head vertices;
pthread_mutex_t lock;
};
struct graph * graph_create(void);
void graph_destroy(struct graph * graph);
int graph_add_edge(struct graph * graph,
uint64_t s_addr,
uint64_t d_addr,
qosspec_t qs);
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);
#endif /* OUROBOROS_IPCPD_NORMAL_GRAPH_H */
|
