2013-03-19 04:21:03 +01:00
|
|
|
/*
|
|
|
|
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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include "babel.h"
|
|
|
|
#include "neigh.h"
|
|
|
|
#include "packet.h"
|
|
|
|
#include "tlv_types.h"
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
|
|
|
|
typedef struct handle_tlv_arg {
|
|
|
|
gp_babel_iface_t *iface;
|
|
|
|
const gmrf_addr_t *source;
|
|
|
|
|
|
|
|
gp_babel_node_id_t node_id;
|
|
|
|
} handle_tlv_arg_t;
|
|
|
|
|
|
|
|
static inline gp_babel_neigh_t* get_tlv_neigh(handle_tlv_arg_t *arg) {
|
|
|
|
return gp_babel_neigh_get(arg->iface, arg->source);
|
|
|
|
}
|
|
|
|
|
2013-03-21 03:07:51 +01:00
|
|
|
static void handle_tlv_ack_req(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_ack_req_t *tlv_req, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_ack_req_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short acknowledement request TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
gp_babel_send_ack(gmrf, ctx, get_tlv_neigh(arg), ntohs(tlv_req->nonce));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void handle_tlv_ack(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_ack_t *tlv_ack, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_ack_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short acknowledement TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
//gp_babel_ack_handle(ntohs(tlv_ack->nonce));
|
|
|
|
}
|
|
|
|
|
2013-03-19 04:21:03 +01:00
|
|
|
static void handle_tlv_hello(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_hello_t *tlv_hello, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_hello_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short hello TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-03-26 02:24:10 +01:00
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "received hello from %02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x[%s] with seqno %04x.",
|
|
|
|
arg->source->d[0], arg->source->d[1], arg->source->d[2], arg->source->d[3],
|
|
|
|
arg->source->d[4], arg->source->d[5], arg->source->d[6], arg->source->d[7],
|
|
|
|
gmrf_iface_get_name(gmrf, arg->iface->gmrf_iface), ntohs(tlv_hello->seqno));
|
2013-03-19 04:21:03 +01:00
|
|
|
|
|
|
|
gp_babel_neigh_t *neigh = get_tlv_neigh(arg);
|
|
|
|
|
|
|
|
uint16_t seqno = ntohs(tlv_hello->seqno);
|
|
|
|
|
|
|
|
if (neigh->last_hello != gmrf_time_unspec) {
|
|
|
|
int timediff = (gmrf_now(gmrf) - neigh->last_hello)/10;
|
|
|
|
uint16_t seqexp = neigh->last_seqno + (timediff - neigh->hello_interval/2)/neigh->hello_interval;
|
|
|
|
|
|
|
|
/* cast to int16_t to ensure correct handling of seqno wrapping */
|
|
|
|
if (abs((int16_t)(seqno - seqexp)) > 16) {
|
|
|
|
gmrf_logf(gmrf, LOG_INFO, "neighbour was reset.");
|
|
|
|
neigh->hello_log = 0;
|
2013-03-24 03:45:16 +01:00
|
|
|
neigh->txcost = GP_BABEL_INFINITY;
|
2013-03-19 04:21:03 +01:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
int16_t seqdiff = seqno - neigh->last_seqno;
|
|
|
|
if (seqdiff <= 0) {
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "seqno already seen, ignoring.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
neigh->hello_log <<= seqdiff;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "received hello from new neighbour.");
|
|
|
|
}
|
|
|
|
|
|
|
|
neigh->hello_log |= 1;
|
|
|
|
neigh->hello_interval = ntohs(tlv_hello->interval);
|
|
|
|
neigh->last_seqno = seqno;
|
|
|
|
neigh->last_hello = gmrf_now(gmrf);
|
|
|
|
|
|
|
|
if (neigh->hello_log == 1) /* new or reset neighbour */
|
|
|
|
gp_babel_neigh_reset(arg->iface, neigh);
|
|
|
|
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "accepted hello, log %04x, rxcost is %u, cost is %u now.", neigh->hello_log, gp_babel_neigh_get_rxcost(gmrf, neigh), gp_babel_neigh_get_cost(gmrf, neigh));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void handle_tlv_ihu(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_ihu_t *tlv_ihu, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_ihu_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short IHU TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (tlv_ihu->ae == ADDR_ENC_GMRF) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_ihu_t)+sizeof(gmrf_addr_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short IHU TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
gmrf_addr_t iface_addr = gmrf_iface_get_addr(gmrf, arg->iface->gmrf_iface);
|
|
|
|
if (memcmp(tlv_ihu->address, &iface_addr, sizeof(gmrf_addr_t)) != 0)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
else if (tlv_ihu->ae != ADDR_ENC_UNSPEC) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
gp_babel_neigh_t *neigh = get_tlv_neigh(arg);
|
|
|
|
neigh->ihu_interval = ntohs(tlv_ihu->interval);
|
|
|
|
neigh->last_ihu = gmrf_now(gmrf);
|
|
|
|
neigh->txcost = ntohs(tlv_ihu->rxcost);
|
|
|
|
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "accepted IHU, txcost is %u, cost is %u now.", gp_babel_neigh_get_txcost(gmrf, neigh), gp_babel_neigh_get_cost(gmrf, neigh));
|
|
|
|
}
|
|
|
|
|
2013-03-21 19:56:49 +01:00
|
|
|
static void handle_tlv_node_id(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_node_id_t *tlv_node_id, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_node_id_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short node id TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
arg->node_id = tlv_node_id->id;
|
|
|
|
}
|
|
|
|
|
2013-03-24 02:54:17 +01:00
|
|
|
static void handle_tlv_update(gmrf_t *gmrf, gmrf_context_t *ctx, const gp_babel_tlv_update_t *tlv_update, size_t len, handle_tlv_arg_t *arg) {
|
|
|
|
if (len < sizeof(gp_babel_tlv_update_t)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received short update TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (gp_babel_node_id_is_unspec(&arg->node_id)) {
|
|
|
|
gmrf_logf(gmrf, LOG_WARNING, "received update TLV without node id TLV.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (gp_babel_node_id_equal(&arg->node_id, &ctx->self)) {
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "update source is myself.");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
gp_babel_announce_t *announce = gp_babel_announce_get(gmrf, ctx, &arg->node_id, ntohs(tlv_update->type), ntohs(tlv_update->key));
|
|
|
|
gp_babel_metric_seqno_t ms = { ntohs(tlv_update->metric), ntohs(tlv_update->seqno) };
|
|
|
|
bool feasible = gp_babel_is_feasible(announce, ms);
|
|
|
|
|
|
|
|
gp_babel_neigh_t *neigh = get_tlv_neigh(arg);
|
|
|
|
gp_babel_nexthop_t *nexthop = gp_babel_announce_nexthop_find(announce, neigh);
|
|
|
|
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "update received from %04x%04x, metric %u, seqno %04x.",
|
|
|
|
ntohl(*(uint32_t*)arg->node_id.id), ntohl(*(uint32_t*)(arg->node_id.id+4)),
|
|
|
|
ms.metric, ms.seqno);
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "the update is %sfeasible and there is %s nexthop.", feasible ? "" : "not ", nexthop ? "a" : "no");
|
|
|
|
|
|
|
|
if (!nexthop) {
|
|
|
|
if (feasible && tlv_update->metric != GP_BABEL_INFINITY /* no need to ntohs */)
|
|
|
|
nexthop = gp_babel_announce_nexthop_new(announce, neigh);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (!feasible && nexthop == announce->selected) {
|
2013-03-26 05:39:11 +01:00
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "requesting new seqno");
|
|
|
|
gp_babel_send_seqno_request_for(gmrf, ctx, neigh, announce);
|
2013-03-24 02:54:17 +01:00
|
|
|
nexthop = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!feasible && nexthop && nexthop != announce->selected) {
|
|
|
|
if (ms.metric + gp_babel_neigh_get_cost(gmrf, neigh) < announce->metric.metric) {
|
2013-03-26 05:39:11 +01:00
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "requesting new seqno");
|
|
|
|
gp_babel_send_seqno_request_for(gmrf, ctx, neigh, announce);
|
2013-03-24 02:54:17 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-26 04:00:47 +01:00
|
|
|
if ((tlv_update->flags & GP_BABEL_UPDATE_FLAG_HAS_PAYLOAD) && !announce->payload) {
|
2013-03-24 02:54:17 +01:00
|
|
|
if (len > sizeof(gp_babel_tlv_update_t)) {
|
|
|
|
announce->len = len - sizeof(gp_babel_tlv_update_t);
|
2013-03-26 04:00:47 +01:00
|
|
|
announce->payload = malloc(announce->len);
|
|
|
|
memcpy(announce->payload, tlv_update->payload, announce->len);
|
2013-03-24 02:54:17 +01:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
announce->len = 0xff;
|
|
|
|
|
2013-03-26 04:00:47 +01:00
|
|
|
/* request payload */
|
2013-03-26 05:39:11 +01:00
|
|
|
if (nexthop)
|
|
|
|
gp_babel_send_announce_request(gmrf, ctx, NULL, neigh, &announce->node, announce->type, announce->key, true);
|
2013-03-24 02:54:17 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!nexthop)
|
|
|
|
return;
|
|
|
|
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "the update was accepted.");
|
|
|
|
|
2013-03-26 05:39:11 +01:00
|
|
|
gp_babel_announce_update_nexthop(gmrf, ctx, announce, nexthop, ms, ntohs(tlv_update->interval));
|
2013-03-24 02:54:17 +01:00
|
|
|
}
|
|
|
|
|
2013-03-19 04:21:03 +01:00
|
|
|
static void handle_tlv(gmrf_t *gmrf, gmrf_context_t *ctx, gp_babel_tlv_type_t type, const void *data, size_t len, void *arg) {
|
|
|
|
handle_tlv_arg_t *tlv_arg = arg;
|
|
|
|
|
|
|
|
switch (type) {
|
2013-03-21 03:07:51 +01:00
|
|
|
case TLV_ACK_REQ:
|
|
|
|
handle_tlv_ack_req(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
|
|
|
case TLV_ACK:
|
|
|
|
handle_tlv_ack(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
2013-03-19 04:21:03 +01:00
|
|
|
case TLV_HELLO:
|
|
|
|
handle_tlv_hello(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
|
|
|
case TLV_IHU:
|
|
|
|
handle_tlv_ihu(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
2013-03-21 19:56:49 +01:00
|
|
|
case TLV_NODE_ID:
|
|
|
|
handle_tlv_node_id(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
2013-03-24 02:54:17 +01:00
|
|
|
case TLV_UPDATE:
|
|
|
|
handle_tlv_update(gmrf, ctx, data, len, tlv_arg);
|
|
|
|
return;
|
|
|
|
|
2013-03-19 04:21:03 +01:00
|
|
|
default:
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "received unknown TLV %u on %s.", type, gmrf_iface_get_name(gmrf, tlv_arg->iface->gmrf_iface));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void gp_babel_handle_packet(gmrf_t *gmrf, gmrf_context_t *ctx, gp_babel_iface_t *iface, const gmrf_addr_t *source, const gp_babel_packet_t *packet) {
|
|
|
|
handle_tlv_arg_t arg = { .iface = iface, .source = source };
|
|
|
|
|
|
|
|
if (!gp_babel_tlv_parse(gmrf, ctx, packet, handle_tlv, &arg)) {
|
|
|
|
gmrf_logf(gmrf, LOG_DEBUG, "received invalid packet.");
|
|
|
|
}
|
|
|
|
}
|