summaryrefslogtreecommitdiffstats
path: root/mmss/gmrf.cpp
blob: a2a60a854b58cbfed7d7f392b97bcbadf1b87138 (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
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
/*
  Copyright (c) 2013-2014, 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.
*/


#include "context.hpp"
#include "event.hpp"
#include "iface.hpp"
#include "node.hpp"

#include <cstdlib>


using namespace MMSS;

extern "C" {

gmrf_addr_t gmrf_iface_get_addr(gmrf_t *gmrf UNUSED, gmrf_iface_t *iface) {
	return *(static_cast<iface_t*>(iface)->get_address());
}

const char* gmrf_iface_get_name(gmrf_t *gmrf UNUSED, gmrf_iface_t *iface) {
	return static_cast<iface_t*>(iface)->get_name().c_str();
}

size_t gmrf_iface_get_mtu(gmrf_t *gmrf UNUSED, gmrf_iface_t *iface) {
	return static_cast<iface_t*>(iface)->get_network()->get_mtu();
}

bool gmrf_iface_send(gmrf_t *gmrf UNUSED, gmrf_iface_t *iface, const void *data, size_t len, const gmrf_addr_t *dest) {
	static_cast<iface_t*>(iface)->send(data, len, dest);

	return true;
}

bool gmrf_iface_send_bc(gmrf_t *gmrf UNUSED, gmrf_iface_t *iface, const void *data, size_t len) {
	static_cast<iface_t*>(iface)->send_bc(data, len);

	return true;
}

void gmrf_schedule(gmrf_t *gmrf, gmrf_scheduled_func f, void *arg, unsigned delay) {
	node_t *node = static_cast<node_t*>(gmrf);

	std::shared_ptr<scheduled_t> scheduled = std::make_shared<scheduled_t>(node->shared_from_this(), f, arg);
	node->get_context()->queue_event(std::move(scheduled), node->get_context()->now()+delay);
}

gmrf_time_t gmrf_now(gmrf_t *gmrf) {
	return static_cast<node_t*>(gmrf)->get_context()->now();
}

void gmrf_random_bytes(gmrf_t *gmrf, void *buffer, size_t len) {
	uint8_t *data = reinterpret_cast<uint8_t*>(buffer);

	size_t i;
	for (i = 0; i < len; i++)
		data[i] = static_cast<node_t*>(gmrf)->random_byte();
}

void gmrf_logf(gmrf_t *gmrf, int priority, const char *format, ...) {
	node_t *node = static_cast<node_t*>(gmrf);

	va_list ap;
	va_start(ap, format);

	char *message;
	if (vasprintf(&message, format, ap) >= 0) {
		node->get_context()->node_log(node, priority, std::string(message));
		std::free(message);
	}

	va_end(ap);
}

void gmrf_debug_init(gmrf_t *gmrf, const uint8_t *node_id, size_t len) {
	node_t *node = static_cast<node_t*>(gmrf);
	node->get_context()->node_init(node, node_id, len);
}

void gmrf_debug_neigh(gmrf_t *gmrf, gmrf_iface_t *iface, const gmrf_addr_t *addr, float rxcost, float txcost) {
	node_t *node = static_cast<node_t*>(gmrf);
	node->get_context()->node_neigh(node, iface, addr, rxcost, txcost);
}

void gmrf_debug_neigh_lost(gmrf_t *gmrf, gmrf_iface_t *iface, const gmrf_addr_t *addr) {
	node_t *node = static_cast<node_t*>(gmrf);
	node->get_context()->node_neigh_lost(node, iface, addr);
}

void gmrf_debug_route(gmrf_t *gmrf, const uint8_t *node_id, size_t len, gmrf_iface_t *iface, const gmrf_addr_t *addr, int metric) {
	node_t *node = static_cast<node_t*>(gmrf);
	node->get_context()->node_route(node, node_id, len, iface, addr, metric);
}

void gmrf_debug_route_lost(gmrf_t *gmrf, const uint8_t *node_id, size_t len) {
	node_t *node = static_cast<node_t*>(gmrf);
	node->get_context()->node_route_lost(node, node_id, len);
}

}