FM / isc

/usr/include/bind9/isc

Name	Size	Mode	Actions
aes.h	1015	0644	edit dl rm
align.h	569	0644	edit dl rm
app.h	7139	0644	edit dl rm
assertions.h	2227	0644	edit dl rm
astack.h	1137	0644	edit dl rm
atomic.h	3082	0644	edit dl rm
backtrace.h	3894	0644	edit dl rm
barrier.h	1052	0644	edit dl rm
base32.h	4453	0644	edit dl rm
base64.h	2865	0644	edit dl rm
bind9.h	829	0644	edit dl rm
buffer.h	30625	0644	edit dl rm
bufferlist.h	1453	0644	edit dl rm
cmocka.h	1383	0644	edit dl rm
commandline.h	1711	0644	edit dl rm
condition.h	1914	0644	edit dl rm
counter.h	1922	0644	edit dl rm
crc64.h	998	0644	edit dl rm
deprecated.h	662	0644	edit dl rm
dir.h	1545	0644	edit dl rm
endian.h	4868	0644	edit dl rm
errno.h	659	0644	edit dl rm
errno2result.h	901	0644	edit dl rm
error.h	1434	0644	edit dl rm
event.h	3442	0644	edit dl rm
eventclass.h	1442	0644	edit dl rm
file.h	11669	0644	edit dl rm
formatcheck.h	940	0644	edit dl rm
fsaccess.h	7453	0644	edit dl rm
fuzz.h	593	0644	edit dl rm
hash.h	1649	0644	edit dl rm
heap.h	5263	0644	edit dl rm
hex.h	2805	0644	edit dl rm
hmac.h	3970	0644	edit dl rm
hp.h	4588	0644	edit dl rm
ht.h	4485	0644	edit dl rm
httpd.h	2291	0644	edit dl rm
interfaceiter.h	3141	0644	edit dl rm
iterated_hash.h	933	0644	edit dl rm
lang.h	686	0644	edit dl rm
lex.h	10004	0644	edit dl rm
lfsr.h	2955	0644	edit dl rm
lib.h	1155	0644	edit dl rm
likely.h	868	0644	edit dl rm
list.h	8085	0644	edit dl rm
log.h	26497	0644	edit dl rm
magic.h	999	0644	edit dl rm
managers.h	776	0644	edit dl rm
md.h	5760	0644	edit dl rm
mem.h	18086	0644	edit dl rm
meminfo.h	710	0644	edit dl rm
mutex.h	4178	0644	edit dl rm
mutexatomic.h	9790	0644	edit dl rm
mutexblock.h	1162	0644	edit dl rm
net.h	8564	0644	edit dl rm
netaddr.h	4786	0644	edit dl rm
netdb.h	860	0644	edit dl rm
netmgr.h	15732	0644	edit dl rm
netscope.h	966	0644	edit dl rm
nonce.h	743	0644	edit dl rm
offset.h	687	0644	edit dl rm
once.h	767	0644	edit dl rm
os.h	765	0644	edit dl rm
parseint.h	1541	0644	edit dl rm
platform.h	1859	0644	edit dl rm
pool.h	3491	0644	edit dl rm
portset.h	3294	0644	edit dl rm
print.h	680	0644	edit dl rm
queue.h	1337	0644	edit dl rm
quota.h	3560	0644	edit dl rm
radix.h	7019	0644	edit dl rm
random.h	1482	0644	edit dl rm
ratelimiter.h	3492	0644	edit dl rm
refcount.h	5103	0644	edit dl rm
regex.h	767	0644	edit dl rm
region.h	2234	0644	edit dl rm
resource.h	2860	0644	edit dl rm
result.h	5580	0644	edit dl rm
resultclass.h	1597	0644	edit dl rm
rwlock.h	2535	0644	edit dl rm
safe.h	1145	0644	edit dl rm
serial.h	1367	0644	edit dl rm
siphash.h	916	0644	edit dl rm
sockaddr.h	6275	0644	edit dl rm
socket.h	24120	0644	edit dl rm
stat.h	803	0644	edit dl rm
stats.h	6689	0644	edit dl rm
stdatomic.h	9116	0644	edit dl rm
stdio.h	1728	0644	edit dl rm
stdtime.h	1392	0644	edit dl rm
strerr.h	575	0644	edit dl rm
string.h	851	0644	edit dl rm
symtab.h	4325	0644	edit dl rm
syslog.h	843	0644	edit dl rm
task.h	17126	0644	edit dl rm
taskpool.h	3281	0644	edit dl rm
thread.h	1908	0644	edit dl rm
time.h	11106	0644	edit dl rm
timer.h	7961	0644	edit dl rm
tm.h	894	0644	edit dl rm
types.h	5854	0644	edit dl rm
url.h	2681	0644	edit dl rm
utf8.h	928	0644	edit dl rm
util.h	14291	0644	edit dl rm
version.h	499	0644	edit dl rm

Edit: /usr/include/bind9/isc/radix.h (7019B)

/*
 * Copyright (C) Internet Systems Consortium, Inc. ("ISC")
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, you can obtain one at https://mozilla.org/MPL/2.0/.
 *
 * See the COPYRIGHT file distributed with this work for additional
 * information regarding copyright ownership.
 */

#ifndef _RADIX_H
#define _RADIX_H

#include <inttypes.h>
#include <string.h>

#include <isc/magic.h>
#include <isc/mutex.h>
#include <isc/net.h>
#include <isc/refcount.h>
#include <isc/types.h>

#define NETADDR_TO_PREFIX_T(na, pt, bits)                                \
	do {                                                             \
		const void *p = na;                                      \
		memset(&(pt), 0, sizeof(pt));                            \
		if (p != NULL) {                                         \
			(pt).family = (na)->family;                      \
			(pt).bitlen = (bits);                            \
			if ((pt).family == AF_INET6) {                   \
				memmove(&(pt).add.sin6, &(na)->type.in6, \
					((bits) + 7) / 8);               \
			} else                                           \
				memmove(&(pt).add.sin, &(na)->type.in,   \
					((bits) + 7) / 8);               \
		} else {                                                 \
			(pt).family = AF_UNSPEC;                         \
			(pt).bitlen = 0;                                 \
		}                                                        \
		isc_refcount_init(&(pt).refcount, 0);                    \
	} while (0)

typedef struct isc_prefix {
	isc_mem_t	  *mctx;
	unsigned int family;   /* AF_INET | AF_INET6, or AF_UNSPEC for
				* "any" */
	unsigned int   bitlen; /* 0 for "any" */
	isc_refcount_t refcount;
	union {
		struct in_addr	sin;
		struct in6_addr sin6;
	} add;
} isc_prefix_t;

typedef void (*isc_radix_destroyfunc_t)(void *);
typedef void (*isc_radix_processfunc_t)(isc_prefix_t *, void **);

#define isc_prefix_tochar(prefix)  ((char *)&(prefix)->add.sin)
#define isc_prefix_touchar(prefix) ((u_char *)&(prefix)->add.sin)

/*
 * We need "first match" when we search the radix tree to preserve
 * compatibility with the existing ACL implementation. Radix trees
 * naturally lend themselves to "best match". In order to get "first match"
 * behavior, we keep track of the order in which entries are added to the
 * tree--and when a search is made, we find all matching entries, and
 * return the one that was added first.
 *
 * An IPv4 prefix and an IPv6 prefix may share a radix tree node if they
 * have the same length and bit pattern (e.g., 127/8 and 7f::/8).  To
 * disambiguate between them, node_num and data are two-element arrays:
 *
 *   - node_num[0] and data[0] are used for IPv4 client addresses
 *   - node_num[1] and data[1] are used for IPv6 client addresses
 *
 * A prefix of 0/0 (aka "any" or "none"), is always stored as IPv4,
 * but matches all IPv6 addresses too.
 */

#define RADIX_V4       0
#define RADIX_V6       1
#define RADIX_FAMILIES 2

#define ISC_RADIX_FAMILY(p) (((p)->family == AF_INET6) ? RADIX_V6 : RADIX_V4)

typedef struct isc_radix_node {
	isc_mem_t		  *mctx;
	uint32_t	       bit;    /* bit length of the prefix */
	isc_prefix_t	     *prefix; /* who we are in radix tree */
	struct isc_radix_node *l, *r;  /* left and right children */
	struct isc_radix_node *parent; /* may be used */
	void		     *data[RADIX_FAMILIES]; /* pointers to IPv4
						      * and IPV6 data */
	int node_num[RADIX_FAMILIES];		     /* which node
						      * this was in
						      * the tree,
						      * or -1 for glue
						      * nodes */
} isc_radix_node_t;

#define RADIX_TREE_MAGIC    ISC_MAGIC('R', 'd', 'x', 'T');
#define RADIX_TREE_VALID(a) ISC_MAGIC_VALID(a, RADIX_TREE_MAGIC);

typedef struct isc_radix_tree {
	unsigned int	  magic;
	isc_mem_t	  *mctx;
	isc_radix_node_t *head;
	uint32_t	  maxbits;	   /* for IP, 32 bit addresses */
	int		  num_active_node; /* for debugging purposes */
	int		  num_added_node;  /* total number of nodes */
} isc_radix_tree_t;

isc_result_t
isc_radix_search(isc_radix_tree_t *radix, isc_radix_node_t **target,
		 isc_prefix_t *prefix);
/*%<
 * Search 'radix' for the best match to 'prefix'.
 * Return the node found in '*target'.
 *
 * Requires:
 * \li	'radix' to be valid.
 * \li	'target' is not NULL and "*target" is NULL.
 * \li	'prefix' to be valid.
 *
 * Returns:
 * \li	ISC_R_NOTFOUND
 * \li	ISC_R_SUCCESS
 */

isc_result_t
isc_radix_insert(isc_radix_tree_t *radix, isc_radix_node_t **target,
		 isc_radix_node_t *source, isc_prefix_t *prefix);
/*%<
 * Insert 'source' or 'prefix' into the radix tree 'radix'.
 * Return the node added in 'target'.
 *
 * Requires:
 * \li	'radix' to be valid.
 * \li	'target' is not NULL and "*target" is NULL.
 * \li	'prefix' to be valid or 'source' to be non NULL and contain
 *	a valid prefix.
 *
 * Returns:
 * \li	ISC_R_NOMEMORY
 * \li	ISC_R_SUCCESS
 */

void
isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node);
/*%<
 * Remove the node 'node' from the radix tree 'radix'.
 *
 * Requires:
 * \li	'radix' to be valid.
 * \li	'node' to be valid.
 */

isc_result_t
isc_radix_create(isc_mem_t *mctx, isc_radix_tree_t **target, int maxbits);
/*%<
 * Create a radix tree with a maximum depth of 'maxbits';
 *
 * Requires:
 * \li	'mctx' to be valid.
 * \li	'target' to be non NULL and '*target' to be NULL.
 * \li	'maxbits' to be less than or equal to RADIX_MAXBITS.
 *
 * Returns:
 * \li	ISC_R_NOMEMORY
 * \li	ISC_R_SUCCESS
 */

void
isc_radix_destroy(isc_radix_tree_t *radix, isc_radix_destroyfunc_t func);
/*%<
 * Destroy a radix tree optionally calling 'func' to clean up node data.
 *
 * Requires:
 * \li	'radix' to be valid.
 */

void
isc_radix_process(isc_radix_tree_t *radix, isc_radix_processfunc_t func);
/*%<
 * Walk a radix tree calling 'func' to process node data.
 *
 * Requires:
 * \li	'radix' to be valid.
 * \li	'func' to point to a function.
 */

#define RADIX_MAXBITS  128
#define RADIX_NBIT(x)  (0x80 >> ((x)&0x7f))
#define RADIX_NBYTE(x) ((x) >> 3)

#define RADIX_WALK(Xhead, Xnode)                              \
	do {                                                  \
		isc_radix_node_t	 *Xstack[RADIX_MAXBITS + 1]; \
		isc_radix_node_t **Xsp = Xstack;              \
		isc_radix_node_t	 *Xrn = (Xhead);             \
		while ((Xnode = Xrn)) {                       \
			if (Xnode->prefix)

#define RADIX_WALK_END                       \
	if (Xrn->l) {                        \
		if (Xrn->r) {                \
			*Xsp++ = Xrn->r;     \
		}                            \
		Xrn = Xrn->l;                \
	} else if (Xrn->r) {                 \
		Xrn = Xrn->r;                \
	} else if (Xsp != Xstack) {          \
		Xrn = *(--Xsp);              \
	} else {                             \
		Xrn = (isc_radix_node_t *)0; \
	}                                    \
	}                                    \
	}                                    \
	while (0)

#endif /* _RADIX_H */

cmd: