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, 63 insertions, 0 deletions

diff --git a/src/dlist.h b/src/dlist.h
new file mode 100644
index 0000000..98b7fd3
--- /dev/null
+++ b/src/dlist.h
@@ -0,0 +1,63 @@
+/*
+  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.
+*/
+
+
+#ifndef _FASTD_DLIST_H_
+#define _FASTD_DLIST_H_
+
+#include "types.h"
+
+#include <stdlib.h>
+
+
+typedef struct fastd_dlist_head fastd_dlist_head_t;
+
+struct fastd_dlist_head {
+	fastd_dlist_head_t *prev;
+	fastd_dlist_head_t *next;
+};
+
+
+static inline void fastd_dlist_insert(fastd_dlist_head_t *list, fastd_dlist_head_t *elem) {
+	elem->prev = list;
+	elem->next = list->next;
+
+	list->next = elem;
+
+	if (elem->next)
+		elem->next->prev = elem;
+}
+
+static inline void fastd_dlist_remove(fastd_dlist_head_t *elem) {
+	if (elem->prev)
+		elem->prev->next = elem->next;
+
+	if (elem->next)
+		elem->next->prev = elem->prev;
+
+	elem->prev = elem->next = NULL;
+}
+
+#endif /* _FASTD_DLIST_H_ */