cd4b27992a
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@94 331e1502-861f-0410-8da2-ba01fb791d7f
179 lines
13 KiB
HTML
179 lines
13 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: schema.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 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> <u>S</u>earch for </label></td>
|
|
<td><input type="text" name="query" value="" size="20" accesskey="s"/></td>
|
|
</tr>
|
|
</table>
|
|
</form>
|
|
</li>
|
|
</ul></div>
|
|
<h1>schema.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">// "schema.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 <iostream></span>
|
|
<a name="l00025"></a>00025 <span class="preprocessor">#include <assert.h></span>
|
|
<a name="l00026"></a>00026
|
|
<a name="l00027"></a>00027 <span class="preprocessor">#include "schema.h"</span>
|
|
<a name="l00028"></a>00028 <span class="preprocessor">#include "xml_parser.h"</span>
|
|
<a name="l00029"></a>00029 <span class="preprocessor">#include "comm.h"</span>
|
|
<a name="l00030"></a>00030 <span class="preprocessor">#include "node.h"</span>
|
|
<a name="l00031"></a>00031 <span class="preprocessor">#include "../../core/peo_debug.h"</span>
|
|
<a name="l00032"></a>00032
|
|
<a name="l00033"></a>00033 std :: vector <Node> the_schema;
|
|
<a name="l00034"></a>00034
|
|
<a name="l00035"></a>00035 <a class="code" href="struct_node.html">Node</a> * my_node;
|
|
<a name="l00036"></a>00036
|
|
<a name="l00037"></a>00037 RANK_ID getRankOfRunner (RUNNER_ID __key) {
|
|
<a name="l00038"></a>00038
|
|
<a name="l00039"></a>00039 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < the_schema.size (); i ++)
|
|
<a name="l00040"></a>00040 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < the_schema [i].id_run.size (); j ++)
|
|
<a name="l00041"></a>00041 <span class="keywordflow">if</span> (the_schema [i].id_run [j] == __key)
|
|
<a name="l00042"></a>00042 <span class="keywordflow">return</span> the_schema [i].rk;
|
|
<a name="l00043"></a>00043 assert (<span class="keyword">false</span>);
|
|
<a name="l00044"></a>00044 <span class="keywordflow">return</span> 0;
|
|
<a name="l00045"></a>00045 }
|
|
<a name="l00046"></a>00046
|
|
<a name="l00047"></a>00047 <span class="keyword">static</span> <span class="keywordtype">void</span> loadNode (<span class="keywordtype">int</span> __rk_sched) {
|
|
<a name="l00048"></a>00048
|
|
<a name="l00049"></a>00049 <a class="code" href="struct_node.html">Node</a> node;
|
|
<a name="l00050"></a>00050
|
|
<a name="l00051"></a>00051 node.<a class="code" href="struct_node.html#98deed2036c3dd8fc0f4fe8dacf56a92">rk_sched</a> = __rk_sched;
|
|
<a name="l00052"></a>00052
|
|
<a name="l00053"></a>00053 <span class="comment">/* ATT: name*/</span>
|
|
<a name="l00054"></a>00054 node.<a class="code" href="struct_node.html#7de6f254b6b8c3f9f8287af0bb742e9b">rk</a> = getRankFromName (getAttributeValue (<span class="stringliteral">"name"</span>));
|
|
<a name="l00055"></a>00055 <span class="comment">/* ATT: num_workers */</span>
|
|
<a name="l00056"></a>00056 node.<a class="code" href="struct_node.html#01fec86d75332858b158c810d57caee3">num_workers</a> = atoi (getAttributeValue (<span class="stringliteral">"num_workers"</span>).c_str ());
|
|
<a name="l00057"></a>00057
|
|
<a name="l00058"></a>00058 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00059"></a>00059
|
|
<a name="l00060"></a>00060 <span class="comment">/* TAG: <runner> | </node> */</span>
|
|
<a name="l00061"></a>00061 std :: string name = getNextNode ();
|
|
<a name="l00062"></a>00062 assert (name == <span class="stringliteral">"runner"</span> || name == <span class="stringliteral">"node"</span>);
|
|
<a name="l00063"></a>00063 <span class="keywordflow">if</span> (name == <span class="stringliteral">"runner"</span>) {
|
|
<a name="l00064"></a>00064 <span class="comment">/* TAG: </node> */</span>
|
|
<a name="l00065"></a>00065 node.<a class="code" href="struct_node.html#a90013b890888d3d252a71cb4fe48934">id_run</a>.push_back (atoi (getNextNode ().c_str ()));
|
|
<a name="l00066"></a>00066 <span class="comment">/* TAG: </runner> */</span>
|
|
<a name="l00067"></a>00067 assert (getNextNode () == <span class="stringliteral">"runner"</span>);
|
|
<a name="l00068"></a>00068 }
|
|
<a name="l00069"></a>00069 <span class="keywordflow">else</span> {
|
|
<a name="l00070"></a>00070 <span class="comment">/* TAG: </node> */</span>
|
|
<a name="l00071"></a>00071 the_schema.push_back (node);
|
|
<a name="l00072"></a>00072 <span class="keywordflow">break</span>;
|
|
<a name="l00073"></a>00073 }
|
|
<a name="l00074"></a>00074 }
|
|
<a name="l00075"></a>00075 }
|
|
<a name="l00076"></a>00076
|
|
<a name="l00077"></a>00077 <span class="keyword">static</span> <span class="keywordtype">void</span> loadGroup () {
|
|
<a name="l00078"></a>00078
|
|
<a name="l00079"></a>00079 std :: string name;
|
|
<a name="l00080"></a>00080
|
|
<a name="l00081"></a>00081 <span class="comment">/* ATT: scheduler*/</span>
|
|
<a name="l00082"></a>00082 <span class="keywordtype">int</span> rk_sched = getRankFromName (getAttributeValue (<span class="stringliteral">"scheduler"</span>));
|
|
<a name="l00083"></a>00083
|
|
<a name="l00084"></a>00084 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00085"></a>00085
|
|
<a name="l00086"></a>00086 <span class="comment">/* TAG: <node> | </group> */</span>
|
|
<a name="l00087"></a>00087 name = getNextNode ();
|
|
<a name="l00088"></a>00088 assert (name == <span class="stringliteral">"node"</span> || name == <span class="stringliteral">"group"</span>);
|
|
<a name="l00089"></a>00089 <span class="keywordflow">if</span> (name == <span class="stringliteral">"node"</span>)
|
|
<a name="l00090"></a>00090 <span class="comment">/* TAG: <node> */</span>
|
|
<a name="l00091"></a>00091 loadNode (rk_sched);
|
|
<a name="l00092"></a>00092 <span class="keywordflow">else</span>
|
|
<a name="l00093"></a>00093 <span class="comment">/* TAG: </group> */</span>
|
|
<a name="l00094"></a>00094 <span class="keywordflow">break</span>;
|
|
<a name="l00095"></a>00095 }
|
|
<a name="l00096"></a>00096 }
|
|
<a name="l00097"></a>00097
|
|
<a name="l00098"></a>00098 <span class="keywordtype">bool</span> isScheduleNode () {
|
|
<a name="l00099"></a>00099
|
|
<a name="l00100"></a>00100 <span class="keywordflow">return</span> my_node -> rk == my_node -> rk_sched;
|
|
<a name="l00101"></a>00101 }
|
|
<a name="l00102"></a>00102
|
|
<a name="l00103"></a>00103 <span class="keywordtype">void</span> loadSchema (<span class="keyword">const</span> <span class="keywordtype">char</span> * __filename) {
|
|
<a name="l00104"></a>00104
|
|
<a name="l00105"></a>00105 openXMLDocument (__filename);
|
|
<a name="l00106"></a>00106
|
|
<a name="l00107"></a>00107 std :: string name;
|
|
<a name="l00108"></a>00108
|
|
<a name="l00109"></a>00109 <span class="comment">/* TAG: <schema> */</span>
|
|
<a name="l00110"></a>00110 name = getNextNode ();
|
|
<a name="l00111"></a>00111 assert (name == <span class="stringliteral">"schema"</span>);
|
|
<a name="l00112"></a>00112
|
|
<a name="l00113"></a>00113 <span class="keywordflow">while</span> (<span class="keyword">true</span>) {
|
|
<a name="l00114"></a>00114
|
|
<a name="l00115"></a>00115 <span class="comment">/* TAG: <group> | </schema> */</span>
|
|
<a name="l00116"></a>00116 name = getNextNode ();
|
|
<a name="l00117"></a>00117 assert (name == <span class="stringliteral">"group"</span> || name == <span class="stringliteral">"schema"</span>);
|
|
<a name="l00118"></a>00118 <span class="keywordflow">if</span> (name == <span class="stringliteral">"group"</span>)
|
|
<a name="l00119"></a>00119 <span class="comment">/* TAG: <group> */</span>
|
|
<a name="l00120"></a>00120 loadGroup ();
|
|
<a name="l00121"></a>00121 <span class="keywordflow">else</span>
|
|
<a name="l00122"></a>00122 <span class="comment">/* TAG: </schema> */</span>
|
|
<a name="l00123"></a>00123 <span class="keywordflow">break</span>;
|
|
<a name="l00124"></a>00124 }
|
|
<a name="l00125"></a>00125
|
|
<a name="l00126"></a>00126 <span class="comment">/* Looking for my node */</span>
|
|
<a name="l00127"></a>00127 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < the_schema.size (); i ++)
|
|
<a name="l00128"></a>00128 <span class="keywordflow">if</span> (the_schema [i].rk == getNodeRank ())
|
|
<a name="l00129"></a>00129 my_node = & (the_schema [i]);
|
|
<a name="l00130"></a>00130
|
|
<a name="l00131"></a>00131 <span class="comment">/* About me */</span>
|
|
<a name="l00132"></a>00132 <span class="keywordtype">char</span> mess [1000];
|
|
<a name="l00133"></a>00133
|
|
<a name="l00134"></a>00134 sprintf (mess, <span class="stringliteral">"my rank is %d"</span>, my_node -> rk);
|
|
<a name="l00135"></a>00135 printDebugMessage (mess);
|
|
<a name="l00136"></a>00136 <span class="keywordflow">if</span> (isScheduleNode ())
|
|
<a name="l00137"></a>00137 printDebugMessage (<span class="stringliteral">"I'am a scheduler"</span>);
|
|
<a name="l00138"></a>00138 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < my_node -> id_run.size (); i ++) {
|
|
<a name="l00139"></a>00139 sprintf (mess, <span class="stringliteral">"I manage the runner %d"</span>, my_node -> id_run [i]);
|
|
<a name="l00140"></a>00140 printDebugMessage (mess);
|
|
<a name="l00141"></a>00141 }
|
|
<a name="l00142"></a>00142 <span class="keywordflow">if</span> (my_node -> num_workers) {
|
|
<a name="l00143"></a>00143
|
|
<a name="l00144"></a>00144 sprintf (mess, <span class="stringliteral">"I manage %d worker(s)"</span>, my_node -> num_workers);
|
|
<a name="l00145"></a>00145 printDebugMessage (mess);
|
|
<a name="l00146"></a>00146 }
|
|
<a name="l00147"></a>00147
|
|
<a name="l00148"></a>00148 closeXMLDocument ();
|
|
<a name="l00149"></a>00149 }
|
|
<a name="l00150"></a>00150
|
|
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Wed Dec 20 13:45:48 2006 for ParadisEO by
|
|
<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>
|