check_memory.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213
  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, 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, 3, (void **)&a2, &UA_TYPES[UA_TYPES_STRING]);
  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, 3, &UA_TYPES[UA_TYPES_STRING]);
  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_StatusCode retval = UA_ByteString_allocBuffer(&msg1, 65000); // fixed buf size
  51. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  52. printf("%i\n", _i);
  53. fflush(stdout);
  54. retval = UA_encodeBinary(obj1, &UA_TYPES[_i], &msg1, &pos);
  55. msg1.length = pos;
  56. if(retval != UA_STATUSCODE_GOOD) {
  57. UA_delete(obj1, &UA_TYPES[_i]);
  58. UA_ByteString_deleteMembers(&msg1);
  59. return;
  60. }
  61. // when
  62. void *obj2 = UA_new(&UA_TYPES[_i]);
  63. pos = 0; retval = UA_decodeBinary(&msg1, &pos, obj2, &UA_TYPES[_i]);
  64. ck_assert_msg(retval == UA_STATUSCODE_GOOD, "could not decode idx=%d,nodeid=%i", _i, UA_TYPES[_i].typeId.identifier.numeric);
  65. ck_assert(!memcmp(obj1, obj2, UA_TYPES[_i].memSize)); // bit identical decoding
  66. assert(!memcmp(obj1, obj2, UA_TYPES[_i].memSize));
  67. retval = UA_ByteString_allocBuffer(&msg2, 65000);
  68. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  69. pos = 0; retval = UA_encodeBinary(obj2, &UA_TYPES[_i], &msg2, &pos);
  70. msg2.length = pos;
  71. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  72. // then
  73. ck_assert_msg(UA_ByteString_equal(&msg1, &msg2) == UA_TRUE, "messages differ idx=%d,nodeid=%i", _i,
  74. UA_TYPES[_i].typeId.identifier.numeric);
  75. // finally
  76. UA_delete(obj1, &UA_TYPES[_i]);
  77. UA_delete(obj2, &UA_TYPES[_i]);
  78. UA_ByteString_deleteMembers(&msg1);
  79. UA_ByteString_deleteMembers(&msg2);
  80. }
  81. END_TEST
  82. START_TEST(decodeShallFailWithTruncatedBufferButSurvive) {
  83. // given
  84. UA_ByteString msg1;
  85. void *obj1 = UA_new(&UA_TYPES[_i]);
  86. size_t pos = 0;
  87. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg1, 65000); // fixed buf size
  88. retval |= UA_encodeBinary(obj1, &UA_TYPES[_i], &msg1, &pos);
  89. UA_delete(obj1, &UA_TYPES[_i]);
  90. if(retval != UA_STATUSCODE_GOOD) {
  91. UA_ByteString_deleteMembers(&msg1);
  92. return; // e.g. variants cannot be encoded after an init without failing (no datatype set)
  93. }
  94. // when
  95. void *obj2 = UA_new(&UA_TYPES[_i]);
  96. pos = 0;
  97. msg1.length = pos / 2;
  98. //fprintf(stderr,"testing %s with half buffer\n",UA_TYPES[_i].name);
  99. retval = UA_decodeBinary(&msg1, &pos, obj2, &UA_TYPES[_i]);
  100. ck_assert_int_ne(retval, UA_STATUSCODE_GOOD);
  101. //then
  102. // finally
  103. //fprintf(stderr,"delete %s with half buffer\n",UA_TYPES[_i].name);
  104. UA_delete(obj2, &UA_TYPES[_i]);
  105. UA_ByteString_deleteMembers(&msg1);
  106. }
  107. END_TEST
  108. #define RANDOM_TESTS 1000
  109. START_TEST(decodeScalarBasicTypeFromRandomBufferShallSucceed) {
  110. // given
  111. void *obj1 = NULL;
  112. UA_ByteString msg1;
  113. UA_Int32 retval = UA_STATUSCODE_GOOD;
  114. UA_Int32 buflen = 256;
  115. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  116. #ifdef _WIN32
  117. srand(42);
  118. #else
  119. srandom(42);
  120. #endif
  121. for(int n = 0;n < RANDOM_TESTS;n++) {
  122. for(UA_Int32 i = 0;i < buflen;i++) {
  123. #ifdef _WIN32
  124. UA_UInt32 rnd;
  125. rnd = rand();
  126. msg1.data[i] = rnd;
  127. #else
  128. msg1.data[i] = (UA_Byte)random(); // when
  129. #endif
  130. }
  131. size_t pos = 0;
  132. obj1 = UA_new(&UA_TYPES[_i]);
  133. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i]);
  134. //then
  135. ck_assert_msg(retval == UA_STATUSCODE_GOOD, "Decoding %d from random buffer", UA_TYPES[_i].typeId.identifier.numeric);
  136. // finally
  137. UA_delete(obj1, &UA_TYPES[_i]);
  138. }
  139. UA_ByteString_deleteMembers(&msg1);
  140. }
  141. END_TEST
  142. START_TEST(decodeComplexTypeFromRandomBufferShallSurvive) {
  143. // given
  144. UA_ByteString msg1;
  145. UA_Int32 retval = UA_STATUSCODE_GOOD;
  146. UA_Int32 buflen = 256;
  147. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  148. #ifdef _WIN32
  149. srand(42);
  150. #else
  151. srandom(42);
  152. #endif
  153. // when
  154. for(int n = 0;n < RANDOM_TESTS;n++) {
  155. for(UA_Int32 i = 0;i < buflen;i++) {
  156. #ifdef _WIN32
  157. UA_UInt32 rnd;
  158. rnd = rand();
  159. msg1.data[i] = rnd;
  160. #else
  161. msg1.data[i] = (UA_Byte)random(); // when
  162. #endif
  163. }
  164. size_t pos = 0;
  165. void *obj1 = UA_new(&UA_TYPES[_i]);
  166. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i]);
  167. UA_delete(obj1, &UA_TYPES[_i]);
  168. }
  169. // finally
  170. UA_ByteString_deleteMembers(&msg1);
  171. }
  172. END_TEST
  173. int main(void) {
  174. int number_failed = 0;
  175. SRunner *sr;
  176. Suite *s = suite_create("testMemoryHandling");
  177. TCase *tc = tcase_create("Empty Objects");
  178. tcase_add_loop_test(tc, newAndEmptyObjectShallBeDeleted, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  179. tcase_add_test(tc, arrayCopyShallMakeADeepCopy);
  180. tcase_add_loop_test(tc, encodeShallYieldDecode, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  181. suite_add_tcase(s, tc);
  182. tc = tcase_create("Truncated Buffers");
  183. tcase_add_loop_test(tc, decodeShallFailWithTruncatedBufferButSurvive, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  184. suite_add_tcase(s, tc);
  185. tc = tcase_create("Fuzzing with Random Buffers");
  186. tcase_add_loop_test(tc, decodeScalarBasicTypeFromRandomBufferShallSucceed, UA_TYPES_BOOLEAN, UA_TYPES_DOUBLE);
  187. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive, UA_TYPES_NODEID, UA_TYPES_COUNT - 1);
  188. suite_add_tcase(s, tc);
  189. sr = srunner_create(s);
  190. srunner_set_fork_status(sr, CK_NOFORK);
  191. srunner_run_all (sr, CK_NORMAL);
  192. number_failed += srunner_ntests_failed(sr);
  193. srunner_free(sr);
  194. return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
  195. }