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
|
/*******************************************************************************
* Copyright (c) 2009, 2018 Mountainminds GmbH & Co. KG and Contributors
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Evgeny Mandrikov - initial API and implementation
*
*******************************************************************************/
package org.jacoco.core.internal.analysis.filter;
import java.util.HashSet;
import java.util.Set;
import org.objectweb.asm.Opcodes;
import org.objectweb.asm.tree.AbstractInsnNode;
import org.objectweb.asm.tree.JumpInsnNode;
import org.objectweb.asm.tree.LabelNode;
import org.objectweb.asm.tree.LookupSwitchInsnNode;
import org.objectweb.asm.tree.MethodNode;
import org.objectweb.asm.tree.TableSwitchInsnNode;
/**
* Filters code that is generated by ECJ for a <code>switch</code> statement
* with a <code>String</code>.
*/
public final class StringSwitchEcjFilter implements IFilter {
public void filter(final MethodNode methodNode,
final IFilterContext context, final IFilterOutput output) {
final Matcher matcher = new Matcher();
for (AbstractInsnNode i = methodNode.instructions
.getFirst(); i != null; i = i.getNext()) {
matcher.match(i, output);
}
}
private static class Matcher extends AbstractMatcher {
public void match(final AbstractInsnNode start,
final IFilterOutput output) {
cursor = start;
nextIsVar(Opcodes.ASTORE, "s");
nextIsInvokeVirtual("java/lang/String", "hashCode");
nextIsSwitch();
if (cursor == null) {
return;
}
final AbstractInsnNode s = cursor;
final int hashCodes;
final LabelNode defaultLabel;
if (s.getOpcode() == Opcodes.LOOKUPSWITCH) {
final LookupSwitchInsnNode lookupSwitch = (LookupSwitchInsnNode) cursor;
defaultLabel = lookupSwitch.dflt;
hashCodes = lookupSwitch.labels.size();
} else {
final TableSwitchInsnNode tableSwitch = (TableSwitchInsnNode) cursor;
defaultLabel = tableSwitch.dflt;
hashCodes = tableSwitch.labels.size();
}
final Set<AbstractInsnNode> replacements = new HashSet<AbstractInsnNode>();
replacements.add(instructionAfterLabel(defaultLabel));
for (int i = 0; i < hashCodes; i++) {
while (true) {
nextIsVar(Opcodes.ALOAD, "s");
nextIs(Opcodes.LDC);
nextIsInvokeVirtual("java/lang/String", "equals");
// jump to case
nextIs(Opcodes.IFNE);
if (cursor == null) {
return;
}
replacements.add(instructionAfterLabel(
((JumpInsnNode) cursor).label));
if (cursor.getNext().getOpcode() == Opcodes.GOTO) {
// end of comparisons for same hashCode
// jump to default
nextIs(Opcodes.GOTO);
break;
}
}
}
output.ignore(s.getNext(), cursor);
output.replaceBranches(s, replacements);
}
}
private static AbstractInsnNode instructionAfterLabel(
final LabelNode label) {
AbstractInsnNode i = label.getNext();
while (i.getType() == AbstractInsnNode.FRAME
|| i.getType() == AbstractInsnNode.LABEL
|| i.getType() == AbstractInsnNode.LINE) {
i = i.getNext();
}
return i;
}
}
|
