summaryrefslogtreecommitdiffstats
path: root/src/fastd.h
diff options
context:
space:
mode:
authorMatthias Schiffer <mschiffer@universe-factory.net>2015-11-10 18:26:37 +0100
committerMatthias Schiffer <mschiffer@universe-factory.net>2015-11-10 18:26:37 +0100
commit9bd967affaafb10e8262253bc746dac234f39443 (patch)
tree248c56773a1b71ee82f95545b23c86724487d2ef /src/fastd.h
parent181deb932074de613e33f955978af579e52e1feb (diff)
downloadfastd-9bd967affaafb10e8262253bc746dac234f39443.tar
fastd-9bd967affaafb10e8262253bc746dac234f39443.zip
Use heap-based priority queue to schedule handshakes instead of a linked list
Diffstat (limited to 'src/fastd.h')
-rw-r--r--src/fastd.h3
1 files changed, 1 insertions, 2 deletions
diff --git a/src/fastd.h b/src/fastd.h
index 88bd9a2..d15033c 100644
--- a/src/fastd.h
+++ b/src/fastd.h
@@ -36,7 +36,6 @@
#pragma once
-#include "dlist.h"
#include "buffer.h"
#include "log.h"
#include "poll.h"
@@ -313,7 +312,7 @@ struct fastd_context {
size_t peer_addr_ht_used; /**< The current number of entries in the peer address hashtable */
VECTOR(fastd_peer_t *) *peer_addr_ht; /**< An array of hash buckets for the peer hash table */
- fastd_dlist_head_t handshake_queue; /**< A doubly linked list of the peers currently queued for handshakes (ordered by the time of the next handshake) */
+ fastd_pqueue_t *handshake_queue; /**< A priority queue of the peers currently queued for handshakes (ordered by the time of the next handshake) */
fastd_timeout_t next_maintenance; /**< The time of the next maintenance call */
VECTOR(pid_t) async_pids; /**< PIDs of asynchronously executed commands which still have to be reaped */