gcc/libstdc++-v3/testsuite/thread/pthread1.cc

132 lines
3.6 KiB
C++
Raw Normal View History

// 2002-01-23 Loren J. Rittle <rittle@labs.mot.com> <ljrittle@acm.org>
//
binders.cc: Remove explicit instantiations for non-weak systems. 2005-03-16 Paolo Carlini <pcarlini@suse.de> * testsuite/20_util/functional/binders.cc: Remove explicit instantiations for non-weak systems. * testsuite/20_util/memory/allocator/1.cc: Likewise. * testsuite/20_util/memory/allocator/10378.cc: Likewise. * testsuite/20_util/memory/allocator/10416.cc: Likewise. * testsuite/20_util/memory/allocator/8230.cc: Likewise. * testsuite/20_util/utility/rel_ops.cc: Likewise. * testsuite/22_locale/ctype/is/char/2.cc: Likewise. * testsuite/22_locale/ctype/is/wchar_t/2.cc: Likewise. * testsuite/23_containers/deque/cons/1.cc: Likewise. * testsuite/23_containers/deque/cons/2.cc: Likewise. * testsuite/23_containers/deque/invalidation/1.cc: Likewise. * testsuite/23_containers/deque/invalidation/2.cc: Likewise. * testsuite/23_containers/deque/invalidation/3.cc: Likewise. * testsuite/23_containers/deque/invalidation/4.cc: Likewise. * testsuite/23_containers/deque/modifiers/swap.cc: Likewise. * testsuite/23_containers/deque/operators/1.cc: Likewise. * testsuite/23_containers/list/capacity/1.cc: Likewise. * testsuite/23_containers/list/cons/1.cc: Likewise. * testsuite/23_containers/list/cons/2.cc: Likewise. * testsuite/23_containers/list/cons/3.cc: Likewise. * testsuite/23_containers/list/cons/4.cc: Likewise. * testsuite/23_containers/list/cons/5.cc: Likewise. * testsuite/23_containers/list/cons/6.cc: Likewise. * testsuite/23_containers/list/cons/7.cc: Likewise. * testsuite/23_containers/list/cons/8.cc: Likewise. * testsuite/23_containers/list/cons/9.cc: Likewise. * testsuite/23_containers/list/invalidation/1.cc: Likewise. * testsuite/23_containers/list/invalidation/2.cc: Likewise. * testsuite/23_containers/list/invalidation/3.cc: Likewise. * testsuite/23_containers/list/invalidation/4.cc: Likewise. * testsuite/23_containers/list/modifiers/1.cc: Likewise. * testsuite/23_containers/list/modifiers/2.cc: Likewise. * testsuite/23_containers/list/modifiers/3.cc: Likewise. * testsuite/23_containers/list/operators/1.cc: Likewise. * testsuite/23_containers/list/operators/2.cc: Likewise. * testsuite/23_containers/list/operators/3.cc: Likewise. * testsuite/23_containers/list/operators/4.cc: Likewise. * testsuite/23_containers/map/insert/1.cc: Likewise. * testsuite/23_containers/map/invalidation/1.cc: Likewise. * testsuite/23_containers/map/invalidation/2.cc: Likewise. * testsuite/23_containers/map/modifiers/swap.cc: Likewise. * testsuite/23_containers/map/operators/1.cc: Likewise. * testsuite/23_containers/multimap/invalidation/1.cc: Likewise. * testsuite/23_containers/multimap/invalidation/2.cc: Likewise. * testsuite/23_containers/multimap/modifiers/swap.cc: Likewise. * testsuite/23_containers/multiset/insert/1.cc: Likewise. * testsuite/23_containers/multiset/insert/2.cc: Likewise. * testsuite/23_containers/multiset/invalidation/1.cc: Likewise. * testsuite/23_containers/multiset/invalidation/2.cc: Likewise. * testsuite/23_containers/multiset/modifiers/swap.cc: Likewise. * testsuite/23_containers/priority_queue/members/7161.cc: Likewise. * testsuite/23_containers/queue/members/7157.cc: Likewise. * testsuite/23_containers/set/insert/1.cc: Likewise. * testsuite/23_containers/set/invalidation/1.cc: Likewise. * testsuite/23_containers/set/invalidation/2.cc: Likewise. * testsuite/23_containers/set/modifiers/swap.cc: Likewise. * testsuite/23_containers/stack/members/7158.cc: Likewise. * testsuite/23_containers/vector/bool/6886.cc: Likewise. * testsuite/23_containers/vector/capacity/1.cc: Likewise. * testsuite/23_containers/vector/capacity/8230.cc: Likewise. * testsuite/23_containers/vector/cons/1.cc: Likewise. * testsuite/23_containers/vector/cons/2.cc: Likewise. * testsuite/23_containers/vector/cons/3.cc: Likewise. * testsuite/23_containers/vector/cons/6513.cc: Likewise. * testsuite/23_containers/vector/element_access/1.cc: Likewise. * testsuite/23_containers/vector/invalidation/1.cc: Likewise. * testsuite/23_containers/vector/invalidation/2.cc: Likewise. * testsuite/23_containers/vector/invalidation/3.cc: Likewise. * testsuite/23_containers/vector/invalidation/4.cc: Likewise. * testsuite/23_containers/vector/modifiers/1.cc: Likewise. * testsuite/23_containers/vector/modifiers/2.cc: Likewise. * testsuite/23_containers/vector/modifiers/swap.cc: Likewise. * testsuite/23_containers/vector/resize/1.cc: Likewise. * testsuite/24_iterators/back_insert_iterator.cc: Likewise. * testsuite/24_iterators/front_insert_iterator.cc: Likewise. * testsuite/24_iterators/insert_iterator.cc: Likewise. * testsuite/24_iterators/iterator.cc: Likewise. * testsuite/25_algorithms/copy/1.cc: Likewise. * testsuite/25_algorithms/copy/2.cc: Likewise. * testsuite/25_algorithms/copy/3.cc: Likewise. * testsuite/25_algorithms/copy/4.cc: Likewise. * testsuite/25_algorithms/equal.cc: Likewise. * testsuite/25_algorithms/fill/1.cc: Likewise. * testsuite/25_algorithms/fill/2.cc: Likewise. * testsuite/25_algorithms/min_max.cc: Likewise. * testsuite/25_algorithms/rotate.cc: Likewise. * testsuite/25_algorithms/unique/1.cc: Likewise. * testsuite/25_algorithms/unique/2.cc: Likewise. * testsuite/27_io/basic_filebuf/seekpos/wchar_t/9874.cc: Likewise. * testsuite/ext/concept_checks.cc: Likewise. * testsuite/ext/hash_map/1.cc: Likewise. * testsuite/ext/hash_set/1.cc: Likewise. * testsuite/ext/rope/1.cc: Likewise. * testsuite/ext/rope/2.cc: Likewise. * testsuite/ext/rope/3.cc: Likewise. * testsuite/thread/pthread1.cc: Likewise. * testsuite/thread/pthread4.cc: Likewise. * testsuite/thread/pthread5.cc: Likewise. * testsuite/thread/pthread6.cc: Likewise. * testsuite/thread/pthread7-rope.cc: Likewise. From-SVN: r96551
2005-03-16 12:24:36 +01:00
// Copyright (C) 2002, 2003, 2004, 2005 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 2, 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 COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// { dg-do run { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-solaris* *-*-cygwin *-*-darwin* alpha*-*-osf* } }
// { dg-options "-pthread" { target *-*-freebsd* *-*-netbsd* *-*-linux* alpha*-*-osf* } }
// { dg-options "-pthreads" { target *-*-solaris* } }
// This multi-threading C++/STL/POSIX code adheres to rules outlined here:
// http://www.sgi.com/tech/stl/thread_safety.html
//
// It is believed to exercise the allocation code in a manner that
// should reveal memory leaks (and, under rare cases, race conditions,
// if the STL threading support is fubar'd).
#include <list>
// Do not include <pthread.h> explicitly; if threads are properly
// configured for the port, then it is picked up free from STL headers.
using namespace std;
const int thread_cycles = 10;
const int thread_pairs = 10;
const unsigned max_size = 100;
const int iters = 10000;
class task_queue
{
public:
task_queue ()
{
pthread_mutex_init (&fooLock, NULL);
pthread_cond_init (&fooCond1, NULL);
pthread_cond_init (&fooCond2, NULL);
}
~task_queue ()
{
pthread_mutex_destroy (&fooLock);
pthread_cond_destroy (&fooCond1);
pthread_cond_destroy (&fooCond2);
}
list<int> foo;
pthread_mutex_t fooLock;
pthread_cond_t fooCond1;
pthread_cond_t fooCond2;
};
void*
produce (void* t)
{
task_queue& tq = *(static_cast<task_queue*> (t));
int num = 0;
while (num < iters)
{
pthread_mutex_lock (&tq.fooLock);
while (tq.foo.size () >= max_size)
pthread_cond_wait (&tq.fooCond1, &tq.fooLock);
tq.foo.push_back (num++);
pthread_cond_signal (&tq.fooCond2);
pthread_mutex_unlock (&tq.fooLock);
}
return 0;
}
void*
consume (void* t)
{
task_queue& tq = *(static_cast<task_queue*> (t));
int num = 0;
while (num < iters)
{
pthread_mutex_lock (&tq.fooLock);
while (tq.foo.size () == 0)
pthread_cond_wait (&tq.fooCond2, &tq.fooLock);
if (tq.foo.front () != num++)
abort ();
tq.foo.pop_front ();
pthread_cond_signal (&tq.fooCond1);
pthread_mutex_unlock (&tq.fooLock);
}
return 0;
}
int
main ()
{
pthread_t prod[thread_pairs];
pthread_t cons[thread_pairs];
task_queue* tq[thread_pairs];
#if defined(__sun) && defined(__svr4__) && _XOPEN_VERSION >= 500
pthread_setconcurrency (thread_pairs * 2);
#endif
for (int j = 0; j < thread_cycles; j++)
{
for (int i = 0; i < thread_pairs; i++)
{
tq[i] = new task_queue;
pthread_create (&prod[i], NULL, produce, static_cast<void*> (tq[i]));
pthread_create (&cons[i], NULL, consume, static_cast<void*> (tq[i]));
}
for (int i = 0; i < thread_pairs; i++)
{
pthread_join (prod[i], NULL);
pthread_join (cons[i], NULL);
delete tq[i];
}
}
return 0;
}