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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
import javax.xml.xpath.XPathConstants;
import javax.xml.xpath.XPathExpression;
import javax.xml.xpath.XPathExpressionException;
import java.util.Stack;
/* Sequential Statement Chain Node */
/* Not actually a node in the resulting model, though. */
public class VHDLSSCNode extends VHDLNode
{
private static final XPathExpression XPE_FIND_SUB_NODES;
private final IDs prev_node;
static
{
XPE_FIND_SUB_NODES = XMLManager.compile_or_die("./el");
}
public VHDLSSCNode
(
final OutputFile output,
final IDs parent_id,
final Node xml_node,
final IDs prev_node, /* can't simply forward ref to SSC */
final IDs next_node,
final int depth,
final String[] attributes
)
{
super
(
output,
parent_id,
xml_node,
next_node,
depth,
attributes
);
this.prev_node = prev_node; /* null when first node of the process */
}
@Override
public void parse
(
final Stack<ParsableXML> waiting_list
)
throws XPathExpressionException
{
final NodeList sub_nodes;
final int intermediary_nodes_count;
int i;
/* Find all the nodes, in order, in this instruction chain */
sub_nodes =
(NodeList) XPE_FIND_SUB_NODES.evaluate
(
xml_node,
XPathConstants.NODESET
);
/* Don't handle the last node in the 'for' loop, see below. */
intermediary_nodes_count = (sub_nodes.getLength() - 1);
for (i = 0; i < intermediary_nodes_count; ++i)
{
/* Prepare the parsing of all those nodes throufh the waiting list.
* To do so, each node needs to be informed of the ID of the node that
* follows it.
*/
final IDs next_seq_node;
/* Get the ID for the next node in the sequence */
next_seq_node =
IDs.get_id_from_xml_id
(
output,
XMLManager.get_attribute
(
sub_nodes.item(i + 1),
"id"
),
"node"
);
/*
* Add to the waiting list, 'i' indicates if the attributes inherited
* by the instruction sequence node should be passed along (it's only
* the case if i == 0).
*/
waiting_list.push(get_vhdl_node(sub_nodes.item(i), next_seq_node, i));
}
/*
* The last node of the sequence takes the node following the sequence
* as 'next_node', so it's handled separatly.
*/
waiting_list.push(get_vhdl_node(sub_nodes.item(i), next_node, i));
/* Handle the connection of the first node to the previous node. */
handle_backward_connection(sub_nodes.item(0));
}
private ParsableXML get_vhdl_node
(
final Node node,
final IDs next_node,
final int i
)
{
final String node_kind;
final String[] attributes;
node_kind = XMLManager.get_attribute(node, "kind");
if (i == 0)
{
/* Attributes are only inherited by the first node */
attributes = this.attributes;
}
else
{
attributes = new String[0];
}
if (node_kind.equals("if_statement"))
{
return
new VHDLISNode
(
output,
parent_id,
node,
next_node,
depth,
attributes
);
}
else if (node_kind.equals("simple_signal_assignment_statement"))
{
return
new VHDLSSASNode
(
output,
parent_id,
node,
next_node,
depth,
attributes
);
}
else if (node_kind.equals("case_statement"))
{
return
new VHDLCSNode
(
output,
parent_id,
node,
next_node,
depth,
attributes
);
}
System.err.println
(
"[E] Unimplemented instruction kind \""
+ node_kind
+ "\" found in Sequential Statement Chain."
);
System.exit(-1);
return null;
}
private void handle_backward_connection
(
final Node first_node
)
{
final IDs first_node_id;
first_node_id =
IDs.get_id_from_xml_id
(
output,
XMLManager.get_attribute
(
first_node,
"id"
),
"node"
);
if (prev_node == null)
{
/* First node of the process */
Predicates.add_entry
(
output,
"is_start_node",
first_node_id,
parent_id
);
}
else
{
/*
* Not the first node, so have the previous node connect to this one
* (which is the first of this instruction set).
*/
Predicates.add_entry
(
output,
"node_connect",
prev_node,
first_node_id
);
}
}
}
|
