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
|
/*
Copyright (c) 2012, 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 "neigh.h"
#include <stdlib.h>
gp_babel_neigh_t* gp_babel_neigh_get(gmrf_iface_state_t *iface, const gmrf_addr_t *addr) {
gp_babel_neigh_t *neigh = gp_babel_neigh_find(iface, addr);
if (!neigh) {
neigh = calloc(1, sizeof(gp_babel_neigh_t));
neigh->next = iface->neighbours;
neigh->iface = iface;
iface->neighbours = neigh;
neigh->last_packet = gmrf_time_unspec;
neigh->last_hello = gmrf_time_unspec;
neigh->last_ihu = gmrf_time_unspec;
neigh->addr = *addr;
neigh->txcost = GP_BABEL_INFINITY;
}
return neigh;
}
void gp_babel_neigh_unref_list(gp_babel_neigh_t *neigh) {
gp_babel_neigh_t *next;
for (; neigh; neigh = next) {
next = neigh->next;
neigh->iface = NULL;
neigh->next = NULL;
if (!neigh->ref)
free(neigh);
}
}
void gp_babel_neigh_unref(gp_babel_neigh_t *neigh) {
if (!(--neigh->ref) && !neigh->iface)
free(neigh);
}
uint16_t gp_babel_neigh_get_rxcost(gmrf_context_t *ctx, const gp_babel_neigh_t *neigh) {
if (!neigh->hello_log || !neigh->hello_interval || !neigh->iface)
return GP_BABEL_INFINITY;
int timediff = gp_babel_since(ctx, neigh->last_hello);
int shift = (timediff - neigh->hello_interval/2)/neigh->hello_interval;
if (shift >= 16)
return GP_BABEL_INFINITY;
int received = __builtin_popcount((neigh->hello_log << shift) & 0xffff);
if (received == 0)
return GP_BABEL_INFINITY;
else
return (0x1000/received);
}
uint16_t gp_babel_neigh_get_txcost(gmrf_context_t *ctx, const gp_babel_neigh_t *neigh) {
if (gp_babel_since(ctx, neigh->last_ihu) > GP_BABEL_IHU_TIMEOUT(neigh->ihu_interval) || !neigh->iface)
return GP_BABEL_INFINITY;
else
return neigh->txcost;
}
uint16_t gp_babel_neigh_get_cost(gmrf_context_t *ctx, const gp_babel_neigh_t *neigh) {
if (!neigh) /* self */
return 0;
uint16_t txcost = gp_babel_neigh_get_txcost(ctx, neigh);
if (txcost < 256)
txcost = 256;
uint32_t cost = (txcost * gp_babel_neigh_get_rxcost(ctx, neigh)) >> 8;
if (cost > GP_BABEL_INFINITY)
return GP_BABEL_INFINITY;
else
return cost;
}
void gp_babel_neigh_reset(gmrf_context_t *ctx, gmrf_iface_state_t *iface, gp_babel_neigh_t *neigh) {
gmrf_logf(ctx->gmrf, LOG_DEBUG, "resetting neighbour %02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x[%s].",
neigh->addr.d[0], neigh->addr.d[1], neigh->addr.d[2], neigh->addr.d[3],
neigh->addr.d[4], neigh->addr.d[5], neigh->addr.d[6], neigh->addr.d[7],
gmrf_iface_get_name(ctx->gmrf, neigh->iface->gmrf_iface));
gp_babel_route_t *route;
for (route = ctx->routes; route; route = route->next) {
gp_babel_nexthop_t *nexthop = gp_babel_route_nexthop_find(route, neigh);
if (nexthop)
gp_babel_route_nexthop_delete(ctx, route, nexthop);
}
gp_babel_send_route_request(ctx, iface, neigh, NULL);
}
|
