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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
/*
Copyright (C) 1998-99 Paul Barton-Davis
This program 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 2 of the License, or
(at your option) any later version.
This program 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., 675 Mass Ave, Cambridge, MA 02139, USA.
$Id$
*/
#include <iostream>
#include <vector>
#include <pbd/pool.h>
#include <pbd/error.h>
using namespace std;
using namespace PBD;
Pool::Pool (string n, unsigned long item_size, unsigned long nitems)
{
_name = n;
free_list = new RingBuffer<void*> (nitems);
/* since some overloaded ::operator new() might use this,
its important that we use a "lower level" allocator to
get more space.
*/
block = malloc (nitems * item_size);
void **ptrlist = (void **) malloc (sizeof (void *) * nitems);
for (unsigned long i = 0; i < nitems; i++) {
ptrlist[i] = static_cast<void *> (static_cast<char*>(block) + (i * item_size));
}
free_list->write (ptrlist, nitems);
free (ptrlist);
}
Pool::~Pool ()
{
free (block);
}
void *
Pool::alloc ()
{
void *ptr;
// cerr << _name << " pool " << " alloc, thread = " << pthread_name() << " space = " << free_list->read_space() << endl;
if (free_list->read (&ptr, 1) < 1) {
fatal << "CRITICAL: " << _name << " POOL OUT OF MEMORY - RECOMPILE WITH LARGER SIZE!!" << endmsg;
/*NOTREACHED*/
return 0;
} else {
return ptr;
}
};
void
Pool::release (void *ptr)
{
free_list->write (&ptr, 1);
// cerr << _name << ": release, now has " << free_list->read_space() << endl;
}
/*---------------------------------------------*/
MultiAllocSingleReleasePool::MultiAllocSingleReleasePool (string n, unsigned long isize, unsigned long nitems)
: Pool (n, isize, nitems),
m_lock(0)
{
}
MultiAllocSingleReleasePool::~MultiAllocSingleReleasePool ()
{
if(m_lock) delete m_lock;
}
SingleAllocMultiReleasePool::SingleAllocMultiReleasePool (string n, unsigned long isize, unsigned long nitems)
: Pool (n, isize, nitems),
m_lock(0)
{
}
SingleAllocMultiReleasePool::~SingleAllocMultiReleasePool ()
{
if(m_lock) delete m_lock;
}
void*
MultiAllocSingleReleasePool::alloc ()
{
void *ptr;
if(!m_lock) {
m_lock = new Glib::Mutex();
// umm, I'm not sure that this doesn't also allocate memory.
if(!m_lock) error << "cannot create Glib::Mutex in pool.cc" << endmsg;
}
Glib::Mutex::Lock guard(*m_lock);
ptr = Pool::alloc ();
return ptr;
}
void
MultiAllocSingleReleasePool::release (void* ptr)
{
Pool::release (ptr);
}
void*
SingleAllocMultiReleasePool::alloc ()
{
return Pool::alloc ();
}
void
SingleAllocMultiReleasePool::release (void* ptr)
{
if(!m_lock) {
m_lock = new Glib::Mutex();
// umm, I'm not sure that this doesn't also allocate memory.
if(!m_lock) error << "cannot create Glib::Mutex in pool.cc" << endmsg;
}
Glib::Mutex::Lock guard(*m_lock);
Pool::release (ptr);
}
|
