1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*
* Copyright 2010-2015, Tarantool AUTHORS, please see AUTHORS file.
*
* 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 <COPYRIGHT HOLDER> ``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
* <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 "third_party/queue.h"
#include "unit.h"
#include <stdio.h>
#include <assert.h>
struct elem
{
STAILQ_ENTRY(elem) entry;
int val;
};
STAILQ_HEAD(elem_queue, elem);
const char *
queue2str(struct elem_queue *queue)
{
static char buf[1024];
buf[0] = '\0';
struct elem *elem;
int n = 0;
STAILQ_FOREACH(elem, queue, entry) {
n += snprintf(buf + n, sizeof(buf) - n - 1, "%d ", elem->val);
}
return buf;
}
/** Test a queue with 0 elements. */
void test0()
{
header();
struct elem_queue queue = STAILQ_HEAD_INITIALIZER(queue);
printf("Initialized: %s\n", queue2str(&queue));
STAILQ_INIT(&queue);
printf("STAILQ_INIT: %s\n", queue2str(&queue));
STAILQ_REVERSE(&queue, elem, entry);
printf("STAILQ_REVERSE: %s\n", queue2str(&queue));
footer();
}
/** Test a queue with 1 element. */
void test1()
{
header();
struct elem el1;
struct elem_queue queue = STAILQ_HEAD_INITIALIZER(queue);
el1.val = 1;
STAILQ_INSERT_TAIL(&queue, &el1, entry);
printf("STAILQ_INIT: %s\n", queue2str(&queue));
STAILQ_REVERSE(&queue, elem, entry);
printf("STAILQ_REVERSE: %s\n", queue2str(&queue));
footer();
}
void test2()
{
header();
struct elem el1, el2;
struct elem_queue queue = STAILQ_HEAD_INITIALIZER(queue);
el1.val = 1;
el2.val = 2;
STAILQ_INSERT_TAIL(&queue, &el1, entry);
STAILQ_INSERT_TAIL(&queue, &el2, entry);
printf("STAILQ_INIT: %s\n", queue2str(&queue));
STAILQ_REVERSE(&queue, elem, entry);
printf("STAILQ_REVERSE: %s\n", queue2str(&queue));
footer();
}
void test3()
{
header();
struct elem el1, el2, el3;
struct elem_queue queue = STAILQ_HEAD_INITIALIZER(queue);
el1.val = 1;
el2.val = 2;
el3.val = 3;
STAILQ_INSERT_TAIL(&queue, &el1, entry);
STAILQ_INSERT_TAIL(&queue, &el2, entry);
STAILQ_INSERT_TAIL(&queue, &el3, entry);
printf("STAILQ_INIT: %s\n", queue2str(&queue));
STAILQ_REVERSE(&queue, elem, entry);
printf("STAILQ_REVERSE: %s\n", queue2str(&queue));
footer();
}
void test_splice()
{
header();
struct elem el1, el2, el3;
struct elem_queue queue1 = STAILQ_HEAD_INITIALIZER(queue1);
struct elem_queue queue2 = STAILQ_HEAD_INITIALIZER(queue2);
STAILQ_SPLICE(&queue1, STAILQ_FIRST(&queue1), entry, &queue2);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
STAILQ_SPLICE(&queue2, STAILQ_FIRST(&queue2), entry, &queue1);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
el1.val = 1;
el2.val = 2;
el3.val = 3;
STAILQ_INSERT_TAIL(&queue1, &el1, entry);
STAILQ_INSERT_TAIL(&queue1, &el2, entry);
STAILQ_INSERT_TAIL(&queue1, &el3, entry);
printf("STAILQ_INIT: %s\n", queue2str(&queue1));
STAILQ_SPLICE(&queue1, STAILQ_FIRST(&queue1), entry, &queue2);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
STAILQ_SPLICE(&queue2, STAILQ_FIRST(&queue2), entry, &queue1);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
STAILQ_SPLICE(&queue1, STAILQ_NEXT(STAILQ_FIRST(&queue1), entry),
entry, &queue2);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
STAILQ_SPLICE(&queue2, STAILQ_NEXT(STAILQ_FIRST(&queue2), entry),
entry, &queue1);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
STAILQ_SPLICE(&queue2, STAILQ_FIRST(&queue2), entry, &queue1);
printf("q1: %s\n", queue2str(&queue1));
printf("q2: %s\n", queue2str(&queue2));
footer();
}
int main()
{
test0();
test1();
test2();
test3();
test_splice();
return 0;
}
|
