[2] | 1 | /****************************************************************************
|
---|
| 2 | **
|
---|
| 3 | ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
|
---|
[561] | 4 | ** All rights reserved.
|
---|
| 5 | ** Contact: Nokia Corporation ([email protected])
|
---|
[2] | 6 | **
|
---|
| 7 | ** This file is part of the Qt3Support module of the Qt Toolkit.
|
---|
| 8 | **
|
---|
| 9 | ** $QT_BEGIN_LICENSE:LGPL$
|
---|
| 10 | ** Commercial Usage
|
---|
| 11 | ** Licensees holding valid Qt Commercial licenses may use this file in
|
---|
| 12 | ** accordance with the Qt Commercial License Agreement provided with the
|
---|
| 13 | ** Software or, alternatively, in accordance with the terms contained in
|
---|
| 14 | ** a written agreement between you and Nokia.
|
---|
| 15 | **
|
---|
| 16 | ** GNU Lesser General Public License Usage
|
---|
| 17 | ** Alternatively, this file may be used under the terms of the GNU Lesser
|
---|
| 18 | ** General Public License version 2.1 as published by the Free Software
|
---|
| 19 | ** Foundation and appearing in the file LICENSE.LGPL included in the
|
---|
| 20 | ** packaging of this file. Please review the following information to
|
---|
| 21 | ** ensure the GNU Lesser General Public License version 2.1 requirements
|
---|
| 22 | ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
---|
| 23 | **
|
---|
[561] | 24 | ** In addition, as a special exception, Nokia gives you certain additional
|
---|
| 25 | ** rights. These rights are described in the Nokia Qt LGPL Exception
|
---|
| 26 | ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
---|
[2] | 27 | **
|
---|
| 28 | ** GNU General Public License Usage
|
---|
| 29 | ** Alternatively, this file may be used under the terms of the GNU
|
---|
| 30 | ** General Public License version 3.0 as published by the Free Software
|
---|
| 31 | ** Foundation and appearing in the file LICENSE.GPL included in the
|
---|
| 32 | ** packaging of this file. Please review the following information to
|
---|
| 33 | ** ensure the GNU General Public License version 3.0 requirements will be
|
---|
| 34 | ** met: http://www.gnu.org/copyleft/gpl.html.
|
---|
| 35 | **
|
---|
[561] | 36 | ** If you have questions regarding the use of this file, please contact
|
---|
| 37 | ** Nokia at [email protected].
|
---|
[2] | 38 | ** $QT_END_LICENSE$
|
---|
| 39 | **
|
---|
| 40 | ****************************************************************************/
|
---|
| 41 |
|
---|
| 42 | #include "q3membuf_p.h"
|
---|
| 43 |
|
---|
| 44 | QT_BEGIN_NAMESPACE
|
---|
| 45 |
|
---|
| 46 | // *******************************************************************
|
---|
| 47 | // QMembuf declaration and implementation
|
---|
| 48 | // *******************************************************************
|
---|
| 49 |
|
---|
| 50 | /* \internal
|
---|
| 51 | This class implements an efficient buffering of data that is often used by
|
---|
| 52 | asynchronous IO classes like QSocket, QHttp and QProcess.
|
---|
| 53 | */
|
---|
| 54 |
|
---|
| 55 | Q3Membuf::Q3Membuf() : _size(0), _index(0)
|
---|
| 56 | {
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | Q3Membuf::~Q3Membuf()
|
---|
| 60 | {
|
---|
| 61 | while (!buf.isEmpty())
|
---|
| 62 | delete buf.takeFirst();
|
---|
| 63 | }
|
---|
| 64 |
|
---|
| 65 | /*! \internal
|
---|
| 66 | This function consumes \a nbytes bytes of data from the
|
---|
| 67 | buffer and copies it into \a sink. If \a sink is a 0 pointer
|
---|
| 68 | the data goes into the nirvana.
|
---|
| 69 | */
|
---|
| 70 | bool Q3Membuf::consumeBytes(Q_ULONG nbytes, char *sink)
|
---|
| 71 | {
|
---|
| 72 | if (nbytes <= 0 || (qint64)nbytes > _size)
|
---|
| 73 | return false;
|
---|
| 74 | _size -= nbytes;
|
---|
| 75 | while (!buf.isEmpty()) {
|
---|
| 76 | QByteArray *a = buf.first();
|
---|
| 77 | if ((int)(_index + nbytes) >= a->size()) {
|
---|
| 78 | // Here we skip the whole byte array and get the next later
|
---|
| 79 | int len = a->size() - _index;
|
---|
| 80 | if (sink) {
|
---|
| 81 | memcpy(sink, a->constData()+_index, len);
|
---|
| 82 | sink += len;
|
---|
| 83 | }
|
---|
| 84 | nbytes -= len;
|
---|
| 85 | buf.removeFirst();
|
---|
| 86 | delete a;
|
---|
| 87 | _index = 0;
|
---|
| 88 | if (nbytes == 0)
|
---|
| 89 | break;
|
---|
| 90 | } else {
|
---|
| 91 | // Here we skip only a part of the first byte array
|
---|
| 92 | if (sink)
|
---|
| 93 | memcpy(sink, a->constData()+_index, nbytes);
|
---|
| 94 | _index += nbytes;
|
---|
| 95 | break;
|
---|
| 96 | }
|
---|
| 97 | }
|
---|
| 98 | return true;
|
---|
| 99 | }
|
---|
| 100 |
|
---|
| 101 | /*! \internal
|
---|
| 102 | Scans for any occurrence of '\n' in the buffer. If \a store
|
---|
| 103 | is not 0 the text up to the first '\n' (or terminating 0) is
|
---|
| 104 | written to \a store, and a terminating 0 is appended to \a store
|
---|
| 105 | if necessary. Returns true if a '\n' was found; otherwise returns
|
---|
| 106 | false.
|
---|
| 107 | */
|
---|
| 108 | bool Q3Membuf::scanNewline(QByteArray *store)
|
---|
| 109 | {
|
---|
| 110 | if (_size == 0)
|
---|
| 111 | return false;
|
---|
| 112 | int i = 0; // index into 'store'
|
---|
| 113 | QByteArray *a = 0;
|
---|
| 114 | char *p;
|
---|
| 115 | int n;
|
---|
| 116 | bool retval = false;
|
---|
| 117 | for (int j = 0; j < buf.size(); ++j) {
|
---|
| 118 | a = buf.at(j);
|
---|
| 119 | p = a->data();
|
---|
| 120 | n = a->size();
|
---|
| 121 | if (!j) {
|
---|
| 122 | // first buffer
|
---|
| 123 | p += _index;
|
---|
| 124 | n -= _index;
|
---|
| 125 | }
|
---|
| 126 | if (store) {
|
---|
| 127 | while (n-- > 0) {
|
---|
| 128 | *(store->data()+i) = *p;
|
---|
| 129 | if (++i == (int)store->size())
|
---|
| 130 | store->resize(store->size() < 256
|
---|
| 131 | ? 1024 : store->size()*4);
|
---|
| 132 | if (*p == '\n') {
|
---|
| 133 | retval = true;
|
---|
| 134 | goto end;
|
---|
| 135 | }
|
---|
| 136 | p++;
|
---|
| 137 | }
|
---|
| 138 | } else {
|
---|
| 139 | while (n-- > 0) {
|
---|
| 140 | if(*p == '\n')
|
---|
| 141 | return true;
|
---|
| 142 | p++;
|
---|
| 143 | }
|
---|
| 144 | }
|
---|
| 145 | }
|
---|
| 146 | end:
|
---|
| 147 | if (store)
|
---|
| 148 | store->resize(i);
|
---|
| 149 | return retval;
|
---|
| 150 | }
|
---|
| 151 |
|
---|
| 152 | int Q3Membuf::ungetch(int ch)
|
---|
| 153 | {
|
---|
| 154 | if (buf.isEmpty() || _index==0) {
|
---|
| 155 | // we need a new QByteArray
|
---|
| 156 | QByteArray *ba = new QByteArray;
|
---|
| 157 | ba->resize(1);
|
---|
| 158 | buf.prepend(ba);
|
---|
| 159 | _size++;
|
---|
| 160 | (*ba)[0] = ch;
|
---|
| 161 | } else {
|
---|
| 162 | // we can reuse a place in the buffer
|
---|
| 163 | QByteArray *ba = buf.first();
|
---|
| 164 | _index--;
|
---|
| 165 | _size++;
|
---|
| 166 | (*ba)[(int)_index] = ch;
|
---|
| 167 | }
|
---|
| 168 | return ch;
|
---|
| 169 | }
|
---|
| 170 |
|
---|
| 171 | QT_END_NAMESPACE
|
---|