{{ message }}
forked from boostorg/interprocess
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathshared_memory_mapping_test.cpp
More file actions
257 lines (230 loc) · 8.79 KB
/
Copy pathshared_memory_mapping_test.cpp
File metadata and controls
257 lines (230 loc) · 8.79 KB
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2004-2012. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/interprocess for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#include <fstream>
#include <iostream>
#include <boost/interprocess/shared_memory_object.hpp>
#include <boost/interprocess/mapped_region.hpp>
#include <boost/interprocess/anonymous_shared_memory.hpp>
#include <string>
#include "get_process_id_name.hpp"
using namespace boost::interprocess;
shared_memory_object get_shared_memory_mapping()
{
shared_memory_object sh;
return shared_memory_object(boost::move(sh));
}
int main ()
{
std::string process_id = test::get_process_id_name();
std::string process_id2(process_id);
process_id2 += "_2";
BOOST_INTERPROCESS_TRY{
const std::size_t FileSize = 99999*4;
{
//Remove shared memory
shared_memory_object::remove(process_id.c_str());
shared_memory_object::remove(process_id2.c_str());
//Create shared memory and file mapping
shared_memory_object mapping(create_only, process_id.c_str(), read_write);
mapping.truncate(FileSize);
}
{
//Create a file mapping
shared_memory_object mapping(open_only, process_id.c_str(), read_write);
//Create two mapped regions, one half of the file each
mapped_region region (mapping
,read_write
,0
,FileSize/2
,0);
mapped_region region2(mapping
,read_write
,FileSize/2
,FileSize - FileSize/2
,0);
//Fill two regions with a pattern
unsigned char *filler = static_cast<unsigned char*>(region.get_address());
for(std::size_t i = 0
;i < FileSize/2
;++i){
*filler++ = static_cast<unsigned char>(i);
}
filler = static_cast<unsigned char*>(region2.get_address());
for(std::size_t i = FileSize/2
;i < FileSize
;++i){
*filler++ = static_cast<unsigned char>(i);
}
if(!region.flush(0, 0, false)){
return 1;
}
if(!region2.flush(0, 0, true)){
return 1;
}
}
//See if the pattern is correct in the file using two mapped regions
{
//Create a file mapping
shared_memory_object mapping(open_only, process_id.c_str(), read_write);
mapped_region region(mapping, read_write, 0, FileSize/2, 0);
mapped_region region2(mapping, read_write, FileSize/2, FileSize - FileSize/2, 0);
unsigned char *checker = static_cast<unsigned char*>(region.get_address());
//Check pattern
for(std::size_t i = 0
;i < FileSize/2
;++i){
if(*checker++ != static_cast<unsigned char>(i)){
return 1;
}
}
//Check second half
checker = static_cast<unsigned char *>(region2.get_address());
//Check pattern
for(std::size_t i = FileSize/2
;i < FileSize
;++i){
if(*checker++ != static_cast<unsigned char>(i)){
return 1;
}
}
}
#ifdef BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES
//Now check the pattern mapping a single read only mapped_region
{
//Create a file mapping
shared_memory_object mapping(open_only, test::get_process_id_wname(), read_only);
//Create a single regions, mapping all the file
mapped_region region (mapping, read_only);
//Check pattern
unsigned char *pattern = static_cast<unsigned char*>(region.get_address());
for(std::size_t i = 0
;i < FileSize
;++i, ++pattern){
if(*pattern != static_cast<unsigned char>(i)){
return 1;
}
}
}
#endif //BOOST_INTERPROCESS_WCHAR_NAMED_RESOURCES
//Now check the pattern mapping a single read only mapped_region
{
//Create a file mapping
shared_memory_object mapping(open_only, process_id.c_str(), read_only);
//Create a single regions, mapping all the file
mapped_region region (mapping, read_only);
//Check pattern
unsigned char *pattern = static_cast<unsigned char*>(region.get_address());
for(std::size_t i = 0
;i < FileSize
;++i, ++pattern){
if(*pattern != static_cast<unsigned char>(i)){
return 1;
}
}
//Now shrink
const std::size_t original_region_size = region.get_size();
if(!region.shrink_by(region.get_size()/2, false) || region.get_size() != original_region_size/2){
return 1;
}
const std::size_t shrunk_region_size = region.get_size();
if(!region.shrink_by(region.get_size()/2, true) || region.get_size() != shrunk_region_size/2){
return 1;
}
//Now advise
#if defined(POSIX_MADV_NORMAL) || defined(MADV_NORMAL)
std::cout << "Advice normal" << std::endl;
if(!region.advise(mapped_region::advice_normal)){
return 1;
}
#endif
#if defined(POSIX_MADV_SEQUENTIAL) || defined(MADV_SEQUENTIAL)
std::cout << "Advice sequential" << std::endl;
if(!region.advise(mapped_region::advice_sequential)){
return 1;
}
#endif
#if defined(POSIX_MADV_RANDOM) || defined(MADV_RANDOM)
std::cout << "Advice random" << std::endl;
if(!region.advise(mapped_region::advice_random)){
return 1;
}
#endif
#if defined(POSIX_MADV_WILLNEED) || defined(MADV_WILLNEED)
std::cout << "Advice 'will need'" << std::endl;
if(!region.advise(mapped_region::advice_willneed)){
return 1;
}
#endif
#if defined(POSIX_MADV_DONTNEED) || (defined(MADV_DONTNEED) && defined(BOOST_INTERPROCESS_MADV_DONTNEED_HAS_NONDESTRUCTIVE_SEMANTICS))
std::cout << "Advice 'dont't need'" << std::endl;
if(!region.advise(mapped_region::advice_dontneed)){
return 1;
}
#endif
}
{
//Check for busy address space
shared_memory_object mapping(open_only, process_id.c_str(), read_only);
mapped_region region (mapping, read_only);
shared_memory_object mapping2(create_only, process_id2.c_str(), read_write);
mapping2.truncate(FileSize);
BOOST_INTERPROCESS_TRY{
mapped_region region2 (mapping2, read_only, 0, FileSize, region.get_address());
}
BOOST_INTERPROCESS_CATCH(interprocess_exception &e){
shared_memory_object::remove(process_id2.c_str());
if(e.get_error_code() != busy_error){
throw e;
}
}
BOOST_INTERPROCESS_CATCH(std::exception &){
shared_memory_object::remove(process_id2.c_str());
BOOST_INTERPROCESS_RETHROW
} BOOST_INTERPROCESS_CATCH_END
shared_memory_object::remove(process_id2.c_str());
}
{
//Now check anonymous mapping
mapped_region region(anonymous_shared_memory(FileSize));
//Write pattern
unsigned char *pattern = static_cast<unsigned char*>(region.get_address());
for(std::size_t i = 0
;i < FileSize
;++i, ++pattern){
*pattern = static_cast<unsigned char>(i);
}
//Check pattern
pattern = static_cast<unsigned char*>(region.get_address());
for(std::size_t i = 0
;i < FileSize
;++i, ++pattern){
if(*pattern != static_cast<unsigned char>(i)){
return 1;
}
}
}
{
//Now test move semantics
shared_memory_object mapping(open_only, process_id.c_str(), read_write);
shared_memory_object move_ctor(boost::move(mapping));
shared_memory_object move_assign;
move_assign = boost::move(move_ctor);
shared_memory_object ret(get_shared_memory_mapping());
}
}
BOOST_INTERPROCESS_CATCH(std::exception &exc){
shared_memory_object::remove(process_id.c_str());
shared_memory_object::remove(process_id2.c_str());
std::cout << "Unhandled exception: " << exc.what() << std::endl;
return 1;
} BOOST_INTERPROCESS_CATCH_END
shared_memory_object::remove(process_id.c_str());
return 0;
}
You can’t perform that action at this time.