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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
|
/*
* Copyright 2008 Google Inc.
* Copyright 2014-2018 Andreas Schneider <asn@cryptomilk.org>
* Copyright 2015 Jakub Hrozek <jakub.hrozek@posteo.se>
*
* 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.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif
#ifdef HAVE_INTTYPES_H
#include <inttypes.h>
#endif
#ifdef HAVE_SIGNAL_H
#include <signal.h>
#endif
#ifdef HAVE_STRINGS_H
#include <strings.h>
#endif
#include <stdint.h>
#include <setjmp.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <time.h>
#include <float.h>
/*
* This allows to add a platform specific header file. Some embedded platforms
* sometimes miss certain types and definitions.
*
* Example:
*
* typedef unsigned long int uintptr_t
* #define _UINTPTR_T 1
* #define _UINTPTR_T_DEFINED 1
*/
#ifdef CMOCKA_PLATFORM_INCLUDE
# include "cmocka_platform.h"
#endif /* CMOCKA_PLATFORM_INCLUDE */
#include <cmocka.h>
#include <cmocka_private.h>
/* Size of guard bytes around dynamically allocated blocks. */
#define MALLOC_GUARD_SIZE 16
/* Pattern used to initialize guard blocks. */
#define MALLOC_GUARD_PATTERN 0xEF
/* Pattern used to initialize memory allocated with test_malloc(). */
#define MALLOC_ALLOC_PATTERN 0xBA
#define MALLOC_FREE_PATTERN 0xCD
/* Alignment of allocated blocks. NOTE: This must be base2. */
#ifndef MALLOC_ALIGNMENT
#define MALLOC_ALIGNMENT sizeof(size_t)
#endif
/* Printf formatting for source code locations. */
#define SOURCE_LOCATION_FORMAT "%s:%u"
#if defined(HAVE_GCC_THREAD_LOCAL_STORAGE)
# define CMOCKA_THREAD __thread
#elif defined(HAVE_MSVC_THREAD_LOCAL_STORAGE)
# define CMOCKA_THREAD __declspec(thread)
#else
# define CMOCKA_THREAD
#endif
#ifdef HAVE_CLOCK_REALTIME
#define CMOCKA_CLOCK_GETTIME(clock_id, ts) clock_gettime((clock_id), (ts))
#else
#define CMOCKA_CLOCK_GETTIME(clock_id, ts)
#endif
#ifndef MAX
#define MAX(a,b) ((a) < (b) ? (b) : (a))
#endif
/**
* POSIX has sigsetjmp/siglongjmp, while Windows only has setjmp/longjmp.
*/
#ifdef HAVE_SIGLONGJMP
# define cm_jmp_buf sigjmp_buf
# define cm_setjmp(env) sigsetjmp(env, 1)
# define cm_longjmp(env, val) siglongjmp(env, val)
#else
# define cm_jmp_buf jmp_buf
# define cm_setjmp(env) setjmp(env)
# define cm_longjmp(env, val) longjmp(env, val)
#endif
/*
* Declare and initialize a LargestIntegralType variable name
* with value the conversion of ptr.
*/
#define declare_initialize_value_pointer_pointer(name, ptr) \
LargestIntegralType name ; \
name = (LargestIntegralType) (uintptr_t) ptr
/* Cast a LargestIntegralType to pointer_type. */
#define cast_largest_integral_type_to_pointer( \
pointer_type, largest_integral_type) \
((pointer_type)(uintptr_t)(largest_integral_type))
/* Doubly linked list node. */
typedef struct ListNode {
const void *value;
int refcount;
struct ListNode *next;
struct ListNode *prev;
} ListNode;
/* Debug information for malloc(). */
struct MallocBlockInfoData {
void* block; /* Address of the block returned by malloc(). */
size_t allocated_size; /* Total size of the allocated block. */
size_t size; /* Request block size. */
SourceLocation location; /* Where the block was allocated. */
ListNode node; /* Node within list of all allocated blocks. */
};
typedef union {
struct MallocBlockInfoData *data;
char *ptr;
} MallocBlockInfo;
/* State of each test. */
typedef struct TestState {
const ListNode *check_point; /* Check point of the test if there's a */
/* setup function. */
void *state; /* State associated with the test. */
} TestState;
/* Determines whether two values are the same. */
typedef int (*EqualityFunction)(const void *left, const void *right);
/* Value of a symbol and the place it was declared. */
typedef struct SymbolValue {
SourceLocation location;
LargestIntegralType value;
} SymbolValue;
/*
* Contains a list of values for a symbol.
* NOTE: Each structure referenced by symbol_values_list_head must have a
* SourceLocation as its' first member.
*/
typedef struct SymbolMapValue {
const char *symbol_name;
ListNode symbol_values_list_head;
} SymbolMapValue;
/* Where a particular ordering was located and its symbol name */
typedef struct FuncOrderingValue {
SourceLocation location;
const char * function;
} FuncOrderingValue;
/* Used by list_free() to deallocate values referenced by list nodes. */
typedef void (*CleanupListValue)(const void *value, void *cleanup_value_data);
/* Structure used to check the range of integer types.a */
typedef struct CheckIntegerRange {
CheckParameterEvent event;
LargestIntegralType minimum;
LargestIntegralType maximum;
} CheckIntegerRange;
/* Structure used to check whether an integer value is in a set. */
typedef struct CheckIntegerSet {
CheckParameterEvent event;
const LargestIntegralType *set;
size_t size_of_set;
} CheckIntegerSet;
/* Used to check whether a parameter matches the area of memory referenced by
* this structure. */
typedef struct CheckMemoryData {
CheckParameterEvent event;
const void *memory;
size_t size;
} CheckMemoryData;
static ListNode* list_initialize(ListNode * const node);
static ListNode* list_add(ListNode * const head, ListNode *new_node);
static ListNode* list_add_value(ListNode * const head, const void *value,
const int count);
static ListNode* list_remove(
ListNode * const node, const CleanupListValue cleanup_value,
void * const cleanup_value_data);
static void list_remove_free(
ListNode * const node, const CleanupListValue cleanup_value,
void * const cleanup_value_data);
static int list_empty(const ListNode * const head);
static int list_find(
ListNode * const head, const void *value,
const EqualityFunction equal_func, ListNode **output);
static int list_first(ListNode * const head, ListNode **output);
static ListNode* list_free(
ListNode * const head, const CleanupListValue cleanup_value,
void * const cleanup_value_data);
static void add_symbol_value(
ListNode * const symbol_map_head, const char * const symbol_names[],
const size_t number_of_symbol_names, const void* value, const int count);
static int get_symbol_value(
ListNode * const symbol_map_head, const char * const symbol_names[],
const size_t number_of_symbol_names, void **output);
static void free_value(const void *value, void *cleanup_value_data);
static void free_symbol_map_value(
const void *value, void *cleanup_value_data);
static void remove_always_return_values(ListNode * const map_head,
const size_t number_of_symbol_names);
static size_t check_for_leftover_values_list(const ListNode * head,
const char * const error_message);
static size_t check_for_leftover_values(
const ListNode * const map_head, const char * const error_message,
const size_t number_of_symbol_names);
static void remove_always_return_values_from_list(ListNode * const map_head);
/*
* This must be called at the beginning of a test to initialize some data
* structures.
*/
static void initialize_testing(const char *test_name);
/* This must be called at the end of a test to free() allocated structures. */
static void teardown_testing(const char *test_name);
static enum cm_message_output cm_get_output(void);
static int cm_error_message_enabled = 1;
static CMOCKA_THREAD char *cm_error_message;
/*
* Keeps track of the calling context returned by setenv() so that the fail()
* method can jump out of a test.
*/
static CMOCKA_THREAD cm_jmp_buf global_run_test_env;
static CMOCKA_THREAD int global_running_test = 0;
/* Keeps track of the calling context returned by setenv() so that */
/* mock_assert() can optionally jump back to expect_assert_failure(). */
jmp_buf global_expect_assert_env;
int global_expecting_assert = 0;
const char *global_last_failed_assert = NULL;
static int global_skip_test;
/* Keeps a map of the values that functions will have to return to provide */
/* mocked interfaces. */
static CMOCKA_THREAD ListNode global_function_result_map_head;
/* Location of the last mock value returned was declared. */
static CMOCKA_THREAD SourceLocation global_last_mock_value_location;
/* Keeps a map of the values that functions expect as parameters to their
* mocked interfaces. */
static CMOCKA_THREAD ListNode global_function_parameter_map_head;
/* Location of last parameter value checked was declared. */
static CMOCKA_THREAD SourceLocation global_last_parameter_location;
/* List (acting as FIFO) of call ordering. */
static CMOCKA_THREAD ListNode global_call_ordering_head;
/* Location of last call ordering that was declared. */
static CMOCKA_THREAD SourceLocation global_last_call_ordering_location;
/* List of all currently allocated blocks. */
static CMOCKA_THREAD ListNode global_allocated_blocks;
static enum cm_message_output global_msg_output = CM_OUTPUT_STDOUT;
static const char *global_test_filter_pattern;
static const char *global_skip_filter_pattern;
#ifndef _WIN32
/* Signals caught by exception_handler(). */
static const int exception_signals[] = {
SIGFPE,
SIGILL,
SIGSEGV,
#ifdef SIGBUS
SIGBUS,
#endif
#ifdef SIGSYS
SIGSYS,
#endif
};
/* Default signal functions that should be restored after a test is complete. */
typedef void (*SignalFunction)(int signal);
static SignalFunction default_signal_functions[
ARRAY_SIZE(exception_signals)];
#else /* _WIN32 */
/* The default exception filter. */
static LPTOP_LEVEL_EXCEPTION_FILTER previous_exception_filter;
/* Fatal exceptions. */
typedef struct ExceptionCodeInfo {
DWORD code;
const char* description;
} ExceptionCodeInfo;
#define EXCEPTION_CODE_INFO(exception_code) {exception_code, #exception_code}
static const ExceptionCodeInfo exception_codes[] = {
EXCEPTION_CODE_INFO(EXCEPTION_ACCESS_VIOLATION),
EXCEPTION_CODE_INFO(EXCEPTION_ARRAY_BOUNDS_EXCEEDED),
EXCEPTION_CODE_INFO(EXCEPTION_DATATYPE_MISALIGNMENT),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_DENORMAL_OPERAND),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_DIVIDE_BY_ZERO),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_INEXACT_RESULT),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_INVALID_OPERATION),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_OVERFLOW),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_STACK_CHECK),
EXCEPTION_CODE_INFO(EXCEPTION_FLT_UNDERFLOW),
EXCEPTION_CODE_INFO(EXCEPTION_GUARD_PAGE),
EXCEPTION_CODE_INFO(EXCEPTION_ILLEGAL_INSTRUCTION),
EXCEPTION_CODE_INFO(EXCEPTION_INT_DIVIDE_BY_ZERO),
EXCEPTION_CODE_INFO(EXCEPTION_INT_OVERFLOW),
EXCEPTION_CODE_INFO(EXCEPTION_INVALID_DISPOSITION),
EXCEPTION_CODE_INFO(EXCEPTION_INVALID_HANDLE),
EXCEPTION_CODE_INFO(EXCEPTION_IN_PAGE_ERROR),
EXCEPTION_CODE_INFO(EXCEPTION_NONCONTINUABLE_EXCEPTION),
EXCEPTION_CODE_INFO(EXCEPTION_PRIV_INSTRUCTION),
EXCEPTION_CODE_INFO(EXCEPTION_STACK_OVERFLOW),
};
#endif /* !_WIN32 */
enum CMUnitTestStatus {
CM_TEST_NOT_STARTED,
CM_TEST_PASSED,
CM_TEST_FAILED,
CM_TEST_ERROR,
CM_TEST_SKIPPED,
};
struct CMUnitTestState {
const ListNode *check_point; /* Check point of the test if there's a setup function. */
const struct CMUnitTest *test; /* Point to array element in the tests we get passed */
void *state; /* State associated with the test */
const char *error_message; /* The error messages by the test */
enum CMUnitTestStatus status; /* PASSED, FAILED, ABORT ... */
double runtime; /* Time calculations */
};
/* Exit the currently executing test. */
static void exit_test(const int quit_application)
{
const char *env = getenv("CMOCKA_TEST_ABORT");
int abort_test = 0;
if (env != NULL && strlen(env) == 1) {
abort_test = (env[0] == '1');
}
if (global_skip_test == 0 &&
abort_test == 1) {
print_error("%s", cm_error_message);
abort();
} else if (global_running_test) {
cm_longjmp(global_run_test_env, 1);
} else if (quit_application) {
exit(-1);
}
}
void _skip(const char * const file, const int line)
{
cm_print_error(SOURCE_LOCATION_FORMAT ": Skipped!\n", file, line);
global_skip_test = 1;
exit_test(1);
/* Unreachable */
exit(-1);
}
/* Initialize a SourceLocation structure. */
static void initialize_source_location(SourceLocation * const location) {
assert_non_null(location);
location->file = NULL;
location->line = 0;
}
/* Determine whether a source location is currently set. */
static int source_location_is_set(const SourceLocation * const location) {
assert_non_null(location);
return location->file && location->line;
}
/* Set a source location. */
static void set_source_location(
SourceLocation * const location, const char * const file,
const int line) {
assert_non_null(location);
location->file = file;
location->line = line;
}
static int c_strreplace(char *src,
size_t src_len,
const char *pattern,
const char *repl,
int *str_replaced)
{
char *p = NULL;
p = strstr(src, pattern);
if (p == NULL) {
return -1;
}
do {
size_t of = p - src;
size_t l = strlen(src);
size_t pl = strlen(pattern);
size_t rl = strlen(repl);
/* overflow check */
if (src_len <= l + MAX(pl, rl) + 1) {
return -1;
}
if (rl != pl) {
memmove(src + of + rl, src + of + pl, l - of - pl + 1);
}
memcpy(src + of, repl, rl);
if (str_replaced != NULL) {
*str_replaced = 1;
}
p = strstr(src, pattern);
} while (p != NULL);
return 0;
}
static int c_strmatch(const char *str, const char *pattern)
{
int ok;
if (str == NULL || pattern == NULL) {
return 0;
}
for (;;) {
/* Check if pattern is done */
if (*pattern == '\0') {
/* If string is at the end, we're good */
if (*str == '\0') {
return 1;
}
return 0;
}
if (*pattern == '*') {
/* Move on */
pattern++;
/* If we are at the end, everything is fine */
if (*pattern == '\0') {
return 1;
}
/* Try to match each position */
for (; *str != '\0'; str++) {
ok = c_strmatch(str, pattern);
if (ok) {
return 1;
}
}
/* No match */
return 0;
}
/* If we are at the end, leave */
if (*str == '\0') {
return 0;
}
/* Check if we have a single wildcard or matching char */
if (*pattern != '?' && *str != *pattern) {
return 0;
}
/* Move string and pattern */
str++;
pattern++;
}
return 0;
}
/* Create function results and expected parameter lists. */
void initialize_testing(const char *test_name) {
(void)test_name;
list_initialize(&global_function_result_map_head);
initialize_source_location(&global_last_mock_value_location);
list_initialize(&global_function_parameter_map_head);
initialize_source_location(&global_last_parameter_location);
list_initialize(&global_call_ordering_head);
initialize_source_location(&global_last_parameter_location);
}
static void fail_if_leftover_values(const char *test_name) {
int error_occurred = 0;
(void)test_name;
remove_always_return_values(&global_function_result_map_head, 1);
if (check_for_leftover_values(
&global_function_result_map_head,
"%s() has remaining non-returned values.\n", 1)) {
error_occurred = 1;
}
remove_always_return_values(&global_function_parameter_map_head, 2);
if (check_for_leftover_values(
&global_function_parameter_map_head,
"'%s' parameter still has values that haven't been checked.\n",
2)) {
error_occurred = 1;
}
remove_always_return_values_from_list(&global_call_ordering_head);
if (check_for_leftover_values_list(&global_call_ordering_head,
"%s function was expected to be called but was not.\n")) {
error_occurred = 1;
}
if (error_occurred) {
exit_test(1);
}
}
static void teardown_testing(const char *test_name) {
(void)test_name;
list_free(&global_function_result_map_head, free_symbol_map_value,
(void*)0);
initialize_source_location(&global_last_mock_value_location);
list_free(&global_function_parameter_map_head, free_symbol_map_value,
(void*)1);
initialize_source_location(&global_last_parameter_location);
list_free(&global_call_ordering_head, free_value,
(void*)0);
initialize_source_location(&global_last_call_ordering_location);
}
/* Initialize a list node. */
static ListNode* list_initialize(ListNode * const node) {
node->value = NULL;
node->next = node;
node->prev = node;
node->refcount = 1;
return node;
}
/*
* Adds a value at the tail of a given list.
* The node referencing the value is allocated from the heap.
*/
static ListNode* list_add_value(ListNode * const head, const void *value,
const int refcount) {
ListNode * const new_node = (ListNode*)malloc(sizeof(ListNode));
assert_non_null(head);
assert_non_null(value);
new_node->value = value;
new_node->refcount = refcount;
return list_add(head, new_node);
}
/* Add new_node to the end of the list. */
static ListNode* list_add(ListNode * const head, ListNode *new_node) {
assert_non_null(head);
assert_non_null(new_node);
new_node->next = head;
new_node->prev = head->prev;
head->prev->next = new_node;
head->prev = new_node;
return new_node;
}
/* Remove a node from a list. */
static ListNode* list_remove(
ListNode * const node, const CleanupListValue cleanup_value,
void * const cleanup_value_data) {
assert_non_null(node);
node->prev->next = node->next;
node->next->prev = node->prev;
if (cleanup_value) {
cleanup_value(node->value, cleanup_value_data);
}
return node;
}
/* Remove a list node from a list and free the node. */
static void list_remove_free(
ListNode * const node, const CleanupListValue cleanup_value,
void * const cleanup_value_data) {
assert_non_null(node);
free(list_remove(node, cleanup_value, cleanup_value_data));
}
/*
* Frees memory kept by a linked list The cleanup_value function is called for
* every "value" field of nodes in the list, except for the head. In addition
* to each list value, cleanup_value_data is passed to each call to
* cleanup_value. The head of the list is not deallocated.
*/
static ListNode* list_free(
ListNode * const head, const CleanupListValue cleanup_value,
void * const cleanup_value_data) {
assert_non_null(head);
while (!list_empty(head)) {
list_remove_free(head->next, cleanup_value, cleanup_value_data);
}
return head;
}
/* Determine whether a list is empty. */
static int list_empty(const ListNode * const head) {
assert_non_null(head);
return head->next == head;
}
/*
* Find a value in the list using the equal_func to compare each node with the
* value.
*/
static int list_find(ListNode * const head, const void *value,
const EqualityFunction equal_func, ListNode **output) {
ListNode *current;
assert_non_null(head);
for (current = head->next; current != head; current = current->next) {
if (equal_func(current->value, value)) {
*output = current;
return 1;
}
}
return 0;
}
/* Returns the first node of a list */
static int list_first(ListNode * const head, ListNode **output) {
ListNode *target_node = NULL;
assert_non_null(head);
if (list_empty(head)) {
return 0;
}
target_node = head->next;
*output = target_node;
return 1;
}
/* Deallocate a value referenced by a list. */
static void free_value(const void *value, void *cleanup_value_data) {
(void)cleanup_value_data;
assert_non_null(value);
free((void*)value);
}
/* Releases memory associated to a symbol_map_value. */
static void free_symbol_map_value(const void *value,
void *cleanup_value_data) {
SymbolMapValue * const map_value = (SymbolMapValue*)value;
const LargestIntegralType children = cast_ptr_to_largest_integral_type(cleanup_value_data);
assert_non_null(value);
if (children == 0) {
list_free(&map_value->symbol_values_list_head,
free_value,
NULL);
} else {
list_free(&map_value->symbol_values_list_head,
free_symbol_map_value,
(void *)((uintptr_t)children - 1));
}
free(map_value);
}
/*
* Determine whether a symbol name referenced by a symbol_map_value matches the
* specified function name.
*/
static int symbol_names_match(const void *map_value, const void *symbol) {
return !strcmp(((SymbolMapValue*)map_value)->symbol_name,
(const char*)symbol);
}
/*
* Adds a value to the queue of values associated with the given hierarchy of
* symbols. It's assumed value is allocated from the heap.
*/
static void add_symbol_value(ListNode * const symbol_map_head,
const char * const symbol_names[],
const size_t number_of_symbol_names,
const void* value, const int refcount) {
const char* symbol_name;
ListNode *target_node;
SymbolMapValue *target_map_value;
assert_non_null(symbol_map_head);
assert_non_null(symbol_names);
assert_true(number_of_symbol_names);
symbol_name = symbol_names[0];
if (!list_find(symbol_map_head, symbol_name, symbol_names_match,
&target_node)) {
SymbolMapValue * const new_symbol_map_value =
(SymbolMapValue*)malloc(sizeof(*new_symbol_map_value));
new_symbol_map_value->symbol_name = symbol_name;
list_initialize(&new_symbol_map_value->symbol_values_list_head);
target_node = list_add_value(symbol_map_head, new_symbol_map_value,
1);
}
target_map_value = (SymbolMapValue*)target_node->value;
if (number_of_symbol_names == 1) {
list_add_value(&target_map_value->symbol_values_list_head,
value, refcount);
} else {
add_symbol_value(&target_map_value->symbol_values_list_head,
&symbol_names[1], number_of_symbol_names - 1, value,
refcount);
}
}
/*
* Gets the next value associated with the given hierarchy of symbols.
* The value is returned as an output parameter with the function returning the
* node's old refcount value if a value is found, 0 otherwise. This means that
* a return value of 1 indicates the node was just removed from the list.
*/
static int get_symbol_value(
ListNode * const head, const char * const symbol_names[],
const size_t number_of_symbol_names, void **output) {
const char* symbol_name = NULL;
ListNode *target_node = NULL;
assert_non_null(head);
assert_non_null(symbol_names);
assert_true(number_of_symbol_names);
assert_non_null(output);
symbol_name = symbol_names[0];
if (list_find(head, symbol_name, symbol_names_match, &target_node)) {
SymbolMapValue *map_value = NULL;
ListNode *child_list = NULL;
int return_value = 0;
assert_non_null(target_node);
assert_non_null(target_node->value);
map_value = (SymbolMapValue*)target_node->value;
child_list = &map_value->symbol_values_list_head;
if (number_of_symbol_names == 1) {
ListNode *value_node = NULL;
return_value = list_first(child_list, &value_node);
assert_true(return_value);
/* Add a check to silence clang analyzer */
if (return_value == 0) {
goto out;
}
*output = (void*) value_node->value;
return_value = value_node->refcount;
if (value_node->refcount - 1 == 0) {
list_remove_free(value_node, NULL, NULL);
} else if (value_node->refcount > WILL_RETURN_ONCE) {
--value_node->refcount;
}
} else {
return_value = get_symbol_value(
child_list, &symbol_names[1], number_of_symbol_names - 1,
output);
}
if (list_empty(child_list)) {
list_remove_free(target_node, free_symbol_map_value, (void*)0);
}
return return_value;
}
out:
cm_print_error("No entries for symbol %s.\n", symbol_name);
return 0;
}
/**
* Taverse a list of nodes and remove first symbol value in list that has a
* refcount < -1 (i.e. should always be returned and has been returned at
* least once).
*/
static void remove_always_return_values_from_list(ListNode * const map_head)
{
ListNode * current = NULL;
ListNode * next = NULL;
assert_non_null(map_head);
for (current = map_head->next, next = current->next;
current != map_head;
current = next, next = current->next) {
if (current->refcount < -1) {
list_remove_free(current, free_value, NULL);
}
}
}
/*
* Traverse down a tree of symbol values and remove the first symbol value
* in each branch that has a refcount < -1 (i.e should always be returned
* and has been returned at least once).
*/
static void remove_always_return_values(ListNode * const map_head,
const size_t number_of_symbol_names) {
ListNode *current;
assert_non_null(map_head);
assert_true(number_of_symbol_names);
current = map_head->next;
while (current != map_head) {
SymbolMapValue * const value = (SymbolMapValue*)current->value;
ListNode * const next = current->next;
ListNode *child_list;
assert_non_null(value);
child_list = &value->symbol_values_list_head;
if (!list_empty(child_list)) {
if (number_of_symbol_names == 1) {
ListNode * const child_node = child_list->next;
/* If this item has been returned more than once, free it. */
if (child_node->refcount < -1) {
list_remove_free(child_node, free_value, NULL);
}
} else {
remove_always_return_values(child_list,
number_of_symbol_names - 1);
}
}
if (list_empty(child_list)) {
list_remove_free(current, free_value, NULL);
}
current = next;
}
}
static size_t check_for_leftover_values_list(const ListNode * head,
const char * const error_message)
{
ListNode *child_node;
size_t leftover_count = 0;
if (!list_empty(head))
{
for (child_node = head->next; child_node != head;
child_node = child_node->next, ++leftover_count) {
const FuncOrderingValue *const o =
(const FuncOrderingValue*) child_node->value;
cm_print_error("%s: %s", error_message, o->function);
cm_print_error(SOURCE_LOCATION_FORMAT
": note: remaining item was declared here\n",
o->location.file, o->location.line);
}
}
return leftover_count;
}
/*
* Checks if there are any leftover values set up by the test that were never
* retrieved through execution, and fail the test if that is the case.
*/
static size_t check_for_leftover_values(
const ListNode * const map_head, const char * const error_message,
const size_t number_of_symbol_names) {
const ListNode *current;
size_t symbols_with_leftover_values = 0;
assert_non_null(map_head);
assert_true(number_of_symbol_names);
for (current = map_head->next; current != map_head;
current = current->next) {
const SymbolMapValue * const value =
(SymbolMapValue*)current->value;
const ListNode *child_list;
assert_non_null(value);
child_list = &value->symbol_values_list_head;
if (!list_empty(child_list)) {
if (number_of_symbol_names == 1) {
const ListNode *child_node;
cm_print_error("%s: %s", error_message, value->symbol_name);
for (child_node = child_list->next; child_node != child_list;
child_node = child_node->next) {
const SourceLocation * const location =
(const SourceLocation*)child_node->value;
cm_print_error(SOURCE_LOCATION_FORMAT
": note: remaining item was declared here\n",
location->file, location->line);
}
} else {
cm_print_error("%s: ", value->symbol_name);
check_for_leftover_values(child_list, error_message,
number_of_symbol_names - 1);
}
symbols_with_leftover_values ++;
}
}
return symbols_with_leftover_values;
}
/* Get the next return value for the specified mock function. */
LargestIntegralType _mock(const char * const function, const char* const file,
const int line) {
void *result;
const int rc = get_symbol_value(&global_function_result_map_head,
&function, 1, &result);
if (rc) {
SymbolValue * const symbol = (SymbolValue*)result;
const LargestIntegralType value = symbol->value;
global_last_mock_value_location = symbol->location;
if (rc == 1) {
free(symbol);
}
return value;
} else {
cm_print_error(SOURCE_LOCATION_FORMAT ": error: Could not get value "
"to mock function %s\n", file, line, function);
if (source_location_is_set(&global_last_mock_value_location)) {
cm_print_error(SOURCE_LOCATION_FORMAT
": note: Previously returned mock value was declared here\n",
global_last_mock_value_location.file,
global_last_mock_value_location.line);
} else {
cm_print_error("There were no previously returned mock values for "
"this test.\n");
}
exit_test(1);
}
return 0;
}
/* Ensure that function is being called in proper order */
void _function_called(const char *const function,
const char *const file,
const int line)
{
ListNode *first_value_node = NULL;
ListNode *value_node = NULL;
int rc;
rc = list_first(&global_call_ordering_head, &value_node);
first_value_node = value_node;
if (rc) {
FuncOrderingValue *expected_call;
int cmp;
expected_call = (FuncOrderingValue *)value_node->value;
cmp = strcmp(expected_call->function, function);
if (value_node->refcount < -1) {
/*
* Search through value nodes until either function is found or
* encounter a non-zero refcount greater than -2
*/
if (cmp != 0) {
value_node = value_node->next;
expected_call = (FuncOrderingValue *)value_node->value;
cmp = strcmp(expected_call->function, function);
while (value_node->refcount < -1 &&
cmp != 0 &&
value_node != first_value_node->prev) {
value_node = value_node->next;
if (value_node == NULL) {
break;
}
expected_call = (FuncOrderingValue *)value_node->value;
if (expected_call == NULL) {
continue;
}
cmp = strcmp(expected_call->function, function);
}
if (expected_call == NULL || value_node == first_value_node->prev) {
cm_print_error(SOURCE_LOCATION_FORMAT
": error: No expected mock calls matching "
"called() invocation in %s",
file, line,
function);
exit_test(1);
}
}
}
if (cmp == 0) {
if (value_node->refcount > -2 && --value_node->refcount == 0) {
list_remove_free(value_node, free_value, NULL);
}
} else {
cm_print_error(SOURCE_LOCATION_FORMAT
": error: Expected call to %s but received called() "
"in %s\n",
file, line,
expected_call->function,
function);
exit_test(1);
}
} else {
cm_print_error(SOURCE_LOCATION_FORMAT
": error: No mock calls expected but called() was "
"invoked in %s\n",
file, line,
function);
exit_test(1);
}
}
/* Add a return value for the specified mock function name. */
void _will_return(const char * const function_name, const char * const file,
const int line, const LargestIntegralType value,
const int count) {
SymbolValue * const return_value =
(SymbolValue*)malloc(sizeof(*return_value));
assert_true(count != 0);
return_value->value = value;
set_source_location(&return_value->location, file, line);
add_symbol_value(&global_function_result_map_head, &function_name, 1,
return_value, count);
}
/*
* Add a custom parameter checking function. If the event parameter is NULL
* the event structure is allocated internally by this function. If event
* parameter is provided it must be allocated on the heap and doesn't need to
* be deallocated by the caller.
*/
void _expect_check(
const char* const function, const char* const parameter,
const char* const file, const int line,
const CheckParameterValue check_function,
const LargestIntegralType check_data,
CheckParameterEvent * const event, const int count) {
CheckParameterEvent * const check =
event ? event : (CheckParameterEvent*)malloc(sizeof(*check));
const char* symbols[] = {function, parameter};
check->parameter_name = parameter;
check->check_value = check_function;
check->check_value_data = check_data;
set_source_location(&check->location, file, line);
add_symbol_value(&global_function_parameter_map_head, symbols, 2, check,
count);
}
/*
* Add an call expectations that a particular function is called correctly.
* This is used for code under test that makes calls to several functions
* in depended upon components (mocks).
*/
void _expect_function_call(
const char * const function_name,
const char * const file,
const int line,
const int count)
{
FuncOrderingValue *ordering;
assert_non_null(function_name);
assert_non_null(file);
assert_true(count != 0);
ordering = (FuncOrderingValue *)malloc(sizeof(*ordering));
set_source_location(&ordering->location, file, line);
ordering->function = function_name;
list_add_value(&global_call_ordering_head, ordering, count);
}
/* Returns 1 if the specified float values are equal, else returns 0. */
static int float_compare(const float left,
const float right,
const float epsilon) {
float absLeft;
float absRight;
float largest;
float relDiff;
float diff = left - right;
diff = (diff >= 0.f) ? diff : -diff;
// Check if the numbers are really close -- needed
// when comparing numbers near zero.
if (diff <= epsilon) {
return 1;
}
absLeft = (left >= 0.f) ? left : -left;
absRight = (right >= 0.f) ? right : -right;
largest = (absRight > absLeft) ? absRight : absLeft;
relDiff = largest * FLT_EPSILON;
if (diff > relDiff) {
return 0;
}
return 1;
}
/* Returns 1 if the specified float values are equal. If the values are not equal
* an error is displayed and 0 is returned. */
static int float_values_equal_display_error(const float left,
const float right,
const float epsilon) {
const int equal = float_compare(left, right, epsilon);
if (!equal) {
cm_print_error(FloatPrintfFormat " != "
FloatPrintfFormat "\n", left, right);
}
return equal;
}
/* Returns 1 if the specified float values are different. If the values are equal
* an error is displayed and 0 is returned. */
static int float_values_not_equal_display_error(const float left,
const float right,
const float epsilon) {
const int not_equal = (float_compare(left, right, epsilon) == 0);
if (!not_equal) {
cm_print_error(FloatPrintfFormat " == "
FloatPrintfFormat "\n", left, right);
}
return not_equal;
}
/* Returns 1 if the specified double values are equal, else returns 0. */
static int double_compare(const double left,
const double right,
const double epsilon) {
double absLeft;
double absRight;
double largest;
double relDiff;
double diff = left - right;
diff = (diff >= 0.f) ? diff : -diff;
/*
* Check if the numbers are really close -- needed
* when comparing numbers near zero.
*/
if (diff <= epsilon) {
return 1;
}
absLeft = (left >= 0.f) ? left : -left;
absRight = (right >= 0.f) ? right : -right;
largest = (absRight > absLeft) ? absRight : absLeft;
relDiff = largest * FLT_EPSILON;
if (diff > relDiff) {
return 0;
}
return 1;
}
/*
* Returns 1 if the specified double values are equal. If the values are not
* equal an error is displayed and 0 is returned.
*/
static int double_values_equal_display_error(const double left,
const double right,
const double epsilon) {
const int equal = double_compare(left, right, epsilon);
if (!equal) {
cm_print_error(DoublePrintfFormat " != "
DoublePrintfFormat "\n", left, right);
}
return equal;
}
/*
* Returns 1 if the specified double values are different. If the values are
* equal an error is displayed and 0 is returned.
*/
static int double_values_not_equal_display_error(const double left,
const double right,
const double epsilon) {
const int not_equal = (double_compare(left, right, epsilon) == 0);
if (!not_equal) {
cm_print_error(DoublePrintfFormat " == "
DoublePrintfFormat "\n", left, right);
}
return not_equal;
}
/* Returns 1 if the specified values are equal. If the values are not equal
* an error is displayed and 0 is returned. */
static int values_equal_display_error(const LargestIntegralType left,
const LargestIntegralType right) {
const int equal = left == right;
if (!equal) {
cm_print_error(LargestIntegralTypePrintfFormat " != "
LargestIntegralTypePrintfFormat "\n", left, right);
}
return equal;
}
/*
* Returns 1 if the specified values are not equal. If the values are equal
* an error is displayed and 0 is returned. */
static int values_not_equal_display_error(const LargestIntegralType left,
const LargestIntegralType right) {
const int not_equal = left != right;
if (!not_equal) {
cm_print_error(LargestIntegralTypePrintfFormat " == "
LargestIntegralTypePrintfFormat "\n", left, right);
}
return not_equal;
}
/*
* Determine whether value is contained within check_integer_set.
* If invert is 0 and the value is in the set 1 is returned, otherwise 0 is
* returned and an error is displayed. If invert is 1 and the value is not
* in the set 1 is returned, otherwise 0 is returned and an error is
* displayed.
*/
static int value_in_set_display_error(
const LargestIntegralType value,
const CheckIntegerSet * const check_integer_set, const int invert) {
int succeeded = invert;
assert_non_null(check_integer_set);
{
const LargestIntegralType * const set = check_integer_set->set;
const size_t size_of_set = check_integer_set->size_of_set;
size_t i;
for (i = 0; i < size_of_set; i++) {
if (set[i] == value) {
/* If invert = 0 and item is found, succeeded = 1. */
/* If invert = 1 and item is found, succeeded = 0. */
succeeded = !succeeded;
break;
}
}
if (succeeded) {
return 1;
}
cm_print_error(LargestIntegralTypePrintfFormatDecimal
" is %sin the set (",
value, invert ? "" : "not ");
for (i = 0; i < size_of_set; i++) {
cm_print_error(LargestIntegralTypePrintfFormat ", ", set[i]);
}
cm_print_error(")\n");
}
return 0;
}
/*
* Determine whether a value is within the specified range. If the value is
* within the specified range 1 is returned. If the value isn't within the
* specified range an error is displayed and 0 is returned.
*/
static int integer_in_range_display_error(
const LargestIntegralType value, const LargestIntegralType range_min,
const LargestIntegralType range_max) {
if (value >= range_min && value <= range_max) {
return 1;
}
cm_print_error(LargestIntegralTypePrintfFormatDecimal
" is not within the range "
LargestIntegralTypePrintfFormatDecimal "-"
LargestIntegralTypePrintfFormatDecimal "\n",
value, range_min, range_max);
return 0;
}
/*
* Determine whether a value is within the specified range. If the value
* is not within the range 1 is returned. If the value is within the
* specified range an error is displayed and zero is returned.
*/
static int integer_not_in_range_display_error(
const LargestIntegralType value, const LargestIntegralType range_min,
const LargestIntegralType range_max) {
if (value < range_min || value > range_max) {
return 1;
}
cm_print_error(LargestIntegralTypePrintfFormatDecimal
" is within the range "
LargestIntegralTypePrintfFormatDecimal "-"
LargestIntegralTypePrintfFormatDecimal "\n",
value, range_min, range_max);
return 0;
}
/*
* Determine whether the specified strings are equal. If the strings are equal
* 1 is returned. If they're not equal an error is displayed and 0 is
* returned.
*/
static int string_equal_display_error(
const char * const left, const char * const right) {
if (strcmp(left, right) == 0) {
return 1;
}
cm_print_error("\"%s\" != \"%s\"\n", left, right);
return 0;
}
/*
* Determine whether the specified strings are equal. If the strings are not
* equal 1 is returned. If they're not equal an error is displayed and 0 is
* returned
*/
static int string_not_equal_display_error(
const char * const left, const char * const right) {
if (strcmp(left, right) != 0) {
return 1;
}
cm_print_error("\"%s\" == \"%s\"\n", left, right);
return 0;
}
/*
* Determine whether the specified areas of memory are equal. If they're equal
* 1 is returned otherwise an error is displayed and 0 is returned.
*/
static int memory_equal_display_error(const char* const a, const char* const b,
const size_t size) {
size_t differences = 0;
size_t i;
for (i = 0; i < size; i++) {
const char l = a[i];
const char r = b[i];
if (l != r) {
if (differences < 16) {
cm_print_error("difference at offset %" PRIdS " 0x%02x 0x%02x\n",
i, l, r);
}
differences ++;
}
}
if (differences > 0) {
if (differences >= 16) {
cm_print_error("...\n");
}
cm_print_error("%"PRIdS " bytes of %p and %p differ\n",
differences, (void *)a, (void *)b);
return 0;
}
return 1;
}
/*
* Determine whether the specified areas of memory are not equal. If they're
* not equal 1 is returned otherwise an error is displayed and 0 is
* returned.
*/
static int memory_not_equal_display_error(
const char* const a, const char* const b, const size_t size) {
size_t same = 0;
size_t i;
for (i = 0; i < size; i++) {
const char l = a[i];
const char r = b[i];
if (l == r) {
same ++;
}
}
if (same == size) {
cm_print_error("%"PRIdS "bytes of %p and %p the same\n",
same, (void *)a, (void *)b);
return 0;
}
return 1;
}
/* CheckParameterValue callback to check whether a value is within a set. */
static int check_in_set(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return value_in_set_display_error(value,
cast_largest_integral_type_to_pointer(CheckIntegerSet*,
check_value_data), 0);
}
/* CheckParameterValue callback to check whether a value isn't within a set. */
static int check_not_in_set(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return value_in_set_display_error(value,
cast_largest_integral_type_to_pointer(CheckIntegerSet*,
check_value_data), 1);
}
/* Create the callback data for check_in_set() or check_not_in_set() and
* register a check event. */
static void expect_set(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType values[], const size_t number_of_values,
const CheckParameterValue check_function, const int count) {
CheckIntegerSet * const check_integer_set =
(CheckIntegerSet*)malloc(sizeof(*check_integer_set) +
(sizeof(values[0]) * number_of_values));
LargestIntegralType * const set = (LargestIntegralType*)(
check_integer_set + 1);
declare_initialize_value_pointer_pointer(check_data, check_integer_set);
assert_non_null(values);
assert_true(number_of_values);
memcpy(set, values, number_of_values * sizeof(values[0]));
check_integer_set->set = set;
check_integer_set->size_of_set = number_of_values;
_expect_check(
function, parameter, file, line, check_function,
check_data, &check_integer_set->event, count);
}
/* Add an event to check whether a value is in a set. */
void _expect_in_set(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType values[], const size_t number_of_values,
const int count) {
expect_set(function, parameter, file, line, values, number_of_values,
check_in_set, count);
}
/* Add an event to check whether a value isn't in a set. */
void _expect_not_in_set(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType values[], const size_t number_of_values,
const int count) {
expect_set(function, parameter, file, line, values, number_of_values,
check_not_in_set, count);
}
/* CheckParameterValue callback to check whether a value is within a range. */
static int check_in_range(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
CheckIntegerRange * const check_integer_range =
cast_largest_integral_type_to_pointer(CheckIntegerRange*,
check_value_data);
assert_non_null(check_integer_range);
return integer_in_range_display_error(value, check_integer_range->minimum,
check_integer_range->maximum);
}
/* CheckParameterValue callback to check whether a value is not within a range. */
static int check_not_in_range(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
CheckIntegerRange * const check_integer_range =
cast_largest_integral_type_to_pointer(CheckIntegerRange*,
check_value_data);
assert_non_null(check_integer_range);
return integer_not_in_range_display_error(
value, check_integer_range->minimum, check_integer_range->maximum);
}
/* Create the callback data for check_in_range() or check_not_in_range() and
* register a check event. */
static void expect_range(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType minimum, const LargestIntegralType maximum,
const CheckParameterValue check_function, const int count) {
CheckIntegerRange * const check_integer_range =
(CheckIntegerRange*)malloc(sizeof(*check_integer_range));
declare_initialize_value_pointer_pointer(check_data, check_integer_range);
check_integer_range->minimum = minimum;
check_integer_range->maximum = maximum;
_expect_check(function, parameter, file, line, check_function,
check_data, &check_integer_range->event, count);
}
/* Add an event to determine whether a parameter is within a range. */
void _expect_in_range(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType minimum, const LargestIntegralType maximum,
const int count) {
expect_range(function, parameter, file, line, minimum, maximum,
check_in_range, count);
}
/* Add an event to determine whether a parameter is not within a range. */
void _expect_not_in_range(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType minimum, const LargestIntegralType maximum,
const int count) {
expect_range(function, parameter, file, line, minimum, maximum,
check_not_in_range, count);
}
/* CheckParameterValue callback to check whether a value is equal to an
* expected value. */
static int check_value(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return values_equal_display_error(value, check_value_data);
}
/* Add an event to check a parameter equals an expected value. */
void _expect_value(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType value, const int count) {
_expect_check(function, parameter, file, line, check_value, value, NULL,
count);
}
/* CheckParameterValue callback to check whether a value is not equal to an
* expected value. */
static int check_not_value(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return values_not_equal_display_error(value, check_value_data);
}
/* Add an event to check a parameter is not equal to an expected value. */
void _expect_not_value(
const char* const function, const char* const parameter,
const char* const file, const int line,
const LargestIntegralType value, const int count) {
_expect_check(function, parameter, file, line, check_not_value, value,
NULL, count);
}
/* CheckParameterValue callback to check whether a parameter equals a string. */
static int check_string(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return string_equal_display_error(
cast_largest_integral_type_to_pointer(char*, value),
cast_largest_integral_type_to_pointer(char*, check_value_data));
}
/* Add an event to check whether a parameter is equal to a string. */
void _expect_string(
const char* const function, const char* const parameter,
const char* const file, const int line, const char* string,
const int count) {
declare_initialize_value_pointer_pointer(string_pointer,
discard_const(string));
_expect_check(function, parameter, file, line, check_string,
string_pointer, NULL, count);
}
/* CheckParameterValue callback to check whether a parameter is not equals to
* a string. */
static int check_not_string(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
return string_not_equal_display_error(
cast_largest_integral_type_to_pointer(char*, value),
cast_largest_integral_type_to_pointer(char*, check_value_data));
}
/* Add an event to check whether a parameter is not equal to a string. */
void _expect_not_string(
const char* const function, const char* const parameter,
const char* const file, const int line, const char* string,
const int count) {
declare_initialize_value_pointer_pointer(string_pointer,
discard_const(string));
_expect_check(function, parameter, file, line, check_not_string,
string_pointer, NULL, count);
}
/* CheckParameterValue callback to check whether a parameter equals an area of
* memory. */
static int check_memory(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
CheckMemoryData * const check = cast_largest_integral_type_to_pointer(
CheckMemoryData*, check_value_data);
assert_non_null(check);
return memory_equal_display_error(
cast_largest_integral_type_to_pointer(const char*, value),
(const char*)check->memory, check->size);
}
/* Create the callback data for check_memory() or check_not_memory() and
* register a check event. */
static void expect_memory_setup(
const char* const function, const char* const parameter,
const char* const file, const int line,
const void * const memory, const size_t size,
const CheckParameterValue check_function, const int count) {
CheckMemoryData * const check_data =
(CheckMemoryData*)malloc(sizeof(*check_data) + size);
void * const mem = (void*)(check_data + 1);
declare_initialize_value_pointer_pointer(check_data_pointer, check_data);
assert_non_null(memory);
assert_true(size);
memcpy(mem, memory, size);
check_data->memory = mem;
check_data->size = size;
_expect_check(function, parameter, file, line, check_function,
check_data_pointer, &check_data->event, count);
}
/* Add an event to check whether a parameter matches an area of memory. */
void _expect_memory(
const char* const function, const char* const parameter,
const char* const file, const int line, const void* const memory,
const size_t size, const int count) {
expect_memory_setup(function, parameter, file, line, memory, size,
check_memory, count);
}
/* CheckParameterValue callback to check whether a parameter is not equal to
* an area of memory. */
static int check_not_memory(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
CheckMemoryData * const check = cast_largest_integral_type_to_pointer(
CheckMemoryData*, check_value_data);
assert_non_null(check);
return memory_not_equal_display_error(
cast_largest_integral_type_to_pointer(const char*, value),
(const char*)check->memory,
check->size);
}
/* Add an event to check whether a parameter doesn't match an area of memory. */
void _expect_not_memory(
const char* const function, const char* const parameter,
const char* const file, const int line, const void* const memory,
const size_t size, const int count) {
expect_memory_setup(function, parameter, file, line, memory, size,
check_not_memory, count);
}
/* CheckParameterValue callback that always returns 1. */
static int check_any(const LargestIntegralType value,
const LargestIntegralType check_value_data) {
(void)value;
(void)check_value_data;
return 1;
}
/* Add an event to allow any value for a parameter. */
void _expect_any(
const char* const function, const char* const parameter,
const char* const file, const int line, const int count) {
_expect_check(function, parameter, file, line, check_any, 0, NULL,
count);
}
void _check_expected(
const char * const function_name, const char * const parameter_name,
const char* file, const int line, const LargestIntegralType value) {
void *result = NULL;
const char* symbols[] = {function_name, parameter_name};
const int rc = get_symbol_value(&global_function_parameter_map_head,
symbols, 2, &result);
if (rc) {
CheckParameterEvent * const check = (CheckParameterEvent*)result;
int check_succeeded;
global_last_parameter_location = check->location;
check_succeeded = check->check_value(value, check->check_value_data);
if (rc == 1) {
free(check);
}
if (!check_succeeded) {
cm_print_error(SOURCE_LOCATION_FORMAT
": error: Check of parameter %s, function %s failed\n"
SOURCE_LOCATION_FORMAT
": note: Expected parameter declared here\n",
file, line,
parameter_name, function_name,
global_last_parameter_location.file,
global_last_parameter_location.line);
_fail(file, line);
}
} else {
cm_print_error(SOURCE_LOCATION_FORMAT ": error: Could not get value "
"to check parameter %s of function %s\n", file, line,
parameter_name, function_name);
if (source_location_is_set(&global_last_parameter_location)) {
cm_print_error(SOURCE_LOCATION_FORMAT
": note: Previously declared parameter value was declared here\n",
global_last_parameter_location.file,
global_last_parameter_location.line);
} else {
cm_print_error("There were no previously declared parameter values "
"for this test.\n");
}
exit_test(1);
}
}
/* Replacement for assert. */
void mock_assert(const int result, const char* const expression,
const char* const file, const int line) {
if (!result) {
if (global_expecting_assert) {
global_last_failed_assert = expression;
longjmp(global_expect_assert_env, result);
} else {
cm_print_error("ASSERT: %s\n", expression);
_fail(file, line);
}
}
}
void _assert_true(const LargestIntegralType result,
const char * const expression,
const char * const file, const int line) {
if (!result) {
cm_print_error("%s\n", expression);
_fail(file, line);
}
}
void _assert_return_code(const LargestIntegralType result,
size_t rlen,
const LargestIntegralType error,
const char * const expression,
const char * const file,
const int line)
{
LargestIntegralType valmax;
switch (rlen) {
case 1:
valmax = 255;
break;
case 2:
valmax = 32767;
break;
case 4:
valmax = 2147483647;
break;
case 8:
default:
if (rlen > sizeof(valmax)) {
valmax = 2147483647;
} else {
valmax = 9223372036854775807L;
}
break;
}
if (result > valmax - 1) {
if (error > 0) {
cm_print_error("%s < 0, errno("
LargestIntegralTypePrintfFormatDecimal "): %s\n",
expression, error, strerror((int)error));
} else {
cm_print_error("%s < 0\n", expression);
}
_fail(file, line);
}
}
void _assert_float_equal(const float a,
const float b,
const float epsilon,
const char * const file,
const int line) {
if (!float_values_equal_display_error(a, b, epsilon)) {
_fail(file, line);
}
}
void _assert_float_not_equal(const float a,
const float b,
const float epsilon,
const char * const file,
const int line) {
if (!float_values_not_equal_display_error(a, b, epsilon)) {
_fail(file, line);
}
}
void _assert_double_equal(const double a,
const double b,
const double epsilon,
const char * const file,
const int line) {
if (!double_values_equal_display_error(a, b, epsilon)) {
_fail(file, line);
}
}
void _assert_double_not_equal(const double a,
const double b,
const double epsilon,
const char * const file,
const int line) {
if (!double_values_not_equal_display_error(a, b, epsilon)) {
_fail(file, line);
}
}
void _assert_int_equal(
const LargestIntegralType a, const LargestIntegralType b,
const char * const file, const int line) {
if (!values_equal_display_error(a, b)) {
_fail(file, line);
}
}
void _assert_int_not_equal(
const LargestIntegralType a, const LargestIntegralType b,
const char * const file, const int line) {
if (!values_not_equal_display_error(a, b)) {
_fail(file, line);
}
}
void _assert_string_equal(const char * const a, const char * const b,
const char * const file, const int line) {
if (!string_equal_display_error(a, b)) {
_fail(file, line);
}
}
void _assert_string_not_equal(const char * const a, const char * const b,
const char *file, const int line) {
if (!string_not_equal_display_error(a, b)) {
_fail(file, line);
}
}
void _assert_memory_equal(const void * const a, const void * const b,
const size_t size, const char* const file,
const int line) {
if (!memory_equal_display_error((const char*)a, (const char*)b, size)) {
_fail(file, line);
}
}
void _assert_memory_not_equal(const void * const a, const void * const b,
const size_t size, const char* const file,
const int line) {
if (!memory_not_equal_display_error((const char*)a, (const char*)b,
size)) {
_fail(file, line);
}
}
void _assert_in_range(
const LargestIntegralType value, const LargestIntegralType minimum,
const LargestIntegralType maximum, const char* const file,
const int line) {
if (!integer_in_range_display_error(value, minimum, maximum)) {
_fail(file, line);
}
}
void _assert_not_in_range(
const LargestIntegralType value, const LargestIntegralType minimum,
const LargestIntegralType maximum, const char* const file,
const int line) {
if (!integer_not_in_range_display_error(value, minimum, maximum)) {
_fail(file, line);
}
}
void _assert_in_set(const LargestIntegralType value,
const LargestIntegralType values[],
const size_t number_of_values, const char* const file,
const int line) {
CheckIntegerSet check_integer_set;
check_integer_set.set = values;
check_integer_set.size_of_set = number_of_values;
if (!value_in_set_display_error(value, &check_integer_set, 0)) {
_fail(file, line);
}
}
void _assert_not_in_set(const LargestIntegralType value,
const LargestIntegralType values[],
const size_t number_of_values, const char* const file,
const int line) {
CheckIntegerSet check_integer_set;
check_integer_set.set = values;
check_integer_set.size_of_set = number_of_values;
if (!value_in_set_display_error(value, &check_integer_set, 1)) {
_fail(file, line);
}
}
/* Get the list of allocated blocks. */
static ListNode* get_allocated_blocks_list(void) {
/* If it initialized, initialize the list of allocated blocks. */
if (!global_allocated_blocks.value) {
list_initialize(&global_allocated_blocks);
global_allocated_blocks.value = (void*)1;
}
return &global_allocated_blocks;
}
static void *libc_calloc(size_t nmemb, size_t size)
{
#undef calloc
return calloc(nmemb, size);
#define calloc test_calloc
}
static void libc_free(void *ptr)
{
#undef free
free(ptr);
#define free test_free
}
static void *libc_realloc(void *ptr, size_t size)
{
#undef realloc
return realloc(ptr, size);
#define realloc test_realloc
}
static void vcm_print_error(const char* const format,
va_list args) CMOCKA_PRINTF_ATTRIBUTE(1, 0);
/* It's important to use the libc malloc and free here otherwise
* the automatic free of leaked blocks can reap the error messages
*/
static void vcm_print_error(const char* const format, va_list args)
{
char buffer[1024];
size_t msg_len = 0;
va_list ap;
int len;
va_copy(ap, args);
len = vsnprintf(buffer, sizeof(buffer), format, args);
if (len < 0) {
/* TODO */
goto end;
}
if (cm_error_message == NULL) {
/* CREATE MESSAGE */
cm_error_message = libc_calloc(1, len + 1);
if (cm_error_message == NULL) {
/* TODO */
goto end;
}
} else {
/* APPEND MESSAGE */
char *tmp;
msg_len = strlen(cm_error_message);
tmp = libc_realloc(cm_error_message, msg_len + len + 1);
if (tmp == NULL) {
goto end;
}
cm_error_message = tmp;
}
if (((size_t)len) < sizeof(buffer)) {
/* Use len + 1 to also copy '\0' */
memcpy(cm_error_message + msg_len, buffer, len + 1);
} else {
vsnprintf(cm_error_message + msg_len, len, format, ap);
}
end:
va_end(ap);
}
static void vcm_free_error(char *err_msg)
{
libc_free(err_msg);
}
/* Use the real malloc in this function. */
#undef malloc
void* _test_malloc(const size_t size, const char* file, const int line) {
char *ptr = NULL;
MallocBlockInfo block_info;
ListNode * const block_list = get_allocated_blocks_list();
size_t allocate_size;
char *block = NULL;
allocate_size = size + (MALLOC_GUARD_SIZE * 2) +
sizeof(struct MallocBlockInfoData) + MALLOC_ALIGNMENT;
assert_true(allocate_size > size);
block = (char *)malloc(allocate_size);
assert_non_null(block);
/* Calculate the returned address. */
ptr = (char*)(((size_t)block + MALLOC_GUARD_SIZE +
sizeof(struct MallocBlockInfoData) +
MALLOC_ALIGNMENT) & ~(MALLOC_ALIGNMENT - 1));
/* Initialize the guard blocks. */
memset(ptr - MALLOC_GUARD_SIZE, MALLOC_GUARD_PATTERN, MALLOC_GUARD_SIZE);
memset(ptr + size, MALLOC_GUARD_PATTERN, MALLOC_GUARD_SIZE);
memset(ptr, MALLOC_ALLOC_PATTERN, size);
block_info.ptr = ptr - (MALLOC_GUARD_SIZE +
sizeof(struct MallocBlockInfoData));
set_source_location(&block_info.data->location, file, line);
block_info.data->allocated_size = allocate_size;
block_info.data->size = size;
block_info.data->block = block;
block_info.data->node.value = block_info.ptr;
list_add(block_list, &block_info.data->node);
return ptr;
}
#define malloc test_malloc
void* _test_calloc(const size_t number_of_elements, const size_t size,
const char* file, const int line) {
void* const ptr = _test_malloc(number_of_elements * size, file, line);
if (ptr) {
memset(ptr, 0, number_of_elements * size);
}
return ptr;
}
#define calloc test_calloc
/* Use the real free in this function. */
#undef free
void _test_free(void* const ptr, const char* file, const int line) {
unsigned int i;
char *block = discard_const_p(char, ptr);
MallocBlockInfo block_info;
if (ptr == NULL) {
return;
}
_assert_true(cast_ptr_to_largest_integral_type(ptr), "ptr", file, line);
block_info.ptr = block - (MALLOC_GUARD_SIZE +
sizeof(struct MallocBlockInfoData));
/* Check the guard blocks. */
{
char *guards[2] = {block - MALLOC_GUARD_SIZE,
block + block_info.data->size};
for (i = 0; i < ARRAY_SIZE(guards); i++) {
unsigned int j;
char * const guard = guards[i];
for (j = 0; j < MALLOC_GUARD_SIZE; j++) {
const char diff = guard[j] - MALLOC_GUARD_PATTERN;
if (diff) {
cm_print_error(SOURCE_LOCATION_FORMAT
": error: Guard block of %p size=%lu is corrupt\n"
SOURCE_LOCATION_FORMAT ": note: allocated here at %p\n",
file,
line,
ptr,
(unsigned long)block_info.data->size,
block_info.data->location.file,
block_info.data->location.line,
(void *)&guard[j]);
_fail(file, line);
}
}
}
}
list_remove(&block_info.data->node, NULL, NULL);
block = discard_const_p(char, block_info.data->block);
memset(block, MALLOC_FREE_PATTERN, block_info.data->allocated_size);
free(block);
}
#define free test_free
#undef realloc
void *_test_realloc(void *ptr,
const size_t size,
const char *file,
const int line)
{
MallocBlockInfo block_info;
char *block = ptr;
size_t block_size = size;
void *new_block;
if (ptr == NULL) {
return _test_malloc(size, file, line);
}
if (size == 0) {
_test_free(ptr, file, line);
return NULL;
}
block_info.ptr = block - (MALLOC_GUARD_SIZE +
sizeof(struct MallocBlockInfoData));
new_block = _test_malloc(size, file, line);
if (new_block == NULL) {
return NULL;
}
if (block_info.data->size < size) {
block_size = block_info.data->size;
}
memcpy(new_block, ptr, block_size);
/* Free previous memory */
_test_free(ptr, file, line);
return new_block;
}
#define realloc test_realloc
/* Crudely checkpoint the current heap state. */
static const ListNode* check_point_allocated_blocks(void) {
return get_allocated_blocks_list()->prev;
}
/* Display the blocks allocated after the specified check point. This
* function returns the number of blocks displayed. */
static size_t display_allocated_blocks(const ListNode * const check_point) {
const ListNode * const head = get_allocated_blocks_list();
const ListNode *node;
size_t allocated_blocks = 0;
assert_non_null(check_point);
assert_non_null(check_point->next);
for (node = check_point->next; node != head; node = node->next) {
const MallocBlockInfo block_info = {
.ptr = discard_const(node->value),
};
assert_non_null(block_info.ptr);
if (allocated_blocks == 0) {
cm_print_error("Blocks allocated...\n");
}
cm_print_error(SOURCE_LOCATION_FORMAT ": note: block %p allocated here\n",
block_info.data->location.file,
block_info.data->location.line,
block_info.data->block);
allocated_blocks++;
}
return allocated_blocks;
}
/* Free all blocks allocated after the specified check point. */
static void free_allocated_blocks(const ListNode * const check_point) {
const ListNode * const head = get_allocated_blocks_list();
const ListNode *node;
assert_non_null(check_point);
node = check_point->next;
assert_non_null(node);
while (node != head) {
const MallocBlockInfo block_info = {
.ptr = discard_const(node->value),
};
node = node->next;
free(discard_const_p(char, block_info.data) +
sizeof(struct MallocBlockInfoData) +
MALLOC_GUARD_SIZE);
}
}
/* Fail if any any blocks are allocated after the specified check point. */
static void fail_if_blocks_allocated(const ListNode * const check_point,
const char * const test_name) {
const size_t allocated_blocks = display_allocated_blocks(check_point);
if (allocated_blocks > 0) {
free_allocated_blocks(check_point);
cm_print_error("ERROR: %s leaked %zu block(s)\n", test_name,
allocated_blocks);
exit_test(1);
}
}
void _fail(const char * const file, const int line) {
enum cm_message_output output = cm_get_output();
switch(output) {
case CM_OUTPUT_STDOUT:
cm_print_error("[ LINE ] --- " SOURCE_LOCATION_FORMAT ": error: Failure!", file, line);
break;
default:
cm_print_error(SOURCE_LOCATION_FORMAT ": error: Failure!", file, line);
break;
}
exit_test(1);
/* Unreachable */
exit(-1);
}
#ifndef _WIN32
CMOCKA_NORETURN static void exception_handler(int sig) {
const char *sig_strerror = "";
#ifdef HAVE_STRSIGNAL
sig_strerror = strsignal(sig);
#endif
cm_print_error("Test failed with exception: %s(%d)",
sig_strerror, sig);
exit_test(1);
/* Unreachable */
exit(-1);
}
#else /* _WIN32 */
static LONG WINAPI exception_filter(EXCEPTION_POINTERS *exception_pointers) {
EXCEPTION_RECORD * const exception_record =
exception_pointers->ExceptionRecord;
const DWORD code = exception_record->ExceptionCode;
unsigned int i;
for (i = 0; i < ARRAY_SIZE(exception_codes); i++) {
const ExceptionCodeInfo * const code_info = &exception_codes[i];
if (code == code_info->code) {
static int shown_debug_message = 0;
fflush(stdout);
cm_print_error("%s occurred at %p.\n", code_info->description,
exception_record->ExceptionAddress);
if (!shown_debug_message) {
cm_print_error(
"\n"
"To debug in Visual Studio...\n"
"1. Select menu item File->Open Project\n"
"2. Change 'Files of type' to 'Executable Files'\n"
"3. Open this executable.\n"
"4. Select menu item Debug->Start\n"
"\n"
"Alternatively, set the environment variable \n"
"UNIT_TESTING_DEBUG to 1 and rebuild this executable, \n"
"then click 'Debug' in the popup dialog box.\n"
"\n");
shown_debug_message = 1;
}
exit_test(0);
return EXCEPTION_EXECUTE_HANDLER;
}
}
return EXCEPTION_CONTINUE_SEARCH;
}
#endif /* !_WIN32 */
void cm_print_error(const char * const format, ...)
{
va_list args;
va_start(args, format);
if (cm_error_message_enabled) {
vcm_print_error(format, args);
} else {
vprint_error(format, args);
}
va_end(args);
}
/* Standard output and error print methods. */
void vprint_message(const char* const format, va_list args)
{
char buffer[4096];
vsnprintf(buffer, sizeof(buffer), format, args);
printf("%s", buffer);
fflush(stdout);
#ifdef _WIN32
OutputDebugString(buffer);
#endif /* _WIN32 */
}
void vprint_error(const char* const format, va_list args)
{
char buffer[4096];
vsnprintf(buffer, sizeof(buffer), format, args);
fprintf(stderr, "%s", buffer);
fflush(stderr);
#ifdef _WIN32
OutputDebugString(buffer);
#endif /* _WIN32 */
}
void print_message(const char* const format, ...) {
va_list args;
va_start(args, format);
vprint_message(format, args);
va_end(args);
}
void print_error(const char* const format, ...) {
va_list args;
va_start(args, format);
vprint_error(format, args);
va_end(args);
}
/* New formatter */
static enum cm_message_output cm_get_output(void)
{
enum cm_message_output output = global_msg_output;
char *env;
env = getenv("CMOCKA_MESSAGE_OUTPUT");
if (env != NULL) {
if (strcasecmp(env, "STDOUT") == 0) {
output = CM_OUTPUT_STDOUT;
} else if (strcasecmp(env, "SUBUNIT") == 0) {
output = CM_OUTPUT_SUBUNIT;
} else if (strcasecmp(env, "TAP") == 0) {
output = CM_OUTPUT_TAP;
} else if (strcasecmp(env, "XML") == 0) {
output = CM_OUTPUT_XML;
}
}
return output;
}
enum cm_printf_type {
PRINTF_TEST_START,
PRINTF_TEST_SUCCESS,
PRINTF_TEST_FAILURE,
PRINTF_TEST_ERROR,
PRINTF_TEST_SKIPPED,
};
static int xml_printed;
static int file_append;
static void cmprintf_group_finish_xml(const char *group_name,
size_t total_executed,
size_t total_failed,
size_t total_errors,
size_t total_skipped,
double total_runtime,
struct CMUnitTestState *cm_tests)
{
FILE *fp = stdout;
int file_opened = 0;
int multiple_files = 0;
char *env;
size_t i;
env = getenv("CMOCKA_XML_FILE");
if (env != NULL) {
char buf[1024];
int rc;
snprintf(buf, sizeof(buf), "%s", env);
rc = c_strreplace(buf, sizeof(buf), "%g", group_name, &multiple_files);
if (rc < 0) {
snprintf(buf, sizeof(buf), "%s", env);
}
fp = fopen(buf, "r");
if (fp == NULL) {
fp = fopen(buf, "w");
if (fp != NULL) {
file_append = 1;
file_opened = 1;
} else {
fp = stderr;
}
} else {
fclose(fp);
if (file_append) {
fp = fopen(buf, "a");
if (fp != NULL) {
file_opened = 1;
xml_printed = 1;
} else {
fp = stderr;
}
} else {
fp = stderr;
}
}
}
if (!xml_printed || (file_opened && !file_append)) {
fprintf(fp, "<?xml version=\"1.0\" encoding=\"UTF-8\" ?>\n");
if (!file_opened) {
xml_printed = 1;
}
}
fprintf(fp, "<testsuites>\n");
fprintf(fp, " <testsuite name=\"%s\" time=\"%.3f\" "
"tests=\"%u\" failures=\"%u\" errors=\"%u\" skipped=\"%u\" >\n",
group_name,
total_runtime, /* seconds */
(unsigned)total_executed,
(unsigned)total_failed,
(unsigned)total_errors,
(unsigned)total_skipped);
for (i = 0; i < total_executed; i++) {
struct CMUnitTestState *cmtest = &cm_tests[i];
fprintf(fp, " <testcase name=\"%s\" time=\"%.3f\" >\n",
cmtest->test->name, cmtest->runtime);
switch (cmtest->status) {
case CM_TEST_ERROR:
case CM_TEST_FAILED:
if (cmtest->error_message != NULL) {
fprintf(fp, " <failure><![CDATA[%s]]></failure>\n",
cmtest->error_message);
} else {
fprintf(fp, " <failure message=\"Unknown error\" />\n");
}
break;
case CM_TEST_SKIPPED:
fprintf(fp, " <skipped/>\n");
break;
case CM_TEST_PASSED:
case CM_TEST_NOT_STARTED:
break;
}
fprintf(fp, " </testcase>\n");
}
fprintf(fp, " </testsuite>\n");
fprintf(fp, "</testsuites>\n");
if (file_opened) {
fclose(fp);
}
}
static void cmprintf_group_start_standard(const char *group_name,
const size_t num_tests)
{
print_message("[==========] %s: Running %zu test(s).\n",
group_name,
num_tests);
}
static void cmprintf_group_finish_standard(const char *group_name,
size_t total_executed,
size_t total_passed,
size_t total_failed,
size_t total_errors,
size_t total_skipped,
struct CMUnitTestState *cm_tests)
{
size_t i;
print_message("[==========] %s: %zu test(s) run.\n",
group_name,
total_executed);
print_error("[ PASSED ] %u test(s).\n",
(unsigned)(total_passed));
if (total_skipped) {
print_error("[ SKIPPED ] %s: %zu test(s), listed below:\n",
group_name,
total_skipped);
for (i = 0; i < total_executed; i++) {
struct CMUnitTestState *cmtest = &cm_tests[i];
if (cmtest->status == CM_TEST_SKIPPED) {
print_error("[ SKIPPED ] %s\n", cmtest->test->name);
}
}
print_error("\n %zu SKIPPED TEST(S)\n", total_skipped);
}
if (total_failed) {
print_error("[ FAILED ] %s: %zu test(s), listed below:\n",
group_name,
total_failed);
for (i = 0; i < total_executed; i++) {
struct CMUnitTestState *cmtest = &cm_tests[i];
if (cmtest->status == CM_TEST_FAILED) {
print_error("[ FAILED ] %s\n", cmtest->test->name);
}
}
print_error("\n %zu FAILED TEST(S)\n",
(total_failed + total_errors));
}
}
static void cmprintf_standard(enum cm_printf_type type,
const char *test_name,
const char *error_message)
{
switch (type) {
case PRINTF_TEST_START:
print_message("[ RUN ] %s\n", test_name);
break;
case PRINTF_TEST_SUCCESS:
print_message("[ OK ] %s\n", test_name);
break;
case PRINTF_TEST_FAILURE:
if (error_message != NULL) {
print_error("[ ERROR ] --- %s\n", error_message);
}
print_message("[ FAILED ] %s\n", test_name);
break;
case PRINTF_TEST_SKIPPED:
print_message("[ SKIPPED ] %s\n", test_name);
break;
case PRINTF_TEST_ERROR:
if (error_message != NULL) {
print_error("%s\n", error_message);
}
print_error("[ ERROR ] %s\n", test_name);
break;
}
}
static void cmprintf_group_start_tap(const size_t num_tests)
{
static bool version_printed = false;
if (!version_printed) {
print_message("TAP version 13\n");
version_printed = true;
}
print_message("1..%u\n", (unsigned)num_tests);
}
static void cmprintf_group_finish_tap(const char *group_name,
size_t total_executed,
size_t total_passed,
size_t total_skipped)
{
const char *status = "not ok";
if (total_passed + total_skipped == total_executed) {
status = "ok";
}
print_message("# %s - %s\n", status, group_name);
}
static void cmprintf_tap(enum cm_printf_type type,
size_t test_number,
const char *test_name,
const char *error_message)
{
switch (type) {
case PRINTF_TEST_START:
break;
case PRINTF_TEST_SUCCESS:
print_message("ok %u - %s\n", (unsigned)test_number, test_name);
break;
case PRINTF_TEST_FAILURE:
print_message("not ok %u - %s\n", (unsigned)test_number, test_name);
if (error_message != NULL) {
char *msg;
char *p;
msg = strdup(error_message);
if (msg == NULL) {
return;
}
p = msg;
while (p[0] != '\0') {
char *q = p;
p = strchr(q, '\n');
if (p != NULL) {
p[0] = '\0';
}
print_message("# %s\n", q);
if (p == NULL) {
break;
}
p++;
}
libc_free(msg);
}
break;
case PRINTF_TEST_SKIPPED:
print_message("ok %u # SKIP %s\n", (unsigned)test_number, test_name);
break;
case PRINTF_TEST_ERROR:
print_message("not ok %u - %s %s\n",
(unsigned)test_number, test_name, error_message);
break;
}
}
static void cmprintf_subunit(enum cm_printf_type type,
const char *test_name,
const char *error_message)
{
switch (type) {
case PRINTF_TEST_START:
print_message("test: %s\n", test_name);
break;
case PRINTF_TEST_SUCCESS:
print_message("success: %s\n", test_name);
break;
case PRINTF_TEST_FAILURE:
print_message("failure: %s", test_name);
if (error_message != NULL) {
print_message(" [\n%s\n]\n", error_message);
}
break;
case PRINTF_TEST_SKIPPED:
print_message("skip: %s\n", test_name);
break;
case PRINTF_TEST_ERROR:
print_message("error: %s [ %s ]\n", test_name, error_message);
break;
}
}
static void cmprintf_group_start(const char *group_name,
const size_t num_tests)
{
enum cm_message_output output;
output = cm_get_output();
switch (output) {
case CM_OUTPUT_STDOUT:
cmprintf_group_start_standard(group_name, num_tests);
break;
case CM_OUTPUT_SUBUNIT:
break;
case CM_OUTPUT_TAP:
cmprintf_group_start_tap(num_tests);
break;
case CM_OUTPUT_XML:
break;
}
}
static void cmprintf_group_finish(const char *group_name,
size_t total_executed,
size_t total_passed,
size_t total_failed,
size_t total_errors,
size_t total_skipped,
double total_runtime,
struct CMUnitTestState *cm_tests)
{
enum cm_message_output output;
output = cm_get_output();
switch (output) {
case CM_OUTPUT_STDOUT:
cmprintf_group_finish_standard(group_name,
total_executed,
total_passed,
total_failed,
total_errors,
total_skipped,
cm_tests);
break;
case CM_OUTPUT_SUBUNIT:
break;
case CM_OUTPUT_TAP:
cmprintf_group_finish_tap(group_name,
total_executed,
total_passed,
total_skipped);
break;
case CM_OUTPUT_XML:
cmprintf_group_finish_xml(group_name,
total_executed,
total_failed,
total_errors,
total_skipped,
total_runtime,
cm_tests);
break;
}
}
static void cmprintf(enum cm_printf_type type,
size_t test_number,
const char *test_name,
const char *error_message)
{
enum cm_message_output output;
output = cm_get_output();
switch (output) {
case CM_OUTPUT_STDOUT:
cmprintf_standard(type, test_name, error_message);
break;
case CM_OUTPUT_SUBUNIT:
cmprintf_subunit(type, test_name, error_message);
break;
case CM_OUTPUT_TAP:
cmprintf_tap(type, test_number, test_name, error_message);
break;
case CM_OUTPUT_XML:
break;
}
}
void cmocka_set_message_output(enum cm_message_output output)
{
global_msg_output = output;
}
void cmocka_set_test_filter(const char *pattern)
{
global_test_filter_pattern = pattern;
}
void cmocka_set_skip_filter(const char *pattern)
{
global_skip_filter_pattern = pattern;
}
/****************************************************************************
* TIME CALCULATIONS
****************************************************************************/
#ifdef HAVE_STRUCT_TIMESPEC
static struct timespec cm_tspecdiff(struct timespec time1,
struct timespec time0)
{
struct timespec ret;
int xsec = 0;
int sign = 1;
if (time0.tv_nsec > time1.tv_nsec) {
xsec = (int) ((time0.tv_nsec - time1.tv_nsec) / (1E9 + 1));
time0.tv_nsec -= (long int) (1E9 * xsec);
time0.tv_sec += xsec;
}
if ((time1.tv_nsec - time0.tv_nsec) > 1E9) {
xsec = (int) ((time1.tv_nsec - time0.tv_nsec) / 1E9);
time0.tv_nsec += (long int) (1E9 * xsec);
time0.tv_sec -= xsec;
}
ret.tv_sec = time1.tv_sec - time0.tv_sec;
ret.tv_nsec = time1.tv_nsec - time0.tv_nsec;
if (time1.tv_sec < time0.tv_sec) {
sign = -1;
}
ret.tv_sec = ret.tv_sec * sign;
return ret;
}
static double cm_secdiff(struct timespec clock1, struct timespec clock0)
{
double ret;
struct timespec diff;
diff = cm_tspecdiff(clock1, clock0);
ret = (double) diff.tv_sec;
ret += (double) diff.tv_nsec / (double) 1E9;
return ret;
}
#endif /* HAVE_STRUCT_TIMESPEC */
/****************************************************************************
* CMOCKA TEST RUNNER
****************************************************************************/
static int cmocka_run_one_test_or_fixture(const char *function_name,
CMUnitTestFunction test_func,
CMFixtureFunction setup_func,
CMFixtureFunction teardown_func,
void ** const volatile state,
const void *const heap_check_point)
{
const ListNode * const volatile check_point = (const ListNode*)
(heap_check_point != NULL ?
heap_check_point : check_point_allocated_blocks());
int handle_exceptions = 1;
void *current_state = NULL;
int rc = 0;
/* FIXME check only one test or fixture is set */
/* Detect if we should handle exceptions */
#ifdef _WIN32
handle_exceptions = !IsDebuggerPresent();
#endif /* _WIN32 */
#ifdef UNIT_TESTING_DEBUG
handle_exceptions = 0;
#endif /* UNIT_TESTING_DEBUG */
if (handle_exceptions) {
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_SIZE(exception_signals); i++) {
default_signal_functions[i] = signal(
exception_signals[i], exception_handler);
}
#else /* _WIN32 */
previous_exception_filter = SetUnhandledExceptionFilter(
exception_filter);
#endif /* !_WIN32 */
}
/* Init the test structure */
initialize_testing(function_name);
global_running_test = 1;
if (cm_setjmp(global_run_test_env) == 0) {
if (test_func != NULL) {
test_func(state != NULL ? state : ¤t_state);
fail_if_blocks_allocated(check_point, function_name);
rc = 0;
} else if (setup_func != NULL) {
rc = setup_func(state != NULL ? state : ¤t_state);
/*
* For setup we can ignore any allocated blocks. We just need to
* ensure they're deallocated on tear down.
*/
} else if (teardown_func != NULL) {
rc = teardown_func(state != NULL ? state : ¤t_state);
fail_if_blocks_allocated(check_point, function_name);
} else {
/* ERROR */
}
fail_if_leftover_values(function_name);
global_running_test = 0;
} else {
/* TEST FAILED */
global_running_test = 0;
rc = -1;
}
teardown_testing(function_name);
if (handle_exceptions) {
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_SIZE(exception_signals); i++) {
signal(exception_signals[i], default_signal_functions[i]);
}
#else /* _WIN32 */
if (previous_exception_filter) {
SetUnhandledExceptionFilter(previous_exception_filter);
previous_exception_filter = NULL;
}
#endif /* !_WIN32 */
}
return rc;
}
static int cmocka_run_group_fixture(const char *function_name,
CMFixtureFunction setup_func,
CMFixtureFunction teardown_func,
void **state,
const void *const heap_check_point)
{
int rc;
if (setup_func != NULL) {
rc = cmocka_run_one_test_or_fixture(function_name,
NULL,
setup_func,
NULL,
state,
heap_check_point);
} else {
rc = cmocka_run_one_test_or_fixture(function_name,
NULL,
NULL,
teardown_func,
state,
heap_check_point);
}
return rc;
}
static int cmocka_run_one_tests(struct CMUnitTestState *test_state)
{
#ifdef HAVE_STRUCT_TIMESPEC
struct timespec start = {
.tv_sec = 0,
.tv_nsec = 0,
};
struct timespec finish = {
.tv_sec = 0,
.tv_nsec = 0,
};
#endif
int rc = 0;
/* Run setup */
if (test_state->test->setup_func != NULL) {
/* Setup the memory check point, it will be evaluated on teardown */
test_state->check_point = check_point_allocated_blocks();
rc = cmocka_run_one_test_or_fixture(test_state->test->name,
NULL,
test_state->test->setup_func,
NULL,
&test_state->state,
test_state->check_point);
if (rc != 0) {
test_state->status = CM_TEST_ERROR;
cm_print_error("Test setup failed");
}
}
/* Run test */
#ifdef HAVE_STRUCT_TIMESPEC
CMOCKA_CLOCK_GETTIME(CLOCK_REALTIME, &start);
#endif
if (rc == 0) {
rc = cmocka_run_one_test_or_fixture(test_state->test->name,
test_state->test->test_func,
NULL,
NULL,
&test_state->state,
NULL);
if (rc == 0) {
test_state->status = CM_TEST_PASSED;
} else {
if (global_skip_test) {
test_state->status = CM_TEST_SKIPPED;
global_skip_test = 0; /* Do not skip the next test */
} else {
test_state->status = CM_TEST_FAILED;
}
}
rc = 0;
}
test_state->runtime = 0.0;
#ifdef HAVE_STRUCT_TIMESPEC
CMOCKA_CLOCK_GETTIME(CLOCK_REALTIME, &finish);
test_state->runtime = cm_secdiff(finish, start);
#endif
/* Run teardown */
if (rc == 0 && test_state->test->teardown_func != NULL) {
rc = cmocka_run_one_test_or_fixture(test_state->test->name,
NULL,
NULL,
test_state->test->teardown_func,
&test_state->state,
test_state->check_point);
if (rc != 0) {
test_state->status = CM_TEST_ERROR;
cm_print_error("Test teardown failed");
}
}
test_state->error_message = cm_error_message;
cm_error_message = NULL;
return rc;
}
int _cmocka_run_group_tests(const char *group_name,
const struct CMUnitTest * const tests,
const size_t num_tests,
CMFixtureFunction group_setup,
CMFixtureFunction group_teardown)
{
struct CMUnitTestState *cm_tests;
const ListNode *group_check_point = check_point_allocated_blocks();
void *group_state = NULL;
size_t total_tests = 0;
size_t total_failed = 0;
size_t total_passed = 0;
size_t total_executed = 0;
size_t total_errors = 0;
size_t total_skipped = 0;
double total_runtime = 0;
size_t i;
int rc;
/* Make sure LargestIntegralType is at least the size of a pointer. */
assert_true(sizeof(LargestIntegralType) >= sizeof(void*));
cm_tests = libc_calloc(1, sizeof(struct CMUnitTestState) * num_tests);
if (cm_tests == NULL) {
return -1;
}
/* Setup cmocka test array */
for (i = 0; i < num_tests; i++) {
if (tests[i].name != NULL &&
(tests[i].test_func != NULL
|| tests[i].setup_func != NULL
|| tests[i].teardown_func != NULL)) {
if (global_test_filter_pattern != NULL) {
int match;
match = c_strmatch(tests[i].name, global_test_filter_pattern);
if (!match) {
continue;
}
}
if (global_skip_filter_pattern != NULL) {
int match;
match = c_strmatch(tests[i].name, global_skip_filter_pattern);
if (match) {
continue;
}
}
cm_tests[total_tests] = (struct CMUnitTestState) {
.test = &tests[i],
.status = CM_TEST_NOT_STARTED,
.state = NULL,
};
total_tests++;
}
}
cmprintf_group_start(group_name, total_tests);
rc = 0;
/* Run group setup */
if (group_setup != NULL) {
rc = cmocka_run_group_fixture("cmocka_group_setup",
group_setup,
NULL,
&group_state,
group_check_point);
}
if (rc == 0) {
/* Execute tests */
for (i = 0; i < total_tests; i++) {
struct CMUnitTestState *cmtest = &cm_tests[i];
size_t test_number = i + 1;
cmprintf(PRINTF_TEST_START, test_number, cmtest->test->name, NULL);
if (group_state != NULL) {
cmtest->state = group_state;
} else if (cmtest->test->initial_state != NULL) {
cmtest->state = cmtest->test->initial_state;
}
rc = cmocka_run_one_tests(cmtest);
total_executed++;
total_runtime += cmtest->runtime;
if (rc == 0) {
switch (cmtest->status) {
case CM_TEST_PASSED:
cmprintf(PRINTF_TEST_SUCCESS,
test_number,
cmtest->test->name,
cmtest->error_message);
total_passed++;
break;
case CM_TEST_SKIPPED:
cmprintf(PRINTF_TEST_SKIPPED,
test_number,
cmtest->test->name,
cmtest->error_message);
total_skipped++;
break;
case CM_TEST_FAILED:
cmprintf(PRINTF_TEST_FAILURE,
test_number,
cmtest->test->name,
cmtest->error_message);
total_failed++;
break;
default:
cmprintf(PRINTF_TEST_ERROR,
test_number,
cmtest->test->name,
"Internal cmocka error");
total_errors++;
break;
}
} else {
char err_msg[2048] = {0};
snprintf(err_msg, sizeof(err_msg),
"Could not run test: %s",
cmtest->error_message);
cmprintf(PRINTF_TEST_ERROR,
test_number,
cmtest->test->name,
err_msg);
total_errors++;
}
}
} else {
if (cm_error_message != NULL) {
print_error("[ ERROR ] --- %s\n", cm_error_message);
vcm_free_error(cm_error_message);
cm_error_message = NULL;
}
cmprintf(PRINTF_TEST_ERROR, 0,
group_name, "[ FAILED ] GROUP SETUP");
total_errors++;
}
/* Run group teardown */
if (group_teardown != NULL) {
rc = cmocka_run_group_fixture("cmocka_group_teardown",
NULL,
group_teardown,
&group_state,
group_check_point);
if (rc != 0) {
if (cm_error_message != NULL) {
print_error("[ ERROR ] --- %s\n", cm_error_message);
vcm_free_error(cm_error_message);
cm_error_message = NULL;
}
cmprintf(PRINTF_TEST_ERROR, 0,
group_name, "[ FAILED ] GROUP TEARDOWN");
}
}
cmprintf_group_finish(group_name,
total_executed,
total_passed,
total_failed,
total_errors,
total_skipped,
total_runtime,
cm_tests);
for (i = 0; i < total_tests; i++) {
vcm_free_error(discard_const_p(char, cm_tests[i].error_message));
}
libc_free(cm_tests);
fail_if_blocks_allocated(group_check_point, "cmocka_group_tests");
return (int)(total_failed + total_errors);
}
/****************************************************************************
* DEPRECATED TEST RUNNER
****************************************************************************/
int _run_test(
const char * const function_name, const UnitTestFunction Function,
void ** const volatile state, const UnitTestFunctionType function_type,
const void* const heap_check_point) {
const ListNode * const volatile check_point = (const ListNode*)
(heap_check_point ?
heap_check_point : check_point_allocated_blocks());
void *current_state = NULL;
volatile int rc = 1;
int handle_exceptions = 1;
#ifdef _WIN32
handle_exceptions = !IsDebuggerPresent();
#endif /* _WIN32 */
#ifdef UNIT_TESTING_DEBUG
handle_exceptions = 0;
#endif /* UNIT_TESTING_DEBUG */
cm_error_message_enabled = 0;
if (handle_exceptions) {
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_SIZE(exception_signals); i++) {
default_signal_functions[i] = signal(
exception_signals[i], exception_handler);
}
#else /* _WIN32 */
previous_exception_filter = SetUnhandledExceptionFilter(
exception_filter);
#endif /* !_WIN32 */
}
if (function_type == UNIT_TEST_FUNCTION_TYPE_TEST) {
print_message("[ RUN ] %s\n", function_name);
}
initialize_testing(function_name);
global_running_test = 1;
if (cm_setjmp(global_run_test_env) == 0) {
Function(state ? state : ¤t_state);
fail_if_leftover_values(function_name);
/* If this is a setup function then ignore any allocated blocks
* only ensure they're deallocated on tear down. */
if (function_type != UNIT_TEST_FUNCTION_TYPE_SETUP) {
fail_if_blocks_allocated(check_point, function_name);
}
global_running_test = 0;
if (function_type == UNIT_TEST_FUNCTION_TYPE_TEST) {
print_message("[ OK ] %s\n", function_name);
}
rc = 0;
} else {
global_running_test = 0;
print_message("[ FAILED ] %s\n", function_name);
}
teardown_testing(function_name);
if (handle_exceptions) {
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_SIZE(exception_signals); i++) {
signal(exception_signals[i], default_signal_functions[i]);
}
#else /* _WIN32 */
if (previous_exception_filter) {
SetUnhandledExceptionFilter(previous_exception_filter);
previous_exception_filter = NULL;
}
#endif /* !_WIN32 */
}
return rc;
}
int _run_tests(const UnitTest * const tests, const size_t number_of_tests) {
/* Whether to execute the next test. */
int run_next_test = 1;
/* Whether the previous test failed. */
int previous_test_failed = 0;
/* Whether the previous setup failed. */
int previous_setup_failed = 0;
/* Check point of the heap state. */
const ListNode * const check_point = check_point_allocated_blocks();
/* Current test being executed. */
size_t current_test = 0;
/* Number of tests executed. */
size_t tests_executed = 0;
/* Number of failed tests. */
size_t total_failed = 0;
/* Number of setup functions. */
size_t setups = 0;
/* Number of teardown functions. */
size_t teardowns = 0;
size_t i;
/*
* A stack of test states. A state is pushed on the stack
* when a test setup occurs and popped on tear down.
*/
TestState* test_states =
(TestState*)malloc(number_of_tests * sizeof(*test_states));
/* The number of test states which should be 0 at the end */
long number_of_test_states = 0;
/* Names of the tests that failed. */
const char** failed_names = (const char**)malloc(number_of_tests *
sizeof(*failed_names));
void **current_state = NULL;
/* Count setup and teardown functions */
for (i = 0; i < number_of_tests; i++) {
const UnitTest * const test = &tests[i];
if (test->function_type == UNIT_TEST_FUNCTION_TYPE_SETUP) {
setups++;
}
if (test->function_type == UNIT_TEST_FUNCTION_TYPE_TEARDOWN) {
teardowns++;
}
}
print_message("[==========] Running %"PRIdS " test(s).\n",
number_of_tests - setups - teardowns);
/* Make sure LargestIntegralType is at least the size of a pointer. */
assert_true(sizeof(LargestIntegralType) >= sizeof(void*));
while (current_test < number_of_tests) {
const ListNode *test_check_point = NULL;
TestState *current_TestState;
const UnitTest * const test = &tests[current_test++];
if (!test->function) {
continue;
}
switch (test->function_type) {
case UNIT_TEST_FUNCTION_TYPE_TEST:
if (! previous_setup_failed) {
run_next_test = 1;
}
break;
case UNIT_TEST_FUNCTION_TYPE_SETUP: {
/* Checkpoint the heap before the setup. */
current_TestState = &test_states[number_of_test_states++];
current_TestState->check_point = check_point_allocated_blocks();
test_check_point = current_TestState->check_point;
current_state = ¤t_TestState->state;
*current_state = NULL;
run_next_test = 1;
break;
}
case UNIT_TEST_FUNCTION_TYPE_TEARDOWN:
/* Check the heap based on the last setup checkpoint. */
assert_true(number_of_test_states);
current_TestState = &test_states[--number_of_test_states];
test_check_point = current_TestState->check_point;
current_state = ¤t_TestState->state;
break;
default:
print_error("Invalid unit test function type %d\n",
test->function_type);
exit_test(1);
break;
}
if (run_next_test) {
int failed = _run_test(test->name, test->function, current_state,
test->function_type, test_check_point);
if (failed) {
failed_names[total_failed] = test->name;
}
switch (test->function_type) {
case UNIT_TEST_FUNCTION_TYPE_TEST:
previous_test_failed = failed;
total_failed += failed;
tests_executed ++;
break;
case UNIT_TEST_FUNCTION_TYPE_SETUP:
if (failed) {
total_failed ++;
tests_executed ++;
/* Skip forward until the next test or setup function. */
run_next_test = 0;
previous_setup_failed = 1;
}
previous_test_failed = 0;
break;
case UNIT_TEST_FUNCTION_TYPE_TEARDOWN:
/* If this test failed. */
if (failed && !previous_test_failed) {
total_failed ++;
}
break;
default:
#ifndef _HPUX
assert_null("BUG: shouldn't be here!");
#endif
break;
}
}
}
print_message("[==========] %"PRIdS " test(s) run.\n", tests_executed);
print_error("[ PASSED ] %"PRIdS " test(s).\n", tests_executed - total_failed);
if (total_failed > 0) {
print_error("[ FAILED ] %"PRIdS " test(s), listed below:\n", total_failed);
for (i = 0; i < total_failed; i++) {
print_error("[ FAILED ] %s\n", failed_names[i]);
}
} else {
print_error("\n %"PRIdS " FAILED TEST(S)\n", total_failed);
}
if (number_of_test_states != 0) {
print_error("[ ERROR ] Mismatched number of setup %"PRIdS " and "
"teardown %"PRIdS " functions\n", setups, teardowns);
total_failed = (size_t)-1;
}
free(test_states);
free((void*)failed_names);
fail_if_blocks_allocated(check_point, "run_tests");
return (int)total_failed;
}
int _run_group_tests(const UnitTest * const tests, const size_t number_of_tests)
{
UnitTestFunction setup = NULL;
const char *setup_name = NULL;
size_t num_setups = 0;
UnitTestFunction teardown = NULL;
const char *teardown_name = NULL;
size_t num_teardowns = 0;
size_t current_test = 0;
size_t i;
/* Number of tests executed. */
size_t tests_executed = 0;
/* Number of failed tests. */
size_t total_failed = 0;
/* Check point of the heap state. */
const ListNode * const check_point = check_point_allocated_blocks();
const char **failed_names = NULL;
void **current_state = NULL;
TestState group_state = {
.check_point = NULL,
};
if (number_of_tests == 0) {
return -1;
}
failed_names = (const char **)malloc(number_of_tests *
sizeof(*failed_names));
if (failed_names == NULL) {
return -2;
}
/* Find setup and teardown function */
for (i = 0; i < number_of_tests; i++) {
const UnitTest * const test = &tests[i];
if (test->function_type == UNIT_TEST_FUNCTION_TYPE_GROUP_SETUP) {
if (setup == NULL) {
setup = test->function;
setup_name = test->name;
num_setups = 1;
} else {
print_error("[ ERROR ] More than one group setup function detected\n");
exit_test(1);
}
}
if (test->function_type == UNIT_TEST_FUNCTION_TYPE_GROUP_TEARDOWN) {
if (teardown == NULL) {
teardown = test->function;
teardown_name = test->name;
num_teardowns = 1;
} else {
print_error("[ ERROR ] More than one group teardown function detected\n");
exit_test(1);
}
}
}
print_message("[==========] Running %"PRIdS " test(s).\n",
number_of_tests - num_setups - num_teardowns);
if (setup != NULL) {
int failed;
group_state.check_point = check_point_allocated_blocks();
current_state = &group_state.state;
*current_state = NULL;
failed = _run_test(setup_name,
setup,
current_state,
UNIT_TEST_FUNCTION_TYPE_SETUP,
group_state.check_point);
if (failed) {
failed_names[total_failed] = setup_name;
}
total_failed += failed;
tests_executed++;
}
while (current_test < number_of_tests) {
int run_test = 0;
const UnitTest * const test = &tests[current_test++];
if (test->function == NULL) {
continue;
}
switch (test->function_type) {
case UNIT_TEST_FUNCTION_TYPE_TEST:
run_test = 1;
break;
case UNIT_TEST_FUNCTION_TYPE_SETUP:
case UNIT_TEST_FUNCTION_TYPE_TEARDOWN:
case UNIT_TEST_FUNCTION_TYPE_GROUP_SETUP:
case UNIT_TEST_FUNCTION_TYPE_GROUP_TEARDOWN:
break;
default:
print_error("Invalid unit test function type %d\n",
test->function_type);
break;
}
if (run_test) {
int failed;
failed = _run_test(test->name,
test->function,
current_state,
test->function_type,
NULL);
if (failed) {
failed_names[total_failed] = test->name;
}
total_failed += failed;
tests_executed++;
}
}
if (teardown != NULL) {
int failed;
failed = _run_test(teardown_name,
teardown,
current_state,
UNIT_TEST_FUNCTION_TYPE_GROUP_TEARDOWN,
group_state.check_point);
if (failed) {
failed_names[total_failed] = teardown_name;
}
total_failed += failed;
tests_executed++;
}
print_message("[==========] %"PRIdS " test(s) run.\n", tests_executed);
print_error("[ PASSED ] %"PRIdS " test(s).\n", tests_executed - total_failed);
if (total_failed) {
print_error("[ FAILED ] %"PRIdS " test(s), listed below:\n", total_failed);
for (i = 0; i < total_failed; i++) {
print_error("[ FAILED ] %s\n", failed_names[i]);
}
} else {
print_error("\n %"PRIdS " FAILED TEST(S)\n", total_failed);
}
free((void*)failed_names);
fail_if_blocks_allocated(check_point, "run_group_tests");
return (int)total_failed;
}
|