]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/20_util/shared_ptr/thread/default_weaktoshared.cc
boost_shared_ptr.h: Add support for allocators, aliasing, make_shared and rvalue...
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 20_util / shared_ptr / thread / default_weaktoshared.cc
1 // Copyright (C) 2006, 2007 Free Software Foundation
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 2, or (at your option)
7 // any later version.
8
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING. If not, write to the Free
16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
17 // USA.
18
19 // 20.6.6.2 Template class shared_ptr [util.smartptr.shared]
20
21 // { dg-do run { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-solaris* *-*-cygwin *-*-darwin* alpha*-*-osf* mips-sgi-irix6* } }
22 // { dg-options "-pthread -std=gnu++0x" { target *-*-freebsd* *-*-netbsd* *-*-linux* alpha*-*-osf* mips-sgi-irix6* } }
23 // { dg-options "-pthreads -std=gnu++0x" { target *-*-solaris* } }
24
25 #include <memory>
26 #include <random>
27 #include <vector>
28 #include <testsuite_hooks.h>
29 #include <iostream>
30 #include <cstdlib>
31
32 #include <pthread.h>
33
34 #ifdef _GLIBCXX_HAVE_UNISTD_H
35 #include <unistd.h> // To test for _POSIX_THREAD_PRIORITY_SCHEDULING
36 #endif
37
38 /* This (brute-force) tests the atomicity and thus thread safety of the
39 * shared_ptr <- weak_ptr
40 * assignment operation by allocating a test object, retrieving a weak
41 * reference to it, and letting a number of threads repeatedly create strong
42 * references from the weak reference.
43 * Specifically, this tests the function _Sp_counted_base<true>::add_ref_lock()
44 */
45
46
47 const unsigned int HAMMER_MAX_THREADS = 10;
48 const unsigned int POOL_SIZE = 1000;
49 const unsigned long HAMMER_REPEAT = 100000;
50 const unsigned long KILL_ONE_IN = 1000;
51
52 struct A
53 {
54 static _Atomic_word counter;
55 A()
56 {
57 __gnu_cxx::__atomic_add(&counter, 1);
58 }
59 ~A()
60 {
61 __gnu_cxx::__atomic_add(&counter, -1);
62 }
63 };
64
65 _Atomic_word A::counter = 0;
66
67 typedef std::shared_ptr<A> sp_A_t;
68 typedef std::weak_ptr<A> wp_A_t;
69
70 typedef std::vector<sp_A_t> sp_vector_t;
71 typedef std::vector<wp_A_t> wp_vector_t;
72
73 struct shared_and_weak_pools
74 {
75 sp_vector_t& shared_pool;
76 wp_vector_t& weak_pool;
77
78 shared_and_weak_pools(sp_vector_t& _shared_pool, wp_vector_t& _weak_pool)
79 : shared_pool(_shared_pool), weak_pool(_weak_pool)
80 { }
81 };
82
83 void* thread_hammer_and_kill(void* opaque_pools)
84 {
85 shared_and_weak_pools& pools = *static_cast<shared_and_weak_pools*>(opaque_pools);
86 // Using the same parameters as in the RNG test cases.
87 std::mersenne_twister<
88 unsigned long, 32, 624, 397, 31,
89 0x9908b0dful, 11, 7,
90 0x9d2c5680ul, 15,
91 0xefc60000ul, 18> rng;
92
93 sp_vector_t::iterator cur_shared = pools.shared_pool.begin();
94 wp_vector_t::iterator cur_weak = pools.weak_pool.begin();
95
96 for (unsigned int i = 0; i < HAMMER_REPEAT; ++i)
97 {
98 try
99 {
100 sp_A_t strong(*cur_weak);
101 }
102 catch (std::bad_weak_ptr& exception)
103 {
104 ++cur_weak;
105 if (cur_weak == pools.weak_pool.end())
106 break;
107 }
108
109 if (rng() % KILL_ONE_IN == 0)
110 {
111 cur_shared->reset();
112 ++cur_shared;
113 }
114 }
115 return 0;
116 }
117
118 void* thread_hammer(void* opaque_weak)
119 {
120 wp_vector_t& weak_pool = *static_cast<wp_vector_t*>(opaque_weak);
121 // Using the same parameters as in the RNG test cases.
122 std::mersenne_twister<
123 unsigned long, 32, 624, 397, 31,
124 0x9908b0dful, 11, 7,
125 0x9d2c5680ul, 15,
126 0xefc60000ul, 18> rng;
127 wp_vector_t::iterator cur_weak = weak_pool.begin();
128
129 for (unsigned int i = 0; i < HAMMER_REPEAT; ++i)
130 {
131 try
132 {
133 sp_A_t strong(*cur_weak);
134 }
135 catch (std::bad_weak_ptr& exception)
136 {
137 ++cur_weak;
138 if (cur_weak == weak_pool.end())
139 break;
140 }
141 }
142 return 0;
143 }
144
145 int
146 test01()
147 {
148 bool test __attribute__((unused)) = true;
149 sp_vector_t obj_pool(POOL_SIZE);
150
151 for(sp_vector_t::iterator cur = obj_pool.begin(); cur != obj_pool.end(); ++cur)
152 {
153 cur->reset(new A);
154 }
155 // Obtain weak references.
156 std::vector<wp_vector_t> weak_pool(HAMMER_MAX_THREADS, wp_vector_t(obj_pool.begin(), obj_pool.end()));
157
158 // Launch threads with pointer to weak reference.
159 pthread_t threads[HAMMER_MAX_THREADS];
160 #if defined(__sun) && defined(__svr4__) && _XOPEN_VERSION >= 500
161 pthread_setconcurrency (HAMMER_MAX_THREADS);
162 #endif
163
164 pthread_attr_t tattr;
165 int ret = pthread_attr_init(&tattr);
166
167 shared_and_weak_pools pools(obj_pool, weak_pool[0]);
168 pthread_create(threads, &tattr, thread_hammer_and_kill, static_cast<void*>(&pools));
169 for (unsigned int worker = 1; worker < HAMMER_MAX_THREADS; worker++)
170 {
171 if (pthread_create(&threads[worker], &tattr,
172 thread_hammer, static_cast<void*>(&weak_pool[worker])))
173 std::abort();
174 }
175 // Wait for threads to complete, then check integrity of reference.
176 void* status;
177 for (unsigned int worker = 0; worker < HAMMER_MAX_THREADS; worker++)
178 {
179 if (pthread_join(threads[worker], &status))
180 std::abort();
181 }
182 obj_pool.clear();
183
184 VERIFY( A::counter == 0 );
185
186 return 0;
187 }
188
189 int
190 main()
191 {
192 test01();
193 return 0;
194 }