mirror of
https://github.com/boostorg/interprocess.git
synced 2026-01-19 04:12:13 +00:00
48990c0766
Source breaking: A shared memory object is now used including shared_memory_object.hpp header instead of shared memory.hpp. ABI breaking: Changed global mutex when initializing managed shared memory and memory mapped files. This change tries to minimize deadlocks. Source breaking: Changed shared memory, memory mapped files and mapped region's open mode to a single boost::interprocess::mode_t type. Added extra WIN32_LEAN_AND_MEAN before including DateTime headers to avoid socket redefinition errors when using Interprocess and Asio in windows. ABI breaking: mapped_region constructor no longer requires classes derived from memory_mappable, but classes the fulfill the MemoryMappable concept. Added in-place reallocation capabilities to basic_string. ABI breaking: Reimplemented and optimized small string optimization. The narrow string class has zero byte overhead with an internal 11 byte buffer in 32 systems! Added move semantics to containers. Experimental and not documented yet. Improves performance when using containers of containers. ABI breaking: End nodes of node containers (list, slist, map/set) are now embedded in the containers instead of allocated using the allocator. This allows no-throw move-constructors and improves performance. ABI breaking: slist and list containers now have constant-time size() function. The size of the container is added as a member. [SVN r35618]
67 lines
1.9 KiB
C++
67 lines
1.9 KiB
C++
#include <boost/interprocess/shared_memory_object.hpp>
|
|
#include <boost/interprocess/mapped_region.hpp>
|
|
#include <boost/interprocess/sync/scoped_lock.hpp>
|
|
#include <iostream>
|
|
#include <cstdio>
|
|
#include "doc_anonymous_condition_shared_data.hpp"
|
|
|
|
using namespace boost::interprocess;
|
|
|
|
int main ()
|
|
{
|
|
try{
|
|
//Erase previous shared memory
|
|
shared_memory_object::remove("shared_memory");
|
|
|
|
//Create a shared memory object.
|
|
shared_memory_object shm
|
|
(create_only //only create
|
|
,"shared_memory" //name
|
|
,read_write //read-write mode
|
|
);
|
|
|
|
//Set size
|
|
shm.truncate(sizeof(trace_queue));
|
|
|
|
//Map the whole shared memory in this process
|
|
mapped_region region
|
|
(shm //What to map
|
|
,read_write //Map it as read-write
|
|
);
|
|
|
|
//Get the address of the mapped region
|
|
void * addr = region.get_address();
|
|
|
|
//Construct the shared structure in memory
|
|
trace_queue * data = new (addr) trace_queue;
|
|
|
|
const int NumMsg = 100;
|
|
|
|
for(int i = 0; i < NumMsg; ++i){
|
|
scoped_lock<interprocess_mutex> lock(data->mutex);
|
|
if(data->message_in){
|
|
data->cond_full.wait(lock);
|
|
}
|
|
if(i == (NumMsg-1))
|
|
std::sprintf(data->items, "%s", "last message");
|
|
else
|
|
std::sprintf(data->items, "%s_%d", "my_trace", i);
|
|
|
|
//Notify to the other process that there is a message
|
|
data->cond_empty.notify_one();
|
|
|
|
//Mark message buffer as full
|
|
data->message_in = true;
|
|
}
|
|
}
|
|
catch(interprocess_exception &ex){
|
|
std::cout << ex.what() << std::endl;
|
|
return 1;
|
|
}
|
|
|
|
//Erase shared memory
|
|
shared_memory_object::remove("shared_memory");
|
|
|
|
return 0;
|
|
}
|