258 lines
6.6 KiB
C
258 lines
6.6 KiB
C
/*
|
|
* nghttp2 - HTTP/2 C Library
|
|
*
|
|
* Copyright (c) 2012 Tatsuhiro Tsujikawa
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
* a copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
* the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*/
|
|
#include "nghttp2_pq_test.h"
|
|
|
|
#include <CUnit/CUnit.h>
|
|
|
|
#include "nghttp2_pq.h"
|
|
|
|
typedef struct {
|
|
nghttp2_pq_entry ent;
|
|
const char *s;
|
|
} string_entry;
|
|
|
|
static string_entry *string_entry_new(const char *s) {
|
|
nghttp2_mem *mem;
|
|
string_entry *ent;
|
|
|
|
mem = nghttp2_mem_default();
|
|
|
|
ent = nghttp2_mem_malloc(mem, sizeof(string_entry));
|
|
ent->s = s;
|
|
|
|
return ent;
|
|
}
|
|
|
|
static void string_entry_del(string_entry *ent) {
|
|
free(ent);
|
|
}
|
|
|
|
static int pq_less(const void *lhs, const void *rhs) {
|
|
return strcmp(((string_entry *)lhs)->s, ((string_entry *)rhs)->s) < 0;
|
|
}
|
|
|
|
void test_nghttp2_pq(void) {
|
|
int i;
|
|
nghttp2_pq pq;
|
|
string_entry *top;
|
|
|
|
nghttp2_pq_init(&pq, pq_less, nghttp2_mem_default());
|
|
CU_ASSERT(nghttp2_pq_empty(&pq));
|
|
CU_ASSERT(0 == nghttp2_pq_size(&pq));
|
|
CU_ASSERT(0 == nghttp2_pq_push(&pq, &string_entry_new("foo")->ent));
|
|
CU_ASSERT(0 == nghttp2_pq_empty(&pq));
|
|
CU_ASSERT(1 == nghttp2_pq_size(&pq));
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("foo", top->s) == 0);
|
|
CU_ASSERT(0 == nghttp2_pq_push(&pq, &string_entry_new("bar")->ent));
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("bar", top->s) == 0);
|
|
CU_ASSERT(0 == nghttp2_pq_push(&pq, &string_entry_new("baz")->ent));
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("bar", top->s) == 0);
|
|
CU_ASSERT(0 == nghttp2_pq_push(&pq, &string_entry_new("C")->ent));
|
|
CU_ASSERT(4 == nghttp2_pq_size(&pq));
|
|
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("C", top->s) == 0);
|
|
string_entry_del(top);
|
|
nghttp2_pq_pop(&pq);
|
|
|
|
CU_ASSERT(3 == nghttp2_pq_size(&pq));
|
|
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("bar", top->s) == 0);
|
|
nghttp2_pq_pop(&pq);
|
|
string_entry_del(top);
|
|
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("baz", top->s) == 0);
|
|
nghttp2_pq_pop(&pq);
|
|
string_entry_del(top);
|
|
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(strcmp("foo", top->s) == 0);
|
|
nghttp2_pq_pop(&pq);
|
|
string_entry_del(top);
|
|
|
|
CU_ASSERT(nghttp2_pq_empty(&pq));
|
|
CU_ASSERT(0 == nghttp2_pq_size(&pq));
|
|
CU_ASSERT(NULL == nghttp2_pq_top(&pq));
|
|
|
|
/* Add bunch of entry to see realloc works */
|
|
for (i = 0; i < 10000; ++i) {
|
|
CU_ASSERT(0 == nghttp2_pq_push(&pq, &string_entry_new("foo")->ent));
|
|
CU_ASSERT((size_t)(i + 1) == nghttp2_pq_size(&pq));
|
|
}
|
|
for (i = 10000; i > 0; --i) {
|
|
top = (string_entry *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(NULL != top);
|
|
nghttp2_pq_pop(&pq);
|
|
string_entry_del(top);
|
|
CU_ASSERT((size_t)(i - 1) == nghttp2_pq_size(&pq));
|
|
}
|
|
|
|
nghttp2_pq_free(&pq);
|
|
}
|
|
|
|
typedef struct {
|
|
nghttp2_pq_entry ent;
|
|
int key;
|
|
int val;
|
|
} node;
|
|
|
|
static int node_less(const void *lhs, const void *rhs) {
|
|
node *ln = (node *)lhs;
|
|
node *rn = (node *)rhs;
|
|
return ln->key < rn->key;
|
|
}
|
|
|
|
static int node_update(nghttp2_pq_entry *item, void *arg _U_) {
|
|
node *nd = (node *)item;
|
|
if ((nd->key % 2) == 0) {
|
|
nd->key *= -1;
|
|
return 1;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
void test_nghttp2_pq_update(void) {
|
|
nghttp2_pq pq;
|
|
node nodes[10];
|
|
int i;
|
|
node *nd;
|
|
int ans[] = {-8, -6, -4, -2, 0, 1, 3, 5, 7, 9};
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
for (i = 0; i < (int)(sizeof(nodes) / sizeof(nodes[0])); ++i) {
|
|
nodes[i].key = i;
|
|
nodes[i].val = i;
|
|
nghttp2_pq_push(&pq, &nodes[i].ent);
|
|
}
|
|
|
|
nghttp2_pq_update(&pq, node_update, NULL);
|
|
|
|
for (i = 0; i < (int)(sizeof(nodes) / sizeof(nodes[0])); ++i) {
|
|
nd = (node *)nghttp2_pq_top(&pq);
|
|
CU_ASSERT(ans[i] == nd->key);
|
|
nghttp2_pq_pop(&pq);
|
|
}
|
|
|
|
nghttp2_pq_free(&pq);
|
|
}
|
|
|
|
static void push_nodes(nghttp2_pq *pq, node *dest, size_t n) {
|
|
size_t i;
|
|
for (i = 0; i < n; ++i) {
|
|
dest[i].key = (int)i;
|
|
dest[i].val = (int)i;
|
|
nghttp2_pq_push(pq, &dest[i].ent);
|
|
}
|
|
}
|
|
|
|
static void check_nodes(nghttp2_pq *pq, size_t n, int *ans_key, int *ans_val) {
|
|
size_t i;
|
|
for (i = 0; i < n; ++i) {
|
|
node *nd = (node *)nghttp2_pq_top(pq);
|
|
CU_ASSERT(ans_key[i] == nd->key);
|
|
CU_ASSERT(ans_val[i] == nd->val);
|
|
nghttp2_pq_pop(pq);
|
|
}
|
|
}
|
|
|
|
void test_nghttp2_pq_remove(void) {
|
|
nghttp2_pq pq;
|
|
node nodes[10];
|
|
int ans_key1[] = {1, 2, 3, 4, 5};
|
|
int ans_val1[] = {1, 2, 3, 4, 5};
|
|
int ans_key2[] = {0, 1, 2, 4, 5};
|
|
int ans_val2[] = {0, 1, 2, 4, 5};
|
|
int ans_key3[] = {0, 1, 2, 3, 4};
|
|
int ans_val3[] = {0, 1, 2, 3, 4};
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
push_nodes(&pq, nodes, 6);
|
|
|
|
nghttp2_pq_remove(&pq, &nodes[0].ent);
|
|
|
|
check_nodes(&pq, 5, ans_key1, ans_val1);
|
|
|
|
nghttp2_pq_free(&pq);
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
push_nodes(&pq, nodes, 6);
|
|
|
|
nghttp2_pq_remove(&pq, &nodes[3].ent);
|
|
|
|
check_nodes(&pq, 5, ans_key2, ans_val2);
|
|
|
|
nghttp2_pq_free(&pq);
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
push_nodes(&pq, nodes, 6);
|
|
|
|
nghttp2_pq_remove(&pq, &nodes[5].ent);
|
|
|
|
check_nodes(&pq, 5, ans_key3, ans_val3);
|
|
|
|
nghttp2_pq_free(&pq);
|
|
}
|
|
|
|
void test_nghttp2_pq_increase_key(void) {
|
|
nghttp2_pq pq;
|
|
node nodes[10];
|
|
int ans_key1[] = {1, 2, 3, 3, 4, 5};
|
|
int ans_val1[] = {1, 2, 0, 3, 4, 5};
|
|
int ans_key2[] = {0, 1, 2, 3, 4, 6};
|
|
int ans_val2[] = {0, 1, 2, 3, 4, 5};
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
push_nodes(&pq, nodes, 6);
|
|
|
|
nodes[0].key = 3;
|
|
nghttp2_pq_increase_key(&pq, &nodes[0].ent);
|
|
|
|
check_nodes(&pq, 6, ans_key1, ans_val1);
|
|
|
|
nghttp2_pq_free(&pq);
|
|
|
|
nghttp2_pq_init(&pq, node_less, nghttp2_mem_default());
|
|
|
|
push_nodes(&pq, nodes, 6);
|
|
|
|
nodes[5].key = 6;
|
|
nghttp2_pq_increase_key(&pq, &nodes[5].ent);
|
|
|
|
check_nodes(&pq, 6, ans_key2, ans_val2);
|
|
|
|
nghttp2_pq_free(&pq);
|
|
}
|