-
Notifications
You must be signed in to change notification settings - Fork 3
/
qpack.c
1589 lines (1466 loc) · 38.8 KB
/
qpack.c
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
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* qpack.c
*
* Created on: Mar 22, 2017
* Author: Jeroen van der Heijden <jeroen@transceptor.technology>
*/
#include <qpack.h>
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#define QP__INITIAL_NEST_SIZE 2
#define QP__INITIAL_ALLOC_SZ 8
#define QP__CHKN if (n < 0) return QP_ERR; *pt += n;
#define QP__CHKT if (tp == QP_ERR) return QP_ERR;
#define QP__MINSZ 16
#define QP__FACTOR 1.4
#define QP__RETURN_INC_C \
if (packer->depth) packer->nesting[packer->depth - 1].n++; \
return 0;
#define QP_RESIZE(LEN) \
if (packer->len + LEN > packer->buffer_size) \
{ \
unsigned char * tmp; \
packer->buffer_size = \
((packer->len + LEN) / packer->alloc_size + 1) \
* packer->alloc_size; \
tmp = (unsigned char *) realloc( \
packer->buffer, \
packer->buffer_size); \
if (tmp == NULL) \
{ \
packer->buffer_size = packer->len; \
return QP_ERR_ALLOC; \
} \
packer->buffer = tmp; \
}
#define QP_PLAIN_OBJ(QP__TYPE) \
{ \
QP_RESIZE(1) \
packer->buffer[packer->len++] = QP__TYPE; \
QP__RETURN_INC_C \
}
#define QP_ADD_INT8(packer, integer) \
QP_RESIZE(2) \
if (integer >= 0 && integer < 64) \
{ \
packer->buffer[packer->len++] = integer; \
} \
else if (integer >= -60 && integer < 0) \
{ \
packer->buffer[packer->len++] = 63 - integer; \
} \
else \
{ \
packer->buffer[packer->len++] = QP__INT8; \
packer->buffer[packer->len++] = integer; \
}
#define QP_ADD_INT16(packer, integer) \
QP_RESIZE(3) \
packer->buffer[packer->len++] = QP__INT16; \
memcpy(packer->buffer + packer->len, &integer, sizeof(int16_t)); \
packer->len += sizeof(int16_t);
#define QP_ADD_INT32(packer, integer) \
QP_RESIZE(5) \
packer->buffer[packer->len++] = QP__INT32; \
memcpy(packer->buffer + packer->len, &integer, sizeof(int32_t)); \
packer->len += sizeof(int32_t);
#define QP_UNPACK_RAW(uintx_t) \
{ \
QP_UNPACK_CHECK_SZ(sizeof(uintx_t)) \
size_t sz = (size_t) *((uintx_t *) unpacker->pt); \
unpacker->pt += sizeof(uintx_t); \
QP_UNPACK_CHECK_SZ(sz) \
if (qp_obj != NULL) \
{ \
qp_obj->tp = QP_RAW; \
qp_obj->via.raw = (char *) unpacker->pt; \
qp_obj->len = sz; \
} \
unpacker->pt += sz; \
return QP_RAW; \
}
#define QP_UNPACK_INT(intx_t) \
{ \
QP_UNPACK_CHECK_SZ(sizeof(intx_t)) \
int64_t val = (int64_t) *((intx_t *) unpacker->pt); \
if (qp_obj != NULL) \
{ \
qp_obj->tp = QP_INT64; \
qp_obj->via.int64 = val; \
} \
unpacker->pt += sizeof(intx_t); \
return QP_INT64; \
}
#define QP_UNPACK_CHECK_SZ(size) \
if (unpacker->pt + size > unpacker->end) \
{ \
if (qp_obj != NULL) \
{ \
qp_obj->tp = QP_ERR; \
} \
return QP_ERR; \
}
static qp_types_t QP_print_unpacker(
FILE * stream,
qp_types_t tp,
qp_unpacker_t * unpacker,
qp_obj_t * qp_obj);
static void QP_fprint_raw(FILE * stream, const char * s, size_t n);
static int QP_res(qp_unpacker_t * unpacker, qp_res_t * res, qp_obj_t * val);
static void QP_res_destroy(qp_res_t * res);
static qp_types_t QP_sprint_unpacker(
char ** s,
size_t * sz,
char ** pt,
qp_types_t tp,
qp_unpacker_t * unpacker,
qp_obj_t * qp_obj);
static int QP_sprint_raw(
char ** s,
size_t * sz,
size_t p,
const char * d,
size_t n);
qp_packer_t * qp_packer_create(size_t alloc_size)
{
assert (alloc_size); /* alloc_size should not be 0 */
qp_packer_t * packer;
packer = (qp_packer_t *) malloc(
sizeof(qp_packer_t) +
QP__INITIAL_NEST_SIZE * sizeof(struct qp__nest_s));
if (packer != NULL)
{
packer->alloc_size = alloc_size;
packer->buffer_size = alloc_size;
packer->len = 0;
packer->depth = 0;
packer->nest_sz = QP__INITIAL_NEST_SIZE;
packer->buffer = (unsigned char *) malloc(
sizeof(unsigned char) * alloc_size);
if (packer->buffer == NULL)
{
free(packer);
packer = NULL;
}
}
return packer;
}
void qp_packer_destroy(qp_packer_t * packer)
{
free(packer->buffer);
free(packer);
}
const char * qp_strerror(int err_code)
{
switch (err_code)
{
case 0: return "success";
case QP_ERR_ALLOC: return "memory allocation error";
case QP_ERR_WRITE_STREAM: return "cannot write to stream";
case QP_ERR_CORRUPT: return "data is invalid or corrupt";
case QP_ERR_NO_OPEN_ARRAY: return "no array found to close";
case QP_ERR_NO_OPEN_MAP: return "no map found to close";
case QP_ERR_MISSING_VALUE: return "value is missing for the last key";
default: return "unknown error code";
}
}
const char * qp_version(void)
{
return QP_VERSION;
}
int qp_add_raw(qp_packer_t * packer, const char * raw, size_t len)
{
size_t required_size = len + 9;
QP_RESIZE(required_size)
if (len < 100)
{
packer->buffer[packer->len++] = 128 + len;
}
else if (len < 256)
{
uint8_t length = (uint8_t) len;
packer->buffer[packer->len++] = QP__RAW8;
packer->buffer[packer->len++] = length;
}
else if (len < 65536)
{
uint16_t length = (uint16_t) len;
packer->buffer[packer->len++] = QP__RAW16;
memcpy(packer->buffer + packer->len, &length, 2);
packer->len += 2;
}
else if (len < 4294967296)
{
uint32_t length = (uint32_t) len;
packer->buffer[packer->len++] = QP__RAW32;
memcpy(packer->buffer + packer->len, &length, 4);
packer->len += 4;
}
else
{
uint64_t length = (uint64_t) len;
packer->buffer[packer->len++] = QP__RAW64;
memcpy(packer->buffer + packer->len, &length, 8);
packer->len += 8;
}
memcpy(packer->buffer + packer->len, raw, len);
packer->len += len;
QP__RETURN_INC_C
}
int qp_add_array(qp_packer_t ** packaddr)
{
qp_packer_t * packer = *packaddr;
QP_RESIZE(1)
size_t i = packer->depth;
packer->depth++;
if (packer->depth == packer->nest_sz)
{
qp_packer_t * tmp;
packer->nest_sz *= 2;
tmp = (qp_packer_t *) realloc(
packer,
sizeof(qp_packer_t) +
packer->nest_sz * (sizeof(struct qp__nest_s)));
if (tmp == NULL)
{
packer->nest_sz /= 2;
return QP_ERR_ALLOC;
}
(*packaddr) = packer = tmp;
}
packer->nesting[i].n = 0;
packer->nesting[i].pos = packer->len;
packer->nesting[i].tp = NEST_ARRAY;
packer->buffer[packer->len++] = QP__ARRAY_OPEN;
if (i)
{
packer->nesting[i - 1].n++;
}
return 0;
}
int qp_close_array(qp_packer_t * packer)
{
struct qp__nest_s nesting;
if ( !packer->depth ||
(nesting = packer->nesting[packer->depth - 1]).tp != NEST_ARRAY)
{
return QP_ERR_NO_OPEN_ARRAY;
}
if (nesting.n > 5)
{
QP_RESIZE(1)
packer->buffer[packer->len++] = QP__ARRAY_CLOSE;
}
else
{
packer->buffer[nesting.pos] = QP__ARRAY0 + nesting.n;
}
packer->depth--;
return 0;
}
int qp_add_map(qp_packer_t ** packaddr)
{
qp_packer_t * packer = *packaddr;
QP_RESIZE(1)
size_t i = packer->depth;
packer->depth++;
if (packer->depth == packer->nest_sz)
{
qp_packer_t * tmp;
packer->nest_sz *= 2;
tmp = (qp_packer_t *) realloc(
packer,
sizeof(qp_packer_t) +
packer->nest_sz * (sizeof(struct qp__nest_s)));
if (tmp == NULL)
{
packer->nest_sz /= 2;
return QP_ERR_ALLOC;
}
(*packaddr) = packer = tmp;
}
packer->nesting[i].n = 0;
packer->nesting[i].pos = packer->len;
packer->nesting[i].tp = NEST_MAP;
packer->buffer[packer->len++] = QP__MAP_OPEN;
if (i)
{
packer->nesting[i - 1].n++;
}
return 0;
}
int qp_close_map(qp_packer_t * packer)
{
struct qp__nest_s nesting;
if ( !packer->depth ||
(nesting = packer->nesting[packer->depth - 1]).tp != NEST_MAP)
{
return QP_ERR_NO_OPEN_MAP;
}
if (nesting.n % 2)
{
return QP_ERR_MISSING_VALUE;
}
if (nesting.n > 10)
{
QP_RESIZE(1)
packer->buffer[packer->len++] = QP__MAP_CLOSE;
}
else
{
packer->buffer[nesting.pos] = QP__MAP0 + nesting.n / 2;
}
packer->depth--;
return 0;
}
int qp_add_int64(qp_packer_t * packer, int64_t i)
{
int8_t i8;
int16_t i16;
int32_t i32;
if ((i8 = (int8_t) i) == i)
{
QP_ADD_INT8(packer, i8)
}
else if ((i16 = (int16_t) i) == i)
{
QP_ADD_INT16(packer, i16)
}
else if ((i32 = (int32_t) i) == i)
{
QP_ADD_INT32(packer, i32)
}
else
{
QP_RESIZE(9)
packer->buffer[packer->len++] = QP__INT64;
memcpy(packer->buffer + packer->len, &i, sizeof(int64_t));
packer->len += sizeof(int64_t);
}
QP__RETURN_INC_C
}
int qp_add_double(qp_packer_t * packer, double d)
{
QP_RESIZE(9)
if (d == 0.0)
{
packer->buffer[packer->len++] = QP__DOUBLE_0;
}
else if (d == 1.0)
{
packer->buffer[packer->len++] = QP__DOUBLE_1;
}
else if (d == -1.0)
{
packer->buffer[packer->len++] = QP__DOUBLE_N1;
}
else
{
packer->buffer[packer->len++] = QP__DOUBLE;
memcpy(packer->buffer + packer->len, &d, sizeof(double));
packer->len += sizeof(double);
}
QP__RETURN_INC_C
}
int qp_add_true(qp_packer_t * packer) QP_PLAIN_OBJ(QP__TRUE)
int qp_add_false(qp_packer_t * packer) QP_PLAIN_OBJ(QP__FALSE)
int qp_add_null(qp_packer_t * packer) QP_PLAIN_OBJ(QP__NULL)
void qp_unpacker_init(
qp_unpacker_t * unpacker,
const unsigned char * pt,
size_t len)
{
unpacker->start = pt;
unpacker->pt = pt;
unpacker->end = pt + len;
}
qp_types_t qp_next(qp_unpacker_t * unpacker, qp_obj_t * qp_obj)
{
uint8_t tp;
if (unpacker->pt >= unpacker->end)
{
if (qp_obj != NULL)
{
qp_obj->tp = QP_END;
}
return QP_END;
}
tp = *unpacker->pt;
unpacker->pt++;
switch(tp)
{
case 0:
case 1:
case 2:
case 3:
case 4:
case 5:
case 6:
case 7:
case 8:
case 9:
case 10:
case 11:
case 12:
case 13:
case 14:
case 15:
case 16:
case 17:
case 18:
case 19:
case 20:
case 21:
case 22:
case 23:
case 24:
case 25:
case 26:
case 27:
case 28:
case 29:
case 30:
case 31:
case 32:
case 33:
case 34:
case 35:
case 36:
case 37:
case 38:
case 39:
case 40:
case 41:
case 42:
case 43:
case 44:
case 45:
case 46:
case 47:
case 48:
case 49:
case 50:
case 51:
case 52:
case 53:
case 54:
case 55:
case 56:
case 57:
case 58:
case 59:
case 60:
case 61:
case 62:
case 63:
if (qp_obj != NULL)
{
qp_obj->tp = QP_INT64;
qp_obj->via.int64 = (int64_t) tp;
}
return QP_INT64;
case 64:
case 65:
case 66:
case 67:
case 68:
case 69:
case 70:
case 71:
case 72:
case 73:
case 74:
case 75:
case 76:
case 77:
case 78:
case 79:
case 80:
case 81:
case 82:
case 83:
case 84:
case 85:
case 86:
case 87:
case 88:
case 89:
case 90:
case 91:
case 92:
case 93:
case 94:
case 95:
case 96:
case 97:
case 98:
case 99:
case 100:
case 101:
case 102:
case 103:
case 104:
case 105:
case 106:
case 107:
case 108:
case 109:
case 110:
case 111:
case 112:
case 113:
case 114:
case 115:
case 116:
case 117:
case 118:
case 119:
case 120:
case 121:
case 122:
case 123:
if (qp_obj != NULL)
{
qp_obj->tp = QP_INT64;
qp_obj->via.int64 = (int64_t) 63 - tp;
}
return QP_INT64;
case 124:
if (qp_obj != NULL)
{
qp_obj->tp = QP_HOOK;
}
return QP_HOOK;
case 125:
case 126:
case 127:
/* unpack fixed doubles -1.0, 0.0 or 1.0 */
if (qp_obj != NULL)
{
qp_obj->tp = QP_DOUBLE;
qp_obj->via.real = (double) (tp - 126);
}
return QP_DOUBLE;
case 128:
case 129:
case 130:
case 131:
case 132:
case 133:
case 134:
case 135:
case 136:
case 137:
case 138:
case 139:
case 140:
case 141:
case 142:
case 143:
case 144:
case 145:
case 146:
case 147:
case 148:
case 149:
case 150:
case 151:
case 152:
case 153:
case 154:
case 155:
case 156:
case 157:
case 158:
case 159:
case 160:
case 161:
case 162:
case 163:
case 164:
case 165:
case 166:
case 167:
case 168:
case 169:
case 170:
case 171:
case 172:
case 173:
case 174:
case 175:
case 176:
case 177:
case 178:
case 179:
case 180:
case 181:
case 182:
case 183:
case 184:
case 185:
case 186:
case 187:
case 188:
case 189:
case 190:
case 191:
case 192:
case 193:
case 194:
case 195:
case 196:
case 197:
case 198:
case 199:
case 200:
case 201:
case 202:
case 203:
case 204:
case 205:
case 206:
case 207:
case 208:
case 209:
case 210:
case 211:
case 212:
case 213:
case 214:
case 215:
case 216:
case 217:
case 218:
case 219:
case 220:
case 221:
case 222:
case 223:
case 224:
case 225:
case 226:
case 227:
/* unpack fixed sized raw strings */
{
size_t size = tp - 128;
QP_UNPACK_CHECK_SZ(size)
if (qp_obj != NULL)
{
qp_obj->tp = QP_RAW;
qp_obj->via.raw = (char *) unpacker->pt;
qp_obj->len = size;
}
unpacker->pt += size;
return QP_RAW;
}
case 228:
QP_UNPACK_RAW(uint8_t)
case 229:
QP_UNPACK_RAW(uint16_t)
case 230:
QP_UNPACK_RAW(uint32_t)
case 231:
QP_UNPACK_RAW(uint64_t)
case 232:
QP_UNPACK_INT(int8_t)
case 233:
QP_UNPACK_INT(int16_t)
case 234:
QP_UNPACK_INT(int32_t)
case 235:
QP_UNPACK_INT(int64_t)
case 236:
QP_UNPACK_CHECK_SZ(sizeof(double))
if (qp_obj != NULL)
{
qp_obj->tp = QP_DOUBLE;
memcpy(&qp_obj->via.real, unpacker->pt, sizeof(double));
}
unpacker->pt += sizeof(double);
return QP_DOUBLE;
case 237:
case 238:
case 239:
case 240:
case 241:
case 242:
case 243:
case 244:
case 245:
case 246:
case 247:
case 248:
case 249:
case 250:
case 251:
case 252:
case 253:
case 254:
case 255:
if (qp_obj != NULL)
{
qp_obj->tp = tp;
}
return tp;
}
return QP_ERR;
}
int qp_raw_is_equal(qp_obj_t * obj, const char * str)
{
return
strlen(str) == obj->len &&
strncmp(obj->via.raw, str, obj->len) == 0;
}
void qp_res_destroy(qp_res_t * res)
{
QP_res_destroy(res);
free(res);
}
int qp_res_fprint(qp_res_t * res, FILE * stream)
{
size_t i;
int rc = 0;
switch(res->tp)
{
case QP_RES_ARRAY:
if (fprintf(stream, "[") < 0)
{
return QP_ERR_WRITE_STREAM;
}
for (i = 0; i < res->via.array->n; i++)
{
if ((i && fprintf(stream, ",") < 0) ||
(rc = qp_res_fprint(res->via.array->values + i, stream)))
{
return (rc) ? rc : QP_ERR_WRITE_STREAM;
}
}
if (fprintf(stream, "]") < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_STR:
if (fprintf(stream, "%s", res->via.str) < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_BOOL:
if (fprintf(stream, "%s", (res->via.boolean) ? "TRUE": "FALSE") < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_NULL:
if (fprintf(stream, "NULL") < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_INT64:
if (fprintf(stream, "%" PRId64, res->via.int64) < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_REAL:
if (fprintf(stream, "%f", res->via.real) < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
case QP_RES_MAP:
if (fprintf(stream, "{") < 0)
{
return QP_ERR_WRITE_STREAM;
}
for (i = 0; i < res->via.map->n; i++)
{
if ((i && fprintf(stream, ",") < 0) || (
(rc = qp_res_fprint(res->via.map->keys + i, stream)) ||
fprintf(stream, ":") < 0 ||
(rc = qp_res_fprint(res->via.map->values + i, stream))))
{
return (rc) ? rc : QP_ERR_WRITE_STREAM;
}
}
if (fprintf(stream, "}") < 0)
{
return QP_ERR_WRITE_STREAM;
}
break;
default:
return QP_ERR_CORRUPT;
}
return rc;
}
qp_res_t * qp_unpacker_res(qp_unpacker_t * unpacker, int * rc)
{
int fallb;
int * rcode = (rc == NULL) ? &fallb : rc;
qp_res_t * res;
qp_types_t tp;
qp_obj_t val;
tp = qp_next(unpacker, &val);
if (tp == QP_END ||
tp == QP_ERR ||
tp == QP_HOOK ||
tp == QP_ARRAY_CLOSE ||
tp == QP_MAP_CLOSE)
{
*rcode = QP_ERR_CORRUPT;
return NULL;
}
res = (qp_res_t *) malloc(sizeof(qp_res_t));
if (res == NULL)
{
*rcode = QP_ERR_ALLOC;
}
else
{
*rcode = QP_res(unpacker, res, &val);
if (*rcode)
{
qp_res_destroy(res);
res = NULL;
}
}
return res;
}
void qp_print(const unsigned char * data, size_t len)
{
qp_fprint(stdout, data, len);
printf("\n");
}
void qp_fprint(FILE * stream, const unsigned char * data, size_t len)
{
qp_obj_t qp_obj;
qp_unpacker_t unpacker;
qp_unpacker_init(&unpacker, data, len);
QP_print_unpacker(stream, qp_next(&unpacker, &qp_obj), &unpacker, &qp_obj);
}
char * qp_sprint(const unsigned char * data, size_t len)
{
if (!len)
{
return NULL;
}
size_t sz = QP__MINSZ + len * QP__FACTOR;
char * s = (char *) malloc(sz);
if (s != NULL)
{
char * pt;
qp_obj_t qp_obj;
qp_unpacker_t unpacker;
qp_unpacker_init(&unpacker, data, len);
pt = s;
if (QP_sprint_unpacker(
&s,
&sz,
&pt,
qp_next(&unpacker, &qp_obj),
&unpacker, &qp_obj) != QP_ERR)
{
*pt = '\0';
sz = pt - s + 1;
char * tmp = (char *) realloc(s, sz);
if (tmp == NULL)
{
free(s);
}
s = tmp;
}
else
{
free(s);
s = NULL;
}
}
return s;
}
static void QP_fprint_raw(FILE * stream, const char * s, size_t n)
{
size_t i;
fputc('"', stream);
for (i = 0; i < n; i++)
{
char c = s[i];
switch (c)
{
case '"':
case '\\':
fputc('\\', stream);
}
fputc(c, stream);
}
fputc('"', stream);
}
static qp_types_t QP_print_unpacker(
FILE * stream,
qp_types_t tp,
qp_unpacker_t * unpacker,
qp_obj_t * qp_obj)
{
int count;
int found;
switch (tp)
{
case QP_INT64:
fprintf(stream, "%" PRId64, qp_obj->via.int64);
break;
case QP_DOUBLE:
fprintf(stream, "%f", qp_obj->via.real);
break;
case QP_RAW:
QP_fprint_raw(stream, qp_obj->via.raw, qp_obj->len);
break;
case QP_TRUE:
fprintf(stream, "true");
break;
case QP_FALSE:
fprintf(stream, "false");
break;