/src/mozilla-central/dom/media/StreamTracks.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
2 | | /* This Source Code Form is subject to the terms of the Mozilla Public |
3 | | * License, v. 2.0. If a copy of the MPL was not distributed with this file, |
4 | | * You can obtain one at http://mozilla.org/MPL/2.0/. */ |
5 | | |
6 | | #include "StreamTracks.h" |
7 | | #include "mozilla/Logging.h" |
8 | | #include <algorithm> |
9 | | |
10 | | namespace mozilla { |
11 | | |
12 | | #ifdef DEBUG |
13 | | |
14 | | extern LazyLogModule gMediaStreamGraphLog; |
15 | | #define STREAM_LOG(type, msg) MOZ_LOG(gMediaStreamGraphLog, type, msg) |
16 | | |
17 | | void |
18 | | StreamTracks::DumpTrackInfo() const |
19 | | { |
20 | | STREAM_LOG(LogLevel::Info, ("DumpTracks: mTracksKnownTime %" PRId64, mTracksKnownTime)); |
21 | | for (uint32_t i = 0; i < mTracks.Length(); ++i) { |
22 | | Track* track = mTracks[i]; |
23 | | if (track->IsEnded()) { |
24 | | STREAM_LOG(LogLevel::Info, ("Track[%d] %d: ended", i, track->GetID())); |
25 | | } else { |
26 | | STREAM_LOG(LogLevel::Info, ("Track[%d] %d: %" PRId64 "", i, track->GetID(), |
27 | | track->GetEnd())); |
28 | | } |
29 | | } |
30 | | } |
31 | | #endif |
32 | | |
33 | | StreamTime |
34 | | StreamTracks::GetEnd() const |
35 | 0 | { |
36 | 0 | StreamTime t = mTracksKnownTime; |
37 | 0 | for (uint32_t i = 0; i < mTracks.Length(); ++i) { |
38 | 0 | Track* track = mTracks[i]; |
39 | 0 | if (!track->IsEnded()) { |
40 | 0 | t = std::min(t, track->GetEnd()); |
41 | 0 | } |
42 | 0 | } |
43 | 0 | return t; |
44 | 0 | } |
45 | | |
46 | | StreamTime |
47 | | StreamTracks::GetAllTracksEnd() const |
48 | 0 | { |
49 | 0 | if (mTracksKnownTime < STREAM_TIME_MAX) { |
50 | 0 | // A track might be added. |
51 | 0 | return STREAM_TIME_MAX; |
52 | 0 | } |
53 | 0 | StreamTime t = 0; |
54 | 0 | for (uint32_t i = 0; i < mTracks.Length(); ++i) { |
55 | 0 | Track* track = mTracks[i]; |
56 | 0 | if (!track->IsEnded()) { |
57 | 0 | return STREAM_TIME_MAX; |
58 | 0 | } |
59 | 0 | t = std::max(t, track->GetEnd()); |
60 | 0 | } |
61 | 0 | return t; |
62 | 0 | } |
63 | | |
64 | | StreamTracks::Track* |
65 | | StreamTracks::FindTrack(TrackID aID) const |
66 | 0 | { |
67 | 0 | if (aID == TRACK_NONE || mTracks.IsEmpty()) { |
68 | 0 | return nullptr; |
69 | 0 | } |
70 | 0 | |
71 | 0 | // The tracks are sorted by ID. We can use a binary search. |
72 | 0 | |
73 | 0 | uint32_t left = 0, right = mTracks.Length() - 1; |
74 | 0 | while (left <= right) { |
75 | 0 | uint32_t middle = (left + right) / 2; |
76 | 0 | if (mTracks[middle]->GetID() == aID) { |
77 | 0 | return mTracks[middle]; |
78 | 0 | } |
79 | 0 | |
80 | 0 | if (mTracks[middle]->GetID() > aID) { |
81 | 0 | if (middle == 0) { |
82 | 0 | break; |
83 | 0 | } |
84 | 0 | |
85 | 0 | right = middle - 1; |
86 | 0 | } else { |
87 | 0 | left = middle + 1; |
88 | 0 | } |
89 | 0 | } |
90 | 0 |
|
91 | 0 | return nullptr; |
92 | 0 | } |
93 | | |
94 | | void |
95 | | StreamTracks::ForgetUpTo(StreamTime aTime) |
96 | 0 | { |
97 | 0 | // Only prune if there is a reasonable chunk (50ms @ 48kHz) to forget, so we |
98 | 0 | // don't spend too much time pruning segments. |
99 | 0 | const StreamTime minChunkSize = 2400; |
100 | 0 | if (aTime < mForgottenTime + minChunkSize) { |
101 | 0 | return; |
102 | 0 | } |
103 | 0 | mForgottenTime = aTime; |
104 | 0 |
|
105 | 0 | for (uint32_t i = 0; i < mTracks.Length(); ++i) { |
106 | 0 | Track* track = mTracks[i]; |
107 | 0 | StreamTime forgetTo = std::min(track->GetEnd() - 1, aTime); |
108 | 0 | track->ForgetUpTo(forgetTo); |
109 | 0 | } |
110 | 0 | } |
111 | | |
112 | | void |
113 | | StreamTracks::Clear() |
114 | 0 | { |
115 | 0 | mTracks.Clear(); |
116 | 0 | } |
117 | | |
118 | | } // namespace mozilla |