-
Notifications
You must be signed in to change notification settings - Fork 129
Expand file tree
/
Copy pathmemory_algorithm_test.cpp
More file actions
91 lines (80 loc) · 2.69 KB
/
memory_algorithm_test.cpp
File metadata and controls
91 lines (80 loc) · 2.69 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
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2006-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 <boost/interprocess/managed_shared_memory.hpp>
#include <boost/interprocess/mem_algo/simple_seq_fit.hpp>
#include <boost/interprocess/mem_algo/rbtree_best_fit.hpp>
#include <boost/interprocess/indexes/null_index.hpp>
#include <boost/interprocess/sync/mutex_family.hpp>
#include <boost/interprocess/detail/type_traits.hpp>
#include <boost/move/detail/type_traits.hpp> //make_unsigned, alignment_of
#include "memory_algorithm_test_template.hpp"
#include <iostream>
#include <string>
#include "get_process_id_name.hpp"
using namespace boost::interprocess;
const int Memsize = 16384;
const char *const shMemName = test::get_process_id_name();
int test_simple_seq_fit()
{
//A shared memory with simple sequential fit algorithm
typedef basic_managed_shared_memory
<char
,simple_seq_fit<mutex_family>
,null_index
> my_managed_shared_memory;
//Create shared memory
shared_memory_object::remove(shMemName);
my_managed_shared_memory segment(create_only, shMemName, Memsize);
shared_memory_object::remove(shMemName);
//Now take the segment manager and launch memory test
if(!test::test_all_allocation(*segment.get_segment_manager())){
return 1;
}
return 0;
}
template<std::size_t Alignment>
int test_rbtree_best_fit()
{
//A shared memory with red-black tree best fit algorithm
typedef basic_managed_shared_memory
<char
,rbtree_best_fit<mutex_family, offset_ptr<void>, Alignment>
,null_index
> my_managed_shared_memory;
//Create shared memory
shared_memory_object::remove(shMemName);
my_managed_shared_memory segment(create_only, shMemName, Memsize);
shared_memory_object::remove(shMemName);
//Now take the segment manager and launch memory test
if(!test::test_all_allocation(*segment.get_segment_manager())){
return 1;
}
return 0;
}
int main ()
{
const std::size_t void_ptr_align = ::boost::container::dtl::alignment_of<offset_ptr<void> >::value;
if(test_simple_seq_fit()){
return 1;
}
if(test_rbtree_best_fit<void_ptr_align>()){
return 1;
}
if(test_rbtree_best_fit<2*void_ptr_align>()){
return 1;
}
if(test_rbtree_best_fit<4*void_ptr_align>()){
return 1;
}
if (test_rbtree_best_fit<8*void_ptr_align>()) {
return 1;
}
return 0;
}