2 Copyright (C) 2002 Paul Davis
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program 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.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26 #include <pbd/pthread_utils.h>
30 typedef std::map<string,pthread_t> ThreadMap;
31 static ThreadMap all_threads;
32 static pthread_mutex_t thread_map_lock = PTHREAD_MUTEX_INITIALIZER;
35 sigc::signal<void,pthread_t,std::string> ThreadCreated;
36 sigc::signal<void,pthread_t,std::string,uint32_t> ThreadCreatedWithRequestSize;
42 pthread_create_and_store (string name, pthread_t *thread, pthread_attr_t *attr, void * (*start_routine)(void *), void * arg)
46 pthread_attr_t default_attr;
47 bool use_default_attr = (attr == NULL);
49 if (use_default_attr) {
50 // set default stack size to sensible default for memlocking
51 pthread_attr_init(&default_attr);
52 pthread_attr_setstacksize(&default_attr, 500000);
56 if ((ret = pthread_create (thread, attr, start_routine, arg)) == 0) {
57 std::pair<string,pthread_t> newpair;
59 newpair.second = *thread;
61 pthread_mutex_lock (&thread_map_lock);
62 all_threads.insert (newpair);
64 pthread_mutex_unlock (&thread_map_lock);
67 if (use_default_attr) {
68 pthread_attr_destroy(&default_attr);
77 pthread_t self = pthread_self();
80 pthread_mutex_lock (&thread_map_lock);
81 for (ThreadMap::iterator i = all_threads.begin(); i != all_threads.end(); ++i) {
82 if (i->second == self) {
84 pthread_mutex_unlock (&thread_map_lock);
88 pthread_mutex_unlock (&thread_map_lock);
93 pthread_kill_all (int signum)
95 pthread_mutex_lock (&thread_map_lock);
96 for (ThreadMap::iterator i = all_threads.begin(); i != all_threads.end(); ++i) {
97 if (i->second != pthread_self()) {
98 pthread_kill (i->second, signum);
102 pthread_mutex_unlock (&thread_map_lock);
106 pthread_cancel_all ()
108 pthread_mutex_lock (&thread_map_lock);
109 for (ThreadMap::iterator i = all_threads.begin(); i != all_threads.end(); ++i) {
110 if (i->second != pthread_self()) {
111 pthread_cancel (i->second);
115 pthread_mutex_unlock (&thread_map_lock);
119 pthread_cancel_one (pthread_t thread)
121 pthread_mutex_lock (&thread_map_lock);
122 for (ThreadMap::iterator i = all_threads.begin(); i != all_threads.end(); ++i) {
123 if (i->second == thread) {
124 all_threads.erase (i);
129 pthread_cancel (thread);
130 pthread_mutex_unlock (&thread_map_lock);
134 pthread_exit_pbd (void* status)
136 pthread_t thread = pthread_self();
138 pthread_mutex_lock (&thread_map_lock);
139 for (ThreadMap::iterator i = all_threads.begin(); i != all_threads.end(); ++i) {
140 if (i->second == thread) {
141 all_threads.erase (i);
145 pthread_mutex_unlock (&thread_map_lock);
146 pthread_exit (status);