litespeed-quic/test/unittests/test_shi.c

139 lines
3.3 KiB
C
Raw Normal View History

/* Copyright (c) 2017 - 2020 LiteSpeed Technologies Inc. See LICENSE. */
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <unistd.h>
#include "lsquic.h"
#include "lsquic_stock_shi.h"
static const struct pair {
const char *key, *value;
} pairs[] = {
{ "Dude,", "where is my car?", },
{ "Balls of fur", "y", },
{ "Grand", "piano", },
{ "sWeet", "Potato", },
{ "Mac ", "and CHEESE!", },
};
struct data {
size_t size; /* Overall size including the payload */
char *key;
char *value;
char data[0]; /* key followed by value */
};
static struct data *
new_data (const char *key, const char *value)
{
size_t klen = strlen(key);
size_t vlen = strlen(value);
size_t size = klen + vlen + 2 + sizeof(struct data);
struct data *data = malloc(size);
data->size = size;
data->key = data->data;
data->value = data->data + klen + 1;
memcpy(data->data, key, klen);
data->key[klen] = '\0';
memcpy(data->value, value, vlen);
data->value[vlen] = '\0';
return data;
}
#define N_PAIRS (sizeof(pairs) / sizeof(pairs[0]))
static const struct order {
int order[N_PAIRS];
int expire;
} orderings[] = {
{{ 0, 1, 2, 3, 4, }, 1, },
{{ 0, 2, 3, 1, 4, }, 2, },
{{ 2, 1, 0, 4, 3, }, 3, },
};
static void
test_shi (const struct order *order)
{
unsigned i;
int s;
struct stock_shared_hash *hash;
const struct pair *pair;
unsigned data_sz;
const time_t now = time(NULL);
time_t expiry;
void *datap;
struct data *data;
hash = stock_shared_hash_new();
for (i = 0; i < N_PAIRS; ++i)
{
pair = &pairs[ order->order[i] ];
if (order->order[i] == order->expire)
expiry = now + 1;
else
expiry = 0;
data = new_data(pair->key, pair->value);
s = stock_shi.shi_insert(hash, strdup(data->key), strlen(data->key),
data, data->size, expiry);
assert(0 == s);
}
sleep(2); /* Let the thing expire */
for (i = 0; i < N_PAIRS; ++i)
{
pair = &pairs[ order->order[i] ];
s = stock_shi.shi_lookup(hash, pair->key, strlen(pair->key),
&datap, &data_sz);
if (order->order[i] == order->expire)
{
assert(0 == s);
}
else
{
data = datap;
assert(1 == s);
assert(data_sz == data->size);
assert(0 == strcmp(pair->key, data->key));
assert(0 == strcmp(pair->value, data->value));
}
}
for (i = 0; i < N_PAIRS; ++i)
{
pair = &pairs[ order->order[i] ];
s = stock_shi.shi_delete(hash, pair->key, strlen(pair->key));
if (order->order[i] == order->expire)
assert(0 != s);
else
assert(0 == s);
}
for (i = 0; i < N_PAIRS; ++i)
{
pair = &pairs[ order->order[i] ];
s = stock_shi.shi_lookup(hash, pair->key, strlen(pair->key),
&datap, &data_sz);
assert(0 == s);
}
stock_shared_hash_destroy(hash);
}
int
main (void)
{
unsigned i;
for (i = 0; i < sizeof(orderings) / sizeof(orderings[0]); ++i)
test_shi(&orderings[i]);
return 0;
}