check_types_memory.c 13 KB

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