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
|
/************************************************************************
************************************************************************
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.
************************************************************************
************************************************************************/
#include <cmath>
#include "exception.hh"
#include "loopDetector.hh"
#include "ppbox.hh"
using namespace std;
bool loopDetector::detect(Tree t)
{
fPhase++;
int w = fPhase % fBuffersize;
fBuffer[w] = t;
if ((fPhase % fCheckperiod) == 0) {
// time to check for a cycle
for (int i = 1; i < fBuffersize; i++) {
int r = w - i;
if (r < 0) {
r += fBuffersize;
}
faustassert(r >= 0);
faustassert(r < fBuffersize);
faustassert(r != w);
if (fBuffer[r] == t) {
stringstream error;
error << "ERROR : after " << fPhase
<< " evaluation steps, the compiler has detected an endless evaluation cycle "
"of "
<< i << " steps\n";
throw faustexception(error.str());
}
}
}
return false;
}
void stackOverflowDetector::detect()
{
int stack = 0;
void* cur_address = &stack;
if (fFirstCall) {
fFirstCall = false;
fFirstStackAddress = cur_address;
} else {
long long current_stack_size = (long long)fFirstStackAddress - (long long)cur_address;
if (std::abs(current_stack_size - fMaxStackSize) < STACK_FRAME) {
throw faustexception("ERROR : stack overflow in eval\n");
}
}
}
|
