ca0642287d
Use a std::map as the dummy lhash and use unique_ptr. This also improves the test to check on pointer equality; we wish to ensure the lhash stores the particular pointer value we asked for. dummy_lh now also owns the pointers. It makes things simpler and since LHASH doesn't free things, we weren't getting anything out of testing that. Change-Id: I97159175ca79a5874586650f272a7846100395e1 Reviewed-on: https://boringssl-review.googlesource.com/12976 Reviewed-by: Adam Langley <agl@google.com>
132 lines
3.3 KiB
C++
132 lines
3.3 KiB
C++
/* Copyright (c) 2014, Google Inc.
|
|
*
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
|
* SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
|
|
* OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
|
|
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
|
|
|
|
#if !defined(_POSIX_C_SOURCE)
|
|
#define _POSIX_C_SOURCE 201410L
|
|
#endif
|
|
|
|
#include <openssl/crypto.h>
|
|
#include <openssl/lhash.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include <memory>
|
|
#include <map>
|
|
#include <string>
|
|
#include <utility>
|
|
|
|
|
|
static std::unique_ptr<char[]> RandString(void) {
|
|
unsigned len = 1 + (rand() % 3);
|
|
std::unique_ptr<char[]> ret(new char[len + 1]);
|
|
|
|
for (unsigned i = 0; i < len; i++) {
|
|
ret[i] = '0' + (rand() & 7);
|
|
}
|
|
ret[len] = 0;
|
|
|
|
return ret;
|
|
}
|
|
|
|
struct FreeLHASH {
|
|
void operator()(_LHASH *lh) { lh_free(lh); }
|
|
};
|
|
|
|
static const char *Lookup(
|
|
std::map<std::string, std::unique_ptr<char[]>> *dummy_lh, const char *key) {
|
|
// Using operator[] implicitly inserts into the map.
|
|
auto iter = dummy_lh->find(key);
|
|
if (iter == dummy_lh->end()) {
|
|
return nullptr;
|
|
}
|
|
return iter->second.get();
|
|
}
|
|
|
|
int main(int argc, char **argv) {
|
|
CRYPTO_library_init();
|
|
|
|
std::unique_ptr<_LHASH, FreeLHASH> lh(lh_new(NULL, NULL));
|
|
if (!lh) {
|
|
return 1;
|
|
}
|
|
|
|
// lh is expected to store a canonical instance of each string. dummy_lh
|
|
// mirrors what it stores for comparison. It also manages ownership of the
|
|
// pointers.
|
|
std::map<std::string, std::unique_ptr<char[]>> dummy_lh;
|
|
|
|
for (unsigned i = 0; i < 100000; i++) {
|
|
if (dummy_lh.size() != lh_num_items(lh.get())) {
|
|
fprintf(stderr, "Length mismatch\n");
|
|
return 1;
|
|
}
|
|
|
|
enum Action {
|
|
kRetrieve = 0,
|
|
kInsert,
|
|
kDelete,
|
|
};
|
|
|
|
Action action = static_cast<Action>(rand() % 3);
|
|
switch (action) {
|
|
case kRetrieve: {
|
|
std::unique_ptr<char[]> key = RandString();
|
|
void *value = lh_retrieve(lh.get(), key.get());
|
|
if (value != Lookup(&dummy_lh, key.get())) {
|
|
fprintf(stderr, "lh_retrieve failure\n");
|
|
return 1;
|
|
}
|
|
break;
|
|
}
|
|
|
|
case kInsert: {
|
|
std::unique_ptr<char[]> key = RandString();
|
|
void *previous;
|
|
if (!lh_insert(lh.get(), &previous, key.get())) {
|
|
return 1;
|
|
}
|
|
|
|
if (previous != Lookup(&dummy_lh, key.get())) {
|
|
fprintf(stderr, "lh_insert failure\n");
|
|
return 1;
|
|
}
|
|
|
|
dummy_lh[key.get()] = std::move(key);
|
|
break;
|
|
}
|
|
|
|
case kDelete: {
|
|
std::unique_ptr<char[]> key = RandString();
|
|
void *value = lh_delete(lh.get(), key.get());
|
|
|
|
if (value != Lookup(&dummy_lh, key.get())) {
|
|
fprintf(stderr, "lh_delete failure\n");
|
|
return 1;
|
|
}
|
|
|
|
dummy_lh.erase(key.get());
|
|
break;
|
|
}
|
|
|
|
default:
|
|
abort();
|
|
}
|
|
}
|
|
|
|
printf("PASS\n");
|
|
return 0;
|
|
}
|