/dports/net/haproxy17/haproxy-1.7.14/src/ |
H A D | rbtree.c | 39 if ((right->rb_parent = node->rb_parent)) in __rb_rotate_left() 48 node->rb_parent = right; in __rb_rotate_left() 59 if ((left->rb_parent = node->rb_parent)) in __rb_rotate_right() 68 node->rb_parent = left; in __rb_rotate_right() 263 node->rb_parent = old->rb_parent; in rb_erase() 268 if (old->rb_parent) in rb_erase() 350 while (node->rb_parent && node == node->rb_parent->rb_right) in rb_next() 351 node = node->rb_parent; in rb_next() 353 return node->rb_parent; in rb_next() 370 while (node->rb_parent && node == node->rb_parent->rb_left) in rb_prev() [all …]
|
/dports/net/haproxy18/haproxy-1.8.30/src/ |
H A D | rbtree.c | 39 if ((right->rb_parent = node->rb_parent)) in __rb_rotate_left() 48 node->rb_parent = right; in __rb_rotate_left() 59 if ((left->rb_parent = node->rb_parent)) in __rb_rotate_right() 68 node->rb_parent = left; in __rb_rotate_right() 263 node->rb_parent = old->rb_parent; in rb_erase() 268 if (old->rb_parent) in rb_erase() 350 while (node->rb_parent && node == node->rb_parent->rb_right) in rb_next() 351 node = node->rb_parent; in rb_next() 353 return node->rb_parent; in rb_next() 370 while (node->rb_parent && node == node->rb_parent->rb_left) in rb_prev() [all …]
|
/dports/games/libretro-tyrquake/tyrquake-e76477d/common/ |
H A D | rb_tree.c | 32 if ((right->rb_parent = node->rb_parent)) { in __rb_rotate_left() 39 node->rb_parent = right; in __rb_rotate_left() 51 if ((left->rb_parent = node->rb_parent)) { in __rb_rotate_right() 58 node->rb_parent = left; in __rb_rotate_right() 67 gparent = parent->rb_parent; in rb_insert_color() 142 parent = node->rb_parent; in __rb_erase_color() 175 parent = node->rb_parent; in __rb_erase_color() 217 parent = node->rb_parent; in rb_erase() 232 node->rb_parent = old->rb_parent; in rb_erase() 237 if (old->rb_parent) { in rb_erase() [all …]
|
/dports/lang/smalltalk/smalltalk-3.2.5/lib-src/ |
H A D | rbtrees.c | 41 if ((right->rb_parent = node->rb_parent)) in rb_rotate_left() 44 node->rb_parent->rb_left = right; in rb_rotate_left() 50 node->rb_parent = right; in rb_rotate_left() 62 if ((left->rb_parent = node->rb_parent)) in rb_rotate_right() 67 node->rb_parent->rb_left = left; in rb_rotate_right() 71 node->rb_parent = left; in rb_rotate_right() 255 child->rb_parent = parent; in rb_erase() 268 node->rb_parent = old->rb_parent; in rb_erase() 273 if (old->rb_parent) in rb_erase() 293 parent = node->rb_parent; in rb_erase() [all …]
|
/dports/devel/universal-ctags/ctags-p5.9.20211128.0/main/ |
H A D | rbtree.c | 94 gparent = rb_parent(parent); in rb_insert_color() 175 parent = rb_parent(node); in __rb_erase_color() 209 parent = rb_parent(node); in __rb_erase_color() 250 if (rb_parent(old)) { in rb_erase() 259 parent = rb_parent(node); in rb_erase() 280 parent = rb_parent(node); in rb_erase() 306 parent = rb_parent(node); in rb_augment_path() 342 deepest = rb_parent(node); in rb_augment_erase_begin() 352 deepest = rb_parent(deepest); in rb_augment_erase_begin() 399 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/devel/geany/geany-1.38/ctags/main/ |
H A D | rbtree.c | 94 gparent = rb_parent(parent); in rb_insert_color() 175 parent = rb_parent(node); in __rb_erase_color() 209 parent = rb_parent(node); in __rb_erase_color() 250 if (rb_parent(old)) { in rb_erase() 259 parent = rb_parent(node); in rb_erase() 280 parent = rb_parent(node); in rb_erase() 306 parent = rb_parent(node); in rb_augment_path() 342 deepest = rb_parent(node); in rb_augment_erase_begin() 352 deepest = rb_parent(deepest); in rb_augment_erase_begin() 399 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/audio/cmus/cmus-2.9.1/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in _rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in _rb_erase_color() 193 parent = rb_parent(node); in _rb_erase_color() 234 if (rb_parent(old)) { in rb_erase() 236 rb_parent(old)->rb_left = node; in rb_erase() 238 rb_parent(old)->rb_right = node; in rb_erase() 243 parent = rb_parent(node); in rb_erase() 264 parent = rb_parent(node); in rb_erase() 315 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu5/qemu-5.2.0/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu-powernv/qemu-powernv-3.0.50/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/devel/ctypes.sh/ctypes-sh-1.2/src/struct/ |
H A D | rbtree.c | 16 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 65 gparent = rb_parent(parent); in rb_insert_color() 146 parent = rb_parent(node); in __rb_erase_color() 180 parent = rb_parent(node); in __rb_erase_color() 221 parent = rb_parent(node); in rb_erase() 236 if (rb_parent(old)) in rb_erase() 239 rb_parent(old)->rb_left = node; in rb_erase() 241 rb_parent(old)->rb_right = node; in rb_erase() 251 parent = rb_parent(node); in rb_erase() 302 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu42/qemu-4.2.1/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu-utils/qemu-4.2.1/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/sysutils/mcelog/mcelog-178/ |
H A D | rbtree.c | 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 193 parent = rb_parent(node); in __rb_erase_color() 234 parent = rb_parent(node); in rb_erase() 249 if (rb_parent(old)) in rb_erase() 251 if (rb_parent(old)->rb_left == old) in rb_erase() 252 rb_parent(old)->rb_left = node; in rb_erase() 254 rb_parent(old)->rb_right = node; in rb_erase() 264 parent = rb_parent(node); in rb_erase() 315 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu/qemu-6.2.0/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/emulators/qemu60/qemu-6.0.0/roms/u-boot-sam460ex/lib/ |
H A D | rbtree.c | 29 struct rb_node *parent = rb_parent(node); in __rb_rotate_left() 78 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() 270 parent = rb_parent(node); in rb_erase() 321 if (rb_parent(node) == node) in rb_next() [all …]
|
/dports/net/samba412/samba-4.12.15/lib/util/ |
H A D | rbtree.c | 102 gparent = rb_parent(parent); 189 parent = rb_parent(node); 226 parent = rb_parent(node); 270 parent = rb_parent(node); 285 if (rb_parent(old)) 287 if (rb_parent(old)->rb_left == old) 288 rb_parent(old)->rb_left = node; 290 rb_parent(old)->rb_right = node; 300 parent = rb_parent(node); 351 if (rb_parent(node) == node) [all …]
|
/dports/benchmarks/fio/fio-3.29/lib/ |
H A D | rbtree.c | 28 struct fio_rb_node *parent = rb_parent(node); in __rb_rotate_left() 51 struct fio_rb_node *parent = rb_parent(node); in __rb_rotate_right() 77 gparent = rb_parent(parent); in rb_insert_color() 159 parent = rb_parent(node); in __rb_erase_color() 196 parent = rb_parent(node); in __rb_erase_color() 240 parent = rb_parent(node); in rb_erase() 255 if (rb_parent(old)) in rb_erase() 257 if (rb_parent(old)->rb_left == old) in rb_erase() 258 rb_parent(old)->rb_left = node; in rb_erase() 260 rb_parent(old)->rb_right = node; in rb_erase() [all …]
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/lib/ |
H A D | rbtree_test.c | 88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local 94 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX() 95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX() 105 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX() 112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local 119 rb_parent = *new; in insert_augmented_cached() 120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached() 132 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached() 166 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count() 201 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
|
H A D | rbtree.c | 78 struct rb_node *parent = rb_parent(old); in __rb_rotate_set_parents() 134 parent = rb_parent(node); in __rb_insert() 190 parent = rb_parent(node); in __rb_insert() 286 parent = rb_parent(node); in ____rb_erase_color() 376 parent = rb_parent(node); in ____rb_erase_color() 517 while ((parent = rb_parent(node)) && node == parent->rb_right) in rb_next() 546 while ((parent = rb_parent(node)) && node == parent->rb_left) in rb_prev() 556 struct rb_node *parent = rb_parent(victim); in rb_replace_node() 573 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu() 609 parent = rb_parent(node); in rb_next_postorder()
|
/dports/multimedia/libv4l/linux-5.13-rc2/lib/ |
H A D | rbtree_test.c | 88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local 94 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX() 95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX() 105 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX() 112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local 119 rb_parent = *new; in insert_augmented_cached() 120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached() 132 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached() 166 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count() 201 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/lib/ |
H A D | rbtree_test.c | 88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local 94 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX() 95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX() 105 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX() 112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local 119 rb_parent = *new; in insert_augmented_cached() 120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached() 132 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached() 166 for (count = 0; rb; rb = rb_parent(rb)) in black_path_count() 201 (!rb_parent(rb) || is_red(rb_parent(rb)))); in check()
|
/dports/multimedia/libv4l/linux-5.13-rc2/include/linux/ |
H A D | interval_tree_generic.h | 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 47 rb_parent = *link; \ 48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 173 rb = rb_parent(&node->ITRB); \
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/include/linux/ |
H A D | interval_tree_generic.h | 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 47 rb_parent = *link; \ 48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 173 rb = rb_parent(&node->ITRB); \
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/include/linux/ |
H A D | interval_tree_generic.h | 41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ 47 rb_parent = *link; \ 48 parent = rb_entry(rb_parent, ITSTRUCT, ITRB); \ 60 rb_link_node(&node->ITRB, rb_parent, link); \ 173 rb = rb_parent(&node->ITRB); \
|