// Triggered by a search timeout (the message may still come back and will be treated as a ping)
static void searchNextNode(void* vsearch)
{
struct SearchRunner_Search* search = Identity_check((struct SearchRunner_Search*) vsearch);
// Timeout for trying the next node.
Timeout_resetTimeout(search->continueSearchTimeout,
RouterModule_searchTimeoutMilliseconds(search->runner->router));
searchStep(search);
}
static void searchReplyCallback(struct RouterModule_Promise* promise,
uint32_t lagMilliseconds,
struct Address* from,
Dict* result)
{
struct SearchRunner_Search* search =
Identity_check((struct SearchRunner_Search*)promise->userData);
if (!Bits_memcmp(from->ip6.bytes, search->lastNodeAsked.ip6.bytes, 16)) {
Timeout_resetTimeout(search->continueSearchTimeout,
RouterModule_searchTimeoutMilliseconds(search->runner->router));
}
if (!Bits_memcmp(from->ip6.bytes, search->target.ip6.bytes, 16)) {
search->numFinds++;
}
struct Address_List* nodeList =
ReplySerializer_parse(from, result, search->runner->logger, true, promise->alloc);
struct Address* best = NULL;
for (int i = 0; nodeList && i < nodeList->length; i++) {
if (isDuplicateEntry(nodeList, i)) {
continue;
}
if (Address_closest(&search->target, &nodeList->elems[i], from) >= 0) {
// Too much noise.
//Log_debug(search->runner->logger, "Answer was further from the target than us.\n");
continue;
}
if (search->lastNodeAsked.path != from->path) {
// old queries coming in late...
continue;
}
struct Node_Two* nn =
NodeStore_getBest(search->runner->nodeStore, nodeList->elems[i].ip6.bytes);
if (!nn) {
RumorMill_addNode(search->runner->rumorMill, &nodeList->elems[i]);
}
//nodeList->elems[i].path =
// NodeStore_optimizePath(search->runner->nodeStore, nodeList->elems[i].path);
if (!Bits_memcmp(nodeList->elems[i].ip6.bytes, search->target.ip6.bytes, 16)) {
if (!best) {
best = &nodeList->elems[i];
continue;
} else if (nodeList->elems[i].path < best->path) {
SearchStore_addNodeToSearch(best, search->search);
best = &nodeList->elems[i];
continue;
}
}
SearchStore_addNodeToSearch(&nodeList->elems[i], search->search);
}
if (best) {
SearchStore_addNodeToSearch(best, search->search);
}
}