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/>.
27 #include "siphash24.h"
29 #define SET_SIZE 1024*4
31 static int unsigned_compare(const void *a, const void *b) {
32 const unsigned *x = a, *y = b;
43 static void test_unsigned(void) {
44 unsigned buffer[SET_SIZE], i;
49 q = prioq_new(trivial_compare_func);
52 for (i = 0; i < ELEMENTSOF(buffer); i++) {
55 u = (unsigned) rand();
57 assert_se(prioq_put(q, UINT_TO_PTR(u), NULL) >= 0);
60 qsort(buffer, ELEMENTSOF(buffer), sizeof(buffer[0]), unsigned_compare);
62 for (i = 0; i < ELEMENTSOF(buffer); i++) {
65 assert_se(prioq_size(q) == ELEMENTSOF(buffer) - i);
67 u = PTR_TO_UINT(prioq_pop(q));
68 assert_se(buffer[i] == u);
71 assert_se(prioq_isempty(q));
80 static int test_compare(const void *a, const void *b) {
81 const struct test *x = a, *y = b;
83 if (x->value < y->value)
86 if (x->value > y->value)
92 static unsigned long test_hash(const void *a, const uint8_t hash_key[HASH_KEY_SIZE]) {
93 const struct test *x = a;
96 siphash24((uint8_t*) &u, &x->value, sizeof(x->value), hash_key);
98 return (unsigned long) u;
101 static void test_struct(void) {
104 unsigned previous = 0, i;
109 q = prioq_new(test_compare);
112 s = set_new(test_hash, test_compare);
115 for (i = 0; i < SET_SIZE; i++) {
118 t = new0(struct test, 1);
120 t->value = (unsigned) rand();
122 r = prioq_put(q, t, &t->idx);
126 r = set_consume(s, t);
134 t = set_steal_first(s);
138 r = prioq_remove(q, t, &t->idx);
144 for (i = 0; i < SET_SIZE * 3 / 4; i++) {
147 assert_se(prioq_size(q) == (SET_SIZE * 3 / 4) - i);
152 assert_se(previous <= t->value);
157 assert_se(prioq_isempty(q));
160 assert_se(set_isempty(s));
164 int main(int argc, char* argv[]) {