blob: fb55a3a262d15904408a733b91180613912ae85f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// { dg-do run { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-gnu* *-*-solaris* *-*-cygwin *-*-darwin* } }
// { dg-options " -std=gnu++0x -pthread" { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-gnu* } }
// { dg-options " -std=gnu++0x -pthreads" { target *-*-solaris* } }
// { dg-options " -std=gnu++0x " { target *-*-cygwin *-*-darwin* } }
// { dg-require-cstdint "" }
// { dg-require-gthreads "" }
// { dg-require-debug-mode "" }
// Copyright (C) 2010-2014 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
//
// This test check for potential deadlock when swaping sequences in debug
// mode as it requires acquiring 2 locks at the same time.
#include <vector>
#include <thread>
#include <functional>
#include <testsuite_hooks.h>
// The following function mimic the one in src/debug.cc to associate a mutex
// to a given safe sequence instance.
size_t
get_index(std::vector<int>& v)
{
const size_t mask = 0xf;
// We have to check the address of the internal safe sequence that starts
// after the normal vector memory footprint that is to say a 3 pointers
// offset:
void* __address = reinterpret_cast<char*>(&v) + 3 * sizeof(void*);
return std::_Hash_impl::hash(__address) & mask;
}
void test01()
{
using namespace std;
bool test __attribute__((unused)) = true;
vector<int> v1, v2;
vector<shared_ptr<vector<int> > > vs;
vector<int> *pv3 = 0, *pv4 = 0;
const int nb_attempts = 100;
for (int i = 0; i != nb_attempts; ++i)
{
vs.push_back(shared_ptr<vector<int> >(new vector<int>()));
if (!pv3)
{
if (get_index(*vs.back()) == get_index(v1))
pv3 = vs.back().get();
}
else if (!pv4)
{
if (get_index(*vs.back()) == get_index(v2))
{
pv4 = vs.back().get();
break;
}
}
}
if (!pv3 || !pv4)
// Maybe an other time...
return;
vector<int> &v3 = *pv3, &v4 = *pv4;
// v1 and v3 shares the same mutex instance, like v2 and v4
// thread t1 lock v1 and v2
thread t1([&v1, &v2]()
{
for (int i = 0; i != 1000; ++i)
v1.swap(v2);
});
// thread t2 lock v4 and v3
thread t2([&v3, &v4]()
{
for (int i = 0; i != 1000; ++i)
v4.swap(v3);
});
t2.join();
t1.join();
}
int main()
{
test01();
return 0;
}
|
