3 // Copyright (C) 2005-2016 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 3, 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 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file thin_heap_/debug_fn_imps.hpp
38 * Contains an implementation for thin_heap_.
46 assert_valid(const char* __file, int __line) const
48 base_type::assert_valid(__file, __line);
49 assert_node_consistent(base_type::m_p_root, true, __file, __line);
50 assert_max(__file, __line);
51 assert_aux_null(__file, __line);
57 assert_aux_null(const char* __file, int __line) const
59 for (size_type i = 0; i < max_rank; ++i)
60 PB_DS_DEBUG_VERIFY(m_a_aux[i] == 0);
66 assert_max(const char* __file, int __line) const
70 PB_DS_DEBUG_VERIFY(base_type::empty());
74 PB_DS_DEBUG_VERIFY(!base_type::empty());
75 PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0);
76 PB_DS_DEBUG_VERIFY(m_p_max->m_p_prev_or_parent == 0);
77 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
78 PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
84 assert_node_consistent(node_const_pointer p_nd, bool root,
85 const char* __file, int __line) const
87 base_type::assert_node_consistent(p_nd, root, __file, __line);
91 assert_node_consistent(p_nd->m_p_next_sibling, root, __file, __line);
92 assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
95 if (p_nd->m_metadata == 0)
96 PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling == 0);
98 PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
101 if (p_nd->m_p_l_child != 0)
102 PB_DS_DEBUG_VERIFY(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
104 const bool unmarked_valid =
105 (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 0)
106 || (p_nd->m_p_l_child != 0
107 && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 1);
109 const bool marked_valid =
110 (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 1)
111 || (p_nd->m_p_l_child != 0
112 && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 2);
114 PB_DS_DEBUG_VERIFY(unmarked_valid || marked_valid);
116 PB_DS_DEBUG_VERIFY(unmarked_valid);