1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
4 This file is part of systemd.
6 Copyright 2013 Lennart Poettering
8 systemd is free software; you can redistribute it and/or modify it
9 under the terms of the GNU Lesser General Public License as published by
10 the Free Software Foundation; either version 2.1 of the License, or
11 (at your option) any later version.
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 Lesser General Public License for more details.
18 You should have received a copy of the GNU Lesser General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
28 #define SET_SIZE 1024*4
30 static int unsigned_compare(const void *a, const void *b) {
31 const unsigned *x = a, *y = b;
42 static void test_unsigned(void) {
43 unsigned buffer[SET_SIZE], i;
48 q = prioq_new(trivial_compare_func);
51 for (i = 0; i < ELEMENTSOF(buffer); i++) {
54 u = (unsigned) rand();
56 assert_se(prioq_put(q, UINT_TO_PTR(u), NULL) >= 0);
59 qsort(buffer, ELEMENTSOF(buffer), sizeof(buffer[0]), unsigned_compare);
61 for (i = 0; i < ELEMENTSOF(buffer); i++) {
64 assert_se(prioq_size(q) == ELEMENTSOF(buffer) - i);
66 u = PTR_TO_UINT(prioq_pop(q));
67 assert_se(buffer[i] == u);
70 assert_se(prioq_isempty(q));
79 static int test_compare(const void *a, const void *b) {
80 const struct test *x = a, *y = b;
82 if (x->value < y->value)
85 if (x->value > y->value)
91 static unsigned test_hash(const void *a) {
92 const struct test *x = a;
97 static void test_struct(void) {
100 unsigned previous = 0, i;
105 q = prioq_new(test_compare);
108 s = set_new(test_hash, test_compare);
111 for (i = 0; i < SET_SIZE; i++) {
114 t = new0(struct test, 1);
116 t->value = (unsigned) rand();
118 r = prioq_put(q, t, &t->idx);
130 t = set_steal_first(s);
134 r = prioq_remove(q, t, &t->idx);
140 for (i = 0; i < SET_SIZE * 3 / 4; i++) {
143 assert_se(prioq_size(q) == (SET_SIZE * 3 / 4) - i);
148 assert_se(previous <= t->value);
153 assert_se(prioq_isempty(q));
156 assert_se(set_isempty(s));
160 int main(int argc, char* argv[]) {