Merge pull request #598 from just-now/thread-pool-clean

Thread pool clean

.clang-format

@@ -2,7 +2,8 @@ BasedOnStyle: Chromium
 BreakBeforeBraces: Custom
 BraceWrapping:
  AfterFunction: true
- AfterStruct: true
+ AfterStruct: false
+Cpp11BracedListStyle: false
 IndentWidth: 8
 UseTab: ForContinuationAndIndentation
 PointerAlignment: Right

Makefile.am

@@ -44,6 +44,7 @@ basic_dqlite_sources = \
   src/lib/buffer.c \
   src/lib/fs.c \
   src/lib/sm.c \
+  src/lib/threadpool.c \
   src/lib/transport.c \
   src/logger.c \
   src/message.c \
@@ -149,6 +150,7 @@ unit_test_SOURCES += \
   test/test_error.c \
   test/test_integration.c \
   test/unit/ext/test_uv.c \
+  test/unit/ext/test_uv_pool.c \
   test/unit/lib/test_addr.c \
   test/unit/lib/test_buffer.c \
   test/unit/lib/test_byte.c \

src/lib/queue.h

@@ -37,6 +37,19 @@ typedef void *queue[2];
 		QUEUE__PREV(q) = (e);            \
 	}
 
+#define QUEUE__INSERT_TAIL(q, e) QUEUE__PUSH(q, e)
+
+/**
+ * Insert an element at the front of a queue.
+ */
+#define QUEUE__INSERT_HEAD(h, q)                 \
+	{                                        \
+		QUEUE__NEXT(q) = QUEUE__NEXT(h); \
+		QUEUE__PREV(q) = (h);            \
+		QUEUE__NEXT_PREV(q) = (q);       \
+		QUEUE__NEXT(h) = (q);            \
+	}
+
 /**
  * Remove the given element from the queue. Any element can be removed at any
  * time.
@@ -47,6 +60,25 @@ typedef void *queue[2];
 		QUEUE__NEXT_PREV(e) = QUEUE__PREV(e); \
 	}
 
+/**
+ * Moves elements from queue @h to queue @n
+ * Note: Removed QUEUE__SPLIT() and merged it into QUEUE__MOVE().
+ */
+#define QUEUE__MOVE(h, n)                                  \
+	{                                                  \
+		if (QUEUE__IS_EMPTY(h)) {                  \
+			QUEUE__INIT(n);                    \
+		} else {                                   \
+			queue *__q = QUEUE__HEAD(h);       \
+			QUEUE__PREV(n) = QUEUE__PREV(h);   \
+			QUEUE__PREV_NEXT(n) = (n);         \
+			QUEUE__NEXT(n) = (__q);            \
+			QUEUE__PREV(h) = QUEUE__PREV(__q); \
+			QUEUE__PREV_NEXT(h) = (h);         \
+			QUEUE__PREV(__q) = (n);            \
+		}                                          \
+	}
+
 /**
  * Return the element at the front of the queue.
  */