loop.hh

Go to the documentation of this file.

/************************************************************************
 ************************************************************************
    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