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
|
/*
* libjingle
* Copyright 2004--2005, Google Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <algorithm>
#include <cassert>
#include <string.h>
#include "talk/base/basictypes.h"
#include "talk/base/bytebuffer.h"
#include "talk/base/byteorder.h"
#if defined(_MSC_VER) && _MSC_VER < 1300
namespace std {
using ::memcpy;
}
#endif
namespace talk_base {
static const int DEFAULT_SIZE = 4096;
ByteBuffer::ByteBuffer() {
start_ = 0;
end_ = 0;
size_ = DEFAULT_SIZE;
bytes_ = new char[size_];
}
ByteBuffer::ByteBuffer(const char* bytes, size_t len) {
start_ = 0;
end_ = len;
size_ = len;
bytes_ = new char[size_];
memcpy(bytes_, bytes, end_);
}
ByteBuffer::ByteBuffer(const char* bytes) {
start_ = 0;
end_ = strlen(bytes);
size_ = end_;
bytes_ = new char[size_];
memcpy(bytes_, bytes, end_);
}
ByteBuffer::~ByteBuffer() {
delete bytes_;
}
bool ByteBuffer::ReadUInt8(uint8& val) {
return ReadBytes(reinterpret_cast<char*>(&val), 1);
}
bool ByteBuffer::ReadUInt16(uint16& val) {
uint16 v;
if (!ReadBytes(reinterpret_cast<char*>(&v), 2)) {
return false;
} else {
val = NetworkToHost16(v);
return true;
}
}
bool ByteBuffer::ReadUInt32(uint32& val) {
uint32 v;
if (!ReadBytes(reinterpret_cast<char*>(&v), 4)) {
return false;
} else {
val = NetworkToHost32(v);
return true;
}
}
bool ByteBuffer::ReadString(std::string& val, size_t len) {
if (len > Length()) {
return false;
} else {
val.append(bytes_ + start_, len);
start_ += len;
return true;
}
}
bool ByteBuffer::ReadBytes(char* val, size_t len) {
if (len > Length()) {
return false;
} else {
memcpy(val, bytes_ + start_, len);
start_ += len;
return true;
}
}
void ByteBuffer::WriteUInt8(uint8 val) {
WriteBytes(reinterpret_cast<const char*>(&val), 1);
}
void ByteBuffer::WriteUInt16(uint16 val) {
uint16 v = HostToNetwork16(val);
WriteBytes(reinterpret_cast<const char*>(&v), 2);
}
void ByteBuffer::WriteUInt32(uint32 val) {
uint32 v = HostToNetwork32(val);
WriteBytes(reinterpret_cast<const char*>(&v), 4);
}
void ByteBuffer::WriteString(const std::string& val) {
WriteBytes(val.c_str(), val.size());
}
void ByteBuffer::WriteBytes(const char* val, size_t len) {
if (Length() + len > Capacity())
Resize(Length() + len);
memcpy(bytes_ + end_, val, len);
end_ += len;
}
void ByteBuffer::Resize(size_t size) {
if (size > size_)
size = _max(size, 3 * size_ / 2);
size_t len = _min(end_ - start_, size);
char* new_bytes = new char[size];
memcpy(new_bytes, bytes_ + start_, len);
delete [] bytes_;
start_ = 0;
end_ = len;
size_ = size;
bytes_ = new_bytes;
}
void ByteBuffer::Shift(size_t size) {
if (size > Length())
return;
end_ = Length() - size;
memmove(bytes_, bytes_ + start_ + size, end_);
start_ = 0;
}
} // namespace talk_base
|
