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
|
/* -*- C++ -*- */
// $Id$
// ============================================================================
//
// = LIBRARY
// ace
//
// = FILENAME
// Hash_Map_With_Allocator_T.h
//
// = AUTHOR
// Marina Spivak <marina@cs.wustl.edu> and
// Irfan Pyarali <irfan@cs.wustl.edu>
//
// ============================================================================
#ifndef ACE_HASH_MAP_WITH_ALLOCATOR_T_H
#define ACE_HASH_MAP_WITH_ALLOCATOR_T_H
#include "ace/Hash_Map_Manager.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
template <class EXT_ID, class INT_ID>
class ACE_Hash_Map_With_Allocator :
public ACE_Hash_Map_Manager<EXT_ID, INT_ID, ACE_Null_Mutex>
{
// = TITLE
// This class is a thin wrapper around ACE_Hash_Map_Manager,
// which comes handy when ACE_Hash_Map_Manager is to be used with a
// non-nil ACE_Allocator. This wrapper insures that the appropriate
// allocator is in place for every operation that accesses or
// updates the hash map.
//
// = DESCRIPTION
// If we use ACE_Hash_Map_Manager with a shared memory allocator
// (or memory-mapped file allocator, for example), the allocator
// pointer used by ACE_Hash_Map_Manager gets stored with it, in
// shared memory (or memory-mapped file). Naturally, this will
// cause horrible problems, since only the first process to set
// that pointer will be guaranteed the address of the allocator
// is meaningful! That is why we need this wrapper, which
// insures that appropriate allocator pointer is in place for
// each call.
//
public:
ACE_Hash_Map_With_Allocator (ACE_Allocator *alloc);
// Constructor.
ACE_Hash_Map_With_Allocator (size_t size,
ACE_Allocator *alloc);
// Constructor that specifies hash table size.
// = The following methods are Proxies to the corresponding methods
// in <ACE_Hash_Map_Manager>. Each method sets the allocator to
// the one specified by the invoking entity, and then calls the
// corresponding method in <ACE_Hash_Map_Manager> to do the
// actual work.
int bind (const EXT_ID &,
const INT_ID &,
ACE_Allocator *alloc);
int unbind (const EXT_ID &,
INT_ID &,
ACE_Allocator *alloc);
int rebind (const EXT_ID &,
const INT_ID &,
EXT_ID &,
INT_ID &,
ACE_Allocator *alloc);
int find (const EXT_ID &,
INT_ID &,
ACE_Allocator *alloc);
int close (ACE_Allocator *alloc);
};
#if defined (__ACE_INLINE__)
#include "ace/Hash_Map_With_Allocator_T.i"
#endif /* __ACE_INLINE__ */
#if defined (ACE_TEMPLATES_REQUIRE_SOURCE)
#include "ace/Hash_Map_With_Allocator_T.cpp"
#endif /* ACE_TEMPLATES_REQUIRE_SOURCE */
#if defined (ACE_TEMPLATES_REQUIRE_PRAGMA)
#pragma implementation ("Hash_Map_With_Allocator_T.cpp")
#endif /* ACE_TEMPLATES_REQUIRE_PRAGMA */
#endif /* ACE_HASH_MAP_WITH_ALLOCATOR_T_H */
|
