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
|
/* -*- C++ -*- */
//=============================================================================
/**
* @file Memory_Pool.h
*
* $Id$
*
* @author Dougls C. Schmidt <schmidt@cs.wustl.edu>
* @author Prashant Jain <pjain@cs.wustl.edu>
*/
//=============================================================================
#ifndef ACE_LOCAL_MEMORY_POOL_H
#define ACE_LOCAL_MEMORY_POOL_H
#include /**/ "ace/pre.h"
#include "ace/ACE.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
#include "ace/Unbounded_Set.h"
/**
* @class ACE_Local_Memory_Pool_Options
*
* @brief Helper class for Local Memory Pool constructor options.
*
* This should be a nested class, but that breaks too many
* compilers.
*/
class ACE_Export ACE_Local_Memory_Pool_Options
{
};
/**
* @class ACE_Local_Memory_Pool
*
* @brief Make a memory pool that is based on C++ new/delete. This is
* useful for integrating existing components that use new/delete
* into the ACE Malloc scheme...
*/
class ACE_Export ACE_Local_Memory_Pool
{
public:
typedef ACE_Local_Memory_Pool_Options OPTIONS;
/// Initialize the pool.
ACE_Local_Memory_Pool (const ACE_TCHAR *backing_store_name = 0,
const OPTIONS *options = 0);
virtual ~ACE_Local_Memory_Pool (void);
/// Ask system for initial chunk of local memory.
virtual void *init_acquire (size_t nbytes,
size_t &rounded_bytes,
int &first_time);
/// Acquire at least @a nbytes from the memory pool. @a rounded_bytes is
/// the actual number of bytes allocated.
virtual void *acquire (size_t nbytes,
size_t &rounded_bytes);
/// Instruct the memory pool to release all of its resources.
virtual int release (int destroy = 1);
/**
* Sync <len> bytes of the memory region to the backing store
* starting at <this->base_addr_>. If <len> == -1 then sync the
* whole region.
*/
virtual int sync (ssize_t len = -1, int flags = MS_SYNC);
/// Sync <len> bytes of the memory region to the backing store
/// starting at <addr_>.
virtual int sync (void *addr, size_t len, int flags = MS_SYNC);
/**
* Change the protection of the pages of the mapped region to <prot>
* starting at <this->base_addr_> up to <len> bytes. If <len> == -1
* then change protection of all pages in the mapped region.
*/
virtual int protect (ssize_t len = -1, int prot = PROT_RDWR);
/// Change the protection of the pages of the mapped region to <prot>
/// starting at <addr> up to <len> bytes.
virtual int protect (void *addr, size_t len, int prot = PROT_RDWR);
#if defined (ACE_WIN32)
/**
* Win32 Structural exception selector. The return value decides
* how to handle memory pool related structural exceptions. Returns
* 1, 0, or , -1.
*/
virtual int seh_selector (void *);
#endif /* ACE_WIN32 */
/**
* Try to extend the virtual address space so that <addr> is now
* covered by the address mapping. Always returns 0 since we can't
* remap a local memory pool.
*/
virtual int remap (void *addr);
/// Return the base address of this memory pool, 0 if base_addr
/// never changes.
virtual void *base_addr (void) const;
/// Dump the state of an object.
virtual void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
/// List of memory that we have allocated.
ACE_Unbounded_Set<char *> allocated_chunks_;
/// Implement the algorithm for rounding up the request to an
/// appropriate chunksize.
virtual size_t round_up (size_t nbytes);
};
#include /**/ "ace/post.h"
#endif /* ACE_LOCAL_MEMORY_POOL_H */
|