paradiseo/trunk/paradiseo-peo/docs/html/node_8cpp-source.html
legrand cd4b27992a ParadisEO-PEO sources added
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@94 331e1502-861f-0410-8da2-ba01fb791d7f
2006-12-20 12:52:07 +00:00

102 lines
7 KiB
HTML

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>ParadisEO: node.cpp Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.6 -->
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main&nbsp;Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="classes.html"><span>Classes</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
<li>
<form action="search.php" method="get">
<table cellspacing="0" cellpadding="0" border="0">
<tr>
<td><label>&nbsp;<u>S</u>earch&nbsp;for&nbsp;</label></td>
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
</tr>
</table>
</form>
</li>
</ul></div>
<h1>node.cpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// "node.cpp"</span>
<a name="l00004"></a>00004
<a name="l00005"></a>00005 <span class="comment">// (c) OPAC Team, LIFL, August 2005</span>
<a name="l00006"></a>00006
<a name="l00007"></a>00007 <span class="comment">/* This library is free software; you can redistribute it and/or</span>
<a name="l00008"></a>00008 <span class="comment"> modify it under the terms of the GNU Lesser General Public</span>
<a name="l00009"></a>00009 <span class="comment"> License as published by the Free Software Foundation; either</span>
<a name="l00010"></a>00010 <span class="comment"> version 2 of the License, or (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> </span>
<a name="l00012"></a>00012 <span class="comment"> This library is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00015"></a>00015 <span class="comment"> Lesser General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> </span>
<a name="l00017"></a>00017 <span class="comment"> You should have received a copy of the GNU Lesser General Public</span>
<a name="l00018"></a>00018 <span class="comment"> License along with this library; if not, write to the Free Software</span>
<a name="l00019"></a>00019 <span class="comment"> Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
<a name="l00020"></a>00020 <span class="comment"> </span>
<a name="l00021"></a>00021 <span class="comment"> Contact: paradiseo-help@lists.gforge.inria.fr</span>
<a name="l00022"></a>00022 <span class="comment">*/</span>
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="preprocessor">#include &lt;mpi.h&gt;</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include &lt;vector&gt;</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include &lt;map&gt;</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include &lt;string&gt;</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include &lt;cassert&gt;</span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="keyword">static</span> <span class="keywordtype">int</span> rk, sz; <span class="comment">/* Rank &amp; size */</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="keyword">static</span> std :: map &lt;std :: string, int&gt; name_to_rk;
<a name="l00033"></a>00033
<a name="l00034"></a>00034 <span class="keyword">static</span> std :: vector &lt;std :: string&gt; rk_to_name;
<a name="l00035"></a>00035
<a name="l00036"></a>00036 <span class="keywordtype">int</span> getNodeRank () {
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keywordflow">return</span> rk;
<a name="l00039"></a>00039 }
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="keywordtype">int</span> getNumberOfNodes () {
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keywordflow">return</span> sz;
<a name="l00044"></a>00044 }
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <span class="keywordtype">int</span> getRankFromName (<span class="keyword">const</span> std :: string &amp; __name) {
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="keywordflow">return</span> atoi (__name.c_str ());
<a name="l00049"></a>00049 }
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keywordtype">void</span> initNode (<span class="keywordtype">int</span> * __argc, <span class="keywordtype">char</span> * * * __argv) {
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="keywordtype">int</span> provided;
<a name="l00054"></a>00054 MPI_Init_thread (__argc, __argv, MPI_THREAD_FUNNELED, &amp; provided);
<a name="l00055"></a>00055 assert (provided == MPI_THREAD_FUNNELED); <span class="comment">/* The MPI implementation must be multi-threaded.</span>
<a name="l00056"></a>00056 <span class="comment"> Yet, only one thread performs the comm.</span>
<a name="l00057"></a>00057 <span class="comment"> operations */</span>
<a name="l00058"></a>00058 MPI_Comm_rank (MPI_COMM_WORLD, &amp; rk); <span class="comment">/* Who ? */</span>
<a name="l00059"></a>00059 MPI_Comm_size (MPI_COMM_WORLD, &amp; sz); <span class="comment">/* How many ? */</span>
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="keywordtype">char</span> names [sz] [MPI_MAX_PROCESSOR_NAME];
<a name="l00062"></a>00062 <span class="keywordtype">int</span> len;
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="comment">/* Processor names */</span>
<a name="l00065"></a>00065 MPI_Get_processor_name (names [0], &amp; len); <span class="comment">/* Me */</span>
<a name="l00066"></a>00066 MPI_Allgather (names, MPI_MAX_PROCESSOR_NAME, MPI_CHAR, names, MPI_MAX_PROCESSOR_NAME, MPI_CHAR, MPI_COMM_WORLD); <span class="comment">/* Broadcast */</span>
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; sz; i ++) {
<a name="l00069"></a>00069 rk_to_name.push_back (names [i]);
<a name="l00070"></a>00070 name_to_rk [names [i]] = i;
<a name="l00071"></a>00071 }
<a name="l00072"></a>00072 }
<a name="l00073"></a>00073
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Wed Dec 20 13:45:48 2006 for ParadisEO by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.6 </small></address>
</body>
</html>