File: timestamp_map.cc

package info (click to toggle)
chromium-browser 41.0.2272.118-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie-kfreebsd
  • size: 2,189,132 kB
  • sloc: cpp: 9,691,462; ansic: 3,341,451; python: 712,689; asm: 518,779; xml: 208,926; java: 169,820; sh: 119,353; perl: 68,907; makefile: 28,311; yacc: 13,305; objc: 11,385; tcl: 3,186; cs: 2,225; sql: 2,217; lex: 2,215; lisp: 1,349; pascal: 1,256; awk: 407; ruby: 155; sed: 53; php: 14; exp: 11
file content (99 lines) | stat: -rw-r--r-- 2,388 bytes parent folder | download | duplicates (14)
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
/*
 *  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 <assert.h>
#include <stdlib.h>
#include "webrtc/modules/video_coding/main/source/timestamp_map.h"

namespace webrtc {

// Constructor. Optional parameter specifies maximum number of
// coexisting timers.
VCMTimestampMap::VCMTimestampMap(int32_t length):
    _nextAddIx(0),
    _nextPopIx(0)
{
    if (length <= 0)
    {
        // default
        length = 10;
    }

    _map = new VCMTimestampDataTuple[length];
    _length = length;
}

// Destructor.
VCMTimestampMap::~VCMTimestampMap()
{
    delete [] _map;
}

// Empty the list of timers.
void
VCMTimestampMap::Reset()
{
    _nextAddIx = 0;
    _nextPopIx = 0;
}

int32_t
VCMTimestampMap::Add(uint32_t timestamp, void* data)
{
    _map[_nextAddIx].timestamp = timestamp;
    _map[_nextAddIx].data = data;
    _nextAddIx = (_nextAddIx + 1) % _length;

    if (_nextAddIx == _nextPopIx)
    {
        // Circular list full; forget oldest entry
        _nextPopIx = (_nextPopIx + 1) % _length;
        return -1;
    }
    return 0;
}

void*
VCMTimestampMap::Pop(uint32_t timestamp)
{
    while (!IsEmpty())
    {
        if (_map[_nextPopIx].timestamp == timestamp)
        {
            // found start time for this timestamp
            void* data = _map[_nextPopIx].data;
            _map[_nextPopIx].data = NULL;
            _nextPopIx = (_nextPopIx + 1) % _length;
            return data;
        }
        else if (_map[_nextPopIx].timestamp > timestamp)
        {
            // the timestamp we are looking for is not in the list
            assert(_nextPopIx < _length && _nextPopIx >= 0);
            return NULL;
        }

        // not in this position, check next (and forget this position)
        _nextPopIx = (_nextPopIx + 1) % _length;
    }

    // could not find matching timestamp in list
    assert(_nextPopIx < _length && _nextPopIx >= 0);
    return NULL;
}

// Check if no timers are currently running
bool
VCMTimestampMap::IsEmpty() const
{
    return (_nextAddIx == _nextPopIx);
}

}