1 files changed, 110 insertions, 0 deletions
diff --git a/src/neigh.c b/src/neigh.c
new file mode 100644
index 0000000..bbef746
--- /dev/null
+++ b/src/neigh.c
@@ -0,0 +1,110 @@
+/*
+  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(gp_babel_iface_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_hello = gmrf_time_unspec;
+		neigh->last_ihu = gmrf_time_unspec;
+		neigh->addr = *addr;
+
+		neigh->txcost = 0xffff;
+	}
+
+	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_t *gmrf, const gp_babel_neigh_t *neigh) {
+	if (!neigh->hello_log || !neigh->hello_interval || !neigh->iface)
+		return 0xffff;
+
+	int timediff = (gmrf_now(gmrf) - neigh->last_hello)/10;
+	int shift = (timediff - neigh->hello_interval/2)/neigh->hello_interval;
+
+	if (shift >= 16)
+		return 0xffff;
+
+	int received = __builtin_popcount((neigh->hello_log << shift) & 0xffff);
+
+	if (received == 0)
+		return 0xffff;
+	else
+		return (0x1000/received);
+}
+
+uint16_t gp_babel_neigh_get_txcost(gmrf_t *gmrf, const gp_babel_neigh_t *neigh) {
+	if ((gmrf_now(gmrf) - neigh->last_ihu)/10 > GP_BABEL_IHU_TIMEOUT(neigh->ihu_interval) || !neigh->iface)
+		return 0xffff;
+	else
+		return neigh->txcost;
+}
+
+uint16_t gp_babel_neigh_get_cost(gmrf_t *gmrf, const gp_babel_neigh_t *neigh) {
+	if (!neigh) /* self */
+		return 0;
+
+	uint16_t txcost = gp_babel_neigh_get_txcost(gmrf, neigh);
+	if (txcost < 256)
+		txcost = 256;
+
+	uint32_t cost = (txcost * gp_babel_neigh_get_rxcost(gmrf, neigh)) >> 8;
+
+	if (cost > 0xffff)
+		return 0xffff;
+	else
+		return cost;
+}
+
+void gp_babel_neigh_reset(gp_babel_iface_t *iface, gp_babel_neigh_t *neigh) {
+	//gp_babel_send_announce_request(iface, neigh, GMRF_PROTO_BABEL_NODE_ID_UNSPEC, 0, 0, true /* XXX change this later */);
+}