HomeSort by: relevance | last modified time | path
    Searched defs:left_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
560 left_node = parent->content.children[left_slot].child;
567 left_node = parent->content.children[left_slot].child;
569 btree_node_lock_exclusive (left_node);
573 unsigned total_count = left_node->entry_count + right_node->entry_count;
575 = btree_node_is_inner (left_node) ? max_fanout_inner : max_fanout_leaf;
582 if (btree_node_is_inner (left_node))
584 for (unsigned index = 0; index != left_node->entry_count; ++index)
586 = left_node->content.children[index];
589 parent->content.children[index + left_node->entry_count
    [all...]
  /src/external/bsd/jemalloc.old/dist/test/unit/
rb.c 207 node_t *left_node; local
214 left_node = rbtn_left_get(node_t, link, node);
217 expect_ptr_eq(left_node, node->summary_lchild,
223 left_node, right_node);
233 if (left_node != NULL) {
234 expect_false(rbtn_red_get(node_t, link, left_node),
247 if (left_node != NULL) {
248 ret += tree_recurse(left_node, black_height, black_depth);
  /src/external/bsd/jemalloc/dist/test/unit/
rb.c 214 node_t *left_node; local
221 left_node = rbtn_left_get(node_t, link, node);
225 left_node, node->summary_lchild, "summary missed a tree update");
230 node, left_node, right_node);
240 if (left_node != NULL) {
241 expect_false(rbtn_red_get(node_t, link, left_node),
254 if (left_node != NULL) {
255 ret += tree_recurse(left_node, black_height, black_depth);

Completed in 23 milliseconds