<!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: shlysis.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>shlysis.cpp</h1><a href="shlysis_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">******************************************************************************</span>
<a name="l00026"></a>00026 <span class="comment"> Tree Sharing Analysis</span>
<a name="l00027"></a>00027 <span class="comment"> Y. Orlarey, (c) Grame 2002</span>
<a name="l00028"></a>00028 <span class="comment">------------------------------------------------------------------------------</span>
<a name="l00029"></a>00029 <span class="comment">The sharing analysis of tree t is the annotation of all its subtrees t' </span>
<a name="l00030"></a>00030 <span class="comment">with their number of occurences in t. As this annotation of t' depends of</span>
<a name="l00031"></a>00031 <span class="comment">a context (the tree t for which t' is a subtree) a specific property key</span>
<a name="l00032"></a>00032 <span class="comment">unique to each sharing analysis must be generated.</span>
<a name="l00033"></a>00033 <span class="comment"></span>
<a name="l00034"></a>00034 <span class="comment"> API:</span>
<a name="l00035"></a>00035 <span class="comment"> ---- </span>
<a name="l00036"></a>00036 <span class="comment"> </span>
<a name="l00037"></a>00037 <span class="comment"> shprkey(t) -> k = unique sharing property key of t</span>
<a name="l00038"></a>00038 <span class="comment"> shcount(k,t') -> n = returns the number of occurences of t' in t (where k = shprkey(t))</span>
<a name="l00039"></a>00039 <span class="comment"> shlysis(t) -> k = annotated the subtrees of t with prop (key sharing-count)</span>
<a name="l00040"></a>00040 <span class="comment"> (0 if t' is not a subtree of t)</span>
<a name="l00041"></a>00041 <span class="comment"></span>
<a name="l00042"></a>00042 <span class="comment"> History :</span>
<a name="l00043"></a>00043 <span class="comment"> ---------</span>
<a name="l00044"></a>00044 <span class="comment"> 2002-04-08 : First version</span>
<a name="l00045"></a>00045 <span class="comment"> 2006-03-25 : Modifications for new symbolic rec trees</span>
<a name="l00046"></a>00046 <span class="comment"> </span>
<a name="l00047"></a>00047 <span class="comment">******************************************************************************</span>
<a name="l00048"></a>00048 <span class="comment">*****************************************************************************/</span>
<a name="l00049"></a>00049
<a name="l00058"></a>00058 <span class="preprocessor">#include <string.h></span>
<a name="l00059"></a>00059 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00060"></a>00060 <span class="preprocessor">#include <stdio.h></span>
<a name="l00061"></a>00061
<a name="l00062"></a>00062 <span class="preprocessor">#include "<a class="code" href="shlysis_8hh.html">shlysis.hh</a>"</span>
<a name="l00063"></a>00063 <span class="preprocessor">#include "<a class="code" href="compatibility_8hh.html">compatibility.hh</a>"</span>
<a name="l00064"></a>00064
<a name="l00069"></a><a class="code" href="shlysis_8hh.html#a827cae6cc8102ab89e60ae2996fbdbf4">00069</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> <a class="code" href="shlysis_8cpp.html#a827cae6cc8102ab89e60ae2996fbdbf4" title="Create a specific property key for the sharing count of subtrees of t.">shprkey</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> t)
<a name="l00070"></a>00070 {
<a name="l00071"></a>00071 <span class="keywordtype">char</span> <a class="code" href="symbol_8hh.html#a8243134fbbd9d924ebbb3f833922e310" title="Returns the name of a symbol.">name</a>[256];
<a name="l00072"></a>00072 snprintf(name, 256, <span class="stringliteral">"SHARED IN %p : "</span>, (<a class="code" href="classCTree.html" title="A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches...">CTree</a>*)t);
<a name="l00073"></a>00073 <span class="keywordflow">return</span> <a class="code" href="tree_8hh.html#a61c13e9361cfa80bbb3cd6ce60a8f595">tree</a>(<a class="code" href="symbol_8hh.html#a377309446e0e86ae663cd6709e02889d" title="Returns a new unique symbol of name strxxx.">unique</a>(name));
<a name="l00074"></a>00074 }
<a name="l00075"></a>00075
<a name="l00076"></a>00076
<a name="l00081"></a><a class="code" href="shlysis_8hh.html#a501f0b3e93e8aebc9264835ee051859d">00081</a> <span class="keywordtype">int</span> <a class="code" href="shlysis_8cpp.html#a501f0b3e93e8aebc9264835ee051859d" title="Return the value of sharing count or 0.">shcount</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> key, <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> t)
<a name="l00082"></a>00082 {
<a name="l00083"></a>00083 <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> c;
<a name="l00084"></a>00084 <span class="keywordflow">if</span> (<a class="code" href="list_8cpp.html#a665745948013d012bb123e9577c094bd">getProperty</a>(t, key, c)) {
<a name="l00085"></a>00085 <span class="keywordflow">return</span> c-><a class="code" href="classCTree.html#a8de786fec095c8304b9ffa7c1c316237" title="return the content of the tree">node</a>().<a class="code" href="classNode.html#a0ac89402d0e51d19bed062529a375efe">getInt</a>();
<a name="l00086"></a>00086 } <span class="keywordflow">else</span> {
<a name="l00087"></a>00087 <span class="keywordflow">return</span> 0;
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089 }
<a name="l00090"></a>00090
<a name="l00091"></a>00091
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="comment">//------------------------------------------------------------------------------</span>
<a name="l00094"></a>00094 <span class="comment">// Create a specific property key for the sharing count of subtrees of t</span>
<a name="l00095"></a>00095 <span class="comment">//------------------------------------------------------------------------------</span>
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</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> k, <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> t, <a class="code" href="shlysis_8hh.html#ab9939aac687344648c82a67abb6e57dc">barrier</a> foo);
<a name="l00098"></a>00098
<a name="l00099"></a><a class="code" href="shlysis_8cpp.html#a3ed5bd7932722816a2420ec5614f0e1d">00099</a> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code" href="shlysis_8cpp.html#a3ed5bd7932722816a2420ec5614f0e1d">nobarrier</a> (<span class="keyword">const</span> <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>& t) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
<a name="l00100"></a>00100
<a name="l00105"></a><a class="code" href="shlysis_8cpp.html#a8146485be597a95467cfba6f56ff78c6">00105</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> <a class="code" href="shlysis_8cpp.html#a8146485be597a95467cfba6f56ff78c6" title="Do a sharing analysis : annotates all the subtrees of t with there occurences.">shlysis</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> t, <a class="code" href="shlysis_8hh.html#ab9939aac687344648c82a67abb6e57dc">barrier</a> foo)
<a name="l00106"></a>00106 {
<a name="l00107"></a>00107 <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> k = <a class="code" href="shlysis_8cpp.html#a827cae6cc8102ab89e60ae2996fbdbf4" title="Create a specific property key for the sharing count of subtrees of t.">shprkey</a>(t);
<a name="l00108"></a>00108 <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</a>(k, t, foo);
<a name="l00109"></a>00109 <span class="keywordflow">return</span> k;
<a name="l00110"></a>00110 }
<a name="l00111"></a>00111
<a name="l00112"></a>00112
<a name="l00117"></a><a class="code" href="shlysis_8cpp.html#a315ed9d9d7d552741763dc18ec6dcb04">00117</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> <a class="code" href="shlysis_8cpp.html#a8146485be597a95467cfba6f56ff78c6" title="Do a sharing analysis : annotates all the subtrees of t with there occurences.">shlysis</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> t)
<a name="l00118"></a>00118 {
<a name="l00119"></a>00119 <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> k = <a class="code" href="shlysis_8cpp.html#a827cae6cc8102ab89e60ae2996fbdbf4" title="Create a specific property key for the sharing count of subtrees of t.">shprkey</a>(t);
<a name="l00120"></a>00120 <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</a>(k, t, <a class="code" href="shlysis_8cpp.html#a3ed5bd7932722816a2420ec5614f0e1d">nobarrier</a>);
<a name="l00121"></a>00121 <span class="keywordflow">return</span> k;
<a name="l00122"></a>00122 }
<a name="l00123"></a>00123
<a name="l00124"></a>00124
<a name="l00129"></a><a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a">00129</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</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> k, <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> t, <a class="code" href="shlysis_8hh.html#ab9939aac687344648c82a67abb6e57dc">barrier</a> foo)
<a name="l00130"></a>00130 {
<a name="l00131"></a>00131 cerr << <span class="stringliteral">"Annotate "</span> << *t << endl;
<a name="l00132"></a>00132 <span class="keywordtype">int</span> c = <a class="code" href="shlysis_8cpp.html#a501f0b3e93e8aebc9264835ee051859d" title="Return the value of sharing count or 0.">shcount</a>(k,t);
<a name="l00133"></a>00133 <span class="keywordflow">if</span> (c==0) {
<a name="l00134"></a>00134 <span class="comment">// First visit</span>
<a name="l00135"></a>00135 <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> var, body;
<a name="l00136"></a>00136 <span class="keywordflow">if</span> (<a class="code" href="recursive-tree_8cpp.html#a4cb44c6e41e21da830e748dc35f16ba5" title="is t a de Bruijn recursive tree">isRec</a>(t, var, body)) {
<a name="l00137"></a>00137 <span class="comment">// special case for recursive trees</span>
<a name="l00138"></a>00138 <a class="code" href="list_8cpp.html#a5ead5a3e91af18d8f94e0974990a3c5a">setProperty</a>(t, k, <a class="code" href="tree_8hh.html#a61c13e9361cfa80bbb3cd6ce60a8f595">tree</a>(1));
<a name="l00139"></a>00139 <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</a>(k, body, foo);
<a name="l00140"></a>00140 <span class="keywordflow">return</span>;
<a name="l00141"></a>00141 } <span class="keywordflow">else</span> {
<a name="l00142"></a>00142 <span class="keywordtype">int</span> n = t-><a class="code" href="classCTree.html#a68f2be5e845407bc956a2893fe6f0d03" title="return the number of branches (subtrees) of a tree">arity</a>();
<a name="l00143"></a>00143 <span class="keywordflow">if</span> (n>0 && ! foo(t)) {
<a name="l00144"></a>00144 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=0; i<n; i++) <a class="code" href="shlysis_8cpp.html#a69b22f836f822d8296ca9f3061029e2a" title="Recursively increment the occurences count of t and its subtrees.">annotate</a>(k, t-><a class="code" href="classCTree.html#a06c1513b23dc7b0d9da9c930c6dc43c5" title="return the ith branch (subtree) of a tree">branch</a>(i), foo);
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146 }
<a name="l00147"></a>00147 } <span class="keywordflow">else</span> {
<a name="l00148"></a>00148 <span class="comment">//printf(" annotate %p with %d\n", (CTree*)t, c+1);</span>
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 <a class="code" href="list_8cpp.html#a5ead5a3e91af18d8f94e0974990a3c5a">setProperty</a>(t, k, <a class="code" href="tree_8hh.html#a61c13e9361cfa80bbb3cd6ce60a8f595">tree</a>(c+1));
<a name="l00151"></a>00151 }
</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>
