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
145
146
147
148
149
150
|
#include "ace/Local_Memory_Pool.h"
#include "ace/OS_Memory.h"
#include "ace/Log_Category.h"
#include <memory>
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
ACE_ALLOC_HOOK_DEFINE(ACE_Local_Memory_Pool)
void
ACE_Local_Memory_Pool::dump () const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Local_Memory_Pool::dump");
#endif /* ACE_HAS_DUMP */
}
ACE_Local_Memory_Pool::ACE_Local_Memory_Pool (const ACE_TCHAR *,
const OPTIONS *)
{
ACE_TRACE ("ACE_Local_Memory_Pool::ACE_Local_Memory_Pool");
}
ACE_Local_Memory_Pool::~ACE_Local_Memory_Pool ()
{
// Free up all memory allocated by this pool.
this->release ();
}
// Ask system for initial chunk of local memory.
void *
ACE_Local_Memory_Pool::init_acquire (size_t nbytes,
size_t &rounded_bytes,
int &first_time)
{
ACE_TRACE ("ACE_Local_Memory_Pool::init_acquire");
// Note that we assume that when ACE_Local_Memory_Pool is used,
// ACE_Malloc's constructor will only get called once. If this
// assumption doesn't hold, we are in deep trouble!
first_time = 1;
return this->acquire (nbytes, rounded_bytes);
}
void *
ACE_Local_Memory_Pool::acquire (size_t nbytes,
size_t &rounded_bytes)
{
ACE_TRACE ("ACE_Local_Memory_Pool::acquire");
rounded_bytes = this->round_up (nbytes);
char *temp = 0;
#if defined (ACE_HAS_ALLOC_HOOKS)
ACE_ALLOCATOR_RETURN (temp,
static_cast<char*>(ACE_Allocator::instance()->malloc(sizeof(char) * rounded_bytes)),
0);
#else
ACE_NEW_RETURN (temp,
char[rounded_bytes],
0);
#endif /* ACE_HAS_ALLOC_HOOKS */
std::unique_ptr<char[]> cp (temp);
if (this->allocated_chunks_.insert (cp.get ()) != 0)
ACELIB_ERROR_RETURN ((LM_ERROR,
ACE_TEXT ("(%P|%t) insertion into set failed\n")),
0);
return cp.release ();
}
int
ACE_Local_Memory_Pool::release (int)
{
ACE_TRACE ("ACE_Local_Memory_Pool::release");
// Zap the memory we allocated.
for (ACE_Unbounded_Set<char *>::iterator i = this->allocated_chunks_.begin ();
i != this->allocated_chunks_.end ();
++i)
#if defined (ACE_HAS_ALLOC_HOOKS)
ACE_Allocator::instance()->free(*i);
#else
delete [] *i;
#endif /* ACE_HAS_ALLOC_HOOKS */
this->allocated_chunks_.reset ();
return 0;
}
int
ACE_Local_Memory_Pool::sync (ssize_t, int)
{
ACE_TRACE ("ACE_Local_Memory_Pool::sync");
return 0;
}
int
ACE_Local_Memory_Pool::sync (void *, size_t, int)
{
ACE_TRACE ("ACE_Local_Memory_Pool::sync");
return 0;
}
int
ACE_Local_Memory_Pool::protect (ssize_t, int)
{
ACE_TRACE ("ACE_Local_Memory_Pool::protect");
return 0;
}
int
ACE_Local_Memory_Pool::protect (void *, size_t, int)
{
ACE_TRACE ("ACE_Local_Memory_Pool::protect");
return 0;
}
#if defined (ACE_WIN32)
int
ACE_Local_Memory_Pool::seh_selector (void *)
{
return 0;
// Continue propagate the structural exception up.
}
#endif /* ACE_WIN32 */
int
ACE_Local_Memory_Pool::remap (void *)
{
return 0;
// Not much can be done.
}
void *
ACE_Local_Memory_Pool::base_addr () const
{
return 0;
}
// Let the underlying new operator figure out the alignment...
size_t
ACE_Local_Memory_Pool::round_up (size_t nbytes)
{
ACE_TRACE ("ACE_Local_Memory_Pool::round_up");
return ACE::round_to_pagesize (nbytes);
}
ACE_END_VERSIONED_NAMESPACE_DECL
|
