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
|
/* LCOV_EXCL_STOP */
/*
* Copyright 2008 Google Inc.
*
* 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.
*/
/* LCOV_EXCL_START */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#ifdef HAVE_MALLOC_H
# include <malloc.h>
#endif
#include <setjmp.h>
#ifndef _WIN32
# include <signal.h>
#endif // !_WIN32
#include <libgen.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
#include <time.h>
#ifdef _WIN32
# include <windows.h>
#endif // _WIN32
#include <assert.h>
#include <cmockery.h>
#include <schema.h>
/* Backwards compatibility with headers shipped with Visual Studio 2005 and
* earlier. */
#ifdef _WIN32
WINBASEAPI BOOL WINAPI IsDebuggerPresent(VOID);
#endif // _WIN32
// 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.
#define MALLOC_ALIGNMENT sizeof(size_t)
// Printf formatting for source code locations.
#define SOURCE_LOCATION_FORMAT "%s:%d"
// Calculates the number of elements in an array.
#define ARRAY_LENGTH(x) (sizeof(x) / sizeof((x)[0]))
// Declare and initialize the pointer member of ValuePointer variable name
// with ptr.
#define declare_initialize_value_pointer_pointer(name, ptr) \
ValuePointer name ; \
name.value = 0; \
name.pointer = (void*)(ptr)
// Declare and initialize the value member of ValuePointer variable name
// with val.
#define declare_initialize_value_pointer_value(name, val) \
ValuePointer name ; \
name.value = val
// Cast a LargestIntegralType to pointer_type via a ValuePointer.
#define cast_largest_integral_type_to_pointer( \
pointer_type, largest_integral_type) \
((pointer_type)((ValuePointer*)&(largest_integral_type))->pointer)
// Used to cast LargestIntegralType to void* and vice versa.
typedef union ValuePointer
{
LargestIntegralType value;
void *pointer;
} ValuePointer;
// Doubly linked list node.
typedef struct ListNode
{
const void *value;
int refcount;
struct ListNode *next;
struct ListNode *prev;
} ListNode;
// Debug information for malloc().
typedef struct MallocBlockInfo
{
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.
} 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;
// 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.
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 int check_for_leftover_values(const ListNode *const map_head, const char *const error_message,
const size_t number_of_symbol_names);
// This must be called at the beginning of a test to initialize some data
// structures.
static void initialize_testing(void);
// This must be called at the end of a test to free() allocated structures.
static void teardown_testing(void);
// Keeps track of the calling context returned by setenv() so that the fail()
// method can jump out of a test.
static jmp_buf global_run_test_env;
static 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;
const char *global_expect_assert_expression;
int global_expecting_assert = 0;
// Keeps a map of the values that functions will have to return to provide
// mocked interfaces.
static ListNode global_function_result_map_head;
// Location of the last mock value returned was declared.
static SourceLocation global_last_mock_value_location;
/* Keeps a map of the values that functions expect as parameters to their
* mocked interfaces. */
static ListNode global_function_parameter_map_head;
// Location of last parameter value checked was declared.
static SourceLocation global_last_parameter_location;
// List of all currently allocated blocks.
static ListNode global_allocated_blocks;
// Data of running tests for XML output.
static int global_errors;
static const char *global_filename;
static const char *global_xmlfile;
static int global_is_file_writer_test; /* bool, but type not defined here */
#ifndef _WIN32
// Signals caught by exception_handler().
static const int exception_signals[] =
{
SIGFPE,
SIGILL,
SIGSEGV,
SIGBUS,
SIGSYS,
};
// Default signal functions that should be restored after a test is complete.
typedef void (*SignalFunction) (int signal);
static SignalFunction default_signal_functions[ARRAY_LENGTH(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
static void exit_test(void) FUNC_ATTR_NORETURN;
// Exit the currently executing test.
static void exit_test(void)
{
if (global_running_test)
{
longjmp(global_run_test_env, 1);
}
else
{
exit(-1);
}
}
#ifdef _WIN32
// Exit the currently executing test.
static void exit_test_no_app(void)
{
if (global_running_test)
{
longjmp(global_run_test_env, 1);
}
}
#endif
// Initialize a SourceLocation structure.
static void initialize_source_location(SourceLocation *const location)
{
assert_true(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_true(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_true(location);
location->file = file;
location->line = line;
}
// Create function results and expected parameter lists.
void initialize_testing(void)
{
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);
}
static void fail_if_leftover_values(const char *test_name)
{
int error_occurred = 0;
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))
{
print_xml(XS_RUN_TEST_ERROR
"\"%s() has remaining non-returned values.\">\n"
XS_RUN_TEST_ERROR_END,
"fail_if_leftover_values", test_name);
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))
{
print_xml(XS_RUN_TEST_ERROR
"\"%s parameter still has values that haven't been checked.\">\n"
XS_RUN_TEST_ERROR_END,
"fail_if_leftover_values", test_name);
error_occurred = 1;
}
if (error_occurred)
{
global_errors++;
exit_test();
}
}
void teardown_testing(void)
{
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);
}
// 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_true(head);
assert_true(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_true(head);
assert_true(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_true(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_true(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_true(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_true(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_true(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;
assert_true(head);
if (list_empty(head))
{
return 0;
}
target_node = head->next;
*output = target_node;
return 1;
}
#if defined(__GNUC__) && ((__GNUC__ * 100 + __GNUC_MINOR__ * 10) >= 240)
# define ARG_UNUSED __attribute__((unused))
#else
# define ARG_UNUSED
#endif
// Deallocate a value referenced by a list.
static void free_value(const void *value, ARG_UNUSED void *cleanup_value_data)
{
assert_true(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 uintptr_t children = (uintptr_t) cleanup_value_data;
assert_true(value);
list_free(&map_value->symbol_values_list_head,
children ? free_symbol_map_value : free_value, (void *) (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_true(symbol_map_head);
assert_true((const char *const *)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 = 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;
ListNode *target_node;
assert_true(head);
assert_true((const char *const *)symbol_names);
assert_true(number_of_symbol_names);
assert_true(output);
symbol_name = symbol_names[0];
if (list_find(head, symbol_name, symbol_names_match, &target_node))
{
SymbolMapValue *map_value;
ListNode *child_list;
int return_value = 0;
assert_true(target_node);
assert_true(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);
*output = (void *) value_node->value;
return_value = value_node->refcount;
if (--value_node->refcount == 0)
{
list_remove_free(value_node, NULL, NULL);
}
}
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;
}
else
{
print_error("No entries for symbol %s.\n", symbol_name);
}
return 0;
}
/* 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_true(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_true(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;
}
}
/* 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 int check_for_leftover_values(const ListNode *const map_head, const char *const error_message,
const size_t number_of_symbol_names)
{
const ListNode *current;
int symbols_with_leftover_values = 0;
assert_true(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_true(value);
child_list = &value->symbol_values_list_head;
if (!list_empty(child_list))
{
if (number_of_symbol_names == 1)
{
const ListNode *child_node;
print_error(error_message, value->symbol_name);
print_error(" Remaining item(s) declared at...\n");
for (child_node = child_list->next; child_node != child_list; child_node = child_node->next)
{
const SourceLocation *const location = child_node->value;
print_error(" " SOURCE_LOCATION_FORMAT "\n", location->file, location->line);
}
}
else
{
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;
}
LargestIntegralType _cast_to_largest_integral_type(size_t size, ...)
{
LargestIntegralType ret;
va_list args;
va_start(args, size);
if (size <= sizeof(unsigned int))
{
ret = va_arg(args, unsigned int);
}
else if (size <= sizeof(unsigned long))
{
ret = va_arg(args, unsigned long);
}
else if (size <= sizeof(LargestIntegralType))
{
ret = va_arg(args, LargestIntegralType);
}
else
{
assert(size <= sizeof(LargestIntegralType));
exit(255);
}
return ret;
}
// 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
{
print_error("ERROR: " SOURCE_LOCATION_FORMAT " - Could not get value "
"to mock function %s\n", file, line, function);
print_xml(XS_RUN_TEST_ERROR
"\"ERROR: " SOURCE_LOCATION_FORMAT " - Could not get value "
"to mock function %s\"\n", "_mock", file, line, function);
if (source_location_is_set(&global_last_mock_value_location))
{
print_error("Previously returned mock value was declared at "
SOURCE_LOCATION_FORMAT "\n",
global_last_mock_value_location.file, global_last_mock_value_location.line);
print_xml(" \"Previously returned mock value was declared at "
SOURCE_LOCATION_FORMAT "\">\n"
XS_RUN_TEST_ERROR_END,
global_last_mock_value_location.file, global_last_mock_value_location.line);
}
else
{
print_error("There were no previously returned mock values for " "this test.\n");
print_xml(" \"There were no previously returned mock values for this test.\">\n"
XS_RUN_TEST_ERROR_END);
}
global_errors++;
exit_test();
}
return 0;
}
// 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 = malloc(sizeof(*return_value));
assert_true(count > 0 || count == -1);
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 : 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);
}
/* 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)
{
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)
{
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_true(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;
}
print_error(LargestIntegralTypePrintfDecimal " is %sin the set (",
value, invert ? "" : "not ");
for (i = 0; i < size_of_set; i++)
{
print_error(LargestIntegralTypePrintfDecimal ", ", set[i]);
}
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;
}
print_error(LargestIntegralTypePrintfDecimal " is not within the range "
LargestIntegralTypePrintfDecimal "-" LargestIntegralTypePrintfDecimal "\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;
}
print_error(LargestIntegralTypePrintfDecimal " is within the range "
LargestIntegralTypePrintfDecimal "-" LargestIntegralTypePrintfDecimal "\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;
}
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;
}
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)
{
int differences = 0;
size_t i;
for (i = 0; i < size; i++)
{
const char l = a[i];
const char r = b[i];
if (l != r)
{
print_error("difference at offset %d 0x%02x 0x%02x\n", i, l, r);
differences++;
}
}
if (differences)
{
print_error("%d bytes of 0x%08x and 0x%08x differ\n", differences, a, 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)
{
int 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)
{
print_error("%d bytes of 0x%08x and 0x%08x the same\n", same, a, 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 =
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_true((const unsigned long long *)values);
assert_true(number_of_values);
memcpy(set, values, number_of_values * sizeof(values[0]));
check_integer_set->set = set;
_expect_check(function, parameter, file, line, check_function, check_data.value, &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_true(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_true(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 = 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.value, &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, (char *) string);
_expect_check(function, parameter, file, line, check_string, string_pointer.value, 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, (char *) string);
_expect_check(function, parameter, file, line, check_not_string, string_pointer.value, 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_true(check);
return memory_equal_display_error(cast_largest_integral_type_to_pointer(void *, value), 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 = malloc(sizeof(*check_data) + size);
void *const mem = (void *) (check_data + 1);
declare_initialize_value_pointer_pointer(check_data_pointer, check_data);
assert_true(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.value, &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_true(check);
return memory_not_equal_display_error(cast_largest_integral_type_to_pointer(void *, value), 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(ARG_UNUSED const LargestIntegralType value, ARG_UNUSED const LargestIntegralType 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;
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)
{
print_error("ERROR: Check of parameter %s, function %s failed\n"
"Expected parameter declared at "
SOURCE_LOCATION_FORMAT "\n",
parameter_name, function_name,
global_last_parameter_location.file, global_last_parameter_location.line);
print_xml(XS_RUN_TEST_ERROR
"\"ERROR: Check of parameter %s, function %s failed\"\n"
" \"Expected parameter declared at "
SOURCE_LOCATION_FORMAT "\">\n"
XS_RUN_TEST_ERROR_END,
"check_expected", parameter_name, function_name,
global_last_parameter_location.file, global_last_parameter_location.line);
global_errors++;
_fail(file, line);
}
}
else
{
print_error("ERROR: " SOURCE_LOCATION_FORMAT " - Could not get value "
"to check parameter %s of function %s\n", file, line, parameter_name, function_name);
print_xml(XS_RUN_TEST_ERROR
"\"ERROR: " SOURCE_LOCATION_FORMAT " - Could not get value "
"to check parameter %s of function %s\"\n",
"check_expected", file, line, parameter_name, function_name);
if (source_location_is_set(&global_last_parameter_location))
{
print_error("Previously declared parameter value was declared at "
SOURCE_LOCATION_FORMAT "\n",
global_last_parameter_location.file, global_last_parameter_location.line);
print_xml(" \"Previously declared parameter value was declared at "
SOURCE_LOCATION_FORMAT "\">\n"
XS_RUN_TEST_ERROR_END,
global_last_parameter_location.file, global_last_parameter_location.line);
}
else
{
print_error("There were no previously declared parameter values " "for this test.\n");
print_xml(" \"There were no previously declared parameter values " "for this test.\">\n"
XS_RUN_TEST_ERROR_END);
}
global_errors++;
exit_test ();
}
}
// 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_expect_assert_expression = expression;
longjmp(global_expect_assert_env, 1);
}
else
{
const char *assertname = "mock_assert";
print_error("ASSERT: %s\n", expression);
print_xml (XS_RUN_TEST_FAILURE_ASSERT, assertname, result, global_filename, line, assertname, result);
_fail(file, line);
}
}
}
void _assert_true(const LargestIntegralType result,
const char *const expression, const char *const file, const int line)
{
if (!result)
{
const char *assertname = "assert_true";
print_error("%s\n", expression);
print_xml (XS_RUN_TEST_FAILURE_ASSERT, assertname, result, global_filename, line, assertname, result);
_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))
{
const char *assertname = "assert_int_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_LLD, assertname, a, b, global_filename, line, assertname, 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))
{
const char *assertname = "assert_int_not_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_LLD, assertname, a, b, global_filename, line, assertname, 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))
{
const char *assertname = "assert_string_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_STRING, assertname, a, b, global_filename, line, assertname, 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))
{
const char *assertname = "assert_string_not_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_STRING, assertname, a, b, global_filename, line, assertname, 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))
{
const char *assertname = "assert_memory_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_LLD, assertname, a, b, global_filename, line, assertname, a, b);
_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))
{
const char *assertname = "assert_memory_not_equal";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_EQUALITY_LLD, assertname, a, b, global_filename, line, assertname, a, b);
_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))
{
const char *assertname = "assert_in_range";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_RANGE_LLD, assertname, value, minimum, maximum, global_filename, line, assertname, 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))
{
const char *assertname = "assert_not_in_range";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_RANGE_LLD, assertname, value, minimum, maximum, global_filename, line, assertname, 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))
{
const char *assertname = "assert_in_set";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_SET_LLD, assertname, value, number_of_values, global_filename, line, assertname, value, number_of_values);
_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))
{
const char *assertname = "assert_not_in_set";
print_xml (XS_RUN_TEST_FAILURE_ASSERT_SET_LLD, assertname, value, number_of_values, global_filename, line, assertname, value, number_of_values);
_fail(file, line);
}
}
// Get the list of allocated blocks.
static ListNode *get_allocated_blocks_list()
{
// 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;
}
// Use the real malloc in this function.
#undef malloc
void *_test_malloc(const size_t size, const char *file, const int line)
{
char *ptr;
MallocBlockInfo *block_info;
ListNode *const block_list = get_allocated_blocks_list();
const size_t allocate_size = size + (MALLOC_GUARD_SIZE * 2) + sizeof(*block_info) + MALLOC_ALIGNMENT;
char *const block = (char *) malloc(allocate_size);
assert_true(block);
// Calculate the returned address.
ptr = (char *) (((size_t) block + MALLOC_GUARD_SIZE + sizeof(*block_info) +
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 = (MallocBlockInfo *) (ptr - (MALLOC_GUARD_SIZE + sizeof(*block_info)));
set_source_location(&block_info->location, file, line);
block_info->allocated_size = allocate_size;
block_info->size = size;
block_info->block = block;
block_info->node.value = block_info;
list_add(block_list, &block_info->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;
}
// 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 = (char *) ptr;
MallocBlockInfo *block_info;
_assert_true(ptr != NULL, "ptr", file, line);
block_info = (MallocBlockInfo *) (block - (MALLOC_GUARD_SIZE + sizeof(*block_info)));
// Check the guard blocks.
{
char *guards[2] = { block - MALLOC_GUARD_SIZE,
block + block_info->size
};
for (i = 0; i < ARRAY_LENGTH(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)
{
print_error("Guard block of 0x%08x size=%d allocated by "
SOURCE_LOCATION_FORMAT " at 0x%08x is corrupt\n",
(size_t) ptr, block_info->size,
block_info->location.file, block_info->location.line, (size_t) &guard[j]);
print_xml(XS_RUN_TEST_ERROR
"\"Guard block of 0x%08x size=%d allocated by "
SOURCE_LOCATION_FORMAT " at 0x%08x is corrupt\">\n"
XS_RUN_TEST_ERROR_END,
"test_free", (size_t) ptr, block_info->size,
block_info->location.file, block_info->location.line, (size_t) &guard[j]);
global_errors++;
_fail(file, line);
}
}
}
}
list_remove(&block_info->node, NULL, NULL);
block = block_info->block;
memset(block, MALLOC_FREE_PATTERN, block_info->allocated_size);
free(block);
}
#define free test_free
// Crudely checkpoint the current heap state.
static const ListNode *check_point_allocated_blocks()
{
return get_allocated_blocks_list()->prev;
}
/* Display the blocks allocated after the specified check point. This
* function returns the number of blocks displayed. */
static int display_allocated_blocks(const ListNode *const check_point)
{
const ListNode *const head = get_allocated_blocks_list();
const ListNode *node;
int allocated_blocks = 0;
assert_true(check_point);
assert_true(check_point->next);
for (node = check_point->next; node != head; node = node->next)
{
const MallocBlockInfo *const block_info = node->value;
assert_true(block_info);
if (!allocated_blocks)
{
print_error("Blocks allocated...\n");
}
print_error(" 0x%08x : " SOURCE_LOCATION_FORMAT "\n",
block_info->block, block_info->location.file, block_info->location.line);
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_true(check_point);
node = check_point->next;
assert_true(node);
while (node != head)
{
MallocBlockInfo *const block_info = (MallocBlockInfo *) node->value;
node = node->next;
free((char *) block_info + sizeof(*block_info) + 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 int allocated_blocks = display_allocated_blocks(check_point);
if (allocated_blocks)
{
free_allocated_blocks(check_point);
print_error("ERROR: %s leaked %d block(s)\n", test_name, allocated_blocks);
print_xml(XS_RUN_TEST_ERROR
"\"ERROR: %s leaked %d block(s)\">\n"
XS_RUN_TEST_ERROR_END, "fail_if_blocks_allocated", test_name, allocated_blocks);
global_errors++;
exit_test();
}
}
void _fail(const char *const file, const int line)
{
print_error("ERROR: " SOURCE_LOCATION_FORMAT " Failure!\n", file, line);
exit_test();
}
#ifndef _WIN32
static void exception_handler(int sig)
{
print_error("%s\n", strsignal(sig));
print_xml(XS_RUN_TEST_ERROR
"\"%s\">\n"
XS_RUN_TEST_ERROR_END, "exception_handler", strsignal(sig));
global_errors++;
exit_test();
}
#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_LENGTH(exception_codes); i++)
{
const ExceptionCodeInfo *const code_info = &exception_codes[i];
if (code == code_info->code)
{
static int shown_debug_message = 0;
fflush(stdout);
print_error("%s occurred at 0x%08x.\n", code_info->description, exception_record->ExceptionAddress);
print_xml(XS_RUN_TEST_ERROR
"\"%s occurred at 0x%08x.\">\n"
XS_RUN_TEST_ERROR_END, "exception_filter", code_info->description, exception_record->ExceptionAddress);
if (!shown_debug_message)
{
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;
}
global_errors++;
exit_test_no_app();
return EXCEPTION_EXECUTE_HANDLER;
}
}
return EXCEPTION_CONTINUE_SEARCH;
}
#endif // !_WIN32
void vinit_xml (const char *const format, va_list args)
{
FILE* xmlfile = fopen(global_xmlfile, "w");
vfprintf(xmlfile, format, args);
fclose(xmlfile);
#ifdef _WIN32
OutputDebugString(buffer);
#endif // _WIN32
}
void init_xml (const char *const format, ...)
{
if (!global_is_file_writer_test)
{
va_list args;
va_start(args, format);
vinit_xml(format, args);
va_end(args);
}
}
void vprint_xml(const char *const format, va_list args)
{
FILE* xmlfile = fopen(global_xmlfile, "a");
vfprintf(xmlfile, format, args);
fclose(xmlfile);
#ifdef _WIN32
OutputDebugString(buffer);
#endif // _WIN32
}
void print_xml(const char *const format, ...)
{
if (!global_is_file_writer_test)
{
va_list args;
va_start(args, format);
vprint_xml(format, args);
va_end(args);
}
}
void append_xml(const char *ofile, const char *ifile)
{
if (!global_is_file_writer_test)
{
char ch;
FILE* xmlfile = fopen(ofile, "ab");
FILE* xml_tmp = fopen(ifile, "rb");
while(!feof(xml_tmp))
{
ch = getc(xml_tmp);
if(!feof(xml_tmp))
{
putc(ch, xmlfile);
}
}
fclose(xmlfile);
fclose(xml_tmp);
}
}
// Standard output and error print methods.
void vprint_message(const char *const format, va_list args)
{
vprintf(format, args);
#ifdef _WIN32
OutputDebugString(buffer);
#endif // _WIN32
}
void vprint_error(const char *const format, va_list args)
{
vfprintf(stderr, format, args);
#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);
}
int _run_test(const char *const function_name, const UnitTestFunction Function,
void **const state, const UnitTestFunctionType function_type, const void *const heap_check_point)
{
const ListNode *const check_point = heap_check_point ? heap_check_point : check_point_allocated_blocks();
void *current_state = NULL;
int rc = 1;
int handle_exceptions = 1;
#ifdef _WIN32
handle_exceptions = !IsDebuggerPresent();
#endif // _WIN32
#if UNIT_TESTING_DEBUG
handle_exceptions = 0;
#endif // UNIT_TESTING_DEBUG
if (handle_exceptions)
{
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_LENGTH(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 || function_type == UNIT_TEST_FUNCTION_TYPE_TEST_WITH_STATE)
{
print_message("%s: Starting test\n", function_name);
}
initialize_testing();
global_running_test = 1;
if (setjmp(global_run_test_env) == 0)
{
if (function_type == UNIT_TEST_FUNCTION_TYPE_TEST)
{
Function();
}
else
{
((UnitTestFunctionWithState)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 || function_type == UNIT_TEST_FUNCTION_TYPE_TEST_WITH_STATE)
{
print_message("%s: Test completed successfully.\n", function_name);
}
rc = 0;
}
else
{
global_running_test = 0;
print_message("%s: Test failed.\n", function_name);
}
teardown_testing();
if (handle_exceptions)
{
#ifndef _WIN32
unsigned int i;
for (i = 0; i < ARRAY_LENGTH(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, const char *const file)
{
// Whether to execute the next test.
int run_next_test = 1;
// Whether the previous test failed.
int previous_test_failed = 0;
// Check point of the heap state.
const ListNode *const check_point = check_point_allocated_blocks();
// Time of testsuite execution
time_t time_suite, time_case, time_now;
time_t ttime;
time(&ttime);
char timestamp[1024];
strcpy(timestamp, ctime(&ttime));
timestamp[strlen(timestamp)-1] = '\0';
// 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;
/* 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 = malloc(number_of_tests * sizeof(*test_states));
size_t number_of_test_states = 0;
// Names of the tests that failed.
const char **failed_names = malloc(number_of_tests * sizeof(*failed_names));
void **current_state = NULL;
// Make sure LargestIntegralType is at least the size of a pointer.
assert_true(sizeof(LargestIntegralType) >= sizeof(void *));
//Initialize an xml file and parameters
char path[1024] = {0};
char filename[1024] = {0};
char suitename[1024] = {0};
char casename[1024] = {0};
char xmlfile[sizeof(suitename) + sizeof(".xml")] = {0};
int len;
strcpy(path, file);
strcpy(filename, basename(path));
len = strrchr(filename, '.')-filename;
strcpy(suitename, "");
strncat(suitename, filename, len);
strcpy(xmlfile, "xml_tmp_suite");
global_filename = filename;
global_is_file_writer_test = (0 == strcmp(suitename, "file_writer_test"));
global_xmlfile = xmlfile;
global_errors = 0;
init_xml("");
time(&time_suite);
while (current_test < number_of_tests)
{
const ListNode *test_check_point = NULL;
TestState *current_TestState;
const UnitTest *const test = &tests[current_test++];
if (!test->f.function)
{
continue;
}
switch (test->function_type)
{
case UNIT_TEST_FUNCTION_TYPE_TEST:
case UNIT_TEST_FUNCTION_TYPE_TEST_WITH_STATE:
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;
setups++;
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;
teardowns++;
break;
default:
print_error("Invalid unit test function type %d\n", test->function_type);
print_xml(XS_RUN_TEST_ERROR
"\"Invalid unit test function type %d\">\n"
XS_RUN_TEST_ERROR_END,
"", test->function_type);
global_errors++;
exit_test();
break;
}
if (run_next_test)
{
strcpy(casename, test->name);
strcpy(xmlfile, "xml_tmp_case");
init_xml("");
time(&time_case);
int failed = _run_test(test->name, test->f.function, current_state,
test->function_type, test_check_point);
strcpy(xmlfile, "xml_tmp_suite");
time(&time_now);
print_xml(XS_TESTCASE, casename, path, difftime(time_now, time_case));
if (failed)
{
failed_names[total_failed] = test->name;
append_xml("xml_tmp_suite", "xml_tmp_case");
}
print_xml(XS_TESTCASE_END);
switch (test->function_type)
{
case UNIT_TEST_FUNCTION_TYPE_TEST:
case UNIT_TEST_FUNCTION_TYPE_TEST_WITH_STATE:
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_test_failed = 0;
break;
case UNIT_TEST_FUNCTION_TYPE_TEARDOWN:
// If this test failed.
if (failed && !previous_test_failed)
{
total_failed++;
}
break;
default:
assert_false("BUG: shouldn't be here!");
break;
}
}
}
snprintf(xmlfile, sizeof(xmlfile), "%s.xml", suitename);
time(&time_now);
init_xml(XS_INIT_TESTSUITE, suitename, timestamp, "localhost", number_of_tests, total_failed, global_errors, difftime(time_now, time_suite));
append_xml(xmlfile, "xml_tmp_suite");
print_xml(XS_TESTSUITE_END);
if (total_failed)
{
size_t i;
print_error("%d out of %d tests failed!\n", total_failed, tests_executed);
for (i = 0; i < total_failed; i++)
{
print_error(" %s\n", failed_names[i]);
}
}
else
{
print_message("All %d tests passed\n", tests_executed);
}
if (number_of_test_states)
{
print_error("Mismatched number of setup %d and teardown %d " "functions\n", setups, teardowns);
total_failed = -1;
}
free(test_states);
free((void *) failed_names);
fail_if_blocks_allocated(check_point, "run_tests");
return (int) total_failed;
}
/* LCOV_EXCL_STOP */
|