| /* |
| * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved. |
| * |
| * Use of this source code is governed by a BSD-style license |
| * that can be found in the LICENSE file in the root of the source |
| * tree. An additional intellectual property rights grant can be found |
| * in the file PATENTS. All contributing project authors may |
| * be found in the AUTHORS file in the root of the source tree. |
| */ |
| |
| #include "codec_timer.h" |
| |
| #include <assert.h> |
| |
| namespace webrtc |
| { |
| |
| VCMCodecTimer::VCMCodecTimer() |
| : |
| _filteredMax(0), |
| _firstDecodeTime(true), |
| _shortMax(0), |
| _history() |
| { |
| Reset(); |
| } |
| |
| WebRtc_Word32 VCMCodecTimer::StopTimer(WebRtc_Word64 startTimeMs, WebRtc_Word64 nowMs) |
| { |
| const WebRtc_Word32 timeDiff = static_cast<WebRtc_Word32>(nowMs - startTimeMs); |
| MaxFilter(timeDiff, nowMs); |
| return timeDiff; |
| } |
| |
| void VCMCodecTimer::Reset() |
| { |
| _filteredMax = 0; |
| _firstDecodeTime = true; |
| _shortMax = 0; |
| for (int i=0; i < MAX_HISTORY_SIZE; i++) |
| { |
| _history[i].shortMax = 0; |
| _history[i].timeMs = -1; |
| } |
| } |
| |
| // Update the max-value filter |
| void VCMCodecTimer::MaxFilter(WebRtc_Word32 decodeTime, WebRtc_Word64 nowMs) |
| { |
| if (!_firstDecodeTime) |
| { |
| UpdateMaxHistory(decodeTime, nowMs); |
| ProcessHistory(nowMs); |
| } |
| else |
| { |
| _firstDecodeTime = false; |
| } |
| } |
| |
| void |
| VCMCodecTimer::UpdateMaxHistory(WebRtc_Word32 decodeTime, WebRtc_Word64 now) |
| { |
| if (_history[0].timeMs >= 0 && |
| now - _history[0].timeMs < SHORT_FILTER_MS) |
| { |
| if (decodeTime > _shortMax) |
| { |
| _shortMax = decodeTime; |
| } |
| } |
| else |
| { |
| // Only add a new value to the history once a second |
| if(_history[0].timeMs == -1) |
| { |
| // First, no shift |
| _shortMax = decodeTime; |
| } |
| else |
| { |
| // Shift |
| for(int i = (MAX_HISTORY_SIZE - 2); i >= 0 ; i--) |
| { |
| _history[i+1].shortMax = _history[i].shortMax; |
| _history[i+1].timeMs = _history[i].timeMs; |
| } |
| } |
| if (_shortMax == 0) |
| { |
| _shortMax = decodeTime; |
| } |
| |
| _history[0].shortMax = _shortMax; |
| _history[0].timeMs = now; |
| _shortMax = 0; |
| } |
| } |
| |
| void |
| VCMCodecTimer::ProcessHistory(WebRtc_Word64 nowMs) |
| { |
| _filteredMax = _shortMax; |
| if (_history[0].timeMs == -1) |
| { |
| return; |
| } |
| for (int i=0; i < MAX_HISTORY_SIZE; i++) |
| { |
| if (_history[i].timeMs == -1) |
| { |
| break; |
| } |
| if (nowMs - _history[i].timeMs > MAX_HISTORY_SIZE * SHORT_FILTER_MS) |
| { |
| // This sample (and all samples after this) is too old |
| break; |
| } |
| if (_history[i].shortMax > _filteredMax) |
| { |
| // This sample is the largest one this far into the history |
| _filteredMax = _history[i].shortMax; |
| } |
| } |
| } |
| |
| // Get the maximum observed time within a time window |
| WebRtc_Word32 VCMCodecTimer::RequiredDecodeTimeMs(FrameType /*frameType*/) const |
| { |
| return _filteredMax; |
| } |
| |
| } |