File Manager

X7ROOT File Manager

Current Path: /usr/include/bind9/isc

📁 ..
📄 aes.h(1.05 KB)
📄 app.h(10.23 KB)
📄 assertions.h(2.78 KB)
📄 atomic.h(4.15 KB)
📄 backtrace.h(3.8 KB)
📄 base32.h(3.94 KB)
📄 base64.h(2.39 KB)
📄 bind9.h(849 B)
📄 boolean.h(746 B)
📄 buffer.h(25.69 KB)
📄 bufferlist.h(1.42 KB)
📄 commandline.h(1.69 KB)
📄 condition.h(1.44 KB)
📄 counter.h(1.88 KB)
📄 crc64.h(986 B)
📄 deprecated.h(622 B)
📄 dir.h(1.96 KB)
📄 entropy.h(8.76 KB)
📄 errno.h(658 B)
📄 errno2result.h(893 B)
📄 error.h(1.4 KB)
📄 event.h(2.98 KB)
📄 eventclass.h(1.35 KB)
📄 file.h(11.43 KB)
📄 formatcheck.h(892 B)
📄 fsaccess.h(7.25 KB)
📄 hash.h(7.52 KB)
📄 heap.h(5.14 KB)
📄 hex.h(2.33 KB)
📄 hmacmd5.h(1.75 KB)
📄 hmacsha.h(4.44 KB)
📄 ht.h(3.91 KB)
📄 httpd.h(2.26 KB)
📄 int.h(1.37 KB)
📄 interfaceiter.h(3.03 KB)
📄 iterated_hash.h(1.02 KB)
📄 json.h(1.42 KB)
📄 keyboard.h(976 B)
📄 lang.h(636 B)
📄 lex.h(9.42 KB)
📄 lfsr.h(2.88 KB)
📄 lib.h(1.04 KB)
📄 likely.h(718 B)
📄 list.h(5.65 KB)
📄 log.h(28.06 KB)
📄 magic.h(993 B)
📄 md5.h(2.34 KB)
📄 mem.h(20.63 KB)
📄 meminfo.h(690 B)
📄 msgcat.h(2.66 KB)
📄 msgs.h(8.22 KB)
📄 mutex.h(3.44 KB)
📄 mutexblock.h(1.34 KB)
📄 net.h(10.32 KB)
📄 netaddr.h(4.56 KB)
📄 netdb.h(862 B)
📄 netscope.h(947 B)
📄 offset.h(699 B)
📄 once.h(981 B)
📄 ondestroy.h(2.79 KB)
📄 os.h(670 B)
📄 parseint.h(1.49 KB)
📄 platform.h(9.31 KB)
📄 pool.h(3.42 KB)
📄 portset.h(3.21 KB)
📄 print.h(2.49 KB)
📄 queue.h(4.66 KB)
📄 quota.h(2.29 KB)
📄 radix.h(6.37 KB)
📄 random.h(2.99 KB)
📄 ratelimiter.h(3.38 KB)
📄 refcount.h(7.89 KB)
📄 regex.h(766 B)
📄 region.h(1.99 KB)
📄 resource.h(2.8 KB)
📄 result.h(4.62 KB)
📄 resultclass.h(1.56 KB)
📄 rwlock.h(3.6 KB)
📄 safe.h(1.21 KB)
📄 serial.h(1.4 KB)
📄 sha1.h(1.52 KB)
📄 sha2.h(5.65 KB)
📄 sockaddr.h(6 KB)
📄 socket.h(35.81 KB)
📄 stat.h(805 B)
📄 stats.h(3.02 KB)
📄 stdio.h(1.74 KB)
📄 stdlib.h(703 B)
📄 stdtime.h(1.3 KB)
📄 strerror.h(776 B)
📄 string.h(5.94 KB)
📄 symtab.h(4.21 KB)
📄 syslog.h(843 B)
📄 task.h(21.08 KB)
📄 taskpool.h(3.61 KB)
📄 thread.h(1.47 KB)
📄 time.h(8.66 KB)
📄 timer.h(10.54 KB)
📄 tm.h(894 B)
📄 types.h(5.54 KB)
📄 util.h(7.49 KB)
📄 version.h(688 B)
📄 xml.h(1.07 KB)

Editing: radix.h

/*
 * 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 http://mozilla.org/MPL/2.0/.
 *
 * See the COPYRIGHT file distributed with this work for additional
 * information regarding copyright ownership.
 */

#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" */
	isc_boolean_t ecs;	/* ISC_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)

#define BIT_TEST(f, b)  ((f) & (b))

/*
 * 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;
	isc_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;
	isc_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 */

X7ROOT File Manager

Editing: radix.h

Upload File

Create Folder