boost/interprocess
2
0
Fork 0
mirror of https://github.com/boostorg/interprocess.git synced 2026-01-24 18:02:21 +00:00
Code Issues Projects Releases Wiki Activity

Updated Interprocess and Intrusive:

Browse Source 
-> Added linear slist to intrusive
-> Updated all allocators to version 2 allocators in Interprocess
-> Optimized rbtree_best_fit size overhead to 1 std:size_t.

[SVN r42878]
This commit is contained in:
Ion Gaztañaga
2008-01-20 11:54:47 +00:00
parent 715769871f
commit 1a240759d3
127 changed files with 4675 additions and 2294 deletions
Download Patch File Download Diff File Expand all files Collapse all files

94
test/memory_algorithm_test.cpp
View File

@@ -19,47 +19,67 @@
#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);
//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);
//Now take the segment manager and launch memory test
if(!test::test_all_allocation(*segment.get_segment_manager())){
return 1;
}
return 0;
}
int main ()
{
using namespace boost::interprocess;
const int memsize = 16384;
const char *const shMemName = test::get_process_id_name();
{
//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);
//Now take the segment manager and launch memory test
if(!test::test_all_allocation(*segment.get_segment_manager())){
return 1;
}
if(test_simple_seq_fit()){
return 1;
}
if(test_rbtree_best_fit<4>()){
return 1;
}
if(test_rbtree_best_fit<8>()){
return 1;
}
if(test_rbtree_best_fit<16>()){
return 1;
}
{
//A shared memory with red-black tree best fit algorithm
typedef basic_managed_shared_memory
<char
,rbtree_best_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);
//Now take the segment manager and launch memory test
if(!test::test_all_allocation(*segment.get_segment_manager())){
return 1;
}
}
shared_memory_object::remove(shMemName);
return 0;
}