1/*
2 * Copyright (C) 2013 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
14 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
15 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
17 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
18 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
19 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
20 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
21 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
22 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
23 * THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#include "config.h"
27#include "SampleMap.h"
28
29#include "MediaSample.h"
30
31namespace WebCore {
32
33template <typename M>
34class SampleIsLessThanMediaTimeComparator {
35public:
36 typedef typename M::value_type value_type;
37 bool operator()(const value_type& value, const MediaTime& time)
38 {
39 MediaTime presentationEndTime = value.second->presentationTime() + value.second->duration();
40 return presentationEndTime <= time;
41 }
42 bool operator()(const MediaTime& time, const value_type& value)
43 {
44 MediaTime presentationStartTime = value.second->presentationTime();
45 return time < presentationStartTime;
46 }
47};
48
49template <typename M>
50class SampleIsGreaterThanMediaTimeComparator {
51public:
52 typedef typename M::value_type value_type;
53 bool operator()(const value_type& value, const MediaTime& time)
54 {
55 MediaTime presentationStartTime = value.second->presentationTime();
56 return presentationStartTime > time;
57 }
58 bool operator()(const MediaTime& time, const value_type& value)
59 {
60 MediaTime presentationEndTime = value.second->presentationTime() + value.second->duration();
61 return time >= presentationEndTime;
62 }
63};
64
65class SampleIsRandomAccess {
66public:
67 bool operator()(DecodeOrderSampleMap::MapType::value_type& value)
68 {
69 return value.second->flags() == MediaSample::IsSync;
70 }
71};
72
73// SamplePresentationTimeIsInsideRangeComparator matches (range.first, range.second]
74struct SamplePresentationTimeIsInsideRangeComparator {
75 bool operator()(std::pair<MediaTime, MediaTime> range, const std::pair<MediaTime, RefPtr<MediaSample>>& value)
76 {
77 return range.second < value.first;
78 }
79 bool operator()(const std::pair<MediaTime, RefPtr<MediaSample>>& value, std::pair<MediaTime, MediaTime> range)
80 {
81 return value.first <= range.first;
82 }
83};
84
85// SamplePresentationTimeIsWithinRangeComparator matches [range.first, range.second)
86struct SamplePresentationTimeIsWithinRangeComparator {
87 bool operator()(std::pair<MediaTime, MediaTime> range, const std::pair<MediaTime, RefPtr<MediaSample>>& value)
88 {
89 return range.second <= value.first;
90 }
91 bool operator()(const std::pair<MediaTime, RefPtr<MediaSample>>& value, std::pair<MediaTime, MediaTime> range)
92 {
93 return value.first < range.first;
94 }
95};
96
97bool SampleMap::empty() const
98{
99 return presentationOrder().m_samples.empty();
100}
101
102void SampleMap::clear()
103{
104 presentationOrder().m_samples.clear();
105 decodeOrder().m_samples.clear();
106 m_totalSize = 0;
107}
108
109void SampleMap::addSample(MediaSample& sample)
110{
111 MediaTime presentationTime = sample.presentationTime();
112
113 presentationOrder().m_samples.insert(PresentationOrderSampleMap::MapType::value_type(presentationTime, &sample));
114
115 auto decodeKey = DecodeOrderSampleMap::KeyType(sample.decodeTime(), presentationTime);
116 decodeOrder().m_samples.insert(DecodeOrderSampleMap::MapType::value_type(decodeKey, &sample));
117
118 m_totalSize += sample.sizeInBytes();
119}
120
121void SampleMap::removeSample(MediaSample* sample)
122{
123 ASSERT(sample);
124 MediaTime presentationTime = sample->presentationTime();
125
126 m_totalSize -= sample->sizeInBytes();
127
128 auto decodeKey = DecodeOrderSampleMap::KeyType(sample->decodeTime(), presentationTime);
129 presentationOrder().m_samples.erase(presentationTime);
130 decodeOrder().m_samples.erase(decodeKey);
131}
132
133PresentationOrderSampleMap::iterator PresentationOrderSampleMap::findSampleWithPresentationTime(const MediaTime& time)
134{
135 auto range = m_samples.equal_range(time);
136 if (range.first == range.second)
137 return end();
138 return range.first;
139}
140
141PresentationOrderSampleMap::iterator PresentationOrderSampleMap::findSampleContainingPresentationTime(const MediaTime& time)
142{
143 // upper_bound will return the first sample whose presentation start time is greater than the search time.
144 // If this is the first sample, that means no sample in the map contains the requested time.
145 auto iter = m_samples.upper_bound(time);
146 if (iter == begin())
147 return end();
148
149 // Look at the previous sample; does it contain the requested time?
150 --iter;
151 MediaSample& sample = *iter->second;
152 if (sample.presentationTime() + sample.duration() > time)
153 return iter;
154 return end();
155}
156
157PresentationOrderSampleMap::iterator PresentationOrderSampleMap::findSampleContainingOrAfterPresentationTime(const MediaTime& time)
158{
159 if (m_samples.empty())
160 return end();
161
162 // upper_bound will return the first sample whose presentation start time is greater than the search time.
163 // If this is the first sample, that means no sample in the map contains the requested time.
164 auto iter = m_samples.upper_bound(time);
165 if (iter == begin())
166 return iter;
167
168 // Look at the previous sample; does it contain the requested time?
169 --iter;
170 MediaSample& sample = *iter->second;
171 if (sample.presentationTime() + sample.duration() > time)
172 return iter;
173 return ++iter;
174}
175
176PresentationOrderSampleMap::iterator PresentationOrderSampleMap::findSampleStartingOnOrAfterPresentationTime(const MediaTime& time)
177{
178 return m_samples.lower_bound(time);
179}
180
181PresentationOrderSampleMap::iterator PresentationOrderSampleMap::findSampleStartingAfterPresentationTime(const MediaTime& time)
182{
183 return m_samples.upper_bound(time);
184}
185
186DecodeOrderSampleMap::iterator DecodeOrderSampleMap::findSampleWithDecodeKey(const KeyType& key)
187{
188 return m_samples.find(key);
189}
190
191PresentationOrderSampleMap::reverse_iterator PresentationOrderSampleMap::reverseFindSampleContainingPresentationTime(const MediaTime& time)
192{
193 auto range = std::equal_range(rbegin(), rend(), time, SampleIsGreaterThanMediaTimeComparator<MapType>());
194 if (range.first == range.second)
195 return rend();
196 return range.first;
197}
198
199PresentationOrderSampleMap::reverse_iterator PresentationOrderSampleMap::reverseFindSampleBeforePresentationTime(const MediaTime& time)
200{
201 if (m_samples.empty())
202 return rend();
203
204 // upper_bound will return the first sample whose presentation start time is greater than the search time.
205 auto found = m_samples.upper_bound(time);
206
207 // If no sample was found with a time greater than the search time, return the last sample.
208 if (found == end())
209 return rbegin();
210
211 // If the first sample has a time grater than the search time, no samples will have a presentation time before the search time.
212 if (found == begin())
213 return rend();
214
215 // Otherwise, return the sample immediately previous to the one found.
216 return --reverse_iterator(--found);
217}
218
219DecodeOrderSampleMap::reverse_iterator DecodeOrderSampleMap::reverseFindSampleWithDecodeKey(const KeyType& key)
220{
221 DecodeOrderSampleMap::iterator found = findSampleWithDecodeKey(key);
222 if (found == end())
223 return rend();
224 return --reverse_iterator(found);
225}
226
227DecodeOrderSampleMap::reverse_iterator DecodeOrderSampleMap::findSyncSamplePriorToPresentationTime(const MediaTime& time, const MediaTime& threshold)
228{
229 PresentationOrderSampleMap::reverse_iterator reverseCurrentSamplePTS = m_presentationOrder.reverseFindSampleBeforePresentationTime(time);
230 if (reverseCurrentSamplePTS == m_presentationOrder.rend())
231 return rend();
232
233 const RefPtr<MediaSample>& sample = reverseCurrentSamplePTS->second;
234 reverse_iterator reverseCurrentSampleDTS = reverseFindSampleWithDecodeKey(KeyType(sample->decodeTime(), sample->presentationTime()));
235
236 reverse_iterator foundSample = findSyncSamplePriorToDecodeIterator(reverseCurrentSampleDTS);
237 if (foundSample == rend())
238 return rend();
239 if (foundSample->second->presentationTime() < time - threshold)
240 return rend();
241 return foundSample;
242}
243
244DecodeOrderSampleMap::reverse_iterator DecodeOrderSampleMap::findSyncSamplePriorToDecodeIterator(reverse_iterator iterator)
245{
246 return std::find_if(iterator, rend(), SampleIsRandomAccess());
247}
248
249DecodeOrderSampleMap::iterator DecodeOrderSampleMap::findSyncSampleAfterPresentationTime(const MediaTime& time, const MediaTime& threshold)
250{
251 PresentationOrderSampleMap::iterator currentSamplePTS = m_presentationOrder.findSampleStartingOnOrAfterPresentationTime(time);
252 if (currentSamplePTS == m_presentationOrder.end())
253 return end();
254
255 const RefPtr<MediaSample>& sample = currentSamplePTS->second;
256 iterator currentSampleDTS = findSampleWithDecodeKey(KeyType(sample->decodeTime(), sample->presentationTime()));
257
258 MediaTime upperBound = time + threshold;
259 iterator foundSample = std::find_if(currentSampleDTS, end(), SampleIsRandomAccess());
260 if (foundSample == end())
261 return end();
262 if (foundSample->second->presentationTime() > upperBound)
263 return end();
264 return foundSample;
265}
266
267DecodeOrderSampleMap::iterator DecodeOrderSampleMap::findSyncSampleAfterDecodeIterator(iterator currentSampleDTS)
268{
269 if (currentSampleDTS == end())
270 return end();
271 return std::find_if(++currentSampleDTS, end(), SampleIsRandomAccess());
272}
273
274PresentationOrderSampleMap::iterator_range PresentationOrderSampleMap::findSamplesBetweenPresentationTimes(const MediaTime& beginTime, const MediaTime& endTime)
275{
276 // startTime is inclusive, so use lower_bound to include samples wich start exactly at startTime.
277 // endTime is not inclusive, so use lower_bound to exclude samples which start exactly at endTime.
278 auto lower_bound = m_samples.lower_bound(beginTime);
279 auto upper_bound = m_samples.lower_bound(endTime);
280 if (lower_bound == upper_bound)
281 return { end(), end() };
282 return { lower_bound, upper_bound };
283}
284
285PresentationOrderSampleMap::iterator_range PresentationOrderSampleMap::findSamplesBetweenPresentationTimesFromEnd(const MediaTime& beginTime, const MediaTime& endTime)
286{
287 reverse_iterator rangeEnd = std::find_if(rbegin(), rend(), [&endTime](auto& value) {
288 return value.first < endTime;
289 });
290
291 reverse_iterator rangeStart = std::find_if(rangeEnd, rend(), [&beginTime](auto& value) {
292 return value.first < beginTime;
293 });
294
295 if (rangeStart == rangeEnd)
296 return { end(), end() };
297
298 // ( rangeStart, rangeEnd ] == [ rangeStart.base(), rangeEnd.base() )
299 return { rangeStart.base(), rangeEnd.base() };
300}
301
302DecodeOrderSampleMap::reverse_iterator_range DecodeOrderSampleMap::findDependentSamples(MediaSample* sample)
303{
304 ASSERT(sample);
305 reverse_iterator currentDecodeIter = reverseFindSampleWithDecodeKey(KeyType(sample->decodeTime(), sample->presentationTime()));
306 reverse_iterator nextSyncSample = findSyncSamplePriorToDecodeIterator(currentDecodeIter);
307 return reverse_iterator_range(currentDecodeIter, nextSyncSample);
308}
309
310DecodeOrderSampleMap::iterator_range DecodeOrderSampleMap::findSamplesBetweenDecodeKeys(const KeyType& beginKey, const KeyType& endKey)
311{
312 if (beginKey > endKey)
313 return { end(), end() };
314
315 // beginKey is inclusive, so use lower_bound to include samples wich start exactly at beginKey.
316 // endKey is not inclusive, so use lower_bound to exclude samples which start exactly at endKey.
317 auto lower_bound = m_samples.lower_bound(beginKey);
318 auto upper_bound = m_samples.lower_bound(endKey);
319 if (lower_bound == upper_bound)
320 return { end(), end() };
321 return { lower_bound, upper_bound };
322}
323
324}
325