check_types_memory.c 13 KB

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