I'm trying to construct a map in shared memory of the following type
I create the shared memory region like this :
managed_shared_memory segment(create_only ,"MyMap" ,size);
ShMemAllocator_t alloc_inst (segment.get_segment_manager());
map = segment.construct<MyMap_t>("MyMap")
(std::less<int>()
,alloc_inst);
The values in the map are as follows:
typedef pair<MutexType, boost::interprocess::offset_ptr<void> > ValueType ;
MutexType is itself a structure containing a read and a write mutex (using read_lock and write_lock) ; defined as follows:
typedef struct mutex_struct{
sharable_lock<interprocess_mutex> read_lock(interprocess_mutex, defer_lock);
scoped_lock<interprocess_mutex> write_lock(interprocess_mutex, defer_lock);
} MutexType;
"size" is the total size of the map (in terms of objects, so the sum of the data size pointed to by all the void pointers).
How can I ensure that this void* data is also located in this memory segment I created, how do I instantiate it within the existing shared memory region). The reason for doing this is that I want to allocate this large buffer once only but repeatedly removing/adding objects to it (the map models a cache) I have yet to find a way in which multiple objects can be allocated within the same memory segment within a map. Furthermore, seeking to allocate the MutexType pair returns a compilation error stating that no "call" operator is provided.
You are basically already there. Call whatever object type that you are allocating in shared memory SecondValue_t
. Instead of ShMemAllocator_t
, define a different interprocess allocator type, say SecondValueAllocator_t
, for allocating the SecondValue_t
objects. Whenever you want to insert a ValueType
object into the map, the second value of the ValueType
object is allocated with the SecondValueAllocator_t
instance.
Here is a complete example, partly using the code in my answer for Interprocess reader/writer lock with Boost:
#include <cstdlib>
#include <functional>
#include <iostream>
#include <string>
#include <utility>
#include <boost/scope_exit.hpp>
#include <boost/interprocess/managed_shared_memory.hpp>
#include <boost/interprocess/allocators/allocator.hpp>
#include <boost/interprocess/allocators/private_node_allocator.hpp>
#include <boost/interprocess/containers/map.hpp>
#include <boost/interprocess/sync/interprocess_upgradable_mutex.hpp>
#include <boost/interprocess/sync/scoped_lock.hpp>
#include <boost/interprocess/sync/sharable_lock.hpp>
#include <boost/interprocess/sync/upgradable_lock.hpp>
#define SHARED_MEMORY_NAME "SO13783012-MyMap"
// https://stackoverflow.com/questions/13783012/map-of-int-void-in-shared-memory-using-boostinterprocess
using namespace boost::interprocess;
typedef int SecondValue_t;
typedef allocator<SecondValue_t, managed_shared_memory::segment_manager> SecondValueAllocator_t;
typedef struct mutex_struct {
//...
} MutexType;
typedef std::pair<MutexType, SecondValueAllocator_t::pointer> ValueType;
typedef map<int, ValueType>::value_type MyMapValueType;
typedef allocator<MyMapValueType, managed_shared_memory::segment_manager> MyMapEntryAllocator_t;
typedef map<int, ValueType, std::less<int>, MyMapEntryAllocator_t> MyMap_t;
struct shared_data {
private:
typedef boost::interprocess::interprocess_upgradable_mutex upgradable_mutex_type;
mutable upgradable_mutex_type mutex;
MyMap_t my_map;
public:
shared_data(const MyMapEntryAllocator_t& alloc)
: my_map(MyMap_t::key_compare(), alloc)
{
}
// Tries to get the mapped value for the given key `k'. If successful, the mapped value is
// copied into `out' and `true' is returned. Otherwise, returns `false' and does not modify
// `out'.
bool try_get(MyMap_t::mapped_type& out, MyMap_t::key_type k) const {
boost::interprocess::sharable_lock<upgradable_mutex_type> lock(mutex);
MyMap_t::const_iterator pos = my_map.find(k);
if (pos != my_map.end()) {
out = pos->second;
return true;
}
return false;
}
void put(MyMap_t::key_type k, MyMap_t::mapped_type v) {
boost::interprocess::scoped_lock<upgradable_mutex_type> lock(mutex);
my_map.insert(MyMap_t::value_type(my_map.size(), v));
}
};
int main(int argc, char *argv[])
{
if (argc != 2) {
std::cerr << "Usage: " << argv[0] << " WHICH\n";
return EXIT_FAILURE;
}
const std::string which = argv[1];
if (which == "parent") {
shared_memory_object::remove(SHARED_MEMORY_NAME);
BOOST_SCOPE_EXIT(argc) {
shared_memory_object::remove(SHARED_MEMORY_NAME);
} BOOST_SCOPE_EXIT_END;
managed_shared_memory shm(create_only, SHARED_MEMORY_NAME, 65536);
MyMapEntryAllocator_t entry_alloc(shm.get_segment_manager());
shared_data& d = *shm.construct<shared_data>("theSharedData")(entry_alloc);
SecondValueAllocator_t second_value_alloc(shm.get_segment_manager());
// Insert some test data.
SecondValueAllocator_t::pointer p;
p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, -3);
d.put(0, std::make_pair(MutexType(), p));
p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, 70);
d.put(1, std::make_pair(MutexType(), p));
p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, -18);
d.put(2, std::make_pair(MutexType(), p));
p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, 44);
d.put(3, std::make_pair(MutexType(), p));
p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, 0);
d.put(4, std::make_pair(MutexType(), p));
// Go to sleep for a minute - gives us a chance to start a child process.
sleep(60);
} else {
managed_shared_memory shm(open_only, SHARED_MEMORY_NAME);
std::pair<shared_data *, std::size_t> find_res = shm.find<shared_data>("theSharedData");
if (!find_res.first) {
std::cerr << "Failed to find `theSharedData'.\n";
return EXIT_FAILURE;
}
shared_data& d = *find_res.first;
MyMap_t::mapped_type v;
int i = 0;
for (; d.try_get(v, i); ++i) {
std::cout << i << ": " << *v.second << '\n';
}
// Add an entry.
srand(time(NULL));
SecondValueAllocator_t second_value_alloc(shm.get_segment_manager());
SecondValueAllocator_t::pointer p = second_value_alloc.allocate(1);
second_value_alloc.construct(p, (rand() % 200) - 100);
d.put(i, v = std::make_pair(MutexType(), p));
std::cout << "placed " << *v.second << " into the map.\n";
}
return EXIT_SUCCESS;
}
Test it out by starting the parent process first:
./SO13783012 parent
Then some children:
./SO13783012 child
Sample output:
> ./SO13783012 child 0: -3 1: 70 2: -18 3: 44 4: 0 placed 5: -63 into the map. > ./SO13783012 child 0: -3 1: 70 2: -18 3: 44 4: 0 5: -63 placed 6: -42 into the map. > ./SO13783012 child 0: -3 1: 70 2: -18 3: 44 4: 0 5: -63 6: -42 placed 7: -28 into the map.
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With