mirror of
https://gitlab.torproject.org/tpo/core/tor.git
synced 2024-11-20 10:12:15 +01:00
Split container tests into their own module
This commit is contained in:
Nick Mathewson
parent
cea1225199
commit
d2857d524c
@ -12,7 +12,7 @@ AM_CFLAGS = -I../or
|
||||
# This seems to matter nowhere but on windows, but I assure you that it
|
||||
# matters a lot there, and is quite hard to debug if you forget to do it.
|
||||
|
||||
test_SOURCES = test_data.c test.c test_crypto.c tinytest.c
|
||||
test_SOURCES = test_data.c test.c test_crypto.c test_containers.c tinytest.c
|
||||
|
||||
test_LDFLAGS = @TOR_LDFLAGS_zlib@ @TOR_LDFLAGS_openssl@ \
|
||||
@TOR_LDFLAGS_libevent@
|
||||
|
||||
705
src/test/test.c
705
src/test/test.c
@ -408,24 +408,6 @@ test_buffers(void)
|
||||
buf_free(buf2);
|
||||
}
|
||||
|
||||
/** Helper: return a tristate based on comparing the strings in *<b>a</b> and
|
||||
* *<b>b</b>. */
|
||||
static int
|
||||
_compare_strs(const void **a, const void **b)
|
||||
{
|
||||
const char *s1 = *a, *s2 = *b;
|
||||
return strcmp(s1, s2);
|
||||
}
|
||||
|
||||
/** Helper: return a tristate based on comparing the strings in *<b>a</b> and
|
||||
* *<b>b</b>, excluding a's first character, and ignoring case. */
|
||||
static int
|
||||
_compare_without_first_ch(const void *a, const void **b)
|
||||
{
|
||||
const char *s1 = a, *s2 = *b;
|
||||
return strcasecmp(s1+1, s2);
|
||||
}
|
||||
|
||||
/** Test basic utility functionality. */
|
||||
static void
|
||||
test_util(void)
|
||||
@ -1241,496 +1223,6 @@ test_util_ip6_helpers(void)
|
||||
;
|
||||
}
|
||||
|
||||
/** Run unit tests for basic dynamic-sized array functionality. */
|
||||
static void
|
||||
test_util_smartlist_basic(void)
|
||||
{
|
||||
smartlist_t *sl;
|
||||
|
||||
/* XXXX test sort_digests, uniq_strings, uniq_digests */
|
||||
|
||||
/* Test smartlist add, del_keeporder, insert, get. */
|
||||
sl = smartlist_create();
|
||||
smartlist_add(sl, (void*)1);
|
||||
smartlist_add(sl, (void*)2);
|
||||
smartlist_add(sl, (void*)3);
|
||||
smartlist_add(sl, (void*)4);
|
||||
smartlist_del_keeporder(sl, 1);
|
||||
smartlist_insert(sl, 1, (void*)22);
|
||||
smartlist_insert(sl, 0, (void*)0);
|
||||
smartlist_insert(sl, 5, (void*)555);
|
||||
test_eq_ptr((void*)0, smartlist_get(sl,0));
|
||||
test_eq_ptr((void*)1, smartlist_get(sl,1));
|
||||
test_eq_ptr((void*)22, smartlist_get(sl,2));
|
||||
test_eq_ptr((void*)3, smartlist_get(sl,3));
|
||||
test_eq_ptr((void*)4, smartlist_get(sl,4));
|
||||
test_eq_ptr((void*)555, smartlist_get(sl,5));
|
||||
/* Try deleting in the middle. */
|
||||
smartlist_del(sl, 1);
|
||||
test_eq_ptr((void*)555, smartlist_get(sl, 1));
|
||||
/* Try deleting at the end. */
|
||||
smartlist_del(sl, 4);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
|
||||
/* test isin. */
|
||||
test_assert(smartlist_isin(sl, (void*)3));
|
||||
test_assert(!smartlist_isin(sl, (void*)99));
|
||||
|
||||
done:
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist-of-strings functionality. */
|
||||
static void
|
||||
test_util_smartlist_strings(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
char *cp=NULL, *cp_alloc=NULL;
|
||||
size_t sz;
|
||||
|
||||
/* Test split and join */
|
||||
test_eq(0, smartlist_len(sl));
|
||||
smartlist_split_string(sl, "abc", ":", 0, 0);
|
||||
test_eq(1, smartlist_len(sl));
|
||||
test_streq("abc", smartlist_get(sl, 0));
|
||||
smartlist_split_string(sl, "a::bc::", "::", 0, 0);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
test_streq("a", smartlist_get(sl, 1));
|
||||
test_streq("bc", smartlist_get(sl, 2));
|
||||
test_streq("", smartlist_get(sl, 3));
|
||||
cp_alloc = smartlist_join_strings(sl, "", 0, NULL);
|
||||
test_streq(cp_alloc, "abcabc");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "!", 0, NULL);
|
||||
test_streq(cp_alloc, "abc!a!bc!");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 0, NULL);
|
||||
test_streq(cp_alloc, "abcXYaXYbcXY");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 1, NULL);
|
||||
test_streq(cp_alloc, "abcXYaXYbcXYXY");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "", 1, NULL);
|
||||
test_streq(cp_alloc, "abcabc");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
smartlist_split_string(sl, "/def/ /ghijk", "/", 0, 0);
|
||||
test_eq(8, smartlist_len(sl));
|
||||
test_streq("", smartlist_get(sl, 4));
|
||||
test_streq("def", smartlist_get(sl, 5));
|
||||
test_streq(" ", smartlist_get(sl, 6));
|
||||
test_streq("ghijk", smartlist_get(sl, 7));
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, "a,bbd,cdef", ",", SPLIT_SKIP_SPACE, 0);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
test_streq("a", smartlist_get(sl,0));
|
||||
test_streq("bbd", smartlist_get(sl,1));
|
||||
test_streq("cdef", smartlist_get(sl,2));
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE, 0);
|
||||
test_eq(8, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl,3));
|
||||
test_streq("zhasd", smartlist_get(sl,4));
|
||||
test_streq("", smartlist_get(sl,5));
|
||||
test_streq("bnud", smartlist_get(sl,6));
|
||||
test_streq("", smartlist_get(sl,7));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, " ab\tc \td ef ", NULL,
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
test_streq("ab", smartlist_get(sl,0));
|
||||
test_streq("c", smartlist_get(sl,1));
|
||||
test_streq("d", smartlist_get(sl,2));
|
||||
test_streq("ef", smartlist_get(sl,3));
|
||||
smartlist_split_string(sl, "ghi\tj", NULL,
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(6, smartlist_len(sl));
|
||||
test_streq("ghi", smartlist_get(sl,4));
|
||||
test_streq("j", smartlist_get(sl,5));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 0, NULL);
|
||||
test_streq(cp_alloc, "");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 1, NULL);
|
||||
test_streq(cp_alloc, "XY");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl, 0));
|
||||
test_streq("zhasd", smartlist_get(sl, 1));
|
||||
test_streq("bnud", smartlist_get(sl, 2));
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 2);
|
||||
test_eq(5, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl, 3));
|
||||
test_streq("zhasd <> <> bnud<>", smartlist_get(sl, 4));
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, "abcd\n", "\n",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(1, smartlist_len(sl));
|
||||
test_streq("abcd", smartlist_get(sl, 0));
|
||||
smartlist_split_string(sl, "efgh", "\n",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(2, smartlist_len(sl));
|
||||
test_streq("efgh", smartlist_get(sl, 1));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
/* Test swapping, shuffling, and sorting. */
|
||||
smartlist_split_string(sl, "the,onion,router,by,arma,and,nickm", ",", 0, 0);
|
||||
test_eq(7, smartlist_len(sl));
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"and,arma,by,nickm,onion,router,the");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_swap(sl, 1, 5);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"and,router,by,nickm,onion,arma,the");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_shuffle(sl);
|
||||
test_eq(7, smartlist_len(sl));
|
||||
test_assert(smartlist_string_isin(sl, "and"));
|
||||
test_assert(smartlist_string_isin(sl, "router"));
|
||||
test_assert(smartlist_string_isin(sl, "by"));
|
||||
test_assert(smartlist_string_isin(sl, "nickm"));
|
||||
test_assert(smartlist_string_isin(sl, "onion"));
|
||||
test_assert(smartlist_string_isin(sl, "arma"));
|
||||
test_assert(smartlist_string_isin(sl, "the"));
|
||||
|
||||
/* Test bsearch. */
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
test_streq("nickm", smartlist_bsearch(sl, "zNicKM",
|
||||
_compare_without_first_ch));
|
||||
test_streq("and", smartlist_bsearch(sl, " AND", _compare_without_first_ch));
|
||||
test_eq_ptr(NULL, smartlist_bsearch(sl, " ANz", _compare_without_first_ch));
|
||||
|
||||
/* Test bsearch_idx */
|
||||
{
|
||||
int f;
|
||||
test_eq(0, smartlist_bsearch_idx(sl," aaa",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(0, smartlist_bsearch_idx(sl," and",_compare_without_first_ch,&f));
|
||||
test_eq(f, 1);
|
||||
test_eq(1, smartlist_bsearch_idx(sl," arm",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(1, smartlist_bsearch_idx(sl," arma",_compare_without_first_ch,&f));
|
||||
test_eq(f, 1);
|
||||
test_eq(2, smartlist_bsearch_idx(sl," armb",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(7, smartlist_bsearch_idx(sl," zzzz",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
}
|
||||
|
||||
/* Test reverse() and pop_last() */
|
||||
smartlist_reverse(sl);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"the,router,onion,nickm,by,arma,and");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_pop_last(sl);
|
||||
test_streq(cp_alloc, "and");
|
||||
tor_free(cp_alloc);
|
||||
test_eq(smartlist_len(sl), 6);
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
cp_alloc = smartlist_pop_last(sl);
|
||||
test_eq(cp_alloc, NULL);
|
||||
|
||||
/* Test uniq() */
|
||||
smartlist_split_string(sl,
|
||||
"50,noon,radar,a,man,a,plan,a,canal,panama,radar,noon,50",
|
||||
",", 0, 0);
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
smartlist_uniq(sl, _compare_strs, _tor_free);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc, "50,a,canal,man,noon,panama,plan,radar");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
/* Test string_isin and isin_case and num_isin */
|
||||
test_assert(smartlist_string_isin(sl, "noon"));
|
||||
test_assert(!smartlist_string_isin(sl, "noonoon"));
|
||||
test_assert(smartlist_string_isin_case(sl, "nOOn"));
|
||||
test_assert(!smartlist_string_isin_case(sl, "nooNooN"));
|
||||
test_assert(smartlist_string_num_isin(sl, 50));
|
||||
test_assert(!smartlist_string_num_isin(sl, 60));
|
||||
|
||||
/* Test smartlist_choose */
|
||||
{
|
||||
int i;
|
||||
int allsame = 1;
|
||||
int allin = 1;
|
||||
void *first = smartlist_choose(sl);
|
||||
test_assert(smartlist_isin(sl, first));
|
||||
for (i = 0; i < 100; ++i) {
|
||||
void *second = smartlist_choose(sl);
|
||||
if (second != first)
|
||||
allsame = 0;
|
||||
if (!smartlist_isin(sl, second))
|
||||
allin = 0;
|
||||
}
|
||||
test_assert(!allsame);
|
||||
test_assert(allin);
|
||||
}
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
/* Test string_remove and remove and join_strings2 */
|
||||
smartlist_split_string(sl,
|
||||
"Some say the Earth will end in ice and some in fire",
|
||||
" ", 0, 0);
|
||||
cp = smartlist_get(sl, 4);
|
||||
test_streq(cp, "will");
|
||||
smartlist_add(sl, cp);
|
||||
smartlist_remove(sl, cp);
|
||||
tor_free(cp);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc, "Some,say,the,Earth,fire,end,in,ice,and,some,in");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_string_remove(sl, "in");
|
||||
cp_alloc = smartlist_join_strings2(sl, "+XX", 1, 0, &sz);
|
||||
test_streq(cp_alloc, "Some+say+the+Earth+fire+end+some+ice+and");
|
||||
test_eq((int)sz, 40);
|
||||
|
||||
done:
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
tor_free(cp_alloc);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist set manipulation functions. */
|
||||
static void
|
||||
test_util_smartlist_overlap(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
smartlist_t *ints = smartlist_create();
|
||||
smartlist_t *odds = smartlist_create();
|
||||
smartlist_t *evens = smartlist_create();
|
||||
smartlist_t *primes = smartlist_create();
|
||||
int i;
|
||||
for (i=1; i < 10; i += 2)
|
||||
smartlist_add(odds, (void*)(uintptr_t)i);
|
||||
for (i=0; i < 10; i += 2)
|
||||
smartlist_add(evens, (void*)(uintptr_t)i);
|
||||
|
||||
/* add_all */
|
||||
smartlist_add_all(ints, odds);
|
||||
smartlist_add_all(ints, evens);
|
||||
test_eq(smartlist_len(ints), 10);
|
||||
|
||||
smartlist_add(primes, (void*)2);
|
||||
smartlist_add(primes, (void*)3);
|
||||
smartlist_add(primes, (void*)5);
|
||||
smartlist_add(primes, (void*)7);
|
||||
|
||||
/* overlap */
|
||||
test_assert(smartlist_overlap(ints, odds));
|
||||
test_assert(smartlist_overlap(odds, primes));
|
||||
test_assert(smartlist_overlap(evens, primes));
|
||||
test_assert(!smartlist_overlap(odds, evens));
|
||||
|
||||
/* intersect */
|
||||
smartlist_add_all(sl, odds);
|
||||
smartlist_intersect(sl, primes);
|
||||
test_eq(smartlist_len(sl), 3);
|
||||
test_assert(smartlist_isin(sl, (void*)3));
|
||||
test_assert(smartlist_isin(sl, (void*)5));
|
||||
test_assert(smartlist_isin(sl, (void*)7));
|
||||
|
||||
/* subtract */
|
||||
smartlist_add_all(sl, primes);
|
||||
smartlist_subtract(sl, odds);
|
||||
test_eq(smartlist_len(sl), 1);
|
||||
test_assert(smartlist_isin(sl, (void*)2));
|
||||
|
||||
done:
|
||||
smartlist_free(odds);
|
||||
smartlist_free(evens);
|
||||
smartlist_free(ints);
|
||||
smartlist_free(primes);
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist-of-digests functions. */
|
||||
static void
|
||||
test_util_smartlist_digests(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
|
||||
/* digest_isin. */
|
||||
smartlist_add(sl, tor_memdup("AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN));
|
||||
smartlist_add(sl, tor_memdup("\00090AAB2AAAAaasdAAAAA", DIGEST_LEN));
|
||||
smartlist_add(sl, tor_memdup("\00090AAB2AAAAaasdAAAAA", DIGEST_LEN));
|
||||
test_eq(0, smartlist_digest_isin(NULL, "AAAAAAAAAAAAAAAAAAAA"));
|
||||
test_assert(smartlist_digest_isin(sl, "AAAAAAAAAAAAAAAAAAAA"));
|
||||
test_assert(smartlist_digest_isin(sl, "\00090AAB2AAAAaasdAAAAA"));
|
||||
test_eq(0, smartlist_digest_isin(sl, "\00090AAB2AAABaasdAAAAA"));
|
||||
|
||||
/* sort digests */
|
||||
smartlist_sort_digests(sl);
|
||||
test_memeq(smartlist_get(sl, 0), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 1), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 2), "AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
|
||||
/* uniq_digests */
|
||||
smartlist_uniq_digests(sl);
|
||||
test_eq(2, smartlist_len(sl));
|
||||
test_memeq(smartlist_get(sl, 0), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 1), "AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN);
|
||||
|
||||
done:
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for concatenate-a-smartlist-of-strings functions. */
|
||||
static void
|
||||
test_util_smartlist_join(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
smartlist_t *sl2 = smartlist_create(), *sl3 = smartlist_create(),
|
||||
*sl4 = smartlist_create();
|
||||
char *joined=NULL;
|
||||
/* unique, sorted. */
|
||||
smartlist_split_string(sl,
|
||||
"Abashments Ambush Anchorman Bacon Banks Borscht "
|
||||
"Bunks Inhumane Insurance Knish Know Manners "
|
||||
"Maraschinos Stamina Sunbonnets Unicorns Wombats",
|
||||
" ", 0, 0);
|
||||
/* non-unique, sorted. */
|
||||
smartlist_split_string(sl2,
|
||||
"Ambush Anchorman Anchorman Anemias Anemias Bacon "
|
||||
"Crossbowmen Inhumane Insurance Knish Know Manners "
|
||||
"Manners Maraschinos Wombats Wombats Work",
|
||||
" ", 0, 0);
|
||||
SMARTLIST_FOREACH_JOIN(sl, char *, cp1,
|
||||
sl2, char *, cp2,
|
||||
strcmp(cp1,cp2),
|
||||
smartlist_add(sl3, cp2)) {
|
||||
test_streq(cp1, cp2);
|
||||
smartlist_add(sl4, cp1);
|
||||
} SMARTLIST_FOREACH_JOIN_END(cp1, cp2);
|
||||
|
||||
SMARTLIST_FOREACH(sl3, const char *, cp,
|
||||
test_assert(smartlist_isin(sl2, cp) &&
|
||||
!smartlist_string_isin(sl, cp)));
|
||||
SMARTLIST_FOREACH(sl4, const char *, cp,
|
||||
test_assert(smartlist_isin(sl, cp) &&
|
||||
smartlist_string_isin(sl2, cp)));
|
||||
joined = smartlist_join_strings(sl3, ",", 0, NULL);
|
||||
test_streq(joined, "Anemias,Anemias,Crossbowmen,Work");
|
||||
tor_free(joined);
|
||||
joined = smartlist_join_strings(sl4, ",", 0, NULL);
|
||||
test_streq(joined, "Ambush,Anchorman,Anchorman,Bacon,Inhumane,Insurance,"
|
||||
"Knish,Know,Manners,Manners,Maraschinos,Wombats,Wombats");
|
||||
tor_free(joined);
|
||||
|
||||
done:
|
||||
smartlist_free(sl4);
|
||||
smartlist_free(sl3);
|
||||
SMARTLIST_FOREACH(sl2, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl2);
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
tor_free(joined);
|
||||
}
|
||||
|
||||
/** Run unit tests for bitarray code */
|
||||
static void
|
||||
test_util_bitarray(void)
|
||||
{
|
||||
bitarray_t *ba = NULL;
|
||||
int i, j, ok=1;
|
||||
|
||||
ba = bitarray_init_zero(1);
|
||||
test_assert(ba);
|
||||
test_assert(! bitarray_is_set(ba, 0));
|
||||
bitarray_set(ba, 0);
|
||||
test_assert(bitarray_is_set(ba, 0));
|
||||
bitarray_clear(ba, 0);
|
||||
test_assert(! bitarray_is_set(ba, 0));
|
||||
bitarray_free(ba);
|
||||
|
||||
ba = bitarray_init_zero(1023);
|
||||
for (i = 1; i < 64; ) {
|
||||
for (j = 0; j < 1023; ++j) {
|
||||
if (j % i)
|
||||
bitarray_set(ba, j);
|
||||
else
|
||||
bitarray_clear(ba, j);
|
||||
}
|
||||
for (j = 0; j < 1023; ++j) {
|
||||
if (!bool_eq(bitarray_is_set(ba, j), j%i))
|
||||
ok = 0;
|
||||
}
|
||||
test_assert(ok);
|
||||
if (i < 7)
|
||||
++i;
|
||||
else if (i == 28)
|
||||
i = 32;
|
||||
else
|
||||
i += 7;
|
||||
}
|
||||
|
||||
done:
|
||||
if (ba)
|
||||
bitarray_free(ba);
|
||||
}
|
||||
|
||||
/** Run unit tests for digest set code (implemented as a hashtable or as a
|
||||
* bloom filter) */
|
||||
static void
|
||||
test_util_digestset(void)
|
||||
{
|
||||
smartlist_t *included = smartlist_create();
|
||||
char d[DIGEST_LEN];
|
||||
int i;
|
||||
int ok = 1;
|
||||
int false_positives = 0;
|
||||
digestset_t *set = NULL;
|
||||
|
||||
for (i = 0; i < 1000; ++i) {
|
||||
crypto_rand(d, DIGEST_LEN);
|
||||
smartlist_add(included, tor_memdup(d, DIGEST_LEN));
|
||||
}
|
||||
set = digestset_new(1000);
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
if (digestset_isin(set, cp))
|
||||
ok = 0);
|
||||
test_assert(ok);
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
digestset_add(set, cp));
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
if (!digestset_isin(set, cp))
|
||||
ok = 0);
|
||||
test_assert(ok);
|
||||
for (i = 0; i < 1000; ++i) {
|
||||
crypto_rand(d, DIGEST_LEN);
|
||||
if (digestset_isin(set, d))
|
||||
++false_positives;
|
||||
}
|
||||
test_assert(false_positives < 50); /* Should be far lower. */
|
||||
|
||||
done:
|
||||
if (set)
|
||||
digestset_free(set);
|
||||
SMARTLIST_FOREACH(included, char *, cp, tor_free(cp));
|
||||
smartlist_free(included);
|
||||
}
|
||||
|
||||
/** mutex for thread test to stop the threads hitting data at the same time. */
|
||||
static tor_mutex_t *_thread_test_mutex = NULL;
|
||||
/** mutexes for the thread test to make sure that the threads have to
|
||||
@ -1862,70 +1354,6 @@ test_util_threads(void)
|
||||
tor_mutex_free(_thread_test_start2);
|
||||
}
|
||||
|
||||
/** Helper: return a tristate based on comparing two strings. */
|
||||
static int
|
||||
_compare_strings_for_pqueue(const void *s1, const void *s2)
|
||||
{
|
||||
return strcmp((const char*)s1, (const char*)s2);
|
||||
}
|
||||
|
||||
/** Run unit tests for heap-based priority queue functions. */
|
||||
static void
|
||||
test_util_pqueue(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
int (*cmp)(const void *, const void*);
|
||||
#define OK() smartlist_pqueue_assert_ok(sl, cmp)
|
||||
|
||||
cmp = _compare_strings_for_pqueue;
|
||||
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"cows");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"zebras");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"fish");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"frogs");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"apples");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"squid");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"daschunds");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"eggplants");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"weissbier");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"lobsters");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"roquefort");
|
||||
|
||||
OK();
|
||||
|
||||
test_eq(smartlist_len(sl), 11);
|
||||
test_streq(smartlist_get(sl, 0), "apples");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "apples");
|
||||
test_eq(smartlist_len(sl), 10);
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "cows");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "daschunds");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"chinchillas");
|
||||
OK();
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"fireflies");
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "chinchillas");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "eggplants");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "fireflies");
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "fish");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "frogs");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "lobsters");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "roquefort");
|
||||
OK();
|
||||
test_eq(smartlist_len(sl), 3);
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "squid");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "weissbier");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "zebras");
|
||||
test_eq(smartlist_len(sl), 0);
|
||||
OK();
|
||||
#undef OK
|
||||
|
||||
done:
|
||||
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for compression functions */
|
||||
static void
|
||||
test_util_gzip(void)
|
||||
@ -2033,97 +1461,6 @@ test_util_gzip(void)
|
||||
tor_free(buf1);
|
||||
}
|
||||
|
||||
/** Run unit tests for string-to-void* map functions */
|
||||
static void
|
||||
test_util_strmap(void)
|
||||
{
|
||||
strmap_t *map;
|
||||
strmap_iter_t *iter;
|
||||
const char *k;
|
||||
void *v;
|
||||
char *visited = NULL;
|
||||
smartlist_t *found_keys = NULL;
|
||||
|
||||
map = strmap_new();
|
||||
test_assert(map);
|
||||
test_eq(strmap_size(map), 0);
|
||||
test_assert(strmap_isempty(map));
|
||||
v = strmap_set(map, "K1", (void*)99);
|
||||
test_eq(v, NULL);
|
||||
test_assert(!strmap_isempty(map));
|
||||
v = strmap_set(map, "K2", (void*)101);
|
||||
test_eq(v, NULL);
|
||||
v = strmap_set(map, "K1", (void*)100);
|
||||
test_eq(v, (void*)99);
|
||||
test_eq_ptr(strmap_get(map,"K1"), (void*)100);
|
||||
test_eq_ptr(strmap_get(map,"K2"), (void*)101);
|
||||
test_eq_ptr(strmap_get(map,"K-not-there"), NULL);
|
||||
strmap_assert_ok(map);
|
||||
|
||||
v = strmap_remove(map,"K2");
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(v, (void*)101);
|
||||
test_eq_ptr(strmap_get(map,"K2"), NULL);
|
||||
test_eq_ptr(strmap_remove(map,"K2"), NULL);
|
||||
|
||||
strmap_set(map, "K2", (void*)101);
|
||||
strmap_set(map, "K3", (void*)102);
|
||||
strmap_set(map, "K4", (void*)103);
|
||||
test_eq(strmap_size(map), 4);
|
||||
strmap_assert_ok(map);
|
||||
strmap_set(map, "K5", (void*)104);
|
||||
strmap_set(map, "K6", (void*)105);
|
||||
strmap_assert_ok(map);
|
||||
|
||||
/* Test iterator. */
|
||||
iter = strmap_iter_init(map);
|
||||
found_keys = smartlist_create();
|
||||
while (!strmap_iter_done(iter)) {
|
||||
strmap_iter_get(iter,&k,&v);
|
||||
smartlist_add(found_keys, tor_strdup(k));
|
||||
test_eq_ptr(v, strmap_get(map, k));
|
||||
|
||||
if (!strcmp(k, "K2")) {
|
||||
iter = strmap_iter_next_rmv(map,iter);
|
||||
} else {
|
||||
iter = strmap_iter_next(map,iter);
|
||||
}
|
||||
}
|
||||
|
||||
/* Make sure we removed K2, but not the others. */
|
||||
test_eq_ptr(strmap_get(map, "K2"), NULL);
|
||||
test_eq_ptr(strmap_get(map, "K5"), (void*)104);
|
||||
/* Make sure we visited everyone once */
|
||||
smartlist_sort_strings(found_keys);
|
||||
visited = smartlist_join_strings(found_keys, ":", 0, NULL);
|
||||
test_streq(visited, "K1:K2:K3:K4:K5:K6");
|
||||
|
||||
strmap_assert_ok(map);
|
||||
/* Clean up after ourselves. */
|
||||
strmap_free(map, NULL);
|
||||
map = NULL;
|
||||
|
||||
/* Now try some lc functions. */
|
||||
map = strmap_new();
|
||||
strmap_set_lc(map,"Ab.C", (void*)1);
|
||||
test_eq_ptr(strmap_get(map,"ab.c"), (void*)1);
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(strmap_get_lc(map,"AB.C"), (void*)1);
|
||||
test_eq_ptr(strmap_get(map,"AB.C"), NULL);
|
||||
test_eq_ptr(strmap_remove_lc(map,"aB.C"), (void*)1);
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(strmap_get_lc(map,"AB.C"), NULL);
|
||||
|
||||
done:
|
||||
if (map)
|
||||
strmap_free(map,NULL);
|
||||
if (found_keys) {
|
||||
SMARTLIST_FOREACH(found_keys, char *, cp, tor_free(cp));
|
||||
smartlist_free(found_keys);
|
||||
}
|
||||
tor_free(visited);
|
||||
}
|
||||
|
||||
/** Run unit tests for mmap() wrapper functionality. */
|
||||
static void
|
||||
test_util_mmap(void)
|
||||
@ -3025,36 +2362,6 @@ test_same_voter(networkstatus_voter_info_t *v1,
|
||||
;
|
||||
}
|
||||
|
||||
/** Run unit tests for getting the median of a list. */
|
||||
static void
|
||||
test_util_order_functions(void)
|
||||
{
|
||||
int lst[25], n = 0;
|
||||
// int a=12,b=24,c=25,d=60,e=77;
|
||||
|
||||
#define median() median_int(lst, n)
|
||||
|
||||
lst[n++] = 12;
|
||||
test_eq(12, median()); /* 12 */
|
||||
lst[n++] = 77;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(12, median()); /* 12, 77 */
|
||||
lst[n++] = 77;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(77, median()); /* 12, 77, 77 */
|
||||
lst[n++] = 24;
|
||||
test_eq(24, median()); /* 12,24,77,77 */
|
||||
lst[n++] = 60;
|
||||
lst[n++] = 12;
|
||||
lst[n++] = 25;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(25, median()); /* 12,12,24,25,60,77,77 */
|
||||
#undef median
|
||||
|
||||
done:
|
||||
;
|
||||
}
|
||||
|
||||
/** Helper: Make a new routerinfo containing the right information for a
|
||||
* given vote_routerstatus_t. */
|
||||
static routerinfo_t *
|
||||
@ -4322,21 +3629,11 @@ static struct testcase_t test_array[] = {
|
||||
SUBENT(util, ip6_helpers),
|
||||
SUBENT(util, gzip),
|
||||
SUBENT(util, datadir),
|
||||
SUBENT(util, smartlist_basic),
|
||||
SUBENT(util, smartlist_strings),
|
||||
SUBENT(util, smartlist_overlap),
|
||||
SUBENT(util, smartlist_digests),
|
||||
SUBENT(util, smartlist_join),
|
||||
SUBENT(util, bitarray),
|
||||
SUBENT(util, digestset),
|
||||
SUBENT(util, mempool),
|
||||
SUBENT(util, memarea),
|
||||
SUBENT(util, strmap),
|
||||
SUBENT(util, control_formats),
|
||||
SUBENT(util, pqueue),
|
||||
SUBENT(util, mmap),
|
||||
SUBENT(util, threads),
|
||||
SUBENT(util, order_functions),
|
||||
SUBENT(util, sscanf),
|
||||
SUBENT(util, strtok),
|
||||
ENT(onion_handshake),
|
||||
@ -4356,10 +3653,12 @@ static struct testcase_t test_array[] = {
|
||||
};
|
||||
|
||||
extern struct testcase_t crypto_tests[];
|
||||
extern struct testcase_t container_tests[];
|
||||
|
||||
static struct testgroup_t testgroups[] = {
|
||||
{ "", test_array },
|
||||
{ "crypto/", crypto_tests },
|
||||
{ "container/", container_tests },
|
||||
END_OF_GROUPS
|
||||
};
|
||||
|
||||
|
||||
719
src/test/test_containers.c
Normal file
719
src/test/test_containers.c
Normal file
@ -0,0 +1,719 @@
|
||||
/* Copyright (c) 2001-2004, Roger Dingledine.
|
||||
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
|
||||
* Copyright (c) 2007-2009, The Tor Project, Inc. */
|
||||
/* See LICENSE for licensing information */
|
||||
|
||||
#include "orconfig.h"
|
||||
#include "or.h"
|
||||
#include "test.h"
|
||||
|
||||
/** Helper: return a tristate based on comparing the strings in *<b>a</b> and
|
||||
* *<b>b</b>. */
|
||||
static int
|
||||
_compare_strs(const void **a, const void **b)
|
||||
{
|
||||
const char *s1 = *a, *s2 = *b;
|
||||
return strcmp(s1, s2);
|
||||
}
|
||||
|
||||
/** Helper: return a tristate based on comparing the strings in *<b>a</b> and
|
||||
* *<b>b</b>, excluding a's first character, and ignoring case. */
|
||||
static int
|
||||
_compare_without_first_ch(const void *a, const void **b)
|
||||
{
|
||||
const char *s1 = a, *s2 = *b;
|
||||
return strcasecmp(s1+1, s2);
|
||||
}
|
||||
|
||||
/** Run unit tests for basic dynamic-sized array functionality. */
|
||||
static void
|
||||
test_container_smartlist_basic(void)
|
||||
{
|
||||
smartlist_t *sl;
|
||||
|
||||
/* XXXX test sort_digests, uniq_strings, uniq_digests */
|
||||
|
||||
/* Test smartlist add, del_keeporder, insert, get. */
|
||||
sl = smartlist_create();
|
||||
smartlist_add(sl, (void*)1);
|
||||
smartlist_add(sl, (void*)2);
|
||||
smartlist_add(sl, (void*)3);
|
||||
smartlist_add(sl, (void*)4);
|
||||
smartlist_del_keeporder(sl, 1);
|
||||
smartlist_insert(sl, 1, (void*)22);
|
||||
smartlist_insert(sl, 0, (void*)0);
|
||||
smartlist_insert(sl, 5, (void*)555);
|
||||
test_eq_ptr((void*)0, smartlist_get(sl,0));
|
||||
test_eq_ptr((void*)1, smartlist_get(sl,1));
|
||||
test_eq_ptr((void*)22, smartlist_get(sl,2));
|
||||
test_eq_ptr((void*)3, smartlist_get(sl,3));
|
||||
test_eq_ptr((void*)4, smartlist_get(sl,4));
|
||||
test_eq_ptr((void*)555, smartlist_get(sl,5));
|
||||
/* Try deleting in the middle. */
|
||||
smartlist_del(sl, 1);
|
||||
test_eq_ptr((void*)555, smartlist_get(sl, 1));
|
||||
/* Try deleting at the end. */
|
||||
smartlist_del(sl, 4);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
|
||||
/* test isin. */
|
||||
test_assert(smartlist_isin(sl, (void*)3));
|
||||
test_assert(!smartlist_isin(sl, (void*)99));
|
||||
|
||||
done:
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist-of-strings functionality. */
|
||||
static void
|
||||
test_container_smartlist_strings(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
char *cp=NULL, *cp_alloc=NULL;
|
||||
size_t sz;
|
||||
|
||||
/* Test split and join */
|
||||
test_eq(0, smartlist_len(sl));
|
||||
smartlist_split_string(sl, "abc", ":", 0, 0);
|
||||
test_eq(1, smartlist_len(sl));
|
||||
test_streq("abc", smartlist_get(sl, 0));
|
||||
smartlist_split_string(sl, "a::bc::", "::", 0, 0);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
test_streq("a", smartlist_get(sl, 1));
|
||||
test_streq("bc", smartlist_get(sl, 2));
|
||||
test_streq("", smartlist_get(sl, 3));
|
||||
cp_alloc = smartlist_join_strings(sl, "", 0, NULL);
|
||||
test_streq(cp_alloc, "abcabc");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "!", 0, NULL);
|
||||
test_streq(cp_alloc, "abc!a!bc!");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 0, NULL);
|
||||
test_streq(cp_alloc, "abcXYaXYbcXY");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 1, NULL);
|
||||
test_streq(cp_alloc, "abcXYaXYbcXYXY");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "", 1, NULL);
|
||||
test_streq(cp_alloc, "abcabc");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
smartlist_split_string(sl, "/def/ /ghijk", "/", 0, 0);
|
||||
test_eq(8, smartlist_len(sl));
|
||||
test_streq("", smartlist_get(sl, 4));
|
||||
test_streq("def", smartlist_get(sl, 5));
|
||||
test_streq(" ", smartlist_get(sl, 6));
|
||||
test_streq("ghijk", smartlist_get(sl, 7));
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, "a,bbd,cdef", ",", SPLIT_SKIP_SPACE, 0);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
test_streq("a", smartlist_get(sl,0));
|
||||
test_streq("bbd", smartlist_get(sl,1));
|
||||
test_streq("cdef", smartlist_get(sl,2));
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE, 0);
|
||||
test_eq(8, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl,3));
|
||||
test_streq("zhasd", smartlist_get(sl,4));
|
||||
test_streq("", smartlist_get(sl,5));
|
||||
test_streq("bnud", smartlist_get(sl,6));
|
||||
test_streq("", smartlist_get(sl,7));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, " ab\tc \td ef ", NULL,
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(4, smartlist_len(sl));
|
||||
test_streq("ab", smartlist_get(sl,0));
|
||||
test_streq("c", smartlist_get(sl,1));
|
||||
test_streq("d", smartlist_get(sl,2));
|
||||
test_streq("ef", smartlist_get(sl,3));
|
||||
smartlist_split_string(sl, "ghi\tj", NULL,
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(6, smartlist_len(sl));
|
||||
test_streq("ghi", smartlist_get(sl,4));
|
||||
test_streq("j", smartlist_get(sl,5));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 0, NULL);
|
||||
test_streq(cp_alloc, "");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_join_strings(sl, "XY", 1, NULL);
|
||||
test_streq(cp_alloc, "XY");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl, 0));
|
||||
test_streq("zhasd", smartlist_get(sl, 1));
|
||||
test_streq("bnud", smartlist_get(sl, 2));
|
||||
smartlist_split_string(sl, " z <> zhasd <> <> bnud<> ", "<>",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 2);
|
||||
test_eq(5, smartlist_len(sl));
|
||||
test_streq("z", smartlist_get(sl, 3));
|
||||
test_streq("zhasd <> <> bnud<>", smartlist_get(sl, 4));
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
smartlist_split_string(sl, "abcd\n", "\n",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(1, smartlist_len(sl));
|
||||
test_streq("abcd", smartlist_get(sl, 0));
|
||||
smartlist_split_string(sl, "efgh", "\n",
|
||||
SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 0);
|
||||
test_eq(2, smartlist_len(sl));
|
||||
test_streq("efgh", smartlist_get(sl, 1));
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
/* Test swapping, shuffling, and sorting. */
|
||||
smartlist_split_string(sl, "the,onion,router,by,arma,and,nickm", ",", 0, 0);
|
||||
test_eq(7, smartlist_len(sl));
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"and,arma,by,nickm,onion,router,the");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_swap(sl, 1, 5);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"and,router,by,nickm,onion,arma,the");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_shuffle(sl);
|
||||
test_eq(7, smartlist_len(sl));
|
||||
test_assert(smartlist_string_isin(sl, "and"));
|
||||
test_assert(smartlist_string_isin(sl, "router"));
|
||||
test_assert(smartlist_string_isin(sl, "by"));
|
||||
test_assert(smartlist_string_isin(sl, "nickm"));
|
||||
test_assert(smartlist_string_isin(sl, "onion"));
|
||||
test_assert(smartlist_string_isin(sl, "arma"));
|
||||
test_assert(smartlist_string_isin(sl, "the"));
|
||||
|
||||
/* Test bsearch. */
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
test_streq("nickm", smartlist_bsearch(sl, "zNicKM",
|
||||
_compare_without_first_ch));
|
||||
test_streq("and", smartlist_bsearch(sl, " AND", _compare_without_first_ch));
|
||||
test_eq_ptr(NULL, smartlist_bsearch(sl, " ANz", _compare_without_first_ch));
|
||||
|
||||
/* Test bsearch_idx */
|
||||
{
|
||||
int f;
|
||||
test_eq(0, smartlist_bsearch_idx(sl," aaa",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(0, smartlist_bsearch_idx(sl," and",_compare_without_first_ch,&f));
|
||||
test_eq(f, 1);
|
||||
test_eq(1, smartlist_bsearch_idx(sl," arm",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(1, smartlist_bsearch_idx(sl," arma",_compare_without_first_ch,&f));
|
||||
test_eq(f, 1);
|
||||
test_eq(2, smartlist_bsearch_idx(sl," armb",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
test_eq(7, smartlist_bsearch_idx(sl," zzzz",_compare_without_first_ch,&f));
|
||||
test_eq(f, 0);
|
||||
}
|
||||
|
||||
/* Test reverse() and pop_last() */
|
||||
smartlist_reverse(sl);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc,"the,router,onion,nickm,by,arma,and");
|
||||
tor_free(cp_alloc);
|
||||
cp_alloc = smartlist_pop_last(sl);
|
||||
test_streq(cp_alloc, "and");
|
||||
tor_free(cp_alloc);
|
||||
test_eq(smartlist_len(sl), 6);
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
cp_alloc = smartlist_pop_last(sl);
|
||||
test_eq(cp_alloc, NULL);
|
||||
|
||||
/* Test uniq() */
|
||||
smartlist_split_string(sl,
|
||||
"50,noon,radar,a,man,a,plan,a,canal,panama,radar,noon,50",
|
||||
",", 0, 0);
|
||||
smartlist_sort(sl, _compare_strs);
|
||||
smartlist_uniq(sl, _compare_strs, _tor_free);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc, "50,a,canal,man,noon,panama,plan,radar");
|
||||
tor_free(cp_alloc);
|
||||
|
||||
/* Test string_isin and isin_case and num_isin */
|
||||
test_assert(smartlist_string_isin(sl, "noon"));
|
||||
test_assert(!smartlist_string_isin(sl, "noonoon"));
|
||||
test_assert(smartlist_string_isin_case(sl, "nOOn"));
|
||||
test_assert(!smartlist_string_isin_case(sl, "nooNooN"));
|
||||
test_assert(smartlist_string_num_isin(sl, 50));
|
||||
test_assert(!smartlist_string_num_isin(sl, 60));
|
||||
|
||||
/* Test smartlist_choose */
|
||||
{
|
||||
int i;
|
||||
int allsame = 1;
|
||||
int allin = 1;
|
||||
void *first = smartlist_choose(sl);
|
||||
test_assert(smartlist_isin(sl, first));
|
||||
for (i = 0; i < 100; ++i) {
|
||||
void *second = smartlist_choose(sl);
|
||||
if (second != first)
|
||||
allsame = 0;
|
||||
if (!smartlist_isin(sl, second))
|
||||
allin = 0;
|
||||
}
|
||||
test_assert(!allsame);
|
||||
test_assert(allin);
|
||||
}
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_clear(sl);
|
||||
|
||||
/* Test string_remove and remove and join_strings2 */
|
||||
smartlist_split_string(sl,
|
||||
"Some say the Earth will end in ice and some in fire",
|
||||
" ", 0, 0);
|
||||
cp = smartlist_get(sl, 4);
|
||||
test_streq(cp, "will");
|
||||
smartlist_add(sl, cp);
|
||||
smartlist_remove(sl, cp);
|
||||
tor_free(cp);
|
||||
cp_alloc = smartlist_join_strings(sl, ",", 0, NULL);
|
||||
test_streq(cp_alloc, "Some,say,the,Earth,fire,end,in,ice,and,some,in");
|
||||
tor_free(cp_alloc);
|
||||
smartlist_string_remove(sl, "in");
|
||||
cp_alloc = smartlist_join_strings2(sl, "+XX", 1, 0, &sz);
|
||||
test_streq(cp_alloc, "Some+say+the+Earth+fire+end+some+ice+and");
|
||||
test_eq((int)sz, 40);
|
||||
|
||||
done:
|
||||
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
tor_free(cp_alloc);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist set manipulation functions. */
|
||||
static void
|
||||
test_container_smartlist_overlap(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
smartlist_t *ints = smartlist_create();
|
||||
smartlist_t *odds = smartlist_create();
|
||||
smartlist_t *evens = smartlist_create();
|
||||
smartlist_t *primes = smartlist_create();
|
||||
int i;
|
||||
for (i=1; i < 10; i += 2)
|
||||
smartlist_add(odds, (void*)(uintptr_t)i);
|
||||
for (i=0; i < 10; i += 2)
|
||||
smartlist_add(evens, (void*)(uintptr_t)i);
|
||||
|
||||
/* add_all */
|
||||
smartlist_add_all(ints, odds);
|
||||
smartlist_add_all(ints, evens);
|
||||
test_eq(smartlist_len(ints), 10);
|
||||
|
||||
smartlist_add(primes, (void*)2);
|
||||
smartlist_add(primes, (void*)3);
|
||||
smartlist_add(primes, (void*)5);
|
||||
smartlist_add(primes, (void*)7);
|
||||
|
||||
/* overlap */
|
||||
test_assert(smartlist_overlap(ints, odds));
|
||||
test_assert(smartlist_overlap(odds, primes));
|
||||
test_assert(smartlist_overlap(evens, primes));
|
||||
test_assert(!smartlist_overlap(odds, evens));
|
||||
|
||||
/* intersect */
|
||||
smartlist_add_all(sl, odds);
|
||||
smartlist_intersect(sl, primes);
|
||||
test_eq(smartlist_len(sl), 3);
|
||||
test_assert(smartlist_isin(sl, (void*)3));
|
||||
test_assert(smartlist_isin(sl, (void*)5));
|
||||
test_assert(smartlist_isin(sl, (void*)7));
|
||||
|
||||
/* subtract */
|
||||
smartlist_add_all(sl, primes);
|
||||
smartlist_subtract(sl, odds);
|
||||
test_eq(smartlist_len(sl), 1);
|
||||
test_assert(smartlist_isin(sl, (void*)2));
|
||||
|
||||
done:
|
||||
smartlist_free(odds);
|
||||
smartlist_free(evens);
|
||||
smartlist_free(ints);
|
||||
smartlist_free(primes);
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for smartlist-of-digests functions. */
|
||||
static void
|
||||
test_container_smartlist_digests(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
|
||||
/* digest_isin. */
|
||||
smartlist_add(sl, tor_memdup("AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN));
|
||||
smartlist_add(sl, tor_memdup("\00090AAB2AAAAaasdAAAAA", DIGEST_LEN));
|
||||
smartlist_add(sl, tor_memdup("\00090AAB2AAAAaasdAAAAA", DIGEST_LEN));
|
||||
test_eq(0, smartlist_digest_isin(NULL, "AAAAAAAAAAAAAAAAAAAA"));
|
||||
test_assert(smartlist_digest_isin(sl, "AAAAAAAAAAAAAAAAAAAA"));
|
||||
test_assert(smartlist_digest_isin(sl, "\00090AAB2AAAAaasdAAAAA"));
|
||||
test_eq(0, smartlist_digest_isin(sl, "\00090AAB2AAABaasdAAAAA"));
|
||||
|
||||
/* sort digests */
|
||||
smartlist_sort_digests(sl);
|
||||
test_memeq(smartlist_get(sl, 0), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 1), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 2), "AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN);
|
||||
test_eq(3, smartlist_len(sl));
|
||||
|
||||
/* uniq_digests */
|
||||
smartlist_uniq_digests(sl);
|
||||
test_eq(2, smartlist_len(sl));
|
||||
test_memeq(smartlist_get(sl, 0), "\00090AAB2AAAAaasdAAAAA", DIGEST_LEN);
|
||||
test_memeq(smartlist_get(sl, 1), "AAAAAAAAAAAAAAAAAAAA", DIGEST_LEN);
|
||||
|
||||
done:
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for concatenate-a-smartlist-of-strings functions. */
|
||||
static void
|
||||
test_container_smartlist_join(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
smartlist_t *sl2 = smartlist_create(), *sl3 = smartlist_create(),
|
||||
*sl4 = smartlist_create();
|
||||
char *joined=NULL;
|
||||
/* unique, sorted. */
|
||||
smartlist_split_string(sl,
|
||||
"Abashments Ambush Anchorman Bacon Banks Borscht "
|
||||
"Bunks Inhumane Insurance Knish Know Manners "
|
||||
"Maraschinos Stamina Sunbonnets Unicorns Wombats",
|
||||
" ", 0, 0);
|
||||
/* non-unique, sorted. */
|
||||
smartlist_split_string(sl2,
|
||||
"Ambush Anchorman Anchorman Anemias Anemias Bacon "
|
||||
"Crossbowmen Inhumane Insurance Knish Know Manners "
|
||||
"Manners Maraschinos Wombats Wombats Work",
|
||||
" ", 0, 0);
|
||||
SMARTLIST_FOREACH_JOIN(sl, char *, cp1,
|
||||
sl2, char *, cp2,
|
||||
strcmp(cp1,cp2),
|
||||
smartlist_add(sl3, cp2)) {
|
||||
test_streq(cp1, cp2);
|
||||
smartlist_add(sl4, cp1);
|
||||
} SMARTLIST_FOREACH_JOIN_END(cp1, cp2);
|
||||
|
||||
SMARTLIST_FOREACH(sl3, const char *, cp,
|
||||
test_assert(smartlist_isin(sl2, cp) &&
|
||||
!smartlist_string_isin(sl, cp)));
|
||||
SMARTLIST_FOREACH(sl4, const char *, cp,
|
||||
test_assert(smartlist_isin(sl, cp) &&
|
||||
smartlist_string_isin(sl2, cp)));
|
||||
joined = smartlist_join_strings(sl3, ",", 0, NULL);
|
||||
test_streq(joined, "Anemias,Anemias,Crossbowmen,Work");
|
||||
tor_free(joined);
|
||||
joined = smartlist_join_strings(sl4, ",", 0, NULL);
|
||||
test_streq(joined, "Ambush,Anchorman,Anchorman,Bacon,Inhumane,Insurance,"
|
||||
"Knish,Know,Manners,Manners,Maraschinos,Wombats,Wombats");
|
||||
tor_free(joined);
|
||||
|
||||
done:
|
||||
smartlist_free(sl4);
|
||||
smartlist_free(sl3);
|
||||
SMARTLIST_FOREACH(sl2, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl2);
|
||||
SMARTLIST_FOREACH(sl, char *, cp, tor_free(cp));
|
||||
smartlist_free(sl);
|
||||
tor_free(joined);
|
||||
}
|
||||
|
||||
/** Run unit tests for bitarray code */
|
||||
static void
|
||||
test_container_bitarray(void)
|
||||
{
|
||||
bitarray_t *ba = NULL;
|
||||
int i, j, ok=1;
|
||||
|
||||
ba = bitarray_init_zero(1);
|
||||
test_assert(ba);
|
||||
test_assert(! bitarray_is_set(ba, 0));
|
||||
bitarray_set(ba, 0);
|
||||
test_assert(bitarray_is_set(ba, 0));
|
||||
bitarray_clear(ba, 0);
|
||||
test_assert(! bitarray_is_set(ba, 0));
|
||||
bitarray_free(ba);
|
||||
|
||||
ba = bitarray_init_zero(1023);
|
||||
for (i = 1; i < 64; ) {
|
||||
for (j = 0; j < 1023; ++j) {
|
||||
if (j % i)
|
||||
bitarray_set(ba, j);
|
||||
else
|
||||
bitarray_clear(ba, j);
|
||||
}
|
||||
for (j = 0; j < 1023; ++j) {
|
||||
if (!bool_eq(bitarray_is_set(ba, j), j%i))
|
||||
ok = 0;
|
||||
}
|
||||
test_assert(ok);
|
||||
if (i < 7)
|
||||
++i;
|
||||
else if (i == 28)
|
||||
i = 32;
|
||||
else
|
||||
i += 7;
|
||||
}
|
||||
|
||||
done:
|
||||
if (ba)
|
||||
bitarray_free(ba);
|
||||
}
|
||||
|
||||
/** Run unit tests for digest set code (implemented as a hashtable or as a
|
||||
* bloom filter) */
|
||||
static void
|
||||
test_container_digestset(void)
|
||||
{
|
||||
smartlist_t *included = smartlist_create();
|
||||
char d[DIGEST_LEN];
|
||||
int i;
|
||||
int ok = 1;
|
||||
int false_positives = 0;
|
||||
digestset_t *set = NULL;
|
||||
|
||||
for (i = 0; i < 1000; ++i) {
|
||||
crypto_rand(d, DIGEST_LEN);
|
||||
smartlist_add(included, tor_memdup(d, DIGEST_LEN));
|
||||
}
|
||||
set = digestset_new(1000);
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
if (digestset_isin(set, cp))
|
||||
ok = 0);
|
||||
test_assert(ok);
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
digestset_add(set, cp));
|
||||
SMARTLIST_FOREACH(included, const char *, cp,
|
||||
if (!digestset_isin(set, cp))
|
||||
ok = 0);
|
||||
test_assert(ok);
|
||||
for (i = 0; i < 1000; ++i) {
|
||||
crypto_rand(d, DIGEST_LEN);
|
||||
if (digestset_isin(set, d))
|
||||
++false_positives;
|
||||
}
|
||||
test_assert(false_positives < 50); /* Should be far lower. */
|
||||
|
||||
done:
|
||||
if (set)
|
||||
digestset_free(set);
|
||||
SMARTLIST_FOREACH(included, char *, cp, tor_free(cp));
|
||||
smartlist_free(included);
|
||||
}
|
||||
|
||||
/** Helper: return a tristate based on comparing two strings. */
|
||||
static int
|
||||
_compare_strings_for_pqueue(const void *s1, const void *s2)
|
||||
{
|
||||
return strcmp((const char*)s1, (const char*)s2);
|
||||
}
|
||||
|
||||
/** Run unit tests for heap-based priority queue functions. */
|
||||
static void
|
||||
test_container_pqueue(void)
|
||||
{
|
||||
smartlist_t *sl = smartlist_create();
|
||||
int (*cmp)(const void *, const void*);
|
||||
#define OK() smartlist_pqueue_assert_ok(sl, cmp)
|
||||
|
||||
cmp = _compare_strings_for_pqueue;
|
||||
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"cows");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"zebras");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"fish");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"frogs");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"apples");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"squid");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"daschunds");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"eggplants");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"weissbier");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"lobsters");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"roquefort");
|
||||
|
||||
OK();
|
||||
|
||||
test_eq(smartlist_len(sl), 11);
|
||||
test_streq(smartlist_get(sl, 0), "apples");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "apples");
|
||||
test_eq(smartlist_len(sl), 10);
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "cows");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "daschunds");
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"chinchillas");
|
||||
OK();
|
||||
smartlist_pqueue_add(sl, cmp, (char*)"fireflies");
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "chinchillas");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "eggplants");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "fireflies");
|
||||
OK();
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "fish");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "frogs");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "lobsters");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "roquefort");
|
||||
OK();
|
||||
test_eq(smartlist_len(sl), 3);
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "squid");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "weissbier");
|
||||
test_streq(smartlist_pqueue_pop(sl, cmp), "zebras");
|
||||
test_eq(smartlist_len(sl), 0);
|
||||
OK();
|
||||
#undef OK
|
||||
|
||||
done:
|
||||
|
||||
smartlist_free(sl);
|
||||
}
|
||||
|
||||
/** Run unit tests for string-to-void* map functions */
|
||||
static void
|
||||
test_container_strmap(void)
|
||||
{
|
||||
strmap_t *map;
|
||||
strmap_iter_t *iter;
|
||||
const char *k;
|
||||
void *v;
|
||||
char *visited = NULL;
|
||||
smartlist_t *found_keys = NULL;
|
||||
|
||||
map = strmap_new();
|
||||
test_assert(map);
|
||||
test_eq(strmap_size(map), 0);
|
||||
test_assert(strmap_isempty(map));
|
||||
v = strmap_set(map, "K1", (void*)99);
|
||||
test_eq(v, NULL);
|
||||
test_assert(!strmap_isempty(map));
|
||||
v = strmap_set(map, "K2", (void*)101);
|
||||
test_eq(v, NULL);
|
||||
v = strmap_set(map, "K1", (void*)100);
|
||||
test_eq(v, (void*)99);
|
||||
test_eq_ptr(strmap_get(map,"K1"), (void*)100);
|
||||
test_eq_ptr(strmap_get(map,"K2"), (void*)101);
|
||||
test_eq_ptr(strmap_get(map,"K-not-there"), NULL);
|
||||
strmap_assert_ok(map);
|
||||
|
||||
v = strmap_remove(map,"K2");
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(v, (void*)101);
|
||||
test_eq_ptr(strmap_get(map,"K2"), NULL);
|
||||
test_eq_ptr(strmap_remove(map,"K2"), NULL);
|
||||
|
||||
strmap_set(map, "K2", (void*)101);
|
||||
strmap_set(map, "K3", (void*)102);
|
||||
strmap_set(map, "K4", (void*)103);
|
||||
test_eq(strmap_size(map), 4);
|
||||
strmap_assert_ok(map);
|
||||
strmap_set(map, "K5", (void*)104);
|
||||
strmap_set(map, "K6", (void*)105);
|
||||
strmap_assert_ok(map);
|
||||
|
||||
/* Test iterator. */
|
||||
iter = strmap_iter_init(map);
|
||||
found_keys = smartlist_create();
|
||||
while (!strmap_iter_done(iter)) {
|
||||
strmap_iter_get(iter,&k,&v);
|
||||
smartlist_add(found_keys, tor_strdup(k));
|
||||
test_eq_ptr(v, strmap_get(map, k));
|
||||
|
||||
if (!strcmp(k, "K2")) {
|
||||
iter = strmap_iter_next_rmv(map,iter);
|
||||
} else {
|
||||
iter = strmap_iter_next(map,iter);
|
||||
}
|
||||
}
|
||||
|
||||
/* Make sure we removed K2, but not the others. */
|
||||
test_eq_ptr(strmap_get(map, "K2"), NULL);
|
||||
test_eq_ptr(strmap_get(map, "K5"), (void*)104);
|
||||
/* Make sure we visited everyone once */
|
||||
smartlist_sort_strings(found_keys);
|
||||
visited = smartlist_join_strings(found_keys, ":", 0, NULL);
|
||||
test_streq(visited, "K1:K2:K3:K4:K5:K6");
|
||||
|
||||
strmap_assert_ok(map);
|
||||
/* Clean up after ourselves. */
|
||||
strmap_free(map, NULL);
|
||||
map = NULL;
|
||||
|
||||
/* Now try some lc functions. */
|
||||
map = strmap_new();
|
||||
strmap_set_lc(map,"Ab.C", (void*)1);
|
||||
test_eq_ptr(strmap_get(map,"ab.c"), (void*)1);
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(strmap_get_lc(map,"AB.C"), (void*)1);
|
||||
test_eq_ptr(strmap_get(map,"AB.C"), NULL);
|
||||
test_eq_ptr(strmap_remove_lc(map,"aB.C"), (void*)1);
|
||||
strmap_assert_ok(map);
|
||||
test_eq_ptr(strmap_get_lc(map,"AB.C"), NULL);
|
||||
|
||||
done:
|
||||
if (map)
|
||||
strmap_free(map,NULL);
|
||||
if (found_keys) {
|
||||
SMARTLIST_FOREACH(found_keys, char *, cp, tor_free(cp));
|
||||
smartlist_free(found_keys);
|
||||
}
|
||||
tor_free(visited);
|
||||
}
|
||||
|
||||
/** Run unit tests for getting the median of a list. */
|
||||
static void
|
||||
test_container_order_functions(void)
|
||||
{
|
||||
int lst[25], n = 0;
|
||||
// int a=12,b=24,c=25,d=60,e=77;
|
||||
|
||||
#define median() median_int(lst, n)
|
||||
|
||||
lst[n++] = 12;
|
||||
test_eq(12, median()); /* 12 */
|
||||
lst[n++] = 77;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(12, median()); /* 12, 77 */
|
||||
lst[n++] = 77;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(77, median()); /* 12, 77, 77 */
|
||||
lst[n++] = 24;
|
||||
test_eq(24, median()); /* 12,24,77,77 */
|
||||
lst[n++] = 60;
|
||||
lst[n++] = 12;
|
||||
lst[n++] = 25;
|
||||
//smartlist_shuffle(sl);
|
||||
test_eq(25, median()); /* 12,12,24,25,60,77,77 */
|
||||
#undef median
|
||||
|
||||
done:
|
||||
;
|
||||
}
|
||||
|
||||
#define CONTAINER_LEGACY(name) \
|
||||
{ #name, legacy_test_helper, 0, &legacy_setup, test_container_ ## name }
|
||||
|
||||
struct testcase_t container_tests[] = {
|
||||
CONTAINER_LEGACY(smartlist_basic),
|
||||
CONTAINER_LEGACY(smartlist_strings),
|
||||
CONTAINER_LEGACY(smartlist_overlap),
|
||||
CONTAINER_LEGACY(smartlist_digests),
|
||||
CONTAINER_LEGACY(smartlist_join),
|
||||
CONTAINER_LEGACY(bitarray),
|
||||
CONTAINER_LEGACY(digestset),
|
||||
CONTAINER_LEGACY(strmap),
|
||||
CONTAINER_LEGACY(pqueue),
|
||||
CONTAINER_LEGACY(order_functions),
|
||||
END_OF_TESTCASES
|
||||
};
|
||||
|
||||
Loading…
Reference in New Issue
Block a user