| val_anchor.h (256281) | val_anchor.h (269257) |
|---|---|
| 1/* 2 * validator/val_anchor.h - validator trust anchor storage. 3 * 4 * Copyright (c) 2007, NLnet Labs. All rights reserved. 5 * 6 * This software is open source. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 7 unchanged lines hidden (view full) --- 16 * this list of conditions and the following disclaimer in the documentation 17 * and/or other materials provided with the distribution. 18 * 19 * Neither the name of the NLNET LABS nor the names of its contributors may 20 * be used to endorse or promote products derived from this software without 21 * specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 1/* 2 * validator/val_anchor.h - validator trust anchor storage. 3 * 4 * Copyright (c) 2007, NLnet Labs. All rights reserved. 5 * 6 * This software is open source. 7 * 8 * Redistribution and use in source and binary forms, with or without --- 7 unchanged lines hidden (view full) --- 16 * this list of conditions and the following disclaimer in the documentation 17 * and/or other materials provided with the distribution. 18 * 19 * Neither the name of the NLNET LABS nor the names of its contributors may 20 * be used to endorse or promote products derived from this software without 21 * specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 25 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 26 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE 27 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 29 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 30 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 31 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 32 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 33 * POSSIBILITY OF SUCH DAMAGE. | 24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 26 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 27 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 28 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED 29 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 30 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 31 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 32 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 34 */ 35 36/** 37 * \file 38 * 39 * This file contains storage for the trust anchors for the validator. 40 */ 41 42#ifndef VALIDATOR_VAL_ANCHOR_H 43#define VALIDATOR_VAL_ANCHOR_H 44#include "util/rbtree.h" 45#include "util/locks.h" 46struct trust_anchor; 47struct config_file; 48struct ub_packed_rrset_key; 49struct autr_point_data; 50struct autr_global_data; | 34 */ 35 36/** 37 * \file 38 * 39 * This file contains storage for the trust anchors for the validator. 40 */ 41 42#ifndef VALIDATOR_VAL_ANCHOR_H 43#define VALIDATOR_VAL_ANCHOR_H 44#include "util/rbtree.h" 45#include "util/locks.h" 46struct trust_anchor; 47struct config_file; 48struct ub_packed_rrset_key; 49struct autr_point_data; 50struct autr_global_data; |
| 51struct sldns_buffer; |
|
| 51 52/** 53 * Trust anchor store. 54 * The tree must be locked, while no other locks (from trustanchors) are held. 55 * And then an anchor searched for. Which can be locked or deleted. Then 56 * the tree can be unlocked again. This means you have to release the lock 57 * on a trust anchor and look it up again to delete it. 58 */ --- 120 unchanged lines hidden (view full) --- 179/** 180 * Store one string as trust anchor RR. 181 * @param anchors: anchor storage. 182 * @param buffer: parsing buffer, to generate the RR wireformat in. 183 * @param str: string. 184 * @return NULL on error. 185 */ 186struct trust_anchor* anchor_store_str(struct val_anchors* anchors, | 52 53/** 54 * Trust anchor store. 55 * The tree must be locked, while no other locks (from trustanchors) are held. 56 * And then an anchor searched for. Which can be locked or deleted. Then 57 * the tree can be unlocked again. This means you have to release the lock 58 * on a trust anchor and look it up again to delete it. 59 */ --- 120 unchanged lines hidden (view full) --- 180/** 181 * Store one string as trust anchor RR. 182 * @param anchors: anchor storage. 183 * @param buffer: parsing buffer, to generate the RR wireformat in. 184 * @param str: string. 185 * @return NULL on error. 186 */ 187struct trust_anchor* anchor_store_str(struct val_anchors* anchors, |
| 187 ldns_buffer* buffer, const char* str); | 188 struct sldns_buffer* buffer, const char* str); |
| 188 189/** 190 * Get memory in use by the trust anchor storage 191 * @param anchors: anchor storage. 192 * @return memory in use in bytes. 193 */ 194size_t anchors_get_mem(struct val_anchors* anchors); 195 --- 23 unchanged lines hidden --- | 189 190/** 191 * Get memory in use by the trust anchor storage 192 * @param anchors: anchor storage. 193 * @return memory in use in bytes. 194 */ 195size_t anchors_get_mem(struct val_anchors* anchors); 196 --- 23 unchanged lines hidden --- |