blob: b110a06fe89120c00413f6cc75cdc96e6a18fe42 (
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
|
/* 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.
*/
#ifndef PLUGIN_WIN_MF_SAMPLE_QUEUE_H
#define PLUGIN_WIN_MF_SAMPLE_QUEUE_H
#include "../plugin_win_mf_config.h"
#include <new>
#include <mfapi.h>
#include <mfidl.h>
#include <Mferror.h>
#include <shlwapi.h>
class MFSampleQueue : public IUnknown
{
protected:
// Nodes in the linked list
struct Node {
Node *prev;
Node *next;
IMFSample* item;
Node() : prev(NULL), next(NULL) {
}
Node(IMFSample* item) : prev(NULL), next(NULL) {
this->item = item;
}
IMFSample* Item() const {
return item;
}
};
protected:
Node m_anchor;
long m_nCount;
CRITICAL_SECTION m_critSec;
private:
long m_nRefCount;
public:
MFSampleQueue();
virtual ~MFSampleQueue();
// IUnknown
STDMETHODIMP QueryInterface(REFIID iid, void** ppv);
STDMETHODIMP_(ULONG) AddRef();
STDMETHODIMP_(ULONG) Release();
HRESULT Queue(IMFSample* item);
HRESULT Dequeue(IMFSample**ppItem);
HRESULT Clear();
inline BOOL IsEmpty() const {
return m_anchor.next == &m_anchor;
}
inline long Count() {
return m_nCount;
}
};
#endif /* PLUGIN_WIN_MF_SAMPLE_QUEUE_H */
|