HomeSort by: relevance | last modified time | path
    Searched defs:rbtree (Results 1 - 9 of 9) sorted by relevancy

  /src/external/bsd/nsd/dist/
rbtree.h 2 * rbtree.h -- generic red-black tree
17 * the rbtree. This allows easy casting between an rbnode_type and the
32 typedef struct rbtree rbtree_type;
33 struct rbtree { struct
49 /* rbtree.c */
51 rbnode_type *rbtree_insert(rbtree_type *rbtree, rbnode_type *data);
54 rbnode_type *rbtree_delete(rbtree_type *rbtree, const void *key);
55 rbnode_type *rbtree_search(rbtree_type *rbtree, const void *key);
58 int rbtree_find_less_equal(rbtree_type *rbtree, const void *key, rbnode_type **result);
59 rbnode_type *rbtree_first(rbtree_type *rbtree);
    [all...]
rbtree.c 2 * rbtree.c -- generic red black tree
15 #include "rbtree.h"
28 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
29 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
30 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
31 static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child, rbnode_type* child_parent);
42 rbtree_type *rbtree; local
45 rbtree = (rbtree_type *) region_alloc(region, sizeof(rbtree_type));
46 if (!rbtree) {
51 rbtree->root = RBTREE_NULL
    [all...]
  /src/external/bsd/unbound/dist/util/
rbtree.c 2 * rbtree.c -- generic red black tree
45 #include "util/rbtree.h"
62 static void rbtree_rotate_left(rbtree_type *rbtree, rbnode_type *node);
64 static void rbtree_rotate_right(rbtree_type *rbtree, rbnode_type *node);
66 static void rbtree_insert_fixup(rbtree_type *rbtree, rbnode_type *node);
68 static void rbtree_delete_fixup(rbtree_type* rbtree, rbnode_type* child,
80 rbtree_type *rbtree; local
83 rbtree = (rbtree_type *) malloc(sizeof(rbtree_type));
84 if (!rbtree) {
89 rbtree_init(rbtree, cmpf)
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/i915/gt/
intel_engine_types.h 20 #include <linux/rbtree.h>
303 struct rb_node rbtree; member in union:intel_engine_cs::__anon4978
  /src/external/bsd/libarchive/dist/libarchive/
archive_read_support_format_mtree.c 115 struct archive_rb_tree rbtree; member in struct:mtree
286 __archive_rb_tree_init(&mtree->rbtree, &rb_ops);
993 if (!__archive_rb_tree_insert_node(&mtree->rbtree, &entry->rbnode)) {
996 &mtree->rbtree, entry->name);
1210 &mtree->rbtree, mentry->name);
archive_write_set_format_7zip.c 252 struct archive_rb_tree rbtree;/* for empty files */ member in struct:_7zip
367 __archive_rb_tree_init(&(zip->rbtree), &rb_ops);
579 if (!__archive_rb_tree_insert_node(&(zip->rbtree),
891 ARCHIVE_RB_TREE_FOREACH(n, &(zip->rbtree)) {
archive_write_set_format_mtree.c 73 struct archive_rb_tree rbtree; member in struct:dir_info
831 __archive_rb_tree_init(&me->dir_info->rbtree, &rb_ops);
1154 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) {
1180 ARCHIVE_RB_TREE_FOREACH(n, &(np->dir_info->rbtree)) {
2037 &(parent->dir_info->rbtree), child_name);
2111 &(mtree->cur_dirent->dir_info->rbtree),
2115 &(mtree->cur_dirent->dir_info->rbtree),
2187 &(dent->dir_info->rbtree),
2234 &(dent->dir_info->rbtree),
2237 &(dent->dir_info->rbtree), file->basename.s)
    [all...]
archive_write_set_format_xar.c 208 struct archive_rb_tree rbtree; member in struct:file
2008 __archive_rb_tree_init(&(file->rbtree), &rb_ops);
2066 &(parent->rbtree), (struct archive_rb_node *)child))
2084 &(parent->rbtree), child_name);
2326 &(xar->cur_dirent->rbtree),
2437 &(dent->rbtree), file->basename.s);
archive_write_set_format_iso9660.c 226 struct archive_rb_tree rbtree; member in struct:isoent
883 struct archive_rb_tree rbtree; member in struct:idr
5121 __archive_rb_tree_init(&(isoent->rbtree), &rb_ops);
5243 &(parent->rbtree), (struct archive_rb_node *)child))
5268 &(parent->rbtree), (struct archive_rb_node *)child))
5310 __archive_rb_tree_remove_node(&(parent->rbtree),
5582 &(iso9660->cur_dirent->rbtree),
5698 &(dent->rbtree), isoent->file->basename.s);
5744 &(isoent->rbtree), child_name);
5870 __archive_rb_tree_init(&(idr->rbtree), rbt_ops)
    [all...]

Completed in 38 milliseconds