| /src/common/lib/libc/gen/ |
| rbtree.c | 110 rb_tree_init(struct rb_tree *rbt, const rb_tree_ops_t *ops)
113 rbt->rbt_ops = ops;
114 rbt->rbt_root = RB_SENTINEL_NODE;
115 RB_TAILQ_INIT(&rbt->rbt_nodes);
117 rbt->rbt_minmax[RB_DIR_LEFT] = rbt->rbt_root; /* minimum node */
118 rbt->rbt_minmax[RB_DIR_RIGHT] = rbt->rbt_root; /* maximum node */
121 rbt->rbt_count = 0;
122 rbt->rbt_insertions = 0
[all...] |
| /src/sys/dev/cardbus/ |
| rbus.c | 60 rbus_space_alloc(rbus_tag_t rbt, bus_addr_t addr, bus_size_t size, bus_addr_t mask, bus_addr_t align, int flags, bus_addr_t *addrp, bus_space_handle_t *bshp)
62 return rbus_space_alloc_subregion(rbt, rbt->rb_start, rbt->rb_end,
70 rbus_space_alloc_subregion(rbus_tag_t rbt, bus_addr_t substart, bus_addr_t subend, bus_addr_t addr, bus_size_t size, bus_addr_t mask, bus_addr_t align, int flags, bus_addr_t *addrp, bus_space_handle_t *bshp)
81 addr += rbt->rb_offset;
88 if (rbt->rb_flags == RBUS_SPACE_ASK_PARENT) {
89 return rbus_space_alloc(rbt->rb_parent, addr, size, mask,
91 } else if (rbt->rb_flags == RBUS_SPACE_SHARE ||
92 rbt->rb_flags == RBUS_SPACE_DEDICATE)
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_rb.c | 71 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))
95 __archive_rb_tree_init(struct archive_rb_tree *rbt,
98 rbt->rbt_ops = ops;
99 *((struct archive_rb_node **)&rbt->rbt_root) = RB_SENTINEL_NODE;
103 __archive_rb_tree_find_node(struct archive_rb_tree *rbt, const void *key)
105 archive_rbto_compare_key_fn compare_key = rbt->rbt_ops->rbto_compare_key;
106 struct archive_rb_node *parent = rbt->rbt_root;
119 __archive_rb_tree_find_node_geq(struct archive_rb_tree *rbt, const void *key)
121 archive_rbto_compare_key_fn compare_key = rbt->rbt_ops->rbto_compare_key
[all...] |
| /src/external/mpl/bind/dist/lib/dns/include/dns/ |
| rbt.h | 1 /* $NetBSD: rbt.h,v 1.10 2025/01/26 16:25:28 christos Exp $ */
18 /*! \file dns/rbt.h */
119 * These values are used in the RBT DB implementation. The appropriate
277 dns_rbt_addnode(dns_rbt_t *rbt, const dns_name_t *name, dns_rbtnode_t **nodep);
285 *\li rbt is a valid rbt structure.
309 #define dns_rbt_findnode(rbt, name, foundname, node, chain, options, callback, \
311 dns__rbt_findnode(rbt, name, foundname, node, chain, options, \
314 dns__rbt_findnode(dns_rbt_t *rbt, const dns_name_t *name, dns_name_t *foundname,
333 * returning ISC_R_NOTFOUND. Note that in a normal Internet DNS RBT
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| rbt.c | 1 /* $NetBSD: rbt.c,v 1.1 2024/02/18 20:57:33 christos Exp $ */
46 #include <dns/rbt.h>
58 #define VALID_RBT(rbt) ISC_MAGIC_VALID(rbt, RBT_MAGIC)
106 * This is the header for map-format RBT images. It is populated,
109 * that the header is only valid when the RBT image is also valid.
131 unsigned int nodecount; /* shadow from rbt structure */
137 * The following declarations are for the serialization of an RBT:
149 * RBT objects it contains.
159 write_header(FILE *file, dns_rbt_t *rbt, uint64_t first_node_offset
925 dns_rbt_t *rbt = NULL; local
1021 dns_rbt_t *rbt; local
1063 dns_rbt_t *rbt; local
[all...] |
| dbtable.c | 24 #include <dns/rbt.h>
36 dns_rbt_t *rbt; member in struct:dns_dbtable
63 dbtable->rbt = NULL;
64 result = dns_rbt_create(mctx, dbdetach, NULL, &dbtable->rbt);
99 dns_rbt_destroy(&dbtable->rbt);
146 result = dns_rbt_addname(dbtable->rbt, dns_db_origin(dbclone), dbclone);
164 * be verified. With the current rbt.c this is expensive to do,
172 result = dns_rbt_findname(dbtable->rbt, name, 0, NULL,
178 (void)dns_rbt_deletename(dbtable->rbt, name, false);
236 result = dns_rbt_findname(dbtable->rbt, name, rbtoptions, NULL
[all...] |
| ecs.c | 28 #include <dns/rbt.h>
|
| forward.c | 24 #include <dns/rbt.h>
|
| rpz.c | 38 #include <dns/rbt.h>
167 * The data in a RBT node has two pairs of bits for policy zones.
1016 * summary RBT. The summary database only causes a check of the
1382 result = dns_rbt_addnode(rpzs->rbt, trig_name, &nmnode);
1448 * Callback to free the data for a node in the summary RBT database.
1486 &zones->rbt);
1506 dns_rbt_destroy(&zones->rbt);
2297 if (rpzs->rbt != NULL) {
2298 dns_rbt_destroy(&rpzs->rbt);
2397 * Do not worry about missing summary RBT nodes that probabl
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| rbt.c | 1 /* $NetBSD: rbt.c,v 1.18 2026/01/29 18:37:49 christos Exp $ */
44 #include <dns/rbt.h>
47 #define VALID_RBT(rbt) ISC_MAGIC_VALID(rbt, RBT_MAGIC)
180 hashtable_new(dns_rbt_t *rbt, uint8_t index, uint8_t bits);
182 hashtable_free(dns_rbt_t *rbt, uint8_t index);
185 hash_node(dns_rbt_t *rbt, dns_rbtnode_t *node, const dns_name_t *name);
188 unhash_node(dns_rbt_t *rbt, dns_rbtnode_t *node);
191 rehash_bits(dns_rbt_t *rbt, size_t newcount);
193 hashtable_rehash(dns_rbt_t *rbt, uint32_t newbits)
263 dns_rbt_t *rbt; local
291 dns_rbt_t *rbt; local
[all...] |
| qpcache_p.h | 24 #include <dns/rbt.h>
|
| ecs.c | 27 #include <dns/rbt.h>
|
| db_p.h | 23 #include <dns/rbt.h>
|
| rbtdb_p.h | 23 #include <dns/rbt.h>
219 * Common DB implementation methods shared by both cache and zone RBT
228 * Create a new database of type "rbt". Called via dns_db_create();
243 * Implement dns_db_destroy() for RBT databases, see documentation
259 * _attachversion() and _closeversion() methods for RBT databases;
272 * RBT databases; see documentation of those functions for more details.
282 * RBT databases; see documentation of those functions for more details.
289 * Implement dns_db_createiterator() for RBT databases; see documentation of
299 * Implement dns_db_allrdatasets() for RBT databases; see documentation of
318 * _deleterdataset() methods for RBT databases; see documentation o
[all...] |
| /src/external/mpl/dhcp/bind/dist/lib/dns/include/dns/ |
| rbt.h | 1 /* $NetBSD: rbt.h,v 1.1 2024/02/18 20:57:37 christos Exp $ */
19 /*! \file dns/rbt.h */
153 * These values are used in the RBT DB implementation. The appropriate
324 dns_rbt_addname(dns_rbt_t *rbt, const dns_name_t *name, void *data);
337 *\li rbt is a valid rbt manager.
364 dns_rbt_addnode(dns_rbt_t *rbt, const dns_name_t *name, dns_rbtnode_t **nodep);
370 *\li rbt is a valid rbt structure.
398 dns_rbt_findname(dns_rbt_t *rbt, const dns_name_t *name, unsigned int options
[all...] |
| rpz.h | 272 dns_rbt_t *rbt; member in struct:dns_rpz_zones
|
| /src/external/mpl/bind/dist/tests/dns/ |
| rbt_test.c | 50 #include <dns/rbt.h>
57 dns_rbt_t *rbt; member in struct:__anon9270
144 ctx->rbt = NULL;
145 result = dns_rbt_create(mctx, delete_data, NULL, &ctx->rbt);
165 result = dns_rbt_addnode(ctx->rbt, name, &node);
183 dns_rbt_destroy(&ctx->rbt, 0);
193 check_test_data(dns_rbt_t *rbt) {
211 result = dns_rbt_findnode(rbt, name, foundname, &node, NULL, 0,
219 /* Test the creation of an rbt */
228 check_test_data(ctx->rbt);
[all...] |
| qpdb_test.c | 30 #include <dns/rbt.h>
74 * result in a new rbt node with the long name data.
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| rbtree.d | 25 auto rbt = redBlackTree(3, 1, 4, 2, 5);
26 assert(rbt.front == 1);
27 assert(equal(rbt[], [1, 2, 3, 4, 5]));
29 rbt.removeKey(1, 4);
30 assert(equal(rbt[], [2, 3, 5]));
32 rbt.removeFront();
33 assert(equal(rbt[], [3, 5]));
35 rbt.insert([1, 2, 4]);
36 assert(equal(rbt[], [1, 2, 3, 4, 5]));
39 assert(rbt.lowerBound(3).equal([1, 2]))
[all...] |
| util.d | 63 auto rbt = make!(RedBlackTree!(int, "a > b"))([4, 2, 3, 1]);
64 assert(equal(rbt[], [4, 3, 2, 1]));
|
| /src/external/mpl/bind/dist/tests/bench/ |
| load-names.c | 31 #include <dns/rbt.h>
304 * rbt
309 dns_rbt_t *rbt = NULL; local
310 (void)dns_rbt_create(mem, NULL, NULL, &rbt);
311 return rbt;
315 add_rbt(void *rbt, size_t count) {
319 result = dns_rbt_addnode(rbt, &item[count].fixed.name, &node);
331 get_rbt(void *rbt, size_t count, void **pval) {
335 result = dns_rbt_findnode(rbt, &item[count].fixed.name, NULL, &node,
468 { "rbt", new_rbt, thread_rbt }
[all...] |
| qp-dump.c | 27 #include <dns/rbt.h>
|
| qplookups.c | 28 #include <dns/rbt.h>
|
| /src/external/mpl/bind/lib/libdns/ |
| Makefile | 53 qpzone.c rbt.c rbt-cachedb.c rbt-zonedb.c rbtdb.c rcode.c \
|
| /src/sys/sys/ |
| rbtree.h | 93 #define RB_ROOT_P(rbt, rb) ((rbt)->rbt_root == (rb))
|
