Replace old task queue

The handshakes are now schedules in a doubly-linked list that is maintained as a
part of the peer structure.

1 files changed, 0 insertions, 68 deletions

diff --git a/src/task.c b/src/task.c
deleted file mode 100644
index 768c9c3..0000000
--- a/src/task.c
+++ /dev/null
@@ -1,68 +0,0 @@
-/*
-  Copyright (c) 2012-2013, 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 "task.h"
-
-
-fastd_task_t* fastd_task_get(fastd_context_t *ctx) {
-	return container_of(fastd_queue_get(ctx, &ctx->task_queue), fastd_task_t, entry);
-}
-
-static bool is_peer(fastd_queue_entry_t *data, void *extra) {
-	fastd_task_t *task = container_of(data, fastd_task_t, entry);
-	fastd_peer_t *peer = extra;
-
-	return (task->peer == peer);
-}
-
-void fastd_task_schedule_handshake(fastd_context_t *ctx, fastd_peer_t *peer, int timeout) {
-	if (fastd_queue_has_entry(ctx, &ctx->task_queue, is_peer, peer)) {
-		pr_debug(ctx, "not sending a handshake to %P, there still is one queued", peer);
-		return;
-	}
-
-	fastd_task_t *task = malloc(sizeof(fastd_task_t));
-
-	task->peer = peer;
-
-	fastd_queue_put(ctx, &ctx->task_queue, &task->entry, timeout);
-}
-
-static bool delete_peer_task(fastd_queue_entry_t *data, void *extra) {
-	fastd_task_t *task = container_of(data, fastd_task_t, entry);
-	fastd_peer_t *peer = extra;
-
-	if (task->peer != peer)
-		return true;
-
-	free(task);
-
-	return false;
-}
-
-void fastd_task_delete_peer(fastd_context_t *ctx, fastd_peer_t *peer) {
-	fastd_queue_filter(ctx, &ctx->task_queue, delete_peer_task, peer);
-}