check_types_memory.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360
  1. /* This Source Code Form is subject to the terms of the Mozilla Public
  2. * License, v. 2.0. If a copy of the MPL was not distributed with this
  3. * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
  4. #define _XOPEN_SOURCE 500
  5. #include <open62541/server.h>
  6. #include <open62541/types_generated.h>
  7. #include <open62541/types_generated_handling.h>
  8. #include <open62541/util.h>
  9. #include "ua_types_encoding_binary.h"
  10. #include <stdio.h>
  11. #include <stdlib.h>
  12. #include "check.h"
  13. /* Define types to a dummy value if they are not available (e.g. not built with
  14. * NS0 full) */
  15. #ifndef UA_TYPES_UNION
  16. #define UA_TYPES_UNION UA_TYPES_COUNT
  17. #endif
  18. #ifndef UA_TYPES_HISTORYREADDETAILS
  19. #define UA_TYPES_HISTORYREADDETAILS UA_TYPES_COUNT
  20. #endif
  21. #ifndef UA_TYPES_NOTIFICATIONDATA
  22. #define UA_TYPES_NOTIFICATIONDATA UA_TYPES_COUNT
  23. #endif
  24. #ifndef UA_TYPES_MONITORINGFILTER
  25. #define UA_TYPES_MONITORINGFILTER UA_TYPES_COUNT
  26. #endif
  27. #ifndef UA_TYPES_MONITORINGFILTERRESULT
  28. #define UA_TYPES_MONITORINGFILTERRESULT UA_TYPES_COUNT
  29. #endif
  30. #ifndef UA_TYPES_DATASETREADERMESSAGEDATATYPE
  31. #define UA_TYPES_DATASETREADERMESSAGEDATATYPE UA_TYPES_COUNT
  32. #endif
  33. #ifndef UA_TYPES_WRITERGROUPTRANSPORTDATATYPE
  34. #define UA_TYPES_WRITERGROUPTRANSPORTDATATYPE UA_TYPES_COUNT
  35. #endif
  36. #ifndef UA_TYPES_CONNECTIONTRANSPORTDATATYPE
  37. #define UA_TYPES_CONNECTIONTRANSPORTDATATYPE UA_TYPES_COUNT
  38. #endif
  39. #ifndef UA_TYPES_WRITERGROUPMESSAGEDATATYPE
  40. #define UA_TYPES_WRITERGROUPMESSAGEDATATYPE UA_TYPES_COUNT
  41. #endif
  42. #ifndef UA_TYPES_READERGROUPTRANSPORTDATATYPE
  43. #define UA_TYPES_READERGROUPTRANSPORTDATATYPE UA_TYPES_COUNT
  44. #endif
  45. #ifndef UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE
  46. #define UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE UA_TYPES_COUNT
  47. #endif
  48. #ifndef UA_TYPES_DATASETREADERTRANSPORTDATATYPE
  49. #define UA_TYPES_DATASETREADERTRANSPORTDATATYPE UA_TYPES_COUNT
  50. #endif
  51. #ifndef UA_TYPES_DATASETWRITERTRANSPORTDATATYPE
  52. #define UA_TYPES_DATASETWRITERTRANSPORTDATATYPE UA_TYPES_COUNT
  53. #endif
  54. #ifndef UA_TYPES_SUBSCRIBEDDATASETDATATYPE
  55. #define UA_TYPES_SUBSCRIBEDDATASETDATATYPE UA_TYPES_COUNT
  56. #endif
  57. #ifndef UA_TYPES_READERGROUPMESSAGEDATATYPE
  58. #define UA_TYPES_READERGROUPMESSAGEDATATYPE UA_TYPES_COUNT
  59. #endif
  60. #ifndef UA_TYPES_DATASETWRITERMESSAGEDATATYPE
  61. #define UA_TYPES_DATASETWRITERMESSAGEDATATYPE UA_TYPES_COUNT
  62. #endif
  63. START_TEST(newAndEmptyObjectShallBeDeleted) {
  64. // given
  65. void *obj = UA_new(&UA_TYPES[_i]);
  66. // then
  67. ck_assert_ptr_ne(obj, NULL);
  68. // finally
  69. UA_delete(obj, &UA_TYPES[_i]);
  70. }
  71. END_TEST
  72. START_TEST(arrayCopyShallMakeADeepCopy) {
  73. // given
  74. UA_String a1[3];
  75. a1[0] = (UA_String){1, (UA_Byte*)"a"};
  76. a1[1] = (UA_String){2, (UA_Byte*)"bb"};
  77. a1[2] = (UA_String){3, (UA_Byte*)"ccc"};
  78. // when
  79. UA_String *a2;
  80. UA_Int32 retval = UA_Array_copy((const void *)a1, 3, (void **)&a2, &UA_TYPES[UA_TYPES_STRING]);
  81. // then
  82. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  83. ck_assert_int_eq(a1[0].length, 1);
  84. ck_assert_int_eq(a1[1].length, 2);
  85. ck_assert_int_eq(a1[2].length, 3);
  86. ck_assert_int_eq(a1[0].length, a2[0].length);
  87. ck_assert_int_eq(a1[1].length, a2[1].length);
  88. ck_assert_int_eq(a1[2].length, a2[2].length);
  89. ck_assert_ptr_ne(a1[0].data, a2[0].data);
  90. ck_assert_ptr_ne(a1[1].data, a2[1].data);
  91. ck_assert_ptr_ne(a1[2].data, a2[2].data);
  92. ck_assert_int_eq(a1[0].data[0], a2[0].data[0]);
  93. ck_assert_int_eq(a1[1].data[0], a2[1].data[0]);
  94. ck_assert_int_eq(a1[2].data[0], a2[2].data[0]);
  95. // finally
  96. UA_Array_delete((void *)a2, 3, &UA_TYPES[UA_TYPES_STRING]);
  97. }
  98. END_TEST
  99. START_TEST(encodeShallYieldDecode) {
  100. /* floating point types may change the representaton due to several possible NaN values. */
  101. if(_i != UA_TYPES_FLOAT || _i != UA_TYPES_DOUBLE ||
  102. _i != UA_TYPES_CREATESESSIONREQUEST || _i != UA_TYPES_CREATESESSIONRESPONSE ||
  103. _i != UA_TYPES_VARIABLEATTRIBUTES || _i != UA_TYPES_READREQUEST ||
  104. _i != UA_TYPES_MONITORINGPARAMETERS || _i != UA_TYPES_MONITOREDITEMCREATERESULT ||
  105. _i != UA_TYPES_CREATESUBSCRIPTIONREQUEST || _i != UA_TYPES_CREATESUBSCRIPTIONRESPONSE)
  106. return;
  107. // given
  108. UA_ByteString msg1, msg2;
  109. void *obj1 = UA_new(&UA_TYPES[_i]);
  110. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg1, 65000); // fixed buf size
  111. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  112. UA_Byte *pos = msg1.data;
  113. const UA_Byte *end = &msg1.data[msg1.length];
  114. retval = UA_encodeBinary(obj1, &UA_TYPES[_i],
  115. &pos, &end, NULL, NULL);
  116. if(retval != UA_STATUSCODE_GOOD) {
  117. UA_delete(obj1, &UA_TYPES[_i]);
  118. UA_ByteString_deleteMembers(&msg1);
  119. return;
  120. }
  121. // when
  122. void *obj2 = UA_new(&UA_TYPES[_i]);
  123. size_t offset = 0;
  124. retval = UA_decodeBinary(&msg1, &offset, obj2, &UA_TYPES[_i], NULL);
  125. ck_assert_msg(retval == UA_STATUSCODE_GOOD, "could not decode idx=%d,nodeid=%i",
  126. _i, UA_TYPES[_i].typeId.identifier.numeric);
  127. ck_assert(!memcmp(obj1, obj2, UA_TYPES[_i].memSize)); // bit identical decoding
  128. retval = UA_ByteString_allocBuffer(&msg2, 65000);
  129. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  130. pos = msg2.data;
  131. end = &msg2.data[msg2.length];
  132. retval = UA_encodeBinary(obj2, &UA_TYPES[_i], &pos, &end, NULL, NULL);
  133. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  134. // then
  135. msg1.length = offset;
  136. msg2.length = offset;
  137. ck_assert_msg(UA_ByteString_equal(&msg1, &msg2) == true,
  138. "messages differ idx=%d,nodeid=%i", _i,
  139. UA_TYPES[_i].typeId.identifier.numeric);
  140. // finally
  141. UA_delete(obj1, &UA_TYPES[_i]);
  142. UA_delete(obj2, &UA_TYPES[_i]);
  143. UA_ByteString_deleteMembers(&msg1);
  144. UA_ByteString_deleteMembers(&msg2);
  145. }
  146. END_TEST
  147. START_TEST(decodeShallFailWithTruncatedBufferButSurvive) {
  148. //Skip test for void*
  149. if (
  150. #ifdef UA_ENABLE_DISCOVERY
  151. _i == UA_TYPES_DISCOVERYCONFIGURATION ||
  152. #endif
  153. _i == UA_TYPES_FILTEROPERAND ||
  154. _i == UA_TYPES_UNION ||
  155. _i == UA_TYPES_HISTORYREADDETAILS ||
  156. _i == UA_TYPES_NOTIFICATIONDATA ||
  157. _i == UA_TYPES_MONITORINGFILTER ||
  158. _i == UA_TYPES_MONITORINGFILTERRESULT ||
  159. _i == UA_TYPES_DATASETREADERMESSAGEDATATYPE ||
  160. _i == UA_TYPES_WRITERGROUPTRANSPORTDATATYPE ||
  161. _i == UA_TYPES_CONNECTIONTRANSPORTDATATYPE ||
  162. _i == UA_TYPES_WRITERGROUPMESSAGEDATATYPE ||
  163. _i == UA_TYPES_READERGROUPTRANSPORTDATATYPE ||
  164. _i == UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE ||
  165. _i == UA_TYPES_DATASETREADERTRANSPORTDATATYPE ||
  166. _i == UA_TYPES_DATASETWRITERTRANSPORTDATATYPE ||
  167. _i == UA_TYPES_SUBSCRIBEDDATASETDATATYPE ||
  168. _i == UA_TYPES_READERGROUPMESSAGEDATATYPE ||
  169. _i == UA_TYPES_DATASETWRITERMESSAGEDATATYPE)
  170. return;
  171. // given
  172. UA_ByteString msg1;
  173. void *obj1 = UA_new(&UA_TYPES[_i]);
  174. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg1, 65000); // fixed buf size
  175. UA_Byte *pos = msg1.data;
  176. const UA_Byte *end = &msg1.data[msg1.length];
  177. retval |= UA_encodeBinary(obj1, &UA_TYPES[_i], &pos, &end, NULL, NULL);
  178. UA_delete(obj1, &UA_TYPES[_i]);
  179. if(retval != UA_STATUSCODE_GOOD) {
  180. UA_ByteString_deleteMembers(&msg1);
  181. return; // e.g. variants cannot be encoded after an init without failing (no datatype set)
  182. }
  183. size_t half = (uintptr_t)(pos - msg1.data) / 2;
  184. msg1.length = half;
  185. // when
  186. void *obj2 = UA_new(&UA_TYPES[_i]);
  187. size_t offset = 0;
  188. retval = UA_decodeBinary(&msg1, &offset, obj2, &UA_TYPES[_i], NULL);
  189. ck_assert_int_ne(retval, UA_STATUSCODE_GOOD);
  190. UA_delete(obj2, &UA_TYPES[_i]);
  191. UA_ByteString_deleteMembers(&msg1);
  192. }
  193. END_TEST
  194. #define RANDOM_TESTS 1000
  195. START_TEST(decodeScalarBasicTypeFromRandomBufferShallSucceed) {
  196. // given
  197. void *obj1 = NULL;
  198. UA_ByteString msg1;
  199. UA_Int32 retval = UA_STATUSCODE_GOOD;
  200. UA_Int32 buflen = 256;
  201. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  202. #ifdef _WIN32
  203. srand(42);
  204. #else
  205. srandom(42);
  206. #endif
  207. for(int n = 0;n < RANDOM_TESTS;n++) {
  208. for(UA_Int32 i = 0;i < buflen;i++) {
  209. #ifdef _WIN32
  210. UA_UInt32 rnd;
  211. rnd = rand();
  212. msg1.data[i] = rnd;
  213. #else
  214. msg1.data[i] = (UA_Byte)random(); // when
  215. #endif
  216. }
  217. size_t pos = 0;
  218. obj1 = UA_new(&UA_TYPES[_i]);
  219. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i], NULL);
  220. //then
  221. ck_assert_msg(retval == UA_STATUSCODE_GOOD,
  222. "Decoding %d from random buffer",
  223. UA_TYPES[_i].typeId.identifier.numeric);
  224. // finally
  225. UA_delete(obj1, &UA_TYPES[_i]);
  226. }
  227. UA_ByteString_deleteMembers(&msg1);
  228. }
  229. END_TEST
  230. START_TEST(decodeComplexTypeFromRandomBufferShallSurvive) {
  231. // given
  232. UA_ByteString msg1;
  233. UA_Int32 retval = UA_STATUSCODE_GOOD;
  234. UA_Int32 buflen = 256;
  235. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  236. #ifdef _WIN32
  237. srand(42);
  238. #else
  239. srandom(42);
  240. #endif
  241. // when
  242. for(int n = 0;n < RANDOM_TESTS;n++) {
  243. for(UA_Int32 i = 0;i < buflen;i++) {
  244. #ifdef _WIN32
  245. UA_UInt32 rnd;
  246. rnd = rand();
  247. msg1.data[i] = rnd;
  248. #else
  249. msg1.data[i] = (UA_Byte)random(); // when
  250. #endif
  251. }
  252. size_t pos = 0;
  253. void *obj1 = UA_new(&UA_TYPES[_i]);
  254. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i], NULL);
  255. UA_delete(obj1, &UA_TYPES[_i]);
  256. }
  257. // finally
  258. UA_ByteString_deleteMembers(&msg1);
  259. }
  260. END_TEST
  261. START_TEST(calcSizeBinaryShallBeCorrect) {
  262. /* Empty variants (with no type defined) cannot be encoded. This is
  263. * intentional. Discovery configuration is just a base class and void * */
  264. if(_i == UA_TYPES_VARIANT ||
  265. _i == UA_TYPES_VARIABLEATTRIBUTES ||
  266. _i == UA_TYPES_VARIABLETYPEATTRIBUTES ||
  267. _i == UA_TYPES_FILTEROPERAND ||
  268. #ifdef UA_ENABLE_DISCOVERY
  269. _i == UA_TYPES_DISCOVERYCONFIGURATION ||
  270. #endif
  271. _i == UA_TYPES_UNION ||
  272. _i == UA_TYPES_HISTORYREADDETAILS ||
  273. _i == UA_TYPES_NOTIFICATIONDATA ||
  274. _i == UA_TYPES_MONITORINGFILTER ||
  275. _i == UA_TYPES_MONITORINGFILTERRESULT ||
  276. _i == UA_TYPES_DATASETREADERMESSAGEDATATYPE ||
  277. _i == UA_TYPES_WRITERGROUPTRANSPORTDATATYPE ||
  278. _i == UA_TYPES_CONNECTIONTRANSPORTDATATYPE ||
  279. _i == UA_TYPES_WRITERGROUPMESSAGEDATATYPE ||
  280. _i == UA_TYPES_READERGROUPTRANSPORTDATATYPE ||
  281. _i == UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE ||
  282. _i == UA_TYPES_DATASETREADERTRANSPORTDATATYPE ||
  283. _i == UA_TYPES_DATASETWRITERTRANSPORTDATATYPE ||
  284. _i == UA_TYPES_SUBSCRIBEDDATASETDATATYPE ||
  285. _i == UA_TYPES_READERGROUPMESSAGEDATATYPE ||
  286. _i == UA_TYPES_DATASETWRITERMESSAGEDATATYPE)
  287. return;
  288. void *obj = UA_new(&UA_TYPES[_i]);
  289. size_t predicted_size = UA_calcSizeBinary(obj, &UA_TYPES[_i]);
  290. ck_assert_int_ne(predicted_size, 0);
  291. UA_ByteString msg;
  292. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg, predicted_size);
  293. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  294. UA_Byte *pos = msg.data;
  295. const UA_Byte *end = &msg.data[msg.length];
  296. retval = UA_encodeBinary(obj, &UA_TYPES[_i], &pos, &end, NULL, NULL);
  297. if(retval)
  298. printf("%i\n",_i);
  299. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  300. ck_assert_int_eq((uintptr_t)(pos - msg.data), predicted_size);
  301. UA_delete(obj, &UA_TYPES[_i]);
  302. UA_ByteString_deleteMembers(&msg);
  303. }
  304. END_TEST
  305. int main(void) {
  306. int number_failed = 0;
  307. SRunner *sr;
  308. Suite *s = suite_create("testMemoryHandling");
  309. TCase *tc = tcase_create("Empty Objects");
  310. tcase_add_loop_test(tc, newAndEmptyObjectShallBeDeleted, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  311. tcase_add_test(tc, arrayCopyShallMakeADeepCopy);
  312. tcase_add_loop_test(tc, encodeShallYieldDecode, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  313. suite_add_tcase(s, tc);
  314. tc = tcase_create("Truncated Buffers");
  315. tcase_add_loop_test(tc, decodeShallFailWithTruncatedBufferButSurvive,
  316. UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  317. suite_add_tcase(s, tc);
  318. tc = tcase_create("Fuzzing with Random Buffers");
  319. tcase_add_loop_test(tc, decodeScalarBasicTypeFromRandomBufferShallSucceed,
  320. UA_TYPES_BOOLEAN, UA_TYPES_DOUBLE);
  321. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive,
  322. UA_TYPES_NODEID, UA_TYPES_COUNT - 1);
  323. suite_add_tcase(s, tc);
  324. tc = tcase_create("Test calcSizeBinary");
  325. tcase_add_loop_test(tc, calcSizeBinaryShallBeCorrect, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  326. suite_add_tcase(s, tc);
  327. sr = srunner_create(s);
  328. srunner_set_fork_status(sr, CK_NOFORK);
  329. srunner_run_all (sr, CK_NORMAL);
  330. number_failed += srunner_ntests_failed(sr);
  331. srunner_free(sr);
  332. return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
  333. }