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

  /src/external/gpl3/gcc/dist/libgcc/
unwind-dw2-btree.h 553 struct btree_node *left_node, *right_node; local
561 right_node = parent->content.children[left_slot + 1].child;
562 btree_node_lock_exclusive (right_node);
568 right_node = parent->content.children[left_slot + 1].child;
573 unsigned total_count = left_node->entry_count + right_node->entry_count;
587 for (unsigned index = 0; index != right_node->entry_count;
590 = right_node->content.children[index];
598 for (unsigned index = 0; index != right_node->entry_count;
601 = right_node->content.entries[index];
605 btree_release_node (t, right_node);
    [all...]
  /src/external/bsd/jemalloc.old/dist/test/unit/
rb.c 208 node_t *right_node; local
215 right_node = rbtn_right_get(node_t, link, node);
219 expect_ptr_eq(right_node, node->summary_rchild,
223 left_node, right_node);
237 if (right_node != NULL) {
238 expect_false(rbtn_red_get(node_t, link, right_node),
254 if (right_node != NULL) {
255 ret += tree_recurse(right_node, black_height, black_depth);
  /src/external/bsd/jemalloc/dist/test/unit/
rb.c 215 node_t *right_node; local
222 right_node = rbtn_right_get(node_t, link, node);
227 right_node, node->summary_rchild, "summary missed a tree update");
230 node, left_node, right_node);
244 if (right_node != NULL) {
245 expect_false(rbtn_red_get(node_t, link, right_node),
261 if (right_node != NULL) {
262 ret += tree_recurse(right_node, black_height, black_depth);

Completed in 16 milliseconds