static Iface_DEFUN sessionEnded(struct Message* msg, struct Pathfinder_pvt* pf)
{
struct Address addr;
addressForNode(&addr, msg);
String* str = Address_toString(&addr, msg->alloc);
Log_debug(pf->log, "Session ended [%s]", str->bytes);
return NULL;
}
static Iface_DEFUN peerGone(struct Message* msg, struct Pathfinder_pvt* pf)
{
struct Address addr;
addressForNode(&addr, msg);
String* str = Address_toString(&addr, msg->alloc);
Log_debug(pf->log, "Peer gone [%s]", str->bytes);
NodeStore_disconnectedPeer(pf->nodeStore, addr.path);
// We notify about the node but with max metric so it will be removed soon.
return sendNode(msg, &addr, 0xffffffff, pf);
}
static Iface_DEFUN session(struct Message* msg, struct Pathfinder_pvt* pf)
{
struct Address addr;
addressForNode(&addr, msg);
String* str = Address_toString(&addr, msg->alloc);
Log_debug(pf->log, "Session [%s]", str->bytes);
/* This triggers for every little ping we send to some random node out there which
* sucks too much to ever get into the nodeStore.
struct Node_Two* node = NodeStore_nodeForAddr(pf->nodeStore, addr.ip6.bytes);
if (!node) {
SearchRunner_search(addr.ip6.bytes, 20, 3, pf->searchRunner, pf->alloc);
}*/
return NULL;
}
static Iface_DEFUN peer(struct Message* msg, struct Pathfinder_pvt* pf)
{
struct Address addr;
addressForNode(&addr, msg);
String* str = Address_toString(&addr, msg->alloc);
Log_debug(pf->log, "Peer [%s]", str->bytes);
struct Node_Link* link = NodeStore_linkForPath(pf->nodeStore, addr.path);
// It exists, it's parent is the self-node, and it's label is equal to the switchLabel.
if (link
&& Node_getBestParent(link->child)
&& Node_getBestParent(link->child)->parent->address.path == 1
&& Node_getBestParent(link->child)->cannonicalLabel == addr.path)
{
return NULL;
}
//RumorMill_addNode(pf->rumorMill, &addr);
Router_sendGetPeers(pf->router, &addr, 0, 0, pf->alloc);
return sendNode(msg, &addr, 0xffffff00, pf);
}
static Iface_DEFUN discoveredPath(struct Message* msg, struct Pathfinder_pvt* pf)
{
struct Address addr;
addressForNode(&addr, msg);
// We're somehow aware of this path (even if it's unused)
if (NodeStore_linkForPath(pf->nodeStore, addr.path)) { return NULL; }
// If we don't already care about the destination, then don't do anything.
struct Node_Two* nn = NodeStore_nodeForAddr(pf->nodeStore, addr.ip6.bytes);
if (!nn) { return NULL; }
// Our best path is "shorter" (label bits which is somewhat representitive of hop count)
// basically this is just to dampen the flood to the RM because otherwise it prevents Janitor
// from getting any actual work done.
if (nn->address.path < addr.path) { return NULL; }
Log_debug(pf->log, "Discovered path [%s]", Address_toString(&addr, msg->alloc)->bytes);
RumorMill_addNode(pf->rumorMill, &addr);
return NULL;
}
