-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtnetstring.cpp
457 lines (398 loc) · 8.8 KB
/
tnetstring.cpp
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
/*
* Copyright (C) 2012-2022 Fanout, Inc.
*
* $FANOUT_BEGIN_LICENSE:APACHE2$
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* $FANOUT_END_LICENSE$
*/
#include "tnetstring.h"
#include <assert.h>
namespace TnetString {
QByteArray fromByteArray(const QByteArray &in)
{
return QByteArray::number(in.size()) + ':' + in + ',';
}
QByteArray fromInt(qint64 in)
{
QByteArray val = QByteArray::number(in);
return QByteArray::number(val.size()) + ':' + val + '#';
}
QByteArray fromDouble(double in)
{
QByteArray val = QByteArray::number(in);
return QByteArray::number(val.size()) + ':' + val + '^';
}
QByteArray fromBool(bool in)
{
QByteArray val = in ? "true" : "false";
return QByteArray::number(val.size()) + ':' + val + '!';
}
QByteArray fromNull()
{
return QByteArray("0:~");
}
QByteArray fromVariant(const QVariant &in)
{
switch(in.type())
{
case QVariant::ByteArray:
return fromByteArray(in.toByteArray());
case QVariant::Double:
return fromDouble(in.toDouble());
case QVariant::Bool:
return fromBool(in.toBool());
case QVariant::Invalid:
return fromNull();
case QVariant::Hash:
return fromHash(in.toHash());
case QVariant::List:
return fromList(in.toList());
default:
if(in.canConvert(QVariant::LongLong))
return fromInt(in.toLongLong());
// unsupported type
assert(0);
return QByteArray();
}
}
QByteArray fromHash(const QVariantHash &in)
{
QByteArray val;
QHashIterator<QString, QVariant> it(in);
while(it.hasNext())
{
it.next();
val += fromByteArray(it.key().toUtf8());
val += fromVariant(it.value());
}
return QByteArray::number(val.size()) + ':' + val + '}';
}
QByteArray fromList(const QVariantList &in)
{
QByteArray val;
foreach(const QVariant &v, in)
val += fromVariant(v);
return QByteArray::number(val.size()) + ':' + val + ']';
}
bool check(const QByteArray &in, int offset, Type *type, int *dataOffset, int *dataSize)
{
int at = in.indexOf(':', offset);
if(at == -1)
return false;
bool ok;
int size = in.mid(offset, at - offset).toInt(&ok);
if(!ok || size < 0)
return false;
char typeChar = in[at + 1 + size];
Type type_;
switch(typeChar)
{
case ',': type_ = ByteArray; break;
case '#': type_ = Int; break;
case '^': type_ = Double; break;
case '!': type_ = Bool; break;
case '~': type_ = Null; break;
case '}': type_ = Hash; break;
case ']': type_ = List; break;
default: return false;
}
*type = type_;
*dataOffset = at + 1;
*dataSize = size;
return true;
}
QByteArray toByteArray(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
if(ok)
*ok = true;
return in.mid(dataOffset, dataSize);
}
qint64 toInt(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
QByteArray val = in.mid(dataOffset, dataSize);
bool ok_;
qint64 x = val.toLongLong(&ok_);
if(!ok_)
x = 0;
if(ok)
*ok = ok_;
return x;
}
double toDouble(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
QByteArray val = in.mid(dataOffset, dataSize);
bool ok_;
double x = val.toDouble(&ok_);
if(!ok_)
x = 0;
if(ok)
*ok = ok_;
return x;
}
bool toBool(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
QByteArray val = in.mid(dataOffset, dataSize);
if(val == "true")
{
if(ok)
*ok = true;
return true;
}
else if(val == "false")
{
if(ok)
*ok = true;
return false;
}
if(ok)
*ok = false;
return false;
}
void toNull(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(in);
Q_UNUSED(offset);
Q_UNUSED(dataOffset);
Q_UNUSED(dataSize);
*ok = true;
}
QVariant toVariant(const QByteArray &in, int offset, Type type, int dataOffset, int dataSize, bool *ok)
{
QVariant val;
bool ok_ = false;
switch(type)
{
case ByteArray:
val = toByteArray(in, offset, dataOffset, dataSize, &ok_);
break;
case Int:
val = toInt(in, offset, dataOffset, dataSize, &ok_);
break;
case Double:
val = toDouble(in, offset, dataOffset, dataSize, &ok_);
break;
case Bool:
val = toBool(in, offset, dataOffset, dataSize, &ok_);
break;
case Null:
toNull(in, offset, dataOffset, dataSize, &ok_);
break;
case Hash:
val = toHash(in, offset, dataOffset, dataSize, &ok_);
break;
case List:
val = toList(in, offset, dataOffset, dataSize, &ok_);
break;
}
if(!ok_)
{
if(ok)
*ok = false;
return QVariant();
}
if(ok)
*ok = true;
return val;
}
QVariant toVariant(const QByteArray &in, int offset, bool *ok)
{
Type type;
int dataOffset;
int dataSize;
if(!check(in, offset, &type, &dataOffset, &dataSize))
{
if(ok)
*ok = false;
return QVariant();
}
return toVariant(in, offset, type, dataOffset, dataSize, ok);
}
QVariantHash toHash(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
QVariantHash out;
int at = dataOffset;
while(at < dataSize + dataOffset)
{
Type itype;
int ioffset;
int isize;
if(!check(in, at, &itype, &ioffset, &isize))
{
if(ok)
*ok = false;
return QVariantHash();
}
if(itype != ByteArray)
{
if(ok)
*ok = false;
return QVariantHash();
}
bool ok_;
QByteArray key = toByteArray(in, at, ioffset, isize, &ok_);
if(!ok_)
{
if(ok)
*ok = false;
return QVariantHash();
}
at = ioffset + isize + 1; // position to value
if(!check(in, at, &itype, &ioffset, &isize))
{
if(ok)
*ok = false;
return QVariantHash();
}
QVariant val = toVariant(in, at, itype, ioffset, isize, &ok_);
if(!ok_)
{
if(ok)
*ok = false;
return QVariantHash();
}
out[QString::fromUtf8(key)] = val;
at = ioffset + isize + 1; // position to next item
}
if(ok)
*ok = true;
return out;
}
QVariantList toList(const QByteArray &in, int offset, int dataOffset, int dataSize, bool *ok)
{
Q_UNUSED(offset);
QVariantList out;
int at = dataOffset;
while(at < dataOffset + dataSize)
{
Type itype;
int ioffset;
int isize;
if(!check(in, at, &itype, &ioffset, &isize))
{
if(ok)
*ok = false;
return QVariantList();
}
bool ok_;
QVariant val = toVariant(in, at, itype, ioffset, isize, &ok_);
if(!ok_)
{
if(ok)
*ok = false;
return QVariantList();
}
out += val;
at = ioffset + isize + 1; // position to next item
}
if(ok)
*ok = true;
return out;
}
QString byteArrayToEscapedString(const QByteArray &in)
{
QString out;
for(int n = 0; n < in.size(); ++n)
{
char c = in[n];
if(c == '\\')
out += "\\\\";
else if(c == '\"')
out += "\\\"";
else if(c == '\n')
out += "\\n";
else if(c >= 0x20 && c < 0x7f)
out += QChar::fromLatin1(c);
else
out += QString::asprintf("\\x%02x", (unsigned char)c);
}
return out;
}
QString variantToString(const QVariant &in, int indent)
{
QString out;
QVariant::Type type = in.type();
if(type == QVariant::Hash)
{
QVariantHash hash = in.toHash();
out += '{';
if(indent >= 0)
out += '\n';
else
out += ' ';
QHashIterator<QString, QVariant> it(hash);
while(it.hasNext())
{
it.next();
if(indent >= 0)
out += QString(indent + 2, ' ');
out += '\"' + byteArrayToEscapedString(it.key().toUtf8()) + "\": " + variantToString(it.value(), indent >= 0 ? indent + 2 : -1);
if(it.hasNext())
out += ',';
if(indent >= 0)
out += '\n';
else
out += ' ';
}
if(indent >= 0)
out += QString(indent, ' ');
out += '}';
}
else if(type == QVariant::List)
{
QVariantList list = in.toList();
out += '[';
if(indent >= 0)
out += '\n';
else
out += ' ';
for(int n = 0; n < list.count(); ++n)
{
if(indent >= 0)
out += QString(indent + 2, ' ');
out += variantToString(list[n], indent >= 0 ? indent + 2 : -1);
if(n + 1 < list.count())
out += ',';
if(indent >= 0)
out += '\n';
else
out += ' ';
}
if(indent >= 0)
out += QString(indent, ' ');
out += ']';
}
else if(type == QVariant::ByteArray)
{
QByteArray val = in.toByteArray();
out += '\"' + byteArrayToEscapedString(val) + '\"';
}
else if(type == QVariant::Double)
out += QString::number(in.toDouble());
else if(type == QVariant::Bool)
out += in.toBool() ? "true" : "false";
else if(type == QVariant::Invalid)
out += "null";
else if(in.canConvert(QVariant::LongLong))
out += QString::number(in.toLongLong());
else
out += QString("<unknown: %1>").arg((int)type);
return out;
}
}