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
|
/************************************************************************
************************************************************************
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 __LOOPDETECTOR__
#define __LOOPDETECTOR__
/**
* \file loopDetector.hh
*
* Detect evaluation loops
*
*
**/
#include "boxes.hh"
#include "sourcereader.hh"
class loopDetector
{
const int fBuffersize;
const int fCheckperiod;
vector<Tree> fBuffer;
int fPhase;
public:
loopDetector(int buffersize, int checkperiod) : fBuffersize(buffersize), fCheckperiod(checkperiod), fBuffer(buffersize), fPhase(fBuffersize) {}
bool detect (Tree t);
private:
Tree get (int n) { return fBuffer[(fPhase-n)%fBuffersize]; }
void listPossibleCycles (vector<int>& v);
bool isCycle (int period);
};
#endif
|
