// 2002-01-23 Loren J. Rittle // Adpated from libstdc++/5444 submitted by markus.breuer@materna.de // // Copyright (C) 2002-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 // . // { dg-do run { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-gnu* *-*-solaris* *-*-cygwin *-*-darwin* } } // { dg-options "-pthread" { target *-*-freebsd* *-*-netbsd* *-*-linux* *-*-gnu* } } // { dg-options "-pthreads" { target *-*-solaris* } } #include #include #include #include const int max_thread_count = 8; const int loops = 100000; const char* my_default = "Hallo Welt!"; const std::size_t upper_limit = 2500; const std::size_t lower_limit = 1000; typedef char charT; typedef std::string String; typedef String MyType; void* thread_main (void*) { typedef std::map Map; typedef Map::value_type Value_Pair; Map myMap; for (int loop = 0; loop < loops; loop++) { String& str = myMap[loop]; str.append (my_default); myMap.insert (Value_Pair (loop, str)); if (myMap.size () > upper_limit) { while (myMap.size () > lower_limit) { Map::iterator it = myMap.begin (); myMap.erase (it); } } } return 0; } int main (void) { pthread_t tid[max_thread_count]; #if defined(__sun) && defined(__svr4__) && _XOPEN_VERSION >= 500 pthread_setconcurrency (max_thread_count); #endif for (int i = 0; i < max_thread_count; i++) pthread_create (&tid[i], 0, thread_main, 0); for (int i = 0; i < max_thread_count; i++) pthread_join (tid[i], 0); return 0; }