1/*
2 * Wslay - The WebSocket Library
3 *
4 * Copyright (c) 2011, 2012 Tatsuhiro Tsujikawa
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining
7 * a copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sublicense, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be
15 * included in all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
18 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
20 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
21 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
22 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
23 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
24 */
25#include "wslay_queue.h"
26
27#include <string.h>
28#include <assert.h>
29
30#include "wslay_macro.h"
31
32void wslay_queue_init(struct wslay_queue *queue) {
33 queue->top = NULL;
34 queue->tail = &queue->top;
35}
36
37void wslay_queue_deinit(struct wslay_queue *queue) { (void)queue; }
38
39void wslay_queue_push(struct wslay_queue *queue,
40 struct wslay_queue_entry *ent) {
41 ent->next = NULL;
42 *queue->tail = ent;
43 queue->tail = &ent->next;
44}
45
46void wslay_queue_push_front(struct wslay_queue *queue,
47 struct wslay_queue_entry *ent) {
48 ent->next = queue->top;
49 queue->top = ent;
50
51 if (ent->next == NULL) {
52 queue->tail = &ent->next;
53 }
54}
55
56void wslay_queue_pop(struct wslay_queue *queue) {
57 assert(queue->top);
58 queue->top = queue->top->next;
59 if (queue->top == NULL) {
60 queue->tail = &queue->top;
61 }
62}
63
64struct wslay_queue_entry *wslay_queue_top(struct wslay_queue *queue) {
65 assert(queue->top);
66 return queue->top;
67}
68
69struct wslay_queue_entry *wslay_queue_tail(struct wslay_queue *queue) {
70 assert(queue->top);
71 return wslay_struct_of(queue->tail, struct wslay_queue_entry, next);
72}
73
74int wslay_queue_empty(struct wslay_queue *queue) {
75 assert(queue->top || queue->tail == &queue->top);
76 return queue->top == NULL;
77}
78