check_types_memory.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372
  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. #ifdef UA_TYPES_FRAME
  156. _i == UA_TYPES_FRAME ||
  157. _i == UA_TYPES_ORIENTATION ||
  158. _i == UA_TYPES_VECTOR ||
  159. _i == UA_TYPES_CARTESIANCOORDINATES ||
  160. #endif
  161. _i == UA_TYPES_HISTORYREADDETAILS ||
  162. _i == UA_TYPES_NOTIFICATIONDATA ||
  163. _i == UA_TYPES_MONITORINGFILTER ||
  164. _i == UA_TYPES_MONITORINGFILTERRESULT ||
  165. _i == UA_TYPES_DATASETREADERMESSAGEDATATYPE ||
  166. _i == UA_TYPES_WRITERGROUPTRANSPORTDATATYPE ||
  167. _i == UA_TYPES_CONNECTIONTRANSPORTDATATYPE ||
  168. _i == UA_TYPES_WRITERGROUPMESSAGEDATATYPE ||
  169. _i == UA_TYPES_READERGROUPTRANSPORTDATATYPE ||
  170. _i == UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE ||
  171. _i == UA_TYPES_DATASETREADERTRANSPORTDATATYPE ||
  172. _i == UA_TYPES_DATASETWRITERTRANSPORTDATATYPE ||
  173. _i == UA_TYPES_SUBSCRIBEDDATASETDATATYPE ||
  174. _i == UA_TYPES_READERGROUPMESSAGEDATATYPE ||
  175. _i == UA_TYPES_DATASETWRITERMESSAGEDATATYPE)
  176. return;
  177. // given
  178. UA_ByteString msg1;
  179. void *obj1 = UA_new(&UA_TYPES[_i]);
  180. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg1, 65000); // fixed buf size
  181. UA_Byte *pos = msg1.data;
  182. const UA_Byte *end = &msg1.data[msg1.length];
  183. retval |= UA_encodeBinary(obj1, &UA_TYPES[_i], &pos, &end, NULL, NULL);
  184. UA_delete(obj1, &UA_TYPES[_i]);
  185. if(retval != UA_STATUSCODE_GOOD) {
  186. UA_ByteString_deleteMembers(&msg1);
  187. return; // e.g. variants cannot be encoded after an init without failing (no datatype set)
  188. }
  189. size_t half = (uintptr_t)(pos - msg1.data) / 2;
  190. msg1.length = half;
  191. // when
  192. void *obj2 = UA_new(&UA_TYPES[_i]);
  193. size_t offset = 0;
  194. retval = UA_decodeBinary(&msg1, &offset, obj2, &UA_TYPES[_i], NULL);
  195. ck_assert_int_ne(retval, UA_STATUSCODE_GOOD);
  196. UA_delete(obj2, &UA_TYPES[_i]);
  197. UA_ByteString_deleteMembers(&msg1);
  198. }
  199. END_TEST
  200. #define RANDOM_TESTS 1000
  201. START_TEST(decodeScalarBasicTypeFromRandomBufferShallSucceed) {
  202. // given
  203. void *obj1 = NULL;
  204. UA_ByteString msg1;
  205. UA_Int32 retval = UA_STATUSCODE_GOOD;
  206. UA_Int32 buflen = 256;
  207. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  208. #ifdef _WIN32
  209. srand(42);
  210. #else
  211. srandom(42);
  212. #endif
  213. for(int n = 0;n < RANDOM_TESTS;n++) {
  214. for(UA_Int32 i = 0;i < buflen;i++) {
  215. #ifdef _WIN32
  216. UA_UInt32 rnd;
  217. rnd = rand();
  218. msg1.data[i] = rnd;
  219. #else
  220. msg1.data[i] = (UA_Byte)random(); // when
  221. #endif
  222. }
  223. size_t pos = 0;
  224. obj1 = UA_new(&UA_TYPES[_i]);
  225. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i], NULL);
  226. //then
  227. ck_assert_msg(retval == UA_STATUSCODE_GOOD,
  228. "Decoding %d from random buffer",
  229. UA_TYPES[_i].typeId.identifier.numeric);
  230. // finally
  231. UA_delete(obj1, &UA_TYPES[_i]);
  232. }
  233. UA_ByteString_deleteMembers(&msg1);
  234. }
  235. END_TEST
  236. START_TEST(decodeComplexTypeFromRandomBufferShallSurvive) {
  237. // given
  238. UA_ByteString msg1;
  239. UA_Int32 retval = UA_STATUSCODE_GOOD;
  240. UA_Int32 buflen = 256;
  241. retval = UA_ByteString_allocBuffer(&msg1, buflen); // fixed size
  242. #ifdef _WIN32
  243. srand(42);
  244. #else
  245. srandom(42);
  246. #endif
  247. // when
  248. for(int n = 0;n < RANDOM_TESTS;n++) {
  249. for(UA_Int32 i = 0;i < buflen;i++) {
  250. #ifdef _WIN32
  251. UA_UInt32 rnd;
  252. rnd = rand();
  253. msg1.data[i] = rnd;
  254. #else
  255. msg1.data[i] = (UA_Byte)random(); // when
  256. #endif
  257. }
  258. size_t pos = 0;
  259. void *obj1 = UA_new(&UA_TYPES[_i]);
  260. retval |= UA_decodeBinary(&msg1, &pos, obj1, &UA_TYPES[_i], NULL);
  261. UA_delete(obj1, &UA_TYPES[_i]);
  262. }
  263. // finally
  264. UA_ByteString_deleteMembers(&msg1);
  265. }
  266. END_TEST
  267. START_TEST(calcSizeBinaryShallBeCorrect) {
  268. /* Empty variants (with no type defined) cannot be encoded. This is
  269. * intentional. Discovery configuration is just a base class and void * */
  270. if(_i == UA_TYPES_VARIANT ||
  271. _i == UA_TYPES_VARIABLEATTRIBUTES ||
  272. _i == UA_TYPES_VARIABLETYPEATTRIBUTES ||
  273. _i == UA_TYPES_FILTEROPERAND ||
  274. #ifdef UA_ENABLE_DISCOVERY
  275. _i == UA_TYPES_DISCOVERYCONFIGURATION ||
  276. #endif
  277. _i == UA_TYPES_UNION ||
  278. #ifdef UA_TYPES_FRAME
  279. _i == UA_TYPES_FRAME ||
  280. _i == UA_TYPES_ORIENTATION ||
  281. _i == UA_TYPES_VECTOR ||
  282. _i == UA_TYPES_CARTESIANCOORDINATES ||
  283. #endif
  284. _i == UA_TYPES_HISTORYREADDETAILS ||
  285. _i == UA_TYPES_NOTIFICATIONDATA ||
  286. _i == UA_TYPES_MONITORINGFILTER ||
  287. _i == UA_TYPES_MONITORINGFILTERRESULT ||
  288. _i == UA_TYPES_DATASETREADERMESSAGEDATATYPE ||
  289. _i == UA_TYPES_WRITERGROUPTRANSPORTDATATYPE ||
  290. _i == UA_TYPES_CONNECTIONTRANSPORTDATATYPE ||
  291. _i == UA_TYPES_WRITERGROUPMESSAGEDATATYPE ||
  292. _i == UA_TYPES_READERGROUPTRANSPORTDATATYPE ||
  293. _i == UA_TYPES_PUBLISHEDDATASETSOURCEDATATYPE ||
  294. _i == UA_TYPES_DATASETREADERTRANSPORTDATATYPE ||
  295. _i == UA_TYPES_DATASETWRITERTRANSPORTDATATYPE ||
  296. _i == UA_TYPES_SUBSCRIBEDDATASETDATATYPE ||
  297. _i == UA_TYPES_READERGROUPMESSAGEDATATYPE ||
  298. _i == UA_TYPES_DATASETWRITERMESSAGEDATATYPE)
  299. return;
  300. void *obj = UA_new(&UA_TYPES[_i]);
  301. size_t predicted_size = UA_calcSizeBinary(obj, &UA_TYPES[_i]);
  302. ck_assert_int_ne(predicted_size, 0);
  303. UA_ByteString msg;
  304. UA_StatusCode retval = UA_ByteString_allocBuffer(&msg, predicted_size);
  305. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  306. UA_Byte *pos = msg.data;
  307. const UA_Byte *end = &msg.data[msg.length];
  308. retval = UA_encodeBinary(obj, &UA_TYPES[_i], &pos, &end, NULL, NULL);
  309. if(retval)
  310. printf("%i\n",_i);
  311. ck_assert_int_eq(retval, UA_STATUSCODE_GOOD);
  312. ck_assert_int_eq((uintptr_t)(pos - msg.data), predicted_size);
  313. UA_delete(obj, &UA_TYPES[_i]);
  314. UA_ByteString_deleteMembers(&msg);
  315. }
  316. END_TEST
  317. int main(void) {
  318. int number_failed = 0;
  319. SRunner *sr;
  320. Suite *s = suite_create("testMemoryHandling");
  321. TCase *tc = tcase_create("Empty Objects");
  322. tcase_add_loop_test(tc, newAndEmptyObjectShallBeDeleted, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  323. tcase_add_test(tc, arrayCopyShallMakeADeepCopy);
  324. tcase_add_loop_test(tc, encodeShallYieldDecode, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  325. suite_add_tcase(s, tc);
  326. tc = tcase_create("Truncated Buffers");
  327. tcase_add_loop_test(tc, decodeShallFailWithTruncatedBufferButSurvive,
  328. UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  329. suite_add_tcase(s, tc);
  330. tc = tcase_create("Fuzzing with Random Buffers");
  331. tcase_add_loop_test(tc, decodeScalarBasicTypeFromRandomBufferShallSucceed,
  332. UA_TYPES_BOOLEAN, UA_TYPES_DOUBLE);
  333. tcase_add_loop_test(tc, decodeComplexTypeFromRandomBufferShallSurvive,
  334. UA_TYPES_NODEID, UA_TYPES_COUNT - 1);
  335. suite_add_tcase(s, tc);
  336. tc = tcase_create("Test calcSizeBinary");
  337. tcase_add_loop_test(tc, calcSizeBinaryShallBeCorrect, UA_TYPES_BOOLEAN, UA_TYPES_COUNT - 1);
  338. suite_add_tcase(s, tc);
  339. sr = srunner_create(s);
  340. srunner_set_fork_status(sr, CK_NOFORK);
  341. srunner_run_all (sr, CK_NORMAL);
  342. number_failed += srunner_ntests_failed(sr);
  343. srunner_free(sr);
  344. return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE;
  345. }