nghttp2/tests/nghttp2_pq_test.c

124 lines
3.7 KiB
C
Raw Normal View History

2013-07-12 17:19:03 +02:00
/*
2014-03-30 12:09:21 +02:00
* nghttp2 - HTTP/2 C Library
2013-07-12 17:19:03 +02:00
*
* 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"
2014-11-27 15:39:04 +01:00
static int pq_compar(const void *lhs, const void *rhs) {
2013-07-12 17:19:03 +02:00
return strcmp(lhs, rhs);
}
2014-11-27 15:39:04 +01:00
void test_nghttp2_pq(void) {
2013-07-12 17:19:03 +02:00
int i;
nghttp2_pq pq;
nghttp2_pq_init(&pq, pq_compar);
CU_ASSERT(nghttp2_pq_empty(&pq));
CU_ASSERT(0 == nghttp2_pq_size(&pq));
2014-11-27 15:39:04 +01:00
CU_ASSERT(0 == nghttp2_pq_push(&pq, (void *)"foo"));
2013-07-12 17:19:03 +02:00
CU_ASSERT(0 == nghttp2_pq_empty(&pq));
CU_ASSERT(1 == nghttp2_pq_size(&pq));
CU_ASSERT(strcmp("foo", nghttp2_pq_top(&pq)) == 0);
2014-11-27 15:39:04 +01:00
CU_ASSERT(0 == nghttp2_pq_push(&pq, (void *)"bar"));
2013-07-12 17:19:03 +02:00
CU_ASSERT(strcmp("bar", nghttp2_pq_top(&pq)) == 0);
2014-11-27 15:39:04 +01:00
CU_ASSERT(0 == nghttp2_pq_push(&pq, (void *)"baz"));
2013-07-12 17:19:03 +02:00
CU_ASSERT(strcmp("bar", nghttp2_pq_top(&pq)) == 0);
2014-11-27 15:39:04 +01:00
CU_ASSERT(0 == nghttp2_pq_push(&pq, (void *)"C"));
2013-07-12 17:19:03 +02:00
CU_ASSERT(4 == nghttp2_pq_size(&pq));
CU_ASSERT(strcmp("C", nghttp2_pq_top(&pq)) == 0);
nghttp2_pq_pop(&pq);
CU_ASSERT(3 == nghttp2_pq_size(&pq));
CU_ASSERT(strcmp("bar", nghttp2_pq_top(&pq)) == 0);
nghttp2_pq_pop(&pq);
CU_ASSERT(strcmp("baz", nghttp2_pq_top(&pq)) == 0);
nghttp2_pq_pop(&pq);
CU_ASSERT(strcmp("foo", nghttp2_pq_top(&pq)) == 0);
nghttp2_pq_pop(&pq);
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 */
2014-11-27 15:39:04 +01:00
for (i = 0; i < 10000; ++i) {
CU_ASSERT(0 == nghttp2_pq_push(&pq, (void *)"foo"));
CU_ASSERT((size_t)(i + 1) == nghttp2_pq_size(&pq));
2013-07-12 17:19:03 +02:00
}
2014-11-27 15:39:04 +01:00
for (i = 10000; i > 0; --i) {
2013-07-12 17:19:03 +02:00
CU_ASSERT(NULL != nghttp2_pq_top(&pq));
nghttp2_pq_pop(&pq);
2014-11-27 15:39:04 +01:00
CU_ASSERT((size_t)(i - 1) == nghttp2_pq_size(&pq));
2013-07-12 17:19:03 +02:00
}
nghttp2_pq_free(&pq);
}
typedef struct {
int key;
int val;
} node;
2014-11-27 15:39:04 +01:00
static int node_compar(const void *lhs, const void *rhs) {
node *ln = (node *)lhs;
node *rn = (node *)rhs;
return ln->key - rn->key;
}
2014-11-27 15:39:04 +01:00
static int node_update(void *item, void *arg _U_) {
node *nd = (node *)item;
if ((nd->key % 2) == 0) {
nd->key *= -1;
return 1;
} else {
return 0;
}
}
2014-11-27 15:39:04 +01:00
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_compar);
2014-11-27 15:39:04 +01:00
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]);
}
nghttp2_pq_update(&pq, node_update, NULL);
2014-11-27 15:39:04 +01:00
for (i = 0; i < (int)(sizeof(nodes) / sizeof(nodes[0])); ++i) {
nd = nghttp2_pq_top(&pq);
CU_ASSERT(ans[i] == nd->key);
nghttp2_pq_pop(&pq);
}
nghttp2_pq_free(&pq);
}