blob: 955af51f6be3069e742cce44f7c40153ba1d1e04 (
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
|
/*
* Copyright 2015 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 "webrtc/base/bufferqueue.h"
namespace rtc {
BufferQueue::BufferQueue(size_t capacity, size_t default_size)
: capacity_(capacity), default_size_(default_size) {
}
BufferQueue::~BufferQueue() {
CritScope cs(&crit_);
for (Buffer* buffer : queue_) {
delete buffer;
}
for (Buffer* buffer : free_list_) {
delete buffer;
}
}
size_t BufferQueue::size() const {
CritScope cs(&crit_);
return queue_.size();
}
bool BufferQueue::ReadFront(void* buffer, size_t bytes, size_t* bytes_read) {
CritScope cs(&crit_);
if (queue_.empty()) {
return false;
}
Buffer* packet = queue_.front();
queue_.pop_front();
size_t next_packet_size = packet->size();
if (bytes > next_packet_size) {
bytes = next_packet_size;
}
memcpy(buffer, packet->data(), bytes);
if (bytes_read) {
*bytes_read = bytes;
}
free_list_.push_back(packet);
return true;
}
bool BufferQueue::WriteBack(const void* buffer, size_t bytes,
size_t* bytes_written) {
CritScope cs(&crit_);
if (queue_.size() == capacity_) {
return false;
}
Buffer* packet;
if (!free_list_.empty()) {
packet = free_list_.back();
free_list_.pop_back();
} else {
packet = new Buffer(bytes, default_size_);
}
packet->SetData(static_cast<const uint8_t*>(buffer), bytes);
if (bytes_written) {
*bytes_written = bytes;
}
queue_.push_back(packet);
return true;
}
} // namespace rtc
|
