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
|
/*******************************************************************************
* Copyright (c) 2009, 2020 Mountainminds GmbH & Co. KG and Contributors
* This program and the accompanying materials are made available under
* the terms of the Eclipse Public License 2.0 which is available at
* http://www.eclipse.org/legal/epl-2.0
*
* SPDX-License-Identifier: EPL-2.0
*
* Contributors:
* Evgeny Mandrikov - initial API and implementation
*
*******************************************************************************/
package org.jacoco.core.internal.analysis.filter;
import java.util.HashSet;
import java.util.Set;
import org.jacoco.core.internal.instr.InstrSupport;
import org.junit.Test;
import org.objectweb.asm.Label;
import org.objectweb.asm.Opcodes;
import org.objectweb.asm.tree.AbstractInsnNode;
import org.objectweb.asm.tree.MethodNode;
/**
* Unit tests for {@link StringSwitchEcjFilter}.
*/
public class StringSwitchEcjFilterTest extends FilterTestBase {
private final IFilter filter = new StringSwitchEcjFilter();
@Test
public void should_filter() {
final Set<AbstractInsnNode> expectedNewTargets = new HashSet<AbstractInsnNode>();
final MethodNode m = new MethodNode(InstrSupport.ASM_API_VERSION, 0,
"name", "()V", null, null);
final Label case1 = new Label();
final Label case2 = new Label();
final Label case3 = new Label();
final Label caseDefault = new Label();
final Label h1 = new Label();
final Label h2 = new Label();
// filter should not remember this unrelated slot
m.visitLdcInsn("");
m.visitVarInsn(Opcodes.ASTORE, 1);
m.visitVarInsn(Opcodes.ALOAD, 1);
// switch (...)
m.visitInsn(Opcodes.DUP);
m.visitVarInsn(Opcodes.ASTORE, 2);
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "hashCode",
"()I", false);
m.visitTableSwitchInsn(97, 98, caseDefault, h1, h2);
final AbstractInsnNode switchNode = m.instructions.getLast();
m.visitLabel(h1);
m.visitVarInsn(Opcodes.ALOAD, 2);
m.visitLdcInsn("a");
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "equals",
"(Ljava/lang/Object;)Z", false);
// if equal "a", then goto its case
m.visitJumpInsn(Opcodes.IFNE, case1);
m.visitVarInsn(Opcodes.ALOAD, 2);
m.visitLdcInsn("\0a");
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "equals",
"(Ljava/lang/Object;)Z", false);
// if equal "\0a", then goto its case
m.visitJumpInsn(Opcodes.IFNE, case2);
// goto default case
m.visitJumpInsn(Opcodes.GOTO, caseDefault);
m.visitLabel(h2);
m.visitVarInsn(Opcodes.ALOAD, 2);
m.visitLdcInsn("b");
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "equals",
"(Ljava/lang/Object;)Z", false);
// if equal "b", then goto its case
m.visitJumpInsn(Opcodes.IFNE, case3);
// goto default case
m.visitJumpInsn(Opcodes.GOTO, caseDefault);
final AbstractInsnNode expectedToInclusive = m.instructions.getLast();
m.visitLabel(case1);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
m.visitLabel(case2);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
m.visitLabel(case3);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
m.visitLabel(caseDefault);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
filter.filter(m, context, output);
assertReplacedBranches(switchNode, expectedNewTargets);
assertIgnored(new Range(switchNode.getNext(), expectedToInclusive));
}
@Test
public void should_filter_when_default_is_first() {
final Set<AbstractInsnNode> expectedNewTargets = new HashSet<AbstractInsnNode>();
final MethodNode m = new MethodNode(InstrSupport.ASM_API_VERSION, 0,
"name", "()V", null, null);
final Label case1 = new Label();
final Label caseDefault = new Label();
final Label h1 = new Label();
// filter should not remember this unrelated slot
m.visitLdcInsn("");
m.visitVarInsn(Opcodes.ASTORE, 1);
m.visitVarInsn(Opcodes.ALOAD, 1);
// switch (...)
m.visitInsn(Opcodes.DUP);
m.visitVarInsn(Opcodes.ASTORE, 2);
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "hashCode",
"()I", false);
m.visitLookupSwitchInsn(caseDefault, new int[] { 97 },
new Label[] { h1 });
final AbstractInsnNode switchNode = m.instructions.getLast();
m.visitLabel(h1);
m.visitVarInsn(Opcodes.ALOAD, 2);
m.visitLdcInsn("a");
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "equals",
"(Ljava/lang/Object;)Z", false);
// if equal "a", then goto its case
m.visitJumpInsn(Opcodes.IFNE, case1);
final AbstractInsnNode expectedToInclusive = m.instructions.getLast();
m.visitLabel(caseDefault);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
m.visitLabel(case1);
m.visitInsn(Opcodes.RETURN);
expectedNewTargets.add(m.instructions.getLast());
filter.filter(m, context, output);
assertReplacedBranches(switchNode, expectedNewTargets);
assertIgnored(new Range(switchNode.getNext(), expectedToInclusive));
}
@Test
public void should_not_filter_empty_lookup_switch() {
final MethodNode m = new MethodNode(InstrSupport.ASM_API_VERSION, 0,
"name", "(Ljava/lang/String;)V", null, null);
m.visitVarInsn(Opcodes.ALOAD, 1);
m.visitVarInsn(Opcodes.ASTORE, 2);
m.visitMethodInsn(Opcodes.INVOKEVIRTUAL, "java/lang/String", "hashCode",
"()I", false);
final Label defaultCase = new Label();
m.visitLookupSwitchInsn(defaultCase, null, new Label[] {});
m.visitLabel(defaultCase);
m.visitInsn(Opcodes.RETURN);
filter.filter(m, context, output);
assertIgnored();
}
}
|
