Newer
Older
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
package ui.GraphLatencyAnalysis;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.assertTrue;
import java.io.File;
import java.util.HashMap;
import java.util.Vector;
import java.util.Map.Entry;
import org.junit.Before;
import org.junit.Test;
import ui.TMLArchiPanel;
import ui.interactivesimulation.SimulationTransaction;
import ui.simulationtraceanalysis.DirectedGraphTranslator;
import ui.simulationtraceanalysis.JFrameLatencyDetailedAnalysis;
import ui.simulationtraceanalysis.latencyDetailedAnalysisMain;
import ui.AbstractUITest;
import ui.SimulationTrace;
public class NestedStructurePLAN extends AbstractUITest {
private static final String mappingDiagName = "Architecture";
private static final String INPUT_PATH = "/ui/graphLatencyAnalysis/input";
private static final String simulationTracePathFile = INPUT_PATH + "/loopseqTrace.xml";
private static final String modelPath = INPUT_PATH + "/loopseqgraph.xml";
private latencyDetailedAnalysisMain latencyDetailedAnalysisMain;
private JFrameLatencyDetailedAnalysis latencyDetailedAnalysis;
private static DirectedGraphTranslator dgt;
private Vector<SimulationTransaction> transFile1;
private HashMap<String, Integer> checkedDropDown = new HashMap<String, Integer>();
private static final int operator1ID = 69;
private static final int operator2ID = 53;
private static String task1;
private static String task2;
private static Object[][] allLatencies;
@Before
public void NestedStructurePLAN() throws InterruptedException {
mainGUI.openProjectFromFile(new File(getBaseResourcesDir() + modelPath));
// mainGUI.openProjectFromFile(new File(modelPath));
final TMLArchiPanel panel = findArchiPanel(mappingDiagName);
if (panel == null) {
System.out.println("NULL Panel");
} else {
System.out.println("Non NULL Panel");
}
mainGUI.checkModelingSyntax(panel, true);
SimulationTrace file2 = new SimulationTrace("graphTestSimulationTrace", 6, simulationTracePathFile);
latencyDetailedAnalysisMain = new latencyDetailedAnalysisMain(3, mainGUI, file2, false, false, 3);
latencyDetailedAnalysisMain.latencyDetailedAnalysis(file2, panel, false, false, mainGUI);
latencyDetailedAnalysis = latencyDetailedAnalysisMain.getLatencyDetailedAnalysis();
if (latencyDetailedAnalysis != null) {
latencyDetailedAnalysis.setVisible(false);
try {
latencyDetailedAnalysis.getT().join();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
dgt = latencyDetailedAnalysis.getDgraph();
}
}
@Test
public void parseFile() {
assertNotNull(latencyDetailedAnalysis);
int graphsize = dgt.getGraphsize();
assertTrue(graphsize == 57);
// test sequence to all its nexts
assertTrue(dgt.edgeExists(66, 65));
assertTrue(dgt.edgeExists(66, 63));
// test sequence branch to another
assertTrue(dgt.edgeExists(64, 63));
assertTrue(dgt.edgeExists(63, 62));
// test ordered sequence
assertTrue(dgt.edgeExists(62, 61));
assertTrue(dgt.edgeExists(62, 60));
// test nested sequence to unordered sequence
assertTrue(dgt.edgeExists(57, 60));
assertTrue(dgt.edgeExists(68, 60));
// test unordered sequence nexts
assertTrue(dgt.edgeExists(61, 67));
assertTrue(dgt.edgeExists(61, 58));
assertTrue(dgt.edgeExists(68, 58));
assertTrue(dgt.edgeExists(57, 67));
// test ordered sequence nexts
assertTrue(dgt.edgeExists(26, 25));
assertTrue(dgt.edgeExists(26, 21));
assertTrue(dgt.edgeExists(26, 23));
// test ordered sequence ends
assertTrue(dgt.edgeExists(24, 21));
// nested seq loop
assertTrue(dgt.edgeExists(27, 23));
assertTrue(dgt.edgeExists(30, 36));
assertTrue(dgt.edgeExists(29, 36));
// inside loop only connected to loop vertex
assertFalse(dgt.edgeExists(30, 22));
assertFalse(dgt.edgeExists(29, 22));
// sequence last branch end not connected to other branches
assertFalse(dgt.edgeExists(22, 25));
assertFalse(dgt.edgeExists(22, 21));
// sequence branches not connected backward
assertFalse(dgt.edgeExists(27, 25));
// loop for ever edges+ nested loops and seq
assertTrue(dgt.edgeExists(44, 49));
assertTrue(dgt.edgeExists(44, 51));
assertTrue(dgt.edgeExists(44, 53));
assertTrue(dgt.edgeExists(43, 42));
assertTrue(dgt.edgeExists(43, 41));
assertTrue(dgt.edgeExists(45, 41));
assertTrue(dgt.edgeExists(40, 49));
assertTrue(dgt.edgeExists(48, 54));
assertTrue(dgt.edgeExists(48, 51));
assertTrue(dgt.edgeExists(48, 53));
assertTrue(dgt.edgeExists(50, 49));
assertTrue(dgt.edgeExists(50, 53));
assertTrue(dgt.edgeExists(50, 54));
assertTrue(dgt.edgeExists(52, 51));
assertTrue(dgt.edgeExists(52, 49));
assertTrue(dgt.edgeExists(52, 54));
assertFalse(dgt.edgeExists(40, 54));
assertFalse(dgt.edgeExists(40, 42));
transFile1 = latencyDetailedAnalysisMain.getLatencyDetailedAnalysis().parseFile(new File(getBaseResourcesDir() + simulationTracePathFile));
// transFile1 =
// latencyDetailedAnalysisMain.getLatencyDetailedAnalysis().parseFile(new
// File(simulationTracePathFile));
assertTrue(transFile1.size() == 38);
checkedDropDown = latencyDetailedAnalysis.getCheckedT();
for (Entry<String, Integer> cT : checkedDropDown.entrySet()) {
int id = cT.getValue();
String taskName = cT.getKey();
if (id == operator1ID) {
task1 = taskName;
} else if (id == operator2ID) {
task2 = taskName;
}
}
// int i = dropDown.indexOf(checkedDropDown.get);
// int j = dropDown.indexOf(t2);
// task1 = dropDown.get(i);
// task2 = dropDown.get(j);
allLatencies = dgt.latencyDetailedAnalysis(task1, task2, transFile1, false, false);
assertTrue(allLatencies.length == 1);
assertTrue((int) allLatencies[0][1] == 60);
assertTrue((int) allLatencies[0][3] == 212);
assertTrue((int) allLatencies[0][4] == 152);
}
}