/usr/include/dnscore/ptr_set.h is in libyadifa-dev 2.1.6-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 | /*------------------------------------------------------------------------------
*
* Copyright (c) 2011-2016, EURid. All rights reserved.
* The YADIFA TM software product is provided under the BSD 3-clause license:
*
* 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 EURid 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 COPYRIGHT HOLDER 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.
*
*------------------------------------------------------------------------------
*
*/
/** @defgroup dnsdbcollection Collections used by the database
* @ingroup dnsdb
* @brief
*
*
*
* @{
*/
#pragma once
#ifdef __cplusplus
extern "C"
{
#endif
#include <dnscore/sys_types.h>
/*
* A digest is stored prefixed with its length ([1;255])
*/
/*
* A structure to hold both children with direct access
*/
typedef int ptr_node_compare(const void *node_a, const void *node_b);
typedef struct ptr_set ptr_set;
typedef struct ptr_node ptr_node;
struct ptr_set
{
struct ptr_node *root;
ptr_node_compare *compare;
};
struct ptr_set_children
{
struct ptr_node* left;
struct ptr_node* right;
};
/*
* An union to have access to the children with direct or indexed access
*/
typedef union ptr_set_children_union ptr_set_children_union;
union ptr_set_children_union
{
struct ptr_set_children lr;
struct ptr_node * child[2];
};
/*
* The node structure CANNOT have a varying size on a given collection
* This means that the digest size is a constant in the whole tree
*/
struct ptr_node
{
union ptr_set_children_union children; // 16
/**/
struct ptr_node* parent; // 8
/**/
void *key; /* ie: nsec3 item */
void *value; /* ie: label linked to the nsec3 item */
s8 balance;
};
#define PTR_SET_NODE_SIZE(node) sizeof(ptr_node)
/*
* AVL definition part begins here
*/
/*
* The maximum depth of a tree.
* 40 is enough for storing 433494436 items (worst case)
*
* Depth 0 is one node.
*
* Worst case : N is enough for sum[n = 0,N](Fn) where F is Fibonacci
* Best case : N is enough for (2^(N+1))-1
*/
#define AVL_MAX_DEPTH 40 /* 64 */
/*
* The previx that will be put in front of each function name
*/
#define AVL_PREFIX ptr_set_
/*
* The type that hold the node
*/
#define AVL_NODE_TYPE ptr_node
/*
* The type that hold the tree (should be AVL_NODE_TYPE*)
*/
#define AVL_TREE_TYPE ptr_set
/*
* The type that hold the tree (should be AVL_NODE_TYPE*)
*/
#define AVL_CONST_TREE_TYPE const ptr_set
/*
*
*/
#define AVL_TREE_ROOT(__tree__) (__tree__)->root
/*
* The type used for comparing the nodes.
*/
#define AVL_REFERENCE_TYPE void*
#define AVL_REFERENCE_IS_POINTER TRUE
#define AVL_REFERENCE_IS_CONST FALSE
/*
* The node has got a pointer to its parent
*
* 0 : disable
* !=0 : enable
*/
#define AVL_HAS_PARENT_POINTER 1
#ifdef __cplusplus
}
#endif
#include <dnscore/avl.h.inc>
#ifdef __cplusplus
extern "C"
{
#endif
/*
* I recommand setting a define to identify the C part of the template
* So it can be used to undefine what is not required anymore for every
* C file but that one.
*
*/
#ifndef _PTR_SET_COLLECTION_C
#undef AVL_MAX_DEPTH
#undef AVL_PREFIX
#undef AVL_NODE_TYPE
#undef AVL_TREE_TYPE
#undef AVL_CONST_TREE_TYPE
#undef AVL_TREE_ROOT
#undef AVL_REFERENCE_TYPE
#undef AVL_HAS_PARENT_POINTER
#undef AVL_REFERENCE_IS_POINTER
#undef AVL_REFERENCE_IS_CONST
#undef _AVL_H_INC
#endif /* _PTR_SET_COLLECTION_C */
#ifdef __cplusplus
}
#endif
#define ptr_set_default_node_compare ptr_set_ptr_node_compare
// key = ptr
int ptr_set_ptr_node_compare(const void *node_a, const void *node_b);
// key = asciiz (cannot be NULL)
int ptr_set_asciizp_node_compare(const void *node_a, const void *node_b);
// key = fqdn (cannot be NULL)
int ptr_set_dnsname_node_compare(const void *node_a, const void *node_b);
// key = fqdn (cannot be NULL)
int ptr_set_dnslabel_node_compare(const void *node_a, const void *node_b);
// key = asciiz (can be NULL)
int ptr_set_nullable_asciizp_node_compare(const void *node_a, const void *node_b);
// key = fqdn (can be NULL)
int ptr_set_nullable_dnsname_node_compare(const void *node_a, const void *node_b);
int ptr_set_host_address_node_compare(const void *node_a, const void *node_b);
#define PTR_SET_EMPTY {NULL, ptr_set_default_node_compare}
#define PTR_SET_ASCIIZ_EMPTY {NULL, ptr_set_asciizp_node_compare}
#define PTR_SET_DNSNAME_EMPTY {NULL, ptr_set_dnsname_node_compare}
#define PTR_SET_NULLABLE_ASCIIZ_EMPTY {NULL, ptr_set_nullable_asciizp_node_compare}
#define PTR_SET_NULLABLE_DNSNAME_EMPTY {NULL, ptr_set_nullable_dnsname_node_compare}
#define PTR_SET_PTR_EMPTY {NULL, ptr_set_ptr_node_compare}
#define PTR_SET_CUSTOM(comparator___) {NULL, (comparator___)}
#define PTR_SET_HOST_ADDRESS_EMPTY {NULL, ptr_set_host_address_node_compare}
void *ptr_set_avl_iterator_hasnext_next_value(ptr_set_avl_iterator *iterp);
#define FOREACH_PTR_SET(cast__,var__,ptr_set__) ptr_set_avl_iterator PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__); ptr_set_avl_iterator_init((ptr_set__), &PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__)); for(cast__ var__;((var__) = (cast__)ptr_set_avl_iterator_hasnext_next_value(&PREPROCESSOR_CONCAT_EVAL(foreach_ptr_set_iter,__LINE__))) != NULL;)
/*
* AVL definition part ends here
*/
/** @} */
/*----------------------------------------------------------------------------*/
|