00001 /* 00002 * <thread.cpp> 00003 * Copyright (C) DOLPHIN Project-Team, INRIA Futurs, 2006-2007 00004 * (C) OPAC Team, LIFL, 2002-2007 00005 * 00006 * Sebastien Cahon, Alexandru-Adrian Tantar 00007 * 00008 * This software is governed by the CeCILL license under French law and 00009 * abiding by the rules of distribution of free software. You can use, 00010 * modify and/ or redistribute the software under the terms of the CeCILL 00011 * license as circulated by CEA, CNRS and INRIA at the following URL 00012 * "http://www.cecill.info". 00013 * 00014 * As a counterpart to the access to the source code and rights to copy, 00015 * modify and redistribute granted by the license, users are provided only 00016 * with a limited warranty and the software's author, the holder of the 00017 * economic rights, and the successive licensors have only limited liability. 00018 * 00019 * In this respect, the user's attention is drawn to the risks associated 00020 * with loading, using, modifying and/or developing or reproducing the 00021 * software by the user in light of its specific status of free software, 00022 * that may mean that it is complicated to manipulate, and that also 00023 * therefore means that it is reserved for developers and experienced 00024 * professionals having in-depth computer knowledge. Users are therefore 00025 * encouraged to load and test the software's suitability as regards their 00026 * requirements in conditions enabling the security of their systems and/or 00027 * data to be ensured and, more generally, to use and operate it in the 00028 * same conditions as regards security. 00029 * The fact that you are presently reading this means that you have had 00030 * knowledge of the CeCILL license and that you accept its terms. 00031 * 00032 * ParadisEO WebSite : http://paradiseo.gforge.inria.fr 00033 * Contact: paradiseo-help@lists.gforge.inria.fr 00034 * 00035 */ 00036 00037 #include <map> 00038 00039 #include "thread.h" 00040 00041 static std :: vector <Thread *> threads; 00042 00043 unsigned num_act = 0; 00044 00045 Thread :: Thread () { 00046 00047 threads.push_back (this); 00048 act = false; 00049 } 00050 00051 Thread :: ~ Thread () { 00052 00053 /* Nothing ! */ 00054 } 00055 00056 extern int getNodeRank (); 00057 00058 void Thread :: setActive () { 00059 00060 if (! act ) { 00061 00062 act = true; 00063 num_act ++; 00064 // if (getNodeRank () == 1) 00065 // printf ("On passe a %d\n", num_act); 00066 } 00067 } 00068 00069 void Thread :: setPassive () { 00070 00071 if (act) { 00072 00073 act = false; 00074 num_act --; 00075 // if (getNodeRank () == 1) 00076 // printf ("On passe a %d\n", num_act); 00077 00078 } 00079 } 00080 00081 bool atLeastOneActiveThread () { 00082 00083 return num_act; 00084 } 00085 00086 unsigned numberOfActiveThreads () { 00087 00088 return num_act; 00089 } 00090 00091 static void * launch (void * __arg) { 00092 00093 Thread * thr = (Thread *) __arg; 00094 thr -> start (); 00095 return 0; 00096 } 00097 00098 void addThread (Thread * __hl_thread, std :: vector <pthread_t *> & __ll_threads) { 00099 00100 pthread_t * ll_thr = new pthread_t; 00101 __ll_threads.push_back (ll_thr); 00102 pthread_create (ll_thr, 0, launch, __hl_thread); 00103 } 00104 00105 void joinThreads (std :: vector <pthread_t *> & __threads) { 00106 00107 for (unsigned i = 0; i < __threads.size (); i ++) 00108 pthread_join (* __threads [i], 0); 00109 }