Home | History | Annotate | Download | only in left_child_next_sibling_heap_

Lines Matching refs:p_ret

118   node_pointer p_ret = s_node_allocator.allocate(1);
122       new (p_ret) node(*p_nd);
126       s_node_allocator.deallocate(p_ret, 1);
130   p_ret->m_p_l_child = p_ret->m_p_next_sibling =
131     p_ret->m_p_prev_or_parent = 0;
135       p_ret->m_p_l_child = recursive_copy_node(p_nd->m_p_l_child);
136       p_ret->m_p_next_sibling = recursive_copy_node(p_nd->m_p_next_sibling);
140       clear_imp(p_ret);
144   if (p_ret->m_p_l_child != 0)
145     p_ret->m_p_l_child->m_p_prev_or_parent = p_ret;
147   if (p_ret->m_p_next_sibling != 0)
148     p_ret->m_p_next_sibling->m_p_prev_or_parent =
149       p_nd->m_p_next_sibling->m_p_prev_or_parent == p_nd ? p_ret : 0;
151   return p_ret;