From 9bd967affaafb10e8262253bc746dac234f39443 Mon Sep 17 00:00:00 2001 From: Matthias Schiffer Date: Tue, 10 Nov 2015 18:26:37 +0100 Subject: Use heap-based priority queue to schedule handshakes instead of a linked list --- src/fastd.h | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) (limited to 'src/fastd.h') 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 */ -- cgit v1.2.3