ua_types.c 33 KB

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