blob: 05c2bc62aa596ef3a854cc5c42548158dd246d94 (
plain)
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
|
/* Copyright (C) 2013 Mamadou DIOP
* Copyright (C) 2013 Doubango Telecom <http://www.doubango.org>
*
* This file is part of Open Source Doubango Framework.
*
* DOUBANGO is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* DOUBANGO is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with DOUBANGO.
*/
#include "mf_sample_queue.h"
#include <assert.h>
MFSampleQueue::MFSampleQueue()
: m_nRefCount(1)
, m_nCount(0)
{
InitializeCriticalSection(&m_critSec);
m_anchor.next = &m_anchor;
m_anchor.prev = &m_anchor;
}
MFSampleQueue::~MFSampleQueue()
{
assert(m_nRefCount == 0);
Clear();
DeleteCriticalSection(&m_critSec);
}
STDMETHODIMP MFSampleQueue::QueryInterface(REFIID iid, void** ppv)
{
return E_NOTIMPL;
}
STDMETHODIMP_(ULONG) MFSampleQueue::AddRef()
{
return InterlockedIncrement(&m_nRefCount);
}
STDMETHODIMP_(ULONG) MFSampleQueue::Release()
{
ULONG uCount = InterlockedDecrement(&m_nRefCount);
if (uCount == 0)
{
delete this;
}
// For thread safety, return a temporary variable.
return uCount;
}
HRESULT MFSampleQueue::Queue(IMFSample* item)
{
if (item == NULL)
{
return E_POINTER;
}
Node *pNode = new (std::nothrow) Node(item);
if (pNode == NULL)
{
return E_OUTOFMEMORY;
}
item->AddRef();
EnterCriticalSection(&m_critSec);
Node *pBefore = m_anchor.prev;
Node *pAfter = pBefore->next;
pBefore->next = pNode;
pAfter->prev = pNode;
pNode->prev = pBefore;
pNode->next = pAfter;
m_nCount++;
LeaveCriticalSection(&m_critSec);
return S_OK;
}
HRESULT MFSampleQueue::Dequeue(IMFSample* *ppItem)
{
if (ppItem == NULL)
{
return E_POINTER;
}
EnterCriticalSection(&m_critSec);
if (IsEmpty())
{
LeaveCriticalSection(&m_critSec);
return E_FAIL;
}
Node *pNode = m_anchor.next;
// The next node's previous is this node's previous.
pNode->next->prev = m_anchor.next->prev;
// The previous node's next is this node's next.
pNode->prev->next = pNode->next;
*ppItem = pNode->item;
delete pNode;
m_nCount--;
LeaveCriticalSection(&m_critSec);
return S_OK;
}
HRESULT MFSampleQueue::Clear()
{
EnterCriticalSection(&m_critSec);
Node *n = m_anchor.next;
// Delete the nodes
while (n != &m_anchor)
{
if (n->item)
{
n->item->Release();
}
Node *tmp = n->next;
delete n;
n = tmp;
}
// Reset the anchor to point at itself
m_anchor.next = &m_anchor;
m_anchor.prev = &m_anchor;
m_nCount = 0;
LeaveCriticalSection(&m_critSec);
return S_OK;
}
|
