Commit | Line | Data |
---|---|---|
6151d86c PT |
1 | /******************************************************************************* |
2 | * Copyright (c) 2010 Ericsson | |
3 | * | |
4 | * All rights reserved. This program and the accompanying materials are | |
5 | * made available under the terms of the Eclipse Public License v1.0 which | |
6 | * accompanies this distribution, and is available at | |
7 | * http://www.eclipse.org/legal/epl-v10.html | |
8 | * | |
9 | * Contributors: | |
10 | * Patrick Tasse - Initial API and implementation | |
11 | *******************************************************************************/ | |
12 | ||
13 | package org.eclipse.linuxtools.tmf.ui.views.timechart; | |
14 | ||
15 | import java.util.Iterator; | |
30652cc3 | 16 | import java.util.List; |
6151d86c PT |
17 | import java.util.NoSuchElementException; |
18 | import java.util.Vector; | |
19 | ||
20 | import org.eclipse.linuxtools.tmf.core.trace.ITmfTrace; | |
21 | import org.eclipse.linuxtools.tmf.ui.widgets.timegraph.model.ITimeEvent; | |
22 | import org.eclipse.linuxtools.tmf.ui.widgets.timegraph.model.ITimeGraphEntry; | |
23 | ||
24 | /** | |
25 | * An entry (row) in the time chart analysis view | |
26 | * | |
27 | * @version 1.0 | |
28 | * @author Patrick Tasse | |
29 | */ | |
30 | public class TimeChartAnalysisEntry implements ITimeGraphEntry { | |
31 | ||
32 | private final ITmfTrace fTrace; | |
33 | private final Vector<TimeChartEvent> fTraceEvents; | |
34 | private int fPower = 0; // 2^fPower nanoseconds per vector position | |
35 | private long fReferenceTime = -1; // time corresponding to beginning of index 0 | |
36 | private long fStartTime = -1; // time of first event | |
37 | private long fStopTime = -1; // time of last event | |
38 | private long fLastRank = -1; // rank of last processed trace event | |
39 | ||
40 | TimeChartAnalysisEntry(ITmfTrace trace, int modelSize) { | |
41 | fTrace = trace; | |
42 | fTraceEvents = new Vector<TimeChartEvent>(modelSize); | |
43 | } | |
44 | ||
30652cc3 AM |
45 | /** |
46 | * @since 2.0 | |
47 | */ | |
6151d86c | 48 | @Override |
30652cc3 | 49 | public List<ITimeGraphEntry> getChildren() { |
6151d86c PT |
50 | return null; |
51 | } | |
52 | ||
53 | @Override | |
54 | public ITimeGraphEntry getParent() { | |
55 | return null; | |
56 | } | |
57 | ||
58 | @Override | |
59 | public boolean hasChildren() { | |
60 | return false; | |
61 | } | |
62 | ||
63 | @Override | |
64 | public String getName() { | |
65 | return fTrace.getName(); | |
66 | } | |
67 | ||
68 | @Override | |
69 | public long getStartTime() { | |
70 | return fStartTime; | |
71 | } | |
72 | ||
73 | @Override | |
74 | public long getEndTime() { | |
75 | return fStopTime; | |
76 | } | |
77 | ||
78 | @Override | |
79 | public boolean hasTimeEvents() { | |
80 | return true; | |
81 | } | |
82 | ||
83 | @Override | |
84 | public Iterator<ITimeEvent> getTimeEventsIterator() { | |
85 | return new EntryIterator(0, Long.MAX_VALUE, 0); | |
86 | } | |
87 | ||
88 | @Override | |
89 | public Iterator<ITimeEvent> getTimeEventsIterator(long startTime, long stopTime, long maxDuration) { | |
90 | return new EntryIterator(startTime, stopTime, maxDuration); | |
91 | } | |
92 | ||
93 | private class EntryIterator implements Iterator<ITimeEvent> { | |
94 | private final long fIteratorStartTime; | |
95 | private final long fIteratorStopTime; | |
96 | private final long fIteratorMaxDuration; | |
97 | private long lastTime = -1; | |
98 | private TimeChartEvent next = null; | |
99 | private Iterator<ITimeEvent> nestedIterator = null; | |
100 | ||
101 | public EntryIterator(long startTime, long stopTime, long maxDuration) { | |
102 | fIteratorStartTime = startTime; | |
103 | fIteratorStopTime = stopTime; | |
104 | fIteratorMaxDuration = maxDuration; | |
105 | } | |
106 | ||
107 | @Override | |
108 | public boolean hasNext() { | |
109 | synchronized (fTraceEvents) { | |
110 | if (next != null) { | |
111 | return true; | |
112 | } | |
113 | if (nestedIterator != null) { | |
114 | if (nestedIterator.hasNext()) { | |
115 | return true; | |
116 | } | |
117 | nestedIterator = null; | |
118 | } | |
119 | long time = (lastTime == -1) ? fStartTime : lastTime; | |
120 | int index = (fReferenceTime == -1) ? 0 : (int) ((time - fReferenceTime) >> fPower); | |
121 | while (index < fTraceEvents.size()) { | |
122 | TimeChartEvent event = fTraceEvents.get(index++); | |
123 | if (event != null && (lastTime == -1 || event.getTime() > time)) { | |
124 | if (event.getTime() + event.getDuration() >= fIteratorStartTime && event.getTime() <= fIteratorStopTime) { | |
125 | if (event.getItemizedEntry() == null || event.getDuration() <= fIteratorMaxDuration) { | |
126 | lastTime = event.getTime() + event.getDuration(); | |
127 | next = event; | |
128 | return true; | |
129 | } | |
130 | nestedIterator = event.getItemizedEntry().getTimeEventsIterator(fIteratorStartTime, fIteratorStopTime, fIteratorMaxDuration); | |
131 | return nestedIterator.hasNext(); | |
132 | } | |
133 | } | |
134 | } | |
135 | return false; | |
136 | } | |
137 | } | |
138 | ||
139 | @Override | |
140 | public TimeChartEvent next() { | |
141 | synchronized (fTraceEvents) { | |
142 | if (nestedIterator != null) { | |
143 | TimeChartEvent event = (TimeChartEvent) nestedIterator.next(); | |
144 | lastTime = event.getTime() + event.getDuration(); | |
145 | return event; | |
146 | } | |
147 | if (hasNext()) { | |
148 | TimeChartEvent event = next; | |
149 | next = null; | |
150 | return event; | |
151 | } | |
152 | throw new NoSuchElementException(); | |
153 | } | |
154 | } | |
155 | ||
156 | @Override | |
157 | public void remove() { | |
158 | throw new UnsupportedOperationException(); | |
159 | } | |
160 | ||
161 | } | |
162 | ||
163 | /** | |
164 | * Add a time event to the time chart entry | |
165 | * | |
166 | * @param timeEvent | |
167 | * The event to add | |
168 | */ | |
169 | public void addTraceEvent(ITimeEvent timeEvent) { | |
170 | long time = timeEvent.getTime(); | |
171 | synchronized (fTraceEvents) { | |
172 | long index = (fReferenceTime == -1) ? 0 : (time - fReferenceTime) >> fPower; | |
173 | if (index < 0) { | |
174 | if (fTraceEvents.capacity() - fTraceEvents.size() < -index) { | |
175 | int powershift = (-index + fTraceEvents.size() <= 2 * fTraceEvents.capacity()) ? 1 : | |
176 | (int) Math.ceil(Math.log((double) (-index + fTraceEvents.size()) / fTraceEvents.capacity()) / Math.log(2)); | |
177 | merge(powershift); | |
178 | index = (int) ((time - fReferenceTime) >> fPower); | |
179 | } | |
180 | shift((int) -index); | |
181 | index = 0; | |
182 | fTraceEvents.set(0, (TimeChartEvent) timeEvent); | |
183 | } else if (index < fTraceEvents.capacity()) { | |
184 | if (index >= fTraceEvents.size()) { | |
185 | fTraceEvents.setSize((int) index + 1); | |
186 | } | |
187 | } else { | |
188 | int powershift = (index < 2 * fTraceEvents.capacity()) ? 1 : | |
189 | (int) Math.ceil(Math.log((double) (index + 1) / fTraceEvents.capacity()) / Math.log(2)); | |
190 | merge(powershift); | |
191 | index = (int) ((time - fReferenceTime) >> fPower); | |
192 | fTraceEvents.setSize((int) index + 1); | |
193 | } | |
194 | TimeChartEvent event = fTraceEvents.get((int) index); | |
195 | if (event == null) { | |
196 | fTraceEvents.set((int) index, (TimeChartEvent) timeEvent); | |
197 | } else { | |
198 | if (event.getItemizedEntry() == null) { | |
199 | event.merge((TimeChartEvent) timeEvent); | |
200 | } else { | |
201 | event.mergeDecorations((TimeChartEvent) timeEvent); | |
202 | event.getItemizedEntry().addTraceEvent(timeEvent); | |
203 | } | |
204 | } | |
205 | if (fReferenceTime == -1 || time < fReferenceTime) { | |
206 | fReferenceTime = (time >> fPower) << fPower; | |
207 | } | |
208 | if (fStartTime == -1 || time < fStartTime) { | |
209 | fStartTime = time; | |
210 | } | |
211 | if (fStopTime == -1 || time > fStopTime) { | |
212 | fStopTime = time; | |
213 | } | |
214 | } | |
215 | } | |
216 | ||
217 | private void merge(int powershift) { | |
218 | fPower += powershift; | |
219 | fReferenceTime = (fReferenceTime >> fPower) << fPower; | |
220 | int index = 0; | |
221 | for (int i = 0; i < fTraceEvents.size(); i++) { | |
222 | TimeChartEvent event = fTraceEvents.get(i); | |
223 | if (event != null) { | |
224 | index = (int) ((event.getTime() - fReferenceTime) >> fPower); | |
225 | TimeChartEvent mergedEvent = fTraceEvents.get(index); | |
226 | if (mergedEvent == null) { | |
227 | fTraceEvents.set(index, event); | |
228 | } else { | |
229 | mergedEvent.merge(event); | |
230 | } | |
231 | if (i != index) { | |
232 | fTraceEvents.set(i, null); | |
233 | } | |
234 | } | |
235 | } | |
236 | fTraceEvents.setSize(index + 1); | |
237 | } | |
238 | ||
239 | private void shift(int indexshift) { | |
240 | int oldSize = fTraceEvents.size(); | |
241 | fTraceEvents.setSize(oldSize + indexshift); | |
242 | for (int i = oldSize - 1; i >= 0; i--) { | |
243 | fTraceEvents.set(i + indexshift, fTraceEvents.get(i)); | |
244 | } | |
245 | for (int i = 0; i < indexshift; i++) { | |
246 | fTraceEvents.set(i, null); | |
247 | } | |
248 | } | |
249 | ||
250 | /** | |
251 | * Retrieve the trace associated with this entry | |
252 | * | |
253 | * @return The trace object | |
254 | */ | |
255 | public ITmfTrace getTrace() { | |
256 | return fTrace; | |
257 | } | |
258 | ||
259 | /** | |
260 | * Set the last rank of the entry | |
261 | * | |
262 | * @param rank | |
263 | * The rank to set | |
264 | */ | |
265 | public void setLastRank(long rank) { | |
266 | fLastRank = rank; | |
267 | } | |
268 | ||
269 | /** | |
270 | * Retrieve the last rank of the entry | |
271 | * | |
272 | * @return The last rank | |
273 | */ | |
274 | public long getLastRank() { | |
275 | return fLastRank; | |
276 | } | |
277 | } |