src/test/test-prioq.c

   1 /* SPDX-License-Identifier: LGPL-2.1+ */
   2
   3 #include <stdlib.h>
   4
   5 #include "alloc-util.h"
   6 #include "prioq.h"
   7 #include "set.h"
   8 #include "siphash24.h"
   9 #include "util.h"
  10
  11 #define SET_SIZE 1024*4
  12
  13 static int unsigned_compare(const unsigned *a, const unsigned *b) {
  14         return CMP(*a, *b);
  15 }
  16
  17 static void test_unsigned(void) {
  18         _cleanup_(prioq_freep) Prioq *q = NULL;
  19         unsigned buffer[SET_SIZE], i, u, n;
  20
  21         srand(0);
  22
  23         assert_se(q = prioq_new(trivial_compare_func));
  24
  25         for (i = 0; i < ELEMENTSOF(buffer); i++) {
  26                 u = (unsigned) rand();
  27                 buffer[i] = u;
  28                 assert_se(prioq_put(q, UINT_TO_PTR(u), NULL) >= 0);
  29
  30                 n = prioq_size(q);
  31                 assert_se(prioq_remove(q, UINT_TO_PTR(u), &n) == 0);
  32         }
  33
  34         typesafe_qsort(buffer, ELEMENTSOF(buffer), unsigned_compare);
  35
  36         for (i = 0; i < ELEMENTSOF(buffer); i++) {
  37                 assert_se(prioq_size(q) == ELEMENTSOF(buffer) - i);
  38
  39                 u = PTR_TO_UINT(prioq_pop(q));
  40                 assert_se(buffer[i] == u);
  41         }
  42
  43         assert_se(prioq_isempty(q));
  44 }
  45
  46 struct test {
  47         unsigned value;
  48         unsigned idx;
  49 };
  50
  51 static int test_compare(const struct test *x, const struct test *y) {
  52         return CMP(x->value, y->value);
  53 }
  54
  55 static void test_hash(const struct test *x, struct siphash *state) {
  56         siphash24_compress(&x->value, sizeof(x->value), state);
  57 }
  58
  59 DEFINE_PRIVATE_HASH_OPS(test_hash_ops, struct test, test_hash, test_compare);
  60
  61 static void test_struct(void) {
  62         _cleanup_(prioq_freep) Prioq *q = NULL;
  63         _cleanup_(set_freep) Set *s = NULL;
  64         unsigned previous = 0, i;
  65         struct test *t;
  66
  67         srand(0);
  68
  69         assert_se(q = prioq_new((compare_func_t) test_compare));
  70         assert_se(s = set_new(&test_hash_ops));
  71
  72         for (i = 0; i < SET_SIZE; i++) {
  73                 assert_se(t = new0(struct test, 1));
  74                 t->value = (unsigned) rand();
  75
  76                 assert_se(prioq_put(q, t, &t->idx) >= 0);
  77
  78                 if (i % 4 == 0)
  79                         assert_se(set_consume(s, t) >= 0);
  80         }
  81
  82         while ((t = set_steal_first(s))) {
  83                 assert_se(prioq_remove(q, t, &t->idx) == 1);
  84                 assert_se(prioq_remove(q, t, &t->idx) == 0);
  85                 assert_se(prioq_remove(q, t, NULL) == 0);
  86
  87                 free(t);
  88         }
  89
  90         for (i = 0; i < SET_SIZE * 3 / 4; i++) {
  91                 assert_se(prioq_size(q) == (SET_SIZE * 3 / 4) - i);
  92
  93                 assert_se(t = prioq_pop(q));
  94                 assert_se(prioq_remove(q, t, &t->idx) == 0);
  95                 assert_se(prioq_remove(q, t, NULL) == 0);
  96                 assert_se(previous <= t->value);
  97
  98                 previous = t->value;
  99                 free(t);
 100         }
 101
 102         assert_se(prioq_isempty(q));
 103         assert_se(set_isempty(s));
 104 }
 105
 106 int main(int argc, char* argv[]) {
 107
 108         test_unsigned();
 109         test_struct();
 110
 111         return 0;
 112 }