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
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* [email protected] *
* *
* This program 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 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include <util/log.h>
#include <torrent/globals.h>
#include "circularbuffer.h"
#include "bufferedsocket.h"
using namespace bt;
namespace net
{
CircularBuffer::CircularBuffer(Uint32 max_size) : buf(0),max_size(max_size),first(0),size(0)
{
buf = new Uint8[max_size];
}
CircularBuffer::~CircularBuffer()
{
delete [] buf;
}
Uint32 CircularBuffer::freeSpace() const
{
return max_size - size;
}
Uint32 CircularBuffer::write(const Uint8* data,Uint32 dsize)
{
if (size == max_size)
return 0;
mutex.lock();
Uint32 wp = (first + size) % max_size;
Uint32 j = 0;
while (size < max_size && (dsize == 0 || j < dsize))
{
buf[wp] = data[j];
j++;
wp = (wp + 1) % max_size;
size++;
}
mutex.unlock();
return j;
}
Uint32 CircularBuffer::read(Uint8* data,Uint32 max_to_read)
{
if (!size)
return 0;
mutex.lock();
Uint32 j = 0;
while (size > 0 && j < max_to_read)
{
data[j] = buf[first];
j++;
first = (first + 1) % max_size;
size--;
}
mutex.unlock();
return j;
}
Uint32 CircularBuffer::send(BufferedSocket* s,Uint32 max)
{
if (!size)
return 0;
Uint32 ret = 0;
mutex.lock();
if (first + size <= max_size)
{
Uint32 ts = size;
if (max > 0 && size > max)
ts = max;
ret = s->send(buf + first,ts);
first += ret;
size -= ret;
}
else if (max > 0) // if there is a limit
{
// write from first to the end of the buffer
Uint32 to_send = max_size - first;
if (to_send > max)
to_send = max;
ret = s->send(buf + first,to_send);
// update first, wrap around if necessary
first = (first + ret) % max_size;
size -= ret; // ret bytes less in the buffer
max -= ret; // decrease limit
if (max > 0 && ret == to_send && size > 0)
{
// we have sent everything so we can send more
to_send = size > max ? max : size;
Uint32 ret2 = s->send(buf,to_send);
ret += ret2;
first += ret2;
size -= ret2;
}
}
else // no limit
{
Uint32 to_send = max_size - first;
ret = s->send(buf + first,to_send);
// update first, wrap around if necessary
first = (first + ret) % max_size;
size -= ret; // ret bytes less in the buffer
if (ret == to_send && size > 0)
{
// we have sent everything so we can send more
Uint32 ret2 = s->send(buf,size);
ret += ret2;
first += ret2;
size -= ret2;
}
}
mutex.unlock();
return ret;
}
}
|
