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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the Qt3Support module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "q3membuf_p.h"
QT_BEGIN_NAMESPACE
// *******************************************************************
// QMembuf declaration and implementation
// *******************************************************************
/* \internal
This class implements an efficient buffering of data that is often used by
asynchronous IO classes like QSocket, QHttp and QProcess.
*/
Q3Membuf::Q3Membuf() : _size(0), _index(0)
{
}
Q3Membuf::~Q3Membuf()
{
while (!buf.isEmpty())
delete buf.takeFirst();
}
/*! \internal
This function consumes \a nbytes bytes of data from the
buffer and copies it into \a sink. If \a sink is a 0 pointer
the data goes into the nirvana.
*/
bool Q3Membuf::consumeBytes(Q_ULONG nbytes, char *sink)
{
if (nbytes <= 0 || (qint64)nbytes > _size)
return false;
_size -= nbytes;
while (!buf.isEmpty()) {
QByteArray *a = buf.first();
if ((int)(_index + nbytes) >= a->size()) {
// Here we skip the whole byte array and get the next later
int len = a->size() - _index;
if (sink) {
memcpy(sink, a->constData()+_index, len);
sink += len;
}
nbytes -= len;
buf.removeFirst();
delete a;
_index = 0;
if (nbytes == 0)
break;
} else {
// Here we skip only a part of the first byte array
if (sink)
memcpy(sink, a->constData()+_index, nbytes);
_index += nbytes;
break;
}
}
return true;
}
/*! \internal
Scans for any occurrence of '\n' in the buffer. If \a store
is not 0 the text up to the first '\n' (or terminating 0) is
written to \a store, and a terminating 0 is appended to \a store
if necessary. Returns true if a '\n' was found; otherwise returns
false.
*/
bool Q3Membuf::scanNewline(QByteArray *store)
{
if (_size == 0)
return false;
int i = 0; // index into 'store'
QByteArray *a = 0;
char *p;
int n;
bool retval = false;
for (int j = 0; j < buf.size(); ++j) {
a = buf.at(j);
p = a->data();
n = a->size();
if (!j) {
// first buffer
p += _index;
n -= _index;
}
if (store) {
while (n-- > 0) {
*(store->data()+i) = *p;
if (++i == (int)store->size())
store->resize(store->size() < 256
? 1024 : store->size()*4);
if (*p == '\n') {
retval = true;
goto end;
}
p++;
}
} else {
while (n-- > 0) {
if(*p == '\n')
return true;
p++;
}
}
}
end:
if (store)
store->resize(i);
return retval;
}
int Q3Membuf::ungetch(int ch)
{
if (buf.isEmpty() || _index==0) {
// we need a new QByteArray
QByteArray *ba = new QByteArray;
ba->resize(1);
buf.prepend(ba);
_size++;
(*ba)[0] = ch;
} else {
// we can reuse a place in the buffer
QByteArray *ba = buf.first();
_index--;
_size++;
(*ba)[(int)_index] = ch;
}
return ch;
}
QT_END_NAMESPACE
|
