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

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dfibonacci_heap.h59 m_right (this), m_data (NULL), m_degree (0), m_mark (0)
65 m_left (this), m_right (this), m_key (key), m_data (data),
121 fibonacci_node *m_right; member in class:fibonacci_node
304 m_right->m_left = m_left;
305 m_left->m_right = m_right;
309 m_right = this;
337 if (a == a->m_right)
339 a->m_right = b;
341 b->m_right
[all...]
H A Dtree-switch-conversion.c1834 m_case_list->m_right = r;
2020 np = np->m_right;
2038 || ! (*npp)->m_right)
2040 npp = &(*npp)->m_right;
2051 balance_case_nodes (&np->m_right, np);
2055 if (np->m_right)
2056 np->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob;
2065 for (; np->m_right; np = np->m_right)
2067 np->m_right
[all...]
H A Dtree-switch-conversion.h454 return m_left != NULL || m_right != NULL;
461 case_tree_node *m_right; member in class:tree_switch_conversion::case_tree_node
472 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL)
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dfibonacci_heap.h59 m_right (this), m_data (NULL), m_degree (0), m_mark (0)
65 m_left (this), m_right (this), m_key (key), m_data (data),
121 fibonacci_node *m_right; member in class:fibonacci_node
304 m_right->m_left = m_left;
305 m_left->m_right = m_right;
309 m_right = this;
337 if (a == a->m_right)
339 a->m_right = b;
341 b->m_right
[all...]
H A Dtree-switch-conversion.cc1871 m_case_list->m_right = r;
2057 np = np->m_right;
2075 || ! (*npp)->m_right)
2077 npp = &(*npp)->m_right;
2088 balance_case_nodes (&np->m_right, np);
2092 if (np->m_right)
2093 np->m_c->m_subtree_prob += np->m_right->m_c->m_subtree_prob;
2102 for (; np->m_right; np = np->m_right)
2104 np->m_right
[all...]
H A Dtree-switch-conversion.h480 return m_left != NULL || m_right != NULL;
487 case_tree_node *m_right; member in class:tree_switch_conversion::case_tree_node
498 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL)
/netbsd-current/external/bsd/elftosb/dist/elftosb2/
H A DElftosbAST.cpp594 : ExprASTNode(other), m_left(), m_op(other.m_op), m_right()
597 m_right = dynamic_cast<ExprASTNode*>(other.m_right->clone());
613 if (m_right) m_right->printTree(indent + 2);
667 if (!m_left || !m_right)
694 m_right = m_right->reduce(context);
695 rightIntConst = dynamic_cast<IntConstExprASTNode*>(m_right.get());
729 m_right
[all...]
H A DElftosbAST.h476 : ExprASTNode(), m_left(left), m_op(op), m_right(right)
491 ExprASTNode * getRightExpr() { return m_right; }
496 smart_ptr<ExprASTNode> m_right; member in class:elftosb::BinaryOpExprASTNode

Completed in 214 milliseconds