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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/************************************************************************
************************************************************************
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.
************************************************************************
************************************************************************/
/*****************************************************************************
******************************************************************************
FAUST SIGNAL COMPILER
Y. Orlarey, (c) Grame 2002
------------------------------------------------------------------------------
Compile a list of FAUST signals into a LaTeX equation.
History :
---------
2002-02-08 : First version (of sharing.cpp)
2009-08-18 : Doc version (Karim Barkati)
******************************************************************************
*****************************************************************************/
#include <stdio.h>
#include "doc_compile.hh"
#include "sigprint.hh"
#include "sigtype.hh"
#include "sigtyperules.hh"
using namespace std;
/*****************************************************************************
******************************************************************************
SHARING ANALYSIS
******************************************************************************
*****************************************************************************/
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
int DocCompiler::getSharingCount(Tree sig)
{
Tree c;
if (getProperty(sig, fSharingKey, c)) {
return c->node().getInt();
} else {
return 0;
}
}
void DocCompiler::setSharingCount(Tree sig, int count)
{
setProperty(sig, fSharingKey, tree(count));
}
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
void DocCompiler::sharingAnalysis(Tree t)
{
fSharingKey = shprkey(t);
if (isList(t)) {
while (isList(t)) {
sharingAnnotation(kSamp, hd(t));
t = tl(t);
}
} else {
sharingAnnotation(kSamp, t);
}
}
//------------------------------------------------------------------------------
// Create a specific property key for the sharing count of subtrees of t
//------------------------------------------------------------------------------
void DocCompiler::sharingAnnotation(int vctxt, Tree sig)
{
// cerr << "START sharing annotation of " << *sig << endl;
int count = getSharingCount(sig);
if (count > 0) {
// it is not our first visit
setSharingCount(sig, count + 1);
} else {
// it is our first visit,
int v = getCertifiedSigType(sig)->variability();
// check "time sharing" cases
if (v < vctxt) {
setSharingCount(sig,
2); // time sharing occurence : slower expression in faster context
} else {
setSharingCount(sig, 1); // regular occurence
}
// Annotate the sub signals
tvec subsig;
int n = getSubSignals(sig, subsig);
if (n > 0 && !isSigGen(sig)) {
for (int i = 0; i < n; i++) {
sharingAnnotation(v, subsig[i]);
}
}
}
// cerr << "END sharing annotation of " << *sig << endl;
}
|
