FM / isc

/usr/include/bind9/isc

Name	Size	Mode	Actions
aes.h	1080	0644	edit dl rm
app.h	10478	0644	edit dl rm
assertions.h	2907	0644	edit dl rm
atomic.h	4168	0644	edit dl rm
backtrace.h	3891	0644	edit dl rm
base32.h	4453	0644	edit dl rm
base64.h	2866	0644	edit dl rm
bind9.h	830	0644	edit dl rm
boolean.h	594	0644	edit dl rm
buffer.h	26268	0644	edit dl rm
bufferlist.h	1452	0644	edit dl rm
cmocka.h	1383	0644	edit dl rm
commandline.h	1713	0644	edit dl rm
condition.h	1478	0644	edit dl rm
counter.h	1926	0644	edit dl rm
crc64.h	998	0644	edit dl rm
deprecated.h	623	0644	edit dl rm
dir.h	1598	0644	edit dl rm
endian.h	4778	0644	edit dl rm
entropy.h	10373	0644	edit dl rm
errno.h	659	0644	edit dl rm
errno2result.h	902	0644	edit dl rm
error.h	1430	0644	edit dl rm
event.h	3053	0644	edit dl rm
eventclass.h	1381	0644	edit dl rm
file.h	11667	0644	edit dl rm
formatcheck.h	893	0644	edit dl rm
fsaccess.h	7442	0644	edit dl rm
hash.h	7662	0644	edit dl rm
heap.h	5264	0644	edit dl rm
hex.h	2806	0644	edit dl rm
hmacmd5.h	1787	0644	edit dl rm
hmacsha.h	4511	0644	edit dl rm
ht.h	4396	0644	edit dl rm
httpd.h	2318	0644	edit dl rm
int.h	1088	0644	edit dl rm
interfaceiter.h	3120	0644	edit dl rm
iterated_hash.h	1046	0644	edit dl rm
json.h	1459	0644	edit dl rm
keyboard.h	989	0644	edit dl rm
lang.h	637	0644	edit dl rm
lex.h	9771	0644	edit dl rm
lfsr.h	2958	0644	edit dl rm
lib.h	1068	0644	edit dl rm
likely.h	818	0644	edit dl rm
list.h	5751	0644	edit dl rm
log.h	28734	0644	edit dl rm
magic.h	994	0644	edit dl rm
md5.h	2380	0644	edit dl rm
mem.h	21110	0644	edit dl rm
meminfo.h	710	0644	edit dl rm
msgcat.h	2726	0644	edit dl rm
msgs.h	8422	0644	edit dl rm
mutex.h	3524	0644	edit dl rm
mutexblock.h	1375	0644	edit dl rm
net.h	10534	0644	edit dl rm
netaddr.h	4590	0644	edit dl rm
netdb.h	863	0644	edit dl rm
netscope.h	967	0644	edit dl rm
offset.h	700	0644	edit dl rm
once.h	983	0644	edit dl rm
ondestroy.h	2799	0644	edit dl rm
os.h	671	0644	edit dl rm
parseint.h	1542	0644	edit dl rm
platform.h	9717	0644	edit dl rm
pool.h	3502	0644	edit dl rm
portset.h	3295	0644	edit dl rm
print.h	2475	0644	edit dl rm
queue.h	5204	0644	edit dl rm
quota.h	2440	0644	edit dl rm
radix.h	6491	0644	edit dl rm
random.h	3582	0644	edit dl rm
ratelimiter.h	3497	0644	edit dl rm
refcount.h	8193	0644	edit dl rm
regex.h	767	0644	edit dl rm
region.h	2034	0644	edit dl rm
resource.h	2862	0644	edit dl rm
result.h	4982	0644	edit dl rm
resultclass.h	1599	0644	edit dl rm
rwlock.h	3807	0644	edit dl rm
safe.h	1352	0644	edit dl rm
serial.h	1368	0644	edit dl rm
sha1.h	1556	0644	edit dl rm
sha2.h	5733	0644	edit dl rm
siphash.h	734	0644	edit dl rm
sockaddr.h	6039	0644	edit dl rm
socket.h	36655	0644	edit dl rm
stat.h	806	0644	edit dl rm
stats.h	3709	0644	edit dl rm
stdatomic.h	5250	0644	edit dl rm
stdio.h	1787	0644	edit dl rm
stdlib.h	704	0644	edit dl rm
stdtime.h	1065	0644	edit dl rm
strerror.h	777	0644	edit dl rm
string.h	6019	0644	edit dl rm
symtab.h	4326	0644	edit dl rm
syslog.h	844	0644	edit dl rm
task.h	21544	0644	edit dl rm
taskpool.h	3709	0644	edit dl rm
thread.h	1506	0644	edit dl rm
time.h	8876	0644	edit dl rm
timer.h	10795	0644	edit dl rm
tm.h	895	0644	edit dl rm
types.h	5780	0644	edit dl rm
utf8.h	928	0644	edit dl rm
util.h	10537	0644	edit dl rm
version.h	689	0644	edit dl rm
xml.h	1094	0644	edit dl rm

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

/*
 * 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.
 */

#include <stdbool.h>

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

#include <string.h>

#ifndef _RADIX_H
#define _RADIX_H

#define NETADDR_TO_PREFIX_T(na,pt,bits,is_ecs)	\
	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; \
		} \
		(pt).ecs = is_ecs; \
		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" */
	bool ecs;	/* true for an EDNS client subnet address */
	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).  Also,
 * a node that matches a client address may also match an EDNS client
 * subnet address.  To disambiguate between these, node_num and data
 * are four-element arrays;
 *
 *   - node_num[0] and data[0] are used for IPv4 client addresses
 *   - node_num[1] and data[1] for IPv4 client subnet addresses
 *   - node_num[2] and data[2] are used for IPv6 client addresses
 *   - node_num[3] and data[3] for IPv6 client subnet addresses
 *
 * A prefix of 0/0 (aka "any" or "none"), is always stored as IPv4,
 * but matches IPv6 addresses too, as well as all client subnet
 * addresses.
 */

#define RADIX_NOECS 0
#define RADIX_ECS 2
#define RADIX_V4 0
#define RADIX_V6 1
#define RADIX_V4_ECS 2
#define RADIX_V6_ECS 3
#define RADIX_FAMILIES 4

#define ISC_RADIX_FAMILY(p) \
	((((p)->family == AF_INET6) ? RADIX_V6 : RADIX_V4) + \
	 ((p)->ecs ? RADIX_ECS : RADIX_NOECS))

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: