-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathDataPacket.h
185 lines (159 loc) · 3.74 KB
/
DataPacket.h
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
#pragma once
#include <functional>
#include <iostream>
extern "C" {
#include <libavutil\mem.h> //for av_mallocz and av_free
}
using namespace std;
// define a datapacket for a frame
class DataPacket
{
private:
unsigned char* DataPtr;
int Capacity;
int Size;
int RefID;
public:
// constructor
DataPacket(const int sz = 0) :
DataPtr(nullptr), Capacity(0), Size(0), RefID(0xFFFFFFFF)
{
resize(sz);
}
// copy constructor
DataPacket(const DataPacket& d):
DataPtr(nullptr), Capacity(0), Size(0)
{
resize(d.Size);
if (d.Size != 0) {
memcpy(DataPtr, d.DataPtr, d.Size);
}
RefID = d.RefID;
}
// move constructor
DataPacket(DataPacket&& d) :
DataPtr(nullptr), Capacity(0), Size(0), RefID(0xFFFFFFFF)
{
swap(d);
}
~DataPacket() {
if (DataPtr != nullptr) {
av_free(DataPtr);
DataPtr = nullptr;
Capacity = 0;
Size = 0;
}
}
int ref_id(void) const {
return RefID;
}
void set_ref_id(int id) {
RefID = id;
}
void resize(const int& sz) {
if (sz < 0) {
cout << "invalid data packet size" << endl;
return;
}
if (sz > Capacity) {
if (DataPtr != nullptr) {
av_free(DataPtr);
Capacity = 0;
DataPtr = nullptr;
}
if (sz > 0) {
DataPtr = (uint8_t*)av_mallocz(sz);
Capacity = sz;
}
}
Size = sz;
}
void clear()
{
resize(0);
}
void copy(const uint8_t* buff, const int& sz) {
if (sz <= 0) return;
if (sz > Size) {
resize(sz);
}
memcpy(DataPtr, buff, sz);
}
bool empty(void) const {
return (Size == 0);
}
int size(void) const {
return Size;
}
uint8_t* data_ptr(void) {
return DataPtr;
}
void swap(DataPacket& d) {
std::swap(DataPtr, d.DataPtr);
std::swap(Size, d.Size);
std::swap(Capacity, d.Capacity);
std::swap(RefID, d.RefID);
}
};
/// <summary>
/// a queue for datapacket buffer
/// </summary>
/// <typeparam name="sz"></typeparam>
template<std::size_t sz>
class PacketCircularQueue {
private:
const std::size_t BufferSize; // buffer max size
std::size_t DataSize; // buffer current size
std::size_t DataFront;
std::size_t DataRear;
public:
PacketCircularQueue() :
DataSize(0), BufferSize(sz), DataFront(0), DataRear(sz - 1)
{
}
size_t size() const {
return DataSize;
}
size_t capacity() const {
return BufferSize;
}
bool full() const {
return (DataSize == BufferSize);
}
bool empty() const {
return (DataSize == 0);
}
/* Insert a new element from the end of the queue and return its position (logical) */
size_t push_back() {
++DataRear;
if (DataRear == BufferSize) {
DataRear = 0;
}
if (DataSize == BufferSize) {
pop_front();
}
else {
++DataSize;
}
return DataRear;
}
/* Remove an element from the head of the queue and return its position */
size_t pop_front() {
size_t pos = 0xFFFFFFFF;
if (DataSize > 0) {
pos = DataFront;
++DataFront;
if (DataFront == BufferSize) {
DataFront = 0;
}
--DataSize;
};
return pos;
}
size_t front() const {
return DataFront;
}
size_t rear() const {
return DataRear;
}
};