check_memory.c 5.5 KB

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