check_memory.c 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. #define _XOPEN_SOURCE 500
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4. #include "ua_types.h"
  5. #include "util/ua_util.h"
  6. #include "ua_namespace_0.h"
  7. #include "check.h"
  8. START_TEST(newAndEmptyObjectShallBeDeleted) {
  9. // given
  10. UA_Int32 retval;
  11. void *obj;
  12. // when
  13. retval = UA_.types[_i].new(&obj);
  14. retval |= UA_.types[_i].delete(obj);
  15. // then
  16. ck_assert_int_eq(retval, UA_SUCCESS);
  17. }
  18. END_TEST
  19. START_TEST(arrayCopyShallMakeADeepCopy) {
  20. // given
  21. UA_String a1[3];
  22. a1[0] = (UA_String){1, (UA_Byte*)"a"};
  23. a1[1] = (UA_String){2, (UA_Byte*)"bb"};
  24. a1[2] = (UA_String){3, (UA_Byte*)"ccc"};
  25. // when
  26. UA_String *a2;
  27. UA_Int32 retval = UA_Array_copy((const void *)a1, 3, UA_STRING, (void **)&a2);
  28. // then
  29. ck_assert_int_eq(retval, UA_SUCCESS);
  30. ck_assert_int_eq(a1[0].length, 1);
  31. ck_assert_int_eq(a1[1].length, 2);
  32. ck_assert_int_eq(a1[2].length, 3);
  33. ck_assert_int_eq(a1[0].length, a2[0].length);
  34. ck_assert_int_eq(a1[1].length, a2[1].length);
  35. ck_assert_int_eq(a1[2].length, a2[2].length);
  36. ck_assert_ptr_ne(a1[0].data, a2[0].data);
  37. ck_assert_ptr_ne(a1[1].data, a2[1].data);
  38. ck_assert_ptr_ne(a1[2].data, a2[2].data);
  39. ck_assert_int_eq(a1[0].data[0], a2[0].data[0]);
  40. ck_assert_int_eq(a1[1].data[0], a2[1].data[0]);
  41. ck_assert_int_eq(a1[2].data[0], a2[2].data[0]);
  42. // finally
  43. UA_Array_delete((void *)a2, 3, UA_STRING);
  44. }
  45. END_TEST
  46. START_TEST(encodeShallYieldDecode) {
  47. // given
  48. void *obj1 = UA_NULL, *obj2 = UA_NULL;
  49. UA_ByteString msg1, msg2;
  50. UA_Int32 retval;
  51. UA_UInt32 pos = 0;
  52. retval = UA_.types[_i].new(&obj1);
  53. UA_ByteString_newMembers(&msg1, UA_.types[_i].encodings[0].calcSize(obj1));
  54. retval = UA_.types[_i].encodings[0].encode(obj1, &msg1, &pos);
  55. // when
  56. UA_.types[_i].new(&obj2);
  57. pos = 0; retval = UA_.types[_i].encodings[0].decode(&msg1, &pos, obj2);
  58. UA_ByteString_newMembers(&msg2, UA_.types[_i].encodings[0].calcSize(obj2));
  59. pos = 0; retval = UA_.types[_i].encodings[0].encode(obj2, &msg2, &pos);
  60. // then
  61. ck_assert_msg(UA_ByteString_equal(&msg1, &msg2) == 0, "messages differ idx=%d,name=%s", _i, UA_.types[_i].name);
  62. ck_assert_int_eq(retval, UA_SUCCESS);
  63. // finally
  64. UA_.types[_i].delete(obj1);
  65. UA_.types[_i].delete(obj2);
  66. UA_ByteString_deleteMembers(&msg1);
  67. UA_ByteString_deleteMembers(&msg2);
  68. }
  69. END_TEST
  70. START_TEST(decodeShallFailWithTruncatedBufferButSurvive) {
  71. // given
  72. void *obj1 = UA_NULL, *obj2 = UA_NULL;
  73. UA_ByteString msg1;
  74. UA_UInt32 pos;
  75. UA_.types[_i].new(&obj1);
  76. UA_ByteString_newMembers(&msg1, UA_.types[_i].encodings[0].calcSize(obj1));
  77. pos = 0; UA_.types[_i].encodings[0].encode(obj1, &msg1, &pos);
  78. UA_.types[_i].delete(obj1);
  79. // when
  80. UA_.types[_i].new(&obj2);
  81. pos = 0;
  82. msg1.length = msg1.length / 2;
  83. //fprintf(stderr,"testing %s with half buffer\n",UA_[_i].name);
  84. UA_.types[_i].encodings[0].decode(&msg1, &pos, obj2);
  85. //then
  86. // finally
  87. //fprintf(stderr,"delete %s with half buffer\n",UA_[_i].name);
  88. UA_.types[_i].delete(obj2);
  89. UA_ByteString_deleteMembers(&msg1);
  90. }
  91. END_TEST
  92. START_TEST(decodeScalarBasicTypeFromRandomBufferShallSucceed) {
  93. // given
  94. void *obj1 = UA_NULL;
  95. UA_ByteString msg1;
  96. UA_Int32 retval, buflen;
  97. buflen = 256;
  98. UA_ByteString_newMembers(&msg1, buflen); // fixed size
  99. srandom(42);
  100. retval = UA_SUCCESS;
  101. for(int n = 0;n < 100;n++) {
  102. retval |= UA_.types[_i].new(&obj1);
  103. UA_Int32 i; for(i = 0;i < buflen;i++) msg1.data[i] = (UA_Byte)random(); // when
  104. UA_UInt32 pos = 0;
  105. retval |= UA_.types[_i].encodings[0].decode(&msg1, &pos, obj1);
  106. //then
  107. ck_assert_msg(retval == UA_SUCCESS, "Decoding %s from random buffer", UA_.types[_i].name);
  108. // finally
  109. UA_.types[_i].delete(obj1);
  110. }
  111. UA_ByteString_deleteMembers(&msg1);
  112. }
  113. END_TEST
  114. START_TEST(decodeComplexTypeFromRandomBufferShallSurvive) {
  115. // given
  116. void *obj1 = UA_NULL;
  117. UA_ByteString msg1;
  118. UA_Int32 retval, buflen;
  119. buflen = 256;
  120. UA_ByteString_newMembers(&msg1, buflen); // fixed size
  121. srandom(42);
  122. retval = UA_SUCCESS;
  123. for(int n = 0;n < 100;n++) {
  124. retval |= UA_.types[_i].new(&obj1);
  125. UA_Int32 i; for(i = 0;i < buflen;i++) msg1.data[i] = (UA_Byte)random(); // when
  126. UA_UInt32 pos = 0;
  127. retval |= UA_.types[_i].encodings[0].decode(&msg1, &pos, obj1);
  128. //then
  129. ck_assert_msg(retval == UA_SUCCESS || retval != UA_SUCCESS, "Decoding %s from random buffer", UA_.types[_i].name);
  130. // finally
  131. UA_.types[_i].delete(obj1);
  132. }
  133. UA_ByteString_deleteMembers(&msg1);
  134. }
  135. END_TEST
  136. int main() {
  137. int number_failed = 0;
  138. SRunner *sr;
  139. Suite *s = suite_create("testMemoryHandling");
  140. TCase *tc = tcase_create("Empty Objects");
  141. tcase_add_loop_test(tc, newAndEmptyObjectShallBeDeleted, UA_BOOLEAN, UA_INVALIDTYPE-1);
  142. tcase_add_test(tc, arrayCopyShallMakeADeepCopy);
  143. tcase_add_loop_test(tc, encodeShallYieldDecode, UA_BOOLEAN, UA_INVALIDTYPE-1);
  144. suite_add_tcase(s, tc);
  145. tc = tcase_create("Truncated Buffers");
  146. tcase_add_loop_test(tc, decodeShallFailWithTruncatedBufferButSurvive, UA_BOOLEAN, UA_INVALIDTYPE-1);
  147. suite_add_tcase(s, tc);
  148. tc = tcase_create("Fuzzing with Random Buffers");
  149. tcase_add_loop_test(tc, decodeScalarBasicTypeFromRandomBufferShallSucceed, UA_BOOLEAN, UA_DOUBLE);
  150. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive, UA_STRING, UA_DIAGNOSTICINFO);
  151. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive, UA_IDTYPE, UA_INVALIDTYPE);
  152. suite_add_tcase(s, tc);
  153. sr = srunner_create(s);
  154. //for debugging puposes only, will break make check
  155. srunner_set_fork_status(sr, CK_NOFORK);
  156. srunner_run_all (sr, CK_NORMAL);
  157. number_failed += srunner_ntests_failed(sr);
  158. srunner_free(sr);
  159. return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
  160. }