mirror of
https://github.com/NLnetLabs/unbound.git
synced 2024-09-22 15:17:09 +00:00
5cfd778608
- fix for refcounting error that could cause fptr_wlist fatal exit in the negative cache rbtree (upcoming 1.1 feature). (Thanks to Attila Nagy for testing). - nicer comments in cachedump about failed RR to string conversion. git-svn-id: file:///svn/unbound/trunk@1342 be551aaa-1e26-0410-a405-d3ace91eadb9
437 lines
14 KiB
C
437 lines
14 KiB
C
/*
|
|
* testcode/unitmain.c - unit test main program for unbound.
|
|
*
|
|
* Copyright (c) 2007, NLnet Labs. All rights reserved.
|
|
*
|
|
* This software is open source.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
*
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* Neither the name of the NLNET LABS nor the names of its contributors may
|
|
* be used to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*/
|
|
/**
|
|
* \file
|
|
* Unit test main program. Calls all the other unit tests.
|
|
* Exits with code 1 on a failure. 0 if all unit tests are successfull.
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "util/log.h"
|
|
#include "testcode/unitmain.h"
|
|
|
|
/** number of tests done */
|
|
int testcount = 0;
|
|
|
|
#include "util/alloc.h"
|
|
/** test alloc code */
|
|
static void
|
|
alloc_test() {
|
|
alloc_special_t *t1, *t2;
|
|
struct alloc_cache major, minor1, minor2;
|
|
int i;
|
|
|
|
alloc_init(&major, NULL, 0);
|
|
alloc_init(&minor1, &major, 0);
|
|
alloc_init(&minor2, &major, 1);
|
|
|
|
t1 = alloc_special_obtain(&minor1);
|
|
alloc_clear(&minor1);
|
|
|
|
alloc_special_release(&minor2, t1);
|
|
t2 = alloc_special_obtain(&minor2);
|
|
unit_assert( t1 == t2 ); /* reused */
|
|
alloc_special_release(&minor2, t1);
|
|
|
|
for(i=0; i<100; i++) {
|
|
t1 = alloc_special_obtain(&minor1);
|
|
alloc_special_release(&minor2, t1);
|
|
}
|
|
if(0) {
|
|
alloc_stats(&minor1);
|
|
alloc_stats(&minor2);
|
|
alloc_stats(&major);
|
|
}
|
|
/* reuse happened */
|
|
unit_assert(minor1.num_quar + minor2.num_quar + major.num_quar == 11);
|
|
|
|
alloc_clear(&minor1);
|
|
alloc_clear(&minor2);
|
|
unit_assert(major.num_quar == 11);
|
|
alloc_clear(&major);
|
|
}
|
|
|
|
#include "util/net_help.h"
|
|
/** test net code */
|
|
static void
|
|
net_test()
|
|
{
|
|
const char* t4[] = {"\000\000\000\000",
|
|
"\200\000\000\000",
|
|
"\300\000\000\000",
|
|
"\340\000\000\000",
|
|
"\360\000\000\000",
|
|
"\370\000\000\000",
|
|
"\374\000\000\000",
|
|
"\376\000\000\000",
|
|
"\377\000\000\000",
|
|
"\377\200\000\000",
|
|
"\377\300\000\000",
|
|
"\377\340\000\000",
|
|
"\377\360\000\000",
|
|
"\377\370\000\000",
|
|
"\377\374\000\000",
|
|
"\377\376\000\000",
|
|
"\377\377\000\000",
|
|
"\377\377\200\000",
|
|
"\377\377\300\000",
|
|
"\377\377\340\000",
|
|
"\377\377\360\000",
|
|
"\377\377\370\000",
|
|
"\377\377\374\000",
|
|
"\377\377\376\000",
|
|
"\377\377\377\000",
|
|
"\377\377\377\200",
|
|
"\377\377\377\300",
|
|
"\377\377\377\340",
|
|
"\377\377\377\360",
|
|
"\377\377\377\370",
|
|
"\377\377\377\374",
|
|
"\377\377\377\376",
|
|
"\377\377\377\377",
|
|
"\377\377\377\377",
|
|
"\377\377\377\377",
|
|
};
|
|
unit_assert( str_is_ip6("::") );
|
|
unit_assert( str_is_ip6("::1") );
|
|
unit_assert( str_is_ip6("2001:7b8:206:1:240:f4ff:fe37:8810") );
|
|
unit_assert( str_is_ip6("fe80::240:f4ff:fe37:8810") );
|
|
unit_assert( !str_is_ip6("0.0.0.0") );
|
|
unit_assert( !str_is_ip6("213.154.224.12") );
|
|
unit_assert( !str_is_ip6("213.154.224.255") );
|
|
unit_assert( !str_is_ip6("255.255.255.0") );
|
|
unit_assert( is_pow2(0) );
|
|
unit_assert( is_pow2(1) );
|
|
unit_assert( is_pow2(2) );
|
|
unit_assert( is_pow2(4) );
|
|
unit_assert( is_pow2(8) );
|
|
unit_assert( is_pow2(16) );
|
|
unit_assert( is_pow2(1024) );
|
|
unit_assert( is_pow2(1024*1024) );
|
|
unit_assert( is_pow2(1024*1024*1024) );
|
|
unit_assert( !is_pow2(3) );
|
|
unit_assert( !is_pow2(5) );
|
|
unit_assert( !is_pow2(6) );
|
|
unit_assert( !is_pow2(7) );
|
|
unit_assert( !is_pow2(9) );
|
|
unit_assert( !is_pow2(10) );
|
|
unit_assert( !is_pow2(11) );
|
|
unit_assert( !is_pow2(17) );
|
|
unit_assert( !is_pow2(23) );
|
|
unit_assert( !is_pow2(257) );
|
|
unit_assert( !is_pow2(259) );
|
|
|
|
/* test addr_mask */
|
|
if(1) {
|
|
struct sockaddr_in a4;
|
|
struct sockaddr_in6 a6;
|
|
socklen_t l4 = (socklen_t)sizeof(a4);
|
|
socklen_t l6 = (socklen_t)sizeof(a6);
|
|
int i;
|
|
a4.sin_family = AF_INET;
|
|
a6.sin6_family = AF_INET6;
|
|
for(i=0; i<35; i++) {
|
|
/* address 255.255.255.255 */
|
|
memcpy(&a4.sin_addr, "\377\377\377\377", 4);
|
|
addr_mask((struct sockaddr_storage*)&a4, l4, i);
|
|
unit_assert(memcmp(&a4.sin_addr, t4[i], 4) == 0);
|
|
}
|
|
memcpy(&a6.sin6_addr, "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377", 16);
|
|
addr_mask((struct sockaddr_storage*)&a6, l6, 128);
|
|
unit_assert(memcmp(&a6.sin6_addr, "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377", 16) == 0);
|
|
addr_mask((struct sockaddr_storage*)&a6, l6, 122);
|
|
unit_assert(memcmp(&a6.sin6_addr, "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\300", 16) == 0);
|
|
addr_mask((struct sockaddr_storage*)&a6, l6, 120);
|
|
unit_assert(memcmp(&a6.sin6_addr, "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\000", 16) == 0);
|
|
addr_mask((struct sockaddr_storage*)&a6, l6, 64);
|
|
unit_assert(memcmp(&a6.sin6_addr, "\377\377\377\377\377\377\377\377\000\000\000\000\000\000\000\000", 16) == 0);
|
|
addr_mask((struct sockaddr_storage*)&a6, l6, 0);
|
|
unit_assert(memcmp(&a6.sin6_addr, "\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000\000", 16) == 0);
|
|
}
|
|
|
|
/* test addr_in_common */
|
|
if(1) {
|
|
struct sockaddr_in a4, b4;
|
|
struct sockaddr_in6 a6, b6;
|
|
socklen_t l4 = (socklen_t)sizeof(a4);
|
|
socklen_t l6 = (socklen_t)sizeof(a6);
|
|
int i;
|
|
a4.sin_family = AF_INET;
|
|
b4.sin_family = AF_INET;
|
|
a6.sin6_family = AF_INET6;
|
|
b6.sin6_family = AF_INET6;
|
|
memcpy(&a4.sin_addr, "abcd", 4);
|
|
memcpy(&b4.sin_addr, "abcd", 4);
|
|
unit_assert(addr_in_common((struct sockaddr_storage*)&a4, 32,
|
|
(struct sockaddr_storage*)&b4, 32, l4) == 32);
|
|
unit_assert(addr_in_common((struct sockaddr_storage*)&a4, 34,
|
|
(struct sockaddr_storage*)&b4, 32, l4) == 32);
|
|
for(i=0; i<=32; i++) {
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a4, 32,
|
|
(struct sockaddr_storage*)&b4, i, l4) == i);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a4, i,
|
|
(struct sockaddr_storage*)&b4, 32, l4) == i);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a4, i,
|
|
(struct sockaddr_storage*)&b4, i, l4) == i);
|
|
}
|
|
for(i=0; i<=32; i++) {
|
|
memcpy(&a4.sin_addr, "\377\377\377\377", 4);
|
|
memcpy(&b4.sin_addr, t4[i], 4);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a4, 32,
|
|
(struct sockaddr_storage*)&b4, 32, l4) == i);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&b4, 32,
|
|
(struct sockaddr_storage*)&a4, 32, l4) == i);
|
|
}
|
|
memcpy(&a6.sin6_addr, "abcdefghabcdefgh", 16);
|
|
memcpy(&b6.sin6_addr, "abcdefghabcdefgh", 16);
|
|
unit_assert(addr_in_common((struct sockaddr_storage*)&a6, 128,
|
|
(struct sockaddr_storage*)&b6, 128, l6) == 128);
|
|
unit_assert(addr_in_common((struct sockaddr_storage*)&a6, 129,
|
|
(struct sockaddr_storage*)&b6, 128, l6) == 128);
|
|
for(i=0; i<=128; i++) {
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a6, 128,
|
|
(struct sockaddr_storage*)&b6, i, l6) == i);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a6, i,
|
|
(struct sockaddr_storage*)&b6, 128, l6) == i);
|
|
unit_assert(addr_in_common(
|
|
(struct sockaddr_storage*)&a6, i,
|
|
(struct sockaddr_storage*)&b6, i, l6) == i);
|
|
}
|
|
}
|
|
}
|
|
|
|
#include "util/config_file.h"
|
|
/** test config_file: cfg_parse_memsize */
|
|
static void
|
|
config_memsize_test()
|
|
{
|
|
size_t v = 0;
|
|
if(0) {
|
|
/* these emit errors */
|
|
unit_assert( cfg_parse_memsize("", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("bla", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("nop", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("n0b", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("gb", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("b", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("kb", &v) == 0);
|
|
unit_assert( cfg_parse_memsize("kk kb", &v) == 0);
|
|
}
|
|
unit_assert( cfg_parse_memsize("0", &v) && v==0);
|
|
unit_assert( cfg_parse_memsize("1", &v) && v==1);
|
|
unit_assert( cfg_parse_memsize("10", &v) && v==10);
|
|
unit_assert( cfg_parse_memsize("10b", &v) && v==10);
|
|
unit_assert( cfg_parse_memsize("5b", &v) && v==5);
|
|
unit_assert( cfg_parse_memsize("1024", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("1k", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("1K", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("1Kb", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("1kb", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("1 kb", &v) && v==1024);
|
|
unit_assert( cfg_parse_memsize("10 kb", &v) && v==10240);
|
|
unit_assert( cfg_parse_memsize("2k", &v) && v==2048);
|
|
unit_assert( cfg_parse_memsize("2m", &v) && v==2048*1024);
|
|
unit_assert( cfg_parse_memsize("3M", &v) && v==3072*1024);
|
|
unit_assert( cfg_parse_memsize("40m", &v) && v==40960*1024);
|
|
unit_assert( cfg_parse_memsize("1G", &v) && v==1024*1024*1024);
|
|
unit_assert( cfg_parse_memsize("1 Gb", &v) && v==1024*1024*1024);
|
|
unit_assert( cfg_parse_memsize("0 Gb", &v) && v==0*1024*1024);
|
|
}
|
|
|
|
#include "util/rtt.h"
|
|
/** test RTT code */
|
|
static void
|
|
rtt_test()
|
|
{
|
|
int init = 376;
|
|
int i;
|
|
struct rtt_info r;
|
|
rtt_init(&r);
|
|
/* initial value sensible */
|
|
unit_assert( rtt_timeout(&r) == init );
|
|
rtt_lost(&r, init);
|
|
unit_assert( rtt_timeout(&r) == init*2 );
|
|
rtt_lost(&r, init*2);
|
|
unit_assert( rtt_timeout(&r) == init*4 );
|
|
rtt_update(&r, 4000);
|
|
unit_assert( rtt_timeout(&r) >= 2000 );
|
|
rtt_lost(&r, rtt_timeout(&r) );
|
|
for(i=0; i<100; i++) {
|
|
rtt_lost(&r, rtt_timeout(&r) );
|
|
unit_assert( rtt_timeout(&r) > RTT_MIN_TIMEOUT-1);
|
|
unit_assert( rtt_timeout(&r) < RTT_MAX_TIMEOUT+1);
|
|
}
|
|
}
|
|
|
|
#include "services/cache/infra.h"
|
|
#include "util/config_file.h"
|
|
/** test host cache */
|
|
static void
|
|
infra_test()
|
|
{
|
|
int one = 1;
|
|
uint8_t* zone = (uint8_t*)"\007example\003com\000";
|
|
size_t zonelen = 13;
|
|
struct infra_cache* slab;
|
|
struct config_file* cfg = config_create();
|
|
uint32_t now = 0;
|
|
uint8_t edns_lame;
|
|
int vs, to;
|
|
struct infra_host_key* k;
|
|
struct infra_host_data* d;
|
|
int init = 376;
|
|
int dlame, rlame, alame, olame;
|
|
|
|
slab = infra_create(cfg);
|
|
unit_assert( infra_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), now, &vs, &edns_lame, &to) );
|
|
unit_assert( vs == 0 && to == init && edns_lame == 0 );
|
|
|
|
unit_assert( infra_rtt_update(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), -1, init, now) );
|
|
unit_assert( infra_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), now, &vs, &edns_lame, &to) );
|
|
unit_assert( vs == 0 && to == init*2 && edns_lame == 0 );
|
|
|
|
unit_assert( infra_edns_update(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), -1, now) );
|
|
unit_assert( infra_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), now, &vs, &edns_lame, &to) );
|
|
unit_assert( vs == -1 && to == init*2 && edns_lame == 1);
|
|
|
|
now += cfg->host_ttl + 10;
|
|
unit_assert( infra_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), now, &vs, &edns_lame, &to) );
|
|
unit_assert( vs == 0 && to == init && edns_lame == 0 );
|
|
|
|
unit_assert( infra_set_lame(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), zone, zonelen, now, 0, 0,
|
|
LDNS_RR_TYPE_A) );
|
|
unit_assert( (d=infra_lookup_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), 0, now, &k)) );
|
|
unit_assert( d->ttl == now+cfg->host_ttl );
|
|
unit_assert( d->edns_version == 0 );
|
|
unit_assert( infra_lookup_lame(d, zone, zonelen, now,
|
|
&dlame, &rlame, &alame, &olame) );
|
|
unit_assert(!dlame && !rlame && alame && !olame);
|
|
unit_assert( !infra_lookup_lame(d, zone, zonelen,
|
|
now+cfg->lame_ttl+10, &dlame, &rlame, &alame, &olame) );
|
|
unit_assert( !infra_lookup_lame(d, (uint8_t*)"\000", 1, now,
|
|
&dlame, &rlame, &alame, &olame) );
|
|
lock_rw_unlock(&k->entry.lock);
|
|
|
|
/* test merge of data */
|
|
unit_assert( infra_set_lame(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), zone, zonelen, now, 0, 0,
|
|
LDNS_RR_TYPE_AAAA) );
|
|
unit_assert( (d=infra_lookup_host(slab, (struct sockaddr_storage*)&one,
|
|
(socklen_t)sizeof(int), 0, now, &k)) );
|
|
unit_assert( infra_lookup_lame(d, zone, zonelen, now,
|
|
&dlame, &rlame, &alame, &olame) );
|
|
unit_assert(!dlame && !rlame && alame && olame);
|
|
lock_rw_unlock(&k->entry.lock);
|
|
|
|
infra_delete(slab);
|
|
config_delete(cfg);
|
|
}
|
|
|
|
#include "util/random.h"
|
|
/** test randomness */
|
|
static void
|
|
rnd_test()
|
|
{
|
|
struct ub_randstate* r;
|
|
int num = 100, i;
|
|
long int a[100];
|
|
unit_assert( (r = ub_initstate((unsigned)time(NULL), NULL)) );
|
|
for(i=0; i<num; i++) {
|
|
a[i] = ub_random(r);
|
|
unit_assert(a[i] >= 0);
|
|
unit_assert((size_t)a[i] <= (size_t)RAND_MAX);
|
|
if(i > 5)
|
|
unit_assert(a[i] != a[i-1] || a[i] != a[i-2] ||
|
|
a[i] != a[i-3] || a[i] != a[i-4] ||
|
|
a[i] != a[i-5] || a[i] != a[i-6]);
|
|
}
|
|
ub_randfree(r);
|
|
}
|
|
|
|
/**
|
|
* Main unit test program. Setup, teardown and report errors.
|
|
* @param argc: arg count.
|
|
* @param argv: array of commandline arguments.
|
|
*/
|
|
int
|
|
main(int argc, char* argv[])
|
|
{
|
|
log_init(NULL, 0, NULL);
|
|
if(argc != 1) {
|
|
printf("usage: %s\n", argv[0]);
|
|
printf("\tperforms unit tests.\n");
|
|
return 1;
|
|
}
|
|
printf("Start of %s unit test.\n", PACKAGE_STRING);
|
|
ERR_load_crypto_strings();
|
|
checklock_start();
|
|
neg_test();
|
|
rnd_test();
|
|
verify_test();
|
|
net_test();
|
|
config_memsize_test();
|
|
dname_test();
|
|
anchors_test();
|
|
rtt_test();
|
|
alloc_test();
|
|
lruhash_test();
|
|
slabhash_test();
|
|
infra_test();
|
|
msgparse_test();
|
|
checklock_stop();
|
|
printf("%d checks ok.\n", testcount);
|
|
EVP_cleanup();
|
|
CRYPTO_cleanup_all_ex_data();
|
|
ERR_remove_state(0);
|
|
ERR_free_strings();
|
|
return 0;
|
|
}
|