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
|
/*******************************************************************************
* 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:
* Marc R. Hoffmann - initial API and implementation
*
*******************************************************************************/
package org.jacoco.core.internal.analysis;
import org.jacoco.core.analysis.CoverageNodeImpl;
import org.jacoco.core.analysis.ICounter;
import org.jacoco.core.analysis.ILine;
import org.jacoco.core.analysis.ISourceNode;
/**
* Implementation of {@link ISourceNode}.
*/
public class SourceNodeImpl extends CoverageNodeImpl implements ISourceNode {
private LineImpl[] lines;
/** first line number in {@link #lines} */
private int offset;
/**
* Create a new source node implementation instance.
*
* @param elementType
* element type
* @param name
* name of the element
*/
public SourceNodeImpl(final ElementType elementType, final String name) {
super(elementType, name);
lines = null;
offset = UNKNOWN_LINE;
}
/**
* Make sure that the internal buffer can keep lines from first to last.
* While the buffer is also incremented automatically, this method allows
* optimization in case the total range is known in advance.
*
* @param first
* first line number or {@link ISourceNode#UNKNOWN_LINE}
* @param last
* last line number or {@link ISourceNode#UNKNOWN_LINE}
*/
public void ensureCapacity(final int first, final int last) {
if (first == UNKNOWN_LINE || last == UNKNOWN_LINE) {
return;
}
if (lines == null) {
offset = first;
lines = new LineImpl[last - first + 1];
} else {
final int newFirst = Math.min(getFirstLine(), first);
final int newLast = Math.max(getLastLine(), last);
final int newLength = newLast - newFirst + 1;
if (newLength > lines.length) {
final LineImpl[] newLines = new LineImpl[newLength];
System.arraycopy(lines, 0, newLines, offset - newFirst,
lines.length);
offset = newFirst;
lines = newLines;
}
}
}
/**
* Increments all counters by the values of the given child. When
* incrementing the line counter it is assumed that the child refers to the
* same source file.
*
* @param child
* child node to add
*/
public void increment(final ISourceNode child) {
instructionCounter = instructionCounter.increment(child
.getInstructionCounter());
branchCounter = branchCounter.increment(child.getBranchCounter());
complexityCounter = complexityCounter.increment(child
.getComplexityCounter());
methodCounter = methodCounter.increment(child.getMethodCounter());
classCounter = classCounter.increment(child.getClassCounter());
final int firstLine = child.getFirstLine();
if (firstLine != UNKNOWN_LINE) {
final int lastLine = child.getLastLine();
ensureCapacity(firstLine, lastLine);
for (int i = firstLine; i <= lastLine; i++) {
final ILine line = child.getLine(i);
incrementLine(line.getInstructionCounter(),
line.getBranchCounter(), i);
}
}
}
/**
* Increments instructions and branches by the given counter values. If a
* optional line number is specified the instructions and branches are added
* to the given line. The line counter is incremented accordingly.
*
* @param instructions
* instructions to add
* @param branches
* branches to add
* @param line
* optional line number or {@link ISourceNode#UNKNOWN_LINE}
*/
public void increment(final ICounter instructions, final ICounter branches,
final int line) {
if (line != UNKNOWN_LINE) {
incrementLine(instructions, branches, line);
}
instructionCounter = instructionCounter.increment(instructions);
branchCounter = branchCounter.increment(branches);
}
private void incrementLine(final ICounter instructions,
final ICounter branches, final int line) {
ensureCapacity(line, line);
final LineImpl l = getLine(line);
final int oldTotal = l.getInstructionCounter().getTotalCount();
final int oldCovered = l.getInstructionCounter().getCoveredCount();
lines[line - offset] = l.increment(instructions, branches);
// Increment line counter:
if (instructions.getTotalCount() > 0) {
if (instructions.getCoveredCount() == 0) {
if (oldTotal == 0) {
lineCounter = lineCounter
.increment(CounterImpl.COUNTER_1_0);
}
} else {
if (oldTotal == 0) {
lineCounter = lineCounter
.increment(CounterImpl.COUNTER_0_1);
} else {
if (oldCovered == 0) {
lineCounter = lineCounter.increment(-1, +1);
}
}
}
}
}
// === ISourceNode implementation ===
public int getFirstLine() {
return offset;
}
public int getLastLine() {
return lines == null ? UNKNOWN_LINE : (offset + lines.length - 1);
}
public LineImpl getLine(final int nr) {
if (lines == null || nr < getFirstLine() || nr > getLastLine()) {
return LineImpl.EMPTY;
}
final LineImpl line = lines[nr - offset];
return line == null ? LineImpl.EMPTY : line;
}
}
|
