ua_types.c 37 KB

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