author | Eckhart Koeppen <eckhart.koppen@nokia.com> |
Thu, 08 Apr 2010 14:19:33 +0300 | |
branch | RCL_3 |
changeset 8 | 3f74d0d4af4c |
parent 4 | 3b1da2848fc7 |
child 30 | 5dc02b23752f |
permissions | -rw-r--r-- |
0 | 1 |
/**************************************************************************** |
2 |
** |
|
4
3b1da2848fc7
Revision: 201003
Dremov Kirill (Nokia-D-MSW/Tampere) <kirill.dremov@nokia.com>
parents:
0
diff
changeset
|
3 |
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies). |
0 | 4 |
** All rights reserved. |
5 |
** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 |
** |
|
7 |
** This file is part of the examples of the Qt Toolkit. |
|
8 |
** |
|
9 |
** $QT_BEGIN_LICENSE:LGPL$ |
|
10 |
** No Commercial Usage |
|
11 |
** This file contains pre-release code and may not be distributed. |
|
12 |
** You may use this file in accordance with the terms and conditions |
|
13 |
** contained in the Technology Preview License Agreement accompanying |
|
14 |
** this package. |
|
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 |
** |
|
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. |
|
27 |
** |
|
28 |
** If you have questions regarding the use of this file, please contact |
|
29 |
** Nokia at qt-info@nokia.com. |
|
30 |
** |
|
31 |
** |
|
32 |
** |
|
33 |
** |
|
34 |
** |
|
35 |
** |
|
36 |
** |
|
37 |
** |
|
38 |
** $QT_END_LICENSE$ |
|
39 |
** |
|
40 |
****************************************************************************/ |
|
41 |
||
42 |
#include "bencodeparser.h" |
|
43 |
||
44 |
#include <QList> |
|
45 |
#include <QMetaType> |
|
46 |
||
47 |
BencodeParser::BencodeParser() |
|
48 |
{ |
|
49 |
} |
|
50 |
||
51 |
bool BencodeParser::parse(const QByteArray &content) |
|
52 |
{ |
|
53 |
if (content.isEmpty()) { |
|
54 |
errString = QString("No content"); |
|
55 |
return false; |
|
56 |
} |
|
57 |
||
58 |
this->content = content; |
|
59 |
index = 0; |
|
60 |
infoStart = 0; |
|
61 |
infoLength = 0; |
|
62 |
return getDictionary(&dictionaryValue); |
|
63 |
} |
|
64 |
||
65 |
QString BencodeParser::errorString() const |
|
66 |
{ |
|
67 |
return errString; |
|
68 |
} |
|
69 |
||
70 |
QMap<QByteArray, QVariant> BencodeParser::dictionary() const |
|
71 |
{ |
|
72 |
return dictionaryValue; |
|
73 |
} |
|
74 |
||
75 |
QByteArray BencodeParser::infoSection() const |
|
76 |
{ |
|
77 |
return content.mid(infoStart, infoLength); |
|
78 |
} |
|
79 |
||
80 |
bool BencodeParser::getByteString(QByteArray *byteString) |
|
81 |
{ |
|
82 |
const int contentSize = content.size(); |
|
83 |
int size = -1; |
|
84 |
do { |
|
85 |
char c = content.at(index); |
|
86 |
if (c < '0' || c > '9') { |
|
87 |
if (size == -1) |
|
88 |
return false; |
|
89 |
if (c != ':') { |
|
90 |
errString = QString("Unexpected character at pos %1: %2") |
|
91 |
.arg(index).arg(c); |
|
92 |
return false; |
|
93 |
} |
|
94 |
++index; |
|
95 |
break; |
|
96 |
} |
|
97 |
if (size == -1) |
|
98 |
size = 0; |
|
99 |
size *= 10; |
|
100 |
size += c - '0'; |
|
101 |
} while (++index < contentSize); |
|
102 |
||
103 |
if (byteString) |
|
104 |
*byteString = content.mid(index, size); |
|
105 |
index += size; |
|
106 |
return true; |
|
107 |
} |
|
108 |
||
109 |
bool BencodeParser::getInteger(qint64 *integer) |
|
110 |
{ |
|
111 |
const int contentSize = content.size(); |
|
112 |
if (content.at(index) != 'i') |
|
113 |
return false; |
|
114 |
||
115 |
++index; |
|
116 |
qint64 num = -1; |
|
117 |
bool negative = false; |
|
118 |
||
119 |
do { |
|
120 |
char c = content.at(index); |
|
121 |
if (c < '0' || c > '9') { |
|
122 |
if (num == -1) { |
|
123 |
if (c != '-' || negative) |
|
124 |
return false; |
|
125 |
negative = true; |
|
126 |
continue; |
|
127 |
} else { |
|
128 |
if (c != 'e') { |
|
129 |
errString = QString("Unexpected character at pos %1: %2") |
|
130 |
.arg(index).arg(c); |
|
131 |
return false; |
|
132 |
} |
|
133 |
++index; |
|
134 |
break; |
|
135 |
} |
|
136 |
} |
|
137 |
if (num == -1) |
|
138 |
num = 0; |
|
139 |
num *= 10; |
|
140 |
num += c - '0'; |
|
141 |
} while (++index < contentSize); |
|
142 |
||
143 |
if (integer) |
|
144 |
*integer = negative ? -num : num; |
|
145 |
return true; |
|
146 |
} |
|
147 |
||
148 |
bool BencodeParser::getList(QList<QVariant> *list) |
|
149 |
{ |
|
150 |
const int contentSize = content.size(); |
|
151 |
if (content.at(index) != 'l') |
|
152 |
return false; |
|
153 |
||
154 |
QList<QVariant> tmp; |
|
155 |
++index; |
|
156 |
||
157 |
do { |
|
158 |
if (content.at(index) == 'e') { |
|
159 |
++index; |
|
160 |
break; |
|
161 |
} |
|
162 |
||
163 |
qint64 number; |
|
164 |
QByteArray byteString; |
|
165 |
QList<QVariant> tmpList; |
|
166 |
QMap<QByteArray, QVariant> dictionary; |
|
167 |
||
168 |
if (getInteger(&number)) |
|
169 |
tmp << number; |
|
170 |
else if (getByteString(&byteString)) |
|
171 |
tmp << byteString; |
|
172 |
else if (getList(&tmpList)) |
|
173 |
tmp << tmpList; |
|
174 |
else if (getDictionary(&dictionary)) |
|
175 |
tmp << qVariantFromValue<QMap<QByteArray, QVariant> >(dictionary); |
|
176 |
else { |
|
177 |
errString = QString("error at index %1").arg(index); |
|
178 |
return false; |
|
179 |
} |
|
180 |
} while (index < contentSize); |
|
181 |
||
182 |
if (list) |
|
183 |
*list = tmp; |
|
184 |
return true; |
|
185 |
} |
|
186 |
||
187 |
bool BencodeParser::getDictionary(QMap<QByteArray, QVariant> *dictionary) |
|
188 |
{ |
|
189 |
const int contentSize = content.size(); |
|
190 |
if (content.at(index) != 'd') |
|
191 |
return false; |
|
192 |
||
193 |
QMap<QByteArray, QVariant> tmp; |
|
194 |
++index; |
|
195 |
||
196 |
do { |
|
197 |
if (content.at(index) == 'e') { |
|
198 |
++index; |
|
199 |
break; |
|
200 |
} |
|
201 |
||
202 |
QByteArray key; |
|
203 |
if (!getByteString(&key)) |
|
204 |
break; |
|
205 |
||
206 |
if (key == "info") |
|
207 |
infoStart = index; |
|
208 |
||
209 |
qint64 number; |
|
210 |
QByteArray byteString; |
|
211 |
QList<QVariant> tmpList; |
|
212 |
QMap<QByteArray, QVariant> dictionary; |
|
213 |
||
214 |
if (getInteger(&number)) |
|
215 |
tmp.insert(key, number); |
|
216 |
else if (getByteString(&byteString)) |
|
217 |
tmp.insert(key, byteString); |
|
218 |
else if (getList(&tmpList)) |
|
219 |
tmp.insert(key, tmpList); |
|
220 |
else if (getDictionary(&dictionary)) |
|
221 |
tmp.insert(key, qVariantFromValue<QMap<QByteArray, QVariant> >(dictionary)); |
|
222 |
else { |
|
223 |
errString = QString("error at index %1").arg(index); |
|
224 |
return false; |
|
225 |
} |
|
226 |
||
227 |
if (key == "info") |
|
228 |
infoLength = index - infoStart; |
|
229 |
||
230 |
} while (index < contentSize); |
|
231 |
||
232 |
if (dictionary) |
|
233 |
*dictionary = tmp; |
|
234 |
return true; |
|
235 |
} |