ua_types.c 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191
  1. #include "ua_util.h"
  2. #include "ua_types.h"
  3. #include "ua_statuscodes.h"
  4. #include "ua_types_generated.h"
  5. /*****************/
  6. /* Helper Macros */
  7. /*****************/
  8. #define UA_TYPE_DEFAULT(TYPE) \
  9. UA_TYPE_NEW_DEFAULT(TYPE) \
  10. UA_TYPE_INIT_DEFAULT(TYPE) \
  11. UA_TYPE_DELETEMEMBERS_NOACTION(TYPE) \
  12. UA_TYPE_DELETE_DEFAULT(TYPE) \
  13. UA_TYPE_COPY_DEFAULT(TYPE) \
  14. #define UA_TYPE_NEW_DEFAULT(TYPE) \
  15. TYPE * TYPE##_new() { \
  16. TYPE *p = UA_malloc(sizeof(TYPE)); \
  17. if(p) TYPE##_init(p); \
  18. return p; \
  19. }
  20. #define UA_TYPE_INIT_DEFAULT(TYPE) \
  21. void TYPE##_init(TYPE * p) { \
  22. *p = (TYPE)0; \
  23. }
  24. #define UA_TYPE_DELETEMEMBERS_NOACTION(TYPE) \
  25. void TYPE##_deleteMembers(TYPE *p) { \
  26. }
  27. #define UA_TYPE_DELETE_DEFAULT(TYPE) \
  28. void TYPE##_delete(TYPE *p) { \
  29. TYPE##_deleteMembers(p); \
  30. UA_free(p); \
  31. }
  32. #define UA_TYPE_COPY_DEFAULT(TYPE) \
  33. UA_StatusCode TYPE##_copy(TYPE const *src, TYPE *dst) { \
  34. *dst = *src; \
  35. return UA_STATUSCODE_GOOD; \
  36. }
  37. /*****************/
  38. /* Builtin Types */
  39. /*****************/
  40. /* Boolean */
  41. UA_TYPE_DEFAULT(UA_Boolean)
  42. /* SByte */
  43. UA_TYPE_DEFAULT(UA_SByte)
  44. /* Byte */
  45. UA_TYPE_DEFAULT(UA_Byte)
  46. /* Int16 */
  47. UA_TYPE_DEFAULT(UA_Int16)
  48. /* UInt16 */
  49. UA_TYPE_DEFAULT(UA_UInt16)
  50. /* Int32 */
  51. UA_TYPE_DEFAULT(UA_Int32)
  52. /* UInt32 */
  53. UA_TYPE_DEFAULT(UA_UInt32)
  54. /* Int64 */
  55. UA_TYPE_DEFAULT(UA_Int64)
  56. /* UInt64 */
  57. UA_TYPE_DEFAULT(UA_UInt64)
  58. /* Float */
  59. UA_TYPE_DEFAULT(UA_Float)
  60. /* Double */
  61. UA_TYPE_DEFAULT(UA_Double)
  62. /* String */
  63. UA_TYPE_NEW_DEFAULT(UA_String)
  64. UA_TYPE_DELETE_DEFAULT(UA_String)
  65. void UA_String_init(UA_String *p) {
  66. p->length = -1;
  67. p->data = UA_NULL;
  68. }
  69. void UA_String_deleteMembers(UA_String *p) {
  70. UA_free(p->data);
  71. p->data = UA_NULL;
  72. }
  73. UA_StatusCode UA_String_copy(UA_String const *src, UA_String *dst) {
  74. UA_String_init(dst);
  75. if(src->length > 0) {
  76. if(!(dst->data = UA_malloc((UA_UInt32)src->length)))
  77. return UA_STATUSCODE_BADOUTOFMEMORY;
  78. UA_memcpy((void *)dst->data, src->data, (UA_UInt32)src->length);
  79. }
  80. dst->length = src->length;
  81. return UA_STATUSCODE_GOOD;
  82. }
  83. UA_String UA_String_fromChars(char const *src) {
  84. UA_String str;
  85. size_t length = strlen(src);
  86. if(length == 0) {
  87. str.length = 0;
  88. str.data = UA_NULL;
  89. return str;
  90. }
  91. str.data = UA_malloc(length);
  92. if(!str.data) {
  93. str.length = -1;
  94. return str;
  95. }
  96. UA_memcpy(str.data, src, length);
  97. str.length = length;
  98. return str;
  99. }
  100. #define UA_STRING_COPYPRINTF_BUFSIZE 1024
  101. UA_StatusCode UA_String_copyprintf(char const *fmt, UA_String *dst, ...) {
  102. char src[UA_STRING_COPYPRINTF_BUFSIZE];
  103. va_list ap;
  104. va_start(ap, dst);
  105. #if defined(__GNUC__) || defined(__clang__)
  106. #pragma GCC diagnostic push
  107. #pragma GCC diagnostic ignored "-Wformat-nonliteral"
  108. #endif
  109. // vsnprintf should only take a literal and no variable to be secure
  110. UA_Int32 len = vsnprintf(src, UA_STRING_COPYPRINTF_BUFSIZE, fmt, ap);
  111. #if defined(__GNUC__) || defined(__clang__)
  112. #pragma GCC diagnostic pop
  113. #endif
  114. va_end(ap);
  115. if(len < 0) // FIXME: old glibc 2.0 would return -1 when truncated
  116. return UA_STATUSCODE_BADINTERNALERROR;
  117. // since glibc 2.1 vsnprintf returns the len that would have resulted if buf were large enough
  118. len = ( len > UA_STRING_COPYPRINTF_BUFSIZE ? UA_STRING_COPYPRINTF_BUFSIZE : len );
  119. if(!(dst->data = UA_malloc((UA_UInt32)len)))
  120. return UA_STATUSCODE_BADOUTOFMEMORY;
  121. UA_memcpy((void *)dst->data, src, (UA_UInt32)len);
  122. dst->length = len;
  123. return UA_STATUSCODE_GOOD;
  124. }
  125. UA_Boolean UA_String_equal(const UA_String *string1, const UA_String *string2) {
  126. if(string1->length <= 0 && string2->length <= 0)
  127. return UA_TRUE;
  128. if(string1->length != string2->length)
  129. return UA_FALSE;
  130. // casts are needed to overcome signed warnings
  131. UA_Int32 is = strncmp((char const *)string1->data, (char const *)string2->data, (size_t)string1->length);
  132. return (is == 0) ? UA_TRUE : UA_FALSE;
  133. }
  134. /* DateTime */
  135. #define UNIX_EPOCH_BIAS_SEC 11644473600LL // Number of seconds from 1 Jan. 1601 00:00 to 1 Jan 1970 00:00 UTC
  136. #define HUNDRED_NANOSEC_PER_USEC 10LL
  137. #define HUNDRED_NANOSEC_PER_SEC (HUNDRED_NANOSEC_PER_USEC * 1000000LL)
  138. #ifdef __MINGW32__
  139. #ifndef _TIMEZONE_DEFINED
  140. #define _TIMEZONE_DEFINED
  141. struct timezone {
  142. int tz_minuteswest;
  143. int tz_dsttime;
  144. };
  145. #endif
  146. #endif
  147. #ifdef _WIN32
  148. static const unsigned __int64 epoch = 116444736000000000;
  149. int gettimeofday(struct timeval *tp, struct timezone *tzp);
  150. int gettimeofday(struct timeval *tp, struct timezone *tzp) {
  151. FILETIME ft;
  152. SYSTEMTIME st;
  153. ULARGE_INTEGER ul;
  154. GetSystemTime(&st);
  155. SystemTimeToFileTime(&st, &ft);
  156. ul.LowPart = ft.dwLowDateTime;
  157. ul.HighPart = ft.dwHighDateTime;
  158. tp->tv_sec = (ul.QuadPart - epoch) / 10000000L;
  159. tp->tv_usec = st.wMilliseconds * 1000;
  160. return 0;
  161. }
  162. #endif
  163. UA_DateTime UA_DateTime_now() {
  164. UA_DateTime dateTime;
  165. struct timeval tv;
  166. gettimeofday(&tv, UA_NULL);
  167. dateTime = (tv.tv_sec + UNIX_EPOCH_BIAS_SEC)
  168. * HUNDRED_NANOSEC_PER_SEC + tv.tv_usec * HUNDRED_NANOSEC_PER_USEC;
  169. return dateTime;
  170. }
  171. UA_DateTimeStruct UA_DateTime_toStruct(UA_DateTime atime) {
  172. UA_DateTimeStruct dateTimeStruct;
  173. //calcualting the the milli-, micro- and nanoseconds
  174. dateTimeStruct.nanoSec = (UA_Int16)((atime % 10) * 100);
  175. dateTimeStruct.microSec = (UA_Int16)((atime % 10000) / 10);
  176. dateTimeStruct.milliSec = (UA_Int16)((atime % 10000000) / 10000);
  177. //calculating the unix time with #include <time.h>
  178. time_t secSinceUnixEpoch = (atime/10000000) - UNIX_EPOCH_BIAS_SEC;
  179. struct tm ts = *gmtime(&secSinceUnixEpoch);
  180. dateTimeStruct.sec = (UA_Int16)ts.tm_sec;
  181. dateTimeStruct.min = (UA_Int16)ts.tm_min;
  182. dateTimeStruct.hour = (UA_Int16)ts.tm_hour;
  183. dateTimeStruct.day = (UA_Int16)ts.tm_mday;
  184. dateTimeStruct.month = (UA_Int16)(ts.tm_mon + 1);
  185. dateTimeStruct.year = (UA_Int16)(ts.tm_year + 1900);
  186. return dateTimeStruct;
  187. }
  188. UA_StatusCode UA_DateTime_toString(UA_DateTime atime, UA_String *timeString) {
  189. // length of the string is 31 (incl. \0 at the end)
  190. if(!(timeString->data = UA_malloc(32)))
  191. return UA_STATUSCODE_BADOUTOFMEMORY;
  192. timeString->length = 31;
  193. UA_DateTimeStruct tSt = UA_DateTime_toStruct(atime);
  194. sprintf((char*)timeString->data, "%02d/%02d/%04d %02d:%02d:%02d.%03d.%03d.%03d", tSt.month, tSt.day, tSt.year,
  195. tSt.hour, tSt.min, tSt.sec, tSt.milliSec, tSt.microSec, tSt.nanoSec);
  196. return UA_STATUSCODE_GOOD;
  197. }
  198. /* Guid */
  199. UA_TYPE_NEW_DEFAULT(UA_Guid)
  200. UA_TYPE_DELETEMEMBERS_NOACTION(UA_Guid)
  201. UA_TYPE_DELETE_DEFAULT(UA_Guid)
  202. UA_Boolean UA_Guid_equal(const UA_Guid *g1, const UA_Guid *g2) {
  203. if(memcmp(g1, g2, sizeof(UA_Guid)) == 0)
  204. return UA_TRUE;
  205. return UA_FALSE;
  206. }
  207. UA_Guid UA_Guid_random(UA_UInt32 *seed) {
  208. UA_Guid result;
  209. result.data1 = RAND(seed);
  210. UA_UInt32 r = RAND(seed);
  211. result.data2 = (UA_UInt16) r;
  212. result.data3 = (UA_UInt16) (r >> 16);
  213. r = RAND(seed);
  214. result.data4[0] = (UA_Byte)r;
  215. result.data4[1] = (UA_Byte)(r >> 4);
  216. result.data4[2] = (UA_Byte)(r >> 8);
  217. result.data4[3] = (UA_Byte)(r >> 12);
  218. r = RAND(seed);
  219. result.data4[4] = (UA_Byte)r;
  220. result.data4[5] = (UA_Byte)(r >> 4);
  221. result.data4[6] = (UA_Byte)(r >> 8);
  222. result.data4[7] = (UA_Byte)(r >> 12);
  223. return result;
  224. }
  225. void UA_Guid_init(UA_Guid *p) {
  226. p->data1 = 0;
  227. p->data2 = 0;
  228. p->data3 = 0;
  229. memset(p->data4, 0, sizeof(UA_Byte)*8);
  230. }
  231. UA_StatusCode UA_Guid_copy(UA_Guid const *src, UA_Guid *dst) {
  232. UA_memcpy((void *)dst, (const void *)src, sizeof(UA_Guid));
  233. return UA_STATUSCODE_GOOD;
  234. }
  235. /* ByteString */
  236. UA_StatusCode UA_ByteString_newMembers(UA_ByteString *p, UA_Int32 length) {
  237. if(length > 0) {
  238. if(!(p->data = UA_malloc((UA_UInt32)length)))
  239. return UA_STATUSCODE_BADOUTOFMEMORY;
  240. p->length = length;
  241. } else {
  242. p->data = UA_NULL;
  243. if(length == 0)
  244. p->length = 0;
  245. else
  246. p->length = -1;
  247. }
  248. return UA_STATUSCODE_GOOD;
  249. }
  250. /* XmlElement */
  251. /* NodeId */
  252. UA_TYPE_NEW_DEFAULT(UA_NodeId)
  253. UA_TYPE_DELETE_DEFAULT(UA_NodeId)
  254. void UA_NodeId_init(UA_NodeId *p) {
  255. p->identifierType = UA_NODEIDTYPE_NUMERIC;
  256. p->namespaceIndex = 0;
  257. memset(&p->identifier, 0, sizeof(p->identifier));
  258. }
  259. UA_StatusCode UA_NodeId_copy(UA_NodeId const *src, UA_NodeId *dst) {
  260. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  261. switch(src->identifierType) {
  262. case UA_NODEIDTYPE_NUMERIC:
  263. *dst = *src;
  264. return UA_STATUSCODE_GOOD;
  265. case UA_NODEIDTYPE_STRING: // Table 6, second entry
  266. retval |= UA_String_copy(&src->identifier.string, &dst->identifier.string);
  267. break;
  268. case UA_NODEIDTYPE_GUID: // Table 6, third entry
  269. retval |= UA_Guid_copy(&src->identifier.guid, &dst->identifier.guid);
  270. break;
  271. case UA_NODEIDTYPE_BYTESTRING: // Table 6, "OPAQUE"
  272. retval |= UA_ByteString_copy(&src->identifier.byteString, &dst->identifier.byteString);
  273. break;
  274. default:
  275. UA_NodeId_init(dst);
  276. return UA_STATUSCODE_BADINTERNALERROR;
  277. }
  278. dst->namespaceIndex = src->namespaceIndex;
  279. dst->identifierType = src->identifierType;
  280. if(retval) {
  281. UA_NodeId_deleteMembers(dst);
  282. UA_NodeId_init(dst);
  283. }
  284. return retval;
  285. }
  286. static UA_Boolean UA_NodeId_isBasicType(UA_NodeId const *id) {
  287. return id ->namespaceIndex == 0 && 1 <= id ->identifier.numeric &&
  288. id ->identifier.numeric <= 25;
  289. }
  290. void UA_NodeId_deleteMembers(UA_NodeId *p) {
  291. switch(p->identifierType) {
  292. case UA_NODEIDTYPE_STRING:
  293. case UA_NODEIDTYPE_BYTESTRING:
  294. UA_ByteString_deleteMembers(&p->identifier.byteString);
  295. break;
  296. default:
  297. break;
  298. }
  299. }
  300. UA_Boolean UA_NodeId_equal(const UA_NodeId *n1, const UA_NodeId *n2) {
  301. if(n1->namespaceIndex != n2->namespaceIndex || n1->identifierType!=n2->identifierType)
  302. return UA_FALSE;
  303. switch(n1->identifierType) {
  304. case UA_NODEIDTYPE_NUMERIC:
  305. if(n1->identifier.numeric == n2->identifier.numeric)
  306. return UA_TRUE;
  307. else
  308. return UA_FALSE;
  309. case UA_NODEIDTYPE_STRING:
  310. return UA_String_equal(&n1->identifier.string, &n2->identifier.string);
  311. case UA_NODEIDTYPE_GUID:
  312. return UA_Guid_equal(&n1->identifier.guid, &n2->identifier.guid);
  313. case UA_NODEIDTYPE_BYTESTRING:
  314. return UA_ByteString_equal(&n1->identifier.byteString, &n2->identifier.byteString);
  315. }
  316. return UA_FALSE;
  317. }
  318. UA_Boolean UA_NodeId_isNull(const UA_NodeId *p) {
  319. switch(p->identifierType) {
  320. case UA_NODEIDTYPE_NUMERIC:
  321. if(p->namespaceIndex != 0 || p->identifier.numeric != 0)
  322. return UA_FALSE;
  323. break;
  324. case UA_NODEIDTYPE_STRING:
  325. if(p->namespaceIndex != 0 || p->identifier.string.length > 0)
  326. return UA_FALSE;
  327. break;
  328. case UA_NODEIDTYPE_GUID:
  329. if(p->namespaceIndex != 0 ||
  330. memcmp(&p->identifier.guid, (char[sizeof(UA_Guid)]) { 0 }, sizeof(UA_Guid)) != 0)
  331. return UA_FALSE;
  332. break;
  333. case UA_NODEIDTYPE_BYTESTRING:
  334. if(p->namespaceIndex != 0 || p->identifier.byteString.length > 0)
  335. return UA_FALSE;
  336. break;
  337. default:
  338. return UA_FALSE;
  339. }
  340. return UA_TRUE;
  341. }
  342. /* ExpandedNodeId */
  343. UA_TYPE_NEW_DEFAULT(UA_ExpandedNodeId)
  344. UA_TYPE_DELETE_DEFAULT(UA_ExpandedNodeId)
  345. void UA_ExpandedNodeId_deleteMembers(UA_ExpandedNodeId *p) {
  346. UA_NodeId_deleteMembers(&p->nodeId);
  347. UA_String_deleteMembers(&p->namespaceUri);
  348. }
  349. void UA_ExpandedNodeId_init(UA_ExpandedNodeId *p) {
  350. UA_NodeId_init(&p->nodeId);
  351. UA_String_init(&p->namespaceUri);
  352. p->serverIndex = 0;
  353. }
  354. UA_StatusCode UA_ExpandedNodeId_copy(UA_ExpandedNodeId const *src, UA_ExpandedNodeId *dst) {
  355. UA_StatusCode retval = UA_NodeId_copy(&src->nodeId, &dst->nodeId);
  356. retval |= UA_String_copy(&src->namespaceUri, &dst->namespaceUri);
  357. dst->serverIndex = src->serverIndex;
  358. if(retval) {
  359. UA_ExpandedNodeId_deleteMembers(dst);
  360. UA_ExpandedNodeId_init(dst);
  361. }
  362. return retval;
  363. }
  364. UA_Boolean UA_ExpandedNodeId_isNull(const UA_ExpandedNodeId *p) {
  365. return UA_NodeId_isNull(&p->nodeId);
  366. }
  367. /* StatusCode */
  368. /* QualifiedName */
  369. UA_TYPE_NEW_DEFAULT(UA_QualifiedName)
  370. UA_TYPE_DELETE_DEFAULT(UA_QualifiedName)
  371. void UA_QualifiedName_deleteMembers(UA_QualifiedName *p) {
  372. UA_String_deleteMembers(&p->name);
  373. }
  374. void UA_QualifiedName_init(UA_QualifiedName *p) {
  375. UA_String_init(&p->name);
  376. p->namespaceIndex = 0;
  377. }
  378. UA_StatusCode UA_QualifiedName_copy(UA_QualifiedName const *src, UA_QualifiedName *dst) {
  379. UA_StatusCode retval = UA_String_copy(&src->name, &dst->name);
  380. dst->namespaceIndex = src->namespaceIndex;
  381. if(retval) {
  382. UA_QualifiedName_deleteMembers(dst);
  383. UA_QualifiedName_init(dst);
  384. }
  385. return retval;
  386. }
  387. /* LocalizedText */
  388. UA_TYPE_NEW_DEFAULT(UA_LocalizedText)
  389. UA_TYPE_DELETE_DEFAULT(UA_LocalizedText)
  390. void UA_LocalizedText_deleteMembers(UA_LocalizedText *p) {
  391. UA_String_deleteMembers(&p->locale);
  392. UA_String_deleteMembers(&p->text);
  393. }
  394. void UA_LocalizedText_init(UA_LocalizedText *p) {
  395. UA_String_init(&p->locale);
  396. UA_String_init(&p->text);
  397. }
  398. UA_StatusCode UA_LocalizedText_copy(UA_LocalizedText const *src, UA_LocalizedText *dst) {
  399. UA_StatusCode retval = UA_String_copy(&src->locale, &dst->locale);
  400. retval |= UA_String_copy(&src->text, &dst->text);
  401. if(retval) {
  402. UA_LocalizedText_deleteMembers(dst);
  403. UA_LocalizedText_init(dst);
  404. }
  405. return retval;
  406. }
  407. /* ExtensionObject */
  408. UA_TYPE_NEW_DEFAULT(UA_ExtensionObject)
  409. UA_TYPE_DELETE_DEFAULT(UA_ExtensionObject)
  410. void UA_ExtensionObject_deleteMembers(UA_ExtensionObject *p) {
  411. UA_NodeId_deleteMembers(&p->typeId);
  412. UA_ByteString_deleteMembers(&p->body);
  413. }
  414. void UA_ExtensionObject_init(UA_ExtensionObject *p) {
  415. UA_NodeId_init(&p->typeId);
  416. p->encoding = UA_EXTENSIONOBJECT_ENCODINGMASK_NOBODYISENCODED;
  417. UA_ByteString_init(&p->body);
  418. }
  419. UA_StatusCode UA_ExtensionObject_copy(UA_ExtensionObject const *src, UA_ExtensionObject *dst) {
  420. UA_StatusCode retval = UA_ByteString_copy(&src->body, &dst->body);
  421. retval |= UA_NodeId_copy(&src->typeId, &dst->typeId);
  422. dst->encoding = src->encoding;
  423. if(retval) {
  424. UA_ExtensionObject_deleteMembers(dst);
  425. UA_ExtensionObject_init(dst);
  426. }
  427. return retval;
  428. }
  429. /* DataValue */
  430. UA_TYPE_NEW_DEFAULT(UA_DataValue)
  431. UA_TYPE_DELETE_DEFAULT(UA_DataValue)
  432. void UA_DataValue_deleteMembers(UA_DataValue *p) {
  433. UA_Variant_deleteMembers(&p->value);
  434. }
  435. void UA_DataValue_init(UA_DataValue *p) {
  436. *((UA_Byte*)p) = 0; // zero out the bitfield
  437. p->serverPicoseconds = 0;
  438. UA_DateTime_init(&p->serverTimestamp);
  439. p->sourcePicoseconds = 0;
  440. UA_DateTime_init(&p->sourceTimestamp);
  441. UA_StatusCode_init(&p->status);
  442. UA_Variant_init(&p->value);
  443. }
  444. UA_StatusCode UA_DataValue_copy(UA_DataValue const *src, UA_DataValue *dst) {
  445. UA_DataValue_init(dst);
  446. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  447. UA_StatusCode retval = UA_DateTime_copy(&src->serverTimestamp, &dst->serverTimestamp);
  448. retval |= UA_DateTime_copy(&src->sourceTimestamp, &dst->sourceTimestamp);
  449. retval |= UA_Variant_copy(&src->value, &dst->value);
  450. dst->serverPicoseconds = src->serverPicoseconds;
  451. dst->sourcePicoseconds = src->sourcePicoseconds;
  452. dst->status = src->status;
  453. if(retval) {
  454. UA_DataValue_deleteMembers(dst);
  455. UA_DataValue_init(dst);
  456. }
  457. return retval;
  458. }
  459. /* Variant */
  460. UA_TYPE_NEW_DEFAULT(UA_Variant)
  461. UA_TYPE_DELETE_DEFAULT(UA_Variant)
  462. void UA_Variant_init(UA_Variant *p) {
  463. p->storageType = UA_VARIANT_DATA;
  464. p->arrayLength = -1;
  465. p->data = UA_NULL;
  466. p->arrayDimensions = UA_NULL;
  467. p->arrayDimensionsSize = -1;
  468. p->type = &UA_TYPES[UA_TYPES_BOOLEAN];
  469. }
  470. void UA_Variant_deleteMembers(UA_Variant *p) {
  471. if(p->storageType != UA_VARIANT_DATA)
  472. return;
  473. if(p->data) {
  474. if(p->arrayLength == -1)
  475. p->arrayLength = 1;
  476. UA_Array_delete(p->data, p->type, p->arrayLength);
  477. p->data = UA_NULL;
  478. p->arrayLength = -1;
  479. }
  480. if(p->arrayDimensions) {
  481. UA_free(p->arrayDimensions);
  482. p->arrayDimensions = UA_NULL;
  483. }
  484. }
  485. UA_StatusCode UA_Variant_copy(UA_Variant const *src, UA_Variant *dst) {
  486. UA_Variant_init(dst);
  487. UA_Int32 tmp = src->arrayLength;
  488. if(src->arrayLength == -1 && src->data)
  489. tmp = 1;
  490. UA_StatusCode retval = UA_Array_copy(src->data, &dst->data, src->type, tmp);
  491. if(retval != UA_STATUSCODE_GOOD) {
  492. UA_Variant_deleteMembers(dst);
  493. UA_Variant_init(dst);
  494. return retval;
  495. }
  496. dst->arrayLength = src->arrayLength;
  497. dst->type = src->type;
  498. dst->storageType = UA_VARIANT_DATA;
  499. if(src->arrayDimensions) {
  500. retval |= UA_Array_copy(src->arrayDimensions, (void **)&dst->arrayDimensions,
  501. &UA_TYPES[UA_TYPES_INT32], src->arrayDimensionsSize);
  502. if(retval != UA_STATUSCODE_GOOD) {
  503. UA_Variant_deleteMembers(dst);
  504. UA_Variant_init(dst);
  505. return retval;
  506. }
  507. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  508. }
  509. return retval;
  510. }
  511. UA_Boolean UA_Variant_isScalar(UA_Variant *v) {
  512. return (v->data != UA_NULL && v->arrayLength == -1);
  513. }
  514. /**
  515. * Tests if a range is compatible with a variant. If yes, the following values are set:
  516. * - total: how many elements are indicated by the range
  517. * - block_size: how big is each contiguous block of elements in the variant denoted by the range
  518. * - block_distance: how many elements are between the blocks (beginning to beginning)
  519. * - first_elem: where does the first block begin
  520. */
  521. static UA_StatusCode
  522. testRangeWithVariant(const UA_Variant *v, const UA_NumericRange range, size_t *total,
  523. size_t *block_size, size_t *block_distance, size_t *first_elem)
  524. {
  525. /* Test the integrity of the source variant dimensions */
  526. UA_Int32 dims_count = 1;
  527. const UA_Int32 *dims = &v->arrayLength; // default: the array has only one dimension
  528. if(v->arrayDimensionsSize > 0) {
  529. dims_count = v->arrayDimensionsSize;
  530. dims = v->arrayDimensions;
  531. UA_Int32 elements = 1;
  532. for(UA_Int32 i = 0; i < dims_count; i++)
  533. elements *= dims[i];
  534. if(elements != v->arrayLength)
  535. return UA_STATUSCODE_BADINTERNALERROR;
  536. }
  537. /* Test the integrity of the range */
  538. size_t count = 1;
  539. if(range.dimensionsSize != dims_count)
  540. return UA_STATUSCODE_BADINTERNALERROR;
  541. for(UA_Int32 i = 0; i < dims_count; i++) {
  542. if(range.dimensions[i].min > range.dimensions[i].max)
  543. return UA_STATUSCODE_BADINDEXRANGEINVALID;
  544. if(range.dimensions[i].max > (UA_UInt32)*(dims+i))
  545. return UA_STATUSCODE_BADINDEXRANGENODATA;
  546. count *= (range.dimensions[i].max - range.dimensions[i].min) + 1;
  547. }
  548. /* Compute the block size and the position of the first element */
  549. size_t bs = 0;
  550. size_t bd = 0;
  551. size_t fe = 0;
  552. size_t running_dimssize = 1; // elements per block of dimensions k to k_max
  553. UA_Boolean found_contiguous = UA_FALSE;
  554. for(UA_Int32 k = dims_count - 1; k >= 0; k--) {
  555. if(!found_contiguous && (range.dimensions[k].min != 0 ||
  556. range.dimensions[k].max + 1 != (UA_UInt32)dims[k])) {
  557. found_contiguous = UA_TRUE;
  558. bs = (range.dimensions[k].max - range.dimensions[k].min + 1) * running_dimssize;
  559. bd = dims[k] * running_dimssize;
  560. }
  561. fe += running_dimssize * range.dimensions[k].min;
  562. running_dimssize *= dims[k];
  563. }
  564. *total = count;
  565. *block_size = bs;
  566. *block_distance = bd;
  567. *first_elem = fe;
  568. return UA_STATUSCODE_GOOD;
  569. }
  570. UA_StatusCode UA_Variant_copyRange(const UA_Variant *src, UA_Variant *dst, const UA_NumericRange range) {
  571. size_t count, block_size, block_distance, first_elem;
  572. UA_StatusCode retval = testRangeWithVariant(src, range, &count, &block_size, &block_distance, &first_elem);
  573. if(retval != UA_STATUSCODE_GOOD)
  574. return retval;
  575. UA_Variant_init(dst);
  576. size_t elem_size = src->type->memSize;
  577. dst->data = UA_malloc(elem_size * count);
  578. if(!dst->data)
  579. return UA_STATUSCODE_BADOUTOFMEMORY;
  580. /* Copy the range */
  581. size_t block_count = count / block_size;
  582. uintptr_t nextdst = (uintptr_t)dst->data;
  583. uintptr_t nextsrc = (uintptr_t)src->data + (elem_size * first_elem);
  584. if(src->type->fixedSize) {
  585. for(size_t i = 0; i < block_count; i++) {
  586. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  587. nextdst += block_size * elem_size;
  588. nextsrc += block_distance * elem_size;
  589. }
  590. } else {
  591. for(size_t i = 0; i < block_count; i++) {
  592. for(size_t j = 0; j < block_size && retval == UA_STATUSCODE_GOOD; j++) {
  593. retval = UA_copy((const void*)nextsrc, (void*)nextdst, src->type);
  594. nextdst += elem_size;
  595. nextsrc += elem_size;
  596. }
  597. nextsrc += (block_distance - block_size) * elem_size;
  598. }
  599. if(retval != UA_STATUSCODE_GOOD) {
  600. size_t copied = ((nextdst - elem_size) - (uintptr_t)dst->data) / elem_size;
  601. UA_Array_delete(dst->data, src->type, copied);
  602. return retval;
  603. }
  604. }
  605. /* Copy the range dimensions*/
  606. if(src->arrayDimensionsSize > 0) {
  607. dst->arrayDimensions = UA_malloc(sizeof(UA_Int32) * src->arrayDimensionsSize);
  608. if(!dst->arrayDimensions) {
  609. UA_Array_delete(dst->data, src->type, count);
  610. return UA_STATUSCODE_BADOUTOFMEMORY;
  611. }
  612. for(UA_Int32 k = 0; k < src->arrayDimensionsSize; k++)
  613. dst->arrayDimensions[k] = range.dimensions[k].max - range.dimensions[k].min + 1;
  614. dst->arrayDimensionsSize = src->arrayDimensionsSize;
  615. }
  616. dst->arrayLength = count;
  617. dst->type = src->type;
  618. return UA_STATUSCODE_GOOD;
  619. }
  620. UA_StatusCode UA_Variant_setRange(UA_Variant *v, void *data, const UA_NumericRange range) {
  621. size_t count, block_size, block_distance, first_elem;
  622. UA_StatusCode retval = testRangeWithVariant(v, range, &count, &block_size, &block_distance, &first_elem);
  623. if(retval != UA_STATUSCODE_GOOD)
  624. return retval;
  625. size_t block_count = count / block_size;
  626. size_t elem_size = v->type->memSize;
  627. uintptr_t nextdst = (uintptr_t)v->data + (first_elem * elem_size);
  628. uintptr_t nextsrc = (uintptr_t)data;
  629. if(v->type->fixedSize) {
  630. for(size_t i = 0; i < block_count; i++) {
  631. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  632. nextdst += block_size * elem_size;
  633. nextsrc += block_distance * elem_size;
  634. }
  635. } else {
  636. for(size_t i = 0; i < block_count; i++) {
  637. for(size_t j = 0; j < block_size; j++) {
  638. UA_deleteMembers((void*)nextdst, v->type);
  639. nextdst += elem_size;
  640. }
  641. nextdst -= block_size * elem_size;
  642. memcpy((void*)nextdst, (void*)nextsrc, elem_size * block_size);
  643. nextdst += block_size * elem_size;
  644. nextsrc += block_distance * elem_size;
  645. }
  646. }
  647. return UA_STATUSCODE_GOOD;
  648. }
  649. UA_StatusCode UA_Variant_setCopyRange(const UA_Variant *src, UA_Variant *dst, void *data,
  650. const UA_NumericRange range) {
  651. // todo: don't copy the entire variant but only the retained parts
  652. UA_StatusCode retval = UA_Variant_copy(src, dst);
  653. if(retval != UA_STATUSCODE_GOOD)
  654. return retval;
  655. retval = UA_Variant_setRange(dst, data, range);
  656. if(retval != UA_STATUSCODE_GOOD) {
  657. UA_Variant_deleteMembers(dst);
  658. return retval;
  659. }
  660. return UA_STATUSCODE_GOOD;
  661. }
  662. UA_StatusCode UA_Variant_setScalar(UA_Variant *v, void *p, const UA_DataType *type) {
  663. return UA_Variant_setArray(v, p, -1, type);
  664. }
  665. UA_StatusCode UA_Variant_setScalarCopy(UA_Variant *v, const void *p, const UA_DataType *type) {
  666. void *new = UA_malloc(type->memSize);
  667. if(!new)
  668. return UA_STATUSCODE_BADOUTOFMEMORY;
  669. UA_StatusCode retval = UA_copy(p, new, type);
  670. if(retval != UA_STATUSCODE_GOOD) {
  671. UA_delete(new, type);
  672. return retval;
  673. }
  674. return UA_Variant_setArray(v, new, -1, type);
  675. }
  676. UA_StatusCode UA_Variant_setArray(UA_Variant *v, void *array, UA_Int32 noElements,
  677. const UA_DataType *type) {
  678. v->type = type;
  679. v->arrayLength = noElements;
  680. v->data = array;
  681. return UA_STATUSCODE_GOOD;
  682. }
  683. UA_StatusCode UA_Variant_setArrayCopy(UA_Variant *v, const void *array, UA_Int32 noElements,
  684. const UA_DataType *type) {
  685. void *new;
  686. UA_StatusCode retval = UA_Array_copy(array, &new, type, noElements);
  687. if(retval != UA_STATUSCODE_GOOD)
  688. return retval;
  689. return UA_Variant_setArray(v, new, noElements, type);
  690. }
  691. /* DiagnosticInfo */
  692. UA_TYPE_NEW_DEFAULT(UA_DiagnosticInfo)
  693. UA_TYPE_DELETE_DEFAULT(UA_DiagnosticInfo)
  694. void UA_DiagnosticInfo_deleteMembers(UA_DiagnosticInfo *p) {
  695. UA_String_deleteMembers(&p->additionalInfo);
  696. if(p->hasInnerDiagnosticInfo && p->innerDiagnosticInfo) {
  697. UA_DiagnosticInfo_delete(p->innerDiagnosticInfo);
  698. p->innerDiagnosticInfo = UA_NULL;
  699. }
  700. }
  701. void UA_DiagnosticInfo_init(UA_DiagnosticInfo *p) {
  702. *((UA_Byte*)p) = 0; // zero out the bitfield
  703. p->symbolicId = 0;
  704. p->namespaceUri = 0;
  705. p->localizedText = 0;
  706. p->locale = 0;
  707. UA_String_init(&p->additionalInfo);
  708. p->innerDiagnosticInfo = UA_NULL;
  709. UA_StatusCode_init(&p->innerStatusCode);
  710. }
  711. UA_StatusCode UA_DiagnosticInfo_copy(UA_DiagnosticInfo const *src, UA_DiagnosticInfo *dst) {
  712. UA_DiagnosticInfo_init(dst);
  713. *((UA_Byte*)dst) = *((const UA_Byte*)src); // the bitfield
  714. dst->symbolicId = src->symbolicId;
  715. dst->namespaceUri = src->namespaceUri;
  716. dst->localizedText = src->localizedText;
  717. dst->locale = src->locale;
  718. dst->innerStatusCode = src->innerStatusCode;
  719. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  720. if(src->hasAdditionalInfo)
  721. retval = UA_String_copy(&src->additionalInfo, &dst->additionalInfo);
  722. if(src->hasInnerDiagnosticInfo && src->innerDiagnosticInfo) {
  723. if((dst->innerDiagnosticInfo = UA_malloc(sizeof(UA_DiagnosticInfo)))) {
  724. retval |= UA_DiagnosticInfo_copy(src->innerDiagnosticInfo, dst->innerDiagnosticInfo);
  725. dst->hasInnerDiagnosticInfo = src->hasInnerDiagnosticInfo;
  726. }
  727. else
  728. retval |= UA_STATUSCODE_BADOUTOFMEMORY;
  729. }
  730. if(retval) {
  731. UA_DiagnosticInfo_deleteMembers(dst);
  732. UA_DiagnosticInfo_init(dst);
  733. }
  734. return retval;
  735. }
  736. /*******************/
  737. /* Structure Types */
  738. /*******************/
  739. void UA_init(void *p, const UA_DataType *dataType) {
  740. /* Do not check if the index is a builtin-type here. Builtins will be called
  741. with their very own _init functions normally. In the off case, that the
  742. generic function is called with the index of a builtin, their layout
  743. contains a single member of the builtin type, that will be inited in the
  744. for loop. */
  745. uintptr_t ptr = (uintptr_t)p;
  746. UA_Byte membersSize = dataType->membersSize;
  747. for(size_t i=0;i<membersSize; i++) {
  748. const UA_DataTypeMember *member = &dataType->members[i];
  749. if(member->isArray) {
  750. /* Padding contains bit-magic to split into padding before and after
  751. the length integer */
  752. ptr += (member->padding >> 3);
  753. *((UA_Int32*)ptr) = -1;
  754. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  755. *((void**)ptr) = UA_NULL;
  756. ptr += sizeof(void*);
  757. continue;
  758. }
  759. ptr += member->padding;
  760. if(!member->namespaceZero) {
  761. // pointer arithmetic
  762. const UA_DataType *memberType = dataType - dataType->typeIndex + member->memberTypeIndex;
  763. UA_init((void*)ptr, memberType);
  764. ptr += memberType->memSize;
  765. continue;
  766. }
  767. switch(member->memberTypeIndex) {
  768. case UA_TYPES_BOOLEAN:
  769. case UA_TYPES_SBYTE:
  770. case UA_TYPES_BYTE:
  771. *(UA_Byte*)ptr = 0;
  772. break;
  773. case UA_TYPES_INT16:
  774. case UA_TYPES_UINT16:
  775. *(UA_Int16*)ptr = 0;
  776. break;
  777. case UA_TYPES_INT32:
  778. case UA_TYPES_UINT32:
  779. case UA_TYPES_STATUSCODE:
  780. case UA_TYPES_FLOAT:
  781. *(UA_Int32*)ptr = 0;
  782. break;
  783. case UA_TYPES_INT64:
  784. case UA_TYPES_UINT64:
  785. case UA_TYPES_DOUBLE:
  786. case UA_TYPES_DATETIME:
  787. *(UA_Int64*)ptr = 0;
  788. break;
  789. case UA_TYPES_GUID:
  790. UA_Guid_init((UA_Guid*)ptr);
  791. break;
  792. case UA_TYPES_NODEID:
  793. UA_NodeId_init((UA_NodeId*)ptr);
  794. break;
  795. case UA_TYPES_EXPANDEDNODEID:
  796. UA_ExpandedNodeId_init((UA_ExpandedNodeId*)ptr);
  797. break;
  798. case UA_TYPES_LOCALIZEDTEXT:
  799. UA_LocalizedText_init((UA_LocalizedText*)ptr);
  800. break;
  801. case UA_TYPES_EXTENSIONOBJECT:
  802. UA_ExtensionObject_init((UA_ExtensionObject*)ptr);
  803. break;
  804. case UA_TYPES_DATAVALUE:
  805. UA_DataValue_init((UA_DataValue*)ptr);
  806. break;
  807. case UA_TYPES_VARIANT:
  808. UA_Variant_init((UA_Variant*)ptr);
  809. break;
  810. case UA_TYPES_DIAGNOSTICINFO:
  811. UA_DiagnosticInfo_init((UA_DiagnosticInfo*)ptr);
  812. break;
  813. default:
  814. // QualifiedName, LocalizedText and strings are treated as structures, also
  815. UA_init((void*)ptr, &UA_TYPES[member->memberTypeIndex]);
  816. }
  817. ptr += UA_TYPES[member->memberTypeIndex].memSize;
  818. }
  819. }
  820. void * UA_new(const UA_DataType *dataType) {
  821. void *p = UA_malloc(dataType->memSize);
  822. if(p)
  823. UA_init(p, dataType);
  824. return p;
  825. }
  826. UA_StatusCode UA_copy(const void *src, void *dst, const UA_DataType *dataType) {
  827. if(dataType->fixedSize) {
  828. memcpy(dst, src, dataType->memSize);
  829. return UA_STATUSCODE_GOOD;
  830. }
  831. UA_init(dst, dataType);
  832. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  833. uintptr_t ptrs = (uintptr_t)src;
  834. uintptr_t ptrd = (uintptr_t)dst;
  835. UA_Byte membersSize = dataType->membersSize;
  836. for(size_t i=0;i<membersSize; i++) {
  837. const UA_DataTypeMember *member = &dataType->members[i];
  838. const UA_DataType *memberType;
  839. if(member->namespaceZero)
  840. memberType = &UA_TYPES[member->memberTypeIndex];
  841. else
  842. memberType = dataType - dataType->typeIndex + member->memberTypeIndex;
  843. if(member->isArray) {
  844. ptrs += (member->padding >> 3);
  845. ptrd += (member->padding >> 3);
  846. UA_Int32 *dstNoElements = (UA_Int32*)ptrd;
  847. const UA_Int32 noElements = *((const UA_Int32*)ptrs);
  848. ptrs += sizeof(UA_Int32) + (member->padding & 0x07);
  849. ptrd += sizeof(UA_Int32) + (member->padding & 0x07);
  850. retval = UA_Array_copy(*(void* const*)ptrs, (void**)ptrd, memberType, noElements);
  851. if(retval != UA_STATUSCODE_GOOD) {
  852. UA_deleteMembers(dst, dataType);
  853. UA_init(dst, dataType);
  854. return retval;
  855. }
  856. *dstNoElements = noElements;
  857. ptrs += sizeof(void*);
  858. ptrd += sizeof(void*);
  859. continue;
  860. }
  861. ptrs += member->padding;
  862. ptrd += member->padding;
  863. if(!member->namespaceZero) {
  864. retval = UA_copy((const void*)ptrs, (void*)ptrd, memberType);
  865. if(retval != UA_STATUSCODE_GOOD) {
  866. UA_deleteMembers(dst, dataType);
  867. UA_init(dst, dataType);
  868. return retval;
  869. }
  870. ptrs += memberType->memSize;
  871. ptrd += memberType->memSize;
  872. continue;
  873. }
  874. switch(member->memberTypeIndex) {
  875. case UA_TYPES_BOOLEAN:
  876. case UA_TYPES_SBYTE:
  877. case UA_TYPES_BYTE:
  878. *((UA_Byte*)ptrd) = *((const UA_Byte*)ptrs);
  879. break;
  880. case UA_TYPES_INT16:
  881. case UA_TYPES_UINT16:
  882. *((UA_Int16*)ptrd) = *((const UA_Byte*)ptrs);
  883. break;
  884. case UA_TYPES_INT32:
  885. case UA_TYPES_UINT32:
  886. case UA_TYPES_STATUSCODE:
  887. case UA_TYPES_FLOAT:
  888. *((UA_Int32*)ptrd) = *((const UA_Int32*)ptrs);
  889. break;
  890. case UA_TYPES_INT64:
  891. case UA_TYPES_UINT64:
  892. case UA_TYPES_DOUBLE:
  893. case UA_TYPES_DATETIME:
  894. *((UA_Int64*)ptrd) = *((const UA_Int64*)ptrs);
  895. break;
  896. case UA_TYPES_GUID:
  897. *((UA_Guid*)ptrd) = *((const UA_Guid*)ptrs);
  898. break;
  899. case UA_TYPES_NODEID:
  900. retval |= UA_NodeId_copy((const UA_NodeId*)ptrs, (UA_NodeId*)ptrd);
  901. break;
  902. case UA_TYPES_EXPANDEDNODEID:
  903. retval |= UA_ExpandedNodeId_copy((const UA_ExpandedNodeId*)ptrs, (UA_ExpandedNodeId*)ptrd);
  904. break;
  905. case UA_TYPES_LOCALIZEDTEXT:
  906. retval |= UA_LocalizedText_copy((const UA_LocalizedText*)ptrs, (UA_LocalizedText*)ptrd);
  907. break;
  908. case UA_TYPES_EXTENSIONOBJECT:
  909. retval |= UA_ExtensionObject_copy((const UA_ExtensionObject*)ptrs, (UA_ExtensionObject*)ptrd);
  910. break;
  911. case UA_TYPES_DATAVALUE:
  912. retval |= UA_DataValue_copy((const UA_DataValue*)ptrs, (UA_DataValue*)ptrd);
  913. break;
  914. case UA_TYPES_VARIANT:
  915. retval |= UA_Variant_copy((const UA_Variant*)ptrs, (UA_Variant*)ptrd);
  916. break;
  917. case UA_TYPES_DIAGNOSTICINFO:
  918. retval |= UA_DiagnosticInfo_copy((const UA_DiagnosticInfo*)ptrs, (UA_DiagnosticInfo*)ptrd);
  919. break;
  920. default:
  921. // QualifiedName, LocalizedText and strings are treated as structures, also
  922. retval |= UA_copy((const void *)ptrs, (void*)ptrd, memberType);
  923. }
  924. ptrs += memberType->memSize;
  925. ptrd += memberType->memSize;
  926. }
  927. if(retval != UA_STATUSCODE_GOOD) {
  928. UA_deleteMembers(dst, dataType);
  929. UA_init(dst, dataType);
  930. }
  931. return retval;
  932. }
  933. void UA_deleteMembers(void *p, const UA_DataType *dataType) {
  934. uintptr_t ptr = (uintptr_t)p;
  935. if(dataType->fixedSize)
  936. return;
  937. UA_Byte membersSize = dataType->membersSize;
  938. for(size_t i=0;i<membersSize; i++) {
  939. const UA_DataTypeMember *member = &dataType->members[i];
  940. const UA_DataType *memberType;
  941. if(member->namespaceZero)
  942. memberType = &UA_TYPES[member->memberTypeIndex];
  943. else
  944. memberType = dataType - dataType->typeIndex + member->memberTypeIndex;
  945. if(member->isArray) {
  946. ptr += (member->padding >> 3);
  947. UA_Int32 noElements = *((UA_Int32*)ptr);
  948. ptr += sizeof(UA_Int32) + (member->padding & 0x07);
  949. UA_Array_delete(*(void**)ptr, memberType, noElements);
  950. *(void**)ptr = UA_NULL;
  951. ptr += sizeof(void*);
  952. continue;
  953. }
  954. ptr += member->padding;
  955. if(!member->namespaceZero) {
  956. UA_deleteMembers((void*)ptr, memberType);
  957. ptr += memberType->memSize;
  958. continue;
  959. }
  960. switch(member->memberTypeIndex) {
  961. case UA_TYPES_BOOLEAN:
  962. case UA_TYPES_SBYTE:
  963. case UA_TYPES_BYTE:
  964. case UA_TYPES_INT16:
  965. case UA_TYPES_UINT16:
  966. case UA_TYPES_INT32:
  967. case UA_TYPES_UINT32:
  968. case UA_TYPES_STATUSCODE:
  969. case UA_TYPES_FLOAT:
  970. case UA_TYPES_INT64:
  971. case UA_TYPES_UINT64:
  972. case UA_TYPES_DOUBLE:
  973. case UA_TYPES_DATETIME:
  974. case UA_TYPES_GUID:
  975. break;
  976. case UA_TYPES_NODEID:
  977. UA_NodeId_deleteMembers((UA_NodeId*)ptr);
  978. break;
  979. case UA_TYPES_EXPANDEDNODEID:
  980. UA_ExpandedNodeId_deleteMembers((UA_ExpandedNodeId*)ptr);
  981. break;
  982. case UA_TYPES_LOCALIZEDTEXT:
  983. UA_LocalizedText_deleteMembers((UA_LocalizedText*)ptr);
  984. break;
  985. case UA_TYPES_EXTENSIONOBJECT:
  986. UA_ExtensionObject_deleteMembers((UA_ExtensionObject*)ptr);
  987. break;
  988. case UA_TYPES_DATAVALUE:
  989. UA_DataValue_deleteMembers((UA_DataValue*)ptr);
  990. break;
  991. case UA_TYPES_VARIANT:
  992. UA_Variant_deleteMembers((UA_Variant*)ptr);
  993. break;
  994. case UA_TYPES_DIAGNOSTICINFO:
  995. UA_DiagnosticInfo_deleteMembers((UA_DiagnosticInfo*)ptr);
  996. break;
  997. default:
  998. // QualifiedName, LocalizedText and strings are treated as structures, also
  999. UA_deleteMembers((void*)ptr, memberType);
  1000. }
  1001. ptr += memberType->memSize;
  1002. }
  1003. }
  1004. void UA_delete(void *p, const UA_DataType *dataType) {
  1005. UA_deleteMembers(p, dataType);
  1006. UA_free(p);
  1007. }
  1008. /******************/
  1009. /* Array Handling */
  1010. /******************/
  1011. void* UA_Array_new(const UA_DataType *dataType, UA_Int32 noElements) {
  1012. if(noElements <= 0)
  1013. return UA_NULL;
  1014. if((UA_Int32)dataType->memSize * noElements < 0 || dataType->memSize * noElements > MAX_ARRAY_SIZE )
  1015. return UA_NULL;
  1016. if(dataType->fixedSize)
  1017. return calloc(noElements, dataType->memSize);
  1018. void *p = malloc(dataType->memSize * (size_t)noElements);
  1019. if(!p)
  1020. return p;
  1021. uintptr_t ptr = (uintptr_t)p;
  1022. for(int i = 0; i<noElements; i++) {
  1023. UA_init((void*)ptr, dataType);
  1024. ptr += dataType->memSize;
  1025. }
  1026. return p;
  1027. }
  1028. UA_StatusCode UA_Array_copy(const void *src, void **dst, const UA_DataType *dataType, UA_Int32 noElements) {
  1029. if(noElements <= 0) {
  1030. *dst = UA_NULL;
  1031. return UA_STATUSCODE_GOOD;
  1032. }
  1033. if(!(*dst = UA_malloc((size_t)noElements * dataType->memSize)))
  1034. return UA_STATUSCODE_BADOUTOFMEMORY;
  1035. if(dataType->fixedSize) {
  1036. memcpy(*dst, src, dataType->memSize * (size_t)noElements);
  1037. return UA_STATUSCODE_GOOD;
  1038. }
  1039. uintptr_t ptrs = (uintptr_t)src;
  1040. uintptr_t ptrd = (uintptr_t)*dst;
  1041. UA_StatusCode retval = UA_STATUSCODE_GOOD;
  1042. for(int i=0;i<noElements; i++) {
  1043. retval = UA_copy((void*)ptrs, (void*)ptrd, dataType);
  1044. ptrs += dataType->memSize;
  1045. ptrd += dataType->memSize;
  1046. }
  1047. if(retval != UA_STATUSCODE_GOOD)
  1048. UA_Array_delete(*dst, dataType, noElements);
  1049. return retval;
  1050. }
  1051. void UA_Array_delete(void *p, const UA_DataType *dataType, UA_Int32 noElements) {
  1052. if(!dataType->fixedSize) {
  1053. uintptr_t ptr = (uintptr_t)p;
  1054. for(UA_Int32 i = 0; i<noElements; i++) {
  1055. UA_deleteMembers((void*)ptr, dataType);
  1056. ptr += dataType->memSize;
  1057. }
  1058. }
  1059. UA_free(p);
  1060. }