contrib/release/faust-doc-0.9.67-2-rosa2014.1.noarch.rpm

 /************************************************************************

  ************************************************************************

     FAUST compiler

     Copyright (C) 2003-2004 GRAME, Centre National de Creation Musicale

     ---------------------------------------------------------------------

     This program is free software; you can redistribute it and/or modify

     it under the terms of the GNU General Public License as published by

     the Free Software Foundation; either version 2 of the License, or

     (at your option) any later version.


     This program is distributed in the hope that it will be useful,

     but WITHOUT ANY WARRANTY; without even the implied warranty of

     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

     GNU General Public License for more details.


     You should have received a copy of the GNU General Public License

     along with this program; if not, write to the Free Software

     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

  ************************************************************************

  ************************************************************************/


 #ifndef _LOOP_H

 #define _LOOP_H


 /**********************************************************************

               - loop.hh : loop C++ à remplir (projet FAUST) -


                 Historique :

                 -----------

                 21-01-2008 : implementation initiale (yo)


 ***********************************************************************/

 namespace std{}

 using namespace std;


 #include <string>

 #include <list>

 #include <stack>

 #include <set>

 #include <map>

 #include "tlib.hh"


 #define kMaxCategory 32


 /*

  * Loops are lines of code that correspond to a recursive expression or a vector expression.

  */


 struct Loop

 {

     const bool          fIsRecursive;

     Tree                fRecSymbolSet;

     Loop* const         fEnclosingLoop;

     const string        fSize;

     // fields concerned by absorbsion

     set<Loop*>          fBackwardLoopDependencies;

     set<Loop*>          fForwardLoopDependencies;

     list<string>        fPreCode;

     list<string>        fExecCode;

     list<string>        fPostCode;

     // for topological sort

     int                 fOrder;

     int                 fIndex;

     // new fields

     int                 fUseCount;

     list<Loop*>         fExtraLoops;


     int                 fPrinted;


 public:

     Loop(Tree recsymbol, Loop* encl, const string& size);

     Loop(Loop* encl, const string& size);


     bool isEmpty();

     bool hasRecDependencyIn(Tree S);


     void addPreCode (const string& str);

     void addExecCode (const string& str);

     void addPostCode (const string& str);

     void println (int n, ostream& fout);

     void printParLoopln(int n, ostream& fout);


     void printoneln (int n, ostream& fout);


     void absorb(Loop* l);

     // new method

     void concat(Loop* l);

 };


 #endif

Loop::fEnclosingLoop
Loop *const fEnclosingLoop
Loop from which this one originated.
Definition: loop.hh:56

CTree
A CTree = (Node x [CTree]) is a Node associated with a list of subtrees called branches.
Definition: tree.hh:109

Loop::fPostCode
list< string > fPostCode
code to execute at the end of the loop
Definition: loop.hh:63

Loop::fUseCount
int fUseCount
how many loops depend on this one
Definition: loop.hh:68

Loop::fIsRecursive
const bool fIsRecursive
recursive loops can't be SIMDed
Definition: loop.hh:54

Loop::fRecSymbolSet
Tree fRecSymbolSet
recursive loops define a set of recursive symbol
Definition: loop.hh:55

Loop::fPrinted
int fPrinted
true when loop has been printed (to track multi-print errors)
Definition: loop.hh:71

Loop::fExecCode
list< string > fExecCode
code to execute in the loop
Definition: loop.hh:62

Loop::fExtraLoops
list< Loop * > fExtraLoops
extra loops that where in sequences
Definition: loop.hh:69

concat
Tree concat(Tree l, Tree q)
Definition: list.cpp:216

Loop::fOrder
int fOrder
used during topological sort
Definition: loop.hh:65

tlib.hh

Loop::fSize
const string fSize
number of iterations of the loop
Definition: loop.hh:57

Loop
Definition: loop.hh:52

Loop::fPreCode
list< string > fPreCode
code to execute at the begin of the loop
Definition: loop.hh:61

Loop::fIndex
int fIndex
used during scheduler mode code generation
Definition: loop.hh:66

Loop::fBackwardLoopDependencies
set< Loop * > fBackwardLoopDependencies
Loops that must be computed before this one.
Definition: loop.hh:59

Loop::fForwardLoopDependencies
set< Loop * > fForwardLoopDependencies
Loops that will be computed after this one.
Definition: loop.hh:60