From be2e2cf5f3dc21c61c039635de1c7e804224ca13 Mon Sep 17 00:00:00 2001 From: khizmax Date: Thu, 11 Feb 2016 22:15:29 +0300 Subject: [PATCH] Moved RCU-based intrusive list tests to gtest framework --- projects/Win/vc14/gtest-list.vcxproj | 41 ++++ projects/Win/vc14/gtest-list.vcxproj.filters | 39 +++ test/unit/list/CMakeLists.txt | 10 + test/unit/list/intrusive_lazy_rcu_gpb.cpp | 41 ++++ test/unit/list/intrusive_lazy_rcu_gpi.cpp | 41 ++++ test/unit/list/intrusive_lazy_rcu_gpt.cpp | 41 ++++ test/unit/list/intrusive_lazy_rcu_shb.cpp | 45 ++++ test/unit/list/intrusive_lazy_rcu_sht.cpp | 45 ++++ test/unit/list/intrusive_michael_rcu_gpb.cpp | 41 ++++ test/unit/list/intrusive_michael_rcu_gpi.cpp | 41 ++++ test/unit/list/intrusive_michael_rcu_gpt.cpp | 41 ++++ test/unit/list/intrusive_michael_rcu_shb.cpp | 45 ++++ test/unit/list/intrusive_michael_rcu_sht.cpp | 45 ++++ test/unit/list/test_intrusive_lazy_rcu.h | 240 +++++++++++++++++++ test/unit/list/test_intrusive_list_nogc.h | 1 - test/unit/list/test_intrusive_list_rcu.h | 146 +++++++++++ test/unit/list/test_intrusive_michael_rcu.h | 240 +++++++++++++++++++ 17 files changed, 1142 insertions(+), 1 deletion(-) create mode 100644 test/unit/list/intrusive_lazy_rcu_gpb.cpp create mode 100644 test/unit/list/intrusive_lazy_rcu_gpi.cpp create mode 100644 test/unit/list/intrusive_lazy_rcu_gpt.cpp create mode 100644 test/unit/list/intrusive_lazy_rcu_shb.cpp create mode 100644 test/unit/list/intrusive_lazy_rcu_sht.cpp create mode 100644 test/unit/list/intrusive_michael_rcu_gpb.cpp create mode 100644 test/unit/list/intrusive_michael_rcu_gpi.cpp create mode 100644 test/unit/list/intrusive_michael_rcu_gpt.cpp create mode 100644 test/unit/list/intrusive_michael_rcu_shb.cpp create mode 100644 test/unit/list/intrusive_michael_rcu_sht.cpp create mode 100644 test/unit/list/test_intrusive_lazy_rcu.h create mode 100644 test/unit/list/test_intrusive_list_rcu.h create mode 100644 test/unit/list/test_intrusive_michael_rcu.h diff --git a/projects/Win/vc14/gtest-list.vcxproj b/projects/Win/vc14/gtest-list.vcxproj index c16acb51..d576b13f 100644 --- a/projects/Win/vc14/gtest-list.vcxproj +++ b/projects/Win/vc14/gtest-list.vcxproj @@ -27,16 +27,57 @@ + + + + + 4503 + 4503 + 4503 + 4503 + 4503 + 4503 + + + + 4503 + 4503 + 4503 + 4503 + 4503 + 4503 + + + + + 4503 + 4503 + 4503 + 4503 + 4503 + 4503 + + + + 4503 + 4503 + 4503 + 4503 + 4503 + 4503 + + + diff --git a/projects/Win/vc14/gtest-list.vcxproj.filters b/projects/Win/vc14/gtest-list.vcxproj.filters index 62ba8453..c696fc37 100644 --- a/projects/Win/vc14/gtest-list.vcxproj.filters +++ b/projects/Win/vc14/gtest-list.vcxproj.filters @@ -24,6 +24,15 @@ Header Files + + Header Files + + + Header Files + + + Header Files + @@ -47,5 +56,35 @@ Source Files + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + + + Source Files + \ No newline at end of file diff --git a/test/unit/list/CMakeLists.txt b/test/unit/list/CMakeLists.txt index 765e2bd8..040bdb28 100644 --- a/test/unit/list/CMakeLists.txt +++ b/test/unit/list/CMakeLists.txt @@ -5,9 +5,19 @@ set(CDSGTEST_LIST_SOURCES intrusive_lazy_hp.cpp intrusive_lazy_dhp.cpp intrusive_lazy_nogc.cpp + intrusive_lazy_rcu_gpb.cpp + intrusive_lazy_rcu_gpi.cpp + intrusive_lazy_rcu_gpt.cpp + intrusive_lazy_rcu_shb.cpp + intrusive_lazy_rcu_sht.cpp intrusive_michael_hp.cpp intrusive_michael_dhp.cpp intrusive_michael_nogc.cpp + intrusive_michael_rcu_gpb.cpp + intrusive_michael_rcu_gpi.cpp + intrusive_michael_rcu_gpt.cpp + intrusive_michael_rcu_shb.cpp + intrusive_michael_rcu_sht.cpp ) include_directories( diff --git a/test/unit/list/intrusive_lazy_rcu_gpb.cpp b/test/unit/list/intrusive_lazy_rcu_gpb.cpp new file mode 100644 index 00000000..90cc5fe6 --- /dev/null +++ b/test/unit/list/intrusive_lazy_rcu_gpb.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_lazy_rcu.h" + +namespace { + + typedef cds::urcu::general_buffered<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPB, IntrusiveLazyList, rcu_implementation ); diff --git a/test/unit/list/intrusive_lazy_rcu_gpi.cpp b/test/unit/list/intrusive_lazy_rcu_gpi.cpp new file mode 100644 index 00000000..4d889b5b --- /dev/null +++ b/test/unit/list/intrusive_lazy_rcu_gpi.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_lazy_rcu.h" + +namespace { + + typedef cds::urcu::general_instant<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPI, IntrusiveLazyList, rcu_implementation ); diff --git a/test/unit/list/intrusive_lazy_rcu_gpt.cpp b/test/unit/list/intrusive_lazy_rcu_gpt.cpp new file mode 100644 index 00000000..dd8b1abb --- /dev/null +++ b/test/unit/list/intrusive_lazy_rcu_gpt.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_lazy_rcu.h" + +namespace { + + typedef cds::urcu::general_threaded<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPT, IntrusiveLazyList, rcu_implementation ); diff --git a/test/unit/list/intrusive_lazy_rcu_shb.cpp b/test/unit/list/intrusive_lazy_rcu_shb.cpp new file mode 100644 index 00000000..9a1e7c12 --- /dev/null +++ b/test/unit/list/intrusive_lazy_rcu_shb.cpp @@ -0,0 +1,45 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED + +#include "test_intrusive_lazy_rcu.h" + +namespace { + + typedef cds::urcu::signal_buffered<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHB, IntrusiveLazyList, rcu_implementation ); + +#endif // #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED diff --git a/test/unit/list/intrusive_lazy_rcu_sht.cpp b/test/unit/list/intrusive_lazy_rcu_sht.cpp new file mode 100644 index 00000000..5a2d57f1 --- /dev/null +++ b/test/unit/list/intrusive_lazy_rcu_sht.cpp @@ -0,0 +1,45 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED + +#include "test_intrusive_lazy_rcu.h" + +namespace { + + typedef cds::urcu::signal_threaded<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHT, IntrusiveLazyList, rcu_implementation ); + +#endif // #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED diff --git a/test/unit/list/intrusive_michael_rcu_gpb.cpp b/test/unit/list/intrusive_michael_rcu_gpb.cpp new file mode 100644 index 00000000..4b494c9a --- /dev/null +++ b/test/unit/list/intrusive_michael_rcu_gpb.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_michael_rcu.h" + +namespace { + + typedef cds::urcu::general_buffered<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPB, IntrusiveMichaelList, rcu_implementation ); diff --git a/test/unit/list/intrusive_michael_rcu_gpi.cpp b/test/unit/list/intrusive_michael_rcu_gpi.cpp new file mode 100644 index 00000000..14465f39 --- /dev/null +++ b/test/unit/list/intrusive_michael_rcu_gpi.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_michael_rcu.h" + +namespace { + + typedef cds::urcu::general_instant<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPI, IntrusiveMichaelList, rcu_implementation ); diff --git a/test/unit/list/intrusive_michael_rcu_gpt.cpp b/test/unit/list/intrusive_michael_rcu_gpt.cpp new file mode 100644 index 00000000..1d2d767e --- /dev/null +++ b/test/unit/list/intrusive_michael_rcu_gpt.cpp @@ -0,0 +1,41 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#include "test_intrusive_michael_rcu.h" + +namespace { + + typedef cds::urcu::general_threaded<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPT, IntrusiveMichaelList, rcu_implementation ); diff --git a/test/unit/list/intrusive_michael_rcu_shb.cpp b/test/unit/list/intrusive_michael_rcu_shb.cpp new file mode 100644 index 00000000..7c408bb4 --- /dev/null +++ b/test/unit/list/intrusive_michael_rcu_shb.cpp @@ -0,0 +1,45 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED + +#include "test_intrusive_michael_rcu.h" + +namespace { + + typedef cds::urcu::signal_buffered<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHB, IntrusiveMichaelList, rcu_implementation ); + +#endif // #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED diff --git a/test/unit/list/intrusive_michael_rcu_sht.cpp b/test/unit/list/intrusive_michael_rcu_sht.cpp new file mode 100644 index 00000000..8d96f6fd --- /dev/null +++ b/test/unit/list/intrusive_michael_rcu_sht.cpp @@ -0,0 +1,45 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ + +#include + +#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED + +#include "test_intrusive_michael_rcu.h" + +namespace { + + typedef cds::urcu::signal_threaded<> rcu_implementation; + +} // namespace + +INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHT, IntrusiveMichaelList, rcu_implementation ); + +#endif // #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED diff --git a/test/unit/list/test_intrusive_lazy_rcu.h b/test/unit/list/test_intrusive_lazy_rcu.h new file mode 100644 index 00000000..6dfe773f --- /dev/null +++ b/test/unit/list/test_intrusive_lazy_rcu.h @@ -0,0 +1,240 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ +#ifndef CDSUNIT_LIST_TEST_INTRUSIVE_LAZY_LIST_RCU_H +#define CDSUNIT_LIST_TEST_INTRUSIVE_LAZY_LIST_RCU_H + +#include "test_intrusive_list_rcu.h" +#include + +namespace ci = cds::intrusive; + +template +class IntrusiveLazyList : public cds_test::intrusive_list_rcu +{ + typedef cds_test::intrusive_list_rcu base_class; +public: + typedef cds::urcu::gc rcu_type; + typedef typename base_class::base_item< ci::lazy_list::node< rcu_type >> base_item; + typedef typename base_class::member_item< ci::lazy_list::node< rcu_type >> member_item; + +protected: + void SetUp() + { + RCU::Construct(); + cds::threading::Manager::attachThread(); + } + + void TearDown() + { + cds::threading::Manager::detachThread(); + RCU::Destruct(); + } +}; + +TYPED_TEST_CASE_P( IntrusiveLazyList ); + +TYPED_TEST_P( IntrusiveLazyList, base_hook ) +{ + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::base_item, + typename ci::lazy_list::make_traits< + ci::opt::hook< ci::lazy_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >>> + , ci::opt::disposer< typename TestFixture::mock_disposer > + , cds::opt::less< typename TestFixture::template less< typename TestFixture::base_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, base_hook_cmp ) +{ + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::base_item, + typename ci::lazy_list::make_traits< + ci::opt::hook< ci::lazy_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >>> + , ci::opt::disposer< typename TestFixture::mock_disposer > + , cds::opt::compare< typename TestFixture::template cmp< typename TestFixture::base_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, base_hook_item_counting ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef typename TestFixture::template less< typename TestFixture::base_item > less; + typedef cds::atomicity::item_counter item_counter; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, base_hook_backoff ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef typename TestFixture::template less< typename TestFixture::base_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::backoff::pause back_off; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, base_hook_seqcst ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef cds::atomicity::item_counter item_counter; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, member_hook ) +{ + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::member_item, + typename ci::lazy_list::make_traits< + ci::opt::hook< ci::lazy_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >>> + ,ci::opt::disposer< typename TestFixture::mock_disposer > + ,cds::opt::less< typename TestFixture::template less< typename TestFixture::member_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, member_hook_cmp ) +{ + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::member_item, + typename ci::lazy_list::make_traits< + ci::opt::hook< ci::lazy_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >>> + ,ci::opt::disposer< typename TestFixture::mock_disposer > + ,cds::opt::compare< typename TestFixture::template cmp< typename TestFixture::member_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, member_hook_item_counting ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::member_item > compare; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, member_hook_seqcst ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveLazyList, member_hook_back_off ) +{ + struct traits : public ci::lazy_list::traits { + typedef ci::lazy_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::member_item > compare; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::backoff::empty back_off; + }; + typedef ci::LazyList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + + +// GCC 5: All test names should be written on single line, otherwise a runtime error will be encountered like as +// "No test named can be found in this test case" +REGISTER_TYPED_TEST_CASE_P( IntrusiveLazyList, + base_hook, base_hook_cmp, base_hook_item_counting, base_hook_backoff, base_hook_seqcst, member_hook, member_hook_cmp, member_hook_item_counting, member_hook_seqcst, member_hook_back_off +); + + +#endif // CDSUNIT_LIST_TEST_INTRUSIVE_LAZY_LIST_RCU_H + \ No newline at end of file diff --git a/test/unit/list/test_intrusive_list_nogc.h b/test/unit/list/test_intrusive_list_nogc.h index 1d66c0e8..c9298c8b 100644 --- a/test/unit/list/test_intrusive_list_nogc.h +++ b/test/unit/list/test_intrusive_list_nogc.h @@ -477,7 +477,6 @@ namespace cds_test { ASSERT_LT( idx, nSize ); EXPECT_EQ( it->nKey, arr[idx].nKey ); EXPECT_EQ( (*it).nKey, arr[idx].nKey ); - ++key; } l.clear(); diff --git a/test/unit/list/test_intrusive_list_rcu.h b/test/unit/list/test_intrusive_list_rcu.h new file mode 100644 index 00000000..9df70379 --- /dev/null +++ b/test/unit/list/test_intrusive_list_rcu.h @@ -0,0 +1,146 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ +#ifndef CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H +#define CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H + +#include "test_intrusive_list.h" + +namespace cds_test { + + class intrusive_list_rcu : public intrusive_list_common + { + protected: + template + void test_rcu( List& l ) + { + // Precondition: list is empty + // Postcondition: list is empty + + static const size_t nSize = 20; + typedef typename List::value_type value_type; + value_type arr[ nSize ]; + + for ( size_t i = 0; i < nSize; ++i ) { + arr[i].nKey = static_cast( i ); + arr[i].nVal = arr[i].nKey * 10; + } + shuffle( arr, arr + nSize ); + + typedef typename List::exempt_ptr exempt_ptr; + typedef typename List::raw_ptr raw_ptr; + typedef typename List::rcu_lock rcu_lock; + + ASSERT_TRUE( l.empty() ); + ASSERT_CONTAINER_SIZE( l, 0 ); + + // get() test + for ( auto& i : arr ) { + { + rcu_lock lock; + raw_ptr rp = l.get( i.nKey ); + EXPECT_TRUE( !rp ); + rp = l.get_with( other_item( i.nKey ), other_less()); + EXPECT_TRUE( !rp ); + } + + EXPECT_TRUE( l.insert( i )); + + { + rcu_lock lock; + raw_ptr rp = l.get( i.nKey ); + ASSERT_FALSE( !rp ); + EXPECT_EQ( rp->nKey, i.nKey ); + EXPECT_EQ( rp->nVal, i.nVal ); + } + { + rcu_lock lock; + raw_ptr rp = l.get_with( other_item( i.nKey ), other_less() ); + ASSERT_FALSE( !rp ); + EXPECT_EQ( rp->nKey, i.nKey ); + EXPECT_EQ( rp->nVal, i.nVal ); + } + } + + exempt_ptr gp; + + // extract() test + if ( List::c_bExtractLockExternal ) { + for ( int i = 0; i < static_cast(nSize); ++i ) { + { + rcu_lock lock; + + if ( i & 1 ) + gp = l.extract( i ); + else + gp = l.extract_with( other_item(i), other_less()); + ASSERT_FALSE( !gp ); + EXPECT_EQ( gp->nKey, i ); + } + gp.release(); + { + rcu_lock lock; + + gp = l.extract( i ); + EXPECT_TRUE( !gp ); + gp = l.extract_with( other_item( i ), other_less() ); + EXPECT_TRUE( !gp ); + } + } + } + else { + for ( int i = 0; i < static_cast(nSize); ++i ) { + if ( i & 1 ) + gp = l.extract( i ); + else + gp = l.extract_with( other_item( i ), other_less() ); + ASSERT_FALSE( !gp ); + EXPECT_EQ( gp->nKey, i ); + + gp = l.extract( i ); + EXPECT_TRUE( !gp ); + gp = l.extract_with( other_item( i ), other_less() ); + EXPECT_TRUE( !gp ); + } + } + + ASSERT_TRUE( l.empty() ); + ASSERT_CONTAINER_SIZE( l, 0 ); + + List::gc::force_dispose(); + for ( auto const& i : arr ) { + EXPECT_EQ( i.s.nDisposeCount, 1 ); + EXPECT_FALSE( l.contains( i ) ); + } + } + }; + +} // namespace cds_test + +#endif // CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H diff --git a/test/unit/list/test_intrusive_michael_rcu.h b/test/unit/list/test_intrusive_michael_rcu.h new file mode 100644 index 00000000..45b0b2a8 --- /dev/null +++ b/test/unit/list/test_intrusive_michael_rcu.h @@ -0,0 +1,240 @@ +/* + This file is a part of libcds - Concurrent Data Structures library + + (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016 + + Source code repo: http://github.com/khizmax/libcds/ + Download: http://sourceforge.net/projects/libcds/files/ + + Redistribution and use in source and binary forms, with or without + modification, are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" + AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE + FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER + CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, + OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +*/ +#ifndef CDSUNIT_LIST_TEST_INTRUSIVE_MICHAEL_LIST_RCU_H +#define CDSUNIT_LIST_TEST_INTRUSIVE_MICHAEL_LIST_RCU_H + +#include "test_intrusive_list_rcu.h" +#include + +namespace ci = cds::intrusive; + +template +class IntrusiveMichaelList : public cds_test::intrusive_list_rcu +{ + typedef cds_test::intrusive_list_rcu base_class; +public: + typedef cds::urcu::gc rcu_type; + typedef typename base_class::base_item< ci::michael_list::node< rcu_type >> base_item; + typedef typename base_class::member_item< ci::michael_list::node< rcu_type >> member_item; + +protected: + void SetUp() + { + RCU::Construct(); + cds::threading::Manager::attachThread(); + } + + void TearDown() + { + cds::threading::Manager::detachThread(); + RCU::Destruct(); + } +}; + +TYPED_TEST_CASE_P( IntrusiveMichaelList ); + +TYPED_TEST_P( IntrusiveMichaelList, base_hook ) +{ + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::base_item, + typename ci::michael_list::make_traits< + ci::opt::hook< ci::michael_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >>> + , ci::opt::disposer< typename TestFixture::mock_disposer > + , cds::opt::less< typename TestFixture::template less< typename TestFixture::base_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, base_hook_cmp ) +{ + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::base_item, + typename ci::michael_list::make_traits< + ci::opt::hook< ci::michael_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >>> + , ci::opt::disposer< typename TestFixture::mock_disposer > + , cds::opt::compare< typename TestFixture::template cmp< typename TestFixture::base_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, base_hook_item_counting ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef typename TestFixture::template less< typename TestFixture::base_item > less; + typedef cds::atomicity::item_counter item_counter; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, base_hook_backoff ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef typename TestFixture::template less< typename TestFixture::base_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::backoff::pause back_off; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, base_hook_seqcst ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::base_hook< cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::base_item > compare; + typedef cds::atomicity::item_counter item_counter; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::base_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, member_hook ) +{ + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::member_item, + typename ci::michael_list::make_traits< + ci::opt::hook< ci::michael_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >>> + ,ci::opt::disposer< typename TestFixture::mock_disposer > + ,cds::opt::less< typename TestFixture::template less< typename TestFixture::member_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, member_hook_cmp ) +{ + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::member_item, + typename ci::michael_list::make_traits< + ci::opt::hook< ci::michael_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >>> + ,ci::opt::disposer< typename TestFixture::mock_disposer > + ,cds::opt::compare< typename TestFixture::template cmp< typename TestFixture::member_item >> + >::type + > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, member_hook_item_counting ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::member_item > compare; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, member_hook_seqcst ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::opt::v::sequential_consistent memory_model; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + +TYPED_TEST_P( IntrusiveMichaelList, member_hook_back_off ) +{ + struct traits : public ci::michael_list::traits { + typedef ci::michael_list::member_hook< offsetof( typename TestFixture::member_item, hMember ), cds::opt::gc< typename TestFixture::rcu_type >> hook; + typedef typename TestFixture::mock_disposer disposer; + typedef typename TestFixture::template cmp< typename TestFixture::member_item > compare; + typedef typename TestFixture::template less< typename TestFixture::member_item > less; + typedef cds::atomicity::item_counter item_counter; + typedef cds::backoff::empty back_off; + }; + typedef ci::MichaelList< typename TestFixture::rcu_type, typename TestFixture::member_item, traits > list_type; + + list_type l; + this->test_common( l ); + this->test_ordered_iterator( l ); + this->test_rcu( l ); +} + + +// GCC 5: All test names should be written on single line, otherwise a runtime error will be encountered like as +// "No test named can be found in this test case" +REGISTER_TYPED_TEST_CASE_P( IntrusiveMichaelList, + base_hook, base_hook_cmp, base_hook_item_counting, base_hook_backoff, base_hook_seqcst, member_hook, member_hook_cmp, member_hook_item_counting, member_hook_seqcst, member_hook_back_off +); + + +#endif // CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H + \ No newline at end of file -- 2.34.1