eval.cpp File Reference

Implementation of the Block diagram evaluator. More...

#include "eval.hh"
#include <stdio.h>
#include "errormsg.hh"
#include "ppbox.hh"
#include "simplify.hh"
#include "propagate.hh"
#include "patternmatcher.hh"
#include "signals.hh"
#include "xtended.hh"
#include "loopDetector.hh"
#include "property.hh"
#include "names.hh"
#include "compatibility.hh"
#include <assert.h>

Include dependency graph for eval.cpp:

Go to the source code of this file.

Macros
#define	TRACE

Functions
static Tree	a2sb (Tree exp)
static Tree	eval (Tree exp, Tree visited, Tree localValEnv)
static Tree	realeval (Tree exp, Tree visited, Tree localValEnv)
	Eval a block diagram expression. More...
static Tree	revEvalList (Tree lexp, Tree visited, Tree localValEnv)
	Eval a list of expression in reverse order. More...
static Tree	applyList (Tree fun, Tree larg)
	Apply a function to a list of arguments. More...
static Tree	iteratePar (Tree id, int num, Tree body, Tree visited, Tree localValEnv)
	Iterate a parallel construction. More...
static Tree	iterateSeq (Tree id, int num, Tree body, Tree visited, Tree localValEnv)
	Iterate a sequential construction. More...
static Tree	iterateSum (Tree id, int num, Tree body, Tree visited, Tree localValEnv)
	Iterate an addition construction. More...
static Tree	iterateProd (Tree id, int num, Tree body, Tree visited, Tree localValEnv)
	Iterate a product construction. More...
static Tree	larg2par (Tree larg)
	Transform a list of expressions in a parallel construction. More...
static int	eval2int (Tree exp, Tree visited, Tree localValEnv)
	Eval a block diagram to an int. More...
static double	eval2double (Tree exp, Tree visited, Tree localValEnv)
	Eval a block diagram to a double. More...
static const char *	evalLabel (const char *src, Tree visited, Tree localValEnv)
	evallabel replace "...%2i..." occurences in label with value of i More...
static Tree	evalIdDef (Tree id, Tree visited, Tree lenv)
	Search the environment for the definition of a symbol ID and evaluate it. More...
static Tree	evalCase (Tree rules, Tree env)
	Eval a case expression containing a list of pattern matching rules. More...
static Tree	evalRuleList (Tree rules, Tree env)
	Evaluates each rule of the list. More...
static Tree	evalRule (Tree rule, Tree env)
	Evaluates the list of patterns and closure the rhs. More...
static Tree	evalPatternList (Tree patterns, Tree env)
	Evaluates each pattern of the list. More...
static Tree	evalPattern (Tree pattern, Tree env)
	Evaluates a pattern and simplify it to numerical value if possible. More...
static Tree	patternSimplification (Tree pattern)
static bool	isBoxNumeric (Tree in, Tree &out)
static Tree	vec2list (const vector< Tree > &v)
static void	list2vec (Tree l, vector< Tree > &v)
static Tree	listn (int n, Tree e)
	Creates a list of n elements. More...
static Tree	boxSimplification (Tree box)
	boxSimplification(box) : simplify a block-diagram by replacing expressions denoting a constant number by this number. More...
Tree	evalprocess (Tree eqlist)
	Eval "process" from a list of definitions. More...
Tree	evaldocexpr (Tree docexpr, Tree eqlist)
static Tree	real_a2sb (Tree exp)
static bool	autoName (Tree exp, Tree &id)
bool	getArgName (Tree t, Tree &id)
void	setEvalProperty (Tree box, Tree env, Tree value)
	set the value of box in the environment env More...
bool	getEvalProperty (Tree box, Tree env, Tree &value)
	retrieve the value of box in the environment env More...
static bool	isBoxPatternOp (Tree box, Node &n, Tree &t1, Tree &t2)
void	setNumericProperty (Tree t, Tree num)
bool	getNumericProperty (Tree t, Tree &num)
Tree	simplifyPattern (Tree value)
	Simplify a block-diagram pattern by computing its numerical sub-expressions. More...
static bool	isDigitChar (char c)
static bool	isIdentChar (char c)
static void	writeIdentValue (std::string &dst, const std::string &format, const std::string &ident, Tree visited, Tree localValEnv)
static bool	boxlistOutputs (Tree boxlist, int *outputs)
	Compute the sum of outputs of a list of boxes. More...
static Tree	nwires (int n)
	repeat n times a wire More...
static void	setPMProperty (Tree t, Tree env, Tree pm)
static bool	getPMProperty (Tree t, Tree env, Tree &pm)
static Tree	numericBoxSimplification (Tree box)
	Try to do a numeric simplification of a block-diagram. More...
static Tree	insideBoxSimplification (Tree box)
	Simplify inside a block-diagram : S[A*B] => S[A]*S[B]. More...

Variables
SourceReader	gReader
int	gMaxNameSize
bool	gSimpleNames
bool	gSimplifyDiagrams
property< Tree >	gSymbolicBoxProperty
	Transform unused (unapplied) closures into symbolic boxes. More...
static int	gBoxSlotNumber = 0
	counter for unique slot number More...
static loopDetector	LD (1024, 512)
	Eval a block diagram expression. More...
static Node	EVALPROPERTY (symbol("EvalProperty"))
Tree	NUMERICPROPERTY = tree(symbol("NUMERICPROPERTY"))
const char *	Formats [] = {"%d", "%1d", "%2d", "%3d", "%4d"}
static Node	PMPROPERTYNODE (symbol("PMPROPERTY"))
	A property to store the pattern matcher corresponding to a set of rules in a specific environement. More...
static property< Tree >	SimplifiedBoxProperty

Detailed Description

Implementation of the Block diagram evaluator.

Interface for names propagation.

A strict lambda-calculus evaluator for block diagram expressions.

Definition in file eval.cpp.

Macro Definition Documentation

#define TRACE

Definition at line 21 of file eval.cpp.

Function Documentation

static Tree a2sb ( Tree  exp )

static

Definition at line 135 of file eval.cpp.

References property< Tree >::get(), getDefNameProperty(), real_a2sb(), property< Tree >::set(), and setDefNameProperty().

Referenced by applyList(), boxlistOutputs(), eval2double(), eval2int(), evaldocexpr(), evalprocess(), isBoxNumeric(), real_a2sb(), and realeval().

{
    Tree    result;
    Tree    id;

    if (gSymbolicBoxProperty.get(exp, result)) {
        return result;
    }

    result = real_a2sb(exp);
    if (result != exp && getDefNameProperty(exp, id)) {
        setDefNameProperty(result, id);     // propagate definition name property when needed
    }
    gSymbolicBoxProperty.set(exp, result);
    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree applyList ( Tree  fun, Tree  larg  )

static

Apply a function to a list of arguments.

Apply a function F to a list of arguments (a,b,c,...). F can be either a closure over an abstraction, or a pattern matcher. If it is not the case then we have : F(a,b,c,...) ==> (a,b,c,...):F

Parameters

fun	the function to apply
larg	the list of arguments

Returns

the resulting expression in normal form

Definition at line 1003 of file eval.cpp.

References a2sb(), apply_pattern_matcher(), boxCase(), boxError(), boxlistOutputs(), boxPatternMatcher(), boxSeq(), concat(), cons(), eval(), evalerror(), evalerrorbox(), getBoxType(), getDefNameProperty(), getUserData(), gSimpleNames, hd(), isBoxAbstr(), isBoxEnvironment(), isBoxError(), isBoxNumeric(), isBoxPatternMatcher(), isBoxPrim2(), isClosure(), isNil(), larg2par(), list2vec(), nil, nwires(), pushValueDef(), reverse(), setDefNameProperty(), sigPrefix(), tl(), tree2str(), vec2list(), and yyfilename.

Referenced by real_a2sb(), and realeval().

{
    Tree abstr;
    Tree globalDefEnv;
    Tree visited;
    Tree localValEnv;
    Tree envList;
    Tree originalRules;
    Tree revParamList;

    Tree id;
    Tree body;
    
    Automaton*  automat;
    int         state;

    prim2   p2;

    //cerr << "applyList (" << *fun << ", " << *larg << ")" << endl;

    if (isNil(larg)) return fun;

    if (isBoxError(fun) || isBoxError(larg)) {
        return boxError();
    }

    if (isBoxPatternMatcher(fun, automat, state, envList, originalRules, revParamList)) {
        Tree            result;
        int             state2;
        vector<Tree>    envVect;
        
        list2vec(envList, envVect);
        //cerr << "applyList/apply_pattern_matcher(" << automat << "," << state << "," << *hd(larg) << ")" << endl;
        state2 = apply_pattern_matcher(automat, state, hd(larg), result, envVect);
        //cerr << "state2 = " << state2 << "; result = " << *result << endl;
        if (state2 >= 0 && isNil(result)) {
            // we need to continue the pattern matching
            return applyList(
                        boxPatternMatcher(automat, state2, vec2list(envVect), originalRules, cons(hd(larg),revParamList)),
                        tl(larg) );
        } else if (state2 < 0) {
            cerr << "ERROR : pattern matching failed, no rule of " << boxpp(boxCase(originalRules)) 
                 << " matches argument list " << boxpp(reverse(cons(hd(larg), revParamList))) << endl;
            exit(1);
        } else {
            // Pattern Matching was succesful
            // the result is a closure that we need to evaluate.
            if (isClosure(result, body, globalDefEnv, visited, localValEnv)) {
                // why ??? return simplifyPattern(eval(body, nil, localValEnv));
                //return eval(body, nil, localValEnv);
                return applyList(eval(body, nil, localValEnv), tl(larg));
            } else {
                cerr << "wrong result from pattern matching (not a closure) : " << boxpp(result) << endl;
                return boxError();
            }
        }           
    }
    if (!isClosure(fun, abstr, globalDefEnv, visited, localValEnv)) {
        // principle : f(a,b,c,...) ==> (a,b,c,...):f
         int ins, outs;
         
         // check arity of function
         Tree efun = a2sb(fun);
         //cerr << "TRACEPOINT 1 : " << boxpp(efun) << endl;
         if (!getBoxType(efun, &ins, &outs)) { // on laisse comme ca pour le moment
            // we can't determine the input arity of the expression
            // hope for the best
            return boxSeq(larg2par(larg), fun);
         }
 
         // check arity of arg list
         if (!boxlistOutputs(larg,&outs)) {
            // we don't know yet the output arity of larg. Therefore we can't
            // do any arity checking nor add _ to reach the required number of arguments
            // cerr << "warning : can't infere the type of : " << boxpp(larg) << endl;
            return boxSeq(larg2par(larg), fun);
         }
        
        if (outs > ins) {
            cerr << "too much arguments : " << outs << ", instead of : " << ins << endl;
            cerr << "when applying : " << boxpp(fun) << endl
                 << "           to : " << boxpp(larg) << endl;
            assert(false);
        }
        
        if (    (outs == 1)
            &&
                (  ( isBoxPrim2(fun, &p2) && (p2 != sigPrefix) )
                || ( getUserData(fun) && ((xtended*)getUserData(fun))->isSpecialInfix() ) ) ) {
            // special case : /(3) ==> _,3 : /
            Tree larg2 = concat(nwires(ins-outs), larg);
            return boxSeq(larg2par(larg2), fun);

        } else {

            Tree larg2 = concat(larg, nwires(ins-outs));
            return boxSeq(larg2par(larg2), fun);
        }
    }

    if (isBoxEnvironment(abstr)) {
        evalerrorbox(yyfilename, -1, "an environment can't be used as a function", fun);
        exit(1);
    }

    if (!isBoxAbstr(abstr, id, body)) {
        evalerror(yyfilename, -1, "(internal) not an abstraction inside closure", fun);
        exit(1);
    }

    // try to synthetise a  name from the function name and the argument name
    {
        Tree arg = eval(hd(larg), visited, localValEnv);
        Tree narg; if ( isBoxNumeric(arg,narg) ) { arg =  narg; } 
        Tree f = eval(body, visited, pushValueDef(id, arg, localValEnv));

        Tree    fname;
        if (getDefNameProperty(fun, fname)) {
            stringstream s; s << tree2str(fname); if (!gSimpleNames) s << "(" << boxpp(arg) << ")";
            setDefNameProperty(f, s.str());
        }
        return applyList(f, tl(larg));
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool autoName ( Tree  exp, Tree &  id  )

static

Definition at line 226 of file eval.cpp.

References tree().

Referenced by getArgName().

{
    stringstream s; s << boxpp(exp);
    id = tree(s.str().c_str());
    return true;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool boxlistOutputs ( Tree  boxlist, int *  outputs  )

static

Compute the sum of outputs of a list of boxes.

The sum is valid if all the boxes have a valid boxType

Parameters

boxlist	the list of boxes
outputs	sum of outputs of the boxes

Returns

true if outputs is valid, false otherwise

Definition at line 948 of file eval.cpp.

References a2sb(), getBoxType(), hd(), isNil(), and tl().

Referenced by applyList().

{
    int ins, outs;

    *outputs = 0;
    while (!isNil(boxlist))
    {
        Tree b = a2sb(hd(boxlist)); // for getBoxType, suppose list of evaluated boxes
        if (getBoxType(b, &ins, &outs)) {
            *outputs += outs;
        } else {
            // arbitrary output arity set to 1
            // when can't be determined
            *outputs += 1;
        }
        boxlist = tl(boxlist);
    }
    return isNil(boxlist);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tree boxSimplification ( Tree  box )

static

boxSimplification(box) : simplify a block-diagram by replacing expressions denoting a constant number by this number.

Definition at line 1347 of file eval.cpp.

References property< Tree >::get(), getDefNameProperty(), name(), numericBoxSimplification(), property< Tree >::set(), and setDefNameProperty().

Referenced by evalprocess(), and insideBoxSimplification().

{
    Tree    simplified;

    if (SimplifiedBoxProperty.get(box,simplified)) {

        return simplified;

    } else {

        simplified = numericBoxSimplification(box);

        // transferts name property if any
        Tree name; if (getDefNameProperty(box, name)) setDefNameProperty(simplified, name);

        // attach simplified expression as a property of original box
        SimplifiedBoxProperty.set(box,simplified);

        return simplified;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree eval ( Tree  exp, Tree  visited, Tree  localValEnv  )

static

Definition at line 280 of file eval.cpp.

References cons(), loopDetector::detect(), getDefNameProperty(), getEvalProperty(), LD, realeval(), setDefNameProperty(), and setEvalProperty().

Referenced by applyList(), eval2double(), eval2int(), evaldocexpr(), evalIdDef(), evalPattern(), evalprocess(), iteratePar(), iterateProd(), iterateSeq(), iterateSum(), real_a2sb(), realeval(), and revEvalList().

{
    Tree    id;
    Tree    result;
    
    if (!getEvalProperty(exp, localValEnv, result)) {
        LD.detect(cons(exp,localValEnv));
        //cerr << "ENTER eval("<< *exp << ") with env " << *localValEnv << endl;
        result = realeval(exp, visited, localValEnv);
        setEvalProperty(exp, localValEnv, result);
        //cerr << "EXIT eval(" << *exp << ") IS " << *result << " with env " << *localValEnv << endl;
        if (getDefNameProperty(exp, id)) {
            setDefNameProperty(result, id);     // propagate definition name property 
        }
    }
    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static double eval2double ( Tree  exp, Tree  visited, Tree  localValEnv  )

static

Eval a block diagram to a double.

Eval a block diagram that represent a double constant. This function first eval a block diagram to its normal form, then check it represent a numerical value (a block diagram of type : 0->1) then do a symbolic propagation and try to convert the resulting signal to a double.

Parameters

exp	the expression to evaluate
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 689 of file eval.cpp.

References a2sb(), boxPropagateSig(), eval(), evalerror(), getBoxType(), hd(), makeSigInputList(), nil, simplify(), tree2float(), yyfilename, and yylineno.

Referenced by realeval().

{
    Tree diagram = a2sb(eval(exp, visited, localValEnv)); // pour getBoxType
    int numInputs, numOutputs;
    getBoxType(diagram, &numInputs, &numOutputs);
    if ( (numInputs > 0) || (numOutputs != 1) ) {
        evalerror (yyfilename, yylineno, "not a constant expression of type : (0->1)", exp);
        return 1;
    } else {
        Tree lsignals = boxPropagateSig(nil, diagram , makeSigInputList(numInputs) );
        Tree val = simplify(hd(lsignals));
        return tree2float(val);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int eval2int ( Tree  exp, Tree  visited, Tree  localValEnv  )

static

Eval a block diagram to an int.

Eval a block diagram that represent an integer constant. This function first eval a block diagram to its normal form, then check it represent a numerical value (a block diagram of type : 0->1) then do a symbolic propagation and try to convert the resulting signal to an int.

Parameters

exp	the expression to evaluate
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 718 of file eval.cpp.

References a2sb(), boxPropagateSig(), eval(), evalerror(), getBoxType(), hd(), makeSigInputList(), nil, simplify(), tree2int(), yyfilename, and yylineno.

Referenced by realeval(), and writeIdentValue().

{
    Tree diagram = a2sb(eval(exp, visited, localValEnv));   // pour getBoxType()
    int numInputs, numOutputs;
    getBoxType(diagram, &numInputs, &numOutputs);
    if ( (numInputs > 0) || (numOutputs != 1) ) {
        evalerror (yyfilename, yylineno, "not a constant expression of type : (0->1)", exp);
        return 1;
    } else {
        Tree lsignals = boxPropagateSig(nil, diagram , makeSigInputList(numInputs) );
        Tree val = simplify(hd(lsignals));
        return tree2int(val);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalCase ( Tree  rules, Tree  env  )

static

Eval a case expression containing a list of pattern matching rules.

Creates a boxPatternMatcher containing a pm autamaton a state and a list of environments.

Parameters

rules	the list of rules
env	the environment uused to evaluate the patterns and closure the rhs

Returns

a boxPatternMatcher ready to be applied

Definition at line 1257 of file eval.cpp.

References boxPatternMatcher(), evalRuleList(), getPMProperty(), len(), listn(), make_pattern_matcher(), nil, pushEnvBarrier(), and setPMProperty().

Referenced by realeval().

{
    Tree pm;
    if (!getPMProperty(rules, env, pm)) {
        Automaton*  a = make_pattern_matcher(evalRuleList(rules, env));
        pm = boxPatternMatcher(a, 0, listn(len(rules), pushEnvBarrier(env)), rules, nil);
        setPMProperty(rules, env, pm);
    }
    return pm;
}       

Here is the call graph for this function:

Here is the caller graph for this function:

Tree evaldocexpr	(	Tree	docexpr,
		Tree	eqlist
	)

Definition at line 114 of file eval.cpp.

References a2sb(), eval(), nil, and pushMultiClosureDefs().

Referenced by mapEvalDocEqn(), and printDocDgm().

{
    return a2sb(eval(docexpr, nil, pushMultiClosureDefs(eqlist, nil, nil)));
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalIdDef ( Tree  id, Tree  visited, Tree  lenv  )

static

Search the environment for the definition of a symbol ID and evaluate it.

Detects recursive definitions using a set of visited IDxENV. Associates the symbol as a definition name property of the definition.

Parameters

id	the symbol ID t-o search
visited	set of visited symbols (used for recursive definition detection)
lenv	the environment where to search

Returns

the evaluated definition of ID

Definition at line 1188 of file eval.cpp.

References addElement(), CTree::branch(), cons(), eval(), evalerror(), getDefFileProp(), getDefLineProp(), getDefNameProperty(), getProperty(), isNil(), name(), and nil.

Referenced by realeval().

{
    Tree def, name;

    // search the environment env for a definition of symbol id
    while (!isNil(lenv) && !getProperty(lenv, id, def)) {
        lenv = lenv->branch(0);
    }

    // check that the definition exists
    if (isNil(lenv)) {
        cerr << "undefined symbol " << *id << endl;
        evalerror(getDefFileProp(id), getDefLineProp(id), "undefined symbol ", id);
        exit(1);
    }

    //cerr << "Id definition is " << *def << endl;
    // check that it is not a recursive definition
    Tree p = cons(id,lenv);
    // set the definition name property
    if (!getDefNameProperty(def, name)) {
        // if the definition has no name use the identifier
        stringstream s; s << boxpp(id);
        //XXXXXX setDefNameProperty(def, s.str());
    }

    // return the evaluated definition
    return eval(def, addElement(p,visited), nil);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static const char * evalLabel ( const char *  l, Tree  visited, Tree  localValEnv  )

static

evallabel replace "...%2i..." occurences in label with value of i

Definition at line 760 of file eval.cpp.

References isDigitChar(), isIdentChar(), and writeIdentValue().

Referenced by realeval().

{
    //std::cerr << "Eval Label : " << src;

    int             state = 0;  // current state
    std::string     dst;        // label once evaluated
    std::string     ident;      // current identifier
    std::string     format;     // current format

    while (state != -1) {

        char c = *src++;

        if (state == 0) {

            if (c == 0) {
                state = -1;
            } else if (c == '%') {
                ident = "";
                format = "";
                state = 1;
            } else {
                dst+=c;
                state = 0;
            }

        } else if (state == 1) {

            if (c == 0) {
                // fin et pas d'indentifiant, abandon
                dst += '%';
                dst += format;
                state = -1;
            } else if (isDigitChar(c)) {
                format += c;
                state = 1;
            } else if (isIdentChar(c)) {
                ident += c;
                state = 2;
            } else {
                // caractere de ponctuation et pas d'indentifiant, abandon
                dst += '%';
                dst += format;
                src--;
                state = 0;
            }

        } else if (state == 2) {

            if (isIdentChar(c)) {
                ident += c;
                state = 2;
            } else {
                writeIdentValue(dst, format, ident, visited, localValEnv);
                src--;
                state = 0;
            }

        } else {

            std::cerr << "internal error in evallabel : undefined state " << state << std::endl;
            exit(1);
        }
    }

    const char* val = strdup(dst.c_str());
    //std::cerr << "  ===> " << val << std::endl;
    return val;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalPattern ( Tree  pattern, Tree  env  )

static

Evaluates a pattern and simplify it to numerical value if possible.

Definition at line 1308 of file eval.cpp.

References eval(), nil, and patternSimplification().

Referenced by evalPatternList().

{
    Tree p = eval(pattern, nil, env);
    return patternSimplification(p);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalPatternList ( Tree  patterns, Tree  env  )

static

Evaluates each pattern of the list.

Definition at line 1293 of file eval.cpp.

References cons(), evalPattern(), hd(), isNil(), nil, and tl().

Referenced by evalRule().

{
    if (isNil(patterns)) {
        return nil;
    } else {
        return cons(    evalPattern(hd(patterns), env), 
                        evalPatternList(tl(patterns), env)  );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tree evalprocess

(

Tree

eqlist

)

Eval "process" from a list of definitions.

Eval the definition of 'process'.

Strict evaluation of a block diagram expression by applying beta reduction.

Parameters

eqlist

a list of faust defintions forming the the global environment

Returns

the process block diagram in normal form

Definition at line 100 of file eval.cpp.

References a2sb(), boxIdent(), boxSimplification(), eval(), gSimplifyDiagrams, nil, and pushMultiClosureDefs().

Referenced by main().

{
    Tree b = a2sb(eval(boxIdent("process"), nil, pushMultiClosureDefs(eqlist, nil, nil)));

    if (gSimplifyDiagrams) {
        b = boxSimplification(b);
    }

    return b;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalRule ( Tree  rule, Tree  env  )

static

Evaluates the list of patterns and closure the rhs.

Definition at line 1283 of file eval.cpp.

References cons(), evalPatternList(), left(), and right().

Referenced by evalRuleList().

{
    //cerr << "evalRule "<< *rule << " in " << *env << endl;
    return cons(evalPatternList(left(rule), env), right(rule));
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree evalRuleList ( Tree  rules, Tree  env  )

static

Evaluates each rule of the list.

Definition at line 1272 of file eval.cpp.

References cons(), evalRule(), hd(), isNil(), nil, and tl().

Referenced by evalCase().

{
    //cerr << "evalRuleList "<< *rules << " in " << *env << endl;
    if (isNil(rules)) return nil;
    else return cons(evalRule(hd(rules), env), evalRuleList(tl(rules), env));
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool getArgName	(	Tree	t,
		Tree &	id
	)

Definition at line 233 of file eval.cpp.

References autoName().

{
    //return getDefNameProperty(t, id) || autoName(t, id) ;
    return autoName(t, id) ;
}

Here is the call graph for this function:

bool getEvalProperty	(	Tree	box,
		Tree	env,
		Tree &	value
	)

retrieve the value of box in the environment env

Parameters

box	the expression we want to retrieve the value
env	the lexical environment
value	the returned value if any

Returns

true if a value already exist

Definition at line 274 of file eval.cpp.

References EVALPROPERTY, getProperty(), and tree().

Referenced by eval().

{
    return getProperty(box, tree(EVALPROPERTY,env), value);
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool getNumericProperty	(	Tree	t,
		Tree &	num
	)

Definition at line 604 of file eval.cpp.

References getProperty().

Referenced by simplifyPattern().

{
    return getProperty(t, NUMERICPROPERTY, num);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool getPMProperty ( Tree  t, Tree  env, Tree &  pm  )

static

Definition at line 1243 of file eval.cpp.

References getProperty(), PMPROPERTYNODE, and tree().

Referenced by evalCase().

{
    return getProperty(t, tree(PMPROPERTYNODE, env), pm);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tree insideBoxSimplification ( Tree  box )

static

Simplify inside a block-diagram : S[A*B] => S[A]*S[B].

Definition at line 1413 of file eval.cpp.

References boxHGroup(), boxMerge(), boxPar(), boxRec(), boxSeq(), boxSimplification(), boxSplit(), boxSymbolic(), boxTGroup(), boxVGroup(), getUserData(), isBoxButton(), isBoxCheckbox(), isBoxCut(), isBoxFConst(), isBoxFFun(), isBoxFVar(), isBoxHBargraph(), isBoxHGroup(), isBoxHSlider(), isBoxInt(), isBoxMerge(), isBoxNumEntry(), isBoxPar(), isBoxPrim0(), isBoxPrim1(), isBoxPrim2(), isBoxPrim3(), isBoxPrim4(), isBoxPrim5(), isBoxReal(), isBoxRec(), isBoxSeq(), isBoxSlot(), isBoxSplit(), isBoxSymbolic(), isBoxTGroup(), isBoxVBargraph(), isBoxVGroup(), isBoxVSlider(), isBoxWire(), max(), min(), and name().

Referenced by numericBoxSimplification().

{
    int     i;
    double  r;
    prim0   p0;
    prim1   p1;
    prim2   p2;
    prim3   p3;
    prim4   p4;
    prim5   p5;

    Tree    t1, t2, ff, label, cur, min, max, step, type, name, file, slot, body;


    xtended* xt = (xtended*)getUserData(box);

    // Extended Primitives

    if (xt) {
        return box;
    }

    // Numbers and Constants

    else if (isBoxInt(box, &i))     {
        return box;
    }
    else if (isBoxReal(box, &r))    {
        return box;
    }

    else if (isBoxFConst(box, type, name, file))    {
        return box;
    }

    else if (isBoxFVar(box, type, name, file))    {
        return box;
    }

    // Wire and Cut

    else if (isBoxCut(box))                 {
        return box;
    }

    else if (isBoxWire(box))                {
        return box;
    }

    // Primitives

    else if (isBoxPrim0(box, &p0))          {
        return box;
    }

    else if (isBoxPrim1(box, &p1))          {
        return box;
    }

    else if (isBoxPrim2(box, &p2))              {
        return box;
    }

    else if (isBoxPrim3(box, &p3))              {
        return box;
    }

    else if (isBoxPrim4(box, &p4))              {
        return box;
    }

    else if (isBoxPrim5(box, &p5))              {
        return box;
    }

    else if (isBoxFFun(box, ff))                {
        return box;
    }

    // User Interface Widgets

    else if (isBoxButton(box, label))   {
        return box;
    }

    else if (isBoxCheckbox(box, label))     {
        return box;
    }

    else if (isBoxVSlider(box, label, cur, min, max, step))     {
        return box;
    }

    else if (isBoxHSlider(box, label, cur, min, max, step))     {
        return box;
    }

    else if (isBoxNumEntry(box, label, cur, min, max, step))    {
        return box;
    }

    else if (isBoxVBargraph(box, label, min, max))  {
        return box;
    }

    else if (isBoxHBargraph(box, label, min, max))  {
        return box;
    }

    // User Interface Groups

    else if (isBoxVGroup(box, label, t1))   {
        return boxVGroup(label, boxSimplification(t1));
    }

    else if (isBoxHGroup(box, label, t1))   {
        return boxHGroup(label, boxSimplification(t1));
    }

    else if (isBoxTGroup(box, label, t1))   {
        return boxTGroup(label, boxSimplification(t1));
    }

    // Slots and Symbolic Boxes

    else if (isBoxSlot(box))                {
        return box;;
    }

    else if (isBoxSymbolic(box, slot, body)){

        Tree b = boxSimplification(body);
        return boxSymbolic(slot,b);
    }

    // Block Diagram Composition Algebra

    else if (isBoxSeq(box, t1, t2))     {
        Tree s1 = boxSimplification(t1);
        Tree s2 = boxSimplification(t2);
        return boxSeq(s1,s2);
    }

    else if (isBoxPar(box, t1, t2))     {
        Tree s1 = boxSimplification(t1);
        Tree s2 = boxSimplification(t2);
        return boxPar(s1,s2);
    }

    else if (isBoxSplit(box, t1, t2))   {
        Tree s1 = boxSimplification(t1);
        Tree s2 = boxSimplification(t2);
        return boxSplit(s1,s2);
    }

    else if (isBoxMerge(box, t1, t2))   {
        Tree s1 = boxSimplification(t1);
        Tree s2 = boxSimplification(t2);
        return boxMerge(s1,s2);
    }
    else if (isBoxRec(box, t1, t2))     {
        Tree s1 = boxSimplification(t1);
        Tree s2 = boxSimplification(t2);
        return boxRec(s1,s2);
    }

    cout << "ERROR in file " << __FILE__ << ':' << __LINE__ << ", unrecognised box expression : " << *box << endl;
    exit(1);
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool isBoxNumeric ( Tree  in, Tree &  out  )

static

Definition at line 630 of file eval.cpp.

References a2sb(), boxInt(), boxPropagateSig(), boxReal(), getBoxType(), hd(), isBoxInt(), isBoxReal(), isSigInt(), isSigReal(), makeSigInputList(), nil, and simplify().

Referenced by applyList(), patternSimplification(), and simplifyPattern().

{
    int     numInputs, numOutputs;
    double  x;
    int     i;
    Tree    v;

    if (isBoxInt(in, &i) || isBoxReal(in, &x)) {
        out = in;
        return true;
    } else {
        v = a2sb(in);
        if ( getBoxType(v, &numInputs, &numOutputs) && (numInputs == 0) && (numOutputs == 1) ) {
            // potential numerical expression
            Tree lsignals = boxPropagateSig(nil, v , makeSigInputList(numInputs) );
            Tree res = simplify(hd(lsignals));
            if (isSigReal(res, &x))     {
            out = boxReal(x);
            return true;
            }
            if (isSigInt(res, &i))      {
            out = boxInt(i);
            return true;
            }
        }
        return false;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool isBoxPatternOp ( Tree  box, Node &  n, Tree &  t1, Tree &  t2  )

inlinestatic

Definition at line 581 of file eval.cpp.

References isBoxMerge(), isBoxPar(), isBoxRec(), isBoxSeq(), isBoxSplit(), and CTree::node().

Referenced by patternSimplification().

{
    if (    isBoxPar(box, t1, t2) ||
            isBoxSeq(box, t1, t2) ||
            isBoxSplit(box, t1, t2) ||
            isBoxMerge(box, t1, t2) ||
            isBoxRec(box, t1, t2)    )
    {
        n = box->node();
        return true;
    } else {
        return false;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool isDigitChar ( char  c )

static

Definition at line 733 of file eval.cpp.

Referenced by evalLabel().

{
    return (c >= '0') & (c <= '9');
}

Here is the caller graph for this function:

static bool isIdentChar ( char  c )

static

Definition at line 738 of file eval.cpp.

Referenced by evalLabel().

{
    return ((c >= 'a') & (c <= 'z')) || ((c >= 'A') & (c <= 'Z')) || ((c >= '0') & (c <= '9')) || (c == '_');
}

Here is the caller graph for this function:

static Tree iteratePar ( Tree  id, int  num, Tree  body, Tree  visited, Tree  localValEnv  )

static

Iterate a parallel construction.

Iterate a parallel construction such that : par(i,10,E) –> E(i<-0),(E(i<-1),...,E(i<-9))

Parameters

id	the formal parameter of the iteration
num	the number of iterartions
body	the body expression of the iteration
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 845 of file eval.cpp.

References boxPar(), eval(), pushValueDef(), and tree().

Referenced by realeval().

{
    assert (num>0);

    Tree res = eval(body, visited, pushValueDef(id, tree(num-1), localValEnv));
    for (int i = num-2; i >= 0; i--) {
        res = boxPar(eval(body, visited, pushValueDef(id, tree(i), localValEnv)), res);
    }

    return res;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree iterateProd ( Tree  id, int  num, Tree  body, Tree  visited, Tree  localValEnv  )

static

Iterate a product construction.

Iterate a product construction such that : par(i,10,E) –> E(i<-0)*E(i<-1)*...*E(i<-9)

Parameters

id	the formal parameter of the iteration
num	the number of iterartions
body	the body expression of the iteration
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 926 of file eval.cpp.

References boxPar(), boxPrim2(), boxSeq(), eval(), pushValueDef(), sigMul(), and tree().

Referenced by realeval().

{
    assert (num>0);

    Tree res = eval(body, visited, pushValueDef(id, tree(0), localValEnv));

    for (int i = 1; i < num; i++) {
        res = boxSeq(boxPar(res, eval(body, visited, pushValueDef(id, tree(i), localValEnv))),boxPrim2(sigMul)) ;
    }

    return res;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree iterateSeq ( Tree  id, int  num, Tree  body, Tree  visited, Tree  localValEnv  )

static

Iterate a sequential construction.

Iterate a sequential construction such that : seq(i,10,E) –> E(i<-0):(E(i<-1):...:E(i<-9))

Parameters

id	the formal parameter of the iteration
num	the number of iterartions
body	the body expression of the iteration
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions

Returns

a block diagram in normal form

Definition at line 871 of file eval.cpp.

References boxSeq(), eval(), pushValueDef(), and tree().

Referenced by realeval().

{
    assert (num>0);

    Tree res = eval(body, visited, pushValueDef(id, tree(num-1), localValEnv));
    for (int i = num-2; i >= 0; i--) {
        res = boxSeq(eval(body, visited, pushValueDef(id, tree(i), localValEnv)), res);
    }

    return res;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree iterateSum ( Tree  id, int  num, Tree  body, Tree  visited, Tree  localValEnv  )

static

Iterate an addition construction.

Iterate an addition construction such that : par(i,10,E) –> E(i<-0)+E(i<-1)+...+E(i<-9)

Parameters

id	the formal parameter of the iteration
num	the number of iterartions
body	the body expression of the iteration
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 898 of file eval.cpp.

References boxPar(), boxPrim2(), boxSeq(), eval(), pushValueDef(), sigAdd(), and tree().

Referenced by realeval().

{
    assert (num>0);

    Tree res = eval(body, visited, pushValueDef(id, tree(0), localValEnv));

    for (int i = 1; i < num; i++) {
        res = boxSeq(boxPar(res, eval(body, visited, pushValueDef(id, tree(i), localValEnv))),boxPrim2(sigAdd)) ;
    }

    return res;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree larg2par ( Tree  larg )

static

Transform a list of expressions in a parallel construction.

Parameters

larg	list of expressions

Returns

parallel construction

Definition at line 1163 of file eval.cpp.

References boxPar(), evalerror(), hd(), isNil(), tl(), and yyfilename.

Referenced by applyList().

{
    if (isNil(larg)) {
        evalerror(yyfilename, -1, "empty list of arguments", larg);
        exit(1);
    }
    if (isNil(tl(larg))) {
        return hd(larg);
    }
    return boxPar(hd(larg), larg2par(tl(larg)));
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void list2vec ( Tree  l, vector< Tree > &  v  )

static

Definition at line 1315 of file eval.cpp.

References hd(), isNil(), and tl().

Referenced by applyList().

{
    while (!isNil(l)) {
        v.push_back(hd(l));
        l = tl(l);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree listn ( int  n, Tree  e  )

static

Creates a list of n elements.

Parameters

n	number of elements
e	element to be repeated

Returns

[e e e ...] n times

Definition at line 1226 of file eval.cpp.

References cons(), and nil.

Referenced by evalCase().

{
    return (n<= 0) ? nil : cons(e, listn(n-1,e));
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tree numericBoxSimplification ( Tree  box )

static

Try to do a numeric simplification of a block-diagram.

Definition at line 1372 of file eval.cpp.

References boxInt(), boxPropagateSig(), boxReal(), getBoxType(), hd(), insideBoxSimplification(), isBoxInt(), isBoxReal(), isSigInt(), isSigReal(), makeSigInputList(), nil, and simplify().

Referenced by boxSimplification().

{
    int     ins, outs;
    Tree    result;
    int     i;
    double  x;

    if ( ! getBoxType(box, &ins, &outs)) {
        cout << "ERROR in file " << __FILE__ << ':' << __LINE__ << ", Can't compute the box type of : " << *box << endl;
        exit(1);
    }

    if (ins==0 && outs==1) {
        // this box can potentially denote a number
        if (isBoxInt(box, &i) || isBoxReal(box, &x)) {
           result = box;
        } else {
            // propagate signals to discover if it simplifies to a number
            int     i;
            double  x;
            Tree    lsignals = boxPropagateSig(nil, box , makeSigInputList(0));
            Tree    s = simplify(hd(lsignals));

            if (isSigReal(s, &x))   {
                result = boxReal(x);
            } else if (isSigInt(s, &i))     {
                result = boxInt(i);
            } else {
                result = insideBoxSimplification(box);
            }
        }
    } else {
        // this box can't denote a number
        result = insideBoxSimplification(box);
    }
    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree nwires ( int  n )

static

repeat n times a wire

Definition at line 984 of file eval.cpp.

References boxWire(), cons(), and nil.

Referenced by applyList().

{
    Tree l = nil;
    while (n--) { l = cons(boxWire(), l); }
    return l;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree patternSimplification ( Tree  pattern )

static

Definition at line 659 of file eval.cpp.

References isBoxNumeric(), isBoxPatternOp(), and tree().

Referenced by evalPattern().

{   
    
    Node    n(0);
    Tree    v, t1, t2;
    
    if (isBoxNumeric(pattern, v)) {
        return v;
    } else if (isBoxPatternOp(pattern, n, t1, t2)) {
        return tree(n, patternSimplification(t1), patternSimplification(t2));
    } else {
        return pattern;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree real_a2sb ( Tree  exp )

static

Definition at line 154 of file eval.cpp.

References a2sb(), applyList(), CTree::arity(), boxSlot(), boxSymbolic(), CTree::branch(), cons(), eval(), evalerror(), gBoxSlotNumber, getDefNameProperty(), isBoxAbstr(), isBoxEnvironment(), isBoxIdent(), isBoxPatternMatcher(), isBoxWaveform(), isClosure(), CTree::make(), name(), nil, CTree::node(), pushValueDef(), setDefNameProperty(), and yyfilename.

Referenced by a2sb().

{
    Tree abstr, visited, unusedEnv, localValEnv, var, name, body;

    if (isClosure(exp, abstr, unusedEnv, visited, localValEnv)) {

        if (isBoxIdent(abstr)) {
            // special case introduced with access and components
            Tree result = a2sb(eval(abstr, visited, localValEnv));

            // propagate definition name property when needed
            if (getDefNameProperty(exp, name))  setDefNameProperty(result, name);
            return result;

        } else if (isBoxAbstr(abstr, var, body)) {
            // Here we have remaining abstraction that we will try to 
            // transform in a symbolic box by applying it to a slot

            Tree slot = boxSlot(++gBoxSlotNumber); 
            stringstream s; s << boxpp(var);
            setDefNameProperty(slot, s.str() ); // ajout YO
            
            // Apply the abstraction to the slot
            Tree result = boxSymbolic(slot, a2sb(eval(body, visited, pushValueDef(var, slot, localValEnv))));

            // propagate definition name property when needed
            if (getDefNameProperty(exp, name)) setDefNameProperty(result, name);
            return result;

        } else if (isBoxEnvironment(abstr)) {
            return abstr;
    
        } else {
            evalerror(yyfilename, -1, " a2sb : internal error : not an abstraction inside closure ", exp);
            exit(1);
        }
        
    } else if (isBoxPatternMatcher(exp)) {
        // Here we have remaining PM rules that we will try to 
        // transform in a symbolic box by applying it to a slot
        
        Tree slot = boxSlot(++gBoxSlotNumber);          
        stringstream s; s << "PM" << gBoxSlotNumber;
        setDefNameProperty(slot, s.str() ); 
        
        // apply the PM rules to the slot and transfoms the result in a symbolic box
        Tree result = boxSymbolic(slot, a2sb(applyList(exp, cons(slot,nil))));

        // propagate definition name property when needed
        if (getDefNameProperty(exp, name)) setDefNameProperty(result, name);
        return result;

    } else if (isBoxWaveform(exp)) {
        // A waveform is always in Normal Form, nothing to evaluate
        return exp;

    } else {
        // it is a constructor : transform each branches
        unsigned int    ar = exp->arity();
        tvec            B(ar);
        bool            modified = false;
        for (unsigned int i = 0; i < ar; i++) {
            Tree b = exp->branch(i);
            Tree m = a2sb(b);
            B[i] = m;
            if (b != m) modified=true;
        }
        Tree r = (modified) ? CTree::make(exp->node(), B) : exp;
        return r;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree realeval ( Tree  exp, Tree  visited, Tree  localValEnv  )

static

Eval a block diagram expression.

Strict evaluation of a block diagram expression by applying beta reduction.

Parameters

exp	the expression to evaluate
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Definition at line 308 of file eval.cpp.

References a2sb(), applyList(), boxButton(), boxCheckbox(), boxEnvironment(), boxHBargraph(), boxHGroup(), boxHSlider(), boxIdent(), boxInt(), boxMerge(), boxNumEntry(), boxPar(), boxRec(), boxSeq(), boxSplit(), boxTGroup(), boxVBargraph(), boxVGroup(), boxVSlider(), closure(), copyEnvReplaceDefs(), eval(), eval2double(), eval2int(), evalCase(), evalerror(), evalIdDef(), evalLabel(), SourceReader::expandlist(), getBoxType(), getDefFileProp(), getDefLineProp(), SourceReader::getlist(), getUserData(), isBoxAbstr(), isBoxAccess(), isBoxAppl(), isBoxButton(), isBoxCase(), isBoxCheckbox(), isBoxComponent(), isBoxCut(), isBoxEnvironment(), isBoxFConst(), isBoxFFun(), isBoxFVar(), isBoxHBargraph(), isBoxHGroup(), isBoxHSlider(), isBoxIdent(), isBoxInputs(), isBoxInt(), isBoxIPar(), isBoxIProd(), isBoxISeq(), isBoxISum(), isBoxLibrary(), isBoxMerge(), isBoxModifLocalDef(), isBoxNumEntry(), isBoxOutputs(), isBoxPar(), isBoxPatternMatcher(), isBoxPatternVar(), isBoxPrim0(), isBoxPrim1(), isBoxPrim2(), isBoxPrim3(), isBoxPrim4(), isBoxPrim5(), isBoxReal(), isBoxRec(), isBoxSeq(), isBoxSlot(), isBoxSplit(), isBoxSymbolic(), isBoxTGroup(), isBoxVBargraph(), isBoxVGroup(), isBoxVSlider(), isBoxWaveform(), isBoxWire(), isBoxWithLocalDef(), isClosure(), iteratePar(), iterateProd(), iterateSeq(), iterateSum(), nil, pushMultiClosureDefs(), revEvalList(), setDefNameProperty(), setUnion(), tree(), and tree2str().

Referenced by eval().

{
    //Tree  def;
    Tree    fun;
    Tree    arg;
    Tree    var, num, body, ldef;
    Tree    label;
    Tree    cur, lo, hi, step;
    Tree    e1, e2, exp2, notused, visited2, lenv2;
    Tree    rules;
    Tree    id;

    //cerr << "EVAL " << *exp << " (visited : " << *visited << ")" << endl;
    //cerr << "REALEVAL of " << *exp << endl;
    
    xtended* xt = (xtended*) getUserData(exp);


    // constants
    //-----------
    
    if (    xt || 
            isBoxInt(exp) || isBoxReal(exp) || 
            isBoxWire(exp) || isBoxCut(exp) ||
            isBoxPrim0(exp) || isBoxPrim1(exp) || 
            isBoxPrim2(exp) || isBoxPrim3(exp) || 
            isBoxPrim4(exp) || isBoxPrim5(exp) ||
            isBoxFFun(exp) || isBoxFConst(exp) || isBoxFVar(exp) ||
            isBoxWaveform(exp)) {
        return exp;

    // block-diagram constructors
    //---------------------------
    
    } else if ( isBoxSeq(exp, e1, e2) ) {
        return boxSeq(eval(e1, visited, localValEnv), eval(e2, visited, localValEnv));

    } else if ( isBoxPar(exp, e1, e2) ) {
        return boxPar(eval(e1, visited, localValEnv), eval(e2, visited, localValEnv));

    } else if ( isBoxRec(exp, e1, e2) ) {
        return boxRec(eval(e1, visited, localValEnv), eval(e2, visited, localValEnv));

    } else if ( isBoxSplit(exp, e1, e2) ) {
        return boxSplit(eval(e1, visited, localValEnv), eval(e2, visited, localValEnv));

    } else if ( isBoxMerge(exp, e1, e2) ) {
        return boxMerge(eval(e1, visited, localValEnv), eval(e2, visited, localValEnv));
        
    // Modules
    //--------

    } else if (isBoxAccess(exp, body, var)) {
        Tree val = eval(body, visited, localValEnv);
        if (isClosure(val, exp2, notused, visited2, lenv2)) {
            // it is a closure, we have an environment to access
            return eval(closure(var,notused,visited2,lenv2), visited, localValEnv);
        } else {
            evalerror(getDefFileProp(exp), getDefLineProp(exp), "No environment to access ", exp);
            exit(1);
        }


    } else if (isBoxModifLocalDef(exp, body, ldef)) {
        Tree val = eval(body, visited, localValEnv);
        if (isClosure(val, exp2, notused, visited2, lenv2)) {
            // we rebuild the closure using a copy of the original environment
            // modified with some new definitions
            Tree lenv3 = copyEnvReplaceDefs(lenv2, ldef, visited2, localValEnv);
            return eval(closure(exp2,notused,visited2,lenv3), visited, localValEnv);
        } else {

            evalerror(getDefFileProp(exp), getDefLineProp(exp), "not a closure ", val);
            evalerror(getDefFileProp(exp), getDefLineProp(exp), "No environment to access ", exp);
            exit(1);
        }


    } else if (isBoxComponent(exp, label)) {
        string  fname   = tree2str(label);
        Tree    eqlst   = gReader.expandlist(gReader.getlist(fname));
        Tree    res     = closure(boxIdent("process"), nil, nil, pushMultiClosureDefs(eqlst, nil, nil));
        setDefNameProperty(res, label);
        //cerr << "component is " << boxpp(res) << endl;
        return res;

    } else if (isBoxLibrary(exp, label)) {
        string  fname   = tree2str(label);
        Tree    eqlst   = gReader.expandlist(gReader.getlist(fname));
        Tree    res     = closure(boxEnvironment(), nil, nil, pushMultiClosureDefs(eqlst, nil, nil));
        setDefNameProperty(res, label);
        //cerr << "component is " << boxpp(res) << endl;
        return res;


    // user interface elements
    //------------------------
    
    } else if (isBoxButton(exp, label)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        //cout << "button label : " << l1 << " become " << l2 << endl;
        return ((l1 == l2) ? exp : boxButton(tree(l2)));

    } else if (isBoxCheckbox(exp, label)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        //cout << "check box label : " << l1 << " become " << l2 << endl;
        return ((l1 == l2) ? exp : boxCheckbox(tree(l2)));

    } else if (isBoxVSlider(exp, label, cur, lo, hi, step)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return ( boxVSlider(tree(l2),
                    tree(eval2double(cur, visited, localValEnv)),
                    tree(eval2double(lo, visited, localValEnv)),
                    tree(eval2double(hi, visited, localValEnv)),
                    tree(eval2double(step, visited, localValEnv))));

    } else if (isBoxHSlider(exp, label, cur, lo, hi, step)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return ( boxHSlider(tree(l2),
                    tree(eval2double(cur, visited, localValEnv)),
                    tree(eval2double(lo, visited, localValEnv)),
                    tree(eval2double(hi, visited, localValEnv)),
                    tree(eval2double(step, visited, localValEnv))));

    } else if (isBoxNumEntry(exp, label, cur, lo, hi, step)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return (boxNumEntry(tree(l2),
                    tree(eval2double(cur, visited, localValEnv)),
                    tree(eval2double(lo, visited, localValEnv)),
                    tree(eval2double(hi, visited, localValEnv)),
                    tree(eval2double(step, visited, localValEnv))));

    } else if (isBoxVGroup(exp, label, arg)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return boxVGroup(tree(l2),  eval(arg, visited, localValEnv) );

    } else if (isBoxHGroup(exp, label, arg)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return boxHGroup(tree(l2),  eval(arg, visited, localValEnv) );

    } else if (isBoxTGroup(exp, label, arg)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return boxTGroup(tree(l2),  eval(arg, visited, localValEnv) );

    } else if (isBoxHBargraph(exp, label, lo, hi)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return boxHBargraph(tree(l2),
                    tree(eval2double(lo, visited, localValEnv)),
                    tree(eval2double(hi, visited, localValEnv)));

    } else if (isBoxVBargraph(exp, label, lo, hi)) {
        const char* l1 = tree2str(label);
        const char* l2= evalLabel(l1, visited, localValEnv);
        return boxVBargraph(tree(l2),
                    tree(eval2double(lo, visited, localValEnv)),
                    tree(eval2double(hi, visited, localValEnv)));

    // lambda calculus
    //----------------
        
    } else if (isBoxIdent(exp)) {
        return evalIdDef(exp, visited, localValEnv);

    } else if (isBoxWithLocalDef(exp, body, ldef)) {
        return eval(body, visited, pushMultiClosureDefs(ldef, visited, localValEnv));
    
    } else if (isBoxAppl(exp, fun, arg)) {
        return applyList( eval(fun, visited, localValEnv),
                          revEvalList(arg, visited, localValEnv) );

    } else if (isBoxAbstr(exp)) {
        // it is an abstraction : return a closure
        return closure(exp, nil, visited, localValEnv);

    } else if (isBoxEnvironment(exp)) {
        // environment : return also a closure
        return closure(exp, nil, visited, localValEnv);

    } else if (isClosure(exp, exp2, notused, visited2, lenv2)) {

        if (isBoxAbstr(exp2)) {
            // a 'real' closure
            return closure(exp2, nil, setUnion(visited,visited2), lenv2);
        } else if (isBoxEnvironment(exp2)) {
            // a 'real' closure
            return closure(exp2, nil, setUnion(visited,visited2), lenv2);
        } else {
            // it was a suspended evaluation
            return eval(exp2, setUnion(visited,visited2), lenv2);
        }

    // Algorithmic constructions
    //--------------------------
    
    } else if (isBoxIPar(exp, var, num, body)) {
        int n = eval2int(num, visited, localValEnv);
        return iteratePar(var, n, body, visited, localValEnv);

    } else if (isBoxISeq(exp, var, num, body)) {
        int n = eval2int(num, visited, localValEnv);
        return iterateSeq(var, n, body, visited, localValEnv);

    } else if (isBoxISum(exp, var, num, body)) {
        int n = eval2int(num, visited, localValEnv);
        return iterateSum(var, n, body, visited, localValEnv);

    } else if (isBoxIProd(exp, var, num, body)) {
        int n = eval2int(num, visited, localValEnv);
        return iterateProd(var, n, body, visited, localValEnv);

    // static
    } else if (isBoxInputs(exp, body)) {
        int ins, outs;
        Tree b = a2sb(eval(body, visited, localValEnv));
        if (getBoxType (b, &ins, &outs)) {
            return boxInt(ins);
        } else {
            cerr << "ERROR : can't evaluate ' : " << *exp << endl;
            assert(false);
        }

    } else if (isBoxOutputs(exp, body)) {
        int ins, outs;
        Tree b = a2sb(eval(body, visited, localValEnv));
        if (getBoxType (b, &ins, &outs)) {
            return boxInt(outs);
        } else {
            cerr << "ERROR : can't evaluate ' : " << *exp << endl;
            assert(false);
        }


    } else if (isBoxSlot(exp))      { 
        return exp; 
    
    } else if (isBoxSymbolic(exp))  {
     
        return exp;
    

    // Pattern matching extension
    //---------------------------
    
    } else if (isBoxCase(exp, rules)) {
        return evalCase(rules, localValEnv);

    } else if (isBoxPatternVar(exp, id)) {
        return exp;
        //return evalIdDef(id, visited, localValEnv);

    } else if (isBoxPatternMatcher(exp)) {
        return exp;

    } else {
        cerr << "ERROR : EVAL don't intercept : " << *exp << endl;
        assert(false);
    }
    return NULL;
}

Here is the caller graph for this function:

static Tree revEvalList ( Tree  lexp, Tree  visited, Tree  localValEnv  )

static

Eval a list of expression in reverse order.

Eval a list of expressions returning the list of results in reverse order.

Parameters

lexp	list of expressions to evaluate
globalDefEnv	the global environment
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

list of evaluated expressions in reverse order

Definition at line 1141 of file eval.cpp.

References cons(), eval(), hd(), isNil(), nil, and tl().

Referenced by realeval().

{
    Tree result = nil;
    //Tree lexp_orig = lexp;
    //cerr << "ENTER revEvalList(" << *lexp_orig << ", env:" << *localValEnv << ")" << endl;
    while (!isNil(lexp)) {
        result = cons(eval(hd(lexp), visited, localValEnv), result);
        lexp = tl(lexp);
    }

    //cerr << "EXIT revEvalList(" << *lexp_orig << ", env:" << *localValEnv << ") -> " << *result << endl;
    return result;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void setEvalProperty	(	Tree	box,
		Tree	env,
		Tree	value
	)

set the value of box in the environment env

Parameters

box	the block diagram we have evaluated
env	the evaluation environment
value	the evaluated block diagram

Definition at line 261 of file eval.cpp.

References EVALPROPERTY, setProperty(), and tree().

Referenced by eval().

{
    setProperty(box, tree(EVALPROPERTY,env), value);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void setNumericProperty	(	Tree	t,
		Tree	num
	)

Definition at line 599 of file eval.cpp.

References setProperty().

Referenced by simplifyPattern().

{
    setProperty(t, NUMERICPROPERTY, num);
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void setPMProperty ( Tree  t, Tree  env, Tree  pm  )

static

Definition at line 1238 of file eval.cpp.

References PMPROPERTYNODE, setProperty(), and tree().

Referenced by evalCase().

{
    setProperty(t, tree(PMPROPERTYNODE, env), pm);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Tree simplifyPattern

(

Tree

value

)

Simplify a block-diagram pattern by computing its numerical sub-expressions.

Parameters

pattern

an evaluated block-diagram

Returns

a simplified pattern

Definition at line 617 of file eval.cpp.

References getNumericProperty(), isBoxNumeric(), and setNumericProperty().

Referenced by apply_pattern_matcher_internal().

{
    Tree num;
    if (!getNumericProperty(value,num)) {
        if (!isBoxNumeric(value,num)) {
            num = value;
        }
        setNumericProperty(value,num);
    }
    return num;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static Tree vec2list ( const vector< Tree > &  v )

static

Definition at line 1324 of file eval.cpp.

References cons(), and nil.

Referenced by applyList().

{
    Tree l = nil;
    int  n = (int)v.size();
    while (n--) { l = cons(v[n],l); }
    return l;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static void writeIdentValue ( std::string &  dst, const std::string &  format, const std::string &  ident, Tree  visited, Tree  localValEnv  )

static

Definition at line 745 of file eval.cpp.

References boxIdent(), eval2int(), max(), and min().

Referenced by evalLabel().

{
    int     f = atoi(format.c_str());
    int     n = eval2int(boxIdent(ident.c_str()), visited, localValEnv);
    int     i = min(4,max(f,0));
    char    val[256];
    
    snprintf(val, 250, Formats[i], n);
    dst += val;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

Node EVALPROPERTY(symbol("EvalProperty"))

static

Referenced by getEvalProperty(), and setEvalProperty().

const char* Formats[] = {"%d", "%1d", "%2d", "%3d", "%4d"}

Definition at line 743 of file eval.cpp.

int gBoxSlotNumber = 0

static

counter for unique slot number

Definition at line 152 of file eval.cpp.

Referenced by real_a2sb().

int gMaxNameSize

Definition at line 127 of file main.cpp.

SourceReader gReader

Definition at line 89 of file main.cpp.

Referenced by main().

bool gSimpleNames

Definition at line 128 of file main.cpp.

Referenced by applyList(), and process_cmdline().

bool gSimplifyDiagrams

Definition at line 129 of file main.cpp.

Referenced by evalprocess(), and process_cmdline().

property<Tree> gSymbolicBoxProperty

Transform unused (unapplied) closures into symbolic boxes.

Parameters

exp	the expression to transform

Returns

an expression where abstractions have been replaced by symbolic boxes

Definition at line 131 of file eval.cpp.

loopDetector LD(1024, 512)

static

Eval a block diagram expression.

Wrap the realeval function in order to propagate the name property

Parameters

exp	the expression to evaluate
visited	list of visited definition to detect recursive definitions
localValEnv	the local environment

Returns

a block diagram in normal form

Referenced by eval().

Tree NUMERICPROPERTY = tree(symbol("NUMERICPROPERTY"))

Definition at line 597 of file eval.cpp.

Node PMPROPERTYNODE(symbol("PMPROPERTY"))

static

A property to store the pattern matcher corresponding to a set of rules in a specific environement.

Referenced by getPMProperty(), and setPMProperty().

property<Tree> SimplifiedBoxProperty

static

Definition at line 1339 of file eval.cpp.