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
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2024 INRIA: Institut national de recherche en sciences
et technologies du numérique
---------------------------------------------------------------------
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.
************************************************************************
************************************************************************/
/************************************************************************
* @file sigRecursiveDependencies.hh
* @author Yann Orlarey (yann.orlarey@inria.fr)
* @brief Compute and check the recursive dependencies of a signal
* @version 0.1
* @date 2024-03-15
*
* @copyright Copyright (c) 2024 INRIA
*
***********************************************************************/
#pragma once
#include <set>
#include "signals.hh"
/**
* @brief compute the set of dependencies of a signal
*
* @param sig
* @return std::set<Tree>
*/
std::set<Tree> signalDependencies(Tree sig);
/**
* @brief true if signal is a recursive projection that depends on itself, false otherwise
*
* @param proj
* @return true
* @return false
*/
bool isSignalRecursive(Tree proj);
/**
* @brief true if sig depends on dep, false otherwise
*
* @param sig
* @param dep
* @return true
* @return false
*/
bool isDependingOn(Tree sig, Tree dep);
/**
* @brief get the definition of a projection
*
* @param proj
* @return its definition
*/
Tree getProjDefinition(Tree proj);
/**
* @brief iterate to reach the final definition of a projection
*
* @param proj
* @return its final definition
*/
Tree getProjFinalDefinition(Tree proj);
/**
* @brief print the dependencies of a signal
*
* @param msg
* @param sig
*/
void printDependencies(const std::string& msg, Tree sig);
|
