2 * Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 * Copyright (c) 2017 Oracle and/or its affiliates. All rights reserved.
17 #include <openssl/opensslconf.h>
18 #include <openssl/lhash.h>
19 #include <openssl/err.h>
20 #include <openssl/crypto.h>
23 #include "test_main.h"
27 * The macros below generate unused functions which error out one of the clang
28 * builds. We disable this check here.
31 #pragma clang diagnostic ignored "-Wunused-function"
36 static int int_tests[] = { 65537, 13, 1, 3, -5, 6, 7, 4, -10, -12, -14, 22, 9,
37 -17, 16, 17, -23, 35, 37, 173, 11 };
38 static const unsigned int n_int_tests = OSSL_NELEM(int_tests);
39 static short int_found[OSSL_NELEM(int_tests)];
41 static unsigned long int int_hash(const int *p)
43 return 3 & *p; /* To force collisions */
46 static int int_cmp(const int *p, const int *q)
51 static int int_find(int n)
55 for (i = 0; i < n_int_tests; i++)
56 if (int_tests[i] == n)
61 static void int_doall(int *v)
63 int_found[int_find(*v)]++;
66 static void int_doall_arg(int *p, short *f)
71 IMPLEMENT_LHASH_DOALL_ARG(int, short);
73 static int test_int_lhash(void)
86 const unsigned int n_dels = OSSL_NELEM(dels);
87 LHASH_OF(int) *h = lh_int_new(&int_hash, &int_cmp);
89 int testresult = 0, j, *p;
95 for (i = 0; i < n_int_tests; i++)
96 if (!TEST_ptr_null(lh_int_insert(h, int_tests + i))) {
97 TEST_info("int insert %d", i);
102 if (!TEST_int_eq(lh_int_num_items(h), n_int_tests))
106 for (i = 0; i < n_int_tests; i++)
107 if (!TEST_int_eq(*lh_int_retrieve(h, int_tests + i), int_tests[i])) {
108 TEST_info("lhash int retrieve value %d", i);
111 for (i = 0; i < n_int_tests; i++)
112 if (!TEST_ptr_eq(lh_int_retrieve(h, int_tests + i), int_tests + i)) {
113 TEST_info("lhash int retrieve address %d", i);
117 if (!TEST_ptr_eq(lh_int_retrieve(h, &j), int_tests + 2))
122 if (!TEST_ptr(p = lh_int_insert(h, &j)))
124 if (!TEST_ptr_eq(p, int_tests + 1))
126 if (!TEST_ptr_eq(lh_int_retrieve(h, int_tests + 1), &j))
130 memset(int_found, 0, sizeof(int_found));
131 lh_int_doall(h, &int_doall);
132 for (i = 0; i < n_int_tests; i++)
133 if (!TEST_int_eq(int_found[i], 1)) {
134 TEST_info("lhash int doall %d", i);
139 memset(int_found, 0, sizeof(int_found));
140 lh_int_doall_short(h, int_doall_arg, int_found);
141 for (i = 0; i < n_int_tests; i++)
142 if (!TEST_int_eq(int_found[i], 1)) {
143 TEST_info("lhash int doall arg %d", i);
148 for (i = 0; i < n_dels; i++) {
149 const int b = lh_int_delete(h, &dels[i].data) == NULL;
150 if (!TEST_int_eq(b ^ dels[i].null, 0)) {
151 TEST_info("lhash int delete %d", i);
157 if (!TEST_int_eq(lh_int_error(h), 0))
166 static unsigned long int stress_hash(const int *p)
171 static int test_stress(void)
173 LHASH_OF(int) *h = lh_int_new(&stress_hash, &int_cmp);
174 const unsigned int n = 2500000;
176 int testresult = 0, *p;
182 for (i = 0; i < n; i++) {
183 p = OPENSSL_malloc(sizeof(i));
185 TEST_info("lhash stress out of memory %d", i);
193 if (!TEST_int_eq(lh_int_num_items(h), n))
196 fprintf(stderr, "hash full statistics:\n");
197 OPENSSL_LH_stats((OPENSSL_LHASH *)h, stderr);
198 fprintf(stderr, "\nhash full node usage:\n");
199 OPENSSL_LH_node_usage_stats((OPENSSL_LHASH *)h, stderr);
201 /* delete in a different order */
202 for (i = 0; i < n; i++) {
203 const int j = (7 * i + 4) % n * 3 + 1;
205 if (!TEST_ptr(p = lh_int_delete(h, &j))) {
206 TEST_info("lhash stress delete %d\n", i);
209 if (!TEST_int_eq(*p, j)) {
210 TEST_info("lhash stress bad value %d", i);
216 fprintf(stderr, "\nhash empty statistics:\n");
217 OPENSSL_LH_stats((OPENSSL_LHASH *)h, stderr);
218 fprintf(stderr, "\nhash empty node usage:\n");
219 OPENSSL_LH_node_usage_stats((OPENSSL_LHASH *)h, stderr);
227 void register_tests(void)
229 ADD_TEST(test_int_lhash);
230 ADD_TEST(test_stress);