1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2003-2018 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 Lesser General Public License as published by
the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#ifndef _SIMPLIFY_TO_NF_
#define _SIMPLIFY_TO_NF_
#include "tree.hh"
/**
* Simplify a signal to its normal form, where:
* - all possible optimisations, simplications, and compile time computations have been done
* - the mathematical functions (primitives and binary functions), delay, select2, soundfile
* primitive... are properly typed (arguments and result)
* - signal cast are properly done when needed
*
* @param sig - the signal to be processed
*
* @return the signal in normal form.
*/
LIBFAUST_API Tree simplifyToNormalForm(Tree sig);
/**
* Simplify a signal list to its normal form, where:
* - all possible optimisations, simplications, and compile time computations have been done
* - the mathematical functions (primitives and binary functions), delay, select2, soundfile
* primitive... are properly typed (arguments and result)
* - signal cast are properly done when needed
*
* @param siglist - the signal vector to be processed
*
* @return the signal list in normal form.
*/
LIBFAUST_API tvec simplifyToNormalForm2(tvec siglist);
/**
* Print the signal.
*
* @param sig - the signal to be printed
* @param shared - whether the identical sub signals are printed as identifiers
* @param max_size - the maximum number of characters to be printed (possibly needed for big
* expressions in non shared mode)
*
* @return the printed signal as a string
*/
LIBFAUST_API std::string printSignal(Tree sig, bool shared, int max_size);
/**
* Print the box.
*
* @param box - the box to be printed
* @param shared - whether the identical sub boxes are printed as identifiers
* @param max_size - the maximum number of characters to be printed (possibly needed for big
* expressions in non shared mode)
*
* @return the printed box as a string
*/
LIBFAUST_API std::string printBox(Tree box, bool shared, int max_size);
#endif
|