Init Repo

vendor/swoole/include/RingQueue.h

@@ -0,0 +1,73 @@
+/*
+  +----------------------------------------------------------------------+
+  | Swoole                                                               |
+  +----------------------------------------------------------------------+
+  | This source file is subject to version 2.0 of the Apache license,    |
+  | that is bundled with this package in the file LICENSE, and is        |
+  | available through the world-wide-web at the following url:           |
+  | http://www.apache.org/licenses/LICENSE-2.0.html                      |
+  | If you did not receive a copy of the Apache2.0 license and are unable|
+  | to obtain it through the world-wide-web, please send a note to       |
+  | license@swoole.com so we can mail you a copy immediately.            |
+  +----------------------------------------------------------------------+
+  | Author: Tianfeng Han  <mikan.tenny@gmail.com>                        |
+  +----------------------------------------------------------------------+
+*/
+
+#ifndef _SW_RINGQUEUE_H_
+#define _SW_RINGQUEUE_H_
+
+#ifdef SW_USE_RINGQUEUE_TS
+#include "atomic.h"
+typedef struct _swRingQueue
+{
+	void **data;
+	char *flags;
+	// 0：push ready 1: push now
+	// 2：pop ready; 3: pop now
+	uint size;
+	uint num;
+	uint head;
+	uint tail;
+
+} swRingQueue;
+
+int swRingQueue_init(swRingQueue *, int buffer_size);
+#define swRingQueue_count(q) (q->num)
+int swRingQueue_push(swRingQueue *, void *);
+int swRingQueue_pop(swRingQueue *, void **);
+#else
+typedef struct _swRingQueue
+{
+	int head; /* 头部，出队列方向*/
+	int tail; /* 尾部，入队列方向*/
+	int tag; /* 为空还是为满的标志位*/
+	int size; /* 队列总尺寸 */
+	void **data; /* 队列空间 */
+} swRingQueue;
+
+int swRingQueue_init(swRingQueue *queue, int buffer_size);
+int swRingQueue_push(swRingQueue *queue, void *);
+int swRingQueue_pop(swRingQueue *queue, void **);
+void swRingQueue_free(swRingQueue *queue);
+
+static inline int swRingQueue_count(swRingQueue *queue)
+{
+    if (queue->tail > queue->head)
+    {
+        return queue->tail - queue->head;
+    }
+    else if (queue->head == queue->tail)
+    {
+        return queue->tag == 1 ? queue->size : 0;
+    }
+    else
+    {
+        return queue->tail + queue->size - queue->head;
+    }
+}
+
+#define swRingQueue_empty(q) ( (q->head == q->tail) && (q->tag == 0))
+#define swRingQueue_full(q) ( (q->head == q->tail) && (q->tag == 1))
+#endif
+#endif