check_memory.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208
  1. #define _XOPEN_SOURCE 500
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4. #include "ua_types.h"
  5. #include "ua_types_generated.h"
  6. #include "ua_types_encoding_binary.h"
  7. #include "ua_util.h"
  8. #include "check.h"
  9. START_TEST(newAndEmptyObjectShallBeDeleted) {
  10. // given
  11. void *obj = UA_new(&UA_TYPES[_i]);
  12. // then
  13. ck_assert_ptr_ne(obj, UA_NULL);
  14. // finally
  15. UA_delete(obj, &UA_TYPES[_i]);
  16. }
  17. END_TEST
  18. START_TEST(arrayCopyShallMakeADeepCopy) {
  19. // given
  20. UA_String a1[3];
  21. a1[0] = (UA_String){1, (UA_Byte*)"a"};
  22. a1[1] = (UA_String){2, (UA_Byte*)"bb"};
  23. a1[2] = (UA_String){3, (UA_Byte*)"ccc"};
  24. // when
  25. UA_String *a2;
  26. UA_Int32 retval = UA_Array_copy((const void *)a1, (void **)&a2, &UA_TYPES[UA_TYPES_STRING], 3);
  27. // then
  28. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  29. ck_assert_int_eq(a1[0].length, 1);
  30. ck_assert_int_eq(a1[1].length, 2);
  31. ck_assert_int_eq(a1[2].length, 3);
  32. ck_assert_int_eq(a1[0].length, a2[0].length);
  33. ck_assert_int_eq(a1[1].length, a2[1].length);
  34. ck_assert_int_eq(a1[2].length, a2[2].length);
  35. ck_assert_ptr_ne(a1[0].data, a2[0].data);
  36. ck_assert_ptr_ne(a1[1].data, a2[1].data);
  37. ck_assert_ptr_ne(a1[2].data, a2[2].data);
  38. ck_assert_int_eq(a1[0].data[0], a2[0].data[0]);
  39. ck_assert_int_eq(a1[1].data[0], a2[1].data[0]);
  40. ck_assert_int_eq(a1[2].data[0], a2[2].data[0]);
  41. // finally
  42. UA_Array_delete((void *)a2, &UA_TYPES[UA_TYPES_STRING], 3);
  43. }
  44. END_TEST
  45. START_TEST(encodeShallYieldDecode) {
  46. // given
  47. UA_ByteString msg1, msg2;
  48. size_t pos = 0;
  49. void *obj1 = UA_new(&UA_TYPES[_i]);
  50. UA_ByteString_newMembers(&msg1, 65000); // fixed buf size
  51. UA_StatusCode retval = UA_encodeBinary(obj1, &UA_TYPES[_i], &msg1, &pos);
  52. msg1.length = pos;
  53. if(retval != UA_STATUSCODE_GOOD) {
  54. UA_delete(obj1, &UA_TYPES[_i]);
  55. UA_ByteString_deleteMembers(&msg1);
  56. return;
  57. }
  58. // when
  59. void *obj2 = UA_new(&UA_TYPES[_i]);
  60. pos = 0; retval = UA_decodeBinary(&msg1, &pos, obj2, &UA_TYPES[_i]);
  61. ck_assert_msg(retval == UA_STATUSCODE_GOOD, "messages differ idx=%d,nodeid=%i", _i, UA_TYPES[_i].typeId.identifier.numeric);
  62. retval = UA_ByteString_newMembers(&msg2, 65000);
  63. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  64. pos = 0; retval = UA_encodeBinary(obj2, &UA_TYPES[_i], &msg2, &pos);
  65. msg2.length = pos;
  66. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  67. // then
  68. ck_assert_msg(UA_ByteString_equal(&msg1, &msg2) == UA_TRUE, "messages differ idx=%d,nodeid=%i", _i,
  69. UA_TYPES[_i].typeId.identifier.numeric);
  70. // finally
  71. UA_delete(obj1, &UA_TYPES[_i]);
  72. UA_delete(obj2, &UA_TYPES[_i]);
  73. UA_ByteString_deleteMembers(&msg1);
  74. UA_ByteString_deleteMembers(&msg2);
  75. }
  76. END_TEST
  77. START_TEST(decodeShallFailWithTruncatedBufferButSurvive) {
  78. // given
  79. UA_ByteString msg1;
  80. void *obj1 = UA_new(&UA_TYPES[_i]);
  81. size_t pos = 0;
  82. UA_ByteString_newMembers(&msg1, 65000); // fixed buf size
  83. UA_StatusCode retval = UA_encodeBinary(obj1, &UA_TYPES[_i], &msg1, &pos);
  84. UA_delete(obj1, &UA_TYPES[_i]);
  85. if(retval != UA_STATUSCODE_GOOD) {
  86. UA_ByteString_deleteMembers(&msg1);
  87. return; // e.g. variants cannot be encoded after an init without failing (no datatype set)
  88. }
  89. // when
  90. void *obj2 = UA_new(&UA_TYPES[_i]);
  91. pos = 0;
  92. msg1.length = pos / 2;
  93. //fprintf(stderr,"testing %s with half buffer\n",UA_TYPES[_i].name);
  94. retval = UA_decodeBinary(&msg1, &pos, obj2, &UA_TYPES[_i]);
  95. ck_assert_int_ne(retval, UA_STATUSCODE_GOOD);
  96. //then
  97. // finally
  98. //fprintf(stderr,"delete %s with half buffer\n",UA_TYPES[_i].name);
  99. UA_delete(obj2, &UA_TYPES[_i]);
  100. UA_ByteString_deleteMembers(&msg1);
  101. }
  102. END_TEST
  103. #define RANDOM_TESTS 1000
  104. START_TEST(decodeScalarBasicTypeFromRandomBufferShallSucceed) {
  105. // given
  106. void *obj1 = UA_NULL;
  107. UA_ByteString msg1;
  108. UA_Int32 retval = UA_STATUSCODE_GOOD;
  109. UA_Int32 buflen = 256;
  110. UA_ByteString_newMembers(&msg1, buflen); // fixed size
  111. #ifdef _WIN32
  112. srand(42);
  113. #else
  114. srandom(42);
  115. #endif
  116. for(int n = 0;n < RANDOM_TESTS;n++) {
  117. for(UA_Int32 i = 0;i < buflen;i++) {
  118. #ifdef _WIN32
  119. UA_UInt32 rnd;
  120. rnd = rand();
  121. msg1.data[i] = rnd;
  122. #else
  123. msg1.data[i] = (UA_Byte)random(); // when
  124. #endif
  125. }
  126. size_t pos = 0;
  127. obj1 = UA_new(&UA_TYPES[_i]);
  128. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i]);
  129. //then
  130. ck_assert_msg(retval == UA_STATUSCODE_GOOD, "Decoding %d from random buffer", UA_TYPES[_i].typeId.identifier.numeric);
  131. // finally
  132. UA_delete(obj1, &UA_TYPES[_i]);
  133. }
  134. UA_ByteString_deleteMembers(&msg1);
  135. }
  136. END_TEST
  137. START_TEST(decodeComplexTypeFromRandomBufferShallSurvive) {
  138. // given
  139. UA_ByteString msg1;
  140. UA_Int32 retval = UA_STATUSCODE_GOOD;
  141. UA_Int32 buflen = 256;
  142. UA_ByteString_newMembers(&msg1, buflen); // fixed size
  143. #ifdef _WIN32
  144. srand(42);
  145. #else
  146. srandom(42);
  147. #endif
  148. // when
  149. for(int n = 0;n < RANDOM_TESTS;n++) {
  150. for(UA_Int32 i = 0;i < buflen;i++) {
  151. #ifdef _WIN32
  152. UA_UInt32 rnd;
  153. rnd = rand();
  154. msg1.data[i] = rnd;
  155. #else
  156. msg1.data[i] = (UA_Byte)random(); // when
  157. #endif
  158. }
  159. size_t pos = 0;
  160. void *obj1 = UA_new(&UA_TYPES[_i]);
  161. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i]);
  162. UA_delete(obj1, &UA_TYPES[_i]);
  163. }
  164. // finally
  165. UA_ByteString_deleteMembers(&msg1);
  166. }
  167. END_TEST
  168. int main(void) {
  169. int number_failed = 0;
  170. SRunner *sr;
  171. Suite *s = suite_create("testMemoryHandling");
  172. TCase *tc = tcase_create("Empty Objects");
  173. tcase_add_loop_test(tc, newAndEmptyObjectShallBeDeleted, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  174. tcase_add_test(tc, arrayCopyShallMakeADeepCopy);
  175. tcase_add_loop_test(tc, encodeShallYieldDecode, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  176. suite_add_tcase(s, tc);
  177. tc = tcase_create("Truncated Buffers");
  178. tcase_add_loop_test(tc, decodeShallFailWithTruncatedBufferButSurvive, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  179. suite_add_tcase(s, tc);
  180. tc = tcase_create("Fuzzing with Random Buffers");
  181. tcase_add_loop_test(tc, decodeScalarBasicTypeFromRandomBufferShallSucceed, UA_TYPES_BOOLEAN, UA_TYPES_DOUBLE);
  182. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive, UA_TYPES_NODEID, UA_TYPES_COUNT - 1);
  183. suite_add_tcase(s, tc);
  184. sr = srunner_create(s);
  185. srunner_set_fork_status(sr, CK_NOFORK);
  186. srunner_run_all (sr, CK_NORMAL);
  187. number_failed += srunner_ntests_failed(sr);
  188. srunner_free(sr);
  189. return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
  190. }