forked from rtsisyk/msgpuck
-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathmsgpuck.cc
2083 lines (1792 loc) · 58.8 KB
/
msgpuck.cc
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
/*
* Copyright (c) 2013-2016 MsgPuck Authors
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* 1. Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials
* provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
* INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <assert.h>
#include <string.h>
#include <stdlib.h>
#include <inttypes.h>
#include <limits.h>
#include <math.h>
#define UNIT_TAP_COMPATIBLE 1
#include "msgpuck.h"
#include "test.h"
#include <type_traits>
#define BUF_MAXLEN ((1L << 18) - 1)
#define STRBIN_MAXLEN (BUF_MAXLEN - 10)
#define MP_NUMBER_MAX_LEN 16
#define MP_NUMBER_CODEC_COUNT 16
#ifndef lengthof
#define lengthof(array) (sizeof(array) / sizeof((array)[0]))
#endif
#ifndef __has_attribute
# define __has_attribute(x) 0
#endif
#if __has_attribute(noinline) || defined(__GNUC__)
# define NOINLINE __attribute__((noinline))
#else
# define NOINLINE
#endif
static char buf[BUF_MAXLEN + 1];
static char str[STRBIN_MAXLEN];
static char *data = buf + 1; /* use unaligned address to fail early */
#define SCALAR(x) x
#define COMPLEX(x)
#define COMMA ,
#define DEFINE_TEST(_type, _complex, _ext, _v, _r, _rl) ({ \
_ext(int8_t ext_type = 0); \
const char *d1 = mp_encode_##_type(data, _ext(ext_type COMMA) (_v)); \
const char *d2 = data; \
_complex(const char *d3 = data); \
_complex(const char *d4 = data); \
note(""#_type" "#_v""); \
is(mp_check_##_type(data, d1), 0, "mp_check_"#_type"("#_v") == 0"); \
is(mp_decode_##_type(&d2 _ext(COMMA &ext_type)), (_v), "mp_decode(mp_encode("#_v")) == "#_v);\
_complex(mp_next(&d3)); \
_complex(ok(!mp_check(&d4, d3 + _rl), "mp_check("#_v")")); \
is((d1 - data), (_rl), "len(mp_encode_"#_type"("#_v")"); \
is(d1, d2, "len(mp_decode_"#_type"("#_v"))"); \
_complex(is(d1, d3, "len(mp_next_"#_type"("#_v"))")); \
_complex(is(d1, d4, "len(mp_check_"#_type"("#_v"))")); \
is(mp_sizeof_##_type(_v), _rl, "mp_sizeof_"#_type"("#_v")"); \
is(memcmp(data, (_r), (_rl)), 0, "mp_encode("#_v") == "#_r); \
})
#define DEFINE_TEST_STRBINEXT(_type, _not_ext, _ext, _vl) ({ \
note(""#_type" len="#_vl""); \
char *s1 = str; \
for (uint32_t i = 0; i < _vl; i++) { \
s1[i] = 'a' + i % 26; \
} \
_ext(int8_t ext_type = 0); \
const char *d1 = mp_encode_##_type(data, _ext(ext_type COMMA) s1, _vl);\
const char *d2; \
uint32_t len2; \
d2 = data; \
const char *s2 = mp_decode_##_type(&d2, _ext(&ext_type COMMA) &len2); \
is(_vl, len2, "len(mp_decode_"#_type"(x, %u))", _vl); \
_ext(is(ext_type, 0, "type(mp_decode_"#_type"(x))")); \
d2 = data; \
_not_ext((void) mp_decode_strbin(&d2, &len2)); \
_ext((void) mp_decode_ext(&d2, &ext_type, &len2)); \
is(_vl, len2, "len(mp_decode_strbin(x, %u))", _vl); \
const char *d3 = data; \
mp_next(&d3); \
const char *d4 = data; \
ok(!mp_check(&d4, d3 + _vl), \
"mp_check_"#_type"(mp_encode_"#_type"(x, "#_vl"))"); \
is(d1, d2, "len(mp_decode_"#_type"(x, "#_vl")"); \
is(d1, d3, "len(mp_next_"#_type"(x, "#_vl")"); \
is(d1, d4, "len(mp_check_"#_type"(x, "#_vl")"); \
is(mp_sizeof_##_type(_vl), (uint32_t) (d1 - data), \
"mp_sizeof_"#_type"("#_vl")"); \
is(memcmp(s1, s2, _vl), 0, "mp_encode_"#_type"(x, "#_vl") == x"); \
})
#define test_uint(...) DEFINE_TEST(uint, SCALAR, COMPLEX, __VA_ARGS__)
#define test_int(...) DEFINE_TEST(int, SCALAR, COMPLEX, __VA_ARGS__)
#define test_bool(...) DEFINE_TEST(bool, SCALAR, COMPLEX, __VA_ARGS__)
#define test_float(...) DEFINE_TEST(float, SCALAR, COMPLEX, __VA_ARGS__)
#define test_double(...) DEFINE_TEST(double, SCALAR, COMPLEX, __VA_ARGS__)
#define test_strl(...) DEFINE_TEST(strl, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_binl(...) DEFINE_TEST(binl, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_extl(...) DEFINE_TEST(extl, COMPLEX, SCALAR, __VA_ARGS__)
#define test_array(...) DEFINE_TEST(array, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_map(...) DEFINE_TEST(map, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_str(...) DEFINE_TEST_STRBINEXT(str, SCALAR, COMPLEX, __VA_ARGS__)
#define test_bin(...) DEFINE_TEST_STRBINEXT(bin, SCALAR, COMPLEX, __VA_ARGS__)
#define test_ext(...) DEFINE_TEST_STRBINEXT(ext, COMPLEX, SCALAR, __VA_ARGS__)
#define DEFINE_TEST_SAFE(_type, _complex, _ext, _v, _r, _rl) ({ \
note(""#_type"_safe"); \
_ext(int8_t ext_type = 0); \
ptrdiff_t sz; \
const char *d; \
/* Test calculating size. */ \
sz = 0; \
d = mp_encode_##_type##_safe(NULL, &sz, _ext(ext_type COMMA) (_v)); \
is(-sz, (_rl), "size after mp_encode_"#_type"_safe(NULL, &sz)"); \
is(d, NULL, "mp_encode_"#_type"_safe(NULL, &sz)"); \
/* Test encoding with no overflow. */ \
sz = _rl; \
d = mp_encode_##_type##_safe(data, &sz, _ext(ext_type COMMA) (_v)); \
is(sz, 0, "size after mp_encode_"#_type"_safe(buf, &sz)"); \
is((d - data), (_rl), "len of mp_encode_"#_type"_safe(buf, &sz)"); \
is(memcmp(data, (_r), (_rl)), 0, "mp_encode_"#_type"_safe(buf, &sz)"); \
/* Test encoding with with overflow. */ \
sz = _rl - 1; \
d = mp_encode_##_type##_safe(data, &sz, _ext(ext_type COMMA) (_v)); \
is(sz, -1, "size after mp_encode_"#_type"_safe(buf, &sz) overflow"); \
is(d, data, "mp_encode_"#_type"_safe(buf, &sz) overflow"); \
/* Test encoding with sz == NULL. */ \
d = mp_encode_##_type##_safe(data, NULL, _ext(ext_type COMMA) (_v)); \
is((d - data), (_rl), "len of mp_encode_"#_type"_safe(buf, NULL)"); \
is(memcmp(data, (_r), (_rl)), 0, "mp_encode_"#_type"_safe(buf, NULL)");\
})
#define DEFINE_TEST_STRBINEXT_SAFE(_type, _not_ext, _ext, _vl) ({ \
note(""#_type"_safe"); \
_ext(int8_t ext_type = 0); \
ptrdiff_t sz; \
const ptrdiff_t hl = mp_sizeof_##_type##l(_vl); \
const ptrdiff_t rl = hl + _vl; \
char head[5]; \
const char *d; \
for (uint32_t i = 0; i < _vl; i++) { \
str[i] = 'a' + i % 26; \
} \
mp_encode_##_type##l(head,_ext(ext_type COMMA) _vl); \
/* Test calculating size. */ \
sz = 0; \
d = mp_encode_##_type##_safe(NULL, &sz, _ext(ext_type COMMA) str, _vl);\
is(-sz, rl, "size after mp_encode_"#_type"_safe(NULL, &sz)"); \
is(d, NULL, "mp_encode_"#_type"_safe(NULL, &sz)"); \
/* Test encoding with no overflow. */ \
sz = rl; \
d = mp_encode_##_type##_safe(data, &sz, _ext(ext_type COMMA) str, _vl);\
is(sz, 0, "size after mp_encode_"#_type"_safe(buf, &sz)"); \
is((d - data), rl, "len of mp_encode_"#_type"_safe(buf, &sz)"); \
is(memcmp(data, head, hl), 0, \
"head of mp_encode_"#_type"_safe(buf, &sz)"); \
is(memcmp(data + hl, str, (_vl)), 0, \
"payload of mp_encode_"#_type"_safe(buf, &sz)"); \
/* Test encoding with with overflow. */ \
sz = rl - 1; \
d = mp_encode_##_type##_safe(data, &sz, _ext(ext_type COMMA) str, _vl);\
is(sz, -1, "size after mp_encode_"#_type"_safe(buf, &sz) overflow"); \
is(d, data, "mp_encode_"#_type"_safe(buf, &sz) overflow"); \
/* Test encoding with sz == NULL. */ \
d = mp_encode_##_type##_safe(data, NULL, _ext(ext_type COMMA)str, _vl);\
is((d - data), rl, "len of mp_encode_"#_type"_safe(buf, NULL)"); \
is(memcmp(data, head, hl), 0, \
"head of mp_encode_"#_type"_safe(buf, NULL)"); \
is(memcmp(data + hl, str, (_vl)), 0, \
"payload of mp_encode_"#_type"_safe(buf, NULL)"); \
})
#define test_uint_safe(...) DEFINE_TEST_SAFE(uint, SCALAR, COMPLEX, __VA_ARGS__)
#define test_int_safe(...) DEFINE_TEST_SAFE(int, SCALAR, COMPLEX, __VA_ARGS__)
#define test_bool_safe(...) DEFINE_TEST_SAFE(bool, SCALAR, COMPLEX, __VA_ARGS__)
#define test_float_safe(...) DEFINE_TEST_SAFE(float, SCALAR, COMPLEX, __VA_ARGS__)
#define test_double_safe(...) DEFINE_TEST_SAFE(double, SCALAR, COMPLEX, __VA_ARGS__)
#define test_strl_safe(...) DEFINE_TEST_SAFE(strl, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_binl_safe(...) DEFINE_TEST_SAFE(binl, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_extl_safe(...) DEFINE_TEST_SAFE(extl, COMPLEX, SCALAR, __VA_ARGS__)
#define test_array_safe(...) DEFINE_TEST_SAFE(array, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_map_safe(...) DEFINE_TEST_SAFE(map, COMPLEX, COMPLEX, __VA_ARGS__)
#define test_str_safe(...) DEFINE_TEST_STRBINEXT_SAFE(str, SCALAR, COMPLEX, __VA_ARGS__)
#define test_bin_safe(...) DEFINE_TEST_STRBINEXT_SAFE(bin, SCALAR, COMPLEX, __VA_ARGS__)
#define test_ext_safe(...) DEFINE_TEST_STRBINEXT_SAFE(ext, COMPLEX, SCALAR, __VA_ARGS__)
static int
test_uints(void)
{
plan(15*9 + 9);
header();
test_uint(0U, "\x00", 1);
test_uint(1U, "\x01", 1);
test_uint(0x7eU, "\x7e", 1);
test_uint(0x7fU, "\x7f", 1);
test_uint(0x80U, "\xcc\x80", 2);
test_uint(0xfeU, "\xcc\xfe", 2);
test_uint(0xffU, "\xcc\xff", 2);
test_uint(0xfffeU, "\xcd\xff\xfe", 3);
test_uint(0xffffU, "\xcd\xff\xff", 3);
test_uint(0x10000U, "\xce\x00\x01\x00\x00", 5);
test_uint(0xfffffffeU, "\xce\xff\xff\xff\xfe", 5);
test_uint(0xffffffffU, "\xce\xff\xff\xff\xff", 5);
test_uint(0x100000000ULL,
"\xcf\x00\x00\x00\x01\x00\x00\x00\x00", 9);
test_uint(0xfffffffffffffffeULL,
"\xcf\xff\xff\xff\xff\xff\xff\xff\xfe", 9);
test_uint(0xffffffffffffffffULL,
"\xcf\xff\xff\xff\xff\xff\xff\xff\xff", 9);
test_uint_safe(0xfffeU, "\xcd\xff\xfe", 3);
footer();
return check_plan();
}
static int
test_ints(void)
{
plan(17*9 + 9);
header();
test_int(-0x01, "\xff", 1);
test_int(-0x1e, "\xe2", 1);
test_int(-0x1f, "\xe1", 1);
test_int(-0x20, "\xe0", 1);
test_int(-0x21, "\xd0\xdf", 2);
test_int(-0x7f, "\xd0\x81", 2);
test_int(-0x80, "\xd0\x80", 2);
test_int(-0x81, "\xd1\xff\x7f", 3);
test_int(-0x7fff, "\xd1\x80\x01", 3);
test_int(-0x8000, "\xd1\x80\x00", 3);
test_int(-0x8001, "\xd2\xff\xff\x7f\xff", 5);
test_int(-0x7fffffff, "\xd2\x80\x00\x00\x01", 5);
test_int(-0x80000000LL, "\xd2\x80\x00\x00\x00", 5);
test_int(-0x80000001LL,
"\xd3\xff\xff\xff\xff\x7f\xff\xff\xff", 9);
test_int(-0x80000001LL,
"\xd3\xff\xff\xff\xff\x7f\xff\xff\xff", 9);
test_int(-0x7fffffffffffffffLL,
"\xd3\x80\x00\x00\x00\x00\x00\x00\x01", 9);
test_int((int64_t)-0x8000000000000000LL,
"\xd3\x80\x00\x00\x00\x00\x00\x00\x00", 9);
test_int_safe(-0x80000000LL, "\xd2\x80\x00\x00\x00", 5);
footer();
return check_plan();
}
static int
test_bools(void)
{
plan(2*9 + 9);
header();
test_bool(true, "\xc3", 1);
test_bool(false, "\xc2", 1);
test_bool_safe(true, "\xc3", 1);
footer();
return check_plan();
}
static int
test_floats(void)
{
plan(3*9 + 9);
header();
test_float((float) 1.0, "\xca\x3f\x80\x00\x00", 5);
test_float((float) 3.141593, "\xca\x40\x49\x0f\xdc", 5);
test_float((float) -1e38f, "\xca\xfe\x96\x76\x99", 5);
test_float_safe((float) 3.141593, "\xca\x40\x49\x0f\xdc", 5);
footer();
return check_plan();
}
static int
test_doubles(void)
{
plan(3*9 + 9);
header();
test_double((double) 1.0,
"\xcb\x3f\xf0\x00\x00\x00\x00\x00\x00", 9);
test_double((double) 3.141592653589793,
"\xcb\x40\x09\x21\xfb\x54\x44\x2d\x18", 9);
test_double((double) -1e99,
"\xcb\xd4\x7d\x42\xae\xa2\x87\x9f\x2e", 9);
test_double_safe((double) 3.141592653589793,
"\xcb\x40\x09\x21\xfb\x54\x44\x2d\x18", 9);
footer();
return check_plan();
}
static int
test_nils(void)
{
plan(15);
header();
const char *d1 = mp_encode_nil(data);
const char *d2 = data;
const char *d3 = data;
const char *d4 = data;
note("nil");
mp_decode_nil(&d2);
mp_next(&d3);
ok(!mp_check(&d4, d3 + 1), "mp_check_nil()");
is((d1 - data), 1, "len(mp_encode_nil() == 1");
is(d1, d2, "len(mp_decode_nil()) == 1");
is(d1, d3, "len(mp_next_nil()) == 1");
is(d1, d4, "len(mp_check_nil()) == 1");
is(mp_sizeof_nil(), 1, "mp_sizeof_nil() == 1");
ptrdiff_t sz = 0;
d1 = mp_encode_nil_safe(NULL, &sz);
is(-sz, 1, "size after mp_encode_nil_safe(NULL, &sz)");
is(d1, NULL, "mp_encode_nil_safe(NULL, &sz)");
sz = 1;
d1 = mp_encode_nil_safe(data, &sz);
is(sz, 0, "size after mp_encode_nil_safe(buf, &sz)");
is(d1 - data, 1, "len of mp_encode_nil_safe(buf, &sz)");
is((unsigned char)data[0], 0xc0, "mp_encode_nil_safe(buf, &sz)");
sz = 0;
d1 = mp_encode_nil_safe(data, &sz);
is(sz, -1, "size after mp_encode_nil_safe(buf, &sz) overflow");
is(d1, data, "mp_encode_nil_safe(buf, &sz) overflow");
d1 = mp_encode_nil_safe(data, NULL);
is(d1 - data, 1, "len of mp_encode_nil_safe(buf, NULL)");
is((unsigned char)data[0], 0xc0, "mp_encode_nil_safe(buf, NULL)");
footer();
return check_plan();
}
static int
test_arrays(void)
{
plan(9*6 + 9);
header();
test_array(0, "\x90", 1);
test_array(1, "\x91", 1);
test_array(15, "\x9f", 1);
test_array(16, "\xdc\x00\x10", 3);
test_array(0xfffe, "\xdc\xff\xfe", 3);
test_array(0xffff, "\xdc\xff\xff", 3);
test_array(0x10000, "\xdd\x00\x01\x00\x00", 5);
test_array(0xfffffffeU, "\xdd\xff\xff\xff\xfe", 5);
test_array(0xffffffffU, "\xdd\xff\xff\xff\xff", 5);
test_array_safe(0xffff, "\xdc\xff\xff", 3);
footer();
return check_plan();
}
static int
test_maps(void)
{
plan(9*6 + 9);
header();
test_map(0, "\x80", 1);
test_map(1, "\x81", 1);
test_map(15, "\x8f", 1);
test_map(16, "\xde\x00\x10", 3);
test_map(0xfffe, "\xde\xff\xfe", 3);
test_map(0xffff, "\xde\xff\xff", 3);
test_map(0x10000, "\xdf\x00\x01\x00\x00", 5);
test_map(0xfffffffeU, "\xdf\xff\xff\xff\xfe", 5);
test_map(0xffffffffU, "\xdf\xff\xff\xff\xff", 5);
test_map_safe(0xfffffffeU, "\xdf\xff\xff\xff\xfe", 5);
footer();
return check_plan();
}
static int
test_strls(void)
{
plan(13*6 + 9);
header();
test_strl(0x00U, "\xa0", 1);
test_strl(0x01U, "\xa1", 1);
test_strl(0x1eU, "\xbe", 1);
test_strl(0x1fU, "\xbf", 1);
test_strl(0x20U, "\xd9\x20", 2);
test_strl(0xfeU, "\xd9\xfe", 2);
test_strl(0xffU, "\xd9\xff", 2);
test_strl(0x0100U, "\xda\x01\x00", 3);
test_strl(0xfffeU, "\xda\xff\xfe", 3);
test_strl(0xffffU, "\xda\xff\xff", 3);
test_strl(0x00010000U, "\xdb\x00\x01\x00\x00", 5);
test_strl(0xfffffffeU, "\xdb\xff\xff\xff\xfe", 5);
test_strl(0xffffffffU, "\xdb\xff\xff\xff\xff", 5);
test_strl_safe(0x20U, "\xd9\x20", 2);
footer();
return check_plan();
}
static int
test_binls(void)
{
plan(13*6 + 9);
header();
test_binl(0x00U, "\xc4\x00", 2);
test_binl(0x01U, "\xc4\x01", 2);
test_binl(0x1eU, "\xc4\x1e", 2);
test_binl(0x1fU, "\xc4\x1f", 2);
test_binl(0x20U, "\xc4\x20", 2);
test_binl(0xfeU, "\xc4\xfe", 2);
test_binl(0xffU, "\xc4\xff", 2);
test_binl(0x0100U, "\xc5\x01\x00", 3);
test_binl(0xfffeU, "\xc5\xff\xfe", 3);
test_binl(0xffffU, "\xc5\xff\xff", 3);
test_binl(0x00010000U, "\xc6\x00\x01\x00\x00", 5);
test_binl(0xfffffffeU, "\xc6\xff\xff\xff\xfe", 5);
test_binl(0xffffffffU, "\xc6\xff\xff\xff\xff", 5);
test_binl_safe(0x00010000U, "\xc6\x00\x01\x00\x00", 5);
footer();
return check_plan();
}
static int
test_extls(void)
{
plan(28*6 + 9);
header();
/* fixext 1,2,4,8,16 */
test_extl(0x01U, "\xd4\x00", 2);
test_extl(0x02U, "\xd5\x00", 2);
test_extl(0x04U, "\xd6\x00", 2);
test_extl(0x08U, "\xd7\x00", 2);
test_extl(0x10U, "\xd8\x00", 2);
/* ext 8 */
test_extl(0x11U, "\xc7\x11\x00", 3);
test_extl(0xfeU, "\xc7\xfe\x00", 3);
test_extl(0xffU, "\xc7\xff\x00", 3);
test_extl(0x00U, "\xc7\x00\x00", 3);
test_extl(0x03U, "\xc7\x03\x00", 3);
test_extl(0x05U, "\xc7\x05\x00", 3);
test_extl(0x06U, "\xc7\x06\x00", 3);
test_extl(0x07U, "\xc7\x07\x00", 3);
test_extl(0x09U, "\xc7\x09\x00", 3);
test_extl(0x0aU, "\xc7\x0a\x00", 3);
test_extl(0x0bU, "\xc7\x0b\x00", 3);
test_extl(0x0cU, "\xc7\x0c\x00", 3);
test_extl(0x0dU, "\xc7\x0d\x00", 3);
test_extl(0x0eU, "\xc7\x0e\x00", 3);
test_extl(0x0fU, "\xc7\x0f\x00", 3);
/* ext 16 */
test_extl(0x0100U, "\xc8\x01\x00\x00", 4);
test_extl(0x0101U, "\xc8\x01\x01\x00", 4);
test_extl(0xfffeU, "\xc8\xff\xfe\x00", 4);
test_extl(0xffffU, "\xc8\xff\xff\x00", 4);
/* ext 32 */
test_extl(0x00010000U, "\xc9\x00\x01\x00\x00\x00", 6);
test_extl(0x00010001U, "\xc9\x00\x01\x00\x01\x00", 6);
test_extl(0xfffffffeU, "\xc9\xff\xff\xff\xfe\x00", 6);
test_extl(0xffffffffU, "\xc9\xff\xff\xff\xff\x00", 6);
test_extl_safe(0x0aU, "\xc7\x0a\x00", 3);
footer();
return check_plan();
}
static int
test_strs(void)
{
plan(12*8 + 11);
header();
test_str(0x01);
test_str(0x1e);
test_str(0x1f);
test_str(0x20);
test_str(0xfe);
test_str(0xff);
test_str(0x100);
test_str(0x101);
test_str(0xfffe);
test_str(0xffff);
test_str(0x10000);
test_str(0x10001);
test_str_safe(0xfffe);
footer();
return check_plan();
}
static int
test_bins(void)
{
plan(12*8 + 11);
header();
test_bin(0x01);
test_bin(0x1e);
test_bin(0x1f);
test_bin(0x20);
test_bin(0xfe);
test_bin(0xff);
test_bin(0x100);
test_bin(0x101);
test_bin(0xfffe);
test_bin(0xffff);
test_bin(0x10000);
test_bin(0x10001);
test_bin_safe(0x10001);
footer();
return check_plan();
}
static int
test_exts(void)
{
plan(25*9 + 11);
header();
test_ext(0x01);
test_ext(0x02);
test_ext(0x03);
test_ext(0x04);
test_ext(0x05);
test_ext(0x06);
test_ext(0x07);
test_ext(0x08);
test_ext(0x09);
test_ext(0x0a);
test_ext(0x0b);
test_ext(0x0c);
test_ext(0x0d);
test_ext(0x0e);
test_ext(0x0f);
test_ext(0x10);
test_ext(0x11);
test_ext(0xfe);
test_ext(0xff);
test_ext(0x0100);
test_ext(0x0101);
test_ext(0xfffe);
test_ext(0xffff);
test_ext(0x00010000);
test_ext(0x00010001);
test_ext_safe(0xfe);
footer();
return check_plan();
}
static int
test_memcpy()
{
plan(11);
header();
int len = 27;
char *d;
for (int i = 0; i < len; i++)
str[i] = 'a' + i % 26;
d = mp_memcpy(data, str, len);
is(d - data, len, "len of mp_memcpy()");
is(memcmp(data, str, len), 0, "payload of mp_memcpy()");
ptrdiff_t sz = 0;
d = mp_memcpy_safe(NULL, &sz, str, len);
is(-sz, len, "size after mp_memcpy_safe(NULL, &sz)");
is(d, NULL, "mp_memcpy_safe(NULL, &sz)");
sz = len;
d = mp_memcpy_safe(data, &sz, str, len);
is(sz, 0, "size after mp_memcpy_safe(buf, &sz)");
is(d - data, len, "len of mp_memcpy_safe(buf, &sz)");
is(memcmp(data, str, len), 0, "mp_memcpy_safe(buf, &sz)");
sz = len - 1;
d = mp_memcpy_safe(data, &sz, str, len);
is(sz, -1, "size after mp_memcpy_safe(buf, &sz) overflow");
is(d, data, "mp_memcpy_safe(buf, &sz) overflow");
d = mp_memcpy_safe(data, NULL, str, len);
is(d - data, len, "len of (buf, NULL)");
is(memcmp(data, str, len), 0, "mp_memcpy_safe(buf, NULL)");
footer();
return check_plan();
}
static void
test_next_on_array(uint32_t count)
{
note("next/check on array(%u)", count);
char *d1 = data;
d1 = mp_encode_array(d1, count);
for (uint32_t i = 0; i < count; i++) {
d1 = mp_encode_uint(d1, i % 0x7f); /* one byte */
}
uint32_t len = count + mp_sizeof_array(count);
const char *d2 = data;
const char *d3 = data;
ok(!mp_check(&d2, data + BUF_MAXLEN), "mp_check(array %u))", count);
is((d1 - data), (ptrdiff_t)len, "len(array %u) == %u", count, len);
is((d2 - data), (ptrdiff_t)len, "len(mp_check(array %u)) == %u", count, len);
mp_next(&d3);
is((d3 - data), (ptrdiff_t)len, "len(mp_next(array %u)) == %u", count, len);
}
static int
test_next_on_arrays(void)
{
plan(52);
header();
test_next_on_array(0x00);
test_next_on_array(0x01);
test_next_on_array(0x0f);
test_next_on_array(0x10);
test_next_on_array(0x11);
test_next_on_array(0xfe);
test_next_on_array(0xff);
test_next_on_array(0x100);
test_next_on_array(0x101);
test_next_on_array(0xfffe);
test_next_on_array(0xffff);
test_next_on_array(0x10000);
test_next_on_array(0x10001);
footer();
return check_plan();
}
static void
test_next_on_map(uint32_t count)
{
note("next/check on map(%u)", count);
char *d1 = data;
d1 = mp_encode_map(d1, count);
for (uint32_t i = 0; i < 2 * count; i++) {
d1 = mp_encode_uint(d1, i % 0x7f); /* one byte */
}
uint32_t len = 2 * count + mp_sizeof_map(count);
const char *d2 = data;
const char *d3 = data;
ok(!mp_check(&d2, data + BUF_MAXLEN), "mp_check(map %u))", count);
is((d1 - data), (ptrdiff_t)len, "len(map %u) == %u", count, len);
is((d2 - data), (ptrdiff_t)len, "len(mp_check(map %u)) == %u", count, len);
mp_next(&d3);
is((d3 - data), (ptrdiff_t)len, "len(mp_next(map %u)) == %u", count, len);
}
static int
test_next_on_maps(void)
{
plan(52);
header();
test_next_on_map(0x00);
test_next_on_map(0x01);
test_next_on_map(0x0f);
test_next_on_map(0x10);
test_next_on_map(0x11);
test_next_on_map(0xfe);
test_next_on_map(0xff);
test_next_on_map(0x100);
test_next_on_map(0x101);
test_next_on_map(0xfffe);
test_next_on_map(0xffff);
test_next_on_map(0x10000);
test_next_on_map(0x10001);
footer();
return check_plan();
}
/**
* When inlined in Release in clang, this function behaves weird. Looking
* sometimes like if its call had no effect even though it did encoding.
*/
static NOINLINE bool
test_encode_uint_custom_size(char *buf, uint64_t val, int size)
{
char *pos;
switch (size) {
case 1:
if (val > 0x7f)
return false;
mp_store_u8(buf, val);
return true;
case 2:
if (val > UINT8_MAX)
return false;
pos = mp_store_u8(buf, 0xcc);
mp_store_u8(pos, (uint8_t)val);
return true;
case 3:
if (val > UINT16_MAX)
return false;
pos = mp_store_u8(buf, 0xcd);
mp_store_u16(pos, (uint16_t)val);
return true;
case 5:
if (val > UINT32_MAX)
return false;
pos = mp_store_u8(buf, 0xce);
mp_store_u32(pos, (uint32_t)val);
return true;
case 9:
pos = mp_store_u8(buf, 0xcf);
mp_store_u64(pos, val);
return true;
}
abort();
return false;
}
/**
* Unlike test_encode_uint_custom_size(), this one doesn't seem to behave
* strange when inlined, but perhaps it just wasn't used in all the same ways as
* the former.
*/
static NOINLINE bool
test_encode_int_custom_size(char *buf, int64_t val, int size)
{
char *pos;
switch (size) {
case 1:
if (val > 0x7f || val < -0x20)
return false;
if (val >= 0)
mp_store_u8(buf, val);
else
mp_store_u8(buf, (uint8_t)(0xe0 | val));
return true;
case 2:
if (val < INT8_MIN || val > INT8_MAX)
return false;
pos = mp_store_u8(buf, 0xd0);
mp_store_u8(pos, (uint8_t)val);
return true;
case 3:
if (val < INT16_MIN || val > INT16_MAX)
return false;
pos = mp_store_u8(buf, 0xd1);
mp_store_u16(pos, (uint16_t)val);
return true;
case 5:
if (val < INT32_MIN || val > INT32_MAX)
return false;
pos = mp_store_u8(buf, 0xd2);
mp_store_u32(pos, (uint32_t)val);
return true;
case 9:
pos = mp_store_u8(buf, 0xd3);
mp_store_u64(pos, val);
return true;
}
abort();
return false;
}
static int
test_encode_uint_all_sizes(char mp_nums[][MP_NUMBER_MAX_LEN], uint64_t val)
{
int sizes[] = {1, 2, 3, 5, 9};
int count = lengthof(sizes);
int used = 0;
for (int i = 0; i < count; ++i) {
assert(used < MP_NUMBER_CODEC_COUNT);
if (test_encode_uint_custom_size(mp_nums[used], val, sizes[i]))
++used;
}
return used;
}
static int
test_encode_int_all_sizes(char mp_nums[][MP_NUMBER_MAX_LEN], int64_t val)
{
int sizes[] = {1, 2, 3, 5, 9};
int count = lengthof(sizes);
int used = 0;
for (int i = 0; i < count; ++i) {
assert(used < MP_NUMBER_CODEC_COUNT);
if (test_encode_int_custom_size(mp_nums[used], val, sizes[i]))
++used;
}
return used;
}
static void
test_compare_uint(uint64_t a, uint64_t b)
{
char mp_nums_a[MP_NUMBER_CODEC_COUNT][MP_NUMBER_MAX_LEN];
int count_a = test_encode_uint_all_sizes(mp_nums_a, a);
char mp_nums_b[MP_NUMBER_CODEC_COUNT][MP_NUMBER_MAX_LEN];
int count_b = test_encode_uint_all_sizes(mp_nums_b, b);
for (int ai = 0; ai < count_a; ++ai) {
for (int bi = 0; bi < count_b; ++bi) {
int r = mp_compare_uint(mp_nums_a[ai], mp_nums_b[bi]);
if (a < b) {
ok(r < 0, "mp_compare_uint(%" PRIu64 ", "
"%" PRIu64 ") < 0", a, b);
} else if (a > b) {
ok(r > 0, "mp_compare_uint(%" PRIu64 ", "
"%" PRIu64 ") > 0", a, b);
} else {
ok(r == 0, "mp_compare_uint(%" PRIu64 ", "
"%" PRIu64 ") == 0", a, b);
}
}
}
}
static int
test_compare_uints(void)
{
plan(2209);
header();
uint64_t nums[] = {
0, 1, 0x7eU, 0x7fU, 0x80U, 0xfeU, 0xffU, 0xfffeU, 0xffffU,
0x10000U, 0xfffffffeU, 0xffffffffU, 0x100000000ULL,
0xfffffffffffffffeULL, 0xffffffffffffffffULL
};
int count = sizeof(nums) / sizeof(*nums);
for (int i = 0; i < count; i++) {
for (int j = 0; j < count; j++) {
test_compare_uint(nums[i], nums[j]);
}
}
footer();
return check_plan();
}
static bool
fequal(float a, float b)
{
return a > b ? a - b < 1e-5f : b - a < 1e-5f;
}
static bool
dequal(double a, double b)
{
return a > b ? a - b < 1e-10 : b - a < 1e-10;
}
static int
test_format(void)
{
plan(282);
header();
const size_t buf_size = 1024;
char buf[buf_size];
size_t sz;
const char *fmt;
const char *p, *c, *e;
uint32_t len = 0;
fmt = "%d %u %i %ld %lu %li %lld %llu %lli"
"%hd %hu %hi %hhd %hhu %hhi";
sz = mp_format(buf, buf_size, fmt, 1, 2, 3,
(long)4, (long)5, (long)6,
(long long)7, (long long)8, (long long)9,
(short)10, (short)11, (short)12,
(char)13, (char)14, (char)15);
p = buf;
for (unsigned i = 0; i < 15; i++) {
ok(mp_typeof(*p) == MP_UINT, "Test type on step %d", i);
ok(mp_decode_uint(&p) == i + 1, "Test value on step %d", i);
}
sz = mp_format(buf, buf_size, fmt, -1, -2, -3,
(long)-4, (long)-5, (long)-6,
(long long)-7, (long long)-8, (long long)-9,
(short)-10, (unsigned short)-11, (short)-12,
(signed char)-13, (unsigned char)-14, (signed char)-15);
p = buf;
for (int i = 0; i < 15; i++) {
uint64_t expects[5] = { UINT_MAX - 1,
ULONG_MAX - 4,
ULLONG_MAX - 7,
USHRT_MAX - 10,
UCHAR_MAX - 13 };
if (i % 3 == 1) {
ok(mp_typeof(*p) == MP_UINT, "Test type on step %d", i);
ok(mp_decode_uint(&p) == expects[i / 3],
"Test value on step %d", i);
} else {
ok(mp_typeof(*p) == MP_INT, "Test type on step %d", i);
ok(mp_decode_int(&p) == - i - 1,
"Test value on step %d", i);
}
}
char data1[32];
char *data1_end = data1;
data1_end = mp_encode_array(data1_end, 2);
data1_end = mp_encode_str(data1_end, "ABC", 3);
data1_end = mp_encode_uint(data1_end, 11);
size_t data1_len = data1_end - data1;
assert(data1_len <= sizeof(data1));
char data2[32];
char *data2_end = data2;
data2_end = mp_encode_int(data2_end, -1234567890);
data2_end = mp_encode_str(data2_end, "DEFGHIJKLMN", 11);
data2_end = mp_encode_uint(data2_end, 321);
size_t data2_len = data2_end - data2;
assert(data2_len <= sizeof(data2));
fmt = "%d NIL [%d %b %b] this is test"
"[%d %%%% [[ %d {%s %f %% %.*s %lf %.*s NIL}"
"%p %d %.*p ]] %d%d%d]";
#define TEST_PARAMS 0, 1, true, false, -1, 2, \
"flt", 0.1, 6, "double#ignored", 0.2, 0, "ignore", \
data1, 3, data2_len, data2, 4, 5, 6
sz = mp_format(buf, buf_size, fmt, TEST_PARAMS);
p = buf;