<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>FAUST compiler: klass.cpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.6.3 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>klass.cpp</h1><a href="klass_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/************************************************************************</span>
<a name="l00002"></a>00002 <span class="comment"> ************************************************************************</span>
<a name="l00003"></a>00003 <span class="comment"> FAUST compiler</span>
<a name="l00004"></a>00004 <span class="comment"> Copyright (C) 2003-2004 GRAME, Centre National de Creation Musicale</span>
<a name="l00005"></a>00005 <span class="comment"> ---------------------------------------------------------------------</span>
<a name="l00006"></a>00006 <span class="comment"> This program is free software; you can redistribute it and/or modify</span>
<a name="l00007"></a>00007 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00008"></a>00008 <span class="comment"> the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00009"></a>00009 <span class="comment"> (at your option) any later version.</span>
<a name="l00010"></a>00010 <span class="comment"></span>
<a name="l00011"></a>00011 <span class="comment"> This program is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00014"></a>00014 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00015"></a>00015 <span class="comment"></span>
<a name="l00016"></a>00016 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00017"></a>00017 <span class="comment"> along with this program; if not, write to the Free Software</span>
<a name="l00018"></a>00018 <span class="comment"> Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00019"></a>00019 <span class="comment"> ************************************************************************</span>
<a name="l00020"></a>00020 <span class="comment"> ************************************************************************/</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="comment">/**********************************************************************</span>
<a name="l00025"></a>00025 <span class="comment"> - klass.cpp : class C++ a remplir (projet FAUST) -</span>
<a name="l00026"></a>00026 <span class="comment"></span>
<a name="l00027"></a>00027 <span class="comment"></span>
<a name="l00028"></a>00028 <span class="comment"> Historique :</span>
<a name="l00029"></a>00029 <span class="comment"> -----------</span>
<a name="l00030"></a>00030 <span class="comment"> 17-10-2001 : implementation initiale (yo)</span>
<a name="l00031"></a>00031 <span class="comment"> 18-10-2001 : Ajout de getFreshID (yo)</span>
<a name="l00032"></a>00032 <span class="comment"> 02-11-2001 : Ajout de sous classes (yo)</span>
<a name="l00033"></a>00033 <span class="comment"> 06-11-2001 : modif impression des classes (yo)</span>
<a name="l00034"></a>00034 <span class="comment"></span>
<a name="l00035"></a>00035 <span class="comment">***********************************************************************/</span>
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="preprocessor">#include <stdio.h></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include <iostream></span>
<a name="l00039"></a>00039 <span class="preprocessor">#include <sstream></span>
<a name="l00040"></a>00040 <span class="preprocessor">#include <string></span>
<a name="l00041"></a>00041 <span class="preprocessor">#include <list></span>
<a name="l00042"></a>00042 <span class="preprocessor">#include <map></span>
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="preprocessor">#include "<a class="code" href="floats_8hh.html">floats.hh</a>"</span>
<a name="l00045"></a>00045 <span class="preprocessor">#include "<a class="code" href="smartpointer_8hh.html">smartpointer.hh</a>"</span>
<a name="l00046"></a>00046 <span class="preprocessor">#include "<a class="code" href="klass_8hh.html">klass.hh</a>"</span>
<a name="l00047"></a>00047 <span class="preprocessor">#include "<a class="code" href="uitree_8hh.html">uitree.hh</a>"</span>
<a name="l00048"></a>00048 <span class="preprocessor">#include "<a class="code" href="Text_8hh.html">Text.hh</a>"</span>
<a name="l00049"></a>00049 <span class="preprocessor">#include "<a class="code" href="signals_8hh.html">signals.hh</a>"</span>
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a44285cbe41b6d58a00854fead2999187">gVectorSwitch</a>;
<a name="l00052"></a>00052 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#afef3420cdcee4f66a23bfaed2f9d9647">gDeepFirstSwitch</a>;
<a name="l00053"></a>00053 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a11096523c7bafc4f81b51a38c19e03e8">gOpenMPSwitch</a>;
<a name="l00054"></a>00054 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="compile__scal_8cpp.html#aed8da6f8f23ca426bf3ea6564e0bd6f2">gSchedulerSwitch</a>;
<a name="l00055"></a>00055 <span class="keyword">extern</span> <span class="keywordtype">int</span> <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a>;
<a name="l00056"></a>00056 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a1ba979dbee201fae63feca5bafc8f394">gUIMacroSwitch</a>;
<a name="l00057"></a>00057 <span class="keyword">extern</span> <span class="keywordtype">int</span> <a class="code" href="klass_8cpp.html#afc8541b52b32a942648daf968114789c">gVectorLoopVariant</a>;
<a name="l00058"></a>00058 <span class="keyword">extern</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a023d989e0ba581d81873a04bf696450c">gGroupTaskSwitch</a>;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keyword">extern</span> map<Tree, set<Tree> > <a class="code" href="doc_8cpp.html#aaf647729deae314d35817ccb36f088e4">gMetaDataSet</a>;
<a name="l00061"></a><a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">00061</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a> = 0;
<a name="l00062"></a>00062
<a name="l00063"></a><a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">00063</a> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a> (<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00064"></a>00064 {
<a name="l00065"></a>00065 fout << <span class="charliteral">'\n'</span>;
<a name="l00066"></a>00066 <span class="keywordflow">while</span> (n--) fout << <span class="charliteral">'\t'</span>;
<a name="l00067"></a>00067 }
<a name="l00068"></a>00068
<a name="l00072"></a><a class="code" href="classKlass.html#a2cda1739cf5b00fbf32dfec9a38788c9">00072</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a2cda1739cf5b00fbf32dfec9a38788c9" title="Store the loop used to compute a signal.">Klass::setLoopProperty</a>(<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> sig, <a class="code" href="structLoop.html">Loop</a>* l)
<a name="l00073"></a>00073 {
<a name="l00074"></a>00074 <a class="code" href="classKlass.html#a98a9e66922036b5df048626038897163" title="loops used to compute some signals">fLoopProperty</a>.set(sig,l);
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076
<a name="l00080"></a><a class="code" href="classKlass.html#a8e1da4c0525a993e38749160f3fc2aa5">00080</a> <span class="keywordtype">bool</span> <a class="code" href="classKlass.html#a8e1da4c0525a993e38749160f3fc2aa5" title="Returns the loop used to compute a signal.">Klass::getLoopProperty</a>(<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> sig, <a class="code" href="structLoop.html">Loop</a>*& l)
<a name="l00081"></a>00081 {
<a name="l00082"></a>00082 <span class="keywordflow">return</span> <a class="code" href="classKlass.html#a98a9e66922036b5df048626038897163" title="loops used to compute some signals">fLoopProperty</a>.get(sig, l);
<a name="l00083"></a>00083 }
<a name="l00084"></a>00084
<a name="l00089"></a><a class="code" href="classKlass.html#a393c343f0a6fe7d0cf16d6e91f243398">00089</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a393c343f0a6fe7d0cf16d6e91f243398" title="Open a non-recursive loop on top of the stack of open loops.">Klass::openLoop</a>(<span class="keyword">const</span> <span class="keywordtype">string</span>& size)
<a name="l00090"></a>00090 {
<a name="l00091"></a>00091 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a> = <span class="keyword">new</span> <a class="code" href="structLoop.html">Loop</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, size);
<a name="l00092"></a>00092 }
<a name="l00093"></a>00093
<a name="l00099"></a><a class="code" href="classKlass.html#a1e3a9109997c2de75b198d34a119bbfb">00099</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a393c343f0a6fe7d0cf16d6e91f243398" title="Open a non-recursive loop on top of the stack of open loops.">Klass::openLoop</a>(<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> recsymbol, <span class="keyword">const</span> <span class="keywordtype">string</span>& size)
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a> = <span class="keyword">new</span> <a class="code" href="structLoop.html">Loop</a>(recsymbol, <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, size);
<a name="l00102"></a>00102 <span class="comment">//cerr << "open loop :" << fTopLoop << endl;</span>
<a name="l00103"></a>00103 }
<a name="l00104"></a>00104
<a name="l00109"></a><a class="code" href="classKlass.html#a4d19081c50e9ce7300f9b220df6fce76">00109</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a4d19081c50e9ce7300f9b220df6fce76" title="Close the top loop and either keep it or absorb it within its enclosing loop.">Klass::closeLoop</a>(<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a> sig)
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 assert(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00112"></a>00112 <a class="code" href="structLoop.html">Loop</a>* l = <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>;
<a name="l00113"></a>00113 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a> = l-><a class="code" href="structLoop.html#a73875fc1b6b91e2cbabeda68a8bd42f1" title="Loop from which this one originated.">fEnclosingLoop</a>;
<a name="l00114"></a>00114 assert(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00115"></a>00115 <span class="comment">//cerr << "close loop :" << l << endl;</span>
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (l-><a class="code" href="structLoop.html#a575146a1b845596fd33b7c0a2f7d48ec" title="true when the loop doesn&#39;t contain any line of code">isEmpty</a>() || l-><a class="code" href="structLoop.html#a8ab807704888fd372172c3be3ddada01" title="returns true is this loop has recursive dependencies">hasRecDependencies</a>()) {
<a name="l00118"></a>00118 <span class="comment">// empty or dependent loop -> absorbed by enclosing one</span>
<a name="l00119"></a>00119 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>-><a class="code" href="structLoop.html#a1774fc6f54824e4a8c9bc2eb9bc34c24" title="absorb a loop inside this one">absorb</a>(l);
<a name="l00120"></a>00120 <span class="keyword">delete</span> l;
<a name="l00121"></a>00121 } <span class="keywordflow">else</span> {
<a name="l00122"></a>00122 <span class="comment">// we have an independent loop</span>
<a name="l00123"></a>00123 <span class="keywordflow">if</span> (sig) <a class="code" href="classKlass.html#a2cda1739cf5b00fbf32dfec9a38788c9" title="Store the loop used to compute a signal.">setLoopProperty</a>(sig,l); <span class="comment">// associate the signal</span>
<a name="l00124"></a>00124 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.insert(l);
<a name="l00125"></a>00125 }
<a name="l00126"></a>00126 }
<a name="l00127"></a>00127
<a name="l00131"></a><a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98">00131</a> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(<span class="keywordtype">int</span> n, list<string>& lines, ostream& fout)
<a name="l00132"></a>00132 {
<a name="l00133"></a>00133 list<string>::iterator s;
<a name="l00134"></a>00134 <span class="keywordflow">for</span> (s = lines.begin(); s != lines.end(); s++) {
<a name="l00135"></a>00135 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << *s;
<a name="l00136"></a>00136 }
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138
<a name="l00142"></a><a class="code" href="klass_8cpp.html#af2c9d4adde58ed5726c5136d74423e7d">00142</a> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#af2c9d4adde58ed5726c5136d74423e7d" title="Print a list of elements (e1, e2,.">printdecllist</a>(<span class="keywordtype">int</span> n, <span class="keyword">const</span> <span class="keywordtype">string</span>& decl, list<string>& content, ostream& fout)
<a name="l00143"></a>00143 {
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (!content.empty()) {
<a name="l00145"></a>00145 list<string>::iterator s;
<a name="l00146"></a>00146 fout << <span class="stringliteral">"\\"</span>;
<a name="l00147"></a>00147 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << decl;
<a name="l00148"></a>00148 <span class="keywordtype">string</span> sep = <span class="stringliteral">"("</span>;
<a name="l00149"></a>00149 <span class="keywordflow">for</span> (s = content.begin(); s != content.end(); s++) {
<a name="l00150"></a>00150 fout << sep << *s;
<a name="l00151"></a>00151 sep = <span class="stringliteral">", "</span>;
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153 fout << <span class="charliteral">')'</span>;
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155 }
<a name="l00156"></a>00156
<a name="l00160"></a><a class="code" href="classKlass.html#af497466e4d139514e45088917d208142">00160</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#af497466e4d139514e45088917d208142" title="Print the required C++ libraries as comments in source code.">Klass::printLibrary</a>(ostream& fout)
<a name="l00161"></a>00161 {
<a name="l00162"></a>00162 set<string> S;
<a name="l00163"></a>00163 set<string>::iterator f;
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="keywordtype">string</span> sep;
<a name="l00166"></a>00166 <a class="code" href="classKlass.html#a18947058c0cb1d7d3e610ddd6bc287f1">collectLibrary</a>(S);
<a name="l00167"></a>00167 fout << <span class="stringliteral">"/* link with "</span>;
<a name="l00168"></a>00168 <span class="keywordflow">for</span> (f = S.begin(), sep =<span class="stringliteral">": "</span>; f != S.end(); f++, sep = <span class="stringliteral">", "</span>) {
<a name="l00169"></a>00169 fout << sep << *f;
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171 fout << <span class="stringliteral">" */\n"</span>;
<a name="l00172"></a>00172 }
<a name="l00173"></a>00173
<a name="l00177"></a><a class="code" href="classKlass.html#abd4216fcfc280a3f180421c95c17737e">00177</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#abd4216fcfc280a3f180421c95c17737e" title="Print the required include files.">Klass::printIncludeFile</a>(ostream& fout)
<a name="l00178"></a>00178 {
<a name="l00179"></a>00179 set<string> S;
<a name="l00180"></a>00180 set<string>::iterator f;
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a11096523c7bafc4f81b51a38c19e03e8">gOpenMPSwitch</a>) {
<a name="l00183"></a>00183 fout << <span class="stringliteral">"#include <omp.h>"</span> << <span class="stringliteral">"\n"</span>;
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <a class="code" href="classKlass.html#ab819dc03f476cff0ee1581f80845126f">collectIncludeFile</a>(S);
<a name="l00187"></a>00187 <span class="keywordflow">for</span> (f = S.begin(); f != S.end(); f++) {
<a name="l00188"></a>00188 fout << <span class="stringliteral">"#include "</span> << *f << <span class="stringliteral">"\n"</span>;
<a name="l00189"></a>00189 }
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191
<a name="l00195"></a><a class="code" href="classKlass.html#a4dfd4a8dadd3f996d0f3ca61257bc287">00195</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a4dfd4a8dadd3f996d0f3ca61257bc287" title="Print metadata declaration.">Klass::printMetadata</a>(<span class="keywordtype">int</span> n, <span class="keyword">const</span> map<<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a>, set<Tree> >& S, ostream& fout)
<a name="l00196"></a>00196 {
<a name="l00197"></a>00197 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"static void metadata(Meta* m) \t{ "</span>;
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="keywordflow">for</span> (map<<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">Tree</a>, set<Tree> >::iterator i = <a class="code" href="doc_8cpp.html#aaf647729deae314d35817ccb36f088e4">gMetaDataSet</a>.begin(); i != <a class="code" href="doc_8cpp.html#aaf647729deae314d35817ccb36f088e4">gMetaDataSet</a>.end(); i++) {
<a name="l00200"></a>00200 <span class="keywordflow">if</span> (i->first != <a class="code" href="tree_8hh.html#a61c13e9361cfa80bbb3cd6ce60a8f595">tree</a>(<span class="stringliteral">"author"</span>)) {
<a name="l00201"></a>00201 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"m->declare(\""</span> << *(i->first) << <span class="stringliteral">"\", "</span> << **(i->second.begin()) << <span class="stringliteral">");"</span>;
<a name="l00202"></a>00202 } <span class="keywordflow">else</span> {
<a name="l00203"></a>00203 <span class="keywordflow">for</span> (set<Tree>::iterator j = i->second.begin(); j != i->second.end(); j++) {
<a name="l00204"></a>00204 <span class="keywordflow">if</span> (j == i->second.begin()) {
<a name="l00205"></a>00205 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"m->declare(\""</span> << *(i->first) << <span class="stringliteral">"\", "</span> << **j << <span class="stringliteral">");"</span> ;
<a name="l00206"></a>00206 } <span class="keywordflow">else</span> {
<a name="l00207"></a>00207 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"m->declare(\""</span> << <span class="stringliteral">"contributor"</span> << <span class="stringliteral">"\", "</span> << **j << <span class="stringliteral">");"</span>;
<a name="l00208"></a>00208 }
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210 }
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212
<a name="l00213"></a>00213 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"}"</span> << endl;
<a name="l00214"></a>00214 }
<a name="l00215"></a>00215
<a name="l00216"></a><a class="code" href="klass_8cpp.html#a32ff5c21183dba70c007cd5a1ec2e851">00216</a> <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a32ff5c21183dba70c007cd5a1ec2e851">isElement</a>(<span class="keyword">const</span> set<Loop*>& S, <a class="code" href="structLoop.html">Loop</a>* l)
<a name="l00217"></a>00217 {
<a name="l00218"></a>00218 <span class="keywordflow">return</span> S.find(l)!= S.end();
<a name="l00219"></a>00219 }
<a name="l00220"></a>00220
<a name="l00224"></a><a class="code" href="classKlass.html#a2fb95d32adfabe0c5442e09317692a9a">00224</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a2fb95d32adfabe0c5442e09317692a9a" title="Print a loop graph deep first.">Klass::printLoopDeepFirst</a>(<span class="keywordtype">int</span> n, ostream& fout, <a class="code" href="structLoop.html">Loop</a>* l, set<Loop*>& visited)
<a name="l00225"></a>00225 {
<a name="l00226"></a>00226 <span class="comment">// avoid printing already printed loops</span>
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a32ff5c21183dba70c007cd5a1ec2e851">isElement</a>(visited, l)) <span class="keywordflow">return</span>;
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="comment">// remember we have printed this loop</span>
<a name="l00230"></a>00230 visited.insert(l);
<a name="l00231"></a>00231
<a name="l00232"></a>00232 <span class="comment">// print the dependencies loops (that need to be computed before this one)</span>
<a name="l00233"></a>00233 <span class="keywordflow">for</span> (lset::const_iterator p =l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.begin(); p!=l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.end(); p++) {
<a name="l00234"></a>00234 <a class="code" href="classKlass.html#a2fb95d32adfabe0c5442e09317692a9a" title="Print a loop graph deep first.">printLoopDeepFirst</a>(n, fout, *p, visited);
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236 <span class="comment">// the print the loop itself</span>
<a name="l00237"></a>00237 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout);
<a name="l00238"></a>00238 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"// LOOP "</span> << l << <span class="stringliteral">", ORDER "</span> << l-><a class="code" href="structLoop.html#a5fdf3e2e7d63e1ae6b0718c34021f5da" title="used during topological sort">fOrder</a> << endl;
<a name="l00239"></a>00239 l-><a class="code" href="structLoop.html#ae50f255d2f1622ffca999f5f755be494" title="print the loop">println</a>(n+1, fout);
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241
<a name="l00245"></a><a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8">00245</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(<a class="code" href="structLoop.html">Loop</a>* l)
<a name="l00246"></a>00246 {
<a name="l00247"></a>00247 l-><a class="code" href="structLoop.html#a5237f580c9e6f25693da26d00fda7798" title="how many loops depend on this one">fUseCount</a>++;
<a name="l00248"></a>00248 <span class="keywordflow">if</span> (l-><a class="code" href="structLoop.html#a5237f580c9e6f25693da26d00fda7798" title="how many loops depend on this one">fUseCount</a> == 1) {
<a name="l00249"></a>00249 <span class="keywordflow">for</span> (lset::iterator p =l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.begin(); p!=l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.end(); p++) {
<a name="l00250"></a>00250 <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(*p);
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252 }
<a name="l00253"></a>00253 }
<a name="l00254"></a>00254
<a name="l00258"></a><a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8">00258</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(<a class="code" href="structLoop.html">Loop</a>* l)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keywordtype">int</span> n = l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.size();
<a name="l00261"></a>00261 <span class="keywordflow">if</span> (n==0) {
<a name="l00262"></a>00262 <span class="keywordflow">return</span>;
<a name="l00263"></a>00263 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n==1) {
<a name="l00264"></a>00264 <a class="code" href="structLoop.html">Loop</a>* f = *(l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.begin());
<a name="l00265"></a>00265 <span class="keywordflow">if</span> (f-><a class="code" href="structLoop.html#a5237f580c9e6f25693da26d00fda7798" title="how many loops depend on this one">fUseCount</a> == 1) {
<a name="l00266"></a>00266 l-><a class="code" href="structLoop.html#a11c5adcd88f4c8fabbaa9f6feae5a8f7">concat</a>(f);
<a name="l00267"></a>00267 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(l);
<a name="l00268"></a>00268 } <span class="keywordflow">else</span> {
<a name="l00269"></a>00269 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(f);
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271 <span class="keywordflow">return</span>;
<a name="l00272"></a>00272 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n > 1) {
<a name="l00273"></a>00273 <span class="keywordflow">for</span> (lset::iterator p =l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.begin(); p!=l-><a class="code" href="structLoop.html#a73f599daabab6c3669355713ca914e83" title="Loops that must be computed before this one.">fBackwardLoopDependencies</a>.end(); p++) {
<a name="l00274"></a>00274 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(*p);
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276 }
<a name="l00277"></a>00277 }
<a name="l00278"></a>00278
<a name="l00279"></a><a class="code" href="klass_8cpp.html#a7f3d687fcf318bcbdd8b0e08a7a2877e">00279</a> <span class="preprocessor">#define WORK_STEALING_INDEX 0</span>
<a name="l00280"></a><a class="code" href="klass_8cpp.html#a3d42e19ff567ac1126726174ba4f0a27">00280</a> <span class="preprocessor"></span><span class="preprocessor">#define LAST_TASK_INDEX 1</span>
<a name="l00281"></a><a class="code" href="klass_8cpp.html#a05378f2ac18ca2ec43a5f60a2bab93bb">00281</a> <span class="preprocessor"></span><span class="preprocessor">#define START_TASK_INDEX LAST_TASK_INDEX + 1</span>
<a name="l00282"></a>00282 <span class="preprocessor"></span>
<a name="l00283"></a><a class="code" href="klass_8cpp.html#ad6775f7464b8899a4eb6ce8be81a17c8">00283</a> <span class="preprocessor">#define START_TASK_MAX 2</span>
<a name="l00284"></a>00284 <span class="preprocessor"></span>
<a name="l00285"></a><a class="code" href="classKlass.html#a0019dbeefbadbcb850c742e257508722">00285</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a0019dbeefbadbcb850c742e257508722">Klass::buildTasksList</a>()
<a name="l00286"></a>00286 {
<a name="l00287"></a>00287 <a class="code" href="graphSorting_8hh.html#a49959ee63ec8451f237fb51751b28136">lgraph</a> G;
<a name="l00288"></a>00288
<a name="l00289"></a>00289 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a023d989e0ba581d81873a04bf696450c">gGroupTaskSwitch</a>) {
<a name="l00290"></a>00290 <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00291"></a>00291 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00292"></a>00292 }
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <a class="code" href="graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024" title="Topological sort of an acyclic graph of loops.">sortGraph</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, G);
<a name="l00295"></a>00295 <span class="keywordtype">int</span> index_task = <a class="code" href="klass_8cpp.html#a05378f2ac18ca2ec43a5f60a2bab93bb">START_TASK_INDEX</a>;
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"TaskGraph fGraph;"</span>);
<a name="l00298"></a>00298 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"FAUSTFLOAT** input;"</span>);
<a name="l00299"></a>00299 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"FAUSTFLOAT** output;"</span>);
<a name="l00300"></a>00300 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"volatile bool fIsFinished;"</span>);
<a name="l00301"></a>00301 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"int fFullCount;"</span>);
<a name="l00302"></a>00302 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"int fIndex;"</span>);
<a name="l00303"></a>00303 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"DSPThreadPool fThreadPool;"</span>);
<a name="l00304"></a>00304 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"int fStaticNumThreads;"</span>);
<a name="l00305"></a>00305 <a class="code" href="classKlass.html#acb05aee5dfd9fbc3f14215292bb2c18e">addDeclCode</a>(<span class="stringliteral">"int fDynamicNumThreads;"</span>);
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <span class="comment">// Compute forward dependencies</span>
<a name="l00308"></a>00308 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00309"></a>00309 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00310"></a>00310 <span class="keywordflow">for</span> (lset::const_iterator p1 = (*p)->fBackwardLoopDependencies.begin(); p1!=(*p)->fBackwardLoopDependencies.end(); p1++) {
<a name="l00311"></a>00311 (*p1)->fForwardLoopDependencies.insert((*p));
<a name="l00312"></a>00312 }
<a name="l00313"></a>00313 (*p)->fIndex = index_task;
<a name="l00314"></a>00314 index_task++;
<a name="l00315"></a>00315 }
<a name="l00316"></a>00316 }
<a name="l00317"></a>00317
<a name="l00318"></a>00318 <span class="comment">// Compute ready tasks list</span>
<a name="l00319"></a>00319 vector<int> task_num;
<a name="l00320"></a>00320 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00321"></a>00321 lset::const_iterator next;
<a name="l00322"></a>00322 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00323"></a>00323 <span class="keywordflow">if</span> ((*p)->fBackwardLoopDependencies.size() == 0) {
<a name="l00324"></a>00324 task_num.push_back((*p)->fIndex);
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="keywordflow">if</span> (task_num.size() < <a class="code" href="klass_8cpp.html#ad6775f7464b8899a4eb6ce8be81a17c8">START_TASK_MAX</a>) {
<a name="l00330"></a>00330
<a name="l00331"></a>00331 <span class="comment">// Push ready tasks thread 0, execute one task directly</span>
<a name="l00332"></a>00332
<a name="l00333"></a>00333 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<span class="stringliteral">"if (cur_thread == 0) {"</span>);
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <a class="code" href="structLoop.html">Loop</a>* keep = NULL;
<a name="l00336"></a>00336 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00337"></a>00337 lset::const_iterator next;
<a name="l00338"></a>00338 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00339"></a>00339 <span class="keywordflow">if</span> ((*p)->fBackwardLoopDependencies.size() == 0) {
<a name="l00340"></a>00340 <span class="keywordflow">if</span> (keep == NULL) {
<a name="l00341"></a>00341 keep = *p;
<a name="l00342"></a>00342 } <span class="keywordflow">else</span> {
<a name="l00343"></a>00343 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">" taskqueue.PushHead($0);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p)->fIndex)));
<a name="l00344"></a>00344 }
<a name="l00345"></a>00345 }
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347 }
<a name="l00348"></a>00348
<a name="l00349"></a>00349 <span class="keywordflow">if</span> (keep != NULL) {
<a name="l00350"></a>00350 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">" tasknum = $0;"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>(keep-><a class="code" href="structLoop.html#a96a59acb30654a19fd06bc4e1967e169" title="used during scheduler mode code generation">fIndex</a>)));
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<span class="stringliteral">"} else {"</span>);
<a name="l00354"></a>00354 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<span class="stringliteral">" tasknum = TaskQueue::GetNextTask(cur_thread);"</span>);
<a name="l00355"></a>00355 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<span class="stringliteral">"}"</span>);
<a name="l00356"></a>00356
<a name="l00357"></a>00357 } <span class="keywordflow">else</span> {
<a name="l00358"></a>00358
<a name="l00359"></a>00359 <span class="comment">// Cut ready tasks list and have each thread (dynamically) use a subpart</span>
<a name="l00360"></a>00360 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"int task_list_size = $0;"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((<span class="keywordtype">int</span>)task_num.size())));
<a name="l00361"></a>00361 stringstream buf;
<a name="l00362"></a>00362 buf << <span class="stringliteral">"int task_list["</span> << task_num.size() << <span class="stringliteral">"] = {"</span>;
<a name="l00363"></a>00363 <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0; i < task_num.size(); i++) {
<a name="l00364"></a>00364 buf << task_num[i];
<a name="l00365"></a>00365 <span class="keywordflow">if</span> (i != (task_num.size() - 1))
<a name="l00366"></a>00366 buf << <span class="stringliteral">","</span>;
<a name="l00367"></a>00367 }
<a name="l00368"></a>00368 buf << <span class="stringliteral">"};"</span>;
<a name="l00369"></a>00369
<a name="l00370"></a>00370 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(buf.str());
<a name="l00371"></a>00371 <a class="code" href="classKlass.html#a368fbe339be25ff39dcddd984e2c6342">addZone3</a>(<span class="stringliteral">"taskqueue.InitTaskList(task_list_size, task_list, fDynamicNumThreads, cur_thread, tasknum);"</span>);
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <span class="comment">// Last stage connected to end task</span>
<a name="l00375"></a>00375 <a class="code" href="classKlass.html#ae41e7100365095136edfa5ab8f30f817">addZone2c</a>(<span class="stringliteral">"// Initialize end task"</span>);
<a name="l00376"></a>00376 <a class="code" href="classKlass.html#ae41e7100365095136edfa5ab8f30f817">addZone2c</a>(<a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"fGraph.InitTask($0,$1);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>(<a class="code" href="klass_8cpp.html#a3d42e19ff567ac1126726174ba4f0a27">LAST_TASK_INDEX</a>), <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((<span class="keywordtype">int</span>)G[0].size())));
<a name="l00377"></a>00377
<a name="l00378"></a>00378 <span class="comment">// Compute init section</span>
<a name="l00379"></a>00379 <a class="code" href="classKlass.html#ae41e7100365095136edfa5ab8f30f817">addZone2c</a>(<span class="stringliteral">"// Only initialize tasks with inputs"</span>);
<a name="l00380"></a>00380 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00381"></a>00381 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00382"></a>00382 <span class="keywordflow">if</span> ((*p)->fBackwardLoopDependencies.size() > 0) { <span class="comment">// Only itialize taks with inputs</span>
<a name="l00383"></a>00383 <a class="code" href="classKlass.html#ae41e7100365095136edfa5ab8f30f817">addZone2c</a>(<a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"fGraph.InitTask($0,$1);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>(<a class="code" href="klass_8cpp.html#a05378f2ac18ca2ec43a5f60a2bab93bb">START_TASK_INDEX</a> + <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++), <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((<span class="keywordtype">int</span>)(*p)->fBackwardLoopDependencies.size())));
<a name="l00384"></a>00384 } <span class="keywordflow">else</span> {
<a name="l00385"></a>00385 <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++;
<a name="l00386"></a>00386 }
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389
<a name="l00390"></a>00390 <a class="code" href="classKlass.html#a0a95cda1c8e5e601dd67b80573105af3">addInitCode</a>(<span class="stringliteral">"fStaticNumThreads = get_max_cpu();"</span>);
<a name="l00391"></a>00391 <a class="code" href="classKlass.html#a0a95cda1c8e5e601dd67b80573105af3">addInitCode</a>(<span class="stringliteral">"fDynamicNumThreads = getenv(\"OMP_NUM_THREADS\") ? atoi(getenv(\"OMP_NUM_THREADS\")) : fStaticNumThreads;"</span>);
<a name="l00392"></a>00392 <a class="code" href="classKlass.html#a0a95cda1c8e5e601dd67b80573105af3">addInitCode</a>(<span class="stringliteral">"fThreadPool.StartAll(fStaticNumThreads - 1, false, this);"</span>);
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a> = 0;
<a name="l00395"></a>00395 }
<a name="l00396"></a>00396
<a name="l00400"></a><a class="code" href="classKlass.html#a196229464faeda2537eedd5210ad58af">00400</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a196229464faeda2537eedd5210ad58af" title="Print the loop graph (used for vector code).">Klass::printLoopGraphVector</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00401"></a>00401 {
<a name="l00402"></a>00402 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a023d989e0ba581d81873a04bf696450c">gGroupTaskSwitch</a>) {
<a name="l00403"></a>00403 <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00404"></a>00404 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00405"></a>00405 }
<a name="l00406"></a>00406
<a name="l00407"></a>00407 <a class="code" href="graphSorting_8hh.html#a49959ee63ec8451f237fb51751b28136">lgraph</a> G;
<a name="l00408"></a>00408 <a class="code" href="graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024" title="Topological sort of an acyclic graph of loops.">sortGraph</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, G);
<a name="l00409"></a>00409
<a name="l00410"></a>00410 <span class="preprocessor">#if 1</span>
<a name="l00411"></a>00411 <span class="preprocessor"></span> <span class="comment">// EXPERIMENTAL</span>
<a name="l00412"></a>00412 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a44285cbe41b6d58a00854fead2999187">gVectorSwitch</a> && <a class="code" href="klass_8cpp.html#afef3420cdcee4f66a23bfaed2f9d9647">gDeepFirstSwitch</a>) {
<a name="l00413"></a>00413 set<Loop*> visited;
<a name="l00414"></a>00414 <a class="code" href="classKlass.html#a2fb95d32adfabe0c5442e09317692a9a" title="Print a loop graph deep first.">printLoopDeepFirst</a>(n, fout, <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, visited);
<a name="l00415"></a>00415 <span class="keywordflow">return</span>;
<a name="l00416"></a>00416 }
<a name="l00417"></a>00417 <span class="preprocessor">#endif</span>
<a name="l00418"></a>00418 <span class="preprocessor"></span>
<a name="l00419"></a>00419 <span class="comment">// normal mode </span>
<a name="l00420"></a>00420 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00421"></a>00421 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a44285cbe41b6d58a00854fead2999187">gVectorSwitch</a>) { <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"// SECTION : "</span> << G.size() - l; }
<a name="l00422"></a>00422 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00423"></a>00423 (*p)->println(n, fout);
<a name="l00424"></a>00424 }
<a name="l00425"></a>00425 }
<a name="l00426"></a>00426 }
<a name="l00427"></a>00427
<a name="l00431"></a><a class="code" href="classKlass.html#a544aea5095a28fe873357d352ef36f72">00431</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a544aea5095a28fe873357d352ef36f72" title="Print the loop graph as a serie of parallel loops.">Klass::printLoopGraphOpenMP</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00432"></a>00432 {
<a name="l00433"></a>00433 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a023d989e0ba581d81873a04bf696450c">gGroupTaskSwitch</a>) {
<a name="l00434"></a>00434 <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00435"></a>00435 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00436"></a>00436 }
<a name="l00437"></a>00437
<a name="l00438"></a>00438 <a class="code" href="graphSorting_8hh.html#a49959ee63ec8451f237fb51751b28136">lgraph</a> G;
<a name="l00439"></a>00439 <a class="code" href="graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024" title="Topological sort of an acyclic graph of loops.">sortGraph</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, G);
<a name="l00440"></a>00440
<a name="l00441"></a>00441 <span class="comment">// OpenMP mode : add OpenMP directives</span>
<a name="l00442"></a>00442 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00443"></a>00443 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"// SECTION : "</span> << G.size() - l;
<a name="l00444"></a>00444 <a class="code" href="classKlass.html#ab8f2345eeb6f48acd72b5582f1741bdb" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">printLoopLevelOpenMP</a>(n, G.size() - l, G[l], fout);
<a name="l00445"></a>00445 }
<a name="l00446"></a>00446 }
<a name="l00447"></a>00447
<a name="l00451"></a><a class="code" href="classKlass.html#aee6a34ecc5d6be8cf86ec148114f03b5">00451</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#aee6a34ecc5d6be8cf86ec148114f03b5" title="Print the loop graph as a serie of parallel loops.">Klass::printLoopGraphScheduler</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00452"></a>00452 {
<a name="l00453"></a>00453 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a023d989e0ba581d81873a04bf696450c">gGroupTaskSwitch</a>) {
<a name="l00454"></a>00454 <a class="code" href="klass_8cpp.html#ad5fccad2c5d3039bbf9427c4df4029f8" title="Compute how many time each loop is used in a DAG.">computeUseCount</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00455"></a>00455 <a class="code" href="klass_8cpp.html#a8bb9c404e2caf1b17f0924c7d6f484b8" title="Group together sequences of loops.">groupSeqLoops</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>);
<a name="l00456"></a>00456 }
<a name="l00457"></a>00457
<a name="l00458"></a>00458 <a class="code" href="graphSorting_8hh.html#a49959ee63ec8451f237fb51751b28136">lgraph</a> G;
<a name="l00459"></a>00459 <a class="code" href="graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024" title="Topological sort of an acyclic graph of loops.">sortGraph</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, G);
<a name="l00460"></a>00460
<a name="l00461"></a>00461 <span class="comment">// OpenMP mode : add OpenMP directives</span>
<a name="l00462"></a>00462 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>0; l--) {
<a name="l00463"></a>00463 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"// SECTION : "</span> << G.size() - l;
<a name="l00464"></a>00464 <a class="code" href="classKlass.html#ac3504be6db78c0622962c0ac1827c412" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">printLoopLevelScheduler</a>(n, G.size() - l, G[l], fout);
<a name="l00465"></a>00465 }
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <a class="code" href="classKlass.html#a74517477ad00475a6ab893e8eb154331" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">printLastLoopLevelScheduler</a>(n, G.size(), G[0], fout);
<a name="l00468"></a>00468 }
<a name="l00469"></a>00469
<a name="l00473"></a><a class="code" href="classKlass.html#a61c98e6d4a6bd576d2e0f7f496e5f327">00473</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a61c98e6d4a6bd576d2e0f7f496e5f327" title="Print the loop graph (used for internals classes).">Klass::printLoopGraphInternal</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00474"></a>00474 {
<a name="l00475"></a>00475 <a class="code" href="graphSorting_8hh.html#a49959ee63ec8451f237fb51751b28136">lgraph</a> G;
<a name="l00476"></a>00476 <a class="code" href="graphSorting_8cpp.html#a964ca1ea63e1352afbb27da72220e024" title="Topological sort of an acyclic graph of loops.">sortGraph</a>(<a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>, G);
<a name="l00477"></a>00477
<a name="l00478"></a>00478 <span class="comment">// normal mode </span>
<a name="l00479"></a>00479 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> l=G.size()-1; l>=0; l--) {
<a name="l00480"></a>00480 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a44285cbe41b6d58a00854fead2999187">gVectorSwitch</a>) { <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"// SECTION : "</span> << G.size() - l; }
<a name="l00481"></a>00481 <span class="keywordflow">for</span> (lset::const_iterator p =G[l].begin(); p!=G[l].end(); p++) {
<a name="l00482"></a>00482 (*p)->printoneln(n, fout);
<a name="l00483"></a>00483 }
<a name="l00484"></a>00484 }
<a name="l00485"></a>00485 }
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="comment">/*</span>
<a name="l00488"></a>00488 <span class="comment"> * Print the loop graph (scalar mode)</span>
<a name="l00489"></a>00489 <span class="comment"> */</span>
<a name="l00490"></a><a class="code" href="classKlass.html#aa284de20971fa023531b8b7cbf3cf101">00490</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#aa284de20971fa023531b8b7cbf3cf101">Klass::printLoopGraphScalar</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00491"></a>00491 {
<a name="l00492"></a>00492 <a class="code" href="classKlass.html#aafe78a3f8e736635eaf3947777596ac1" title="active loops currently open">fTopLoop</a>-><a class="code" href="structLoop.html#ac289865e495156b736961cea11651710" title="print the loop in scalar mode">printoneln</a>(n, fout);
<a name="l00493"></a>00493 }
<a name="l00494"></a>00494
<a name="l00498"></a><a class="code" href="klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73">00498</a> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73" title="returns true if all the loops are non recursive">nonRecursiveLevel</a>(<span class="keyword">const</span> <a class="code" href="graphSorting_8hh.html#a6d96a753c148d3f890df620d369a07b4">lset</a>& L)
<a name="l00499"></a>00499 {
<a name="l00500"></a>00500 <span class="keywordflow">for</span> (lset::const_iterator p =L.begin(); p!=L.end(); p++) {
<a name="l00501"></a>00501 <span class="keywordflow">if</span> ((*p)->fIsRecursive) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00502"></a>00502 }
<a name="l00503"></a>00503 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505
<a name="l00510"></a><a class="code" href="classKlass.html#ab8f2345eeb6f48acd72b5582f1741bdb">00510</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ab8f2345eeb6f48acd72b5582f1741bdb" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">Klass::printLoopLevelOpenMP</a>(<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> lnum, <span class="keyword">const</span> <a class="code" href="graphSorting_8hh.html#a6d96a753c148d3f890df620d369a07b4">lset</a>& L, ostream& fout)
<a name="l00511"></a>00511 {
<a name="l00512"></a>00512 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73" title="returns true if all the loops are non recursive">nonRecursiveLevel</a>(L) && L.size()==1) {
<a name="l00513"></a>00513 <span class="keywordflow">for</span> (lset::const_iterator p =L.begin(); p!=L.end(); p++) {
<a name="l00514"></a>00514 <span class="keywordflow">if</span> ((*p)->isEmpty() == <span class="keyword">false</span>) {
<a name="l00515"></a>00515 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"#pragma omp single "</span>;
<a name="l00516"></a>00516 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"{ "</span>;
<a name="l00517"></a>00517 (*p)->println(n+1, fout);
<a name="l00518"></a>00518 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00519"></a>00519 }
<a name="l00520"></a>00520 }
<a name="l00521"></a>00521
<a name="l00522"></a>00522 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() > 1) {
<a name="l00523"></a>00523 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"#pragma omp sections "</span>;
<a name="l00524"></a>00524 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"{ "</span>;
<a name="l00525"></a>00525 <span class="keywordflow">for</span> (lset::const_iterator p =L.begin(); p!=L.end(); p++) {
<a name="l00526"></a>00526 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"#pragma omp section "</span>;
<a name="l00527"></a>00527 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"{"</span>;
<a name="l00528"></a>00528 (*p)->println(n+2, fout);
<a name="l00529"></a>00529 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00532"></a>00532 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() == 1 && !(*L.begin())->isEmpty()) {
<a name="l00533"></a>00533 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"#pragma omp single "</span>;
<a name="l00534"></a>00534 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"{ "</span>;
<a name="l00535"></a>00535 <span class="keywordflow">for</span> (lset::const_iterator p =L.begin(); p!=L.end(); p++) {
<a name="l00536"></a>00536 (*p)->println(n+1, fout);
<a name="l00537"></a>00537 }
<a name="l00538"></a>00538 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541
<a name="l00546"></a><a class="code" href="classKlass.html#a74517477ad00475a6ab893e8eb154331">00546</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a74517477ad00475a6ab893e8eb154331" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">Klass::printLastLoopLevelScheduler</a>(<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> lnum, <span class="keyword">const</span> <a class="code" href="graphSorting_8hh.html#a6d96a753c148d3f890df620d369a07b4">lset</a>& L, ostream& fout)
<a name="l00547"></a>00547 {
<a name="l00548"></a>00548 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73" title="returns true if all the loops are non recursive">nonRecursiveLevel</a>(L) && L.size() == 1 && !(*L.begin())->isEmpty()) {
<a name="l00549"></a>00549
<a name="l00550"></a>00550 lset::const_iterator p =L.begin();
<a name="l00551"></a>00551 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"case "</span> << <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++ << <span class="stringliteral">": { "</span>;
<a name="l00552"></a>00552 (*p)->println(n+1, fout);
<a name="l00553"></a>00553 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"tasknum = LAST_TASK_INDEX;"</span>;
<a name="l00554"></a>00554 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l00555"></a>00555 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00556"></a>00556
<a name="l00557"></a>00557 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() > 1) {
<a name="l00558"></a>00558
<a name="l00559"></a>00559 <span class="keywordflow">for</span> (lset::const_iterator p =L.begin(); p!=L.end(); p++) {
<a name="l00560"></a>00560 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"case "</span> << <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++ << <span class="stringliteral">": { "</span>;
<a name="l00561"></a>00561 (*p)->println(n+1, fout);
<a name="l00562"></a>00562 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"fGraph.ActivateOneOutputTask(taskqueue, LAST_TASK_INDEX, tasknum);"</span>;
<a name="l00563"></a>00563 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l00564"></a>00564 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00565"></a>00565 }
<a name="l00566"></a>00566
<a name="l00567"></a>00567 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() == 1 && !(*L.begin())->isEmpty()) {
<a name="l00568"></a>00568
<a name="l00569"></a>00569 lset::const_iterator p =L.begin();
<a name="l00570"></a>00570 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"case "</span> << <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++ << <span class="stringliteral">": { "</span>;
<a name="l00571"></a>00571 (*p)->println(n+1, fout);
<a name="l00572"></a>00572 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"tasknum = LAST_TASK_INDEX;"</span>;
<a name="l00573"></a>00573 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l00574"></a>00574 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00575"></a>00575
<a name="l00576"></a>00576 }
<a name="l00577"></a>00577 }
<a name="l00578"></a>00578
<a name="l00579"></a><a class="code" href="classKlass.html#ad3ecac231a9c902b751dc3c36a7d68fa">00579</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ad3ecac231a9c902b751dc3c36a7d68fa">Klass::printOneLoopScheduler</a>(lset::const_iterator p, <span class="keywordtype">int</span> n, ostream& fout)
<a name="l00580"></a>00580 {
<a name="l00581"></a>00581 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"case "</span> << <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a>++ << <span class="stringliteral">": { "</span>;
<a name="l00582"></a>00582 (*p)->println(n+1, fout);
<a name="l00583"></a>00583
<a name="l00584"></a>00584 <span class="comment">// One output only</span>
<a name="l00585"></a>00585 <span class="keywordflow">if</span> ((*p)->fForwardLoopDependencies.size() == 1) {
<a name="l00586"></a>00586
<a name="l00587"></a>00587 lset::const_iterator p1 = (*p)->fForwardLoopDependencies.begin();
<a name="l00588"></a>00588 <span class="keywordflow">if</span> ((*p1)->fBackwardLoopDependencies.size () == 1) {
<a name="l00589"></a>00589 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"tasknum = $0;"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p1)->fIndex));
<a name="l00590"></a>00590 } <span class="keywordflow">else</span> {
<a name="l00591"></a>00591 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"fGraph.ActivateOneOutputTask(taskqueue, $0, tasknum);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p1)->fIndex));
<a name="l00592"></a>00592 }
<a name="l00593"></a>00593
<a name="l00594"></a>00594 } <span class="keywordflow">else</span> {
<a name="l00595"></a>00595
<a name="l00596"></a>00596 <a class="code" href="structLoop.html">Loop</a>* keep = NULL;
<a name="l00597"></a>00597 <span class="comment">// Find one output with no backward dependencies</span>
<a name="l00598"></a>00598 <span class="keywordflow">for</span> (lset::const_iterator p1 = (*p)->fForwardLoopDependencies.begin(); p1!=(*p)->fForwardLoopDependencies.end(); p1++) {
<a name="l00599"></a>00599 <span class="keywordflow">if</span> ((*p1)->fBackwardLoopDependencies.size () == 1) {
<a name="l00600"></a>00600 keep = *p1;
<a name="l00601"></a>00601 <span class="keywordflow">break</span>;
<a name="l00602"></a>00602 }
<a name="l00603"></a>00603 }
<a name="l00604"></a>00604
<a name="l00605"></a>00605 <span class="keywordflow">if</span> (keep == NULL) {
<a name="l00606"></a>00606 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"tasknum = WORK_STEALING_INDEX;"</span>;
<a name="l00607"></a>00607 }
<a name="l00608"></a>00608
<a name="l00609"></a>00609 <span class="keywordflow">for</span> (lset::const_iterator p1 = (*p)->fForwardLoopDependencies.begin(); p1!=(*p)->fForwardLoopDependencies.end(); p1++) {
<a name="l00610"></a>00610 <span class="keywordflow">if</span> ((*p1)->fBackwardLoopDependencies.size () == 1) { <span class="comment">// Task is the only input</span>
<a name="l00611"></a>00611 <span class="keywordflow">if</span> (*p1 != keep) {
<a name="l00612"></a>00612 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"taskqueue.PushHead($0);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p1)->fIndex));
<a name="l00613"></a>00613 }
<a name="l00614"></a>00614 } <span class="keywordflow">else</span> {
<a name="l00615"></a>00615 <span class="keywordflow">if</span> (keep == NULL) {
<a name="l00616"></a>00616 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"fGraph.ActivateOutputTask(taskqueue, $0, tasknum);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p1)->fIndex));
<a name="l00617"></a>00617 } <span class="keywordflow">else</span> {
<a name="l00618"></a>00618 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"fGraph.ActivateOutputTask(taskqueue, $0);"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>((*p1)->fIndex));
<a name="l00619"></a>00619 }
<a name="l00620"></a>00620 }
<a name="l00621"></a>00621 }
<a name="l00622"></a>00622
<a name="l00623"></a>00623 <span class="keywordflow">if</span> (keep != NULL) {
<a name="l00624"></a>00624 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"tasknum = $0;"</span>, <a class="code" href="Text_8cpp.html#a16bacb907294be37af81cdf9aff4449a">T</a>(keep-><a class="code" href="structLoop.html#a96a59acb30654a19fd06bc4e1967e169" title="used during scheduler mode code generation">fIndex</a>)); <span class="comment">// Last one</span>
<a name="l00625"></a>00625 } <span class="keywordflow">else</span> {
<a name="l00626"></a>00626 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"fGraph.GetReadyTask(taskqueue, tasknum);"</span>; <span class="comment">// Last one</span>
<a name="l00627"></a>00627 }
<a name="l00628"></a>00628 }
<a name="l00629"></a>00629
<a name="l00630"></a>00630 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l00631"></a>00631 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l00632"></a>00632 }
<a name="l00633"></a>00633
<a name="l00639"></a><a class="code" href="classKlass.html#ac3504be6db78c0622962c0ac1827c412">00639</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ac3504be6db78c0622962c0ac1827c412" title="Print the &#39;level&#39; of the loop graph as a set of parallel loops.">Klass::printLoopLevelScheduler</a>(<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> lnum, <span class="keyword">const</span> <a class="code" href="graphSorting_8hh.html#a6d96a753c148d3f890df620d369a07b4">lset</a>& L, ostream& fout)
<a name="l00640"></a>00640 {
<a name="l00641"></a>00641 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a35ee3fbf2966df0dcc60bde5e8febf73" title="returns true if all the loops are non recursive">nonRecursiveLevel</a>(L) && L.size() == 1 && !(*L.begin())->isEmpty()) {
<a name="l00642"></a>00642 <a class="code" href="classKlass.html#ad3ecac231a9c902b751dc3c36a7d68fa">printOneLoopScheduler</a>(L.begin(), n, fout);
<a name="l00643"></a>00643 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() > 1) {
<a name="l00644"></a>00644 <span class="keywordflow">for</span> (lset::const_iterator p = L.begin(); p != L.end(); p++) {
<a name="l00645"></a>00645 <a class="code" href="classKlass.html#ad3ecac231a9c902b751dc3c36a7d68fa">printOneLoopScheduler</a>(p, n, fout);
<a name="l00646"></a>00646 }
<a name="l00647"></a>00647 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (L.size() == 1 && !(*L.begin())->isEmpty()) {
<a name="l00648"></a>00648 <a class="code" href="classKlass.html#ad3ecac231a9c902b751dc3c36a7d68fa">printOneLoopScheduler</a>(L.begin(), n, fout);
<a name="l00649"></a>00649 }
<a name="l00650"></a>00650 }
<a name="l00651"></a>00651
<a name="l00655"></a><a class="code" href="classKlass.html#a73bd9f5dc4fdcb63901d5188d696b58f">00655</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a73bd9f5dc4fdcb63901d5188d696b58f" title="Print a full C++ class corresponding to a Faust dsp.">Klass::println</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00656"></a>00656 {
<a name="l00657"></a>00657 list<Klass* >::iterator k;
<a name="l00658"></a>00658
<a name="l00659"></a>00659 <span class="keywordflow">if</span> (<a class="code" href="compile__scal_8cpp.html#aed8da6f8f23ca426bf3ea6564e0bd6f2">gSchedulerSwitch</a>) {
<a name="l00660"></a>00660 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"class "</span> << <a class="code" href="classKlass.html#a5d3dbc87a72db9611660839ee2cd78ae">fKlassName</a> << <span class="stringliteral">" : public "</span> << <a class="code" href="classKlass.html#a819772abca88a6b823eb2769230d5faf">fSuperKlassName</a> << <span class="stringliteral">", public Runnable {"</span>;
<a name="l00661"></a>00661 } <span class="keywordflow">else</span> {
<a name="l00662"></a>00662 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"class "</span> << <a class="code" href="classKlass.html#a5d3dbc87a72db9611660839ee2cd78ae">fKlassName</a> << <span class="stringliteral">" : public "</span> << <a class="code" href="classKlass.html#a819772abca88a6b823eb2769230d5faf">fSuperKlassName</a> << <span class="stringliteral">"{"</span>;
<a name="l00663"></a>00663 }
<a name="l00664"></a>00664
<a name="l00665"></a>00665 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a1ba979dbee201fae63feca5bafc8f394">gUIMacroSwitch</a>) {
<a name="l00666"></a>00666 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" public:"</span>;
<a name="l00667"></a>00667 } <span class="keywordflow">else</span> {
<a name="l00668"></a>00668 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" private:"</span>;
<a name="l00669"></a>00669 }
<a name="l00670"></a>00670
<a name="l00671"></a>00671 <span class="keywordflow">for</span> (k = <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.begin(); k != <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.end(); k++) (*k)->println(n+1, fout);
<a name="l00672"></a>00672
<a name="l00673"></a>00673 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+1, <a class="code" href="classKlass.html#a62442766ac35c578320eb37f18b60f90">fDeclCode</a>, fout);
<a name="l00674"></a>00674
<a name="l00675"></a>00675 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" public:"</span>;
<a name="l00676"></a>00676
<a name="l00677"></a>00677 <a class="code" href="classKlass.html#a4dfd4a8dadd3f996d0f3ca61257bc287" title="Print metadata declaration.">printMetadata</a>(n+1, <a class="code" href="doc_8cpp.html#aaf647729deae314d35817ccb36f088e4">gMetaDataSet</a>, fout);
<a name="l00678"></a>00678 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"virtual int getNumInputs() \t{ "</span>
<a name="l00679"></a>00679 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#adcb336021e5c4fab2b3832f3210cbcb9">fNumInputs</a>
<a name="l00680"></a>00680 << <span class="stringliteral">"; }"</span>;
<a name="l00681"></a>00681 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"virtual int getNumOutputs() \t{ "</span>
<a name="l00682"></a>00682 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#a193a3c36f9fd250f42d032d79667f765">fNumOutputs</a>
<a name="l00683"></a>00683 << <span class="stringliteral">"; }"</span>;
<a name="l00684"></a>00684
<a name="l00685"></a>00685 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"static void classInit(int samplingFreq) {"</span>;
<a name="l00686"></a>00686 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a24bfa21235dfb2275c5d29ac8bf59a98" title="static init code for class constant tables">fStaticInitCode</a>, fout);
<a name="l00687"></a>00687 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00688"></a>00688
<a name="l00689"></a>00689 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"virtual void instanceInit(int samplingFreq) {"</span>;
<a name="l00690"></a>00690 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"fSamplingFreq = samplingFreq;"</span>;
<a name="l00691"></a>00691 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#acabf319356fb4736e30f2d087ffe7703">fInitCode</a>, fout);
<a name="l00692"></a>00692 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00693"></a>00693
<a name="l00694"></a>00694 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"virtual void init(int samplingFreq) {"</span>;
<a name="l00695"></a>00695 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"classInit(samplingFreq);"</span>;
<a name="l00696"></a>00696 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"instanceInit(samplingFreq);"</span>;
<a name="l00697"></a>00697 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00698"></a>00698
<a name="l00699"></a>00699
<a name="l00700"></a>00700 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"virtual void buildUserInterface(UI* interface) {"</span>;
<a name="l00701"></a>00701 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a4588d841c76ef6ae2ae9e5417d4f320b">fUICode</a>, fout);
<a name="l00702"></a>00702 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00703"></a>00703
<a name="l00704"></a>00704 <a class="code" href="classKlass.html#a453949bd7cbd8ee398a24f9050645ce2" title="Print Compute() method according to the various switch.">printComputeMethod</a>(n, fout);
<a name="l00705"></a>00705
<a name="l00706"></a>00706 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"};\n"</span> << endl;
<a name="l00707"></a>00707
<a name="l00708"></a>00708 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n, <a class="code" href="classKlass.html#a686c62778f128e8f90817a386989760d" title="static fields after class">fStaticFields</a>, fout);
<a name="l00709"></a>00709
<a name="l00710"></a>00710 <span class="comment">// generate user interface macros if needed</span>
<a name="l00711"></a>00711 <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a1ba979dbee201fae63feca5bafc8f394">gUIMacroSwitch</a>) {
<a name="l00712"></a>00712 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"#ifdef FAUST_UIMACROS"</span>;
<a name="l00713"></a>00713 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"#define FAUST_INPUTS "</span> << fNumInputs;
<a name="l00714"></a>00714 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"#define FAUST_OUTPUTS "</span> << fNumOutputs;
<a name="l00715"></a>00715 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"#define FAUST_ACTIVES "</span> << <a class="code" href="classKlass.html#a583202de4a72164f1bb7e7eab2bd6733" title="number of active controls in the UI (sliders, buttons, etc.)">fNumActives</a>;
<a name="l00716"></a>00716 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"#define FAUST_PASSIVES "</span> << <a class="code" href="classKlass.html#ae4f28c765f6e19bfd1c964968eb15c4c" title="number of passive widgets in the UI (bargraphs, etc.)">fNumPassives</a>;
<a name="l00717"></a>00717 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+1, <a class="code" href="classKlass.html#a1eb185974d752f37012cd6e10cc5c9b5">fUIMacro</a>, fout);
<a name="l00718"></a>00718 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n, fout); fout << <span class="stringliteral">"#endif"</span>;
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720
<a name="l00721"></a>00721 fout << endl;
<a name="l00722"></a>00722 }
<a name="l00723"></a>00723
<a name="l00727"></a><a class="code" href="classKlass.html#a453949bd7cbd8ee398a24f9050645ce2">00727</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a453949bd7cbd8ee398a24f9050645ce2" title="Print Compute() method according to the various switch.">Klass::printComputeMethod</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00728"></a>00728 {
<a name="l00729"></a>00729 <span class="keywordflow">if</span> (<a class="code" href="compile__scal_8cpp.html#aed8da6f8f23ca426bf3ea6564e0bd6f2">gSchedulerSwitch</a>) {
<a name="l00730"></a>00730 <a class="code" href="classKlass.html#a5c44700860a1e631bf9aeb4d9c049223">printComputeMethodScheduler</a> (n, fout);
<a name="l00731"></a>00731 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a11096523c7bafc4f81b51a38c19e03e8">gOpenMPSwitch</a>) {
<a name="l00732"></a>00732 <a class="code" href="classKlass.html#a7d08d04c06d88f540ce42161ef5975aa">printComputeMethodOpenMP</a> (n, fout);
<a name="l00733"></a>00733 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="klass_8cpp.html#a44285cbe41b6d58a00854fead2999187">gVectorSwitch</a>) {
<a name="l00734"></a>00734 <span class="keywordflow">switch</span> (<a class="code" href="klass_8cpp.html#afc8541b52b32a942648daf968114789c">gVectorLoopVariant</a>) {
<a name="l00735"></a>00735 <span class="keywordflow">case</span> 0 : <a class="code" href="classKlass.html#ab935688ddf80170279ed7306d273a145" title="Uses loops of constant gVecSize boundary in order to provide the C compiler with...">printComputeMethodVectorFaster</a>(n, fout); <span class="keywordflow">break</span>;
<a name="l00736"></a>00736 <span class="keywordflow">case</span> 1 : <a class="code" href="classKlass.html#ad6af80a1ccb58d0d8bb7d60d2ab98a32" title="Simple loop layout, generally less efficient than printComputeMethodVectorFaster...">printComputeMethodVectorSimple</a>(n, fout); <span class="keywordflow">break</span>;
<a name="l00737"></a>00737 <span class="keywordflow">default</span> : cerr << <span class="stringliteral">"unknown loop variant "</span> << <a class="code" href="klass_8cpp.html#afc8541b52b32a942648daf968114789c">gVectorLoopVariant</a> << endl; exit(1);
<a name="l00738"></a>00738 }
<a name="l00739"></a>00739 } <span class="keywordflow">else</span> {
<a name="l00740"></a>00740 <a class="code" href="classKlass.html#a1fc4162f1554e8eed9cefb33d7e914ad">printComputeMethodScalar</a>(n, fout);
<a name="l00741"></a>00741 }
<a name="l00742"></a>00742 }
<a name="l00743"></a>00743
<a name="l00744"></a><a class="code" href="classKlass.html#a1fc4162f1554e8eed9cefb33d7e914ad">00744</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a1fc4162f1554e8eed9cefb33d7e914ad">Klass::printComputeMethodScalar</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00745"></a>00745 {
<a name="l00746"></a>00746 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"virtual void compute (int count, $0** input, $0** output) {"</span>, <a class="code" href="floats_8cpp.html#a2da2ae6649f9479320f115342675b275">xfloat</a>());
<a name="l00747"></a>00747 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l00748"></a>00748 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l00749"></a>00749 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l00750"></a>00750 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l00751"></a>00751 <a class="code" href="classKlass.html#aa284de20971fa023531b8b7cbf3cf101">printLoopGraphScalar</a> (n+2,fout);
<a name="l00752"></a>00752 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00753"></a>00753 }
<a name="l00754"></a>00754
<a name="l00760"></a><a class="code" href="classKlass.html#ab935688ddf80170279ed7306d273a145">00760</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ab935688ddf80170279ed7306d273a145" title="Uses loops of constant gVecSize boundary in order to provide the C compiler with...">Klass::printComputeMethodVectorFaster</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00761"></a>00761 {
<a name="l00762"></a>00762 <span class="comment">// in vector mode we need to split loops in smaller pieces not larger</span>
<a name="l00763"></a>00763 <span class="comment">// than gVecSize</span>
<a name="l00764"></a>00764 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"virtual void compute (int fullcount, $0** input, $0** output) {"</span>, <a class="code" href="floats_8cpp.html#a2da2ae6649f9479320f115342675b275">xfloat</a>());
<a name="l00765"></a>00765 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l00766"></a>00766 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l00767"></a>00767 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l00768"></a>00768
<a name="l00769"></a>00769 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"int index;"</span>;
<a name="l00770"></a>00770 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"for (index = 0; index <= fullcount - "</span> << <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a> << <span class="stringliteral">"; index += "</span> << <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a> << <span class="stringliteral">") {"</span>;
<a name="l00771"></a>00771 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"// compute by blocks of "</span> << gVecSize << <span class="stringliteral">" samples"</span>;
<a name="l00772"></a>00772 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"const int count = "</span> << gVecSize << <span class="stringliteral">";"</span>;
<a name="l00773"></a>00773 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+3, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l00774"></a>00774 <a class="code" href="classKlass.html#a196229464faeda2537eedd5210ad58af" title="Print the loop graph (used for vector code).">printLoopGraphVector</a>(n+3,fout);
<a name="l00775"></a>00775 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00776"></a>00776
<a name="l00777"></a>00777 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"if (index < fullcount) {"</span>;
<a name="l00778"></a>00778 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"// compute the remaining samples if any"</span>;
<a name="l00779"></a>00779 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"int count = fullcount-index;"</span>;
<a name="l00780"></a>00780 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+3, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l00781"></a>00781 <a class="code" href="classKlass.html#a196229464faeda2537eedd5210ad58af" title="Print the loop graph (used for vector code).">printLoopGraphVector</a>(n+3,fout);
<a name="l00782"></a>00782 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00783"></a>00783 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00784"></a>00784 }
<a name="l00785"></a>00785
<a name="l00789"></a><a class="code" href="classKlass.html#ad6af80a1ccb58d0d8bb7d60d2ab98a32">00789</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ad6af80a1ccb58d0d8bb7d60d2ab98a32" title="Simple loop layout, generally less efficient than printComputeMethodVectorFaster...">Klass::printComputeMethodVectorSimple</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00790"></a>00790 {
<a name="l00791"></a>00791 <span class="comment">// in vector mode we need to split loops in smaller pieces not larger</span>
<a name="l00792"></a>00792 <span class="comment">// than gVecSize</span>
<a name="l00793"></a>00793 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"virtual void compute (int fullcount, $0** input, $0** output) {"</span>, <a class="code" href="floats_8cpp.html#a2da2ae6649f9479320f115342675b275">xfloat</a>());
<a name="l00794"></a>00794 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l00795"></a>00795 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l00796"></a>00796 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l00797"></a>00797 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"for (int index = 0; index < fullcount; index += "</span> << <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a> << <span class="stringliteral">") {"</span>;
<a name="l00798"></a>00798 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"int count = min("</span><< gVecSize << <span class="stringliteral">", fullcount-index);"</span>;
<a name="l00799"></a>00799 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+3, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l00800"></a>00800 <a class="code" href="classKlass.html#a196229464faeda2537eedd5210ad58af" title="Print the loop graph (used for vector code).">printLoopGraphVector</a>(n+3,fout);
<a name="l00801"></a>00801 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00802"></a>00802 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00803"></a>00803 }
<a name="l00804"></a>00804
<a name="l00805"></a>00805 <span class="comment">/*</span>
<a name="l00806"></a>00806 <span class="comment">void Klass::printComputeMethodVectorFix0 (int n, ostream& fout)</span>
<a name="l00807"></a>00807 <span class="comment">{</span>
<a name="l00808"></a>00808 <span class="comment"> // in vector mode we need to split loops in smaller pieces not larger</span>
<a name="l00809"></a>00809 <span class="comment"> // than gVecSize</span>
<a name="l00810"></a>00810 <span class="comment"> tab(n+1,fout); fout << "virtual void compute (int fullcount, float** input, float** output) {";</span>
<a name="l00811"></a>00811 <span class="comment"> printlines(n+2, fZone1Code, fout);</span>
<a name="l00812"></a>00812 <span class="comment"> printlines(n+2, fZone2Code, fout);</span>
<a name="l00813"></a>00813 <span class="comment"> printlines(n+2, fZone2bCode, fout);</span>
<a name="l00814"></a>00814 <span class="comment"> tab(n+2,fout); fout << "for (int index = 0; index < fullcount; index += " << gVecSize << ") {";</span>
<a name="l00815"></a>00815 <span class="comment"> tab(n+3,fout); fout << "if (fullcount >= index + " << gVecSize << ") {";</span>
<a name="l00816"></a>00816 <span class="comment"> tab(n+4,fout); fout << "// compute by blocks of " << gVecSize << " samples";</span>
<a name="l00817"></a>00817 <span class="comment"> tab(n+4,fout); fout << "const int count = " << gVecSize << ";"; // temporaire</span>
<a name="l00818"></a>00818 <span class="comment"> printlines(n+4, fZone3Code, fout);</span>
<a name="l00819"></a>00819 <span class="comment"> printLoopGraph (n+4,fout);</span>
<a name="l00820"></a>00820 <span class="comment"> tab(n+3,fout); fout << "} else if (fullcount > index) {";</span>
<a name="l00821"></a>00821 <span class="comment"> //tab(n+3,fout); fout << "int count = min ("<< gVecSize << ", fullcount-index);";</span>
<a name="l00822"></a>00822 <span class="comment"> tab(n+4,fout); fout << "// compute the remaining samples";</span>
<a name="l00823"></a>00823 <span class="comment"> tab(n+4,fout); fout << "int count = fullcount-index;" ;</span>
<a name="l00824"></a>00824 <span class="comment"> printlines(n+4, fZone3Code, fout);</span>
<a name="l00825"></a>00825 <span class="comment"> printLoopGraph (n+4,fout);</span>
<a name="l00826"></a>00826 <span class="comment"> tab(n+3,fout); fout << "}";</span>
<a name="l00827"></a>00827 <span class="comment"> tab(n+2,fout); fout << "}";</span>
<a name="l00828"></a>00828 <span class="comment"> tab(n+1,fout); fout << "}";</span>
<a name="l00829"></a>00829 <span class="comment">}</span>
<a name="l00830"></a>00830 <span class="comment"></span>
<a name="l00831"></a>00831 <span class="comment">void Klass::printComputeMethodVectorFix1 (int n, ostream& fout)</span>
<a name="l00832"></a>00832 <span class="comment">{</span>
<a name="l00833"></a>00833 <span class="comment"> // in vector mode we need to split loops in smaller pieces not larger</span>
<a name="l00834"></a>00834 <span class="comment"> // than gVecSize</span>
<a name="l00835"></a>00835 <span class="comment"> tab(n+1,fout); fout << "virtual void compute (int fullcount, float** input, float** output) {";</span>
<a name="l00836"></a>00836 <span class="comment"> printlines(n+2, fZone1Code, fout);</span>
<a name="l00837"></a>00837 <span class="comment"> printlines(n+2, fZone2Code, fout);</span>
<a name="l00838"></a>00838 <span class="comment"> printlines(n+2, fZone2bCode, fout);</span>
<a name="l00839"></a>00839 <span class="comment"></span>
<a name="l00840"></a>00840 <span class="comment"> tab(n+2,fout); fout << "int \tblock;";</span>
<a name="l00841"></a>00841 <span class="comment"> tab(n+2,fout); fout << "for (block = 0; block < fullcount/" << gVecSize << "; block++) {";</span>
<a name="l00842"></a>00842 <span class="comment"> tab(n+3,fout); fout << "// compute by blocks of " << gVecSize << " samples";</span>
<a name="l00843"></a>00843 <span class="comment"> tab(n+3,fout); fout << "const int index = block*" << gVecSize << ";";</span>
<a name="l00844"></a>00844 <span class="comment"> tab(n+3,fout); fout << "const int count = " << gVecSize << ";"; // temporaire</span>
<a name="l00845"></a>00845 <span class="comment"> printlines(n+3, fZone3Code, fout);</span>
<a name="l00846"></a>00846 <span class="comment"> printLoopGraph (n+3,fout);</span>
<a name="l00847"></a>00847 <span class="comment"> tab(n+2,fout); fout << "}";</span>
<a name="l00848"></a>00848 <span class="comment"></span>
<a name="l00849"></a>00849 <span class="comment"> tab(n+2,fout); fout << "if (fullcount%" << gVecSize << " != 0) {";</span>
<a name="l00850"></a>00850 <span class="comment"> //tab(n+3,fout); fout << "int count = min ("<< gVecSize << ", fullcount-index);";</span>
<a name="l00851"></a>00851 <span class="comment"> tab(n+3,fout); fout << "// compute the remaining samples";</span>
<a name="l00852"></a>00852 <span class="comment"> tab(n+3,fout); fout << "const int index = block*" << gVecSize << ";";</span>
<a name="l00853"></a>00853 <span class="comment"> tab(n+3,fout); fout << "int count = fullcount%" << gVecSize << ";" ;</span>
<a name="l00854"></a>00854 <span class="comment"> printlines(n+3, fZone3Code, fout);</span>
<a name="l00855"></a>00855 <span class="comment"> printLoopGraph (n+3,fout);</span>
<a name="l00856"></a>00856 <span class="comment"> tab(n+2,fout); fout << "}";</span>
<a name="l00857"></a>00857 <span class="comment"> tab(n+1,fout); fout << "}";</span>
<a name="l00858"></a>00858 <span class="comment">}*/</span>
<a name="l00859"></a>00859
<a name="l00860"></a><a class="code" href="classKlass.html#a7d08d04c06d88f540ce42161ef5975aa">00860</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a7d08d04c06d88f540ce42161ef5975aa">Klass::printComputeMethodOpenMP</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00861"></a>00861 {
<a name="l00862"></a>00862 <span class="comment">// in openMP mode we need to split loops in smaller pieces not larger</span>
<a name="l00863"></a>00863 <span class="comment">// than gVecSize and add OpenMP pragmas</span>
<a name="l00864"></a>00864 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"virtual void compute (int fullcount, $0** input, $0** output) {"</span>, <a class="code" href="floats_8cpp.html#a2da2ae6649f9479320f115342675b275">xfloat</a>());
<a name="l00865"></a>00865 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l00866"></a>00866 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l00867"></a>00867 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"#pragma omp parallel"</span>;
<a name="l00868"></a>00868 <a class="code" href="klass_8cpp.html#af2c9d4adde58ed5726c5136d74423e7d" title="Print a list of elements (e1, e2,.">printdecllist</a>(n+3, <span class="stringliteral">"firstprivate"</span>, <a class="code" href="classKlass.html#af960ed926d74274ca2ce1dd6ace35622" title="first private declarations">fFirstPrivateDecl</a>, fout);
<a name="l00869"></a>00869
<a name="l00870"></a>00870 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"{"</span>;
<a name="l00871"></a>00871 <span class="keywordflow">if</span> (!<a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>.empty()) {
<a name="l00872"></a>00872 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"#pragma omp single"</span>;
<a name="l00873"></a>00873 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"{"</span>;
<a name="l00874"></a>00874 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+4, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l00875"></a>00875 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00876"></a>00876 }
<a name="l00877"></a>00877
<a name="l00878"></a>00878 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"for (int index = 0; index < fullcount; index += "</span> << <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a> << <span class="stringliteral">") {"</span>;
<a name="l00879"></a>00879 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+4,fout); fout << <span class="stringliteral">"int count = min ("</span><< gVecSize << <span class="stringliteral">", fullcount-index);"</span>;
<a name="l00880"></a>00880
<a name="l00881"></a>00881 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+4, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l00882"></a>00882 <a class="code" href="classKlass.html#a544aea5095a28fe873357d352ef36f72" title="Print the loop graph as a serie of parallel loops.">printLoopGraphOpenMP</a> (n+4,fout);
<a name="l00883"></a>00883
<a name="l00884"></a>00884 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00885"></a>00885
<a name="l00886"></a>00886 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00887"></a>00887 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00888"></a>00888 }
<a name="l00889"></a>00889
<a name="l00890"></a>00890 <span class="comment">/*</span>
<a name="l00891"></a>00891 <span class="comment">void Klass::printComputeMethodScheduler (int n, ostream& fout)</span>
<a name="l00892"></a>00892 <span class="comment">{</span>
<a name="l00893"></a>00893 <span class="comment"> tab(n+1,fout); fout << subst("virtual void compute (int fullcount, $0** input, $0** output) {", xfloat());</span>
<a name="l00894"></a>00894 <span class="comment"> printlines (n+2, fZone1Code, fout);</span>
<a name="l00895"></a>00895 <span class="comment"> printlines (n+2, fZone2Code, fout);</span>
<a name="l00896"></a>00896 <span class="comment"> </span>
<a name="l00897"></a>00897 <span class="comment"> // Init input and output</span>
<a name="l00898"></a>00898 <span class="comment"> tab(n+2,fout); fout << "// Init input and output";</span>
<a name="l00899"></a>00899 <span class="comment"> printlines (n+2, fZone3aCode, fout);</span>
<a name="l00900"></a>00900 <span class="comment"> printlines (n+2, fZone3bCode, fout);</span>
<a name="l00901"></a>00901 <span class="comment"> </span>
<a name="l00902"></a>00902 <span class="comment"> tab(n+2,fout); fout << "// Init graph state";</span>
<a name="l00903"></a>00903 <span class="comment"> tab(n+2,fout); fout << "initState(fTasksList);"; </span>
<a name="l00904"></a>00904 <span class="comment"> tab(n+2,fout); fout << "bool is_finished = false;"; </span>
<a name="l00905"></a>00905 <span class="comment"> tab(n+2,fout); fout << "unsigned int index_in = 0;"; </span>
<a name="l00906"></a>00906 <span class="comment"> tab(n+2,fout); fout << "unsigned int index_out = 0;"; </span>
<a name="l00907"></a>00907 <span class="comment"> tab(n+2,fout); fout << "int count = min ("<< gVecSize << ", fullcount);";</span>
<a name="l00908"></a>00908 <span class="comment"> </span>
<a name="l00909"></a>00909 <span class="comment"> tab(n+2,fout); fout << "InitSchedulingMap();";</span>
<a name="l00910"></a>00910 <span class="comment"> tab(n+2,fout); fout << "#pragma omp parallel";</span>
<a name="l00911"></a>00911 <span class="comment"> printdecllist(n+3, "firstprivate", fFirstPrivateDecl, fout);</span>
<a name="l00912"></a>00912 <span class="comment"> </span>
<a name="l00913"></a>00913 <span class="comment"> tab(n+2,fout); fout << "{";</span>
<a name="l00914"></a>00914 <span class="comment"> tab(n+3,fout); fout << "while (!is_finished) {";</span>
<a name="l00915"></a>00915 <span class="comment"> tab(n+4,fout); fout << "Task* task = searchTaskToAcquire(fTasksList);";</span>
<a name="l00916"></a>00916 <span class="comment"> tab(n+4,fout); fout << "if (task != NULL) {";</span>
<a name="l00917"></a>00917 <span class="comment"> tab(n+5,fout); fout << "bool last_cycle_for_thread = false;";</span>
<a name="l00918"></a>00918 <span class="comment"> tab(n+5,fout); fout << "do {";</span>
<a name="l00919"></a>00919 <span class="comment"> tab(n+6,fout); fout << "AddTaskToScheduling(task);";</span>
<a name="l00920"></a>00920 <span class="comment"> tab(n+6,fout); fout << "switch (task->fNum) {";</span>
<a name="l00921"></a>00921 <span class="comment"> </span>
<a name="l00922"></a>00922 <span class="comment"> // DSP tasks</span>
<a name="l00923"></a>00923 <span class="comment"> printLoopGraph (n+7,fout);</span>
<a name="l00924"></a>00924 <span class="comment"> </span>
<a name="l00925"></a>00925 <span class="comment"> // Input task</span>
<a name="l00926"></a>00926 <span class="comment"> tab(n+7, fout); fout << "case " << gTaskCount++ << ": { ";</span>
<a name="l00927"></a>00927 <span class="comment"> printlines (n+8, fZone6Code, fout);</span>
<a name="l00928"></a>00928 <span class="comment"> tab(n+8, fout); fout << "index_in += count;";</span>
<a name="l00929"></a>00929 <span class="comment"> tab(n+8, fout); fout << "last_cycle_for_thread = (index_in > fullcount);";</span>
<a name="l00930"></a>00930 <span class="comment"> tab(n+8, fout); fout << "break;";</span>
<a name="l00931"></a>00931 <span class="comment"> tab(n+7, fout); fout << "} ";</span>
<a name="l00932"></a>00932 <span class="comment"> </span>
<a name="l00933"></a>00933 <span class="comment"> // Output task</span>
<a name="l00934"></a>00934 <span class="comment"> tab(n+7, fout); fout << "case " << gTaskCount++ << ": { ";</span>
<a name="l00935"></a>00935 <span class="comment"> printlines (n+8, fZone7Code, fout);</span>
<a name="l00936"></a>00936 <span class="comment"> tab(n+8, fout); fout << "index_out += count;";</span>
<a name="l00937"></a>00937 <span class="comment"> tab(n+8, fout); fout << "last_cycle_for_thread = (index_out > fullcount);";</span>
<a name="l00938"></a>00938 <span class="comment"> tab(n+8, fout); fout << "break;";</span>
<a name="l00939"></a>00939 <span class="comment"> tab(n+7, fout); fout << "} "; </span>
<a name="l00940"></a>00940 <span class="comment"> </span>
<a name="l00941"></a>00941 <span class="comment"> // End task </span>
<a name="l00942"></a>00942 <span class="comment"> tab(n+7, fout); fout << "case " << gTaskCount++ << ": { "; </span>
<a name="l00943"></a>00943 <span class="comment"> tab(n+8, fout); fout << "is_finished = ((index_in >= fullcount) && (index_out >= fullcount));";</span>
<a name="l00944"></a>00944 <span class="comment"> tab(n+8, fout); fout << "break;";</span>
<a name="l00945"></a>00945 <span class="comment"> tab(n+7, fout); fout << "} "; </span>
<a name="l00946"></a>00946 <span class="comment"> </span>
<a name="l00947"></a>00947 <span class="comment"> tab(n+6,fout); fout << "}";</span>
<a name="l00948"></a>00948 <span class="comment"> tab(n+6,fout); fout << "if (last_cycle_for_thread) break;";</span>
<a name="l00949"></a>00949 <span class="comment"> </span>
<a name="l00950"></a>00950 <span class="comment"> tab(n+5,fout); fout << "} while ((task = task->concludeAndTryToAcquireNext()) != NULL);";</span>
<a name="l00951"></a>00951 <span class="comment"> tab(n+4,fout); fout << "}";</span>
<a name="l00952"></a>00952 <span class="comment"> tab(n+3,fout); fout << "}"; </span>
<a name="l00953"></a>00953 <span class="comment"> tab(n+2,fout); fout << "}";</span>
<a name="l00954"></a>00954 <span class="comment"> tab(n+2,fout); fout << "PrintSchedulingMap();";</span>
<a name="l00955"></a>00955 <span class="comment"> tab(n+1,fout); fout << "}";</span>
<a name="l00956"></a>00956 <span class="comment">}</span>
<a name="l00957"></a>00957 <span class="comment">*/</span>
<a name="l00958"></a>00958
<a name="l00959"></a><a class="code" href="classKlass.html#a5c44700860a1e631bf9aeb4d9c049223">00959</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a5c44700860a1e631bf9aeb4d9c049223">Klass::printComputeMethodScheduler</a> (<span class="keywordtype">int</span> n, ostream& fout)
<a name="l00960"></a>00960 {
<a name="l00961"></a>00961 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"virtual void compute (int fullcount, $0** input, $0** output) {"</span>, <a class="code" href="floats_8cpp.html#a2da2ae6649f9479320f115342675b275">xfloat</a>());
<a name="l00962"></a>00962
<a name="l00963"></a>00963 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"GetRealTime();"</span>;
<a name="l00964"></a>00964
<a name="l00965"></a>00965 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"this->input = input;"</span>;
<a name="l00966"></a>00966 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"this->output = output;"</span>;
<a name="l00967"></a>00967
<a name="l00968"></a>00968 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"StartMeasure();"</span>;
<a name="l00969"></a>00969
<a name="l00970"></a>00970 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"for (fIndex = 0; fIndex < fullcount; fIndex += "</span> << <a class="code" href="compile__vect_8cpp.html#a6913f43c820ecbf6076c31d40598b7ee">gVecSize</a> << <span class="stringliteral">") {"</span>;
<a name="l00971"></a>00971
<a name="l00972"></a>00972 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"fFullCount = min ("</span><< gVecSize << <span class="stringliteral">", fullcount-fIndex);"</span>;
<a name="l00973"></a>00973 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"TaskQueue::Init();"</span>;
<a name="l00974"></a>00974 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+3, <a class="code" href="classKlass.html#a059ba07ebf9fdc60bf1c1853c8a106ea" title="single once per block">fZone2cCode</a>, fout);
<a name="l00975"></a>00975
<a name="l00976"></a>00976 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"fIsFinished = false;"</span>;
<a name="l00977"></a>00977 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"fThreadPool.SignalAll(fDynamicNumThreads - 1);"</span>;
<a name="l00978"></a>00978 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"computeThread(0);"</span>;
<a name="l00979"></a>00979 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"while (!fThreadPool.IsFinished()) {}"</span>;
<a name="l00980"></a>00980
<a name="l00981"></a>00981 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00982"></a>00982
<a name="l00983"></a>00983 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"StopMeasure(fStaticNumThreads, fDynamicNumThreads);"</span>;
<a name="l00984"></a>00984
<a name="l00985"></a>00985 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l00986"></a>00986
<a name="l00987"></a>00987 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"void computeThread(int cur_thread) {"</span>;
<a name="l00988"></a>00988 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l00989"></a>00989 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l00990"></a>00990
<a name="l00991"></a>00991 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"// Init graph state"</span>;
<a name="l00992"></a>00992
<a name="l00993"></a>00993 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"{"</span>;
<a name="l00994"></a>00994 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"TaskQueue taskqueue;"</span>;
<a name="l00995"></a>00995 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"int tasknum = -1;"</span>;
<a name="l00996"></a>00996 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"int count = fFullCount;"</span>;
<a name="l00997"></a>00997
<a name="l00998"></a>00998 <span class="comment">// Init input and output</span>
<a name="l00999"></a>00999 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"// Init input and output"</span>;
<a name="l01000"></a>01000 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+3, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l01001"></a>01001
<a name="l01002"></a>01002 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"while (!fIsFinished) {"</span>;
<a name="l01003"></a>01003 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+4,fout); fout << <span class="stringliteral">"switch (tasknum) {"</span>;
<a name="l01004"></a>01004
<a name="l01005"></a>01005 <span class="comment">// Work stealing task</span>
<a name="l01006"></a>01006 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+5, fout); fout << <span class="stringliteral">"case WORK_STEALING_INDEX: { "</span>;
<a name="l01007"></a>01007 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+6, fout); fout << <span class="stringliteral">"tasknum = TaskQueue::GetNextTask(cur_thread);"</span>;
<a name="l01008"></a>01008 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+6, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l01009"></a>01009 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+5, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l01010"></a>01010
<a name="l01011"></a>01011 <span class="comment">// End task </span>
<a name="l01012"></a>01012 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+5, fout); fout << <span class="stringliteral">"case LAST_TASK_INDEX: { "</span>;
<a name="l01013"></a>01013 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+6, fout); fout << <span class="stringliteral">"fIsFinished = true;"</span>;
<a name="l01014"></a>01014 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+6, fout); fout << <span class="stringliteral">"break;"</span>;
<a name="l01015"></a>01015 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+5, fout); fout << <span class="stringliteral">"} "</span>;
<a name="l01016"></a>01016
<a name="l01017"></a>01017 <a class="code" href="klass_8cpp.html#ad95b7faa5d80dc925f7c0da761d74d62">gTaskCount</a> = <a class="code" href="klass_8cpp.html#a05378f2ac18ca2ec43a5f60a2bab93bb">START_TASK_INDEX</a> ;
<a name="l01018"></a>01018
<a name="l01019"></a>01019 <span class="comment">// DSP tasks</span>
<a name="l01020"></a>01020 <a class="code" href="classKlass.html#aee6a34ecc5d6be8cf86ec148114f03b5" title="Print the loop graph as a serie of parallel loops.">printLoopGraphScheduler</a> (n+5,fout);
<a name="l01021"></a>01021
<a name="l01022"></a>01022 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+4,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01023"></a>01023 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+3,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01024"></a>01024 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01025"></a>01025 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01026"></a>01026 }
<a name="l01027"></a>01027
<a name="l01031"></a><a class="code" href="classSigIntGenKlass.html#a52e81b8a4354f9946b5c47217fbc00e7">01031</a> <span class="keywordtype">void</span> <a class="code" href="classSigIntGenKlass.html#a52e81b8a4354f9946b5c47217fbc00e7" title="Print an auxillary C++ class corresponding to an integer init signal.">SigIntGenKlass::println</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l01032"></a>01032 {
<a name="l01033"></a>01033 list<Klass* >::iterator k;
<a name="l01034"></a>01034
<a name="l01035"></a>01035 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"class "</span> << <a class="code" href="classKlass.html#a5d3dbc87a72db9611660839ee2cd78ae">fKlassName</a> << <span class="stringliteral">" {"</span>;
<a name="l01036"></a>01036
<a name="l01037"></a>01037 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" private:"</span>;
<a name="l01038"></a>01038 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int \tfSamplingFreq;"</span>;
<a name="l01039"></a>01039
<a name="l01040"></a>01040 <span class="keywordflow">for</span> (k = <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.begin(); k != <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.end(); k++) (*k)->println(n+1, fout);
<a name="l01041"></a>01041
<a name="l01042"></a>01042 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+1, <a class="code" href="classKlass.html#a62442766ac35c578320eb37f18b60f90">fDeclCode</a>, fout);
<a name="l01043"></a>01043
<a name="l01044"></a>01044 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" public:"</span>;
<a name="l01045"></a>01045
<a name="l01046"></a>01046 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int getNumInputs() \t{ "</span>
<a name="l01047"></a>01047 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#adcb336021e5c4fab2b3832f3210cbcb9">fNumInputs</a> << <span class="stringliteral">"; }"</span>;
<a name="l01048"></a>01048 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int getNumOutputs() \t{ "</span>
<a name="l01049"></a>01049 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#a193a3c36f9fd250f42d032d79667f765">fNumOutputs</a> << <span class="stringliteral">"; }"</span>;
<a name="l01050"></a>01050
<a name="l01051"></a>01051 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"void init(int samplingFreq) {"</span>;
<a name="l01052"></a>01052 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"fSamplingFreq = samplingFreq;"</span>;
<a name="l01053"></a>01053 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01054"></a>01054
<a name="l01055"></a>01055 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"void fill (int count, int output[]) {"</span>;
<a name="l01056"></a>01056 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l01057"></a>01057 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l01058"></a>01058 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l01059"></a>01059 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l01060"></a>01060 <a class="code" href="classKlass.html#a61c98e6d4a6bd576d2e0f7f496e5f327" title="Print the loop graph (used for internals classes).">printLoopGraphInternal</a> (n+2,fout);
<a name="l01061"></a>01061 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01062"></a>01062
<a name="l01063"></a>01063 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"};\n"</span> << endl;
<a name="l01064"></a>01064 }
<a name="l01065"></a>01065
<a name="l01069"></a><a class="code" href="classSigFloatGenKlass.html#a457a5a87c1a04e1eab3cfa49345c21f5">01069</a> <span class="keywordtype">void</span> <a class="code" href="classSigFloatGenKlass.html#a457a5a87c1a04e1eab3cfa49345c21f5" title="Print an auxillary C++ class corresponding to an float init signal.">SigFloatGenKlass::println</a>(<span class="keywordtype">int</span> n, ostream& fout)
<a name="l01070"></a>01070 {
<a name="l01071"></a>01071 list<Klass* >::iterator k;
<a name="l01072"></a>01072
<a name="l01073"></a>01073 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"class "</span> << <a class="code" href="classKlass.html#a5d3dbc87a72db9611660839ee2cd78ae">fKlassName</a> << <span class="stringliteral">" {"</span>;
<a name="l01074"></a>01074
<a name="l01075"></a>01075 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" private:"</span>;
<a name="l01076"></a>01076 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int \tfSamplingFreq;"</span>;
<a name="l01077"></a>01077
<a name="l01078"></a>01078 <span class="keywordflow">for</span> (k = <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.begin(); k != <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.end(); k++) (*k)->println(n+1, fout);
<a name="l01079"></a>01079
<a name="l01080"></a>01080 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+1, <a class="code" href="classKlass.html#a62442766ac35c578320eb37f18b60f90">fDeclCode</a>, fout);
<a name="l01081"></a>01081
<a name="l01082"></a>01082 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">" public:"</span>;
<a name="l01083"></a>01083
<a name="l01084"></a>01084 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int getNumInputs() \t{ "</span>
<a name="l01085"></a>01085 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#adcb336021e5c4fab2b3832f3210cbcb9">fNumInputs</a> << <span class="stringliteral">"; }"</span>;
<a name="l01086"></a>01086 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"int getNumOutputs() \t{ "</span>
<a name="l01087"></a>01087 << <span class="stringliteral">"return "</span> << <a class="code" href="classKlass.html#a193a3c36f9fd250f42d032d79667f765">fNumOutputs</a> << <span class="stringliteral">"; }"</span>;
<a name="l01088"></a>01088
<a name="l01089"></a>01089 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"void init(int samplingFreq) {"</span>;
<a name="l01090"></a>01090 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+2,fout); fout << <span class="stringliteral">"fSamplingFreq = samplingFreq;"</span>;
<a name="l01091"></a>01091 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a>(n+2, <a class="code" href="classKlass.html#acabf319356fb4736e30f2d087ffe7703">fInitCode</a>, fout);
<a name="l01092"></a>01092 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01093"></a>01093
<a name="l01094"></a>01094 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <a class="code" href="Text_8cpp.html#af50e951c134c2c98c4c75d687f8fca7a">subst</a>(<span class="stringliteral">"void fill (int count, $0 output[]) {"</span>, <a class="code" href="floats_8cpp.html#af21a266634ce24abcd265188e774ba4a">ifloat</a>());
<a name="l01095"></a>01095 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a89d79a49fa732a945824a4134eda93f7" title="shared vectors">fZone1Code</a>, fout);
<a name="l01096"></a>01096 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#a57cbb496993401e7a01e8ae91e096211" title="first private">fZone2Code</a>, fout);
<a name="l01097"></a>01097 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#adc311ba0c3a84c7736c83ec50ae65a6b" title="single once per block">fZone2bCode</a>, fout);
<a name="l01098"></a>01098 <a class="code" href="klass_8cpp.html#a78b5da76dadfb32c2be459ab78763e98" title="Print a list of lines.">printlines</a> (n+2, <a class="code" href="classKlass.html#ac4743c478528d7de77a53309c52db067" title="private every sub block">fZone3Code</a>, fout);
<a name="l01099"></a>01099 <a class="code" href="classKlass.html#a61c98e6d4a6bd576d2e0f7f496e5f327" title="Print the loop graph (used for internals classes).">printLoopGraphInternal</a>(n+2,fout);
<a name="l01100"></a>01100 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n+1,fout); fout << <span class="stringliteral">"}"</span>;
<a name="l01101"></a>01101
<a name="l01102"></a>01102 <a class="code" href="klass_8cpp.html#a18a8d6ca698c9eaf2f270ffaaf19b13e">tab</a>(n,fout); fout << <span class="stringliteral">"};\n"</span> << endl;
<a name="l01103"></a>01103 }
<a name="l01104"></a>01104
<a name="l01105"></a><a class="code" href="klass_8cpp.html#aa2e5563424ef237dea3c2b278a270dde">01105</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="klass_8cpp.html#aa2e5563424ef237dea3c2b278a270dde">merge</a> (set<string>& dst, set<string>& src)
<a name="l01106"></a>01106 {
<a name="l01107"></a>01107 set<string>::iterator i;
<a name="l01108"></a>01108 <span class="keywordflow">for</span> (i = src.begin(); i != src.end(); i++) dst.insert(*i);
<a name="l01109"></a>01109 }
<a name="l01110"></a>01110
<a name="l01111"></a><a class="code" href="classKlass.html#ab819dc03f476cff0ee1581f80845126f">01111</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#ab819dc03f476cff0ee1581f80845126f">Klass::collectIncludeFile</a>(set<string>& S)
<a name="l01112"></a>01112 {
<a name="l01113"></a>01113 list<Klass* >::iterator k;
<a name="l01114"></a>01114
<a name="l01115"></a>01115 <span class="keywordflow">for</span> (k = <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.begin(); k != <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.end(); k++) (*k)->collectIncludeFile(S);
<a name="l01116"></a>01116 <a class="code" href="klass_8cpp.html#aa2e5563424ef237dea3c2b278a270dde">merge</a>(S, <a class="code" href="classKlass.html#a0cbcfe88854468638a780b463dc4d2a2">fIncludeFileSet</a>);
<a name="l01117"></a>01117 }
<a name="l01118"></a>01118
<a name="l01119"></a><a class="code" href="classKlass.html#a18947058c0cb1d7d3e610ddd6bc287f1">01119</a> <span class="keywordtype">void</span> <a class="code" href="classKlass.html#a18947058c0cb1d7d3e610ddd6bc287f1">Klass::collectLibrary</a>(set<string>& S)
<a name="l01120"></a>01120 {
<a name="l01121"></a>01121 list<Klass* >::iterator k;
<a name="l01122"></a>01122
<a name="l01123"></a>01123 <span class="keywordflow">for</span> (k = <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.begin(); k != <a class="code" href="classKlass.html#ae139311c22077a031269ecdc36004359">fSubClassList</a>.end(); k++) (*k)->collectLibrary(S);
<a name="l01124"></a>01124 <a class="code" href="klass_8cpp.html#aa2e5563424ef237dea3c2b278a270dde">merge</a>(S, <a class="code" href="classKlass.html#ae9e2431730a6520374587b95d04aba06">fLibrarySet</a>);
<a name="l01125"></a>01125 }
</pre></div></div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Wed Apr 28 23:59:59 2010 for FAUST compiler by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>
