1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
/* Common part of the Prolog interfaces: inline functions.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://bugseng.com/products/ppl/ . */
#ifndef PPL_ppl_prolog_common_inlines_hh
#define PPL_ppl_prolog_common_inlines_hh 1
#if PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
#include <typeinfo>
#include <iomanip>
template <typename T>
void
Allocation_Tracker::insert(const T* p) {
#if NOISY_PROLOG_TRACK_ALLOCATION
std::cerr << "inserting " << typeid(*p).name()
<< " at " << std::hex << (void*) p << std::endl;
#endif
std::pair<Set::iterator, bool> stat = s.insert(p);
if (!stat.second) {
std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
" two objects at the same address at the same time?!"
<< std::endl;
abort();
}
}
template <typename T>
void
Allocation_Tracker::weak_insert(const T* p) {
#if NOISY_PROLOG_TRACK_ALLOCATION
std::cerr << "inserting weak " << typeid(*p).name()
<< " at " << std::hex << (void*) p << std::endl;
#endif
weak_s.insert(p);
}
template <typename T>
void
Allocation_Tracker::remove(const T* p) {
#if NOISY_PROLOG_TRACK_ALLOCATION
std::cerr << "removing " << typeid(*p).name()
<< " at " << std::hex << (void*) p << std::endl;
#endif
if (s.erase(p) != 1) {
std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
" attempt to deallocate a nonexistent polyhedron."
<< std::endl;
abort();
}
}
template <typename T>
void
Allocation_Tracker::check(const T* p) const {
if (s.find(p) == s.end()
&& weak_s.find(p) == weak_s.end()) {
std::cerr << "Interfaces::Prolog::Allocation_Tracker:"
" attempt to access a nonexistent "
<< typeid(*p).name()
<< " at " << std::hex << (void*) p << std::endl;
abort();
}
}
#endif // PROLOG_TRACK_ALLOCATION || NOISY_PROLOG_TRACK_ALLOCATION
#endif // !defined(PPL_ppl_prolog_common_inlines_hh)
|
