3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 2, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
43 * @file debug_fn_imps.hpp
44 * Contains an implementation for thin_heap_.
54 base_type::assert_valid();
55 assert_node_consistent(base_type::m_p_root, true);
63 assert_aux_null() const
65 for (size_type i = 0; i < max_rank; ++i)
66 _GLIBCXX_DEBUG_ASSERT(m_a_aux[i] == NULL);
76 _GLIBCXX_DEBUG_ASSERT(base_type::empty());
80 _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
81 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL);
82 _GLIBCXX_DEBUG_ASSERT(m_p_max->m_p_prev_or_parent == NULL);
83 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
84 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
90 assert_node_consistent(const_node_pointer p_nd, bool root) const
92 base_type::assert_node_consistent(p_nd, root);
96 assert_node_consistent(p_nd->m_p_next_sibling, root);
97 assert_node_consistent(p_nd->m_p_l_child, false);
100 if (p_nd->m_metadata == 0)
101 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == NULL);
103 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
106 if (p_nd->m_p_l_child != NULL)
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
109 const bool unmarked_valid =(p_nd->m_p_l_child == NULL&& p_nd->m_metadata == 0) ||(p_nd->m_p_l_child != NULL&& p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 1);
111 const bool marked_valid =(p_nd->m_p_l_child == NULL&& p_nd->m_metadata == 1) ||(p_nd->m_p_l_child != NULL&& p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 2);
113 _GLIBCXX_DEBUG_ASSERT(unmarked_valid || marked_valid);
115 _GLIBCXX_DEBUG_ASSERT(unmarked_valid);