libstdc++
thin_heap_/debug_fn_imps.hpp
Go to the documentation of this file.
00001 // -*- C++ -*-
00002 
00003 // Copyright (C) 2005, 2006, 2009, 2010, 2011 Free Software Foundation, Inc.
00004 //
00005 // This file is part of the GNU ISO C++ Library.  This library is free
00006 // software; you can redistribute it and/or modify it under the terms
00007 // of the GNU General Public License as published by the Free Software
00008 // Foundation; either version 3, or (at your option) any later
00009 // version.
00010 
00011 // This library is distributed in the hope that it will be useful, but
00012 // WITHOUT ANY WARRANTY; without even the implied warranty of
00013 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00014 // General Public License for more details.
00015 
00016 // Under Section 7 of GPL version 3, you are granted additional
00017 // permissions described in the GCC Runtime Library Exception, version
00018 // 3.1, as published by the Free Software Foundation.
00019 
00020 // You should have received a copy of the GNU General Public License and
00021 // a copy of the GCC Runtime Library Exception along with this program;
00022 // see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
00023 // <http://www.gnu.org/licenses/>.
00024 
00025 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
00026 
00027 // Permission to use, copy, modify, sell, and distribute this software
00028 // is hereby granted without fee, provided that the above copyright
00029 // notice appears in all copies, and that both that copyright notice
00030 // and this permission notice appear in supporting documentation. None
00031 // of the above authors, nor IBM Haifa Research Laboratories, make any
00032 // representation about the suitability of this software for any
00033 // purpose. It is provided "as is" without express or implied
00034 // warranty.
00035 
00036 /**
00037  * @file thin_heap_/debug_fn_imps.hpp
00038  * Contains an implementation for thin_heap_.
00039  */
00040 
00041 #ifdef _GLIBCXX_DEBUG
00042 
00043 PB_DS_CLASS_T_DEC
00044 void
00045 PB_DS_CLASS_C_DEC::
00046 assert_valid(const char* __file, int __line) const
00047 {
00048   base_type::assert_valid(__file, __line);
00049   assert_node_consistent(base_type::m_p_root, true, __file, __line);
00050   assert_max(__file, __line);
00051   assert_aux_null(__file, __line);
00052 }
00053 
00054 PB_DS_CLASS_T_DEC
00055 void
00056 PB_DS_CLASS_C_DEC::
00057 assert_aux_null(const char* __file, int __line) const
00058 {
00059   for (size_type i = 0; i < max_rank; ++i)
00060     PB_DS_DEBUG_VERIFY(m_a_aux[i] == 0);
00061 }
00062 
00063 PB_DS_CLASS_T_DEC
00064 void
00065 PB_DS_CLASS_C_DEC::
00066 assert_max(const char* __file, int __line) const
00067 {
00068   if (m_p_max == 0)
00069     {
00070       PB_DS_DEBUG_VERIFY(base_type::empty());
00071       return;
00072     }
00073 
00074   PB_DS_DEBUG_VERIFY(!base_type::empty());
00075   PB_DS_DEBUG_VERIFY(base_type::parent(m_p_max) == 0);
00076   PB_DS_DEBUG_VERIFY(m_p_max->m_p_prev_or_parent == 0);
00077   for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
00078     PB_DS_DEBUG_VERIFY(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
00079 }
00080 
00081 PB_DS_CLASS_T_DEC
00082 void
00083 PB_DS_CLASS_C_DEC::
00084 assert_node_consistent(node_const_pointer p_nd, bool root,
00085                const char* __file, int __line) const
00086 {
00087   base_type::assert_node_consistent(p_nd, root, __file, __line);
00088   if (p_nd == 0)
00089     return;
00090 
00091   assert_node_consistent(p_nd->m_p_next_sibling, root, __file, __line);
00092   assert_node_consistent(p_nd->m_p_l_child, false, __file, __line);
00093   if (!root)
00094     {
00095       if (p_nd->m_metadata == 0)
00096     PB_DS_DEBUG_VERIFY(p_nd->m_p_next_sibling == 0);
00097       else
00098     PB_DS_DEBUG_VERIFY(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
00099     }
00100 
00101   if (p_nd->m_p_l_child != 0)
00102     PB_DS_DEBUG_VERIFY(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
00103 
00104   const bool unmarked_valid =
00105     (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 0)
00106     || (p_nd->m_p_l_child != 0
00107      && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 1);
00108 
00109   const bool marked_valid =
00110     (p_nd->m_p_l_child == 0 && p_nd->m_metadata == 1)
00111     || (p_nd->m_p_l_child != 0
00112     && p_nd->m_metadata == p_nd->m_p_l_child->m_metadata + 2);
00113 
00114   PB_DS_DEBUG_VERIFY(unmarked_valid || marked_valid);
00115   if (root)
00116     PB_DS_DEBUG_VERIFY(unmarked_valid);
00117 }
00118 
00119 #endif