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
|
/* $Id$
*
* Transform concurrent signal assignment statements into equivalent
* processes.
*
* Copyright (C) 2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include <cassert>
#include "frontend/visitor/TransformSigAssign.hpp"
#include "frontend/ast/Architecture.hpp"
#include "frontend/ast/CondalSigAssign.hpp"
#include "frontend/ast/SigAssignStat.hpp"
#include "frontend/ast/Process.hpp"
#include "frontend/ast/WaitStat.hpp"
#include "frontend/ast/Process.hpp"
#include "frontend/ast/NodeFactory.hpp"
namespace ast {
void
TransformSigAssign::visit(Architecture &node)
{
if (node.concurrentStats == NULL) {
return;
}
this->workList = node.concurrentStats;
this->listTraverse(*node.concurrentStats, this->deleteFlag);
this->workList = NULL;
}
void
TransformSigAssign::visit(CondalSigAssign &node)
{
assert(this->workList != NULL);
assert(node.assignStat != NULL);
this->pickupSignals = true;
node.assignStat->accept(*this);
// generate proces...
std::list<Name *> *sl = new std::list<Name *>();
sl->insert(sl->end(), this->sensitivities.begin(),
this->sensitivities.end());
WaitStat *ws = new WaitStat(
sl,
NULL,
NULL,
node.location);
std::list<SeqStat*> *transformed = new std::list<SeqStat*>();
transformed->push_back(node.assignStat);
transformed->push_back(ws);
Process *p = new Process(NULL,
new std::list<SymbolDeclaration*>(),
transformed,
node.location);
// FIXME name!
this->workList->push_front(p);
this->sensitivities.clear();
this->pickupSignals = false;
this->deleteFlag = true;
}
void
TransformSigAssign::visit(SigAssignStat &node)
{
// don't traverse to target, that's already set.
if (node.waveForm == NULL) {
return;
}
// pick up any signal in the waveForm so that it can be
// added to the sensitivity set. (anything apart from a time
// expression)
this->listTraverse(*node.waveForm);
}
void
TransformSigAssign::visit(WaveFormElem &node)
{
if (node.value != NULL) {
node.value->accept(*this);
}
}
void
TransformSigAssign::visit(SimpleName &node)
{
if (! this->pickupSignals) {
return;
}
if (! node.isSignal()) {
return;
}
if (! util::MiscUtil::listContainsObj(this->sensitivities, &node)) {
this->sensitivities.push_back(&node);
}
}
}; /* namespace ast */
|
