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
|
/*******************************************************************************
* Copyright (c) 2009, 2019 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;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import org.jacoco.core.analysis.ISourceFileCoverage;
import org.jacoco.core.analysis.ISourceNode;
import org.jacoco.core.internal.analysis.filter.IFilterOutput;
import org.objectweb.asm.tree.AbstractInsnNode;
/**
* Calculates the filtered coverage of a single method. A instance of this class
* can be first used as {@link IFilterOutput} before the coverage result is
* calculated.
*/
class MethodCoverageCalculator implements IFilterOutput {
private final Map<AbstractInsnNode, Instruction> instructions;
private final Set<AbstractInsnNode> ignored;
/**
* Instructions that should be merged form disjoint sets. Coverage
* information from instructions of one set will be merged into
* representative instruction of set.
*
* Each such set is represented as a singly linked list: each element except
* one references another element from the same set, element without
* reference - is a representative of this set.
*
* This map stores reference (value) for elements of sets (key).
*/
private final Map<AbstractInsnNode, AbstractInsnNode> merged;
private final Map<AbstractInsnNode, Set<AbstractInsnNode>> replacements;
MethodCoverageCalculator(
final Map<AbstractInsnNode, Instruction> instructions) {
this.instructions = instructions;
this.ignored = new HashSet<AbstractInsnNode>();
this.merged = new HashMap<AbstractInsnNode, AbstractInsnNode>();
this.replacements = new HashMap<AbstractInsnNode, Set<AbstractInsnNode>>();
}
/**
* Applies all specified filtering commands and calculates the resulting
* coverage.
*
* @param coverage
* the result is added to this coverage node
*/
void calculate(final MethodCoverageImpl coverage) {
applyMerges();
applyReplacements();
ensureCapacity(coverage);
for (final Entry<AbstractInsnNode, Instruction> entry : instructions
.entrySet()) {
if (!ignored.contains(entry.getKey())) {
final Instruction instruction = entry.getValue();
coverage.increment(instruction.getInstructionCounter(),
instruction.getBranchCounter(), instruction.getLine());
}
}
coverage.incrementMethodCounter();
}
private void applyMerges() {
// Merge to the representative:
for (final Entry<AbstractInsnNode, AbstractInsnNode> entry : merged
.entrySet()) {
final AbstractInsnNode node = entry.getKey();
final Instruction instruction = instructions.get(node);
final AbstractInsnNode representativeNode = findRepresentative(
node);
ignored.add(node);
instructions.put(representativeNode,
instructions.get(representativeNode).merge(instruction));
entry.setValue(representativeNode);
}
// Get merged value back from representative
for (final Entry<AbstractInsnNode, AbstractInsnNode> entry : merged
.entrySet()) {
instructions.put(entry.getKey(),
instructions.get(entry.getValue()));
}
}
private void applyReplacements() {
for (final Entry<AbstractInsnNode, Set<AbstractInsnNode>> entry : replacements
.entrySet()) {
final Set<AbstractInsnNode> replacements = entry.getValue();
final List<Instruction> newBranches = new ArrayList<Instruction>(
replacements.size());
for (final AbstractInsnNode b : replacements) {
newBranches.add(instructions.get(b));
}
final AbstractInsnNode node = entry.getKey();
instructions.put(node,
instructions.get(node).replaceBranches(newBranches));
}
}
private void ensureCapacity(final MethodCoverageImpl coverage) {
// Determine line range:
int firstLine = ISourceFileCoverage.UNKNOWN_LINE;
int lastLine = ISourceFileCoverage.UNKNOWN_LINE;
for (final Entry<AbstractInsnNode, Instruction> entry : instructions
.entrySet()) {
if (!ignored.contains(entry.getKey())) {
final int line = entry.getValue().getLine();
if (line != ISourceNode.UNKNOWN_LINE) {
if (firstLine > line
|| lastLine == ISourceNode.UNKNOWN_LINE) {
firstLine = line;
}
if (lastLine < line) {
lastLine = line;
}
}
}
}
// Performance optimization to avoid incremental increase of line array:
coverage.ensureCapacity(firstLine, lastLine);
}
private AbstractInsnNode findRepresentative(AbstractInsnNode i) {
AbstractInsnNode r;
while ((r = merged.get(i)) != null) {
i = r;
}
return i;
}
// === IFilterOutput API ===
public void ignore(final AbstractInsnNode fromInclusive,
final AbstractInsnNode toInclusive) {
for (AbstractInsnNode i = fromInclusive; i != toInclusive; i = i
.getNext()) {
ignored.add(i);
}
ignored.add(toInclusive);
}
public void merge(AbstractInsnNode i1, AbstractInsnNode i2) {
i1 = findRepresentative(i1);
i2 = findRepresentative(i2);
if (i1 != i2) {
merged.put(i2, i1);
}
}
public void replaceBranches(final AbstractInsnNode source,
final Set<AbstractInsnNode> newTargets) {
replacements.put(source, newTargets);
}
}
|
