Home
last modified time | relevance | path

Searched refs:m_right (Results 1 – 8 of 8) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dfibonacci_heap.h59 m_right (this), m_data (NULL), m_degree (0), m_mark (0) in fibonacci_node()
65 m_left (this), m_right (this), m_key (key), m_data (data), in m_parent()
121 fibonacci_node *m_right; variable
304 m_right->m_left = m_left; in remove()
305 m_left->m_right = m_right; in remove()
309 m_right = this; in remove()
337 if (a == a->m_right) in insert_after()
339 a->m_right = b; in insert_after()
341 b->m_right = a; in insert_after()
346 b->m_right = a->m_right; in insert_after()
[all …]
H A Dtree-switch-conversion.c1833 m_case_list->m_right = r; in try_switch_expansion()
2019 np = np->m_right; in balance_case_nodes()
2037 || ! (*npp)->m_right) in balance_case_nodes()
2039 npp = &(*npp)->m_right; in balance_case_nodes()
2050 balance_case_nodes (&np->m_right, np); in balance_case_nodes()
2054 if (np->m_right) in balance_case_nodes()
2055 np->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob; in balance_case_nodes()
2064 for (; np->m_right; np = np->m_right) in balance_case_nodes()
2066 np->m_right->m_parent = np; in balance_case_nodes()
2067 (*head)->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob; in balance_case_nodes()
[all …]
H A Dtree-switch-conversion.h454 return m_left != NULL || m_right != NULL; in has_child()
461 case_tree_node *m_right; variable
472 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL) in case_tree_node()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dfibonacci_heap.h59 m_right (this), m_data (NULL), m_degree (0), m_mark (0) in fibonacci_node()
65 m_left (this), m_right (this), m_key (key), m_data (data), in m_parent()
121 fibonacci_node *m_right; variable
304 m_right->m_left = m_left; in remove()
305 m_left->m_right = m_right; in remove()
309 m_right = this; in remove()
337 if (a == a->m_right) in insert_after()
339 a->m_right = b; in insert_after()
341 b->m_right = a; in insert_after()
346 b->m_right = a->m_right; in insert_after()
[all …]
H A Dtree-switch-conversion.cc1870 m_case_list->m_right = r; in try_switch_expansion()
2056 np = np->m_right; in balance_case_nodes()
2074 || ! (*npp)->m_right) in balance_case_nodes()
2076 npp = &(*npp)->m_right; in balance_case_nodes()
2087 balance_case_nodes (&np->m_right, np); in balance_case_nodes()
2091 if (np->m_right) in balance_case_nodes()
2092 np->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob; in balance_case_nodes()
2101 for (; np->m_right; np = np->m_right) in balance_case_nodes()
2103 np->m_right->m_parent = np; in balance_case_nodes()
2104 (*head)->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob; in balance_case_nodes()
[all …]
H A Dtree-switch-conversion.h480 return m_left != NULL || m_right != NULL; in has_child()
487 case_tree_node *m_right; variable
498 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL) in case_tree_node()
/netbsd-src/external/bsd/elftosb/dist/elftosb2/
H A DElftosbAST.cpp594 : ExprASTNode(other), m_left(), m_op(other.m_op), m_right() in BinaryOpExprASTNode()
597 m_right = dynamic_cast<ExprASTNode*>(other.m_right->clone()); in BinaryOpExprASTNode()
613 if (m_right) m_right->printTree(indent + 2); in printTree()
667 if (!m_left || !m_right) in reduce()
694 m_right = m_right->reduce(context); in reduce()
695 rightIntConst = dynamic_cast<IntConstExprASTNode*>(m_right.get()); in reduce()
729 m_right = m_right->reduce(context); in reduce()
730 rightIntConst = dynamic_cast<IntConstExprASTNode*>(m_right.get()); in reduce()
H A DElftosbAST.h476 : ExprASTNode(), m_left(left), m_op(op), m_right(right) in BinaryOpExprASTNode()
491 ExprASTNode * getRightExpr() { return m_right; } in getRightExpr()
496 smart_ptr<ExprASTNode> m_right; variable