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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*******************************************************************************
* Copyright (c) 2011-2012 Ericsson, Ecole Polytechnique de Montreal and others
*
* 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: Matthew Khouzam - Initial API and implementation
* Contributors: Simon Marchi - Initial API and implementation
*******************************************************************************/
package org.eclipse.linuxtools.ctf.core.trace;
import java.util.ListIterator;
import java.util.Vector;
/**
* <b><u>StreamInputPacketIndex</u></b>
* <p>
* TODO Implement me. Please.
*/
public class StreamInputPacketIndex {
// ------------------------------------------------------------------------
// Attributes
// ------------------------------------------------------------------------
/**
* Entries of the index. They are sorted by increasing begin timestamp.
* index builder.
*/
private final Vector<StreamInputPacketIndexEntry> entries = new Vector<StreamInputPacketIndexEntry>();
// ------------------------------------------------------------------------
// Getters/Setters/Predicates
// ------------------------------------------------------------------------
public Vector<StreamInputPacketIndexEntry> getEntries() {
return this.entries;
}
public ListIterator<StreamInputPacketIndexEntry> listIterator() {
return this.entries.listIterator();
}
public ListIterator<StreamInputPacketIndexEntry> listIterator(int n) {
return this.entries.listIterator(n);
}
// ------------------------------------------------------------------------
// Operations
// ------------------------------------------------------------------------
/**
* Adds an entry to the index.
*
* @param entry
* The entry to add
* @throws CTFReaderException
*/
public void addEntry(StreamInputPacketIndexEntry entry)
throws CTFReaderException {
assert (entry.getContentSizeBits() != 0);
assert (entry.getContentSizeBits() != 0);
if (entry.getTimestampBegin() > entry.getTimestampEnd()) {
throw new CTFReaderException(
"Packet begin timestamp is after end timestamp"); //$NON-NLS-1$
}
if (!this.entries.isEmpty()) {
if (entry.getTimestampBegin() < this.entries.lastElement().getTimestampBegin()) {
throw new CTFReaderException(
"Packets begin timestamp decreasing"); //$NON-NLS-1$
}
}
this.entries.add(entry);
}
/**
* Given a timestamp, this methods returns the first PacketIndexEntry that
* could include the timestamp, that is the last packet with a begin
* timestamp smaller than the given timestamp.
*
* @param timestamp
* The timestamp to look for.
* @return The StreamInputPacketEntry that corresponds to the packet that
* includes the given timestamp.
*/
public ListIterator<StreamInputPacketIndexEntry> search(final long timestamp) {
/*
* Start with min and max covering all the elements.
*/
int max = this.entries.size() - 1;
int min = 0;
int guessI;
StreamInputPacketIndexEntry guessEntry = null;
if (timestamp < 0) {
throw new IllegalArgumentException("timestamp is negative"); //$NON-NLS-1$
}
for (;;) {
/*
* Guess in the middle of min and max. The +1 is so that in case
* (min + 1 == max), we choose the packet at the subscript "max"
* instead of the one at "min". Otherwise, it would give an infinite
* loop.
*/
guessI = (max + min + 1) / 2;
guessEntry = this.entries.get(guessI);
/*
* If we reached the point where we focus on a single packet, our
* search is done.
*/
if (min == max) {
break;
}
if (timestamp < guessEntry.getTimestampBegin()) {
/*
* If the timestamp if before the begin timestamp, we know that
* the packet to return is before the guess.
*/
max = guessI - 1;
} else if (timestamp >= guessEntry.getTimestampBegin()) {
/*
* If the timestamp is after the begin timestamp, we know that
* the packet to return is after the guess or is the guess.
*/
min = guessI;
}
}
return this.entries.listIterator(guessI);
}
/**
* Given a rank, this methods returns the first PacketIndexEntry that
* could include the rank, that is the last packet with a begin
* rank smaller than the given rank.
*
* @param index
* The rank to look for.
* @return The StreamInputPacketEntry that corresponds to the packet that
* includes the given timestamp.
*/
public ListIterator<StreamInputPacketIndexEntry> searchIndex(final long index) {
/*
* Start with min and max covering all the elements.
*/
int max = this.entries.size() - 1;
int min = 0;
int guessI;
StreamInputPacketIndexEntry guessEntry = null;
if (index < 0) {
throw new IllegalArgumentException("rank is negative"); //$NON-NLS-1$
}
for (;;) {
/*
* Guess in the middle of min and max. The +1 is so that in case
* (min + 1 == max), we choose the packet at the subscript "max"
* instead of the one at "min". Otherwise, it would give an infinite
* loop.
*/
guessI = (max + min + 1) / 2;
guessEntry = this.entries.get(guessI);
/*
* If we reached the point where we focus on a single packet, our
* search is done.
*/
if (min == max) {
break;
}
if (index < guessEntry.getIndexBegin()) {
/*
* If the timestamp if before the begin timestamp, we know that
* the packet to return is before the guess.
*/
max = guessI - 1;
} else if (index >= guessEntry.getIndexBegin()) {
/*
* If the timestamp is after the begin timestamp, we know that
* the packet to return is after the guess or is the guess.
*/
min = guessI;
}
}
return this.entries.listIterator(guessI);
}
}
|
