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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
|
/*
Copyright (c) 2013, Matthias Schiffer <mschiffer@universe-factory.net>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _GMRF_MMSS_MMSS_H_
#define _GMRF_MMSS_MMSS_H_
#include "queue.hpp"
extern "C" {
#include <gmrf/gmrf.h>
#include <mmss/protocol.h>
}
#include <cstdlib>
#include <cstring>
struct mmss {
uint64_t now;
mmss_queue_t packet_queue;
mmss_queue_t scheduled_queue;
};
struct mmss_config {
mmss_network_t *networks;
gmrf_t *nodes;
};
struct mmss_network {
mmss_network_t *next;
char *name;
gmrf_iface_t *interfaces;
size_t mtu;
};
struct mmss_packet {
uint64_t sent;
gmrf_iface_t *source;
gmrf_iface_t *dest;
size_t len;
uint8_t data[];
};
struct mmss_scheduled {
gmrf_t *node;
gmrf_scheduled_func f;
void *arg;
};
struct mmss_string_stack {
mmss_string_stack_t *next;
char str[];
};
struct gmrf {
gmrf_t *next;
char *name;
mmss_t *mmss;
gmrf_context_t *ctx;
gmrf_iface_t *interfaces;
unsigned rand_seed;
const mmss_protocol_t *proto;
};
struct gmrf_iface {
gmrf_iface_t *node_next;
gmrf_iface_t *network_next;
char *name;
gmrf_addr_t address;
gmrf_t *node;
mmss_network_t *net;
};
const mmss_protocol_t* mmss_load_protocol(const char *module);
void mmss_config_add_network(mmss_t *mmss, mmss_config_t *conf, const char *name);
bool mmss_read_config(mmss_t *mmss, mmss_config_t *conf, const char *filename);
void mmss_add_iface(gmrf_t *node, mmss_network_t *net, const char *name, const gmrf_addr_t *address);
void mmss_dispatch(mmss_packet_t *packet);
void mmss_run_scheduled(mmss_scheduled_t *scheduled);
void mmss_logf(mmss_t *mmss, int priority, const char *format, ...);
static inline int max(int a, int b) {
return (a > b) ? a : b;
}
static inline int min(int a, int b) {
return (a < b) ? a : b;
}
static inline size_t alignto(size_t l, size_t a) {
return ((l+a-1)/a)*a;
}
static inline mmss_string_stack_t* mmss_string_stack_dup(const char *str) {
mmss_string_stack_t *ret = reinterpret_cast<mmss_string_stack_t*>(std::malloc(alignto(sizeof(mmss_string_stack_t) + strlen(str) + 1, 8)));
ret->next = NULL;
std::strcpy(ret->str, str);
return ret;
}
static inline mmss_string_stack_t* mmss_string_stack_dupn(const char *str, size_t len) {
size_t str_len = strnlen(str, len);
mmss_string_stack_t *ret = reinterpret_cast<mmss_string_stack_t*>(std::malloc(alignto(sizeof(mmss_string_stack_t) + str_len + 1, 8)));
ret->next = NULL;
std::strncpy(ret->str, str, str_len);
ret->str[str_len] = 0;
return ret;
}
static inline mmss_string_stack_t* mmss_string_stack_push(mmss_string_stack_t *stack, const char *str) {
mmss_string_stack_t *ret = reinterpret_cast<mmss_string_stack_t*>(std::malloc(alignto(sizeof(mmss_string_stack_t) + strlen(str) + 1, 8)));
ret->next = stack;
std::strcpy(ret->str, str);
return ret;
}
static inline void mmss_string_stack_free(mmss_string_stack_t *str) {
while(str) {
mmss_string_stack_t *next = str->next;
std::free(str);
str = next;
}
}
#endif /* _GMRF_MMSS_MMSS_H_ */
|
