split_michael_hp.cpp 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288
  1. // Copyright (c) 2006-2018 Maxim Khizhinsky
  2. //
  3. // Distributed under the Boost Software License, Version 1.0. (See accompanying
  4. // file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
  5. #include "test_map_hp.h"
  6. #include <cds/container/michael_list_hp.h>
  7. #include <cds/container/split_list_map.h>
  8. #include <cds/intrusive/free_list.h>
  9. namespace {
  10. namespace cc = cds::container;
  11. typedef cds::gc::HP gc_type;
  12. class SplitListMichaelMap_HP : public cds_test::container_map_hp
  13. {
  14. protected:
  15. typedef cds_test::container_map_hp base_class;
  16. void SetUp()
  17. {
  18. struct map_traits: public cc::split_list::traits {
  19. typedef cc::michael_list_tag ordered_list;
  20. typedef hash1 hash;
  21. struct ordered_list_traits: public cc::michael_list::traits
  22. {
  23. typedef cmp compare;
  24. };
  25. };
  26. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  27. // +1 - for guarded_ptr
  28. cds::gc::hp::GarbageCollector::Construct( map_type::c_nHazardPtrCount + 1, 1, 16 );
  29. cds::threading::Manager::attachThread();
  30. }
  31. void TearDown()
  32. {
  33. cds::threading::Manager::detachThread();
  34. cds::gc::hp::GarbageCollector::Destruct( true );
  35. }
  36. };
  37. TEST_F( SplitListMichaelMap_HP, compare )
  38. {
  39. typedef cc::SplitListMap< gc_type, key_type, value_type,
  40. typename cc::split_list::make_traits<
  41. cc::split_list::ordered_list< cc::michael_list_tag >
  42. , cds::opt::hash< hash1 >
  43. , cc::split_list::ordered_list_traits<
  44. typename cc::michael_list::make_traits<
  45. cds::opt::compare< cmp >
  46. >::type
  47. >
  48. >::type
  49. > map_type;
  50. map_type m( kSize, 2 );
  51. test( m );
  52. }
  53. TEST_F( SplitListMichaelMap_HP, less )
  54. {
  55. typedef cc::SplitListMap< gc_type, key_type, value_type,
  56. typename cc::split_list::make_traits<
  57. cc::split_list::ordered_list< cc::michael_list_tag >
  58. , cds::opt::hash< hash1 >
  59. , cc::split_list::ordered_list_traits<
  60. typename cc::michael_list::make_traits<
  61. cds::opt::less< less >
  62. >::type
  63. >
  64. >::type
  65. > map_type;
  66. map_type m( kSize, 2 );
  67. test( m );
  68. }
  69. TEST_F( SplitListMichaelMap_HP, cmpmix )
  70. {
  71. typedef cc::SplitListMap< gc_type, key_type, value_type,
  72. typename cc::split_list::make_traits<
  73. cc::split_list::ordered_list< cc::michael_list_tag >
  74. , cds::opt::hash< hash1 >
  75. , cc::split_list::ordered_list_traits<
  76. typename cc::michael_list::make_traits<
  77. cds::opt::less< less >
  78. , cds::opt::compare< cmp >
  79. >::type
  80. >
  81. >::type
  82. > map_type;
  83. map_type m( kSize, 2 );
  84. test( m );
  85. }
  86. TEST_F( SplitListMichaelMap_HP, item_counting )
  87. {
  88. struct map_traits: public cc::split_list::traits
  89. {
  90. typedef cc::michael_list_tag ordered_list;
  91. typedef hash1 hash;
  92. typedef cds::atomicity::item_counter item_counter;
  93. struct ordered_list_traits: public cc::michael_list::traits
  94. {
  95. typedef cmp compare;
  96. typedef base_class::less less;
  97. typedef cds::backoff::empty back_off;
  98. };
  99. };
  100. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  101. map_type m( kSize, 4 );
  102. test( m );
  103. }
  104. TEST_F( SplitListMichaelMap_HP, stat )
  105. {
  106. struct map_traits: public cc::split_list::traits
  107. {
  108. typedef cc::michael_list_tag ordered_list;
  109. typedef hash1 hash;
  110. typedef cds::atomicity::item_counter item_counter;
  111. typedef cc::split_list::stat<> stat;
  112. struct ordered_list_traits: public cc::michael_list::traits
  113. {
  114. typedef base_class::less less;
  115. typedef cds::opt::v::sequential_consistent memory_model;
  116. };
  117. };
  118. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  119. map_type m( kSize, 2 );
  120. test( m );
  121. }
  122. TEST_F( SplitListMichaelMap_HP, back_off )
  123. {
  124. struct map_traits: public cc::split_list::traits
  125. {
  126. typedef cc::michael_list_tag ordered_list;
  127. typedef hash1 hash;
  128. typedef cds::atomicity::item_counter item_counter;
  129. typedef cds::backoff::yield back_off;
  130. typedef cds::opt::v::sequential_consistent memory_model;
  131. struct ordered_list_traits: public cc::michael_list::traits
  132. {
  133. typedef cmp compare;
  134. typedef cds::backoff::pause back_off;
  135. };
  136. };
  137. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  138. map_type m( kSize, 3 );
  139. test( m );
  140. }
  141. TEST_F( SplitListMichaelMap_HP, free_list )
  142. {
  143. struct map_traits: public cc::split_list::traits
  144. {
  145. typedef cc::michael_list_tag ordered_list;
  146. typedef hash1 hash;
  147. typedef cds::atomicity::item_counter item_counter;
  148. typedef cds::intrusive::FreeList free_list;
  149. struct ordered_list_traits: public cc::michael_list::traits
  150. {
  151. typedef cmp compare;
  152. typedef cds::backoff::pause back_off;
  153. };
  154. };
  155. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  156. map_type m( kSize, 3 );
  157. test( m );
  158. }
  159. struct set_static_traits: public cc::split_list::traits
  160. {
  161. static bool const dynamic_bucket_table = false;
  162. };
  163. TEST_F( SplitListMichaelMap_HP, static_bucket_table )
  164. {
  165. struct map_traits: public set_static_traits
  166. {
  167. typedef cc::michael_list_tag ordered_list;
  168. typedef hash1 hash;
  169. typedef cds::atomicity::item_counter item_counter;
  170. struct ordered_list_traits: public cc::michael_list::traits
  171. {
  172. typedef cmp compare;
  173. typedef cds::backoff::pause back_off;
  174. };
  175. };
  176. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  177. map_type m( kSize, 4 );
  178. test( m );
  179. }
  180. TEST_F( SplitListMichaelMap_HP, static_bucket_table_free_list )
  181. {
  182. struct map_traits: public set_static_traits
  183. {
  184. typedef cc::michael_list_tag ordered_list;
  185. typedef hash1 hash;
  186. typedef cds::atomicity::item_counter item_counter;
  187. typedef cds::intrusive::FreeList free_list;
  188. struct ordered_list_traits: public cc::michael_list::traits
  189. {
  190. typedef cmp compare;
  191. typedef cds::backoff::pause back_off;
  192. };
  193. };
  194. typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
  195. map_type m( kSize, 4 );
  196. test( m );
  197. }
  198. TEST_F( SplitListMichaelMap_HP, bit_reversal_swar )
  199. {
  200. typedef cc::SplitListMap< gc_type, key_type, value_type,
  201. typename cc::split_list::make_traits<
  202. cc::split_list::ordered_list< cc::michael_list_tag >
  203. ,cc::split_list::bit_reversal< cds::algo::bit_reversal::swar >
  204. , cds::opt::hash< hash1 >
  205. , cc::split_list::ordered_list_traits<
  206. typename cc::michael_list::make_traits<
  207. cds::opt::compare< cmp >
  208. >::type
  209. >
  210. >::type
  211. > map_type;
  212. map_type m( kSize, 2 );
  213. test( m );
  214. }
  215. TEST_F( SplitListMichaelMap_HP, bit_reversal_lookup )
  216. {
  217. typedef cc::SplitListMap< gc_type, key_type, value_type,
  218. typename cc::split_list::make_traits<
  219. cc::split_list::ordered_list< cc::michael_list_tag >
  220. ,cc::split_list::bit_reversal< cds::algo::bit_reversal::lookup >
  221. , cds::opt::hash< hash1 >
  222. , cc::split_list::ordered_list_traits<
  223. typename cc::michael_list::make_traits<
  224. cds::opt::compare< cmp >
  225. >::type
  226. >
  227. >::type
  228. > map_type;
  229. map_type m( kSize, 2 );
  230. test( m );
  231. }
  232. TEST_F( SplitListMichaelMap_HP, bit_reversal_muldiv )
  233. {
  234. typedef cc::SplitListMap< gc_type, key_type, value_type,
  235. typename cc::split_list::make_traits<
  236. cc::split_list::ordered_list< cc::michael_list_tag >
  237. ,cc::split_list::bit_reversal< cds::algo::bit_reversal::muldiv >
  238. , cds::opt::hash< hash1 >
  239. , cc::split_list::ordered_list_traits<
  240. typename cc::michael_list::make_traits<
  241. cds::opt::compare< cmp >
  242. >::type
  243. >
  244. >::type
  245. > map_type;
  246. map_type m( kSize, 2 );
  247. test( m );
  248. }
  249. } // namespace