1169691Skan// -*- C++ -*-
2169691Skan
3169691Skan// Copyright (C) 2005, 2006 Free Software Foundation, Inc.
4169691Skan//
5169691Skan// This file is part of the GNU ISO C++ Library.  This library is free
6169691Skan// software; you can redistribute it and/or modify it under the terms
7169691Skan// of the GNU General Public License as published by the Free Software
8169691Skan// Foundation; either version 2, or (at your option) any later
9169691Skan// version.
10169691Skan
11169691Skan// This library is distributed in the hope that it will be useful, but
12169691Skan// WITHOUT ANY WARRANTY; without even the implied warranty of
13169691Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14169691Skan// General Public License for more details.
15169691Skan
16169691Skan// You should have received a copy of the GNU General Public License
17169691Skan// along with this library; see the file COPYING.  If not, write to
18169691Skan// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19169691Skan// MA 02111-1307, USA.
20169691Skan
21169691Skan// As a special exception, you may use this file as part of a free
22169691Skan// software library without restriction.  Specifically, if other files
23169691Skan// instantiate templates or use macros or inline functions from this
24169691Skan// file, or you compile this file and link it with other files to
25169691Skan// produce an executable, this file does not by itself cause the
26169691Skan// resulting executable to be covered by the GNU General Public
27169691Skan// License.  This exception does not however invalidate any other
28169691Skan// reasons why the executable file might be covered by the GNU General
29169691Skan// Public License.
30169691Skan
31169691Skan// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32169691Skan
33169691Skan// Permission to use, copy, modify, sell, and distribute this software
34169691Skan// is hereby granted without fee, provided that the above copyright
35169691Skan// notice appears in all copies, and that both that copyright notice
36169691Skan// and this permission notice appear in supporting documentation. None
37169691Skan// of the above authors, nor IBM Haifa Research Laboratories, make any
38169691Skan// representation about the suitability of this software for any
39169691Skan// purpose. It is provided "as is" without express or implied
40169691Skan// warranty.
41169691Skan
42169691Skan/**
43169691Skan * @file debug_fn_imps.hpp
44169691Skan * Contains an implementation for thin_heap_.
45169691Skan */
46169691Skan
47169691Skan#ifdef _GLIBCXX_DEBUG
48169691Skan
49169691SkanPB_DS_CLASS_T_DEC
50169691Skanvoid
51169691SkanPB_DS_CLASS_C_DEC::
52169691Skanassert_valid() const
53169691Skan{
54169691Skan  base_type::assert_valid();
55169691Skan  assert_node_consistent(base_type::m_p_root, true);
56169691Skan  assert_max();
57169691Skan  assert_aux_null();
58169691Skan}
59169691Skan
60169691SkanPB_DS_CLASS_T_DEC
61169691Skanvoid
62169691SkanPB_DS_CLASS_C_DEC::
63169691Skanassert_aux_null() const
64169691Skan{
65169691Skan  for (size_type i = 0; i < max_rank; ++i)
66169691Skan    _GLIBCXX_DEBUG_ASSERT(m_a_aux[i] == NULL);
67169691Skan}
68169691Skan
69169691SkanPB_DS_CLASS_T_DEC
70169691Skanvoid
71169691SkanPB_DS_CLASS_C_DEC::
72169691Skanassert_max() const
73169691Skan{
74169691Skan  if (m_p_max == NULL)
75169691Skan    {
76169691Skan      _GLIBCXX_DEBUG_ASSERT(base_type::empty());
77169691Skan      return;
78169691Skan    }
79169691Skan
80169691Skan  _GLIBCXX_DEBUG_ASSERT(!base_type::empty());
81169691Skan  _GLIBCXX_DEBUG_ASSERT(base_type::parent(m_p_max) == NULL);
82169691Skan  _GLIBCXX_DEBUG_ASSERT(m_p_max->m_p_prev_or_parent == NULL);
83169691Skan  for (const_iterator it = base_type::begin(); it != base_type::end(); ++it)
84169691Skan    _GLIBCXX_DEBUG_ASSERT(!Cmp_Fn::operator()(m_p_max->m_value, it.m_p_nd->m_value));
85169691Skan}
86169691Skan
87169691SkanPB_DS_CLASS_T_DEC
88169691Skanvoid
89169691SkanPB_DS_CLASS_C_DEC::
90169691Skanassert_node_consistent(const_node_pointer p_nd, bool root) const
91169691Skan{
92169691Skan  base_type::assert_node_consistent(p_nd, root);
93169691Skan  if (p_nd == NULL)
94169691Skan    return;
95169691Skan
96169691Skan  assert_node_consistent(p_nd->m_p_next_sibling, root);
97169691Skan  assert_node_consistent(p_nd->m_p_l_child, false);
98169691Skan  if (!root)
99169691Skan    {
100169691Skan      if (p_nd->m_metadata == 0)
101169691Skan	_GLIBCXX_DEBUG_ASSERT(p_nd->m_p_next_sibling == NULL);
102169691Skan      else
103169691Skan	_GLIBCXX_DEBUG_ASSERT(p_nd->m_metadata == p_nd->m_p_next_sibling->m_metadata + 1);
104169691Skan    }
105169691Skan
106169691Skan  if (p_nd->m_p_l_child != NULL)
107169691Skan    _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_l_child->m_metadata + 1 == base_type::degree(p_nd));
108169691Skan
109169691Skan  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);
110169691Skan
111169691Skan  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);
112169691Skan
113169691Skan  _GLIBCXX_DEBUG_ASSERT(unmarked_valid || marked_valid);
114169691Skan  if (root)
115169691Skan    _GLIBCXX_DEBUG_ASSERT(unmarked_valid);
116169691Skan}
117169691Skan
118169691Skan#endif
119