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
|
/*******************************************************************************
* Copyright (c) 2009, 2021 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 static org.junit.Assert.assertArrayEquals;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertTrue;
import static org.junit.Assert.fail;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import org.objectweb.asm.tree.AbstractInsnNode;
import org.objectweb.asm.tree.MethodNode;
/**
* Base class for tests of {@link IFilter} implementations.
*/
public abstract class FilterTestBase {
protected final FilterContextMock context = new FilterContextMock();
private final List<Range> ignoredRanges = new ArrayList<Range>();
private final Map<AbstractInsnNode, Set<AbstractInsnNode>> replacedBranches = new HashMap<AbstractInsnNode, Set<AbstractInsnNode>>();
protected final IFilterOutput output = new IFilterOutput() {
public void ignore(final AbstractInsnNode fromInclusive,
final AbstractInsnNode toInclusive) {
final Range range = new Range();
range.fromInclusive = fromInclusive;
range.toInclusive = toInclusive;
ignoredRanges.add(range);
}
public void merge(final AbstractInsnNode i1,
final AbstractInsnNode i2) {
fail();
}
public void replaceBranches(final AbstractInsnNode source,
final Set<AbstractInsnNode> newTargets) {
replacedBranches.put(source, newTargets);
}
};
final void assertIgnored(Range... ranges) {
assertArrayEquals(ranges, ignoredRanges.toArray(new Range[0]));
}
final void assertMethodIgnored(final MethodNode m) {
assertIgnored(
new Range(m.instructions.getFirst(), m.instructions.getLast()));
}
final void assertNoReplacedBranches() {
assertTrue(replacedBranches.isEmpty());
}
final void assertReplacedBranches(final AbstractInsnNode source,
final Set<AbstractInsnNode> newTargets) {
assertEquals(Collections.singletonMap(source, newTargets),
replacedBranches);
}
static class Range {
AbstractInsnNode fromInclusive;
AbstractInsnNode toInclusive;
Range() {
}
Range(AbstractInsnNode fromInclusive, AbstractInsnNode toInclusive) {
this.fromInclusive = fromInclusive;
this.toInclusive = toInclusive;
}
@Override
public boolean equals(Object obj) {
if (obj.getClass() == Range.class) {
final Range other = (Range) obj;
return this.fromInclusive.equals(other.fromInclusive)
&& this.toInclusive.equals(other.toInclusive);
}
return false;
}
}
}
|
