| /src/external/gpl3/gcc/dist/gcc/ |
| fibonacci_heap.h | 59 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 = a
[all...] |
| tree-switch-conversion.h | 487 return m_left != NULL || m_right != NULL;
494 case_tree_node *m_right; member in class:tree_switch_conversion::case_tree_node
505 m_left (NULL), m_right (NULL), m_parent (NULL), m_c (NULL)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| fibonacci_heap.h | 59 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 = a
[all...] |
| tree-switch-conversion.h | 480 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)
|
| /src/external/gpl3/gcc/dist/gcc/text-art/ |
| types.h | 502 : m_up (up), m_down (down), m_left (left), m_right (right)
508 return (m_up << 3) | (m_down << 2) | (m_left << 1) | m_right;
514 bool m_right: 1; member in struct:text_art::directions
|
| /src/external/bsd/elftosb/dist/elftosb2/ |
| ElftosbAST.h | 476 : 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
|
