--- /dev/null
+/*
+ * testcode/unitanchor.c - unit test for trust anchor storage.
+ *
+ * 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
+ * Calls trust anchor unit tests. Exits with code 1 on a failure.
+ */
+
+#include "config.h"
+#include "util/log.h"
+#include "util/data/dname.h"
+#include "testcode/unitmain.h"
+#include "validator/val_anchor.h"
+
+/** test empty set */
+static void
+test_anchor_empty(struct val_anchors* a)
+{
+ uint16_t c = LDNS_RR_CLASS_IN;
+ unit_assert(anchors_lookup(a, (uint8_t*)"\000", 1, c) == NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\003com\000", 5, c) == NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\007example\003com\000", 11, c) == NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\002nl\000", 4, c) == NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\004labs\002nl\000", 9, c) == NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\004fabs\002nl\000", 9, c) == NULL);
+}
+
+/** test set of one anchor */
+static void
+test_anchor_one(ldns_buffer* buff, struct val_anchors* a)
+{
+ uint16_t c = LDNS_RR_CLASS_IN;
+ unit_assert(anchor_store_str(a, buff,
+ "nl. DS 42860 5 1 14D739EB566D2B1A5E216A0BA4D17FA9B038BE4A"));
+ unit_assert(anchors_lookup(a, (uint8_t*)"\000", 1, c) == NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\003com\000", 5, c) == NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\007example\003com\000", 11, c) == NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\002nl\000", 4, c) != NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\004labs\002nl\000", 9, c) != NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\004fabs\002nl\000", 9, c) != NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\002oo\000", 4, c) == NULL);
+}
+
+/** test with several anchors */
+static void
+test_anchors(ldns_buffer* buff, struct val_anchors* a)
+{
+ struct trust_anchor* ta;
+ uint16_t c = LDNS_RR_CLASS_IN;
+ unit_assert(anchor_store_str(a, buff,
+ "labs.nl. DS 42860 5 1 14D739EB566D2B1A5E216A0BA4D17FA9B038BE4A"));
+ unit_assert(anchors_lookup(a, (uint8_t*)"\000", 1, c) == NULL);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\003com\000", 5, c) == NULL);
+ unit_assert(anchors_lookup(a,
+ (uint8_t*)"\007example\003com\000", 11, c) == NULL);
+ unit_assert(ta = anchors_lookup(a, (uint8_t*)"\002nl\000", 4, c));
+ unit_assert(query_dname_compare(ta->name, (uint8_t*)"\002nl\000")==0);
+ unit_assert(ta = anchors_lookup(a,
+ (uint8_t*)"\004labs\002nl\000", 9, c));
+ unit_assert(query_dname_compare(ta->name,
+ (uint8_t*)"\004labs\002nl\000") == 0);
+ unit_assert(ta = anchors_lookup(a,
+ (uint8_t*)"\004fabs\002nl\000", 9, c));
+ unit_assert(query_dname_compare(ta->name,
+ (uint8_t*)"\002nl\000") == 0);
+ unit_assert(anchors_lookup(a, (uint8_t*)"\002oo\000", 4, c) == NULL);
+}
+
+void anchors_test()
+{
+ ldns_buffer* buff = ldns_buffer_new(65800);
+ struct val_anchors* a;
+ unit_assert(a = anchors_create());
+ ldns_buffer_flip(buff);
+ test_anchor_empty(a);
+ test_anchor_one(buff, a);
+ test_anchors(buff, a);
+ anchors_delete(a);
+ ldns_buffer_free(buff);
+}
anchor_new_ta(struct val_anchors* anchors, uint8_t* name, int namelabs,
size_t namelen, uint16_t dclass)
{
+ rbnode_t* r;
struct trust_anchor* ta = (struct trust_anchor*)region_alloc(
anchors->region, sizeof(struct trust_anchor));
if(!ta)
return NULL;
memset(ta, 0, sizeof(*ta));
ta->node.key = ta;
- ta->name = name;
+ ta->name = region_alloc_init(anchors->region, name, namelen);
+ if(!ta->name)
+ return NULL;
ta->namelabs = namelabs;
ta->namelen = namelen;
ta->dclass = dclass;
+ r = rbtree_insert(anchors->tree, &ta->node);
+ log_assert(r != NULL);
return ta;
}
return 1;
}
-/**
- * Store one string as trust anchor RR.
- * @param anchors: anchor storage.
- * @param buffer: parsing buffer.
- * @param str: string.
- * @return false on error.
- */
-static int
+int
anchor_store_str(struct val_anchors* anchors, ldns_buffer* buffer,
const char* str)
{
key.dclass = qclass;
if(rbtree_find_less_equal(anchors->tree, &key, &res)) {
/* exact */
- result = (struct trust_anchor*)res->key;
+ result = (struct trust_anchor*)res;
} else {
/* smaller element (or no element) */
int m;
- result = (struct trust_anchor*)res->key;
+ result = (struct trust_anchor*)res;
if(!result || result->dclass != qclass)
return NULL;
/* count number of labels matched */
break;
result = result->parent;
}
- if(!result)
- return NULL;
}
return result;
}