1// -*- C++ -*- 2 3// Copyright (C) 2005, 2006, 2009 Free Software Foundation, Inc. 4// 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 9// version. 10 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. 15 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. 19 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/>. 24 25// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. 26 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 34// warranty. 35 36/** 37 * @file debug_fn_imps.hpp 38 * Contains an implementation for thin_heap_. 39 */ 40 41#ifdef _GLIBCXX_DEBUG 42 43PB_DS_CLASS_T_DEC 44void 45PB_DS_CLASS_C_DEC:: 46assert_valid() const 47{ 48 base_type::assert_valid(); 49 assert_node_consistent(base_type::m_p_root, true); 50 assert_max(); 51 assert_aux_null(); 52} 53 54PB_DS_CLASS_T_DEC 55void 56PB_DS_CLASS_C_DEC:: 57assert_aux_null() const 58{ 59 for (size_type i = 0; i < max_rank; ++i) 60 _GLIBCXX_DEBUG_ASSERT(m_a_aux[i] == NULL); 61} 62 63PB_DS_CLASS_T_DEC 64void 65PB_DS_CLASS_C_DEC:: 66assert_max() const 67{ 68 if (m_p_max == NULL) 69 { 70 _GLIBCXX_DEBUG_ASSERT(base_type::empty()); 71 return; 72 } 73 74 _GLIBCXX_DEBUG_ASSERT(!base_type::empty()); 75 _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL); 76 _GLIBCXX_DEBUG_ASSERT(m_p_max->m_p_prev_or_parent == NULL); 77 for (const_iterator it = base_type::begin(); it != base_type::end(); ++it) 78 _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value)); 79} 80 81PB_DS_CLASS_T_DEC 82void 83PB_DS_CLASS_C_DEC:: 84assert_node_consistent(const_node_pointer p_nd, bool root) const 85{ 86 base_type::assert_node_consistent(p_nd, root); 87 if (p_nd == NULL) 88 return; 89 90 assert_node_consistent(p_nd->m_p_next_sibling, root); 91 assert_node_consistent(p_nd->m_p_l_child, false); 92 if (!root) 93 { 94 if (p_nd->m_metadata == 0) 95 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == NULL); 96 else 97 _GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1); 98 } 99 100 if (p_nd->m_p_l_child != NULL) 101 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd)); 102 103 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); 104 105 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); 106 107 _GLIBCXX_DEBUG_ASSERT(unmarked_valid || marked_valid); 108 if (root) 109 _GLIBCXX_DEBUG_ASSERT(unmarked_valid); 110} 111 112#endif 113