Sophie

Sophie

distrib > Mandriva > 2010.1 > x86_64 > by-pkgid > aaf33964de706a538481c929c1da6a44 > files > 140

faust-doc-0.9.10-5mdv2010.1.x86_64.rpm

<!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: binop.hh 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&nbsp;Page</span></a></li>
      <li><a href="pages.html"><span>Related&nbsp;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&nbsp;List</span></a></li>
      <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
    </ul>
  </div>
<h1>binop.hh</h1><a href="binop_8hh.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="preprocessor">#ifndef _BINOP_</span>
<a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#define _BINOP_</span>
<a name="l00026"></a>00026 <span class="preprocessor"></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include &quot;<a class="code" href="node_8hh.html" title="A Node is a tagged unions of int, double, symbol and void* used in the implementation...">node.hh</a>&quot;</span>
<a name="l00028"></a>00028 
<a name="l00029"></a><a class="code" href="binop_8hh.html#a13e2a9b67691177465c7681f765dca09">00029</a> <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>  (*<a class="code" href="binop_8hh.html#a13e2a9b67691177465c7681f765dca09">comp</a>) (<span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; a, <span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; b);
<a name="l00030"></a><a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">00030</a> <span class="keyword">typedef</span> bool        (*<a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">pred</a>) (<span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; a);
<a name="l00031"></a>00031 
<a name="l00032"></a><a class="code" href="structBinOp.html">00032</a> <span class="keyword">struct </span><a class="code" href="structBinOp.html">BinOp</a> 
<a name="l00033"></a>00033 {
<a name="l00034"></a><a class="code" href="structBinOp.html#a920b64ea13036db779c512b86ab01e40">00034</a>     <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="structBinOp.html#a920b64ea13036db779c512b86ab01e40">fName</a>;
<a name="l00035"></a><a class="code" href="structBinOp.html#a4fe6d36c53e004cd1692ef8edfa0eed1">00035</a>     <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="structBinOp.html#a4fe6d36c53e004cd1692ef8edfa0eed1">fNameVec</a>;
<a name="l00036"></a><a class="code" href="structBinOp.html#a7dec07e6e14e95b5b335fa656beb1874">00036</a>     <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="structBinOp.html#a7dec07e6e14e95b5b335fa656beb1874">fNameScal</a>;
<a name="l00037"></a><a class="code" href="structBinOp.html#a18e6368f1b39dfe76eb03b70d44dfce5">00037</a>     <a class="code" href="binop_8hh.html#a13e2a9b67691177465c7681f765dca09">comp</a>        <a class="code" href="structBinOp.html#a18e6368f1b39dfe76eb03b70d44dfce5">fCompute</a>;
<a name="l00038"></a><a class="code" href="structBinOp.html#ad0d08d407fcdff91e268f63aabac0c73">00038</a>     <a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">pred</a>        <a class="code" href="structBinOp.html#ad0d08d407fcdff91e268f63aabac0c73">fLeftNeutral</a>;
<a name="l00039"></a><a class="code" href="structBinOp.html#a663838509e02cc5d24c8ce1ca157db92">00039</a>     <a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">pred</a>        <a class="code" href="structBinOp.html#a663838509e02cc5d24c8ce1ca157db92">fRightNeutral</a>;
<a name="l00040"></a><a class="code" href="structBinOp.html#afd5215a987303f372c135eeededffb3f">00040</a>     <span class="keywordtype">int</span>         <a class="code" href="structBinOp.html#afd5215a987303f372c135eeededffb3f">fPriority</a>;
<a name="l00041"></a>00041     <span class="comment">//</span>
<a name="l00042"></a><a class="code" href="structBinOp.html#a8d85902b2735583dbd9acf399f0d6cc3">00042</a>     <a class="code" href="structBinOp.html#a8d85902b2735583dbd9acf399f0d6cc3">BinOp</a> (<span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="symbol_8hh.html#a8243134fbbd9d924ebbb3f833922e310" title="Returns the name of a symbol.">name</a>, <span class="keyword">const</span> <span class="keywordtype">char</span>* namevec, <span class="keyword">const</span> <span class="keywordtype">char</span>* namescal, <a class="code" href="binop_8hh.html#a13e2a9b67691177465c7681f765dca09">comp</a> f, <a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">pred</a> ln, <a class="code" href="binop_8hh.html#af26e0becca9357029e8be945dd817e75">pred</a> rn, <span class="keywordtype">int</span> priority) 
<a name="l00043"></a>00043             : <a class="code" href="structBinOp.html#a920b64ea13036db779c512b86ab01e40">fName</a>(name), <a class="code" href="structBinOp.html#a4fe6d36c53e004cd1692ef8edfa0eed1">fNameVec</a>(namevec), <a class="code" href="structBinOp.html#a7dec07e6e14e95b5b335fa656beb1874">fNameScal</a>(namescal), <a class="code" href="structBinOp.html#a18e6368f1b39dfe76eb03b70d44dfce5">fCompute</a>(f), <a class="code" href="structBinOp.html#ad0d08d407fcdff91e268f63aabac0c73">fLeftNeutral</a>(ln), <a class="code" href="structBinOp.html#a663838509e02cc5d24c8ce1ca157db92">fRightNeutral</a>(rn), <a class="code" href="structBinOp.html#afd5215a987303f372c135eeededffb3f">fPriority</a>(priority) {  }
<a name="l00044"></a>00044     <span class="comment">//</span>
<a name="l00045"></a><a class="code" href="structBinOp.html#aa2a29825af89ac6dd8e08cac1261e5b8">00045</a>     <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a> <a class="code" href="structBinOp.html#aa2a29825af89ac6dd8e08cac1261e5b8">compute</a>(<span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; a, <span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; b) { <span class="keywordflow">return</span> <a class="code" href="structBinOp.html#a18e6368f1b39dfe76eb03b70d44dfce5">fCompute</a>(a,b);  }
<a name="l00046"></a>00046     <span class="comment">//</span>
<a name="l00047"></a><a class="code" href="structBinOp.html#a16d591d0d171f8b5cf8aef9f1324e95d">00047</a>     <span class="keywordtype">bool</span> <a class="code" href="structBinOp.html#a16d591d0d171f8b5cf8aef9f1324e95d">isRightNeutral</a>(<span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; a)  { <span class="keywordflow">return</span> <a class="code" href="structBinOp.html#a663838509e02cc5d24c8ce1ca157db92">fRightNeutral</a>(a);  }
<a name="l00048"></a><a class="code" href="structBinOp.html#ac568fcce2d8708501528703bae2d91b2">00048</a>     <span class="keywordtype">bool</span> <a class="code" href="structBinOp.html#ac568fcce2d8708501528703bae2d91b2">isLeftNeutral</a>(<span class="keyword">const</span> <a class="code" href="classNode.html" title="Class Node = (type x (int + double + Sym + void*)).">Node</a>&amp; a)   { <span class="keywordflow">return</span> <a class="code" href="structBinOp.html#ad0d08d407fcdff91e268f63aabac0c73">fLeftNeutral</a>(a);   }
<a name="l00049"></a>00049 };
<a name="l00050"></a>00050 
<a name="l00051"></a>00051 <span class="keyword">extern</span> <a class="code" href="structBinOp.html">BinOp</a>* <a class="code" href="binop_8cpp.html#a2d55d4b4acaed7188a432ffdb646395a">gBinOpTable</a>[];
<a name="l00052"></a>00052 <span class="keyword">extern</span> <a class="code" href="structBinOp.html">BinOp</a>* <a class="code" href="binop_8cpp.html#a9d137df2c7f9680b51588582b20940c2">gBinOpLateqTable</a>[];
<a name="l00053"></a>00053 
<a name="l00054"></a>00054 
<a name="l00055"></a>00055 <span class="keyword">enum</span> {
<a name="l00056"></a><a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04aa8aa42e35eb8248e580bf83ded4311d3">00056</a>     <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a8d20f6cca2d49a8732f535cfe28812c8">kAdd</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04aa8aa42e35eb8248e580bf83ded4311d3">kSub</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04ab8488ea0c4c9fd6bf85f12e3ad5eba18">kMul</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04aef0a0af82a04caacbdd669707bfe3ab1">kDiv</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a6c9b09cd1576fb102b894e94c6fbb50d">kRem</a>,
<a name="l00057"></a><a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a78bcc3d3a2b051735b0a40913269cc0a">00057</a>     <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a17541c9042064a5766094cb21004747b">kLsh</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a78bcc3d3a2b051735b0a40913269cc0a">kRsh</a>,
<a name="l00058"></a><a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04afab4db2de17aa5171d21f7083a22bfe1">00058</a>     <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04af173a32f5795cbb2a5925244957e6cfa">kGT</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04ae7a542507915cc0c7fa6e1e8f34f63d3">kLT</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a720a8d4d4940a77bf3032e8b635b3686">kGE</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a15e96019cd90687e4124d41ac3de868b">kLE</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a563c2f90bb81a7e2d8163a894286c41e">kEQ</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04afab4db2de17aa5171d21f7083a22bfe1">kNE</a>,
<a name="l00059"></a><a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04ad222de85609d6b20ff3f55ddadf7be5e">00059</a>     <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04aa642aa3f76bf915b63cac652e82132c2">kAND</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04a5c06378c2fa6a1bd5533457f763c43a1">kOR</a>, <a class="code" href="binop_8hh.html#abc6126af1d45847bc59afa0aa3216b04ad222de85609d6b20ff3f55ddadf7be5e">kXOR</a>
<a name="l00060"></a>00060 };
<a name="l00061"></a>00061 
<a name="l00062"></a>00062 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr class="footer"/><address style="text-align: right;"><small>Generated on Wed Apr 28 23:59:58 2010 for FAUST compiler by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.3 </small></address>
</body>
</html>