////////////////////////////////////////////////////////////////////////////// // // (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 #include #include #include #include #include #include #include #include "print_container.hpp" #include "check_equal_containers.hpp" #include "dummy_test_allocator.hpp" #include "movable_int.hpp" #include #include "allocator_v1.hpp" #include #include #include #include #include #include "get_process_id_name.hpp" #include "emplace_test.hpp" /////////////////////////////////////////////////////////////////// // // // This example repeats the same operations with std::deque and // // shmem_deque using the node allocator // // and compares the values of both containers // // // /////////////////////////////////////////////////////////////////// using namespace boost::interprocess; //Function to check if both sets are equal template bool copyable_only(V1 *, V2 *, ipcdetail::false_type) { return true; } //Function to check if both sets are equal template bool copyable_only(V1 *shmdeque, V2 *stddeque, ipcdetail::true_type) { typedef typename V1::value_type IntType; std::size_t size = shmdeque->size(); stddeque->insert(stddeque->end(), 50, 1); shmdeque->insert(shmdeque->end(), 50, IntType(1)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; { IntType move_me(1); stddeque->insert(stddeque->begin()+size/2, 50, 1); shmdeque->insert(shmdeque->begin()+size/2, 50, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } { IntType move_me(2); shmdeque->assign(shmdeque->size()/2, boost::move(move_me)); stddeque->assign(stddeque->size()/2, 2); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } { IntType move_me(1); stddeque->clear(); shmdeque->clear(); stddeque->insert(stddeque->begin(), 50, 1); shmdeque->insert(shmdeque->begin(), 50, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; stddeque->insert(stddeque->begin()+20, 50, 1); shmdeque->insert(shmdeque->begin()+20, 50, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; stddeque->insert(stddeque->begin()+20, 20, 1); shmdeque->insert(shmdeque->begin()+20, 20, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } { IntType move_me(1); stddeque->clear(); shmdeque->clear(); stddeque->insert(stddeque->end(), 50, 1); shmdeque->insert(shmdeque->end(), 50, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; stddeque->insert(stddeque->end()-20, 50, 1); shmdeque->insert(shmdeque->end()-20, 50, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; stddeque->insert(stddeque->end()-20, 20, 1); shmdeque->insert(shmdeque->end()-20, 20, boost::move(move_me)); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } return true; } template class AllocatorType > bool do_test() { //Customize managed_shared_memory class typedef basic_managed_shared_memory , rbtree_best_fit, //flat_map_index iset_index > my_managed_shared_memory; //Alias AllocatorType type typedef AllocatorType shmem_allocator_t; //Alias deque types typedef deque MyShmDeque; typedef std::deque MyStdDeque; const int Memsize = 65536; const char *const shMemName = test::get_process_id_name(); const int max = 100; /*try*/{ shared_memory_object::remove(shMemName); //Create shared memory my_managed_shared_memory segment(create_only, shMemName, Memsize); segment.reserve_named_objects(100); //Shared memory allocator must be always be initialized //since it has no default constructor MyShmDeque *shmdeque = segment.template construct("MyShmDeque") (segment.get_segment_manager()); MyStdDeque *stddeque = new MyStdDeque; /*try*/{ //Compare several shared memory deque operations with std::deque for(int i = 0; i < max*50; ++i){ IntType move_me(i); shmdeque->insert(shmdeque->end(), boost::move(move_me)); stddeque->insert(stddeque->end(), i); shmdeque->insert(shmdeque->end(), IntType(i)); stddeque->insert(stddeque->end(), int(i)); } if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; shmdeque->clear(); stddeque->clear(); for(int i = 0; i < max*50; ++i){ IntType move_me(i); shmdeque->push_back(boost::move(move_me)); stddeque->push_back(i); shmdeque->push_back(IntType(i)); stddeque->push_back(i); } if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; shmdeque->clear(); stddeque->clear(); for(int i = 0; i < max*50; ++i){ IntType move_me(i); shmdeque->push_front(boost::move(move_me)); stddeque->push_front(i); shmdeque->push_front(IntType(i)); stddeque->push_front(int(i)); } if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; typename MyShmDeque::iterator it; typename MyShmDeque::const_iterator cit = it; (void)cit; shmdeque->erase(shmdeque->begin()++); stddeque->erase(stddeque->begin()++); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; shmdeque->erase(shmdeque->begin()); stddeque->erase(stddeque->begin()); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; { //Initialize values IntType aux_vect[50]; for(int i = 0; i < 50; ++i){ IntType move_me (-1); aux_vect[i] = boost::move(move_me); } int aux_vect2[50]; for(int i = 0; i < 50; ++i){ aux_vect2[i] = -1; } shmdeque->insert(shmdeque->end() ,::boost::make_move_iterator(&aux_vect[0]) ,::boost::make_move_iterator(aux_vect + 50)); stddeque->insert(stddeque->end(), aux_vect2, aux_vect2 + 50); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; for(int i = 0, j = static_cast(shmdeque->size()); i < j; ++i){ shmdeque->erase(shmdeque->begin()); stddeque->erase(stddeque->begin()); } if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } { IntType aux_vect[50]; for(int i = 0; i < 50; ++i){ IntType move_me(-1); aux_vect[i] = boost::move(move_me); } int aux_vect2[50]; for(int i = 0; i < 50; ++i){ aux_vect2[i] = -1; } shmdeque->insert(shmdeque->begin() ,::boost::make_move_iterator(&aux_vect[0]) ,::boost::make_move_iterator(aux_vect + 50)); stddeque->insert(stddeque->begin(), aux_vect2, aux_vect2 + 50); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; } if(!copyable_only(shmdeque, stddeque ,ipcdetail::bool_::value>())){ return false; } shmdeque->erase(shmdeque->begin()); stddeque->erase(stddeque->begin()); if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; for(int i = 0; i < max; ++i){ IntType move_me(i); shmdeque->insert(shmdeque->begin(), boost::move(move_me)); stddeque->insert(stddeque->begin(), i); } if(!test::CheckEqualContainers(shmdeque, stddeque)) return false; //Test insertion from list { std::list l(50, int(1)); shmdeque->insert(shmdeque->begin(), l.begin(), l.end()); stddeque->insert(stddeque->begin(), l.begin(), l.end()); if(!test::CheckEqualContainers(shmdeque, stddeque)) return 1; shmdeque->assign(l.begin(), l.end()); stddeque->assign(l.begin(), l.end()); if(!test::CheckEqualContainers(shmdeque, stddeque)) return 1; } shmdeque->resize(100); stddeque->resize(100); if(!test::CheckEqualContainers(shmdeque, stddeque)) return 1; shmdeque->resize(200); stddeque->resize(200); if(!test::CheckEqualContainers(shmdeque, stddeque)) return 1; segment.template destroy("MyShmDeque"); delete stddeque; segment.shrink_to_fit_indexes(); if(!segment.all_memory_deallocated()) return false; }/* catch(std::exception &ex){ std::cout << ex.what() << std::endl; return false; }*/ std::cout << std::endl << "Test OK!" << std::endl; }/* catch(...){ shared_memory_object::remove(shMemName); throw; }*/ shared_memory_object::remove(shMemName); return true; } int main () { if(!do_test()) return 1; if(!do_test()) return 1; if(!do_test()) return 1; if(!do_test()) return 1; const test::EmplaceOptions Options = (test::EmplaceOptions)(test::EMPLACE_BACK | test::EMPLACE_FRONT | test::EMPLACE_BEFORE); if(!boost::interprocess::test::test_emplace < deque, Options>()) return 1; return 0; } #include