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
|
#include "ace/OS_NS_unistd.h"
#include "ace/Sbrk_Memory_Pool.h"
#include "ace/Log_Category.h"
#include "ace/Malloc_Base.h"
#if !defined (ACE_LACKS_SBRK)
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
ACE_ALLOC_HOOK_DEFINE(ACE_Sbrk_Memory_Pool)
// Ask system for more local memory via sbrk(2).
void *
ACE_Sbrk_Memory_Pool::acquire (size_t nbytes,
size_t &rounded_bytes)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::acquire");
rounded_bytes = this->round_up (nbytes);
// ACELIB_DEBUG ((LM_DEBUG, ACE_TEXT ("(%P|%t) acquiring more chunks, nbytes = %d, rounded_bytes = %d\n"), nbytes, rounded_bytes));
void *cp = ACE_OS::sbrk (rounded_bytes);
if (cp == MAP_FAILED)
ACELIB_ERROR_RETURN ((LM_ERROR,
"(%P|%t) cp = %u\n",
cp),
0);
else
// ACELIB_DEBUG ((LM_DEBUG, ACE_TEXT ("(%P|%t) acquired more chunks, nbytes = %d, rounded_bytes = %d, new break = %u\n"), nbytes, rounded_bytes, cp));
return cp;
}
/* No-op for now... */
int
ACE_Sbrk_Memory_Pool::release (int)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::release");
return 0;
}
int
ACE_Sbrk_Memory_Pool::sync (ssize_t, int)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::sync");
return 0;
}
int
ACE_Sbrk_Memory_Pool::sync (void *, size_t, int)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::sync");
return 0;
}
int
ACE_Sbrk_Memory_Pool::protect (ssize_t, int)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::protect");
return 0;
}
int
ACE_Sbrk_Memory_Pool::protect (void *, size_t, int)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::protect");
return 0;
}
// Ask system for initial chunk of local memory.
void *
ACE_Sbrk_Memory_Pool::init_acquire (size_t nbytes,
size_t &rounded_bytes,
int &first_time)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::init_acquire");
// Note that we assume that when ACE_Sbrk_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_Sbrk_Memory_Pool::dump () const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Sbrk_Memory_Pool::dump");
#endif /* ACE_HAS_DUMP */
}
ACE_Sbrk_Memory_Pool::ACE_Sbrk_Memory_Pool (const ACE_TCHAR *,
const OPTIONS *)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::ACE_Sbrk_Memory_Pool");
}
ACE_Sbrk_Memory_Pool::~ACE_Sbrk_Memory_Pool ()
{
}
void *
ACE_Sbrk_Memory_Pool::base_addr () const
{
return 0;
}
// Round up the request to a multiple of the page size.
size_t
ACE_Sbrk_Memory_Pool::round_up (size_t nbytes)
{
ACE_TRACE ("ACE_Sbrk_Memory_Pool::round_up");
return ACE::round_to_pagesize (nbytes);
}
ACE_END_VERSIONED_NAMESPACE_DECL
#endif /* !ACE_LACKS_SBRK */
|
