| /dports/net/mpich/mpich-3.4.3/modules/libfabric/prov/gni/src/ |
| H A D | gnix_mr_cache.c | 495 iter = rbtFind(cache->inuse.rb_tree, in __clear_notifier_events()
706 rc = rbtInsert(cache->stale.rb_tree, in __insert_entry_into_stale()
796 rc = rbtErase(cache->stale.rb_tree, in __resolve_stale_entry_collision()
1022 if (!cache_p->inuse.rb_tree) { in _gnix_mr_cache_init()
1030 if (!cache_p->stale.rb_tree) { in _gnix_mr_cache_init()
1058 rbtDelete(cache_p->inuse.rb_tree); in _gnix_mr_cache_init()
1059 cache_p->inuse.rb_tree = NULL; in _gnix_mr_cache_init()
1088 rbtDelete(cache->inuse.rb_tree); in _gnix_mr_cache_destroy()
1089 cache->inuse.rb_tree = NULL; in _gnix_mr_cache_destroy()
1093 rbtDelete(cache->stale.rb_tree); in _gnix_mr_cache_destroy()
[all …]
|
| /dports/benchmarks/stress-ng/stress-ng-0.13.09/ |
| H A D | core-ftrace.c | 55 static RB_HEAD(rb_tree, rb_node) rb_root;
56 RB_PROTOTYPE(rb_tree, rb_node, rb, rb_node_cmp);
57 RB_GENERATE(rb_tree, rb_node, rb, rb_node_cmp);
103 for (tn = RB_MIN(rb_tree, &rb_root); tn; tn = next) { in stress_ftrace_free()
105 next = RB_NEXT(rb_tree, &rb_root, tn); in stress_ftrace_free()
106 RB_REMOVE(rb_tree, &rb_root, tn); in stress_ftrace_free()
175 tn = RB_FIND(rb_tree, &rb_root, &node); in stress_ftrace_parse_trace_stat_file()
205 RB_INSERT(rb_tree, &rb_root, tn); in stress_ftrace_parse_trace_stat_file()
353 for (tn = RB_MIN(rb_tree, &rb_root); tn; tn = next) { in stress_ftrace_analyze()
366 next = RB_NEXT(rb_tree, &rb_root, tn); in stress_ftrace_analyze()
|
| /dports/devel/libavl/avl-1.4.0/ |
| H A D | rb.c | 76 rb_tree *
79 rb_tree *tree; in rb_create()
82 tree = xmalloc (sizeof (rb_tree)); in rb_create()
154 rb_free (rb_tree *tree) in rb_free()
161 rb_count (const rb_tree *tree) in rb_count()
172 rb_tree *
179 rb_tree *new_tree; in rb_copy()
862 print_contents (rb_tree *tree) in print_contents()
930 verify_tree (rb_tree *tree) in verify_tree()
1034 rb_tree *tree; in main()
[all …]
|
| /dports/graphics/vkd3d/vkd3d-1.2/include/private/ |
| H A D | rbtree.h | 39 struct rb_tree struct
54 static inline void rb_rotate_left(struct rb_tree *tree, struct rb_entry *e) in rb_rotate_left() argument
72 static inline void rb_rotate_right(struct rb_tree *tree, struct rb_entry *e) in rb_rotate_right()
153 static inline void rb_postorder(struct rb_tree *tree, rb_traverse_func *callback, void *context) in rb_postorder()
159 static inline void rb_init(struct rb_tree *tree, rb_compare_func compare) in rb_init()
171 static inline void rb_clear(struct rb_tree *tree, rb_traverse_func *callback, void *context) in rb_clear()
178 static inline void rb_destroy(struct rb_tree *tree, rb_traverse_func *callback, void *context) in rb_destroy()
183 static inline struct rb_entry *rb_get(const struct rb_tree *tree, const void *key) in rb_get()
195 static inline int rb_put(struct rb_tree *tree, const void *key, struct rb_entry *entry) in rb_put()
263 static inline void rb_remove(struct rb_tree *tree, struct rb_entry *entry) in rb_remove()
[all …]
|
| /dports/net/openmpi3/openmpi-3.1.6/opal/mca/rcache/base/ |
| H A D | rcache_base_vma_tree.c | 130 (void) opal_rb_tree_insert (&vma_module->rb_tree, vma_item, vma_item); in mca_rcache_base_vma_new()
253 OBJ_CONSTRUCT(&vma_module->rb_tree, opal_rb_tree_t); in mca_rcache_base_vma_tree_init()
257 return opal_rb_tree_init (&vma_module->rb_tree, mca_rcache_base_vma_tree_node_compare); in mca_rcache_base_vma_tree_init()
262 opal_rb_tree_init(&vma_module->rb_tree, mca_rcache_base_vma_tree_node_compare); in mca_rcache_base_vma_tree_finalize()
265 OBJ_DESTRUCT(&vma_module->rb_tree); in mca_rcache_base_vma_tree_finalize()
466 i = (mca_rcache_base_vma_item_t *) opal_rb_tree_find_with (&vma_module->rb_tree, in mca_rcache_base_vma_tree_insert()
579 opal_rb_tree_find_with (&vma_module->rb_tree, reg->base, in mca_rcache_base_vma_tree_delete()
594 opal_rb_tree_delete (&vma_module->rb_tree, vma); in mca_rcache_base_vma_tree_delete()
615 opal_rb_tree_delete(&vma_module->rb_tree, vma); in mca_rcache_base_vma_tree_delete()
629 opal_rb_tree_delete(&vma_module->rb_tree, next); in mca_rcache_base_vma_tree_delete()
[all …]
|
| /dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/rbtree/ |
| H A D | rbtree.c | 75 rb_result_t rb_tree_new_ex(struct rb_tree *tree,
92 rb_result_t rb_tree_new(struct rb_tree *tree,
101 rb_result_t rb_tree_destroy(struct rb_tree *tree)
107 memset(tree, 0, sizeof(struct rb_tree));
112 rb_result_t rb_tree_empty(struct rb_tree *tree,
125 rb_result_t rb_tree_find(struct rb_tree *tree,
217 void __helper_rotate_left(struct rb_tree *tree,
249 void __helper_rotate_right(struct rb_tree *tree,
350 rb_result_t rb_tree_insert(struct rb_tree *tree,
563 void __helper_rb_tree_swap_node(struct rb_tree *tree,
[all …]
|
| /dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/monkey/deps/rbtree/ |
| H A D | rbtree.c | 75 rb_result_t rb_tree_new_ex(struct rb_tree *tree, in rb_tree_new_ex()
92 rb_result_t rb_tree_new(struct rb_tree *tree, in rb_tree_new()
101 rb_result_t rb_tree_destroy(struct rb_tree *tree) in rb_tree_destroy()
107 memset(tree, 0, sizeof(struct rb_tree)); in rb_tree_destroy()
112 rb_result_t rb_tree_empty(struct rb_tree *tree, in rb_tree_empty()
125 rb_result_t rb_tree_find(struct rb_tree *tree, in rb_tree_find()
217 void __helper_rotate_left(struct rb_tree *tree, in __helper_rotate_left()
249 void __helper_rotate_right(struct rb_tree *tree, in __helper_rotate_right()
350 rb_result_t rb_tree_insert(struct rb_tree *tree, in rb_tree_insert()
563 void __helper_rb_tree_swap_node(struct rb_tree *tree, in __helper_rb_tree_swap_node()
[all …]
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/libosmesa/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/lang/clover/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-libs/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-dri-classic/mesa-20.2.3/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/graphics/mesa-dri/mesa-21.3.6/src/util/ |
| H A D | rb_tree.c | 96 rb_tree_init(struct rb_tree *T) in rb_tree_init()
109 rb_tree_splice(struct rb_tree *T, struct rb_node *u, struct rb_node *v) in rb_tree_splice()
127 rb_tree_rotate_left(struct rb_tree *T, struct rb_node *x) in rb_tree_rotate_left()
141 rb_tree_rotate_right(struct rb_tree *T, struct rb_node *y) in rb_tree_rotate_right()
155 rb_tree_insert_at(struct rb_tree *T, struct rb_node *parent, in rb_tree_insert_at()
230 rb_tree_remove(struct rb_tree *T, struct rb_node *z) in rb_tree_remove()
332 rb_tree_first(struct rb_tree *T) in rb_tree_first()
338 rb_tree_last(struct rb_tree *T) in rb_tree_last()
407 rb_tree_validate(struct rb_tree *T) in rb_tree_validate()
|
| /dports/math/libxlsxwriter/libxlsxwriter-RELEASE_1.1.4/src/ |
| H A D | shared_strings.c | 44 sst->rb_tree = calloc(1, sizeof(struct sst_rb_tree)); in lxw_sst_new()
45 GOTO_LABEL_ON_MEM_ERROR(sst->rb_tree, mem_error); in lxw_sst_new()
55 RB_INIT(sst->rb_tree); in lxw_sst_new()
89 free(sst->rb_tree); in lxw_sst_free()
260 existing_element = RB_INSERT(sst_rb_tree, sst->rb_tree, element); in lxw_get_sst_index()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rnext()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rnext()
|
| /dports/databases/mariadb104-server/mariadb-10.4.24/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rnext()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rnext()
|
| /dports/databases/mariadb104-client/mariadb-10.4.24/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rnext()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rnext()
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rfirst()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rfirst()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rfirst()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rfirst()
|
| /dports/databases/mariadb103-client/mariadb-10.3.34/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rnext()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rnext()
|
| /dports/databases/mariadb105-server/mariadb-10.5.15/storage/heap/ |
| H A D | hp_rnext.c | 45 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
56 pos = tree_search_next(&keyinfo->rb_tree, &info->last_pos, in heap_rnext()
73 pos= tree_search_edge(&keyinfo->rb_tree, info->parents, in heap_rnext()
88 pos = tree_search_key(&keyinfo->rb_tree, info->lastkey, info->parents, in heap_rnext()
|